| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6871339 | Discrete Applied Mathematics | 2018 | 17 Pages |
Abstract
We show further how some properties of random lambda terms can be analyzed and present a way to sample lambda terms uniformly at random in a very efficient way. This allows to generate terms of size more than one million within a reasonable time, which is significantly better than the samplers presented in the literature so far.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Olivier Bodini, Bernhard Gittenberger, Zbigniew GoÅÄbiewski,