Help Privacy Policy Disclaimer
  Advanced SearchBrowse




Conference Paper

A Debugging Model for Functional Logic Programs


Hanus,  Michael
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource

(Publisher version)

Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available

Hanus, M., & Josephs, B. (1993). A Debugging Model for Functional Logic Programs. In M. Bruynooghe, & J. Penjam (Eds.), Proceedings of the 5th International Symposium on Programming Language Implementation and Logic Programming (PLILP-93) (pp. 28-43). Berlin, Germany: Springer.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-ADD9-6
This paper presents a box-oriented debugging model for the functional logic
language ALF. Due to the sophisticated operational semantics of ALF which is
based on innermost basic narrowing with simplification, the debugger must
reflect the application of the different computation rules during program
execution. Hence our debugging model includes not only one box type as in
Byrd's debugging model for logic programs but several different kinds of boxes
corresponding to the various computation rules of the functional logic language
(narrowing, simplification, etc.). Moreover, additional box types are
introduced in order to allow skips over (sometimes) uninteresting program parts
like proofs of the condition in a conditional equation. Since ALF is a genuine
amalgamation of functional and logic languages, our debugging model subsumes
operational aspects of both kinds of languages. As a consequence, it can be
also used for pure logic languages, pure functional languages with eager
evaluation, or functional
logic languages with a less sophisticated operational semantics like SLOG or
eager BABEL.