CML: A higher concurrent language
PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
A small calculus for concurrent objects
OOPSLA/ECOOP '90 Proceedings of the workshop on Object-based concurrent programming
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, II
Information and Computation
Full abstraction in the lazy lambda calculus
Information and Computation
Lambda-calculi for (strict) parallel functions
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
Combining the typed &lgr;-calculus with CCS
Proof, language, and interaction
The next 700 programming languages
Communications of the ACM
Typing the Use of Resources in a Concurrent Calculus (Extended Abstract)
ASIAN '97 Proceedings of the Third Asian Computing Science Conference on Advances in Computing Science
On Asynchrony in Name-Passing Calculi
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
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 Bisimulations for the Asynchronous pi-Calculus
CONCUR '96 Proceedings of the 7th 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
Graph Types for Monadic Mobile Processes
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
An Asynchronous Model of Locality, Failurem and Process Mobility
COORDINATION '97 Proceedings of the Second International Conference on Coordination Languages and Models
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
Towards a Lambda-Calculus for Concurrent and Communicating Systems
TAPSOFT '89/CAAP '89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming
Continuation Semantics in Typed Lambda-Calculi (Summary)
Proceedings of the Conference on Logic of Programs
Journal of Functional Programming
Mobile Processes: A Commented Bibliography
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
An Interpretation of Typed Concurrent Objects in the Blue Calculus
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Mobile processes: a commented bibliography
Modeling and verification of parallel processes
A Theory of Bisimulation for a Fragment of Concurrent ML with Local Names
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
A theory of bisimulation for a fragment of concurrent ML with local names
Theoretical Computer Science
An Algebra of Behavioural Types
Information and Computation
| Hi-index | 0.00 |
We introduce a calculus which is a direct extension of both theλ and the π calculi. We give a simple type system for it,that encompasses both Curry‘s type inference for theλ-calculus, and Milner‘s sorting for the π-calculus asparticular cases of typing. We observe that the various continuationpassing style transformations for λ-terms, written in ourcalculus, actually correspond to encodings already given by Milner andothers for evaluation strategies of λ-terms into theπ-calculus. Furthermore, the associated sortings correspond towell-known double negation translations on types. Finally we providean adequate CPS transform from our calculus to theπ-calculus. This shows that the latter may be regarded as an“assembly language”, while our calculus seems to provide a betterprogramming notation for higher-order concurrency. We conclude bydiscussing some alternative design decisions.