Normalization by evaluation for typed lambda calculus with coproducts, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science, pp.303-310, 2001. ,
DOI : 10.1109/LICS.2001.932506
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.106.2126
Categorical reconstruction of a reduction free normalization proof, Category Theory and Computer Science, pp.182-199, 1995. ,
DOI : 10.1007/3-540-60164-3_27
An inverse of the evaluation functional for typed lambda -calculus, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science, pp.202-211, 1991. ,
DOI : 10.1109/LICS.1991.151645
On Constructive Cut Admissibility in Deduction Modulo, TYPES for proofs and programs, pp.33-47, 2007. ,
DOI : 10.1007/978-3-540-74464-1_3
URL : https://hal.archives-ouvertes.fr/hal-01337639
From semantics to rules: A machine assisted analysis, CSL, pp.91-105, 1993. ,
DOI : 10.1007/BFb0049326
A proof of strong normalization for the theory of constructions using a Kripke-like interpretation, Preliminary Proceedings 1st Intl. Workshop on Logical Frameworks, 1990. ,
Models and Proof Normalization, 2009. ,
URL : https://hal.archives-ouvertes.fr/tel-00433165
On completeness of reducibility candidates as a semantics of strong normalization, Logical Methods in Computer Science, 2012. ,
DOI : 10.2168/LMCS-8(1:3)2012
Truth Values Algebras and Proof Normalization, TYPES for proofs and programs, pp.110-124, 2007. ,
DOI : 10.1007/978-3-540-74464-1_8
Hol-lambda-sigma: an intentional first-order expression of higher-order logic, Mathematical Structures in Computer Science, vol.11, pp.1-25, 2001. ,
URL : https://hal.archives-ouvertes.fr/hal-01199524
Theorem proving modulo, Journal of Automated Reasoning, vol.31, issue.1, pp.33-72, 2003. ,
DOI : 10.1023/A:1027357912519
URL : https://hal.archives-ouvertes.fr/hal-01199506
Cut elimination for Zermelo's set theory. manuscript, 2007. ,
Abstract, The Journal of Symbolic Logic, vol.87, issue.04, pp.1289-1316, 2003. ,
DOI : 10.1007/BFb0037116
Arithmetic as a Theory Modulo, Lecture Notes in Computer Science, vol.3467, pp.423-437, 2005. ,
DOI : 10.1007/978-3-540-32033-3_31
Untersuchungen ???ber das logische Schlie???en. I, Mathematische Zeitschrift, vol.39, issue.1, pp.176-210, 1934. ,
DOI : 10.1007/BF01201353
Une extension de l'interprétation de Gödel à l'analyse et son application à l'élimination des coupures dans l'analyse et la théorie des types, Proceedings of the Second Scandinavian Logic Symposium of Studies in Logic and the Foundations of Mathematics, pp.63-92, 1970. ,
Semantic Cut Elimination in the Intuitionistic Sequent Calculus, Typed Lambda-Calculi and Applications, pp.221-233, 2005. ,
DOI : 10.1007/11417170_17
Completeness and cut elimination in Church's intuitionistic theory of types, Journal of Logic and Computation, vol.15, pp.821-854, 2005. ,
Union of Reducibility Candidates for Orthogonal Constructor Rewriting, CiE'08, pp.498-510, 2008. ,
DOI : 10.1007/978-3-540-69407-6_54
URL : https://hal.archives-ouvertes.fr/inria-00204710
Basic Proof Theory, 1996. ,