nyuuzyou/wikis huggingface dataset:
INJUQ

INJUQ (INcrement and JUmp if eQual) is an OISC By User:ChuckEsoteric08.
==Specification==
It has memory-mapped commands, with them being at the start of a memory and everything else being 0.
 a b c d
Increment memory address a by memory address b, storing result in a
and if result is equal to memory address c goto memory address d. If you jump to address -1 halt
==I/O (optional)==
If b is -1 then ask for user input.
If b is -2 then output memory address.
I/O could be character-based and integer-based
==Examples==
===Print "HI" ===
Works for character-based I/O
 -3 -3 -3 8
 72 73 0 0 
 4 -2 4 12
 5 -2 5 -1
===Adder===
Works for integer-based I/O. Inputs two numbers and outputs their sum:
 16 -1 16 4
 17 -1 17 8
 16 17 16 12
 16 -2 16 -1
 0 0 0 0
===Truth-machine===
Works for integer-based I/O
 12 -1 13 8
 12 -2 12 -1
 12 -2 13 8
 0 1 0 0
===Looping counter===
This program furnishes an infinitely operating looping counter:
 37 34 37 4
 38 -2 38 8
 37 33 36 16
 37 33 37 0
 39 -2 39 20
 36 34 36 24
 37 35 32 0
 37 33 37 24
 0 0 1 -1
 1 0 42 10
==Interpreter==
* Common Lisp implementation of the INJUQ programming language.
Category:Languages
Category:OISC
Category:Turing complete
Category:Turing tarpits
Category:Implemented
INTERCAL but way worse

INTERCAL but way worse is made by User:Yes and is exactly what it sounds like.
== New stuff ==
* You now need to say PLEASE 10 times, equally spaced, every 10 seconds of execution.
* The execution has a speed of 1/2 a line a second but will be 1 per second if line is shorter than 10 characters
* You must use the EDBI-whatever character set
* The letter x is not allowed
* Numbers must be input as a 5 bit ternary number
* I'll think of more later
Category:Languages
IOFuck

IOFuck is an esolang invented by User:None1.
==Commands==
In this esolang, there are only 3 commands.
 Input
Input a line of string.
 Output
Output the most recent string that was inputed.
 Forever(
 CODE
 )
Do CODE forever.
It is case sensitive
==Example Programs==
===Cat Program===
 Forever(
 Input
 Output
 )
===One time cat===
 Input
 Output
===Never terminate===
 Forever(
 )
==Interpreters==
===Python===
# This is an interactive interpreter
# WARNING: The interpreter will crash if you attempt to run Output command before Input command
def i(c):
 global s
 if c=='Input':
 s=input()
 if c=='Output':
 print(s)
 if c=='Forever(':
 k=[]
 while 1:
 C=input('>> ')
 if C==')':
 break
 k.append(C)
 while 1:
 for j in k:
 i(j)
while 1:
 i(input('> '))
Category:Languages
Category:Unusable for programming
Category:Joke languages
Category:Implemented
Category:Pseudonatural
Category:Low-level
IP

IP is a stack-based esolang designed by User:iddi01 in which programs looks somewhat like IP addresses.
== Description ==
The only valid commands are the digits, ".", and "-".
Dots slices each program into sections, in which the sequence of numbers will be converted into a single integer for use with several different commands.
=== Commands ===
. Pops an item from the stack, check if it's equal to the section before the ".", then push it back. If not equal, skip the next instruction.
- Indicates the section is a negative number
0 Pushes the current section to the stack
1 Pops an item from the stack and prints it as number/ASCII (up to the implementation)
9 Pops two items (a, b) from the stack and push back a - b
Other even digits - Go (digit) characters forward
Other odd digits - Go (digit) characters back
== Examples ==
All examples assume input is already stored in the stack.
=== Hello, World! ===
(not yet)
=== Cat program ===
 1113
=== Truth-machine ===
 40.0.82.01.3
=== Fibonacci sequence ===
(not yet)
=== Looping counter ===
(not yet)
==== Looping but not counter ====
 01.3
=== Quine (using number output) ===
 2001
