nyuuzyou/wikis huggingface dataset:
TOD

TOD (Time of Day) is a tape-based language designed by User:null in 2010. What its instructions do when executed change depending on the current time of day. The design goal was to make running Hello world take longer than compiling OpenOffice.org.
==Instructions==
nop
do
==Execution==
The pointer points to a cell in a right-infinite tape of bytes, initially all zero. The instructions in the program are loaded into memory, where each bit in the program corresponds to either nop (when 0) or do (when 1). The loaded instructions are then executed sequentially.
Whenever the nop instruction is encountered, one second is wasted, and execution continues on the next instruction as normal. Whenever the do instruction is encountered, it performs the operation corresponding to the current time of day in the following table.
Time of day 	Operation
Early Morning (sunrise to 8:00am) 	Increment cell at pointer
Morning (8:00am to 12pm) 	Move the pointer forward.
Afternoon (12pm to sunset) 	Move the pointer backward.
Snack (2pm-3pm) 	Decrement the cell at pointer
Night (sunset to sunrise) 	Output the byte at the pointer as ASCII.
Exactly on a transition (e.g., sunrise, 12pm, 2pm)	Input a byte and store it at the pointer as ASCII.
00:42:00 	Skip next operation (do instruction) if current cell is 0
00:00:42 	Jump forwards/backwards according to current cell value
== Errors ==
The interpreter MUST report an error if the start time is not 00:00:00. All instructions MUST take one second. If this can not be guaranteed by the compiler execution SHOULD report an error.
== Time Zones and related matters ==
The operator MAY supply a time zone to the interpreter to use. If none is supplied the interpreter MUST use UTC as its time zone.
Sunset and Sunrise occur at 7:00:00 am and 7:00:00 pm respectively although an OCD programmer MAY as an extension to the language supply a table of the correct sunrise and sunset times.
== Testimonials == 
=== jp ===
<jp>	you use whatever makes you life easier
<jp>	TOD is my unit test framework
<jp>	good for regression testing lunar phase races
=== hegpetz ===
hegpetz - It stands the test of time
=== sdelmore ===
TOD: It's about time.
Category:Languages
Category:2010
Category:Unknown computational class
TOPL

TOPL is a programming language where instructions are simulated by trains moving on tracks between stations. The creator, User:Hppavilion1, is not actually a train fanatic.
== Syntax ==
A TOPL file is actually a directory (or a .zip or .tar.gz if the implementer feels like doing so) that has static-name files telling the interpreter various parts of the program, making it a form of Matrioshka language. The bare minimum file structure is as such:
 /
 ---- delays.cfg
 ---- graph.json
More files may be added as the language develops.
TP

TP is a language created by ender_scythe in November 2016 as a fun little project. The language is centered around using toilet paper.
==Language overview==
TP is based around rolls of toilet paper. These rolls act as cells on a tape. Each roll starts at 255 sheets, and can be used at will. Once a roll reaches an insufficient amount of paper, the programmer must get a new roll, and cycle to it. TP has two conditonal operators. The conditional operators are both WHILE loops.
TP has 10 commands, the main being a subtraction operator.
Command	Description
USE TP 	Decrements the current roll by 1.
NEW TP 	Moves to the next roll.
OLD TP 	Moves to the previous roll.
GET TP 	Adds a new roll to the pile.
REM TP 	Removes the newest roll from the pile.
YES TP 	If the current roll is greater than zero, do this.
NUL TP 	If the current roll is zero, do this.
END TP 	Returns YES TP and NUL TP loops.
DIS TP 	Display the ASCII value for the current roll.
ASK TP 	Takes an ASCII value and subtracts that from the current roll.
==Examples==
This displays ü.
 USE TP
 USE TP
 USE TP
 DIS TP
==External resources==
* Original Interpreter (Dead link)
Category:Joke languages
Category:Turing complete
Category:Cell-based
Category:2016
Category:Implemented
TPL

