Abstract
We explore the (dynamic) semantics of a simply typed λ-calculus enriched withparallel composition, dynamic channel generation, and input-output communication primitives. The calculus, called the λ∥-calculus, can be regarded as the kernel of concurrent-functional languages such as LCS, CML and Facile, and it can be taken as a basis for the definition of abstract machines, the transformation of programs, and the development of modal specification languages. The main technical contribution of this paper is the proof of adequacy of a compact translation of the λ∥-calculus into the π-calculus.
Originalsprog | Engelsk |
---|---|
Titel | Fundamentals of Computation Theory - 10th International Conference, FCT 1995, Proceedings |
Redaktører | Horst Reichel |
Antal sider | 10 |
Forlag | Springer |
Publikationsdato | 1995 |
Sider | 106-115 |
ISBN (Trykt) | 3540602496, 9783540602491 |
DOI | |
Status | Udgivet - 1995 |
Begivenhed | 10th Conference on Fundamentals of Computation Theory, FCT 1995 - Dresden, Tyskland Varighed: 22 aug. 1995 → 25 aug. 1995 |
Konference
Konference | 10th Conference on Fundamentals of Computation Theory, FCT 1995 |
---|---|
Land/Område | Tyskland |
By | Dresden |
Periode | 22/08/1995 → 25/08/1995 |
Navn | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Vol/bind | 965 |
ISSN | 0302-9743 |
Bibliografisk note
Publisher Copyright:© Springer-Verlag Berlin Heidelberg 1995.