A program transformation for debugging Haskell 98

Authors:
Bernard Pope;Lee Naish
Affiliations:
The Department of Computer Science and Software Engineering, The University of Melbourne, Victoria 3010, Australia;The Department of Computer Science and Software Engineering, The University of Melbourne, Victoria 3010, Australia
Venue:
ACSC '03 Proceedings of the 26th Australasian computer science conference - Volume 16
Year:
2003

Citing 4
Cited 4

Why no one uses functional languages

ACM SIGPLAN Notices
Tracing Lazy Functional Computations Using Redex Trails

PLILP '97 Proceedings of the9th International Symposium on Programming Languages: Implementations, Logics, and Programs: Including a Special Trach on Declarative Programming Languages in Education
Complete and Partial Redex Trails of Functional Computations

IFL '97 Selected Papers from the 9th International Workshop on Implementation of Functional Languages
How to look busy while being as lazy as ever: the Implementation of a lazy functional debugger

Journal of Functional Programming

Practical aspects of declarative debugging in Haskell 98

Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Dynamic slicing based on redex trails

Proceedings of the 2004 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Dynamic slicing of lazy functional programs based on redex trails

Higher-Order and Symbolic Computation
Declarative debugging with buddha

AFP'04 Proceedings of the 5th international conference on Advanced Functional Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a source-to-source transformation of Haskell 98 programs for the purpose of debugging. The source code of a program is transformed into a new program which, when executed, computes the value of the original program and a high-level semantics for that computation. The semantics is given by a tree whose nodes represent function applications that were evaluated during execution. This tree is useful in situations where a high-level view of a computation is needed, such as declarative debugging. The main contribution of the paper is the treatment of higher-order functions, which have previously proven difficult to support in declarative debugging schemes.