# User:Ais523/LanguageList

From Esolang

This is a test Language List of all languages. The letters on the right indicate properties of the language; click on one for more details. (The letter indicating Turing-complete is the only one that works yet).

(*Note: Not all languages are on this list yet, and the list itself is experimental.*)

.Gertrude |
Depends on lengths of words in the source. | L |
I |
Y |
? |
N |
1 |
U |
N |

.yacuabll |
Language with single-character commands. | L |
I |
Y |
? |
N |
1 |
U |
N |

0x29A |
Mix of imperative and functional programming. | L |
I |
Y |
T |
N |
1 |
U |
N |

1L |
2D language with only 2 commands. | L |
I |
Y |
? |
N |
2 |
I |
N |

23 |
By default, uses no non-whitespace characters. | L |
I |
Y |
? |
N |
1 |
I |
N |

2iota |
Turing tarpit based on events and alphabets. | L |
I |
Y |
T |
N |
1 |
I |
N |

2L |
2D language with only 2 commands + NOP. | L |
I |
Y |
T |
N |
2 |
I |
N |

3code |
Functions limited to 3 local and 3 global variables. | L |
F |
Y |
? |
N |
1 |
I |
N |

4DL |
Stack-based 4D programming language. | L |
I |
Y |
? |
N |
+ |
I |
N |

AAAAAAAAAAAAAA!!!! |
Programs consist of nothing but A and punctuation. | L |
I |
Y |
? |
N |
1 |
U |
N |

ABCDXYZ |
Based around the first BackFlip storage pattern. | L |
O |
Y |
? |
Y |
1 |
I |
N |

ADJUST |
2D language with no NOP characters. | L |
I |
Y |
? |
N |
2 |
I |
N |

Aheui |
Fungeoid based on the Korean alphabet. | L |
I |
Y |
T |
N |
2 |
I |
N |

Ale |
Brainfuck-like language with two tapes. | L |
I |
Y |
? |
N |
1 |
I |
N |

ALPACA |
Metalanguage for describing cellular automata. | M |
I |
Y |
? |
N |
1 |
I |
N |

AlPhAbEt |
Bit-based language with double-ended queues. | L |
I |
? |
? |
N |
1 |
I |
N |

Archway |
Brainfuck-like; wire-crossing not necessary. | L |
I |
Y |
? |
N |
2 |
I |
N |

Argh! |
Funge with 27 commands and an unlimited stack. | L |
I |
Y |
? |
N |
2 |
U |
N |

Aargh! |
An attempt to make Argh! Turing-complete. | L |
I |
Y |
? |
N |
2 |
U |
N |

Aura |
All operators output by editing the next instruction. | L |
I |
Y |
? |
N |
1 |
I |
Y |

AutoMouse |
Screen-scrubbing utility that can be programmed. | L |
I |
Y |
? |
N |
1 |
U |
N |

axo |
A Befunge variant that uses punctuation marks. | L |
I |
Y |
T |
N |
2 |
I |
N |

BackFlip |
All commands selfmodify; no data storage. | L |
I |
Y |
? |
Y |
2 |
I |
Y |

Backtracking INTERCAL |
INTERCAL with Prolog-like backtracking. | L |
I |
Y |
? |
N |
1 |
U |
N |

Bag |
Fractran extension based around n->np/q. | L |
I |
Y |
T |
N |
1 |
U |
N |

BAK |
Programs work by creating pointers to themselves. | L |
I |
Y |
? |
N |
1 |
I |
N |

Barely |
Turing-complete language with 59-byte interpreter. | L |
I |
Y |
T |
N |
1 |
I |
N |

BDAMD |
Fungeoid similar to Brainfuck and Numberix. | L |
I |
Y |
? |
N |
2 |
I |
N |

Bear Food |
A cross between Forth, False, and Perl. | L |
I |
Y |
? |
N |
1 |
U |
N |

Beatnik |
Commands are based on Scrabble scores. | L |
I |
? |
? |
N |
1 |
I |
N |

Befalse |
Cross between SNUSP, False, and Befunge. | L |
I |
Y |
? |
N |
2 |
I |
Y |

Befreak |
A completely reversible fungeoid. | L |
I |
Y |
? |
Y |
2 |
I |
N |

