Sciweavers

ICFP
1996
ACM

A Theory of Weak Bisimulation for Core CML

14 years 2 months ago
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.
William Ferreira, Matthew Hennessy, Alan Jeffrey
Added 08 Aug 2010
Updated 08 Aug 2010
Type Conference
Year 1996
Where ICFP
Authors William Ferreira, Matthew Hennessy, Alan Jeffrey
Comments (0)