A fully abstract game semantics for general references, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226), pp.334-344, 1998. ,
DOI : 10.1109/LICS.1998.705669
A proof-theoretic foundation of abortive continuations. Higher-Order and Symbolic Computation, pp.403-429, 2007. ,
URL : https://hal.archives-ouvertes.fr/hal-00697242
Full Abstraction for PCF. Information and Computation, pp.409-470, 2000. ,
DOI : 10.1006/inco.2000.2930
URL : http://doi.org/10.1006/inco.2000.2930
Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions, Electronic Notes in Theoretical Computer Science, vol.3, pp.2-14, 1996. ,
DOI : 10.1016/S1571-0661(05)80398-6
Call-by-value games, 6th EACSL Annual Conference on Computer Science Logic, pp.1-17, 1997. ,
DOI : 10.1007/BFb0028004
Abstract, The Journal of Symbolic Logic, vol.39, issue.02, pp.600-622, 1998. ,
DOI : 10.1007/BF02007566
Sequential algorithms on concrete data structures, Theoretical Computer Science, vol.20, issue.3, pp.265-321, 1982. ,
DOI : 10.1016/S0304-3975(82)80002-9
Realizability for Peano Arithmetic with Winning Conditions in HON Games, 11th International Conference on Typed Lambda Calculi and Applications, pp.77-92, 2013. ,
DOI : 10.1007/978-3-642-38946-7_8
URL : https://hal.archives-ouvertes.fr/hal-00793324
Modified bar recursion and classical dependent choice, Logic Colloquium '01, Proceedings of the Annual European Summer Meeting of the Association for Symbolic Logic, pp.89-107, 2005. ,
DOI : 10.1017/9781316755860.004
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.9474
Modified bar recursion, Mathematical Structures in Computer Science, vol.16, issue.02, pp.163-183, 2006. ,
DOI : 10.1017/S0960129506005093
Thick Subtrees, Games and Experiments, 9th International Conference on Typed Lambda Calculi and Applications, pp.65-79, 2009. ,
DOI : 10.1007/978-3-540-27836-8_24
On Bar Recursion and Choice in a Classical Setting, 11th Asian Symposium on Programming Languages and Systems, pp.349-364, 2013. ,
DOI : 10.1007/978-3-319-03542-0_25
URL : https://hal.archives-ouvertes.fr/hal-00835540
Ueber eine Eigenschaft des Inbegriffes aller reellen algebraischen Zahlen, Journal für die reine und angewandte Mathematik, pp.258-262, 1874. ,
DOI : 10.1007/978-3-7091-9516-1_2
Ueber eine elementare Frage der Mannigfaltigketislehre, Jahresbericht der Deutschen Mathematiker-Vereinigung, vol.1, pp.75-78 ,
Combinatory Logic, volume 22 of Studies in Logic and The Foundations of Mathematics, 1958. ,
The duality of computation, 5th International Conference on Functional Programming, pp.233-243, 2000. ,
URL : https://hal.archives-ouvertes.fr/inria-00156377
Abstract Machines for Dialogue Games. Panoramas et synthèses, pp.231-275, 2009. ,
URL : https://hal.archives-ouvertes.fr/hal-00155295
An Unsolvable Problem of Elementary Number Theory, American Journal of Mathematics, vol.58, issue.2, pp.345-363, 1936. ,
DOI : 10.2307/2371045
Least and Greatest Fixpoints in Game Semantics, 12th International Conference on Foundations Of Software Science And Computational Structures, pp.16-31, 2009. ,
DOI : 10.2140/pjm.1955.5.285
URL : https://hal.archives-ouvertes.fr/hal-00443537
Estimation of the Length of Interactions in Arena Game Semantics, 14th International Conference on Foundations of Software Science and Computational Structures, pp.335-349, 2011. ,
DOI : 10.1007/978-3-642-19805-2_23
URL : https://hal.archives-ouvertes.fr/hal-00651555
Isomorphisms of types in the presence of higher-order references (extended version), Logical Methods in Computer Science, vol.8, issue.3, p.2012 ,
DOI : 10.2168/LMCS-8(3:8)2012
A semantics of evidence for classical arithmetic, The Journal of Symbolic Logic, vol.54, issue.01, pp.325-337, 1995. ,
DOI : 10.1007/BFb0079691
Definability and Full Abstraction, 5th International Conference on Logic Programming and Automated Reasoning, pp.301-310, 1994. ,
DOI : 10.1016/j.entcs.2007.02.011
URL : https://hal.archives-ouvertes.fr/hal-00144692
Game semantics and abstract machines, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, pp.394-405, 1996. ,
DOI : 10.1109/LICS.1996.561456
Abstract, The Journal of Symbolic Logic, vol.121, issue.01, pp.407-413, 2001. ,
DOI : 10.2307/2694930
Begriffsschrift, eine der mathematischen nachgebildete Formelsprache des reinen Denkens, p.1879 ,
Classically and intuitionistically provably recursive functions, Higher Set Theory, pp.21-27, 1978. ,
DOI : 10.1007/BFb0103100
Untersuchungen ???ber das logische Schlie???en. I, Mathematische Zeitschrift, vol.39, issue.1, pp.176-210, 1935. ,
DOI : 10.1007/BF01201353
The regular-language semantics of second-order idealized ALGOL, Theoretical Computer Science, vol.309, issue.1-3, pp.469-502, 2003. ,
DOI : 10.1016/S0304-3975(03)00315-3
Über die Vollständigkeit des Logikkalküls, 1929. ,
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I. Monatshefte für mathematik und physik, pp.173-198, 1931. ,
The consistency of the continuum hypothesis, Annals of Mathematics Studies, 1940. ,
??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
A formulae-as-type notion of control, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '90, pp.47-58, 1990. ,
DOI : 10.1145/96709.96714
Séquents qu'on calcule: de l'interprétation du calcul des séquents comme calcul de ?-termes et comme calcul de stratégies gagnantes, 1995. ,
On Full Abstraction for PCF: I, II, and III, Information and Computation, vol.163, issue.2, pp.285-408, 2000. ,
DOI : 10.1006/inco.2000.2917
The formulae-as-types notion of construction. To HB Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pp.479-490, 1980. ,
Completeness of Continuation Models for ?µ-Calculus. Information and Computation, pp.332-355, 2002. ,
?µ-calculus and ?µ-calculus: a Capital Difference, 2009. ,
Game semantics Semantics and logics of computation, Publications of the Newton Institute, pp.131-184, 1997. ,
On the interpretation of intuitionistic number theory, The Journal of Symbolic Logic, vol.3, issue.04, pp.109-124, 1945. ,
DOI : 10.1007/BF01565439
Theory of majorizable and continuous functionals and their use for the extraction of bounds from non-constructive proofs: effective moduli of uniqueness for best approximations from ineffective proofs of uniqueness, 1990. ,
Applied Proof Theory: Proof Interpretations and their Use in Mathematics, 2008. ,
Interpretation of analysis by means of constructive functionals of finite types, Constructivity in mathematics: Proceedings of the colloquium held at Amsterdam Studies in Logic and the Foundations of Mathematics, pp.101-128, 1957. ,
A general storage theorem for integers in call-by-name ??-calculus, Theoretical Computer Science, vol.129, issue.1, pp.79-94, 1994. ,
DOI : 10.1016/0304-3975(94)90081-7
Typed lambda-calculus in classical Zermelo-Fr??nkel set theory, Archive for Mathematical Logic, vol.40, issue.3, pp.189-205, 2001. ,
DOI : 10.1007/s001530000057
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
Realizability in classical logic. Panoramas et synthèses, pp.197-229, 2009. ,
URL : https://hal.archives-ouvertes.fr/hal-00154500
Full abstraction for functional languages with control, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science, pp.58-67, 1997. ,
DOI : 10.1109/LICS.1997.614931
A semantic analysis of control, 1999. ,
Classical isomorphisms of types, Mathematical Structures in Computer Science, vol.15, issue.05, pp.969-1004, 2005. ,
DOI : 10.1017/S0960129505004895
URL : https://hal.archives-ouvertes.fr/hal-00003761
Finitary PCF is not decidable, Theoretical Computer Science, vol.266, issue.1-2, pp.341-364, 2001. ,
DOI : 10.1016/S0304-3975(00)00194-8
URL : http://doi.org/10.1016/s0304-3975(00)00194-8
Continuations Semantics or Expressing Implication by Negation, 1993. ,
Asynchronous Games 3 An Innocent Model of Linear Logic, Electronic Notes in Theoretical Computer Science, vol.122, pp.171-192, 2005. ,
DOI : 10.1016/j.entcs.2004.06.057
Sequential algorithms and strongly stable functions, Theoretical Computer Science, vol.343, issue.1-2, pp.237-281, 2005. ,
DOI : 10.1016/j.tcs.2005.05.015
Asynchronous games 2: The true concurrency of innocence, Theoretical Computer Science, vol.358, issue.2-3, pp.200-228, 2006. ,
DOI : 10.1016/j.tcs.2006.01.016
Fully abstract models of typed ??-calculi, Theoretical Computer Science, vol.4, issue.1, pp.1-22, 1977. ,
DOI : 10.1016/0304-3975(77)90053-6
Existential witness extraction in classical realizability and via a negative translation, Logical Methods in Computer Science, vol.7, issue.2, 2011. ,
DOI : 10.2168/LMCS-7(2:2)2011
URL : https://hal.archives-ouvertes.fr/hal-00800560
Hereditarily sequential functionals, Third International Symposium on Logical Foundations of Computer Science, pp.253-264, 1994. ,
DOI : 10.1007/3-540-58140-5_25
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.2978
Interpretation via Linear Logic, Dialectica, vol.53, issue.2, pp.269-290, 2008. ,
DOI : 10.1111/j.1746-8361.2008.01135.x
A Semantic View of Classical Proofs: Type-Theoretic, Categorical, and Denotational Characterizations (Preliminary Extended Abstract), 11th Annual IEEE Symposium on Logic in Computer Science, pp.230-241, 1996. ,
A Curry-Howard foundation for functional computation with control, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '97, pp.215-227, 1997. ,
DOI : 10.1145/263699.263722
????-Calculus: An algorithmic interpretation of classical natural deduction, 3rd International Conference on Logic Programming and Automated Reasoning, pp.190-201, 1992. ,
DOI : 10.1007/BFb0013061
LCF considered as a programming language, Theoretical Computer Science, vol.5, issue.3, pp.223-255, 1977. ,
DOI : 10.1016/0304-3975(77)90044-5
On bar recursive interpretations of analysis, 2013. ,
The equivalence of bar recursion and open recursion, Annals of Pure and Applied Logic, vol.165, issue.11, pp.1727-1754, 2014. ,
DOI : 10.1016/j.apal.2014.07.003
Typed Exeptions and Continuations Cannot Macro- Express Each Other, 26th International Colloquium on Automata, Languages and Programming, pp.635-644, 1999. ,
DOI : 10.1007/3-540-48523-6_60
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.7950
Separation with Streams in the ?µ-calculus, 20th IEEE Symposium on Logic in Computer Science, pp.356-365, 2005. ,
URL : https://hal.archives-ouvertes.fr/hal-00527871
A type-theoretical alternative to ISWIM, CUCH, OWHY, Theoretical Computer Science, vol.121, issue.1-2, pp.411-440, 1993. ,
DOI : 10.1016/0304-3975(93)90095-B
URL : http://doi.org/10.1016/0304-3975(93)90095-b
Control categories and duality: on the categorical semantics of the lambda-mu calculus, Mathematical Structures in Computer Science, vol.11, issue.2, pp.207-260, 2001. ,
DOI : 10.1017/S096012950000311X
Provably recursive functionals of analysis: a consistency proof of analysis by an extension of principles formulated in current intuitionistic mathematics, Recursive Function Theory: Proceedings of Symposia in Pure Mathematics, pp.1-27, 1962. ,
DOI : 10.1090/pspum/005/0154801
Domain-theoretic foundations of functional programming, World Scientific, 2006. ,
DOI : 10.1142/6284
Handbook of Proof Theory, of Studies in Logic and the Foundations of Mathematics, pp.407-473, 1998. ,
On computable numbers, with an application to the Entscheidungsproblem, Proceedings of the, pp.230-265, 1937. ,
Constructivism in mathematics: an introduction 123 of Studies in logic and the foundations of mathematics, 1988. ,
Untersuchungen ???ber die Grundlagen der Mengenlehre. I, Mathematische Annalen, vol.65, issue.2, pp.261-281, 1908. ,
DOI : 10.1007/BF01449999