## Complexity of strongly normalising λ-terms via non-idempotent intersection types

### Cached

### Download Links

Citations: | 2 - 0 self |

### BibTeX

@MISC{Bernadet_complexityof,

author = {Alexis Bernadet and Stéphane Lengrand},

title = {Complexity of strongly normalising λ-terms via non-idempotent intersection types},

year = {}

}

### OpenURL

### Abstract

We present a typing system for the λ-calculus, with non-idempotent intersection types. As it is the case in (some) systems with idempotent intersections, a λ-term is typable if and only if it is strongly normalising. Nonidempotency brings some further information into typing trees, such as a bound on the longest β-reduction sequence reducing a term to its normal form. We actually present these results in Klop’s extension of λ-calculus, where the bound that is read in the typing tree of a term is refined into an exact measure of the longest reduction sequence. This complexity result is, for longest reduction sequences, the counterpart of de Carvalho’s result for linear head-reduction sequences.