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

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Cite

Cite this record

APA Style

Gibbons, J., & Wansbrough, K. (1996). Tracing Lazy Functional Languages. Computing: The Australasian Theory Seminar.

MLA Style

Gibbons, J., and K. Wansbrough. “Tracing Lazy Functional Languages.” Computing: The Australasian Theory Seminar, Melbourne, 1996.

Chicago Style

Gibbons, J, and K Wansbrough. 1996. “Tracing Lazy Functional Languages.” In Computing: The Australasian Theory Seminar. Melbourne.
Share
Print

Authors

+ Gibbons, J More by this author

Institution:: University of Oxford
Division:: MPLS
Department:: Computer Science
Role:: Author

+ Wansbrough, K More by this author

Role:: Author

Publisher:: Melbourne
Host title:: Computing: The Australasian Theory Seminar
Publication date:: 1996-01-01

UUID:: uuid:2c3181eb-789a-41d5-a1e2-fdc8e2a74c63
Local pid:: cs:2343
Deposit date:: 2015-03-12

Terms of use

Copyright date:: 1996

Licence:: Terms and Conditions of Use for Oxford University Research Archive

Views and Downloads

About views and downloads

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

TO TOP