Higher-order psi-calculi

DOI10.1017/S0960129513000170zbMath1342.68239MaRDI QIDQ5740353

Johannes Åman Pohjola, Joachim Parrow, Palle Raabjerg, Johannes Borgström

Publication date: 26 July 2016

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items (9)

HOCore in Coq ⋮ Modeling and efficient verification of wireless ad hoc networks ⋮ The reflective higher-order calculus: encodability, typability and separation ⋮ Psi-calculi in Isabelle ⋮ Unnamed Item ⋮ Unnamed Item ⋮ \(\mathrm{HO}\pi\) in Coq ⋮ A Sorted Semantic Framework for Applied Process Calculi (Extended Abstract) ⋮ A case study in programming coinductive proofs: Howe’s method

Cites Work

• Bisimulation for higher-order process calculi
• Nominal techniques in Isabelle/HOL
• Plain CHOCS. A second generation calculus for higher order processes
• Asynchronous process calculi: The first- and higher-order paradigms
• Nominal logic, a first order theory of names and binding
• On the bisimulation proof method

This page was built for publication: Higher-order psi-calculi