Faster production of redex trails: The Hat G-Machine (2005)
| Venue: | Proc. 6th Symposium on Trends in Functional Programming (TFP 2005 |
| Citations: | 2 - 0 self |
BibTeX
@INPROCEEDINGS{Shackell05fasterproduction,
author = {Tom Shackell and Colin Runciman},
title = {Faster production of redex trails: The Hat G-Machine},
booktitle = {Proc. 6th Symposium on Trends in Functional Programming (TFP 2005},
year = {2005},
pages = {135--150},
publisher = {Tartu University Press}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The Hat system provides a method for tracing a lazy functional program. However Hat works by transforming the source program into a much larger self-tracing variant that runs between 15 and 100 times slower and uses several times as much memory. We show how equivalent traces can be generated much more efficiently by modifying the underlying abstract machine. Our approach shows that it is only necessary to add a few extra machine instructions and change the interpretation of a few others in order to generate Hat traces efficiently.
Citations
| 118 | Efficient compilation of lazy evaluation - Johnsson - 1984 |
| 89 | A debugger for standard ml - Tolmach, Appel - 1995 |
| 77 | Algorithmic debugging for lazy functional languages - Nilsson, Fritzson - 1994 |
| 35 | Multipleview tracing for haskell: a new hat - Wallace, Chitil, et al. - 2001 |
| 31 | The Spineless G-machine - Burn, Jones - 1988 |
| 20 | Highlights from nhc - a space-efficient Haskell compiler - Rojemo - 1995 |
| 14 | How to look busy while being as lazy as ever: the implementation of a lazy functional debugger - Nilsson - 2001 |
| 13 | Testing and Tracing Lazy Functional Programs using QuickCheck and Hat - Claessen, Runciman, et al. |
| 10 | Practical aspects of declarative debugging in Haskell-98 - Pope, Naish - 2003 |
| 4 | A Program Transformation for Debugging Haskell 98 - Pope, Naish - 2003 |