Befunge |
The original fungeoid; designed to be uncompilable. | L |
I |
Y |
T |
N |
2 |
I |
Y |

beta-Juliet |
Failed try to create an event-oriented Turing tarpit. | L |
I |
Y |
F |
N |
1 |
I |
N |

Portia |
Preprocessor for use with beta-Juliet. | L |
I |
Y |
F |
N |
1 |
I |
N |

Beturing |
Turing machine simulator with no wire-crossing. | L |
I |
Y |
? |
N |
2 |
I |
N |

BFM |
Lambda calculus Brainfuck macro preprocessor. | L |
I |
Y |
? |
N |
1 |
U |
N |

BF-PDA |
Brainfuck limited to be a push-down automaton. | L |
I |
Y |
P |
N |
1 |
U |
N |

BF-SC |
Brainfuck limited to always terminate. | L |
I |
? |
? |
N |
1 |
U |
N |

Binary combinatory logic |
Combinatory logic using two rewriting rules. | L |
F |
Y |
? |
N |
1 |
I |
N |

Biota |
The first 2D programming language. | L |
I |
Y |
? |
N |
2 |
I |
N |

BIT |
Only types used are bits and pointers to bits. | L |
I |
Y |
? |
N |
1 |
U |
N |

BitChanger |
4-instruction bitwise Brainfuck derivative. | L |
I |
Y |
? |
N |
1 |
I |
N |

BitChip |
Programs are based on moving and adding squares. | L |
I |
Y |
? |
N |
2 |
U |
N |

Bitwise Cyclic Tag |
Two-command Turing-complete cyclic tag system. | L |
I |
Y |
? |
N |
1 |
U |
N |

Black |
One command + NOP, no data storage. | L |
I |
Y |
? |
N |
2 |
I |
Y |

Blank |
One-dimensional Befunge-like language. | L |
I |
Y |
? |
N |
1 |
U |
N |

BogusForth |
Language inspired by Forth and False. | L |
I |
Y |
T |
N |
1 |
I |
N |

Boolfuck |
Bit-based Brainfuck isomorph. | L |
I |
Y |
? |
N |
1 |
U |
N |

Brackets |
Uses only brackets as commands. | L |
I |
? |
? |
N |
1 |
I |
N |

Braincopter |
System for storing Brainfuck code in images. | L |
I |
Y |
T |
N |
2 |
I |
N |

Brainfork |
Brainfuck with multithreading extensions. | L |
I |
Y |
T |
N |
1 |
I |
N |

Brainfuck |
Tape-based Turing tarpit with 8 commands. | L |
I |
Y |
? |
N |
1 |
I |
N |

Brainhype |
Brainfuck with halting-problem analyser. | L |
I |
Y |
U |
N |
1 |
U |
N |

Brainloller |
Brainfuck mapped to colours and stored in images. | L |
I |
Y |
T |
N |
2 |
I |
N |

Brainscrambler |
Brainfuck variant with 3 stacks and no tape. | L |
I |
Y |
? |
N |
1 |
U |
N |

Braintwist |
Brainfuck with extensions for self-modification. | L |
I |
Y |
T |
N |
1 |
I |
Y |

Braktif |
Cellular automaton that emulates Brainfuck. | L |
I |
Y |
? |
N |
2 |
I |
N |

Bub |
Brainfuck with GOTO instead of while. | L |
I |
Y |
? |
N |
1 |
I |
N |

Bubble |
Language based on the bubble-sort algorithm. | L |
I |
Y |
? |
N |
1 |
U |
N |

Bullfrog |
Language with no conditional jumps. | L |
I |
Y |
? |
N |
1 |
U |
N |

Camouflage |
Language based around "disguises" for commands. | L |
I |
Y |
? |
N |
1 |
U |
N |

CAT |
Thematic language based around cats. | L |
I |
Y |
? |
N |
1 |
U |
N |

Catch |
Language based around exceptions. | L |
I |
Y |
? |
N |
1 |
U |
N |

Chef |
Programs resemble cooking recipies. | L |
I |
Y |
T |
N |
1 |
I |
N |

Choon |
Language which outputs only in musical notes. | L |
I |
Y |
T |
N |
1 |
I |
N |

