On the Number of Lambda Terms With Prescribed Size of Their De Bruijn Representation

John Tromp introduced the so-called ’binary lambda calculus’ as a way to encode lambda terms in terms of 0−1-strings. Later, Grygiel and Lescanne conjectured that the number of binary lambda terms with m free indices and of size n (encoded as binary words of length n) is o n−3/2 τ−n

• Type: Journal
• Year: 2016
• Where: STACS
• Authors: Bernhard Gittenberger, Zbigniew Golebiewski
• Keywords: STACS 2016, Theoretical Computer Science