A Proof Theoretic Approach to Operational Semantics

DOI10.1016/J.ENTCS.2005.12.089zbMATH Open1316.68100OpenAlexW1986898973MaRDI QIDQ5262970FDOQ5262970

Author name not available (Why is that?)

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)

Cites Work

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

Cited In (5)

• Operational semantics and generalized weakest preconditions
• Title not available (Why is that?)
• 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)