Proving Failure in Functional Logic Programs

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.

• Type: Conference
• Year: 2000
• Where: CL
• Authors: Francisco Javier López-Fraguas, Jaime Sánchez-Hernández
• Keywords: Automated Reasoning, CL 2000, Functional Logic, Functional Logic Programs, Logic Programming