Efficient reductions with director strings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2706, Issue , 2003, Pages 46-60

  Sinot, François Règis ^a,b   Fernàndez, Maribel ^a   Mackie, Ian ^a  

^a KING'S COLLEGE LONDON   (United Kingdom)

^b ECOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DIFFERENTIATION (CALCULUS);

ABSTRACT MACHINES; DIRECTOR STRINGS; EVALUATION STRATEGIES; EXPLICIT SUBSTITUTIONS; FUNCTIONAL PROGRAMS; LAMBDA ABSTRACTION; REDUCTION STRATEGY; WEAK HEAD NORMAL FORMS;

CALCULATIONS;

EID: 21144441473     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44881-0_5     Document Type: Conference Paper

References (15)

1. M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Lèvy. Explicit substitutions. Journal of Functional Programming, 1(4):375–416, 1991.
2. Z. M. Ariola, M. Felleisen, J. Maraist, M. Odersky, and P. Wadler. A call-byneed lambda calculus. In Proc. of the 22nd ACM Symposium on Principles of Programming Languages (POPL’95), pages 233–246. ACM Press, 1995.
3. A. Asperti, C. Giovanetti, and A. Naletto. The bologna optimal higher-order machine. Journal of Functional Programming, 6(6):763–810, 1996.
4. U. Berger, M. Eberl, and H. Schwichtenberg. Normalization by evaluation, 1998.
5. P.-L. Curien, T. Hardin, and J.-J. Lèvy. Confluence properties of weak and strong calculi of explicit substitutions. Journal of the ACM, 43(2):362–397, 1996.
6. N. G. de Bruijn. Lambda calculus notation with nameless dummies. Indagationes Mathematicae, 34:381–392, 1972.
7. M. Fernàndez and I. Mackie. Closed reductions in the λ-calculus. In J. Flum and M. Rodrìguez-Artalejo, editors, Proc. of Computer Science Logic (CSL’99), number 1683 in Lecture Notes in Computer Sciences. Springer, 1999.
8. M. Fernàndez and I. Mackie. Director strings and explicit substitutions. WESTAPP’ 01, Utrecht, 2001.
9. G. Gonthier, M. Abadi, and J.-J. Lèvy. The geometry of optimal lambda reduction. In Conference Record of the 19th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1992.
10. T. Hardin, L. Maranget, and B. Pagano. Functional runtime systems within the lambda-sigma calculus. Journal of Functional Programming, 8(2):131–176, 1998.
11. J. Kennaway and M. Sleep. Director strings as combinators. ACM Transactions on Programming Languages and Systems, 10(4):602–626, 1988.
12. J. Lamping. An algorithm for optimal lambda calculus reductions. In Proc. 17th ACM Symposium on Principles of Programmining Languages, 1990.
13. F. Lang. Modèles de la β-rèduction pour les implantations. PhD thesis, Ècole Normale Supèrieure de Lyon, 1998.
14. F.-R. Sinot. Calculs avec chaînes directrices: Implèmentation efficace du λ- calcul, 2002. Master’s Thesis (Mèmoire de DEA), Ècole Normale Supèrieure, http://www.dcs.kcl.ac.uk/pg/francois/DEA/.
15. N. Yoshida. Optimal reduction in weak lambda-calculus with shared environments. Journal of Computer Software, 11(6):3–18, 1994.