Circute |
Cellular automaton based around the NAND gate. | L |
I |
Y |
? |
N |
2 |
I |
N |

Cvlemar |
Language in which all programs are graphs. | L |
I |
Y |
? |
N |
1 |
U |
N |

Dis |
Easier-to-use Malbolge variant. | L |
I |
? |
F |
N |
1 |
I |
Y |

Dumbf*ck |
Brainfuck-derived language with unusual looping. | L |
I |
Y |
? |
N |
1 |
U |
N |

DZZZZ |
Language with a diagonal control flow. | L |
I |
Y |
? |
N |
2 |
I |
N |

Emoticon |
All program instructions look like smileys. | L |
I |
Y |
T |
N |
1 |
I |
Y |

Enema |
Blank-inspired self-redefining language. | L |
I |
Y |
? |
N |
1 |
I |
N |

ETA |
Language where only ETAOINSH are commands. | L |
I |
Y |
? |
N |
1 |
I |
N |

eTalk |
Designed to look like natural language. | L |
I |
Y |
? |
N |
1 |
U |
N |

False |
Early esolang with 1 KiB compiler. | L |
I |
Y |
? |
N |
1 |
I |
N |

Flip |
Wierd-inspired billiards-like 2D language. | L |
I |
Y |
F |
N |
2 |
I |
N |

Fm |
Brainfuck-like computational model. | L |
I |
Y |
? |
N |
1 |
U |
N |

Forte |
Language based on altering the value of constants. | L |
I |
Y |
? |
N |
1 |
U |
Y |

Fortuna |
Brainfuck based around the idea of a wheel. | L |
I |
Y |
? |
N |
1 |
U |
N |

Fromage |
Ten instructions; each operates on a single bit. | L |
I |
Y |
? |
N |
1 |
U |
N |

Fugue |
Prelude with a musical representation. | L |
I |
Y |
T |
N |
1 |
U |
N |

Gammaplex |
High-level language with graphics and mouse input. | L |
I |
Y |
? |
N |
2 |
I |
Y |

Glass |
Object-oriented postfix language that uses a stack. | L |
O |
Y |
? |
N |
1 |
I |
N |

Glypho |
Pattern-based language with a rotatable stack. | L |
I |
Y |
? |
N |
1 |
I |
N |

GOTO++ |
Language with compulsory GOTO usage. | L |
I |
Y |
? |
N |
1 |
U |
N |

GraNoLa/M |
Directed graphs are the only data type. | L |
I |
Y |
? |
N |
1 |
U |
N |

Gravity |
Uncomputable language based around collisions. | L |
I |
? |
U |
N |
2 |
U |
N |

Haifu |
Language designed around Eastern philosophy. | L |
I |
Y |
? |
N |
1 |
I |
N |

Hanoi Love |
Minimal language named after the Towers of Hanoi. | L |
I |
Y |
? |
N |
1 |
U |
N |

Hargfak |
Brainfuck with two pointers and code-blocks. | L |
I |
Y |
T |
N |
1 |
U |
N |

hcbf |
Four-dimensional Brainfuck variant. | L |
I |
Y |
? |
N |
+ |
I |
N |

hexish |
Language designed to look like hexadecimal. | L |
I |
Y |
? |
N |
1 |
U |
N |

Homespring |
Excessively high-level salmon-based language. | L |
I |
Y |
? |
N |
1 |
I |
N |

Hunter |
Particle automaton based on mazespace-rewriting. | L |
I |
? |
? |
N |
2 |
U |
N |

iag |
Three-command, >3 operation language. | L |
I |
Y |
? |
N |
1 |
I |
N |

IINC |
Language in which lines have values. | L |
I |
Y |
? |
N |
1 |
U |
N |

ILLGOL |
BASIC, Fortran, and INTERCAL-like language. | L |
I |
Y |
? |
N |
1 |
U |
N |

INCAL |
Language with cellular-automata as operators. | L |
I |
Y |
? |
N |
1 |
I |
N |

INTERCAL |
Designed in 1972 to be unlike any other language. | L |
I |
Y |
? |
N |
1 |
I |
N |

Iota |
Functional language with one predefined function. | L |
F |
Y |
? |
N |
1 |
I |
N |

