This site is supported by donations to The OEIS Foundation.



Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 4500 articles have referenced us, often saying "we would not have discovered this result without the OEIS".

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A220471 Number of closed simply typable lambda-terms of size n with size 0 for the variables. 0
1, 2, 9, 40, 238, 1564, 11807, 98529, 904318, 9006364 (list; graph; refs; listen; history; text; internal format)



Typable terms are terms that satisfy constraints which make them well formed.

The current computation requires one to generate all the plain lambda terms and to sieve out those that are typable.  This is feasible for the 63782411 terms of size 10 but not for the 851368766 terms of size 11.


Alonzo Church, A Formulation of the Simple Theory of Types, J. Symb. Log. 5(2): 56-68 (1940).

Paul Tarau, On logic programming representations of lambda terms: de Bruijn indices, compression, type inference, combinatorial generation, normalization, 2015; http://www.cse.unt.edu/~tarau/research/2015/dbx.pdf


Table of n, a(n) for n=1..10.

Katarzyna Grygiel and Pierre Lescanne, Counting and generating lambda-terms, arXiv preprint arXiv:1210.2610, 2012

Paul Tarau, On a Uniform Representation for Combinators, Arithmetic, Lambda Terms and Types, preprint, 2015.

Paul Tarau, On Type-directed Generation of Lambda Terms, preprint, 2015.


Cf. A220894.

Sequence in context: A261047 A052846 A056844 * A213095 A238372 A002825

Adjacent sequences:  A220468 A220469 A220470 * A220472 A220473 A220474




Pierre Lescanne, Apr 10 2013



Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified December 1 23:45 EST 2015. Contains 264709 sequences.