Counting Terms in the Binary Lambda Calculus - ENS de Lyon - École normale supérieure de Lyon Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Counting Terms in the Binary Lambda Calculus

Résumé

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.
Fichier principal
Vignette du fichier
tromp_numbers.pdf (461.28 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

ensl-00923203 , version 1 (02-01-2014)

Identifiants

Citer

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⟩
279 Consultations
587 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More