We are currently working on new rules for what content should and shouldn't be allowed on this website, and are looking for feedback! See Esolang:2026 topicality proposal to view and give feedback on the current draft.

New pages

Jump to navigation Jump to search
New pages
Hide registered users | Hide bots | Show redirects
(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)

31 July 2026

  • 02:4502:45, 31 July 2026 Slantfuck (hist | edit) [1,121 bytes] Cordership (talk | contribs) (Created page with "Slant is an esoteric programming language made by User:Cordership that is equivalent to Brainfuck. It consists of slants and underscores. ==Syntax== {|class="wikitable" ! Command !! Brainfuck equivalent |- | /// || > |- | \\\ || < |- | \_/ || + |- | /_\ || - |- | \/\ || . |- | _/_ || , |- | \_\ || [ |- | //_ || ] |} ==Examples:== === Looping counter === /// /// \_/ \_/ \_/ \_/ \_/ \_/ \_/ \_/ \_/ \_/ \_\ \_\ /_\ /// \_/ \\\ \\\ \_/ \_/ \_/ \_/ /// //_ \\\ \_/ \_...") originally created as "Slant"
  • 01:3601:36, 31 July 2026 RegLike (hist | edit) [2,477 bytes] HadiMakesCodes (talk | contribs) (Created page with "Reglike Reglike is a programming language with 5 commands made by ~~~ and inspired by Subleq, Addleq, Muxleq and <span style="color:purple;">Marvin Minsky's Machine</span> 128px|thumb|alt=reglike|Reglike {| class="wikitable" |+ Commands |- ! Command !! Purpose |- | (reg) (line) || If not zero ,decrease (reg) val by -1, else jump to (line) |- | (reg) || Increase (reg) value by 1 |- | (reg)=(val) || Defines The register id to a value |-...")

