User contributions for C++DSUCKER

10:5510:55, 17 November 2025 diff hist +9‎ Contains everything ‎No edit summary current
10:5110:51, 17 November 2025 diff hist +40‎ Contains everything ‎ I changed my mind, the langauge should no longer be allowed to be recursive. i wil add a finite recursion operator.

21:5021:50, 15 November 2025 diff hist +64‎ Contains everything ‎No edit summary
21:2521:25, 15 November 2025 diff hist +151‎ Contains everything ‎No edit summary
21:1121:11, 15 November 2025 diff hist 0‎ m Language list ‎No edit summary
21:1021:10, 15 November 2025 diff hist +26‎ Language list ‎No edit summary
21:0821:08, 15 November 2025 diff hist +947‎ N Contains everything ‎ Created page with "This is a set theory based language, Initially designed by ~~~ but with the logical operator removed with help of uni on discord (though these changes did not make it into the final language). the original used nand but i eventually went with implies as false is constructible. It was designed to be as simple as possible. == Instructions == {| class="wikitable" |- ! Instruction !! Description |- | (∀x.P) || if predicate P is True for all sets x then True else False |-..."

10:4610:46, 25 October 2025 diff hist −1‎ F calculus ‎ I made the mistake of changing the section and description but not the code. fixed. current
10:3310:33, 25 October 2025 diff hist +18‎ m F calculus ‎No edit summary
10:2110:21, 25 October 2025 diff hist +131‎ Talk:F calculus ‎No edit summary
09:5009:50, 25 October 2025 diff hist −3‎ m Σ∞ ‎No edit summary current

09:1709:17, 23 October 2025 diff hist +1‎ m Language list ‎No edit summary
09:1709:17, 23 October 2025 diff hist +11‎ m Language list ‎ This AWESOME lanuguage was not on there.

18:0618:06, 22 October 2025 diff hist +1‎ F calculus ‎No edit summary
18:0618:06, 22 October 2025 diff hist −11‎ m F calculus ‎No edit summary
18:0618:06, 22 October 2025 diff hist +62‎ F calculus ‎No edit summary
17:2217:22, 22 October 2025 diff hist 0‎ Σ∞ ‎ X is not a bound variable, and y is the only bound one. this also makes the code work as intended.

21:3421:34, 19 October 2025 diff hist +4‎ F calculus ‎No edit summary
21:3321:33, 19 October 2025 diff hist +9‎ m F calculus ‎No edit summary
21:3321:33, 19 October 2025 diff hist +4‎ F calculus ‎No edit summary
21:3121:31, 19 October 2025 diff hist +47‎ F calculus ‎No edit summary
21:0721:07, 19 October 2025 diff hist −1‎ m F calculus ‎ Fix
21:0721:07, 19 October 2025 diff hist +1,210‎ N F calculus ‎ Created page with "F Calculus is a Combinatory logic system with as only combinator 'F' It was devised to see how simple a Combinator could be when it has to both access an oracle and do logic. it is also inspired by SE calculus == Description ==: <code>F i => if i has a beta normal form then λx.λy.λz.xz(y(λw.z)) else λx.x</code> Function application through . Although it does not matter, you can use brackets Spacing allowed but not needed. == Examples == ==== Tromp's & mtve's..."
12:0612:06, 19 October 2025 diff hist +283‎ Dt ‎No edit summary current

21:0321:03, 3 October 2025 diff hist +33‎ T+Riangle ‎No edit summary
20:4320:43, 3 October 2025 diff hist +16‎ m Language list ‎ i added my 'lovely' language
20:4120:41, 3 October 2025 diff hist +871‎ N T+Riangle ‎ Created page with "T+Riangle is a esolang Inspired by R + S it operates on a left infinite array of bits and 7 bits of state. At every step it picks the 7 bits of state for all the bits apart from the MSB, and the MSB becomes the next bit. if the bit is at position 0 then it becomes the bit at position N+1, N starts at 0. then it executes the program of R's and +'s with those 8 bits (Modifying the state and selected bit in the procces) So the MSB gets selected like this: <pre>..."

Navigation menu