Declarative debugging of functional logic programs

Vista sencilla de ítem
dc.contributor.authorAlpuente, M.
dc.contributor.authorCorrea, F.J.
dc.contributor.authorFalaschi, M.
dc.contributor.departmentUniversidad EAFIT. Departamento de Cienciasspa
dc.contributor.researchgroupLógica y Computaciónspa
dc.creatorAlpuente, M.
dc.creatorCorrea, F.J.
dc.creatorFalaschi, M.
dc.date.accessioned2021-03-26T21:35:19Z
dc.date.available2021-03-26T21:35:19Z
dc.date.issued2001-01-01
dc.description.abstractWe present a general framework for the declarative debugging of functional logic programs, which is valid both for eager as well as lazy programs. We associate to our programs a semantics based on a (continuous) immediate consequence operator which models computed answers. Then we show that, given the intended specification of a program P, it is possible to check the correctness of P by a single step of the immediate consequence operator. We also present a more effective methodology which is based on abstract interpretation. By approximating the intended specification of the success set we derive a finitely terminating debugging method, which can be used statically. Our framework is parametric w.r.t. to the chosen approximation of the success set. We present one specific example of approximation. We provide an implementation of our debugging system which shows experimentally on a wide set of benchmarks that we are able to find some common errors in the user programs. © 2001 Published by Elsevier Science B. V.eng
dc.identifierhttps://eafit.fundanetsuite.com/Publicaciones/ProdCientif/PublicacionFrw.aspx?id=1853
dc.identifier.doi10.1016/S1571-0661(04)00266-X
dc.identifier.issn15710661
dc.identifier.otherSCOPUS;2-s2.0-18944403041
dc.identifier.urihttp://hdl.handle.net/10784/27405
dc.language.isoengeng
dc.publisherElsevier BV
dc.relation.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-18944403041&doi=10.1016%2fS1571-0661%2804%2900266-X&partnerID=40&md5=908d85feb2f66951e67cc88f6aa5dc35
dc.rightshttps://v2.sherpa.ac.uk/id/publication/issn/1571-0661
dc.sourceElectronic Notes In Theoretical Computer Science
dc.subject.keywordApproximation theoryeng
dc.subject.keywordData reductioneng
dc.subject.keywordIntegrationeng
dc.subject.keywordKnowledge based systemseng
dc.subject.keywordMathematical modelseng
dc.subject.keywordProgram debuggingeng
dc.subject.keywordSemanticseng
dc.subject.keywordAssertion based methodseng
dc.subject.keywordDeclarative debuggingeng
dc.subject.keywordFunctional logic languageseng
dc.subject.keywordRewriting systemseng
dc.subject.keywordLogic programmingeng
dc.titleDeclarative debugging of functional logic programseng
dc.typeinfo:eu-repo/semantics/conferencePapereng
dc.typeconferencePapereng
dc.typeinfo:eu-repo/semantics/publishedVersioneng
dc.typepublishedVersioneng
dc.type.localDocumento de conferenciaspa

Archivos

Colecciones

Documentos de conferencia