A Materialist Dialectica

Pierre-Marie Pédrot 1, 2
2 PI.R2 - Design, study and implementation of languages for proofs and programs
PPS - Preuves, Programmes et Systèmes, Inria Paris-Rocquencourt, UPD7 - Université Paris Diderot - Paris 7, CNRS - Centre National de la Recherche Scientifique : UMR7126
Abstract : In this thesis, we give a computational interpretation to Gödel's Dialectica translation, in a fashion inspired by classical realizability. In particular, it can be shown that the Dialectica translation manipulates stacks of the Krivine machine as first-class objects and that the main effect at work lies in the accumulation of those stacks at each variable use. The original translation suffers from a handful of defects due to hacks used by Gödel to work around historical limitations. Once these defects are solved, the translation naturally extends to much more expressive settings such as dependent type theory. A few variants are studied thanks to the linear decomposition, and relationships with other translations such as forcing and CPS are scrutinized.
Liste complète des métadonnées

Cited literature [101 references]  Display  Hide  Download

Contributor : Pierre-Marie Pédrot <>
Submitted on : Monday, December 21, 2015 - 11:22:39 AM
Last modification on : Friday, January 4, 2019 - 5:33:25 PM
Document(s) archivé(s) le : Saturday, April 29, 2017 - 11:17:13 PM


Distributed under a Creative Commons Attribution 4.0 International License


  • HAL Id : tel-01247085, version 1



Pierre-Marie Pédrot. A Materialist Dialectica. Logic in Computer Science [cs.LO]. Paris Diderot, 2015. English. ⟨tel-01247085⟩



Record views


Files downloads