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)
  • 14:30, 11 June 2026Melanocetus!johnsonii (hist | edit) ‎[3,244 bytes]Miui (talk | contribs) (Created page with ":''Due to technical limitations the title of this page is incorrect. The actual name is "'''Melanocetus%21johnsonii'''" frame|right|Melanocetus!johnsonii '''Melanocetus%21johnsonii''' is a some kind of abyssal deadfish derivative made by User:Miui in 2026. ==Commands== There is a main accumulator a conversion table and a zeta function. {| class=wikitable !Command !Description |- |<code>M</code> |Mainlines the accumulator |- |<code>no<...")
  • 03:36, 11 June 2026Lambda-calculus program repository (hist | edit) ‎[3,019 bytes]VP3NEG (talk | contribs) (Created page with "This is NOT an Esoteric programming language, it is a program repository for Lambda calculus designed for beginners I highly recommend you read the page on Lambda calculus linked here. Booleans: In λ-calculus, everything is a function, there are no booleans. However, it is not to say that we can't make our own booleans, after all, it is Turing-complete. True: λx.λy.x False: λx.λy.y These booleans are conditional statements, True is IF...")
  • 00:37, 11 June 2026Sovietscript (hist | edit) ‎[769 bytes]VP3NEG (talk | contribs) (Created page with "Sovietscript is a ternary variation of Binary lambda calculus designed to be as Marxist-Leninist as possible. The variables are de Brujin indexed so there are no names so λx.x is no different from λy.y, they are both λ1. 0xy This means apply y to function x. 1 This is a lambda abstraction λ. x This is a variable, the de Brujin index is represented as a string of 2s in unary representation Background information: Sovietscript was created by en...")
  • 20:48, 10 June 2026See Two (hist | edit) ‎[5,052 bytes]Miui (talk | contribs) (Created page with ":''Due to technical limitations the title of this page is incorrect. The actual name is "'''See Two?'''" thumb '''See Two?''' is a language with =, V, ▩ (U+0x25A9) and Dodedcahedron. It explores the abelian group C2xC2xC2. =spec= 2 types #<code>c2.?</code> #<code>SeeTwo.?</code> 4 objects {| class="wikitable" |+ objects |- ! = !! V !! ▩ (U+0x25A9) !! Dodecahedron |- | frameless|none || frameless|none ||...")
  • 20:02, 10 June 2026HLAAPL (hist | edit) ‎[6,288 bytes]Brain Boy 53 (talk | contribs) (Created page with "'''HLAAPL''', which stands for Human Language as a Programming Language, is an esolang that tries to simulate natural language syntax. Any natural language can be used; this article will primarily be using Esperanto. ==Input and Output== To make the program output something, you conjugate the word for "to write" in the singular imperative and put the thing you want to output as the object. In quotes if a string, not if a variable or number. Skribu "Saluton, la mondo!"....")
  • 15:34, 10 June 2026Kia SorrentoLX with no power-steering evading police in reverse (hist | edit) ‎[239 bytes]Miui (talk | contribs) (Created page with "'''Kia_SorrentoLX_with_no_power-steering_evading_police_in_reverse''' is Half-Broken Car in Heavy Traffic where cardinal directions are divided into quarters (so it takes <<<< to go right)")
  • 14:30, 10 June 2026Computational reducibility (hist | edit) ‎[0 bytes]Miui (talk | contribs) (Created page with "'''Computational reducibility''' is a concept about reducing computational problems to prove facts about other computational problems. A novel formalization of the concept of computational irreducibility evaluates functorial correspondence between a category of data structures and elementary computations plus a corresponding category of (1-dimensional) cobordisms. Computational reducibility optimizes a decidability problem with respect to a recognizabl Turing-machine...")
  • 14:07, 10 June 2026Palimpsest (hist | edit) ‎[15,673 bytes]Mrsommer (talk | contribs) (Initial page creation for Palimpsest)
  • 05:21, 10 June 2026TSPARSE—MATMUL (hist | edit) ‎[2,117 bytes]Miui (talk | contribs) (Created page with "'''TSPARSE—MATMUL''' is an esolang created by User:Miui in which parse‑aware ternary matrix‑multiplication is the central operation. =Architecture= Programs are written as a 512×512 matrix of ternary weights in \{-1, 0, +1\}, where -1 is Nope., +1 is Nope! and 0 is noop. Interpretation requires a THCA and brainfuck.<br> '''Balanced''' ternary has 24 commands + 1 MODULO command.<br> '''Unbalanced''' ternary works best as a trivial brainfuck s...")
  • 04:39, 10 June 2026Itera (hist | edit) ‎[842 bytes]VP3NEG (talk | contribs) (Created page with "Itera is a Markov algorithm based Esoteric programming language. It uses a similar grammar to Thue. Unlike Thue, it is deterministic. The substitution rules are represented as substring::=substitution input is defined as: substring::=? when executed, the substring is substituted with the input string. output is defined as: substring::=! when executed, the substring is printed onto the screen. when an Itera program is started, it asks t...")
  • 04:06, 10 June 2026C flavored BrainF*ck (hist | edit) ‎[551 bytes]VP3NEG (talk | contribs) (C flavoured BrainF*ck is a transpilation of BrainF*ck to C)
  • 14:58, 9 June 2026TelegraphLang (hist | edit) ‎[2,827 bytes]Samuel F.B. Morse (talk | contribs) (Created page with "{{infobox proglang |name=Telegraph |author=Samuel F.B. Morse |date=2026 |implementation=None }} == Overview == "If the presence of electricity can be made visible... I see no reason why intelligence may not be transmitted instantaneously by electricity." I, Samuel F.B. Morse, originally invented Morse code and the telegraph! While I sadly passed away from pneumonia in New York City on April 2, 1872, I was recently revived by SOME GUY! Upon my return, I noticed that...")
  • 23:27, 8 June 2026S₅ (hist | edit) ‎[27,420 bytes]Gribnit (talk | contribs) (0.3.1 summary)
  • 19:32, 8 June 2026Langit (hist | edit) ‎[81 bytes]Danieland! (talk | contribs) (Created page with "go to Category:langit for all oficial sub projects of langit Category:langit")
  • 15:56, 8 June 2026Hello++++++++++++++++++++++++++++++++++++ (hist | edit) ‎[5,767 bytes]Dumgeonlol (talk | contribs) (Created page with "Hello++++++++++++++++++++++++++++++++++++ or Hello36 is a Joke Language made by User:Dumgeonlol Category:Joke languages")
  • 13:59, 8 June 2026Minez (hist | edit) ‎[18,395 bytes]Dooblix (talk | contribs) (Minez is an esoteric programming language created by Dooblix in 2024 (current version: 2025), inspired by Urban Müller's minimalistic esoteric programming language "Brainfuck".)
  • 06:42, 8 June 2026Condition (hist | edit) ‎[1,793 bytes]ASCIIguy (talk | contribs) (Created page with "'''Condition''' is an If a==1: derivative with added features, created as it was viewed as too restrictive and that things such as I/O would be useful for the language. ==Syntax== Like the original language, all instructions are on a singular line. Unlike the original language, there are 2 variables: w and x. They can be of any integer value between 0 and 256. The language was made to be backwards-compatible with any original program, hence the original characters ke...")
  • 06:11, 8 June 2026Pull (hist | edit) ‎[3,140 bytes]ASCIIguy (talk | contribs) (Created page with "{{WIP}} '''Pull''' is a timeline/stack-based imperative golf language based on Git and the 5D time-travel languages. It uses the idea of branching out to create several states in one program. For example, one could move timelines upwards where x becomes 4 when it was 3 in your prior timeline. It was created by ASCIIguy in 2026 out of fascination for the concept of timelines in programming. Each timeline has its own stack. ------ a ba / mc ----------- b bc \...")
  • 20:03, 7 June 2026Pride (hist | edit) ‎[3,769 bytes]Las-r (talk | contribs) (Created page with "{{infobox proglang |name = PRIDE |paradigms = imperative, stack-based |author = User:Las-r |year = 2026 |majorimpl = [https://github.com/las-r/pride GitHub] |files = <code>.rid</code> }} '''PRIDE''' is a stack-based esolang that works on bits / booleans made by Nayif Ehan in 2026. It is very loosely based off Forth and Brainfuck, though most similarities are coincidental. More info can be found on [https://github.com/las-r/pride PRIDE's GitHub r...")
  • 19:44, 7 June 2026MEBOP (hist | edit) ‎[1,978 bytes]ASCIIguy (talk | contribs) (Created page with "'''MEBOP''' is an esolang based on mathematics, designed to look as though it were a serious mathematical work. It was designed in 2026 by ASCIIguy as a reference to the fact that computer science and mathematics were once the same field with minor differences due to the fact that the computer was not a consumer technology yet. It is a stack-based imperative language. == Etymology == MEBOP is an acronym that stands for ''Mathematical Esolang Based On Proofs'', and is pr...")
  • 17:58, 7 June 2026Plaintext (hist | edit) ‎[2,853 bytes]ASCIIguy (talk | contribs) (Created page with "'''plaintext''' is an esolang inspired by languages such as FORTRAN and COBOL heavily, so much so as to solely use regular English words. It was created by ASCIIguy out of annoyance for the difficulties of such languages, leading them to parody them. == Syntax == plaintext paragraphs begin with <code>PARAGRAPH [LABEL]</code>; they have sentences, which are instructions. Within these instructions are words, such as GO or WHEN or VAR. At the end of a line is a comma; ther...")
  • 16:19, 7 June 2026Dianoia (hist | edit) ‎[27,225 bytes]Miui (talk | contribs) (Created page with "Dianoia/dianoia (Greek: διάνοια) is a joke Schema (User:Miui thought of when they saw shelflife on here) in which programmers are robots and have to pass variously more difficult tests in order to perform operations. Cognition is the description of the memory-type, but cognition in the context of programming in Dianoia has no interpretation outside of Dianoia self-interpretation. =Commands= <code>Now</code>Case senstivie declaration. All programs begin w...")
  • 14:53, 7 June 2026OCB (hist | edit) ‎[1,016 bytes]CodePentuplets48 (talk | contribs) (Created page with "Category:2026 Category:Joke languages {{wrongtitle|title=[]\}}<br><br> '''[]\''' is a 3-instruction joke esolang I designed which relies on loops to do anything remotely complicated. Each command has one operand; [ and ] have numerical operands, whereas \ has a + or - operand. {| class="wikitable" |+ Commands |- ! Instruction !! Meaning |- | [x || Start a while-not-x loop. |- | ]x || End a while-not-x loop. |- | \+ || Increment the memory cell. (And \- decrements...")
  • 12:37, 7 June 2026England is a country in the United Kingdom and its main cultural export is this one stupid esolang. The main reason it exists is to have one of if not the longest name on the esolangs wiki. LOL, deal with it admins. (hist | edit) ‎[1,920 bytes]ASCIIguy (talk | contribs) (Created page with "'''England is a country in the United Kingdom and its main cultural export is this one stupid esolang. The main reason it exists is to have one of if not the longest name on the esolangs wiki. LOL, deal with it admins''' (otherwise known as English) is an esolang designed to be fully unusable for any real programming. It is heavily based upon Malbolge, but designed to be even more useless. == Syntax == All instructions are on one line and any whitespace halts the pr...")
  • 12:08, 7 June 2026Stomach (hist | edit) ‎[1,264 bytes]ASCIIguy (talk | contribs) (Created page with "'''stomach''' (all-lowercase) is an esolang designed to be as difficult to use as possible while still being reasonable for a person to program in it. == Features and Syntax == stomach has 4 registers: a, b, c, d. A is the default if there is none defined. A variable must always be an 8-bit hexadecimal value, e.g. ?a04. Variables are susceptible to overflow and underflow. {| class="wikitable" |+ Caption text |- ! Character !! Action |- | ? || Set register to hex value....")
  • 11:04, 6 June 2026Sprh (hist | edit) ‎[5,608 bytes]LargeHardTech (talk | contribs) (Created page with "这是一个适合在Esolang Wiki上添加的sprh介绍词条,你可以把它直接复制粘贴到你的页面里,并做一些简单调整: --- SPRH is an esoteric programming language designed by LargeHardTech in 2025. The name stands for **S**low (interpreted execution, feeling each step of change), **P**oor Readability (poor code readability, challenging the mind), and **H**ard (hard to program, implementing complex logic with minimal commands). It is inspired...")
  • 11:01, 6 June 2026Colours (hist | edit) ‎[1,204 bytes]ASCIIguy (talk | contribs) (Created)
  • 10:55, 6 June 2026NAND (hist | edit) ‎[4,536 bytes]АРЕЙ (talk | contribs) (Page created.)
  • 10:35, 6 June 2026Comma (hist | edit) ‎[3,048 bytes]ASCIIguy (talk | contribs) (Created page with "comma (always lowercase) is an assembly language for a 4-bit fantasy chip known as the COMM4. == Registers and RAM == comma has access to 256 bytes of RAM, though this does not limit program size as the program is stored in ROM; this means it cannot be changed. Although opcodes are 4 bits wide, the registers A, X, and Y, are 8 bits wide and so are their arguments. When compiling (example: add a, 03), A becomes 0h, X is 1h, and Y is 2h. Hence, the example instruction com...")
  • 09:49, 6 June 2026INT/Examples (hist | edit) ‎[746 bytes]ASCIIguy (talk | contribs) (Created page with "Hello World: V"Hello world!" 99 Bottles of Beer: ?b99*>b0[^b" bottles of beer on the wall."]-0 Quine: ^^ Factorial: ~f.x[?c1*<cx[*xc]-x] Digital Root (non-cheating): Vx*%/x9- Digital Root (cheating 1): Vx%x- Digital Root (cheating 2): %V- Infinite Loop 1: $^ Infinite Loop 2: *=AA[+]- Truth Machine: /=x0[^0-]*=1x[^1]- Addition and Output: ?x2^x-x Cat 1: ?xV^x- Cat 2: ^V- Infinite Cat: $^V^ Sign Check: ?xV/=x0[^"Z"-]/>x0[^"P"-]^"N"- Fizzbuzz 1...")
  • 08:07, 6 June 2026Livingfish (hist | edit) ‎[2,031 bytes]ASCIIguy (talk | contribs) (Created page with "'''Livingfish''' is an esolang based on Deadfish, but it is designed for golfing and has had more capabilities added to it. For example, input in Deadfish does not exist but it does in Livingfish. == Syntax and Features == Whitespace does not matter in Livingfish and commands may be on one line, spaced out like regular code, or made into any shape. All Deadfish programs are functional in Livingfish, and backwards compatibility is required to make sure that programs...")
  • 07:30, 6 June 2026Shelflife (hist | edit) ‎[6,972 bytes]Mrsommer (talk | contribs) (Page init)
  • 14:25, 5 June 2026Tableria (hist | edit) ‎[2,067 bytes]Miui (talk | contribs) (Created page with "Tableria is an esolang based on using arithmetic intermediate representation tables as a field. There is a table of fieldlets (blobs) which interpret code. ==Table== {| class="wikitable" |+ Caption text |- ! Index !! Fieldlet !! Code |- | 1 || frameless || a |- | 2 || frameless || b |- | 3 || frameless || c |- | 4 || frameless || d |- | 5 || frameless || e |- |...")
  • 13:13, 5 June 2026Ff.f (hist | edit) ‎[473 bytes]Danieland! (talk | contribs) (Created page with "ff.f is a esolang that uses . and f and / and other stuff for coding inspiered in computer disks this is line based comments use @ <pre> + ff.f @ creates a variable called ff.f , variable names must have dots -a ff.f ; @ creates a loop that replaces print with set ff.f to something ! hello, world! @ print , replaced by set f.ff to something cus the loop ;; @ loop end , this loop runs once ! {ff.f} @ print a variable using {} @ thats all for version 0.0.1 </pre>")
  • 22:30, 4 June 2026IndXd (hist | edit) ‎[1,302 bytes]Notxnorand (talk | contribs) (Created page with "= indXd = thumb indXd is an esoteric programming language made by Notxnorand on 6/4/2026 about indexing. indXd uses a global list for every single value. This list contains every integer from 0 to the length of the list minus 1. indXd also has a global truth value that is set to false on run. == Commands == indXd has 11 commands. * print : 'print' is a function that takes in integers and prints the Unicode characters from the index of the global list...")
  • 21:02, 4 June 2026Liquiplex (hist | edit) ‎[2,069 bytes]CodePentuplets48 (talk | contribs) (Created page with "'''Liquiplex''' is a turning tarpit designed by User:CodePentuplets48 which uses 3 wheels rather than just 1. Each wheel has 24 cells inside, and one is for data, the second is for control flow management, and the third stores extra code to be looped over (''storage''). The commands are: {| class="wikitable" |+ Commands |- ! Instruction !! Meaning |- | \ || Switches the direction of the data wheel. |- | [ || Decrement the current cell on the data w...")
  • 05:45, 4 June 2026Cath (hist | edit) ‎[1,391 bytes]Timm (talk | contribs) (Created page with "coming soon {{made|Timm}}")
  • 06:12, 3 June 2026漢字 (hist | edit) ‎[719 bytes]ASCIIguy (talk | contribs) (Created page with "'''漢字''' is a golfing esolang based on the Chinese language. It uses a stack and functions to store numbers. == Instructions == 加 - Addition. 减 - Subtract. 乘 - Multiply. 除 - Division. 按 - Push. 拿 - Pop. 输出 - Print. 输入 - Input. 令 - Assign. 循环 - While. 若 - If. 否则 - Else. 函 - Function. 返 - Return. 开 - Begin block. 末 - End block. 大于 - Greater than. 宁可 - Lesser than. 是 - Equals. 行事 - Execute n times. == Syntax ==...")
  • 20:52, 2 June 2026INT (hist | edit) ‎[2,989 bytes]ASCIIguy (talk | contribs) (Created page with "'''INT''' is a golf language inspired by GolfScript. It's intended to minimise space further, allowing for maximum code per byte. == Command == {| class="wikitable" |+ Caption text |- ! Character !! Argument[s] !! Action |- | ! || int || Logical not. |- | ^ || int || Push. |- | ^ || char || Print. |- | ^ || int, int || Logical xor. |- | V || int || Pop. |- | V || char || Input. |- | . || int || Duplicate on stack. |- | * || int, int || Multiply. |- | * || int |...")
  • 20:07, 2 June 2026ASCIIscript (hist | edit) ‎[1,843 bytes]ASCIIguy (talk | contribs) (Created page with "'''ASCIIscript''' is an imperative, stack-based language based on the concept of a small instruction set created in 2026. Being a small language, it relies upon a small group of commands. Its goals consist of making source code more concise and readable, and hence allowing more code to be written at faster speeds. 100px == Inspiration == ASCIIscript was inspired by aspects of C, Haskell, and lambda calculus. == Computational model == ASCIIscri...")
  • 17:03, 2 June 2026P/O/S/S/I/B/I/L/I/T/Y (hist | edit) ‎[555 bytes]CodePentuplets48 (talk | contribs) (Created page with "{{wrongtitle|title=P/O/S/S/I/B/I/L/I/T/Y}} '''P/O/S/S/I/B/I/L/I/T/Y''' is a esolang family based on these rules: * It ''cannot'' store any prime number. * It gives the error message "No!" every time there is an error. * It ''refuses'' to print anything that does not start with the U+202E character. * It must not be able to print "{U+202E}Hello, world!" * It always solves today's Wordle first. * If a compiler for it is made, it will be devoured immediately. * There is onl...") originally created as "Possibility"
  • 18:31, 1 June 2026‘a pit-crystal’ (hist | edit) ‎[3,393 bytes]Miui (talk | contribs) (Created page with "A ''pit-crystal'' ("'''pitxtal'''") is a target language for evaluating Crystal-complete thupits. =Interpreter= pitxtal.py <pre>cat pitxtal.py #!/usr/bin/env python3 import random import sys # --- semantics --------------------------------------------------------- # Per-state behaviour: does this state consume, and what base string does it produce? STATE_BEHAVIOR = { # examples – tweak freely 'a': {'consume': True, 'produce': ''}, 'b': {'consum...")
  • 14:06, 31 May 2026EragonLang (hist | edit) ‎[1,131 bytes]Geoff (talk | contribs) (made my idea for an esolang)
  • 14:01, 31 May 2026~-=+:;@! (hist | edit) ‎[1,479 bytes]Hammy (talk | contribs) (Created page with "{{Wrongtitle|title=~-=+:;@!_}} '''~-=+:;@!_''' is an esolang by User:Hammy made to be an actually usable version of ~-=+. {{Infobox proglang |name=~-=+:;@! |author=User:Hammy |year=Category:2026 |influence=~-=+ |paradigm=Imperative |memsys=Category:Stack-based |dimensions=one-dimensional |files=<code>.tmepcsaeu</code> }} == Commands == {| class=wikitable |+ Commands |- ! Command !! Meaning |- | <code>~</code> || Push the ASCII value of the nex...")
  • 12:19, 31 May 2026Left-Right March/C Interpreter (hist | edit) ‎[8,021 bytes]DigitalDetective47 (talk | contribs) (Created page with "<pre><nowiki> #define _GNU_SOURCE #include <assert.h> #include <ctype.h> #include <inttypes.h> #include <stdbit.h> #include <stddef.h> #include <stdio.h> #include <stdlib.h> #include <string.h> struct { char *content; // Not null terminated! size_t size; } field = {NULL, 0}; struct { char *pos; enum { LEFT = -1, RIGHT = 1, } dir; } field_ptr; uint_fast8_t A; void prog_error(const ch...")
  • 11:02, 31 May 2026Skip-next (hist | edit) ‎[1,100 bytes]Cleverxia (talk | contribs) (create the page)
  • 01:10, 31 May 2026Shampoo (hist | edit) ‎[3,208 bytes]Miui (talk | contribs) (Created page with "Shampoo is an esolang invented by User:Miui. A supply-chain for shampoo production is attacked by shampoo distributors. =Supply chain= A product is composed of camphor oil and chamomile, the label contains a photograph of a tulip. A production facility exists in a central place between a shipyard and a chamomile supplier if a distributor warehouse exists within a range of a tulip supplier. ==Program flow== In Shampoo, supply-chain attacks represent codels and the...")
  • 19:33, 30 May 2026S♯ (hist | edit) ‎[105 bytes]Jar (talk | contribs) (Created page with "ee")
  • 19:32, 30 May 2026S (hist | edit) ‎[0 bytes]Jar (talk | contribs) (Created page with "S is a programming language made by User:Jar, its not done yet and im currently working on formats")
  • 07:33, 30 May 2026Varl (hist | edit) ‎[0 bytes]Kras11 (talk | contribs) (Created page with "varl is my programming language. varl has 3 commands: 2 - end. 3 x - if code element in x position is 0, it will be replaced by 1, and if it is not 0, it will be replaced by 0. 4 x y - if code element in x position is 0, machine going in code on y chars(forward if y>0, else backward). Machine ignores other chars, so it can be 0/1, and you can change this chars. varl interpreter on C(code is c variable in interpreter, write code length in [] instead of 2 and numbers throu...")
(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)