# HG changeset patch # User HackBot # Date 1369516673 0 # Node ID d7754e0e42595063ac0d6a4ef94ade18bdf2c693 # Parent b55e778bc3af046a616fbce432e064010779389f pastelogs \\)\\)\\)\\)\\) diff -r b55e778bc3af -r d7754e0e4259 paste/paste.19598 --- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/paste/paste.19598 Sat May 25 21:17:53 2013 +0000 @@ -0,0 +1,301 @@ +2003-07-06.txt:16:17:27: RPN? then /j #nop3 :))))) +2004-06-11.txt:20:34:19: :))))))))))))))))))))))))))))) +2005-05-18.txt:20:34:31: then they give you a page full of )))))))))))))))))) +2005-05-28.txt:23:21:17: gopher would be even better than ftp :)))))) +2005-06-14.txt:23:12:24: Oh, btw, about Lisp, lament: hear hear)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) +2005-06-14.txt:23:12:24: )))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) +2005-08-05.txt:19:04:27: S = lxyz.xz(yz) is an abbreviation for (lx.(ly.(lz.((xz)(yz))))) +2005-08-05.txt:19:06:31: Sabc = (((Sa)b)c) = ((((lx.(ly.(lz.((xz)(yz)))))a)b)c) = (((ly.(lz.((az)(yz))))b)c) = ((lz.((az)(bz)))c) = ((ac)(bc)) +2005-08-05.txt:20:34:55: ((((lx.(ly.(lz.((xz)(yz)))))a)b)c) = (((ly.(lz.((az)(yz))))b)c), why is lx removed and not lz? that's what's confusing me +2005-08-05.txt:20:35:32: I reduce the subterm ((lx.(ly.(lz.((xz)(yz)))))a) +2005-08-05.txt:23:24:34: I was somehow thinking of numbers as fffffffx instead of f(f(f(f(fx))))) ... +2005-08-06.txt:01:15:52: --> (?f.f (?x y.x) (?x y.x (x y)) (?x y.x (x (x (x (x (x y))))))) +2005-08-06.txt:01:57:22: new lsub: (\a b.\g x.(a I (b (K x))) ((\x.x x) (\f x.g (x (f f))))) +2005-08-10.txt:00:40:11: did ?z x y.x (z x y) => (S (K (S (S (K S) (S (K K) I))))) (S (S (K S) (S (K (S (K S))) (S (K (S (K K))) (S (S (K S) (S (K K) I)) (K I))))) (K (K I))) +2005-08-10.txt:00:55:08: did (?x y z.x z y) => (S (S (K S) (S (K K) (S (K S) (S (S (K S) (S (K K) I)) (K I))))) (K (S (K K) I))) in 10 mins +2005-09-18.txt:01:45:16: like for example ((((())))) +2005-10-20.txt:17:17:49: jix: nowhere :))))))))) +2005-10-30.txt:00:05:50: NOOOOOOOOOOOOOOOO! TURN AWAY, BEFORE THE POWER OF LISP ENTANGLES YOU))))))))))))))))))))))))))))))))))))))))))))))))))))) +2005-10-30.txt:00:14:10: NOOOOOOOOOOOOOOOOOOOOOOOOOOOO!)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) +2005-10-30.txt:00:15:42: )))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) is always a problem. +2005-10-30.txt:00:37:12: And I only have a ")))))))))))" in the Glass compiler thing, no longer strings of parens. +2005-11-05.txt:16:01:00: GregorR_: ... target)))))))) ;) +2005-11-05.txt:17:17:08: use lisp!)))))) ;) +2005-11-06.txt:16:10:58: (defun curry3 (f) (lambda (x) (lambda (y) (lambda (z) (funcall f x y z))))) +2005-11-26.txt:21:08:25: So far, I have ack 3 (ack 1 (ack 1 (ack 1 (ack 0 (ack 1 4))))). +2005-11-27.txt:19:12:56: 3.80 seconds to calculate the value of (letrec ((fib (lambda (n) (if (= n 1) 0 (if (= n 2) 1 (+ (fib (- n 2)) (fib (- n 1)))))))) (fib 8)) -- this must be one of the slowest scheme systems ever built. +2006-01-01.txt:18:36:30: heh: ((lambda (x) (list x (list (quote quote) x))) (quote (lambda (x) (list x (list (quote quote) x))))) +2006-01-15.txt:02:34:44: ((((((((((())))))))))) +2006-02-25.txt:00:53:27: \a b c d e f g -> a g (f g) (e g (f g)) (d g (f g) (e g (f g))) (c g (f g) (e g (f g)) (d g (f g) (e g (f g)))) (b g (f g) (e g (f g)) (d g (f g) (e g (f g))) (c g (f g) (e g (f g)) (d g (f g) (e g (f g))))) +2006-03-10.txt:21:32:47: RoboGregorR: pha just because you arn't used to the lisp syntax)))))))))) +2006-03-20.txt:16:02:41: B(1,1,1) = B(0,B(1,0,1),B(1,1,0)) = B(0,B(0,1,1),B(1,0,1)) = B(0,A(1,1),B(0,1,1)) = B(0,A(0,A(1,0)),A(1,1)) = B(0,A(0,A(0,1)),A(0,A(1,0))) = B(0,A(0,2),A(0,A(0,1))) = B(0,3,A(0,2)) = B(0,3,3) = A(3,3) = A(2,A(3,2)) = A(2,A(2,A(3,1))) = A(2,A(2,A(2,A(3,0)))) = A(2,A(2,A(2,A(2,1)))) = A(2,A(2,A(2,A(1,A(2,0))))) = A(2,A(2,A(2,A(1,A(2,0))))) +2006-04-27.txt:01:24:57: consider a loop ((((([...)))))] if I have a negative number and jump to the (((( then I still have to climb out of the negs, I don't start at zero like I did the first time +2006-05-30.txt:01:37:23: Hmm, aleph(aleph(aleph(aleph(aleph(aleph(aleph(...))))))) +2006-07-27.txt:05:37:56: (((((((((())))))))))(()()()()()()()()()()()()()()()()())((()()()()())((())(())(())(())(())(())(())(()))(()()()()()()()))((()()()()()()()()())(())()()()()()()()) +2006-07-27.txt:06:04:18: then again, the (((((((((())))))))))(()()()()()()()()()()()()()()()()())((()()()()())((())(())(())(())(())(())(())(()))(()()()()()()()))((()()()()()()()()())(())()()()()()()()) would ring a wtf +2006-08-29.txt:00:44:14: #do eval ((lambda (x) (list x (list (quote quote) x))) (quote (lambda (x) (list x (list (quote quote) x))))) +2006-08-29.txt:00:44:15: #do eval ((lambda (x) (list x (list (quote quote) x))) (quote (lambda (x) (list x (list (quote quote) x))))) +2006-08-29.txt:00:44:17: #> '((LAMBDA (X) (LIST X (LIST (QUOTE QUOTE) X))) (QUOTE (LAMBDA (X) (LIST X (LIST (QUOTE QUOTE) X))))) +2006-08-29.txt:08:28:06: We were using (defun ackermann (a b) (if (= a 0) (1+ b) (if (< a 0) 0 (if (= b 0) (ackermann (1- a) 1) (ackermann (1- a) (ackermann a (1- b))))))) +2006-08-29.txt:19:11:00: lamentLikes x = length x == 6 && head x == 'P' && head (tail x) == 'y' && head (tail (tail x)) == 't' && head (tail (tail (tail x))) = 'h' && head (tail (tail (tail (tail x)))) = 'o' && head (tail (tail (tail (tail (tail x))))) = 'n' +2006-09-06.txt:01:07:10: (defun foldr (f b l) (cond ((null l) b) (something (f (car l) (foldr f b (cdr l)))))) <- my little foldr function +2006-09-06.txt:01:09:40: (defun foldr (f b l) (if (null l) b (f (car l) (foldr f b (cdr l)))))? +2006-09-06.txt:01:18:01: (define (fold-right function initial list) (if (null? list) (function initial initial) (if (null? (cdr list)) (function initial (car list)) (fold-right function (function initial (car list)) (cdr list))))) +2006-11-05.txt:03:08:13: ha":"values").values()))))()].__dict__.[lambda: "__class__"()].__dict__[lambda "".join(list("".join(list("__len__"))))()].__call__.__call__.__call__.__call__()) +2006-11-22.txt:05:00:11: PLUS = (LAMBDA (X Y) (X (LAMBDA () Y) (LAMBDA (N) (SUCC (PLUS N Y))))) +2006-11-22.txt:05:02:55: plus = (lambda (x y) (x (lambda () y) (lambda (n) (succ (plus n y))))) +2006-11-22.txt:05:08:37: NAT-TO-CHURCH = (LAMBDA (N) (LAMBDA (F) (LAMBDA (X) (N (LAMBDA () X) (LAMBDA (M) (F (NAT-TO-CHURCH M)))))) +2006-11-22.txt:05:11:16: NAT-TO-CHURCH = (LAMBDA (N) (LAMBDA (F X) (N (LAMBDA () X) (LAMBDA (M) F (NAT-TO-CHURCH M)))))) +2006-12-22.txt:02:15:05: given (defun a (m n) (cond ((= m 0) (+ n 1)) ((and (> m 0) (= n 0)) (a (- m 1) 1)) ((and (> m 0) (> n 0)) (a (- m 1) (a m (- n 1)))))), does (a 10 13) terminate? +2006-12-22.txt:02:16:11: given (defun a (m n) (cond ((= m 0) (+ n 1)) ((and (> m 0) (= n 0)) (a (- m 1) 1)) ((and (> m 0) (> n 0)) (a (- m 1) (a m (- n 1)))))), compute (a 4 3) please +2006-12-22.txt:02:37:12: given that (defun f (x y) (cond ((> x y) (f y x) (t (f (+ x y) y))))), does (f 2 1) terminate? does (f 1 2) terminate? +2007-01-07.txt:01:30:02: ~pexec self.register_raw(r"\S+ PRIVMSG (\S+) :~list (.*)", lambda x,y : bot.raw("PRIVMSG %s :%s" % (y.group(1), list(y.group(2))))) +2007-01-18.txt:05:22:46: :))))) +2007-01-21.txt:07:40:24: ~exec import random;self.register_raw("^\S* PRIVMSG #esoteric : *~roll (?P\d*) *$", lambda x,y: sys.stdout(random.randint(1,int(y.groups("d"))))) +2007-01-21.txt:07:40:50: ~exec import random;self.register_raw("^\S* PRIVMSG #esoteric : *~roll (?P\d*) *$", lambda x,y: sys.stdout(str(random.randint(1,int(y.groups("d")))))) +2007-01-21.txt:07:41:32: ~exec import random;self.register_raw("^\S* PRIVMSG #esoteric : *~roll (?P\d*) *$", lambda x,y: sys.stdout(str(random.randint(1,int(y.group("d")))))) +2007-01-21.txt:07:42:25: ~exec import random;self.register_raw("^\S* PRIVMSG #esoteric : *~roll (?P\d*) *$", lambda x,y: sys.stdout(str(__import__("random").randint(1,int(y.groups("d")))))) +2007-01-21.txt:07:44:32: ~exec import random;self.register_raw("^\S* PRIVMSG #esoteric : *~roll (?P\d*) *$", lambda x,y: sys.stdout.write(str(__import__("random").randint(1,int(y.groups("d")))))) +2007-01-21.txt:07:46:04: ~exec import random;self.register_raw("^\S* PRIVMSG #esoteric : *~roll (?P\d*) *$", lambda x,y: sys.stdout.write(str(__import__("random").randint(1,int(y.group("d")))))) +2007-01-21.txt:07:47:44: ~exec globals()["random"] = __import__("random");self.register_raw("^\S* PRIVMSG #esoteric : *~roll (?P\d*) *$", lambda x,y: sys.stdout.write(str(random.randint(1,int(y.group("d")))))) +2007-01-21.txt:07:56:33: ~exec self.__class__.imlazy = lambda x,f: self.register_raw("^\S* PRIVMSG #esoteric : *%s (?:(?: (.*?) ))* *", lambda ge,ha: sys.stdout(str(f(*ha.groups())))) +2007-01-21.txt:07:57:13: ~exec self.__class__.imlazy = lambda x,f: self.register_raw("^\S* PRIVMSG #esoteric : *%s (?:(?: (.*?) ))* *" % x, lambda ge,ha: sys.stdout(str(f(*ha.groups())))) +2007-01-21.txt:07:58:33: ~exec self.__class__.imlazy = lambda x,f: self.register_raw("^\S* PRIVMSG #esoteric : *%s (?P.*)$" % x, lambda ge,ha: sys.stdout(str(f(*ha.group("inp"))))) +2007-01-21.txt:07:59:25: ~exec self.__class__.imlazy = lambda self, x,f: self.register_raw("^\S* PRIVMSG #esoteric : *%s (?P.*)$" % x, lambda ge,ha: sys.stdout(str(f(*ha.group("inp"))))) +2007-01-21.txt:08:01:27: ~exec self.__class__.imlazy = lambda self, x,f: self.register_raw("^\S* PRIVMSG #esoteric : *%s (?P.*)$" % x, lambda ge,ha: sys.stdout(str(f(ha.group("inp"))))) +2007-01-27.txt:13:19:03: :))))) +2007-01-27.txt:13:19:10: :))))))))))))))))))))) +2007-01-29.txt:23:58:27: (define (curry f . x) (lambda (a . rest) (apply f (append x (cons a rest))))) +2007-02-01.txt:00:54:25: (define fibs (cons-stream 0 (cons-stream 1 (stream-add fibs (stream-cdr fibs))))) +2007-02-10.txt:23:59:51: (define (f n) (cond ((perfect n) 1) (else (f (+ n 2))))) (f 3) +2007-02-22.txt:16:59:35: ((((((((((((((((Hello, world!)))))))))))))))) +2007-02-24.txt:18:51:51: ~exec self.register_raw(r"\S+ PRIVMSG (\S+) :~ski (.*)", lambda x,y: bot.raw("PRIVMSG %s :%s" % (y.group(1), ski_repl.unparse(ski_repl.simp(ski_repl.parse(y.group(2)))))) +2007-02-24.txt:18:52:29: ~exec self.register_raw(r"\S+ PRIVMSG (\S+) :~ski (.*)", lambda x,y: bot.raw("PRIVMSG %s :%s" % (y.group(1), ski_repl.unparse(ski_repl.simp(ski_repl.parse(y.group(2))))))) +2007-02-24.txt:18:53:11: ~exec self.register_raw(r"\S+ PRIVMSG (\S+) :~ski (.*)", lambda x,y: bot.raw("PRIVMSG %s :%s" % (y.group(1), ski_repl.unparse(ski_repl.simp(ski_repl.parse(y.group(2))))))) +2007-02-24.txt:18:54:19: ~exec self.register_raw(r"\S+ PRIVMSG (\S+) :~ski (.*)", lambda x,y: bot.raw("PRIVMSG %s :%s" % (y.group(1), ski_repl.unparse(ski_repl.simp(ski_repl.parse(y.group(2))))))) +2007-02-24.txt:19:21:54: ~exec self.register_raw(r"\S+ PRIVMSG (\S+) :~ski (.*)", lambda x,y: bot.raw("PRIVMSG %s :%s" % (y.group(1), ski_repl.unparse(ski_repl.simp(ski_repl.parse(y.group(2))))))) +2007-02-24.txt:19:27:09: ~exec self.register_raw(r"\S+ PRIVMSG (\S+) :~ski (.*)", lambda x,y: bot.raw("PRIVMSG %s :%s" % (y.group(1), ski_repl.unparse(ski_repl.simp(ski_repl.parse(y.group(2))))))) +2007-02-24.txt:19:28:49: ~exec self.register_raw(r"\S+ PRIVMSG (\S+) :~ski (.*)", lambda x,y: bot.raw("PRIVMSG %s :%s" % (y.group(1), ski_repl.unparse(ski_repl.simp(ski_repl.parse(y.group(2))))))) +2007-02-25.txt:00:51:10: ~exec self.register_raw(r"\S+ PRIVMSG (\S+) :~ski (.*)", lambda x,y: bot.raw("PRIVMSG %s :%s" % (y.group(1), ski_repl.unparse(ski_repl.simp(ski_repl.parse(y.group(2))))))) +2007-02-26.txt:16:11:03: ~exec self.register_raw(~exec self.register_raw(r"\S+ PRIVMSG (\S+) :>>>(.*)", lambda x,y: sys.stdout(repr(eval(y.group(1))))) +2007-02-26.txt:16:11:29: ~exec self.register_raw(~exec self.register_raw(r"\S+ PRIVMSG (\S+) :>>>(.*)", lambda x,y: sys.stdout(repr(eval(y.group(1)))))) +2007-02-26.txt:16:11:53: ~exec self.register_raw(r"\S+ PRIVMSG (\S+) :>>>(.*)", lambda x,y: sys.stdout(repr(eval(y.group(1))))) +2007-02-26.txt:16:15:30: ~exec self.register_raw(r"\S+ PRIVMSG (\S+) :>>>(.*)", lambda x,y: sys.stdout(repr(eval(y.group(1))))) +2007-02-26.txt:16:18:00: ~exec self.register_raw(r"\S+ PRIVMSG (\S+) :>>>(.*)", lambda x,y: sys.stdout(repr(eval(y.group(2))))) +2007-02-26.txt:16:25:08: ~exec self.register_raw(r"\S+ PRIVMSG (\S+) :>>>(.*)", lambda x,y: sys.stdout(repr(eval(y.group(2))))) +2007-03-04.txt:00:37:52: (cons (cons (cons (cons (cons nil))))) ...5, and then use the properties of lists to do arithmetic. +2007-03-16.txt:00:16:41: ((Y (lambda (f) (lambda (l) (f (cons 'bitch l))))) '()) +2007-03-16.txt:00:21:10: ((lambda (x) (x x)) (lambda (f) (cons 'bitch (f f))))) +2007-03-16.txt:00:24:25: (cons 'bitch ((lambda (f) (cons 'bitch (f f))) (lambda (f) (cons 'bitch (f f))))) +2007-03-16.txt:00:30:35: ((lambda (x) (x x)) (lambda (f) (cons-stream 'bitch (f f))))) +2007-03-18.txt:09:57:12: Someone please find number of digits of 2^(2^(2^(2^(2^(2^(2^0)))))) +2007-03-18.txt:09:59:39: (2^(2^(2^(2^(2^(2^0))))) has over 19 thousand digits +2007-03-18.txt:10:00:22: 2^(2^(2^(2^(2^(2^(2^0)))))) -> 2^(2^(2^(2^(2^(2^1))))) -> 2^(2^(2^(2^(2^2)))) +2007-03-18.txt:10:01:01: length $ show $ (2^(2^(2^(2^(2^(2^0)))))) +2007-03-27.txt:16:18:30: (d(d(d(d(d(d(d(d(4)))))))-s(4))*d(4)-d(4) +2007-03-27.txt:18:42:37: ((lambda (x) (list x (list (quote quote) x))) (quote (lambda (x) (list x (list (quote quote) x))))) +2007-04-07.txt:23:39:51: (display ((lambda (x) (list (quote display) (list x (list (quote quote) x)))) (quote (lambda (x) (list (quote display) (list x (list (quote quote) x))))))) +2007-04-07.txt:23:50:20: shorter: ((lambda (x) (display (list x (list (quote quote) x)))) (quote (lambda (x) (display (list x (list (quote quote) x)))))) +2007-06-16.txt:00:46:24: ((lambda 3 1 ((closure-ref (get-num-arg 1) 0) (get-num-arg 1) (closure (lambda 2 3 ((lambda 1 1 ((closure-ref (get-num-arg 1) 0) (get-num-arg 1) (get-num-arg 3))) (get-num-arg 2)))))) (closure (lambda 4 2 (%halt (get-num-arg 2))))) +2007-06-25.txt:18:45:27: ((y-lambda (self) (λ (n) (if (zero? n) 1 (* n (self (- n 1)))))) 5) ; 120 +2007-06-25.txt:18:52:31: (define y-combinator (λ (x) ((λ (p) (x (λ (n) ((p p) n)))) (λ (p) (x (λ (n) ((p p) n))))))) +2007-06-25.txt:18:52:35: `(y-combinator (λ (,self-symbol) ,proc))))) +2007-07-08.txt:05:54:46: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((("lisp sucks too, if you're fucking ridiculous about it."))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) +2007-07-23.txt:22:36:04: (define (div a b) ((church-less-than a b) nil) (else (+ 1 (div (sub a b) b))))) +2007-07-23.txt:22:37:40: (define (div a b) ((church-less-than a b) nil) (else (inc (div (sub a b) b))))) +2007-07-26.txt:23:55:55: (call/cc (lambda (cont) (let ((foo (lambda () (cont #f)))) (print (begin (foo) 1))))) +2007-08-26.txt:09:51:00: >>> sch (define factorial (lambda (a) (if (= a 0) 1 (if (= a 1) 1 (* a (factorial (- a 1)))))))(factorial 6) +2007-08-26.txt:09:52:45: >>> sch (define (factorial a) (cond ((= a 0) 1) ((= a 1) 1) (1 (* a (factorial (- a 1)))))) (factorial 6) +2007-08-27.txt:20:44:18: >>> sch (define s (lambda (a) (lambda (b) (lambda (c) ((a c) (b c)))))) +2007-08-27.txt:20:45:49: sch (define fib (lambda (n) (if (< n 2) 1 (+ (fib (- n 1) (- n 2)))))) +2007-08-27.txt:20:45:54: >>> sch (define fib (lambda (n) (if (< n 2) 1 (+ (fib (- n 1) (- n 2)))))) +2007-08-27.txt:20:46:52: >>> sch (define fib (lambda (n) (if (< n 2) 1 (+ (fib (- n 1)) (fib (- n 2))))))) +2007-08-27.txt:20:48:35: >>> sch (define s (lambda (a) (lambda (b) (lambda (c) ((a c) (b c)))))) +2007-08-27.txt:21:09:45: >>> sch (define s (lambda (a) (lambda (b) (lambda (c) ((a c) (b c)))))) +2007-08-27.txt:21:11:51: >>> sch ((lamdba (x) (list x (list (quote quote) x))) (quote (lamdba (x) (list x (list (quote quote) x))))) +2007-08-27.txt:21:13:21: >>> sch ((lambda (x) (list x (list (quote quote) x))) (quote (lambda (x) (list x (list (quote quote) x))))) +2007-08-27.txt:21:15:15: >> sch ((lambda (x) (cons x (cons (cons (quote quote) (cons x (quote ()))) (quote ())))) (quote (lambda (x) (cons x (cons (cons (quote quote) (cons x (quote ()))) (quote ())))))) +2007-08-27.txt:21:15:25: >>> sch ((lambda (x) (cons x (cons (cons (quote quote) (cons x (quote ()))) (quote ())))) (quote (lambda (x) (cons x (cons (cons (quote quote) (cons x (quote ()))) (quote ())))))) +2007-08-27.txt:21:35:25: >>> sch ((lambda (x) (cons x (cons (cons (quote quote) (cons x (quote ()))) (quote ())))) (quote (lambda (x) (cons x (cons (cons (quote quote) (cons x (quote ()))) (quote ())))))) +2007-08-27.txt:21:43:34: >>> sch ((lambda (x) (cons x (cons (cons (quote quote) (cons x (quote ()))) (quote ())))) (quote (lambda (x) (cons x (cons (cons (quote quote) (cons x (quote ()))) (quote ())))))) +2007-08-27.txt:21:45:00: >>> sch ((lambda (x) (cons x (cons (cons (quote quote) (cons x (quote ()))) (quote ())))) (quote (lambda (x) (cons x (cons (cons (quote quote) (cons x (quote ()))) (quote ())))))) +2007-08-27.txt:21:46:21: >>> sch ((lambda (x) (cons x (cons (cons (quote quote) (cons x (quote ()))) (quote ())))) (quote (lambda (x) (cons x (cons (cons (quote quote) (cons x (quote ()))) (quote ())))))) +2007-08-27.txt:21:46:50: ((lambda (x) (cons x (cons (cons (quote quote) (cons x (quote ()))) (quote ())))) (quote (lambda (x) (cons x (cons (cons (quote quote) (cons x (quote ()))) (quote ())))))) <<< this is output if i run from command line +2007-08-27.txt:21:48:03: >>> sch (((lambda (x) (x x)) (lambda (self) (lambda (a b) (if (= b 0) a ((self self) (+ a 1) (- b 1)))))) 4 5) +2007-08-27.txt:21:57:05: >>> sch ((lambda (x) (cons x (cons (cons (quote quote) (cons x (quote ()))) (quote ())))) (quote (lambda (x) (cons x (cons (cons (quote quote) (cons x (quote ()))) (quote ()))) +2007-08-27.txt:21:57:06: ((lambda (x) (cons x (cons (cons (quote quote) (cons x (quote ()))) (quote ())))) (quote (lambda (x) (cons x (cons (cons (quote quote) (cons x (quote ()))) (quote ())))))) +2007-08-29.txt:00:10:15: ((lambda (x) (x x)) (lambda (self) (lambda (f) (f (lambda args (apply ((self self) f) args)))))) +2007-09-13.txt:18:55:19: ~exec time.sleep((lambda x: 1 - x - __import__("math").floor(x))(time.time())); while True: sys.stdout(__import__("math").floor(time.time()))))))) +2007-10-30.txt:17:41:00: -> ('s', ('s', ('k', 's'), 'k'), ('s', ('s', ('k', 's'), 'k'), ('s', ('s', ('k', 's'), 'k'), ('s', ('s', ('k', 's'), 'k'), ('s', ('s', ('k', 's'), 'k'), ('k', 'i')))))) +2007-11-03.txt:20:24:50: >>> sch (define s (lambda (a) (lambda (b) (lambda (c) ((a c) (b c)))))) +2007-11-03.txt:20:49:44: > (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) +2007-11-03.txt:23:51:23: > (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) +2007-11-03.txt:23:52:10: > (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) +2007-11-03.txt:23:53:41: > ((((lambda (a) (lambda (b) (lambda (c) ((a c) (b c))))) (lambda (a) (lambda (b) a))) (lambda (a) (lambda (b) a))) 8) +2007-11-04.txt:00:15:24: > ((((lambda (a) (lambda (b) (lambda (c) ((a c) (b c))))) (lambda (a) (lambda (b) a))) (lambda (a) (lambda (b) a))) 8) +2007-11-04.txt:00:17:05: > (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) +2007-11-04.txt:00:17:58: (def s (x) (lambda (y) (lambda (z) ((x z) (y z))))) +2007-11-04.txt:00:17:59: > (def s (x) (lambda (y) (lambda (z) ((x z) (y z))))) +2007-11-04.txt:00:20:33: > (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) (def k (a) (lambda (b) a)) +2007-11-04.txt:00:23:02: > (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) (def k (a) (lambda (b) a)) (((s k) k) 3) +2007-11-04.txt:00:24:45: > (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) (def k (a) (lambda (b) a)) (((s k) k) 3) +2007-11-04.txt:00:26:05: > (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) (def k (a) (lambda (b) a)) (((s k) k) 3) +2007-11-04.txt:00:27:16: > (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) (def k (a) (lambda (b) a)) (((s k) k) 3) +2007-11-04.txt:00:37:21: > (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) +2007-11-04.txt:00:39:15: > (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) +2007-11-04.txt:00:40:06: > (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) +2007-11-04.txt:00:48:26: > (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) +2007-11-04.txt:00:48:58: > (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) +2007-11-04.txt:00:49:06: > (def k (a) (lambda (b) (lambda (c) ((a c) (b c))))) +2007-11-04.txt:00:49:12: > (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) +2007-11-04.txt:00:49:16: > (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) +2007-11-04.txt:00:49:23: > (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) +2007-11-04.txt:00:49:24: > (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) +2007-11-04.txt:00:49:26: > (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) +2007-11-04.txt:00:49:27: > (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) +2007-11-04.txt:00:49:58: > (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) +2007-11-04.txt:00:50:56: > (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) +2007-11-04.txt:00:51:01: > (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) +2007-11-04.txt:00:51:05: > (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) +2007-11-04.txt:00:51:06: > (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) +2007-11-04.txt:00:51:09: > (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) +2007-11-04.txt:00:51:12: > (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) +2007-11-04.txt:00:51:14: > (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) +2007-11-04.txt:00:58:12: > > (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) +2007-11-04.txt:00:58:15: > (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) +2007-11-04.txt:00:58:20: > (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) +2007-11-04.txt:01:06:50: > (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) +2007-11-04.txt:01:06:51: > (def s (a) (lambda (b) (lambda (c) ((a c) (b c))))) +2007-11-04.txt:17:26:44: > (def fact (n) (if (eq n 1) 1 (* n (fact (- n 1))))) +2007-11-04.txt:17:27:47: > (def fact (n) (if (eq n 1) 1 (* n (fact (- n 1))))) +2007-11-04.txt:17:30:08: > (def fact (n) (if (eq n 1) 1 (* n (fact (- n 1))))) +2007-11-04.txt:17:31:08: > (def fact (n) (if (eq n 1) 1 (* n (fact (- n 1))))) +2007-11-04.txt:17:33:27: > (def fact (n) (if (eq n 1) 1 (* n (fact (- n 1))))) +2007-11-30.txt:16:43:07: A(0,A(1,139)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))). +2007-12-19.txt:20:12:52: the last 5 pages of the universe is alll )))))))))))))))))))))))))))) +2007-12-21.txt:18:15:50: I get ((S((S((S(KS))((S(KS))((S((S(KS))((S(KK))(KS))))((S((S(KS))((S(KK))(KK))))((S(KK))I))))))(KI))((S(KK))(KI))) +2007-12-21.txt:18:21:37: e.g. it turns 5,4,x into (5 4) x == (\y. 4 (4 (4 (4 (4 y))))) x = 4(4(4(4(4x)))) +2007-12-21.txt:21:34:42: e.g. context = new Context(Symbol.intern("succ"), new Lambda(new Cons(Symbol.intern("n"), new Nil()), new Lambda(new Cons(Symbol.intern("f"), new Cons(Symbol.intern("x"), new Nil())), new Cons(Symbol.intern("n"), new Cons(Symbol.intern("f"), new Cons(new Cons(Symbol.intern("f"), new Cons(Symbol.intern("x"), new Nil())), new Nil()))))), context); +2007-12-22.txt:02:56:07: s = ((s ((s (k s)) ((s (k k)) ((s (k s)) ((s ((s (k s)) ((s (k k)) i))) (k i)))))) (k ((s ((s (k s)) ((s (k k)) i))) (k i)))) +2007-12-22.txt:02:59:06: \x y z w -> ((x y) (z w)) = ((s ((s (k s)) ((s (k (s (k s)))) ((s (k (s (k k)))) ((s (k (s (k s)))) ((s (k (s (k k)))) ((s ((s (k s)) ((s (k k)) i))) (k i)))))))) (k (k ((s ((s (k s)) ((s (k k)) i))) (k i))))) +2007-12-22.txt:14:27:12: e.g. when you see a branch with ((s ((s (k s)) ((s (k k)) ((s (k s)) ((s ((s (k s)) ((s (k k)) i))) (k i)))))) (k ((s ((s (k s)) ((s (k k)) i))) (k i)))) in it -- which has type (a -> b -> c) -> (a -> b) -> a -> c, just replace it with s +2008-01-05.txt:21:10:06: (+ (fib (- n 1)) (fib (- n 2)))))) +2008-01-05.txt:21:11:16: (else (+ (fib (- n 1)) (fib (- n 2)))))) +2008-01-05.txt:21:13:30: (+ (fib (- n 1)) (fib (- n 2))))) +2008-01-15.txt:00:28:17: (first lists))))) +2008-01-15.txt:01:40:26: (def silly (lst) (extract (((first rest... last)) lst)) (cons last (append rest (list first))))) +2008-01-21.txt:21:30:16: ;))))))))))))))))))) +2008-01-22.txt:16:13:03: (LET ((#:G2102 1) (#:G2103 1)) (LET ((#:G2104 (EQUAL #:G2102 #:G2103))) (IF #:G2104 #:G2104 (OR (ERROR (FORMAT NIL "Test failed, expected ~S but got ~S" #:G2102 #:G2103)))))) +2008-01-22.txt:22:44:27: (else (apply (elt commands (car p)) (cdr p))))) +2008-01-23.txt:19:49:03: (defmacro times (n &body body) (if (= n 1) body `(progn ,body (times ,(- n 1) ,@(cdr body))))) +2008-01-23.txt:19:49:35: (defmacro times (n &body body) (if (= n 1) body `(progn ,@body (times ,(- n 1) ,@(cdr body))))) +2008-01-23.txt:19:58:57: `((progn ,@body) ,@(macroexpand `(times-helper ,(- n 1) ,@body))))) +2008-01-24.txt:21:01:48: ((lambda (m) ((lambda (x) (x x)) (lambda (y) (m (y y)))))) ;; Should work in a lazy lisp +2008-01-28.txt:01:12:28: makeCounter = (\name = (count = 0, tick = (\name = (\name.count = (\name.count + 1))))) +2008-02-08.txt:22:13:56: -!- ehird__ changed the topic of #esoteric to: ((lambda (f) (lambda (x) (f (lambda () (x x)))) (lambda (x) (f (lambda () (x x))))) (lambda (f) (display "THE TOPIC IS NOT ") (write (f)))) +2008-02-10.txt:20:42:23: (a (b (c) (d))) -> (c (lambda (x) (d (lambda (y) (b x y (lambda (z) (a z)))))) +2008-02-15.txt:13:13:05: Or ^f^x.f(f(f(f(f(f(f(f(x))))))) in lambdas. +2008-03-22.txt:19:00:10: #0=(begin #@(((source-file . "console") (line-number . 1) (column-number . 11) . #1=((source-kind . user))) . (write #@(((source-file . "console") (line-number . 1) (column-number . 18) . #1#) . (quote #@(((source-file . "console") (line-number . 1) (column-number . 4) . #1#) . #0#))))) #@(((source-file . "console") (line-number . 1) (column-number . 31) . #1#) . (newline))) +2008-03-29.txt:00:47:05: (a b c d) = (a . (b . (c . (d . ())))) +2008-03-29.txt:00:49:17: (a . (lambda () (b (lambda () (c (lambda () (d . ()))))))) = (stream a b c d) +2008-03-29.txt:00:56:41: (define (read-file f) (let ((c (read-char f))) (if (eof-object? c) '() (cons c (read-file f))))) +2008-03-29.txt:01:08:20: (apply amb (cdr args))))))) +2008-03-31.txt:21:51:21: (languages (applicative (in (backwards (is (composition (function))))))) -- Slava Pestov, creator of Factor +2008-04-03.txt:17:25:47: current factorial (= fact {(-> 1 1) (-> n (* n (out (' (- n 1)))))}) (fact 4) +2008-04-03.txt:17:55:38: (= fact {(-> 1 (outn 1)) (-> n (outn (* n (' (- n 1)))))}) (fact 4) +2008-04-09.txt:16:46:39: :: (= qs { (-> [] []) (-> (: h t) (+ (qs (\ {(< _ h)} t)) (+ [h] (qs (\ {(>= _ h)} t)))))}) +2008-04-10.txt:01:37:32: :: (= qs {(-> [] []) (-> (: h t) (+ (qs (\ {(< _ h)} t)) (+ [h] (qs (\ {(>= _ h)} t)))))}) +2008-04-10.txt:01:38:33: :: (= qs {(-> [] []) (-> (: h t) (+ (qs (ftr {(< _ h)} t)) (+ [h] (qs (ftr {(>= _ h)} t)))))}) +2008-04-10.txt:02:19:25: :: (= list (cons 6 (cons 1 (cons 9 (cons 2 (cons 4 (cons 0 nil))))))) +2008-04-10.txt:02:19:59: :: (= qs {(-> (: h t) (+ (qs (flr {(< _ h)} t)) (+ [h] (qs (flr {(>= _ h)} t))))) []}) +2008-04-10.txt:02:26:35: :: (= list (cons 6 (cons 1 (cons 9 (cons 2 (cons 4 (cons 0 nil))))))) (= qs {(-> (: h t) (+ (qs (flr {(< _ h)} t)) (+ [h] (qs (flr {(>= _ h)} t))))) []}) (qs list) +2008-04-10.txt:02:27:20: :: (qs (cons 5 (cons 4 (cons 3 (cons 2 (cons 1 nil)))))) +2008-04-10.txt:02:28:30: :: (qs (cons 4 (cons 3 (cons 2 (cons 1 nil))))) +2008-04-10.txt:02:28:54: :: (= qs {(-> (: h t) (+ (qs (flr {(< _ h)} t)) (+ [h] (qs (flr {(>= _ h)} t))))) []}) +2008-04-10.txt:02:29:43: :: (= qs {(-> (: h t) (+ (qs (\ {(< _ h)} t)) (+ [h] (qs (\ {(>= _ h)} t))))) []}) +2008-04-10.txt:02:29:55: :: (qs (cons 5 (cons 4 (cons 3 (cons 2 (cons 1 nil)))))) +2008-04-10.txt:02:30:26: :: (cons 5 (cons 4 (cons 3 (cons 2 (cons 1 nil))))) +2008-04-10.txt:02:47:00: :: (= list (cons 5 (cons 4 (cons 3 (cons 2 (cons 1 (cons 0 nil))))))) +2008-04-10.txt:02:47:10: :: (= qs {(-> (: h t) (+ (qs (flr {(< _ h)} t)) (+ [h] (qs (flr {(>= _ h)} t))))) []}) +2008-04-10.txt:02:48:26: :: (= list (cons 5 (cons 4 (cons 3 (cons 2 (cons 1 (cons 0 nil))))))) +2008-04-10.txt:02:48:31: :: (= qs {(-> (: h t) (+ (qs (flr {(< _ h)} t)) (+ [h] (qs (flr {(>= _ h)} t))))) []}) +2008-04-10.txt:02:55:05: :: (= list (cons 5 (cons 4 (cons 3 (cons 2 (cons 1 (cons 0 nil))))))) +2008-04-10.txt:03:04:14: :: (= qsort {(-> (: h t) (+ (qsort (filter {(< _ h)} t)) (+ [h] (qsort p(filter {(>= _ h)} t))))) []}) +2008-04-10.txt:03:04:33: (= qsort {(-> (: h t) (+ (qsort (filter {(< _ h)} t)) (+ [h] (qsort (filter {(>= _ h)} t))))) []}) +2008-04-10.txt:03:04:38: :: (= qsort {(-> (: h t) (+ (qsort (filter {(< _ h)} t)) (+ [h] (qsort (filter {(>= _ h)} t))))) []}) +2008-04-10.txt:03:15:27: :: (= cons {(-> [h t] {(-> [$pb :] [h t]) (-> $car h) (-> $cdr t) (-> [$setcar h] h) (-> [$setcdr t] t) (-> [$! 0] h) (-> [$! n] (! t (- n 1))) (-> $length (+ 1 (length t)))})})(= list (cons 5 (cons 4 (cons 3 (cons 2 (cons 1 (cons 0 nil)))))))(= qs {(-> (: h t) (+ (qs (flr {(< _ h)} t)) (+ [h] (qs (flr {(>= _ h)} t))))) []})(qs list) +2008-04-10.txt:03:16:12: :: (= cons {(-> [h t] {(-> [$pb :] [h t]) (-> $car h) (-> $cdr t) (-> [$setcar h] h) (-> [$setcdr t] t) (-> [$! 0] h) (-> [$! n] (! t (- n 1))) (-> $length (+ 1 (length t)))})})(= list [6 5 4 3 2 1 0])(= qs {(-> (: h t) (+ (qs (flr {(< _ h)} t)) (+ [h] (qs (flr {(>= _ h)} t))))) []})(qs list) +2008-04-17.txt:18:38:09: i want >...< to be the neglist syntax :))))) +2008-04-24.txt:20:35:40: :)))))) +2008-04-28.txt:16:38:16: fix f arg = f (f (f ... (f arg))))) +2008-05-06.txt:22:21:22: or do oko-style :))))))))))))))))))))))) +2008-05-06.txt:22:21:33: but i have never said :-)))))) before coming in here +2008-05-08.txt:22:17:54: (define (tc expr) (cond ((eq? (car expr) 'lambda) (lambda (x) (replace (cadr expr) x (cddr expr)))) (else (apply (eval (car expr)) (map eval (cdr expr))))) +2008-06-05.txt:00:44:44: (define (N n) (if (zero? n) N0 (S (N (- 1 n))))) +2008-06-05.txt:01:07:54: (define (mu' f n) (if (zero? (f n)) 0 (+ 1 (mu f (+ n 1))))) +2008-06-05.txt:18:52:49: [19:51:17] Would µ with one variable be (define (µ f y) (cond ((= (f y) 0) y) ( #t ( µ f (+ y 1))))) ? +2008-06-10.txt:01:07:02: (define (A m n) (cond ((= m 0) (+ 1 n))((> m 0)(cond ((= n 0) (A (- m 1) 1)) (> n 0) (A (- m 1) (A m (- n 1))))))) +2008-06-10.txt:01:12:42: (define (A m n) (if (= m 0) (+ 1 n) (if (= n 0) (A (- m 1) 1) (A (- m 1) (A m (- n 1)))))) +2008-06-10.txt:01:47:19: ((/ a b) . (modulo . (a . (b . ())))) +2008-06-13.txt:01:15:31: I use (define (M n) (if (> n 100) (- n 10) (M (M (+ n 11))))) +2008-06-13.txt:03:21:02: (define (list->number x n) (if (null? (cdr x)) (*(power 10 n) (car x)) (+ (* (last x) (power 10 n)) (list->number (cdr (reverse x)) (+ 1 n))))) +2008-06-13.txt:03:35:04: (define (power a b) (if (= b 0) 1 (* a (power a (- b 1))))) this can be done logarithmically +2008-06-23.txt:13:42:14: so fixed-point of (f n) is (f (f (f (... (f(f n))))) +2008-07-14.txt:20:24:52: (* n (factorial (- n 1))))) +2008-07-18.txt:01:45:27: but anyway, i think augur just sucks ass, as he's gay ;))))) +2008-07-19.txt:03:43:01: (every(thing (in (lisp (uses (parent)))))) +2008-07-27.txt:22:04:54: (define (cons a b) (lambda (op) (cond ((= op 'car) a) ((= op 'cdr) b) (else (error))))) +2008-08-02.txt:07:35:57: :)))))) +2008-08-09.txt:14:29:33: tusho: (= cons {(-> [h t] {(-> [$pb :] [h t]) (-> $car h) (-> $cdr t) (-> [$setcar h] h) (-> [$setcdr t] t) (-> [$! 0] h) (-> [$! n] (! t (- n 1))) (-> $length (+ 1 (length t)))})})(= list (cons 5 (cons 4 (cons 3 (cons 2 (cons 1 (cons 0 nil)))))))(= qs {(-> (: h t) (+ (qs (flr {(< _ h)} t)) (+ [h] (qs (flr {(>= _ h)} t))))) []})(qs list) +2008-08-14.txt:08:21:40: lucky us! :)))))) +2008-10-01.txt:17:03:05: )))))))))))))))))))))))))))) +2008-10-01.txt:17:20:21: (for-each display (append (map (lambda (i) (string-ref "Hello, world!" i)) (letrec ((iota (lambda (from to) (if (= from to) (cons from '()) (cons from (iota (+ from 1) to)))))) (iota 0 12))) (list #\newline))) +2008-10-01.txt:17:49:41: While I can certainly see some very very good things with scheme, I have so far two issues with it: 1) you end up with too many ))))) at the end of many expressions for it to be readable. 2) apart from really trivial things it is rather ugly languages, and then I don't mean only macros, but also code with no macros +2008-10-10.txt:22:27:52: oepy: ((lambda 3 1 ((closure-ref (get-num-arg 1) 0) (get-num-arg 1) (closure (lambda 2 3 ((lambda 1 1 ((closure-ref (get-num-arg 1) 0) (get-num-arg 1) (get-num-arg 3))) (get-num-arg 2)))))) (closure (lambda 4 2 (%halt (get-num-arg 2))))) +2008-10-15.txt:19:40:00: |: (+ 1 (call/cc (lambda (k) (+ 2 (k 3))))) +2008-10-24.txt:00:04:31: (((((~()))))) +2008-10-24.txt:03:57:49: 01(1)(0)((1)(0))((0)(1))(((1)(0))((0)(1)))(((0)(1))((1)(0)))((((1)(0))((0)(1)))(((0)(1))((1)(0))))((((0)(1))((1)(0)))(((1)(0))((0)(1))))(((((1)(0))((0)(1)))(((0)(1))((1)(0))))((((0)(1))((1)(0)))(((1)(0))((0)(1)))))(((((0)(1))((1)(0)))(((1)(0))((0)(1))))((((1)(0))((0)(1)))(((0)(1))((1)(0))))) ...too much output! +2008-10-28.txt:02:05:26: (((((!())))))(((((!())))))(((((!())))))(((((!())))))((!()))((!()))!() ...S out of stack! +2008-10-28.txt:03:30:53: (((((!!)))))(((((!!)))))(((((!!)))))(((((!!)))))((!!))((!!))!! ...S out of stack! +2008-10-28.txt:03:31:24: ()((((((!!))))))((((((!!))))))((((((!!))))))((((((!!))))))(((!!)))(((!!)))(!!) ...a out of stack! +2008-10-28.txt:03:39:51: ~:(*a(a(:^)*(*a)~*a(~:)~*(~^)*):^)~^(((((!!)))))(((((!!)))))(((((!!)))))(((((!!)))))((!!))((!!))!! ...a out of stack! +2008-10-28.txt:03:40:27: (~:(*a(a(:^)*(*a)~*a(~:)~*(~^)*):^)~^)()((((((!!))))))((((((!!))))))((((((!!))))))((((((!!))))))(((!!)))(((!!)))(!!) ...a out of stack! +2008-10-28.txt:03:46:09: (((((((((((!!()()))))))(((((!!()()))))))(((((!!()()))))))(((((!!()()))))))((!!()())))((!!()()))) +2008-10-28.txt:03:46:35: ((((((((((((!!()()))))))(((((!!()()))))))(((((!!()()))))))(((((!!()()))))))((!!()())))((!!()())))) ...a out of stack! +2008-10-28.txt:04:02:12: ((((!!()()))(((!!()()))((((((!!()())))))((((((!!()())))))((((((!!()())))))((((((!!()())))))))))))) ...a out of stack! +2008-10-28.txt:04:30:40: (~a*^((^)((:)S)(!(A)S(^)*())())!^^(^):^)(~:a(((:)S)(!(A)S(^)*())())*(^)~a*(~a*)~*(!^^)*~a*(:^)*)((((((((((((!!()()))))))(((((!!()()))))))(((((!!()()))))))(((((!!()()))))))((!!()())))((!!()())))) ...too much output! +2008-10-28.txt:04:45:58: ()(!!()())(((((((((!!()()))))))(((((!!()()))))))(((((!!()()))))))(((((!!()()))))))()(!(A)S(^)*())((:)S)(^) ...a out of stack! +2008-10-28.txt:04:48:31: (~:a(((:)S)(!(A)S(^)*())())*(^)~a*(~a*^)*~*(!^^)*~a*()*^)(!!()())(((((((((!!()()))))))(((((!!()()))))))(((((!!()()))))))(((((!!()())))))) ...too much output! +2008-10-28.txt:04:54:54: (((((((!!()()))))(((!!()()))))((!!()())))) ...a out of stack! +2008-10-29.txt:03:57:26: ((((((^))))))(((((^)))))(((((^)))))(((^)))((^))((^))(^) ...a out of stack! +2008-11-04.txt:20:22:01: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((:)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) ...too much output! +2008-11-11.txt:15:09:24: I usually just use the named-let for that sort of functions: (define (mu f) (let loop ((n 0)) (if (= 0 (f n)) n (loop (s n))))) -- but that's of course a matter of style. +2008-11-11.txt:17:01:42: (apply (g append(list( (- n 1) (apply (rec (append (list f g (- n 1))args)))) args))))) +2008-11-22.txt:00:35:45: ;)))))) +2008-11-22.txt:14:00:09: "as long as it's not pop pop culture, it's okay, and it's not not okay if i *don't* know." (forall X)(okay(pop_pop_culture(X) ^ know(X))), then emphasis on (not (not (okay(pop ... know(X))))) +2008-11-22.txt:14:03:52: "as long as it's not pop pop culture, it's okay, and it's not not okay if i *don't* know." (forall X)(okay((((not pop_culture(X)) ^ (pop_pop_culture(X))) ^ (know(X))))) +2008-12-25.txt:18:59:56: because they don't stack as well as ))))) or }}} +2009-01-07.txt:12:58:51: "int x=3;" is an instance of the 'declaration' syntax; It's something like (declaration (declaration-specifiers (type-specifier "int")) (init-declarator-list (init-declarator (declarator "x") "=" (initializer "3"))))))))))))))))))))))))))) in tree form. +2009-01-17.txt:17:08:57: ~exec self.register_raw(r':[^ ]+ TOPIC #esoteric :(.*)', lambda m: self.raw('TOPIC #esoteric :%s | http://tunes.org/~nef/logs/esoteric' % (m.group(1),))))) +2009-01-18.txt:02:15:29: mbda x (lambda y (lambda z ((x z) (y z))))))" +2009-01-18.txt:02:48:49: ((\s ((\k s) (\x (\y x)))) (\x (\y (\z ((x z) (y z)))))) +2009-01-18.txt:15:21:39: #eval ((l (y z) (y (y (y (y (y z))))) (l (x) (f a x x)) (y)) +2009-01-18.txt:15:21:42: #eval (l (f) ((l (x) (f (x x))) (l (x) (f (x x))))) +2009-01-18.txt:15:21:56: #eval ((l (y z) (y (y (y (y (y z)))))) (l (x) (f a x x)) (y)) +2009-01-18.txt:15:22:36: #eval ((l (y z) (y (y (y (y (y z)))))) (l (x) (f a x x)) (l (f) ((l (x) (f (x x))) (l (x) (f (x x)))))) +2009-01-18.txt:15:22:42: #eval ((l (y z) (y (y (y (y (y z)))))) (l (x) (f a x x)) (q)) +2009-01-18.txt:15:22:53: #eval (l (f) ((l (x) (f (x x))) (l (x) (f (x x))))) +2009-01-19.txt:23:11:11: %eval ((((s s)k)((s(k((s s)(s((s s)k)))))k) foo) +2009-01-19.txt:23:11:36: %eval (((s s)k)((s(k((s s)(s((s s)k)))))k) +2009-01-19.txt:23:12:37: %eval (((s s)k)((s(k((s s)(s((s s)k)))))k)) +2009-01-19.txt:23:12:38: [l (z) ((((s (k ((s s) (s ((s s) k))))) k) z) ((k ((s (k ((s s) (s ((s s) k))))) k)) z))] +2009-01-19.txt:23:12:47: %eval ((((s s)k)((s(k((s s)(s((s s)k)))))k)) foo) +2009-01-19.txt:23:12:48: (foo (((s ((s s) k)) (k foo)) ((k ((s (k ((s s) (s ((s s) k))))) k)) foo))) +2009-01-19.txt:23:13:00: %eval (((s s)k)((s(k((s s)(s((s s)k)))))k)) +2009-01-19.txt:23:13:00: [l (z) ((((s (k ((s s) (s ((s s) k))))) k) z) ((k ((s (k ((s s) (s ((s s) k))))) k)) z))] +2009-01-19.txt:23:13:11: %eval (hold (((s s)k)((s(k((s s)(s((s s)k)))))k))) +2009-01-19.txt:23:13:11: (hold (((s s) k) ((s (k ((s s) (s ((s s) k))))) k))) +2009-01-19.txt:23:16:48: %temp ((lambda (fix) input) (((s s) k) ((s (k ((s s) (s ((s s) k))))) k))) +2009-01-19.txt:23:17:24: %temp ((l (fix) input) (((s s) k) ((s (k ((s s) (s ((s s) k))))) k))) +2009-01-19.txt:23:18:21: [l (z) ((((s (k ((s s) (s ((s s) k))))) k) z) ((k ((s (k ((s s) (s ((s s) k))))) k)) z))] +[too many lines; stopping]