20:22:44bexxyou point me to a better understanding
20:22:58bexxthe trouble was caused because of the first-to-last confusion with rec
20:23:57White_Flameyes, if your entry point to REC is just (REC L), then it's fairly transparent. But if that becomes (fi-la (rec L)), then it's no longer just a pass-through and you should recurse to the inner REC
20:24:21White_Flameso that that outer fi-la call only happens on the "final" return value after the recursion returns
20:27:53lebIs there a classical example of a 2 functional mutually tail recursive function?
20:41:22lebI find that for certain kind of problems it's the only way I can think
20:43:36sjlI find tail recursion useful when working in Common Lisp. I don't tend to find myself wanting it when I work in Golang, but maybe if it were there I might.
21:18:43jasomtail-recursive tree traversal usually just involves a stack of future nodes to visit, I'm not sure what two mutually recursive functions would look like.
21:35:40Inlineprobably two stacks, not shared, or two stacks shared but with stack entry elimination or so
21:37:37Inlineerr 1 stack shared with message passing like transactional balancing say
21:38:41jasomI suppose you could make your stack be function calls...
21:51:59jasomhttps://plaster.tymoon.eu/view/1422#1422 <-- stack with function calls. Feels slightly contrived though.
1:06:03markasoftwarei'm returning the result of a `floor`, but want to discard all but the first of the multiple returned values
7:28:52dtwMorning. Are DEFUN's lambda list's bindings like in LET or LET*? I mean can optional argument's default value form refer to an earlier variable in the lambda list?