97 search results - page 10 / 20 » The Higher-Order Recursive Path Ordering |
CADE
2005
Springer
14 years 10 months ago
2005
Springer
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...
SIGGRAPH
1994
ACM
14 years 1 months ago
1994
ACM
strokes makes it particularly attractive in terms of storage size and transmission efficiency. Its efficient implementation is favourable for incorporation into windowing systems a...
CORR
2002
Springer
13 years 9 months ago
2002
Springer
In this paper we expose the theoretical background underlying our current research. This consists in the development of behaviour-based knowledge systems, for closing the gaps bet...
RTA
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. This paper shows that the suitable orderings for proving innermost termination are characterized by the innermost parallel monotonicity, IP-monotonicity for short. This p...
CSL
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. In this paper, we first briefly survey automated termination proof methods for higher-order calculi. We then concentrate on the higher-order recursive path ordering, for ...