高階書換え系における引数切り落とし関数の下での実効規則について
Year: 2012
Type: article
Abstract: The static dependency pair method is known as a powerful method for proving termination of higher-order rewrite systems (HRSs). The method proves the termination by showing the non-loopingness of all the static recursion components respectively that are obtained by some static recursion analysis. The notion of usable rules has been proposed to reduce the number of rewrite rules considered in showing the non-loogingness. However, we sometimes fail to reduce rewrite rules by reason of some dependency analysis through higher-order variables. In first-order term rewriting, the notion of usable rules under argument filterings has also been proposed, which can reduce more rewrite rules in general. In this paper, we extend the notion to HRSs. By filtering subterms rooted by a higher-order variable, we can avoid analyzing dependencies through higher-order variables.
Language: Japanese
Subfield: Software
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7144775378