30 July 2026

  • 22:3322:33, 30 July 2026 Digital Epigraphy (hist | edit) [45 bytes] ZekiYahya (talk | contribs) (Created page with "'''Digital Epigraphy''' (also referred to as '''SUX Markup''') is a conceptual esoteric markup language created in 2026 by filmmaker and creative director Zeki Yahya. Operating at the intersection of media archaeology and web architecture, it replaces standard HTML5 DOM nodes with extinct Sumerian cuneiform (ISO 639-3 sux). The language is not designed for functional computation, but rather as an act of algorithmic resistance against surveillance capitalism. By embeddi...")
  • 15:4515:45, 30 July 2026 Deadfish~/JavaScript interpreter (hist | edit) [1,980 bytes] None1 (talk | contribs) (Created page with "{{Back|Deadfish~}} The following is an implementation of the Deadfish~ esolang in JavaScript. It doesn't use recursion, so don't worry about stack overflow errors. <pre> function deadfisht(program,input){ var x=0; var output=''; var bracket_stack=[]; var loop_stack=[]; var matches={}; for(var i=0;i<program.length;i++){ if(program[i]=='('||program[i]=='{'){ bracket_stack.push(i); } if(program[i]==')'||program...")
  • 14:3314:33, 30 July 2026 Rotory phone (hist | edit) [1,807 bytes] Pineapple (talk | contribs) (Created page with "'''Rotory phone''' is a ''brainfuck based'' esoteric programming language created by User:Pineapple. It replaces brainfuck's memory navigation and arithmetic operators with phone-themed commands, and includes a modifier command to change the addition and subtraction step size. == Overview == Rotory phone operates on a tape of memory cells with a pointer. By default, the <tt>Dial</tt> and <tt>Ring</tt> commands increment and decrement the active cell by 1. Using the <t...")
  • 14:3214:32, 30 July 2026 Mathmatician (hist | edit) [1,840 bytes] Pineapple (talk | contribs) (Created page with "'''Mathmatician''' is a ''brainfuck based'' esoteric programming language created by User:Pineapple. It uses math symbols for navigation and I/O, and features a dynamic modifier that lets numbers dictate how much the addition and subtraction operators change a cell's value. == Overview == Mathmatician operates on a tape of memory cells with a pointer. Prefixing a <tt>+</tt> or <tt>-</tt> command with a number sets the amount added or subtracted. Numbers that are not f...")
  • 14:3014:30, 30 July 2026 Sleepy (hist | edit) [2,073 bytes] Pineapple (talk | contribs) (Created page with "'''Sleepy''' is a ''brainfuck based'' esoteric programming language created by User:Pineapple. It replaces brainfuck's standard single-character commands with varying counts of the letter "z", while adding a custom increment modifier. == Overview == Sleepy operates on a tape of memory cells with a cell pointer, similar to brainfuck. By default, the increment command adds 1 to the current cell, but this step size can be modified using the custom input command <tt>zzzzz</...")
  • 14:2814:28, 30 July 2026 AggressionAplo (hist | edit) [2,656 bytes] Swan (talk | contribs) (Created page with "{{Language |name = AggressionAplo |author = Swam |created = 2026 |paradigms = Imperative, Esoteric |computational_completeness = Turing complete |file_extension = .aplo }} '''AggressionAplo''' (also known as ''AggroAplo'') is an aggressive, imperative esoteric programming language designed to replace standard control flow keywords and statements with highly explicit, aggressive phrases. == Overview == AggressionAplo uses a simple imperative structure supp...")
  • 14:2714:27, 30 July 2026 Cave (hist | edit) [1,883 bytes] Pineapple (talk | contribs) (Created page with "'''Cave''' is a stack-based ''esoteric programming language'' created by User:Pineapple. Memory is managed via a stack where variables are named after ores, and their values represent the weight of that ore in pounds. == Overview == Programs simulate exploring a cave system. Values (ores) are pushed onto and popped off of a central stack. All code must begin with <tt>Enter the cave</tt> and end with <tt>Leave the cave</tt>. == Commands == {| class="wikitable" ! Comma...")
  • 14:2614:26, 30 July 2026 Guitar (hist | edit) [2,355 bytes] Pineapple (talk | contribs) (Created page with "'''Guitar''' is a tape-based ''esoteric programming language'' created by User:Pineapple. It uses a memory grid modeled after a guitar neck with 20 frets and 6 strings. == Overview == Memory consists of 20 frets, each containing 6 strings (memory cells), totaling 120 cells. Programs begin execution at string 1 on fret 1. Cells do not wrap around if you try to move past the boundaries of the frets or strings. By default, strumming adds a value of 1 to the current cell,...")
  • 14:2214:22, 30 July 2026 3x3x3 (hist | edit) [1,298 bytes] Pineapple (talk | contribs) (Created page with "'''3x3x3''' is a 3D grid-based ''esoteric programming language'' created by Pineapple (me). It features a memory layout consisting of a 3x3x3 cube, 27 memory cells in total. == Overview == Memory is arranged in three layers, with layer 1 at the bottom and layer 3 at the top. Each cell is referenced by a coordinate system consisting of a row, column, and layer. Commands are written as 4-digit numbers: VRCL * '''V''': The value being added (1–9). * '''R''': The target...")
  • 05:0305:03, 30 July 2026 BoxedLang-REPACKED (hist | edit) [0 bytes] Mc20000 (talk | contribs) (Created blank page)
  • 02:4202:42, 30 July 2026 ASCIIgibberish (hist | edit) [2,364 bytes] Cordership (talk | contribs) (Created page with "ASCIIgibberish is an esoteric programming language by User:Cordership that uses ASCII characters, except the operations can’t have letters except in the inputs. ==Syntax== {|class=wikitable ! Operation !! Meaning |- | /a+b\ || Adds two numbers, a and b |- | /a-b\ || Subtracts b from a |- | /a*b\ || Multiplies two numbers, a and b |- | /a/b\ || Divides a by b |- | /a_-b\ || Outputs mod(a,b) |- | /a^b\ || Exponentiation |- | /\##{(Hello, world!)} || Prints “Hello,...")

