nyuuzyou/wikis huggingface dataset:
AntiLang

AntiLang is an esolang created by User:SpaceByte on 7/8/22 (July 8th 2022), inspired by ඞlang, made to prove a point against it. The creator, of AntiLang, believes ඞlang not to be a true esoteric programming language, and should not be considered one, this is because, the "code" in ඞlang, does not affect it's outputs (or inputs), in any manner, its "interpreter", should not be considered one, nor should its concept be considered a programming language, as it does not perform any computational actions based on any inputs, its interpreter is solely a program that receives an input, and prints a character, which should make it a program, and not a programming language. AntiLang was created to show how you can make a functional and simplistic language, very easily, by creating an interpreter in less than two minutes.
==Language Overview==
AntiLang can only execute output, uses 3 characters, and prints two strings, and can preform a line break, it is not practical for any use, and was not intended for it, it was simply created to prove the point of how you can easily create a functional esoteric language.
==Commands==
Command	Description
a 	Writes "sus"
b 	Writes "amogus"
c 	Makes a line break.
Any characters that are not a c or b are ignored as in the switch case in the interpreter does not do anything with the otherwise, you can create comments but only without those 3 characters.
==Examples==
===Print one string===
a Prints "sus"
===Print two strings, with a line break inbetween===
acb will print:
sus
amongus
As you can see, they are on separate lines.
== IDE ==
User:Yes, the original creator of ඞlang made an IDE in Applesoft Basic. Run it here: 
1 HOME:PR#3:S=0
10 PRINT "AntiLang IDE"
20 PRINT "IDE By User:Yes, AntiLang by User:SpaceByte, AppleSoft Basic by Marc McDonald and Ric Weiland, Applesoft Basic in Javascript by Joshua Bell."
30 PRINT:PRINT "INPUT CODE"
40 INPUT ">>";C$
50 PRINT "OUTPUT":PRINT
60 FOR X=1 TO LEN(C$)
70 IF MID$(C$,X,1)="A" THEN PRINT "SUS";
80 IF MID$(C$,X,1)="B" THEN PRINT "AMOGUS";
90 IF MID$(C$,X,1)="C" THEN PRINT:PRINT;
100 S=S+1 
110 NEXT X
120 PRINT:PRINT:PRINT "PROGRAM FINISHED IN ";S;" STEP(S)"
130 GOTO 40
Variables used
S - Step count
C$ - Code input
X - Var for FOR statement
LEN(C$) - Built in function for length of code
MID$(x,y,z) - Built in string function
note: if you type in "SUSSY BAKA" it will output "AMONGUSSUSSUS" 🙂
Category:Languages
Category:2022
Category:Implemented
Category:Unusable for programming
Category:Output only
Category:Total
Ants

Ants is an esolang based all around ants and controlling them with pheromones.
Ants can be blocked off from certain pheromones using gates and walls.
Any commands ants pass while moving are executed.
You can have multiple ants.
Memory is stack-based.
==External resources==
You can find the main implementation of Ants here! (C++20)
Category:Two-dimensional languages
Category:Stack-based
Category:Languages
Category:Implemented
Anyfix

Anyfix is a golfing language by HyperNeutrino inspired by Jelly and 05AB1E that uses Anyfix notation, which was created for this language by Hyper Neutrino.
Anyfix is written in Python.
* The GitHub link to it is here: https://github.com/alexander-liao/anyfix
* The TryItOnline link to it is here: https://tio.run/#anyfix
== Example Programs ==
n-th triangular number:
 RS
 R Range up to value
 S Sum
digital sum:
 DS
 D Decimal Digits
 S Sum
binary digital sum:
 BS
 B Binary Digits
 S Sum
digital root
 ¡DS»
 ¡ » Repeat the code until the values are no longer unique
 D Decimal Digits
 S Sum
take number n as input, then for each line of input replace all runs of n spaces at the beginning with a tab (space → tab because tabs are superior):
 ⁶Ɠ×@ɦ€¡"\t"®ʂ»»Y
 ⁶ single space onto stack
 Ɠ take a line of input and evaluate it onto stack
 × multiply the space by that number onto stack
 @ pop that value off of stack and store in register
 ɦ read all lines of input as a list of lines
 € » for each element in this list
 ¡ » keep repeating until the results are no longer unique
 "\t" push a tab onto the stack
 ® copy the register (the spaces) onto the stack
 ʂ regex-replace
 Y join by newlines
