The Definitional Side of the Forcing - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

The Definitional Side of the Forcing


This paper studies forcing translations of proofs in dependent type theory, through the Curry-Howard correspondence. Based on a call-by-push-value decomposition, we synthesize two simply-typed translations: i) one call-by-value, corresponding to the translation derived from the presheaf construction as studied in a previous paper ; ii) one call-by-name, whose intuitions already appear in Kriv-ine and Miquel's work. Focusing on the call-by-name translation, we adapt it to the dependent case and prove that it is compatible with the definitional equality of our system, thus avoiding coherence problems. This allows us to use any category as forcing conditions , which is out of reach with the call-by-value translation. Our construction also exploits the notion of storage operators in order to interpret dependent elimination for inductive types. This is a novel example of a dependent theory with side-effects, clarifying how dependent elimination for inductive types must be restricted in a non-pure setting. Being implemented as a Coq plugin, this work gives the possibility to formalize easily consistency results, for instance the consistency of the negation of Voevodsky's univalence axiom.
Fichier principal
Vignette du fichier
main.pdf (340.79 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01319066 , version 1 (20-05-2016)



Guilhem Jaber, Gabriel Lewertowski, Pierre-Marie Pédrot, Matthieu Sozeau, Nicolas Tabareau. The Definitional Side of the Forcing. Logics in Computer Science, May 2016, New York, United States. ⟨10.1145/⟩. ⟨hal-01319066⟩
975 View
493 Download



Gmail Facebook X LinkedIn More