New pages

08:50, 9 February 2026 ‎Esolang spec (hist | edit) ‎[3,577 bytes] ‎None1 (talk | contribs) (Created page with "'''Esolang spec''' is an esolang invented by User:None1. Programs in this esolang are like specifications of esolangs. ==Program structure== A program must be like this: <pre> (header) ==Memory== (variable definition) ==Commands== (command 1) (command 2) ... </pre> This esolang is case-insensitive. All whitespaces are ''mandatory''. ===Section 1: header=== It must be like this: ''esolang name'' is an esolang invented by ''name''. For example: ABCD is an esolang inv...")
08:26, 9 February 2026 ‎Str (hist | edit) ‎[1,616 bytes] ‎Cleverxia (talk | contribs) (Created page with "{{lowercase}} {{Distinguish/Confusion|text=[https://github.com/ConorOBrien-Foxx/str another language] with the same name created by Conor O'brien}} str is a esolang created by User:cleverxia but it has nothing to do with strings. The name actually means "'''st'''ack '''r'''oll". As its name suggests, it uses a stack (with unbunded integers) ==The two instructions== <code>0</code>: push a 0. <code>1</code>: pop a number x, roll the stack top x numbers down, and...")
06:58, 9 February 2026 ‎Concept-complete (hist | edit) ‎[737 bytes] ‎Rombito (talk | contribs) (Created page with "By user:Rombito In order for a language to be Concept-Complete, it must have the quality: '''must be able to conceive of any concept and work with it, not including ones that are created or searched for to be impossible to be conceived by the language.''' == percentages == ''Percentages'' range from 0% (unable to conceive anything) to 100% (truly concept-complete) category:Concepts category:2026")
20:51, 8 February 2026 ‎Lambdus (hist | edit) ‎[2,022 bytes] ‎Rombito (talk | contribs) (Created page with " == Introduction == Lambdus is a language which uses an image to write programs == lines == Line examples will go from right to left (except for the start) These lines can be rotated and flipped * file:Lambdus-start.png (start) : this is the start, defines the starting position of the program, which the execution will travel through, the default line value will be the one you will input * file:Split-Lambdus.png (split) : splits the line in two, executing in par...")
12:48, 8 February 2026 ‎Stackowey/Stackowasm (hist | edit) ‎[1,383 bytes] ‎Lampe2020 (talk | contribs) (Create "Stackowey/Stackowasm" page stub)
16:22, 7 February 2026 ‎Cell Management (hist | edit) ‎[1,159 bytes] ‎A() (talk | contribs) (Created page with "Cell Management is an esoteric programming language made by User:A() where you manage Cells. == Commands == . This is the Manager. It moves right at the start of the program. ><^v These are directional pointers. They tell the Manager which direction to go. [ ] These are Cells. They can have stuff inside them. They must be managed. [+] [-] These two Cells are called Incrementors and Decrementors. They increment or decrement the value that is stored in the Mana...")
11:57, 7 February 2026 ‎🐱🐈 (hist | edit) ‎[592 bytes] ‎Dragoneater67mobile (talk | contribs) (Created page with "🐱🐈 is a joke esoteric programming language designed to be Plushie-complete. ==Overview== The language has a single 1-trit register <code>A</code> initialized to 0. The language has the following commands: * 🐱 sets A to 2 * 🐈 prints 4 if A is 2, else, it prints 31 ==Computational class== 🐱🐈 is Plushie-complete, because it is capable of setting a variable to 2: 🐱 printing 4: 🐱🐈 and printing 31: 🐈 Categ...")
06:39, 7 February 2026 ‎Prime Detector (hist | edit) ‎[1,353 bytes] ‎PrySigneToFry (talk | contribs) (Created page with "Prime Detector is a very classic programming challenge. Any programming language capable of completing this challenge will be proven to have the following characteristics: * I/O * Simple arithmetic operations * Conditional jump * Iterative loops or conditional loops * Advanced arithmetic operations (such as square roots) The challenge requires writing a program that takes an input, determines whether it is a prime number, and then outputs the result. = Challenge Zone =...")
05:25, 7 February 2026 ‎ZecZec (hist | edit) ‎[3,393 bytes] ‎BODOKE2801e (talk | contribs) (Created page with "{{wrongtitle|title=<nowiki>>|<>|<</nowiki>}} >|<>|< is a language made by User:BODOKE2801e here's all the things (n is a number, . is a thing, and .- is a boolean, also the amount of dots is the ID of the variable/boolean): ==Syntax== Here's the syntax: {| class="wikitable" |+ Outputters |- ! Code !! Name !! Description |- | (.) || Print || Prints . |- | (.<.->) || Print Conditional || Prints . if .- is true |- | (.>)> || Print and jump || Prints . and jumps the n...")
21:02, 6 February 2026 ‎SDAPL (hist | edit) ‎[5,814 bytes] ‎ReddoYT (talk | contribs) (Created the whole page)
06:03, 6 February 2026 ‎Amino (hist | edit) ‎[3,007 bytes] ‎Azure413 (talk | contribs) (Created page with "Amino is a stack-based esolang similar to the creation of proteins from DNA. ==Language overview== Code in Amino is made entirely from A, T, C, and G, the same as DNA. The code is converted to instructions by transcription and translation. In transcription, the code is converted from ATCG to UAGC, by A->U, T->A, G->C, and C->G. The transcribed code is then put through translation, which converts each group of 3 bases into an amino acid. Amino acids use the same bases a...")
03:36, 6 February 2026 ‎BODOKE2801's Redirect (hist | edit) ‎[0 bytes] ‎BODOKE2801e (talk | contribs) (Created page with "User:BODOKE2801e")
00:07, 6 February 2026 ‎Lambdir (hist | edit) ‎[4,420 bytes] ‎Iacgm (talk | contribs) (Created page with "{{infobox proglang |name=Lambdir |paradigms=functional |author=Ian Graham Martinez |year=2026 |class=Turing Complete |refimpl=[https://github.com/iacgm/lambdir Lambdir] |influence=Combinatory Logic |files=N/A }} '''Lambdir''' is a language which inputs a program given in the form of a directory structure without any files (or variables). Lambdir is an extension of combinatory logic (using the S_and_K_Turing-completeness...")
18:20, 5 February 2026 ‎Glucose++ (hist | edit) ‎[1,699 bytes] ‎Mrtli08 (talk | contribs) (Created page with "Glucose++ is an esolang that has "short syntax" for it to be accepted on this wiki and also be a esolang. Yeah, its glucose++ because we gotR++, and R is (R)ibose so its time for glucose. the commands are: * d()() defines a variable. example usage is: "d(username)("User")" * g() gets a variable. * ()+() is addition. It returns an integrer. Example usage is "(g(input1))+(g(input2))". * ()-(), ()*() and ()/() work the same with ()+(), but different operations. * s()()...")
13:21, 4 February 2026 ‎Freelanguage (hist | edit) ‎[233 bytes] ‎Mrtli08 (talk | contribs) (Created page with "This is the free language. Everyone can edit. ==Commands== :command1 :command2 category:user Edited")
08:04, 4 February 2026 ‎Book of Truth (hist | edit) ‎[4,443 bytes] ‎GUAqwq (talk | contribs) (Add Book of Truth. Grammar has not been completed yet.)
03:14, 4 February 2026 ‎Emerald paradox tiers (hist | edit) ‎[1,660 bytes] ‎Tommyaweosme (talk | contribs) (Created page with "Emerald paradox tiers is a way to categorize paradoxes, created by user:tommyaweosme. == Tier 1 paradox == A tier 1 paradox would be the following statement: This statement is false Let us use a method for figuring out the tier of a paradox. First, we assume the statement is true. That means that it is true that the statement is false. So, let us assume it is false. That means it is false that the statement is false, meaning it is true. Therefore, if it can neith...")
01:10, 4 February 2026 ‎UBX (hist | edit) ‎[4,205 bytes] ‎None1 (talk | contribs) (Created page with ":{{Distinguish/Confusion|text=Bx because they're completely different esolangs although invented by the same author}} '''UBX''' ('''U'''ltimate '''B'''rainfuck e'''X'''tension) is an esolang invented by User:None1. It is brainfuck but equipped with almost all the extensions mentioned in Brainfuck extensions (as of 2026/1/17 13:00 UTC). ==Memory== There are two 2-dimensional tapes. Each tape is unbounded on 2 sides, and cells contain unbounded unsigned int...")
16:38, 3 February 2026 ‎Implied (hist | edit) ‎[2,056 bytes] ‎Aadenboy (talk | contribs) (])
12:43, 3 February 2026 ‎The Processor Collection (hist | edit) ‎[1,179 bytes] ‎Mrtli08 (talk | contribs) (Created page with "(NOTE: Anyone can contirbute.) The Processor Collection is an esolang that behaves like an CPU, but with ... bits of data and program memory and ... bits of command data. It has multiple variants and to open one variant, at the start of the code there must be the variant ID. ==1 bit, 1 bit (id: 1)== The worst of all. It has 1 bit of memory for both program and data. Commands: 0, which is a NOP and 1 which bit-flips the memory. Change the memory to one: ␁ Nothing: ␀...")
04:29, 3 February 2026 ‎40 (hist | edit) ‎[18,177 bytes] ‎Tommyaweosme (talk | contribs) (Created page with "40 is a programming challenge with an extremely long name. As the input gets higher, it puts more stress on the compiler. Its full name is: 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0...")
12:16, 2 February 2026 ‎Brainasm (hist | edit) ‎[1,291 bytes] ‎Mrtli08 (talk | contribs) (Created page with "BrainASM is an language that compiles to brainfuck and makes coding easier which allows bigger projects to be made. It also tracks the pointer position to make code dont corrupt. The compiler will assume the program starts at the first cell and the interpreter has wrapping. The instructions are: writememory (idx) (number) is an command to write to a memory index. Assuming the pointer index starts at one, <code>writememory 3, 5;</code> will compile to <code>>>[-]+++++...")
06:29, 2 February 2026 ‎BoxedLANG (hist | edit) ‎[1,755 bytes] ‎Mc20000 (talk | contribs) (init)
05:50, 2 February 2026 ‎List of esolang file extensions (hist | edit) ‎[2,039 bytes] ‎Qazwsxplm (talk | contribs) (Created page with "This page does not exist yet. You can create it via typing in the box below (see the help page for more information). (If you don't want to create the page, just navigate away, e.g. with your browser's back button.) Note: if this is your first contribution to the wiki, you will have to introduce yourself first, due to problems we're having with spambots. When creating a new page, it is recommended that you: 1. Make sure it's linked to from the rest of the wiki. If you'...") originally created as "New File Extensions"
00:52, 2 February 2026 ‎StupidSentences (hist | edit) ‎[1,992 bytes] ‎A() (talk | contribs) (Created page with "StupidSentences is a language made by User:A() where you write nonsensical sentences == Syntax == All words must be actual words. For example, 'word' is accepted while 'wword' is not. Also, all sentences must have a subject, verb, and object, or subject, verb in that order. Words like 'is' must be in between the subject and verb. Length is counted by adding the total length of subject, verb and object. Numbers go at the end of the sentence. '.' doesn't count as a...")
23:25, 1 February 2026 ‎Ring-around-the-Rosie (hist | edit) ‎[7,649 bytes] ‎Salpynx (talk | contribs) (a semi-joke 2D idea... super- and sub-script syntax needs finessing)
18:28, 1 February 2026 ‎Lucky Ball (hist | edit) ‎[933 bytes] ‎RainbowDash (talk | contribs) (luckyball ya)
14:54, 1 February 2026 ‎Better-machine (hist | edit) ‎[3,370 bytes] ‎ZachMadeAnAltBecauseHeLostThePassword (talk | contribs) (truth-machine, but better)
08:52, 1 February 2026 ‎Bitwise Cyclic Teap (hist | edit) ‎[1,541 bytes] ‎None1 (talk | contribs) (Created page with "{{lang|a=User:None1|n=Bitwise Cyclic Teap (BCTp)|f=a derivative of BCT where data is stored in a heap (a.k.a: priority queue) instead of a queue}} ==Commands== {| class="wikitable" |- ! Command !! Execution |- | 0 || Delete the ''smallest'' data-bit. |- | 1 || Goto the next command (say x). If the ''smallest'' data-bit is 1, insert x into the data-heap. |} ==Interpreter== ===Python=== <pre> from time import sleep from heapq import * class CyclicList(list):...")
07:17, 1 February 2026 ‎👨‍💻 (hist | edit) ‎[560 bytes] ‎Chocguy (talk | contribs) (Created page with "==👨‍💻== The goal of "👨‍💻" is to try and create a working esolang with emojis. 👨‍💻was created by Chocguy at the start of 2026, around 1/02/2026. ==Function== Currently there isnt much function but as time goes it will be updated ===Symbols and functions!=== EXAMPLE ⬇️⬇️ 🌑, Sets value to 0 EXAMPLE ⬆️⬆️ 🎙️, Asks for user input (or uses user input) ⬆️, Increments a value ⬇️, decrements a value 🫵, outputs a ascii...")
06:34, 1 February 2026 ‎D/Q (hist | edit) ‎[4,115 bytes] ‎Yayimhere2(school) (talk | contribs) (Created page with "'''D/Q''' is an extension to DQ, which is turing complete, and has less stacks than TDQ. It uses only two stacks. It was made to fix the problem of ℕDQ, while not increasing the stack count. == Memory == D/Q has two stack, and a pointer that points to one of them. The symbols <code>1</code> and <code>2</code> can be on these stacks. == Commands == D/Q uses the following commands: {| class="wikitable" ! Command !! Meaning |- | <code>$</code> || Go to the sta...")
16:24, 31 January 2026 ‎NFOS (hist | edit) ‎[2,295 bytes] ‎Yayimhere2(school) (talk | contribs) (Created page with "'''NFOS''' is a language created by User:Yayimhere, based on the idea of, if you have the current program, memory state, and new piece of data you want to add, there exists only one unique program, that when appended has the wanted effect. It is quite the "useless" language, alike Cabra, though unlike Cabra, it doesnt really look like a subset of a larger language. All its keywords are in danish. It is very messy(because it was defined quite "lazily". It will mos...")
15:36, 31 January 2026 ‎Alphabrain (hist | edit) ‎[2,320 bytes] ‎LavaSalt402 (talk | contribs) (Made the AlphaLang page)
05:14, 31 January 2026 ‎MØSS (hist | edit) ‎[8,251 bytes] ‎PrySigneToFry (talk | contribs) (Created page with "MØSS(pronounced as /mœs/ where /œ/ is a rounded /e/) is designed by PSTF and his AI friend. This language is an interpreted language, formally called 'Meaningful Object-oriented Simple Syntax', and is usually abbreviated as 'MossLang' (not 'MOSS', to distinguish it from something with the same name in a certain science fiction novel). = Language Overview = <pre> # Variable Declaration (Weakly Typed) name = "Alice" age = 25 is_student = true # List (Mutable Array) n...")
14:21, 30 January 2026 ‎BitPush (hist | edit) ‎[824 bytes] ‎Otesunki (talk | contribs) (Created page with "BitPush is an esolang created by MJM ([https://512b.dev/mjm/ homepage]), and first publically described in 2021 on User:Truttle1's discord server. Code and data are both stored on an array of stacks of bits. The following is the original description, word-wrapped to 60 columns: BITPUSH Bitpush data is contained within blocks of binary, which are executed in sequence. Bitpush source code is put into the first block before execution. All other blocks start empt...")
12:43, 30 January 2026 ‎Ételp moc gniruttéy gnitir wérgnirts (hist | edit) ‎[6,334 bytes] ‎PrySigneToFry (talk | contribs) (Created page with "Ételp moc gniruttéy gnitir wérgnirts(Official pronounciation: eɪtʰɛlpʰ mɔkʰ ɦniɾutʰeɪj ɦnitʰiɾ ʋeɪɾɦniɾt͡sʰ) is designed by PSTF. If you remove the diacritical marks and read it backwards, you get 'String rewriting yet Turing-complete,' which is what category this programming language belongs to. But this language has nothing to do with cirt e mys or noit o' mnain worb and is an i...")
09:57, 30 January 2026 ‎Monky (hist | edit) ‎[11,611 bytes] ‎Menguinponky (talk | contribs) (Created page with "MONKY is a language currently under development by User:Menguinponky. It draws inspiration from FORTH, C and FALSE, it uses a data stack and reverse polish notation. All keywords are single characters, all values on the stack are chars, literals are signed The effect of each instruction can be documented in the stack effect notation known from FORTH: (elements on stack before -- elements on stack after) push operations (-- n): 5 push literal to stack -5 push...")
05:04, 30 January 2026 ‎Harmonity (hist | edit) ‎[906 bytes] ‎PrySigneToFry (talk | contribs) (Created page with "Harmonity is designed by PSTF to "massificate" Raymond. = Conversion sheet = <pre> μ = mys# ε = greek# ② = aexp Š = string ! and ¡ = True and False ⍜ = bool Λ = function □ = list ⌒ = pair Ⓘ = comp Ⓩ = type ✝ = any ○ = None ⌗ = typeof ⎕ = stdinout ⌺ = stderr ⍞ = msginout ⌻ = stdlog ⍁ = eraser ← = <- Algebraic symbols are keeped, but √ is abandoned. ⍬ = NULL (b)↘{a}↖ = while b do a end b?a:c = as is b?a:c(where both a and c a...")
13:57, 29 January 2026 ‎Raymond (hist | edit) ‎[7,140 bytes] ‎PrySigneToFry (talk | contribs) (To be continued...)
22:07, 28 January 2026 ‎Albuquerque language (hist | edit) ‎[9,892 bytes] ‎RikoMamaBala (talk | contribs) (Created page with "'''Albuquerque language''' is a programming language made from the entirety of Albuquerque lyrics. You can add syntax to chunks of the song, like: I said, "You got any [x] donuts?" He said, "No, we're outta [x] donuts" can mean some instruction with an argument of x. There are no rules except no uncomputable instructions nor deleting someone's work. ==Instructions== <pre class='rectwrap'> Way back when I was just a little bitty boy Living in a box under the stairs in...")
19:09, 28 January 2026 ‎Print("Hello, World!")/Eviledon program) (hist | edit) ‎[2,539 bytes] ‎RikoMamaBala (talk | contribs) (Created page with "The program is tediously long, like 244KB in size. Luckily, the LZMA compression made it 1696 bytes! So we have a Python script that generates the original program: print(__import__('lzma').decompress(__import__('base64').b64decode(b'XQAAAQAavAMAAAAAAAAhmgkm/hKnNnk9jNYPXoIfQHGCg1GgwpX6NUYzSuB+/9UbwcHyh5PD2GaokPvnL1Y0jr6qEvHAj83/C7FXt3D5oRcC4xmpIlVrNCX0JVRZ1ZQ4X3kjppEoO41m4ybwLxIZK6tc6xi4KoVWxGazikfruyH4k7GMkWJ0/uQvEnOL+a0lE+0WzCylFdTeC7HTdxRKa5fe6py2y8uNIuKXRewtYX9f2EqR...")
14:40, 28 January 2026 ‎((()))(((())))=5 (hist | edit) ‎[1,248 bytes] ‎Dragoneater67 (talk | contribs) (create)
02:06, 28 January 2026 ‎RedDust (hist | edit) ‎[5,810 bytes] ‎Synt-xError (talk | contribs) (Created page with "{{infobox proglang |image=File:Reddust logo.png |paradigms = imperative, register-based, virtual assembly |author = [https://github.com/synt-xerror SyntaxError!] |year=2025 |memsys=register-based |dimensions=one-dimensional |class=virtual machine language |majorimpl=RedDust VM |influence=[https://en.wikipedia.org/wiki/Assembly_language virtual assembly language] [https://en.wikipedia.org/wiki/Bytecode bytecode] [https://en.wikipedia.org/wiki/CHIP-8 CHIP-8] |website...")
14:01, 27 January 2026 ‎LongFish (hist | edit) ‎[1,685 bytes] ‎Restruct. (talk | contribs) (added the page)
09:25, 27 January 2026 ‎Tina (hist | edit) ‎[18,228 bytes] ‎Oscarlo (talk | contribs) (Created page with "'''Tina''' ('''T'''his '''i'''s '''n'''ot '''a'''ssembly) is an esoteric programming language with an assembly-like syntax and a deliberately overpowered “ALU matrix” instruction format. A Tina program is assembled into a linear list of instructions plus an initial memory image, then executed on a simple machine with unbounded signed integer cells and non-negative addresses. A reference interpreter/assembler is implemented in Python. ==Etymology== “Tina” is...")
20:34, 24 January 2026 ‎SSEG (hist | edit) ‎[1,066 bytes] ‎LeCo13 (talk | contribs) (Created page with "S²EG or SSEG is an programming language written in only 1s and 0s made by laptopcoder11 ''(idk how to properly make pages, so pls improve if u can)'' instructions: {| class="wikitable" |- ! instruction !! functionality |- | 000n || decrease register-n |- | 001n || increase register-n |- | 010n || subtract reg0 - reg1 and put the answer in reg-n |- | 011n || add both registers and put the answer in reg-n |- | 100nAAAA || move instruction pointer to n(0:l...")
19:31, 24 January 2026 ‎N-Type (hist | edit) ‎[3,160 bytes] ‎Yayimhere2(school) (talk | contribs) (Created page with "'''Not My Type''', named after its lack of actually being a type based language, yet still "claiming" to be, is an esoteric programming language created by User:Yayimhere, based on the <code>N -> (N -> N)</code> type notation. == Definition == Not My Type uses two types of objects. '''Types''', and '''Creators'''. A '''Type''', acting like a function, has one or more definitions, written as <code>x -> y</code>(left associative). This definition defines the case when...") originally created as "Not My Type"
19:04, 24 January 2026 ‎Set Trickery (hist | edit) ‎[515 bytes] ‎A() (talk | contribs) (Created page with "Set Trickery is a set-based programming language that User:A() made. == Commands == {| class="wikitable" |+ Commands |- ! Command !! Explanation |- | <code>(null) || empty set |- | <code>(set{}) || set |- | <code>(a/.../) || define a as ... |- | <code>[a:b] || add a to set b |- | <code>(#a;b#) || remove a from set b |- | <code>*comment* || Comment |- | <code>(b$a$[c]) || is a function that does a with inputs c |- | <code>(!a!) || return a |- | <code> (a%b,c%) </code>...")
17:46, 24 January 2026 ‎Bfppp (hist | edit) ‎[745 bytes] ‎Sourceguy (talk | contribs) (Created page with "'''Bfppp''' is an esolang created by User:Sourceguy. It's an extension of Brainfuck. It contains a standard library, that makes coding in it a bit easier. == Instructions == '''Bfppp supports all Brainfuck instructions, and includes some new ones:''' * # - Comment * @ - reset current cell * $ - output current cell as number * %''name''{''arguments''}(''body'') - define a function * ?''name''{''arguments''} - call a function * = - set current cell to the next char...")
03:42, 24 January 2026 ‎Endfield (hist | edit) ‎[1,800 bytes] ‎Cleverxia (talk | contribs) (Created page with "Endfield is yet another esolang created by User:cleverxia. It's a brainfuck derivative. The commands are due to the fact that when you pay to the game Endfield, it deduces money from a random account, and you can login on your account on other devices wit cache files, and the pool there requires 500 diamonds instead of the customary 160. ==Commands== (note that cells are unbounded) {| class="wikitable" !Command !Description |- | style="text-align:center"| <code>>...")

New pages

Navigation menu

Search