Hostname: page-component-586b7cd67f-rdxmf Total loading time: 0 Render date: 2024-11-24T00:49:09.941Z Has data issue: false hasContentIssue false
  • English
  • Français

A theory of weak bisimulation for Core CML

Published online by Cambridge University Press:  01 September 1998

WILLIAM FERREIRA ,
MATTHEW HENNESSY  and
ALAN JEFFREY
WILLIAM FERREIRA
Affiliation:
Computing Laboratory, University of Cambridge, Cambridge, UK
MATTHEW HENNESSY
Affiliation:
School of Cognitive and Computing Sciences, University of Sussex, Brighton, UK
ALAN JEFFREY
Affiliation:
School of Cognitive and Computing Sciences, University of Sussex, Brighton, UK
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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 semantics for a fragment of CML, based on higher-order 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 corresponds to Reppy's up to weak first-order bisimulation.

Type
Research Article
Information
Journal of Functional Programming , Volume 8 , Issue 5 , September 1998 , pp. 447 - 491
Copyright
© 1998 Cambridge University Press
Submit a response

Discussions

No Discussions have been published for this article.