Optimal derivations in weak lambda-calculi and in orthogonal terms rewriting systems.

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 1991, Pages 255-269

  Maranget, Luc ^a  

^a INRIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; PATHOLOGY; SYNTACTICS;

CALL-BY-NAME; FUNCTIONAL LANGUAGES; LAMBDA-CALCULI; OPTIMALITY; SHARING STRATEGIES; SYNTACTIC PROPERTIES; TERM REWRITING SYSTEMS; TERMS REWRITING SYSTEMS;

BIOMINERALIZATION;

EID: 18944367367     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/99583.99618     Document Type: Conference Paper

References (19)

1. M. Abadi, L. Cardelli, P.-L. Curien, J.-J. Levy, "Explicit substitutions". POPL90.
2. L. Augustsson, "Compiling Lazy Functional Languages Part II". PhD thesis, Chalmers University of Technology, Sweden, 1987.
3. G. Berry, J.-J. Levy, "Minimal and Optimal Computations of Recursive Programs". JAMA Vol. 26, No 1, 1979.
4. G. Cousineau, P.-L. Curien, M. Mauny, "The Categorical Abstract Machine". Functional Programming Languages an Computer Architecture, 1985, LCNS.
5. J. Field, "On Laziness and Optimality in Lambda Interpreters : Tools for Specification and Analysis". POPL90.
6. T. Hardin, J.-J. Levy, "A confluent Calculus of Substitution". France-Japan Artificial Intelligence and Computer Science Symposium, Izu, 1989.
7. J.R. Hindley, J.P. Seldin, "Introduction to Combinators and A-calculus". London Mathematical Society, Students Texts 1, Cambridge University Press, 1986.
8. B.T. Howard, J.C. Mitchell, "Operational and Axiomatic Semantics of PCF". L& FP90.
9. G. Huet, J-J. Levy, "Call by Need Computations in Non-Ambiguous Linear Term Rewriting Systems". INRIA, technical report 359, 1979.
10. T. Johnsson, "Compiling Lazy Functional Languages". PhD thesis, Chalmers University of Technology, Sweden, 1987.
11. V. K. Kathail, "Optimal Interpreters for Lambdacalculus Based Functional Languages". Communication at the SEMAGRAPH workshop, Paris, April 1990.
12. J.R. Kennaway, "An Outline of Some Results of Staples on Optimal Reduction Orders in Replacements Systems". Internal Report CSA/19/1984.
13. J. Lamping, "An Algorithm for Optimal Lambda Calculus Reduction". POPL90.
14. X. Leroy, "The Zinc experiment : An economical implementation of the ML Language". INRIA, technical report 117, 1989.
15. J.-J. Levy, "Reductions correctes et optimales clans le calcul". Th2se de Doctorat dEtat, University Paris VII, 1978.
16. M. ODonnell, "Computing in Systems Described by Equations". LNCS No 58, Eds G. Goos and J. Hartmanis, Springer, 1977.
17. S. L. Peyton Jones, "The Implementation of Functional Programming Languages". Prentice-Hall, 1987.
18. G.D. Plotkin, "LCF Considered as a Programming Language". Theoretical Computer Science, 5:225-255, 1977.
19. J. Vuillemin, "Syntaxe, S4mantique et axiomatique dun language de programmation simple". These de doctorat dat, Universite Paris VI, 1974.