29 July 2026

  • 16:0616:06, 29 July 2026 Class (hist | edit) [748 bytes] Timm (talk | contribs) (Created page with "'''Class is a "semi-esolang"'''<br> '''Add:''' '''crc.var.int.a.set.5 /$this is one-line comment''' '''crc.var.int.b.set.2''' '''crc.var.int.result.set.(cnc.math.add.a.b)''' '''crc.io.var.say.result /$returns 7''' '''also, it uses <code>crc.goto.<nowiki><label></nowiki></code> and <code>crc.if.<nowiki><var></nowiki>.<nowiki><gt/eq/lt></nowiki>.<nowiki><value></nowiki>.goto.<nowiki><label></nowiki></code>''' '''the Tree (not completed)''' crc: var: (int/str/bo...")
  • 13:5913:59, 29 July 2026 Simpl (hist | edit) [6,563 bytes] Cordership (talk | contribs) (A new esoteric programming language)
  • 11:5711:57, 29 July 2026 Tetryx (hist | edit) [782 bytes] TheYoungProgrammer (talk | contribs) (Created page with "== Tetryx :) == === What? === Tetryx is an esolang I created. nothing more, I swear. === Who? === Me. a damn 13 yo boy that probably has some mental illnes and a freaking low-level code passion. === Where? === Italy, Genoa. I love my place, you should visit here. I coded the first protype compiler (TTRX vA.1.5) in a couple days. I'm not kidding. === How? === Coding Tetryx is EASY. the base structure is literally composed by four integers. It's like this: 0 0 0 0 yo...")
  • 09:4909:49, 29 July 2026 BrainASM (hist | edit) [4,003 bytes] Mishyakovskiy (talk | contribs) (Created page with ":''Not to be confused with Brainasm'' {{infobox proglang |name=BrainASM(BASM) |author=User:Mishyakovskiy |year=2026 |image=File:Hello_world_brainasm.jpg |refimpl=Brainfuck |influence=Brainfuck, Assembler }} '''BrainASM''' is an esoteric interpreted language, written in Lua and created by Mishyakovskiy ==Language overview== The language contains 10 cells, controlled by pointer(1-10). It moves bet...")
  • 07:2807:28, 29 July 2026 155 bytes :D (hist | edit) [1,140 bytes] Xyzzy (talk | contribs) (Created page with "'''155 bytes :D''' is is an esoteric programming language designed when User:Xyzzy tried to prove repeated f-string formatting codes Turing-Complete. He has not succeeded in achieving said goal. The language is, in fact, Turing-Complete. The exact mechanics of how this language works is left as an exercise to the reader. ==Examples== 4-state Busy beaver 0ab 1ac _ad 0bb0 abe bbf cbg dbh 1bc0 _bd0 #bq0 0cb1 1cc1 aci bcj cck dcl _cd1 #cq1 0db_ 1dc_ _dd_ adm bdn cdo d...")

28 July 2026

27 July 2026

  • 15:3515:35, 27 July 2026 Littleman (hist | edit) [8,291 bytes] B jonas (talk | contribs) (Created page with "{{Distinguish/For the |educational machine|Little Man Computer}} '''Littleman''' is an esoteric programming language defined for the ICFP contest 2026. The contestants have to write programs in this language. The code of a Littleman program is a two-dimensional array of ASCII characters, similar to Fungoids. Instruction pointers, called little men, run on this two-dimensional code space. Each little man also has a direction that is one of the four cardinal direction...")
  • 14:3014:30, 27 July 2026 Little Man Computer (hist | edit) [1,838 bytes] B jonas (talk | contribs) (Created page with "{{Distinguish/For the |the language defined for ICFP contest 2026| Littleman }} Little Man Computer is a non-esoteric educational programming language that works similar to a simple 80s practical CPU. The computer has an accumulator and a random accessible read-write memory of 100 cells, each cell and the accumulator storing a signed number of 3 decimal digits. Instructions are stored in the RAM. Instructions are encoded as an address in the two lower digits and an...")
  • 10:3410:34, 27 July 2026 Trigbf/improved (hist | edit) [1,800 bytes] None1 (talk | contribs) (Created page with "'''Trigbf improved''' is an esolang invented by User:None1 based on Trigbf7. It's basically the same as Trigbf7, except for one small change. ==Difference from Trigbf== * {{cd|[''CODE'']}}: Executes ''CODE'' if current cell is ''positive''. This makes the esolang capable of running different branches of code according to different cell values. ===Interpreters=== In Python, requires the [https://pypi.org/project/mpmath mpmath] library: <pre> import sys from mp...")
  • 10:1710:17, 27 July 2026 Trigbf/Constants (hist | edit) [2,616 bytes] None1 (talk | contribs) (Created page with "The following are the shortest Trigbf programs (without the "." at the end) that print standard ASCII characters. Found by the code generator mentioned in the Trigbf page. <pre> ASCII character code 0 ␀ 1 ␁ c 2 ␂ ct 3 ␃ cststt 4 ␄ cssttt 5 ␅ cccsttt 6 ␆ cstststt 7 ␇ ccscsttt 8 ␈ cccctttt 9 ␉ cssttstt 10 ␊ csttssttt 11 ␋ cccsscttt 12 ␌ ccttcttt 13 ␍ cccsttstt 14 ␎ cttcttstt 15 ␏ ccssscsttt 16 ␐ csttccst...")

