Skip to Main content Skip to Navigation
New interface
Conference papers

Deciding equivalence with sums and the empty type

Gabriel Scherer 1, 2 
2 PARSIFAL - Proof search and reasoning with logic specifications
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France
Abstract : The logical technique of focusing can be applied to the λ-calculus; in a simple type system with atomic types and negative type form-ers (functions, products, the unit type), its normal forms coincide with βη-normal forms. Introducing a saturation phase gives a notion of quasi-normal forms in presence of positive types (sum types and the empty type). This rich structure let us prove the decidabil-ity of βη-equivalence in presence of the empty type, the fact that it coincides with contextual equivalence, and a finite model property.
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download
Contributor : Scherer Gabriel Connect in order to contact the contributor
Submitted on : Thursday, November 23, 2017 - 3:33:25 PM
Last modification on : Friday, November 18, 2022 - 9:27:47 AM


Files produced by the author(s)


  • HAL Id : hal-01646064, version 1
  • ARXIV : 1610.01213


Gabriel Scherer. Deciding equivalence with sums and the empty type. POPL 2017, Jan 2017, Paris, France. ⟨hal-01646064⟩



Record views


Files downloads