Abstract:
We enrich a typed-calculus with pairs by two communication primitives for sending and receiving typed values along typed channels. The resulting language is a conservative extension of the underlying-calculus which then allows strongly typed non-terminating computations. 1
Citations
|
413
|
The chemical abstract machine
– Berry, Boudol
- 1992
|
|
316
|
The polyadic -calculus: a tutorial
– Milner
- 1991
|
|
148
|
Type systems for programming languages
– Mitchell
- 1990
|
|
125
|
FACILE, a symmetric integration of concurrent and functional programming
– Giacalone, Mishra, et al.
- 1989
|
|
97
|
Calculi for Higher Order Communicating Systems
– Thomsen
- 1990
|
|
60
|
Towards an object calculus
– Nierstrasz
- 1992
|
|
59
|
A calculus of mobile processes, part I/II
– Milner, Parrow, et al.
- 1992
|
|
58
|
Towards a lambda calculus for concurrent and communicating systems
– Boudol
- 1989
|
|
23
|
PFL: A Functional Language for Parallel Programming
– Holmström
- 1983
|
|
20
|
A theory of communicating processes with value-passing
– Hennessy, Ing'olfsd'ottir
- 1993
|
|
12
|
Functional Programs as Reconfigurable Networks of Communicating Processes
– LETH
- 1991
|
|
10
|
A Domain-theoretic Model for a Higher-order Process Calculus", LNCS
– Jagadeesan, Panangaden
- 1990
|
|
10
|
The typed -calculus with first-class processes
– Nielson
- 1989
|
|
6
|
Semantic Models for CCS with Values
– Ing'olfsd'ottir, Thomsen
- 1991
|
|
4
|
Expressing Mobility in Process Algebra
– Sangiorgi
- 1993
|
|
1
|
A Chemical Abstract Machine for a Calculus of Communicating Functions
– Nestmann, Teleki
- 1992
|
|
1
|
Towards a Symmetric Integration of Concurrent and Functional Programming
– Prasad
- 1991
|
|
1
|
Untersuchungen zur Semantik von Hybrid-Sprachen auf der Basis der Chemical Abstract Machine
– Teleki
- 1993
|
