Evaluation under lambda abstraction

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

Volumn 1292, Issue , 1997, Pages 259-273

  Xi, Hong Wei ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Lambda calculus; Partial evaluation; Run time code generation

Indexed keywords

ABSTRACTING; CALCULATIONS; COMPUTATION THEORY; COMPUTER PROGRAMMING LANGUAGES; DIFFERENTIATION (CALCULUS); LOGIC PROGRAMMING; SEMANTICS;

EVALUATION FUNCTION; LAMBDA CALCULUS; LAZY FUNCTIONAL PROGRAMMING; OPERATIONAL SEMANTICS; PARTIAL EVALUATION; PROGRAM TRANSFORMATIONS; RUN-TIME CODE GENERATION; WEAK HEAD NORMAL FORMS;

FUNCTIONAL PROGRAMMING;

EID: 67649855641     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0033849     Document Type: Conference Paper

References (24)

1. M. Abadi, L. Cardelli, P.-L. Curien, and I.-I. Levy (1991), Explicit substitutions, Journal of Functional Programming, 4(1), pp. 375-416.
2. S. Abramsky (1990), The lazy lambda calculus. In D. Turner, editor, Declarative Programming, Addison-Wesley Publishing Company.
3. Z.M. Ariola, M. Felleisen, J. Maraist, M. Odersky and P. Wadler (1996), A Call- by-Need Lambda Calculus, Proceedings of the 22nd ACM Symposium on Principles of Programming Languages, San Francisco, pp. 233-246
4. H.P. Barendregt, The Lambda Calculus: Its Syntax and Semantics, North-Holland, Amsterdam, 1984.
5. R. Bloo, F. Kamareddine and R. Nederpelt (1996), The Barendregt cube with definitions and generalised reduction, Information and Computation, vol 126(2), pp. 123-143
6. A useful lambda-notation, Theoretical Computer Science, vol. 155(1), pp 85-109.
7. R. Davies and F. Pfenning (1996), A Modal Analysis of Staged Computation, In Proceedings of the 23rd ACM Symposium on Principles of Programming Languages, pp. 206-209
8. A.J. Field and P.G. Harrison (1988), Functional Programming, Addison-Wesley Publishing Company.
9. J.R. Hindley (1978), Reductions of residuals are finite, Trans. Amer. Math. Soc. 240, pp. 345-361.
10. G. Huet (1994), Residual Theory in A-Calculus: A Formal Development, Journal of Functional Programming Vol. 4, PP- 371-394.
11. R.J.M. Hughes (1984), The design and implementation of programming languages, Ph.D. thesis, University of Oxford.
12. C.K. Holst and C.K. Gomard (1991), Partial Evaluation is Fuller Laziness, in Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pp. 223-233.
13. R. Gluck and J. j0rgensen (1995), Efficient multi-level generating extensions for program specialisation. In S.D. Swierstra and M. Hermenegildo, editors, Programming Languages, Implementations Logics and Programs, Springer- Verlag LNCS 982, pp. 259-278.
14. T. Johnsson (1985), Lambda lifting: transforming programs to recursive equations, In Proceedings of the Conference on Functional programming Languages and Computer Architecture, Nancy, pp. 190-203.
15. F. Kamareddine and R. Nederpelt (1996), A useful lambda-notation, Theoretical Computer Science, vol. 155(1), pp 85-109.
16. J. Lamping (1990), An Algorithm for Optimal Lambda Calculus Reduction, In Seventeenth ACM Symposium on Principles of Programming Languages, pp 1630.
17. P.J. Landin (1964), The mechanical evaluation of expressions, BCS Computing Journal 6(4), pp. 308-320.
18. S.L. Peyton Jones (1991), A fully-lazy A-lifter in Haskell, Software practice and experience 21.
19. G.D. Plotkin (1975), Call-by-name, call-by-value and the lambda-calculus, Theoretical Computer Science 1, pp. 125-159.
20. C. Reade (1989), Elements of Functional Programming, Addison-Wesley Publishing Company.
21. H. Xi (1996), Separating developments in A-calculus: http://www.cs.emu.edu/~hwxi/papers/SepDev.ps
22. H. Xi (1996), Evaluation under lambda abstraction: http://www.cs.emu.edu/~hwxi/papers/EvUdLam.ps
23. H. Xi (1997), Generalized Lambda-Calculi: http://www.cs.emu.edu/~hwxi/papers/GLam.ps
24. N. Yoshida (1993), Optimal reduction in weak A-calculus with shared environments. In Proc. ACM conference on Functional Programming Languages and Computer Architecture, Copenhagen