Abstract
We present Lazy-PCF+Shar, an extension of PCF, that deals with lazy evaluation and explicit substitutions to model the sharing engendered by the lazy evaluation strategy. We present a natural operational semantics for Lazy-PCF+Shar and show that it is equivalent to the standard fixed-point semantics. Sharing is modeled by explicit substitutions, which require a great deal of careful attention in the proof.
Supported in part by NSF grants CDA-89-14587 and CCR-90-04121
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Levy. Explicit Substituition. In Proc of XVII ACM Symposium on Principles of Programming Languages, ACM, Jan 1990.
S. Abramsky. The Lazy Lambda Calculus, pages 65–116. Addison-Wesley, 1990.
A. Bloss. Path Analysis and the Optimization of Non-Strict Functional Languages. PhD thesis, Yale University, 1989.
M. Draghicescu and S. Purushothaman. Compositional Analysis of Evaluation Older and its Application. In Proc of 1990 ACM Symposium on LISP and Functional Programming, 6 pages 242–250, 1990.
J. Field. On Laziness and Optimality in Lambda Interpreters: Tools for Specification and Analysis. In Proc of XVII ACM Symposium on Principles of Programming Languages, ACM, Jan 1990.
J. Guzman and P. Hudak. Single-Threaded Polymorphic Lambda Calculus. In V Annual IEEE Symposium on Logic in Computer Science, 1990.
B. Howard and J. Mitchell. Operational and Axiomatic Semantics of PCF. In Proc of 1990 ACM Symposium on LISP and Functional Programming, 6 pages 298–306, 1990
L. Maranget. Optimal Derivations in Weak Lambda-Calculi and in Orthogonal Term Rewriting Systems. In Proc of XVIII ACM Symposium on Principles of Programming Languages, pages 255–269, ACM, Jan 1991.
S. Peyton-Jones. The Implementation of Functional Programming Languages. Prentice-Hall, 1987.
G. Plotkin. LCF considered as a Programming Language. Theoretical Computer Science, 5:223–255, 1977.
S. Purushothaman and Jill Seaman. An Adequate Operational Semantics of Sharing in Lazy Evaluation. Tech Report PSU-CS-91-18, Penn State Univ., July 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Purushothaman, S., Seaman, J. (1992). An adequate operational semantics of sharing in lazy evaluation. In: Krieg-Brückner, B. (eds) ESOP '92. ESOP 1992. Lecture Notes in Computer Science, vol 582. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55253-7_26
Download citation
DOI: https://doi.org/10.1007/3-540-55253-7_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55253-6
Online ISBN: 978-3-540-46803-5
eBook Packages: Springer Book Archive