The elegant theory of the call-by-value lambda-calculus relies on weak evaluation and
closed terms, that are natural hypotheses in the study of programming languages. To model …

In Plotkin's call-by-value lambda-calculus, solvable terms are characterized syntactically by
means of call-by-name reductions and there is no neat semantical characterization of such …

In the call-by-value lambda-calculus solvable terms have been characterised by means of
call-by-name reductions, which is disappointing and requires complex reasonings. We …

A fundamental issue in the λ-calculus is to find appropriate notions for meaningfulness. It is
well-known that in the call-by-name λ-calculus (CbN) the meaningful terms can be identified …

We study a simple form of standardization, here called factorization, for explicit substitutions
calculi, ie lambda-calculi where beta-reduction is decomposed in various rules. These …

The lambda-calculus is a widely accepted computational model of higher-order functional
programs, yet there is not any direct and universally accepted cost model for it. As a …

An explicit-sharing lambda-calculus is presented, based on a Curry-Howard-style
interpretation of the deep inference proof formalism. Duplication of subterms during …

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 …

Inspired by a recent graphical formalism for lambda-calculus based on linear logic
technology, we introduce an untyped structural lambda-calculus, called lambda j, which …