Pages that link to "Item:Q3395094"
From MaRDI portal
The following pages link to Formalising the pi-calculus using nominal logic (Q3395094):
Displayed 12 items.
- \(\mathrm{HO}\pi\) in Coq (Q2031410) (← links)
- Unique solutions of contractions, CCS, and their HOL formalisation (Q2216120) (← links)
- Formalizing CCS and \(\pi\)-calculus in Guarded Cubical Agda (Q2683037) (← links)
- On the Expressiveness of Symmetric Communication (Q3179397) (← links)
- (Q3384919) (← links)
- Proof-relevant π-calculus: a constructive account of concurrency and causality (Q4691184) (← links)
- (Q4972733) (← links)
- Coverability Synthesis in Parametric Petri Nets (Q5111622) (← links)
- Constructing weak simulations from linear implications for processes with private names (Q5236556) (← links)
- A case study in programming coinductive proofs: Howe’s method (Q5236557) (← links)
- Nominal Sets in Agda - A Fresh and Immature Mechanization (Q6118749) (← links)
- Proofs about Network Communication: For Humans and Machines (Q6197375) (← links)