A proof theoretic approach to operational semantics

DOI10.1016/J.ENTCS.2005.12.089MaRDI QIDQ5262970zbMATH OpenOpenAlexFDO

Authors

Publication date 10 July 2015

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.entcs.2005.12.089

zbMATH Keywords

\(\pi\)-calculusoperational semanticsrule formats\(\lambda\)-tree syntaxproof-theoretic specifications

Mathematics Subject Classification ID

Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• A proof search specification of the -calculus
• Proof search specifications of bisimulation and modal logics for the \({\pi}\)-calculus
• -calculus in (Co)inductive-type theory
• A symbolic semantics for the \(\pi\)-calculus
• Computer Science Logic

Cites work

• A congruence format for name-passing calculi
• A proof search specification of the -calculus
• A proof theory for generic judgments
• CONCUR 2005 – Concurrency Theory
• Computer Science Logic
• Modal logics for mobile processes
• Types for Proofs and Programs

Cited in

(5)

• Operational semantics and generalized weakest preconditions
• scientific article; zbMATH DE number 794263 (Why is no real title available?)
• Computer Science Logic
• Formal foundations of operational semantics
• Towards Effects in Mathematical Operational Semantics

This page was built for publication: A proof theoretic approach to operational semantics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262970)