Add to ORKGInternational audienceIn 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
This paper introduces a sequence of lambda-expressions, modelling the binaryexpansion of integers. W...
International audienceWe present several results on counting untyped lambda terms, i.e., on telling ...
Many classes of linear and cyclic binary strings are counted using a particularly elementary countin...
In a paper entitled Binary lambda calculus and combinatory logic, John Tromp presents a simple way o...
Abstract. In a paper entitled Binary lambda calculus and combinatory logic, John Tromp presents a si...
International audienceIn a paper entitled Binary lambda calculus and combinatory logic, John Tromp p...
International audienceLambda calculus is the basis of functional programming and higher order proof ...
John Tromp introduced the so-called \u27binary lambda calculus\u27 as a way to encode lambda terms i...
We investigate the asymptotic number of elements of size n in a particular class of closed lambda-te...
We study the sequences of numbers corresponding to lambda terms of given sizes, where the size is th...
In the first part, we introduce binary representations of both lambda calculus and combinatory logic...
In the first part, we introduce binary representations of both lambda calculus and combinatory logic...
This paper introduces a sequence of lambda-expressions modelling the binary expansion of integers. W...
We introduce binary representations of both lambda calculus and combinatory logic terms, and demonst...
We consider combinatorial aspects of $\lambda$-terms in the model based on de Bruijn indices where e...
This paper introduces a sequence of lambda-expressions, modelling the binaryexpansion of integers. W...
International audienceWe present several results on counting untyped lambda terms, i.e., on telling ...
Many classes of linear and cyclic binary strings are counted using a particularly elementary countin...
In a paper entitled Binary lambda calculus and combinatory logic, John Tromp presents a simple way o...
Abstract. In a paper entitled Binary lambda calculus and combinatory logic, John Tromp presents a si...
International audienceIn a paper entitled Binary lambda calculus and combinatory logic, John Tromp p...
International audienceLambda calculus is the basis of functional programming and higher order proof ...
John Tromp introduced the so-called \u27binary lambda calculus\u27 as a way to encode lambda terms i...
We investigate the asymptotic number of elements of size n in a particular class of closed lambda-te...
We study the sequences of numbers corresponding to lambda terms of given sizes, where the size is th...
In the first part, we introduce binary representations of both lambda calculus and combinatory logic...
In the first part, we introduce binary representations of both lambda calculus and combinatory logic...
This paper introduces a sequence of lambda-expressions modelling the binary expansion of integers. W...
We introduce binary representations of both lambda calculus and combinatory logic terms, and demonst...
We consider combinatorial aspects of $\lambda$-terms in the model based on de Bruijn indices where e...
This paper introduces a sequence of lambda-expressions, modelling the binaryexpansion of integers. W...
International audienceWe present several results on counting untyped lambda terms, i.e., on telling ...
Many classes of linear and cyclic binary strings are counted using a particularly elementary countin...