Some properties of random lambda terms
Résumé
We show various (syntactic and behavioral) properties of random lambda-terms. Our main results are that at least 3/4 of 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 different. We show that almost all terms are not strongly normalizing, because any fixed term almost always appears in a random term.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|