00:04:55 -!- nisstyre has quit (Quit: WeeChat 0.4.3).
00:23:41 -!- Phantom_Hoover has quit (Ping timeout: 264 seconds).
00:32:05 -!- edwardk has joined.
00:36:49 -!- Phantom_Hoover has joined.
00:48:52 -!- tromp has quit (Remote host closed the connection).
00:49:26 -!- tromp has joined.
00:53:51 -!- pikhq has quit (Ping timeout: 252 seconds).
00:54:17 -!- tromp has quit (Ping timeout: 264 seconds).
00:55:51 -!- pikhq has joined.
00:58:47 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds).
01:11:23 -!- drdanmaku has quit (Quit: Connection closed for inactivity).
01:11:42 -!- Bicyclidine has quit (Ping timeout: 265 seconds).
01:31:43 -!- Sorella has quit (Quit: It is tiem!).
01:35:11 -!- nisstyre has joined.
01:44:10 -!- ter2 has joined.
01:57:52 -!- edwardk has quit (Quit: Computer has gone to sleep.).
02:06:49 -!- Sprocklem has joined.
02:43:46 <Sgeo> Chrome seems to disbelieve that I could ever want a new tab when I ctrl-click a link
02:43:56 <Sgeo> It assumes CNN's trying to do an evil pop-up and blocks it
02:58:12 -!- edwardk has joined.
03:05:35 -!- FreeFull_ has joined.
03:07:35 -!- FreeFull has quit (Ping timeout: 252 seconds).
03:11:23 -!- oerjan has joined.
03:35:54 <oerjan> <Sgeo> Chrome seems to disbelieve that I could ever want a new tab when I ctrl-click a link <-- can you do it with the right click menu instead? that's what i have to do whenever following a link out of stupid wikia.
03:36:56 <Sgeo> Chrome seems to have sponaneously changed it's behavior, even ctrl-mouse pad press is working now
03:37:01 <Sgeo> I'm sure the old behavior will come back
03:37:25 <oerjan> oh btw i'm not using chrome so this is just a wild suggestion.
03:39:02 <oerjan> wikia, of course, _does_ make an evil popup then. which i could tolerate if not for the fact that it simultaneously forgets i want a new tab.
03:39:58 <Sgeo> that popup is wikia
03:49:56 -!- edwardk has quit (Remote host closed the connection).
03:50:25 -!- edwardk has joined.
04:02:48 -!- drdanmaku has joined.
04:05:05 -!- ^v has quit (Read error: Connection reset by peer).
04:05:32 -!- ^v has joined.
04:08:09 -!- password2 has joined.
04:23:41 -!- ter2 has quit (Ping timeout: 252 seconds).
04:26:23 <kmc> http://www-sop.inria.fr/marelle/Laurent.Thery/T2048.v
04:26:27 <kmc> 2048 in coq
04:27:21 <kmc> not to be confused with cock in 2048
04:27:27 <kmc> to which I could also provide a link
04:37:07 -!- curiousguy13 has quit (Ping timeout: 265 seconds).
04:50:07 <kmc> http://chneukirchen.org/trivium/ looks pretty good
05:02:50 <HackEgo> [wiki] [[Special:Log/newusers]] create * John Misciagno * New user account
05:04:04 -!- tswett has quit (Ping timeout: 252 seconds).
05:05:18 -!- adu has joined.
05:13:06 <fizzie> Why are there no "1" tiles in 2048, anyway?
05:16:43 <oerjan> they're considered too odd hth
05:17:55 -!- nisstyre has quit (Quit: WeeChat 0.4.3).
05:20:02 -!- MoALTz has joined.
05:46:23 -!- adu has quit (Quit: adu).
06:00:04 -!- ^v has quit (Read error: Connection reset by peer).
06:00:31 -!- ^v has joined.
06:15:45 <Jafet> Lemma thm2 : forall seed, exists ms, g2048 seed ms
06:16:07 <Jafet> Oh, the previous one is also unproven.
06:16:46 -!- MoALTz has quit (Quit: bbl).
06:23:18 -!- variable has changed nick to trout.
06:24:24 <Jafet> applybot: fun merge where "merge (x#y#xs) = (if x = y then (x+y) # merge xs else x # merge (y#xs))" | "merge [x] = [x]" | "merge [] = []"
06:24:25 <applybot> constants \ merge :: "'a list => 'a list" \ Found termination order: "length <*mlex*> {}"
06:24:57 <Jafet> applybot: value "merge [2,0,2,2,4] :: nat list"
06:25:05 <Jafet> applybot: value "merge [2,2,2,4] :: nat list"
06:27:01 <Jafet> applybot: definition "left = map (%row. let row' = merge (filter (op ~= 0) row) in row' @ replicate (4 - length row') 0)"
06:27:02 <applybot> constants \ left :: "'a list list => 'a list list"
06:27:21 <Jafet> applybot: value "merge [2,0,2,4] :: nat list"
06:28:10 <Jafet> applybot: value "left [[2,0,2,4]] :: nat list"
06:28:11 <applybot> *** Type unification failed: Clash of types "_ list" and "nat"
06:28:15 <Jafet> applybot: value "left [[2,0,2,4]] :: nat list list"
06:28:16 <applybot> "[[4, 4, 0, 0]]" \ ∷ "nat list list"
06:29:32 <Jafet> applybot: definition "right = map rev o left o map rev"; definition "up = transpose o left o transpose"; definition "down = transpose o right o transpose"
06:29:34 <applybot> constants \ right :: "'a list list => 'a list list" \ constants \ up :: "'a list list => 'a list list" \ constants \ down :: "'a list list => 'a list list"
06:29:54 <kmc> what's all this then
06:35:14 -!- ^v has quit (Quit: http://i.imgur.com/DrFFzea.png).
06:39:20 <Jafet> applybot: fun gen where "gen rows ((row,col,n)#ns) = (if rows ! row ! col = 0 then rows[row := (rows ! row)[col := n]] else gen rows ns)"
06:39:21 <applybot> constants \ gen :: "'a list list => (nat * nat * 'a) list => 'a list list" \ Found termination order: "(%p. list_size (%p. size (fst (snd p))) (snd p)) <*mlex*> {}"
06:39:53 <Jafet> Hmm, that doesn't work
06:40:01 <applybot> At: definition "right = map rev o left o map rev";definition "up = transpose o left o transpose";definition "down = transpose o right o transpose"
06:40:09 <b_jonas> that looks like some sort of ml
06:40:18 <Jafet> applybot: fun gen where "gen rows ((row,col,n)#ns) = (if rows ! row ! col = 0 then (rows[row := (rows ! row)[col := n]], ns) else gen rows ns)"
06:40:19 <applybot> constants \ gen :: "'a list list => (nat * nat * 'a) list => 'a list list * (nat * nat * 'a) list" \ Found termination order: "(%p. list_size (%p. size (fst (snd p))) (snd p)) <*mlex*> {}"
06:46:56 <Jafet> applybot: definition "win rows0 ns acts = list_ex (list_ex (op = 2048)) (fst (fold (%(rows, ns) mov. gen (act rows) ns) acts (rows0, ns)))"
06:46:57 <applybot> *** Extra variables on rhs: "act"
06:47:04 <Jafet> applybot: definition "win rows0 ns acts = list_ex (list_ex (op = 2048)) (fst (fold (%(rows, ns) act. gen (act rows) ns) acts (rows0, ns)))"
06:47:04 <applybot> *** Type unification failed: Clash of types "_ * _" and "_ => _"
06:48:47 -!- S1 has joined.
06:49:37 <Jafet> applybot: definition "win rows0 ns acts = list_ex (list_ex (op = 2048)) (fst (fold (%act (rows, ns). gen (act rows) ns) acts (rows0, ns)))"
06:49:38 <applybot> constants \ win :: "'a list list => (nat * nat * 'a) list => ('a list list => 'a list list) list => bool"
06:51:29 <Jafet> applybot: value "win ([[1024,0,0,0],[0,2,4,8],[1024,0,0,0],[0,0,0,0]] :: nat list list) [(2,3,4)] [up]"
06:52:49 <Jafet> applybot: value "gen (up ([[1024,0,0,0],[0,2,4,8],[1024,0,0,0],[0,0,0,0]] :: nat list list)) [(2,3,4)]"
06:52:50 <applybot> "([[2048, 2, 4, 8], [0, 0, 0, 0], [0, 0, 0, 4], [0, 0, 0, 0]], [])" \ :: "nat list list * (nat * nat * nat) list"
06:53:05 <Bike> ah, how useful.
06:53:23 <Bike> What's with the 4
06:53:39 <Jafet> The game places it at (2,3).
06:54:16 <Jafet> applybot: declare [[show_sorts]] term gen
06:54:26 <Jafet> applybot: raw:declare [[show_sorts]]; term gen
06:54:27 <applybot> "gen" \ :: "'a::zero list list => (nat * nat * 'a::zero) list => 'a::zero list list * (nat * nat * 'a::zero) list"
06:54:56 <Jafet> Yep, I think this lets you play 2048 on an arbitrary group
06:55:01 <Bike> oh, it's the next number, ok
06:55:07 <Jafet> applybot: raw:linear_undo
07:01:33 -!- MindlessDrone has joined.
07:05:24 <Jafet> applybot: lemma "EX len. ALL ns. (length ns > len & list_all (%n. n = 2 | n = 4) ns) --> EX moves. win (replicate 4 (replicate 4 (0 :: nat))) ns moves"
07:05:24 <applybot> *** Inner syntax error at "EX moves . win ( replicate 4 ( replicate 4 ( 0 :: nat ) ) ) ns moves"
07:05:37 <Jafet> applybot: lemma "EX len. ALL ns. (length ns > len & list_all (%n. n = 2 | n = 4) ns) --> (EX moves. win (replicate 4 (replicate 4 (0 :: nat))) ns moves)" -- oh come on
07:05:38 <applybot> *** Type unification failed: No type arity prod :: numeral
07:06:34 <Jafet> applybot: lemma "EX len. ALL ns. (length ns > len & list_all (%(i,j,n). 0 <= i & i < 4 & 0 <= j & j < 4 & (n = 2 | n = 4)) ns) --> (EX moves. win (replicate 4 (replicate 4 (0 :: nat))) ns moves)"
07:06:36 <applybot> Proving: 1. EX len. ALL ns. len < length ns & list_all (%(i, j, n). 0 <= i & i < 4 & 0 <= j & j < 4 & (n = 2 | n = 4)) ns --> (EX moves. win (replicate 4 (replicate 4 0)) ns moves)
07:08:46 <Jafet> Hmm, there's a bug in the colouring code
07:09:51 <Jafet> applybot: apply clarsimp
07:09:53 <applybot> Proving: 1. EX len. ALL ns. len < length ns & list_all (%(i, ab). i < 4 & (case ab of (j, n) => j < 4 & (n = 2 | n = 4))) ns --> (EX moves. win (replicate 4 (replicate 4 0)) ns moves)
07:11:30 <Jafet> applybot: apply (subgoal_tac "ALL ns. EX moves. win (replicate 4 (replicate 4 0)) ns moves", blast)
07:11:32 <applybot> Proving: 1. ALL ns. EX moves. win (replicate 4 (replicate 4 0)) ns moves
07:12:29 <Jafet> applybot: apply (erule allI, rule_tac x = "%_. (replicate 4 (replicate 4 2048))" in exI)
07:12:29 <applybot> *** Failed to apply proof method
07:12:30 <S1> Jafet: What is that language?
07:12:40 <Jafet> https://isabelle.in.tum.de
07:15:09 <Jafet> applybot: apply (rule allI, rule_tac x = "[%_. replicate 4 (replicate 4 2048)]" in exI)
07:15:11 <applybot> Proving: 1. !!ns. win (replicate 4 (replicate 4 0)) ns [%_. replicate 4 (replicate 4 2048)]
07:16:35 <Jafet> Wait, that won't work.
07:33:00 -!- nortti has changed nick to [Nn]ortti.
07:33:13 -!- [Nn]ortti has changed nick to nortti.
07:36:22 -!- slereah_ has joined.
07:39:31 -!- FreeFull_ has quit.
07:57:23 <ion> Chess Clock Jenga http://youtu.be/YN_F9bNuF0I
08:04:34 <Jafet> Disney funds 3D printing research https://youtu.be/qc-tGbMN9Ms
08:05:14 <kmc> ion: awesome
08:21:52 <oerjan> as for freefall, i am not sure if those are the right people to bring to a debate on whether to exterminate all robots.
08:21:54 <ion> jafet: neat
08:22:26 <fizzie> I was hoping I'd get a less boring "spring season" street-outside-the-office-window time-lapse because today is, well, today, but all the colorful people seem to be in other parts of the campus.
08:25:35 <Jafet> What is so today about today?
08:25:44 <fizzie> http://en.wikipedia.org/wiki/Walpurgis_Night#Finland
08:26:38 <S1> Jafet: Nothing, duh
08:27:44 -!- Patashu has joined.
08:36:31 -!- augur has quit (Quit: Leaving...).
08:48:16 <Jafet> https://blog.mozilla.org/security/2014/04/24/10000-security-bug-bounty-for-certificate-verification
08:48:49 -!- Patashu_ has joined.
08:48:49 -!- Patashu has quit (Disconnected by services).
08:55:49 <oerjan> that iranian student in the comments needs to work on his english.
08:56:51 <oerjan> no jobs in iran. sanctions, you know.
08:57:40 <oerjan> perhaps mozilla can't even legally pay him if they wanted to...
08:57:46 <Jafet> Hmm, the same sanctions might prevent the transfer of a bug bounty
08:58:08 <Jafet> That must be why iranian hackers just go ahead and use their exploits
08:58:31 <kmc> $10,000 sounds like a lot until you think about how much good software developers make
08:58:37 <oerjan> it all becomes clear now.
08:58:57 <kmc> (in america, anyway)
08:59:02 <Jafet> You can be a good software developer not in california
08:59:09 <oerjan> kmc: so you are saying you earn more in a day?
08:59:32 <fizzie> oerjan: Are you just brazenly assuming kmc is a good software developer?
08:59:58 <Jafet> Come on, let's not get all offended or anything.
09:00:02 <oerjan> fizzie: i have somehow associated "filthy rich" with him.
09:00:17 <Jafet> Besides, this bug bounty seems to have more to do with bad software developers
09:00:47 <fizzie> oerjan: As a Norwegian, you're supposed to be filthy rich too, don't you all have heaps and heaps of oil money?
09:01:01 <fizzie> I assume it works so that you just get money for free.
09:01:40 <kmc> sadly, i am not filthy rich
09:01:42 <oerjan> fizzie: surprisingly, i cannot get access to my 1 million NOK part of it at all.
09:02:03 <oerjan> (yep, the oil fund is that much)
09:02:53 <oerjan> in something expensive, i assume.
09:02:53 <fizzie> I just assume kmc with mushrooms.
09:02:59 <fizzie> Associate, not assume.
09:03:23 <kmc> if you have running water in your house, you are pretty rich by global standardz
09:04:02 <Jafet> Oh no, it's the Perspective Man
09:04:22 <fizzie> Does whatever a perspective can?
09:04:23 <oerjan> come to think of it, i saw something about san francisco it workers suing companies for collusion to keep down wages, so perhaps you are actually dirt poor. (don't remember if it was kmc who linked it.)
09:04:49 <oerjan> possibly i saw it on reddit.
09:04:51 <fizzie> You're either filthy rich or dirt poor, only the middle class keeps clean.
09:05:12 -!- mhi^ has joined.
09:07:12 <fizzie> I am making too many slides. :/
09:07:46 <kmc> http://www.symmetrymagazine.org/article/march-2014/physics-by-hand "To encourage discussion and engagement, a physics forum has banned PowerPoint slides in favor of low-tech whiteboards."
09:08:45 <fizzie> I don't think there will even be a whiteboard there.
09:08:52 -!- curiousguy13 has joined.
09:08:54 <fizzie> Or at least I wouldn't take one for granted.
09:09:08 <kmc> what are you presenting?
09:10:01 <fizzie> For 15 minutes, plus 5 for "questions from the audience and some extra time to introduce the next presenter".
09:11:23 -!- drdanmaku has quit (Quit: Connection closed for inactivity).
09:12:07 <fizzie> I don't think there will be a lot of "discussion and engagement".
09:12:58 <oerjan> just auction off the extra slides hth
09:13:41 <kmc> for advertising?
09:14:23 <oerjan> just tell them they'll be worth a lot when you become famous.
09:15:42 -!- S1 has quit (Quit: http://www.kiwiirc.com/ - A hand crafted IRC client).
09:17:01 <fizzie> I'm not sure which ones are the extra ones, to be honest.
09:37:08 -!- conehead has quit (Quit: Computer has gone to sleep).
09:37:17 -!- oerjan has quit (Quit: leaving).
10:19:48 -!- boily has joined.
10:28:55 -!- Phantom_Hoover has joined.
10:30:20 -!- yorick has joined.
10:44:07 <Jafet> Hmm, the zsh builtin time doesn't work on zsh functions.
10:56:41 -!- curiousguy13 has quit (Read error: Connection reset by peer).
10:58:59 -!- curiousguy13 has joined.
10:59:36 -!- mhi^ has quit (Quit: Lost terminal).
11:00:38 -!- boily has quit (Quit: HUMID CHICKEN).
11:14:41 -!- password2 has quit (Ping timeout: 264 seconds).
11:19:15 -!- nooodl has joined.
11:22:02 -!- curiousguy13 has quit (Ping timeout: 255 seconds).
11:24:23 -!- curiousguy13 has joined.
11:24:25 <Taneb> Help I can't use tmux
11:50:47 <shachaf> screen doesn't support four-byte utf-8 sequences
11:51:15 -!- S1 has joined.
11:53:32 <HackEgo> [U+0429 CYRILLIC CAPITAL LETTER SHCHA]
11:54:18 -!- nucular has joined.
11:54:18 -!- nucular has quit (Changing host).
11:54:18 -!- nucular has joined.
11:59:01 <Jafet> `run python -c 'pass; pass; pass'
11:59:41 <S1> Who did make HackEgo?
12:06:40 <Jafet> A long time ago, in a galaxy
12:07:58 <Jafet> Hmm, the old hg log is gone.
12:08:11 <Jafet> This means we'll... never know?
12:08:25 <S1> we could just ask, could'nt we?
12:09:31 <Jafet> You're ruining the moment.
12:09:50 <S1> You're right. We'll probably never know...
12:10:30 <S1> HackEgo is ancient technology
12:11:23 <Taneb> I made a thing help
12:11:24 <Taneb> https://github.com/Taneb/webqueues/blob/master/Main.hs
12:11:27 <Taneb> And now I have to go
12:11:38 <Taneb> Am I showing off? Do I want code reviews?
12:11:39 <b_jonas> `run echo $BASH_VERSION; perl -ewarn\$]; ruby -v
12:11:39 <HackEgo> 4.2.37(1)-release \ 5.014002 at -e line 1. \ bash: ruby: command not found
12:11:42 <Taneb> YOU WILL NEVER KNOW
12:12:17 <S1> Yes. I will never know o.o
12:13:37 <b_jonas> `run python --version; python3 --version
12:13:37 <HackEgo> Python 2.7.3 \ bash: python3: command not found
12:14:59 <Jafet> Taneb: you seem rather RESTless
12:16:10 <Jafet> Nevermind, I misread
12:17:22 <b_jonas> `run (shopt -s nullglob; IFS=:; for x in $PATH; do echo -n "$x"/ruby*; done);
12:17:30 <b_jonas> `run (shopt -s nullglob; IFS=:; for x in $PATH; do echo -n "$x"/python*; done);
12:17:31 <HackEgo> /usr/bin/python /usr/bin/python2 /usr/bin/python2.6 /usr/bin/python2.7
12:17:36 <b_jonas> `run (shopt -s nullglob; IFS=:; for x in $PATH; do echo -n "$x"/perl*; done);
12:17:37 <HackEgo> /hackenv/bin/perl-e/usr/bin/perl /usr/bin/perl5.14.2 /usr/bin/perlbug /usr/bin/perldoc /usr/bin/perlivp /usr/bin/perlthanks
12:18:07 <Jafet> Nevernevermind, it is restless
12:18:59 <Jafet> `file bin/perl-e/usr/bin/perl
12:18:59 <HackEgo> bin/perl-e/usr/bin/perl: ERROR: cannot open `bin/perl-e/usr/bin/perl' (Not a directory)
12:19:39 <HackEgo> bin/perl-e: Bourne-Again shell script, ASCII text executable
12:19:43 <HackEgo> #!/bin/bash \ perl -e "$@"
12:36:34 <int-e> `perl-e 1while(1x++$_)=~/^(11+)\1+$/||print"$_\n"
12:37:04 <HackEgo> 1 \ 2 \ 3 \ 5 \ 7 \ 11 \ 13 \ 17 \ 19 \ 23 \ 29 \ 31 \ 37 \ 41 \ 43 \ 47 \ 53 \ 59 \ 61 \ 67 \ 71 \ 73 \ 79 \ 83 \ 89 \ 97 \ 101 \ 103 \ 107 \ 109 \ 113 \ 127 \ 131 \ 137 \ 139 \ 149 \ 151 \ 157 \ 163 \ 167 \ 173 \ 179 \ 181 \ 191 \ 193 \ 197 \ 199 \ 211 \ 223 \ 227 \ 229 \ 233 \ 239 \ 241 \ 251 \ 257 \ 263 \ 269 \ 271 \ 277 \ 281 \ 283 \ 293 \ 307
12:42:22 <Jafet> For a moment I thought 1while was some strange new keyword
12:43:26 <Jafet> Also, why is 1 printed?
12:49:29 <Jafet> `perl-e 1while(1x++$_)=~/^1|(11+)\1+$/||print"$_\n"
12:50:02 -!- ais523_ has joined.
12:50:15 <int-e> Jafet: 1 cannot be factored into two factors >= 2.
12:51:20 -!- FreeFull has joined.
12:54:09 <b_jonas> `perl $==1,(1x$_)=~/(^)(1|11\1)*(?{$=++})^/,print$=,$/for 0..20
12:54:09 <HackEgo> Can't open perl script "$==1,(1x$_)=~/(^)(1|11\1)*(?{$=++})^/,print$=,$/for 0..20": No such file or directory
12:54:14 <b_jonas> `perl-e $==1,(1x$_)=~/(^)(1|11\1)*(?{$=++})^/,print$=,$/for 0..20
12:54:15 <HackEgo> 2 \ 3 \ 5 \ 8 \ 13 \ 21 \ 34 \ 55 \ 89 \ 144 \ 233 \ 377 \ 610 \ 987 \ 1597 \ 2584 \ 4181 \ 6765 \ 10946 \ 17711 \ 28657
12:54:32 <b_jonas> `perl-e $==0,(1x$_)=~/^(|()1(?1)(?1)\2)$(?{$=++})^/,print$=,$/for 0..13
12:54:36 <HackEgo> 1 \ 1 \ 2 \ 5 \ 14 \ 42 \ 132 \ 429 \ 1430 \ 4862 \ 16796 \ 58786 \ 208012 \ 742900
12:54:49 -!- Sgeo has quit (Read error: Connection reset by peer).
12:57:55 <FreeFull> b_jonas: What sequence is that?
12:58:42 <FreeFull> Are you trying to do fibbonacci?
13:01:08 <Jafet> `perl-e $a=1;1while($c=$a+$b,$a=$b,print$b=$c,"\n")
13:01:08 <HackEgo> 1 \ 1 \ 2 \ 3 \ 5 \ 8 \ 13 \ 21 \ 34 \ 55 \ 89 \ 144 \ 233 \ 377 \ 610 \ 987 \ 1597 \ 2584 \ 4181 \ 6765 \ 10946 \ 17711 \ 28657 \ 46368 \ 75025 \ 121393 \ 196418 \ 317811 \ 514229 \ 832040 \ 1346269 \ 2178309 \ 3524578 \ 5702887 \ 9227465 \ 14930352 \ 24157817 \ 39088169 \ 63245986 \ 102334155 \ 165580141 \ 267914296 \ 433494437 \ 701408733 \ 1134
13:01:09 <int-e> F_n = number of ways to decompose the string 1^n into 1 or 11. Right.
13:01:32 <int-e> which is approximately what (1x$_)=~/(^)(1|11\1)*(?{$=++})^/ does.
13:02:55 <FreeFull> There probably is some formula for it
13:03:11 <slereah_> Is there a simple way to make C display some very simple graphics on linux?
13:03:21 <slereah_> I'm talking like a few pixels wide
13:03:34 <nortti> writing to framebuffer?
13:03:54 <FreeFull> Depends on what kind of graphics hardware you have
13:04:52 <FreeFull> I'm assuming plain linux, without even GNU tools or such
13:05:15 <slereah_> I'm trying to check how well my neural network is working
13:05:19 <int-e> `perl-e $==1,(1x$_)=~/^11(1|11)*(?{$=++})^/,print$=,$/for 0..10
13:05:19 <HackEgo> 1 \ 1 \ 2 \ 3 \ 5 \ 8 \ 11 \ 13 \ 15 \ 17 \ 19
13:05:27 <slereah_> And I have a big one in my skullbox
13:05:35 <slereah_> So lookin' will probably easier
13:05:38 <FreeFull> int-e: Not sure that looks right
13:05:45 <int-e> FreeFull: it doesn't.
13:06:32 <int-e> So that's the point of the \1
13:06:43 <int-e> `perl-e $==1,(1x$_)=~/(^)11(1|11\1)*(?{$=++})^/,print$=,$/for 0..10
13:06:44 <HackEgo> 1 \ 1 \ 2 \ 3 \ 5 \ 8 \ 13 \ 21 \ 34 \ 55 \ 89
13:07:24 <int-e> exploiting the backtracking implementation in perl
13:07:45 <ais523_> oh, not exactly, it's generating a number in unary, and then regexing against it to try to produce the fibonacci sequence in the number of matches
13:08:20 <FreeFull> I'm calculating it by hand and I'm getting fibbonacci so far..
13:09:05 <FreeFull> Are you sure this series isn't just the fibbonacci series?
13:09:15 <int-e> FreeFull: 1 \ 1 \ 2 \ 3 \ 5 \ 8 \ 11 \ 13 \ 15 \ 17 \ 19 wasn't
13:09:49 <FreeFull> int-e: When I calculate it by hand I get 1 2 3 5 8 13
13:10:25 <int-e> yes, that's what you should get
13:19:17 -!- nooodl has quit (Quit: Leaving).
13:26:46 <b_jonas> FreeFull: fibonacci and catalan numbers
13:27:05 <b_jonas> FreeFull: I showed two perl scripts, one computes fibonacci, one computes catalan
13:27:51 <b_jonas> here: http://www.perlmonks.com/?node_id=796712
13:29:01 <b_jonas> it links to my explanation: http://www.perlmonks.com/?node_id=796712
13:29:47 <lambdabot> [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,2...
13:30:03 <lambdabot> [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1...
13:30:07 <Jafet> > "http://www.perlmonks.com/?node_id=796712" `compare` "http://www.perlmonks.com/?node_id=796712"
13:31:06 <b_jonas> find where it links yourself then
13:31:41 <FreeFull> I forgot how to fibbonacci with scanl
13:32:17 <b_jonas> FreeFull: does that involve the case C specifically forbids, where the input overlaps the output?
13:33:17 <lambdabot> [1,1,2,4,8,16,32,64,128,256,512,1024,2048,4096,8192,16384,32768,65536,131072...
13:34:03 <b_jonas> oh, you said scanl, not scanf
13:35:49 <FreeFull> I don't think you can fibbonacci with scanf, although I might be wrong
13:45:06 -!- Patashu_ has quit (Ping timeout: 252 seconds).
13:50:53 -!- Sprocklem has quit (Read error: Operation timed out).
13:51:54 <ais523_> I registered for it because I have to for this new job
13:52:03 <ais523_> they sent me an email "ais523 + GitHub = <3"
13:52:11 <ais523_> also they don't require a password confirm to create an account
13:52:24 <ais523_> I had to change the password to itself just to get a password confirm box and thus be relatively sure it was typed correctly
13:53:17 -!- curiousguy13 has left.
13:55:19 <int-e> > let f = 0:scanl(+)1f in f
13:55:20 <lambdabot> [0,1,1,2,3,5,8,13,21,34,55,89,144,233,377,610,987,1597,2584,4181,6765,10946,...
13:57:41 <fizzie> Now I have 30 slides for 15 minutes. :/
13:58:19 <int-e> Wee. Gotta talk fast :P
14:01:42 <fizzie> Some of them are just overhead, though. (Title, references, an otherwise empty slide with a giant question mark for the questions, and 7 automatically inserted "outline with position indicator" slides to have some structure in it.)
14:02:01 <fizzie> So 20 with any content, and some of *those* are just pictures. Maybe it isn't so bad.
14:10:41 <int-e> `perl-e $==0,(1x$_)=~/(^)(1|11\1)*$(?{$=++})^/,print$=,$/for 0..10
14:10:42 <HackEgo> 1 \ 1 \ 2 \ 3 \ 5 \ 8 \ 13 \ 21 \ 34 \ 55 \ 89
14:12:00 <ais523_> is that \1 simply there to defeat the regex optimizer?
14:15:03 <int-e> `perl-e $==0,(1x$_)=~/^(1|11)*$(?{$=++})^/,print$=,$/for 0..10
14:15:03 <HackEgo> 1 \ 1 \ 2 \ 2 \ 2 \ 2 \ 2 \ 2 \ 2 \ 2 \ 2
14:16:04 -!- S1 has quit (Quit: http://www.kiwiirc.com/ - A hand crafted IRC client).
14:20:33 -!- edwardk has quit (Quit: Computer has gone to sleep.).
14:23:01 <Jafet> `perl-e $==0,(1x$_)=~/(^)(1|11\1)+$(?{$=++})^/,print$=,$/for 0..10
14:23:02 <HackEgo> 0 \ 1 \ 2 \ 3 \ 5 \ 8 \ 13 \ 21 \ 34 \ 55 \ 89
14:24:00 <int-e> `perl-e $==0,(1x$_)=~/^1(1|11)*$(?{$=++})^/,print$=,$/for 0..10
14:24:01 <HackEgo> 0 \ 1 \ 1 \ 2 \ 3 \ 3 \ 3 \ 3 \ 3 \ 3 \ 3
14:24:19 <int-e> `perl-e $==0,(1x$_)=~/(^)1(1|11\1)*$(?{$=++})^/,print$=,$/for 0..10
14:24:19 <HackEgo> 0 \ 1 \ 1 \ 2 \ 3 \ 5 \ 8 \ 13 \ 21 \ 34 \ 55
14:26:02 <int-e> ack, (?1) is recursion. who in their right mind adds explicit recursion to a regex engine ...
14:26:25 <ais523_> int-e: because without it, you can't match brackers, or parse HTML
14:26:37 <Jafet> The same people who add arbitrary code execution to a regex enging
14:26:44 <ais523_> if you're trying to write a DSL for matching patterns in strings, recursion is something you want
14:26:52 <ais523_> actually, they added the arbitrary code thing to see how it was used
14:26:57 <ais523_> and using it for recursion was the #1 use by miles
14:27:01 <ais523_> so they added a separate recursion primitive
14:27:24 <ais523_> we used to write my $regex = qr/<(??{$regex})>/; if we wanted to match angle brackets
14:27:36 <Jafet> Good language design
14:28:03 <ais523_> nowadays /<(?0)>/ works fine
14:28:48 <Jafet> I wonder if there is a regex without the perl
14:29:11 <int-e> shouldn't that be /<(?0)>(?0)/
14:29:23 <ais523_> it depends on what you want the regex to mean
14:29:24 <Jafet> > let f n | n < 4 = True | otherwise = or [ f a && f (a + b) | a <- [1..n], b <- [1..n], n = 2*a + b, a > b ] in filter f [0..100]
14:29:26 <lambdabot> <hint>:1:90: parse error on input ‘=’
14:29:34 <Jafet> > let f n | n < 4 = True | otherwise = or [ f a && f (a + b) | a <- [1..n], b <- [1..n], let n = 2*a + b, a > b ] in filter f [0..100]
14:29:35 <lambdabot> [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,2...
14:29:41 <int-e> I want to match <<><>> too, for example.
14:29:45 <ais523_> Jafet: PCRE is the Perl sort, but you also get mathematical regexes that use only + and *, and POSIX regexes which suck
14:29:56 <Jafet> > let f n | n < 4 = True | otherwise = or [ f a && f b && f (a + b) | a <- [1..n], b <- [1..n], let n = 2*a + b, a > b ] in filter f [0..100]
14:29:58 <lambdabot> [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,2...
14:30:01 <ais523_> int-e: right; that isn't what I wanted, I just wanted the simplest possble example
14:30:07 <ais523_> but if you want something more complex, you write a more complex regex
14:30:17 <Jafet> Wait, what am I typing
14:30:18 <Jafet> > let f n | n < 4 = True | otherwise = or [ f a && f (a + b) | a <- [1..n], b <- [1..n], n == 2*a + b, a > b ] in filter f [0..100]
14:30:28 <Jafet> > let f n | n < 4 = True | otherwise = or [ f a && f (a + b) | a <- [1..n], b <- [1..n], n == 2*a + b, a > b ] in filter f [0..50]
14:30:49 <Jafet> I can't see how a regex can recognize a>b, though
14:31:37 <ais523_> what's the representation of a and b
14:31:44 <ais523_> you can do it with just backreferences if it's unary
14:31:57 <ais523_> I was talking to Jafet, yours is obviously unary
14:32:26 <Jafet> Hmm, it's possible to combine multiple tests using lookahead
14:33:06 <ais523_> anyway, last time I thought along these lines, I ended up inventing Cyclexa
14:33:24 <ais523_> it had things like negative matches, e.g. /^(xyz)^xyzabc$/ matches "abc"
14:33:31 <ais523_> because (xyz)^ matches minus an xyz
14:34:01 <Jafet> What is minus xyz?
14:34:27 <ais523_> basically, normally when you're interpreting a regex, you can think of it as a backtracking program that removes from the string
14:34:32 <ais523_> e.g. "x" means "remove an x"
14:34:41 <ais523_> thus "(x)^" means "add an x to the start of the string"
14:35:06 <Jafet> Ok, so minus adds.
14:36:00 <Jafet> Is it basically pushdown, then?
14:36:02 <ais523_> yeah, except it gets confusing when you do things like (abc(xyz)^def)^
14:36:11 <ais523_> I can't even remember what semantics I designed for that, if anything
14:37:10 <Jafet> Presumably a^b would fail to match anything
14:37:27 <ais523_> the other feature it had was control flow matching
14:37:50 <ais523_> you could do "(a|b)(c|d):1", which is equivalent to "ac|bd"
14:37:52 <Jafet> (a^)^ would... equal a?
14:40:20 <b_jonas> the fun part about recursion in perl regexen is that some of the semantics is unclear if it's combined with backreferences,
14:40:49 <b_jonas> there's now an open bug ticket that is waiting for regex guru to weigh in with their opinion on what the semantics should be,
14:41:02 <b_jonas> then the regex engine guru will try to implement that consistently if possible.
14:41:05 <ais523_> they should recruit the Perl half of the anarchy golf userbase
14:41:12 <b_jonas> the current implementation is inconsistent.
14:41:41 <ais523_> you do a backreference in Cyclexa by combining recursion with control flow matching
14:42:02 <ais523_> the real aim for control flow matching, though
14:42:03 <b_jonas> I mean, I noticed this inconsistency because of that catalan numbers regex I mentioned above
14:42:21 <ais523_> is to do things like (a$1?)(b$2?):1(c$3?):1
14:42:36 <ais523_> look, now I'm not a PDA any more!
14:42:44 <ais523_> not sure if it's actually TC, or just some sort of super-PDA class
14:43:39 <ais523_> that Cyclexa regex matches any number of 'a', followed by the same number of 'b', followed by the same number of 'c'
14:43:43 <ais523_> you can't do that using recursion
14:43:59 <ais523_> (that can match the 'a' with the 'b', but not with the 'c' as well)
14:45:09 <mroman> I thought regexes couldn't do that
14:45:13 <nortti> wouldn't call that a regexp anymore, myself
14:45:40 <Jafet> You might be able to reduce some kind of post correspondence or tags to it
14:46:08 <nortti> mroman: regexes cannot even do n times 'a' followed by n times 'b', since they are limited to regular grammars
14:46:36 <ais523_> PCRE, which is an extension from regexes, can do n*'a' + n*'b'
14:46:44 <ais523_> actual mathematical regular expressions cannot even do that
14:46:57 <mroman> a{3}b{3} matches aaabbb
14:47:14 <ais523_> yeah but that's just sugar for writing aaabbb literally
14:47:18 <mroman> but a{n}b{n+1} kinda regexs would be much more fun
14:47:29 <ais523_> it's like writing (a)*3(b)*3 in BF Joust
14:47:32 <Jafet> Like, (a|b)^*((a1|a2|a3...)*)((b1|b2|b3...)*) simulates a post correspondence system with cards [a1,b1], [a2,b2] ...
14:48:00 <ais523_> Jafet: I'm unaware of that formalization
14:48:05 <ais523_> looks like an interesting thing to try to reduce to
14:48:14 <Jafet> (with :1, defined suitably)
14:48:22 <nortti> is there a term for grammars one can recognise using only '|' and '('+')' operators?
14:48:56 <nortti> (basically, mathematical regexes without klein start)
14:49:41 <nortti> also the grammars that can be recognised by a bolean circuit or a bounded storage machine with bounded input or a decision tree
14:50:47 <Jafet> Actually, ((0|1)^*end)\1((a1|a2|a3...)*end)((b1|b2|b3...)*end):1
14:52:11 <int-e> `perl-e $==0,(1x$_)=~/^(1?1?1?$|(1+)(?!\2\2)(?=(?1))1+(?=(?1))\2$)/&&print$_,$/for 0..100
14:52:20 <Jafet> nortti: do you not want the sequence operator
14:52:34 <HackEgo> 0 \ 1 \ 2 \ 3 \ 5 \ 8 \ 13 \ 21 \ 34 \ 55 \ 89
14:52:44 <nortti> Jafet: sequence operator?
14:52:45 <Jafet> (parens are not normally considered operators)
14:52:52 <int-e> (following Jafet's idea)
14:53:11 <Jafet> int-e: I merely inquired whether it was remotely possible
14:53:18 -!- Sprocklem has joined.
14:53:38 <nortti> ok, found the term, "non-recursive grammars"
14:53:44 <int-e> Jafet: note the (?!\2\2) which encodes the a>b condition.
14:55:21 <nortti> wait, no, "star-free language" seems to be exactly what I'm looking for, but it seems like it can recognise something a decision tree cannot O_o
14:56:14 <Jafet> Are you matching AAB or ABA?
14:56:48 <int-e> so both A and BA become tails
14:58:31 <int-e> and (?=(?1)) checks whether a tail is a fibonacci number.
15:00:58 <Jafet> So, using ABA order is actually mandatory.
15:05:58 <Jafet> This regex really doesn't deserve to exist. It's bad enough that we need to supply the first 4 values, and the rest of the sequence happens to be exponentially sparse so that no spurious matches are possible
15:07:52 <int-e> look-ahead assertion
15:08:04 <Jafet> nortti: star-free languages allow complement. Otherwise it gets a bit boring theoretically, because every language matches a small finite set of strings
15:08:20 <ais523_> I mostly only use lookbehind
15:10:04 <nortti> actually, can't you simulate complement on a finite alphabet?
15:18:39 -!- edwardk has joined.
15:27:34 -!- edwardk_ has joined.
15:28:54 -!- edwardk_ has quit (Client Quit).
15:30:14 -!- edwardk has quit (Ping timeout: 276 seconds).
15:36:01 -!- oerjan has joined.
15:36:18 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds).
15:42:01 <HackEgo> olist 950: shachaf oerjan Sgeo FireFly boily nortti
15:49:56 -!- kronion_ has joined.
15:53:33 <FireFly> http://dirk.rave.org/combinatris/
15:54:22 -!- kronion_ has quit (Client Quit).
15:54:23 -!- Phantom_Hoover has joined.
15:55:04 -!- slereah_ has quit (Quit: Leaving).
15:58:29 <oerjan> oops i thought that one would be harmless but it grew too high
16:00:40 <ais523_> what sort of mean Tetris drops Y combinators on people?
16:14:28 <Jafet> The rows are independent? That's not very interesting
16:14:51 <Jafet> Also there are too many Ks
16:15:46 <oerjan> it seems like it starts producing more ( )'s after a while
16:16:12 <oerjan> which are afaict impossible to handle
16:18:39 <FreeFull> You just need to fill them up and K them
16:23:06 <FireFly> I found the parens to be the most nasty
16:23:14 <FireFly> The Ys are easy to kill by applying them to K
16:26:47 <oerjan> K is very important for shrinking other things
16:29:45 -!- edwardk has joined.
16:34:42 -!- MoALTz has joined.
16:37:10 <oerjan> FreeFull: yeah that's the only thing they're useful for too
16:38:18 -!- augur has joined.
16:40:27 <oerjan> also, Y is absorbed by K(YK) which you get from YK
16:40:51 <oerjan> so if you have just one line with those you have no trouble with Y's until it gets too fast
16:42:13 <newsham> so we (US) gave out $11B in GM bailout...
16:42:25 <newsham> yet we constantly want to cut services for the poor.
16:42:45 <coppro> newsham: but not jobs. because jobs.
16:42:46 -!- ^v has joined.
16:46:03 <nortti> http://pastebin.com/qh6Tta3h
16:52:18 -!- augur has quit (Ping timeout: 240 seconds).
16:56:30 -!- augur has joined.
17:17:06 <newsham> job creators got our backs
17:20:16 <Bike> seeing leaks on pastebin is always so weird since there's literally no proof of anything
17:23:47 -!- ais523_ has left.
17:23:53 -!- ais523_ has joined.
17:24:39 <Taneb> Genetically Modified Bailout!?
17:25:07 <Phantom_Hoover> they don't; clearly they're being paid off by google's rivals
17:26:16 <Taneb> I'm going to talk about incompleteness tonight
17:26:41 <oerjan> Taneb: will the talk be cut short twh
17:29:20 <Taneb> I know that feeling
17:29:32 <Taneb> I'm sloooowly planning a talk on category theory
17:29:50 <ais523_> that's simple; first, work out what you want to talk about
17:29:57 <ais523_> second, work out the identities for everything you want to talk about
17:30:20 <ais523_> you can consider adding in morphisms between things you want to talk about if you want to go really advanced, but make sure they compose correctly
17:30:46 <oerjan> the first talk i did apparently went well except for the part where i stood paralyzed for a minute until my advisor shouted at me.
17:32:19 <Taneb> Ooh! My first talk about esolangs went pretty well
17:32:52 <Taneb> Only talk the society bothered to put on YouTube
17:33:23 <ais523_> what is the society about? not talking about esolangs, presumably
17:34:04 <Taneb> Ostensibly, Computer Science
17:34:30 <oerjan> Taneb: are they about as much about computer science as this channel is about esolangs?
17:34:41 <Taneb> oerjan, I'd say perhaps
17:34:59 <Taneb> Although we are mostly computer science students
17:35:47 -!- password2 has joined.
17:35:57 <Taneb> Well, of the paid members, there's two CS/Maths students (including me), one maths student, one person who seems to be confused about degree she's doing and has been at the university for as long as anyone can remember, and one retired CS lecturer
17:36:09 <oerjan> i was going to make a joke about everyone here being esolangers, but then i remembered kmc has ops.
17:36:21 -!- password2 has quit (Max SendQ exceeded).
17:36:39 <Taneb> I think I may be in the unique position that the first programming language I ever learnt was esoteric
17:36:49 <fizzie> fungot: Would you like to give my Saturday talk in my stead?
17:36:50 <fungot> fizzie: he knew his room was in the sky. and now the being was still there sunday noon when a telephone message came from the black northeast corner a shaft of horrible red-gold fnord shaft which bore with it no glow to disperse the darkness, fallacy and ugliness which have turned the mind of joseph curwen, and that will mark the true resting-place of your son. nor need you fear that it will be observed that at this juncture, b
17:36:55 -!- password2 has joined.
17:37:14 <fizzie> I wonder what they'd say if I went there and started reading fungot.
17:37:14 <fungot> fizzie: then there was only the prologue of the actual place he sought? he was a victim of physical and nervous suffering, as was stated, in a sense the father of gods had fnord his glories for the sight of any land. on the night of fnord april the new development occurred. while nothing appeared to grow different in kind, and dozens of obscurer ones too elusive to be described, which wears a yellow silken mask over its face an
17:37:26 <fizzie> Esp. whether they'd catch on if I trained a language model on my paper.
17:37:48 <Taneb> fizzie, what is your paper on?
17:38:14 <fizzie> Boring stuff. Reverberation-robust speech recognition.
17:38:16 <oerjan> Taneb: are you sure she's not a ghost twh
17:39:23 <Taneb> I think it's she got bored of her computer science degree on her third third year
17:39:30 <oerjan> fizzie: hey you might actually be able to claim it was on topic
17:39:46 <oerjan> maybe not for that paper
17:40:03 <int-e> oh, burn. "There are many choices of elliptic-curve signature systems. The standard choice, ECDSA, is reasonable if you don't care about simplicity, speed, and security."
17:40:27 <int-e> (More than a month old though. From http://blog.cr.yp.to/ )
17:40:31 <oerjan> is that the one with the nsa backdoor
17:41:54 <int-e> It's not if you believe their denials.
17:43:03 <Taneb> Phantom_Hoover, the esolangs one or the category theory one?
17:43:21 <Taneb> I believe the former mentioned it as a "further reading"
17:43:30 <Taneb> The latter probably will not
17:43:39 -!- drdanmaku has joined.
17:46:17 <int-e> oerjan: This is unrelated to the heartbeat extension implementation disaster that made the news.
17:46:39 -!- newsham has quit (Quit: reboot).
17:47:33 <Taneb> My uni has a folklore file which mentions the "new" and "even newer" computer science buildings.
17:47:41 <Taneb> Neither of them are the current computer science buildings.
17:49:16 -!- Froox has quit (Quit: *bubbles away*).
17:50:17 <fizzie> The latest news of the CS student guild's computer classrooms is that they've started to replace the SGI Indys with Pentium 4 FreeBSD machines; that was in 2002.
17:51:00 <fizzie> Though I think the classroom map has been updated since then, because it has the esolang-based hostnames that weren't there when I used to visit the place (around 2003-2008).
17:51:42 <Taneb> The... student guild has their own classrooms!?
17:51:56 <oerjan> int-e: well heartbeat had nothing to do with which encryption to use afair...
17:52:32 -!- Frooxius has joined.
17:52:56 <Sprocklem> Taneb: How old is the folklore file?
17:52:57 <fizzie> Taneb: I don't know the actual details of fiscal ownership of the equipment, but it's at least quite collaborative.
17:53:09 <Taneb> Sprocklem, hard to date
17:53:16 <fizzie> Taneb: The room itself is provided by the university, though.
17:53:36 <Taneb> Sprocklem, certainly before 2010
17:54:23 <Taneb> Sprocklem, here is the stablest mirror: http://klaxon.hacksoc.org/uni_history/
17:54:29 <fizzie> They currently have the following hosts in the single remaining classroom: befunge bit bogo brainfuck chef deadfish emo entropy false fractran fugue glass haifu headache intercal iota kvikkalkul lolcode malbolge numberwang ook oisc thue piet regexpl remorse rename shakespeare smith smurf spaghetti unlambda var-aq wake whenever whitespace zombie
17:54:58 <Bike> whatever indeed
17:55:48 <fizzie> http://www.niksula.hut.fi/historia <- classroom history page, but it's in Finnish only.
17:58:15 <Taneb> The last date mentioned in the folklore file refers to the academic year 2008/09
17:58:36 <Taneb> The very new CS building opened its doors in September 2010
17:59:07 <oerjan> i thought english universities would have their folklore files written on parchment.
17:59:43 <Taneb> oerjan, we're a pretty new institution
18:00:06 <Taneb> With the highest duck:student ratio of any university in the EU!
18:00:12 <Bike> yeah but in england "pretty new" just means after the reformation
18:00:34 <lexande> Bike: there are only two universities in england older than that
18:00:46 <Bike> yes but they're the ones i could name!
18:01:36 <Taneb> Bike, this uni dates to 1963
18:01:41 <Bike> huh, three in scotland though. way to fuck up, england
18:01:43 <lexande> i think "pretty new" in the UK means post-1960
18:01:55 <Taneb> Anyway, I have a talk to go to!
18:02:25 <lexande> Taneb: does being russell group make you not "pretty new" anymore?
18:09:07 -!- Sprocklem has quit (Ping timeout: 245 seconds).
18:22:30 -!- conehead has joined.
18:46:32 -!- CodingBat has joined.
18:49:06 <lambdabot> (Zoom m n s t, Control.Lens.Internal.Zoom.Zoomed n ~ Control.Lens.Internal.Zoom.Zoomed m) => LensLike' (Control.Lens.Internal.Zoom.Zoomed m c) t s -> m c -> n c
19:00:01 <shachaf> oerjan: olist 950 has been out for a week or something
19:01:00 <oerjan> so why did no one `olist it
19:01:13 <oerjan> oh hm right HackEgo was down
19:02:16 -!- CodingBat has quit (Quit: Page closed).
19:07:54 -!- password2 has quit (Ping timeout: 240 seconds).
19:16:36 <ais523_> happy Australian Mailman mailing list reminders day!
19:17:24 <ais523_> wait, how can someone as #esoteric-regular as Slereah not be aware of that tradition
19:17:48 <ais523_> I even took trouble to put all the words in so that elliott wouldn't shout at me (although I didn't particularly care about the capitalization)
19:17:49 <Slereah> I am kind of an on and off regular
19:18:03 <ais523_> basically, Mailman sends out mailing list reminders on the first day of every month
19:18:08 <elliott> ais523_: you didn't get all the words
19:18:10 <ais523_> but when the mailing lists are in Australia, New Zealand, or similar
19:18:20 <elliott> but I no longer really care
19:18:22 <ais523_> they come like 12 hours early because of timezones
19:18:31 <ais523_> so it's the last day of the preceding month instead
19:18:48 <elliott> look at the subject of the email
19:19:31 <ais523_> perhaps I should actually read one of these emails, some day
19:20:22 <elliott> membership singular, isn't it
19:21:37 <ais523_> perhaps it depends on how many lists you're subscribed to?
19:22:13 <oerjan> mine has only one list
19:22:30 -!- CodingBat has joined.
19:22:49 <oerjan> the main agora lists stopped sending out reminders at some point
19:23:41 <ais523_> oerjan: probably when comex started hosting them
19:32:52 -!- augur has quit (Remote host closed the connection).
19:41:41 -!- CodingBat has quit (Quit: Page closed).
19:41:59 -!- CodingBat has joined.
19:48:35 -!- MindlessDrone has quit (Quit: MindlessDrone).
20:02:41 -!- augur has joined.
20:07:01 -!- CodingBat has quit (Quit: Page closed).
20:19:20 -!- adu has joined.
20:22:25 -!- edwardk has quit (Ping timeout: 252 seconds).
20:26:48 <Slereah> http://www.qwantz.com/index.php?comic=2618
20:28:52 -!- Sprocklem has joined.
20:31:16 -!- kwertii has joined.
20:32:30 -!- nucular has quit (Quit: Switching to phone I guess).
20:34:23 -!- mhi^ has joined.
20:39:29 -!- CodingBat has joined.
20:42:49 -!- nisstyre has joined.
20:49:59 -!- augur has quit (Read error: Connection reset by peer).
20:50:28 -!- augur has joined.
20:51:28 -!- ^v has quit (Read error: Connection reset by peer).
20:51:49 -!- ^v has joined.
20:54:03 -!- CodingBat has quit (Quit: Page closed).
20:55:56 -!- Patashu has joined.
20:57:21 -!- Patashu_ has joined.
20:57:21 -!- Patashu has quit (Disconnected by services).
21:07:32 -!- adu has quit (Quit: adu).
21:08:43 -!- adu has joined.
21:11:35 -!- Patashu_ has quit (Quit: Soundcloud (Famitracker Chiptunes): http://www.soundcloud.com/patashu MSN: Patashu@hotmail.com , AIM: Patashu0 , YIM: patashu2 , Skype: patashu0 .).
21:11:53 -!- CodingBat has joined.
21:11:57 -!- ^v has quit (Quit: http://i.imgur.com/DrFFzea.png).
21:17:23 -!- Sprocklem has quit (Quit: leaving).
21:21:29 -!- FreeFull has quit (Ping timeout: 250 seconds).
21:26:21 -!- FreeFull has joined.
21:31:41 -!- ^v has joined.
21:36:35 -!- KingOfKarlsruhe has joined.
21:38:08 -!- adu has quit (Quit: adu).
21:54:25 -!- edwardk has joined.
21:54:39 -!- ^v has quit (Quit: http://i.imgur.com/DrFFzea.png).
21:55:18 -!- ^v has joined.
21:56:27 -!- augur_ has joined.
21:56:52 -!- augur has quit (Read error: Connection reset by peer).
22:05:30 -!- augur_ has quit (Ping timeout: 240 seconds).
22:08:43 -!- edwardk has quit (Quit: Computer has gone to sleep.).
22:11:45 -!- ais523_ has quit (Quit: Page closed).
22:24:21 <kmc> // This operator is needed for gcc <= 4.0.* and for Sun Studio; it causes internal compiler errors for some MSVC versions.
22:24:23 <kmc> template <class U, class V> U& operator->*(U V::* aMember)
22:29:42 -!- ^v has quit (Quit: http://i.imgur.com/DrFFzea.png).
22:29:42 -!- edwardk has joined.
22:29:55 -!- Sprocklem has joined.
22:36:13 -!- ^v has joined.
22:37:58 <^v> am i the first person to browse esolangs.org with a ps3 controller?
22:41:31 -!- oerjan has quit (Quit: leaving).
22:42:32 -!- edwardk has quit (Quit: Computer has gone to sleep.).
22:43:47 <CodingBat> why would anyone do that for starters?
22:45:11 <kmc> that operator? it's from a smart pointer class
22:45:34 <kmc> http://mxr.mozilla.org/mozilla-central/source/xpcom/base/nsAutoPtr.h#162
22:46:56 <Bike> "#define NS_ASSERTION(expr, str) do { /* nothing */ } while(0)" okay cool
22:47:37 -!- pdurbin has joined.
23:11:42 <Taneb> lexande, we're pretty new to the Russel group
23:20:54 <lexande> Taneb: yeah so maybe you're pretty new to not being pretty new
23:22:06 -!- augur has joined.
23:22:33 -!- Sgeo has joined.
23:22:58 <Taneb> lexande, also I've ended up pretty tipsy
23:24:50 <Bike> what is t his group
23:44:18 <kmc> wonder if I should actually learn how COM works
23:45:45 -!- nisstyre has quit (Quit: WeeChat 0.4.3).
23:46:57 <kmc> so i can better understand Gecko code
23:47:06 <kmc> and because I like fancy C++ nonsense
23:48:19 -!- KingOfKarlsruhe has quit (Quit: ChatZilla 0.9.90.1 [Firefox 29.0/20140421221237]).
23:49:22 <shachaf> except their ivy has been growing for way longer?
23:50:53 <kmc> i came back here and misread my own statement as "fancy C++ mushrooms"
23:50:58 <kmc> which sounds like something I would have a dream about
23:52:03 <shachaf> i had a dream in which mountain view's geography resembled that of boston
23:53:14 <kmc> how did that work
23:56:49 -!- Sorella has joined.
23:58:56 <Sgeo> Pure profunctor optics cheat sheet: http://www.snip2code.com/Snippet/46365/Profunctor-lenses
23:59:05 <Sgeo> I cannot vouch for its accuracy