== Computational class ==
Because both storage and programs are unbounded in IP, it could be Turing-complete. However a proof would be extremely difficult to make, since it's extremely difficult to program anything with the slightest bit of complexity in IP.
== Implementation ==
=== Python (moderate) ===
 import copy
 pos = 0
 stack = []
 program = input("Program: ")
 def getsect():
 tempos = pos - 1 if pos > 0 else pos
 while tempos > 0 and program[tempos] != '.':
 tempos -= 1
 tempos2 = copy.copy(pos)
 while tempos2 < len(program) and program[tempos2] != '.':
 tempos2 += 1
 return int(program[tempos:tempos2].replace('.', ""))
 while True:
 try: char = program[pos]
 except IndexError: break
 if char == '.':
 try:
 temp = stack.pop()
 if temp != getsect():
 pos += 1
 stack.append(temp)
 except IndexError: ...
 elif char == '0':
 stack.append(getsect())
 elif char == '1':
 try: print(chr(stack.pop()), end="")
 except IndexError: print(' ', end="")
 except ValueError: print(' ', end="")
 elif char == '9':
 try: stack.append(stack.pop() - stack.pop())
 except: ...
 elif char == '-':
 ...
 elif int(char) % 2 == 0:
 pos += int(char) - 1
 elif int(char) % 2 == 1:
 pos -= int(char) + 1
 if pos < -1: break
 pos += 1
 
Category:Languages
Category:Low-level
Category:Implemented
Category:2024
Category:Stack-based
Category:Unknown computational class
IPAfuck

IPAfuck is a Brainfuck language based on IPA.
== Syntax ==
 Caption
IPAfuck 	Brainfuck(pseudo)
i 	>
y 	<
e 	+
ø 	-
ɛ 	. (Write the data as a Character)
œ 	: (Write the data as a Integer)
æ 	, (Read the data as a Character)
a 	~ (Read the data as a Integer)
ɶ[Value]	=[Value] (Set data to value)
ɪ 	[
ʏ 	]
== Programs ==
=== Hello, world! ===
 ɶ['H']ɛɶ['e']ɛɶ['l']ɛɶ['l']ɛɶ['o']ɛɶ[',']ɛɶ[' ']ɛɶ['w']ɛɶ['o']ɛɶ['r']ɛɶ['l']ɛɶ['d']ɛɶ['!']ɛ
=== A+B ===
 œiœɪyeiøʏya
Category:2024 Category:Languages Category:Joke languages Category:Unimplemented
IPAlang

