NOMINAL COALGEBRAIC DATA TYPES WITH APPLICATIONS TO LAMBDA CALCULUS
Contents 1. Introduction 2 2. Preliminaries on Algebra and C Page 1 Logical Methods in …

We study nominal recursors from the literature on syntax with bindings and compare them
with respect to expressiveness. The term" nominal" refers to the fact that these recursors …

We present a general framework for specifying and reasoning about syntax with bindings.
Abstract binder types are modeled using a universe of functors on sets, subject to a number …

Originating in Girard's Linear logic, Ehrhard and Regnier's Taylor expansion of λ-terms has
been broadly used as a tool to approximate the terms of several variants of the λ-calculus …

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 study nominal recursors from the literature on syntax with bindings and compare them
with respect to expressiveness. The term" nominal" refers to the fact that these recursors …

We present some highlights from the emerging theory of infinitary rewriting, both for first-
order term rewriting systems and λ-calculus. In the first section we introduce the framework …

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 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 …

The main aim of this paper is to promote a certain style of doing coinductive proofs, similar to
inductive proofs as commonly done by mathematicians. For this purpose we provide a …