The following pages link to Psi-calculi (Q40287):
Displaying 11 items.
- Mechanizing a process algebra for network protocols (Q287372) (← links)
- Computing strong and weak bisimulations for psi-calculi (Q444457) (← links)
- A formalized general theory of syntax with bindings: extended version (Q1984791) (← links)
- Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity (Q2119978) (← links)
- A canonical locally named representation of binding (Q2392482) (← links)
- Psi-calculi: a framework for mobile processes with nominal data and logic (Q3003314) (← links)
- POPLMark reloaded: Mechanizing proofs by logical relations (Q5110924) (← links)
- A case study in programming coinductive proofs: Howe’s method (Q5236557) (← links)
- General bindings and alpha-equivalence in Nominal Isabelle (Q5891628) (← links)
- General Bindings and Alpha-Equivalence in Nominal Isabelle (Q5892493) (← links)
- Psi-calculi in Isabelle (Q5895110) (← links)