== See also ==
* Anyfix notation
Category:Languages Category:Golfing language Category:Implemented
Anyfix notation

Anyfix notation is a powerful mix of prefix, infix, and postfix notation that requires a well-implemented evaluator. There is a memory stack or queue and an operator queue. When a literal value is encountered, it is pushed onto the memory stack or queue. When an operator is encountered, two things can happen. If there are enough values in memory for the operator, then the operator is applied. Otherwise, the operator is stored in the queue. When new values are pushed into the memory, all operators are checked and if any of them can be applied, then the first one that can be applied is applied, and this updates again.
== Examples ==
All of these will add and :
 + 1 2
 1 + 2
 1 2 +
The following code (where is some unary/monadic operator) evaluates to :
 + @ 1 2
== See also ==
* Anyfix
Category:Concepts
Category:Operator_notations
Anyways

Anyways is an interpreted esoteric programming language designed and implemented in 2017 by User:Gusg21. It is supposed to read like a joke routine. See below for command information.
== Commands ==
This is the command listing for Anyways:
There was a guy called (x): This sets the accumulator to the value (String or number) of x.
"Ow!" it said.: This prints the content of the accumulator.
"What are you doing?" they said.: Prompts the user for input then stores to the accumulator.
And then (x) happened!: Adds x to the accumulator.
But then (x) happened!: Subtracts x from the accumulator.
When (x) happened!: Multiply the accumulator by x.
Until (x) happened!: Divides the accumulator by x.
Knock Knock, (condition)
(commands)
Who's there?
(commands)
Banana!
This takes a condition, and if it evaluates to true, does the commands until "Who's There?", at which point it skips to "Banana!". If the condition returned false, skip the code up until "Who's There?" and execute everything past that.
Then I forgot, (x)!: Stores the accumulator to memory slot x.
Then I remembered, (x)!: Reads the value at memory slot x into the accumulator.
That's all folks!: Ends your program. YOU MUST HAVE THIS AT THE END
== Examples ==
=== Hello, World! ===
There was a guy called Hello World
"Ow!" it said.
That's all folks!
The first line sets the accumulator to "Hello World", the second line prints it, and the third line ends the program.
=== Cat ===
"What are you doing?" they said.
"Ow!" it said.
That's all folks!
The first line reads input into the accumulator, and the second line prints it. The third one ends the program.
== Interpreters ==
There is one interpreter, written by User:Gusg21 in Python. 
Category:Languages Category:Implemented Category:Total Category:2017
Aperture

Built on the ruins of a previous language of the same name, Aperture is a language designed for safely constructing advanced AI. The remnants of the previous language are buried beneath it in the page history.
The language offloads processing to external programs in other languages through libraries, where each attached library is called a 'core'. If an Aperture program finds it has insufficient cores to complete the required processing, it will default to releasing deadly neurotoxin, so it is recommended that the programmer stifle every program with cores to prevent that. Cores provide high-level behavioural traits for an artificial intelligence, such as morality and adventure-seeking.
Commands in Aperture take the form of goals or directives, and are compiled to a rational agent that tries to maximise those goals to the best of its ability. The cores attached determine the strategies the program is capable of employing to reach its goal. For example, if a programmer wrote an AI as a disk operating system, goals could include regular defragmentation, safe memory management and trapping hapless humans in enigmatic escape rooms for science. In service of those goals, an AI might need to use stupidity, anger and/or cake, which could be attached as cores.
Category:Joke languages
Category:2020
Category:High-level
Aphasia

Aphasia is a functional programming language that Tom Murphy VII created and uses for his internal projects, such as his blog engine. Aphasia is functional with side effects, statically typed with algebraic types and function closures, and as such is inspired by ML languages. It also has first-class support for interacting with an Aphasia-specific database backed by an SQL engine. Aphasia is actually two languages (the obsolete Aphasia1 and the current Aphasia2) that can be compiled together into a bytecode for the same execution environment. 
The parser and compiler from Aphasia source to Aphasia bytecode is implemented in SML, the bytecode interpreter is implemented in C++. 
== History ==
Tom 7 started to develop Aphasia1 in 1998, created Aphasia2 around 2010, migrated the source code from a CVS repository to an SVN repository in 2011, rewrote all Aphasia1 code to Aphasia2 and retired Aphasia1 by 2020, and is still running large parts of his website on Aphasia2 as of 2025.
== External links ==
* Aphasia source code on Sourceforge website
Category:Languages
Category:1998
Category:Functional paradigm
Category:Turing complete
Category:Implemented
Apple3.14

