| | |
Summary: Electronic Notes in Theoretical Computer Science 64 (2002)
URL: http://www.elsevier.nl/locate/entcs/volume64.html 38 pages
A Debugging Scheme for Functional Logic
Programs 1
M. Alpuente 2
Departamento de Sistemas Inform’aticos y Computaci’onDSIC
Technical University of Valencia, Camino de Vera s/n, 46022 Valencia, Spain.
F. J. Correa 3
Departamento de Inform’atica y Sistemas--DIS
University EAFIT, Carrera 49 7 Sur 50, 3300 Medell’n, Colombia.
M. Falaschi 4
Dipartimento di Matematica e Informatica
University of Udine, Via delle Scienze 206, 33100 Udine, Italy.
Abstract
We present a generic scheme for the declarative debugging of functional logic pro
grams which is valid for eager as well as lazy programs. In particular we show
that the framework extends naturally some previous work and applies to the most
modern lazy strategies, such as needed narrowing. First we associate to our pro
grams a semantics based on a (continuous) immediate consequence operator, TR ,
which models computed answers. We show that, given the intended specification
|
