Abstract
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.
The authors have been partially supported by the Spanish CICYT (project TIC 98-0445-C03-02 ‘TREND’).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
K.R. Apt and R. Bol. Logic programming and negation: A survey. Journal of Logic Programming, 19&20:9–71, 1994.
D. Bert and R. Echahed. Abstraction of conditional term rewriting systems. In Proc. ILPS’95, pages 162–176. MIT Press, 1995.
J.C. González-Moreno, T. Hortalá-González, F.J. López-Fraguas, and M. Rodríguez-Artalejo. An approach to declarative programming based on a rewriting logic. Journal of Logic Programming, 40(1):47–87, 1999.
M. Hanus. The integration of functions into logic programming: From theory to practice. Journal of Logic Programming, 19&20:583–628, 1994.
M. Hanus (ed.). Curry: An integrated functional logic language, February 2000. Available at http://www-i2.informatik.rwth-aachen.de/~hanus/curry/report.html.
G. Jäger and R.F. Stärk. A proof-theoretic framework for logic programming. In S.R. Buss (ed.), Handbook of Proof Theory, pages 639–682. Elsevier, 1998.
F.J. López-Fraguas and J. Sánchez-Hernández. Disequalities may help to narrow. In Proc. APPIA-GULP-PRODE’99, pages 89–104, 1999.
F.J. López-Fraguas and J. Sánchez-Hernández. A multiparadigm declarative system. In Proc. RTA’99, Springer LNCS 1631, pages 244–247, 1999.
F.J. López-Fraguas and J. Sánchez-Hernández. Proving failure in functional logic programs (extended version). Tech. Rep. SIP 00/100-00, UCM Madrid, 2000.
J.J. Moreno-Navarro. Default rules: An extension of constructive negation for narrowing-based languages. In Proc. ICLP’95, pages 535–549. MIT Press, 1994.
J.J. Moreno-Navarro. Extending constructive negation for partial functions in lazy functional-logic languages. In Proc. ELP’96, pages 213–227. Springer LNAI 1050, 1996.
P.J. Stuckey. Constructive negation for constraint logic programming. In Proc. LICS’91, pages 328–339, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
López-Fraguas, F.J., Sánchez-Hernández, J. (2000). Proving Failure in Functional Logic Programs. In: Lloyd, J., et al. Computational Logic — CL 2000. CL 2000. Lecture Notes in Computer Science(), vol 1861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44957-4_12
Download citation
DOI: https://doi.org/10.1007/3-540-44957-4_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67797-0
Online ISBN: 978-3-540-44957-7
eBook Packages: Springer Book Archive