You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
currently when we write a recursive function that uses a match%b expression to pattern-match on bytestrings, we end up creating a stack, instead of tail-recursing.
My gut tells me this is the try-catches we have, and we may want to move to a result-based error-recovery pattern.
For example, i'd expect this function to be tail recursive, but it isn't:
currently when we write a recursive function that uses a
match%b
expression to pattern-match on bytestrings, we end up creating a stack, instead of tail-recursing.My gut tells me this is the try-catches we have, and we may want to move to a result-based error-recovery pattern.
For example, i'd expect this function to be tail recursive, but it isn't:
The text was updated successfully, but these errors were encountered: