19:49:10lisbethsI think that when you write in this prefix notation: define factorial lambda x if eq x 1 1 + 1 factorial - x 1
19:49:30lisbethsthat there is still something similar to a stack going on behind the scenes
19:50:09lisbethsit is just with reverse polish notation that you handle the stack manually instead if allowing the language to parse the abstract syntax tree for you
19:50:33lisbethsin reverse polish notation a stack is really just a replacement for an ast
19:51:23White_Flamein an interpreter, the "stack" is the nested (get-next-value) calls to consume the next fixed number of input terms
21:21:23rendarWhite_Flame, well, i have to save that '+' when i try to get results of get-next-value, calling eval and/or apply recursively, basically is just a stack