itflabtijtslwi |
/// with input extensions. | L |
I |
Y |
? |
N |
1 |
U |
N |

Java2K |
Language where any command could malfunction. | L |
I |
Y |
? |
N |
1 |
I |
N |

Jot |
Iota where any combination of 0s and 1s is legal. | L |
F |
Y |
? |
N |
1 |
I |
N |

JUSTIF |
Only control structures are IF and recursion. | L |
I |
Y |
? |
N |
1 |
U |
N |

Kayak |
Reversible language based around stacks and bits. | L |
I |
Y |
? |
Y |
1 |
U |
N |

Kipple |
Minimalistic stack-based language. | L |
I |
Y |
T |
N |
1 |
I |
N |

kvikkalkul |
Alledgedly created by the Swedish navy c. 1950. | L |
I |
Y |
? |
N |
1 |
I |
N |

L00P |
No control structures except IF and an implicit loop. | L |
I |
Y |
? |
N |
1 |
U |
N |

l33t |
Based on numbers embedded within words. | L |
I |
Y |
T |
N |
1 |
I |
Y |

Lambda |
Minimalistic lambda-calculus inspired language. | L |
I |
Y |
? |
N |
1 |
I |
Y |

Lazy K |
Purely functional lazily-evaluated Unlambda update. | L |
F |
Y |
? |
N |
1 |
I |
N |

Linguine |
Spaghetti with no bounds on data storage. | L |
I |
Y |
T |
N |
1 |
I |
N |

LNUSP |
5-command PATH-variant with better orthogonality. | L |
I |
Y |
? |
N |
2 |
I |
N |

Magenta |
Needlessly redundant cursed language. | L |
I |
Y |
? |
N |
1 |
U |
N |

Malbolge |
Designed to be impossibly difficult to program in. | L |
I |
? |
F |
N |
1 |
I |
Y |

MDPN |
Two-dimensional grammar-description language. | L |
I |
Y |
? |
N |
2 |
U |
N |

MechaniQue |
Language used to write interactive fiction. | L |
I |
Y |
? |
N |
1 |
I |
N |

Metropolis |
Language that describes 2D Turing machines. | L |
I |
Y |
T |
N |
2 |
U |
N |

MiniMAX |
Self-modifying language with a 14-byte interpreter. | L |
I |
Y |
T |
N |
1 |
I |
Y |

MinISCule |
OISC variant with a 36-byte interpreter. | L |
I |
Y |
T |
N |
1 |
I |
N |

Minks |
Uses bits and 2 Minsky machine counters. | L |
I |
? |
? |
N |
1 |
U |
N |

MISC |
Only command is 'subtract and branch if negative'. | L |
I |
Y |
T |
N |
1 |
U |
Y |

Mouse |
Early False-like automation language. | L |
I |
Y |
? |
N |
1 |
I |
N |

Muriel |
Language that can only loop by quining itself. | L |
R |
Y |
T |
N |
1 |
I |
N |

Mycelium |
Image-based language with memory and a stack. | L |
I |
Y |
? |
N |
2 |
I |
N |

Network Headache |
Variables are shared between all running programs. | L |
I |
Y |
? |
N |
1 |
U |
N |

noit o' mnain worb |
Language based around Brownian motion. | L |
I |
Y |
? |
N |
2 |
I |
N |

nouse |
Control flow depends on the current stack size. | L |
I |
Y |
? |
N |
1 |
U |
N |

NULL |
0D language based on prime factorization. | L |
I |
Y |
? |
N |
0 |
I |
N |

Numberix |
Language that looks like hexadecimal digits. | L |
I |
Y |
T |
N |
2 |
I |
N |

NUMPAD |
Language where letters are interpret as numbers. | L |
I |
Y |
? |
N |
1 |
I |
N |

Nybbleist |
Language based on 4-bit nybbles. | L |
I |
Y |
? |
N |
1 |
U |
N |

Obfuna |
All instructions are unary operators. | L |
I |
Y |
? |
N |
1 |
I |
N |

Object disoriented |
OOP where all objects have 2 data and 1 method. | L |
O |
Y |
T |
N |
1 |
U |
N |

