Asymptotically almost all $λ$-terms are strongly normalizing

Details Asymptotically almost all $λ$-terms are strongly normalizing Asymptotically almost all $λ$-terms are strongly normalizing

2009-03-31

arxiv.org/abs/0903.5505v3

Mathematics

Logic

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Asymptotically almost all $λ$-terms are strongly normalizing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Asymptotically almost all $λ$-terms are strongly normalizing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asymptotically almost all $λ$-terms are strongly normalizing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-20888