登入選單

返回Google圖書搜尋

Deriving a Lazy Abstract Machine

Peter Sestoft

出版	Department of Computer Science, Technical University of Denmark, 1994
URL	http://books.google.com.hk/books?id=dSc8GwAACAAJ&hl=&source=gbs_api

註釋

Abstract: "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 arguments, that is, 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, base values, and printing, so the final machine implements all dynamic aspects of a lazy functional language."