Counting Terms in the Binary Lambda Calculus
Abstract
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.
 Publication:

arXiv eprints
 Pub Date:
 January 2014
 DOI:
 10.48550/arXiv.1401.0379
 arXiv:
 arXiv:1401.0379
 Bibcode:
 2014arXiv1401.0379G
 Keywords:

 Computer Science  Logic in Computer Science;
 Computer Science  Discrete Mathematics;
 Computer Science  Data Structures and Algorithms