Skip to main content
SpringerLink
Log in

A total AC-compatible reduction ordering on higher-order terms

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1998)

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

Included in the following conference series:

Abstract

The higher-order rewriting in presence of associative and commutative (AC) symbols is considered. A higher-order reduction ordering which allows to state the termination of a given rewriting system is presented. This ordering is an AC-extensiou of λ-RPO and is defined on simply-typed λ-terms in Β-normal η-long form. It is total on ground terms.

Partly supported by Polish KBN Grant 8 T11C 034 10.

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. Henk Barendregt Handbook of Theoretical Computer Science, volume B, chapter Functional Programming and Lambda Calculus, pages 321–364. North-Holland, 1990. J. van Leeuwen ed.

    Google Scholar 

  2. Henk Barcndregt Handbook of Logic, in Computer Science, chapter Typed lambda calculi. Oxford Univ. Press, 1993. eds Abramsky et al.

    Google Scholar 

  3. Nachum Dershuwitz and Jean-Pierre Jouanuaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 243–309. North-Holland, 1990.

    Google Scholar 

  4. Jean-Pierre Jouauuaud and Mitsuhiro Okada. Inductive data type systems. Technical report, Université de Paris Sud, 1996. submitted.

    Google Scholar 

  5. Jean-Pierre Jouanuaud and Mitsuhiro Okada. Abstract data type systems. Theoretical Computer Science, 173(2):349–391, February 1997.

    Article  MathSciNet  Google Scholar 

  6. C. Jean-Pierre Jouannaud and Albert Rubio. A recursive path ordering for higher-order terms in η-long Β-normal form. In Ganzinger H., editor, Proc. 7th Rewriting Techniques and Applications, New-Jersey, LNCS 1103. Springer-Verlag, 1996.

    Google Scholar 

  7. Dallas S. Lankford and A. M. Ballantyne. Decision procedures for simple cquational theories with permutative axioms: Complete sets of permutative reductions. Research Report Memo ATP-37, Department of Mathematics and Computer Science, University of Texas, Austin, Texas, USA, August 1977.

    Google Scholar 

  8. Tobias Nipkow. Higher order critical pairs. In Proc. IEEE Symp. on Logic in Comp. Science, Amsterdam, 1991.

    Google Scholar 

  9. Tobias Nipkow. Functional Unification of Higher-Order Patterns. In Proc. 8th IEEE Symp. Logic in Computer Science, pages 64–74, 1993.

    Google Scholar 

  10. Albert Rubio and Robert Nieuwenhuis. A total AC-compatible ordering based on RPO. Theoretical Computer Science, 142(2):209–227, May 15, 1995.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, Warsaw University, Danacha 2, 02-097, Warsaw, Poland

    Dtria Walukiewicz

Authors
  1. Dtria Walukiewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Kim G. Larsen Sven Skyum Glynn Winskel

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Walukiewicz, D. (1998). A total AC-compatible reduction ordering on higher-order terms. In: Larsen, K.G., Skyum, S., Winskel, G. (eds) Automata, Languages and Programming. ICALP 1998. Lecture Notes in Computer Science, vol 1443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055081

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation