Simon Forman 4ea1a5527e nullary combinator as definition. ... That eliminates all the recursive calls to thun/3 (outside of thun itself, which is tail recursive.) That means that this Joy interpreter is now fully CPS. All state is contained in the stack and expression, nothing is hidden in the Prolog "call stack".		2019-07-15 11:20:13 -07:00
..
compiler.pl	Some docs, and a thing to print out the dictionary after compilation.	2019-05-03 15:21:06 -07:00
metalogical.pl	See https://www.metalevel.at/acomip/	2019-05-06 12:47:30 -07:00
thun.pl	nullary combinator as definition.	2019-07-15 11:20:13 -07:00