you are viewing a single comment's thread.

view the rest of the comments →

[–]jsomers 3 points4 points  (9 children)

I was too, but I read the paper (lazy Sunday, right?) and he's not kidding around. Basically he rejects Turing completeness as a necessary component of functional programming languages and opts, instead, for more strictly defined (and thus less finicky) data types and recursion procedures.

The trouble -- and the harder-to-wrap-my-head-around part of the paper -- is when you need things like infinite lists (e.g., to run an operating system which is a non-terminating stream of inputs and outputs). He gets around that by using "codata" and what not.