Abstract | ||
---|---|---|
This paper is based on a recently developed technique to build debugging tools for lazy functional programming languages. With this technique it is possible to replay the execution of a lazy program with a strict semantics by recording information of unevaluated expressions. The recorded information is called an oracle and is very compact. Oracles contain the number of strict steps between discarding unevaluated expressions. The technique has already been successfully employed to construct a debugger for lazy functional languages. This paper extends the technique to include also lazy functional logic languages. A debugging tool built with the technique can be downloaded at www-ps.informatik.uni-kiel.de/~bbr. |
Year | DOI | Venue |
---|---|---|
2009 | 10.1016/j.entcs.2009.07.014 | Electr. Notes Theor. Comput. Sci. |
Keywords | Field | DocType |
lazy functional language,lazy functional languages,debugging tool,lazy functional programming language,strict step,debugging tools,unevaluated expression,strict semantics,lazy functional logic language,logic languages,recorded information,lazy program,lazy functional logic languages,functional language | Programming language,Functional programming,Debugger,Computer science,Oracle,Theoretical computer science,Lazy initialization,Strict programming language,Graph reduction,Debugging,Algorithmic program debugging | Journal |
Volume | ISSN | Citations |
246, | Electronic Notes in Theoretical Computer Science | 1 |
PageRank | References | Authors |
0.37 | 15 | 1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Bernd Braßel | 1 | 181 | 12.47 |