We present a coinductive framework for defining infinitary analogues of equational
reasoning and rewriting in a uniform way. The setup captures rewrite sequences of arbitrary …

A new technique is presented to prove non-termination of term rewriting. The basic idea is to
find a non-empty regular language of terms that is closed under rewriting and does not …

We introduce a notion of higher-order parity automaton which extends to infinitary simply-
typed λ-terms the traditional notion of parity tree automaton on infinitary ranked trees. Our …

We provide a coinductive definition of strongly convergent reductions between infinite
lambda terms. This approach avoids the notions of ordinals and metric convergence which …

We give a coinductive proof of confluence, up to equivalence of root-active subterms, of
infinitary lambda-calculus. We also show confluence of Böhm reduction (with respect to root …

We present a new and formal coinductive proof of confluence and normalisation of B\" ohm
reduction in infinitary lambda calculus. The proof is simpler than previous proofs of this …

We answer an open question in the theory of degrees of infinite sequences with respect to
transducibilityby finite-state transducers. An initial study of this partial order of degrees was …

Our objects of study are infinite sequences and how they can be transformed into each
other. As transformational devices, we focus here on Turing Machines, sequential finite state …

Although finite state transducers are very natural and simple devices, surprisingly little is
known about the transducibility relation they induce on streams (infinite words). We collect …

We present a coinductive framework for defining and reasoning about the infinitary
analogues of equational logic and term rewriting in a uniform, coinductive way. The setup …