Loading...
Please wait, while we are loading the content...
Similar Documents
Counting and generating terms in the binary lambda calculus
| Content Provider | Scilit |
|---|---|
| Author | Grygiel, Katarzyna Lescanne, Pierre |
| Copyright Year | 2015 |
| Description | In a paper, entitledBinary 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 sizengrows roughly like 1.963447954. . $.^{n}$. In a second part we use this approach to generate random lambda terms using Boltzmann samplers. |
| Related Links | http://arxiv.org/pdf/1511.05334 https://www.cambridge.org/core/services/aop-cambridge-core/content/view/47DE83E8BD697326F0FFD43351E083E3/S0956796815000271a.pdf/div-class-title-counting-and-generating-terms-in-the-binary-lambda-calculus-a-href-afn1-ref-type-fn-a-div.pdf |
| ISSN | 09567968 |
| e-ISSN | 14697653 |
| DOI | 10.1017/s0956796815000271 |
| Journal | Journal of Functional Programming |
| Volume Number | 25 |
| Language | English |
| Publisher | Cambridge University Press (CUP) |
| Publisher Date | 2015-01-01 |
| Access Restriction | Open |
| Subject Keyword | Journal of Functional Programming |
| Content Type | Text |
| Resource Type | Article |
| Subject | Software |
