Formalizing the debugging process in haskell

Authors:
Alberto de la Encina;Luis Llana;Fernando Rubio
Affiliations:
Departamento de Sistemas Informáticos y Programación, Universidad Complutense de Madrid, Spain;Departamento de Sistemas Informáticos y Programación, Universidad Complutense de Madrid, Spain;Departamento de Sistemas Informáticos y Programación, Universidad Complutense de Madrid, Spain
Venue:
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Year:
2005

Citing 9
Cited 1

Why no one uses functional languages

ACM SIGPLAN Notices
Tracing Lazy Functional Computations Using Redex Trails

PLILP '97 Proceedings of the9th International Symposium on Programming Languages: Implementations, Logics, and Programs: Including a Special Trach on Declarative Programming Languages in Education
Freja, Hat and Hood - A Comparative Evaluation of Three Systems for Tracing and Debugging Lazy Functional Programs

IFL '00 Selected Papers from the 12th International Workshop on Implementation of Functional Languages
Implementation Skeletons in Eden: Low-Effort Parallel Programming

IFL '00 Selected Papers from the 12th International Workshop on Implementation of Functional Languages
Proving the Correctness of the STG Machine

IFL '02 Selected Papers from the 13th International Workshop on Implementation of Functional Languages
HsDebug: debugging lazy programs by not being lazy

Haskell '03 Proceedings of the 2003 ACM SIGPLAN workshop on Haskell
Formally deriving an STG machine

Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Practical aspects of declarative debugging in Haskell 98

Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
How to look busy while being as lazy as ever: the Implementation of a lazy functional debugger

Journal of Functional Programming

Testing speculative work in a lazy/eager parallel functional language

LCPC'05 Proceedings of the 18th international conference on Languages and Compilers for Parallel Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Due to its absence of side effects, it is usually claimed that reasoning about functional programs is simpler than reasoning about their imperative counterparts. Unfortunately, due to the absence of practical debuggers, finding bugs in lazy functional languages has been much more complex until quite recently. One of the easiest to use Haskell debuggers is Hood, whose behavior is based on the concept of observation of intermediate data structures. However, it can be hard to understand how it works when dealing with complex situations. In this paper, we introduce debugging facilities in the STG abstract machine. Our goal is to obtain debugging information as close to the one obtained by the Hood debugger as possible. By extending the STG abstract machine, we do not only provide a formal framework to the debugging process, but also an alternative method to implement debuggers.