 |
|
|
|
| HAL : hal-00421158, version 4 |
| DOI : 10.1007/978-3-642-15205-4_37 |
| Fiche détaillée |  Récupérer au format |
|
|
| Computer Science Logic, Tchèque, République (2010) |
|
|
| Versions disponibles : | v1 (01-10-2009) | v2 (18-01-2010) | v3 (08-04-2010) | v4 (14-06-2010) |
|
|
|
|
| Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic |
|
|
| Damien Pous 1 |
|
|
| (2010) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Laboratoire d'Informatique de Grenoble (LIG) |
|
|
|
CNRS : UMR5217 – INRIA – Université Pierre Mendès-France - Grenoble II – Université Joseph Fourier - Grenoble I – Institut Polytechnique de Grenoble - Grenoble Institute of Technology |
|
|
|
|
|
|
|
|
|
| SARDES |
|
|
|
|
| Domaine | : | Informatique/Mathématique discrète Informatique/Logique en informatique Mathématiques/Catégories et ensembles |
|
|
| algebra – typed algebra – kleene algebra – residuated lattice – gentzen proof system – cyclic linear logic – decision procedures – coq proof assistant |
|
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|||||
|
|
|
| hal-00421158, version 4 | |
| http://hal.archives-ouvertes.fr/hal-00421158 | |
| oai:hal.archives-ouvertes.fr:hal-00421158 | |
| Contributeur : Damien Pous | |
| Soumis le : Lundi 14 Juin 2010, 10:24:12 | |
| Dernière modification le : Jeudi 22 Septembre 2011, 10:10:13 | |
