Normalization by Completeness with Heyting Algebras - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année :

Normalization by Completeness with Heyting Algebras

(1, 2) , (3, 4, 1, 5)
1
2
3
4
5

Résumé

Usual normalization by evaluation techniques have a strong relationship with completeness with respect to Kripke structures. But Kripke structures is not the only semantics that ts intuitionistic logic: Heyting algebras are a more algebraic alternative. In this paper, we focus on this less investigated area: how completeness with respect to Heyting algebras generate a normalization algorithm for a natural deduction calculus, in the propositional fragment. Our main contributions is that we prove in a direct way completeness of natural deduction with respect to Heyting algebras, that the underlying algorithm natively deals with disjunction, that we formalized those proofs in Coq, and give an extracted algorithm.
Fichier principal
Vignette du fichier
A-614.pdf (320.34 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01204599 , version 1 (24-09-2015)

Identifiants

  • HAL Id : hal-01204599 , version 1

Citer

Gaëtan Gilbert, Olivier Hermant. Normalization by Completeness with Heyting Algebras. LPAR 20 : 20th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Nov 2015, Suva, Fiji. ⟨hal-01204599⟩
317 Consultations
138 Téléchargements

Partager

Gmail Facebook Twitter LinkedIn More