Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Functional and Logic Programming

FLOPS 2001: Functional and Logic Programming pp 153–169Cite as

A Framework for Goal-Directed Bottom-Up Evaluation of Functional Logic Programs

  • Conference paper
  • First Online:

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

Abstract

In this paper we start the design of a functional-logic deductive database language. Given that most logic deductive languages consider bottom-up evaluation as operational mechanism, here we will focus on the development of an operational semantics based on bottomup evaluation for functional logic languages. As in the logic paradigm, the bottom-up evaluation will consist in a magic transformation for a given program-query into a magic program-query for which the bottomup evaluation will simulate the top-down one of the original program.

The author has been partially supported by the Spanish CICYT (project TIC 98-0445-C03-02 TREND)

Acknowledgements

We would like to thank anonymous referees for their useful comments.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. M. Almendros-Jiménez and A. Becerra-Terón. A Framework for Goal Directed Bottom-Up Evaluation of Functional Logic Programs, available in http://www.ual.es/~jalmen. Technical report, Universidad de Almerìa, 2000.

  2. S. Antoy, R. Echahed, and M. Hanus. A Needed Narrowing Strategy. In Proc. of POPL’94. pp. 268–279. ACM Press.

    Google Scholar 

  3. K. R. Apt. Logic programming. In Handbook of Theoretical Computer Science. Vol B: Formal Models and Semantics, chapter 10, pp. 493–574. MIT Press, 1990.

    MATH  Google Scholar 

  4. R. Barbuti, R. Giacobazzi, and G. Levi. A General Framework for Semantics-based Bottom-up Abstract Interpretation of Logic Programs. TOPLAS, 15(1):133–181, 1993.

    Article  Google Scholar 

  5. C. Beeri and R. Ramakrishnan. On the Power of Magic. JLP, 10(3,4):255–299, 1991.

    Article  MathSciNet  Google Scholar 

  6. M. Codish. Efficient Goal Directed Bottom-up Evaluation of Logic Programs. In Proc. of ICLP’97. pp. 422–439. MIT Press.

    Google Scholar 

  7. J. C. González-Moreno, M. T. Hortalá-González, F. López-Fraguas, and M. Rodrìguez-Artalejo. An Approach to Declarative Programming Based on a Rewriting Logic. JLP, 1(40):47–87, 1999.

    Article  MathSciNet  Google Scholar 

  8. M. Hanus. The Integration of Functions into Logic Programming: From Theory to Practice. JLP, 19,20:583–628, 1994.

    Article  MathSciNet  Google Scholar 

  9. M. Hanus. Curry, An Integrated Functional Logic Language, Version 0.7.1. Technical report, University of Kiel, Germany, June 2000.

    Google Scholar 

  10. M. Hanus and C. Prehofer. Higher-order Narrowing with Definitional Trees. JFP, 9(1):33–75, 1999.

    MathSciNet  MATH  Google Scholar 

  11. P. Kanellakis, G. Kuper, and P. Revesz. Constraint Query Languages. JCSS, 51(1):26–52, 1995.

    MathSciNet  Google Scholar 

  12. D. Kemp, D. Srivastava, and P. Stuckey. Bottom-up Evaluation and Query Optimization of Well-founded Models. TCS, 146(1-2):145–184, 1995.

    Article  MathSciNet  Google Scholar 

  13. D. Kemp and P. Stuckey. Optimizing Bottom-up Evaluation of Constraint Queries. JLP, 26(1):1–30, 1996.

    Article  MathSciNet  Google Scholar 

  14. R. Loogen, F. J. López-Fraguas, and M. Rodrìguez-Artalejo. A Demand Driven Computation Strategy for Lazy Narrowing. In Proc. of PLILP’93. pp. 184–200. LNCS 714.

    Google Scholar 

  15. F. J. Lopez-Fraguas. A General Scheme for Constraint Functional Logic Programming. In Proc. of ALP’92. pp. 213–227. LNCS 632.

    Google Scholar 

  16. F. J. López-Fraguas and J. Sánchez-Hernández. TOY: A Multiparadigm Declarative System. In Proc. of the RTA’99. pp. 244–247. LNCS 1631.

    Google Scholar 

  17. J. J. Moreno-Navarro and M. Rodrìguez-Artalejo. Logic Programming with Functions and Predicates: The Language BABEL. JLP, 12(3):191–223, 1992.

    Article  Google Scholar 

  18. A. Poulovasslis and C. Small. A Domain-theoretic Approach to Integrating Functional and Logic Database Languages. In Proc. of VLDB’93. pp. 416–428. Morgan Kaufmann.

    Google Scholar 

  19. R. Ramakrishnan. Magic Templates: A Spellbinding Approach to Logic Programs. JLP, 11(3,4):189–216, 1991.

    Article  MathSciNet  Google Scholar 

  20. R. Ramakrishnan, D. Srivastava, S. Sudarshan, and P. Seshadri. The CORAL Deductive System. In VLDB Journal, 3(2):161–210, 1994.

    Article  Google Scholar 

  21. R. Ramakrishnan and J. Ullman. A Survey of Deductive Database Systems. JLP, ii23(2):125–149, 1995.

    Article  MathSciNet  Google Scholar 

  22. S. Reddi, A. Poulovassilis, and C. Small. PFL: An Active Functional DBPL. In Active Rules in Database Systems. chapter 16, pp. 297–308. Springer, 1999.

    Google Scholar 

  23. D. Sacca and C. Zaniolo. The Generalized Counting Method for Recursive Logic Queries. TCS, 62(1-2):187–220, 1988.

    Article  MathSciNet  Google Scholar 

  24. H. Seki. On the Power of Alexander Templates. In Proc. of PODS’89. pp. 150–159. ACM Press.

    Google Scholar 

  25. J. D. Ullman. Bottom-up Beats Top-down for Datalog. In Procs. of PODS’89. pp. 140–149. ACM Press.

    Google Scholar 

  26. J. Vaghani, K. Ramamohanarao, D. B. Kemp, Z. Somogyi, P. J. Stuckey, T. S. Leask, and J. Harland. The Aditi Deductive Database System. VLDB, 3(2): 245–288, 1994.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dpto. de Lenguajes y Computación, Universidad de Almerìa, 04120-Almerìa, Spain

    Jesús M. Almendros-Jiménez & Antonio Becerra-Terón

Authors
  1. Jesús M. Almendros-Jiménez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Antonio Becerra-Terón
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Wirtschaftsinformatik, WestfälischeWilhelms-Universität Münster, Steinfurter Straße 109, 48149, Münster, Germany

    Herbert Kuchen

  2. Department of Information and Computer Science, Waseda University, 4-1, Okubo 3-chome, Shinjuku-ku, Tokyo, 169-8555, Japan

    Kazunori Ueda

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Almendros-Jiménez, J.M., Becerra-Terón, A. (2001). A Framework for Goal-Directed Bottom-Up Evaluation of Functional Logic Programs. In: Kuchen, H., Ueda, K. (eds) Functional and Logic Programming. FLOPS 2001. Lecture Notes in Computer Science, vol 2024. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44716-4_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-44716-4_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41739-2

  • Online ISBN: 978-3-540-44716-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation