Hello! I'm an a esolang designer and enthusiast. I am the author of eleven languages, with a few more ideas floating around in my head.
Languages I've created:
- Z, a tape-based language using the characters "z", "Z", space, and newline.
- InterpretMe, a joke language that can't do anything but interpret itself.
- MiniPig, a tarpit stack language that may or may not be TC.
- ObCode, a language consisting of only parenthesis that isn't Lispy enough.
- Minscode, a (probably Turing-incomplete) language based on a misunderstood notion of Minsky machines.
- Betaload, an extension of Underload that supports input and "environments".
- Minipy, Python with shorter builtins.
- Check, a language which can switch between being 2D and 1D.
- CJam-Flavored Underload, a dialect of Underload that makes it a subset of CJam.
- Foam, a Forth with unreadability - and a huge amount of built-ins - as its goal (it arguably succeeds in the former but fails in the latter)
- Dreaderef, a language that tries to:
- Force you to use self-modification,
- Expose all of the interpreter state as editable data, and
- Not be too hard to program in.
Some of my favorite languages:
I like reflection and self-modification. I like non-triviality, which means I like tarpits.
Here are some random language ideas that I'm thinking about:
- A 2D language where control flow is controlled by the spread of a wildfire, known as Synge.
- A language that allows for the precedence of operators to be modified at runtime, known as New Precedence.
- A language based on nomadic monads (or monadic nomads).
- A language with tree-based memory, known as Link.
- A self-modifying language with tree-based code & memory, known as Zelda.
- A two-dimensional object-oriented language, known as Outclassed.
- A self-modifying language based on repeated application of rewriting rules (passes) that can change at runtime, known as Impasse.
- A golfy dialect of Binary lambda calculus.
- A Lispier dialect of ObCode.
- A language that takes fluent interfaces and the inner-platform effect to its logical conclusion, known as
- A language like Dreaderef, but without self-modification, known as Momema.
- A small experimental language with a Haskell-like type system, except with direct overloading instead of typeclasses, known as Fritz.