A threaded/flow approach to reconfigurable distributed systems and service primitives architectures
SIGCOMM '87 Proceedings of the ACM workshop on Frontiers in computer communications technology
O.LISP theoretical basis and description
ACM SIGPLAN Notices
Observable sequentiality and full abstraction
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A unified language processing methodology
Theoretical Computer Science
Combinators for Paraconsistent Attitudes
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
Invited Talk: Pointwise Relational Programming
AMAST '00 Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology
TYPES '98 Selected papers from the International Workshop on Types for Proofs and Programs
Explicit Substitutions and Programming Languages
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
A relational account of call-by-value sequentiality
Information and Computation - Special issue: LICS'97
Journal of Functional Programming
A syntactic correspondence between context-sensitive calculi and abstract machines
Theoretical Computer Science
Stable computational semantics of conflict-free rewrite systems (partial orders with duplication)
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Electronic Notes in Theoretical Computer Science (ENTCS)
Expression reduction systems and extensions: an overview
Processes, Terms and Cycles
Fundamenta Informaticae
Lambda Abstraction Algebras: Coordinatizing Models of Lambda Calculus
Fundamenta Informaticae
Lambda Abstraction Algebras: Coordinatizing Models of Lambda Calculus
Fundamenta Informaticae
Categorical Combinators With Explicit Products
Fundamenta Informaticae
| Hi-index | 0.00 |