Domains and Lambdacalculi, 2003. ,
Categories, Types and Structures . M.I, 1991. ,
A lambdacalculus with constructors, RTA, pp.181-196, 2006. ,
URL : https://hal.archives-ouvertes.fr/hal-00150884
The ??-calculus with constructors: Syntax, confluence and separation, Journal of Functional Programming, vol.19, issue.05, pp.581-631, 2009. ,
DOI : 10.1145/1034774.1034775
URL : https://hal.archives-ouvertes.fr/hal-00800559
The Lambda Calculus: Its Syntax and Semantics, volume 103 of Studies in Logic and The Foundations of Mathematics, 1984. ,
The Programming Language LISP: Its Operation and Applications, 1964. ,
Intersection and union types, pp.202-230, 1995. ,
DOI : 10.1007/3-540-54415-1_69
A discrimination algorithm inside lambda-beta-calculus The Hague, Cho57] Noam Chomsky. Syntactic Structures, pp.265-292, 1957. ,
A Set of Postulates for the Foundation of Logic, The Annals of Mathematics, vol.33, issue.2, pp.346-366, 1932. ,
DOI : 10.2307/1968337
A note on the Entscheidungsproblem, The Journal of Symbolic Logic, vol.166, issue.01, pp.40-41, 1936. ,
DOI : 10.1007/BF01475439
The Calculi of Lambda ConversionAM-6), Annals of Mathematics Studies, 1941. ,
Calcul de Réécriture : Fondements et Applications, 2001. ,
The Rewriting Calculus as a Semantics of ELAN, ASIAN, pp.84-85, 1998. ,
DOI : 10.1007/3-540-49366-2_7
The simply typed rewriting calculus, dB91] Nicolaas Govert de Bruijn. Telescopic mappings in typed lambda calculus. Information and Computation, pp.189-204, 1991. ,
DOI : 10.1016/S1571-0661(05)80127-6
URL : https://hal.archives-ouvertes.fr/inria-00099052
Lambda-calculus schemata, Lisp and Symbolic Computation, vol.6, issue.3-4, pp.259-288, 1993. ,
A categorical semantics for the parallel lambda-calculus, 2009. ,
URL : https://hal.archives-ouvertes.fr/inria-00424248
Refinement types for ml, Programming Language Design and Implementation, pp.268-277, 1991. ,
Typing untyped lambda-terms, or reducibility strikes again! Annals of Pure and Applied Logic, pp.231-270, 1998. ,
Strong Normalization and Typability with Intersection Types, Notre Dame Journal of Formal Logic, vol.37, issue.1, pp.44-52, 1996. ,
DOI : 10.1305/ndjfl/1040067315
Linear logic, Theoretical Computer Science, vol.50, issue.1, pp.1-102, 1987. ,
DOI : 10.1016/0304-3975(87)90045-4
URL : https://hal.archives-ouvertes.fr/inria-00075966
Locus solum: From the rules of logic to the logic of rules, CSL, p.38, 2001. ,
Proofs and Types, 1989. ,
Zum entscheidungsproblem des logischen funktionenkalküls Semantic domains, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B), pp.433-443, 1933. ,
On Undecidable Propositions of Formal Mathematical Systems, Meltzer, 1934. Lecture Notes Taken by Kleene and Rosser at the Institute for Advanced Study, pp.39-74 ,
Continuation models are universal for lambda-mu-calculus The pattern calculus, LICS, pp.387-395911, 1997. ,
The pattern calculus, ACM Transactions on Programming Languages and Systems, vol.26, issue.6, 2009. ,
DOI : 10.1145/1034774.1034775
Pure Pattern Calculus, ESOP, pp.100-114, 2006. ,
DOI : 10.1006/inco.1996.0004
URL : https://hal.archives-ouvertes.fr/hal-00148846
General recursive functions of natural numbers, Mathematische Annalen, vol.112, issue.1, pp.727-742, 1936. ,
Lambda-definability and recursiveness, Duke Mathematical Journal, vol.2, pp.340-353, 1936. ,
Lambda-Calculus, Types and Models, 1993. ,
URL : https://hal.archives-ouvertes.fr/cel-00574575
Negation versus implication, Logical Frameworks, p.223, 1991. ,
Categories for the Working Mathematician, 1971. ,
DOI : 10.1007/978-1-4612-9839-7
Continuation semantics or expressing implication by negation, 1993. ,
Recursive functions symbolic expressions and their computation by machine, Part I, Communications of the ACM, vol.3, issue.4, pp.184-195, 1960. ,
DOI : 10.1145/367177.367199
A type-inference approach to reduction properties and semantics of polymorphic expressions (summary), LISP and Functional Programming, pp.308-319, 1986. ,
Polymorphic type inference and containment. Information and Computation, pp.211-249, 1988. ,
Notions of computation and monads. Information and Computation, pp.55-92, 1991. ,
The definition of Standard ML, 1990. ,
Call-by-need and continuation-passing style, Lisp and Symbolic Computation, pp.57-82, 1994. ,
DOI : 10.1007/BF01019945
Lambda-my-calculus: An algorithmic interpretation of classical natural deduction, LPAR, pp.190-201, 1992. ,
Strong normalization for second order classical natural deduction, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science, pp.39-46, 1993. ,
DOI : 10.1109/LICS.1993.287602
Semantics of Typed Lambda-Calculus with Constructors, Logical Methods in Computer Science, vol.7, issue.1, 2011. ,
DOI : 10.2168/LMCS-7(1:2)2011
URL : https://hal.archives-ouvertes.fr/hal-00578077
Programming with intersection types, union types, and polymorphism, 1991. ,
Call-by-name, call-by-value and the ??-calculus, Theoretical Computer Science, vol.1, issue.2, pp.125-159, 1975. ,
DOI : 10.1016/0304-3975(75)90017-1
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
URL : http://doi.org/10.1016/0304-3975(77)90044-5
Définitions par réécriture dans le lambda-calcul : confluence , réductibilité et typage, 2007. ,
On the Stability by Union of Reducibility Candidates, FoSSaCS, pp.317-331, 2007. ,
DOI : 10.1007/978-3-540-71389-0_23
URL : https://hal.archives-ouvertes.fr/hal-00123116
Classical logic, continuation semantics and abstract machines, Journal of Functional Programming, vol.8, issue.6, pp.543-572, 1998. ,
Outline of a mathematical theory of computation, 1970. ,
Reasoning about programs in continuation-passing style, LISP and Functional Programming, pp.288-298, 1992. ,
Mathematical Theory of Domains. Number 22 in Cambridge Tracts in Theoretical Computer Science, 1994. ,
Intensional interpretations of functionals of finite type I, The Journal of Symbolic Logic, vol.91, issue.02, pp.198-212, 1967. ,
DOI : 10.1007/BF01447860
Extensional models for polymorphism, In TAPSOFT, vol.2, pp.291-307, 1987. ,
Esquisse d'une syntaxe structurale, Klincksieck, 1953. ,
On computable numbers, with an application to the entscheidungsproblem, pp.230-265, 1936. ,
Computability and ??-definability, The Journal of Symbolic Logic, vol.42, issue.04, pp.153-163, 1937. ,
DOI : 10.2307/2371045
A simple proof of the undecidability of strong normalisation, Mathematical Structures in Computer Science, vol.13, issue.1, pp.5-13, 2003. ,
DOI : 10.1017/S096012950200381X
Complete restrictions of the intersection type discipline, vO90] Vincent van Oostrom. Lambda calculus with patterns, pp.135-163, 1990. ,
DOI : 10.1016/0304-3975(92)90297-S
Typability and type-checking in the second-order lambda-calculus are equivalent and undecidable, pp.176-185, 1994. ,
Une Théorie des Constructions Inductives, 1994. ,
The formal semantics of programming languages an introduction. Foundation of computing series, 1993. ,