Path ordering (term rewriting)

Known as: MPO (term rewriting), LPO (term rewriting), Lexicographic path ordering 
In theoretical computer science, in particular in term rewriting, a path ordering is a well-founded strict total order (>) on the set of all terms… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1981-2017
020406019812017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
This paper aims at carrying out termination proofs for simply typed higherorder calculi automatically by using ordering… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2007
2007
This article extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a… (More)
  • figure 1
  • figure 2
Is this relevant?
2006
2006
Semantic labelling is a transformational technique for proving termination of Term Rewriting Systems (TRSs). Only its variant… (More)
Is this relevant?
2006
2006
Semantic labelling is a transformational technique for proving termination of Term Rewriting Systems (TRSs). Only its variant… (More)
Is this relevant?
2002
2002
Context-sensitive rewriting (CSR) is a simple restriction of rewriting which can be used e.g. for modelling non-eager evaluation… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We present techniques to prove termination and innermost termination of term rewriting systems automatically. In contrast to… (More)
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?
Highly Cited
1995
Highly Cited
1995
A new kind of transformation of TRS's is proposed, depending on a choice for a model for the TRS. The labelled TRS is obtained… (More)
Is this relevant?
1995
1995
It is shown that a termination proof for a term rewriting system using a lexicographic path ordering yields a multiply recursive… (More)
Is this relevant?
1985
1985
The uniform termination property (sometimes called Noetherian property) is crucial to applying the Knuth-Bendix completion… (More)
Is this relevant?