User:b_jonas

b_jonas has created the esoteric languages Amycus, Amycus Severus, and Hyperamycus by a single mistake. He has created Olvasható and buubot's compose syntax willingly. He has also created scan and geo, but apologizes for them with the excuse that he was really young back then.

Incomplete list of some interesting or notable esolangs

• the program is a real-world stack of common household objects: efghij.
• themed source code: Chef, Shakespeare, Homespring.
• string replacement languages: Thue, ///, 1.1, Fuun DNA.
• fungelikes, two dimensional matrix of instructions: Befunge, Nopfunge, Conedy.
• Brainfuck with the tape being an infinite binary tree: Treehugger.
• functional: Lambda calculus, Combinatory logic, Pointfree programming, Wikipedia:FP (programming language), Ⅎ.
• a curious case of a language used in production even though it wasn't intended, partly reverse engineered, possibly cursed: BANCStar.
• ICFP contest, open programming contest sponsored by The ACM SIGPLAN International Conference on Functional Programming, held every summer since 1998, often produces esolangs, including Category:ICFP contest and more not documented here yet.
• IOCCC (The International Obfuscated C Code Contest), held irregularly approximately yearly since 1984, sometimes produces esolangs or uses existing esolangs or retrocomputing models, just search wiki for IOCCC.
• bots in the channel interpreted them at some point: Brainfuck, Underload, Burlesque, Integ, Egel, Haskell, J (APL-like), and much more.
• User:ais523's languages:
  • Forte: (you assign to an integer, permanently changing its value
  • Underload: stack of functions, no variables, unlambda if it were stack-based; 7 related
  • Eodermdrome: rewriting unlabeled undirected graphs
  • StackFlow: multiple stacks of symbols but limited control flow
  • My Unreliable Past: minimal likely Turing-complete on an array of addresses
  • Incident: unique hard to program syntax
  • But Is It Art?: jigsaw puzzle solving nondeterministic
  • Countercall: hard to disprove Turing-complete
  • The Waterfall Model: multiple counters but limited control flow
  • Blindfolded Arithmetic: Babbage machine, integer arithmetic on registers but no control flow
  • Nellephant: NL complexity class, this one still haunts me
• other notable creators: Donald Knuth, Raymond Smullyan, Fabrice Bellard, Tom Murphy VII, David Madore, Chris Pressey, David Morgan-Mar.

Todo

• The domain-specific language from ICFP 2009, for space travel orbital mechanics
• Forth-like languages first and third from IOCCC 1992 buzzard.2 http://www.ioccc.org/years.html#1992_buzzard.2
• OpenTTD signals http://wiki.openttd.org/Main_Page
• GCC and GHC from ICFP contest 2014 https://icfpcontest2014.github.io/
• That language that pretends to be a Forth-alike but actually only has a stack of depth 2 so is really an accumulator-based machine.
• Possibly some other computers in http://members.iinet.net.au/~daveb/simplex/ringhome.html
• Browse https://github.com/topics/programming-language
• Write more about Amycus and Amicus.
• Magic-16
• Perhaps buubot's macro language