Name
Abstract | ||
|---|---|---|
The complexity of lazy evaluation forbids classic debugging techniques like a simple step-by-step representation of the buggy program run. Therefore, most sophisticated tools for finding bugs in lazy functional programs try to display the run as if the program's underlying semantics was strict. In order to provide such a strict representation, current approaches gather a lot of information about the executed program.We utilized a new technique to drastically reduce the amount of gathered data and show how to use the reduced information to implement a debugging tool which supports declarative debugging as well as a strict step-by-step tracer. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-85373-2_11 | IFL |
Keywords | Field | DocType |
strict representation,lazy functional program,buggy program run,debugging lazy functional programs,strict step-by-step tracer,declarative debugging,debugging tool,executed program,reduced information,classic debugging technique,lazy evaluation,functional programming | Programming language,Subroutine,Computer science,Lazy evaluation,Oracle,Theoretical computer science,Lazy initialization,Strict programming language,Semantics,Algorithmic program debugging,Debugging | Conference |
Volume | ISSN | Citations |
5083 | 0302-9743 | 4 |
PageRank | References | Authors |
0.40 | 7 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bernd Braßel | 1 | 181 | 12.47 |
| Holger Siegel | 2 | 11 | 1.92 |