ObjectPar |
Language that uses nothing but objects. | L |
O |
Y |
? |
N |
1 |
U |
N |

ODDBALL |
Matrioshka language describing bully automata. | L |
I |
Y |
? |
N |
1 |
U |
N |

OISC |
Group of languages each with only 1 instruction. | L |
I |
Y |
? |
N |
1 |
U |
N |

Omegaplex |
Gammaplex update with similar capabilities. | L |
I |
Y |
? |
N |
2 |
U |
N |

Omgrofl |
All commands are Internet slang abbreviations. | L |
I |
Y |
T |
N |
1 |
I |
N |

Oof! |
Language based on collisions between commands. | L |
I |
? |
? |
N |
2 |
U |
Y |

ORK |
Highly verbose object-oriented language. | L |
O |
Y |
T |
N |
1 |
I |
N |

Oroogu |
Language based around multiple queues. | L |
I |
Y |
? |
N |
1 |
U |
N |

Orthagonal |
Language based around a grid and a stack. | L |
I |
Y |
? |
N |
2 |
I |
N |

Orthogonal |
Orthagonal update with extra instructions. | L |
I |
Y |
? |
N |
2 |
I |
N |

Owl |
BogusForth update with integer math instructions. | L |
I |
Y |
T |
N |
1 |
I |
N |

P |
Stack-based language capable of file manipulation. | L |
I |
Y |
? |
N |
1 |
I |
N |

PATH |
2-dimensional Brainfuck-based language. | L |
I |
Y |
T |
N |
2 |
I |
N |

pbrain |
Brainfuck with procedure definition extensions. | L |
I |
Y |
T |
N |
1 |
I |
N |

Petrovich |
Language based around award and punishment. | L |
I |
Y |
? |
N |
1 |
U |
N |

Piet |
Graphical language resembling abstract paintings. | L |
I |
Y |
T |
N |
2 |
I |
N |

Piet-Q |
Piet variant based around RGB rather than hue. | L |
O |
Y |
? |
N |
2 |
U |
N |

PingPong |
Fungeoid with reflection as a flow-control method. | L |
I |
Y |
T |
N |
2 |
I |
Y |

Please Porige Hot |
Based around the rhyme with the same name. | L |
I |
Y |
? |
N |
1 |
U |
N |

POGA-INTERCAL |
INTERCAL update that's easier to compile. | L |
I |
Y |
? |
N |
1 |
U |
N |

Pointy |
Language with the pointer as the only data type. | L |
I |
Y |
? |
N |
1 |
U |
N |

Prelude |
Language with several 'voices', each with one stack. | L |
I |
Y |
T |
N |
1 |
I |
N |

PROLAN/M |
Deterministic Thue-like rewriting language. | L |
R |
Y |
T |
N |
1 |
I |
N |

Q-Bal |
Language based on queues rather than stacks. | L |
I |
Y |
? |
N |
1 |
U |
N |

Qdeql |
Language with one queue and few commands. | L |
I |
? |
? |
N |
1 |
I |
N |

QUATRE-CALC |
Based on pouring cans into each other. | L |
I |
Y |
? |
N |
1 |
U |
N |

Rail |
2D language with functions and a library. | L |
F |
Y |
? |
N |
2 |
I |
N |

Reaper |
OO language in which only destructors do anything. | L |
O |
Y |
? |
N |
1 |
U |
N |

RedGreen |
Cellular automaton designed as a RUBE update. | L |
I |
Y |
? |
N |
2 |
I |
N |

REGXY |
Regular expression-based rewriting language. | L |
R |
Y |
? |
N |
1 |
I |
N |

reMorse |
Language designed to resemble Morse Code. | L |
I |
Y |
? |
N |
1 |
I |
N |

Revaver2pi |
Revaver update with infinite stacks. | L |
I |
Y |
? |
N |
1 |
U |
N |

REverge |
Language based around data replacements. | L |
I |
Y |
? |
N |
1 |
U |
N |

REVERSE |
Reversing is the only control flow operation. | L |
I |
Y |
? |
N |
1 |
U |
N |

Rhotor |
Lazy functional language with pattern matching. | L |
F |
Y |
T |
N |
1 |
I |
N |

RUBE |
Bully automaton where data is moved by machines. | L |
I |
? |
? |
N |
1 |
I |
Y |

