Is recursion encouraged in Roc like it is in other functional languages? I didn't see mention of it in the tutorial or docs.
How's the performance in Roc compared to iterators like List.walk? And do I need to worry about stack overflow?
If you write tail recursive functions, recursion is high performance in roc.
Also, we have slices, so recursively looping over a list and consuming the first few characters for parsing should be fast.
No copying or data shifting should happen
Awesome, thanks for the answer
Ryan Bates has marked this topic as resolved.
Last updated: Jul 06 2025 at 12:14 UTC