I was wondering if factor supports indirect recursion or not. And if it's possible to write indirectly recursive functions, how?
I tried this code: : even ( n -- is-even? ) dup 0 = [ drop t ] [ 1 - odd ] if ; : odd ( n -- is-odd? ) dup 0 = [ drop f ] [ 1 - even ] if ; But this didn't work this way.
_______________________________________________ Factor-talk mailing list Factor-talk@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/factor-talk
