Counting Terms in the Binary Lambda Calculus
Logic in Computer Science
2014-01-03 v1 Discrete Mathematics
Data Structures and Algorithms
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.
Cite
@article{arxiv.1401.0379,
title = {Counting Terms in the Binary Lambda Calculus},
author = {Katarzyna Grygiel and Pierre Lescanne},
journal= {arXiv preprint arXiv:1401.0379},
year = {2014}
}