Recommendations
Cites work
- Asynchronous process calculi: The first- and higher-order paradigms
- Bisimulation for higher-order process calculi
- Nominal logic, a first order theory of names and binding
- Nominal techniques in Isabelle/HOL
- On the bisimulation proof method
- Plain CHOCS. A second generation calculus for higher order processes
Cited in
(15)- Modeling and efficient verification of wireless ad hoc networks
- \(\mathrm{HO}\pi\) in Coq
- A sorted semantic framework for applied process calculi (extended abstract)
- HOCore in Coq
- scientific article; zbMATH DE number 1555188 (Why is no real title available?)
- Priorities without priorities: representing preemption in psi-calculi
- scientific article; zbMATH DE number 7288621 (Why is no real title available?)
- A case study in programming coinductive proofs: Howe's method
- Psi-calculi in Isabelle
- Psi-calculi in Isabelle
- The reflective higher-order calculus: encodability, typability and separation
- A generic type system for higher-order \(\Psi\)-calculi
- Psi-calculi revisited: connectivity and compositionality
- Encodability and separation for a reflective higher-order calculus
- A generic type system for higher-order -calculi
This page was built for publication: Higher-order psi-calculi
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5740353)
