Name
Abstract | ||
|---|---|---|
Designing debugging tools for lazy functional programming languages is a complex task which is often solved by expensive tracing of lazy computations. We present a new approach in which the information collected as a trace is reduced considerably (kilobytes instead of megabytes). The idea is to collect a kind of step information for a call-by-value interpreter, which can then efficiently reconstruct the computation for debugging/viewing tools, like declarative debugging. We show the correctness of the approach, discuss a proof-of-concept implementation with a declarative debugger as back end and present some benchmarks comparing our new approach with the Haskell debugger Hat. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1145/1291151.1291193 | ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming |
Keywords | Field | DocType |
functional programming,proof of concept,functional programming language | Evaluation strategy,Programming language,Functional programming,Computer science,Debugger,Theoretical computer science,Haskell,Declarative programming,Tracing,Debugging,Algorithmic program debugging | Conference |
Volume | Issue | Citations |
42 | 9 | 7 |
PageRank | References | Authors |
0.61 | 11 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bernd Braßel | 1 | 181 | 12.47 |
| Michael Hanus | 2 | 707 | 45.18 |
| Sebastian Fischer | 3 | 74 | 5.07 |
| Frank Huch | 4 | 141 | 7.66 |
| Germán Vidal | 5 | 549 | 44.64 |