A theory of weak bisimulation for core CML

Authors:
William Ferreira;Matthew Hennessy;Alan Jeffrey
Affiliations:
University of Sussex;University of Sussex;University of Sussex
Venue:
Proceedings of the first ACM SIGPLAN international conference on Functional programming
Year:
1996

Citing 15
Cited 5

Communicating sequential processes

Communicating sequential processes
Algebraic theory of processes

Algebraic theory of processes
Communication and concurrency

Communication and concurrency
Equality in lazy computation systems

Proceedings of the Fourth Annual Symposium on Logic in computer science
CML: A higher concurrent language

PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
Notions of computation and monads

Information and Computation
An algebra for process creation

Acta Informatica
Semantics of programming languages: structures and techniques

Semantics of programming languages: structures and techniques
A semantics for ML concurrency primitives

POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Higher-order concurrency

Higher-order concurrency
A calculus of mobile processes, I

Information and Computation
A theory of higher order communicating systems

Information and Computation
A Semantic Theory for Concurrent ML

TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
FACILE: A Symmetric Integration of Concurrent and Functional Programming

TAPSOFT '89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 2: Advanced Seminar on Foundations of Innovative Software Development II and Colloquium on Current Issues in Programming Languages
A Fully Abstract Semantics for a Concurrent Functional Language with Monadic Types

LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science

From rewrite rules to bisimulation congruences

Theoretical Computer Science
Erratic fudgets: a semantic theory for an embedded coordination language

Science of Computer Programming - Special issue on coordination languages and architectures
A Synergy Between Model-Checking and Type Inference for the Verification of Value-Passing Higher-Order Processes

AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
Suptyping and Locality in Distributed Higher Order Processes (extended abstract)

CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Erratic Fudgets: A Semantic Theory for an Embedded Coordination Language

COORDINATION '99 Proceedings of the Third International Conference on Coordination Languages and Models

Quantified Score

Hi-index	0.00

Visualization

Abstract

Concurrent ML (CML) is an extension of Standard ML of New Jersey with concurrent features similar to those of process algebra. In this papes 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. We use this to build a semantic theory for CML, based on weak bisimulation equivalence. 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.