00:00:24 <jix> ? is easier to type on a de keyboard
00:00:45 * int-e is using an US keyboard ;)
00:01:05 <jix> us keyboard is better for programming
00:01:10 <int-e> mainly because that makes typing []{} and \ so much easier.
00:01:15 <jix> but i'm fast enough on a de keyboard
00:01:52 <jix> and i alwazs make tzpos if i use the us lazout ;)
00:02:21 <int-e> that happens to me, too - but when I'm using a de layout keyboard :)
00:02:38 <jix> yeah but i learned typing on a de keyboard years ago...
00:02:59 <jix> i started using a keyboard before i was able to read and write
00:03:17 <jix> we had an old typewrite in my kindergarden
00:04:04 <jix> the first word i was able to type was klo
00:04:39 <int-e> hmm, did you copy a sign from somewhere?
00:05:18 <jix> what sign?
00:05:42 <int-e> a sign with the word 'klo' on it.
00:07:17 <jix> i just pressed some keys and my erzieherin bin zu faul das wort nachzuschlagen... was reading it and i heard klo... and k,l,o are in a triangle
00:07:54 <int-e> hrm. dict.leo.org suggests 'governess' but I don't like that.
00:08:19 <jix> irgndwie komisch englisch zu reden wenn beide deutsch können
00:09:24 <int-e> Not really. There are other people around who can't read English.
00:10:20 <jix> who can't read >>English<<?
00:10:33 <jix> well they have a problem
00:10:36 <int-e> Heh. I meant German.
00:10:54 <jix> int-e: how old are you?
00:11:18 <jix> i'm just interested which people are interested in esolangs
00:12:55 <jix> ok you can count me to crazy peoples...
00:13:16 <int-e> I count myself among them
00:14:50 <jix> heh.. other people in my age play computer games or do sports... but i figure out lambda terms at 1am... ;)
00:16:01 * int-e likes to think of that sort of entertainment as computer games ;)
00:16:10 <int-e> esolangs, that is.
00:16:35 <lament> searching on p2p networks for a song with "love" in the name is hard.
00:16:48 <lament> jix: that makes you a stupid dork
00:17:21 <int-e> lament: why stupid?
00:18:53 <int-e> ok, there are so many ways to be stupid.
00:19:00 <int-e> people are stupid.
00:19:51 <puzzlet> brought to me by irssi proxy
00:19:58 <jix> puzzlet: use base -2
00:20:04 <jix> in base -2 there's no need for signs
00:20:05 <int-e> puzzlet: use telnet.
00:20:28 <int-e> Hmm, -2 is interesting.
00:20:32 <jix> -2 in base -2 is 10 1 is 01 -1 is 11
00:20:42 <int-e> yes, I understand perfectly what that means
00:20:57 <jix> in base n overflow is 10... but in base -2 its 110
00:21:10 <puzzlet> but isn't 2 in base -1 -10?
00:21:34 <jix> yes but 2 is 110 too
00:21:35 <int-e> I also like base 3 with digits -1, 0, 1.
00:21:47 <jix> so no need for the sign
00:21:52 <lament> I find that sitting at home doing esoteric stuff at 1am when others played sports was altogether a bad thing for my overall development :)
00:22:01 <int-e> (written as -0+. +, +-, +0, ++, +--, +-0, etc.)
00:22:17 <int-e> lament, who plays sports at 1 am?
00:22:20 <lament> i'm searching for "The man I love", why do i find "Sexy Babe Posing In The Park.wmv"?
00:22:29 <jix> lament: haha
00:22:32 <jix> i'm going to write my next math test in base -9
00:22:35 <lament> int-e: well, no, i should have slept instead :)
00:22:45 <jix> no one ever said i have to write math tests using base 10
00:22:54 <int-e> lament: there's an 'I' in both your search term and the file name.
00:24:15 <lament> and there's a "The" in "Teen Peeing In The Wood Movies.wmv"...
00:24:18 <int-e> jix hmm, are you sure that confusing your teacher is the best way to get a good grade?
00:24:45 <jix> but a 2 is ok too
00:25:16 <int-e> (grades in Germany are 1 to 6, 1 is best, 6 is worst)
00:25:30 <jix> round((5*1 + 1*6)/2) => 2
00:25:55 <jix> and my teacher knows i'm smarter than him.. so he gives me a 1 anyway...
00:26:33 <int-e> that happened to me once
00:26:57 <int-e> I got a 1 in computer science class, for a program that I had never written.
00:27:06 <jix> oh computer science
00:27:08 <int-e> (that is, the program didn't exist)
00:27:18 <jix> hehe yes same teacher...
00:27:27 <jix> did uhm nothing?... 1
00:27:49 <jix> i did some perl coding on my server... but nothing more...
00:28:12 <jix> i did a bit more than nothing
00:28:21 <int-e> I was lucky, we learned Turbo Pascal at school.
00:28:44 <int-e> this was ... hmm ... about 10 years ago.
00:28:47 <jix> in exel my teacher had a awfull IF ELSE (IF ELSE (IF ELSE END) END ) END construct
00:28:56 <jix> and i told him there's something like CHOOSE in exel..
00:29:55 <int-e> We even had an introduction to Scheme. That was fun.
00:30:04 <jix> we learned a bit javascript (not real javascript but programming a little robot let him walk in a maze)
00:30:25 <Keymaker> we haven't had nothing in school
00:30:39 <jix> the coolest test i've ever written is the 6+ in french
00:30:53 <jix> it's not a 6 .. it's a 6+ its a good 6
00:31:12 <int-e> but it's news to me that this grade exists.
00:31:35 <jix> yes it's stupid a 6 can't be good...
00:32:21 <Keymaker> well, i'm off to read.. ~2:30 am..
00:32:35 -!- Keymaker has quit ("I've seen this dj vu before..").
00:32:38 <jix> my hard-drive was broken and i had no time to learn... was busy backing up all my projects etc...
00:33:30 <jix> and french is _not_ my favorite language..
00:33:43 <int-e> I believe that should scare me. But it doesn't.
01:03:41 <jix> ok <rmul> is done
01:04:35 <jix> rational multiply
01:04:46 <jix> as lambda term
01:10:54 <int-e> something like ... \a b.a (b (\s a b t c d.\f (<xor> s t) (<mul> a c) (<mul> b d))) ... except for canceling common factors.
01:11:41 <jix> canceling common factors is an extra function
01:14:10 <jix> but yours doesn't work
01:14:28 <int-e> how do you encode the sign?
01:14:39 <jix> (?a b. (?r.r
01:14:39 <jix> (<xor> (a <back-sign>) (b <back-sign>))
01:14:39 <jix> (<mul> (a <back-numerator>) (b <back-numerator>))
01:14:39 <jix> (<mul> (a <back-denominator>) (b <back-denominator>))
01:14:59 <jix> evaluates to the looong: (?a b r.r (a (?x y z.x) (?x t f.x f t) (?x.x) (b (?x y z.x))) (?x.a (?x y z.y) (b (?x y z.y) x)) (?x.a (?x y z.z) (b (?x y z.z) x)))
01:15:11 <jix> and i think it could be shorter
01:15:47 <int-e> (\a b.a (b (\s a b t c d.\f.f (<xor> s t) (<mul> a c) (<mul> b d)))) (\f.f <true> 2 2) (\f.f <false> 1 3)
01:15:52 <int-e> --> (?f.f (?x y.x) (?x y.x (x y)) (?x y.x (x (x (x (x (x y)))))))
01:16:26 <int-e> (== (\f.f <true> 2 6)
01:17:14 <jix> outch.. i corrected your typo and made a mistake^^
01:21:54 <jix> i've (<rational> sign numerator denominator) (<sign/numerator/denominator> rational) (<r-to-list> rational) (<list-to-r> [s n d]) <rmul> and <rdiv>
01:25:44 <int-e> hmm. next <rsub> and <radd>
01:26:01 <int-e> hmm, probably it's better to do an <rneg>
01:26:21 <jix> canceling of common factors
01:27:04 <jix> is there a gcd in the std lib?
01:27:18 <int-e> not that I know of
01:28:10 <int-e> there isn't even a mod although that would be quite simple using the ideas of listop.
01:29:36 <jix> i saw a mod free gcd algorithm
01:29:59 <int-e> yes, you can do it with comparisons and subtractions alone
01:31:01 <int-e> and with a linear running time for the division that's not even such a bad idea.
01:31:51 <jix> (?a b.<and> (<LE> a b) (<GE> a b)); seems to be slow
01:32:41 <int-e> and its <neq> or <nne> ops
01:32:52 <int-e> (the first 'n' is for 'new' - ignore it)
01:33:14 <jix> i thought nne? not-not-equal?
01:36:39 <int-e> <ggt> = (\x.x x) (\f a b.<iszero> a b (<nlt> a b (f f b a) (f f (<nsub> a b) b)))
01:38:42 <int-e> actually nsub can be replaced by lsub there hmm makes me wonder
01:40:45 <jix> (?a b t f. (a <pow> (K t)) (b <pow> (K f))) is a<=b
01:41:01 <jix> stolen from prelude.scm of lazier stolen from unlambda page
01:44:28 <jix> <LE> is ultra slow
01:44:38 <jix> <nle> is slow
01:44:52 <jix> unlambdas is ultra fast
01:57:22 <int-e> new lsub: (\a b.\g x.(a <pow> I (b <pow> (K x))) ((\x.x x) (\f x.g (x (f f)))))
01:58:07 <jix> cool ist abs(a-b)
01:58:40 <int-e> sorry, just swap the arguments
02:25:32 <jix> rcancle done
02:26:57 * jix has to sleep now
02:28:02 <int-e> http://www.inf.tu-dresden.de/~bf3/stdlib.la has improved lsub and comparisons and a ggt function
02:28:07 <int-e> ggt is still slow though
02:31:35 -!- jix has quit ("Bitte waehlen Sie eine Beerdigungnachricht").
03:17:10 -!- calamari has joined.
03:55:32 -!- int-e has quit ("Bye!").
07:02:28 -!- calamari_ has joined.
07:03:17 -!- CXI has quit (Connection timed out).
07:11:23 -!- heatsink has quit ("Leaving").
07:24:12 -!- calamari has quit (Read error: 110 (Connection timed out)).
07:59:59 -!- clog has quit (ended).
08:00:00 -!- clog has joined.
10:15:20 -!- calamari_ has quit ("Leaving").
10:16:34 -!- Gs30ng_ has joined.
10:23:32 -!- Gs30ng has quit (Nick collision from services.).
10:24:28 -!- Gs30ng_ has changed nick to Gs30ng.
12:28:31 -!- jix has joined.
12:29:43 <Gs30ng> well it's not moin here
12:30:04 <jix> it's always moin time
12:32:03 * jix plays guitar
12:44:12 -!- int-e has joined.
12:50:44 <jix> moin int-e
12:54:59 <int-e> http://www.inf.tu-dresden.de/~bf3/lambda/listop.la contains a gcd function (nggt) that's still slow but quite a bit faster than my previous versions. to get really fast one has to get away from Church numerals though; a list representation (for the bits of the number, say) would perform much better for bigger numbers.
13:08:55 -!- Gs30ng has quit ("to boot in ubuntu").
14:10:14 -!- Gs30ng has joined.
14:10:15 -!- tokigun has quit (Read error: 104 (Connection reset by peer)).
14:18:58 -!- Gs30ng has quit (Remote closed the connection).
14:36:01 -!- Gs30ng has joined.
15:40:29 -!- jix has quit ("Bitte waehlen Sie eine Beerdigungnachricht").
15:45:20 -!- jix has joined.
15:46:00 -!- Gs30ng has quit ("to reboot in windows").
15:56:13 -!- Gs30ng has joined.
18:43:19 -!- calamari has joined.
19:16:27 -!- pgimeno has quit (Read error: 60 (Operation timed out)).
20:29:05 -!- pgimeno has joined.
22:05:02 -!- calamari_ has joined.
22:27:50 -!- calamari has quit (Connection timed out).
23:26:43 -!- heatsink has joined.