This is an idea that I had, that I really think is cool.
In TPL, each variable actually holds 3 different objects, depending on usage and keywords. It can hold a table, a function, and a variable.
To define a variable, you use var hello = "world". Tables can be defined with table objects = [1, "two", "three"], and functions with func double(x) = { return x * 2 }.
TPL includes automatic type parsing for variables, so you don't have to use the keywords for definition. To quickly define multiple, use double square brackets like tpl = [[19, func (x) {print(x)}, [1, 2, 3]]]
In TPL, semicolons are permitted under normal rules, but you can also use line feeds. Comments are denoted with // this is a comment.
== Builtins ==
Function 	Usage 	Explanation
print() 	print("hello") 	Prints the argument. If printing a table or function, prints the definition.
input() 	input() 	Takes user input as a string.
inputnum()	inputnum() 	Takes user input as a number. If any characters are not in [0,1,2,3,4,5,6,7,8,9,-,.], it returns an error.
assert() 	assert(1 + 2 == 3)	Errors if the argument is falsy. Falsy objects include empty tables, "", False, 0, and functions with no input, output, or returns.
I honestly can't think of any more, except the obvious ones.
== Examples ==
=== Hello world ===
print("Hello world")
=== 99 bottles of beer ===
for (i = 99, 1) {
if (i == 1) { print("1 bottle of beer on the wall,"); print("1 bottle of beer!") }
else { print(i + " bottles of beer on the wall,"); print(i + " bottles of beer!") }
print("Take one down, pass it around,")
if (i == 2) { print("1 bottle of beer on the wall!") }
else { print(i + " bottles of beer on the wall!") } }
=== fizzbuzz ===
i = 1
while True {
if (i % 15 == 0) {
print("fizzbuzz")
} elif (i % 5 == 0) {
print("buzz")
} elif (i % 3 == 0) {
print("fizz")
} else {
print(i)
} i++ }
=== recursive fibonacci function ===
fib(x) = {if (x <= 2) {return 1} else {return fib(x-1) + fib(x-2)}}
=== truth machine ===
in = inputnum(); if (in == 0) {print(0)} else {while (True) {print(in)}}
Category:Languages Category:2022 Category:Turing complete Category:Unimplemented
TPLTSSPP

==Creator and Name==
TPLTSSPP is a joke language created by the User:Esolang1. The name is the initials of The Programming Language To Solve Simple Programming Problems. As the name points out, this language only has instructions for simple programs, such as FizzBuzz. (E1-0002)
==Instructions==
Command 	Meaning
helloworld() 	Prints out “Hello, World!”.
bottlesofbeer()	Prints out the lyrics of the song “99 Bottles of Beer on the Wall”.
add(a, b) 	Prints out the sum of a + b, where a and b are real numbers.
sum(a) 	Prints out the sum of all natural numbers up to a.
sort(a) 	Prints out the sorted list of elements a.
randreal() 	Prints out a random real number between 0 (inclusive) and 1 (inclusive).
randnum(a, b) 	Prints out a random integer between a (inclusive) and b (inclusive).
fibonacci(a) 	Prints out the first a Fibonacci numbers, where a is a non-negative integer.
factorial(a) 	Prints out the factorial a!, where a is a non-negative integer.
fizzbuzz(a) 	Prints out the first a elements of the FizzBuzz sequence, where a is a non-negative integer.
palindrome(a) 	Prints out true if the string a is a palindrome, otherwise prints false.
checkprime(a) 	Prints out true if the natural number a is a prime, otherwise prints false.
factor(a) 	Prints out the prime factorization of a, where a is a natural number.
==I/O==
There are no features that can handle inputs.
==Memory Structure and Code Structure==
There are no features that can handle variables. Any code written in this language will be a bunch of functions, and they will be executed in chronological order.
==Examples==
===Hello World! Program===
 helloworld()
===99 bottles of beer program===
 bottlesofbeer()
===Sorting===
This program sorts a list of numbers:
 sort([8, 3, 1, 2])
===Prime Factorization ===
Prints the prime factors constituting the number 120, that is, (2, 2, 2, 3, 5):
 factor(120)
==Interpreter==
* Common Lisp implementation of the TPLTSSPP programming language.
Category:Joke languages Category:LanguagesCategory:Unusable for programming Category:Output only Category:Implemented
Category:Total
TREE(3)

Tree(3) is a language based on Chinese and Korean.
It uses quintal and decimal, has 93 registers.
If you want, you can write the function of program on this thingy.
== Syntax ==
Tree(3) is like Malbolge.
== Programs ==
=== Hello, world ===
 壼늿䉥监灅繻紌。
=== A+B Problem ===
 姞藧婯긋悬稏奐埲澃㿊㻨갨渋瘷蔮泻兣䊍㐀。
=== Cat Program ===
 埮䛔쁍䤇냭嘞蕸娩䘤뛻볎봘緥졉獲縡噞统幯䰲眴곽啨蠆汿㾛㸩壿䗒爧䣆萼椁뇾䄭츇續밴蕸냳䦫裒셎蠡暔㑬。
=== 99 bottles of beers ===
 緋㒇僙脐텵侒䀐뱤䦉뻩芙䩃㡁仒츖幡둏玼䡩㪣쓮㪂쨇㪮唆캫䶒㔚㔛薧嚕
 窴㹩動脈䢜悓攲텟抨뚱蛎돵흑궬㭕훒䕎堪娬裡蜉孑罉㒋팶䶰켍各爊맕犲
 弩弱斢뿝冓望琔멫긮봻箱㡉䤛잲㐀。
Or even longer: 
췒㒇僙脐텵侒䀐뱤䦉뻩芙䩃㡁仒츖幡둏玼䭘槖죈洋뫳耸䛕蕲罹㜾㼙㒎挝삩蠀仫흟쏐멨羾䙍籪堕柌쑜啉䶬凐律䫍姛㶸屔慀翻葂䤋萲冚汤忒뤜䌉蒚嵬䎕핯횾힒䔘㤶芍헫䫯蜥吸㱵穬瀲
㸍䏣뻧포宼蛐㧭펕풘渖슃항嫩꾆亴렽쁆粧쁮롬䃿職油犖䮆䣒뉥璠洱햽첝쁎㙭岅䡌螅榏叭䯿꿙匡䍫蘖썒炴呙恴䦀稜毉민疯랜琩㭌櫗芉횝肌宴좇쳟쭣揸乍宱㻄衇仜룆䱙廞솯埁퇥䈻쑩
蔟찛볫澶쥢䢒䖧홟坏竲퀑䃅휎뵀혶䶃癖뭴䍮녰氥뺳汁焣䬬늴둷抐螪돳縞남簎䉹昻褁沞䬻텓煎擿䊏죓根䖌䨍瓆됡処풐뤳뷝禺뤃㭹왎䈉厺녝緌䵡愭뜵筵㔨畘哞䭲瀩曐兄祸쎰칡蒡䐻抔
팛㹻罇퇵䶯嵷꺁픟쓼묌䘒帻㠱뫈曈佾쓊绋쭖巫䍋㴘맊뭖쾷㪷뵇폂媒嚗埴憩榈䒥䲮㮦䄃퉩嵎㙀。
=== Even or odd ===
 囊㶦죤쿂몈小켦睇봺氀䄿䌞줒䒑䜣쟦쵢䯸둏磶穣왷랜矹晹씬斬峛蒃땦亓꿘㧫㪻㒜㐀。
=== Truth Machine ===
 잤瓗䟱孍畉佻뢪啞죮蜍度絪弋萠妐뤙욨흁쩌䂙檰䶂囌笧뇩릾같쓶嘩怉漬퐪夞搲潘焴嫿腡䒗籇䔹嗾剔㱝睵僚搦뮈㦊샭芚츠瞝痗扏짟샸㾀塖萉앧뙋廧㰦짾疤쵣呉㗓핢덉잾稽밨沭펭꾾줨瀅츠㿜쨴㱂㻜栒专䴤啖훪훲䨙곑끗엩淑㽎쀜되菸皆艻刍獾䚓砌翮継晨嘴峊셼埕华皡灰㼎㐀。
