Skip to main content
SpringerLink
Log in

A general scheme for constraint functional logic programming

  • Conference paper
  • First Online:
Algebraic and Logic Programming (ALP 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 632))

Included in the following conference series:

Abstract

We present a general scheme CFLP(X) for first order constraint functional logic programming which plays, with respect to lazy functional logic languages with constructor discipline, a similar role to the well known of CLP(X) with respect to logic programming. In CFLP(X), over a base structure equipped with a set of predefined functions and predicates, we define new ones by means of “constrained conditional rewrite rules”. We formulate a declarative semantics in a general setting, where base structures are Scott domains and functions and predicates are continuous, and we obtain a complete characterization of the minimal model of a program as the least fixpoint of an associated operator. Finally, we propose a sound operational semantics, lazy constrained narrowing, which is complete for semantically non ambiguous programs.

This work has been partially supported by the Spanish projects TIC89/0104 and U.P.M. Acción Concertada “Diseño de un lenguaje simbólico numérico”

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K.R.Apt: Logic Programming, in J.van Leeuwen (ed.) Handbook of Theoretical Computer Science, Vol. B,pp. 495–574, Elsevier Science Pub. 1990.

    Google Scholar 

  2. M.Bellia, G.Levi: The Relation between Logic and Functional Languages, Journal of Logic Programming, Vol.3, 1986, 217–236.

    Google Scholar 

  3. J.Darlington, Y.K.Guo, H. Pull: Introducing Constraint Functional Logic Programming, Tech. Rep., Imperial College, Feb. 1991.

    Google Scholar 

  4. J.Darlington, Y.K.Guo, H. Pull: A New Perspective on the Integration of Functional and Logic Languages, Tech. Rep., Imperial College, Sep. 1991.

    Google Scholar 

  5. J.Darlington, Y.K.Guo: Constraint Functional Programming, Tech. Rep., Imperial College, November 1989.

    Google Scholar 

  6. J.Darlington, Y.K.Guo: Constraint Equational Deduction, Tech. Rep., Imperial College, March 1990.

    Google Scholar 

  7. N.Dershowitz, J.P. Jouannaud: Rewrite Systems, in J.van Leeuwen (ed.) Handbook of Theoretical Computer Science, Vol. B,pp. 243–320, Elsevier Science Pub. 1990.

    Google Scholar 

  8. M.H. van Emden, R.A.Kowalski: The semantics of predicate logic as a programming language, Jour. ACM, Vol. 23 (4), 1976, pp. 733–742.

    Google Scholar 

  9. M. Gabrielli, G. Levi: Modelling Answer Constraint in Constraint Logic Programming, Tech. Rep. TR-4/91, Dip. Informatica, Univ. Pisa, March 1991.

    Google Scholar 

  10. J.C.González-Moreno, T.Hortalá-González, M.Rodríguez-Artalejo: A Functional Logic Language with Higher Order Logic Variables, Tech. Rep. DIA 90/6, October 1990.

    Google Scholar 

  11. J.C.González-Moreno, T.Hortalá-Gonzàlez, M.Rodr/'iguez-Artalejo: Denotational versus Declarative Semantics for Functional Languages, Tech. Rep. D1A 91/3, September 1991.

    Google Scholar 

  12. D. de Groot, G.Lindstrom (eds): Logic Programming: Functions, Relations and Equations, Prentice Hall, 1986.

    Google Scholar 

  13. M.Hoefeld, G.Smolka: Definite Relations over Constraint Languages, LILOG Report 53, IBM Deutchland, Germany, Oct. 1988.

    Google Scholar 

  14. C.Kirchner, H.Kirchner, M. Rusinowitch: Deduction with symbolic constraints, Revue Française d'Intelligence Artificielle, Vol. 4, N. 3, pp. 9–52.

    Google Scholar 

  15. J.Jaffar, J.L.Lassez: Constraint Logic Programming, Tech. Rep., Dep. of Computer Science, Monash Univ., June 1986.

    Google Scholar 

  16. J.Jaffar, J.L.Lassez: Constraint Logic Programming, Procs. 14th ACM Symp. on Princ. of Prog. Lang., 1987, pp. 114–119.

    Google Scholar 

  17. H.Kuchen, R.Loogen, J.J.Moreno-Navarro, M.Rodríguez-Artalejo: Graph-based Implementation of a Functional Logic Language, Procs. ESOP'90, Springer LNCS 432, 1990, pp. 271–290.

    Google Scholar 

  18. H.Kuchen, F.J.López-Fraguas, J.J.Moreno-Navarro, M.Rodríguez-Artalejo: Implementing Disequality in a Lazy Functional Logic Language, Tech. Rep. (in preparation).

    Google Scholar 

  19. K.Kunen: Negation in Logic Programming, Journal of Logic Programming, 4(3), pp. 289–308, 1987.

    Google Scholar 

  20. G. Levi et alter: A complete semantical characterization of K-LEAF, a logic language with partial functions, Procs. 4th. Symp. on Logic Progr., 1987, pp. 1–27.

    Google Scholar 

  21. F.J. López-Fraguas, M. Rodríguez-Artalejo: An Approach to Constraint Functional Logic Programming, Tech. Rep. DIA 91/4, October 1991.

    Google Scholar 

  22. F.J. López-Fraguas: A General Scheme for Constraint Functional Logic Programming, Tech. Rep. (in preparation).

    Google Scholar 

  23. F.J. López-Fraguas: Implementing Disequality in a Strict Functional Logic Language, Tech. Rep. (in preparation).

    Google Scholar 

  24. R. Loogen: From Reduction Machines to Narrowing Machines. In CCPSD, TAPSOFT 91, LNCS 494, 1991, pp. 438–454.

    Google Scholar 

  25. J.J.Moreno-Navarro, H.Kuchen, R.Loogen, M.Rodríguez-Artalejo: Lazy Narrowing in a Graph Machine, Procs. 2nd. Int. Conf. on Algebraic and Logic Programming, Springer LNCS 463, 1990, pp. 298–317.

    Google Scholar 

  26. J.J.Moreno-Navarro, M. Rodríguez-Artalejo: BABEL: A functional and logic language based and constructor discipline and narrowing. Procs. 1st. Int. Conf. on Algebraic and Logic Progr., Springer LNCS 343, 1989, pp. 223–232.

    Google Scholar 

  27. J.J.Moreno-Navarro, M. Rodríguez-Artalejo: Logic Programming with Functions and Predicates: the language BABEL, to appear in J. Logic Programming.

    Google Scholar 

  28. U.S.Reddy: Narrowing as the Operational Semantics of Functional Languages. Procs. Int. Symp. on Logic Programming, IEEE Comp. Soc. Press 1985, pp. 138–151.

    Google Scholar 

  29. U.S.Reddy: Functional Logic Languages, Part I, Procs. of a Workshop on Graph Reduction, Springer LNCS 279, 1987, pp. 401–425.

    Google Scholar 

  30. D.S. Scott: Domains for Denotational Semantics, Procs. ICALP'82, Springer LNCS 140, 1982, pp. 577–613.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dpt. Informática y Automática, Universidad Complutense de Madrid, Fac. Matemáticas Av. Complutense s/n, 28040, Madrid, Spain

    Francisco Javier & López Fraguas

Authors
  1. Francisco Javier
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. López Fraguas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hélène Kirchner Giorgio Levi

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Javier, F., Fraguas, L. (1992). A general scheme for constraint functional logic programming. In: Kirchner, H., Levi, G. (eds) Algebraic and Logic Programming. ALP 1992. Lecture Notes in Computer Science, vol 632. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013828

Download citation

  • DOI: https://doi.org/10.1007/BFb0013828

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55873-6

  • Online ISBN: 978-3-540-47302-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation