From CML to its process algebra
From MaRDI portal
Publication:672132
DOI10.1016/0304-3975(95)00017-8zbMath0873.68131MaRDI QIDQ672132
Flemming Nielson, Hanne Riis Nielson
Publication date: 27 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(95)00017-8
operational semantics; communication behaviours of CML programs; concurrent programming languages; semantics of a process algebra; Standard ML
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68N15: Theory of programming languages
68Q55: Semantics in the theory of computing
68N17: Logic programming
Related Items
A behavioural theory of first-order CML, Primitives for authentication in process algebras., Language-based performance prediction for distributed and mobile systems, Parameterised notions of computation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Plain CHOCS. A second generation calculus for higher order processes
- A syntactic approach to type soundness
- A theory of bisimulation for the \(\pi\)-calculus
- A new type assignment for λ-terms
- Two-Level Functional Languages
- The fork calculus
- A semantic basis for Quest
- A fully abstract denotational semantics for the calculus of higher-order communicating systems