Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2010

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

Résumé

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 (425.01 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et 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)

Identifiants

  • HAL Id : hal-00421158 , version 3

Citer

Damien Pous. Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic. 2010. ⟨hal-00421158v3⟩
378 Consultations
237 Téléchargements

Partager

Gmail Facebook X LinkedIn More