All traditional implementation techniques for functional languages fail to avoid useless
repetition of work. They are not" optimal" in their implementation of sharing, often causing a …

This paper gives an overview of existing applications of Linear Logic (LL) to issues of
computation. Alter a substantial introduction to LL, it discusses the implications of LL to …

Girard's execution formula (given in [Gir88a]) is a decomposition of usual/^-reduction (or cut-
elimination) in reversible, local and asynchronous elementary moves. It can easily be …

Lambda-calculus is the core of functional programming, and many different ways to evaluate
lambda-terms have been considered. One of the nicest, from the theoretical point of view, is …

Since the rebirth of/spl lambda/-calculus in the late 1960s, three major theoretical
investigations of/spl beta/-reduction have been undertaken:(1) Levy's (1978) analysis of …

We analyze the inherent complexity of implementing Lévy's notion of optimal evaluation for
the &lambda-calculus, where similar redexes are contracted in one step via so-called …

We introduce a new class of higher order rewriting systems, called Interaction Systems (IS's).
IS's are derived from Lafont's (Intuitionistic) Interaction Nets (Lafont 1990) by dropping the …

The Bologna Optimal Higher-order Machine (BOHM) is a prototype implementation of the
core of a functional language based on (a variant of) Lamping's optimal graph reduction …

The paper discusses, in a categorical perspective, some recent works on optimal graph
reduction techniques for the λ-calculus. In particular, we relate the two “brackets” in …

This thesis concerns ow analysis of typed higher order programs. Flow analysis attempts at
compile time to predict the creation, ow and use of values. We will present a suite of …