Cited in
(19)- A formalized general theory of syntax with bindings: extended version
- General bindings and alpha-equivalence in Nominal Isabelle
- Psi-calculi: a framework for mobile processes with nominal data and logic
- Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity
- POPLMark reloaded: mechanizing proofs by logical relations
- Mechanizing a process algebra for network protocols
- General bindings and alpha-equivalence in Nominal Isabelle
- Psi-calculi in Isabelle
- Computing strong and weak bisimulations for psi-calculi
- A case study in programming coinductive proofs: Howe's method
- HYBRID
- Gmeta
- LNgen
- Nominal Isabelle
- CC-Pi
- MiniAgda
- Unbound
- AWN
- A canonical locally named representation of binding
This page was built for software: Psi-calculi
