Abstract Interpretation methods constitute a foundation of the termination analysis of term
rewriting. From time to time, remarkable instances of interpretation methods appeared, such …

Dependency pairs constitute a series of very effective techniques for the termination analysis
of term rewriting systems. In this paper, we adapt the static dependency pair framework to …

The class of basic feasible functionals (BFF) is the analog of FP (polynomial time functions)
for type-2 functionals, that is, functionals that can take (first-order) functions as arguments …

Higher-order rewriting is a framework in which higher-order programs can be described by
transformation rules on expressions. A computation occurs by transforming an expression …

We propose generalizations of reduction pairs, well-established techniques for proving
termination of term rewriting, in order to prove unsatisfiability of reachability (infeasibility) in …

Higher-order rewriting is a framework in which one can write higher-order programs and
study their properties. One such property is termination: the situation that for all inputs, the …

In this short paper, we consider a form of higher-order rewriting with a call-by-value
evaluation strategy so as to model call-by-value programs. We briefly present a cost-size …

Automated termination analysis is a central topic in the research of term rewriting. In this talk,
I will first review the theoretical foundation of termination of term rewriting, leading to the …

This paper discusses a number of methods to prove termination of higher-order term
rewriting systems, with a particular focus on large systems. In first-order term rewriting, the …

Time complexity in rewriting is naturally understood as the number of steps needed to
reduce terms to normal forms. Establishing complexity bounds to this measure is a well …