Why no one uses functional languages
ACM SIGPLAN Notices
Tracing piece by piece: affordable debugging for lazy functional languages
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
The Evaluation Dependence Tree as a Basis for Lazy FunctionalDebugging
Automated Software Engineering
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
Towards a purely functional debugger for functional programs
FP'95 Proceedings of the 1995 international conference on Functional Programming
Debugging Lazy Functional Programs by Asking the Oracle
Implementation and Application of Functional Languages
Backward trace slicing for rewriting logic theories
CADE'11 Proceedings of the 23rd international conference on Automated deduction
What's the matter with Kansas Lava?
TFP'10 Proceedings of the 11th international conference on Trends in functional programming
Testing speculative work in a lazy/eager parallel functional language
LCPC'05 Proceedings of the 18th international conference on Languages and Compilers for Parallel Computing
The feasibility of interactively probing quiescent properties of GUI applications
IFL'04 Proceedings of the 16th international conference on Implementation and Application of Functional Languages
Source-Based trace exploration
IFL'04 Proceedings of the 16th international conference on Implementation and Application of Functional Languages
Formalizing the debugging process in haskell
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Backward trace slicing for conditional rewrite theories
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Using conditional trace slicing for improving Maude programs
Science of Computer Programming
| Hi-index | 0.00 |
In this paper we compare three systems for tracing and debugging Haskell programs: Freja, Hat and Hood. We evaluate their usefulness in practice by applying them to a number of moderately complex programs in which errors had deliberately been introduced. We identify the strengths and weaknesses of each system and then form ideas on how the systems can be improved further.