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.
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download

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
Long-term archiving on : Saturday, April 8, 2017 - 9:29:47 AM

Files

tromp_numbers.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : ensl-00923203, version 1
  • ARXIV : 1401.0379

Collections

Citation

Katarzyna Grygiel, Pierre Lescanne. Counting Terms in the Binary Lambda Calculus. 25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Jun 2014, Paris, France. pp.13. ⟨ensl-00923203⟩

Share

Metrics

Record views

357

Files downloads

446