@mandubian or just use Haskell :-)
-
-
Replying to @yoeight
@yoeight Here we go: a Scala Universal Quantifier for 2 type params structures https://gist.github.com/mandubian/71deee51bc498c384c5e … XD1 reply 3 retweets 1 like -
Replying to @mandubian
@mandubian what about -> type Foo[C[_,_], R] = Forall[({type f[a] = Forall[({ type g[b] = C[a,b] => R})#g]})#f] ?1 reply 0 retweets 0 likes -
Replying to @mandubian
@mandubian I already suggested to go with Haskell :-)1 reply 0 retweets 0 likes -
Replying to @mandubian
@mandubian I don't dislike Scala. I just think my programming style isn't always fit the Scala philosophy. Plus, I don't value JVM that much2 replies 0 retweets 1 like -
Replying to @yoeight
@mandubian Besides, FP in Scala is cumbersome and terribly slow1 reply 0 retweets 1 like -
Replying to @mandubian
@mandubian You say compromise but all I see here is shortcomings. Even the type inferencer doesn't work !2 replies 1 retweet 3 likes
@yoeight @mandubian Yeah Scala is a false economy, not a compromise. Calculating compromise requires certain skills.
-
-
Replying to @dibblego1 reply 0 retweets 1 like
-
Replying to @mandubian
@mandubian@yoeight Hi :) Just heading back to Australia at the moment.1 reply 0 retweets 1 like - Show replies
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.