libera/#lisp - IRC Chatlog
Search
18:59:29
sham1
For example, if one was to make this toy lisp on-top of Javascript instead, one could, in the implementation, `await` a Promise.all call of an array of all the initializing expressions, and then after that execute the body, binding whatever results the async operations provide. I assume Python has the same ability and so a toy lisp on that could do that too
19:49:10
lisbeths
I think that when you write in this prefix notation: define factorial lambda x if eq x 1 1 + 1 factorial - x 1
19:50:09
lisbeths
it 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:51:23
White_Flame
in an interpreter, the "stack" is the nested (get-next-value) calls to consume the next fixed number of input terms
21:21:23
rendar
White_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
21:43:29
White_Flame
rendar: that (+ (get-next-value) ..) was for lisbeths's fpn code, not for your async examples