26 July 2026

  • 11:5811:58, 26 July 2026 N++ (hist | edit) [1,269 bytes] Randomguy34 (talk | contribs) (Created page with "== intorduction == N++ is a variation of nonumbers designed to have only numbers, it was created by User:Randomguy34, the same creator of nonumbers == how the esolang works == N++ is the same as nonumbers, but it converts all allowed symbols into binary (except comments): {| class="wikitable" |+ conversion |- ! nonumbers !! N++ |- | ? || 0001 |- | ∞ || 0010 |- | n(x) || 00111111(x converted into binary)0000 |- | S(x) || 01001111(x converted into binar...")

25 July 2026

  • 23:1423:14, 25 July 2026 CLEAR (hist | edit) [10,115 bytes] Representativeofpeace (talk | contribs) (Created page with "{{Infobox proglang |name = CLEAR |author = my mind |created = 2026 |paradigms = Imperative, Register-based, Data-flow |typing = Typeless }} '''CLEAR''' (an acronym for '''C Like Engineered Accent Language''', also known as '''Wordless Control flow Language''' or '''wcfl''') is an esoteric programming language designed to explore imperative computation without textual keywords. While traditional imperative languages rely on control words like {{code|if...")
  • 21:3321:33, 25 July 2026 Annotations (hist | edit) [1,081 bytes] Miui (talk | contribs) (Created page with "''Annotations'' is an esolang based on ''proof-of-work'' which exists within human DNA as an atomic response to information-entropy resistance in the circuit of cognitive dissonance. It is a hyperobject which substitutes belief merging with energy dense mesons that capacitate a consensus reality. == High-level overview == In the "high-level" sense this language leverages uncountable orders of combinators and the group closest to a n-hedral tesseract maintains a comphre...")
  • 11:2011:20, 25 July 2026 Vibes (hist | edit) [3,161 bytes] Harshit-Gupta-2005 (talk | contribs) (Created page with " {{infobox proglang |name=Vibes |paradigms=imperative, procedural, object-oriented |author=User:Harshit-Gupta-2005 |year=2026 |typesys=dynamic, duck |memsys=variable-based |class=Turing complete |refimpl=[https://github.com/Harshit-Gupta-2005/Vibes_Lang Vibes (Python)] |influence=Python, C |influenced= |files=<code>.vibes</code> }} '''...")

24 July 2026

23 July 2026

