New pages
Jump to navigation
Jump to search
- 21:56, 28 October 2025 BFASM/Examples (hist | edit) [13,037 bytes] Waffelz (talk | contribs) (Created page with "<big><big><big><big><big>⬑</big></big><span style="vertical-align: 3px;"> BFASM</span></big></big></big> = About = This page contains BFASM examples whose compiled code is too large to include in the main page. == FizzBuzz == === BFASM Code === set %x 1 set %= 0 set %> 0 set %< 1 set %i 1 set %h 0 set %t 0 set %z 0 set %_F 70 set %_i 105 set %_z 122 set %_B 66 set %_u 117 set %_\n 10 set %v 0 set %ones 0 set %tens 0 set %hund 0...")
- 18:18, 28 October 2025 3 commands :) (hist | edit) [903 bytes] Ϫ (talk | contribs) (Created page with "'''3 commands :)''' is a cell-based language with 3 commands and 3 cells made by ~~~. It is designed to be as usable as possible with that limitation. ==Commands== {| class="wikitable" | 1 || Increment cell 1 and put the user's input into cell 2. |- | 2 || Flip the sign of the value in Cell 1. If Cell 3 isn't 0, output its value. If it IS 0, then jump over the next command. |- | 3 || Shift all cells. Cell 1 is sent to cell 2, cell 2 is sent to cell 3, and cell 3 is sent...")
- 15:48, 28 October 2025 Underflow (hist | edit) [1,979 bytes] Yayimhere2(school) (talk | contribs) (Created page with "'''Underflow''' is an esolang created by User:Yayimhere, to make a Pushdown automata able to solve the problem that it is unable to do the problem with a b and c. it is most likely Turing complete, however there is currently no proof of this. == Memory == there is an unbounded registry called R, a string called S, two stacks called X and Y, and a boolean called B. on every iteration, the bottom symbol of X is pushed to Y. If there ever is stack underflow, B will...")
- 13:17, 28 October 2025 Nope. without a quine including cheating ones but I was extra smart and let the one Quine not be a Quine (hist | edit) [436 bytes] Yayimhere2(school) (talk | contribs) (Created page with "'''Nope. without a quine including cheating ones but I was extra smart and let the one Quine not be a Quine''' is Nope. without a quine including cheating ones, with a short singular change == the change == originally, the message given for any program that has a "Nope." within it, was a quine itself, as IT, had the word "Nope.". however NOW, that message as a program just returns "Nope.". which makes Quines, imposssibleeeeeeee.")
- 20:40, 27 October 2025 Lindenmayer (hist | edit) [1,241 bytes] Calculus is fun (talk | contribs) (Created Lindenmayer)
- 14:46, 27 October 2025 Dango (hist | edit) [3,823 bytes] RaiseAfloppaFan3925 (talk | contribs) (1/3 assembled)
- 23:47, 26 October 2025 PizzaScript (hist | edit) [2,789 bytes] Jay (talk | contribs) (Created page with "gh")
- 14:00, 26 October 2025 IEBEL (hist | edit) [1,291 bytes] Esoboring ideas (talk | contribs) (Created page with "IEBEL is an OISC esoteric programming language short for in-equality branch esotering language by [[Esoboring ideas] which doesn't have any interpreters yet ==Memory== Every register has the values of 0-255 ==The instruction== ===Main things=== it is like this: <pre class="rectwrap">ra rb c</pre> c is bigger than -6 it checks if ra=rb if yes then load b into ra (not rb but b) ,and if no then jump to c ===Control negatives=== If the c is negative -5 to -1 then jum...")
- 23:29, 25 October 2025 CARP (hist | edit) [1,701 bytes] TheCanon2 (talk | contribs) (Added CARP)
- 21:51, 25 October 2025 2147483647Funge (hist | edit) [1,944 bytes] Kalavian (talk | contribs) (Created page with "2147483647Funge is a '''2<sup>32</sup>−1'''-dimensional programming language. Each cell is written as its location followed by a command. The language also uses a dimension pointer, a 32-bit integer that represents the axis to be moved. Positive values move across across the positive axis while negative values move across the negative axis. A value of 0 ends the program (cannot move) while a value of -2147483648 (minimum 32-bit integer) is Undefined_behavior|unde...")
- 21:21, 25 October 2025 ZeroByte (hist | edit) [488 bytes] Kalavian (talk | contribs) (Created page with "Category:2025 Category:Zero-dimensional Category:Unusable for programming ZeroByte is a programming language designed for writing other tiny programming languages. A microlang can be implemented in ZeroByte in as little as one byte. ==Syntax== Each function takes up one byte. * <code>q</code> - Prints line of user input All other characters are ignored. ==Implementation== ===Python=== <pre> code = input('code: ') for x in code: if x=='q': print(in...")
- 20:55, 25 October 2025 GenderScript (hist | edit) [1,397 bytes] Kalavian (talk | contribs) (Created page with "Category:2025 Category:Joke languages Category:Cell-based Category:Implemented GenderScript is a tiny transgender esoteric programming language created by Kalavian in 2025. The source code is available [https://github.com/Kalavian112/GenderScript on Github]. GenderScript operates on an array of 65,536 bytes as well as a byte register called "main". All functions are of the form `function: argument`. For reference, `byte` is an unsigned int8 and `int` is...")
- 17:25, 25 October 2025 OverDeathKill (hist | edit) [1,443 bytes] SzymoQwerty (talk | contribs) (Created page with "{{infobox programming language | name = OverDeathKill | paradigm = esoteric | creator = User:SzymoQwerty | year = 2025 | influenced-by = Brainfuck and being sadistic }} '''OverDeathKill''' is an esoteric programming language created by User:SzymoQwerty in 2025. It maps Brainfuck instrctions to ways a human being can die. == Concept == The concept is because me, User:SzymoQwerty, i have a pretty sadistic mind and i got some dirt...")
- 16:05, 25 October 2025 GRG (hist | edit) [2,902 bytes] Yayimhere2(school) (talk | contribs) (Created page with "{{WIP}} '''GRG''' or '''Growth Rate Growth''' is a semi-theoretical esolang created by User:Yayimhere(as In not all formal specifics have been defined), in his search for the computational class of UnCompetition. it is a combination of a single growth rate function, a few optional Uncompetition, and in the Unrepetition oriented version, some regex. GRG is most likely approximately as useless as Uncompetition for normal program, but, who knows!!! Altho...")
- 10:27, 25 October 2025 Unrepetition (hist | edit) [1,825 bytes] Yayimhere2(school) (talk | contribs) (Created page with "'''Unrepetition''' is a combination of [https://en.wikipedia.org/wiki/Regular_expression Regex], and UnCompetition. the original idea was created by User:Ϫ. == How it functions == fundementally, UnCompetition and Unrepetition function the same, both generating a tree of programs in their own respective language(so no, Unrepetition does not generate UnCompetition programs, it generates Unrepetition programs). <br> <br> however, in Unrepetition, b...")
- 07:02, 25 October 2025 FUnctional staCK (hist | edit) [13,887 bytes] CatCatDeluxe (talk | contribs) (Created page with "'''FUnctional staCK''' is a minimal staCK based programming language created by User:CatCatDeluxe that shares some traits with FUnctional languages. For short, it can be called FUCK, a perfectly innocuous name. Despite the perfectly innocuous name, this is actually quite a serious project, with an interpreter in Zig currently in the works. The interpreter is also for a school project, where this language will probably be referred to by a better name. FUCK's main fe...")
- 22:29, 24 October 2025 Fat pointer (hist | edit) [1,948 bytes] Corbin (talk | contribs) (Stub for a recurring concept that isn't properly addressed on WP.)
- 10:25, 24 October 2025 2I1IF (hist | edit) [1,415 bytes] Yayimhere2(school) (talk | contribs) (Created page with "{{WIP}} '''2I1IF''' is a family of languages, based off of Uncompetition. == Concept == For a language to qualify for being a part of 2I1IF, it must be able to be interpreted as "An infinite amount of inputs, and a single universal function", and "An infinite amount of functions, and a single universal input(which can be considered no input), however it must be able to generate multiple different outputs". One such language is ofcourse, Uncompetition. The first c...")
- 19:46, 23 October 2025 Vixen (hist | edit) [6,413 bytes] Corbin (talk | contribs) (WIP for my fork of Smalltix. I've included the fundamental methods if anybody else is interested.)
- 14:16, 23 October 2025 Utral (hist | edit) [2,174 bytes] Yayimhere2(school) (talk | contribs) (Created page with "'''Utral''' is an esolang created by User:Yayimhere, to answer her very important question, "What if there was a negative null", and this answer's this question! It is based in Lambda Calculus, however that is only in underlying calculation, and not everything is a function, nor Is the main concept of Utral made specifically with Lambda Calculus in mind. == Etmology == Utral's name comes from the idea of an un-neutral, as null is a sort of neutral value...")
- 12:38, 23 October 2025 Exec (hist | edit) [2,077 bytes] None1 (talk | contribs) (Created page with "{{lowercase}}'''exec'', an esolang invented by User:None1, is similar to Python. ==Type system== Unlike Python, there's only one type in exec: {{cd|str}}. This type is way more powerful than the one in Python in the following ways: * Character codes: Character codes in Python strs must be within range(0x110000), but "character" codes in exec strs can be any signed integer. * Subscript modification: Python strs don't support subscript modfication, but exec strs do...")
- 09:27, 23 October 2025 B9 (hist | edit) [8,401 bytes] JIT (talk | contribs) (Created page with "B9 is an esolang by User:JIT, 2025 ''"What if... OH GOD NO! AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"'' : -User:JIT, 2025 <blockquote> ''It's perfectly benign! don't read the text above this, its fine! :DDD :-User:JIT, 2025'' </blockquote> {| class="wikitable" |+ :DDD |- ! commands !! what they do |- | 0- || make the next pear a variable instead of a pear and put the input value in the pear mod 7 |- | 1- || make the next pear a variable instead of...")
- 18:33, 22 October 2025 EarScript (hist | edit) [13,140 bytes] Agecaf (talk | contribs) (EarScript is a programming language focused on the manipulation of integers.)
- 18:26, 22 October 2025 Crypten (hist | edit) [1,893 bytes] Ϫ (talk | contribs) (Started the page)
- 09:55, 22 October 2025 UnCompetition (hist | edit) [6,531 bytes] Yayimhere2(school) (talk | contribs) (Created page with "'''UnCompetition''' is an esolang created by User:Yayimhere, with the focus of trying to have an undecidable question, instead of actually being a programming language. == Description == UnCompetition consists of a tree, full of programs in its own language. these programs, are all "solutions" to another program. programs are formatted like "solve for x" style questions. when a program P1 is ran, it will start the tree, where every nodes holds a program that meets a...")
- 21:45, 21 October 2025 Izeva (hist | edit) [922 bytes] Ivava (talk | contribs) (Created page with "{{WIP}} :'' Does not apply to '''IZEVA - International Council on Clean Transportation''' and other '''Izeva''' is easy(Maybe. It hasn't cycles) character-by-character esolang, has IO based on single accumulator. Hasn't good or useful commands. The only pleasant thing is an easy "Hello, World!", that in one command. ==Commands== {| ! Command!! Description |- | <code>v</code> || Countdown '' (without timeout, but with linefeed) '' |- | <code>H</code> || Hello, Wor...")
- 19:01, 21 October 2025 Adofaiscript (hist | edit) [3,197 bytes] Ϫ (talk | contribs) (Started it)
- 17:51, 21 October 2025 Manfred von Thun (hist | edit) [342 bytes] Corbin (talk | contribs) (Stub for Von Thun.)
- 17:43, 21 October 2025 Quote (hist | edit) [447 bytes] Corbin (talk | contribs) (Stub a common concept. Not sure of the best name for this article.)
- 13:54, 21 October 2025 Mango (hist | edit) [6,694 bytes] RaiseAfloppaFan3925 (talk | contribs) (Created page with "{{Template:Stub}} Mango is an unimplemented programming language by User:RaiseAfloppaFan3925 inspired by modern 2010-20s slang. {{infobox proglang | name = Mango | paradigms=imperative, procedural | author = User:RaiseAfloppaFan3925 | year = 2025 | class = Turing-complete | influence = Bussin X | files = <code>.mango</code>, <code>.tuff</code> }} == Keywords == Here is a list of all of the keywords so far and what they do. {...")
- 00:38, 21 October 2025 Functional paradigm (hist | edit) [1,821 bytes] Corbin (talk | contribs) ("Moving" a category page to main namespace, per IRC discussion.)
- 18:50, 20 October 2025 Yoktoki (hist | edit) [4,449 bytes] Ivava (talk | contribs) (Created page with "{{WIP}} '''Yoktoki''' is an esoteric programming language developed for specialized cyber-related applications. The language was created by a school student known online as Ivava (User:Ivava), who designed it with the intention of providing a simple yet flexible tool for tasks in cyber policing and related domains. While Yoktoki includes a small set of core commands for data manipulation and control flow, it also contains several non-essential or “experimental”...")
- 12:46, 20 October 2025 $Lang (hist | edit) [3,723 bytes] Intiha (talk | contribs) (Created page with "Note: Not to be confused with the word "Slang" == Overview == Dollarlang (or $Lang) is a minimalistic esoteric programming language by User:Intiha where programs consist entirely of `$` symbols and the `#$#` sequence. It is intentionally verbose: each ASCII character requires repeated `$` symbols, making even simple programs extremely large. == Syntax == * `$` – Partial increment. * **1,600 `$` symbols = 1 increment** toward the ASCII value of the current charact...")
- 21:07, 19 October 2025 F calculus (hist | edit) [1,505 bytes] C++DSUCKER (talk | contribs) (Created page with "F Calculus is a Combinatory logic system with as only combinator 'F' It was devised to see how simple a Combinator could be when it has to both access an oracle and do logic. it is also inspired by SE calculus == Description ==: <code>F i => if i has a beta normal form then λx.λy.λz.xz(y(λw.z)) else λx.x</code> Function application through . Although it does not matter, you can use brackets Spacing allowed but not needed. == Examples == ==== Tromp's & mtve's...")
- 19:35, 19 October 2025 Smalltix (hist | edit) [1,155 bytes] Corbin (talk | contribs) (Stub for a language that is probably going to eat my brain. I will explain the core concept in a separate page.)
- 19:31, 19 October 2025 Woosh (hist | edit) [385 bytes] Corbin (talk | contribs) (Stub for an independent invention of executables-as-methods.)
- 11:45, 19 October 2025 Alphacode (hist | edit) [1,183 bytes] Esolangist (talk | contribs) (Created page with "Alphacode is an esolang made by User:Esolangist. It is based on the alphabet. == Commands == <code> a [object] -- pushes [object] on the stack b [label] -- a label. can be used for comments or as a forever loop c [label] -- jumps to b [label] d -- pops the top object off the stack and outputs it as a number e -- pops the top object off the stack and outputs it f [number] -- basically just "if" in javascript. if the number is 0, skip to g. otherwise, continue cod...")
- 07:47, 19 October 2025 Yes/No (hist | edit) [11,913 bytes] Intiha (talk | contribs) (Created page with "=== Overview === Yes/No is a minimalistic esolang made by User:Intiha where every program consists solely of the words **Yes** and **No**. Programs are sequences of these words, and their meaning is derived from binary patterns. ==== Basics ==== * `Yes` = 1 * `No` = 0 A program is interpreted as a stream of bits (`Yes` → 1, `No` → 0), and instructions are defined by fixed-length patterns of bits. === Instructions === Yes/No uses **2-bit instructions**: {| cl...")
- 06:42, 19 October 2025 ThingLangOOP (hist | edit) [1,713 bytes] Intiha (talk | contribs) (Created page with "## Overview ThingLangOOP is a minimal C implementation inspired by ThingLang, which was made by User:Rasa8877. It combines a compiler and runner in a single file, fully compatible with TCC. Supports variable assignment, printing, loops, events, and comments. ## Commands / Keywords THIS <name> IS <value> ─ Assign a value (number or string) to a variable. PRINT <value_or_variable> ─ Print the value of a variable or a string literal. NOTAGAIN <n> ... TI...")
- 06:01, 19 October 2025 Non-Loop FizzBuzz (hist | edit) [1,467 bytes] TheSpiderNinjas (talk | contribs) (Created page with "'''Non-Loop FizzBuzz''' is like FizzBuzz but instead of doing a range of number you indefinitely ask the user for input and then print the FizzBuzz number. == Example == === Code: === <pre> while True: i = int(input("Enter a number: ")) if i % 15 == 0: print("FizzBuzz") elif i % 5 == 0: print("Buzz") elif i % 3 == 0: print("Fizz") else: print(i) </pre> === Output: === <pre> Enter a number: 4 4 Enter a number: 15 FizzBuzz Enter a number: 1 1...")
- 11:43, 18 October 2025 Vesob (hist | edit) [5,153 bytes] Ivava (talk | contribs) (Created page with "{{Stub}} {{WIP}} {{infobox proglang |name=Vesob |year=2025 |author=User:Ivava |refimpl=Python }} '''Vesob''' is easy minimalistic character by character esoteric programming language for some popular examples and output, if else.<br>Vesob helps in IP things with something, because it also can output programmer's computer/wiFi own IP by ipify, or by name.<br>Vesob is just typical esolang, daughter to HQ9+, just adding some commands __TOC__ ==Commands== {| cla...")
- 11:30, 18 October 2025 WY-Anglis (hist | edit) [8,205 bytes] PrySigneToFry (talk | contribs) (Created page with "WY-Anglis is designed by PSTF, is the Englishized version of wenyan. == Code Sample == All the commands are equivalent to Wenyan, and now I don't want to write them. If you can program in Wenyan and LOLCODE, you can also program in WY-Anglis. === Hello, world! === <pre style='font-family:Times New Roman, serif;'> I have a string. It is *"Hello, world!"*. Output it. </pre> === 99 bottles of beers === <pre style='font-family:Times New Roman, serif;'> I have a number. It...")
- 08:57, 18 October 2025 干! (hist | edit) [3,292 bytes] PrySigneToFry (talk | contribs) (Created page with "干! is the Chinese version of I fuck, you fuck, and is designed by PSTF. == Commands == === Variable Definition === <pre> 有个叫 X 的大混账 </pre> Define and initialize X. Any variable is assigned a value of 0 at the beginning. === Increment and Decrement === <pre> 我操了 X </pre> Set X to the value of X+1. <pre> 我淦了 X </pre> Set X to the value of X-1. In the original version, values less than 0 are treated as 0, but in this programming language...")
- 22:18, 17 October 2025 1 Bit, an eight byte (hist | edit) [210 bytes] Tommyaweosme (talk | contribs) (Created page with "1 Bit, an eight byte is the worst programming language. There are no quines. == Commands == 0 - output 1 1 - output 0 That's it. == Programs == === 1 === 0 === 0 === 1")
- 18:15, 17 October 2025 -hacker (hist | edit) [1,228 bytes] Ivava (talk | contribs) (Created page with "{{stub}} '''-hacker''' is personal User:Ivava 's project, that was posted as esoteric programming language. ==Why "-hacker"? == Well.. Simply.. Shorter.. Well, if you don't like non ethical hackers, you can use it as a game..? -hacker is joke esoteric language, that only decrements and outputs the current accumulator named as "the_Number_of_Hackers" ==commands== {| class="wikitable" !Command !Description !Shorter description |- |<code>0</code> |Define the ac...")
- 12:36, 16 October 2025 Subscratch (hist | edit) [13,042 bytes] Zapcircuit (talk | contribs) (Created page with "'''subscratch''' is an OISC language invented by User:Zapcircuit. its main purpose is for codegolfing games in scratch. its most interesting feature is its scratch implementation, which uses very few scratch blocks. ==implementation== to the right is an image of the subscratch interpreter in scratch. thumb|since scratch is proprietary, this screenshot has been replaced by a hand drawn version note: if there are any discrepanci...")
- 02:40, 16 October 2025 Interbflang (hist | edit) [2,191 bytes] TheBigH (talk | contribs) (Created article.)
- 21:38, 15 October 2025 Joy (hist | edit) [2,148 bytes] Fpstefan (talk | contribs) (Created page with "{{stub}} '''Joy''' is a concantaive programming language, created by [https://concatenative.org/wiki/view/Manfred%20von%20Thun Manfred von Thun]. It supports function-level programming by using a linked list as a stack to supply the functions with parameters. The lists in the program code are called quotations and the functions are often used as combinators. The theory of the programming language was very [https://hyp...")
- 22:26, 14 October 2025 Important lesbian virtual machine (hist | edit) [15,473 bytes] RocketRace (talk | contribs) (important lesbian virtual machine)
- 03:10, 14 October 2025 Ab (hist | edit) [2,535 bytes] Akirademenech (talk | contribs) (Created page with "'''Ab''' (or, alternatively, '''ab''' or even '''aB''', depending on the taste of the writer) is an esolang proposed by User:Akirademenech. It is directly inspired by BitChanger (using only binary values and less instructions than Brainfuck) and draws symbols and states naming patterns from Turing machines as usually presented in textbooks (symbols in the tape are letters and, in formal grammar, terminal symbols are uppercase letters and nonter...")