Abstract
Simplification orderings, like the recursive path ordering and the improved recursive decomposition ordering, are widely used for proving the termination property of term rewriting systems. The improved recursive decomposition ordering is known as the most powerful simplification ordering. Recently Jouannaud and Rubio extended the recursive path ordering to higher-order rewrite systems by introducing an ordering on type structure. In this paper we extend the improved recursive decomposition ordering for proving termination of higher-order rewrite systems. The key idea of our ordering is a new concept of pseudoterminal occurrences.
| Original language | English |
|---|---|
| Pages (from-to) | 988-996 |
| Number of pages | 9 |
| Journal | IEICE Transactions on Information and Systems |
| Volume | E81-D |
| Issue number | 9 |
| Publication status | Published - 1998 Jan 1 |
Keywords
- Higher-order rewrite system
- Pseudoterminal occurrence
- Simplification ordering
- Term rewriting system
- Termination, improved recursive decomposition ordering
- Type
ASJC Scopus subject areas
- Software
- Hardware and Architecture
- Computer Vision and Pattern Recognition
- Electrical and Electronic Engineering
- Artificial Intelligence