Chapter

Rewriting Techniques and Applications

Volume 2051 of the series Lecture Notes in Computer Science pp 261-275

Date:

On Termination of Higher-Order Rewriting

  • Femke van RaamsdonkAffiliated withDivision of Mathematics and Computer Science Faculty of Sciences, Vrije UniversiteitCWI

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We discuss the termination methods using the higher-order recursive path ordering and the general scheme for higher-order rewriting systems and combinatory reduction systems.