22 July 2026

  • 23:0723:07, 22 July 2026 Deadfish but in english (hist | edit) [2,246 bytes] Zopium (talk | contribs) (Created page with "'''Deadfish but in english''' is Deadfish, but instead of these yucky single character commands, it's sentences. {| class="wikitable" |+ Instructions |- ! What it says !! What it does |- | <code>Increment the accumulator</code> || Increments the accumulator. |- | <code>Decrement the accumulator</code> || Decrements the accumulator. |- | <code>Square the accumulator</code> || Squares the accumulator. |- | <code>Output the accumulator</code> || Outputs the accumulator...")
  • 14:5614:56, 22 July 2026 Lost And Found: Kingdom of Hangul (hist | edit) [3,617 bytes] Miui (talk | contribs) (Created page with "'''Lost And Found: Kingdom of Hangul''' is a joke output only language that takes the source of of Jon Ripley's Lost Kingdom and compiles it to Aheui and then ''illegally'' (it is illegal to mod Jon Ripley's Lost Kingdom and change the License) rewrites everything, input syntax and strings into the english alphabet representation of the vowl sequences. It also accidentally breaks the scoring system in the process and requires actually automatically completing player...")
  • 09:4309:43, 22 July 2026 ABCLang (hist | edit) [8,456 bytes] Jan Ala (talk | contribs) (Created page with "ABCLang is a minimalistic, Turing-complete esoteric programming language created by User:Jan Ala. It uses only three characters: a, b, and c. ==Overview== ABCLang is a stack-based virtual machine language with: * 3 characters (a, b, c) * 26 instructions (encoded as 3-character sequences) * Two stacks (A and B) for data * One register for temporary storage * Turing-complete via dual-stack simulation of a Turing machine ==Encoding System== ===Base-26 Digit Encoding==...")
  • 08:3408:34, 22 July 2026 Meow (135yshr) (hist | edit) [4,330 bytes] 135yshr (talk | contribs) (Created page with "{{infobox proglang |name=Meow |paradigms=functional |author=[https://github.com/135yshr 135yshr] |year=2026 |typesys=gradual, static |class=Turing complete |refimpl=[https://github.com/135yshr/meow GitHub] |influence=Go |files=<code>.nyan</code> }} '''Meow''' is a cat-themed functional programming language created by [https://github.com/135yshr 135yshr] in 2026. Every keyword in the langu...")
  • 02:3202:32, 22 July 2026 Don Giovanni/Implementations (hist | edit) [31,302 bytes] PrySigneToFry (talk | contribs) (Created page with "= Python = <pre> import sys # ---------------------------------------------------------------------- # 1. Lexer # ---------------------------------------------------------------------- class Token: def __init__(self, type, value, line): self.type = type self.value = value self.line = line def __repr__(self): return f"Token({self.type}, {repr(self.value)})" class Lexer: def __init__(self, source): self.source = sourc...")

21 July 2026

  • 18:3518:35, 21 July 2026 Μμton (hist | edit) [14,623 bytes] Miui (talk | contribs) (todo)
  • 17:1017:10, 21 July 2026 Addfuck (hist | edit) [6,694 bytes] Fgaoxing (talk | contribs) (Created page with "{{lowercase}} {{infobox proglang |name=AddFuck |paradigms=imperative |author=Fgaoxing |year=2026 |memsys=Cell-based |dimensions=one-dimensional |class=Turing complete |majorimpl=[https://github.com/Fgaoxing/Addfuck/ Reference implementation] |files=<code>.af</code>, <code>.addfuck</code> }} '''AddFuck''' is an esoteric programming language and virtual machine centered around addition opera...")
  • 13:4313:43, 21 July 2026 Legato (hist | edit) [9,456 bytes] PrySigneToFry (talk | contribs) (Created page with ":''This entry is not about the playing technique 'legato'.'' Legato is a programming language designed by PSTF. = Overview = ; Type System: Statically strong-typed, with full type inference support (Hindley-Milner style). ; Paradigm: A mix of imperative, functional (Lambda calculus), and object-oriented programming. ; Core Features: First-class functions, closures, tail call optimization, safe pointers, structs, and classes. ; Design Philosophy: Explicit over imp...")
  • 13:4013:40, 21 July 2026 SGA (hist | edit) [2,683 bytes] OfficialWatchOS7Alt (talk | contribs) (Created page with "StackGolfAssembly, also known as '''SGA''' for short, is a stack-based language created by User:OfficialWatchOS7Alt. == Nomenclature == The letters in the acronym reflect different aspects of SGA: * '''S''' (Stack): The language is stack-based. * '''G''' (Golf): The language uses intentionally short commands. * '''A''' (Assembly): The language uses all fundamental stack manipulation commands. == Commands == In SGA, only values from a range of -16,777,217 an...")
  • 11:0011:00, 21 July 2026 Trigfunge (hist | edit) [1,256 bytes] None1 (talk | contribs) (Created page with "'''Trigfunge''' is a fungeoid invented by User:None1 that uses a queue instead of a stack and uses trigonometric functions to manipulate data. ==Memory== Trigfunge uses a ''queue'' which stores unbounded floats with infinite precision. ==Commands== * <code>@^v<>|_0</code>: The same as Befunge. * <code>sct</code>: Change queue front to ''sin/cos/tan(queue front)'' respectively. * <code>=</code>: The next command is skipped unless the queue front is equ...")
  • 08:0508:05, 21 July 2026 Haltloop (hist | edit) [459 bytes] Esolang lover123 (talk | contribs) (wow it's so good it made me say "wow it's so good it made me say "wow it's so good it made me say "wow it's so good it made me say "wow it's so good it made me say "wow it's so good it made me say "wow it's so good it made me say "wow it's so good it made me say "wow it's so good it made me say "wow it's so good it made me say "wow it's so good it made me say "wow it's so good it made me say "wow it's so good it made me say "wow it's so good it made me say "wow it's so good it made me say "wow i)
  • 07:1107:11, 21 July 2026 1835cc Volkswagon Beetle '78 (hist | edit) [1,760 bytes] Miui (talk | contribs) (Created page with "{{Stub}} '''The 1835cc Volkswagon Beetle '78''' is an esoteric abstract model based on an 19 octons, 19 edons totality and 6 trits, 243 tryes system architecture. = Thesis = The 1835cc Volkswagon Beetle '78 is considered an excellent torque-based model to gauge the computational power of a system to a constant. The totality in octons and edons fixes a singularity within the energy system, which provides a means to ''hot rod'' the stock Beetle. A stock VW Be...")
  • 04:1804:18, 21 July 2026 Choropleth/색地図 (hist | edit) [260 bytes] Miui (talk | contribs) (trying to phrase this concept/related pages)
  • 01:4401:44, 21 July 2026 Very-simple (hist | edit) [1,852 bytes] Esolang lover123 (talk | contribs) (brainfuck 2: electric boogaloo)