=== Never gonna give you 凵尸 ===
网㒅㛉儾勍푪䀩뙹줙瘜툫宱䝯婥䓭愨데狰梹类䄀䓍薢仔时未㸙숳唼屭갌㔯땇抅艧쇓쌯
徒樷꼽䙺凊垄秄剏棩쨠碈룩悡澴秙栛础핇嚍뢴싪켉㹞侚떥墄닰秌㒺퍶拰샼册즬턹벌뛔
柙뗪屯杉禺쨐뾘㖤嶴䭠嶊둧畎棺怏䨠薇䂙㺥늶웜띍萄㤆䐀썇뺼瑽穈㩄䜩塅두퇙寺숐폓
뻒壆筒헚尩嚱뽮먍퇇螜弹횊㵑慘裛挆면獠溟佹䮄䋫柹䨪쉾㲌븟渖蚱뾄꼞戇㧵겔注햅홒
入줸㘪㮢䈻稥㔵뚋束䬢禖좾쯻呓曘떽㰛㞟䑸굡樁즖䥯욲蘐扱㮠㴳㢳꺗훾嶞먎䒭熎樦氎
䖉玾䈢䛶恛䱚削몑憫㫷얁薮쐒찯궺戟芤䌐玢딃쟁갑㕆墩췅攂瑮凅编휣췟嘃㝣깽팽槷놠
쪹欠笒㒸㐀。
=== F1ZZB凵ZZ ===
옦㒆䓐嶼係륙捤쌲䳢훨㓭저忰汞䢼埔䄥빛뒺䓳䴸筫䦭뚣슈줖烒䁻産㜱폛橍姇㮉䛲湊虈흋큣텇쾭떙
콧买䚲䈔莃䍗泋뵞몝뼮쏾棑䆫멷挰촏棁䎒웨䆂빖䣯湵籔兆퐯솢苞쮺튺䤣捄湾妿㺃겜욹棜昵敭戧嚎
프痯唈燣宐碔뱋傳꼡淺岙樃㼌뭖薃劬뤮컨蒘䛀蔒랓뮖뒇葥챏呴窰켋箛뾇薐庚䀀。
== Categories ==
Category:Languages Category:Joke languages Category:Turing complete Category:Turing tarpits Category:CJK Category:Pseudonatural Category:Unimplemented
TREE(3)//

裐㒏烪㷤㻳蠝쾭繙䮘䰵檘琼澺塨茍䚮桙떘䙹멙䈑긡斿擽燚쨦웖똻훨삻蓧籍쫍㤰櫺䐃汕糖퀯刵咫뚍쪳䰺蟖뀬뱗툞츹繻넔薜䟌碤桉䫤㴊吐嫶侴듰좞듪囃儓妳偪㭋쉢얰殍栵쮠䮬獉뀶갎殽킕狻돧紐絍솉쟠紺탽읤컸芫哚홳웛聉坧잶넬缳썺畓츨歏쑴愒虒盺蟏믏䋮짽컿풷至걨彗휝띪㔤㢁䢷珕䴧대墏䤿嘽揇낑塭㶪決暰吮줆万툿珅춗즏曥㟞傼舲儑台䕟헂睻㞞㴜쳑닡泏깬䦟屑뇽捷裚墰㿝俈껅䃪箲艑쌸슞䒐땼汯䔡㫍뀸㕣쐺봒뤒杢럒莧凵昚잙忆簩텇薌穷洴늂扯뉅묐䲍帲攷췛㳕堡솁渞폼삗呎㲒危窱䄶쐊퇿종枲塈㩦溅䴊涽뛳傅灴殙엍㧣힖畬㗖獐㪻췫㡊悢滝쉯熕攀겨떥犰탴和婱蘝磼캴翧뱻漳럖弞縶쳆嵼侠쟍絯퓊먋륮啾仪쀦꽴뒭膰灝波嬐놣焟巭慙껣疞莲余穋둂泵㬩㜶峞㬌㞲甾㯔췕찞섯몘䍂䬐㛡썦뢡嫉倰휔纤窬䝹땦웄뙧壄꺋㚡绋緼각渤艿횾께忡뺰媺垟㥁䫦㢜䍰囅凔甊坅渭璘뛨䉥嫭뱃䉘枭円㣮炎荐葇헷徫㖬纙媯릤껺媺젼咩쫕嗡䈎帱衭蘐뛎㣸쿞쫓季欰겫긽狎燃쒺旨회嶼퓬摈痤浆娆딹곕낪簺늎㕶嘆퓧퇔矾埡퀆柜쵈婆槧쇦뽖㖤㵜㩱댨猜뻬昿瘧탆컥㣗敲砩쎢땃둱峵䪭堾칱폝壡쇝똌糐좃惋滕妜嶒悷냹깾옋蘿륫皭뙁씚䛡洞콥훱羫绺봄蜅쎙炯횊歈焽㧧쑟츍徰聜힆걒턭꺲款渦뙪㥮绑筁䖺葝褕퐠䖽㼸틉㽩틜䑬橻쥪첻堤刬殤严屧伂㸙갟䕿崜쨋줻뿦쥾㛙㯶멖죤㷳첰䪞灚喽氆侹䤜㦯喛䇉猤믊펴㞘칄툱獌梊꿷㾋葺䈬埇㭡梧坂띵蒝뎗蓖梱暈姌䛧쬩崦㭖䏩似㓯紿嗚쨙璊懿겢蔶샘䀧燄笙쉀螒룞큡닁榡뗑噫똣擬왣嫢뇕幽밤음쉡깖됅伏튎춙俿偨룞챹쩚槥捔쉟終䁬挛摎㽍뗋区䟞矛훌狐棥턠剾쫒멒늆㩵줞뻈큱㲄현䁺쵃퀥嵻爸俺㒸㐀
TRUE

