I’m looking to add easy toy languages to my language workbench’s example set and on the wikipedia page for m-expressions (horrid things, but I’ll probably write a parser for them) I found “sweet” t-expressions from the 2013 Readable Lisp S-expressions Project and uhhhh https://readable.sourceforge.io/ of course they keep citing Paul Graham in this and their SRFI https://srfi.schemers.org/srfi-110/srfi-110.html the curly bracket infix notation is ok! the rest really hasn’t aged well here’s the example from their site showing the uhh improvements? and then it goes off the rails when the SRFI introduces the sublist operator and it becomes the parts of Haskell I struggle to understand at first glance