Re:Haskell’s State monad is not a monad (2014)
by danidiaz on Monday July 02, 2018 @12:32PM
(#17443081)
Some linear type systems garantee that functions defined in them have polynomial time complexity: http://www.cs.cmu.edu/~fp/courses/15816-s12/misc/hofmann03ic... http://www.kurims.kyoto-u.ac.jp/~terui/lalcjournal.pdf It appears however that the ones developed so far are awkward to "program" in.
[ Parent
| on HN ]
There are no comments on this comment yet.