Tracing Lazy Functional Languages
- 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.
- Publication date:
- Local pid:
- Copyright date:
Views and Downloads
If you are the owner of this record, you can report an update to it here: Report update to this record