does not finish...
This is not a bug, type inference determines the result of of n to be void and tail call optimization turns this into an endless loop.
Not sure if we can find a good criterion —like contains no effectful operations— to decide if an endless recursion (or an endless loop) is worth a warning.
Try this
does not finish... This is not a bug, type inference determines the result of of
n
to bevoid
and tail call optimization turns this into an endless loop. Not sure if we can find a good criterion —like contains no effectful operations— to decide if an endless recursion (or an endless loop) is worth a warning.