Implementing Deep Inference in Tom - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2005

Implementing Deep Inference in Tom

Abstract

The calculus of structures is a proof theoretical formalism which generalizes sequent calculus with the feature of deep inference: in contrast to sequent calculus, the calculus of structures does not rely on the notion of main connective and, like in term rewriting, it permits the application of the inference rules at any depth inside a formula. Tom is a pattern matching processor that integrates term rewriting facilities into imperative languages. In this paper, relying on the correspondence between the systems in the calculus of structures and term rewriting systems, we present an implementation of system BV of the calculus of structures in Java by exploiting the term rewriting features of Tom. This way, by means of the expressive power due to Java, it becomes possible to implement different search strategies. Since the systems in the calculus of structures follow a common scheme, we argue that our implementation can be generalized to other systems in the calculus of structures for classical logic, modal logics, and different fragments of linear logic.
Fichier principal
Vignette du fichier
KahramanogullariMR-SD2005.pdf (176.42 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00000698 , version 1 (15-11-2005)

Identifiers

  • HAL Id : inria-00000698 , version 1

Cite

Ozan Kahramanogullari, Pierre-Etienne Moreau, Antoine Reilles. Implementing Deep Inference in Tom. ICALP Workshop on Structures and Deduction, May 2005, Lisbon/Portugal, pp.158--172. ⟨inria-00000698⟩
104 View
72 Download

Share

Gmail Facebook X LinkedIn More