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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
We introduce the RB algorithm for Gröbner basis computation, a simpler yet equivalent algorithm to F5GEN. RB contains the… (More)
  • figure 3
Is this relevant?
2009
2009
Type Theory lies on the crossroad of Logics, Mathematics and Computer Science. It may be used to develop the "zero-error… (More)
Is this relevant?
2004
2004
Just as saturation under an appropriate superposition calculus leads to a convergent presentation of a given equational theory… (More)
Is this relevant?
Review
2001
Review
2001
The ρ-calculus integrates in a uniform and simple setting first-order rewriting, λ-calculus and nondeterministic computations… (More)
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1999
Highly Cited
1999
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by adapting the… (More)
Is this relevant?
1995
1995
We introduce rewriting with two sets of rules, the rst interpreted equa-tionally and the second not. A semantic view considers… (More)
Is this relevant?
1992
1992
This paper studies well (quasi) orderings described as rewrite orderings and proposes a new family of well (quasi) orderings that… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1991
1991
This paper is concerned with the type structure of a system including polymorphism, type properties and subtypes. This type… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1990
1990
This paper studies well (quasi) orderings described as rewrite orderings and proposes a new family of well (quasi) orderings that… (More)
Is this relevant?
1989
1989
In this paper we apply rewriting techniques to the generalized word problem GWP in polycyclic groups. We assume the group <italic… (More)
Is this relevant?