SADOL |
Functional language designed to be illegible. | L |
F |
Y |
T |
N |
1 |
I |
N |

Sally |
Forward-Polish strongly typed Forth-like language. | L |
I |
Y |
? |
N |
1 |
U |
N |

Sansism |
Brainfuck adapted to more than one dimension. | L |
I |
Y |
T |
N |
2 |
I |
N |

SARTRE |
Language where programs have no purpose. | L |
I |
Y |
? |
N |
1 |
U |
N |

Sceql |
Qdeql with a nondecreasing stack. | L |
I |
? |
? |
N |
1 |
I |
N |

Self-modifying Brainfuck |
Brainfuck where the code array is the data array. | L |
I |
Y |
T |
N |
1 |
I |
Y |

Shakell |
Mix of SADOL, Unlambda, Lisp and Haskell. | L |
I |
Y |
? |
N |
1 |
I |
N |

Shakespeare |
Programs resemble Shakespeare plays. | L |
I |
Y |
? |
N |
1 |
I |
N |

Shelta |
Language inspired by Forth, False, and Assembler. | L |
I |
Y |
? |
N |
1 |
U |
N |

Shoopuf |
Like Brainfuck and Kipple but with circular lists. | L |
I |
Y |
? |
N |
1 |
I |
N |

Slashes |
Language based around search-and-replace. | L |
R |
? |
? |
N |
1 |
I |
Y |

Smallfuck |
Bounded-storage bit-based Brainfuck variant. | L |
I |
Y |
? |
N |
1 |
U |
N |

SMATINY |
Reversible SMETANA update with output. | L |
I |
? |
F |
Y |
1 |
I |
Y |

SMETANA |
Language based swapping lines and GOTO. | L |
I |
Y |
F |
N |
1 |
I |
Y |

SMITH# |
Cut-down SMITH with multiple input formats. | L |
I |
Y |
? |
N |
1 |
U |
N |

SMITH |
Language with no loops, only selfmodifying code. | L |
I |
Y |
T |
N |
1 |
I |
Y |

Smurf |
Muriel made into a Turing tarpit. | L |
I |
Y |
? |
N |
1 |
I |
Y |

SNUSP |
More orthogonal and concrete PATH variant. | L |
I |
Y |
? |
N |
2 |
I |
N |

SON-OF-UNBABTIZED |
Sorted!-based language with unusual I/O. | L |
I |
Y |
? |
N |
1 |
I |
N |

Sorted! |
Bilingual; all programs are 14 statements long. | L |
I |
Y |
? |
N |
1 |
U |
N |

Sortle |
Uses insertion sort and renaming expressions. | L |
R |
? |
? |
N |
1 |
I |
N |

Spaghetti |
Programs can have randomly ordered lines. | L |
I |
Y |
F |
N |
1 |
I |
N |

Spiral |
2D language based around spirals. | L |
I |
Y |
? |
N |
2 |
I |
N |

SPL |
Brainfuck with arithmetic and strings. | L |
I |
Y |
? |
N |
1 |
U |
N |

Spoon |
Huffman-coded Brainfuck variant. | L |
I |
Y |
? |
N |
1 |
I |
N |

Squishy2K |
Thue crossed with a finite state automaton. | L |
I |
Y |
? |
N |
1 |
U |
N |

Star W |
Language based on many different non-esolangs. | L |
I |
Y |
? |
N |
1 |
U |
N |

Strelnokoff |
Language where lines are executed randomly. | L |
I |
Y |
? |
N |
1 |
I |
N |

Subskin |
OISC variant which uses skips rather than jumps. | L |
I |
Y |
T |
N |
1 |
I |
Y |

Subtle cough |
Unlambda with call/cc as the only primitive. | L |
F |
N |
? |
N |
1 |
U |
N |

SuperPar |
Extension of ObjectPar. | L |
O |
Y |
? |
N |
1 |
U |
N |

Tamerlane |
Based around a constraint-flow paradigm. | L |
I |
Y |
? |
N |
1 |
U |
N |

TapeBagel |
Language based around arrays of 3 integers. | L |
I |
Y |
? |
N |
1 |
U |
N |

