News for hackers. Stuff that matters.

A comment on Show HN: Making a Compiler to Prove Tmux Is Turing Complete. Parent comment

Re:Show HN: Making a Compiler to Prove Tmux Is Turing Complete by zarathustreal on Sunday March 17, 2024 @02:27PM (#39736699)
Implied by “loops” but wanted to also point out self-referential definitions / recursion
[ Parent | on HN ]
Re:Show HN: Making a Compiler to Prove Tmux Is Turing Complete by Brananarchy on Sunday March 17, 2024 @09:16PM (#39739627)
Yup. At a previous employer we had a "loop until [list] is empty" in our interpreter. This list would be appended to by any recursion in the interpreted language (effectively saying "this recursion also needs to be processed")

We joked that it was our very own proof that recursion and iteration are equivalent

[ Parent | on HN ]
Re:Show HN: Making a Compiler to Prove Tmux Is Turing Complete by nmz on Sunday March 17, 2024 @10:37PM (#39740065)
Isn't that what ATS is all about?
[ Parent | on HN ]