Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic

Abstract

We prove ''untyping'' theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be derived from the underlying untyped equations. As a consequence, the corresponding untyped decision procedures can be extended for free to the typed settings. Some of these theorems are obtained via a detour through fragments of cyclic linear logic, and give rise to a substantial optimisation of standard proof search algorithms.
Fichier principal
Vignette du fichier
utas.pdf (534.46 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00421158 , version 1 (30-09-2009)
hal-00421158 , version 2 (18-01-2010)
hal-00421158 , version 3 (07-04-2010)
hal-00421158 , version 4 (14-06-2010)

Identifiers

Cite

Damien Pous. Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic. Computer Science Logic, Aug 2010, Brno, Czech Republic. pp.484-498, ⟨10.1007/978-3-642-15205-4_37⟩. ⟨hal-00421158v4⟩
359 View
227 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More