Rewrite order

Known as: Reduction ordering, Simplification ordering, Rewrite relation

In theoretical computer science, in particular in automated theorem proving and term rewriting,a binary relation (→) on the set of terms is called a…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2014

Confluence of term rewriting systems (TRSs) is undecidable, even for flat TRSs [MOJ06] or length-two string rewrite systems [SW08…

2007

We investigate some preservation properties for classes of regular languages of unranked ordered terms under an appropriate…

2006

We decompose an arbitrary rewrite relation into the product of a context-free system and an inverse context-free system with…

2004

Abstract.Just as saturation under an appropriate superposition calculus leads to a convergent presentation of a given equational…

Review

2001

Review

2001

The ρ-calculus integrates in a uniform and simple setting first-order rewriting, λ-calculus and nondeterministic computations…

1995

We propose a constructive termination proof in the Calculus of Constructions of any finite term rewriting systems whose rules can…

1994

1990

A study is made of well (quasi) orderings which are described as rewrite orderings, and a family of well (quasi) orderings that…

1989

In this paper we apply rewriting techniques to the generalized word problem GWP in polycyclic groups. We assume the group <italic…

1985

A new partial ordering scheme for proving uniform termination of term rewriting systems is presented. The basic idea is that two…