CSI is a strong automated confluence prover for rewrite systems which has been in
development since 2010. In this paper we report on recent extensions that make CSI more …

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 …

Wanda is a fully automatic termination analysis tool for higher-order term rewriting. In this
paper, we will discuss the methodology used in Wanda. Most pertinently, this includes a …

The termination method of weakly monotonic algebras, which has been defined for higher-
order rewriting in the HRS formalism, offers a lot of power, but has seen little use in recent …

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 …

In this paper, we show how to extend the notion of reducibility introduced by Girard for
proving the termination of β-reduction in the polymorphic λ-calculus, to prove the termination …

First-order applicative rewrite systems provide a natural framework for modeling higher-
order aspects. In this article we present a transformation from untyped applicative term …

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 …

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 …

The static dependency pair method is a method for proving the termination of higher-order
rewrite systemsa la Nipkow. It combines the dependency pair method introduced for first …