A behavioural theory of first-order CML

DOI10.1016/S0304-3975(98)00049-8zbMath0915.68111MaRDI QIDQ1285654

William Ferreira, Matthew C. B. Hennessy

Publication date: 28 April 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

operational semanticsdenotational modelfull abstractionmonadsCMLtesting semanticsvalues

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Related Items (1)

Notions of bisimulation and congruence formats for SOS with data

Uses Software

• ML
• Facile

Cites Work

• From CML to its process algebra
• Communicating processes with value-passing and assignments
• Notions of computation and monads
• An algebra for process creation
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• A theory of communicating processes with value passing
• Testing equivalences for processes
• Concurrent testing of processes
• A theory of weak bisimulation for core CML
• Towards a semantic theory of CML
• Algebraic laws for nondeterminism and concurrency
• Process Algebra
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A behavioural theory of first-order CML