• search hit 1 of 6
Back to Result List

A Reduction Ordering for Higher-Order Terms

  • We investigate one of the classical problems of the theory ofterm rewriting, namely termination. We present an ordering for compar-ing higher-order terms that can be utilized for testing termination anddecreasingness of higher-order conditional term rewriting systems. Theordering relies on a first-order interpretation of higher-order terms anda suitable extension of the RPO.

Download full text files

Export metadata

Metadaten
Author:Jürgen Avenhaus, Carlos Loría-Sáenz, Joachim Steinbach
URN:urn:nbn:de:hbz:386-kluedo-3436
Series (Serial Number):SEKI Report (95,3)
Document Type:Preprint
Language of publication:English
Year of Completion:1999
Year of first Publication:1999
Publishing Institution:Technische Universität Kaiserslautern
Date of the Publication (Server):2000/04/03
Faculties / Organisational entities:Kaiserslautern - Fachbereich Informatik
DDC-Cassification:0 Allgemeines, Informatik, Informationswissenschaft / 004 Informatik
Licence (German):Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011