Skip to Main content Skip to Navigation
Conference papers

Normalization by Completeness with Heyting Algebras

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download
Contributor : Claire Medrala Connect in order to contact the contributor
Submitted on : Thursday, September 24, 2015 - 11:30:09 AM
Last modification on : Friday, January 21, 2022 - 3:14:00 AM
Long-term archiving on: : Tuesday, December 29, 2015 - 9:45:36 AM


Files produced by the author(s)


  • HAL Id : hal-01204599, version 1


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⟩



Record views


Files downloads