Location of Repository

Encoding transition systems in sequent calculus

By Raymond Mcdowell, Dale Miller and Catuscia Palamidessi


Linear logic has been used to specify the operational semantics of various process calculi. In this paper we explore how meta-level judgments, such as simulation and bisimulation, can be established using such encodings. In general, linear logic is too weak to derive such judgments and we focus on an extension to linear logic using definitions. We explore this extension in the context of transition systems. 1 Proof theory preliminaries In a recent note [5], Girard extended linear logic with a notion of definitions. If certain restrictions are placed on the structure of definitions then defined concepts have left and right introduction rules that enjoy a cut-elimination theorem. Some examples of using such a definition mechanism have been given for equality reasoning [5,9], forms of program completion in logic programming [6,10], and in the GCLA language project [1]. Given that linear logic has been successful in specifying various transition systems used in concurrency theory [3,7], it is natural to ask what such

Year: 2003
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.lix.polytechnique.f... (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.