TRUE stands for Tan Rabbi Up Eckhebber. By User:Twistle
==stuff==
===Tan: i/o===
 ta = input and enqueue
 tn = output top queue item and dequeue
 t.n = output and don't dequeue
===Rabbi: arithmetic===
 ra = add 'n dequeue
 rb = subtract 'n dequeue
 ri = multiply 'n dequeue
 ra. = divide 'n dequeue
 rb. = modulus 'n dequeue
 r.a = add 'n don't dequeue
 etc.
===Up: halt===
 up = halt
 up. = comment until next u.p
 u.p = end of comment
===Eckhebber: queue and flow control===
 ec/x/ = enqueue x(decimal)
 ek = dequeue
 eh/x/ = enqueue x(octal)
 ee/x/ = enqueue x(hexadecimal)
 e.e/x/ = enqueue x(ascii)
 eb/x/ = enqueue x(binary)
 er = enqueue instruction pointer on to stack
 e.c = instruction pointer = top item on queue('n dequeue)
 e.r = IP = top item on queue ('n don't dequeue)
 e.k/go_collect200dollars/ = goto go_collect200dollars
 \label\ = a goto label
If a dot is after a queue instruction, it means to do the specified action with the other side. Making this both stack based AND queue based. This also applies to Tan instructions.
==examples==
dlrow olleh:
 ec/68/ec/76/ec/82/ec/79/ec/87/ec/32/ec/79/ec/76/ec/76/ec/69/ec/72/
 tntntntntntntntntntnup.Dlrow olleh!u.pup
Category:LanguagesCategory:Queue-basedCategory:Stack-based
Category:Unimplemented
TScript

TScript is a language created by User:Iconmaster in 2013. It is a simple descriptive language used to shorten the amount of code in the programming of turtles in the Minecraft mod ComputerCraft. TScript code consists of single-character expressions, each being expressed as a single ComputerCraft function call. It is a very basic language, and relies on the outside interface to compose the correct sequence for any loops. It technically can compile into CC Lua code.
== Commands ==
Symbol	Function
F 	Moves the turtle forward.
U 	Moves the turtle up.
D 	Moves the turtle down.
L 	Moves the turtle left.
R 	Moves the turtle right.
@ 	Switches between placing and digging modes. Default is digging.
^ 	Either places or digs the block above it.
V 	Either places or digs the block below it.
* 	Either places or digs the block in front of it.
[0-f] 	Selects the slot 1-16. Used for placing blocks.
==Examples==
Dig 2x1 Tunnel (when in infinite loop)
 *F^
Dig 2x1 Tunnel, Place Floors (when in infinite loop)
 *@VF@^
Category:2013Category:Low-levelCategory:ImplementedCategory:LanguagesCategory:Usability unknown
TTyped

TTyped is a simple typed language, consisting of only function definitions. It is loosely based on System F. It consists entirely of a series of function definitions. Each definition has the general form of
name args : type = expr ;
== Notes ==
* Every symbol in a function type is assumed to be polymorphic.
* All functions are curried.
* -> and →, are both parsed the same.
== Examples ==
id x : a -> a = x ;
const x y : a -> b -> a = x ;
one f x : (a -> a) -> a -> a = f x ;
add m n f x : ((a -> a) -> a -> a)
 -> ((a -> a) -> a -> a)
 -> (a -> a) -> a -> a
 = m f (n f x)
== EBNF ==
fundec = sym , {sym} , ":" , type , "=" , expr , ";" ;
expr = expr' , { expr' } ;
expr' = sym
 | "(" , expr , ")" ;
type = type' , { "->" , type' } ;
type' = sym
 | "(" , type , ")" ;
sym = alpha , {alpha | digit} ;
== External resources ==
* An implementation on GitHub
Category:Languages Category:Implemented Category:Unknown computational class Category:Usability unknown
TUBSOIL

==Creator and Name==
Tubsoil is a joke language created by the user: User:Esolang1. The name is the initials of The Ultimate Brainfuck Style One Instruction Language. As the name points out, this language only has one instruction. (E1-0002)
==Instructions==
 ADDONEANTOCURRENTCELLVALUEUNDERPOINTERANDMOVCURRENTCELLVALUETIMESTOTHELEFTIFCELLVALUEUNDERPOINTERISLESSTHANOREQUALTOZERO
 Adds one to current cell value under the pointer, and moves current value under the pointer value times to the left
 if current cell value under the pointer is less than or equal to zero. Most of the time, the cell value will be negative,
 so that means the pointer will move to the right.
==I/O==
No functions related to input or output exist.
==Memory Structure and Code Structure==
Tubsoil uses a tape-like memory structure with the length being limited only by the hardware memory. The only existing instruction not needing anything to execute allows the program to run on no code. This means that the only instruction will run again and again on the memory until the pointer cannot move(Cell value under pointer is larger than or equal to zero.).
==Interpreters==
Unfortunately, there are no interpreters built for this language now.
Category:OISC
Category:Joke languages
Category:Cell-based
Category:Unusable for programming
Category:No IO
Category:Brainfuck derivatives
Category:Zero-dimensional
Category:Non-textual
Category:2021
Category:Languages
Category:Unimplemented
TW'sLE!!!

TW'sLE!!! (stands for The World's Longest Error!!!) is a joke esolang by User:iddi01 in which every single program instantly raises an error about 470000 lines long, the world's longest error.
== Errology ==
Errology is (obviously) the study of errors and how to produce them. It is one of the few things that depends heavily on version numbers (and most of the time, earlier versions are better). Errology allows for making unimaginably long errors from very compact code (such as TW'sLE!!!), very weird/unusual errors (and more unusual than you could imagine) and error-reliant programs (such as the interpreter of Mеmоrу which uses KeyboardInterrupt error as a prompt to start execution).
This page is an introduction to Errology and what amazing things could be done with it.
== Implementation ==
=== Python 3.8.10/Ubuntu 20.04 (clsmvks2.py) (Please make sure that the filename storing the program is clsmvks2.py or won't work) ===
 def importer():
 try: CM()
 except:
 CM()
 finally: CM()
 class CM:
 def __new__(cls):
 try:
 return clsmvks2.CM.__new__(cls)
 except Exception as exc:
 try: raise Exception from exc
 except Exception as err:
 try: raise BaseException from err
 except BaseException as trd:
 try: raise PendingDeprecationWarning from trd
 except PendingDeprecationWarning as trderr:
 help('hwcae')
 import clsmvks2
 try: importer()
 except: importer()
 finally: importer()
Place a file named hwcae.py containing the line below in the same folder as the program or the error will be much shorter:
 dwcae = type('cannotdir', (object,), {...: 'abc'})
==== The code is not working in latest Python versions, so here's a much weaker one to compensate (tsterr.py): ====
 def err():
 try: err()
 except RecursionError as exc:
 try: import tsterr
 except: import tsterr
 finally: import tsterr
 raise PendingDeprecationWarning().with_traceback(exc.__traceback__) from exc
 finally:
 try: import tsterr
 except: import tsterr
 finally: import tsterr
 try: import tsterr
 except: import tsterr
 finally: import tsterr
 try: err()
 except: err()
 finally: err()
The best error programs are written in Python 3.6/3.7 which means the earlier versions are so much fun :( 
and downloading them is recommended if you're interested in Errology.
Category:Languages
Category:Joke languages
Category:Nope. derivatives
Category:Implemented
Category:Unusable for programming
Category:2024
Category:Total
Category:Output only
Category:Zero-dimensional
TXt

tXt is every brainf**k derivative, on account of it being a derivative of Xt.
== Syntax ==
A tXt source code file (.txt) is structured similarly to Xt, with a set of TrivialBrainfuckSubstitutions defined by a set of eight characters:
 ><+-.,[]
 ++[>+<-]
The difference in tXt is that each "code" line also functions as the "definition" line for the next line. The character restriction imposed by Xt (namely, that once a character is defined and used it can never be defined again) is absent in tXt because of its even stranger syntax. However, this means that if a character is given a definition and not used, it will keep its definition until changed.
tXt only supports the eight original brainf**k characters, in addition to the numbers 0-9. This difference makes Xt programs not run in tXt.
== Example Programs ==
 ><+-.,[]
 +[>.+<]0
I'm pretty sure this will print the entire ASCII character set repeated endlessly. However, I have no interpreter to check if I'm right.
Help.
== See Also ==
* Xt
* TrivialBrainfuckSubstitution
Category:Languages Category:Cell-based Category:Low-level Category:Turing complete Category:Brainfuck derivatives
T a b

t a b is a minimal esoteric programming language for the 23rd century. It is pretty much the exact same thing as Small, but even more arbitrary and harder to read! Made by newtykins. Play around with it using the online compiler/interpreter here.
Check out the GitHub Repo full of interpreters and compilers in various languages, and pre-generated examples!
It has 2 commands:
* " " (space) increments the accumulator.
* " " (tab) outputs the accumulator as an ASCII char.
When the accumulator reaches 255, it resets back to 0, and a command is skipped.
==Examples==
Due to t a b's nature, it is hard to show examples formatted in a readable way, as 99.9% of the text is invisible. For this reason, you can find the examples generated in the examples folder of the GitHub repo.
Category:Implemented Category:Languages Category:Joke languages Category:Unusable for programming Category:Total
Tab

Tab is an esoteric programming language inspired by tabs in a web browser after discovering that closing a previously clicked page leads to a special mechanism in User:A's web browser.
==Syntax==
Input/Output is for debugging.
₦x: Click(i.e. navigate to) page x. This will link to the previous page clicked. Navigation to a blank page is an error and this makes Tab halt immediately.
†x: Create a new page named x. It will automatically be clicked as it ends the previous page click linking. If there is such a page, do nothing and ignore input commands.
ɖ: Close the current page. It will navigate to a previously linked page.
←: Navigate to the previous page link (if there is a previous page link)
→: Navigate to the next page link (if there is a next page link)
¢x: Navigate to page x if the current page's name is zero. Navigation to a blank page is an error and this makes Tab halt immediately.
ː: Debug. Output the current page.
…: Debug. Change the current page as one line of input and halts when input is EOF.
When all tabs are closed, the execution halts(as the browser closes by default). Otherwise, it continues as the program counter goes page to the beginning.
==Example(s)==
===Output 1===
†2†1₦2ɖː
This outputs 1 and only 1 because 1 will be navigated to after 2 is closed.
===Infinite loop===
===Cat program===
†1…ː
===Truth-machine===
†1…ː¢8ː
Category:Languages
Category:2019
Category:Unimplemented
Category:No IO
TabP

Fell into hell of () ? Tab is coming to "save" you. 
Tabp is Lisp with tabs (or spaces) instead of ().
 (a b c d e)
to
 a
 b
 c
 d
 e
and
 `(a b c)
to
 `
 a
 b
 c
=example=
 (if (> 1 2) "weird" "sane")
 if
 >
 1
 2
 "weird"
 "sane"
calculate sqrt (from SICP)
Lisp
 (define (average x y) (/ (+ x y) 2))
 (define (improve guess x) (average guess (/ x guess)))
 (define (sqrt-iter guess x)(if (< (abs (- (square guess) x)) 0.001) guess (sqrt-iter (improve guess x) x) ))
ofc you can't read ()
Tabp
 define
 average
 x
 y
 /
 +
 x
 y
 2
 define 
 improve
 guess
 x
 average
 guess
 /
 x
 guess
 define
 sqrt-iter
 guess
 x
 if
 <
 abs
 -
 square
 guess
 x
 0.001
 guess
 sqrt-iter
 improve
 guess
 x
 x
 define
 sqrt
 x
 sqrt-iter
 1
 x
 sqrt
 2
NO () ANYMORE (
Category:Languages
Category:Implemented
Category:Meta-languages
Category:Functional paradigm