Hi Christopher,
Congratulations on the new baby. You'll have lots of late nights to code
now...or maybe not.
This may give some added insight into what you are trying to accomplish...
https://rosettacode.org/wiki/Jump_anywhere#PicoLisp
The code example there was worth some time to study for me,
Hi, sorry about the delayed response — just had a new baby and have been
in the hospital for a few days.
What I am trying to accomplish is be able to represent algorithms in a
recursive format (which is often what comes naturally to me and seems
cleaner and easier to understand) without the stack
Hi Christopher,
thanks for sharing these ideas!
However I'm a bit clueless about what you want to achieve.
> Hi, I while ago I asked how I might somehow represent a loop as a a tail
> call recursion, so as to give me the pattern I like without the call
> penalties.
Isn't it a lot easier to
Hi, I while ago I asked how I might somehow represent a loop as a a tail
call recursion, so as to give me the pattern I like without the call
penalties. Since nothing was forthcoming, I took a stab at it myself.
Probably my noobish attempt will be ugly to you veterans, but I was
hoping if I posted
