Minimal classical logic and control operators, ICALP: Annual International Colloquium on Automata, Languages and Programming, vol.2719, pp.871-885, 2003. ,
A symmetric lambda calculus for classical program extraction, Information and Computation, vol.125, issue.2, pp.103-117, 1996. ,
Intersection and union types: syntax and semantics. Information and Computation, vol.119, pp.202-230, 1995. ,
A filter lambda model and the completeness of type assignment, Journal of Symbolic Logic, vol.48, issue.4, pp.931-940, 1983. ,
Lambda terms for natural deduction, sequent calculus and cut-elimination, Journal of Functional Programming, vol.10, issue.1, pp.121-134, 2000. ,
A computational interpretation of the ?µ-calculus, Proceedings of Symposium on Mathematical Foundations of Computer Science, vol.1450, pp.336-345, 1998. ,
Union types for semistructured data, Proceedings of the International Database Programming Languages Workshop, vol.1686, 1998. ,
Principal type schemes and ?-calculus semantics, To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pp.535-560, 1980. ,
Symmetry and interactivity in programming. Archive for Mathematical Logic, 2001. ,
URL : https://hal.archives-ouvertes.fr/hal-00003868
Abstract machines, control, and sequents, Applied Semantics, International Summer School, APPSEM, vol.2395, pp.123-136, 2000. ,
The duality of computation, Proceedings of the 5th ACM SIGPLAN International Conference on Functional Programming (ICFP'00), 2000. ,
URL : https://hal.archives-ouvertes.fr/inria-00156377
On the relation between the ?µ-calculus and the syntactic theory of sequential control, Proceedings of the (th International Conference on Logic Programming and Automated Reasoning, vol.822, pp.31-43, 1994. ,
A new constrcutive logic: classical logic, Mathematical Structures in Computer Science, vol.1, issue.3, pp.255-296, 1991. ,
A formulae-as-types notion of control, Proceedings of the 17th Annual ACM Symposium on Principles Of Programming Languages, pp.47-58, 1990. ,
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. ,
Coppo-Dezani types do not correspond to propositional logic, Theoretical Computer Science, vol.28, issue.1-2, pp.235-236, 1984. ,
On the denotational semantics of the pure lambda-mu calculus, 2004. ,
Call-by-value, call-by-name, and strong normalization for the classical sequent calculus, Electronic Notes in Theoretical Computer Science, vol.86, 2003. ,
URL : https://hal.archives-ouvertes.fr/hal-00150290
A Curry-Howard foundation for functional computation with control, Proceedings of the 24th Annual ACM Symposium on Principles Of Programming Languages, pp.215-227, 1997. ,
From polyvariant flow information to intersection and union types, J. Funct. Programming, vol.11, issue.3, pp.263-317, 2001. ,
An algorithmic interpretation of classical natural deduction, Proc. of Int. Conf. on Logic Programming and Automated Reasoning, LPAR'92, pp.190-201, 1992. ,
Proofs of strong normalisation for second order classical natural deduction, The Journal of Symbolic Logic, vol.62, issue.4, pp.1461-1479, 1997. ,
Programming with intersection types, union types, and polymorphism, 1991. ,
Strong normalization of ?µ?µ?µ?µ-calculus with explicit substitutions, Foundations of Software Science and Computation Structures, 7th International Conference, vol.2987, pp.423-437, 2004. ,
URL : https://hal.archives-ouvertes.fr/hal-00004321
Normalization as homomorphic image of cut-elimination, Annals of Mathematical Logic, vol.12, pp.323-357, 1977. ,
A type assignment for the strongly normalizable ?-terms, To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pp.561-577, 1980. ,
Design of the programming language Forsythe, 1996. ,
Strong normalisation of cut-elimination in classical logic, Typed Lambda Calculus and Applications, vol.1581, pp.365-380, 1999. ,
Call-by-value is dual to call-by-name, Proceedings of the 8th International Conference on Functional Programming, 2003. ,
A calculus with polymorphic and polyvariant flow types, J. Funct. Programming, vol.12, issue.3, pp.183-227, 2002. ,