News for hackers. Stuff that matters.
Re:Rob Pike: Simplicity Is Complicated [video] by pron on Thursday December 03, 2015 @07:39AM (#10669241)
> 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.

Re:Rob Pike: Simplicity Is Complicated [video] by catnaroek on Thursday December 03, 2015 @07:52AM (#10669281)
> I'd say SK combinator calculus. Or Church numerals.

They're a PITA to use, but not because they're hard to understand.

Re:Rob Pike: Simplicity Is Complicated [video] by AnimalMuppet on Thursday December 03, 2015 @01:00PM (#10671248)
But 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.)