Existing methods for generating a detailed trace of a computation of a lazy functional program are complex. These complications limit the use of tracing in practice. However, such a detailed trace is desirable for understanding and debugging a lazy functional program. Here we present a lightweight method that instruments a program to generate such a trace, namely the augmented redex trail introduced by the Haskell tracer Hat. The new method is a major step towards an omniscient debugger for real-world Haskell programs
This paper formally presents a model of tracing for functional programs based on a small-step operat...
It is a very undesirable situation that today’s software often contains errors. One motivation for u...
An algorithmic debugger finds defects in programs by systematic search. It relies on the programmer ...
The tracer Hat records in a detailed trace the computation of a program written in the lazy function...
In this paper we compare three systems for tracing and debugging Haskell programs: Freja, the Redex ...
A computation tree of a program execution describes computations of functions and their dependencies...
Hat is a programmer’s tool for generating a trace of a computation of a Haskell 98 program and view...
In functional programming languages such as Haskell, it happens often that some parts of a program a...
AbstractThe tracer Hat records in a detailed trace the computation of a program written in the lazy ...
Hat is a programmer's tool for generating a trace of a computation of a Haskell 98 program and viewi...
Existing algorithmic debuggers for Haskell require a transformation of all modules in a program, eve...
We define a small step operational semantics for a core of Haskell. We modify this semantics to gene...
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...
It is a very undesirable situation that today’s software often contains errors. One motivation for u...
An algorithmic debugger finds defects in programs by systematic search. It relies on the programmer ...
The tracer Hat records in a detailed trace the computation of a program written in the lazy function...
In this paper we compare three systems for tracing and debugging Haskell programs: Freja, the Redex ...
A computation tree of a program execution describes computations of functions and their dependencies...
Hat is a programmer’s tool for generating a trace of a computation of a Haskell 98 program and view...
In functional programming languages such as Haskell, it happens often that some parts of a program a...
AbstractThe tracer Hat records in a detailed trace the computation of a program written in the lazy ...
Hat is a programmer's tool for generating a trace of a computation of a Haskell 98 program and viewi...
Existing algorithmic debuggers for Haskell require a transformation of all modules in a program, eve...
We define a small step operational semantics for a core of Haskell. We modify this semantics to gene...
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...
It is a very undesirable situation that today’s software often contains errors. One motivation for u...
An algorithmic debugger finds defects in programs by systematic search. It relies on the programmer ...