A theory of weak bisimulation for core CML

DOI10.1145/232627.232649MaRDI QIDQ2817698zbMATH OpenOpenAlexFDO

Authors William Ferreira, Alan Jeffrey, Matthew Hennessy

Publication date 1 September 2016

Published in Proceedings of the first ACM SIGPLAN international conference on Functional programming - ICFP '96 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/232627.232649

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• A theory of weak bisimulation for Core CML
• A theory of bisimulation for a fragment of concurrent ML with local names
• Semantics for core Concurrent ML using computation types
• From CML to its process algebra
• scientific article; zbMATH DE number 1231557

Cited in

(10)

• Full abstractness for a functional/concurrent language with higher-order value-passing
• Process calculus based upon evaluation to committed form
• A behavioural theory of first-order CML
• Asynchronous process calculi: The first- and higher-order paradigms
• A theory of bisimulation for a fragment of concurrent ML with local names
• Semantics for core Concurrent ML using computation types
• A theory of weak bisimulation for Core CML
• A theory of core fudgets
• From rewrite rules to bisimulation congruences
• From CML to its process algebra

This page was built for publication: A theory of weak bisimulation for core CML

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817698)