Debugging Haskell by Observing Intermediate Data Structures

TL;DR: This work presents the design of a trace that can serve several views, which is generated and written to file as the computation proceeds.

TL;DR: The key idea is to construct a declarative trace which hides the operational details of lazy evaluation, however, to avoid excessive memory consumption, the trace is constructed one piece at a time, as needed, by automatic re-execution of the program being debugged.

TL;DR: It is shown how dynamic dataflow graphs give the essence of a program's computation, and how Redux can be used for debugging and program slicing, and a range of other possible uses are considered.

TL;DR: The design, implementation and use of HPC, a tool-kit to record and display Haskell Program Coverage, includes tools that instrument Haskell programs to record program coverage, run instrumented programs, and display information derived from coverage data in various ways.

TL;DR: QuickCheck is a tool which aids the Haskell programmer in formulating and testing properties of programs, and can be automatically tested on random input, but it is also possible to define custom test data generators.

TL;DR: In this article, the authors show that higher-order functions and lazy evaluation of functional languages can contribute significantly to modularity and that modularity is the key to successful software development.

TL;DR: This thesis presents a technique for debugging lazy functional programs declaratively and an efficient implementation of a declarative debugger for a large subset of Haskell, believed to be the first implementation of such a debugger which is sufficiently efficient to be useful in practice.