A survey of algorithmic debugging
Algorithmic debugging is a technique proposed in 1982 by EY Shapiro in the context of logic
programming. This survey shows how the initial ideas have been developed to become a …
programming. This survey shows how the initial ideas have been developed to become a …
Helium, for learning Haskell
B Heeren, D Leijen, A Van IJzendoorn - Proceedings of the 2003 ACM …, 2003 - dl.acm.org
Helium is a user-friendly compiler designed especially for learning the functional
programming language Haskell. The quality of the error messages has been the main …
programming language Haskell. The quality of the error messages has been the main …
GHood--graphical visualisation and animation of Haskell object observations
C Reinke - ACM SIGPLAN Haskell Workshop, Firenze, Italy, 2001 - kar.kent.ac.uk
As a possible extension to his http://www. haskell. org/hood/Hood http://www. cse. ogi. edu/~
andy/pub/debug. htm, Andy Gill has described the``dynamic viewing of structures'', stepping …
andy/pub/debug. htm, Andy Gill has described the``dynamic viewing of structures'', stepping …
Multiple-view tracing for Haskell: a new Hat
M Wallace, O Chitil, T Brehm, C Runciman - 2001 - kar.kent.ac.uk
Different tracing systems for Haskell give different views of a program at work. In practice,
several views are complementary and can productively be used together. Until now each …
several views are complementary and can productively be used together. Until now each …
How to look busy while being as lazy as ever: the implementation of a lazy functional debugger
H Nilsson - Journal of Functional Programming, 2001 - cambridge.org
This article describes the implementation of a debugger for lazy functional languages like
Haskell. The key idea is to construct a declarative trace which hides the operational details …
Haskell. The key idea is to construct a declarative trace which hides the operational details …
Runtime verification of concurrent Haskell programs
V Stolz, F Huch - Electronic Notes in Theoretical Computer Science, 2005 - Elsevier
In this article we use model checking techniques to debug Concurrent Haskell programs.
LTL formulas specifying assertions or other properties are verified at runtime. If a run which …
LTL formulas specifying assertions or other properties are verified at runtime. If a run which …
Dynamic optimization for functional reactive programming using generalized algebraic data types
H Nilsson - ACM SIGPLAN Notices, 2005 - dl.acm.org
A limited form of dependent types, called Generalized Algebraic Data Types (GADTs), has
recently been added to the list of Haskell extensions supported by the Glasgow Haskell …
recently been added to the list of Haskell extensions supported by the Glasgow Haskell …
Systematic generation of glass-box test cases for functional logic programs
S Fischer, H Kuchen - Proceedings of the 9th ACM SIGPLAN …, 2007 - dl.acm.org
We employ the narrowing-based execution mechanism of the functional logic programming
language Curry in order to automatically generate a system of test cases for glass-box …
language Curry in order to automatically generate a system of test cases for glass-box …
[HTML][HTML] Using conditional trace slicing for improving Maude programs
Understanding the behavior of software is important for the existing software to be improved.
In this paper, we present a trace slicing technique that is suitable for analyzing complex …
In this paper, we present a trace slicing technique that is suitable for analyzing complex …
Practical aspects of declarative debugging in Haskell 98
B Pope, L Naish - Proceedings of the 5th ACM SIGPLAN international …, 2003 - dl.acm.org
Non-strict purely functional languages pose many challenges to the designers of debugging
tools. Declarative debugging has long been considered a suitable candidate for the task due …
tools. Declarative debugging has long been considered a suitable candidate for the task due …