Conference item icon

Conference item

Tracing Lazy Functional Languages

Abstract:
We argue that Ariola and Felleisen's and Maraist, Odersky and Wadler's axiomatization of the call-by-need lambda calculus forms a suitable formal basis for tracing evaluation in lazy functional languages. In particular, it allows a one-dimensional textual representation of terms, rather than requiring a two-dimensional graphical representation using arrows. We describe a program LetTrace, implemented in Gofer and tracing lazy evaluation of a subset of Gofer.

Actions


Authors


More by this author
Institution:
University of Oxford
Department:
Mathematical, Physical and Life Sciences Division - Department of Computer Science
Keith Wansbrough More by this author
Publisher:
Melbourne
Publication date:
1996
URN:
uuid:2c3181eb-789a-41d5-a1e2-fdc8e2a74c63
Local pid:
cs:2343

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP