A Proof Theoretic Approach to Failure in Functional Logic Programming

Details A Proof Theoretic Approach to Failure in Functional Logic Programming A Proof Theoretic Approach to Failure in Functional Logic Programming

2004-05-27

arxiv.org/abs/cs/0405102v1

Theory and Practice of Logic Programming, vol. 4, no. 1&2, 2004

Computer Science

Programming Languages

Appeared in Theory and Practice of Logic Programming, vol. 4, no. 1&2, 2004

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Proof Theoretic Approach to Failure in Functional Logic Programming does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Proof Theoretic Approach to Failure in Functional Logic Programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Proof Theoretic Approach to Failure in Functional Logic Programming will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-270042