Counting 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 functions, especially that the number of terms of size n grows roughly like 1.963447954n.
منابع مشابه
Counting and Generating Terms in the Binary Lambda Calculus (Extended version)
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 . . .. In a se...
متن کاملA Natural Counting of Lambda Terms
We study the sequences of numbers corresponding to lambda terms of given sizes, where the size is this of lambda terms with de Bruijn indices in a very natural model where all the operators have size 1. For plain lambda terms, the sequence corresponds to two families of binary trees for which we exhibit bijections. We study also the distribution of normal forms, head normal forms and strongly n...
متن کاملCounting isomorphism classes of $\beta$-normal linear lambda terms
Unanticipated connections between different fragments of lambda calculus and different families of embedded graphs (a.k.a. “maps”) motivate the problem of enumerating β-normal linear lambda terms. In this brief note, it is shown (by appeal to a theorem of Arquès and Beraud) that the sequence counting isomorphism classes of β-normal linear lambda terms up to free exchange of adjacent lambda abst...
متن کاملInhabitation in Simply-Typed Lambda-Calculus through a Lambda-Calculus for Proof Search
A new, comprehensive approach to inhabitation problems in simply-typed lambda-calculus is shown, dealing with both decision and counting problems. This approach works by exploiting a representation of the search space generated by a given inhabitation problem, which is in terms of a lambda-calculus for proof search that the authors developed recently. The representation may be seen as extending...
متن کاملOn k-colored Lambda Terms and Their Skeletons
The paper describes an application of logic programming to the modeling of difficult combinatorial properties of lambda terms, with focus on the class of simply typed terms. Lambda terms in de Bruijn notation are Motzkin trees (also called binary-unary trees) with indices at their leaves counting up on the path to the root the steps to their lambda binder. As a generalization of affine lambda t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1401.0379 شماره
صفحات -
تاریخ انتشار 2014