Automated Constructivization of Proofs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

Automated Constructivization of Proofs


No computable function can output a constructive proof from a classical one whenever its associated theorem also holds constructively. We show in this paper that it is however possible, in practice, to turn a large amount of classical proofs into constructive ones. We describe for this purpose a linear-time constructivization algorithm which is provably complete on large fragments of predicate logic.
Fichier principal
Vignette du fichier
constructivization.pdf (261.81 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01516788 , version 1 (02-05-2017)



Frédéric Gilbert. Automated Constructivization of Proofs. FoSSaCS 2017, Apr 2017, Uppsala, Sweden. ⟨10.1007/978-3-662-54458-7_28⟩. ⟨hal-01516788⟩
171 View
233 Download



Gmail Facebook X LinkedIn More