A Proof Theoretic Approach to Failure in Functional Logic Programming
<|reference_start|>A Proof Theoretic Approach to Failure in Functional Logic Programming: How 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.<|reference_end|>
@article{lopez-fraguas2004a,
    title={A Proof Theoretic Approach to Failure in Functional Logic Programming},
    author={Francisco Javier Lopez-Fraguas, Jaime Sanchez-Hernandez},
    journal={Theory and Practice of Logic Programming, vol. 4, no. 1&2, 2004},
    year={2004},
    archivePrefix={arXiv},
    eprint={cs/0405102},
    primaryClass={cs.PL}
}