Counting and generating terms in the binary lambda calculus

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 func...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of functional programming Ročník 25
Hlavní autoři: GRYGIEL, KATARZYNA, LESCANNE, PIERRE
Médium: Journal Article
Jazyk:angličtina
Vydáno: Cambridge, UK Cambridge University Press 01.01.2015
Cambridge University Press (CUP)
Témata:
Combinatorics
Computer Science
Logic
Logic in Computer Science
Mathematics
ISSN:0956-7968, 1469-7653
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0956-7968
1469-7653
DOI:10.1017/S0956796815000271