Tag Archives: lambda

Counting linear lambda terms: choice and correspondence

In my last post, I showed how to write down polymorphic types with numbers of linear inhabitants given by products of factorials and Mersenne numbers, but left open the question of types with five linear inhabitants in particular, and whether … Continue reading

Posted in combinatorics | Tagged , , , , | 1 Comment

Counting linear lambda terms

Just a little something with which I’ve been idly occupying spare brain cycles lately… read on for an interesting puzzle. Warm up: counting lambda terms Consider a stripped-down version of Haskell’s type system with only natural numbers, polymorphism, functions, and … Continue reading

Posted in combinatorics | Tagged , , , , , | 10 Comments