3 ms·

That's yuuuuuge, try sectorlisp instead https://github.com/jart/sectorlisp https://github.com/jart/sectorlisp

• nils-m-holm 4y ago
  I appreciate SectorLISP, but it is in a completely different ballpark. Last time I checked (and this is a while ago), it was dynamically scoped and not tail-recursive, i.e. programs will overflow the stack when running long enough. See this discussion on Reddit for details: https://old.reddit.com/r/lisp/comments/rkxh3v/lisp_with_gc_in_436_bytes/hpo00bq/?context=3 https://old.reddit.com/r/lisp/comments/rkxh3v/lisp_with_gc_i... Unfortunately the discussion ended suddenly back then. The long story is: you cannot have tail recursion and dynamic scoping without running into all kinds of funny issues related to the upward and downward FUNARG problem. This is discussed in detail in my book, LISP From Nothing (http://t3x.org/lfn/ http://t3x.org/lfn/) Without tail recursion in the core of the implementation (in the case of SectorLISP in the assembly language part), you cannot have it in the high-level part (LISP in LISP), either, because the interpreter interpreting the LISP in LISP will eventually overflow the stack. KiloLISP is lexically scoped and tail-recursive.
  • guerrilla 4y ago
    Obviously...