Extending Type Theory with Forcing - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Extending Type Theory with Forcing


This paper presents an intuitionistic forcing translation for the Calculus of Constructions (CoC), a translation that corresponds to an internalization of the presheaf construction in CoC. Depending on the chosen set of forcing conditions, the resulting type system can be extended with extra logical principles. The translation is proven correct-in the sense that it preserves type checking-and has been implemented in Coq. As a case study, we show how the forcing translation on integers (which corresponds to the internalization of the topos of trees) allows us to define general inductive types in Coq, without the strict positivity condition. Using such general inductive types, we can construct a shallow embedding of the pure \lambda-calculus in Coq, without defining an axiom on the existence of an universal domain. We also build another forcing layer where we prove the negation of the continuum hypothesis.
Fichier principal
Vignette du fichier
forcing_lics.pdf (228.63 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-00685150 , version 1 (04-04-2012)


  • HAL Id : hal-00685150 , version 1


Guilhem Jaber, Nicolas Tabareau, Matthieu Sozeau. Extending Type Theory with Forcing. LICS 2012 : Logic In Computer Science, Jun 2012, Dubrovnik, Croatia. pp.0-0. ⟨hal-00685150⟩
1340 View
1198 Download


Gmail Mastodon Facebook X LinkedIn More