In this paper we compare three systems for tracing and debugging Haskell programs: Freja, the Redex Trail System and Hood. We identify the similarities and differences of these systems and we evaluate their usefulness in practice by applying them to a number of small to medium programs in which errors had deliberately been introduced
It is a very undesirable situation that today’s software often contains errors. One motivation for u...
AbstractThis paper is based on a recently developed technique to build debugging tools for lazy func...
AbstractThe tracer Hat records in a detailed trace the computation of a program written in the lazy ...
The debugging of lazy functional programs is a non yet satisfactorily solved problem. In recent year...
The tracer Hat records in a detailed trace the computation of a program written in the lazy function...
In functional programming languages such as Haskell, it happens often that some parts of a program a...
Existing methods for generating a detailed trace of a computation of a lazy functional program are c...
Existing algorithmic debuggers for Haskell require a transformation of all modules in a program, eve...
In non-strict functional programming languages such as Haskell, it happens often that some parts of ...
This article describes the implementation of a debugger for lazy functional languages like Haskell. ...
This paper formally presents a model of tracing for functional programs based on a small-step operat...
This paper formally presents a model of tracing for functional programs based on a small-step operat...
A computation tree of a program execution describes computations of functions and their dependencies...
An algorithmic debugger finds defects in programs by systematic search. It relies on the programmer ...
We present a trace-based debugging environment for a lazy functional language. We argue that traces ...
It is a very undesirable situation that today’s software often contains errors. One motivation for u...
AbstractThis paper is based on a recently developed technique to build debugging tools for lazy func...
AbstractThe tracer Hat records in a detailed trace the computation of a program written in the lazy ...
The debugging of lazy functional programs is a non yet satisfactorily solved problem. In recent year...
The tracer Hat records in a detailed trace the computation of a program written in the lazy function...
In functional programming languages such as Haskell, it happens often that some parts of a program a...
Existing methods for generating a detailed trace of a computation of a lazy functional program are c...
Existing algorithmic debuggers for Haskell require a transformation of all modules in a program, eve...
In non-strict functional programming languages such as Haskell, it happens often that some parts of ...
This article describes the implementation of a debugger for lazy functional languages like Haskell. ...
This paper formally presents a model of tracing for functional programs based on a small-step operat...
This paper formally presents a model of tracing for functional programs based on a small-step operat...
A computation tree of a program execution describes computations of functions and their dependencies...
An algorithmic debugger finds defects in programs by systematic search. It relies on the programmer ...
We present a trace-based debugging environment for a lazy functional language. We argue that traces ...
It is a very undesirable situation that today’s software often contains errors. One motivation for u...
AbstractThis paper is based on a recently developed technique to build debugging tools for lazy func...
AbstractThe tracer Hat records in a detailed trace the computation of a program written in the lazy ...