M. Zena, H. Ariola, and . Herbelin, Minimal classical logic and control operators, Thirtieth International Colloquium on Automata, Languages and Programming, ICALP'03, pp.871-885, 2003.

M. Beeson, Goodman???s theorem and beyond, Pacific Journal of Mathematics, vol.84, issue.1, pp.1-16, 1979.
DOI : 10.2140/pjm.1979.84.1

U. Berger, A computational interpretation of open induction, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004., pp.326-334, 2004.
DOI : 10.1109/LICS.2004.1319627

T. Coquand, Constructive topology and combinatorics, Constructivity in Computer Science, pp.159-164, 1992.
DOI : 10.1007/BFb0021089
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.4434

T. Coquand, A note on the open induction principle, 1997.

O. Danvy and A. Filinski, A functional abstraction of typed contexts, 1989.

O. Danvy and A. Filinski, Abstracting control, Proceedings of the 1990 ACM conference on LISP and functional programming , LFP '90, pp.151-160, 1990.
DOI : 10.1145/91556.91622

O. Danvy and A. Filinski, Representing Control: a Study of the CPS Transformation, Mathematical Structures in Computer Science, vol.598, issue.04, pp.361-391, 1992.
DOI : 10.1016/0304-3975(87)90109-5

H. Herbelin, An Intuitionistic Logic that Proves Markov's Principle, 2010 25th Annual IEEE Symposium on Logic in Computer Science, pp.11-14
DOI : 10.1109/LICS.2010.49

H. Herbelin, A Constructive Proof of Dependent Choice, Compatible with Classical Logic, 2012 27th Annual IEEE Symposium on Logic in Computer Science, pp.25-28, 2012.
DOI : 10.1109/LICS.2012.47
URL : https://hal.archives-ouvertes.fr/hal-00697240

D. Ilik, Delimited control operators prove Double-negation Shift, Annals of Pure and Applied Logic, vol.163, issue.11, pp.1549-1559, 2012.
DOI : 10.1016/j.apal.2011.12.008
URL : https://hal.archives-ouvertes.fr/hal-00647389

U. Kohlenbach, Applied proof theory: proof interpretations and their use in mathematics, 2008.

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

C. Murthy, Extracting Classical Content from Classical Proofs, 1990.

J. Raoult, Proving open properties by induction, Information Processing Letters, vol.29, issue.1, pp.19-23, 1988.
DOI : 10.1016/0020-0190(88)90126-3

C. Spector, Provably recursive functionals of analysis: a consistency proof of analysis by an extension of principles formulated in current intuitionistic mathematics, Proc. Sympos. Pure Math, pp.1-27, 1962.
DOI : 10.1090/pspum/005/0154801

A. S. Troelstra, Metamathematical Investigations of Intuitionistic Arithmetic and analysis, Lecture Notes in Mathematics, vol.344, 1973.
DOI : 10.1007/BFb0066739

W. Veldman, The principle of open induction on the unit interval [0,1] and some of its equivalents. Slides from presentation, 2010.

. Veldman, Brouwer's Fan Theorem as an axiom and as a contrast to Kleene's Alternative . ArXiv e-prints, 2011.

W. Veldman, Some further equivalents of Brouwer's Fan Theorem and of Kleene's Alternative . ArXiv e-prints, 2013.