First–order Semantics for Higher–order Processes

DOI10.1016/S1571-0661(04)80873-9zbMath1262.68098MaRDI QIDQ4921509

Michael Baldamus

Publication date: 10 May 2013

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

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• \(\pi\)-calculus, internal mobility, and agent-passing calculi
• Bisimulation for higher-order process calculi
• A calculus of mobile processes. II
• A fully abstract denotational model for higher-order processes
• Testing equivalences for processes
• A fully abstract model for the \(\pi\)-calculus.
• Reasoning about higher-order processes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: First–order Semantics for Higher–order Processes