We give an axiomatic presentation of sharing-via-labelling for weak lambda-calculi, that
makes it possible to formally compare many different approaches to fully lazy sharing, and …

In this paper, we show how to extend the notion of reducibility introduced by Girard for
proving the termination of β-reduction in the polymorphic λ-calculus, to prove the termination …

Abstract We define infinitary Combinatory Reduction Systems (iCRSs), thus providing the
first notion of infinitary higher-order rewriting. The systems defined are sufficiently general …

We define infinitary combinatory reduction systems (iCRSs). This provides the first extension
of infinitary rewriting to higher-order rewriting. We lift two well-known results from infinitary …

The confluence of untyped λ-calculus with unconditional rewriting is now well un-derstood.
In this paper, we investigate the confluence of λ-calculus with conditional rewriting and …

Reducibility is a powerful proof method which applies to various properties of typed terms in
different type systems. For strong normalization, different vari-ants are known, such as …

We revisit Girard's reducibility candidates by proposing a general of the notion of neutral
terms. They are the terms which do not interact with some contexts called elimination …

Définitions par réécriture dans le lambda-calcul : confluence, réductibilité et typage Page 1
Département de formation doctorale en informatique École doctorale IAEM Lorraine Définitions …

We present a translation function from nominal rewriting systems (NRSs) to combinatory
reduction systems (CRSs), transforming closed nominal rules and ground nominal terms to …

A SHORT PROOF OF THE DECIDABILITY OF NORMALIZATION IN RECURSIVE PROGRAM
SCHEMES 1 Introduction Page 1 A SHORT PROOF OF THE DECIDABILITY OF …