CML: A higher concurrent language
PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
Compiling with continuations
Selected papers of the Second Workshop on Concurrency and compositionality
A natural semantics for lazy evaluation
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A calculus of mobile processes, I
Information and Computation
Full abstraction in the lazy lambda calculus
Information and Computation
Lambda-calculi for (strict) parallel functions
Information and Computation
The lazy Lambda calculus in a concurrency scenario
Information and Computation
Polymorphic type assignment and CPS conversion
Lisp and Symbolic Computation - Special issue on continuations—part I
The discriminating power of multiplicities in the &lgr;-calculus
Information and Computation
The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
From pi-Calculus to Higher-Order pi-Calculus - and Back
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
FACILE: A Symmetric Integration of Concurrent and Functional Programming
TAPSOFT '89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 2: Advanced Seminar on Foundations of Innovative Software Development II and Colloquium on Current Issues in Programming Languages
Principal Typing Schemes in a Polyadic pi-Calculus
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
On the Expressiveness of Internal Mobility in Name-Passing Calculi
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
A Foundation for Higher-order Concurrent Constraint Programming
CCL '94 Proceedings of the First International Conference on Constraints in Computational Logics
From a Concurrent Lambda-Calculus to the Pi-Calculus
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Continuation Semantics in Typed Lambda-Calculi (Summary)
Proceedings of the Conference on Logic of Programs
Fine-Grained Multithreading with Process Calculi
IEEE Transactions on Computers - Special issue on the parallel architecture and compilation techniques conference
From rewrite rules to bisimulation congruences
Theoretical Computer Science
Continuations, functions and jumps
ACM SIGACT News
Secure Information Flow as Typed Process Behaviour
ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
Suptyping and Locality in Distributed Higher Order Processes (extended abstract)
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Reasoning About Concurrent Systems Using Types
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Locality and Polyadicity in Asynchronous Name-Passing Calculi
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
A Higher-Order Specification of the pi-Calculus
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
An Introduction to Functional Nets
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
From λ to π; or, Rediscovering continuations
Mathematical Structures in Computer Science
On the call-by-value CPS transform and its semantics
Information and Computation
Strong normalisation in the π-calculus
Information and Computation
Journal of Functional Programming
A calculus for reasoning about software composition
Theoretical Computer Science - Formal methods for components and objects
A concurrent lambda calculus with futures
Theoretical Computer Science - Applied semantics
On the Observational Theory of the CPS-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Sequentiality and the π-calculus
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Safe compositional network sketches: formal framework
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
Instant polymorphic type systems for mobile process calculi: just add reduction rules and close
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
| Hi-index | 0.00 |