Taxi |
Thematic language based around a taxi. | L |
I |
Y |
? |
N |
1 |
I |
N |

THRAT |
Brainfuck extension with a 2-character notation. | L |
I |
Y |
? |
N |
1 |
I |
N |

Threaded INTERCAL |
INTERCAL with multithreading via COME FROMs. | L |
I |
Y |
? |
N |
1 |
I |
N |

Thue |
Turing tarpit based on string-rewriting. | L |
R |
Y |
T |
N |
1 |
I |
N |

Tiny |
Reverse-Polish language using only assignments. | L |
I |
Y |
P |
N |
1 |
U |
N |

TMMLPTEALPAITAFNFAL |
Language that changes its syntax every day. | L |
I |
Y |
? |
N |
1 |
I |
N |

Toadskin |
Minimal language based on Brainfuck and Forth. | L |
I |
Y |
? |
N |
1 |
U |
N |

Tory |
Language that resembles Tory election pledges. | L |
I |
Y |
T |
N |
1 |
I |
N |

TRANSCRIPT |
Programs resemble IF transcripts. | L |
I |
Y |
? |
N |
1 |
I |
N |

Trigger |
Language based around patterns in the source file. | L |
I |
Y |
F |
N |
1 |
I |
N |

TriINTERCAL |
INTERCAL modified to use base 3 values. | L |
I |
Y |
? |
N |
1 |
I |
N |

True |
False without random-access storage. | L |
I |
Y |
? |
N |
1 |
I |
N |

TURKEY BOMB |
Data can have fractional, negative, or infinite size. | L |
I |
Y |
? |
N |
1 |
U |
N |

Twimp |
No numeric storage; asymmetrical I/O. | L |
I |
Y |
? |
N |
1 |
U |
N |

TwoDucks |
Language based around Time Travel. | L |
I |
Y |
? |
N |
1 |
U |
N |

Udage |
Pattern programming; data type is a bit+pointer. | L |
I |
Y |
U |
N |
1 |
I |
N |

Unassignable |
Reversible OOP language with no recursion. | L |
O |
Y |
? |
Y |
1 |
I |
N |

UNBABTIZED |
More elaborate Brainfuck with arithmetic. | L |
I |
Y |
? |
N |
1 |
I |
N |

Unlambda |
Eager functional combinatory logic language. | L |
F |
Y |
? |
N |
1 |
I |
N |

var'aq |
Programming language written in Klingon. | L |
F |
Y |
? |
N |
1 |
I |
N |

Versert |
Befunge-inspired esoteric programming language. | L |
I |
Y |
? |
N |
2 |
I |
Y |

Version |
Language based around ignorance-spaces. | L |
I |
Y |
? |
N |
1 |
I |
N |

Wait |
The current time is used as the program source. | L |
I |
Y |
? |
N |
1 |
U |
N |

When |
Statements trigger on variable changes. | L |
I |
Y |
? |
N |
1 |
U |
N |

Whenever |
Statements can be executed in any order. | L |
I |
Y |
? |
N |
1 |
I |
N |

Whirl |
24 statements encoded using 0 and 1. | L |
I |
Y |
? |
N |
1 |
I |
N |

Whitespace |
The only characters used are space, tab, newline. | L |
I |
Y |
? |
N |
1 |
I |
N |

Wierd |
Based on sharpness and angle of corners of a line. | L |
I |
Y |
? |
N |
2 |
I |
N |

Y |
False-based esoteric programming language. | L |
I |
Y |
T |
N |
1 |
I |
N |

YABALL |
Brainfuck with a more obscure control flow. | L |
I |
Y |
? |
N |
2 |
I |
N |

Yellow Four Code |
Based around being confusing and useless. | L |
I |
Y |
? |
N |
1 |
U |
N |

Ypsilax |
2D nondeterministic rewriting language. | L |
I |
Y |
? |
N |
2 |
I |
Y |

ZOMBIE |
Language designed for evil necromancers. | L |
I |
Y |
? |
N |
1 |
U |
N |

Zot |
A version of Jot with added I/O. | L |
F |
Y |
? |
N |
1 |
I |
N |

ZT |
Diagonal control flow affects commands. | L |
I |
Y |
? |
N |
2 |
I |
N |