An improved recursive decomposition ordering for higher-order rewrite systems

Munehiro Iwami, Masahiko Sakai, Yoshihito Toyama

研究成果: Article査読

3 被引用数 (Scopus)

抄録

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.

本文言語English
ページ(範囲)988-996
ページ数9
ジャーナルIEICE Transactions on Information and Systems
E81-D
9
出版ステータスPublished - 1998 1 1

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering
  • Artificial Intelligence

フィンガープリント 「An improved recursive decomposition ordering for higher-order rewrite systems」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル