Post B68ZeQ5AY5sdLH3iXw by andnull@social.nouveau.community
 (DIR) More posts by andnull@social.nouveau.community
 (DIR) Post #B68YeARiaINAtPvDn6 by neauoire@merveilles.town
       0 likes, 0 repeats
       
       Abstract machines for logic programs, by @chrisamaphone https://chrisistyping.bearblog.dev/abstract-machines-for-logic-programs/
       
 (DIR) Post #B68ZeQ5AY5sdLH3iXw by andnull@social.nouveau.community
       0 likes, 0 repeats
       
       @neauoire @chrisamaphone This reminds me of how Tabby (an old stack rewriting language) behaved (san determinism). Everything was basically a continuation that you could rewrite, and the program halted when there was nothing left on the stack to transform.Been kinda plotting about with similar stuffhttps://www.sheeeeeeeep.art/stack-operations-for-string-rewriting.html