Formalized meta-theory of sequent calculi for linear logics - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2019

Formalized meta-theory of sequent calculi for linear logics

Résumé

When studying sequent calculi, proof theorists often have to prove properties about the systems, whether to show that they are “well-behaved”, amenable to automated proof search, complete with respect to another system, consistent, among other reasons. These proofs usually involve many very similar cases, which leads to authors rarely writing them in full detail, only pointing to one or two more complicated cases. Moreover, the amount of details makes them more error-prone for humans. Computers, on the other hand, are very good at handling details and repetitiveness. In this work we have formalized textbook proofs of the meta-theory of sequent calculi for linear logic in Abella. Using the infrastructure developed, the proofs can be easily adapted to other substructural logics. We implemented rules as clauses in an intuitive and straightforward way, similar to logic programming, using operations on multisets for the explicit contexts. Although the proofs are quite big, they use only elementary reasoning principles, which makes the proof techniques fairly portable to other formal reasoning systems.
Fichier principal
Vignette du fichier
cut-elim-abella.pdf (367.15 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Licence : CC BY - Paternité

Dates et versions

hal-04318000 , version 1 (01-12-2023)

Licence

Paternité

Identifiants

Citer

Kaustuv Chaudhuri, Leonardo Lima, Giselle Reis. Formalized meta-theory of sequent calculi for linear logics. Theoretical Computer Science, 2019, 781, pp.24-38. ⟨10.1016/j.tcs.2019.02.023⟩. ⟨hal-04318000⟩
29 Consultations
8 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More