J. Avigad and S. Feferman, Gödel's functional ('dialectica' ) interpretation, Handbook of Proof Theory, pp.337-405, 1998.
DOI : 10.1016/s0049-237x(98)80020-7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.6017

T. Coquand, An analysis of Girard's paradox, LICS, pp.227-236, 1986.

P. Valeria-de, A dialectica-like model of linear logic, Lecture Notes in Computer Science, vol.389, pp.341-356, 1989.

J. Diller, Eine Variante zur Dialectica-Interpretation der Heyting- Arithmetik endlicher Typen Archiv für mathematische Logik und Grundlagenforschung, pp.49-66, 1974.
DOI : 10.1007/bf02025118
URL : http://www.digizeitschriften.de/download/PPN379931524_0016/PPN379931524_0016___log7.pdf

J. Girard, Linear logic, Theoretical Computer Science, vol.50, issue.1, pp.1-102, 1987.
DOI : 10.1016/0304-3975(87)90045-4
URL : https://hal.archives-ouvertes.fr/inria-00075966

J. Girard, The Blind Spot: Lectures on Logic, 2011.
DOI : 10.4171/088
URL : https://hal.archives-ouvertes.fr/hal-01322183

K. ¨. Gödel, ??BER EINE BISHER NOCH NICHT BEN??TZTE ERWEITERUNG DES FINITEN STANDPUNKTES, Dialectica, vol.12, issue.3-4, pp.280-287, 1958.
DOI : 10.1111/j.1746-8361.1958.tb01464.x

H. Herbelin, An Intuitionistic Logic that Proves Markov's Principle, 2010 25th Annual IEEE Symposium on Logic in Computer Science, pp.50-56, 2010.
DOI : 10.1109/LICS.2010.49
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.168.4521

J. M. Hyland, Proof theory in the abstract, Annals of Pure and Applied Logic, vol.114, issue.1-3, pp.43-78, 2002.
DOI : 10.1016/S0168-0072(01)00075-6

M. Hyland and A. Schalk, Glueing and orthogonality for models of linear logic, Theoretical Computer Science, vol.294, issue.1-2, pp.183-231, 2003.
DOI : 10.1016/S0304-3975(01)00241-9

J. Krivine, Dependent choice, ???quote??? and the clock, Theoretical Computer Science, vol.308, issue.1-3, pp.259-276, 2003.
DOI : 10.1016/S0304-3975(02)00776-4
URL : https://hal.archives-ouvertes.fr/hal-00154478

Z. Luo, ECC, an extended calculus of constructions, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science, pp.386-395, 1989.
DOI : 10.1109/LICS.1989.39193

A. Miquel, Forcing as a Program Transformation, 2011 IEEE 26th Annual Symposium on Logic in Computer Science, pp.197-206, 2011.
DOI : 10.1109/LICS.2011.47
URL : https://hal.archives-ouvertes.fr/hal-00800558

G. Munch-maccagnoni, Syntax and Models of a non- Associative Composition of Programs and Proofs, 2013.
URL : https://hal.archives-ouvertes.fr/tel-00918642

G. Munch-maccagnoni, Formulae-as-types for an involutive negation, Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, 2014.
DOI : 10.1145/2603088.2603156
URL : https://hal.archives-ouvertes.fr/hal-00996742

P. Oliva, Unifying Functional Interpretations, Notre Dame Journal of Formal Logic, vol.47, issue.2, pp.263-290, 2006.
DOI : 10.1305/ndjfl/1153858651
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.85.6002

T. Streicher and U. Kohlenbach, Shoenfield is G??del after Krivine, MLQ, vol.8, issue.2, pp.176-179, 2007.
DOI : 10.1002/malq.200610038