Skip to main content
SpringerLink
Log in

Uniform narrowing strategies

  • 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

In this paper we consider solution of equations in initial models, by using narrowing relationship. We introduce the notion of uniform narrowing strategies and prove the completeness of narrowing algorithms using such strategies. Then, we define the class of uniform specifications as specifications for which every narrowing strategy is uniform, and prove their decidability.

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. D.Bert, R.Echahed: Design and Implementation of a Generic, Logic and Functional Programming Language. Proc. of ESOP'86, LNCS n∘ 213, Saarebrücken, March 1986 119–132.

    Google Scholar 

  2. P.G.Bosco, E.Giovannetti, C.Moiso: Refined Strategies for semantic unification. Proc. of TAPSOFT '87, LNCS n∘ 250, Pisa, March 1987, 276–290.

    Google Scholar 

  3. D.DeGroot, G.Lindstrom: Logic Programming: Relations, Functions, and Equations. Prentice Hall, Englewood Cliffs, NJ, 1986.

    Google Scholar 

  4. N.Dershowitz, J.P.Jouannaud: Rewrite Systems. Chapter 15 of Volume B of “Handbook of Theoretical Computer Science”, North-Holland, 1990.

    Google Scholar 

  5. N.Dershowitz, D.A.Plaisted: Logic Programming cum Applicative Programming. Proc. SLP'85, Boston, July 1985, 54–66.

    Google Scholar 

  6. M.Dinkbas, P.van Hentenryck: Extending Unification Algorithms for the Integration of functional Programming int Logic Programming. J. Logic Programming 1987, 4, 199–227.

    Google Scholar 

  7. R.Echahed: On Completeness of Narrowing Strategies. TCS 72, 1990, 133–146. Also appeared in Proc. CAAP'88. LNCS 299.

    Google Scholar 

  8. R.Echahed: Sur l'Intégration des Langages Algébriques et Logiques. PhD thesis, Institut National Polytechnique de Grenoble, 1990.

    Google Scholar 

  9. F.Fages, G.Huet: Complete sets of Unifiers and Matchers in Equational Theories. TCS 43, 1986, 189–200.

    Google Scholar 

  10. M.J.Fay: First Order Unification in an Equational Theory. Proc. of the 4th workshop on automated Deduction, Austin, Texas, February 1979, 161–167.

    Google Scholar 

  11. L.Fribourg: SLOG: A Logic Programming Language Interpreter Based on Clausal Superposition and Rewriting. Proc. of SLP '85, Boston, July 1985, 172–184.

    Google Scholar 

  12. L.Fribourg: A strong restriction of the inductive completion procedure. Proc. of ICALP'86, LNCS 226, 105–115, 1986.

    Google Scholar 

  13. D.deFrutos-Escrig, M.I.Fernandez-Camacho: On narrowing Strategies for partial Non-strict Functions, to appear in Proc of TAPSOFT '91.

    Google Scholar 

  14. J.H.Gallier, S.Raatz: Extending SLD-Resolution to Equational Horn Clauses using E-unification. J. Logic Programming 1989, 3–43.

    Google Scholar 

  15. J.A.Goguen, J.Meseguer: EQLOG: Equality, Types and Generic Modules for Logic Programming. in Functional and Logic Programming, ed. DeGroot and Lindstrom, Prentice-Hall, 1986.

    Google Scholar 

  16. S.Hölldobler: Foundations of Equational Logic Programming. LNAI n∘ 353, Edt. J. Siekmann, Springer Verlag. 1989.

    Google Scholar 

  17. G.Huet, D.C.Oppen: Equations and Rewrite rules: a Survey. In “Formal Languages: Perspectives and Open problems”. Ed. R. Book, Academic press, 1980.

    Google Scholar 

  18. J-M.Hullot: Canonical Forms and Unification. Proc. of 5th CADE, LNCS n∘ 87, 1980, 318–334.

    Google Scholar 

  19. D.Kapur, P.Narendran, H.Zhang: On Sufficient Completeness and Related Properties of Term Rewriting Systems. Acta Informatica 24, 395–415. 1987.

    Google Scholar 

  20. D.Kapur, P.Narendran, R.J.Rosenkrantz, H.Zhang: Sufficient-Completeness, ground-reducibility and their complexity. Acta Informatica 28, 311–350. 1991.

    Google Scholar 

  21. A.Middeldorp, E.Hamoen: Counterexamples to completeness results for basic narrowing. draft of december 5th, 1991.

    Google Scholar 

  22. J.J.Moreno-Navarro, M.Rodriguez-Artalejo: Logic Programming with Functions and Predicats: The Language BABEL. Rapport DIA/89/3, Universidad Complutense Madrid.

    Google Scholar 

  23. W.Nutt, P.Réty, G.Smolka: Basic Narrowing Revisited. Seki-Report SR-87-07, University of Kaiserslautern, 1987.

    Google Scholar 

  24. P.Padawitz: Computing in Horn Clause Theories, Springer, 1988.

    Google Scholar 

  25. D.A.Plaisted: Semantic Confluence Tests and Completion Methods. J. Information and Control 65, 1985, 182–215.

    Google Scholar 

  26. G.D.Plotkin: Building-in Equational Theories. Machine Intelligence 7, 1972, 73–90.

    Google Scholar 

  27. U.S.Reddy: Narrowing as the Operational Semantics of Functional Languages. In: Logic Programming: Relations, Functions, and Equations, D. DeGroot and G. Lindstrom, eds. Prentice Hall, Englewood Cliffs, NJ, 1986.

    Google Scholar 

  28. J-H.You: Outer Narrowing for Equational Theories Based on Constructors. Proc. of ICALP'88.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IMAG-LGI, CNRS, BP 53x, F-38041, Grenoble, France

    Rachid Echahed

Authors
  1. Rachid Echahed
    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

Echahed, R. (1992). Uniform narrowing strategies. 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/BFb0013831

Download citation

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

  • 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