Pages that link to "Item:Q2848670"
From MaRDI portal
The following pages link to A proof search specification of the \(\pi\)-calculus (Q2848670):
Displaying 15 items.
- Nominal abstraction (Q617715) (← links)
- Relating state-based and process-based concurrency through linear logic (full-version) (Q731895) (← links)
- An exact correspondence between a typed pi-calculus and polarised proof-nets (Q974114) (← links)
- The calculus of constructions as a framework for proof search with set variable instantiation (Q1575927) (← links)
- A proof theory for model checking (Q2331070) (← links)
- Open bisimulation, revisited (Q2465030) (← links)
- A proof theoretic view of spatial and temporal dependencies in biochemical systems (Q2628774) (← links)
- On the role of names in reasoning about \(\lambda\)-tree syntax specifications (Q2804945) (← links)
- (Q4365103) (← links)
- Relating State-Based and Process-Based Concurrency through Linear Logic (Q4917995) (← links)
- (Q5014803) (← links)
- An Analytic Propositional Proof System on Graphs (Q5060181) (← links)
- A Proof Theoretic Approach to Operational Semantics (Q5262970) (← links)
- Computer Science Logic (Q5311281) (← links)
- CONCUR 2005 – Concurrency Theory (Q5897473) (← links)