A Declarative Approach to Debugging for Lazy Functional Languages (1994)
| Citations: | 8 - 4 self |
BibTeX
@MISC{Nilsson94adeclarative,
author = {Henrik Nilsson and Roger Skagervall and Carlstedt Elektronik Ab},
title = {A Declarative Approach to Debugging for Lazy Functional Languages},
year = {1994}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Machine (FAM), which can be considered as an optimized SECD machine, has been constructed [Car84]. However, the environment based scheme seems to be best suited for languages with strict semantics [FH88, p. 241]. Also, it is probably not so suitable for parallel implementation of lazy functional languages [PJ87, pp. 379, 409--430]. The second approach to lambda calculus implementation, graph reduction, appears to be better suited both for implementation of languages with non-strict semantics and for parallel implementations. The G-machine is based on graph reduction, and since the G-machine was chosen as a basis for the Freja implementation, we will not consider environment based implementations further. 2.3.5 Graph Reduction Graph reduction is a much newer technique than the environment based scheme and was first invented by Wadsworth [Wad71]. The basic idea is to represent lambda expressions as graphs, since graphs are much more convenient for computers to manipulate than text, and...