20 July 2026

  • 23:3323:33, 20 July 2026 3 triquinquagits, 148877 triquinquagytes (hist | edit) [3,194 bytes] Miui (talk | contribs) (Created page with ":This page was generated by Claude. This is an esolang and the fourth of the sister languages of 9 trits, 19683 trytes. It is the one that can say everything the others could not. Note: 1 triquinquagyte is 3 triquinquagits (base-53 digits, 0–52). ==Architecture== Memory is 146,068 triquinquagytes: the multiplicative units modulo 53^3 = 148877. Values wrap at 148877. Addresses divisible by 53 do not exist; if one is given, 1 is added to it. 53 is prime, so the unit...")
  • 23:2923:29, 20 July 2026 Whizz (hist | edit) [7,919 bytes] Splot-dev (talk | contribs) (Started Whizz language page with a few details. Will add Turing-Completeness proof later.)
  • 13:1313:13, 20 July 2026 G59code (hist | edit) [5,913 bytes] Miui (talk | contribs) (Created page with "'''G59code''' generates any argument about how much the same closer any two people on a stage got away from godot while waiting for the argument to begin about how much more unperfect a whole half was away than all of the perfect thirds he remained in 3 seconds (.14159...) by User: Miui <code>any(ANY)</code>s:output=:: <pre> The argument, then, is: Any two people on a stage, waiting for Godot, get closer to each other by sharing an imperfect division of time (the h...")
  • 13:0113:01, 20 July 2026 Stexmix (hist | edit) [1,032 bytes] Miui (talk | contribs) (Created page with "{{stub}} Stexmix exists cause of the puzzles and guessing challenges and is influenced by SubtextLang, thats it - by User: Miui. ==interpreter== <pre> key = 0x42 enc = b"$0-/b\x12\x0b\x0eb+/2-06b\x0b/#%'H6\x7f\x19 g{b$-0b b+,b\x0b/#%'l-2',j`\x117 6':6\x0e#,%o\x04+ - ,#!!+\x1d1'37',!'l!16:l2,%`kl6- ;6'1jk\x1fH0\x7f\x19\x1fy+\x7frH5*+.'b+ip~.',j6kxHb\x03n\x00n\x01\x7f6\x19+x+iq\x1fy+i\x7fqHb+$j\x03n\x00n\x01k\x7f\x7fjqnsntkx 0'#)Hb:\x7f\x03hzsi\x00h{i\x01Hb+$b:|...")
(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)
Retrieved from "https://esolangs.org/wiki/Special:NewPages"