personally, I find recursion easier than iteration, except in the most trivial (e.g. counted) cases. Mutable state. Ugh.
-
-
-
Indeed. Did you ever look at F*, by the way? Effect system allows tracking which functions are pure.
-
there's some fascinating diversity in micro architectures and ISAs in the stuff that's rarely publicly documented.
-
I just wonder how many of those end up being exploitable...
End of conversation
New conversation -
-
-
so your intern will be unemployable everywhere else, but you have no intention to let him go anywhere, anyway. ;-)
-
He's a talented musician. :)
End of conversation
New conversation -
-
-
Show him the Haskell Typeclassopedia, it'll change his mind :)
-
We didn't do typeclasses yet. :)
End of conversation
New conversation -
-
-
I think understand recursion is easy compared to applying it or maybe I have not understood recursion well.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
next, recursive pattern matching


Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Did you tell him "The first step to learning recursion f(a) is to learn recursion f(a-1)?" There is no f(0)....
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
I felt the same, maxbe just b/c I learned about recursion first?
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.