22 search results - page 2 / 5 » Debugging Haskell by Observing Intermediate Data Structures |
FUIN
2006
13 years 4 months ago
2006
Wadler's deforestation algorithm eliminates intermediate data structures from functional programs. To be suitable for inclusion in a compiler, it must terminate on all progra...
ENTCS
2007
13 years 4 months ago
2007
The use of typed intermediate languages can significantly increase the reliability of a compiler. By typechecking the code produced at each transformation stage, one can identify...
ECAI
2010
Springer
13 years 5 months ago
2010
Springer
The paper describes a model-based approach to developing a general tool for localizing faults in applications of data warehouse technology. A model of the application is configured...
KBSE
2009
IEEE
13 years 11 months ago
2009
IEEE
—Automated debugging is becoming increasingly important as the size and complexity of software increases. This paper makes a case for using constraint-based data structure repair...
ENTCS
2007
13 years 4 months ago
2007
Debugging by observing the evaluation of expressions and functions is a useful approach for finding bugs in lazy functional and functional logic programs. However, adding and rem...