2-or-more approximation for intuitionistic logic - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year :

2-or-more approximation for intuitionistic logic


In the context of the simply-typed lambda-calculus (propositionalintuitionistic logic) with products and sums, we will answer the followingquestion. Given a fixed logic proof and typing environment, the number of possible programs that correspond to this proof depends on the number of free variables of each type in the type environment. If we are not interested in the precise number of programs but only "zero, one, or two-or-more", is it correct to approximate the number of variables at each type by "zero, one, or two-or-more"?
Fichier principal
Vignette du fichier
2-or-more-approximation.pdf (374.04 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01094120 , version 1 (11-12-2014)


  • HAL Id : hal-01094120 , version 1


Gabriel Scherer. 2-or-more approximation for intuitionistic logic. 2014. ⟨hal-01094120⟩


53 View
19 Download


Gmail Facebook Twitter LinkedIn More