A Proof Theoretic Approach to Failure in Functional Logic Programming

Simple item page
dc.creatorLopez-Fraguas, Francisco Javier
dc.creatorSanchez-Hernandez, Jaime
dc.date2004-05-27
dc.date.accessioned2026-07-07T03:21:22Z
dc.date.available2026-07-07T03:21:22Z
dc.descriptionHow to extract negative information from programs is an important issue in logic programming. Here we address the problem for functional logic programs, from a proof-theoretic perspective. The starting point of our work is CRWL (Constructor based ReWriting Logic), a well established theoretical framework for functional logic programming, whose fundamental notion is that of non-strict non-deterministic function. We present a proof calculus, CRWLF, which is able to deduce negative information from CRWL-programs. In particular, CRWLF is able to prove finite failure of reduction within CRWL.
dc.descriptionAppeared in Theory and Practice of Logic Programming, vol. 4, no. 1&2, 2004
dc.identifierhttps://arxiv.org/abs/cs/0405102
dc.identifierhttp://arxiv.org/abs/cs/0405102
dc.identifierTheory and Practice of Logic Programming, vol. 4, no. 1&2, 2004
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32170
dc.subjectProgramming Languages
dc.subjectD.1.6; D.3.2
dc.titleA Proof Theoretic Approach to Failure in Functional Logic Programming
dc.typetext

Files

Collections

arXiv