, Abstract, Journal of Functional Programming, vol.34, issue.04, pp.375-416, 1991.
DOI : 10.1016/0304-3975(86)90035-6
, Le code de Hammurabi, Musée du Louvre Collection Solo, p.27, 2003.
, A completeness result for ? µ, 2007.
, The Lambda Calculus: its Syntax and Semantics, 1984.
, A symmetric lambda calculus for " classical " program extraction, TACS, pp.495-515, 1994.
, Abstract, Journal of Functional Programming, vol.1, issue.05, pp.699-722, 1996.
DOI : 10.1145/174675.174707
, Classical " programming-with-proofs in ? sym : an analysis of nonconfluence, TACS, pp.365-390, 1997.
, Preservation of strong normalisation in named lambda calculi with explicit substitution and garbage collection, CSN'95 Computer Science in the Netherlands, pp.62-72, 1995.
, The undecidability of k-provability. Annals of Pure and Applied Logic, BIBLIOGRAPHY [CF58] H. B. Curry and R. Feys. Combinatory Logic, pp.75-102, 1958.
, The duality of computation, Proc. 5 th ACM SIGPLAN Int. Conf. on Functional Programming (ICFP'00), pp.233-243, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00156377
, The Calculi of Lambda Conversion. (AM-6), Annals of Mathematics Studies, 1985.
, Proof nets and explicit substitutions Using various translations of the $\l$ -calculus into proof nets, new abstract machines have been proposed that exploit the Geometry of Interaction and Dynamic Algebras (Girard 1989; Abramsky and Jagadeesan 1992; Danos 1990), leading to work on optimal reduction (Gonthier et al. 1992; Lamping 1990)., 5th Int. Conf. LPAR, pp.409-450, 1994.
DOI : 10.1017/S0960129502003791
, A ??-calculus with explicit weakening and explicit substitution, Mathematical Structures in Computer Science, vol.11, issue.1, pp.169-206, 2001.
DOI : 10.1017/S0960129500003224
URL : https://hal.archives-ouvertes.fr/hal-00384683
, Computational isomorphisms in classical logic (extended abstract), Electronic Notes in Theoretical Computer Science, vol.3, 1996.
, Abstract, The Journal of Symbolic Logic, vol.II, issue.03, 1997.
DOI : 10.1007/BF00885763
URL : https://hal.archives-ouvertes.fr/inria-00528352
, LettresàLettres`Lettresà une Princesse d'Allemagne. l'Académie Impériale des Sciences, 1768.
, Declarative continuations: an investigation of duality in programming language semantics, Category Theory and Computer Science, pp.224-249, 1989.
, Linear logic without boxes, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science, pp.223-234, 1992.
DOI : 10.1109/LICS.1992.185535
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.3076
, UntersuchungenüberUntersuchungen¨Untersuchungenüber das logische Schließen, Math. Z, vol.39, pp.176-210, 1935.
, Linear logic, Theoretical Computer Science, vol.50, pp.1-102, 1987.
, A new constructive logic: classical logic, Mathematical Stuctures in Computer Science, vol.1, issue.3, pp.255-296, 1991.
, Locus solum: From the rules of logic to the logic of rules, Mathematical Structures in Computer Science, vol.11, issue.3, pp.301-506, 2001.
, Proofs and Types, volume 7 of Cambridge Tracts in Theoret Computer Science, 1989.
, A formulae-as-types notion of control, Proceedings of the 17th ACM symposium on Principles of programming languages, POPL, pp.47-58, 1990.
, A system of interaction and structure, ACM Transactions on Computational Logic, 1999.
, The three dimensions of proofs, Annals of Pure and Applied Logic, vol.141, issue.12, pp.266-295, 2006.
, 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, Thèse de doctorat, 1995.
, Explicit substitution and reducibility, Journal of Logic and Computation, vol.11, issue.3, pp.431-451, 2001.
, Proof theory in the abstract, Annals of Pure and Applied Logic, vol.114, issue.1-3, pp.43-78, 2002.
, The theory of calculi with explicit substitutions revisited, Proceedings of the 16th EACSL Annual Conference on Computer Science and Logic, pp.238-252, 2007.
, Extending the Explicit Substitution Paradigm, RTA, pp.407-422, 2005.
DOI : 10.1007/978-3-540-32033-3_30
URL : https://hal.archives-ouvertes.fr/hal-00148847
, Explicit operators for ?-calculus. Information and Computation, 2006.
, Ressource operators for lambdacalculus . Information and Computation, pp.419-473, 2007.
, Introduction to Metamathematics Number 1 in Bibliotheca mathematica, 1952.
, Interaction nets, Proceedings of the 17th ACM symposium on Principles of programming languages, POPL, pp.95-108, 1990.
, Equational reasoning with 2-dimensional diagrams, Term Rewriting, pp.170-195, 1995.
, From proof-nets to interaction nets, Advances in linear logic, pp.225-247, 1995.
, Call-by-value, call-by-name, and strong normalization for the classical sequent calculus, In Electronic Notes in Theoretical Computer Science, vol.86, 2003.
, From ?? to ??: a journey through calculi of explicit substitutions, Proceedings of the 21st ACM symposium on Principles of programming languages, POPL, pp.60-69
, Intersection types for explicit substitutions, Information and Computation, vol.189, issue.1, pp.17-42, 2004.
DOI : 10.1016/j.ic.2003.09.004
URL : https://hal.archives-ouvertes.fr/hal-00150285
, Naming Proofs in Classical Propositional Logic, TLCA, pp.246-261, 2005.
DOI : 10.1007/11417170_19
URL : https://hal.archives-ouvertes.fr/hal-00012294
, Communication and concurrency, 1995.
, 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
, An algorithmic interpretation of classical natural deduction, Int. Conf. LPAR, pp.190-201, 1992.
, Proofs of strong normalisation for second order classical natural deduction, Journal of Symbolic Logic, vol.62, issue.4, pp.1461-1479, 1997.
, Strong normalization of ¯ ?µ?µ?µ?µ-calculus with explicit substitutions Proof nets for classical logic, FoSSaCS, pp.423-437777, 2003.
, On the Computational Representation of Classical Logical Connectives, Electronic Notes in Theoretical Computer Science, vol.171, issue.3, pp.85-109, 2007.
DOI : 10.1016/j.entcs.2006.12.039
, Proof nets and the identity of proofs. CoRR, abs/cs, 2006.
, Approaches to polymorphism in classical sequent calculus, ESOP, pp.84-99, 2006.
, ?-Calculus: A Theory of Mobile Processes, 2001.
, Term Rewriting Systems, volume 55 of Cambridge Tracts in Theoretical Comuter Science, 2003.
, Basic Proof Theory, 1996.
DOI : 10.1017/CBO9781139168717
, Strong normalisation of cutelimination in classical logic, Fundamenta Informaticae, vol.45, issue.1 2, pp.123-155, 2001.
, Strong normalisation of cutelimination in classical logic, Fundam. Inf, vol.45, issue.12, pp.123-155, 2001.
, Classical Logic and Computation, 2000.
, Strong normalisation for a Gentzen-like cutelimination procedure, Typed Lambda Calculus and Applications, pp.415-429, 2001.
, Intersection and Union Types for <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi mathvariant="script">X</mml:mi></mml:math>, Electronic Notes in Theoretical Computer Science, vol.136, pp.203-227, 2005.
DOI : 10.1016/j.entcs.2005.06.009
, From X to ?. Representing the classical sequent calculus in ?-calculus, 2007.
URL : https://hal.archives-ouvertes.fr/in2p3-00024918
, Computation with classical sequents, Mathematical Structures in Computer Science, vol.822, issue.03, 2007.
DOI : 10.1145/174675.174707
, The Language ??: Circuits, Computations and Classical Logic, Proc.9th Italian Conf. on Theoretical Computer Science (ICTCS'05) From Frege to Godel. A Source Book tn Mathematical Logic, pp.81-96171, 1967.
DOI : 10.1007/11560586_8