Sciweavers

33 search results - page 2 / 7
» Algorithmic Debugging for Lazy Functional Languages
Sort
View
WCFLP
2005
ACM
13 years 10 months ago
A declarative debugger of incorrect answers for constraint functional-logic programs
Debugging is one of the essential parts of the software development cycle. However, the usual debugging techniques used in imperative languages such as the step by step execution ...
Rafael Caballero
POPL
2009
ACM
14 years 5 months ago
Static contract checking for Haskell
Program errors are hard to detect and are costly both to programmers who spend significant efforts in debugging, and for systems that are guarded by runtime checks. Static verific...
Dana N. Xu, Simon L. Peyton Jones, Koen Claessen
PADL
2004
Springer
13 years 9 months ago
Observing Functional Logic Computations
Abstract. A lightweight approach to debugging functional logic programs by observations is presented, implemented for the language Curry. The Curry Object Observation System (COOSy...
Bernd Brassel, Olaf Chitil, Michael Hanus, Frank H...
ENTCS
2007
112views more  ENTCS 2007»
13 years 4 months ago
Structure and Properties of Traces for Functional Programs
The tracer Hat records in a detailed trace the computation of a program written in the lazy functional language Haskell. The trace can then be viewed in various ways to support pr...
Olaf Chitil, Yong Luo
ICFP
2002
ACM
14 years 4 months ago
Packrat parsing: : simple, powerful, lazy, linear time, functional pearl
Packrat parsing is a novel technique for implementing parsers in a lazy functional programming language. A packrat parser provides the power and flexibility of top-down parsing wi...
Bryan Ford