> All primitives are denoted by single symbols<p>Take an axe to the troubleshoot-ability of your language with this one weird trick that makes it impossible to google.
Stevan Apter is awesome, I love "No Stinking Loops."
His episode of the ArrayCast is great.<p><a href="https://www.arraycast.com/episodes/episode26-stevan-apter" rel="nofollow">https://www.arraycast.com/episodes/episode26-stevan-apter</a>
> In F, everything is a function from triples of (environment;stack;queue) to triples of (environment;stack;queue).<p>I dabble with compiler-writing, and one of the techniques there is to program an abstract machine. It fills a nice niche - it's a bit more concrete than hacking together an interpreter over your AST, and a lot less concrete than writing out LLVM instructions.<p>Some examples are Krivine machines and SECD machines (which stands for Stack, Environment, Control, Dump).<p>They let you play around with ideas before you commit to a particular semantics of your language, for instance, whether you'll pass by value or reference, via the stack, or via the heap.<p>But exposing (e;s;q) directly to the programmer is a fascinating idea! If I'm thinking about it right, it means a programmer could write code to take a parameter which was passed in via the stack, and decide "No I think this should be on the heap instead" and then update all pointers in the program accordingly.
Also interesting: <a href="https://www.uiua.org/" rel="nofollow">https://www.uiua.org/</a><p>Concateniative APL-like (with Unicode symbols but with pragmatic input method)
In the "simple and interesting language" front we also recently got a post about Forsp, a hybrid between a lisp and Forth: <a href="https://github.com/xorvoid/forsp">https://github.com/xorvoid/forsp</a><p>What is the simplest most interesting language?