Counting and Generating Terms in the Binary Lambda Calculus (Extended version) - ENS de Lyon - École normale supérieure de Lyon Access content directly
Preprints, Working Papers, ... Year : 2015

Counting and Generating Terms in the Binary Lambda Calculus (Extended version)

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. In a second part we use this approach to generate random lambda terms using Boltzmann samplers.
Fichier principal
Vignette du fichier
Grygiel_Lescanne_ArXiv.pdf (612.54 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

ensl-01229794 , version 1 (17-11-2015)

Identifiers

Cite

Katarzyna Grygiel, Pierre Lescanne. Counting and Generating Terms in the Binary Lambda Calculus (Extended version). 2015. ⟨ensl-01229794⟩
210 View
292 Download

Altmetric

Share

Gmail Facebook X LinkedIn More