| | |
| | |
Stat |
Members: 3647 Articles: 2'512'730 Articles rated: 2609
08 May 2024 |
|
| | | |
|
Article overview
| |
|
Counting and Generating Terms in the Binary Lambda Calculus (Extended version) | Katarzyna Grygiel
; Pierre Lescanne
; | Date: |
17 Nov 2015 | 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: | arXiv, 1511.5334 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
|
| |
|
|
|