The dependency pair technique is a powerful modular method for automated termination
proofs of term rewrite systems (TRSs). We present two important extensions of this …

Term rewriting systems play an important role in many areas of computer science. In
essence, they provide an abstract way to define algorithms. The theory is simple: terms …

In this paper, we first briefly survey automated termination proof methods for higher-order
calculi. We then concentrate on the higher-order recursive path ordering, for which we …

Termination is the fundamental property of a program that for each input, the evaluation will
eventually stop and return some output. Although the question whether a given program …

This paper aims at carrying out termination proofs for simply typed higher-order calculi
automatically by using ordering comparisons. To this end, we introduce the computability …

Higher-order rewrite systems (HRSs) and simply-typed term rewriting systems (STRSs) are
computational models of functional programs. We recently proposed an extremely powerful …

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 …

We extend the higher-order termination method of dynamic dependency pairs to Algebraic
Functional Systems (AFSs). In this setting, simply typed lambda-terms with algebraic …

arXiv:1804.08855v1 [cs.LO] 24 Apr 2018 Page 1 arXiv:1804.08855v1 [cs.LO] 24 Apr 2018 1
Higher-order dependency pairs Frédéric Blanqui LORIA⋆, Campus Scientifique, BP 239 …

We enhance the dependency pair method in order to prove termination using recursive
structure analysis in simply-typed term rewriting systems, which is one of the computational …