Skip to main content
SpringerLink
Log in

Conditional directed narrowing

  • Conference
  • Conference paper
  • First Online:
Algebraic Methodology and Software Technology (AMAST 1996)

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

  • 144 Accesses

Abstract

We present an implementation of directed narrowing extended to the conditional framework, which is complete for two classes of conditional term rewrite systems: confluent and decreasing on one hand, level-confluent and terminating on the other hand.

For a complete description of the method, see [7]

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. A. Bockmayr, S. Krischer, and A. Werner. Narrowing strategies for arbitrary canonical systems. Fundamenta Informaticae, 24(1,2):125–155, 1995.

    Google Scholar 

  2. J. Chabin and P. Réty. Narrowing Directed by a Graph of Terms. In R. V. Book, editor, Proceedings 4th Conference on Rewriting Techniques and Applications, Como (Italy), volume 488 of LNCS, pages 112–123. Springer-Verlag, April 1991.

    Google Scholar 

  3. N. Dershowitz and G. Sivakumar. Solving Goals in Equational Langages. In S. Kaplan and J-P. Jouannaud, editors, proceedings of the 1st International Workshop on Conditional and Typed Rewriting Systems, volume 308 of LNCS, pages 45–55. Springer-Verlag, 1987.

    Google Scholar 

  4. E. Giovannetti and C. Moiso. A Completeness result for e-unification algorithms based on conditional narrowing. In Proc. of Workshop on Foundation of Logic and Functional Programming, volume 306 of LNCS, pages 157–167. Springer-Verlag, 1986.

    Google Scholar 

  5. M. Hanus. The Integration of Functions into Logic Programming: From Theory to Practice. Journal of Logic Programming, 19 & 20:583–628, May/July 1994.

    Google Scholar 

  6. S. Kaplan. Simplifying conditional term rewriting systems: Unification, termination and confluence. Journal of Symbolic Computation, 4(3):295–334, 1987.

    Google Scholar 

  7. S. Limet and P. Réty. Conditional Directed Narrowing (including proofs). Technical Report 95-11, Laboratoire d'Informatique Fondamentale d'Orléans, 1995. Available by anonymous ftp at ftp-lifo.univ-orleans.fr.

    Google Scholar 

  8. S Limet and P. Réty. Directed Narrowing: An Optimization That More Often Terminates (including proofs). Technical Report 95-07, Laboratoire d'Informatique Fondamentale d'Orléans, 1995. Available by anonymous ftp at ftp-lifo.univorleans.fr.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIFO - Université d'Orléans, B.P. 6759, 45067, Orléans cedex 2, France

    Sébastien Limet & Pierre Réty

Authors
  1. Sébastien Limet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pierre Réty
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Martin Wirsing Maurice Nivat

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Limet, S., Réty, P. (1996). Conditional directed narrowing. In: Wirsing, M., Nivat, M. (eds) Algebraic Methodology and Software Technology. AMAST 1996. Lecture Notes in Computer Science, vol 1101. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014361

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61463-0

  • Online ISBN: 978-3-540-68595-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation