A Theory of Weak Bisimulation for Core CML

Concurrent ML (CML) is an extension of Standard ML of New Jersey with concurrent features similar to those of process algebra. In this paper, we build upon John Reppy's reduction semantics for CML by constructing a compositional operational semanticsfor a fragment of CML, basedon higherorder process algebra. Using the operational semantics we generalise the notion of weak bisimulation equivalence to build a semantic theory of CML. We give some small examples of proofs about CML expressions, and show that our semantics correspondsto Reppy's up to weak first-order bisimulation.

• Type: Conference
• Year: 1996
• Where: ICFP
• Authors: William Ferreira, Matthew Hennessy, Alan Jeffrey
• Keywords: ICFP 1996, Process Algebra, Programming Languages, Weak Bisimulation Equivalence, Weak First-order Bisimulation