Deriving a lazy abstract machine

PETER SESTOFT

doi:10.1017/S0956796897002712

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.

Crossref Citations

This article has been cited by the following publications. This list is generated based on data provided by Crossref.

Sansom, Patrick M. and Peyton Jones, Simon L. 1997. Formally based profiling for higher-order functional languages. ACM Transactions on Programming Languages and Systems, Vol. 19, Issue. 2, p. 334.

Watson, Richard and Salzman, Eric 1997. Advances in Computing Science — ASIAN'97. Vol. 1345, Issue. , p. 336.

Mountjoy, Jon 1998. The spineless tagless G-machine, naturally. p. 163.

Gustavsson, Jörgen 1998. A type based sharing analysis for update avoidance and optimisation. p. 39.

Gustavsson, Jörgen and Sands, David 1999. A Foundation for Space-Safe Transformations of Call-by-Need Programs. Electronic Notes in Theoretical Computer Science, Vol. 26, Issue. , p. 69.

Meehan, Gary and Joy, Mike 1999. Compiling lazy functional programs to Java bytecode. Software: Practice and Experience, Vol. 29, Issue. 7, p. 617.

Claessen, Koen and Sands, David 1999. Advances in Computing Science — ASIAN’99. Vol. 1742, Issue. , p. 62.

Gustavsson, Jörgen 1999. A type based sharing analysis for update avoidance and optimisation. ACM SIGPLAN Notices, Vol. 34, Issue. 1, p. 39.

Moran, Andrew and Sands, David 1999. Improvement in a lazy context. p. 43.

Moran, Andrew Sands, David and Carlsson, Magnus 1999. Coordinatio Languages and Models. Vol. 1594, Issue. , p. 85.

Mountjoy, Jon 1999. The spineless tagless G-machine, naturally. ACM SIGPLAN Notices, Vol. 34, Issue. 1, p. 163.

Baker-Finch, Clem King, David J. and Trinder, Phil 2000. An operational semantics for parallel lazy evaluation. ACM SIGPLAN Notices, Vol. 35, Issue. 9, p. 162.

Cabestre, Frédéric Percebois, Christian and Bodeveix, Jean-Paul 2000. Abstract machine construction through operational semantics refinements. Future Generation Computer Systems, Vol. 16, Issue. 7, p. 753.

Bakewell, Adam and Runciman, Colin 2000. A model for comparing the space usage of lazy evaluators. p. 151.

Baker-Finch, Clem King, David J. and Trinder, Phil 2000. An operational semantics for parallel lazy evaluation. p. 162.

Diehl, Stephan Hartel, Pieter and Sestoft, Peter 2000. Abstract machines for programming language implementation. Future Generation Computer Systems, Vol. 16, Issue. 7, p. 739.

Gustavsson, Jörgen and Sands, David 2001. Possibilities and limitations of call-by-need space improvement. ACM SIGPLAN Notices, Vol. 36, Issue. 10, p. 265.

Pareja, Cristóbal Peña, Ricardo Rubio, Fernando and Segura, Clara 2001. Computer Aided Systems Theory — EUROCAST 2001. Vol. 2178, Issue. , p. 627.

Gustavsson, Jörgen and Sands, David 2001. Possibilities and limitations of call-by-need space improvement. p. 265.

Gustavsson, Jörgen and Svenningsson, Josef 2001. Implementation of Functional Languages. Vol. 2011, Issue. , p. 140.

Download full list

Article contents

Deriving a lazy abstract machine

Abstract

Discussions

This article has been cited by the following publications. This list is generated based on data provided by Crossref.

Article contents

Deriving a lazy abstract machine

Abstract

Discussions

Save article to Kindle

Save article to Dropbox

Save article to Google Drive

Reply to: Submit a response

Your details

You have entered the maximum number of contributors

Conflicting interests