Results 1  10
of
1,019
The recursive path and polynomial ordering∗
"... In most termination tools two ingredients, namely recursive path orderings (RPO) and polynomial interpretation orderings (POLO), are used in a consecutive disjoint way to solve the final constraints generated from the termination problem. We present a simple ordering that combines both RPO and POLO ..."
Abstract
 Add to MetaCart
In most termination tools two ingredients, namely recursive path orderings (RPO) and polynomial interpretation orderings (POLO), are used in a consecutive disjoint way to solve the final constraints generated from the termination problem. We present a simple ordering that combines both RPO
The HigherOrder Recursive Path Ordering
 FOURTEENTH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE
, 1999
"... This paper extends the termination proof techniques based on reduction orderings to a higherorder setting, by adapting the recursive path ordering definition to terms of a typed lambdacalculus generated by a signature of polymorphic higherorder function symbols. The obtained ordering is wellfoun ..."
Abstract

Cited by 58 (11 self)
 Add to MetaCart
This paper extends the termination proof techniques based on reduction orderings to a higherorder setting, by adapting the recursive path ordering definition to terms of a typed lambdacalculus generated by a signature of polymorphic higherorder function symbols. The obtained ordering is well
Recursive Path Ordering for Infinite Labelled
 in: Proc. 3rd IJCAR, LNAI 4130, 2006
"... Semantic labelling is a transformational technique for proving termination of Term Rewriting Systems (TRSs). Only its variant with finite sets of labels was used so far in tools for automatic termination proving and variants with infinite sets of labels were considered not to be suitable for aut ..."
Abstract
 Add to MetaCart
for automation. We show that such automation can be achieved for semantic labelling with natural numbers, in combination with recursive path ordering (RPO). In order to do so we developed algorithms to deal with recursive path ordering for these infinite labelled systems. Using these techniques, our tool
Recursive Path Orderings can also be Incremental
"... Abstract. In this paper the Recursive Path Ordering is adapted for proving termination of rewriting incrementally. The new ordering, called Recursive Path Ordering with Modules, has as ingredients not only a precedence but also an underlying ordering ❂B. It can be used for incremental (innermost) te ..."
Abstract
 Add to MetaCart
Abstract. In this paper the Recursive Path Ordering is adapted for proving termination of rewriting incrementally. The new ordering, called Recursive Path Ordering with Modules, has as ingredients not only a precedence but also an underlying ordering ❂B. It can be used for incremental (innermost
Recursive path ordering for infinite labelled rewrite systems
 In Proc. 3rd IJCAR, volume 4130 of LNAI
, 2006
"... Abstract Semantic labelling is a transformational technique for proving termination of Term Rewriting Systems (TRSs). Only its variant with finite sets of labels was used so far in tools for automatic termination proving and variants with infinite sets of labels were considered not to be suitable f ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
for automation. We show that such automation can be achieved for semantic labelling with natural numbers, in combination with recursive path ordering (RPO). In order to do so we developed algorithms to deal with recursive path ordering for these infinite labelled systems. Using these techniques, our tool, TPA
Polymorphic higherorder recursive path orderings
 Journal of the ACM
, 2005
"... This paper extends the termination proof techniques based on reduction orderings to a higherorder setting, by defining a family of recursive path orderings for terms of a typed lambdacalculus generated by a signature of polymorphic higherorder function symbols. These relations can be generated fro ..."
Abstract

Cited by 25 (6 self)
 Add to MetaCart
This paper extends the termination proof techniques based on reduction orderings to a higherorder setting, by defining a family of recursive path orderings for terms of a typed lambdacalculus generated by a signature of polymorphic higherorder function symbols. These relations can be generated
Certified higherorder recursive path ordering
 In RTA, LNCS
, 2006
"... Abstract. Recursive path ordering (RPO) is a wellknown reduction ordering introduced by Dershowitz [6], that is useful for proving termination of term rewriting systems (TRSs). Jouannaud and Rubio generalized this ordering to the higherorder case thus creating the higherorder recursive path order ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
Abstract. Recursive path ordering (RPO) is a wellknown reduction ordering introduced by Dershowitz [6], that is useful for proving termination of term rewriting systems (TRSs). Jouannaud and Rubio generalized this ordering to the higherorder case thus creating the higherorder recursive path
Recursive Path Orderings can be ContextSensitive
, 2002
"... Contextsensitive rewriting (CSR) is a simple restriction of rewriting which can be used e.g. for modelling noneager evaluation in programming languages. Many times termination is a crucial property for program verification. Hence, developing tools for automatically proving termination of CSR is ne ..."
Abstract

Cited by 30 (22 self)
 Add to MetaCart
Contextsensitive rewriting (CSR) is a simple restriction of rewriting which can be used e.g. for modelling noneager evaluation in programming languages. Many times termination is a crucial property for program verification. Hence, developing tools for automatically proving termination of CSR is necessary. All known methods for...
Unifying the KnuthBendix, recursive path and polynomial orders
 In Proc. PPDP ’13
, 2013
"... We introduce a simplification order called the weighted path order (WPO). WPO compares weights of terms as in the KnuthBendix order (KBO), while WPO allows weights to be computed by an arbitrary interpretation which is weakly monotone and weakly simple. We investigate summations, polynomials and ma ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
We introduce a simplification order called the weighted path order (WPO). WPO compares weights of terms as in the KnuthBendix order (KBO), while WPO allows weights to be computed by an arbitrary interpretation which is weakly monotone and weakly simple. We investigate summations, polynomials
Results 1  10
of
1,019