Path ordering (term rewriting)
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
- Logical Methods in Computer Science
- 2015
This paper aims at carrying out termination proofs for simply typed higherorder calculi automatically by using ordering… (More)
Is this relevant?
2007
2007
- J. ACM
- 2007
This article extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a… (More)
Is this relevant?
2006
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
- IJCAR
- 2006
Semantic labelling is a transformational technique for proving termination of Term Rewriting Systems (TRSs). Only its variant… (More)
Is this relevant?
2002
2002
- CADE
- 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
- Theor. Comput. Sci.
- 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
- LICS
- 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
- Fundam. Inform.
- 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
- Theor. Comput. Sci.
- 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
- Theor. Comput. Sci.
- 1985
The uniform termination property (sometimes called Noetherian property) is crucial to applying the Knuth-Bendix completion… (More)
Is this relevant?