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.
Cite
CITATION STYLE
Purushothaman, S., & Seaman, J. (1992). An adequate operational semantics of sharing in lazy evaluation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 582 LNCS, pp. 435–450). Springer Verlag. https://doi.org/10.1007/3-540-55253-7_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
