Please use this identifier to cite or link to this item:
doi:10.22028/D291-41450 | Title: | A Reduction Ordering for Higher-Order Terms |
| Author(s): | Avenhaus, Jürgen Loría-Sáenz, Carlos Steinbach, Joachim |
| Language: | English |
| Year of Publication: | 1995 |
| Place of publication: | Kaiserslautern |
| DDC notations: | 004 Computer science, internet |
| Publikation type: | Report |
| Abstract: | We investigate one of the classical problems of the theory of term rewriting, namely termination. We present an ordering for comparing higher-order terms that can be utilized for testing termination and decreasingness of higher-order conditional term rewriting systems. The ordering relies on a first-order interpretation of higher-order terms and a suitable extension of the RPO. |
| Link to this record: | urn:nbn:de:bsz:291--ds-414505 hdl:20.500.11880/37736 http://dx.doi.org/10.22028/D291-41450 |
| Series name: | SEKI-Report / Deutsches Forschungszentrum für Künstliche Intelligenz, DFKI [ISSN 1437-4447] |
| Series volume: | 95,3 |
| Date of registration: | 28-May-2024 |
| Faculty: | SE - Sonstige Einrichtungen |
| Department: | SE - DFKI Deutsches Forschungszentrum für Künstliche Intelligenz |
| Professorship: | SE - Sonstige |
| Collections: | SciDok - Der Wissenschaftsserver der Universität des Saarlandes |
Files for this record:
| File | Description | Size | Format | |
|---|---|---|---|---|
| SEKI-Report-SR-95-03_Avenhaus-Loría=Sáenz-Steinbach_A-Reduction-Ordering-for-Higher=Order-Terms.pdf | 1,29 MB | Adobe PDF | View/Open |
Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.