Work

Counting and generating terms in the binary lambda calculus

Year: 2015

Type: article

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.

Source: Journal of Functional Programming

DOI: 10.1017/s0956796815000271

Authors: KATARZYNA GRYGIEL, PIERRE LESCANNE

Institutions: Jagiellonian University, Lyon 1 Université, École Normale Supérieure de Lyon, Centre National de la Recherche Scientifique, Institut national de recherche en sciences et technologies du numérique, Laboratoire de l'Informatique du Parallélisme

Language: English

Topic: Logic, programming, and type systems

Subfield: Software

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

OpenAlex ID: W2253568516

FWCI: 10.23

Cites: 29

Cited by: 26

Related to: 10