The semantics of the untyped (call-by-name) lambda-calculus is a well developed field built
around the concept of solvable terms, which are elegantly characterized in many different …

To better understand Barendregt's genericity for the untyped call-by-value λ-calculus, we
start by first revisiting it in call-by-name, adopting a lighter statement and establishing a …

A fundamental issue in the $\lambda $-calculus is to find appropriate notions for
meaningfulness. Inspired by well-known results for the call-by-name $\lambda $-calculus …

In this paper we treat various aspects of a notion that is central in term rewriting, namely that
of descendants or residuals. We address both first-order term rewriting and λ-calculus, their …

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

In the lambda calculus a term is solvable iff it is operationally relevant. Solvable terms are a
superset of the terms that convert to a final result called normal form. Unsolvable terms are …

This paper studies the notion of meaningfulness for a unifying framework called dBang-
calculus, which subsumes both call-by-name (dCbN) and call-by-value (dCbV). We first …