3 ms·
Oh don't worry, you can make a Y combinator in a typed lambda calculus too, it's just a little more involved: http://en.wikipedia.org/wiki/Fixed-point_combinato
by colanderman 13y ago
Oh don't worry, you can make a Y combinator in a typed lambda calculus too, it's just a little more involved: http://en.wikipedia.org/wiki/Fixed-point_combinator#Type_for_the_Y_combinator http://en.wikipedia.org/wiki/Fixed-point_combinator#Type_for...
- tel 13y agoDepends on the type theory. You need recursive types. Or you can just posit fix.