A Semantics for ML Concurrency Primitives

Dave Berry, Robin Milner, David N. Turner

Research output: Chapter in Book/Report/Conference proceedingConference contribution


We present a set of concurrency primitives for Standard ML. We define these by giving the transitional semantics of a simple language. We prove that our semantics preserves the expected behaviour of sequential programs. We also show that we can define stores as processes, such that the representation has the same behaviour as a direct definition. These proofs are the first steps towards integrating our semantics with the full definition of Standard ML.
Original languageEnglish
Title of host publicationPOPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Number of pages11
Publication statusPublished - Feb 1992


Dive into the research topics of 'A Semantics for ML Concurrency Primitives'. Together they form a unique fingerprint.

Cite this