Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, Epiciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

2-or-more approximation for intuitionistic logic

Abstract : 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"?
Document type :
Preprints, Working Papers, ...
Complete list of metadata
Contributor : Scherer Gabriel Connect in order to contact the contributor
Submitted on : Thursday, December 11, 2014 - 4:34:09 PM
Last modification on : Thursday, February 3, 2022 - 11:17:05 AM
Long-term archiving on: : Saturday, April 15, 2017 - 7:50:15 AM


Files produced by the author(s)


  • HAL Id : hal-01094120, version 1



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



Record views


Files downloads