Apple3.14 is a language designed to print Pi for a given number of decimals by user:Maxsteele2.
==Example Programs==
===Pi to 5 decimals===
 apple3.14
 goto 5
 end
This prints this:
 3.14159
===Pi to 42 decimals===
 apple3.14
 goto 42
 end
This prints this:
 3.141592653589793238462643383279502884197169
==How high will it go?==
At best, 31,415,926,535,897 places. That's the current record, according to this page.
==So what's this good for besides calculating Pi?==
Not much, really. Quines are impossible, and Apple3.14 is Turing incomplete.
== Implementation ==
An implementation in J, written by User:Conor O'Brien, can be found here.
Category:Joke languages
Category:Implemented
Category:Unusable for programming
Category:2009
Category:Total
Category:Output only
Category:Languages
Apple3.14/implementation.ijs

:
This is an implementation of Apple3.14 in J, written by User:Conor O'Brien.
== Assumptions ==
I assume the following, since detail is to be desired on the actual spec.
# All programs must start with apple3.14 in that case exactly, followed by an optional carriage return (\r) and a necessary newline (\n);
# all programs must end with the end command, and that any amount of text may come after it, but will not be executed;
# all lines not starting with goto followed by a space are ignored;
# any invalid number passed to a goto command causes an error;
# negative numbers passed to a goto command print an newline;
# and that multiple gotos are allowed.
== Apple314.ijs ==
Without further ado, this is the program, Apple314.ijs:
 getpi =: '3'"_`('3.',[:":10#.[:([:-/1 10*[:<.@o.10x^1 0+])"0 i.)@.*
 isn =: [:<./'0123456789'e.~]
 throw =: (5)1!:2&5,&LF
 
 3 : 0]1!:1(3)
 NB. split on newlines and remove carriage returns
 lines =. <;._1 LF, y -. CR
 if. -. 'apple3.14' -: > {. lines do. throw 'error: first line is not "apple3.14"' end.
 NB. remove first line
 lines =. }. lines
 for_line. lines do.
 if. 'end' -: >line do. return.
 elseif. 'goto' -: > 0 { wln =. ;: >line do.
 num =. >1 { wln
 if. isn num do. echo getpi ". num
 elseif. ('-' -: {. num) *. isn }. num do. echo ''
 elseif. 1 do. throw 'error: malformed number "' , num , '"'
 end.
 end.
 end.
 )
 exit 0
== Running the program ==
You can execute programs like this:
On windows:
 type <filename> | Apple314.ijs
On bash/related:
 cat <filename> | Apple314.ijs
== Further notes ==
This program currently does not display the entirety of sufficiently long strings. However, this is currently being worked on.
Category:Implementations
Arbitrary effect at an arbitrary point

Being able to achieve an arbitrary effect at an arbitrary point is one of the subtler requirements for a programming language to be Turing-complete. The phrase can be seen as a generalized statement of the idea that a Turing machine's control mechanism must be allowed to be an unrestricted finite-state automaton. That is, placing any restriction on the FSA that cannot be "worked around" will render it unable to perform some computations that could otherwise be performed by a standard Turing machine.
As a pathological example of a programming language which has loops, conditionals, an unbounded store, but which is not Turing-complete because it does not allow an arbitrary effect at an arbitrary point, take a version of Brainfuck in which each > instruction must be followed immediately by a < instruction.
Most programming languages do allow for arbitrary effects at arbitrary points. In the imperative paradigm, for example, all this really means is that there is no restriction on the order that instructions are specified to be executed in.
Some esoteric programming languages, though, do not allow one to directly code arbitrary effects at arbitrary points. These effects must be achieved circuitously. This makes them simultaneously very interesting to program in and very difficult to prove Turing-complete, because one must show that it is possible to achieve each needed effect indirectly and compositely; that is, through a combination of directly specified effects. Notable examples include:
* Malbolge - the operation to execute is given by the progression: C ← (C + [C]) mod 94
* 2L - being able to execute a given operation relies on the current direction of travel
* Aura - each operation writes a new next instruction
* Beturing - control mechanism's flow graph must be planar
Category:Concepts
Arbol

Arbol is a functional programming language developed by Rossen Radev and primarily serves as a programming language for genetic programming experiments. It is inspired by the ideas of other esoteric programming languages like Unlambda, Lazy K, Iota and Zot and the functional languages Joy and Haskell (the STG machine). The current version of the Arbol language is 1.0.
== External resources ==
* 
Category:Languages
Category:Functional paradigm
Category:2005
Category:Turing complete
Category:Unimplemented
Arch is the best!

Arch is the best! is a joke language that prints "Arch is the best!" regardless of the program. It has no syntax. It is a joke about the "Arch is the best" project. I use Arch BTW.
== Implementations ==
Because the results are identical regardless of the program, no input is needed for an implementation of Arch is the best!. This means that any program that prints the words "Arch is the best!" will do. Fortunately, there are a bunch of those already available on https://wiki.archlinux.org/title/arch_is_the_best#The_code
Category:Languages Category:Joke languages Category:Unusable for programming Category:Implemented Category:Output only Category:Zero-dimensional Category:Total Category:ThematicCategory:No-code esolangCategory:Nope. derivatives
Ark

== Ark: The esolang that is actually kind of useful. ==
 Usage
Character	Function 	Status
: 	Terminates the program. 	Required
@ 	Initializes the program. 	Required
! 	Outputs the next Alphanumeric character in the code. 	Output
^ 	Outputs the stack; 	Output
> 	Adds the next numeric character to the stack; 	Stack Manipulation
< 	Asks for input and adds it to the stack. 	Input/Stack Manipulation
+ 	Add the top two rows in the stack and add the result to the stack; 	Math/Stack Manipulation
- 	Subtract the second row by the top row in the stack and add the result to the stack.	Math/Stack Manipulation
* 	Multiply the top two rows of the stack and add the result to the stack. 	Math/Stack Manipulation
/ 	Divide the top row by the second row in the stack and add the result to the stack. 	Math/Stack Manipulation
# 	Clear the stack. 	Stack Manipulation
{ 	Used to initialize a function. (like python's: "def") 	Functions
} 	Used to end the initialization of a function. 	Functions
[ 	Used to initialize a multiple-character addition. 	Stack Manipulation
] 	Used to end the initialization of a multiple-character addition. 	Stack Manipulation
~ 	Used to call a function. 	Functions
note: when printing a string like this: !B !L !A !H, you must put a space in between each instruction.
== External resources ==
* GitHub Interpreter
* Docs
Category:Languages Category:Implemented
Arn

Arn is a golfing language by User:ZippyMagician inspired by the APL family of languages. It is designed to be a Functional Paradigm.
==Description==
Arn is constructed of variable declarations, functions, and symbols. These symbols come in the forms of prefixes, infixes, and suffixes. A full syntax and description can be found at [this page]. This format, however, may lead to instances where your program needs to be a few bytes shorter in order to compete. This is where Carn (Compressed Arn) comes in.
==Carn==
Carn is the compressed version of Arn. The interpeter has the ability to distinguish between these two program formats and interpret each separately, without any input from the user. Carn is encoded using its own Code Page, based on CP1252. It can be found below. The Arn interpreter will compress your program by passing in the -c flag to the compiler through the command line.
===Code Page===
_ 	_0	_1	_2	_3	_4	_5	_6	_7	_8	_9	_A	_B	_C	_D	_E	_F
0_	! 	" 	# 	$ 	% 	& 	' 	( 	) 	* 	+ 	, 	- 	. 	/ 	0
1_	1 	2 	3 	4 	5 	6 	7 	8 	9 	: 	; 	< 	= 	> 	? 	@
2_	A 	B 	C 	D 	E 	F 	G 	H 	I 	J 	K 	L 	M 	N 	O 	P
3_	Q 	R 	S 	T 	U 	V 	W 	X 	Y 	Z 	[ 	\ 	] 	^ 	_ 	`
4_	a 	b 	c 	d 	e 	f 	g 	h 	i 	j 	k 	l 	m 	n 	o 	p
5_	q 	r 	s 	t 	u 	v 	w 	x 	y 	z 	{ 	 	} 	~ 	¡ 	¢
6_	£ 	¤ 	¥ 	¦ 	§ 	¨ 	© 	ª 	« 	¬ 	® 	¯ 	° 	○ 	■ 	↑
7_	↓ 	→ 	← 	║ 	═ 	╔ 	╗ 	╚ 	╝ 	░ 	▒ 	► 	◄ 	│ 	─ 	┌
8_	┐ 	└ 	┘ 	├ 	┤ 	┴ 	┬ 	♦ 	┼ 	█ 	▄ 	▀ 	▬ 	± 	² 	³
9_	´ 	µ 	¶ 	· 	¸ 	¹ 	º 	» 	¼ 	½ 	¾ 	¿ 	À 	Á 	Â 	Ã
A_	Ä 	Å 	Æ 	Ç 	È 	É 	Ê 	Ë 	Ì 	Í 	Î 	Ï 	Ð 	Ñ 	Ò 	Ó
B_	Ô 	Õ 	Ö 	× 	Ø 	Ù 	Ú 	Û 	Ü 	Ý 	Þ 	ß 	à 	á 	â 	ã
C_	ä 	å 	æ 	ç 	è 	é 	ê 	ë 	ì 	í 	î 	ï 	ð 	ñ 	ò 	ó
D_	ô 	õ 	ö 	÷ 	ø 	ù 	ú 	û 	ü 	ý 	þ 	ÿ 	Œ 	œ 	Š 	š
E_	Ÿ 	Ž 	ž 	ƒ 	ƥ 	ʠ 	ˆ 	˜ 	– 	— 	‘ 	’ 	‚ 	“ 	” 	„
F_	† 	‡ 	• 	… 	‰ 	‹ 	› 	€ 	™ 	⁺ 	⁻ 	⁼ 	 	 	 	
==External resources==
* https://github.com/ZippyMagician/Arn
Category:Languages
Category:Golfing language‏‎
Category:Functional paradigm‏‎
Category:Implemented
Category:APL-like
Category:Turing_complete
ArnoldC

ArnoldC is an esoteric programming language created with Scala by Lauri Hartikka. The source is available here, along with tutorials and example programs.
:This articles is being improved. Help us out by adding more information.
==Language overview==
ArnoldC runs on famous quotations by Arnold Schwarzenegger. Most of the quotes can be found in this video.
The commands are:
Command 	Description
@I LIED 	False
@NO PROBLEMO 	True
BECAUSE I'M GOING TO SAY PLEASE 	If
BULLSHIT 	Else
YOU HAVE NO RESPECT FOR LOGIC 	EndIf
STICK AROUND 	While
CHILL 	EndWhile
GET UP 	
GET DOWN 	
YOU'RE FIRED 	*
HE HAD TO SPLIT 	/
I LET HIM GO 	%
YOU ARE NOT YOU YOU ARE ME 	==
LET OFF SOME STEAM BENNET 	>
CONSIDER THAT A DIVORCE 	Or
KNOCK KNOCK 	And
LISTEN TO ME VERY CAREFULLY 	DeclareMethod
GIVE THESE PEOPLE AIR 	NonVoidMethod
I NEED YOUR CLOTHES YOUR BOOTS AND YOUR MOTORCYCLE 	MethodArguments
I'LL BE BACK 	Return
HASTA LA VISTA, BABY 	EndMethodDeclaration
DO IT NOW 	CallMethod
GET YOUR ASS TO MARS 	AssignVariableFromMethodCall
HEY CHRISTMAS TREE 	DeclareInt
YOU SET US UP 	SetInitialValue
IT'S SHOWTIME 	BeginMain
YOU HAVE BEEN TERMINATED 	EndMain
TALK TO THE HAND 	Print
I WANT TO ASK YOU A BUNCH OF QUESTIONS AND I WANT TO HAVE THEM ANSWERED IMMEDIATELY	ReadInteger
GET TO THE CHOPPER 	AssignVariable
HERE IS MY INVITATION 	SetValue
ENOUGH TALK 	EndAssignVariable
WHAT THE FUCK DID I DO WRONG 	ParseError
 
==Online interpreters==
The few online interpreters available for ArnoldC include:
* ArnoldC cyber simulator, a simple online compiler.
* ArnoldC cyber simulator v2, the less buggy version of ArnoldC cyber simulator.
* Try It Online's ArnoldC compiler, which is by far the most functional.
==Conventions==
The following summarises the conventions for coding in ArnoldC.
===Variables and Keywords===
Variables and keywords are differentiated by capitalisation. Variables should aways be lowercase, whereas keywords are always UPPERCASE.
===New Lines===
Generally, each new keyword command in ArnoldC should be written on a new line. Code written like this will not work:
GET TO THE CHOPPER x
HERE IS MY INVITATION y KNOCK KNOCK z
ENOUGH TALK
==Examples==
===Hello, world!===
 IT'S SHOWTIME
 TALK TO THE HAND "Hello, world!"
 YOU HAVE BEEN TERMINATED
==External resources==
* Lauri Hartikka's GitHub source contains instructions and files needed in order to use ArnoldC.
* ArnoldC wiki includes the complete set of instructions for coding in ArnoldC.
Category:Languages
Category:2013
Category:Thematic
Category:Pseudonatural
AroundEnglish

AroundEnglish is an attempt to make a programming language as close to English as possible.
== Structure ==
Same as english. This makes interpreters hard to make (that arent human)
== Commands ==
 i (program)
 say(ing) "" (print)
 and (string concatenation)
 hbu? (input. fills in last variable used)
 think [] is [] (does variable manipulation)
 and while [] is [], (control flow)
 and while [] isnt [],
 . (ends loop)
 hi (starts program)
 bye (ends program)
 sorry, a cat was on my keyboard (previous command is invalid)
 the next thing i say is false (next command is negated)
 hey, i can read your mind: (starts arithmatic section)
 first,
 then,
 then, (prefix)
 (you can use normal commands here also, but arithmatic commands are also accepted)
 {} [] and [] (does operation to store in last variable)
 isnt that cool? (ends arithmatic section)
 i hate you (sets previous input to 0 and redoes section of last input, or terminates program if there is no input)
 [] is awesome! ("uses" a variable without using it)
 think of something random. (randomizes last variable used from 1 to 10)
 bring it up (increments)
 bring it down (decrements)
== Hello world ==
 hi
 im saying "hello world"
 bye
== Cat ==
 hi
 i think green is 0
 hbu?
 im saying green
 bye
== Fizzbuzz ==
 hi
 i think green is 0
 hbu?
 hey, i can read your mind:
 first, i think blue is 0
 then, modulo green and 15
 then, i think yellow is 0
 then, modulo green and 5
 then, i think red is 0
 then, modulo green and 3
 isnt that cool?
 and while blue is 0,
 im saying "fizzbuzz"
 bye.
 and while yellow is 0,
 im saying "buzz"
 bye.
 and while red is 0,
 im saying "fizz"
 bye.
 im saying green
 bye
 
== 99 bottles of beer on the wall ==
 hi
 i think green is 99
 while green is not 1
 im saying green and " bottles of beer on the wall"
 im saying green and " bottles of beer
 take one down
 pass it around"
 bring it down.
 im saying "1 bottle of beer on the wall
 1 bottle of beer
 take one down
 pass it around
 no more bottles of beer on the wall"
 bye
== kiwiscript ==
 hi
 im saying "kiwi"
 bye
== 7 bottles of tommyaweosme ==
 hi
 i think green is 7
 while green is not 1
 im saying green and " bottles of tommyaweosme on the wall"
 im saying green and " bottles of tommyaweosme
 take one down
 get +100 health"
 bring it down.
 im saying "one last bottle of tommyaweosme on the wall
 one final bottle of tommyaweosme
 walk away
 keep it up there
 let it ferment into greatness"
 bye
Around and around, sleeping sound

Around and around, sleeping sound is the name of a 2D programming language made by User:Iamcalledbob, on June 16, 2018. It only has 4 commands:
Cmd	Description
< 	Move the data pointer left. Add 1. When the value in the data pointer is over 255, change the value in the data pointer into 0.
> 	Move the data pointer right.
Z 	Outputs the value in the data pointer.
@ 	If pointer byte = 0, turn right. Else, turn left.
Category:2018
Category:Brainfuck derivatives
Category:Implemented
Category:Turing complete
Category:Turing tarpits
Category:Two-dimensional languages
Category:Languages
Category:Cell-based