A theory of bisimulation for a fragment of concurrent ML with local names

DOI10.1016/j.tcs.2004.03.005zbMath1105.68354OpenAlexW2006433153MaRDI QIDQ1882896

Julian Rathke, Alan Jeffrey

Publication date: 1 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.03.005

zbMATH Keywords

ConcurrencyBisimulationHigher-order functionsLocal names

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (12)

Howe’s Method for Calculi with Passivation ⋮ Adding recursion to Dpi ⋮ Program equivalence in a simple language with state ⋮ Characterizing contextual equivalence in calculi with passivation ⋮ Companions, Codensity and Causality ⋮ Using bisimulation proof techniques for the analysis of distributed abstract machines ⋮ A bisimulation for dynamic sealing ⋮ A game semantics of names and pointers ⋮ From Applicative to Environmental Bisimulation ⋮ Typed behavioural equivalences for processes in the presence of subtyping ⋮ Assigning types to processes ⋮ Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures

Uses Software

• ML

Cites Work

• A fully abstract may testing semantics for concurrent objects
• Notions of computation and monads
• A calculus of communicating systems
• A calculus of mobile processes. II
• The \(\pi\)-calculus in direct style
• On reduction-based process semantics
• A theory of weak bisimulation for Core CML
• Barbed bisimulation
• A calculus of mobile agents
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A theory of bisimulation for a fragment of concurrent ML with local names