Results

**1 - 3**of**3**### Fundamental Properties of Lambda-calculus

, 2009

"... 1 Basic definitions of Lambda-calculus 4 1.1 Lambda-terms in de Bruijn notation and substitution.... 4 1.2 Beta-reduction.......................... 4 ..."

Abstract
- Add to MetaCart

1 Basic definitions of Lambda-calculus 4 1.1 Lambda-terms in de Bruijn notation and substitution.... 4 1.2 Beta-reduction.......................... 4

### DOI: 10.1017/S0960129508006816 AN INSERTION OPERATOR PRESERVING INFINITE REDUCTION SEQUENCES

, 2013

"... ABSTRACT. A common way to show the termination of the union of two abstract reduction systems, provided both systems terminate, is to prove they enjoy a specific property (some sort of “commutation ” for instance). This specific property is actually used to show that, for the union not to terminate, ..."

Abstract
- Add to MetaCart

ABSTRACT. A common way to show the termination of the union of two abstract reduction systems, provided both systems terminate, is to prove they enjoy a specific property (some sort of “commutation ” for instance). This specific property is actually used to show that, for the union not to terminate, one out of both systems must itself be non-terminating, which leads to a contradiction. Unfortunately, the property may be impossible to prove because some of the objects that are reduced do not enjoy an adequate form. The purpose of this article is then threefold. It first introduces an operator enabling to insert a reduction step on such an object, and therefore to change its shape, while still preserving the ability to use the property. Of course, some new properties should be verified. Secondly, as an instance of our technique, the operator is applied to relax a well-known lemma stating the termination of the union of two termination abstract reduction systems. Finally, this last lemma is applied in a peculiar and in a more general way to show the termination of some lambda-calculi with inductive types augmented with specific reductions dealing with: (1) copies of inductive types; and (2) with the representation of symmetric groups. 1.

### Contents

, 2000

"... This formal development defines µJava, a small fragment of the programming language Java (with essentially just classes), together with a corresponding virtual machine, a specification of its bytecode verifier and a lightweight bytecode verifier. It is shown that µJava and the given specification of ..."

Abstract
- Add to MetaCart

This formal development defines µJava, a small fragment of the programming language Java (with essentially just classes), together with a corresponding virtual machine, a specification of its bytecode verifier and a lightweight bytecode verifier. It is shown that µJava and the given specification of the bytecode verifier are type-safe, and that the lightweight bytecode verifier is