@jordwalke @wycats @missingfaktor @skylight Yes, that problem was solved in the 1970s by ML.
@jonharrop @jordwalke @missingfaktor Are you suggesting that the scope in which the algorithm is applied means it isn't the same algorithm?
-
-
@wycats@jordwalke@missingfaktor So I'm guessing it isn't the same algorithm. -
@jonharrop@jordwalke@missingfaktor It's not *precisely* algorithm W because it's not *precisely* 1970 anymore. -
@wycats@jordwalke@missingfaktor Sure but making "let swap(a,b) = (b,a)" require several times more code is quite a big difference. -
@jonharrop@jordwalke@missingfaktor That example is old. You can do it in a single line for a while now. http://is.gd/8ndQj0 -
@wycats@jonharrop@missingfaktor which single line in that example? -
@jordwalke@jonharrop@missingfaktor There were two annoyances in the original example: typing the function and the contents of the function
End of conversation
New conversation -
-
-
@wycats@jordwalke@missingfaktor If you only apply it locally I'm not sure you need non-generalized type variables. -
@jonharrop@jordwalke@missingfaktor You can take a big program and put it into a single 'main()' and use closures for all functions. -
@wycats@jordwalke@missingfaktor Can you write a recursive factorial function inside main without having to annotate types?
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.