Process calculus based upon evaluation to committed form

DOI10.1016/S0304-3975(97)00218-1zbMath0915.68113OpenAlexW1808575051MaRDI QIDQ1276241

Andrew M. Pitts, Joshua R. X. Ross

Publication date: 22 June 1999

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00218-1

zbMATH Keywords

semanticscommunicating processesevaluation bisimilarity

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Uses Software

• ML
• Facile
• Pict

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bisimulation for higher-order process calculi
• The chemical abstract machine
• A calculus of mobile processes. II
• Plain CHOCS. A second generation calculus for higher order processes
• Asynchronous process calculi: The first- and higher-order paradigms
• Proving congruence of bisimulation in functional programming languages
• A theory of weak bisimulation for core CML
• Constructive mathematics and computer programming
• On the bisimulation proof method
• Branching time and abstraction in bisimulation semantics
• Barbed bisimulation
• Process calculus based upon evaluation to committed form

This page was built for publication: Process calculus based upon evaluation to committed form