AbstractDebugging by observing the evaluation of expressions and functions is a useful approach for finding bugs in lazy functional and functional logic programs. However, adding and removing observation annotations to a program is an effort making the use of this debugging technique in practice uncomfortable. Having tool support for managing observations is desirable. We developed a tool that provides this ability for programmers. Without annotating expressions in a program, the evaluation of functions, data structures and arbitrary subexpressions can be observed by selecting them from a tree-structure representing the whole program. Furthermore, the tool provides a step by step performing of observations where each observation is shown in...
We present a general framework for the declarative debugging of functional logic programs, which is ...
Existing algorithmic debuggers for Haskell require a transformation of all modules in a program, eve...
. Lazy functional languages have non-strict semantics and are purely declarative, i.e. they support ...
AbstractDebugging by observing the evaluation of expressions and functions is a useful approach for ...
Debugging by observing the evaluation of expressions and functions is a useful approach for finding ...
A lightweight approach to debugging functional logic programs by observations is presented, implemen...
This thesis describes the design, implementation and use of a run-time debugging tool for understand...
AbstractThis paper is part of a comprehensive approach to debugging for functional logic languages. ...
AbstractThis paper is based on a recently developed technique to build debugging tools for lazy func...
In this position paper, we present a prototype of a visualizer for functional programs. Such program...
This paper is based on a recently developed technique to build debugging tools for lazy functional p...
We present a declarative debugger for lazy functional logic programs with polymorphic type disciplin...
AbstractWe present a declarative debugger for lazy functional logic programs with polymorphic type d...
An algorithmic debugger finds defects in programs by systematic search. It relies on the programmer ...
We present a generic scheme for the declarative debugging of functional logic programs which is vali...
We present a general framework for the declarative debugging of functional logic programs, which is ...
Existing algorithmic debuggers for Haskell require a transformation of all modules in a program, eve...
. Lazy functional languages have non-strict semantics and are purely declarative, i.e. they support ...
AbstractDebugging by observing the evaluation of expressions and functions is a useful approach for ...
Debugging by observing the evaluation of expressions and functions is a useful approach for finding ...
A lightweight approach to debugging functional logic programs by observations is presented, implemen...
This thesis describes the design, implementation and use of a run-time debugging tool for understand...
AbstractThis paper is part of a comprehensive approach to debugging for functional logic languages. ...
AbstractThis paper is based on a recently developed technique to build debugging tools for lazy func...
In this position paper, we present a prototype of a visualizer for functional programs. Such program...
This paper is based on a recently developed technique to build debugging tools for lazy functional p...
We present a declarative debugger for lazy functional logic programs with polymorphic type disciplin...
AbstractWe present a declarative debugger for lazy functional logic programs with polymorphic type d...
An algorithmic debugger finds defects in programs by systematic search. It relies on the programmer ...
We present a generic scheme for the declarative debugging of functional logic programs which is vali...
We present a general framework for the declarative debugging of functional logic programs, which is ...
Existing algorithmic debuggers for Haskell require a transformation of all modules in a program, eve...
. Lazy functional languages have non-strict semantics and are purely declarative, i.e. they support ...