New pages

00:52, 2 February 2026 ‎StupidSentences (hist | edit) ‎[1,766 bytes] ‎A() (talk | contribs) (Created page with "StupidSentences is a language made by User:A() where you write nonsensical sentences == Syntax == All words must be actual words. For example, 'word' is accepted while 'wword' is not. Also, all sentences must have a subject, verb, and object, or subject, verb in that order. Words like 'is' must be in between the subject and verb. Length is counted by adding the total length of subject, verb and object. Numbers go at the end of the sentence. '.' doesn't count as a...")
23:25, 1 February 2026 ‎Ring-around-the-Rosie (hist | edit) ‎[3,204 bytes] ‎Salpynx (talk | contribs) (a semi-joke 2D idea... super- and sub-script syntax needs finessing)
18:28, 1 February 2026 ‎Lucky Ball (hist | edit) ‎[925 bytes] ‎RainbowDash (talk | contribs) (luckyball ya)
14:54, 1 February 2026 ‎Better-machine (hist | edit) ‎[1,533 bytes] ‎ZachMadeAnAltBecauseHeLostThePassword (talk | contribs) (truth-machine, but better)
08:52, 1 February 2026 ‎Bitwise Cyclic Teap (hist | edit) ‎[1,541 bytes] ‎None1 (talk | contribs) (Created page with "{{lang|a=User:None1|n=Bitwise Cyclic Teap (BCTp)|f=a derivative of BCT where data is stored in a heap (a.k.a: priority queue) instead of a queue}} ==Commands== {| class="wikitable" |- ! Command !! Execution |- | 0 || Delete the ''smallest'' data-bit. |- | 1 || Goto the next command (say x). If the ''smallest'' data-bit is 1, insert x into the data-heap. |} ==Interpreter== ===Python=== <pre> from time import sleep from heapq import * class CyclicList(list):...")
07:17, 1 February 2026 ‎👨‍💻 (hist | edit) ‎[560 bytes] ‎Chocguy (talk | contribs) (Created page with "==👨‍💻== The goal of "👨‍💻" is to try and create a working esolang with emojis. 👨‍💻was created by Chocguy at the start of 2026, around 1/02/2026. ==Function== Currently there isnt much function but as time goes it will be updated ===Symbols and functions!=== EXAMPLE ⬇️⬇️ 🌑, Sets value to 0 EXAMPLE ⬆️⬆️ 🎙️, Asks for user input (or uses user input) ⬆️, Increments a value ⬇️, decrements a value 🫵, outputs a ascii...")
06:34, 1 February 2026 ‎D/Q (hist | edit) ‎[4,056 bytes] ‎Yayimhere2(school) (talk | contribs) (Created page with "'''D/Q''' is an extension to DQ, which is turing complete, and has less stacks than TDQ. It uses only two stacks. It was made to fix the problem of ℕDQ, while not increasing the stack count. == Memory == D/Q has two stack, and a pointer that points to one of them. The symbols <code>1</code> and <code>2</code> can be on these stacks. == Commands == D/Q uses the following commands: {| class="wikitable" ! Command !! Meaning |- | <code>$</code> || Go to the sta...")
16:24, 31 January 2026 ‎NFOS (hist | edit) ‎[2,295 bytes] ‎Yayimhere2(school) (talk | contribs) (Created page with "'''NFOS''' is a language created by User:Yayimhere, based on the idea of, if you have the current program, memory state, and new piece of data you want to add, there exists only one unique program, that when appended has the wanted effect. It is quite the "useless" language, alike Cabra, though unlike Cabra, it doesnt really look like a subset of a larger language. All its keywords are in danish. It is very messy(because it was defined quite "lazily". It will mos...")
15:36, 31 January 2026 ‎Alphabrain (hist | edit) ‎[2,320 bytes] ‎LavaSalt402 (talk | contribs) (Made the AlphaLang page)
05:14, 31 January 2026 ‎MØSS (hist | edit) ‎[8,251 bytes] ‎PrySigneToFry (talk | contribs) (Created page with "MØSS(pronounced as /mœs/ where /œ/ is a rounded /e/) is designed by PSTF and his AI friend. This language is an interpreted language, formally called 'Meaningful Object-oriented Simple Syntax', and is usually abbreviated as 'MossLang' (not 'MOSS', to distinguish it from something with the same name in a certain science fiction novel). = Language Overview = <pre> # Variable Declaration (Weakly Typed) name = "Alice" age = 25 is_student = true # List (Mutable Array) n...")
14:21, 30 January 2026 ‎BitPush (hist | edit) ‎[824 bytes] ‎Otesunki (talk | contribs) (Created page with "BitPush is an esolang created by MJM ([https://512b.dev/mjm/ homepage]), and first publically described in 2021 on User:Truttle1's discord server. Code and data are both stored on an array of stacks of bits. The following is the original description, word-wrapped to 60 columns: BITPUSH Bitpush data is contained within blocks of binary, which are executed in sequence. Bitpush source code is put into the first block before execution. All other blocks start empt...")
12:43, 30 January 2026 ‎Ételp moc gniruttéy gnitir wérgnirts (hist | edit) ‎[6,334 bytes] ‎PrySigneToFry (talk | contribs) (Created page with "Ételp moc gniruttéy gnitir wérgnirts(Official pronounciation: eɪtʰɛlpʰ mɔkʰ ɦniɾutʰeɪj ɦnitʰiɾ ʋeɪɾɦniɾt͡sʰ) is designed by PSTF. If you remove the diacritical marks and read it backwards, you get 'String rewriting yet Turing-complete,' which is what category this programming language belongs to. But this language has nothing to do with cirt e mys or noit o' mnain worb and is an i...")
09:57, 30 January 2026 ‎Monky (hist | edit) ‎[8,882 bytes] ‎Menguinponky (talk | contribs) (Created page with "MONKY is a language currently under development by User:Menguinponky. It draws inspiration from FORTH, C and FALSE, it uses a data stack and reverse polish notation. All keywords are single characters, all values on the stack are chars, literals are signed The effect of each instruction can be documented in the stack effect notation known from FORTH: (elements on stack before -- elements on stack after) push operations (-- n): 5 push literal to stack -5 push...")
05:04, 30 January 2026 ‎Harmonity (hist | edit) ‎[906 bytes] ‎PrySigneToFry (talk | contribs) (Created page with "Harmonity is designed by PSTF to "massificate" Raymond. = Conversion sheet = <pre> μ = mys# ε = greek# ② = aexp Š = string ! and ¡ = True and False ⍜ = bool Λ = function □ = list ⌒ = pair Ⓘ = comp Ⓩ = type ✝ = any ○ = None ⌗ = typeof ⎕ = stdinout ⌺ = stderr ⍞ = msginout ⌻ = stdlog ⍁ = eraser ← = <- Algebraic symbols are keeped, but √ is abandoned. ⍬ = NULL (b)↘{a}↖ = while b do a end b?a:c = as is b?a:c(where both a and c a...")
13:57, 29 January 2026 ‎Raymond (hist | edit) ‎[7,140 bytes] ‎PrySigneToFry (talk | contribs) (To be continued...)
22:07, 28 January 2026 ‎Albuquerque language (hist | edit) ‎[9,892 bytes] ‎RikoMamaBala (talk | contribs) (Created page with "'''Albuquerque language''' is a programming language made from the entirety of Albuquerque lyrics. You can add syntax to chunks of the song, like: I said, "You got any [x] donuts?" He said, "No, we're outta [x] donuts" can mean some instruction with an argument of x. There are no rules except no uncomputable instructions nor deleting someone's work. ==Instructions== <pre class='rectwrap'> Way back when I was just a little bitty boy Living in a box under the stairs in...")
19:09, 28 January 2026 ‎Print("Hello, World!")/Eviledon program) (hist | edit) ‎[2,539 bytes] ‎RikoMamaBala (talk | contribs) (Created page with "The program is tediously long, like 244KB in size. Luckily, the LZMA compression made it 1696 bytes! So we have a Python script that generates the original program: print(__import__('lzma').decompress(__import__('base64').b64decode(b'XQAAAQAavAMAAAAAAAAhmgkm/hKnNnk9jNYPXoIfQHGCg1GgwpX6NUYzSuB+/9UbwcHyh5PD2GaokPvnL1Y0jr6qEvHAj83/C7FXt3D5oRcC4xmpIlVrNCX0JVRZ1ZQ4X3kjppEoO41m4ybwLxIZK6tc6xi4KoVWxGazikfruyH4k7GMkWJ0/uQvEnOL+a0lE+0WzCylFdTeC7HTdxRKa5fe6py2y8uNIuKXRewtYX9f2EqR...")
14:40, 28 January 2026 ‎((()))(((())))=5 (hist | edit) ‎[1,248 bytes] ‎Dragoneater67 (talk | contribs) (create)
02:06, 28 January 2026 ‎RedDust (hist | edit) ‎[5,810 bytes] ‎Synt-xError (talk | contribs) (Created page with "{{infobox proglang |image=File:Reddust logo.png |paradigms = imperative, register-based, virtual assembly |author = [https://github.com/synt-xerror SyntaxError!] |year=2025 |memsys=register-based |dimensions=one-dimensional |class=virtual machine language |majorimpl=RedDust VM |influence=[https://en.wikipedia.org/wiki/Assembly_language virtual assembly language] [https://en.wikipedia.org/wiki/Bytecode bytecode] [https://en.wikipedia.org/wiki/CHIP-8 CHIP-8] |website...")
14:01, 27 January 2026 ‎LongFish (hist | edit) ‎[1,685 bytes] ‎Restruct. (talk | contribs) (added the page)
09:25, 27 January 2026 ‎Tina (hist | edit) ‎[18,228 bytes] ‎Oscarlo (talk | contribs) (Created page with "'''Tina''' ('''T'''his '''i'''s '''n'''ot '''a'''ssembly) is an esoteric programming language with an assembly-like syntax and a deliberately overpowered “ALU matrix” instruction format. A Tina program is assembled into a linear list of instructions plus an initial memory image, then executed on a simple machine with unbounded signed integer cells and non-negative addresses. A reference interpreter/assembler is implemented in Python. ==Etymology== “Tina” is...")
20:34, 24 January 2026 ‎SSEG (hist | edit) ‎[1,066 bytes] ‎LeCo13 (talk | contribs) (Created page with "S²EG or SSEG is an programming language written in only 1s and 0s made by laptopcoder11 ''(idk how to properly make pages, so pls improve if u can)'' instructions: {| class="wikitable" |- ! instruction !! functionality |- | 000n || decrease register-n |- | 001n || increase register-n |- | 010n || subtract reg0 - reg1 and put the answer in reg-n |- | 011n || add both registers and put the answer in reg-n |- | 100nAAAA || move instruction pointer to n(0:l...")
19:31, 24 January 2026 ‎N-Type (hist | edit) ‎[3,160 bytes] ‎Yayimhere2(school) (talk | contribs) (Created page with "'''Not My Type''', named after its lack of actually being a type based language, yet still "claiming" to be, is an esoteric programming language created by User:Yayimhere, based on the <code>N -> (N -> N)</code> type notation. == Definition == Not My Type uses two types of objects. '''Types''', and '''Creators'''. A '''Type''', acting like a function, has one or more definitions, written as <code>x -> y</code>(left associative). This definition defines the case when...") originally created as "Not My Type"
19:04, 24 January 2026 ‎Set Trickery (hist | edit) ‎[515 bytes] ‎A() (talk | contribs) (Created page with "Set Trickery is a set-based programming language that User:A() made. == Commands == {| class="wikitable" |+ Commands |- ! Command !! Explanation |- | <code>(null) || empty set |- | <code>(set{}) || set |- | <code>(a/.../) || define a as ... |- | <code>[a:b] || add a to set b |- | <code>(#a;b#) || remove a from set b |- | <code>*comment* || Comment |- | <code>(b$a$[c]) || is a function that does a with inputs c |- | <code>(!a!) || return a |- | <code> (a%b,c%) </code>...")
17:46, 24 January 2026 ‎Bfppp (hist | edit) ‎[745 bytes] ‎Sourceguy (talk | contribs) (Created page with "'''Bfppp''' is an esolang created by User:Sourceguy. It's an extension of Brainfuck. It contains a standard library, that makes coding in it a bit easier. == Instructions == '''Bfppp supports all Brainfuck instructions, and includes some new ones:''' * # - Comment * @ - reset current cell * $ - output current cell as number * %''name''{''arguments''}(''body'') - define a function * ?''name''{''arguments''} - call a function * = - set current cell to the next char...")
03:42, 24 January 2026 ‎Endfield (hist | edit) ‎[1,800 bytes] ‎Cleverxia (talk | contribs) (Created page with "Endfield is yet another esolang created by User:cleverxia. It's a brainfuck derivative. The commands are due to the fact that when you pay to the game Endfield, it deduces money from a random account, and you can login on your account on other devices wit cache files, and the pool there requires 500 diamonds instead of the customary 160. ==Commands== (note that cells are unbounded) {| class="wikitable" !Command !Description |- | style="text-align:center"| <code>>...")
14:11, 23 January 2026 ‎!NULL (hist | edit) ‎[2,369 bytes] ‎Etqui (talk | contribs) (Created page with "'''!NULL''' is a unique programming language created in 2025. The name refers to the concept of NULL, which means nothing. The language makes "not null" (!NULL) into something functional. == Overview == !NULL uses a detailed command syntax where all commands follow this pattern: !NULL{COMMAND}-:[parameters] == Commands == === Output === * '''PRNT''' - Print text ** Syntax: <code>!NULL{PRNT}-:["text"(Nt)]</code> ** N is an optional repetition count === Variables ==...")
11:44, 23 January 2026 ‎(A)-rightarrow(B) (hist | edit) ‎[368 bytes] ‎Timm (talk | contribs) (Created page with "{{wrongtitle|title=(A)->(B)}} replace (A)->(B) print (A)~>(B) input (A)~>() ()~>(A) digits [#1]~>[#1]/(comment)->(1 are mark digit to output it self) letters {#1}~>{#1} ascii <[#1]>~>[#1] random '(a)~>(a)'/'(a)~>(b)' plus1 (code be long) (i)~>()/(0+1)->(1)/.../(9+1)->(+10)/(!+1)->(1)/(!i+1) test in:10 out:11 in:99 out:100 in:83847 out:83848")
11:21, 23 January 2026 ‎A&S (hist | edit) ‎[1,024 bytes] ‎Timm (talk | contribs) (Created page with "R(0-15) & PC are registers ADD A <- B //comment! SUB A <- B //A and B are pointer ADD PC <- A //jump PC+1+A set SET A <- B: SUB A <- A ADD A <- B not op NOT A: SET X <- R1 ADD PC <- A ADD X <- R2 SUB X <- R1 or op OR A B: SET Y <- A ADD Y <- B ADD PC <- Y ADD PC <- R3 SET X <- R1 SET X <- R1 ADD PC <- R1 SET X <- R0 {{Made|Timm}}")
21:32, 22 January 2026 ‎Mezzo (hist | edit) ‎[2,937 bytes] ‎Stegoratops (talk | contribs) (Created page with "'''Mezzo''' is an Esoteric programming language created by User:Stegoratops in Category:2026. It was inspired by both Forte (thus the name) and Hofstadter. Each expression evaluated redefines the number of the current line. Though, unlike Forte this doesn't happen deeply, the numbers rather serving as weird variable names. ==Syntax== Every line consists of one expression. They are evaluated from top to bottom. If the end is reached the program...")
08:58, 22 January 2026 ‎Calcore (hist | edit) ‎[13,395 bytes] ‎PIIton345 (talk | contribs) (Created page with "'''Calcore''' is an esoteric programming language invented by User:PIIton345. == specification == * Interpreter-based. * Commands, numbers, and characters are written using '''one of''' the supported date notations below: ** <code>YYYY/MM/DD</code> / <code>YYYY/M/D</code> ** <code>YYYY.MM.DD</code> / <code>YYYY.M.D</code> ** <code>YYYY-MM-DD</code> / <code>YYYY-M-D</code> ** <code>MM/DD/YYYY</code> / <code>M/D/YYYY</code...")
05:08, 22 January 2026 ‎C-complete/the string (hist | edit) ‎[283 bytes] ‎Cleverxia (talk | contribs) (Created page with "take the 1st 97381 characters output from this hecagony program: 9|{\2H/2=;r[];6_']5/XB'2_Y/;1#t;5l6+;"97#7[8T]885;/\\}{_vA651kS|2;7;3N]-"k15_0]\6_ws/3/63hN{XZ+7;G|;;11\8;v|75[s\#*4+#|B8t9;2DR/w/;XZ;30\_"X*;[930[=2'_4-ag1i;7#9;_*29=;773L02;K\E9|s0[|T;=_];23Ll64-\G4#;/el|86;0;E\/L;r") originally created as "C/the string"
04:40, 22 January 2026 ‎C-complete (hist | edit) ‎[977 bytes] ‎Cleverxia (talk | contribs) (Created page with "C-complete, as with plushie-complete,PrySigneToFry-complete and all other *-complete's, is a concept; it's proposed by User:Cleverxia(hence the name). ==Requirements== To be C-complete, an esolang must be able to do these: # print "C" # print this string # calculate 1+2^2+3^3^3+...+n^n^...^n(n n's) modulo n+1 for an input positive integer n # do the so-called "(A*B+C)*D problem" # doing any of things above infinitely ==Examples== javascript i...")
16:35, 21 January 2026 ‎Cop e mys (hist | edit) ‎[509 bytes] ‎Yayimhere2(school) (talk | contribs) (Created page with "'''Cop e mys''' is a version of cirt e mys, which modifies the bracket matching, and was created as an accident. It is also as a variant possible to implement in Regex with capture groups. == Definition == Cop e mys is exactly the same as cirt e mys, however, unlike cirt e mys, bracket snapshots match with a copy of themselves. As such, the rewrite rules are: bracket snapshots: b x b -> (x^-+(x^^-))'+(b^)+(x-)+(x') nodes: x p -> p+x* (note that p is the rest of...")
01:11, 21 January 2026 ‎PyBinMath (hist | edit) ‎[141 bytes] ‎U46 (talk | contribs) (Created page with "'''PyBinMath''' is python but in binary. it ''doesn't'' use zeros or 1s instead it uses - for a zero or + for a 1. Category:Languages")
00:47, 21 January 2026 ‎Remove n' Check (hist | edit) ‎[880 bytes] ‎A() (talk | contribs) (Created page with "Remove n' Check is an esoteric programming language that was made to 'interpret' Matching Machines. == Commands == {| class="wikitable" |+ Commands |- ! Commands !! Disc |- | Remove 'ab': n || keep removing ab from input string until none are left, then jump to n |- | Check 'b': n || If current input string is b, jump to n |- | Return 'hello' || Print hello. |} == Programs == === Hello, World! === Return 'Hello, World' === Cat === <code>...")
00:36, 21 January 2026 ‎Matching Machines (hist | edit) ‎[657 bytes] ‎A() (talk | contribs) (Created page with "Matching Machines is an idea invented by User: A(). Basically, a MM does one of two things: :* If all a's match with all b's, halt :* If not all a's match with all b's, or not all b's match with all a's; loop forever ::''note: a's go before b's'' == Examples == ab halts. ba loops. ababab halts. abbabba loops. a and b could be any chars, like (,) ; [,] ; etc.. == Interpreters == === Remove n' Check === Remove 'ab': 2 Check '': 7 Check '(': 6 Check ')': 6...")
14:11, 20 January 2026 ‎~=0 (hist | edit) ‎[2,579 bytes] ‎Yayimhere2(school) (talk | contribs) (Created page with "{{WIP}} '''~=0''' is a failed attempt at a string based mathematical system created by User:Yayimhere. It came out to not work(everything was equal to 0, I think), however it's still interesting to read about. It uses a set of axioms. == Alphabet == ~=0 uses an alphabet called <math>X</math>. Every element of <math>X</math> is a set of brackets(<code>{ and }</code>). Every element can be notated as <math>X</math> with a numeric subscript, is equal as the same number...")
12:01, 20 January 2026 ‎One Singapore (2013) (hist | edit) ‎[540 bytes] ‎Anywaydun (talk | contribs) (Created page with "{{WIP}} {| class="wikitable" style="width: 100%" !Previous !Current !Next |- |Love at First Light (2012) |'''One Singapore (2013)''' |We Will Get There & One People, One Nation, One Singapore (2014) |} '''One Singapore (2013)''' is a joke esolang made by User:Anywaydun meant to look like this part of the National Day Parade (NDP) song of the same name and year: Wooh ho-oh^oh! Wooh ho-oh oh,oh! ==Commands== {| class="wikitable" !Word !Action |- |Wooh |d |-...")
15:06, 19 January 2026 ‎$replacement (hist | edit) ‎[1,238 bytes] ‎A() (talk | contribs) (Created page with "{{WIP}} $replacement is an esolang made by User: A() which was inspired by A=B")
11:31, 19 January 2026 ‎Punching machine (hist | edit) ‎[817 bytes] ‎GUAqwq (talk | contribs) (Created page with "{{infobox proglang |name=Punching Machine |paradigms=Turing Machine |author=User:GUAqwq |year=2026 |class=Turing complete |majorimpl=Unimplemented }} '''Punching Machine''' is a variation of Turing-machine. It has an infinite length tape with left boundary, and has 2 characters only: <code>blank</code> and <code>punched</code>. The amount of states is unlimited. Like a regular Turing-machine, f...")
11:15, 19 January 2026 ‎活鸡 (hist | edit) ‎[3,318 bytes] ‎Cleverxia (talk | contribs) (Created page with "活鸡 is an esolang based off Deadchicken made by User:cleverxia that makes it Turing-complete(by trivial conservation from 3-cell bf)Category:Turing complete. ==Commands== There are 10 commands based off each line's "鸡" amount mod 10. There are also 3 registers A,B,C,D without wrapping. {|class="wikitable" ! "鸡" amount mod 10 ! deadfish |- | 1 | <code>i</code> on register A |- |2 | <code>d</code> on register A |- |3 | <code>s</code> on register A |-...")
00:15, 19 January 2026 ‎BENOZCISAPDRM (hist | edit) ‎[1,390 bytes] ‎A() (talk | contribs) (Created page with "BENOZCISAPDR has thirteen commands. It uses counters, and it was made by User: A().")
18:30, 18 January 2026 ‎Qu-Qu (hist | edit) ‎[2,549 bytes] ‎A() (talk | contribs) (Created page with "Qu-Qu is an esoteric programming language made by User: A(). It uses functions like Q and U to duplicate and/or simplify expressions. == Functions == {| class="wikitable" |+ Functions |- ! Functions !! Disc |- | Q() || duplicate |- | U() || simplify expression |- | X() || turn any function into its opposite |- | ∅() || null |- |} == Syntax == A function that has no inputs can be written like this: Q Also Qx and Q(x) are the same. == Programs == === Duplicate f...")
10:44, 18 January 2026 ‎Segment (hist | edit) ‎[7,223 bytes] ‎Cleverxia (talk | contribs) (Created page with "Segment is an esoteric programming language inspired by Glypho Incident and some others by User:cleverxia. ==Parsing== Let the program be in P then the following node.js program will parse it into sections: <pre> P="<Code <goes <here>"; [J,...P]=[...P] P=P.join``.split(J).slice(1) H={} r=0 Q=P.map(t=>H[t]?H[t]:H[t]=++r) console.log(Q) </pre> ==Program flow== The program opreates on a queue of bits as in BCT. (attempting to pop a bit while queue is em...")
10:18, 18 January 2026 ‎〵䅂ㅅ (hist | edit) ‎[1,303 bytes] ‎ColorfulGalaxy's CA discoveries (talk | contribs) (----)
09:39, 18 January 2026 ‎噹硡氀 (hist | edit) ‎[1,346 bytes] ‎ColorfulGalaxy's CA discoveries (talk | contribs) (----)
07:26, 18 January 2026 ‎Eviledon/Turing-completeness proof (hist | edit) ‎[1,198 bytes] ‎RikoMamaBala (talk | contribs) (Created page with "Here's a proof of Turing-completeness of Eviledon. We can make a Brainfuck-to-Eviledon compiler using: Chimpanzini Bananini Tung Tung Tung Sahur Sahur Sahur Sahur Sahur Lirili Larila Sahur Tralalero Tralala Bombardotto Aquilotto Tralalero Tralala Tung Sahur Ballerina Cappucina - Tralalero Tralala Sahur Bananita Dolfinita as the start of the program, Tralalero Tralala Sahur Ballerina Cappucina + Bombardilo Crocodilo Tralalero Tralala Bombardotto Aquilo...")
07:14, 18 January 2026 ‎PyFuck (yoyolin0409) (hist | edit) ‎[2,707 bytes] ‎Yoyolin0409 (talk | contribs) (Created page with "'''PyFuck''' is an esolang by User:yoyolin0409. Also check out PyFuck and JSFuck so you'll know what I want to do. This esolang only has the following valid characters: "rep=()[]+'*j" and "eval", ".clear", ".count", "chr". In addition, our Python code includes: `from pathlib import PurePosixPath` and the `import operator` and the `truediv=operator.truediv`. ==How to make "<"?== repr(type(0))[0] ==How to make ">"?== repr(type(0))[12] ==How to make "-"?== re...")
07:02, 18 January 2026 ‎OSColang (hist | edit) ‎[9,748 bytes] ‎Anywaydun (talk | contribs) (Created page with "'''OSColang''' (pronounced oh-es-ko-lang) is an esolang made by User:Anywaydun meant to commemorate 16 years of Battle of Dream Island, and the object show community as a whole. It was made to show the creations of the wider OSC and represent them somewhere (though in practice that isn't true), and was also mainly made because the creator couldn't find any object show-inspired esolangs that were already made. ==Instructions== OSColang is one-indexed. Programs must b...")

New pages

Navigation menu

Search