Abstract
The theory of classical realizability was introduced by Krivine [Kri09] in the middle of the 90’s in order to analyze the computational contents of classical proofs, following the connection between classical reasoning and control operators discovered by Griffin [Gri90]. More than an extension of the theory of intuitionistic realizability, classical realizability is a complete reformulation of the very principles of realizability based on a combination [OS08, Miq10] of Kleene’s realizability [Kle45] with Friedman’s A-translation [Fri78].
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Cohen, P.J.: The independence of the continuum hypothesis. Proceedings of the National Academy of Sciences of the United States of America 50(6), 1143–1148 (1963)
Cohen, P.J.: The independence of the continuum hypothesis II. Proceedings of the National Academy of Sciences of the United States of America 51(1), 105–110 (1964)
Friedman, H.: Classically and intuitionistically provably recursive functions. Higher Set Theory 699, 21–28 (1978)
Griffin, T.: A formulae-as-types notion of control. In: Principles of Programming Languages (POPL 1990), pp. 47–58 (1990)
Kleene, S.C.: On the interpretation of intuitionistic number theory. Journal of Symbolic Logic 10, 109–124 (1945)
Krivine, J.-L.: Typed lambda-calculus in classical Zermelo-Fraenkel set theory. Arch. Math. Log. 40(3), 189–205 (2001)
Krivine, J.-L.: Dependent choice, ‘quote’ and the clock. Theor. Comput. Sci. 308(1-3), 259–276 (2003)
Krivine, J.-L.: Realizability in classical logic. In: Interactive Models of Computation and Program Behaviour. Panoramas et synthèses, vol. 27, pp. 197–229. Société Mathématique de France (2009)
Krivine, J.-L.: Realizability algebras: a program to well order R. CoRR, abs/1005.2395 (2010)
Miquel, A.: Classical program extraction in the calculus of constructions. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol. 4646, pp. 313–327. Springer, Heidelberg (2007)
Miquel, A.: Existential witness extraction in classical realizability and via a negative translation. Logical Methods for Computer Science (2010)
Oliva, P., Streicher, T.: On Krivine’s realizability interpretation of classical second-order arithmetic. Fundam. Inform. 84(2), 207–220 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Miquel, A. (2011). A Survey of Classical Realizability. In: Ong, L. (eds) Typed Lambda Calculi and Applications. TLCA 2011. Lecture Notes in Computer Science, vol 6690. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21691-6_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-21691-6_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21690-9
Online ISBN: 978-3-642-21691-6
eBook Packages: Computer ScienceComputer Science (R0)