Are loop constructs possible without using recursion in pure Roy functions? //cc @puffnfresh #recursiondepthexceeded #fpnoob
@tarnacious @puffnfresh they are certainly possible in haskell; I have an example of a pure gcd using a loop in haskell if you're keen.
-
-
@dibblego@puffnfresh Sure. If it's easy to put up a gist or point me to a repo that would be great. -
@tarnacious@puffnfresh https://gist.github.com/3162693 A gcd function in haskell using a while loop (ST). Originally to demo babel-17 reinvented ST. - 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.