<div dir="ltr"><div dir="ltr"><div class="gmail_default" style="font-family:"times new roman",serif;font-size:large"><br></div></div><br><div class="gmail_quote"><div dir="ltr" class="gmail_attr">On Tue, Jan 2, 2024 at 3:49 PM Dan Cross <<a href="mailto:crossd@gmail.com">crossd@gmail.com</a>> wrote:<br></div><div dir="ltr" class="gmail_attr"><br></div><blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left:1px solid rgb(204,204,204);padding-left:1ex"><span class="gmail_default" style="font-family:"times new roman",serif;font-size:large"></span>Perhaps the feeling is that that is what FORTH was; for that I<br>
guess I don't see any reason one couldn't transpile to FORTH from some<br>
other language.</blockquote><div><br></div><div class="gmail_default" style="font-family:"times new roman",serif;font-size:large">Henry Baker wrote a beautiful little paper (see <a href="https://www.plover.com/~mjd/misc/hbaker-archive/ForthStack.html">https://www.plover.com/~mjd/misc/hbaker-archive/ForthStack.html</a>>) showing the mapping between Linear Lisp (a Lisp in which all variables are referenced once and only once) and a Forth-style "frameless stack".  There is also a discussion of Forth as a set of linear combinators: Manfred von Thun's Joy <<a href="https://en.wikipedia.org/wiki/Joy_(programming_language)">https://en.wikipedia.org/wiki/Joy_(programming_language)</a>> is a Forth-like using nested lists in which the stack is the top-level list.</div><blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left:1px solid rgb(204,204,204);padding-left:1ex"> <br></blockquote></div></div>