The notion of innocent strategy was introduced by Hyland and Ong in order to capture the
interactive behaviour of λ-terms and PCF programs. An innocent strategy is defined as an …

Standardization is a fundamental notion for connecting programming languages and
rewriting calculi. Since both programming languages and calculi rely on substitution for …

In the absence of termination, confluence of rewriting systems is often hard to establish. The
class of orthogonal rewriting systems is the main class of not-necessarily-terminating, but …

We address the problem of dependency analysis and caching in the context of the λ-
calculus. The dependencies of a λ-term are (roughly) the parts of the λ-term that contribute to …

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 …

Slot and van Emde Boas' weak invariance thesis states that reasonable machines can
simulate each other within a polynomially overhead in time. Is lambda-calculus a …

We present a numerically tractable method to solve exactly the evolution of a N boson
system with binary interactions. The density operator of the system ρ is obtained as the …

Weak orthogonality implies confluence: The higher-order case Page 1 Weak orthogonality
implies confluence: the higher-order case Vincent van Oostrom* and Femke van Raamsdonk …

String rewriting systems have proved very useful to study monoids. In good cases, they give
finite presentations of monoids, allowing computations on those and their manipulation by a …

Stratego is a language for the specification of transformation rules and strategies for
applying them. The basic actions of transformations are matching and building instantiations …