"in fact, we can't tell *anything* about 'foobar :: [a] -> [a]' without a name" displays a serious lack of knowledge of parametricity
-
-
Replying to @jedws
lol I missed that bit. Pretty sure I have given a talk, where I did in fact, tell a thing about that type without a name.
1 reply 0 retweets 1 like -
Replying to @dibblego
his take on static typing https://www.youtube.com/watch?v=2V1FtfBDsLU&feature=youtu.be&t=66m5s …
2 replies 0 retweets 1 like -
why, why are you watching?
1 reply 0 retweets 0 likes -
-
I am now scared.
1 reply 0 retweets 0 likes -
-
I think we have all known each other for long eough to know I'm going to be the eternal noob
1 reply 0 retweets 0 likes -
Replying to @jonoabroad @jedws
You've only gotta have a better understanding of the world than the other guy. Here is the other guy: https://www.youtube.com/watch?v=2V1FtfBDsLU&feature=youtu.be&t=66m5s …
1 reply 0 retweets 1 like -
At least he knows how to write 1000s of functions with type [a] -> [a]
1 reply 0 retweets 2 likes
:) But only one f satisfying: ∀ x. f [x]=[x] ∀ x y. f(x ++ y) = (f y ++ f x) [and all satisfy: all elements in result are in the input].
-
-
isn't that first one `f f [x]`?
2 replies 0 retweets 0 likes -
I don't know what you are asking.
0 replies 0 retweets 0 likes
End of conversation
New conversation -
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.