A theory of weak bisimulation for core CML
From MaRDI portal
Publication:2817698
DOI10.1145/232627.232649zbMath1345.68049OpenAlexW2019272371MaRDI QIDQ2817698
Alan Jeffrey, William Ferreira, Matthew C. B. 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
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
From rewrite rules to bisimulation congruences ⋮ 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
