Program errors are hard to detect and are costly both to programmers who spend significant
efforts in debugging, and for systems that are guarded by runtime checks. Static verification …

Declarative debugging is a semi-automatic technique that starts from an incorrect
computation and locates a program fragment responsible for the error by building a tree …

The first two chapters of the introductory computer science textbook Structure and
Interpretation of Computer Programs, JavaScript Adaptation (SICP JS), use a subset of …

Declarative debugging is a semi-automatic technique that starts from an incorrect
computation and locates a program fragment responsible for the error by building a tree …

A computation tree of a program execution describes computations of functions and their
dependencies. A computation tree describes how a program works and is at the heart of …

We propose a new kind of execution environment where applications can be debugged and
re-programmed while they are being used. We call our overall concept interactive …

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 …

Tracing is one of the most important techniques for program understanding and debugging.
A trace gives the user access to otherwise hidden information about a computation. In the …

This paper formally presents a model of tracing for functional programs based on a small-
step operational semantics. The model records the computation of a functional program in a …

Algorithmic debuggers for higher-order functional languages have to display functional
values. Originally functional values had been represented as partial applications of function …