Lamedh, after the Hebrew letter which is cognate with the Greek lambda, is the name under which my most recent thoughts about Lisp-like programming languages are brewing.

Essentially, I’d like a language like Julia that has Lispier syntax (not necessarily one that looks like a traditional Lisp, but I’m undecided on this point), precise arithmetic by default, and a perhaps mechanism for emergent typing. And probably 0-indexed arrays.

One of my key insights so far is the applicability of DFA-based regular expression matching to implementing multiple-dispatch procedure calls, and the use of type inference over a dynamically-typed program as an optimization of this.