Abstract
Finite failure of computations plays an important role as programming construct in the logic programming paradigm, and it has been shown that this also extends to the case of the functional logic programming paradigm. In particular we have considered CRWLF, a previous proof-theoretic semantic framework able to deduce negative (failure) information from functional logic programs. The non-deterministic nature of functions considered in CRWLF leads naturally to set-valued semantic description of expressions. Here we reformulate the framework to stress that set flavour, both at syntactic and semantic levels. The given approach, for which we obtain equivalence results with respect to the previous one, increases the expressiveness for writing programs and (hopefully) clarifies the understanding of the semantics given to nondeterministic functions, since classical mathematical notions like union of sets or families of sets are used. An important step in the reformulation is a useful program transformation which is proved to be correct within the framework.
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
S. Antoy Constructor-based Conditional Narrowing. To appear in Proc. PPDP’01, Springer LNCS.
S. Antoy Definitional Trees. In Proc. ALP’92, Springer LNCS 632, pages 143–157, 1992.
S. Antoy Optimal Non-Deterministic Functional Logic Computations. In Proc. ALP’97, Springer LNCS 1298, pages 16–30, 1997.
K.R. Apt and R. Bol. Logic programming and negation: A survey. Journal of Logic Programming, 19& 20:9–71, 1994.
J.C. González-Moreno, T. Hortalá-González, F.J. López-Fraguas, and M. Rodríguez-Artalejo. A Rewriting Logic for Declarative Programming. In Proc. ESOP’96, pages 156–172. Springer LNCS 1058, 1996.
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. Available at http://www.informatik.uni-kiel.de/~mh/curry/report.html, June 2000.
H. Hussman. Non-Determinism in Algebraic Specifications and Algebraic Programs Birkhäuser Verlag, 1993.
R. Loogen, F.J. López, M. Rodrǵuez. A demand driven computation strategy for lazy narrowing. Proc. PLILP’3, Springer LNCS 714, 184–200, 1993.
F.J. López-Fraguas and J. Sánchez-Hernández. T OY: 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 In Proc CL’2000, Springer LNAI 1861, pages 179–193, 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.
S. Peyton Jones, J. Hughes (eds.) Haskell 98: A Non-strict, Purely Functional Language. Available at http://www.haskell.org, February 1999.
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
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
López-Fraguas, F., Sánchez-Hernández, J. (2001). Functional Logic Programming with Failure: A Set-Oriented View. In: Nieuwenhuis, R., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2001. Lecture Notes in Computer Science(), vol 2250. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45653-8_31
Download citation
DOI: https://doi.org/10.1007/3-540-45653-8_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42957-9
Online ISBN: 978-3-540-45653-7
eBook Packages: Springer Book Archive