Asymptotically almost all $\lambda$-terms are strongly normalizing - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

## Asymptotically almost all $\lambda$-terms are strongly normalizing

René David
• Function : Author
• PersonId : 859236
Katarzyna Grygiel
• Function : Author
• PersonId : 859238
Jakub Kozic
• Function : Author
• PersonId : 859239
Christophe Raffalli
• Function : Author
• PersonId : 859237
Guillaume Theyssier

Connectez-vous pour contacter l'auteur
Marek Zaionc
• Function : Author
• PersonId : 859240

#### Abstract

We present quantitative analysis of various (syntactic and behavioral) properties of random $\lambda$-terms. Our main results are that asymptotically all the terms are strongly normalizing and that any fixed closed term almost never appears in a random term. Surprisingly, in combinatory logic (the translation of the $\lambda$-calculus into combinators), the result is exactly opposite. We show that almost all terms are not strongly normalizing. This is due to the fact that any fixed combinator almost always appears in a random combinator.

### Dates and versions

hal-00372035 , version 1 (31-03-2009)
hal-00372035 , version 2 (09-10-2009)
hal-00372035 , version 3 (27-09-2010)
hal-00372035 , version 4 (22-10-2012)

### Identifiers

• HAL Id : hal-00372035 , version 4
• ARXIV :

### Cite

René David, Katarzyna Grygiel, Jakub Kozic, Christophe Raffalli, Guillaume Theyssier, et al.. Asymptotically almost all $\lambda$-terms are strongly normalizing. 2012. ⟨hal-00372035v4⟩

### Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

270 View