This paper surveys a part of the theory ofβ-reduction inλ-calculus which might aptly be
calledperpetual reductions. The theory is concerned withperpetual reduction strategies, ie …

Inductive characterizations of the sets of terms, the subset of strongly normalizing terms and
normal forms are studied in order to reprove weak and strong normalization for the simply …

We propose a new collection of benchmark problems in mechanizing the metatheory of
programming languages, in order to compare and push the state of the art of proof …

This thesis is on termination of computer programs. By termination we mean that the task
given to a computer is processed in a certain amount of time, as opposed to taking infinitely …

Der mich ernstgenommen hat als Kind von elf Jahren. Der mich die Querflöte spielen lehrte.
Der so meine Begeisterung für die klassische Musik entfachte. Der mich aufschloß für die …

We determine the exact bounds for the length of an arbitrary reduction sequence of a term in
the typed λ-calculus with β-, ξ-and η-conversion. There will be two essentially different …

For some typedλ-calculi it is easier to prove weak normalization than strong normalization.
Techniques to infer the latter from the former have been invented over the last twenty years …

Several systems of fixed-point types (also called retract types or recursive types with explicit
isomorphisms) extending system F are considered. The seemingly strongest systems have …

Associate to a rewrite system R having rules l→ r, its labelled version R ω having rules, for
any natural number m ε ω. These rules roughly express that a left-hand side l carrying labels …

An intersection type assignment system for the extension ΛJ of the untyped λ-calculus,
introduced by Joachimski and Matthes, is given and proven to characterize the strongly …