An abstract factorization theorem for explicit substitutions, RTA, pp.6-21, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00780344
Beta reduction is invariant, indeed (long version) Available at http ,
DOI : 10.1145/2603088.2603105
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.675.7231
On the invariance of the unitary cost model for head reduction, RTA, pp.22-37, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00780349
On the Value of Variables, 2014. ,
Distilling Abstract Machines, 2014. ,
DOI : 10.1145/2692915.2628154
A nonstandard standardization theorem, Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '14, pp.659-670, 2014. ,
DOI : 10.1145/2535838.2535886
Parallel beta reduction is not elementary recursive, POPL, pp.303-315, 1998. ,
DOI : 10.1006/inco.2001.2869
URL : http://doi.org/10.1006/inco.2001.2869
Closing the gap between runtime complexity and polytime computability, RTA, pp.33-48, 2010. ,
Light types for polynomial time computation in lambda calculus, Information and Computation, vol.207, issue.1, pp.41-62, 2009. ,
DOI : 10.1016/j.ic.2008.08.005
URL : https://hal.archives-ouvertes.fr/hal-00012752
The Lambda Calculus ? Its Syntax and Semantics, 1984. ,
Light Logics and the Call-by-Value Lambda Calculus, Logical Methods in Computer Science, vol.4, issue.4, 2008. ,
DOI : 10.2168/LMCS-4(4:5)2008
Combinatory Logic. Studies in logic and the foundations of mathematics, 1958. ,
The weak lambda calculus as a reasonable machine, Theor. Comput. Sci, vol.398, issue.1-3, pp.32-50, 2008. ,
On constructor rewrite systems and the lambda calculus, Logical Methods in Computer Science, vol.8, issue.3, p.2012 ,
URL : https://hal.archives-ouvertes.fr/hal-00909372
Functional programming in sublinear space, ESOP, pp.205-225, 2010. ,
Generalizing Automath by Means of a Lambda-Typed Lambda Calculus, Mathematical Logic and Theoretical Computer Science, number 106 in Lecture Notes in Pure and Applied Mathematics, pp.71-92, 1987. ,
DOI : 10.1016/S0049-237X(08)70213-1
A Soft Type Assignment System for ??-Calculus, CSL, pp.253-267, 2007. ,
DOI : 10.1007/978-3-540-74915-8_21
A logical account of PSPACE, POPL, pp.121-131, 2008. ,
URL : https://hal.archives-ouvertes.fr/hal-00342323
Optimality and inefficiency: What isn't a cost model of the lambda calculus, ICFP, pp.92-101, 1996. ,
Réductions correctes et optimales dans le lambda-calcul, Thése d'Etat, 1978. ,
Local Bigraphs and Confluence: Two Conjectures, Electronic Notes in Theoretical Computer Science, vol.175, issue.3, pp.65-73, 2007. ,
DOI : 10.1016/j.entcs.2006.07.035
URL : http://doi.org/10.1016/j.entcs.2006.07.035
The fine-structure of lambda calculus, 1992. ,
The Implementation of Functional Programming Languages. International Series in Computer Science, 1987. ,
Stratified Bounded Affine Logic for Logarithmic Space, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), pp.411-420, 2007. ,
DOI : 10.1109/LICS.2007.45
On tape versus core an application of space efficient perfect hash functions to the invariance of space, Proceedings of the sixteenth annual ACM symposium on Theory of computing , STOC '84, pp.391-400, 1984. ,
DOI : 10.1145/800057.808705
The typed ??-calculus is not elementary recursive, Theoretical Computer Science, vol.9, issue.1, pp.73-81, 1979. ,
DOI : 10.1016/0304-3975(79)90007-0
Semantics and pragmatics of the lambda-calculus, 1971. ,