IPAlang is an esoteric programing language designed by User:Bautistaarian (It's W.I.P.)
== Commands ==
 Commands
Appearance	Function
ˈ 	Starts a new thread.
ʒə 	Adds 1 to the cell.
zə 	Adds 2 to the cell.
ʐə 	Adds 4 to the cell.
ʑə 	Adds 8 to the cell.
ʃə 	Subtracts 1 to the cell.
sə 	Subtracts 2 to the cell.
ʂə 	Subtracts 4 to the cell.
ɕə 	Subtracts 8 to the cell.
ta 	Moves the Pointer up.
ʈa 	Moves the Pointer right.
da 	Moves the Pointer down.
ɖa 	Moves the Pointer right.
Example 	Example
Example 	Example
Example 	Example
Example 	Example
Example 	Example
Example 	Example
Example 	Example
Example 	Example
Example 	Example
Example 	Example
Example 	Example
Example 	Example
Category:Languages Category:Works-in-Progress Category:Cell-based
IPVL

IPVL is a programming language invented by User:A which has only 1 command: copy.
==Copy==
The command has this format:
 copy IP
Where IP is any computer IP.
==Example(Infinite loop)==
 Copy 172.68.47.165
Since this computer(which is my computer) is running this program, it goes into an infinite recursion, which makes it a infinite loop.
This can only be used on my computer. Change the IP to make it run on your computer!
==Computational Class==
Of course it is Turing-complete!
 Copy IP
When the IP is running a Brainfuck interpreter.
I don't know who is running one right now!
Category:Turing complete
Category:Turing tarpits
Category:Languages
IRPT

IRPT is an esoteric programming language based off of IRP
It was made in 2022 by User:Yes, and stands for "Internet Relay Programming TalkPage"
== Examples ==
=== Hello, World! ===
Please say Hello World --EsolangUser15 (talk) 18:30, 8 July 2022 (UTC)
Hello World --AIDS (talk) 18:31, 8 July 2022 (UTC)
As you can see, the programmer approaches with the utmost respect. Ensure this to prevent..
=== THIS ===
PLEASE SAY "HELLO WORLD" WITHOUT THE QOUTES DINGUS --NotAnEso (talk) 22:00, 17 June 2022 (UTC)
Error number 15: DONT BE A JERK TO YOUR COMPILER YOU [beeeeeeeeep] --compiler (talk) 22:13, 17 June 2022 (UTC)
So please treat the users with respect
=== 99 Bottles of Beer ===
It has been shown that as long as it is possible in text, any program can be done.
Can you please output the lyrics to 99 Bottles of Beer on the Wall? --ais524 (talk) 19:35, 8 August 2022 (UTC)
no --compiler (talk) 19:36, 8 August 2022 (UTC)
neveermind.
Interpreter here:
ISEW2C

ISEW2C (It Is Esolang With 2 Commands) is an esolang for imitating a Turing machine, comprehending merely two commands, and invented by the User:ChuckEsoteric08!
==Commands==
ISEW2C's command set includes two members, identified in a euonymous manner with the tally of their expected arguments. Please note that commands, being possible goto targets, are enumerated starting with one (1).
Command	Description
3 x y z	If x does not equal 0, change the cell at position z to the sum of x and y and print the new cell value as a number. If x equals 0, set the cell at position z to 0.
2 x y 	If the cell at position x does not contain 0, goto the command at position y. If the cell at position x contains 0, set its value to the user input.
==Turing-Completeness==
Turing-completeness is conceivable, as programs operate on a very long tape and infinite loops can be realized. This language would also be considered a Turing tarpit if so.
==Examples==
===Number sequence===
This program prints the numbers 1, 2, 3, 4, and 5.
 3 1 0 0
 3 2 0 0
 3 3 0 0
 3 4 0 0
 3 5 0 0
===Infinite loop===
This program prints the number 1 in an infinite loop.
 3 1 0 0
 2 0 1
==External resources==
* Common Lisp implementation of the ISEW2C programming language.
Category:Languages
IT

IT is a programming language that uses it to do stuff
== Syntax ==
 I will use code highlighting for some reason
 it [It]+ - a var
 it [It]+ [[it]+|it [It]+|it [iT]|IT [It]] - set a var
 it [iT]+ - a function input
 iT [It]+ [[[[iT]+] ]+]? IT - a function with inputs or no inputs
 It [[it [iT]+]|[it [It]+]|[IT [IT]+]]? - end a function with outputs or no outputs
 IT [It]+ - refer to a function
 IT IT [It]+ [[IT [It]+|this|it [It]+|it [iT]+]+] - run a function
 IT it [comment] - a comment
== Examples ==
 IT it identity function
 it It it
 IT It iT IT
 It it It
 IT IT It it It
 IT it that is going to return it
ITERATE

ITERATE is a programming language designed to be almost as powerful as popular programming languages without actually being Turing complete. It was introduced in a YouTube video by User:Truttle1 in 2022 to debunk the popular YouTube videos falsely claiming that a program that can do basic addition is Turing complete. In many ways it is like the Douglas Hofstadter BlooP language, with all loops being finite.
==External links==
* Truttle1's video disproving the Turing completeness of the "computer" in Super Mario Maker and introducing ITERATE
Category:Languages
Category:2022
ITM

ITM or idiots turing machine created by alanmalan in the 7 de ago. 2022, the interpreter was made as to be a brainfuck interpreter however the idea changed with time.
github link: here
or you can find the updated and rewriten version here
documentation provided in github:
Idiots Turing Machine 
esolang by alan malan
how does it works?
it is based in the esolang brainfuck, it has a 1 dimentional tape (represented by the tape array) and a pointer that points the curent cell
and can change the curent cell value. and comands can work in diferent ways depending on the curent cell value
cells wrap around at 255 to 0, program never stops running until the interpreter is terminated or the code specifies so.
basic comands: 
 Basic tape functions
< :: moves pointer to the left
> :: moves pointer to the right
+ :: adds 1 to the curent cell
- :: subtracts 1 from the curent cell
[ and ] :: conditional loops, working the same as in brainfuck
{ and } :: conditional loop, only executes if the value of the cell is 0
 I/O
. :: outputs the value of the curent cell as a character (based on ascii)
: :: outputs the value of the curent cell as a integer
, :: waits till user input and stores it in the curent cell as a integer
 Halting
x :: stops the program
& :: stops the program if the curent cell value is over 0
$ :: stops the program if the curent cell value is 0
 jumping
# :: skips the next comand if the value of the curent cell is over 0
\ :: marks the current adress in the code for later
/ :: goes to the marked part in the code
@ :: skips the next comand if the value of the curent cell is 0
% :: jumps to the instruction coresponding the value of the curent cell
programs are limited to 90 characters of lenght (gowing to be extended soon)
the interpreter is only 5 mb big
==External resources==
* GitHub
* 
Category:Languages Category:Cell-based Category:Implemented Category:2022
ITMR

ITMR, ITM reborn, ITM Redux
ITMR Was created by user:Alanmalan. the link to the github page can be found here
Due to limitations in the interpreter, all code must be in a single line
==Commands==
Command 	Description 	
Commands	Commands 	Commands
> 	Moves the pointer foward one space in the tape 	
< 	Moves the pointer back one space in the tape 	
+ 	Adds one to the current cell 	
- 	Subtracts one from the current cell 	
[ 	Saves the current code position to be called back later 	
] 	Calls back to the most recently saved code position if the current cell's value is non zero	
. 	Prints out the value of the current cell 	
: 	Prints out the value of the current cell in ascii 	
, 	Request a single character input from the user 	
& 	Skips the next command in the code if the value of the current cell is non zero 	
% 	Sets the value or the current cell to a random number betwhen 0 and 255 	
$ 	Skips to the code position equivalent to the number on the current cell 	
===truth-machine===
,------------------------------------------------[.]
Automaticaly converts ascii numbers into numbers
=== Hello world program ===
++++++++[->++++++++<]>++++++++:
>++++++++++[->++++++++++<]>+:+++++++::+++:>>+++++[->++++++<]>++:[-]<<
+++++++++++[->+++++++++++<]>--:<<:>>>++++++++++[->++++++++++<]++[->+++++<]>++++:
<<<<---:>>>>>++++++++++[->++++++++++<]>:
Prints out "Hello world"
Category:Cell-based Category:Turing complete Category:Brainfuck derivatives Category:Low-level Category:2024 Category:Languages
I Refuse

I Refuse is an esoteric programming language made by User:Hexahedron1 that refuses to output what you wait it to and instead outputs anything but whatever you want it to. 
To write a program in the language, simply enter its intended output:
Hello, World!
But the language will output
H/59a
The output uses the program as its seed.
It is theoretically possible to output the thing you need, but you would need to find the correct seed which is extremely hard to do.
== External links ==
* Official implementation in C++: https://github.com/hexahedron1/irefuse
Category:Languages
Category:Unusable for programming
Category:Output only
Category:Joke languages
Category:Implemented
I Wanna Be the Esolang

I Wanna Be The Esolang (abbreviated IWBTE) is a two-dimensional programming language based on the ideas of 2D platformers akin to I Wanna Be the Guy. This page is currently unfinished.
In progress are the methods of storage, conditionals, input, output and AI Agent specification.
== Syntax ==
Every IWBTE program describes a platformer level in 2D space using unicode art. An example program may look like the following:
█████████████
█ ▼▼▼ █
█ ○ █
█ ■ ▲▲▲ █
█████████████
each character is a tile that indicates a game element. The possible tiles, as of now are:
 Tiles
Tile(s) 	Name 	Details
█ 	Wall 	Blocks any movement from the player.
▲▼◀▶ 	Spikes 	Kill the player, terminating the program with an error.
^ 	Jump Refresher	Will refresh a single jump for the player, and get removed from the playfield.
═║, box drawing characters	Level trigger 	<Code>║</code> is on and ═ is off. Must be linked to one or more togglable objects using box drawing characters. Does not collide with the player.
░▓ 	Switch walls 	Togglable. ▓ when the level trigger is on, ░ when the level trigger is off.
■ 	Start location	Start location of the player.
○ 	Goal 	Ends the level.
== The AI ==
An IBWBTE program is run by making an AI play the level. The AI will perform any and all tasks necessary to get to the goal, avoiding death if possible. If it cannot reach the goal, it will get as close to the goal as possible before dying or stopping.
A more complete AI spec is pending.
== Implementation ==
Any implementations of IWBTE must provide a way to visualize program flow i.e. There must be a graphical output of the given program, and an animation that shows the AI behaviour.
Ideally this will be done under a Clickteam game engine in order to emulate the physics of IWBTG.
category:Thematic
Category:Two-dimensional languages
Category:2022
Category:Unimplemented
Category:Unknown computational class
I am selfish

I am selfish is an esoteric programming language that solely discusses itself, permitting only variations of the symbol "I":
Symbol	Encoded	Unicode name
I 	\u0049 	Latin capital letter I
Ι 	\u0399 	Greek capital letter iota
І 	\u0406 	Cyrillic capital letter Byelorussian-Ukrainian I
Ӏ 	\u04c0 	Cyrillic letter Palochka
== Language ==
Based on the symbols they are denoted by, instructions operate on one of four registers:
Symbol	Encoded	Register
I 	\u0049 	0
Ι 	\u0399 	1
І 	\u0406 	2
Ӏ 	\u04c0 	3
I am selfish has four instructions: increment, decrement, selection, and jump. Instructions are denoted as a unary number using one of the "I" symbols:
Number	Instruction	Meaning 	Example
1 	Increment 	Increments the register 	I
2 	Decrement 	Decrements the register 	II
3 	Selection 	Skips the next instruction if the register is zero	III
≥4 	Jump 	Jumps to an instruction 	IIII, IIIII, IIIIII
Jump is unconditional; its target is determined by the number of symbols appended to the instruction. Four symbols refer to zero, five to one, six to two, and so on. It counts only instructions that use the same symbols as the jump itself.
Since only "I" symbols are allowed, instructions with different symbols must be used as separators; otherwise, the code would be ambiguous.
The selection and jump instructions together provide conditional jumps sufficient for Turing completeness.
== Examples ==
(Newlines are added arbitrarily.)
=== Infinite loop ===
Never stops:
 IIII
=== Addition ===
Add A and B (A = A + B):
 ΙΙΙІІІІІΙΙIΙΙΙΙІІ
=== Multiplication ===
Multiples A with B (A = A × B):
 IIIΙΙΙΙΙIIІIIIIΙΙΙІІІІІІІІІІΙΙІІІӀӀӀӀӀӀІІIӀІІІІІІӀӀӀΙΙΙΙΙӀӀІӀӀӀӀӀӀІІ
=== Fibonacci sequence ===
Computes the Fibonacci sequence starting with the elements in A and B, continuing until the number of elements specified in C:
 ІІІӀӀӀӀӀӀӀӀӀӀІІΙΙΙIIIIIΙΙӀΙΙΙΙIIIӀӀӀӀӀӀӀIIΙIIIIIӀӀӀІІІІӀӀIΙӀӀӀӀӀӀІІӀӀ
=== Hello World ===
For computing "Hello World" the numbers in the registers must be interpreted as letters. It can achieved by defining a simple alphabet:
Letter	Value
⎵ 	1
d 	2
e 	3
H 	4
l 	5
o 	6
r 	7
W 	8
The following program sets A progressively to 4, 3, 5, 5, 6, 1, 8, 6, 7, 5, 2 which corresponds to "Hello World":
 IΙΙIΙΙIΙΙIΙΙIIΙΙIIΙΙIIΙΙIIΙΙIΙΙIΙΙIΙΙIIΙΙIIΙΙIIΙΙIΙΙIΙΙIΙΙIΙΙ
 IΙΙIIΙΙIIΙΙIIΙΙIIΙΙIIΙΙIΙΙIΙΙIΙΙIΙΙIΙΙIIΙΙIIΙΙIIΙΙIIΙΙIIΙΙIΙΙ
 IΙΙIΙΙIΙΙIΙΙIΙΙIIΙΙIIΙΙIIΙΙIIΙΙIIΙΙIIΙΙIΙΙIIΙΙIΙΙIΙΙIΙΙIΙΙIΙΙ
 IΙΙIΙΙIΙΙIIΙΙIIΙΙIIΙΙIIΙΙIIΙΙIIΙΙIIΙΙIIΙΙIΙΙIΙΙIΙΙIΙΙIΙΙIΙΙII
 ΙΙIIΙΙIIΙΙIIΙΙIIΙΙIIΙΙIΙΙIΙΙIΙΙIΙΙIΙΙIΙΙIΙΙIIΙΙIIΙΙIIΙΙIIΙΙII
 ΙΙIIΙΙIIΙΙIΙΙIΙΙIΙΙIΙΙIΙΙIIΙΙIIΙΙIIΙΙIIΙΙIIΙΙIΙΙIΙΙIIΙΙII
== External resources==
* An interpreter in JavaScript
Category:Languages Category:Turing complete Category:Low-level Category:Turing tarpits Category:No IO Category:Implemented Category:2024
I cannot understand that.

I cannot understand that. is an esolang invented by User:None1.
==Commands==
 Every line is a command, which prints out "I cannot understand that." without quotes.
==Example Programs==
===Print "I cannot understand that."===
 Hello World!
===Quine 1===
 I cannot understand that.
===Quine 2===
 I cannot understand that.
 I cannot understand that.
==Interpreter==
===Python===
 print("\n".join(["I cannot understand that." for i in __import__("sys").stdin.read().split("\n")]))
Category:Languages
Category:Joke languages
Category:Unusable for programming
Category:Output only
I dont feel good and im bored

I dont feel good and im bored or Idfgaib is a esolang created by User:Yayimhere and is name explains why it was made
== how it works ==
a I dont feel good and im bored program is a list of inequalities with arbitrary variables(like x, y, z ect.). and for each solution of x specifically a unicode char will be added to the memory(a string) where the ascii char is x converted to ascii. there are a few special rules: 
* every equation will be solved at the same time(and the appending will be ordered after how high x is ordered highest to lowest
* until the final solution is found the program loops finding solutions to unsolved equations
* it will halt when no more equations can be solved
* if a equation has no solutions it will break out of any loop and continue
* I dont feel good and im bored does not allow negatives
* solutions are found from 0 and up
=== format ===
the equations have this format:
 √A sqrt of A
 A+B a plus B
 A-B a minus B
 A*B a multiplied by b
 A/B a divided by B
 A%B a modulo b
 (A) group expression A
 A=B a equal to b
 A≠B a not equal to b
 A>B a more than b
 A<B a less than b
 A^B a raised to the power of 2
 n√A n'th root of a
Category:Languages
I hate your bf-derivative really I do

This language uses the same eight instructions as bf in an entirely different way for the sole
purpose of causing confusion and irritating bf enthusiasts. Instead of using an infinite amount
of memory spaces, Ihybrid uses two memory spaces, M1 and M2, a count-like stack that's almost an accumulator, and a toggle
function. It does not have input.
The eight symbols perform the following functions initially:
 +: toggles the memory space.
 -: toggles the toggle.
 .: copies the selected memory to the stack and resets if M1.
 ,: copies the stack to the selected memory and resets if M2.
 <: prints the selected memory as an ASCII character.
 >: prints the stack value mod 128 as an ASCII character.
 [: increases the stack value by 2.
 ]: decreases the stack value by 1.
The first memory space can carry any number between 0 and 127 and the stack is altered mod 128
before being stored in M1 but remains as is in the stack. When the M1 is put into the stack the
M1 resets. The second memory space can only contain the digits 0–9 in three separate boxes which
are mixed from their position in the stack so that the ones digit of the stack becomes the tens
digit in the memory, the tens digit in the stack becomes the hundreds digit in the memory, and the
hundreds digit in the stack becomes the ones digit in the memory. Any other digits in the stack
aren't stored in the M2, and the stack is reset to 0. When the M2 value is copied back to the
stack it remains as is in M2 but the reverse process happens to mix the digits that was explained
previously. The memory space is initially M1, but can be toggled initially via the +. When the toggle is toggled all of the symbols switch instructions:
 +: copies the selected memory to the stack and resets if M1.
 -: copies the stack to the selected memory and resets if M2.
 .: toggles the toggle, clears both memories and resets the stack to 0.
 ,: toggles the memory space.
 <: prints the stack value mod 128 as an ASCII character.
 >: prints the nonselected memory as an ASCII character.
 [: decreases the stack value by 2.
 ]: increases the stack value by 1.
The stack value can be between 0 and infinity, but may not fall below 0 (if this occurs the
memories are reset and the count is set to 100).
==Hello, World!==
[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[>[[[[[[[[[[[[[[[]>[[[[]>>[[]>-.[[[[[[[[[[[[[[[[[[[[[[>]]]]]]]]]]]]>[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[]>]]]]]]]]>[[]>]]]]]]>]]]]]]]]>-.[[[[[[[[[[[[[[[[[]>-.[[[[[>
Category:Joke languages
Category: Languages
Category:Stack-based
Category:Unimplemented
Category:2009