 |
 |
 |
 |
Conference papers
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.
Cited literature [18 references]
https://hal-ens-lyon.archives-ouvertes.fr/ensl-00923203
Contributor : Pierre Lescanne <>
Submitted on : Thursday, January 2, 2014 - 8:15:13 AM
Last modification on : Wednesday, November 20, 2019 - 3:19:57 AM
Document(s) archivé(s) le : Saturday, April 8, 2017 - 9:29:47 AM
Contributor : Pierre Lescanne <>
Submitted on : Thursday, January 2, 2014 - 8:15:13 AM
Last modification on : Wednesday, November 20, 2019 - 3:19:57 AM
Document(s) archivé(s) le : Saturday, April 8, 2017 - 9:29:47 AM
Files
tromp_numbers.pdf
Files produced by the author(s)
