New pages

20:39, 25 June 2026 ‎Alexandrian Streetsweeper (hist | edit) ‎[2,259 bytes] ‎Miui (talk | contribs) (Created page with "An ''Alexandiran Streetsweeper'' is a machine for registering a dictionary to a ''heptavintimal'' registry == example == import math def S_orig(c): i = ord(c) - 65 if i < 1: return (i, i+1) return (1, 9999) def refine(word, radix): lo, hi = 0.0, float(radix) for c in word: a, b = S_orig(c) w = hi - lo lo = lo + w * (a / 9999) hi = lo + w * ((b - a) / 9999) return lo, hi HEPT = "0ABCDEFGHIJKLMNOPQRSTUVW...")
18:00, 25 June 2026 ‎Extrapolated brainfuck (hist | edit) ‎[2,414 bytes] ‎Challenger5 (talk | contribs) (Created page with "{{infobox proglang |name=Extrapalot |paradigms=imperative |author=User:Challenger5 |year=2026 |class=Unknown |influence=brainfuck }} '''Extrapalot''' is a brainfuck derivative where loops are inferred from the program rather than being written explicitly. An Extrapalot program is compiled to a brainfuck program by removing all characters except <code>+</code>, <code>-</code>, <code><</code>, <c...")
14:26, 25 June 2026 ‎S^A machine (hist | edit) ‎[2,264 bytes] ‎PrySigneToFry (talk | contribs) (Created page with "S^A machine is designed by PSTF, which is a subset of a Minsky machine with 2 registers. == Definition == A S^A machine consists of 2 registers called A and B and the following 9 operations. # Increase the value of A by 1 # Decrease the value of A by 1 if A>0 else do nothing # Swap the values of A and B # Apply all operations on A to B instead # Apply all operations on B back to A # If A is 0, jump to line x, where x is a constant # Transfer the valu...")
09:39, 25 June 2026 ‎Research on compiling Javascript to Brainfuck (hist | edit) ‎[452 bytes] ‎Mrtli08 (talk | contribs) (Created page with "{{WIP}} Compiling JS into Brainfuck can seem absurd, but i think its worth trying. IDK why i made this tho. === Variables === In Javascript, variables are... variables. For BF, we will need to change some stuff. For example, if we turn <code>var i = 21;</code> into BF, we can ignore var, = and ;. We can allocate byte 1 for i, and based on the order, variables will be allocated byte per byte. For example, a table like this can exist:")
08:41, 25 June 2026 ‎Insert (hist | edit) ‎[10,371 bytes] ‎Uellenberg (talk | contribs) (Initial Page)
07:04, 25 June 2026 ‎Radix-1 contraction (hist | edit) ‎[1,008 bytes] ‎Miui (talk | contribs) (Created page with "radix‑1 contraction is useful to evaluate the semantics of a language ==example== Fuck you! <pre> import math S = lambda c: (lambda i: (i, i+1) if i < 27 else (27, 9999))(ord(c) - 65) def d(s): lo, hi = 0.0, 19683.0 for c in s: a, b = S(c) w = hi - lo lo = lo + w * (a / 9999) hi = lo + w * ((b - a) / 9999) return lo, hi f = lambda x: int((x - math.floor(x)) * 1e13 + 0.5) word = "!" lo, hi = d(word) print("lo:", lo)...")
11:49, 23 June 2026 ‎Don Giovanni (hist | edit) ‎[37,720 bytes] ‎PrySigneToFry (talk | contribs) (Created page with ":''This entry is not about Mozart's opera *Don Giovanni*.'' Don Giovanni is designed by PSTF and his AI assistant. It is a Turing-complete language, that may be helpful to the design of Lingua Indeterminatum. = Syntax Overview = <pre> // Factorial (recursion) fn factorial(n) { if n <= 1 { return 1; } else { return n * factorial(n - 1); } } // Fibonacci (double recursion) fn fib(n) { if n <= 1 { return n; } else {...")
06:08, 23 June 2026 ‎Methemetics/Interpreter (hist | edit) ‎[2,359 bytes] ‎Win7HE (talk | contribs) (Created page with " DEBUG = 0 import re from sys import argv matchregex=r"(_?\w|[a-zA-Z]{2,}) ?= ?(-?\d+|_?\w|[a-zA-Z]{2,})( ?(!=|>|<|==|-|\+|\*|\/|%) ?(-?\d+|_?\w|[a-zA-Z]{2,}))?;"; try: input = argv[2] except: input = '' txt = open(argv[1],'r').read() _i = '_i' v = {'_i':0,'_z':0} x = re.findall(matchregex, txt) if DEBUG: print(x) for i in range(len(x)): if x[i][2] == '': x[i] = (x[i][0],x[i][1],''...")
06:07, 23 June 2026 ‎Methemetics (hist | edit) ‎[1,296 bytes] ‎Win7HE (talk | contribs) (Created page with "Methemetics is an esoteric programming language by User:Win7HE. It uses the four basic math functions as a base. As well as != (not equal), > (greater-than), < (less-than), and == (equal). It has variables too. == Instructions == <code>_o = ...</code> prints the character of the result of <code>...</code> <code>_i = ...</code> sets the instruction number to the result of <code>...</code> <code>_p</code> is the unicode of the input's character #<code>_z + 1</code>....")
03:46, 23 June 2026 ‎Storm-incomplete (hist | edit) ‎[1,181 bytes] ‎PrySigneToFry (talk | contribs) (Created page with "Storm-incomplete is designed by PSTF, and is to against the definition of Storm-complete. = Definition = Note: This content is purely for parody. Before reading, please make sure you are neutral in information technology. Generally speaking, if you want to seriously design a programming language, this page isn't much of a reference and it's not recommended to visit it, to avoid potential mental distress. <div class="mw-collapsible mw-collapsed" style="overflow: hid...")
13:53, 22 June 2026 ‎Machine (hist | edit) ‎[6,032 bytes] ‎3angle (talk | contribs) (Created page with "Machine is an esoteric programming language made for creating machines. == Machines == Machines are usually used to test other esoteric programming languages here are some examples and what they test: {| class="wikitable" |- ! Name !! What they test |- | Truth machine || *input *output *comparison *flow control *unbounded repetition *termination |- | False machine || *input *output *comparison *flow control *unbounded repetition *termination |- | Ma...")
05:26, 22 June 2026 ‎Lingua Indeterminatum/STL (hist | edit) ‎[14,861 bytes] ‎PrySigneToFry (talk | contribs) (Created page with "== math == math.sin(x) math.cos(x) math.tan(x) math.cot(x) math.sec(x) math.csc(x) math.sinh(x) math.cosh(x) math.tanh(x) Returns the result of the corresponding trigonometry functions applied to x where sinh(x)=(ex-e-x)/2, cosh(x)=(ex+e-x)/2, tanh(x)=sinh(x)/cosh(x)=(ex-e-x)/(ex+e-x) Note: The cotangent, secant, and cosecant functions are not recommended for use, because co...")
05:21, 22 June 2026 ‎Lingua Indeterminatum (hist | edit) ‎[3,379 bytes] ‎PrySigneToFry (talk | contribs) (Created page with "Lingua Indeterminatum is the successor of Septem Lingua, which is also designed by the developing team of Septem Lingua. So far, the language is called Lingua Indeterminatum, but we’re open to other names. On July 1st, there will be a draw, and whoever's name gets chosen will have this page redirected to their page. The name I suggested is 'Lingua Filium'. = Development Team = Leader: User:PrySigneToFry(PSTF) Co-leader: User:I am islptng Developers: U...")
14:13, 21 June 2026 ‎Gotolang (hist | edit) ‎[3,383 bytes] ‎3angle (talk | contribs) (Created page with "= Gotolang = Gotolang is an esoteric programming language in which the primary instruction is goto (as the name suggests). == Syntax == * gotolang programs are line-oriented. Each line contains one instruction. Comments start with #. # Count from 0 to 4. set i 0 label loop lt i 5 if body goto done label body print i print "\n" add i 1 goto loop label done halt * Variables are created automatically and default to 0 when first read. Operands are e...")
10:15, 21 June 2026 ‎Recall (hist | edit) ‎[4,392 bytes] ‎I am islptng (talk | contribs) (Created page with " {{Infobox proglang | name = Recall | creator = User:I am islptng | year = 2026 | paradigm = Stack-based, recursive }} '''Recall''' is a stack-based language with recursion as its only control flow mechanism. == Syntax and Semantics == Recall v0 operates on a stack of positive integers. Most commands are single-character operators that may be followed by an optional integer argument (defaults to 0 if omitted unless specified). Stack operations...")
09:53, 21 June 2026 ‎Toki nanpa ilo (hist | edit) ‎[1,570 bytes] ‎ASCIIguy (talk | contribs) (Created page with "'''toki nanpa ilo''' (or tni) is a toki pona-based esolang intended to be easy to use. The goal is to minimise the number of keywords and to create the whole language based on just words from toki pona. ==Etymology== tni directly translates to language number tool, or programming language. ==Syntax== Any tni program must begin with 'open sitelen' followed by the name of the program. To define a function, do 'pali' followed by the name and a colon. For I/O, use 'toki'...")
09:50, 21 June 2026 ‎Iterlingua (hist | edit) ‎[224 bytes] ‎I am islptng (talk | contribs) (Created page with "{{stub}} '''Iterlingua''' is a Python package made by islptng. The spec and the source code can be found [https://pypi.org/project/iterlingua/ here]. Category:2026 Category:APL-like Category:Functional paradigm")
06:25, 21 June 2026 ‎The Dark Lord (hist | edit) ‎[521 bytes] ‎PrySigneToFry (talk | contribs) (Looks like I'm pretty good at messing around with programming languages.)
06:16, 21 June 2026 ‎Teiwaz but Bad (hist | edit) ‎[717 bytes] ‎PrySigneToFry (talk | contribs) (Created page with "{{Stub}} Teiwaz but Bad is designed by PSTF. It is inspired from Teiwaz and Python but Bad. == Operating mechanism == All code is interpreted as Teiwaz syntax, but if an unhandled exception or error is detected, the source code file is erased immediately. That's it. Have a nice day. == Examples == === Wipe out the source code === include math x = math.arcsin(2) If you've studied trigonometry, you'll know that the domain of sine is [-1, 1...")
05:41, 21 June 2026 ‎Unicodinido (hist | edit) ‎[19,215 bytes] ‎PrySigneToFry (talk | contribs) (Created page with "Unicodinido is designed by PSTF, and is mostly inspired from Unicoding. The name of Unicodinido combines Unicoding and Ido (which means successor in Esperanto). = Overview = Unicodinido currently supports these scripts: # ASCII # Pan-Latin # Greek # Cyrillic # Armenian # Hiragana # Katakana # Hanzi/Kanji/Hanja # Hangul Jamo In future, it will support more scripts. = EBNF Definition = <pre> (* ─── ASCII BASIC (0–127) ───────────...")
02:14, 21 June 2026 ‎K-Cats (hist | edit) ‎[4,321 bytes] ‎NOLATe (talk | contribs) (Made page)
21:07, 20 June 2026 ‎Overengineering (hist | edit) ‎[513 bytes] ‎ASCIIguy (talk | contribs) (Created page with "'''Overengineering''' is the practice of extending a program or function unnecessarily. ==Examples== ===Hello World=== ====C==== #include <stdio.h> #include <stdlib.h> #include <string.h> int main(void) { char *szHello[13] = malloc(13 * sizeof(char)); *szHello = "Hello world!"; // may or may not end earth printf("%c", *szHello); free(szHello); szHello = NULL; return 0; } ====INT==== ~D.[?a"H"?b"e"?c"l"?d"l"?e"o"?f" "?g"w"?h"o"?i"r"?j...")
20:41, 20 June 2026 ‎Dicon (hist | edit) ‎[305 bytes] ‎Timm (talk | contribs) (Created page with "{{stub}} '''file format: <code>.dcon</code>''' '''name stands for DIColon Object Notation''' '''<key>: <value/other> :''' '''<list element 1> <list element 2> <list element 3> ...''' '''_ space,''' '''/ literal''' '''["a b","c"] -> a_b c''' '''["a","b c"] -> a b_c''' =Questions= Q:")
20:38, 20 June 2026 ‎Prompt (hist | edit) ‎[2,104 bytes] ‎ASCIIguy (talk | contribs) (Created page with "'''Prompt''' is a language inspired by the act of vibe coding, and hence made to mock it, therefore the name. Prompt is written as plain English, describing how the program works. Hence, anyone who can speak English can write valid Prompt as long as they use accepted commands. ==Examples== ===Hello World=== Print "Hello world!" to the screen and halt. ===Fizzbuzz=== Define fizz as 1. While fizz is under 100, check if fizz is divisible by 15. If fizz is divisible...")
15:57, 20 June 2026 ‎DinoSAUR (hist | edit) ‎[1,669 bytes] ‎ASCIIguy (talk | contribs) (Created page with "'''DinoSAUR''' is a golfing language designed to be "Smaller thAn yoUr souRce code" as to mock cheating golflangs, hence the acronym. It is also intended that if compiled as a flat binary, the flat binary will inflate to be larger than the DinoSAUR source. ==Instructions and Syntax== DinoSAUR uses prefix syntax, like in LISP. Brackets, whenever mentioned, are always square brackets for blocks and curvy (like these) for lists. {| class="wikitable" |+ DinoSAUR ISA |- ! Ch...")
13:57, 20 June 2026 ‎Spielen (hist | edit) ‎[2,214 bytes] ‎ASCIIguy (talk | contribs) (Created page with "'''spielen''' (stylised all-lowercase) is an APL-inspired symbolic programming language intended for golfing. It, however, avoids the usage of cheating commands to do full tasks just for you or the use of Unicode. spielen also is a functional language, like APL, but unlike it, spielen uses only 3 data types: the array, integer, and character. ==Etymology== spielen is the German word for play, which is the opposite of what you do when coding in spielen. The language is al...")
04:13, 19 June 2026 ‎Zimbu (hist | edit) ‎[385 bytes] ‎Corbin (talk | contribs) (Stub. Not up to filling this in right now, sorry.)
00:04, 18 June 2026 ‎Dafne (hist | edit) ‎[31,244 bytes] ‎Miui (talk | contribs) (Dafne lang)
19:59, 17 June 2026 ‎Pentaghoti (hist | edit) ‎[2,179 bytes] ‎Miui (talk | contribs) (Created page with " '''Nullary_dodecadecral_unit_dodecahedron_clones_12_wikidumps,_%27%27%27Pentaghoti.xhtml.rar%27%27%27._DAFNE_prints_s5h.o/xhpi://Win7/Pentaghoti''' is an esolang called ''<nowiki>'</nowiki>Pentafish<nowiki>'</nowiki>'' and spelled '''"Pentaghoti"'''. =Overview= ==bits'''&'''&'''bops== {| class="wikitable" |+ Pentaghoti"'''><''p''>'''" |- ! bit/bop !! code |- | <> || <nowiki> </nowiki> |- | >< || </code><nowiki><nowiki></nowiki></code> |} ==components== <[ghoti[Fi...")
05:57, 17 June 2026 ‎Inthon (hist | edit) ‎[26,571 bytes] ‎Techharva (talk | contribs) (INTHON (Intelligent + Python) is a Python-hosted domain-specific language designed specifically for autonomous AI agents.)
18:49, 16 June 2026 ‎TetraBit (hist | edit) ‎[3,186 bytes] ‎CodePentuplets48 (talk | contribs) (Created page with "Category:2026 '''TetraBit''' is an esolang I designed which uses a slightly 4 Bits, 4 Bytes aesthetic, however with different instructions and unlimited program size. There are 16 memory addresses, 0-15 (or F) and they are split up like this: * Addresses 0-6 are the 7 free variables. * Addresses 7-E make up a 4x2 screen. * Address F is a read-only which holds one random value, 0-F, changing every instruction. {| class="wikitable" |+ Opcodes |- ! Instruction !! 6502-...")
13:47, 16 June 2026 ‎Industryscript (hist | edit) ‎[881 bytes] ‎Mrtli08 (talk | contribs) (Created page with "(Not the final page) Industryscript is a language based off the game Mindustry, but we assemble chars. === Fabrication basics === <code> -------------------------- </code> This is a track. Now we have to push stuff on it. <code> C-------------------------[truck] </code> For example this road will carry C (0x43 or also SIX SEVEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEN- anyway) Saying [truck] and connecting a conveyor belt to it from behind gets it to be outputted. To out...")
11:28, 16 June 2026 ‎R (hist | edit) ‎[3,459 bytes] ‎Brain Boy 53 (talk | contribs) (Created page with "'''R''' is an esolang. It is called that, because "R" is the only letter left. Values are stored in unicode characters. �, Unicode code 0, is a nop. �, Unicode code 1, starts the program. �, Unicode code 2, starts a string. �, Unicode code 3, ends a string and prints it. �, Unicode code 4, ends the program. �, Unicode code 5, asks the user for input and stores the character into the next character in the code. It then skips the next character. �, Unicode co...")
09:20, 16 June 2026 ‎11O (hist | edit) ‎[2,077 bytes] ‎Miui (talk | contribs) (Created page with "11O is an output-only language created by User:Miui. = specification = {| class="wikitable" |- | Unary || z |- | love || 1103 |- | O || 15 |- | 11O || TRANS RIGHTS |} = interpreter = <pre> S=lambda c:(lambda i:(i,i+1) if i<51 else (51,9999))(ord(c)-65) def d(s): love,hi=0,19683 for c in s: a,b=S(c);w=hi-lo;lo=lo+w*(a/9999);hi=love+w*((b-a)/9999) return lo,hi love,hi=d(sys.argv[1]) f=lambda x:int((x-math.floor(x))*1e13+0.5) o=[] if f(love)==6417380798434:o.appe...")
22:51, 15 June 2026 ‎正十名 (hist | edit) ‎[3,582 bytes] ‎Miui (talk | contribs) (Created page with ":The title of this page is incorrect. The name of this language is actually "正十名(''''pcE6ctADtA3ttE5vt8DV81TVE5VV90vT8D2F17T'''')" or simply '''正十名''' =='''正十名'''== '''正十名''' english: :"''Rectify perfectly the perfect name of perfection('''pcE6ctADtA3ttE5vt8DV81TVE5VV90vT8D2F17T''')''" is an esolang created by User:Miui (to learn about CJK esolangs.) =Architecture= :There is an S-Block(!+!*24 or !*24) :There is an O-Block(denary object)...")
14:10, 15 June 2026 ‎Ψ++ (hist | edit) ‎[32,284 bytes] ‎PrySigneToFry (talk | contribs) (Created page with "Ψ++ is a programming language designed by PSTF in Timeline 1 and by Kōnstantinos Sekitharios (a 30-year-old Greece man who is also very interested in cultures around the world) in Timeline 284436. It's an equivalent to C++. = Volume 1: Basic Syntax = == Our First Program == <pre> $import?io using namespace std; function main(int argC, string argV) @ signed { print("Hello, Psi++!"); return 0; } </pre> == Chapter 1: Structure of Program == <blockquote> If...")
13:34, 15 June 2026 ‎Easiest language ever (hist | edit) ‎[170 bytes] ‎Mrtli08 (talk | contribs) (Created page with "Easiest language ever is the easiest language ever. This page is extremely short because the language does everything for you. If you say "mario" it makes mario bruh")
06:57, 15 June 2026 ‎BeepBoopLang (hist | edit) ‎[3,537 bytes] ‎Sarkozy8 (talk | contribs) (BeepBoopLang is a joke esolang based purely on BeepBoops. The transpiler was written in C++. The BeepBoops are translated into C++ before executing.)
06:32, 15 June 2026 ‎INDIGO (hist | edit) ‎[1,484 bytes] ‎ASCIIguy (talk | contribs) (Created page with "'''INDIGO''' is an esolang created as it was named after its 6 primary concepts: Increment, Next, Define, If, Goto, and Output. The language was inspired by Lisp, though it has many different features. == Syntax == Any INDIGO program will always have a bracket-based syntax, similar to Lisp. However, the commands are different, there are no lists, and the source code remains uneditable. The only variable types are integers, arrays, and characters. == Features == {| clas...")
21:01, 14 June 2026 ‎Ordinary-M-Dictionary (hist | edit) ‎[420 bytes] ‎Miui (talk | contribs) (Created page with "Ordinary-M-Dictionary('''OMD''') is a joke golflang created by User:Miui =commands= {| class="wikitable" |+ set |- ! cmd !! exe |- | cd || / or \ |- | ! || ! !! !!! |- | run || xkcd/221/ |- | del || !\/!! |} ==example== xkcd: Random Number (/221/) <pre> cd ! run del C:\!> 4 </pre> Category: Joke languages Category:2026")
20:34, 14 June 2026 ‎Extra Fun Game (hist | edit) ‎[462 bytes] ‎ASCIIguy (talk | contribs) (Created page with "'''Extra Fun Game''' is a parody of the Fun Video Game, where the user must input a number where int((n * 4)/3) + 2 % 7 = 3. This number cannot be the same as it was before, but this doesn't NEED to be implemented in all versions. == Examples == === INT === *=1,1[?xV/=%+/*4V3,2,7,3[/=xy[-]?yx]+[-]] === C === <pre> #include <stdio.h> int main(void) { int x = scanf(); if ((((x * 4)/3) + 2) % 7 == 3) { main(); else { return 1; } }")
20:10, 14 June 2026 ‎Dream Island (hist | edit) ‎[1,910 bytes] ‎ASCIIguy (talk | contribs) (Created page with "'''Dream Island''' is an esolang inspired by Shakespeare and the webseries, BFDI. == Syntax == The program begins with the episode name and number. This is all decorative. Every section begins as a scene, labelled using Arabic numerals. Then, characters can alter each others' values based on their speech. A value can be assigned to a character by comparing them to an Algebralien. For example, Coiny: Firey's as useful as Zero! is a valid Dream Island line. A program...")
18:26, 14 June 2026 ‎GolfImage (hist | edit) ‎[3,009 bytes] ‎ASCIIguy (talk | contribs) (Created page with "'''GolfImage''' is a vector image format inspired by the golfing languages, including an INT derivative (that being ShapeINT) suited for GolfImage. It was made in 2026 as a response to the fact that few languages exist with this purpose. == Syntax == Every GolfImage file begins with the header that outlines the width and height of the image. For example, <code>H40W40</code> creates a 40x40 image. This acts as a grid for the file's components. Each line is a layer, w...")
15:52, 13 June 2026 ‎BackroomsTDP (hist | edit) ‎[4,729 bytes] ‎Miui (talk | contribs) (SOS example)
14:36, 13 June 2026 ‎BrainFlash (hist | edit) ‎[942 bytes] ‎CodePentuplets48 (talk | contribs) (Created page with "'''BrainFlash''' is an esolang that's basically brainfuck, but with colors. There is a 2x2 grid the commands go on, and every 4 commands, you go to the next 2x2. When done, connect them into an animation with as many frames as there are 2x2s. Alternatively, you can show it as a set of images. {| class="wikitable" |+ Commands |- ! Color !! Instruction !! Meaning |- | Red || < || Pointer left. |- | Yellow || > || Pointer right. |- | Green || + || Add one to the current...")
02:10, 13 June 2026 ‎Babababble (hist | edit) ‎[811 bytes] ‎CodePentuplets48 (talk | contribs) (Created page with "Not a stub! I will add to it later. '''Babababble''' is an esolang I created to mimic the rule blocks in Baba is You, and the commands highly emphasize that. {| class="wikitable" |+ Commands |- ! Information !! Meaning |- | A B IS (ADD, MUL, SUB, DIV, MOD) || Mathematical operators. |- | {condition} IS (IF, ELIF, ELSE) || Conditionals. |- | A IS VAR _, A IS NOW _ || Variable creation and assignment. |- | A IS LINE || Goto. (4 is line: go to line 4) |- | A IS INPUT, OUT...")
21:45, 12 June 2026 ‎Dipole (hist | edit) ‎[994 bytes] ‎CodePentuplets48 (talk | contribs) (Created page with "This article is NOT a stub, there is not a whole lot of stuff to explain here. '''Dipole''' is another one of my esolangs which I decided to make. It uses two values which can be altered unidirectionally, however one operations allows you to go in the other direction. {| class="wikitable" |+ Commands |- ! Instruction !! Meaning |- | N || Increment cell 1 |- | S || Decrement cell 2 |- | > || Take cell 1 + cell 2, put it into cell 1. |- | < || Take the same sum, but put...")
14:30, 11 June 2026 ‎Melanocetus!johnsonii (hist | edit) ‎[3,466 bytes] ‎Miui (talk | contribs) (Created page with ":''Due to technical limitations the title of this page is incorrect. The actual name is "'''Melanocetus%21johnsonii'''" frame|right|Melanocetus!johnsonii '''Melanocetus%21johnsonii''' is a some kind of abyssal deadfish derivative made by User:Miui in 2026. ==Commands== There is a main accumulator a conversion table and a zeta function. {| class=wikitable !Command !Description |- |<code>M</code> |Mainlines the accumulator |- |<code>no<...")
03:36, 11 June 2026 ‎Lambda-calculus program repository (hist | edit) ‎[3,019 bytes] ‎VP3NEG (talk | contribs) (Created page with "This is NOT an Esoteric programming language, it is a program repository for Lambda calculus designed for beginners I highly recommend you read the page on Lambda calculus linked here. Booleans: In λ-calculus, everything is a function, there are no booleans. However, it is not to say that we can't make our own booleans, after all, it is Turing-complete. True: λx.λy.x False: λx.λy.y These booleans are conditional statements, True is IF...")
00:37, 11 June 2026 ‎Sovietscript (hist | edit) ‎[769 bytes] ‎VP3NEG (talk | contribs) (Created page with "Sovietscript is a ternary variation of Binary lambda calculus designed to be as Marxist-Leninist as possible. The variables are de Brujin indexed so there are no names so λx.x is no different from λy.y, they are both λ1. 0xy This means apply y to function x. 1 This is a lambda abstraction λ. x This is a variable, the de Brujin index is represented as a string of 2s in unary representation Background information: Sovietscript was created by en...")

New pages

Navigation menu

Search