Jeremy Gibbons and Keith Wansbrough Department of Computer Science University ...  Home/Search
Context Related
| web.comlab.ox.ac.uk/ouc...tracing.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: web.comlab.ox.ac.uk/oucl/...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We argue that Ariola and Felleisen's and Maraist, Odersky and Wadler's axiomatization of the callby -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. Keywords Functional programming,... (Update)
Context of citations to this paper: More
.... Our model is a big step operational semantics based very closely on the work of Launchbury (1993) To our knowledge, only Gibbons and Wansbrough (1996) have built a tracing system based on a formally defined reduction model (in their case, the lazy lambda calculus of Ariola et...
...the diagram in Figure 8. In this section we briefly describe the most interesting parts of the implementation. For further details, see [25]. 3.1 Renaming and substitution The first problem we encountered is that Barendregt s variable convention is an unrealistic assumption...
Cited by: More
A Trace Browser for a Lazy Functional Language - Watson, Salzman (1997) (Correct)
Tracing Lazy Functional Languages - Jeremy Gibbons And (1996) (Correct)
Tracing the Evaluation of Lazy Functional Languages: a Model.. - Watson, Salzman (1997) (Correct)
Active bibliography (related documents): More All
0.5: Walk Backwards to Happiness - Debugging by Time Travel - Booth, Jones (1997) (Correct)
0.3: Formal Requirements Engineering: Learning from the students - Gibson (2000) (Correct)
0.3: Teaching Formal Methods: Lessons to learn - Gibson, Méry (1998) (Correct)
Similar documents based on text: More All
0.2: Call-by-Name, Call-by-Value, Call-by-Need, and the Linear.. - Maraist, Odersky (1995) (Correct)
0.2: Notes on Functional Programming with Gofer - Cunningham (1997) (Correct)
0.1: A Modular Monadic Action Semantics - Wansbrough (1997) (Correct)
Related documents from co-citation: More All
3: A call-by-need lambda calculus - Ariola, Felleisen et al. - 1995
3: Debugging in applicative languages (context) - O'Donnell, Hall - 1988
3: Introduction to Functional Programming (context) - Bird, Wadler - 1988
BibTeX entry: (Update)
J. Gibbons and K. Wansbrough. Tracing lazy functional languages. In Proceedings of Computing: The Australasian Theory Symposium", 1996. http://citeseer.ist.psu.edu/article/gibbons96tracing.html More
@techreport{ gibbons95tracing,
author = "J. Gibbons and K. Wansbrough",
title = "Tracing Lazy Functional Languages",
year = "1995",
url = "citeseer.ist.psu.edu/article/gibbons96tracing.html" }
Citations (may not include all citations):729 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1981
333 An Introduction to Functional Programming (context) - Bird, Wadler - 1988
254 Comprehending monads - Wadler - 1990
179 The lazy lambda calculus - Abramsky - 1990
169 The call-by-need lambda calculus - Ariola, Felleisen - 1994
169 A call-by-need lambda calculus - Ariola, Felleisen et al. - 1995
113 a non-strict purely functional language (context) - Hudak, Jones et al. - 1992
87 call-by-value and the lambda calculus (context) - Plotkin - 1975
64 The Chalmers Lazy-ML compiler (context) - Augustsson, Johnsson - 1989
39 Department of Computer Science (context) - Jones - 1991
24 The call-by-need lambda calculus - Maraist, Odersky et al. - 1994
23 Theoretical Computer Science (context) - Stoughton - 1988
23 and the lambda calculus (context) - Felleisen, Friedman et al. - 1987
18 and the linear lambda calculus (context) - Maraist, Odersky et al. - 1995
18 Towards a portable lazy functional declarative debugger - Naish, Barbour - 1995
10 Debugging in applicative languages (context) - O'Donnell, Hall - 1988
5 A METAFONT-like system with PostScript output - Hobby - 1989
5 A symbolic calculator for nonstrict functional programs (context) - Goldson - 1994
4 A call-by-need lambda calculus (context) - Wadler - 1994
3 Tracing lazy functional languages - Wansbrough - 1995
3 The Calculator Project: Formal reasoning about programs - Reeves, Goldson et al. - 1994
2 Towards a Haskell debugger - Sparud - 1995
2 A visual Miranda machine (context) - Auguston, Reinfelds - 1994
1 Private email communication (context) - Maraist - 1995
1 A normaliser for pure - calculus (context) - Raffalli - 1995
1 Debugging techniques for functional languages (context) - Watson - 1994
Documents on the same site (http://web.comlab.ox.ac.uk/oucl/work/jeremy.gibbons/publications/index.html): More
Computing Downwards Accumulations on Trees Quickly - Gibbons (1996) (Correct)
Bridging the Algorithm Gap: A Linear-time Functional Program .. - de Moor, Gibbons (1999) (Correct)
Dotted and Dashed Lines in METAFONT - Gibbons (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC