All public logs

Combined display of all available logs of Esolang. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

• 03:01, 18 January 2025 Jan jelo talk contribs created page User:Jan jelo/BF interpreter in Thue (Created page with "This is a Brainfuck interpreter in Thue by User:Jan jelo (input and output are unary numbers(each output wrapped by <code>(</code> and <code>)</code>),the value of each cell is an unbounded natural number) <pre> {0>}+::=+{0>} {0>}-::=-{0>} {0>}<::=<{0>} {0>}>::=>{0>} {0>}[::=[{0>} {0>}]::=]{0>} {0>}.::=.{0>} {0>},::=,{0>} {0>}p+::=p+{+|>} {0>}p-::=p-{-|>} {0>}p<::=p<{<|>} {0>}p>::=p>{>|>} {0>}p[::=p[{[|>} {0>}p]::=p]{]|>} {0>}p.::=p.{.|>}o(o {0>}p,::=p,{,|>}...")
• 22:56, 15 January 2025 Jan jelo talk contribs created page User:Jan jelo/FizzBuzz in Thue (Created page with "This is a FizzBuzz program in Thue by User: Jan jelo. Outputs are separated by <code>;</code>. <pre> o0::=~0 o1::=~1 o2::=~2 o3::=~3 o4::=~4 o5::=~5 o6::=~6 o7::=~7 o8::=~8 o9::=~9 0[<0]::=0[3>] 1[<0]::=[<1]1 2[<0]::=2[3>] 3[<0]::=3[3>] 4[<0]::=4[3>] 5[<0]::=5[3>] 6[<0]::=6[3>] 7[<0]::=7[3>] 8[<0]::=8[3>] 9[<0]::=9[3>] |[<0]::=|[3>] 0[<1]::=[<2]0 1[<1]::=1[3>] 2[<1]::=2[3>] 3[<1]::=3[3>] 4[<1]::=4[3>] 5[<1]::=5[3>] 6[<1]::=6[3>] 7[<1]::=7[3>] 8[<1]::=8[3>]...")
• 04:11, 14 January 2025 Jan jelo talk contribs created page Underload/a interpreter in scheme (Created page with "This is a Underload interpreter in scheme by User:Jan jelo. <pre> (define(init program) (list(string->list program) '())) (define(program state) (list-ref state 0)) (define(stack state) (list-ref state 1)) ;a (define(a state) (list(cdr(program state)) (cons(string-append"("(car(stack state))")")(cdr(stack state))))) ;! (define(!! state) (list(cdr(program state)) (cdr(stack state)))) ;* (define(** state) (list(cdr(program state)) (con...")
• 23:29, 12 January 2025 Jan jelo talk contribs created page User:Jan jelo/Lambda to SKI (Created page with "This is a converter in Haskell converts lambda calculus into SKI combinators. <pre class="rectwrap"> main = do print $ convert $ omega -- ((s i) i) print $ convert $ turing -- (((s i) i) ((s (k (s i))) ((s ((s (k s)) ((s (k k)) ((s i) i)))) (k i)))) omega = Lam"x"(App(Var"x")(Var"x")) turing = App omega (Lam"f"(Lam"x"(App(Var"x")(App(App(Var"f")(Var"f"))(Var"x"))))) data Lam = Var String | Lam String Lam | App Lam Lam data Term = Var_ String | Lam_ String Term...")
• 21:06, 6 January 2025 Jan jelo talk contribs created page User:Jan jelo/a quine in python that contains a underload interpreter (Created page with "This is a Quine program in python by User:Jan jelo. It contains a Underload interpreter. <pre> def run(p): stack=[] program=p while program: x,program=program[0],program[1:] if x=='*':b,a=stack.pop(),stack.pop();stack.append(a+b) if x=='^':program=stack.pop()+program if x=='~':a,b=stack.pop(),stack.pop();stack.append(a);stack.append(b) if x==':':stack.append(stack[-1]) if x=='!':stack.pop()...")
• 20:44, 6 January 2025 Jan jelo talk contribs created page User:Jan jelo/JSFuck code generator (Created page with "This is a JSFuck code generator in python by User:Jan jelo. <pre> false='(![])' true=f'!{false}' _0=f'(+[])' _1=f'(+{true})' succ=lambda x:f'({x}+{_1})' _2=succ(_1) _3=succ(_2) _4=f'({_2}+{_2})' _5=f'({_2}+{_3})' _6=f'({_3}+{_3})' _7=f'({_3}+{_4})' _8=f'({_4}+{_4})' _9=f'({_4}+{_5})' nums=[_0,_1,_2,_3,_4,_5,_6,_7,_8,_9] def num(n): x='+'.join([f'[{nums[int(x)]}]'for x in str(n)]) return f'(+({x}))' undefined=f'([][{_0}])' a=f'(({false}+[])[{_1}])' d=f'(({...")
• 14:23, 6 January 2025 Jan jelo talk contribs moved page User:Jan jelo/ASK calculus interpreter to User:Jan jelo/SKA calculus interpreter
• 13:09, 6 January 2025 Jan jelo talk contribs created page User:Jan jelo/ASK calculus interpreter (Created page with "This is a stack-based Ask-calculus interpreter in Python by User:Jan jelo. <pre> def pop(x,l): a=l.pop() x.append(a) if a==')': i=1 while i: a=l[-1] x.append(l.pop()) if a=='(':i-=1 if a==')':i+=1 return y=[];z=[] while x:y.append(x.pop()) while y:z.append(y.pop()) while z:x.append(z.pop()) def op(l): if len(l)==1:return l[0] return l[-2] def copy(x,y): a=[] while y:a.append(y.pop()) while a:x.append(a[-1]);y.append(a[-1]);a.pop() def...")
• 23:20, 4 January 2025 Jan jelo talk contribs created page Blindfolded Arithmetic/compile from Minsky machine (Created page with "This python program by User:Jan jelo compiles Minsky machine program into Blindfolded Arithmetic program.(using state 0 means halt,states start from state 1.) It uses <code>2^a*3^b</code> to encode two counters in <code>a</code>, and outputs the value of <code>a</code> when the program halts.<code>c</code> is used as an instruction pointer. <pre> program=''' inc a 2 inc a 3 inc a 4 inc b 5 dec a 4 0 ''' def compile(program): p=x for x in x.split(' ')...")
• 19:45, 3 January 2025 Jan jelo talk contribs created page User:Jan jelo/a BF interpreter in Haskell (Created page with "This is a Brainfuck interpreter in Haskell written by User:Jan jelo. <pre calss="rectwrap"> import Data.Char (chr,ord) main = run (filter(\x->any(==x)"+-<>.,[]")pgrm) 0 (Tape(Stack[])(Stack[])) 0 0 pgrm="++++++++++[>+++++++>++++++++++>+++<<<-]>++.>+.+++++++..+++.>++.<<+++++++++++++++.>.+++.------.--------.>+." --Hello World! data Stack = Stack [Int] deriving (Show) pop (Stack []) = Stack [] pop (Stack (x:xs)) = Stack xs top (Stack []) = 0 top (Stack (x:xs)) = x p...")
• 19:12, 3 January 2025 Jan jelo talk contribs created page User:Jan jelo/a BF interpreter in Uiua (Created page with "This is a Brainfuck interpreter in Uiua written by User:Jan jelo. <pre class="rectwrap"> P ← ⍣( 0°@+ | 1°@- | 2°@< | 3°@> | 4°@[ | 5°@] | 6°@. | 7°@, | 8 ) Init ← { "\0" "\0" 0 } Lt ← ⊡0 Rt ← ⊡1 Pc ← ⊡2 Pg ← ⊡3 Op ← ⊡∩°□:Pg:Pc∘. Cur ← ⊣°□Lt Th ← ⍜(Pc|□+°□): I ← Th1⍜(Lt|□⊂↙-1⧻.:⨬(+1|@\0◌)=@\xff.⊣.°□) D ← Th1⍜(Lt|□⊂↙-1⧻.:⨬(-1|@\xff◌)=@\x00.⊣.°□) L...")
• 19:04, 3 January 2025 Jan jelo talk contribs created page Underload/a interpreter in Uiua (Created page with "This is a Underload interpreter in Uiua written by User:Jan jelo <pre> C ← ⊂:□:⊂⊂{}∩□ State ← C0{"aa""b""c"} I ← °□⊡0 S ← °□⊡1 P ← °□⊡2 # * (Join) J ← C I:⊂:↘2:□⊂°□⊡0:°□⊡1..S.:↘1P. # a (A) A ← C I:⊂:↘1:□$"(_)"°□⊡0.S.:↘1P. # ~ (Flip) F ← C I:⊂⊂⊂{}⊡1:⊡0.:↘2.S.:↘1P. # : (Dup) D ← C I:⊂⊡0.S.:↘1P. # ! (pOp) O ← C I:↘1S.:↘1P. # S (ouT) T ← &pf°□...")
• 13:05, 3 January 2025 Jan jelo talk contribs created page 👀/compile from Minsky machine (Created page with "This python program compiles Minsky machine program into 👀 program.(Using state 0 means halt,and the program starts from state 1.) <pre> program=''' inc a 2 inc a 3 inc a 4 inc b 5 dec a 4 0 ''' s=lambda x,y:f'📩/{x}\\/{y}\\' g=lambda x:f'📨/{x}\\' loop=lambda c,b:'{'+f'{b}'+'}'+f'{c}' seq=lambda*x:''.join(x) add=lambda x,y:f'➕/{x}\\/{y}\\' sub=lambda x,y:f'➖/{x}\\/{y}\\' If=lambda flag,c,t:seq(s(flag,c),loop(g(flag),seq(t,s(flag,0)))) ifEq=lambda x,y,c:If('fl...")
• 18:40, 2 January 2025 Jan jelo talk contribs created page Muriel/compile from minsky machine (Created page with "This python program compiles minsky machine program into Muriel program.(Using state 0 means halt, and the program starts from state 1.) <pre> program=''' inc a 2 inc a 3 inc a 4 inc b 5 dec a 4 0 ''' def r(s): return (s.replace("\\","\\\\") .replace("\"","\\\"") .replace('\n','\\n')) def compile(program): p=[[x for x in x.split(' ') if x in{'inc','dec','a','b'}or x.isdigit()] for x in program.split('\n')if x!=''] d='0...")
• 22:51, 31 December 2024 Jan jelo talk contribs created page Underload/a interpreter in python (Created page with "<pre> def run(p): stack=[] program=p while program: x,program=program[0],program[1:] if x=='*':b,a=stack.pop(),stack.pop();stack.append(a+b) if x=='^':program=stack.pop()+program if x=='~':a,b=stack.pop(),stack.pop();stack.append(a);stack.append(b) if x==':':stack.append(stack[-1]) if x=='!':stack.pop() if x=='a':stack.append(f'({stack.pop()})') if x=='S':print(stack.pop(),end='') if x=='...")
• 08:33, 17 December 2024 Jan jelo talk contribs created page Parigot numeral (Created page with "A '''Parigot numeral''' is a natural number encoded into Lambda calculus. It is related to primitive recursion. In the parigot numeral,there are <pre> 0 g h = h (succ n) g h = g n (n g h) </pre> and let <code>R(g,h)</code> be a primitive recursive function with one parameter,then <pre> R(g,h)(0) = h() R(g,h)(S(xn)) = g(xn,(R(g,h)(xn))) </pre> It can be observed that <code>R</code> is equivalent to <code>λg.λh.λn.n g h</code> in parigot numeral. == Examples == numb...")
• 13:46, 13 December 2024 Jan jelo talk contribs created page User:Jan jelo/TC proof to partial recursive function (Created page with "This article comes from my article in Zhihu. == define == zero function <pre> (Z x1 x2 x3...) = 0 </pre> successor function <pre> (S x) = x+1 </pre> projection <pre> ((P m n) x1 x2...xn...xm) = xn </pre> function compose <pre> ((C f g1 g2...gm) x1 x2...xn) = (f (g1 x1 x2...xn)(g2 x1 x2...xn)...(gm x1 x2...xn)) </pre> primitive recursive <pre> ((R h g) x1...x_n-1 0) = (h x1...x_n-1) (base case) ((R h g) x1...x_n-1 xn) = (g x1...x_n-1 ((R h g) x1...x_n-1 xn-1)) (recursive...")
• 13:19, 12 December 2024 Jan jelo talk contribs created page Scott numeral (Created page with "'''Scott numeral'''(Mogensen-Scott encoding) is a representation of natural number in Lambda calculus numbers <pre> 0 = λs.λz.z 1 = λs.λz.s 0 = λs.λz.s (λs.λz.z) 2 = λs.λz.s 1 = λs.λz.s (λs.λz.s (λs.λz.z)) </pre> successor function and precedence function <pre> succ = λn.λs.λz.s n pred = λn.n (λx.x) 0 </pre> === Arithmetic === First,we need a fixed point combinator <pre> fix = (λx.x x)(λf.λx.x(f f x)) </pre> additive function <pre> add = fix...")
• 09:29, 12 December 2024 Jan jelo talk contribs created page User talk:Jan jelo (Created page with "Here is talk page")
• 07:35, 12 December 2024 Jan jelo talk contribs created page Recs (Created page with "'''recs''is a esolang created by User: Jan jelo.The whole program is a expression,interpreter evaluate it and print the result. It combines partial recursive function and lambda calculus,and also some extensions. === Expression === A expression can be <code><variable></code> <code><natural number></code> <code><function></code> <code>(list <expression> <expression>...)</code> <code>(<function> <expression> <expression>...)</code> <code>(let <name> <expression>....")
• 06:26, 11 December 2024 Jan jelo talk contribs created page User:Jan jelo (Created page with "here is jan jelo. === Esolang === Def run(t):")
• 06:14, 11 December 2024 Jan jelo talk contribs created page Def run(t): (Created page with "'''def run(t):''' is a esolang created by User: Jan jelo,it's a esoteric subset of Python. === Characters === There are only 9 characters in '''def run(t):''' <code>d</code><code>e</code><code>f</code><code>r</code><code>u</code><code>n</code><code>t</code><code>(</code><code>)</code><code>:</code><code> </code><code>\n</code> This allows to define function and return a value. === Turing Completeness === in '''def run(t)''',the recursive depth limit has been removed,...")
• 04:16, 11 December 2024 User account Jan jelo talk contribs was created