An operational semantics of sharing in lazy evaluation

Science of Computer Programming

Volumn 27, Issue 3, 1996, Pages 289-322

  Seaman, Jill ^a   Iyer, S Purushothaman ^b  

^a UNIVERSITY OF LOUISIANA AT LAFAYETTE   (United States)

^b North Carolina State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; FORMAL LOGIC; OPTIMIZATION;

CALL BY NAME EVALUATION; CALL BY NEED EVALUATION; FUNCTIONAL LANGUAGES; LAMBDA CALCULUS; LAZY EVALUATION; SEMANTICS;

PROGRAMMING THEORY;

EID: 0030284459     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-6423(96)00012-3     Document Type: Article

References (19)

1. M. Abadi, L. Cardelli, P.-L. Curien and J.-J. Levy, Explicit substitutions, J. Funct. Program. 1(4) (1991) 375-415.
2. H. Barendregt, The Lambda Calculus: Its Syntax and Semantics, Studies in Logic and the Foundations of Mathematics, Vol. 103 (Elsevier, Amsterdam, 1984) Revised edition.
3. A. Bloss, Path analysis and the optimization of non-strict functional languages, Ph.D. thesis, Yale University, 1989.
4. P. Crégut, An abstract machine for the normalization of λ-terms, in: Proc. ACM Conf. on Lisp and Functional Programming, Nice, France (1990) 333-340.
5. M. Draghicescu and S. Purushothaman, A uniform treatment of order of evaluation and aggregate update, Theoret. Comput. Sci. 118(2) (1993) 231-262.
6. J. Fairbairn and S.C. Wray. TIM: a simple, lazy abstract machine to execute supercombinators, in: G. Kahn, ed., Proc. Conf. on Functional Programming Languages and Computer Architecture, Portland, Oregon, Lecture notes in Computer Science, Vol. 274 (Springer, Berlin, 1987) 34-45.
7. J. Field, On laziness and optimality in lambda interpreters: Tools for specification and analysis, in: Proc. Seventeenth Symp. on Principles of Programming Languages, San Francisco (1990) 1-15.
8. C.A. Gunter, Semantics of Programming Languages: Structures and Techniques, Foundations of Computing (MIT Press, Cambridge, MA, 1992).
9. J. Guzman and P. Hudak, Single-threaded polymorphic lambda calculus, in: Proc. of the Fifth Annual IEEE Symp. on Logic in Computer Science (1990).
10. T. Johnsson, Efficient compilation of lazy evaluation, in: Proc. ACM SIGPLAN Symp. on Compiler Constuction (1984) 58-69.
11. G. Kahn, Natural semantics, Rapport de Recherche 601, INRIA, Sophia-Antipolis, France, 1987.
12. J. Lamping, An algorithm for optimal lambda calculus reduction, in: Proc. Conf. on Principles of Programming Languages (1990).
13. J. Launchbury, A natural semantics for lazy evaluation, in: Proc. Twentieth Symp. on Principles of Programming Languages, Charleston, South Carolina (1993) 144-154.
14. L. Maranget, Optimal derivations in weak lambda-calculi and in orthogonal term rewriting systems, in: Proc. Eighteenth Symp. on Principles of Programming Languages, Orlando, FL (1991) 255-269.
15. G. Plotkin, LCF considered as a programming language, Theoret. Comput. Sci. 5(3) (1977) 223-255.
16. S. Purushothaman and J. Seaman, An adequate operational semantics of sharing in lazy evaluation, in: Proc. Fourth European Symp. on Programming, Rennes, France, Lecture Notes in Computer Science, Vol. 582 (Springer, Berlin, 1992) 435-450.
17. S. Purushothaman and J. Seaman, From operational definitions to abstract semantics, in: Proc. Conf. on Functional Programming Languages and Computer Architecture, Copenhagen (1993) 276-285.
18. J. Seaman and A. Felty, Proving properties about a lazy functional language with the Coq Proof Development System, Available by anonymous ftp: att.research.com, 1993.
19. N. Yoshida, Optimal reduction in weak-λ-calculus with shared environments, in: Proc. Conf. on Functional Programming Languages and Computer Architecture, Copenhagen (1993) 243-252.