I just thought that was an especially amusing link joke this whole post is fascinating actually https://ocharles.org.uk/blog/guest-posts/2014-12-18-rank-n-types.html …
-
-
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Even for a -> a, you can have (\x -> (\y . y) x) which does not reduce without eta reduction which isn't necessarily admissible
-
In haskell, you have the monomorphism restriction which implies an eta reduced term has different semantics at the top level
End of conversation
New conversation -
-
-
note the last sentence is false: for a -> a -> a you have at least two possible implementations.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.