No CrossRef data available.
Published online by Cambridge University Press: 29 December 2015
In a paper, entitled Binary lambda calculus and combinatory logic, John Tromp presents a simple way of encoding lambda calculus terms as binary sequences. In what follows, we study the numbers of binary strings of a given size that represent lambda terms and derive results from their generating functions, especially that the number of terms of size n grows roughly like 1.963447954. . .n. In a second part we use this approach to generate random lambda terms using Boltzmann samplers.
This work was partially supported by the grant 2013/11/B/ST6/00975 founded by the Polish National Science Center.
Discussions
No Discussions have been published for this article.