3 ms·
> Do you have a concrete example? Off the top of my head, and since we're talking about computation, I'd say SK combinator calculus. Or Church numerals. > Typ
by pron 11y ago
> Do you have a concrete example?
Off the top of my head, and since we're talking about computation, I'd say SK combinator calculus. Or Church numerals.
> Typeful programming
It is, but it can also be a hindrance. Finding the sweet spot is a matter for empirical study.
- catnaroek 11y ago> I'd say SK combinator calculus. Or Church numerals. They're a PITA to use, but not because they're hard to understand.
- AnimalMuppet 11y agoBut for writing actual programs, the complexity of using matters as much as the complexity of understanding. (I recognize that this doesn't invalidate the point you are trying to make in the parent post. They aren't incompatible with human understanding. They're incompatible with writing programs in a reasonable amount of time, though.)