A proof search specification of the -calculus
From MaRDI portal
Publication:2848670
Recommendations
Cited in
(18)- An exact correspondence between a typed pi-calculus and polarised proof-nets
- An Analytic Propositional Proof System on Graphs
- Open bisimulation, revisited
- The calculus of constructions as a framework for proof search with set variable instantiation
- A proof theory for generic judgments
- A proof theoretic approach to operational semantics
- CONCUR 2005 – Concurrency Theory
- Nominal abstraction
- Proof search specifications of bisimulation and modal logics for the \({\pi}\)-calculus
- A proof theory for model checking
- scientific article; zbMATH DE number 1082078 (Why is no real title available?)
- On the role of names in reasoning about \(\lambda\)-tree syntax specifications
- A proof theoretic view of spatial and temporal dependencies in biochemical systems
- Computer Science Logic
- Relating state-based and process-based concurrency through linear logic
- Relating state-based and process-based concurrency through linear logic (full-version)
- scientific article; zbMATH DE number 2020178 (Why is no real title available?)
- A proof theory for model checking: an extended abstract
This page was built for publication: A proof search specification of the \(\pi\)-calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848670)