2025-12-11 00:06:00 !uptim 2025-12-11 00:06:05 !uptime 2025-12-11 00:06:05 231h 6min 35s 2025-12-11 00:07:44 !listcmd uptime 2025-12-11 00:07:44 Commande !uptime : !eval (pu) 2025-12-11 00:08:12 !listfunc pu 2025-12-11 00:08:12 (DEFUN PU () 2025-12-11 00:08:13 (FORMAT NIL "~dh ~dmin ~ds" H M S))) 2025-12-11 03:00:03 this is forth? it seems lisp 2025-12-11 12:44:03 No, that's not Forth. From time to time we do talk about Lisp here. 2025-12-11 12:45:35 When it happens to be related to the internal implementation of Lisp I find it pretty interesting - I've come to think that basic, non-optimized Lisp can be implemented in a similarly simple way to Forth. Maybe not quite AS simple, but not too bad. 2025-12-11 17:22:44 forthBot: LOAD ini.fth 2025-12-11 17:22:44 File ini.fth with MOON loaded 2025-12-11 17:22:50 forthBot: MOON 2025-12-11 17:22:50 Phase de la lune pour Thu December 11 2025 2025-12-11 17:22:50 🌖 Gibbeuse decroissante La lune decroit, une nuit douce vous attend ! Illumination 52% 2025-12-11 19:22:50 Environment for cleobuline inactive, freeing... 2025-12-11 21:26:15 <[[smlckz]] > The hardest part of a simple Lisp implementation is eval. I'll say lisps (and underlying lambda calculus) are conceptually simpler to implement than Forth. It was quite difficult for me to make sense of DOES>.. but ultimately, I'd put it this way: Lisps and Forths are duals of each other (in some vaguely yin-yang sense). Each language provides the 2025-12-11 21:26:16 <[[smlckz]] > next most natural implementation of the other, apart from the the one in itself. 2025-12-11 23:35:36 [[smlckz]]: is not that difficult https://t3x.org/zsp/index.html 2025-12-11 23:36:15 the zenlisp compiler basically bootstraps a huge chunk on itself 2025-12-11 23:36:22 s,compiler,interpreter 2025-12-11 23:39:38 and this example on forth it's pretty much the ur-exaple, from the VM to the interpreter https://github.com/jserv/subleq 2025-12-11 23:39:44 the manual covers evertyhing 2025-12-11 23:39:54 from primitives to words