Stem, a stack-based language with metaprogramming and a C FLI

Re:Stem, a stack-based language with metaprogramming and a C... by thesz on Saturday January 27, 2024 @12:28PM (#39157599)

"A stack is certainly the most intuitive data-structure with which to implement a lambda calculus."

This depends on the evaluation order. I think you are talking about call-by-value (eager) or call-by-name orders.

But normal order evaluation with memoization (what human computer would do - write result only once) uses graphs and graph rewriting.

[ Parent | on HN ]

Re:Stem, a stack-based language with metaprogramming and a C... by FwarkALark on Saturday January 27, 2024 @05:38PM (#39160615)

> But normal order evaluation with memoization (what human computer would do - write result only once) uses graphs and graph rewriting.

...which are still most simply implemented with a stack.

[ Parent | on HN ]