Hostname: page-component-586b7cd67f-rcrh6 Total loading time: 0 Render date: 2024-11-23T19:59:51.514Z Has data issue: false hasContentIssue false
  • English
  • Français

Deriving a lazy abstract machine

Published online by Cambridge University Press:  01 May 1997

PETER SESTOFT
PETER SESTOFT
Affiliation:
Department of Mathematics and Physics, Royal Veterinary and Agricultural University, Thorvaldsensvej 40, DK-1871 Frederiksberg C, Denmark (e-mail: [email protected])
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We derive a simple abstract machine for lazy evaluation of the lambda calculus, starting from Launchbury's natural semantics. Lazy evaluation here means non-strict evaluation with sharing of argument evaluation, i.e. call-by-need. The machine we derive is a lazy version of Krivine's abstract machine, which was originally designed for call-by-name evaluation. We extend it with datatype constructors and base values, so the final machine implements all dynamic aspects of a lazy functional language.

Type
Research Article
Information
Journal of Functional Programming , Volume 7 , Issue 3 , May 1997 , pp. 231 - 264
Copyright
© 1997 Cambridge University Press
Submit a response

Discussions

No Discussions have been published for this article.