2011-11-01: 00:01:20 hi oerjan ooejiowerjina 00:01:48 AHA 00:01:48 hi elliott 00:01:50 what i fi 00:01:50 hmm 00:02:20 elliott: so do you understand the analysis in the paper? 00:02:35 there was analysis? :D 00:04:30 Django is neat and all, but not when you have a day to make a whole website. :P "Django: The Web framework for perfectionists with deadlines" indeed. 00:04:44 elliott: well, the stuff about how the determiner sharing comes about 00:04:54 not the facts but the gapping-as-ellipsis account 00:05:21 augur: i am bad at reading :( 00:05:30 elliott: lol 00:05:49 subsection 2.1 00:06:17 elliott has no MonadReader instance. 00:06:20 (ooooh, sick burn) 00:07:45 hmm, actually that solution i thought i had just lead to an infinite regress :( 00:07:54 elliott: which solution 00:08:07 augur: not related to your thing 00:08:27 o 00:08:31 model-view-controller is actually not as terrible as I thought it would be.. 00:08:34 infinite regress shows up in natural language you know :D 00:09:57 CakeProphet: Why would separating the parts of your program sanely be terrible? 00:10:05 (Even if you are using a degenerate language.) 00:10:25 (Not that I'm saying you are, just that there are those that do.) 00:10:31 mvc is awful because controllers are necessarily degenerate 00:10:40 either that, or things go into the controller which should be in the view (vastly most common case) 00:10:50 evincar: I thought the specific model might be constraining. 00:10:54 also because decoupling controllers from views never really works out at all 00:10:57 so basically mvc is stupid 00:11:22 elliott: as far as I can tell Django doesn't separate controller from view at all. Maybe I'm just a noob though and haven't got to that part though. :P 00:11:24 elliott: Or just applicable to fewer problems than it's applied to. Like a hellton of things in the programming world. 00:11:29 CakeProphet: yes it does 00:11:31 view = template 00:11:34 controller = view 00:11:38 ah okay. 00:11:40 django calls things different because it's stupid 00:11:44 makes perfect sense. :P 00:12:17 CakeProphet: It is constraining, that's what gives it any shred of decency. 00:12:19 evincar: damn! your unjustified assertion has totally beaten my attempted explanation to the ground 00:12:43 at least the model part is spot-on. 00:13:06 can't go wrong there. (cue elliott.. :P ) 00:13:11 elliott: If you have an application that's naturally divisible into data, presentation, and control components, then MVC is a good idea. Otherwise, probably not. 00:13:26 CakeProphet: it's probably the best you can do within the constraintrs of model 00:13:34 evincar: wait -- wait -- back up here 00:13:39 elliott: right, it has to be all databasey 00:13:44 if you have a problem to which MVC is suited 00:13:48 MVC is suited to it??? 00:14:10 elliott: If you feel like missing the point entirely, yes. 00:14:12 HOLY SHIT! I remember when I contradicted this, instead of saying something more reasonable like "MVC is awful" because nothing actually maps to it in practice. 00:14:13 * CakeProphet uses MVC for brainfuck interpreters. 00:14:33 "If you have an application that's naturally divisible into data [model], presentation [view], and control [controller] components, then MVC is a good idea." 00:14:40 "If you have an application that's naturally divisible into model, view, and controller components, then MVC is a good idea." 00:14:44 "If you have an application that's naturally divisible into model, view, and controller components, then model-view-controller is a good idea." 00:14:55 "If your application = model + view + controller, then model-view-controller is a good idea." 00:15:48 hey what I'm working on fits that pretty well! 00:15:49 I'll assume you're just repeating yourself to make sure you can parse the obvious thing I said without understanding or caring what I meant. 00:16:06 I think he's just covering his bases. 00:16:28 are you saying my reduction of that sentence was incorrect, because you definitely made a few typos if so 00:17:06 CakeProphet: you speak which language natively? 00:17:21 I was just saying that, as far as I can tell, there are plenty of developers who aren't so good at following the advice of "if X is applicable, use X; otherwise don't". 00:17:39 I prefer MVC where MVC = Master Vizier Count 00:17:52 augur: CakeProphet is from Svalbard. 00:17:53 it employs a rigid code of operation based on feudal tradition 00:18:07 so swedish or whatever 00:18:23 CakeProphet: How many Master Vizier should use in program? \(O_o)/ 00:18:39 no they're three different things 00:18:44 master is different from vizier. 00:18:49 it makes total sense. 00:19:11 I prefer to think you meant the number of viziers who are masterful. 00:19:20 i like how augur believes me 00:19:27 viziers totally have nothing to do with mastery of things. 00:19:38 viziers are sycophantic scum. 00:20:18 Doesn't a clever vizier hold the helm of the kingdom by advising the king? Assuming a clever person can get himself appointed vizier. 00:20:23 elliott: why not! 00:20:38 Assuming vizierhood is by appointment. 00:20:46 I'm making a lot of assumptions today. 00:20:48 evincar: that's a valid trope, yes. 00:21:04 but only works sometimes. 00:21:13 Hooray, now I know how to write a book that will work sometimes. 00:21:14 to use the parlance of our times, viziers are pussy bitches. 00:22:23 oh god deadlines, someone shoot me. 00:23:14 oerjan: hi write my parser thanks 00:23:24 oerjan: hi write my website thanks 00:24:28 always happy to help with procrastination 00:24:32 elliott: Parsers are easy to write. Especially in Haskell (as I recently learned) of which you are so fond. 00:25:01 evincar: try writing a parser for transformational grammars! 00:25:15 evincar: Sure, if your grammar is trivial! 00:25:16 also, elliott, i still prefer agda to coq 00:25:33 evincar: challenge: write a Perl parser in Parsec 00:25:42 They're two different things, it's just that Coq is the better orange. 00:25:50 CakeProphet: but using Counts only works if your hierarchy has no cycles! 00:25:55 CakeProphet: Challenge: write a Perl parser. 00:26:13 don't forget you may need to interpret perl code in order to parse perl code. 00:26:19 a perl parser is trivial in parsec 00:26:20 also yacc 00:26:21 (Hint: it's not strictly possible.) 00:26:22 also everything 00:26:25 yes it is 00:26:43 I don't feel like reimplementing perl, thank you very much. 00:26:50 If I want to parse Perl, I'll use perl. 00:26:55 "i don't feel like it -> it's not possible" 00:27:00 perl has a c api, anyway 00:27:02 Yes. 00:27:02 which has, you know, eval 00:27:24 elliott: I was under the impression that the perl parser had to be handwritten. 00:27:28 If I don't feel like it, and I'll never feel like it, and nothing else makes me do it, it's not possible for me to do it. 00:27:43 rrright 00:27:44 elliott: or at least, couldn't be written with yacc, I mean. 00:27:46 CakeProphet: doesn't it use yacc with a bunch of hacks or something 00:27:52 oh... 00:27:56 yes, I think so. 00:28:00 certainly the last part. 00:28:01 evincar: which is why you told CakeProphet it wasn't possibl 00:28:01 e 00:28:15 but not strictly yacc 00:28:17 elliott: Damn skippy. 00:28:26 also in a deterministic universe, exactly one thing is possible. and it sucks ass. 00:28:35 as the way it parses depends silly hacks, yes. 00:28:46 +on 00:29:52 elliott: So what's this oh-so-complex parser of yours for? Must I logread? 00:30:20 who doesn't logread 00:30:23 me. 00:30:52 I have IMPORTANT THINGS to do. 00:30:57 that do not involve the reading of logs. 00:31:04 for example: acting cool 00:31:24 smoking hookah. getting rowdy with friends. sleeping. chatting on IRC. 00:31:48 wow 00:31:55 i wish i could be you for like one day 00:32:06 yeah it's awesome. probably because I'm so cool. 00:32:11 * CakeProphet does a cool pose. 00:32:22 wait, when did CakeProphet turn into oklopol? 00:33:11 so I think my car actually bears some semblance of functionality now. 00:33:11 so 00:33:22 I can get on with procrastinating as usual. 00:33:34 -!- centrinia has joined. 00:33:42 CakeProphet, what about your cdr? 00:33:51 HA. HA. HAHAHA. HA. HA. HA. 00:34:18 Vorpal: cdr is still using the old stateful object-oriented system. 00:34:27 heh 00:34:46 elliott: All I find is you complaining that you may have to write a parser. :/ 00:34:48 CakeProphet, well I guess we are even on the puns 00:34:48 i suck ass and have stupid opinions and i cry at night because my ability to see the future by looking at delicious things has long gone, and the only thing left is my tiny penis 00:35:07 evincar: Looks like you didn't read enough logs then! 00:35:13 oklopol: Hi. 00:35:28 I believe it's a strange variant of model-view-controller. But not feudal I think it's e-democratic. The Master Vizier Count model isn't very well-known. 00:35:29 Wait hasn't centrinia been here before. 00:35:30 hi elliott, what's up? 00:35:32 Let's assume no. 00:35:33 `? welcome 00:35:33 elliott: Alright, alright, I'll go deeper, yeesh. But if I don't emerge soon, you'd better not cut my rope. 00:35:35 Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page 00:35:35 elliott: believe so. 00:35:44 I have been here once. 00:36:01 centrinia: why did you leave? why did you come back? who are you? 00:36:02 centrinia: What kind of idiot would repeat the experience? Weren't we bad enough?! 00:36:13 oklopol: :( you put pain in my heart. 00:36:17 oh elliott you so sillies. 00:36:19 I was not paying attention the first time. 00:36:35 CakeProphet: i know exactly where your buttons are. 00:37:13 centrinia: I'm going to have to demand my money back; you've been here twice. 00:37:32 * centrinia gives elliott $0.02 00:37:37 Thank you. 00:37:41 * CakeProphet stares longingly at a pastry, waiting for that old spark. 00:37:47 (2009-08-01 and 2011-10-07.) 00:37:58 oh god he's making me cry as well 00:38:12 this is just horrible 00:38:27 CakeProphet, it uses lemon slices and metal rods? 00:38:56 well since I adopted Master Vizier Count I've been using the soothsaying plugin 00:39:06 which I believe examines the entrails of various domesticated mammals. 00:39:27 CakeProphet, that one went over my head. 00:39:36 it's... a strange thing 00:39:38 people used to do. 00:39:40 back in the day. 00:39:50 and I tied it in with Django weirdly. I wouldn't worry too much about it. 00:39:57 heh 00:40:01 * evincar returns from logreading with no news to report. 00:41:04 evincar: You didn't read enough logs. 00:41:34 did you see the part where me and elliott spammed for hours and hours 00:41:46 I have seen 00:41:48 all the parts. 00:42:12 AWWWWW YEAH FRUITS LOOPS THE TURING COMPLETE CEREAL FUCKING DELICIOUS YES. 00:42:13 By which I mean no. 00:42:32 i think our last session was like a year ago 00:43:09 sheesh, is my turing completeness detection hampered by me not smoking hookah... 00:43:45 oerjan: yep 00:43:49 also not acting cool enough. 00:43:52 this is important. 00:44:01 to see the turing completeness in everyday, cool life. 00:44:06 oerjan: were you proud when that guy wrote a program in :()^ :') 00:44:08 ah. no hope for me, then. 00:45:06 elliott: i felt strangely empty 00:45:11 oerjan: :( 00:45:45 oerjan: this is merely the sign of the blossoming forest within. 00:45:52 * CakeProphet sagenods. 00:46:31 wow you guys I lost an entire bowl of Fruit Loops 00:46:32 I have no clue 00:46:33 where it is. 00:46:48 you accidentally smoked it 00:48:53 perhaps my brain is subconsciously trying to further delay work on this Django stuff. 00:54:09 Vorpal: "Voxatron is based on a virtual 128x128x64 display. It's a buffer of 3d video memory that is rendered out to the screen at the end of each frame, much as an old-school 2d display is. You can POKE bytes into the virtual memory, and they come out as voxels. I don't compromise on this -- even the menus are drawn into the voxel display. Hopefully one day I can get hold of a real physical 128x128x64 display and play Voxatron on it with almost n 00:54:09 o modification." 00:54:21 heh, it's even software-rendered 01:00:33 -!- Patashu has joined. 01:03:25 It looks like fun. 01:07:25 https://aur.archlinux.org/packages.php?ID=53606 yay 01:07:56 better extract the 64-bit version from the .deb, sigh 01:10:13 oh wait, that one's 32-bit too :) 01:10:55 Vorpal: how did you get voxatron working on 64-bit 01:14:14 elliott, ./vox-run iirc 01:14:18 elliott, from the tar.gz 01:14:25 Vorpal: oh, so you already have the 32-bit libs 01:14:26 elliott, I had the required 32-bit libs I guess? 01:14:33 elliott, yes, multilib repo 01:14:39 the aur package works but doesn't depend on the 32-bit versions of the libs 01:14:46 which sucks 01:14:46 elliott, use the multilib repo 01:14:48 not aur 01:14:49 for this 01:15:05 Vorpal: I very much doubt there is a voxatron package in the multilib repo. 01:15:15 elliott, no I meant for the libs 01:15:33 I just rebooted desktop to windows, so not going to check which ones were required, try ldd? 01:15:35 Right, I'm saying that the voxatron package is fucked because it just depends on libgl and sdl but declares arch=('i686' 'x86_64'). 01:15:47 elliott, ah I did it manually 01:15:52 elliott, and leave a comment about it 01:15:55 I did. 01:16:03 Hopefully it'll be fixed, since it was just added an hour ago and there have already been fixes. 01:16:05 right, just wait and play it by hand until then 01:16:22 or just wait 01:16:56 * elliott reiterates what he said about not doing anything outside the package manager any more. 01:17:24 what about your own code? 01:17:41 I don't run that :-) 01:17:48 :P 01:17:58 -!- tiffany has quit (Quit: Leaving). 01:19:30 I wonder how one convinces people to set up mirrors. Also, build bots. 01:19:36 I will try... murder. 01:20:03 money. promises of fame. a brilliant idea. 01:20:16 Murder's cheaper. 01:20:45 blackmail. sexual favors. threats of violence (possibly including murder). drugs. free advertising. 01:20:59 wtf windows, it doesn't detect my PS/2 keyboard properly unless it is after a warm reboot from any OS. 01:21:00 Why threaten when you can do? 01:21:12 good luck getting dead people to mirror for you. 01:21:24 I could murder their family. 01:21:32 that's acceptable. 01:21:44 still not much motivation to mirror your stuff. 01:21:49 you still need a threat 01:21:51 to coerce them. 01:22:01 you can't just kill their family and expect them to start doing things. 01:22:03 for no reason. 01:22:15 they'll probably just grieve or do something equally human-like. 01:22:21 I could kill half their family and threaten to kill the rest? 01:22:28 that's good 01:22:37 it demonstrates that you're not to be trifled with. 01:22:42 while also providing coercion. 01:23:37 don't forget the horse heads 01:23:44 elliott: anyway if you have an awesome project I think you could probably find a university that will provide a mirror. 01:23:55 but I have no clue how that works. 01:24:00 I doubt it's quite that easy. 01:24:17 Build bots are probably more useful, anyway. 01:24:20 kernel.org mirrors several distros, including arch, debian and so on 01:24:30 Vorpal: I doubt they accept new distros :P 01:24:56 elliott, well they accepted ubuntu some time ago. I guess they only accept sufficiently large ones though 01:25:14 Ubuntu is from 2004. 01:25:17 Arch 2003, I think. 01:25:18 etc. 01:25:21 elliott, in 2004 it was new 01:25:34 Vorpal: And in 2005 it was the biggest. 01:25:43 hm did it go that fast? 01:25:53 Well, at least by 2006. 01:25:57 well yes 01:26:53 owning a limited liability probably helps with stuff like that. 01:27:07 hm? 01:27:15 Canonical Ltd. 01:27:16 arch linux is community driven iirc 01:27:32 so how would that help with kernel.org mirroring 01:27:33 CakeProphet: Yes, money does indeed begat services. 01:27:34 oh I thought we were talking about Ubuntu. 01:27:37 Oh. 01:27:39 CakeProphet, as well 01:28:15 CakeProphet: No, Ubuntu benefitted from having a literally infinitely rich, tech-savvy, people-person for a manager :P 01:28:52 it will fall the day he dies. Maybe not right away. But it will go quickly downhill then. 01:29:02 Vorpal: I doubt it 01:29:10 AFAICT he doesn't do that much any more 01:29:16 elliott, iirc Canonical makes a loss? 01:29:30 Hmm 01:29:47 "In a Guardian interview in May 2008, Mark Shuttleworth said that the Canonical business model was service provision and explained that Canonical was not yet close to profitability. Canonical also claimed it will wait for the business to turn into a profitable one within another 3 to 5 years. He regarded Canonical as positioning itself as demand for services related to Free Software rose.[19] This strategy has been compared to Red Hat's business s 01:29:47 trategies in the 1990s.[20] However, in an early 2009 New York Times article, Shuttleworth said that Canonical's revenue was "creeping" towards $30 million, the company's break-even point.[21]" 01:31:09 hm 01:31:12 right 01:31:33 * elliott tries to figure out Nix's dependency story 01:31:40 elliott, oh? 01:31:48 elliott, I thought you said nix was bad ;P 01:31:50 Yes, I don't know what it is from what I know :) 01:31:54 And yes, but I can steal ideas from it. 01:32:26 Why does Unix only offer like three atomic operations 01:32:48 rename, unlink, creat... is there anything else? 01:32:49 so... this game crashes unless at least 5 minutes passed since starting windows and another XNA based game ran before it in the current session. This behaviour is reproducible 01:32:51 elliott, ^ 01:32:56 how very strange 01:32:59 heh 01:33:17 http://rcrowley.org/2010/01/06/things-unix-can-do-atomically.html 01:33:19 aha 01:34:01 link(2), symlink(2), rename(2), open(2), open(2), mkdir(2), fcntl(2), mmap(2), msync(2), and some virtual memory crap 01:34:15 how bullshit is that 01:35:05 Vorpal: lament 01:35:10 actually I really really want a transactional filesystem 01:35:28 where a process can make a "begin" call on a directory, have that directory's contents freeze in a consistent state 01:35:29 make modifications 01:35:34 and commit or rollback it 01:35:39 it would be super-cool 01:37:49 elliott: perhaps this could be included in an orthogonally persistent filesystem? 01:38:20 Wow, it's like somebody said something that makes no sense but my IRC client refused to show me it and instead punched me. 01:38:47 ow 01:39:25 I'm not sure what doesn't make sense.. 01:39:36 elliott: he was probably just quoting mezzacotta 01:39:46 the business speak guy 01:43:15 how does "make this stuff atomic" syscalls not make sense in orthogonal persistence? 01:43:43 "orthogonally persistent filesystem" 01:43:55 okay so it's not really a filesystem 01:45:28 still, if you're doing any kind of reference-passing across threads you'll have to deal with thread safety. 01:45:29 CakeProphet: Anyway, in the presence of orthogonal persistence, one can simply overlay mechanisms like STM to achieve the desired concurrency properties. 01:45:57 Orthogonal persistence is in a sense much lower-level than a filesystem; it's /better/ and far more flexible, but it fundamentally does far less. 01:46:09 So it's as atomic as memory itself is. 01:46:20 (Well, OK, I suppose there's no CAS instruction for hard disks.) 01:46:27 which is: not very atomic :P 01:46:46 CakeProphet: Are you saying nobody achieves atomicity on top of memory? 01:46:53 not at all 01:47:01 I was referring to "memory itself" as in the lowest level. 01:47:08 Whatever system works for software also works for the disk in orthogonal persistence, that's all I'm sayin'. 01:47:29 I guess the only thing the syscalls would do is create a system-wide standard. 01:47:35 which I guess isn't necessary. 01:48:15 The "syscalls" would have nothing to do with orthogonal persistence, they'd just be implementing STM. STM, of course, requires knowledge of the language's object model to work well. 01:48:29 Anyway syscalls are unnecessary in an orthogonally-persisted system, but that's irrelevant. 01:48:54 Well, I suppose if you keep a "traditional" security model they're necessary. But that requires additional work if you're ~doing things orthogonally~. 01:50:02 are you saying this kind of system secures itself via explicit reference passing? 01:51:06 If that's an awkward way of saying object-capability, then yes. 01:51:09 or do you need some kind of intermediary? 01:51:41 ah, okay. 01:51:52 so you have to explicitly specify which operations can be performed. 01:51:57 Uhhh... 01:52:06 I'll let you figure this one out yourself. 01:52:11 for the thing youre passing the reference to. 01:52:48 Vorpal: Oh gross, the parts of Nix that aren't in C++ are in Perl. 01:53:00 ewwww 01:53:03 it should be all perl. 01:53:09 C++? really? 01:53:22 die "who ARE you? go away" unless defined $userName; 01:53:26 Rude. 01:53:57 guests who come unaccounced are rude. 01:54:00 they must die. 01:54:12 -!- centrinia has quit (Quit: Leaving). 01:54:26 More MVC? 01:54:46 no;;; 01:54:49 Actually it's better than Perl: They're written in... autoconf perl? 01:54:52 https://nixos.org/repos/nix/nix/trunk/scripts/nix-channel.in 01:55:19 "The latter command will upgrade each installed package for which there is a “newer” version (as determined by comparing the version numbers)." 01:55:28 Heyyy, this manual told me Nix doesn't care about the actual versions. 01:55:31 I was LIED to. 02:04:56 Hmm what are some neat things I can do with the free SMS gateway my carrier provides? 02:05:53 Make it really easy to compromise my system if my phone ever gets stolen? :P 02:27:32 jesus, I have... 30 tabs of Django documentation open. 02:28:14 28 actually. 02:28:31 a perfect number. 02:28:46 good to know. 02:30:05 this is good practice though. 02:30:12 there's a lot of Django jobs out there. 02:30:27 and I don't really mind Python all that much so I won't hate them. :P 02:35:28 -!- Vorpal has quit (Ping timeout: 248 seconds). 02:41:40 I want elastic tabstops implemented in more editors so I can quit using fixed-width typefaces. :( 02:41:57 Also better Unicode syntax support in programming languages. 02:42:33 UnicodeSyntax is nice in Haskell, but it doesn't cover everything, and input methods aren't what they ought to be. 02:43:32 -!- pikhq has quit (Ping timeout: 255 seconds). 02:43:35 -!- pikhq_ has joined. 02:43:56 Targets (16): lib32-glibc-2.14.1-1 lib32-libpciaccess-0.12.1-2 02:43:56 lib32-libdrm-2.4.26-1 lib32-libxdmcp-1.1.0-1 02:43:56 lib32-libxau-1.0.6-2 lib32-libxcb-1.7-2 lib32-libx11-1.4.4-1 02:43:56 lib32-libxext-1.2.0-1 lib32-libxxf86vm-1.1.1-1 02:43:56 lib32-libxfixes-4.0.5-3 lib32-libxdamage-1.1.3-3 02:43:57 lib32-expat-2.0.1-7 lib32-libglapi-7.11-4 lib32-libgl-7.11-4 02:43:59 lib32-libxrender-0.9.6-4 lib32-sdl-1.2.14-8 02:44:01 ugh 02:44:39 I want a programming language I can program with my brain. 02:44:51 direct brain-to-program interface. 02:45:46 none of this foolish character-based crap. 02:46:53 libliblib 02:47:58 is that lib32-libliblib or lib64-libliblib? 02:48:02 you could program it directly from your brain with sex thoughts. hm, what would be a good name ... 02:48:05 Come on, is no one else bothered by the use of -> and => instead of proper arrow characters, or <= instead of a "less than or equal to" sign, or straight quotes instead of curved quotes? 02:48:31 evincar: given the limitations of my keyboard, no. 02:48:37 but I am bothered by the limitations of my keyboard. 02:48:57 On Linux I use a compose key, and extend my compose map liberally, but it's not really enough. 02:49:26 We should be able to beautifully typeset our source code like mathematics and prose. 02:49:51 And quit designing languages that are so backward-compatible they can be typed on a typewriter from 1960. 02:50:11 just wait until time-travel 02:50:25 then we have to worry about forward-compatability 02:50:39 they'll never be able to solve that 02:50:49 If we have time travel, I think we'll cope (have be will copen?) somehow. 02:51:21 APL probably would've been a huge success if only it hadn't limited itself to being backwards-compatible with '60s typewriters 02:51:35 Har. 02:52:00 what will has did "have be will copen" mean? 02:52:21 Seriously, these ASCII approximations don't bother anyone else? 02:52:33 <-- nah 02:52:44 evincar: What bothers me is that I have a mere 104 keys. 02:52:59 I *demand* a Japanese typewriter. 02:52:59 :P 02:53:27 (aka "movable type") 02:53:47 Perhaps the main thing holding us back is our input methods...and yet no one will use a language that requires editor support, because no one will write an editor for it because no one will use it! 02:54:17 Well, several people use spoken languages that need editor support. 02:54:29 And I doubt anyone's going to be writing programs with formatting markup anytime soon. 02:54:34 I do not type "例えば", I type "tatoeba". 02:55:19 oh my god I'm terrible at web programming. 02:55:22 True. I type in Chinese (and less frequently Japanese) quite often, and I always thought it worked quite well. 02:55:29 Especially if you're using a hiragana keyboard. 02:55:46 I dislike hiragana keyboard layouts rather strongly. 02:55:58 But these things have demand. People actually speak Japanese, etc. 02:56:19 Not that QWERTY is best or anything, but: seriously, kana would be *really* well-suited to a chording keyboard. 02:56:41 Introducing a language that requires editor support, it won't gain traction; adding features to an existing language, people will just use the old features. 02:57:05 I think the only way you could get people to change is to alter all source files passed to the implementation. 02:57:30 Quietly but seamlessly replacing ASCII characters with their Unicode equivalents. 02:57:55 That is, ASCII di- and trigraph approximations with the genuine article. 02:59:30 I'm imagining typing Japanese with just 16-odd keys. *drool* 03:00:08 With most of the things being 2-key chords, too. :) 03:01:16 And Chinese with...initials+finals+tones. I don't recall offhand how many initials and finals there are. 03:01:27 But it'd be a lot more convenient than Pinyin input. 03:02:03 Although there are abbreviations for common phrases in existing input methods, such as dbq for duibuqi. 03:04:02 Speaking of Unicode and CJK ideographs, fuck Unicode. 03:04:10 It's a shame that Pinyin is prefered over Pinyin. 03:04:29 Erm. 03:05:06 There should be combining radicals, not a code point for every damn ideograph. 03:05:43 -!- pikhq has joined. 03:05:58 You'd need a few precomposed radicals to make any sense of it with TTF (OpenType can do anything) and so that the size of encoded text doesn't explode. 03:06:14 s/Pinyin./bopomofo./ 03:06:38 Bopomofo isn't exactly intuitive for non-native Chinese speakers. 03:06:41 Bopomofo is just a significantly better orthography for Mandarin. 03:06:53 Hell, I don't know that it's intuitive for native Chinese speakers either. :P 03:06:56 Neither is Pinyin. 03:07:30 Pinyin puts native speakers at a slight disadvantage, I guess? 03:07:42 Because they have to know the Latin alphabet (kinda). 03:07:50 Um, it's really not intuitive for non-native speakers. 03:08:18 What, Pinyin? No, but it uses the Latin alphabet. 03:08:25 It uses Latin glyphs, but uses rather unique phoneme values for them. 03:08:51 Right, it's...mnemonic, I guess? 03:09:13 -!- pikhq_ has quit (Ping timeout: 256 seconds). 03:09:41 Apart from q, c, and x. 03:09:58 Not to mention that pitch is not going to be accessible to people who don't bother studying in-depth, so why bother appeasing them? 03:10:45 What do you mean? 03:11:27 Someone who actively learns the language is not going to have much trouble with a phonetic writing system, so bopomofo is not a significant barrier. 03:12:06 Someone who does *not* bother with that is going to struggle with, well, everything else, so why care about using a writing system they're familiar with? 03:13:02 This is a bit of a circular argument, but bopomofo is really only used in Taiwan anymore. 03:13:27 Well aware. 03:17:11 I guess it doesn't really matter? They've standardised on something and that's the end of it until someone decides to make another new system. 03:17:35 I wonder if we'll ever see the end of hanzi. 03:18:01 Or more likely their mutation into something similar and simpler. 03:18:57 Korea successfully got rid of hanja in all but official documents, but China seems awfully attached. 03:19:13 Japanese has no hope, with a syllable structure like that. 03:22:50 Anyway, back to programming, I'd like to see a language with modern typographical sensibilities. 03:23:13 Or, hell, a language with typographical sensibilities from hundreds of years ago. 03:23:25 We've regressed. 03:25:05 elliott: Django kind of has a good idea going with these generic views. 03:25:10 only problem: they don't compose in any way 03:27:57 evincar: Personally, I'm kinda amazed Korea managed to actually get rid of hanja. 03:28:20 What with the absurd number of potentially-ambiguous loans from China that are probably utter hell when reading. 03:28:35 Ditto. But I guess it doesn't matter as much in practice. 03:28:54 And Japanese, well. They're slowly *increasing* the number of kanji in use, thanks to IMEs. :) 03:28:55 Or people structure their sentences in such a way that they're not ambiguous. 03:29:12 Buh. 03:29:20 I wonder how long it'll be before 之 is back in common use. 03:29:54 It's used in Chinese in a few situations, mostly formal. 03:30:02 But some not. 03:30:22 So I dunno. Perhaps. 03:30:26 It's heavily archaic in Japanese. I think it's only in "common" use in names any more. 03:30:41 Though, of course, the word itself is about as common as "the" in English. 03:33:48 Oh, wait, in Japanese it's kore? In Chinese it's zhi = de = Japanese particle no. 03:34:02 In Japanese it's Japanese particle no. 03:34:18 Oh, sure enough, it can also be read 'kore'. 03:34:23 -!- Nisstyre has quit (Ping timeout: 252 seconds). 03:34:29 Oh. Just looked it up on Google Translate to check. :P 03:34:31 此れ is the more "typical" kanji for that, though. 03:34:51 Though anyone actually *using* that is probably more of a pedant than I. 03:34:59 Yep. 03:35:06 Never seen that... 03:36:54 Well, I've seen it in Chinese, actually. 03:37:06 But I'm sure I see a lot of hanzi that aren't kanji. :P 03:37:12 Or aren't common as kanji. 03:37:43 Well, yeah, at a minimum you see simplified glyphs. 03:38:37 Screw simplification, I wanna write 龍! :P 03:42:02 I've only studied simplified, but I can read most traditional characters without too much trouble because they're in my textbooks and there's a logical relationship between most pairs. 03:42:29 Still, if I go to Taiwan I'm probably fucked/ 03:42:31 *? 03:42:40 -!- Jafet has joined. 03:42:53 I find simplified trivial to read. Well, as trivial as someone who has never studied Mandarin at all can expect. :P 03:44:03 Bit harder to remember how to write, though. Mangles all the components too much. 03:50:50 ... 03:51:03 *Would* a language with semantic markup be a bad idea? 03:51:27 Nothing remotely resembling SGML... 03:51:40 But...something. 03:52:28 To make typesetting, formatting, and highlighting simple and consistent, without getting in the way. 03:52:38 Mumble mumble ALGOL 68 03:53:43 I guess a well-designed language has that anyway. 03:54:03 One-to-one correspondence between syntax and semantics, with enough redundancy to be helpful but not so much cruft as to be unusable. 03:55:32 So nevermind. 03:56:28 if it's redundant then it's not one-to-one >:) 03:56:45 It could be non-bijective. 03:57:02 There is only one level of syntax but there are multiple levels of semantics 03:57:09 then it's _still_ not one-to-one. 03:57:31 or, it is not surjective, which is even less useful 03:58:15 Is mergesort semantically identical to heapsort? 03:58:18 (one-to-one = injective, where i learned terminology) 03:58:47 well if we're going to _that_ level, then we'll hit rice's theorem pretty fast :P 04:00:00 The faster evincar crashes into Rice's, the better 04:00:14 ...maybe. 04:01:10 is evincar crashing into Rice's? 04:01:25 can't say I didn't expect it 04:01:28 can say I expected it 04:01:48 Sigh. 04:02:52 one-to-one from syntacs to semantics tends to do that, i should think 04:02:57 Say "[a]" means "the type of lists with elements of type a". Semantically one-to-one, syntactically redundant. 04:02:58 *syntax 04:03:31 wat 04:03:53 The one term "[a]" corresponds to one concept. 04:04:06 that's not what one-to-one means. 04:04:08 It also includes unnecessary information. 04:04:45 -!- sebbu has quit (Ping timeout: 240 seconds). 04:04:48 oh hm 04:05:01 "one-to-one correspondence" can mean bijective 04:05:12 Blame the french. 04:05:17 "one-to-one function" means injective. 04:05:26 The faster evincar crashes into Rice's, the better 04:05:28 ricervincar 04:05:32 oops 04:05:34 r creeped in 04:05:35 ricevincar 04:05:50 noo i will be smooshed noo 04:06:33 I cannot compete with the power of a theorem that is not strictly relevant to the discussion we're having, though apparently it's relevant to the discussion everyone else thinks we're having. :/ 04:06:49 what discussion are we having 04:06:50 And for the record I was talking about bijection. 04:06:52 anyway, " The one term "[a]" corresponds to one concept." says that your correspondence is a _function_. one-to-one is something else. 04:07:06 Okay. 04:07:12 I'll leave it at that. 04:07:21 How is "[a]" redundant 04:07:41 there are other ways of writing it 04:07:45 :k [] a 04:07:46 Not in scope: type variable `a' 04:07:47 Could be "List a", for instance. 04:07:52 er 04:08:04 :k [] Int 04:08:04 * 04:08:06 Fewer tokens, same meaning. 04:08:13 Hypothetically. 04:08:19 [] is one token 04:08:30 Settle down, highway star 04:08:47 :k [ ] Int 04:08:47 * 04:08:50 -!- myndzi\ has joined. 04:08:56 i don't think haskell's parser agrees :P 04:09:04 It's a magical token 04:09:13 hi elliott 04:09:19 hi monqy 04:09:20 ok it may be a nonterminal one 04:09:39 :k ( {-: :-} ,) 04:09:40 * -> * -> * 04:11:31 monqy: help django hell 04:11:41 too late 04:11:45 -!- myndzi has quit (Ping timeout: 245 seconds). 04:36:10 so is plof kind of like io but way better? 04:38:24 Plof is like * but more Gregor. 04:40:28 is * the name of something or a bash wildcard in a session where the wd is /the_universe/programming_languages ? 04:47:10 Wildcard. 04:51:33 -!- Jafet has quit (Quit: Leaving.). 04:51:46 elliott: will you be mad if I make a programming language called @ and (c) it. 04:52:19 on the bright side: there are plenty of alternative names. For example, you can name it ttoillex 04:52:35 He can also feast on your succulent brain-meats. 04:52:46 after yourself. or your reverse self in a reverse universe. 04:52:52 reversiverse. 04:55:16 pretty sure @ is just a placeholder for @'s eventual name 04:55:43 yep 04:55:45 but ttoillex is a good name 04:56:23 CakeProphet you should name your language ttoillex in honour of elliott 04:56:32 this is a god idea. 04:56:41 yes 04:56:57 god itier 04:57:04 @ is a good name though. 04:57:08 for things. 04:57:29 and you can market it as being all trendy and abstrackt 04:57:35 things that you don't want to google 04:57:58 google will fall soon after @ is born. 04:58:08 ok 04:58:09 either that or it will fix its stupid query language to be less stupid. 04:58:18 one can hope. 05:01:45 are there any programming languages that work like polyglots. 05:01:47 in other words. 05:02:01 the language has, say, two or three different interpreters executing the same source. 05:02:09 with different syntax/semantics for each. 05:02:25 * CakeProphet thinks this is a fine idea for an esolang. 05:02:28 wierd? whirl? i forget 05:03:51 If I want the internal type of an object to change opaquely at runtime, do I need to use double-indirection so the user doesn't get broken references? 05:04:03 That's my intuition, but I don't like the performance hit. 05:04:05 literate haskell 05:04:25 or any literate programming 05:04:41 evincar: itt: smalltalk #become: 05:05:11 what was itt again 05:05:25 you can do it with mark and sweep 05:05:40 sincr thst traverses hthe object graph 05:05:50 -!- CakeProphet has changed nick to ElliottDrone1. 05:05:54 oerjan: read the logs. 05:05:54 just force a gc and use it to rewrite referencred 05:05:58 references 05:06:41 -!- ElliottDrone1 has changed nick to CakeProphet. 05:06:44 Hmm. Rewriting references occasionally versus double-indirection always. Bluh. 05:06:59 um oh it's _not_ an obscure irc acronym? 05:07:00 I guess in the latter case it can be optimised away quite often. 05:07:17 gc doesnt take long 05:07:18 oerjan: no, it's associated with 4chan but may originate from prior to it. 05:07:30 and you're doing it anyway 05:07:35 i mean, "i think that" simply doesn't fit 05:07:47 doing it a bit earlier doesn't matter 05:08:08 `log itt 05:08:29 evincar: why not just replace the representation in-place 05:08:31 2011-10-19.txt:05:41:41: I'm a sucker for fancy things (that don't have shitty interfaces. see: most fancy looking desktop environments) 05:08:44 `log \<[i]tt\> 05:08:54 help wat 05:08:54 2010-10-15.txt:20:22:24: ITT: people don't allocate full bandwidth to torrents 05:09:05 elliott: That requires there to be enough storage for the new representation, which I can't necessarily guarantee. 05:09:10 oerjan: it means "in this thread" 05:09:16 bah 05:09:28 evincar: use a copying gc 05:09:29 I'm thinking about automatic promotion from machine integers to bigints when necessary, as one example. 05:09:43 allocate enough space when you copy 05:09:44 You want the underlying type of the object to change, but the apparent type to remain the same. 05:09:50 uh 05:10:00 maxhine ints should be tagged pointers 05:10:04 Like, the user has an opaque type "integer". 05:10:07 not allocated objects. 05:10:22 evincar: just use perl 05:10:25 all problems will be solved. 05:10:29 except for performance problems. 05:10:40 Those are the problems I'd like to solve. :( 05:11:14 then wait for Perl 6. maybe it fixes that stuff! 05:12:06 evincar: what problems? 05:12:52 monqy: I was using a bad example, but basically just using fast types when possible and non-fast types when necessary. 05:13:21 just allocate the full size up-front 05:13:34 ram is much cheaper than cpu 05:13:36 Memory is cheap, I guess. 05:13:38 Yeah. 05:14:10 or allocate one ptr extra on the fast repr 05:14:30 when it's non-null, it's a ptr to the new bigger repr 05:14:50 evincar: yes use big ints always. 05:14:58 overhead: one branch when fast, one branch + deref when slow 05:15:05 CakeProphet: not what i said 05:15:06 That's prolly what I'll end up doing. 05:15:16 What elliott did say. 05:16:05 Because otherwise you have to deal with the situation when there are multiple "shakeins" (same apparent type but different implementation) for a type. 05:16:18 And choosing the largest one might not always be the best idea. 05:17:03 (Term "shakeins" borrowed from http://tal.forum2.org/static/cv/Shakeins.pdf linked from an article about become: in smalltalk.) 05:17:36 Convenient that it showed up, really. 05:19:24 not a problem. shakeins just add flavor. 05:21:30 elliott: also neither wierd nor whirl seem to match that description. 05:22:44 I'm thinking of things that might be a bit more interesting than what that article goes into. Also AOP is kinda bullshit. 05:23:47 Like, changing the representation of a point from rectangular to polar based on how often it's about to be accessed as which, for a simple example. 05:24:17 *between rectangular and polar 05:24:19 does not change its size 05:25:14 Not in that case, no. I'm a bit tired to come up with anything but the int/bigint example at the moment. 05:29:24 Another good example is being able to specify in-language that a string is stored contiguously, even though its apparent type is the vastly less efficient "cons-list of char". 05:30:01 not vastly less efficient 05:30:05 e.g. cons 05:30:17 two totally different structures 05:30:52 differing strictness, too. 05:31:54 Right, but I daresay most strings are finite, and why rely on the implementation to make the optimisation when you can have it in the language? 05:32:28 evincar has never used Haskell. 05:32:43 if you think unbounded length is the only thing that strictness changes then 05:32:44 L 05:32:45 O 05:32:45 L 05:33:36 consider a 4 TB string. now consider strict vs. non-strict 05:34:06 have i mentioned cons yet 05:34:14 You'd use a still different representation for that. Buffered in chunks, perhaps. 05:34:18 also infinite strings are used all the time in Haskell. If you don't want the linked list implementation there are plenty of other sequence types. 05:34:19 Like a rope. 05:34:41 you cannot substitute two structures that are completely different 05:34:48 it is stupid and misguided. 05:34:58 Ugh, that's not what I'm suggesting. 05:35:13 programs must be written for their structures or they will be inefficient 05:35:18 full stop 05:35:34 I'm just saying it may be possible to substitute structures as an optimisation. 05:35:58 And isn't generic programming sort of a point against you, full stop? 05:36:21 lemme know when you get an example that doesn't change semantics 05:36:32 and no it's not. 05:36:34 Considering the whole point is to abstract algorithms away from structures using iterators (or ranges, which have since turned out to be better in most cases). 05:37:02 what a parenthical 05:37:05 The point is that you make the changes locally in such a way that they *don't* change semantics except potentially to improve performance. 05:37:06 i'm done. 05:38:39 Apparently. 05:40:22 HEY GUYSCZECH I TOUT I M ON TH WEB: http://127.0.0.1:8000/ 05:41:49 i WILL soon b f4moose 05:42:04 .ljh< 05:42:42 your parlance has grown quite obscure, sir ttoille. 05:42:54 .,lo987654esxcvbnm, 05:43:26 nice path. 05:43:50 I daresay 05:43:52 a circuit 05:45:24 uuuugh 05:45:38 I wonder how long I can procrastinate writing a Django template. 05:45:50 * CakeProphet writes more Python instead. 05:59:50 wow Django's web docs are really shitty. 06:03:37 thorough but also not very well organized. 06:09:09 -!- evincar has quit (Quit: I give you the gift of lack of me.). 06:16:41 "A NAR archive is like a TAR or Zip archive, but it contains only the information that Nix considers important. For instance, timestamps are elided because all files in the Nix store have their timestamp set to 0 anyway. Likewise, all permissions are left out except for the execute bit, because all files in the Nix store have 644 or 755 permission." 06:16:41 huh 06:17:26 wonder how that interacts with setuid and friends... 06:23:55 i suppose it nixes them 06:24:10 oerjan: har har 06:26:27 This just in: Gamers hit a new low by /not understanding multiplication/. 06:34:33 -!- copumpkin has quit (Ping timeout: 240 seconds). 06:34:58 -!- copumpkin has joined. 06:40:21 -!- oklofok has joined. 06:42:43 elliott: hmmm? 06:42:45 where? 06:42:47 citation needed. 06:43:21 -!- oklopol has quit (Ping timeout: 258 seconds). 06:43:38 $_ = s/^/[/r =~ s/$/]/r 06:43:49 (the meaning of this correction should be obvious to anyone) 06:52:08 -!- oklofok has quit (Ping timeout: 260 seconds). 06:58:05 -!- Ngevd has joined. 07:03:07 "Setuid and setgid programs are not currently supported by Nix. This is because the Nix archives used in deployment have no concept of ownership information, and because it makes the build result dependent on the user performing the build." 07:03:08 Right. 07:03:12 Morning 07:03:43 Note to self: Ask the Nix people how they handle gcc not being deterministic. 07:04:04 aaaah! 07:04:11 They changed Google Reader! 07:04:32 Also, ask them why they rebuild packages depending on dynamic libraries even when it's unnecessary. 07:04:32 elliott: help I'm trying to do something incredibly simple and I'm getting bogged down in object-oriented cruft. 07:04:48 CakeProphet: Python mind virus. And with that... 07:04:50 -!- elliott has quit (Quit: Leaving). 07:05:13 but I don't have that mind virus! 07:09:35 I think he meant to get it 07:09:48 That is, for you to get it 07:09:49 yes I know. 07:09:58 I'm saying I can't get it! I'm already immune 07:10:08 Oh dear 07:10:08 I had it and then got cured, years ago. 07:10:16 Try a different strain 07:10:23 IronPython 07:11:04 perhaps if I think of the Python paradigm as "memorize a bunch of classes, methods, and huge keyword argument lists" 07:11:59 @method_decorator(login_required) 07:11:59 def dispatch(self, *args, **kwargs): 07:12:01 return super(ProtectedView, self).dispatch(*args, **kwargs) 07:12:02 wow.... 07:12:27 that is so much boilerplate, to apply that login_required decorator bit to every instance of a class 07:12:30 THREE WHOLE LINES 07:12:35 with *args **kwargs and super nonsense. 07:13:00 also TWO IMPORTS 07:43:23 -!- Ngevd has quit (Quit: Goodbye). 07:45:40 good python 07:45:47 friend python 07:46:38 Deadly python. 07:49:21 ugh 07:49:22 bad python. 07:49:33 actually 07:49:39 bad incomplete Django documentation 07:49:57 a huge crufty web app framework should have utterly complete docs. 07:50:52 naturally 07:58:59 IIRC the Book isn't so bad as far as it goes, but the reference docs have been organized with some sort of alien-hive-mind logic. 08:06:09 -!- atehwa has quit (Ping timeout: 258 seconds). 08:07:03 -!- atehwa has joined. 08:18:25 -!- Patashu has quit (Ping timeout: 258 seconds). 08:23:06 -!- monqy has quit (Quit: hello). 08:35:53 fizzie: the book doesn't document this new class-based generic view stuff I'm attempting to use. 08:36:14 perhaps.... I should use the old stuff? 08:36:39 like, I'm literally browsing source code to figure this shit out. 09:07:27 Yes, I see that the (v2) book is sort of stuck in the 2009s. Oh well; it was new when I looked at it, some years ago. 09:07:50 ugh 09:07:54 #django was no help at all. 09:08:08 the opposite of help in fact. 09:08:13 led me in the wrong direction 09:08:14 HOURS later 09:08:17 I finally figured out 09:08:21 how to do this incredibly simple thing. 09:13:10 nevermind... I didn't. 09:13:29 seriously this is stupid. 09:17:11 -!- oklopol has joined. 09:24:37 -!- DH____ has joined. 09:33:24 o 09:33:24 o 09:33:24 o 09:33:24 o 09:33:24 o 09:33:24 o 09:33:25 o 09:33:25 o 09:33:26 o 09:33:26 o 09:47:12 o 10:28:11 -!- Patashu has joined. 10:32:54 -!- oerjan has quit (Quit: leaving). 10:36:02 -!- Vorpal has joined. 10:36:09 -!- Vorpal has quit (Changing host). 10:36:09 -!- Vorpal has joined. 10:36:13 Actually it's better than Perl: They're written in... autoconf perl? <-- wow 10:37:57 Heyyy, this manual told me Nix doesn't care about the actual versions. <-- I guess it has to care for a command like "update to last userland in my $PATH". No way around it if you want a well defined behaviour for what executing a command does 10:38:59 Hmm what are some neat things I can do with the free SMS gateway my carrier provides? <-- well, what about controlling car engine heater from your bed using your phone? 10:39:19 if you live in a cold climate that is 10:47:03 -!- Jafet has joined. 11:19:41 -!- atehwa has quit (Ping timeout: 245 seconds). 11:26:44 -!- atehwa has joined. 11:29:19 -!- ais523 has joined. 11:37:16 -!- Jafet has quit (Quit: Leaving.). 11:38:38 -!- copumpkin has quit (Ping timeout: 260 seconds). 11:39:03 -!- copumpkin has joined. 11:40:38 -!- Jafet has joined. 11:49:21 -!- DH____ has quit (Ping timeout: 240 seconds). 12:14:58 -!- GreaseMonkey has quit (Quit: The Other Game). 12:16:46 -!- ais523 has quit (Ping timeout: 240 seconds). 12:17:13 -!- ais523 has joined. 12:27:20 -!- Patashu has quit (Quit: MSN: Patashu@hotmail.com , Gmail: Patashu0@gmail.com , AIM: Patashu0 , YIM: patashu2 , Skype: patashu0 .). 13:16:10 -!- aloril has quit (Ping timeout: 252 seconds). 13:27:58 -!- sllide has joined. 13:28:09 -!- aloril has joined. 14:00:29 -!- ais523_ has joined. 14:10:14 ais523, so, someone ascended already. Quite impressive. 14:24:38 -!- copumpkin has quit (Quit: Computer has gone to sleep.). 14:32:27 Vorpal: not that surprising 14:32:33 especially as there's a prize for first ascension 14:32:48 true 14:32:57 ais523_, still it is pretty quick. 14:33:12 ais523_, and it was with tourist 14:33:45 tourist is a pretty powerful role, actually 14:33:46 ais523_, I find tourist hard to play personally 14:33:49 hm 14:33:55 it has a bad start, but not as bad as some other roles 14:33:59 and gets very good very quickly 14:34:10 hm, perhaps 14:34:19 never lasted very long as tourist 14:35:11 -!- Phantom_Hoover has joined. 14:39:40 -!- ais523_ has quit (Quit: Page closed). 14:45:15 fungot: hi 14:45:15 CakeProphet: i have no fnord is that the sentence that came out as normal words 14:45:22 fungot: hi 14:45:22 CakeProphet: i dunno. it was sent in 2002. a very clean apartment. 14:45:27 fungot: hi 14:45:27 CakeProphet: i did one of it's kernels. ( especially with working menus thanks to carbon emacs) 14:45:28 ^style 14:45:28 Available: agora alice c64 ct darwin discworld europarl ff7 fisher fungot homestuck ic irc* jargon lovecraft nethack pa sms speeches ss wp youtube 14:47:23 fungot: hi 14:47:25 :( 14:47:33 -!- CakeProphet has changed nick to ElliottDrone1. 14:47:34 fungot: hi 14:47:35 ElliottDrone1: i'd been looking clisp going, really nice. really readable unless you print it out as int64_t* with fwrite i get other issues 14:47:38 -!- ElliottDrone1 has changed nick to CakeProphet. 14:47:39 why the spam 14:47:39 fungot: hi 14:47:40 CakeProphet: their children are normal. :p these are actually video lectures. 14:47:45 spam? no. 14:47:45 ^ignore 14:47:46 Phantom_Hoover: You have 3 new messages. '/msg lambdabot @messages' to read them. 14:48:15 spam is good for the heartsoul 14:48:56 -!- Jafet has quit (Quit: Leaving.). 14:49:05 ^help 14:49:06 ^ ; ^def ; ^show [command]; lang=bf/ul, code=text/str:N; ^str 0-9 get/set/add [text]; ^style [style]; ^bool 14:49:11 ^cmds 14:49:14 -!- copumpkin has joined. 14:49:20 Oh for... 14:49:49 Phantom_Hoover, ? 14:50:04 What's the command to bring up fungot's ignore list? 14:50:04 Phantom_Hoover: there isn't a problem, you should return ( leaf-node 4) 14:50:15 Phantom_Hoover, I think only fizzie can edit that 14:50:15 fungot, return it to whom? 14:50:15 Phantom_Hoover: it didn't seem to be 14:50:27 Phantom_Hoover, to the sender 14:52:09 -!- derdon has joined. 14:52:43 fungot: there is no cow level. 14:52:44 CakeProphet: ihope is being a dj the primary source of their income?) 14:54:34 ^ignore 14:54:34 ^(EgoBot|HackEgo|toBogE|Sparkbot|optbot|lambdabot)! 14:54:37 But it only works for me. 15:02:02 fungot: produce for me a measure of great wit. 15:02:03 CakeProphet: you... yeah. t3h suckage. you *must* be right.) in uppercase, but names code snippets in comments, mail, articles, irc, and it works as expected 15:07:18 -!- augur has quit (Remote host closed the connection). 15:08:23 -!- sebbu has joined. 15:20:21 -!- ais523 has quit (Remote host closed the connection). 15:23:58 -!- Zwaarddijk has quit (Ping timeout: 240 seconds). 15:33:03 -!- augur has joined. 16:00:47 -!- augur has quit (Remote host closed the connection). 16:00:56 -!- Zwaarddijk has joined. 16:02:54 -!- monqy has joined. 16:07:25 -!- augur has joined. 16:09:28 -!- augur has quit (Remote host closed the connection). 16:13:46 -!- augur_ has joined. 16:16:26 -!- augur_ has quit (Remote host closed the connection). 16:36:23 -!- esowiki has joined. 16:37:17 -!- esowiki has joined. 16:37:17 -!- glogbot has joined. 16:37:59 -!- Zetro has joined. 17:03:11 -!- Ngevd has joined. 17:06:38 -!- derrik has joined. 17:07:46 Hello! 17:22:10 -!- ais523 has joined. 17:23:32 I've been thinking of a new esolang 17:24:00 But I don't know what to do 17:24:07 which instruction did you change to a different symbol? 17:24:33 -!- Nisstyre has quit (Ping timeout: 240 seconds). 17:25:46 hehehh 17:26:06 `. 17:26:06 Just to confuse everyone. 17:26:12 wwwow 17:26:12 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: .: not found 17:26:18 It's called apostraphuck 17:28:06 ph 17:28:28 Dammit, oklopol 17:28:29 You woke up HackEgo 17:38:15 I could think of a data structure that hasn't been used in many esolangs 17:38:33 Decimal trees? 17:40:12 Tertiary trees? 17:40:21 Trees that actually start at the bottom and go up 17:40:27 You know, like trees that are outside 17:42:24 have any languages done photosynthesis/related yet 17:42:34 That's an idea... 17:42:39 Ngevd, erm, such a tree is the same as the normal type, but just drawn the other way around? 17:42:50 Vorpal, exactly. 17:42:55 BUT DIFFERENT 17:42:59 in which case it doesn't actually matter when you implement it, it is just a matter of terminology 17:43:21 instead of recursing down you might recurse up. Same thing 17:43:33 But it will also have roots! 17:43:36 Which will be hidden 17:43:51 okay that is somewhat different then 17:44:01 Ngevd, what use is the roots 17:44:24 Keeps the tree in place, and allows it to gather nutrients from the surrounding soil 17:44:34 Ngevd, in the programming language I meant 17:44:44 It's an esoteric programming language 17:44:49 well yes 17:45:04 So, they are for a very similar purpose to actual trees 17:45:07 Ngevd, but what actual effect on programming in it would the hidden roots have? 17:45:29 They're... used for system calls? 17:45:35 To make programming harder? 17:45:56 Those were two separate ideas, not meant to be taken together, by the way 17:46:03 well sure for the latter, but how does it make it harder. Can you give me an example where it matters in a major way? 17:46:33 If you don't make the roots heavy or big enough, the tree falls over and the program crashes 17:46:49 If they are too heavy and not big enough, arithmetic becomes harder to do 17:47:03 is the tree for the program itself or as a data structure for the program? 17:47:10 Both, in a way 17:47:22 okay 17:47:23 But mainly the data structure 17:47:35 Actually, I think I was meant to say the data structure 17:47:57 "was meant", by whom? 17:48:00 The program describes how nutrients should be moved around 17:48:10 Your question 17:48:20 hm. 17:48:21 The program will be plain-text 17:48:29 Intercal-like 17:48:48 well one could argue that Intercal is not exactly plain text. ;P 17:48:53 I'm thinking of calling the language Bonsai 17:48:59 It's more plaintext than Piet 17:49:11 Oh, wait, there was an emoticon 17:49:15 In which case, ha 17:49:58 Ngevd, well yes, also Intercal has stuff like using a literal backspace to write two letters in the same place 17:50:10 True, true 17:50:20 Okay, maybe more like... ORK 17:50:27 -!- elliott has joined. 17:50:32 Ngevd, wait, isn't that a bf clone? 17:50:44 That would be Ook! 17:50:58 ORK is the Object-Oriented one 17:50:59 elliott, btw I finally got around to looking at that constant wrapping code. I have one question though. 17:51:06 Yes? 17:51:09 frac n d 17:51:09 | n `rem` d == 0 = n `div` d 17:51:09 | otherwise = (n+d) `div` d 17:51:10 that bit 17:51:17 how does that behave wrt negative numbers 17:51:22 which direction does it round 17:51:37 rem is like C % 17:51:40 elliott, and div? 17:51:42 mod is like mathematics 17:51:50 Vorpal: divMod/quotRem 17:51:50 does it round to 0 or to -inf 17:51:54 latter is C 17:51:54 hm 17:51:58 actually 17:52:00 this is worrying 17:52:04 elliott, so the division rounds in a non-C way then 17:52:04 maybe it should be `quot` 17:52:07 ...but it works :) 17:52:14 mycology tests negative fungespace, right? 17:52:40 elliott, yes but it might only hit an even divisible case 17:52:41 who knows 17:52:42 Vorpal: eh, just check fungot works :p (I can't run fungot) 17:52:43 elliott: now it froze again before the program was tiled across 2d space, and i got 3 for that 17:52:48 that should test well if underload is tested 17:53:20 Once again, fungot replied appropriately 17:53:21 Ngevd: a command would switch your " current" one and you could find. 17:53:32 Vorpal: can you sprunge the code for me? I don't have it here :P 17:53:38 elliott, oh also, I gather it is not meant to be used unless you detected already you crossed outside the borders? 17:53:41 Okay, fizzie, I'm scared 17:53:46 elliott, sec 17:53:58 Vorpal: It replaces the loop you have. So yes. 17:54:22 elliott, http://sprunge.us/DLNE 17:54:52 Vorpal: hmm, that's actually not the latest code, Vector became its own type :-) 17:54:54 but right 17:55:09 elliott, okay, it is the one I had though 17:55:31 I'll check the rem/div thing using logs of the source 17:55:36 elliott, also "f"? 17:55:43 Yes, f 17:55:56 You are free to figure out what an appropriate name for it is 17:56:02 elliott, I was just about to ask you 17:56:05 But I'd just call it f 17:56:17 -!- myndzi has joined. 17:56:20 elliott, hell I'll go with static int f(int, int, int, int) 17:56:28 not very idiomatic, but whatever 17:56:34 Vorpal: static INLINE! 17:56:40 _FUNGE_FAST or whatever it is 17:57:04 elliott, actually the static was there because "f" is a way too generic name to let it escape into the global namespace :P 17:57:14 elliott, hm, frac_dir might work 17:57:27 it is a frac wrapper that deals with the direction 17:59:34 -!- myndzi\ has quit (Ping timeout: 240 seconds). 17:59:47 -!- augur has joined. 17:59:57 elliott, btw sometimes it seems to return coords outside the boundaries. 18:00:11 I blame your division 18:00:13 so it needs a step to get into the boundaries 18:00:22 elliott, no, your haskell version 18:00:33 Oh. Right, I think I advance after doing that, or something. 18:00:35 Dunno. 18:00:53 *Main> wrap (0,0) (10,10) (Ray (5,5) (2,0)) 18:00:53 Ray (-1,5) (2,0) 18:01:06 yeah I guess so 18:01:22 FFS, why does reddit make it so hard to go to a given page of a comment overview? 18:01:34 (same with 11,5 for the coord btw) 18:02:16 Yay, my pull request got merged. 18:02:27 elliott: happy happy joy 18:02:31 elliott, pull request for what? 18:02:38 https://github.com/pbrisbin/aurget/pull/4 18:03:11 oh, aurget 18:03:14 is that like yaourt? 18:04:02 Vorpal: Yes, except it just does AUR 18:04:09 And has far less annoying prompts/output 18:04:36 elliott, so if you need a dep from the main repo you have to do that by hand? 18:04:42 No, it calls out to pacman 18:04:51 well, then it doesn't just do AUR ;P 18:09:49 -!- augur has quit (Remote host closed the connection). 18:11:45 elliott: I need some meme advice: when using "accidentally" as a verb, is the third-person form "accidentally" or "accidentalies"? 18:11:53 I suppose the former would be more consistent with the etymology 18:12:01 but it looks really wrong 18:12:05 Singular or plural? 18:12:07 ais523: don't... don't do that 18:12:16 whatever you're doing :P 18:12:16 elliott: I'm not 18:12:18 but someone else did 18:12:31 and it threw me for a loop, and I'm trying to recover 18:12:40 Ngevd: singular, obviously; there's no problem with plural 18:12:46 anyway, I think "accidentally" 18:12:49 accidentally isn't really the verb 18:12:55 it's just the word before the invisible verb 18:13:19 I think accidentallies... 18:13:38 so do I 18:13:47 but someone used just "accidentally" in the context, and it /looks wrong/ 18:13:51 perhaps that's the point 18:15:03 Hmm 18:15:15 I like the Koan of Drescher and the Toaster 18:21:43 https://lists.fedoraproject.org/pipermail/devel/2011-October/158845.html 18:21:50 What; Lennart is doing something reasonable for once? 18:25:46 elliott, btw why did you error out on zero delta? 18:25:51 as far as I know it is perfectly valid 18:26:12 Vorpal: CCBI does, too; you can replace it with for(;;) sleep(9999999999) if you wish. 18:26:19 heheh 18:26:23 It's nice to have an option to report that, though. 18:26:43 elliott, I prefer a busy-loop, it is what cfunge currently does if you are stupid enough to set your delta to zero 18:26:44 Vorpal: But I hereby license my code under the "You're not allowed to put an explicit busyloop" license. :p 18:26:48 At least sleep it out! 18:26:51 Baaaaaah. 18:26:52 You are bad. 18:26:56 That is, like, so un-green. 18:27:06 It's... RED. 18:27:10 elliott, that would break compatibility with previous behaviour. 18:27:44 Anyway, I might make cfunge error on it. 18:28:29 elliott, anyway do you error if delta is zero and you are not wrapping? 18:28:33 if not, that is quite weirfd 18:28:35 weird* 18:28:45 Not yet :) 18:29:05 -!- hagb4rd has quit (Ping timeout: 248 seconds). 18:29:06 elliott, also iirc there is a fingerprint to poke the delta of other IPs 18:29:10 elliott, you would not support that 18:29:32 I'm just going to make it return to allow for easy implementation of such a fingerprint in the future 18:30:07 elliott, anyway how could you get outside of the borders with a zero delta 18:30:11 is that even possible? 18:30:20 Probably 18:30:21 sure, if there was a fingerprint to poke another thread 18:31:05 I think the Jargonwiki is what we are stopping ourselves from becoming 18:31:16 It has been overran with spam 18:31:44 No, wait, I just caught it at a bad time 18:31:49 No, wait 18:31:57 Oh dear god it's bad 18:32:53 elliott, btw why did you name that "m", what does it stand for 18:32:58 Ngevd: Oh no, it's based on the wrong jargon file. 18:33:25 Vorpal: Nothing. I don't think I named it m, actually. 18:33:37 elliott, well... "where m" 18:33:38 I wouldn't worry too much about the names. 18:33:40 it says that there 18:33:57 if it isn't named m then the code is lying :P 18:34:27 I didn't say it wasn't named m. 18:34:38 There are only a finite number of BF Joust programs 18:35:57 Ngevd: *fundamentally different BF Joust programs 18:36:10 True, I'll grant you 18:36:28 However, an interpreter can cut all programs off after 100000 with NO change to execution 18:36:41 Vorpal: what do you do if the delta for one IP is 0 but the program is multithreaded? 18:36:52 -!- augur has joined. 18:37:07 Ngevd: untrue 18:37:09 (...)*0 18:37:31 100000 characters 18:37:37 Yes. 18:37:38 Untrue. 18:37:40 (...)*0 18:37:44 ais523, well, currently wrap locks up, which is allowed as I implement the reference algorithm provided by the spec exactly as written there. 18:37:46 I see not what that is doin 18:37:48 g 18:37:53 Hmm 18:37:54 (blah blah blah)*0 is a comment. 18:37:56 In fact, so is "qhdfdjkfhsdkjf". 18:37:58 ais523, unless said spec is bugged. 18:37:59 Ooooh 18:38:01 So it is 18:38:03 Hmm 18:38:06 All those things take no cycles but many characters. 18:38:27 ais523, from now on however I will just skip handling that IP. 18:39:08 Okay, after removal of comments and expansion of brackets, an interpreter can cut all programs off after 100000 characters with NO change to execution 18:39:09 Better? 18:39:11 Vorpal: I believe that's wrong 18:39:15 Zero-delta is meant to lock up 18:39:23 elliott, why do you error out then? 18:39:31 Will it execute the command it's over repeatedly? 18:39:35 That would make sense 18:39:38 Vorpal: Because locking up sucks 18:39:42 But context-switching to other IPs is wrong 18:39:44 Ngevd: Expansion of brackets is untenable, nobody has enough RAM to do that for the programs we write nowadays 18:39:51 elliott, hm. 18:39:56 Ngevd: But what you've said approximately reduces to "after 100000 cycles"... :P 18:40:06 elliott, unless there are loops 18:40:07 elliott, where does it say that? Isn't this perhaps undefined behaviour? 18:40:15 Vorpal: Ask Deewiant 18:40:15 we need Deewiant and cpressy here 18:40:20 Deewiant, prod. 18:40:28 Is cpressy alive? 18:40:36 As opposed to dead? 18:40:39 And it's cpressey. 18:40:44 So it is 18:40:49 cpressy is non-existant 18:40:59 But as opposed to dead to us 18:41:02 Anyway, he's quite thoroughly alive: http://catseye.tc/news.html 18:41:09 He just doesn't come on IRC much any more. 18:41:13 Deewiant, Wrt multiple threads, what is the correct behaviour of wrapping with a delta of 0. Should the program just lock up? Or should it switch to another thread? 18:41:54 Ooh, dinner 18:41:58 he could have died since he wrote that 18:42:01 -!- Ngevd has quit (Quit: noms). 18:43:26 Vorpal: By the way, the Voxatron Arch package now works perfectly on 64-bit. 18:43:31 s/Arch/AUR/ 18:43:41 nice 18:43:42 Be sure to install the optional dependency it mentions if you want sound support :) 18:44:18 I'm still impressed it looks as good as it does seeing as it's software-rendered. 18:44:33 elliott, it is software rendered!? 18:44:35 wow 18:44:41 Yep, with SDL. 18:44:45 elliott, well that explains why I only got about 110 FPS 18:44:51 "Only| 18:44:52 with the antialias on 18:44:54 s/|/"/ 18:45:07 and also why it ignored the vsync setting 18:45:07 Vorpal: There's a reason the sysreqs are "1 GHz CPU and any graphics card" :P 18:45:17 elliott, sysreqs? Who reads them 18:45:27 Vorpal: Also: The whole thing is done completely through the voxel array. 18:45:29 Even the menus. 18:45:33 elliott, I did notice that 18:45:42 Yeah, but it's not just an illusion, it's even like that in the code apparently. 18:45:52 So you could run it on a "voxel display" without changes :P 18:45:52 elliott, sadly I seemed unable to shoot the help text that the sign displayed 18:45:54 I did try 18:46:04 What are you doing this time? 18:46:06 elliott, I'm not even sure what a voxel display is 18:46:09 Phantom_Hoover: Voxatron, buy it already. 18:46:14 Vorpal: Nor am I :P 18:46:18 Phantom_Hoover, reading this: http://catseye.tc/projects/flobnar/doc/Flobnar.falderal 18:46:20 I don't remember where my moneys are. 18:46:38 Phantom_Hoover, on your VISA-card? 18:46:45 or paypal 18:47:04 Vorpal, I don't remember where that is either. 18:47:19 Phantom_Hoover: If you have it saved in PayPal you don't need to. 18:47:20 Phantom_Hoover, in your wallet ? 18:47:24 If you can remember your username and password. 18:47:30 This is of course SO SAFE. 18:47:45 elliott, that does worry me quite a bit about PayPal I have to say. 18:47:53 elliott, too much like hard work. 18:48:08 Phantom_Hoover: Seriously, you want to buy this one. 18:48:30 I was referring to PayPal. 18:48:38 elliott, a lot less security than the typical bank transaction have. With my bank I use the card in a hardware device to generate a response code and so on. Feels quite a bit safer. 18:49:04 lol, Subwayspam offers me a FREE 6-inch sub when I buy another one ... before 9AM. 18:49:21 elliott, I think it isn't worth it really unless they add some other game. Sure, the game is good, but it isn't amazing. 18:49:28 Vorpal: It's also alpha :P 18:49:40 Think Minecraft alpha 1.0 or whatever the fuck. 18:49:48 Vorpal: The idea is to make it completely scriptable. 18:49:53 Oh, right, it was that VoxelNatural game now. 18:49:55 (From the dev's post about it) 18:49:57 elliott, this is what you get if the resolution in the y-direction is an odd number: https://imgur.com/cYF77 18:50:06 Nice 18:50:11 It's emulating a CRT for you 18:50:25 elliott, the lines are tied to the models, not to the position on the monitor 18:50:31 it seems 18:50:32 fizzie, wait, you were there for the VoxelNats? 18:50:42 Phantom_Hoover: Where? 18:51:01 elliott, you might ask why I tested, well the second resolution listed is derived from dividing the native resolution in half. Which in my case gives me an uneven number. 18:51:09 Yes, I read the thread. 18:51:11 elliott, ah 18:51:41 elliott, then you saw the image too? Since I posted such a thread iirc 18:52:45 elliott, anyway I do find the font a bit hard to read in that game sometimes 18:53:13 I don't recall an image. 18:53:22 ah okay 18:54:21 Phantom_Hoover: Where? 18:54:24 -minecraft. 18:54:53 Phantom_Hoover: Yes, I think I was lurking at that time. 18:54:54 Anyway the gateway to my moneys is sealed to me. 18:55:54 elliott, what do you do on the second level 18:55:57 elliott, I don't get it 18:56:13 Vorpal: Haven't gotten that far yet, was busy dealing with audio troubles. 18:57:40 Did all of you buy that thing already, or is there some sort of a thing? 18:58:07 fizzie, I bought it for a cheap sum, will increase that if they add more games 18:59:11 Also Steam's Halloween sale had a "Trains vs Zombies" DLC pack to that one train simulator. That was a bit "what". 19:00:01 fizzie, heard about it. Didn't work very well from what I remember 19:00:12 fizzie, from seeing an attempt at a video of it 19:00:32 fizzie, I did buy Cthulhu saves the world from the halloween sale though 19:00:49 quite a nice game done as a NES-style RPG with a lot of parody thrown in 19:00:56 I noticed it was very cheap. 19:01:00 fizzie: I bought it but Phantom_Hoover can't because he is a robot. 19:01:01 Skipped, though. 19:01:11 fizzie, I think it was worth the money 19:01:17 fizzie, totally hilarious 19:03:43 But two whole euros. It's, like, one more than one. 19:04:04 Okay, the second is not quite whole. 19:04:07 elliott, how dare you, Roombas are soulless automata. 19:05:52 fizzie, I got it for 1.33 € for both it and another game together iirc (for the steam game mentioned above) 19:06:07 used steam because it cost slightly more on gamers gate, and just one game there 19:06:33 I plan to pay 1p. 19:09:04 1p press start. 19:10:11 ais523: oh /no/ 19:10:19 elliott, what? 19:10:23 and why me? 19:10:40 ais523: I... have a use for the Secret Project 19:10:53 elliott, really? What is it? 19:10:55 err, are you sure? 19:11:00 you don't know what the Secret Project is for yet 19:11:01 ais523: I think so??? 19:11:22 let me know the use, anyway 19:11:28 ais523: The Secret Project gives perfectly deterministic (and thus repeatable) execution of Linux programs without being ridiculously slow, right? 19:12:05 can't you read the TSC from the user space? Or is that instruction kernel only? 19:12:16 elliott: yes, or will do when it's finished 19:12:25 ais523: That's exactly what I need. :( 19:12:33 note that this is a statement that's true about the Secret Project, rather than being its purpose 19:12:33 elliott, for what? 19:12:52 Vorpal: Package building. 19:12:57 ah right 19:13:00 Nix has problems with e.g. people depending on the system clock or uname. 19:13:07 Which obviously violates the purity it tries hard to create. 19:13:19 So the solution is... the Secret Project. 19:13:37 hm 19:13:37 Also does something use "dbpq" as a twirlie in place of a "-/|\"? 19:13:39 What I'm saying is, ais523: how long do I gotta wait for a public release :P 19:13:43 note that the Secret Project may well set them to arbitrary values 19:13:48 And yes, that's fine. 19:13:53 and, err, quite a while, as I have higher priorities and am at work 19:14:03 ais523, how is linux setup, can you execute RDTSC from user space? according to CPU docs that depends on if CR4.TSD is set to 0 or 1 19:14:17 if it is set to 0 you can always introduce non-determinism 19:14:27 ais523: Butbutbut... 19:14:54 The RDTSC instruction can be enabled or disabled by operating systems. For example, on some versions of the Linux kernel, seccomp sandboxing mode disables RDTSC.[8] It can also be disabled using the PR_SET_TSC argument to the prctl() syscall.[9] 19:15:06 ais523: hmm, can Secret Project-ran programs write to a filesystem? 19:15:08 elliott, well then, it is usually enabled I guess 19:15:11 aha, I need to call that prctl 19:15:21 ais523, that might stop the program from working 19:15:24 elliott: yes, to a hidden filesystem 19:15:30 Vorpal: It is usually enabled, but I doubt many people use it. 19:15:33 ais523, how far has the secret project progressed btw? 19:15:36 the filesystem in question has a lifetime tied to that of a process 19:15:37 ais523: which can then be read after it's finished? 19:15:41 oh 19:15:48 Vorpal: Performance counters were discussed back then. 19:15:48 elliott: it could theoretically be tied to a file 19:15:50 it isn't, but it could be 19:15:50 ais523: what if I need to get the resulting FS? 19:15:59 so it wouldn't be too hard to modify to do that 19:16:01 fizzie, hm 19:16:23 -!- Ngevd has joined. 19:16:28 ais523: hmm, the worst part of needing the Secret Project is that you need the Secret Project 19:16:30 Hello! 19:16:31 ais523, can't you make public the parts of the secret project that would benefit elliott here, those would not really compromise it if it is cleanly separated. 19:16:37 ais523: just to check, you're not writing it for package building, right? 19:16:44 no 19:16:46 Vorpal: It obviously isn't even working for my purposes yet 19:16:56 elliott, well, it is a good start 19:16:56 Vorpal: I probably could, but it wouldn't work 19:16:59 Which secret project are we talking about? 19:17:00 in its current state 19:17:04 as opposed to starting from scratch 19:17:05 Ngevd: /the/ Secret Project 19:17:07 Vorpal: So I'll just do what Nix does (set the obvious stuff to dummy values and trust the package.) 19:17:09 the one that gets capital letters on its name 19:17:10 s/.)/)./ 19:17:28 Oh, that one 19:17:28 Vorpal: I mean, the worst that can happen is that you have a broken package that behaves differently when you GC it and reinstall it. 19:17:28 Vorpal: After all, it only needs to work right, not to be right. 19:17:36 elliott, and do it in a chroot with just what it needs according to the package description visible? 19:17:37 Vorpal: It's like foo = unsafePerformIO randomNumber. 19:17:46 Vorpal: It's bad, but it probably isn't going to cause actual problems. 19:17:53 It's just another broken package. 19:18:01 elliott, btw, valgrind must be installed in the --prefix given to it's ./configure 19:18:09 elliott, it won't run from anywhere else. 19:18:19 Vorpal: Tons of packages do that, that's why DESTDIR was invented; what's your point? 19:18:22 reason, hard coded paths. Why? Because it doesn't use libc 19:18:32 elliott, indeed. Just saying you can't relocate it. 19:18:40 Vorpal: Why would you want to? 19:18:53 elliott, well, the valgrind people thought it worth documenting this 19:19:11 ...Why are you telling me...? 19:19:22 Oh, two more games in that thing? How coincidental. 19:19:31 fizzie, oh? nice, will check them out 19:20:07 fizzie: It was inevitable. 19:20:18 elliott, well I assumed it was reasonably common (and you might do that with some unusual fs layout) since they wrote this: http://valgrind.org/docs/manual/dist.readme-packagers.html 19:20:38 Vorpal: Even dpkg and friends have to deal with that, if they don't use fakeroot. 19:20:44 ooh I heard nice things about "Blocks That matter" 19:20:45 Since they have to put the files in a subdirectory to package up. 19:20:50 supposed to be really screwy 19:21:11 Vorpal: But anyway, in a Nix-style system no relocation is done, ever. 19:21:15 and wtf, "the binding of isaac" I heard it was quite nasty. Like super-nasty 19:21:30 "nasty" 19:21:34 Looks like it's from one of the Super Meat Boy guys 19:21:44 never played that 19:21:46 what is it? 19:22:01 A ridiculously popular indie platformer thing. 19:22:08 It's good, if painful. 19:22:12 I see 19:22:15 Vorpal: (following on from previous statement) Even if you install a package for a different architecture it still goes in the same place everywhere. 19:22:40 hm 19:22:53 "When Isaac’s mother starts hearing the voice of God demanding a sacrifice be made to prove her faith, Isaac escapes into the basement facing droves of deranged enemies, lost brothers and sisters, his fears, and eventually his mother. The Binding of Isaac is a randomly generated action RPG shooter with heavy Rogue-like elements." 19:22:54 Heh. 19:22:57 That's some plot. 19:23:08 Yay @ randomly-generated. 19:23:49 pikhq: You probably know this stuff: How does using -m32 with an x86-64 compiler differ from using a host=x86-64, target=x86 cross-compiler? 19:23:51 pikhq: (gcc) 19:24:02 elliott, I saw a bit of a play through recently of that (live stream, so I can't link it). Style of the dungeon reminded me a LOT of Zelda a link to the past 19:24:07 I might define an XML-based game development language 19:24:14 Don't. 19:24:15 like the door shape and everything 19:25:03 Hmm, I wonder how much I could parallelise expression evaluation. 19:25:21 I gather Nix is quite a bit slower than apt and the like because packages are much more powerful. 19:25:32 Maybe I could compile them :-) 19:25:47 Or possibly just XML-incorporating 19:25:58 Why 19:25:59 XML is awful 19:26:17 -!- derrik has left. 19:26:29 Because I feel like it 19:26:36 elliott, for building and downloading and so on? Or during actual runtime? 19:26:44 Vorpal: ? At which part? 19:27:06 elliott, I mean potentially the lookup time for finding a given dependency could be different on NixOS 19:27:24 elliott, btw does it use RPATH magic or how is it done on NixOS? 19:27:24 Building is irrelevant, the context is binary packages 19:27:37 elliott, no lookup time during runtime 19:27:41 to find libssl.so 19:27:41 The point is that you have to load and run a fuckton of programs to calculate dependencies and the like 19:27:43 or whatever 19:27:47 Maybe I'll subsequently create a JSON version 19:27:49 Vorpal: What do you mean, how is what done? 19:28:16 elliott, say I have foo which depends on libm.so, obviously we need to find the right version of libm.so to match this excecutable 19:28:18 how is that bit done 19:28:26 by hard coding the RPATH into foo? 19:28:28 When do you need to do that 19:28:35 elliott, when executing foo 19:28:39 unless you do static linking 19:28:40 Why 19:28:46 and I don't think nixos does 19:28:50 Foo links to /nix/store/89sdfusd89fu89sdfu9-libssl-3.9/lib/libssl.so 19:28:59 elliott, right, but how is that done on the ELF level 19:29:16 Empty RPATH, linking to /nix/store/89sdfusd89fu89sdfu9-libssl-3.9/lib/libssl.so? RPATH=/nix/store/89sdfusd89fu89sdfu9-libssl-3.9/lib, linking to libssl.so? 19:29:24 yes, which one 19:29:27 Perhaps the latter, since they have that patchelf thing. 19:29:30 elliott: The *main* distiction is that -m32 will have the compiler looking in /usr/include for headers, and /usr/lib32 for libraries. 19:29:33 hm 19:29:33 I don't know. It seems immaterial. 19:29:38 But the latter is easier to do w/ commercial binaries. 19:29:41 You just need to patch the RPATH. 19:29:42 Rather than having it look in a cross-compilation prefix. 19:29:48 Which is what their patchelf does. 19:30:07 pikhq: Right. That's actually irrelevant to me I think since I'd override that anyway. 19:30:09 Most of the technology seems to be there in SVG+SMIL+XSLT 19:30:12 pikhq: What're the non-main distinctions? :p 19:30:16 elliott, anyway what about building your own stuff in ~, how do you find the include files, lets say you do #include 19:30:25 I haven't tried that on nixos 19:30:44 Vorpal: ls ~/.nix-profile/usr/include, one presumes. 19:30:51 Probably /usr/include would work too. 19:31:05 hm 19:31:24 elliott: Shit sometimes breaks because gcc -m32 looks like you're building a native binary with some weird optimisation flag. 19:31:42 elliott, I guess pkg-config would solve it for pretty much everything outside libc, ncurses and a few other such core/classical libraries 19:31:45 Especially with autoconf. 19:32:00 pikhq: Oh good. So my decision to avoid -m32 entirely was the correct one. 19:32:22 pikhq: I figure if you're not using the 32-bit binary packages, you can't complain too much about it building a cross-compiler to install a 32-bit package on x86-64. 19:32:23 (where it won't automagically do the x86 stuff for, say, ld.) 19:33:19 If we consider XSLT+SVG+SMIL, we really just need some method of input 19:33:30 -!- tiffany has joined. 19:33:33 ais523: What's the Secret Project's startup time like? 19:33:43 i.e. how long does `secret echo hi` take 19:33:50 let me try it 19:34:05 pikhq: So yay. 19:34:28 pikhq: Have I mentioned I'm pretty sure my Kitten design solves multiarch issues completely, without having to build special "32-bit for x86-64" packages? 19:34:59 It's actually pretty easy to do if you're not tied into the concept of "libraries go in /usr/lib/". 19:35:31 0.02user 0.01system 0:01.04elapsed 3PU (0avgtext+0avgdata 6960maxresident)k 19:35:31 Hey tiffany 19:35:32 0inputs+0outputs (0major+884minor)pagefaults 0swaps 19:35:36 elliott: seems to be around a second 19:35:53 ais523: that's not bad 19:35:53 also, /usr/bin/time has really different output from bash's time, it seems… 19:36:17 pikhq: Libraries do go in /usr/lib in my system (sort of). 19:36:31 oh good, it's stopped leaking filesystems 19:36:33 pikhq: There's definitely nothing like /usr/blah-linux-gnu/lib/. 19:36:42 I think a filesystem leak is possibly one of the silliest leaks possible 19:36:56 What the world really needs is a HTML version that uses a markup system other than SGML or XML 19:37:30 HTML5; done. 19:37:56 Based on SGML, that is, I think 19:38:05 -!- GreaseMonkey has joined. 19:38:06 Get better grammer, to do, I need 19:38:17 No. It uses a unique syntax. 19:38:31 HTML 4 was SGML-based, though nobody (and I mean nobody) actually implemented it that way. 19:39:15 In fact, I don't think there was a single reasonably complete HTML 4 implementation. 19:39:43 Hey GreaseMonkey 19:40:14 'lo 19:40:36 My favourite part of HTML5 is the part where it says "if someone asserted that cats were vegetables". 19:41:08 Really? 19:41:32 Well, I haven't read most of it, so it might not be a permanent favourite part; plus it's a work-in-progress, anyway. 19:41:42 But quoted out-of-context like that it sounds delightfully nonsensical. 19:41:54 It's in the list of examples at http://dev.w3.org/html5/spec/Overview.html#the-em-element 19:42:18 Okay, what I meant was, "What the world really needs is a HTML version that uses a markup system substantially different to SGML and XML" 19:42:20 fizzie: It's not really a "work-in-progress". 19:42:31 -!- augur has quit (Remote host closed the connection). 19:42:40 fizzie: WhatWG maintains the HTML "living standard", which means it doesn't get any releases and just gets updated constantly (http://www.whatwg.org/specs/web-apps/current-work/multipage/). 19:42:56 fizzie: From that, the W3C are working on the HTML5 spec to be published. 19:43:10 fizzie: But the publication is roughly irrelevant as far as everyone else is concerned. 19:44:06 elliott: It is relevant in the context of whether the W3C spec will or will not contain "cats were vegetables", though. 19:44:10 Compare the JSON-like {"head":{"title": "Hello!"},"body":[{"p": "Hello World!"}]} to the XML-like Hello!

Hello World!

19:44:18 fizzie: True. 19:44:33 Ngevd: A data language is not suited for markup purposes. 19:44:45 Something like sexprs do decently because they're lightweight enough. 19:44:47 It is PERFECTLY suited. 19:44:53 But JSON would get incredibly noisy very quickly. 19:44:58 Especially with string quoting. 19:45:13 Nobody wants to write ten pages of heavily-nested JSON. 19:45:21 It's a data interchange format, not anything for humans. 19:45:25 But JSON is the only data language other than XML I'm familiar with 19:45:58 ...What is sexprs? 19:46:40 S-expressions. 19:46:48 Okay 19:46:54 But they still have the same string-escaping problem. 19:50:06 I'm not all to familiar with S-expressions, I'll check them out... 19:53:10 Vorpal: Lock up because it can't find an instruction to execute within finite time (it's the execution that takes a tick, not one step of finding the instruction) 19:59:51 S-expressions look interesting 20:00:38 Wow, rename(2) wasn't atomic on OS X until a few months ago 20:01:57 Wow, S-expressions are handy 20:02:23 ((5:title6:Hello!)(1:p12:Hello World!)) 20:02:48 That... 20:02:48 What? 20:02:54 That's not an s-expression. 20:03:01 Going by the RDF submission 20:03:05 What? 20:03:13 http://en.wikipedia.org/wiki/S-expression 20:03:22 http://people.csail.mit.edu/rivest/Sexp.txt 20:03:22 Got submitted to and rejected by the RDF people 20:03:27 Oh, that thing. 20:03:31 Wikipedia links to i 20:03:31 t 20:03:32 No, those aren't what anyone means by "s-expressions". 20:03:34 Oooh 20:03:36 Okay 20:03:50 (html (head (title "Hello!")) (body (p "Hello world!"))) is more what I'd expect. 20:04:38 Okay 20:04:55 Still very short 20:06:40 Hmm 20:06:56 Of course, sane people (most aren't) would write that as: Hello!

Hello World! 20:07:33 Yet another thing I need a psychiatrist for 20:09:03 Or (valid HTML 4): Hello World! 20:10:03 <elliott> I wonder if there's any actually transactional filesystems for linux. 20:10:31 <elliott> I bet btrfs can do it. :( 20:10:40 <pikhq> Reiser4. 20:11:23 <elliott> pikhq: That's even worse than btrfs! 20:11:52 <elliott> Oh well, I think all I need is atomic rename(2). 20:12:18 -!- augur has joined. 20:12:19 <pikhq> btrfs has "transactions". 20:12:37 <pikhq> They are not transactions in any sane sense. 20:12:45 <Ngevd> pikhq, validator.w3c.org gives that 2 errors and 5 warning 20:12:46 <Ngevd> s 20:13:00 <pikhq> Ngevd: *2*? 20:13:10 <pikhq> Oh, I can guess. Missing doctype, missing encoding. 20:13:36 <elliott> Ngevd: Encoding error is irrelevant 20:13:40 <elliott> if sent by correctly-configured server it won't appear 20:13:44 <elliott> it's just because you used the web form 20:13:55 <elliott> also, validator.nu is better for html5 validation than w3's 20:14:07 <pikhq> elliott: I was discussing HTML4 as well. 20:14:09 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds). 20:14:18 <elliott> but yeah, you need a doctype 20:14:34 <pikhq> Easy in HTML5. <!doctype html> 20:14:34 <pikhq> Done. 20:14:42 <Ngevd> 'document type does not allow element "P" here' 20:14:53 <elliott> Ngevd: you're validating it with the wrong standard 20:14:55 <elliott> <!doctype html><title>Hello!

Hello World! 20:14:57 should validate fine 20:15:04 Yeah, that's perfect HTML5. 20:15:12 might give an error about encodings that won't occur with correctly-configured server 20:15:24 yep 20:15:25 validates fine 20:15:27 no errors 20:15:41 3 warnings; first one is one that always occurs with w3's html5 validator saying it's experimental 20:15:51 -!- ais523 has changed nick to ais523\unfoog. 20:15:52 third one is complaining because i used direct input rather than giving a url 20:16:04 second one is an actual warning that wouldn't appear with a properly-configured server 20:17:44 btrfs is just a ploy to distract the linux geeks with a not completely boring file system so they will stop trying to port zfs (and so that oracle can sell the zfs upgrade to anyone trying to get real work done on btrfs) 20:17:58 heh 20:18:27 yeah btrfs has transactions 20:18:47 nilfs2 is pretty exciting, at least it does most of what's cool about btrfs 20:20:26 elliott: Not really transactions. 20:20:40 wikipedia said user-defined transactions but ok, that is a slightly weird wording 20:21:00 A btrfs "transaction" is saying "don't commit anything to disk until I let go". 20:21:06 Only one can occur at a time. 20:21:41 Gross. 20:22:11 Hmm, I'll have to be slightly careful about multiarch support in Kitten. 20:22:43 Specifically I'll have to use a cross-compile prefix to generate all the symlinks, can't just put them directly into [profile]/usr... 20:22:50 Shouldn't affect packages themselves, though. 20:22:56 -!- ais523\unfoog has quit. 20:23:34 HALLO 20:23:43 -!- ais523\unfoog has joined. 20:24:12 elliott: So, what filesystem layout are you intending to use, anyways? 20:24:12 Linux is Monolithic, HURD is Microlithic. 20:24:18 I have no idea what the difference is. 20:24:30 Gregor: You finally awake! 20:24:39 -!- sebbu has quit (Excess Flood). 20:25:01 -!- sebbu has joined. 20:25:02 -!- sebbu has quit (Changing host). 20:25:02 -!- sebbu has joined. 20:25:06 elliott: I'm finally home :P 20:25:15 He's been sleepwalking 20:25:20 pikhq: Depends what you mean! In terms of what the user cares about, I'm actually dropping /bin and /lib in favour of subdirectories of /usr (good reason for that, actually). 20:25:26 As opposed to vice versa. 20:26:00 pikhq: Packages are installed Nix-style to /something/923874c23894uc98jf9sd8ff-pkgname/ and links + executable references point there too. 20:26:03 elliott: For instance: how the heck are you going to differentiate between an x86 libc.so.6 and an x86_64 libc.so.6? 20:26:15 The actual user-exposed hierarchy being a sham, symlinks or unionfs (depends on Gregor :-P) 20:26:33 pikhq: x86: /something/sdfu34nfs8498hf89hf893y4h-glibc-99.4/lib/libc.so.6 20:26:45 pikhq: x86_64: /something/asdia0de3j898w7e-glibc-99.4/lib/libc.so.6 20:26:49 Making it a union makes it potentially per-process, which is sexitude. 20:27:00 So, nix-style linking. 20:27:01 Gregor: Yes, that's why I wanted to talk to you :) 20:27:17 pikhq: Yep, but I don't think Nix actually has a multiarch story in practice. Not sure. 20:27:21 -!- sebbu2 has joined. 20:27:21 -!- sebbu2 has quit (Changing host). 20:27:21 -!- sebbu2 has joined. 20:27:21 I would potentially be willing to rewrite my cunionfs as a kernel module. 20:27:27 Well, then /usr/lib/ will either be pointless or strange. 20:27:43 pikhq: It'll be used for when you use "gcc" from the command-line. 20:28:07 -!- ais523 has joined. 20:28:27 Gregor: I /think/ I need a way to rewrite the list of union branches while a process runs (i.e. not env-var-based). 20:28:46 Gregor: Because when a package is installed, the user's session should see it as part of the hierarchy without a reboot :P 20:29:29 Since I have per-user package installations, I think the simplest way is just to let me say, I dunno, CUNION_BRANCHES_FROM_FILE=/some/path, and that's read whenever the list of branches is required. But it would be nice if it only re-read the list of branches when I told it they changed, because reading them every FS operation sounds slooow. 20:29:31 -!- derdon has quit (Remote host closed the connection). 20:29:32 -!- lambdabot has quit (Ping timeout: 240 seconds). 20:29:45 -!- sebbu has quit (Ping timeout: 240 seconds). 20:29:50 -!- Phantom_Hoover has joined. 20:30:25 -!- ais523\unfoog has quit (Ping timeout: 240 seconds). 20:30:30 -!- ais523 has changed nick to ais523\unfoog. 20:31:00 -!- kmc has quit (Ping timeout: 240 seconds). 20:31:00 Another possible problem is stuff that actually breaks if you install it out of its prefix; with symlinks, it might resolve its own argv[0] and work fine, but maybe something will break if it looks normal? /However/, the files will still be in the prefix it was installed to, so programs would have to try very, very hard to break. 20:31:14 i.e. they'd have to specifically check for people "installing them outside the configured prefix", and I doubt anyone does that at runtime. 20:31:48 elliott: C-INTERCAL checks a bunch of places, including the configured prefix, relative to the current directory, and relative to argv[0] 20:31:56 -!- kmc has joined. 20:32:00 Hypothetically speaking some things might look in their configured prefix for *other* programs. 20:32:03 ais523\unfoog: Yep, that's fine; it checks the configured prefix first, right? 20:32:08 I can't remember 20:32:11 but probably 20:32:17 Though, this is going to break in common usage anyways. 20:32:21 Basically, everything will work fine as long as everybody checks their configured prefix /before/ snooping around where argv[0] is. 20:32:27 Keyword before. 20:32:39 Anything that doesn't, welp, gotta patch it :P 20:32:46 But I have relative confidence that it'll work fine. 20:32:53 Programs that stupid probably can't handle a symlink argv[0] anyway. 20:34:12 -!- evincar has joined. 20:37:50 This function looks for the skeleton and syslib, searching first the path they should be in, then the current directory, then argv[0]'s directory (if one was given). This function avoids possible buffer overflows, instead truncating filenames (and if that manages to find them, I'll be incredibly surprised). It also tries argv[0]/../lib and argv[0]/../include (where they are when running without installing). 20:37:53 elliott: there you go 20:38:02 that's C-INTERCAL's algo for finding files it needs 20:38:08 "path they should be in" = configured prefix 20:38:14 ais523\unfoog: thanks 20:39:18 ais523\unfoog: I think C-INTERCAL should handle Kitten just fine, then 20:39:33 elliott: Your Haskell-fu is greater than mine. How should I structure a parser (using Parsec or whatever) that depends on past input to parse future input? 20:40:20 (>>=) 20:40:34 Somehow I managed to read Haskell as Befunge 20:40:37 elliott: that answer, while correct, is useless 20:40:45 ais523\unfoog: no, it's not 20:40:49 `addquote Somehow I managed to read Haskell as Befunge`addquote 20:40:52 705) Somehow I managed to read Haskell as Befunge`addquote 20:40:53 (>>=) :: Parser a -> (a -> Parser b) -> Parser b 20:41:01 run a parser computation, get its result 20:41:05 construct parser for rest appropriately 20:41:07 that's what monads /do/ 20:41:13 `delquote 705 20:41:15 ​*poof* 20:41:16 I was going to say to use p to subtly change the program 20:41:17 `addquote Somehow I managed to read Haskell as Befunge 20:41:19 705) Somehow I managed to read Haskell as Befunge 20:41:31 elliott: not an intentional lie, of course 20:41:33 `quote 20:41:34 `quote 20:41:35 213) Vorpal loves the sodomy. elliott, sure why not 20:41:36 `quote 20:41:37 `quote 20:41:37 8) TODO: sex life 20:41:39 44) I spent the last minute or so killing myself repeatedly 20:41:39 `quote 20:41:40 510) My memory passed rest in peace sgeos memory 20:41:42 295) anyway, no CSS editing for me right now, I fear I'd get sucked into a holy war [...] I also fear it might end up breaking one of the Graue Regulations which are rules that you get into serious trouble for breaking, that nobody knows what they are until someone breaks them 20:41:47 hmm 20:41:52 295 isn't very funny, too verbose 20:41:55 none of those are very funny 20:41:58 8 as well 20:42:07 I like 44 a lot 20:42:11 well, OK 20:42:14 it's probably the best there 20:42:21 8 or 295, what do you think? 20:42:40 295 could be split into two quotes 20:42:43 I'm biased, as 295 is all mine 20:42:53 but I'm not sure which way I'm biased 20:42:53 hmm 20:42:56 `delquote 295 20:42:57 it's just too long 20:42:58 ​*poof* 20:42:58 which makes it worse, because I can't counter for it 20:43:02 if it were two quotes, they'd probably be alright 20:43:27 That sound of silence is the sound of Gregor furiously working on the best unionfs the world has EVER SEEN. 20:43:31 `quote 20:43:31 `quote 20:43:32 `quote 20:43:32 `quote 20:43:33 `quote 20:43:35 129) alise: nobody is allowed to fnord me in soviet russia 20:43:38 486) Fuck clay its only purpose is ecoration 20:43:40 330) That's for $literals in the parser. It should maybe be atol too, but probably you shouldn't have nonterminals with more than two billion children. 20:43:41 (Last one. Promise I won't make it a habit.) 20:43:48 415) You have no idea how desperately I want to avoid being a GC guy :P Every year I go to ISMM and Doug Lea gives me a bizarrely-cheery "Hello!" and I'm like "awww shit I'm in memory management" 20:43:48 73) i use dynamic indentation, i indent lines k times, if they are used O(n^k) times during a run of the program 20:43:59 Those are all pretty funny. :( 20:44:02 129 is good for a fungot quote 20:44:03 ais523\unfoog: mail me your link/ data.scm. 20:44:16 oklopol one is a classic, two Grgor ones are great 20:44:20 415 is better than 330, but they're both good 20:44:20 I guess Sgeo's isn't that funny 20:44:30 what is 486's purpose? 20:44:39 note that you don't have to delete one if they're all good 20:44:42 but I don't get 486 20:44:42 ais523\unfoog: I think it's mostly amusing because of the in front of it 20:44:57 I think the context was Minecraft, but imagining Sgeo ranting about clay being useless is vaguely amusing 20:45:00 But eh 20:45:02 `delquote 486 20:45:02 elliott: couldn't you apply that to everything Sgeo says? 20:45:04 ​*poof* 20:45:08 ais523\unfoog: Point 20:45:38 Gregor: Did I mention that updating the branches must be atomic? :P 20:45:47 How tricky would it be to rig HackEgo to pretend to add everything that Sgeo says? 20:46:00 HackEgo can only be made to trigger on `... 20:46:10 So, very tricky. 20:49:39 Ngevd: OTOH HackEgo has access to the logs. 20:49:41 `log Sgeo 20:49:52 2011-10-14.txt:06:38:16: ...Overlapping? 20:50:48 `addquote ...Overlapping? 20:50:50 704) ...Overlapping? 20:51:00 That is oddly funny to me 20:51:43 Ngevd: odd 20:51:55 -!- lambdabot has joined. 20:52:57 lambdabot awwww you're back friendship lambdabot. 20:53:36 lambdabot's a mouse now!? 20:54:07 Yes. 20:54:09 A rouse. 20:54:30 Whatever happened to friendship mouse? 20:54:57 Phantom_Hoover: Tell. 20:55:28 Ngevd, it was foraging in a wastebasket and I stuffed a blanket into the top. 20:55:42 So it would be comfortable 20:55:44 awwwwwwwwwwwwwwwwwwwww 20:55:45 I then released it outside and spent ten minutes keeping the cat away from it. 20:55:46 How thoughtful 20:56:02 And... not really, the blanket was just the first thing to hand. 20:56:04 Why can't I be a friendship mouse. 20:56:12 Ngevd, friendship mouse? wtf is that 20:56:19 Vorpal: Die. 20:56:20 elliott, because then you'd have to be in Scotland 20:56:30 elliott, because you are not a mouse that is why. 20:56:38 elliott, what? 20:56:44 !glogbot_help 20:56:54 `log friendship mouse 20:56:59 2011-11-01.txt:20:56:12: Ngevd, friendship mouse? wtf is that 20:57:32 Phantom_Hoover, how relevant 20:57:53 It was a mouse that made friends with Phantom_Hoover 20:57:57 Phantom_Hoover: Well maybe I am a mouse? 20:57:59 Just SAYING. 20:58:11 Ngevd, as in, a computer mouse? 20:58:14 Oh for christ's sake why does that rsync hate me. 20:58:23 No, as in a squeaky run around get eaten by cats mouse 20:58:30 Ngevd, ah 20:58:42 Ngevd, not live I presume? 20:58:48 Yes, obviously. 20:58:49 No, very live 20:58:57 You can't be friends with a dead mouse. 20:59:02 `log friendship grave 20:59:08 2011-08-10.txt:22:44:37: friendship grave 20:59:15 aren't they unhygienic? 20:59:21 Only in Glasgow 20:59:52 http://codu.org/logs/log/_esoteric/2011-08-10 20:59:55 Hmm. I said that functional languages are better than object-oriented languages in the general case, and got downvoted to oblivion. What a surprise. 21:00:05 Specifically, http://codu.org/logs/log/_esoteric/2011-08-10#141057PhantomHoover 21:00:33 Hey, I was the first person to respond 21:00:36 Look at that 21:00:40 Or maybe it was evil me. 21:00:46 Nah, he uses the nick "elliott" 21:00:57 Evil me is much more confident than good me 21:01:04 14:22:42: SHOW SOME MAMMALIAN SOLIDARITY 21:01:12 Enjoy being locked in your mammal of solidarity. 21:01:39 ...eeew. 21:02:11 Phantom_Hoover: Hey, is that log the last appearance of lament here? 21:02:22 15:14:28: haskell is awful 21:02:22 15:15:08: hoogle is even worse than haskell 21:02:26 His final words. 21:02:47 The mouse got him. 21:03:03 And the olympic games were in OCaml 21:10:30 17:07:40: aAHAHAHAHVFAFVAOEKRHF 21:10:31 17:07:41: I HAVE IT 21:10:31 17:07:44: AHAHHAHAHAHAHAHAHAHAHAHA 21:10:39 The happiest five seconds of my life. 21:13:41 I may create a cellular automaton 21:16:29 pikhq: Actually I might be able to omit /usr entirely... 21:17:14 If everything is done per-user. 21:17:26 Although I suppose mounting the union to /usr is nicer than ~/.blah. 21:17:34 Hang on, I already HAVE created a cellular automaton 21:17:48 Ngevd: Cool, your work is done. Have a beer. 21:18:07 I just need to right it down 21:18:23 * elliott wrongs it up. 21:18:53 pikhq, there? 21:18:55 Oh no! 21:19:08 Now I need to right it down even further 21:19:28 I think it may become my first esolang not to be Turing-Complete! 21:19:34 Unless Numberwang isn't Turing-Complete 21:19:48 I suspect Numberwang may be harder to program in than Malbolge 21:20:16 numberwang the game show? or is there an esolang with the name numberwang too? 21:20:33 Two esolangs, actually 21:20:40 One of which sucks 21:21:40 The other of which is a brainfuck derivaitve 21:23:59 * pikhq is here 21:24:41 elliott: I kinda dislike /usr/, though. Admittedly, how you're using it is *much* better than most uses. 21:24:47 Namely, it makes *any sense at all*. 21:25:32 pikhq: The alternative is making / a unionfs. 21:25:36 Which, just... no. 21:25:41 True. 21:25:47 I may create a cellular automaton 21:25:48 Oh god. 21:26:16 I remember when elliott tried to create a CA that had relativity despite knowing nothing about either. 21:26:33 IT WAS GREAT 21:26:38 Relativity in a CA? 21:26:43 That would be really strange. 21:26:46 Awesome, but strange. 21:26:57 Not least because the Lorentz transformation is continuous. 21:27:06 Didn't that Mark guy already do it. 21:27:07 So... hmm. 21:27:15 The Wolfram guy? 21:27:18 Phantom_Hoover linked me to a thesis. 21:27:27 And I'm pretty sure that not having global time references would fuck up CAs. 21:27:41 elliott, yeah, by setting v=c at all times so that it doesn't require non-integral transforms. 21:27:41 pikhq, ah hi! tup question 21:27:52 Phantom_Hoover: Heh. 21:27:56 Si? 21:27:58 Phantom_Hoover: What did that end up with? 21:28:04 pikhq: I wonder if I can make /etc be /usr/etc instead :-) 21:28:17 elliott, photons moving around at c in 1D. 21:28:30 Phantom_Hoover: Exciting./ 21:28:31 elliott: Only thing barring you ought to be moronically hard-coded paths. 21:28:35 s/\/// 21:28:36 It simulated diffusion, and was terrible. 21:28:41 pikhq, lets say I have multiple build configurations. Like different compilers, different options or whatever. Any way to handle that with one source tree in tup? Preferably a single tup upd to update all of them 21:28:44 pikhq: It's probbly not a good idea, anyway. 21:28:55 The magnetisation and entropy ones were good, though. 21:28:57 pikhq: BTW, Fedora are working on unifying /bin, /sbin, /usr/bin and /usr/sbin into /usr/bin. 21:29:00 Vorpal: Nothing easy *at present*. 21:29:09 pikhq, ah okay. So there are plans? 21:29:14 Vorpal: Variants. 21:29:19 elliott, hm? 21:29:20 It's the next planned big feature. 21:29:23 ah 21:29:23 elliott: So close, and yet so far. 21:29:24 nice 21:29:25 Also allows debug builds. 21:29:31 well yes 21:29:38 debug vs optimised would be nice indeed 21:29:42 pikhq: Shrug, I think it's decent enough, because /usr contains stuff that can be shared. 21:29:46 pikhq: Stuff like /etc and /var can't be. 21:29:52 So if you unify those, /usr gains actual semantics. 21:30:22 I still feel like it'd be better to lose /usr. But whatever. 21:30:39 elliott, they still need /bin/sh. Because so many things would break without it. Anyway I thing that binfmt_misc might never even get stuff that starts with #! 21:30:43 not certain about that 21:31:01 Vorpal: /bin/ will probably be a symlink to /usr/bin 21:31:04 ah 21:31:05 that works 21:31:19 Vorpal: (a) They're doing symlinks, but I don't think there'd be as much breakage as you expect. 21:31:30 Vorpal: (b) ISTR testing it and it worked. 21:31:49 pikhq: It's also nice in that with that unification, /usr can be mounted read-only. 21:31:50 Vorpal: binfmt_misc goes before #!, IIRC. 21:31:58 pikhq: Whereas things like /var can't. 21:31:58 pikhq, ah good 21:32:10 So, it does have some semantics as a whole. *shrug* 21:32:16 Having both /bin and /usr/bin is criminally stupid, though. 21:32:16 elliott: Oh, so they're giving /usr actual semantics? 21:32:27 For a 6-state automaton using the Von Neumann neighbourhood, this is surprisingly tedious 21:32:28 "Things that can be shared and needn't be written to in normal operation"? 21:32:36 pikhq: Basically, "subset of distribution". 21:32:41 "Unix system resources" and all that. 21:32:50 Well, that's at least not devoid of a point. 21:32:51 elliott, it makes sense for boot stuff, when /usr is separate. I know that is not so popular these days 21:32:58 Vorpal: Nope 21:33:05 Vorpal: That doesn't work nowadays 21:33:08 elliott, well there is initramfs to mount /usr I guess 21:33:13 Because of udev, primarily 21:33:17 elliott, it still works on arch. barely. 21:33:29 Arch probably takes extra effort to make it work. 21:33:30 Vorpal: Except that the failures it causes are mostly silent 21:33:33 So you can't really know at all :-) 21:33:41 But yeah, we have initramfs so it's basically pointless nowadays. 21:33:49 elliott, it causes about 4 udev rules to fail, and no visible side effects from them 21:34:00 How reassuring! 21:34:03 elliott, anyway it is trivial to solve this from initramfs. Instead of mounting just /, mount / and /usr 21:34:10 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds). 21:34:12 that provides backward compat 21:34:12 Yes, obviously. 21:35:12 elliott, I'm going to write my own initramfs to do this. Should be trivial, throw in busybox, a few helper tools for raid, lvm and mounting as required, then write /init to mount / and /usr 21:35:24 I mean, it mostly works without initramfs for me currently 21:35:43 so unless having an initramfs disable some sort of fallback code in the kernel, it should be trivial 21:35:45 elliott: Hmm. Is Fedora also knocking out /lib? 21:35:59 I would assume so 21:36:01 (modulo ld.so?) 21:36:03 pikhq: That isn't in the specific plan I read, but they might be. 21:36:12 that is going to break a lot 21:36:17 Vorpal: Not really. 21:36:21 Vorpal: With a symlink? 21:36:27 elliott, well okay, that solves it 21:36:28 Even without, it wouldn't break much if you kept ld.so. 21:36:33 Vorpal: The only hard-coded library path, in general, is ld.so. 21:36:34 Note that Nix doesn't even have /lib/ld.so. 21:36:38 That's why they have elfpatch :P 21:36:51 elliott, so a binary from a different system won't even run on nixos? 21:36:57 That's why they have elfpatch :P 21:36:59 hm 21:37:05 will have to check that out 21:37:13 It safely rewrites the dynamic linker and RPATH. 21:37:16 Of an ELF. 21:37:46 elliott iirc it is quite hard to add RPATH unless there already is one there 21:37:56 I'm NOT going to switch unless nwn and so on work flawlessly 21:38:09 Vorpal: It handles growing the ELF; and nobody cares what you switch to. 21:38:15 Also, chroots exist. 21:38:59 I feel cfunge is ready to go autoconf (this will require replacing a lot of custom cmake code, like checking for warning flags and what not)+tup once variants are supported 21:39:23 cfunge hasn't even seen a release for three years, to my knowledge. 21:39:41 elliott, nor has tup. It is fetch from vcs now 21:40:30 Meanwhile, I'm thinking about using a zipper for shiro's fungespace. 21:41:12 elliott, hm interesting 21:41:25 elliott, which package on nixos is elfpatch in 21:41:38 http://nixos.org/patchelf.html 21:41:46 But I would presume "patchelf". 21:41:54 ah you said elfpatch above 21:41:55 not patchelf 21:42:07 Is there a tool where you can give it some examples of what a cellular automaton does and it tries to figure it out? 21:43:31 -!- wareya has joined. 21:43:54 Ngevd: a brain 21:44:11 -!- wareya has left. 21:44:33 elliott, where can I get one? 21:44:54 Try having kids. 21:45:22 Asexual, remember 21:45:39 I'll have to adopt 21:46:16 Yes that was the: joke. 21:46:25 Where did PH go. 21:46:32 I presume bed 21:46:43 I've found a bit where I don't know what would happen... 21:47:19 -!- Phantom_Hoover has joined. 21:49:30 Okay, my solution makes the initial state "X" in a field of " " stable. 21:49:37 Ends up in a four-tick cycle 21:50:43 Okay, this cellular automaton is pretty lame 21:50:49 No spaceships, no guns 21:51:05 No steamboats 21:51:58 You can't know that. 21:53:06 No character makes more life than is needed to create it 21:53:39 There are cases where life can be destroyed 21:53:54 fair enough 21:54:06 So, I think I /can/ know that 21:54:19 The spaceship one is just a conjecture 21:54:21 I thought you just tried a few configurations and decided that :P 21:55:44 Is Conway's game of life Turing Complete when on a hyperbolic plane? 21:59:19 I'm going for "Probably" 22:08:58 -!- wareya has joined. 22:09:02 -!- wareya has left. 22:11:57 pikhq: Wait have I even told you about the best part of my Kitten design YOU ARE SO MISSING OUT 22:14:41 I think I may have a finite Morphy number 22:19:47 -!- wareya has joined. 22:19:58 -!- wareya has left. 22:20:00 I just did a game of Q20, trying for "Befunge" 22:20:03 It got "Email" 22:22:44 Got Chess set in 18 questions 22:23:36 Ngevd, Q20? 22:23:42 20q.net 22:24:54 ah 22:25:07 elliott: I don't think so. 22:25:26 pikhq: The package manager is the service manager. 22:25:31 Ah, right. 22:25:42 Wait did I tell you that. 22:25:46 I so don't remember telling you that. 22:25:48 Because it is the best idea. 22:25:53 You talked about it rather a lot. 22:25:57 DAMN 22:26:00 I gotta get something new 22:26:10 Did I mention I was considering making the package manager teh build system too??? 22:26:21 What's Kitten? 22:26:24 No, but it seems only natural if you're going to do things right. 22:26:39 Ngevd: http://www.google.co.uk/search?gcx=w&q=kitten&um=1&ie=UTF-8&hl=en&tbm=isch&source=og&sa=N&tab=wi&biw=1366&bih=675&sei=%208XGwTujlBMfHsgbSzOh_ 22:27:54 -!- evincar has quit (Quit: ChatZilla 0.9.87 [Firefox 7.0.1/20110928134238]). 22:29:37 Kitten would get on with friendship mouse, methinks 22:35:09 -!- Madoka-Kaname has changed nick to Lymia. 22:35:09 I think I may have a lower than average Morphy number 22:36:39 Lymia... sounds oddly familiar 22:37:30 Morphy number 22:37:48 Ngevd, Lymia was what she was called originally. 22:37:52 Oooh 22:38:03 A Morphy number is a bit like a Bacon number, but with Chess 22:38:07 Ah. 22:38:29 But it's to someone who lived in the 1800's 22:38:39 So people generally have bigger Morphy numbers 22:39:09 What they should do with these is, whenever 0 dies, everyone's number decreases by one. 22:39:19 That'd be more sustainable :p 22:39:48 I played an IM at chess once 22:39:52 I lost really badly, ofc 22:40:21 but it probably means I have a reasonable Morphy number 22:40:29 But my uncle taught someone how to play chess, who ended up being really good 22:40:31 as IMs and GMs have a tendency to all play each other 22:41:00 I think he ended up being Australia's second Grand Master or something 22:41:31 So, maybe in terms of chess, I have a low ais523 number 22:44:29 I wonder how high my cpressey number is 22:44:48 In terms of esolangs collaborated on 22:45:10 Infinity. 22:45:19 (Have you collaborated with anyone?) 22:45:32 Sort of not really zzo38 22:45:51 I don't think one can be said to collaborate with zzo. 22:46:30 There needs to be more esoteric collaborations 22:48:23 oerjan helped a lot with Numberwang 22:51:32 -!- centrinia has joined. 22:51:52 -!- copumpkin has quit (Quit: Computer has gone to sleep.). 22:52:12 * Phantom_Hoover → sleep 22:52:13 -!- Phantom_Hoover has quit (Quit: Leaving). 22:53:57 Hello centrinia 22:54:07 Hello Ngevd. 22:54:26 hi 22:54:28 `welcome 22:54:30 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: welcome: not found 22:54:36 there, that's a great welcome 22:54:38 `?welcome 22:54:40 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: ?welcome: not found 22:54:57 `? welcome 22:55:00 Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page 22:55:09 Thanks. :) 22:55:21 let's just do that to centrinia every time they come in 22:55:28 typos included? 22:55:30 yes! 22:55:34 it's becoming tradition 22:55:47 how many times has it happened? 22:55:49 more than 1? 22:56:01 well, i think i messed it up yesterday too 22:56:08 might be wrong 22:56:40 With a very loose definition of "collaborated", I have a Pressey number of 3, I think 22:57:35 I collaborated with rjan Johansen on Numberwang 22:57:54 rjan Johansen collaborated with Ben Olmstead on Malbolge Unshackled 22:58:03 FSVO collaboration 22:58:14 Ngevd: you poor man 22:58:35 Ben Olmstead collaborated with Chris Pressey on Wierd 22:58:44 Okay, only the last of those really counts 23:00:43 hmm, I don't really have many esolang collaborations, I'm more of a solo esolanger 23:00:49 Also, "FSVO"? 23:00:53 Oh yes 23:01:30 With a very loose definition of "collaborated" 23:02:40 oh i forgot to mention, my erds number is now 4 23:03:03 oklopol: wow! do you know the chain? 23:03:26 me, jarkko kari, christopher morre, leonard j schulman, erds 23:03:32 *moore 23:03:46 -!- pikhq_ has joined. 23:04:06 -!- pikhq has quit (Ping timeout: 258 seconds). 23:04:09 i actually solved some of moore's open problems at some point so maybe he'd be interested in collaborating 23:04:25 just because i'd have 3- 23:04:27 *. 23:05:20 oklopol: hope you get to 0 someday 23:05:49 (you have to exhume erdős' grave, then use alchemical voodoo to merge his spirit and corpse with yours) 23:06:08 oh hmm i guess technically i'll have an erds number on 21., it's http://www.springer.com/computer/theoretical+computer+science/book/978-3-642-24896-2 23:06:09 "alchemical voodoo"? 23:06:11 (this has only been done three times in history, each time being swiftly followed by the murder of the mathematician involved) 23:06:52 Gregor: Ping :-P 23:06:56 they don't even mention my name anywhere in there, fuckers 23:07:26 (BY THE MATHS POLICE!!!!) 23:07:49 :( 23:08:50 I still think there should be more esolang collaborations 23:08:54 Who wants a Pressey number below 5? 23:09:12 i'm fine with an oklopol number of 0 23:10:49 I have an oklopol number of 1 23:11:05 which one are you counting 23:11:10 Clue (oklopol version) 23:11:16 ah yes 23:11:22 certainly 23:11:58 but even better, that means i have wolfram number 2 23:12:38 oklopol: no no no, you mean gamma 23:12:53 wolfram alpha is actually just wolfram himself chained to a computer 23:13:07 ais523\unfoog: wait, how was that a collaboration? 23:13:09 moving the page? :P 23:13:12 hmm, the only collaboration with Wolfram /himself/ that I've done is pointing out a bug in his proof for the 2,5, and fixing it 23:13:18 elliott: pm stuff 23:13:19 elliott: we discussed it in PM a lot 23:13:24 -!- Ngevd has quit (Ping timeout: 255 seconds). 23:13:24 ah 23:13:37 that must be why it sucked so much before i got to it OH BURRRRRRN 23:13:43 thank you all yr. welcome 23:13:45 :DDDDDDDDDDDDDDDDDDDDDDDDDDDDD 23:13:49 i'm here all week 23:14:48 Underload is going to be my best esolang ever, isn't it :( 23:15:07 ais523\unfoog: most likely. 23:15:12 ais523\unfoog: you will spend the rest of your life trying to surpass it. 23:15:29 on your deathbed people will offer comfort. no, no, feather "failed prototype version" was very good. 23:15:31 but they lie. 23:15:31 * oklopol resists making a feather joke 23:15:32 it's all lies. 23:15:34 :'( 23:15:40 elliott: ...? 23:16:00 oklopol: I think all the good feather jokes have been done 23:16:00 Gregor: hi Gregor 23:16:21 feather <<= /dev/null 23:16:23 * oklopol wonders if that's a feather joke 23:16:26 there, that got rid of it 23:16:32 Gregor: Re cunionfs: 23:16:32 or would, if I had feather working 23:16:32 20:28:27: Gregor: I /think/ I need a way to rewrite the list of union branches while a process runs (i.e. not env-var-based). 23:16:32 20:28:46: Gregor: Because when a package is installed, the user's session should see it as part of the hierarchy without a reboot :P 23:16:32 20:29:29: Since I have per-user package installations, I think the simplest way is just to let me say, I dunno, CUNION_BRANCHES_FROM_FILE=/some/path, and that's read whenever the list of branches is required. But it would be nice if it only re-read the list of branches when I told it they changed, because reading them every FS operation sounds slooow. 23:17:15 Yeah, I had considered ways of communicating changes at runtime. I was thinking about a sysfs-esque pseudofile. 23:17:49 Gregor: Right. The problem with having one file per process is that I'd have to write to hundreds of fakefiles /atomically/. 23:18:08 Which is impossible :P 23:18:43 Gregor: I guess a simple way to do it is to start most processes set to inherit the branches from their parent? 23:18:59 Then I'd just have to rewrite the branch list of their login shell or whatever, which could be done atomically. 23:19:09 Just wondering about ways to do it. 23:19:43 My thought was basically just replacing the way the env var works with the pseudofile. If you don't touch it, you inherit it from your parent, otherwise you can change it at any time. 23:19:48 That's the UNIX way, after all. 23:20:51 Gregor: I thought the inheritance was done by just inheriting the env var at startup time in the current thing. 23:20:51 I was thinking the file would contain either "inherit" or a list of branches, and start at "inherit" unless started in some special way. But yeah, whatever works. 23:21:05 As long as I can replace the branches of a process tree atomically :P 23:21:17 Well, remember the pseudofile is a PSEUDO-file. It doesn't have file semantics. 23:21:25 Right. 23:21:52 Gregor: I know aufs does stuff in /sys/fs/aufs/, I think. 23:23:18 Gregor: Anyway, yeah, it would be super-great and I'm willing to help out however but I'm probably limited by having no experience with kernel modules at all :P 23:24:45 Gregor: Out of curiosity, how would you start a process with a different branch set with that model? Would it be sourced from an env var if present (defaulting to inherit) to start with? 23:27:33 I would say you'd have to fork, then change the file, then exec. 23:27:43 -!- copumpkin has joined. 23:27:48 I'd like to keep it as simple as possible without making security impossible :P 23:28:14 Right, that'd be reasonable. 23:29:37 * elliott doesn't actually know how much flexibility you have with files in Linux. 23:29:44 Would it just be a case of "changes only take effect on close()"? 23:30:31 -!- sllide has quit (Ping timeout: 276 seconds). 23:30:51 Yeah, otherwise it would be really difficult to know when you care or not. Or it could be exposed as a character device instead of a block device and be per-line or something. 23:31:51 oh, wow, it's a binary day 23:32:46 ais523\unfoog: 2 is not a binary digit and it won't be a binary for 7,989 years. 23:32:51 *a binary day 23:33:11 Gregor: Lazy people use 2-digit years. 23:33:12 Gregor: isn't the century/millennium normally omitted? 23:33:18 Gregor: Per-line breaks paths with \n :) 23:33:25 * elliott would just NUL-separate it. 23:33:25 01-11-11 :) 23:33:31 otherwise, binary days aren't likely to happen ever because binary wasn't invented in 1111 and probably won't be in use by 10000 23:33:46 NUL-terminate, rather. 23:34:08 ais523\unfoog: weird definition of probably, also of happen 23:34:10 ais523\unfoog: "Probably"? I'd say that the year 10,000 is too far off for us to even say that much. 23:34:19 elliott: Either way, I think enact-on-close makes sense, though I wonder how it interacts with fopen/fclose (probably just fine) 23:34:25 we will be using unary 23:34:29 I'd go with "and we can't even make guesses about 10,000" 23:34:32 Gregor: Yeah, it seems reasonable. 23:34:49 Gregor: I'm just super-paranoid about atomicity wrt inheriting from the parent process, but I guess it'll all work out fine. 23:35:04 (As opposed to my only moderate paranoia about performance :P) 23:35:23 elliott: It just has to be atomic w.r.t. exec ... 23:35:44 Gregor: No. Consider mutating a parent process. 23:35:48 The child process has to inherit those changes. 23:39:31 Gregor: Or were you intending inheritance to only inherit from the values present at fork-time? 23:41:21 Uhhhhhhh, only at fork time. 23:41:34 Good lawd, I'm not trying to communicate some whole hideous tree here ... 23:41:46 I was going to have one global master, the per-process. 23:41:50 Erm 23:41:53 I was going to have one global master, then per-process. 23:42:48 Gregor: The problem is, like I said, that I need atomic updates... 23:43:30 Gregor: The user's login shell has 10 child processes in a tree; one of them has its own branch list, but the rest are inherited. I need to update the login shell's branch list /and all its inheriting childrens' branch lists/ atomically. 23:44:06 I think your process-tree model is making things needlessly complicated. 23:44:14 Two ideas: 23:45:14 1) You have a global configuration, per-user configuration, and per-process configuration. Per-process configuration is inherited as described, global and per-user are both inherited atomically when the relevant configurations are changed (it doesn't have to be particularly atomic to guarantee these semantics, it just has to invalidate a bunch of caches). 23:45:49 Hmm, what if I had the login shell's union list be /some/other/union 23:45:54 Had the rest inherit from that 23:45:56 2) Per-process configuration, where entries can be paths /or/ some way to specify inheritance. 23:45:56 -!- ais523\unfoog has quit (Remote host closed the connection). 23:45:58 And just modified /some/other/union's branch list 23:46:07 Oh, that's interesting. 23:46:12 3) What you just said :P 23:46:20 Gregor: (2) seems nicer to me than (1), though; it's inherently more flexible :P 23:46:30 Hmm 23:46:35 (3) seems nicer to me than (2), as it fits the model better. 23:46:51 Gregor: Actually, (4): Instead of a branch list, /every/ process just has a pointer to a branch list. 23:46:57 The branch list is an atomically-modifiable pseudofile. 23:47:06 That gives (3) without duplicating mounts all over the place. 23:47:21 But it doesn't give you inheritance if you also have changes. 23:47:23 And the pointer is inherited, etc. 23:47:30 Gregor: Yes it does: you just modify the branch list. 23:47:34 Everything pointing to it gets the updates. 23:47:54 I mean this: 23:48:27 B is a child of A. B adds /foo to its branch list, but it doesn't want to change A's, so it just makes a new one and sets it to the content of the original plus /foo. Now A changes its branch list, but B can't see the change. 23:48:47 -!- Vorpal has quit (Ping timeout: 240 seconds). 23:49:18 Do you have a usecase for that? :P ...oh, I just thought of one: you say: 23:49:27 $ with 'gcc == 3.*' sh 23:49:30 [subsh]$ do-thing 23:49:33 done 23:49:39 [at this point, some other library is updated in the host system] 23:49:45 [subsh]$ do-another-thing 23:49:51 [...but do-another-thing is still using the old version! this sucks] 23:49:58 Gregor: So yeah, I agree that's desirable. 23:50:02 Yeah, I don't think it's such an unimaginable situation, and (2) and (3) both give you that. 23:50:10 Gregor: BUT, B also has to be able to /remove/. 23:50:19 Because the shell from which "with" is run has its own gcc in scope. 23:50:24 Yes, and I'm not sure how to handle that in any of these semantics. 23:50:34 So the subsh has to have "remove , add ", but what if you upgrade the outside gcc while it's still running? 23:50:53 Bleh ... remove by pattern match? *brain axplote* 23:51:38 Gregor: Hideous :P 23:51:50 Gregor: What I /really/ need is to have my package manager calculate the branch lists :P 23:52:09 Gregor: But, ehh... OK, how about this: Every process has an explicit, mutable, no-inheritance list of branches. 23:52:24 -!- tiffany has quit (Quit: Leaving). 23:52:27 Gregor: /But/, instead of updating on close(), you "queue up" PIDs to update the branch lists of in another file, then close that. 23:52:30 The updates happen atomically. 23:52:44 That way, I can just recalculate the branches for all the constraints and the like, and update 'em atomically. 23:57:07 Gregor: (I'm aware this is kind of ugly :P) 23:57:22 Gregor: Oh, wait, it can be ten times simpler than that... just have a file where you open, write a pid, write a list of branches, repeat, and it commits on close(). 23:59:03 That makes inheritance with changes possible, but massively difficult ... 23:59:22 Gregor: No? The whole point is that an external package manager is going to be calculating which directories to add. 23:59:32 Gregor: So if you do "with 'gcc == 3.*' ...", it'll store that that process wants gcc == 3.*. 23:59:46 Whenever the global package DB is updated, it just calculates packages + constraint --> branches again and writes 'em all out. 23:59:53 It already has to do that logic in the first place. 2011-11-02: 00:03:06 Gregor: I mean, it's more work on whatever's driving cunionfs, but I think achieving the same without something this generic is basically impossible. 00:09:12 -!- pikhq has joined. 00:09:21 -!- pikhq_ has quit (Ping timeout: 248 seconds). 00:22:26 elliott: About how easy do you think creating a package is going to be with kitten? (please say trivial) 00:22:51 pikhq: Like, three, four lines for a GNU package? 00:23:12 Add another one to that if it's "GNU-ish" (autotools and the like) but not a GNU package (so you have to specify a tarball location). 00:23:20 So yeah, trivial. 00:23:31 So, nothing obscene like ebuilds, or Debian. Good. 00:24:26 I mean, it'll get longer if you specify your own configuration options and the like (packages have configs in Kitten). 00:24:39 And a little longer if there's a service. 00:24:55 And /ideally/ if there's configuration you should expose that so it can all be done in a unified manner, but... 00:25:00 Yeah, four lines for simple stuff. 00:35:16 # For UML and non-PC, just ignore all options that don't apply (We are lazy). 00:35:16 ignoreConfigErrors = (userModeLinux || stdenv.platform.name != "pc"); 00:35:16 Pro 00:46:59 -!- oerjan has joined. 00:55:38 hi oerjan 00:55:44 hi elliott 00:58:03 hi oerjan 00:59:03 hi elliott 00:59:19 -!- pikhq_ has joined. 00:59:24 hi oerjan 00:59:29 -!- pikhq has quit (Ping timeout: 258 seconds). 00:59:39 hi oerjan 00:59:50 no uyuo ruined it 01:00:00 hi shachaf 01:00:07 Bah, that uyuo. 01:00:22 such a spoilsport 01:03:17 the mezzacotta comic is ominous today. 01:07:16 hi shachaf 01:07:24 oklopol hi 01:07:36 elliott: hi 01:07:45 hi 01:17:39 elliott wins 01:18:22 -!- Sgeo|web has joined. 01:26:00 Man. There's organizations advocating the use of romaji or kana for Japanese writing exclusively. 01:26:13 They themselves publish their material in standard Japanese script. 01:26:18 FAIL 01:28:39 well if they published it in more than one form it would be ok... 01:29:12 it's hard to do marketing if the audience doesn't understand you :P 01:29:42 Essentially every Japanese speaker can read romaji or kana. 01:30:18 as easily as standard format? 01:30:36 Romaji is just the Latin alphabet, as used for romanization of Japanese, and kana is the phonetic script used in Japanese, in conjunction with Chinese characters. 01:31:09 or wouldn't be sort of like funetikal inglish, wer yu kan rid it but it is slow an awkward? 01:31:16 *it be 01:31:37 It'd be slow and awkward like funetikal inglish, yes. 01:31:52 For much the same reasons, in fact. 01:32:29 mhm 01:32:54 oh good point 01:32:58 Except, of course, that romaji and kana are actually *taught* in public education, as knowledge of both are necessary for literacy. :) 01:33:27 i press half- 01:33:29 baked 01:33:36 then realize this is the best comic ever 01:33:37 http://www.mezzacotta.net/archive.php?date=1281-04-18&vote=3 01:34:16 oh no you made me vote 3 01:34:42 i did? 01:34:58 It also doesn't help that the current linguistic trends are in the *opposite* direction from what they advocate. Japanese is slowly but surely increasing the amount of kanji used. :) 01:35:07 either that or it just said "thanks for helping us bake this comic" 01:35:10 maybe it's just weird 01:35:21 oh lolol 01:35:37 yeah don't press that link ppl :D 01:35:38 better clip off the part from & on 01:35:54 http://www.mezzacotta.net/archive.php?date=1281-04-18 BETTER LINK 01:35:56 http://www.mezzacotta.net/archive.php?date=1281-04-18 BETTER LINK 01:35:56 http://www.mezzacotta.net/archive.php?date=1281-04-18 BETTER LINK 01:35:56 http://www.mezzacotta.net/archive.php?date=1281-04-18 BETTER LINK 01:36:02 JUST IN CASE 01:36:09 SOMEONE READS THE LOGS IN ORDER 01:36:42 i'll balance it out with a 2 >:) 01:36:58 nnnnnooooooooooooooooooooooooo 01:41:31 http://www.mezzacotta.net/archive.php?date=1748-04-04 01:43:57 yes good 01:46:45 isn't that from the hall of fame, istr it or a similar one 01:47:56 indeed it is 01:57:56 * oerjan smells a monthly windows update check 02:08:27 -!- Lymia has quit (Remote host closed the connection). 02:17:47 hm or not 02:29:52 -!- Madoka-Kaname has joined. 02:29:52 -!- Madoka-Kaname has quit (Changing host). 02:29:52 -!- Madoka-Kaname has joined. 02:36:14 elliott: Please note that I also have no experience with kernel modules :P 02:42:20 Gregor: Oh dear :P 02:42:54 Gregor: That's especially worrying considering that unionfs and aufs are both large codebases :P 02:43:38 Well. 02:43:41 Not that large, but still. 02:46:15 Frankly I don't think it would be wise to start from an existing codebase. Dynamic per-process union is in some ways fundamentally different from static (or changeable only for all processes) per-system union ... 02:48:09 Gregor: Oh yeah I totally agree 02:48:15 Gregor: I'm just saying, hard task :P 02:48:26 Gregor: OTOH it's likely that the existing solutions are filled with cruft and overcomplication. 02:48:34 So it's probably not worth worrying too much about it :P 02:51:09 But yeah, if you have any ideas for atomic branch-changing of multiple processes that'd be nice, since the only interfaces I can think of are kinda ugly... 02:56:26 * Gregor googles for "how to write a kernel module", because that's how he rolls. 02:58:19 -!- Darth_Cliche has joined. 02:59:49 it's the dark side of bad writing! 03:00:28 Gregor: Doesn't the kernel come with docs on that :P 03:01:35 elliott: Yeah, and that was the first Google result! 03:01:50 Gregor: You forgot to append "for dummies". 03:02:03 I would buy "Linux Kernel Module Writing For Dummies". 03:02:50 X-D 03:03:10 I seem to recall once having a book titled The Idiot's Guide for Dummies. 03:03:28 Brain Surgery for Dummies 03:03:52 It's easier than when you're working on a smart person's brain. 03:06:13 I was thinking that maybe outside package updates /shouldn't/ propagate into a "with " context after all because the libblah version changing mid-build is not what you want. But I think that's wrong because, well, it's your own fault for upgrading while running a build outside of the system. 03:06:26 So yeah, still needs more logic than a simple "this but with more directories" system. 03:16:17 -!- Sgeo|web has quit (Ping timeout: 265 seconds). 03:20:54 -!- MDude has changed nick to MSleep. 03:37:31 -!- centrinia has quit (Quit: Leaving). 03:43:38 pikhq_: There's no way to change gcc's default flags easily, right? 03:43:45 At least I gather that modifying spec files is a huge pain 03:46:25 Just spec files. 03:46:52 Though it's actually not that hard to modify a spec file after the GCC build is done. 03:46:57 It's just a text file. 03:47:55 pikhq_: Hmm... where's it stored? 03:48:06 Gregor: What about The Complete Idiot's Guide to Dummies? 03:49:33 oh hm 03:50:01 elliott: $prefix/lib/gcc/$tuple/$version/specs 03:50:17 http://www.amazon.co.uk/Complete-Idiots-Guide-Dummies-Stupidity/dp/1580081746 03:50:24 pikhq_: ls: cannot access /usr/lib/gcc/x86_64-unknown-linux-gnu/4.6.2/specs: No such file or directory 03:50:33 By default, a spec file is not actually installed there, and gcc uses one that's compiled in; use -dumpspecs to get that. 03:50:42 Ah. 03:50:43 However, if the spec file *is* there gcc uses it instead. 03:50:48 %{!fsyntax-only:%{!c:%{!M:%{!MM:%{!E:%{!S: %(linker) %{!fno-use-linker-plugin:%{flto|flto=*|fuse-linker-plugin: -plugin %(linker_plugin_file) -plugin-opt=%(lto_wrapper) -plugin-opt=-fresolution=%u.res %{!nostdlib:%{!nodefaultlibs:%:pass-through-libs(%(link_gcc_c_sequence))}} }} %{flto|flto=*:% %{!nostartfiles:%S}} %{static:} %{L*} %(mfwrap) %(link_libgcc) %o %{fopenmp|ftree-parallelize-loops=*:%:include(libgomp.spec)%(link_gomp)} %(mflib) %{fsplit-stack: --wrap=pthread_create} %{fprofile-arcs|fprofile-generate*|coverage:-lgcov} %{!nostdlib:%{!nodefaultlibs:%(link_ssp) %(link_gcc_c_sequence)}} %{!nostdlib:%{!nostartfiles:%E}} %{T*} }}}}}} 03:50:53 I... 03:51:08 Okay, so it's a bit obtuse because they stick a lot of logic in it. 03:51:20 a paragon of readability 03:51:29 Like, this is how they actually implement many of the flags. 03:51:44 http://sprunge.us/IDUC 03:51:47 It's... not too bad. 03:52:08 pikhq_: How portable are the built-in files? 03:52:10 One per architecture? 03:52:25 Just wondering how I could /generically/ modify one in a portable package... 03:52:55 elliott: The built-in spec file is basically a generic file with a few arch-specific bits filled in. 03:53:02 Right. 03:53:15 For instance, the path to the dynamic linker, and the m64/m32 logic. 03:53:38 Is there a way to override the path to the dynamic linker at some stage /before/ mucking with spec files? :P 03:53:56 Yes, but that's mucking with GCC source instead. 03:53:56 I suppose that's a binutils thing too... (for ld(1)) 03:54:08 pikhq_: Suxx 03:54:19 How do I do it for ld(1) :P 03:54:42 ld(1) is ignorant of it. 03:55:39 Its only knowledge of the dynamic linker comes from an argument to it. 03:56:04 pikhq_: Huh, I thought it could link without specifying that... 03:56:27 You *really* are not meant to call ld directly. 03:57:51 OK, I guess I can make this work then. 03:58:07 23:55:52 < pikhq_> You *really* are not meant to call ld directly. 03:58:09 what 03:58:28 coppro: For general-purpose "building a normal program" use, I mean. 03:58:50 Obviously, if you're doing, well, anything more complicated then you should. 03:59:31 i like how coppro quoted something literally two lines up 03:59:54 Probably the best example of a good time to use ld is building a kernel. 04:00:25 Though I suppose you *could* go through the compiler frontend there, it's really acting as a giant no-op. 04:02:17 coppro: Tell me clang has a better way to modify this shit than spec files 04:08:53 pikhq_: -ffreestanding, dawg 04:09:35 Gregor: BAH 04:09:59 Hmmm, I wonder if I am sold on Nix's runtime dependency model 04:10:44 It doesn't have any false positives, but I'm not entirely convinced it has no false negatives either 04:12:13 I solved the atomic branch change problem Gregor, you just need to write it as an @ module and you'll get atomicity FOR FREE :| 04:12:18 * elliott helpful 04:27:46 elliott: I don't know what spec files are 04:27:49 so I dunno 04:28:11 coppro: How'd I build clang to use a different path to the dynamic linker 04:28:20 Specs files are http://sprunge.us/IDUC :P 04:33:39 elliott: oh, ok, not quite that bad I don't think 04:33:42 but kinda bad 04:34:00 I think Driver/Driver.cpp or DriverOpts or something is where that is processed 04:34:03 it's all hardcoded 04:34:29 coppro: well it's easy with gcc too if i patch the source :P 04:44:06 pikhq_: Bah, I might need to make / a unionfs after all 04:45:20 -!- DCliche has joined. 04:47:28 -!- Sgeo|web has joined. 04:48:48 -!- Darth_Cliche has quit (Ping timeout: 260 seconds). 05:00:45 "the C library function system() has a hard-coded reference to /bin/sh." 05:00:47 glibc, friends. glibc. 05:02:13 so very glib, c 05:02:32 Hey, who has libc.so ? 05:02:41 ssssssssssssh 05:02:48 we don't talk about that here 05:02:55 hey Gregor ;D 05:03:50 elliott: Hmm. I'm not sure what it could do other than be compiled with a reference to the shell. 05:04:02 Admittedly, it should be a configuration option. 05:04:33 -!- Patashu has joined. 05:05:04 What happened with libm.so, that's Gregor's right? 05:19:18 Nope, I have libdl.so. 05:20:18 -!- bd_ has quit (Ping timeout: 260 seconds). 05:20:23 -!- bd_ has joined. 05:46:17 -!- DCliche has quit (Quit: You are now graced with my absence.). 06:02:28 Yay, I think the Secret Project actually does help me immensely. 06:02:38 This is worrying; I now depend on both ais523 and Gregor. 06:11:38 oerjan: you should really look forward to the near future, wherein you get to deal with me implementing a lazy functional language from scratch 06:11:39 >:D 06:12:02 i can help a lot with laziness, yes 06:12:49 oh snap.e 06:14:03 wow oerjan is snape my typoes lead to discoverieres 06:15:44 man tcb passwords will fit so well with this system. so well. 06:17:12 hmm! since nix is like a functional make, i wonder what a functional tup would look like... oh ... wait ... oh god 06:17:18 pikhq_: tup is the upstart of build systems 06:18:40 pikhq_ quick be mortified with me 06:18:59 Oh. Dear. 06:19:22 It is literally based on the events-over-dependencies model oh god tup cannot handle only building some targets. 06:19:40 oerjan I need to get very, very drunk help me out here do you have alcohol in Trondheim I have booked a plane ticket. 06:20:33 elliott: Actually, tup can handle only building some targets. 06:20:48 pikhq_: How? 06:21:12 I have no idea on the implementation details, but "tup upd foo" will only build foo and its dependencies. 06:21:37 pikhq_: I suspect it marks what targets every target "contributes" to in the DB. 06:21:51 Which is... just an emulation of the dependency model, fast only because it's cached. 06:23:13 elliott: sure, it's just ten times as expensive as in england, is all 06:23:32 oerjan: oh don't worry. i won't be needing my money any more. 06:24:13 o kay 06:24:18 @ask ais523 How does the Secret Project handle scheduling being non-deterministic? 06:24:18 Consider it noted. 06:24:45 @ask ais523 Also, what kind of incredibly rough time estimate would you give for an open-source release of working code? 06:24:46 Consider it noted. 06:28:45 oerjan: btw i am dead serious about looking forward to the near future. you are going to have so much fun. 06:29:12 >:D >:D >:D> :D>:D> :D> :SD: S:A"|D: AS"|d; 06:30:21 zombie smilies 06:31:28 noooo nixos-jfp-final.pdf is so short i have already read it all 06:31:34 you betrayed me paper 06:31:58 elliott: http://thepiratebay.org/torrent/6554331/Papers_from_Philosophical_Transactions_of_the_Royal_Society__fro 06:32:01 have fun. 06:32:16 too big........ 06:32:48 CAN'T HAVE YOUR CAKE AND EAT IT WAIT WHAT THAT MAKES NO SENSE. 06:33:26 http://content.yieldmanager.edgesuite.net/atoms/5a/10/ce/6b/5a10ce6be873ac8fc50583ea7bddb9.jpg ;; this ad.................. 06:33:36 GET YET GENETICALLY MODIFIED WOMEN WITHOUT THE ABILITY TO SAY "NO" 06:33:40 s/YET/YER/ 06:33:58 elliott: I'm sorry but my internet is adfree 06:34:07 you're missing out on so much 06:34:11 ads have become truly surreal lately 06:34:19 in fact, when I try to pull up that image in a tab by itself 06:34:24 adblock removes it. 06:34:27 so I clicked that 06:34:33 it's trying to make your life worse. 06:34:35 and it turned into a blank tab. so I had to refresh rapidly to see it. 06:35:29 elliott: I don't know it's pretty nice. I go to websites and only see typical internet shit 06:35:45 instead of all this other, lower-quality internet shit around the top, bottom, and sides. 06:36:12 I kind of forgot that thepiratebay had ads, actually. 06:36:32 does facebook have ads? 06:36:54 a few. 06:37:41 man, they're still trying to prosecute aaron swartz? 06:37:55 prose. cute. 06:38:02 CakeProphet: ? 06:38:13 that's how I read prosecute after looking at it again. 06:38:35 heh 06:39:11 Aaron Swartz is a heroic swashbuckler of the internet. 06:39:35 you're thinking of guybrush threepwood 06:42:28 ...who? 06:42:40 Cake "too lazy to google" propoojweijwei2kker 06:43:17 uh 06:43:33 anyone who doesn't know who guybrush threepwood is lives a very sad life 06:43:39 and needs to play the first two monkey island games 06:43:52 nah 06:43:56 (third is decent, laters are crap) 06:44:01 * CakeProphet plays CALL OF DOOTY BLACK OP ZOMBIES FUCK YEAAAAAH 06:44:05 CakeProphet: no. you _really_ need to. 06:44:07 also dwarf fortress. 06:44:24 ron gilbert is judging you. tim schafer is judging you. 06:44:27 feel their judgment. 06:44:38 ouch. 06:44:54 i even heard a mutter from schafer. he thinks you probably haven't even played grim fandango. i don't think he likes you any more, CakeProphet/. 06:45:05 incidentally snake is the best game ever made. 06:45:09 but only with no walls. 06:45:15 and wraparound screen. 06:45:33 it's a fascinating and telling metaphor for hubris. 06:47:12 the walls ruin the game completely. 06:47:37 as it confines you. it's no longer just about your vainglorious lust for little square pixel foods. 06:48:01 Seriously though anyone who hasn't played the first two Monkey Island games has lead an incomplete life. 06:50:52 CakeProphet thinks I'm joking; I'm not joking. 06:52:50 elliott: did you play amazon trail? 06:52:57 that game was better. 06:53:13 CakeProphet: I'm going to rip your limbs apart. 06:53:27 RIP YWROUIER;SDF WEHT LIMBS FKGOP 06:54:06 The score largely consists of reggae, Caribbean and dub-inspired music. 06:54:23 * CakeProphet lights a blunt and plays some Monkey Island. 06:55:02 oh, new homestuck. time to sleep. 06:55:16 wat 06:55:17 CakeProphet: play the secret of monkey island for fuck's sake. download scummvm. you can find the thing on any site. get the cd version so you get the mt-32 score. 06:55:22 do it. 06:55:35 I'll totally do that, howeve 06:55:35 r 06:55:42 I will not tell you anything about my gameplay experience. 06:58:49 -!- monqy has quit (Quit: hello). 07:00:19 -!- elliott has quit (Ping timeout: 276 seconds). 07:01:03 sometimes I feel like dedicating my whole life to the creation of perfect video games. 07:05:28 for example 07:05:35 Blind Psychic Kung Fu Master 07:05:43 in which you play a... blind psychic Kung Fu master. 07:06:07 you play the game entirely with audio cues. 07:06:52 you also have sound-based psychic senses that you can use, like sonar. 07:08:58 also a slow-motion power in which you fine-tune your highly trained kung fu master reflexes for a brief while. 07:09:58 also but there will be spectacular epic fight cutscenes. 07:10:07 with no graphics. 07:12:24 I guess there could be some kind of helpful visual interface. 07:12:31 but the idea would be that the entire game is playable by a blind person. 07:14:24 CakeProphet: Epdeet 07:14:27 Updoot 07:14:37 NOW NOW NOW 07:15:26 wat 07:15:49 -!- GreaseMonkey has quit (Quit: The Other Game). 07:15:50 I'm just going to wait 5 years from now after he finishes the whole thing 07:15:57 and then just read/watch/play all of homestuck. 07:16:07 Just. Watch. Now. 07:16:12 Noooooooow 07:16:25 fine. 07:22:17 longest load screen ever. 07:29:01 I assume you've seen it by now? 07:29:22 Or do you mean as the loader of the intermission? 07:29:36 (i.e. you're joking) 07:32:33 cascade 07:32:34 CakeProphet: there's a weird bug when you click replay 07:32:38 no I haven't seen it. 07:32:55 ...you haven't seen Cascade yet? 07:33:08 Go watch that, then the first [S] of the intermission 07:33:35 ....I'm watching it right now, obviously. 07:33:38 as I just talked about it loading... 07:34:41 dude this Cascade thing must have taken forever to mak =. 07:36:05 -!- oerjan has quit (Quit: This thing needs a reboot). 07:43:14 -!- oerjan has joined. 07:48:54 @tell elliott Homestuck update. 07:48:55 Consider it noted. 07:49:43 @tell Phantom_Hoover Homestuck update. 07:49:44 Consider it noted. 07:50:19 Sgeo|web: I think elliott knows.. 07:52:29 Oh, I see it now 07:52:39 Well, night all 08:12:36 -!- Ngevd has joined. 08:33:22 -!- copumpkin has quit (Ping timeout: 248 seconds). 08:33:53 -!- Ngevd has quit (Ping timeout: 248 seconds). 08:33:55 -!- copumpkin has joined. 08:58:16 -!- asw has joined. 09:22:22 -!- oerjan has quit (Quit: leaving). 09:40:10 -!- asw has quit (Quit: Leaving). 10:29:08 -!- Sgeo|web has quit (*.net *.split). 10:29:12 -!- Madoka-Kaname has quit (*.net *.split). 10:29:13 -!- FireFly has quit (*.net *.split). 10:29:15 -!- oklopol has quit (*.net *.split). 10:29:15 -!- Slereah_ has quit (*.net *.split). 10:29:15 -!- quintopia has quit (*.net *.split). 10:29:16 -!- variable has quit (*.net *.split). 10:29:16 -!- lifthrasiir has quit (*.net *.split). 10:29:18 -!- pikhq_ has quit (*.net *.split). 10:29:19 -!- Nisstyre has quit (*.net *.split). 10:29:19 -!- Zwaarddijk has quit (*.net *.split). 10:29:22 -!- yorick has quit (*.net *.split). 10:29:23 -!- twice11 has quit (*.net *.split). 10:29:24 -!- lambdabot has quit (*.net *.split). 10:29:25 -!- CakeProphet has quit (*.net *.split). 10:29:27 -!- Patashu has quit (*.net *.split). 10:29:29 -!- HackEgo has quit (*.net *.split). 10:29:31 -!- atehwa has quit (*.net *.split). 10:29:34 -!- EgoBot has quit (*.net *.split). 10:29:34 -!- shachaf has quit (*.net *.split). 10:29:35 -!- Deewiant has quit (*.net *.split). 10:29:35 -!- fungot has quit (*.net *.split). 10:29:35 -!- fizzie has quit (*.net *.split). 10:29:41 -!- coppro has quit (*.net *.split). 10:29:43 -!- chickenzilla has quit (*.net *.split). 10:29:44 -!- aloril has quit (*.net *.split). 10:29:47 -!- bd_ has quit (*.net *.split). 10:29:49 -!- MSleep has quit (*.net *.split). 10:29:49 -!- SimonRC has quit (*.net *.split). 10:29:50 -!- yiyus has quit (*.net *.split). 10:29:50 -!- ineiros has quit (*.net *.split). 10:29:50 -!- mycroftiv has quit (*.net *.split). 10:29:50 -!- rodgort has quit (*.net *.split). 10:29:52 -!- myndzi has quit (*.net *.split). 10:29:54 -!- mtve has quit (*.net *.split). 10:33:31 -!- glogbackup has joined. 10:33:32 -!- bd___ has joined. 10:33:32 -!- derrik has joined. 10:33:32 -!- Patashu has joined. 10:33:32 -!- Madoka-Kaname has joined. 10:33:32 -!- pikhq_ has joined. 10:33:32 -!- lambdabot has joined. 10:33:32 -!- Zwaarddijk has joined. 10:33:32 -!- atehwa has joined. 10:33:32 -!- oklopol has joined. 10:33:32 -!- CakeProphet has joined. 10:33:32 -!- Slereah_ has joined. 10:33:32 -!- coppro has joined. 10:33:32 -!- FireFly has joined. 10:33:32 -!- quintopia has joined. 10:33:32 -!- yorick has joined. 10:33:32 -!- variable has joined. 10:33:32 -!- EgoBot has joined. 10:33:32 -!- shachaf has joined. 10:33:32 -!- lifthrasiir has joined. 10:33:32 -!- chickenzilla has joined. 10:33:32 -!- fizzie has joined. 10:33:32 -!- fungot has joined. 10:33:32 -!- Deewiant has joined. 10:33:32 -!- HackEgo has joined. 10:33:32 -!- twice11 has joined. 10:33:35 -!- glogbackup has left. 10:33:40 -!- MSleep has joined. 10:33:40 -!- ineiros_ has joined. 10:33:40 -!- aloril has joined. 10:33:59 RIP freedom of the press 10:34:32 -!- mycroftiv has joined. 10:42:56 -!- rodgort has joined. 10:52:17 -!- SimonRC has joined. 10:52:17 -!- myndzi has joined. 10:52:17 -!- yiyus has joined. 11:16:12 -!- sebbu2 has changed nick to sebbu. 11:16:51 Are we? :\ 11:19:03 are we what? 11:19:05 who is we? 11:19:21 oh. 11:19:50 well, no. the extradition appeal failed, so he's going to Sweden for questioning and formal charging. 11:20:51 but the US may try to extradite him so that they can prosecute him. Though, I believe it would be a difficult case for them. 11:22:20 I find it strange that he's been under arrest this entire time without any formal charges. 11:23:53 but that's just how the Swedish legal system works I guess. they don't issue formal charges until after questioning, or something. 11:23:54 -!- myndzi\ has joined. 11:26:49 -!- myndzi has quit (Ping timeout: 252 seconds). 11:33:27 > var "Hello, World!\n" 11:33:28 Hello, World! 11:34:10 > fix (fun "I told you about the stairs, bro") :: Expr 11:34:11 I told you about the stairs, bro (I told you about the stairs, bro (I told ... 11:49:09 -!- sebbu has quit (Read error: Connection reset by peer). 11:49:30 -!- sebbu has joined. 11:50:47 -!- sebbu has quit (Changing host). 11:50:47 -!- sebbu has joined. 12:01:30 -!- Ernestas14 has joined. 12:01:40 -!- Ernestas14 has left. 12:22:25 -!- Vorpal has joined. 12:29:34 -!- derrik has quit (Quit: back to 3d). 12:39:16 -!- mtve has joined. 12:43:33 -!- copumpkin has quit (Ping timeout: 260 seconds). 12:43:58 -!- copumpkin has joined. 13:02:07 -!- Patashu has quit (Ping timeout: 260 seconds). 13:41:13 -!- augur has quit (Remote host closed the connection). 14:10:37 -!- augur has joined. 14:12:19 -!- augur has quit (Remote host closed the connection). 14:12:44 `quote 14:12:51 500) _ | |__ _ _ ___ | '_ \| | | |/ _ \ | |_) | |_| | __/ |_.__/ \__, |\___| 14:13:01 ... what a great quote 14:13:20 -!- augur has joined. 14:13:44 `delquote 500 14:13:46 ​*poof* 14:13:50 `quote 14:13:53 596) well, oerjan has a lot of opinions on this, so I'll hand it over to him 14:13:55 A part was missing 14:13:58 Unless it was a typo 14:14:04 Such as ... the funny part? 14:14:26 -!- Phantom_Hoover has joined. 14:14:28 Well, I find something like 1% of the existing quotes funny 14:14:39 This is because you are: terrible. 14:14:40 Phantom_Hoover: You have 1 new message. '/msg lambdabot @messages' to read it. 14:14:41 So I've given up caring about that 14:14:48 `quote 14:14:51 404) hey fhet's zeees OouooH SNEP IT'S A FOooCKING TIGER 14:21:51 Dammit HackEgo, stop letting down the side. 14:33:43 -!- copumpkin has quit (Quit: Computer has gone to sleep.). 15:07:25 -!- copumpkin has joined. 15:10:12 -!- tiffany has joined. 15:15:31 -!- MSleep has changed nick to MDude. 15:19:21 -!- bd___ has changed nick to bd_. 15:58:53 -!- monqy has joined. 16:00:09 -!- derdon has joined. 16:36:03 -!- sllide has joined. 16:40:46 Well, I find something like 1% of the existing quotes funny <-- I mostly agree 16:45:22 god bless military industrial complex america 16:48:19 CakeProphet, planning to follow that remark up with anything? 16:50:28 -!- BeholdMyGlory has quit (Excess Flood). 16:50:49 -!- BeholdMyGlory has joined. 16:53:20 No, it's just a sincere idle thought. 17:05:49 "Mangas slid down the wall, leaving a trail of something black behind them. When they hit the ground they opened and closed and in doing so improvised a sort of locomotion that brought them ever closer, inch by inch, flap by flap, to the bed where I lay paralyzed. I lost sight of them as they drew closer, but then felt, with an odd calmness, the cold wet touch of mangas sliding up my leg." ­— Dinosaur Comics 17:10:19 -!- CakeProphet has quit (Ping timeout: 258 seconds). 17:25:14 Gregor, ... lol 17:25:30 Gregor, is that mangas as in Japanese comics? 17:25:44 Yup 17:26:14 I guess I have to check it out for the context, though that probably won't help 17:40:02 -!- copumpkin has quit (Ping timeout: 248 seconds). 17:40:42 -!- copumpkin has joined. 17:55:05 -!- pumpkin has joined. 17:56:55 -!- copumpkin has quit (Ping timeout: 260 seconds). 17:59:47 -!- elliott has joined. 18:00:07 -!- copumpkin has joined. 18:00:57 -!- copumpki_ has joined. 18:01:35 -!- pumpkin has quit (Ping timeout: 240 seconds). 18:01:45 07:48:54: @tell elliott Homestuck update. 18:01:45 elliott: You have 1 new message. '/msg lambdabot @messages' to read it. 18:01:53 do you really think that will in any way help 18:02:48 07:32:55: ...you haven't seen Cascade yet? 18:02:48 07:33:35: ....I'm watching it right now, obviously. 18:02:48 07:33:38: as I just talked about it loading... 18:02:54 oh wait cakeprophet isn't here 18:03:26 14:12:44: `quote 18:03:26 14:12:51: 500) _ | |__ _ _ ___ | '_ \| | | |/ _ \ | |_) | |_| | __/ |_.__/ \__, |\___| 18:03:26 14:13:01: ... what a great quote 18:03:26 14:13:20: -!- augur has joined #esoteric. 18:03:26 14:13:44: `delquote 500 18:03:32 Gregor: You just deleted a part of history. 18:04:16 -!- copumpkin has quit (Ping timeout: 240 seconds). 18:04:53 -!- copumpki_ has changed nick to copumpkin. 18:04:54 -!- copumpkin has quit (Changing host). 18:04:54 -!- copumpkin has joined. 18:33:03 -!- elliott has quit (Quit: Leaving). 18:39:35 -!- elliott has joined. 18:39:39 Well that was unexpected. 18:43:05 -!- sebbu has quit (Read error: Connection reset by peer). 18:43:27 -!- sebbu has joined. 18:43:27 -!- sebbu has quit (Changing host). 18:43:27 -!- sebbu has joined. 18:50:55 ais hurry up and answer my inconsequential questions. 19:04:15 -!- ais523 has joined. 19:04:40 yes good hi ais523 19:04:44 i summoned you 19:05:09 it was just coincidence 19:05:10 ais523: You have 2 new messages. '/msg lambdabot @messages' to read them. 19:05:12 but perhaps a useful one 19:05:15 @messages 19:05:15 elliott asked 12h 40m 57s ago: How does the Secret Project handle scheduling being non-deterministic? 19:05:15 elliott asked 12h 40m 29s ago: Also, what kind of incredibly rough time estimate would you give for an open-source release of working code? 19:05:31 Yesssssss finally my amazing questions will be answered 19:05:40 elliott: it does handle scheduling being non-deterministic, but the explanation as to how is not a simple one 19:05:41 Oh wow, @ask actually makes it say "elliott asked". 19:05:42 Exciting. 19:05:49 ais523: Is that another way of saying it's secret? 19:06:12 no, it's a way of saying that I will explain it eventually, probably, but am not feeling up to it right now 19:06:23 as I've only just got online 19:06:26 maybe later today 19:07:12 heh 19:08:10 ais523: What about this one: Would there be a way of giving the running program access to a filesystem from the host? (/not/ a block device or anything) 19:08:17 (Read-only access) 19:08:40 elliott: yes, I've been doing that for testing, by mounting the host directory read-only inside the test filesystem with a loopback mount 19:08:57 ais523: great 19:09:10 ais523: I'm trying really hard to think of a non-packaging use case for this and I'm stumped :P 19:09:10 -!- ive has joined. 19:09:31 god 19:09:33 *good 19:09:49 note that the part of the Secret Project you know about is only a moderately small part of the Project as a whole; it's just the bit that has to be done first 19:09:51 ais523: no! bad :( 19:09:56 and if it's useful in its own right, all the better 19:10:14 yeah, I figure waiting and then mangling it to fit my needs is probably easier than rolling my own 19:10:44 ais523: I take it the second question is being deliberately not answered :-P 19:10:58 oh, I don't know the answer 19:11:03 it really depends on how busy I am with other things 19:16:33 -!- yuyu has joined. 19:16:38 -!- yuyu has quit (Read error: Connection reset by peer). 19:18:57 ais523: Last question! Tell me it isn't written in the same style DNA Maze is. 19:19:10 it isn't, AFAIR 19:19:13 but I haven't looked at it for a while 19:19:24 surely DNA Maze's style can just be fixed with indent(1) if you don't like it, though? 19:19:28 That's... worrying :P 19:19:44 ais523: Well, sure, but that makes merging more difficult... 19:21:51 I love how Nix essentially has safePerformIO :: (Hashable a) => IO a -> Hash -> a 19:22:16 safePerformIO m hx = unsafePerformIO $ do { x <- m; when (hash x /= hx) $ fail "oh no"; return x } 19:37:22 -!- Darth_Cliche has joined. 19:46:06 -!- sebbu has quit (Read error: Connection reset by peer). 19:46:31 -!- sebbu has joined. 19:46:31 -!- sebbu has quit (Changing host). 19:46:31 -!- sebbu has joined. 19:54:45 ais523: oh, would the secret project support exposing a network interface to the program being run? I could just give it the eth0 device through the FS, right? 19:55:09 elliott: no, I don't think it would 19:55:19 hmm, why not? :/ 19:55:28 certainly the project as a whole couldn't; the part you know about theoretically could, I guess, but it'd need to implement the networking syscalls 19:55:32 I don't /think/ I need it, but it would reduce a lot of duplication 19:55:42 the problem is, how can you run something completely repeatably when it's connecting to something you don't control? 19:55:57 ais523: oh, I'm fine with it violating repeatability; this is a special case 19:56:07 as long as the network is the only way to violate it 19:56:12 as opposed to all the other ways you can 19:57:03 that, umm, rather defeats the point of the secret project, but I doubt it'd be that hard; you'd just let socketcall(2) fall through to the default blocking or non-blocking syscall impl 19:57:45 ais523: it's for a good reason :P 19:58:44 ais523: in Nix-style systems, retrieving the source tarball for a package is done by having that be its own package whose "build" script just uses wget or the like and then places the result in the store; this is forced to be pure because you have to specify an SHA hash of the resulting file 19:58:50 and the whole thing fails if it doesn't match 19:59:16 -!- pumpkin has joined. 19:59:21 ais523: I could just run those without sandboxing, but I'd still have to e.g. run them as an unprivileged user, chroot them in, to avoid malicious behaviour exploiting the fact that it's run outside of the Secret Project 19:59:31 why do you need perfect reproducibility for something like that? it doesn't fall under the secret project's definition of reproducibility because it doesn't control the timing 19:59:33 ais523: it would be easier if I could just use "the Secret Project, but with networking" 19:59:44 ais523: for sandboxing 20:00:13 ais523: I'm just saying that reproducibility offers sandboxing as a side-effect 20:00:15 oh, I said the secret project wasn't designed for security, although I guess it may end up sandboxing things anyway 20:00:19 yep 20:00:28 ais523: and I happen to need reproducibility most of the time, but just sandboxing for this case 20:00:38 it'd be nice if I could rely on one thing to do that, rather than having two very similar mechanisms 20:00:43 differing only in that one allows network access 20:01:23 I mean, an unprivileged account and a chroot isn't /that/ much of a pain, but I'd be happier if I could use the same mechanism :) 20:02:00 -!- copumpkin has quit (Ping timeout: 252 seconds). 20:02:06 well, it may be possible, but would be really hackish 20:02:38 that, umm, rather defeats the point of the secret project, but I doubt it'd be that hard; you'd just let socketcall(2) fall through to the default blocking or non-blocking syscall impl 20:02:41 that doesn't sound very hackish 20:02:58 well, it violates the invariants that the secret project is based on 20:03:18 btw, I'm looking at the source, it seems to be One True Brace 20:03:21 which you're happy enough with, I guess? 20:03:26 sure :P 20:03:43 complete with literal formfeed characters to separate unrelated functions 20:03:49 * elliott uses Linux style with varying indentation width 20:04:00 Linux style is basically a specification of K&R/1TBS, though 20:04:08 ais523: that's not 1TBS... 20:04:15 ais523: that's some awful hybrid 1TBS/GNU style, then :P 20:04:29 elliott: 1TBS is an indentation style, right? 20:04:33 formfeeds are not indentation 20:04:45 ais523: no, it's a formatting style 20:04:51 it also tells you where to put braces, for one 20:07:29 wow, it's bizarre seeing someone use SCM to mean something other than VCS 20:08:52 hmm, wow, I think `pureWriteIORef :: IORef a -> a -> b -> b` is actually pure 20:09:06 pureWriteIORef ref v x = unsafePerformIO (writeIORef ref v >> return x) 20:09:24 elliott: http://pastie.org/pastes/2800788/text?key=c9nqhgeel5yd8hcu4jzq 20:09:32 you were asking about the Secret Project's scheduling rules 20:09:40 and there's the relevant parts, with a bit of censorship applied 20:09:58 ais523: wtf is that censorship for? :P 20:10:08 it's a Secret Project, right? 20:10:17 so bits of it have to stay secret 20:10:21 so wait, how do you convince linux not to use its normal scheduler? 20:11:54 generally speaking, all but one process is either in a blocking syscall, or stopped 20:11:59 so only one process can actually run 20:12:39 ais523: umm, what if i fork two processes doing for(;;);? 20:12:43 should multiple processes get knocked out of a blocking syscall simultaneously for whatever reason, they're each stopped at the syscall return in arbitrary order, and banned from communicating in any way with other processes until the Secret Project has a good handle on which ones are and aren't working 20:12:50 the Secret Project doesn't handle infinite busyloops 20:13:27 ais523: what about if I start two subprocesses, alarm(15), then put them both in a busyloop of incrementing a global i variable 20:13:31 then exit(i) in the signal handler? 20:14:06 it doesn't handle that either 20:14:28 nor does it have to be able to, for its intended purpose; and besides, the way it works, it can't 20:14:41 ais523: it's not exactly perfect repeatability then, is it? 20:14:50 I could imagine someone doing something like that to produce a random seed 20:14:53 I didn't say it was; you said that 20:15:06 well, you've strongly implied that's what it's for, otherwise why go to all the effort? :p 20:15:19 that is what it's for, but it's not designed to work on arbitrary programs; just a very large subset of them 20:15:26 for instance, you couldn't run it on itself 20:15:52 and I've already established that it actively resists being debugged (running gdb inside or outside it causes mad things to happen, as does running valgrind inside or outside it) 20:16:06 well, OK 20:16:13 actually, I wonder if that valgrind thing should worry me 20:16:21 packages might try and run a test suite at build-time 20:16:52 ais523: anyway, I suppose it'll be good enough :) especially since the Nix guys have problems with such simple things as the system clock or hostname leaking into builds 20:17:26 valgrind internal-errors on the Secret Project with a request to report a bug 20:17:37 but if I did report what was causing it, I'm reasonably sure the reply would be "then don't do that" 20:17:46 ais523: you've said 20:20:03 ais523: here's a quote you might like: "In the presence of patch sets between arbitrary releases, it is not directly 20:20:03 obvious which sequence of patches or full downloads is optimal. To be fully gen- 20:20:03 eral, the Nix substitute downloader runs a shortest path algorithm on a directed 20:20:03 acyclic graph that, intuitively, represents components already installed, avail- 20:20:03 able patches between components, and available full downloads of components." 20:20:56 elliott: why acyclic? 20:20:58 -!- Ngevd has joined. 20:21:08 ais523: I don't think that would work 20:21:16 Hello! 20:21:35 if you want an alpha release, then you can get it either by getting a beta and reversing the patches between it and the alpha, or applying patches forwards from the previous release 20:22:55 -!- GreaseMonkey has joined. 20:22:56 -!- GreaseMonkey has quit (Changing host). 20:22:56 -!- GreaseMonkey has joined. 20:23:48 ais523: in this case, "getting a beta" is the thing to be avoided 20:23:49 -!- pumpkin has changed nick to copumpkin. 20:23:59 ais523: the user isn't a time traveller, so they have files from the past only 20:24:06 elliott: what if you don't want the latest version? 20:24:11 ais523: you don't understand 20:24:13 the files may be from the past, but in the future of the version you want 20:24:17 ais523: you have a pre-alpha, and need to update to a beta 20:24:21 but there's not patches between every single release 20:24:24 in-between 20:24:25 only some of them 20:24:54 elliott: say you have version 16, and want to update to version 17alpha5; 17beta1 is already out 20:25:16 then going forwards to 17beta1 and then back to 17alpha5 may be the smallest set of patches to use 20:25:38 well, OK 20:26:03 ais523: OTOH, wanting to update to 17alpha5 is an incredibly unlikely scenario in context 20:26:28 ais523: and if you do want to, downloading the binary from scratch is an acceptable cost to save calculation time for people who don't do insane things 20:26:34 it has a feature you need and 17beta1 has a critical bug that 17alpha5 doesn't? 20:26:43 yes, but full downloads are always available 20:26:49 this is about optimisation, not making things possible in the first place 20:26:54 elliott: the point is that finding the shortest route in a DAG is the same algo as finding the shortest route in a directed graph 20:27:09 so it doesn't cost you anything to ban cycles 20:27:19 sure, but the graph itself is bigger 20:30:11 ais523: anyway, avoiding implementing a reverse patch algorithm is one reason :P 20:30:44 It's my birthday tomorrow 20:30:48 elliott: wow, I just got a wallop claiming that vim was the best editor ever 20:30:49 Then I'm on TV Friday 20:30:57 Then fireworks display Saturday 20:30:58 -!- pikhq has joined. 20:31:01 ais523: on your /local machine/? 20:31:04 -!- pikhq_ has quit (Ping timeout: 240 seconds). 20:31:05 elliott: no, on Freenode 20:31:08 oh 20:31:09 wtf? 20:31:11 paste it 20:31:29 [wallops] Holy editor war, batman! Vim's first public release was two decades ago, today! It sure is birthday-y around here as of late. Anyway, congrats to the best editor, ever! Join #vim to congratulate or have good-natured editor bantering ;) 20:31:43 hmm 20:31:51 that looks designed to incite a flamewar 20:31:52 I really want to troll-and-run #vim now 20:31:59 they're /encouraging/ it, aftera ll 20:32:14 VIM SUX EMACS SUX NOTEPAD IS THE ONE TRUE EDITOR 20:32:15 there we go 20:32:46 incidentally, I commented on an editor war on Reddit a while back: http://www.reddit.com/r/programming/comments/lotys/lines_of_lisp_and_c_code_in_emacss_source_code/c2uknyy?context=3 20:32:51 I'm not a big editor person-y type thing 20:33:10 Begins with c 20:33:16 Sounds vaguely French 20:33:20 Associated with wine 20:33:22 Hard to spel 20:33:23 l 20:33:30 critic? 20:33:32 Connossoure 20:33:34 aha 20:33:38 Something like that 20:33:45 condiment 20:33:46 connoisseur 20:33:53 connoisseur. 20:33:53 my IRC client has a spellchecker ;) 20:34:02 Mine does, but I wasn't close enough 20:34:05 ais523: mine doesn't, what package is that again? it's been bugging me 20:34:05 :p 20:34:14 (I have aspell, it just doesn't work in gtk...) 20:34:15 It gave me Connecticut 20:34:28 :D 20:34:44 elliott: I'm using Konversation 4, obtained via kubuntu-desktop 20:34:53 which has a really crazy insane number of dependencies 20:34:58 and I couldn't tell you which one it is specifically 20:34:59 XChat, Ubuntu 11.04 20:35:00 I really hope Arch has a kubuntu-desktop package 20:35:06 Which is probably the worst Ubuntu 20:35:11 all distros should have a kubuntu-desktop package :) 20:35:16 (kubuntu-desktop exists for the purpose of depending on pretty much the whole of KDE) 20:35:38 ais523: /plus/ whatever kubuntu adds 20:36:06 yep 20:38:07 "Clearly, we could produce patches between all Xs and Y s. This policy is 20:38:07 “optimal” in the sense that the client would always be able to select the abso- 20:38:07 lutely shortest sequence of patches. However, it is infeasible in terms of time and 20:38:07 space since producing a patch takes a non-negligible amount of time, and most 20:38:07 such patches will be large since they will be between unrelated components (for 20:38:07 instance, patching Acrobat Reader into Firefox is obviously inefficient)." 20:38:15 how does one patch Acrobat Reader into Firefox under NixOS? 20:38:25 dammit, I got the meme wrong 20:38:31 serves me to go by WP article titles rather than their contents 20:41:18 hmm... does anybody know HTTP better than I do here? 20:42:30 aha, I was right 20:42:39 (w3.org knows HTTP better than I do) 20:44:13 [elliott@dinky ~]$ time ( { for i in {1..9}; do echo "GET /$i HTTP/1.1"; echo; done; echo "GET /10 HTTP/1.1"; echo "Connection: close"; echo; } | nc google.com 80 >/dev/null ) 20:44:18 good command lines 20:44:49 Does it work? 20:44:54 yep 20:45:05 Then they are very good. 20:45:41 ais523: here's another quote you might like: "A good value for k would be around 2, e.g., k = 1.9." 20:45:53 Also e.g. k = 2 :-P 20:47:38 -!- centrinia has joined. 20:51:45 pikhq: Has anyone compared patching times / memory use of bps vs. e.g. bsdiff? 20:51:57 Hmm, I wonder if I could parallelise the process somewhat... 20:52:24 Hello centrinia 20:52:32 hi centrinia 20:52:34 `welcemkrmo 20:52:35 Hello Ngevd, elliott. 20:52:36 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: welcemkrmo: not found 20:52:37 `welkom 20:52:38 `? skdlf 20:52:39 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: welkom: not found 20:52:40 `? welcome 20:52:40 skdlf? ¯\(°_o)/¯ 20:52:41 Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page 20:52:52 `ls bin 20:52:53 Does everyone get a welcome? 20:52:54 ​? \ addquote \ allquotes \ calc \ define \ delquote \ etymology \ forget \ fortune \ frink \ google \ json \ k \ karma \ karma+ \ karma- \ learn \ log \ logurl \ macro \ marco \ paste \ pastekarma \ pastelog \ pastelogs \ pastenquotes \ pastequotes \ pastewisdom \ ping \ prefixes \ qc \ quote \ quotes \ roll \ runperl \ toutf8 20:53:00 centrinia: No! Just you. Also new people. 20:53:05 `paste bin/? 20:53:07 http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/paste/paste.26175 20:53:17 Phantom_Hoover: use `url for things like that 20:53:18 avoids pasting 20:53:52 What's a stationary point again? 20:54:23 Are they when the gradient is 0? 20:55:42 It can also be a point where the gradient is not defined. 20:55:54 Oh good 20:55:59 centrinia, they can? 20:56:13 Oh, right, discontinuities in the gradient. 20:56:16 I am just looking at the wiki. 20:56:35 ais523: do things like segfault-catching work under the Secret Project? 20:56:35 Ngevd isn't meant to know about that :P 20:56:40 -!- pikhq_ has joined. 20:56:54 -!- pikhq has quit (Ping timeout: 255 seconds). 20:56:57 Wait, that is a critical point. 20:57:20 elliott: it can catch segfaults itself 20:57:22 I was wrong earlier. 20:57:24 centrinia, erm, yeah. 20:57:25 although it doesn't do anything with them yet 20:57:33 ais523: that... isn't the point 20:57:35 it could pass them to the program's segfault interrupt handler if you wanted it ot 20:57:36 *to 20:57:41 I think that's actually what it does 20:57:47 ais523: I mean things like libsigsegv 20:57:54 which let you use segfaults to e.g. expand a BF tape 20:58:01 yep, I think it could handle that 20:58:02 if you do the mmapping just right so it's on a page boundary 20:58:04 great 20:58:24 it may handle that already, in fact 20:58:42 ais523: I'm just checking that build processes that use software which pull tricks like this will work :) 20:58:53 e.g. SBCL does the "mmap a gigantic private heap" t hing 21:00:42 ais523: you said that the Secret Project can't be run under gdb, but does gdb work inside it? 21:00:58 elliott: no 21:01:04 right 21:02:10 ah, hmm, not only does gdb go wrong, but so does the Secret Project 21:02:12 must be a bug in it somewhere 21:03:48 heh, I just had a silly conservative GC idea, that I just realised never frees anything 21:03:51 perfect! 21:05:44 http://a6.sphotos.ak.fbcdn.net/hphotos-ak-snc7/s720x720/316901_284913304864672_100000380143871_936853_1298194009_n.jpg 21:06:13 I... 21:06:23 Apparently it's a board game 21:07:40 # Set the maximum number of FUSE mounts allowed to non-root users. 21:07:41 # The default is 1000. 21:07:41 # 21:07:41 #mount_max = 1000 21:07:56 Is... is that the church in Hexham which elliott tells me is the only interesting thing in it? 21:08:07 I said it was interesting? 21:08:39 The gaol's better 21:08:46 But yes 21:32:49 which was the last windows version that was sold on floppy? 21:32:53 I guess windows 3.x 21:32:55 95. 21:33:00 pikhq_, really? Heh 21:33:05 pikhq_, how many floppies? 21:33:48 13. 21:34:10 95 OSR 2.1 came on 26. 21:34:12 Vorpal: Windows Server 2008 21:34:15 enterprise edition 21:34:20 -!- augur has quit (Remote host closed the connection). 21:36:40 Waaaait. Holy crap 98 could be had on floppies. 21:36:49 39 floppies. 21:36:50 I have it on CD 21:37:01 pikhq_, but was it ever distributed as that? 21:37:14 Yes. *Barely*. 21:37:18 wow 21:38:00 They were also 1.7M floppies. 21:38:02 wtf, google earth doesn't display territorial boarders in the sea. 21:38:20 I want to know if there is international water between Canda and Greenland, but I can't find info on that ANYWHERE 21:38:51 pikhq_, ... that is rare. I never seen any of those. Can a normal computer read them? 21:39:17 and how was that identified, yet another hole in the cover? 21:40:23 I want to know if there is international water between Canda and Greenland, but I can't find info on that ANYWHERE 21:40:32 Vorpal: Sorry, but you can still be prosecuted for crimes committed in international waters. 21:40:37 elliott, har, har 21:40:43 You'll have to go into space for your private time. 21:43:37 -!- Ngevd has quit (Quit: early morning tomorrow). 21:44:44 "Subversion gets Suspended" — Introversion website 21:44:50 NOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOO 21:45:08 Old news 21:45:08 imagines n as m 21:45:13 Phantom_Hoover: Now we're going to have to use CVS!!! 21:45:16 phantom hoover moos loudly 21:45:30 deewiant confuses it for mews 21:45:55 Vorpal: Yes, actually. 21:45:55 monqy: comfuses 21:45:58 momqy 21:46:08 pikhq_, to witch question? 21:46:13 pikhq_, the borders or the floppy? 21:46:14 Phantom_Hoover: ahahaha "In the end, after all that development and years of work, you still completed the bank heist by walking up to the first door, cracking it with a pin cracker tool, then walking into the vault and stealing the money." 21:46:18 Vorpal: "Can a normal computer read them?" 21:46:19 I remember googlestalking monqy and it turned out he was some mother? 21:46:20 ah 21:46:29 monqy is the best mother 21:46:32 `quote uncle 21:46:34 221) elliott: just to bring you up to speed, you are now my baby nephew. wtf, elliott is a nephew and his uncle is here? what Heck yes I'm elliott's uncle. 21:46:48 elliott, where is that quote from ("in the end..." 21:46:49 ) 21:46:55 Vorpal: http://forums.introversion.co.uk/introversion/viewtopic.php?t=2967 21:47:01 I'm a mother??? 21:47:08 monqy: yes happy birthday 21:47:09 Microsoft actually used it for quite a while. 21:47:26 i don't remember getting pregnant........... 21:47:27 monqy's child? 21:47:32 Bastards. 21:48:12 monqy's child is multiple bastards? That kid's got talent. 21:48:29 congratulations monqy ! 21:48:37 So wait, even Introversion didn't know what the hell Subversion was about? 21:48:41 This... explains a lot. 21:49:07 elliott: have I mentioned that you're on the verge of saying your first word? 21:49:13 "I was imagining Uplink developed into a bigger game with more replay value (as in: there are still challenges even after you've learned how to hack a bank)." 21:49:15 Amen. 21:49:30 Those banks are insanely broken. 21:51:02 -!- derdon has quit (Remote host closed the connection). 21:51:22 elliott, BtW, have located debit card. 21:51:29 Phantom_Hoover: Buy a kitten. 21:51:32 Will buy Humble Bundle post-haste. 21:51:40 Pay more than the average of 21:51:40 $4.71 to get The Binding of 21:51:40 Isaac and Blocks That Matter! 21:51:42 Also a kitten, although what if my cat doesn't like it? 21:51:45 Phantom_Hoover: See, it's going to force you to be a good person. 21:51:49 elliott, BASTARDS 21:52:13 -!- Patashu has joined. 21:52:13 elliott, pirate them for me to see if they work? 21:52:23 (By which I mean send me your download link._ 21:52:44 That feels wrong!!!!!!!! Also that would let you do awful things to my order. 21:53:06 Phantom_Hoover: IIRC the Binding of Isaac is 2D, so you'll be fine. Voxatron is software-rendered, so your GPU is irrelevant. 21:53:08 You mean giving all your moneys to them. 21:53:16 Blocks That Matter looks 2D too. 21:53:19 So you'll be fine. 21:53:56 elliott, "The Binding of Isaac" isn't worth it, "Blocks That Matter" is 21:54:15 Vorpal: The Binding of Isaac has gotten rave reviews from literally everything and Super Meat Boy was great, so... you're probably wrong. 21:54:25 I've heard mixed things about it 21:54:52 elliott, well try it yourself. It looks insane. Sure the gameplay may be good, but I referred to the setting and the plot 21:55:13 Also anything with Roguelike-style world generation is the best. 21:55:15 it is just disturbing from what I seen 21:55:41 Vorpal: this is because you are (a) Swedish; (b) therefore, a wuss. 21:55:47 -!- SgeoN1 has joined. 21:55:54 The only non-wussy Swede is olsner and that is why he is also the only non-terrible Swede. 21:56:01 elliott, no you are just as insane and disturbing yourself 21:56:08 elliott, anyway what about FireFly and BeholdMyGlory? 21:56:12 They're not people. 21:56:18 elliott, oh? 21:56:28 Wtf reisub didn't work 21:56:49 SgeoN1: Do you have magic sysrq on>? 21:56:52 s/>// 21:57:16 Not sure? 21:59:16 SgeoN1: Check? 22:00:43 /proc/sys/kernel/sysrq contains 1 22:01:06 SgeoN1, are you on a laptop? 22:01:17 Yes 22:01:47 SgeoN1, Does fn on the sysrq button do anything according to the legend on the keyboard 22:02:15 No 22:02:16 sysrq doesn't work reliably on my laptop, Fn-PrtSc supposedly gives SysRq, but well, not really 22:02:59 SgeoN1: a safe way to test is fn+printscreen+b! 22:03:02 The SAFEST way. 22:04:37 !? 22:05:46 I think I'll try with w 22:06:04 Or m 22:06:44 I think I once did REIBUS backwards because I forgot that you need to reverse 'busier'. 22:06:47 Works without Fn not with 22:07:49 Phantom_Hoover: REIBUS isn't BUSIER backwards. 22:08:23 elliott, it's a miracle my computer still works at all, frankly. 22:08:42 Phantom_Hoover: It's REISUB; let me guess, you didn't pause for a few seconds between letters either? 22:08:59 I don't remember? 22:15:46 elliott, SgeoN1: fn-prtsc-h should be a good way to test 22:15:54 and it does nada for me 22:15:59 He already tested. 22:16:08 hm 22:16:30 "Figure 5 shows the build algorithm for derivations in pseudo-code. The operator ← denotes assignment, and x [← symbol with a ∪ above it] y is shorthand for x ← x ∪ y." 22:16:37 They're reinventing C notation X-D 22:17:00 heh 22:29:12 hmm, I don't think I like the path this paper is taking 22:29:24 what path did it take 22:29:51 not sure yet :) 22:31:39 "We fix this problem by computing hashes modulo self-references. 22:31:40 Essentially, this means that we ignore self-references when com- 22:31:40 puting the hash. First, when computing the hash of contents(p), 22:31:40 we zero out all occurrences of the string hashPart(p)." 22:31:40 cute 22:31:57 ais523: how to solve a fixed-point for a hash function: zero out the self-reference hole :D 22:32:15 heh 22:32:32 hmm... wonder what happens if you deliberately insert something that would be a self-reference but zeroed 22:32:37 maybe it changes it to the hash :D 22:33:01 ah! 22:33:04 "It is necessary to encode the offsets 22:33:04 of the occurrences of h into the hash to prevent hash collisions for 22:33:04 strings that are equal except for having either h or 0-strings at the 22:33:04 same location." 22:33:36 -!- augur has joined. 22:36:07 -!- ive has quit (Ping timeout: 258 seconds). 22:45:57 -!- copumpkin has quit (Quit: Computer has gone to sleep.). 22:49:19 ais523: how to solve a fixed-point for a hash function: zero out the self-reference hole :D <-- isn't that how a lot of embedded hash style checksums are done? 22:49:30 dunno 22:49:41 this is more clever though 22:49:44 because it notes the offsets 22:49:57 so you can't cause a collision by deliberately taking something with a self-reference and turning it into 0s instead 22:50:11 hm 22:50:12 hmm, what's the chance that a cryptosecure hash has a fixed point? almost 1, isn't it? 22:50:42 ais523: I think 1 22:50:45 ais523: except, no 22:50:49 ais523: it's 1 if every hash value is possible 22:50:58 whether every hash value is possible or not sounds /very/ hard to estimate 22:51:06 let alone prove 22:51:26 elliott, iirc stuff like checksum in some of gzip, zip, rar and so on or similar work by computing the hash with a dummy value (such as all zeros) in place of where the hash goes, sounds quite the same? 22:51:29 elliott: actually, if any hash value is impossible, it's 1 22:51:37 ais523: huh? 22:51:44 because then two well-formed hash values have to map onto the same hash by the pigeonhole principle 22:51:48 Vorpal: it's similar 22:51:53 ais523: oh, right 22:51:57 I had it backwards :) 22:51:59 if all are possible, then it's possible but unlikely that they all go round in cycles of 2 or more 22:52:45 ais523: I remember a while back some idiot web designer guy started a "distributed search" for an SHA-1 fixed-point, waving away people who gave statistics as to the incredible unlikelihood of one being found by brute force with "if enough of us try it might just work!!!" 22:52:58 i cried :'( 22:52:59 ais523, non-crypto secure hash that doesn't have that property (unless I misunderstood you): f(a) = b, f(*) = a 22:53:10 where a and b are strings 22:53:26 Vorpal: in that case, the only well-formed outputs are a and b; both are possible, so it's possible that there's no fixedpoint 22:53:28 and in fact there isn't 22:53:43 ais523, well yes 22:53:54 here it is!!! 22:53:54 http://elliottkember.com/kember_identity.html 22:53:58 moron even named it after himself 22:54:00 wait, /another/ elliott? 22:54:04 also dear god those colour highlights are unbearable 22:54:07 ais523: oh god you're right 22:54:19 at least not hird 22:54:21 i'm changing my fucking name, this means there are at least two abject morons with my first name 22:54:23 as their first name 22:54:27 in fact, three if you count me! 22:54:32 heh 22:54:42 I assume there are at least 2 people called Alex who are morons, just because it's a really common name 22:54:48 elliott, is "Elloitt" spelled like that very rare? 22:54:55 err 22:54:57 s/oi/io/ 22:54:58 Vorpal: I... suspect not a single person is called that 22:55:00 Oh 22:55:03 elliott, yeah typo :P 22:55:05 Well Elliot is the most common spelling by far 22:55:10 Eliot is also common 22:55:12 ah 22:55:14 As is, I think, Eliott 22:55:16 elliott, and your spelling? 22:55:20 Elliott is not all that common :P 22:55:23 right 22:55:33 Elloitt is probably the name of a kid with illiterate parents. 22:55:43 Fun fact, my name means "Ruler of the Elves". I am what I hate. 22:56:03 elliott, I believe there are like less than 5 people in Sweden with both my first and my last name. And one other if you include my middle names. 22:56:12 ais523: looks like there's a 37% chance there's no such input for MD5 22:56:15 the latter is just weird. Chances are pretty low 22:56:22 Fun fact, my name means "supported of Yahweh". 22:56:29 Vorpal: I doubt there's another Elliott Hird on the globe 22:56:33 elliott: 1/e? 22:56:38 that would be my guess as to the probability 22:56:39 ais523: yep: http://ograll.blogspot.com/2009/06/mathematics-of-perfect-hash.html 22:56:42 Fun fact, my name means "Ruler of the Elves". I am what I hate. 22:56:45 No dude what about Cacame. 22:56:52 Phantom_Hoover: I'm not Cacame! I'm Elliott! 22:56:55 I'm pretty sure my first+last name is unique among living people. 22:57:05 pikhq_: Unknown? 22:57:08 elliott, well I doubt my name occurs at all outside Sweden. It might just show up in Norway or Denmark I guess 22:57:11 probably not 22:57:16 It most certainly isn't if you count people still alive. 22:57:31 Erm. 22:57:35 People who have ever lived. 22:57:44 "I've found one! 22:57:45 Not exactly a complete match but I'm done wasting cycles.. 22:57:45 md5('deadbeefdc84955dfb53442f741f4ec9') == 1ebb63c68f0e40e6902e0deadfeefbfa" 22:57:53 pikhq_, oh? what is it? 22:57:54 * elliott facepalms 22:58:06 it doesn't even have "deadbeef" in both 22:58:07 Vorpal: Josiah Worcester 22:58:11 I see dead feef 22:58:11 "I doubt it exsists, considering, which guy making such a algorithm would not make sure that would never happen? 22:58:11 I would at least try to prevent it, since it kind of breaks the purpose of the algorithm(a one-way algorithm)" 22:58:13 OK, I give up on these comments 22:58:25 pikhq_: both the forename and surname are not unheard of 22:58:34 ais523: Though not exactly common. 22:58:37 indeed 22:58:40 Phantom_Hoover: I'm not Cacame! I'm Elliott! 22:58:46 Yeah but get a beard on strings? 22:58:50 OK fine. 22:58:51 both my forename and surname are really common 22:59:01 I strongly suspect Worcester is more common as a place name. :P 22:59:04 Also make Hexham get conquered by dwarves, i.e. Scots. 22:59:16 I would be up for warring with the Scots. 22:59:19 This place is boring. 22:59:39 Nonono, we'd conquer you, and then the English would kill and eat most of your family and your wife. 22:59:55 Ah. 23:00:51 ais523, I know 23:00:58 -!- calamari has joined. 23:01:03 Vorpal: Josiah Worcester <-- yeah... those are both quite rare 23:01:05 -!- zzo38 has joined. 23:01:18 pikhq_, btw, isn't "Worcester" the name of some food stuff 23:01:21 as in "Worcester-foo" 23:01:31 or am I confusing it with something else? 23:01:33 Worcester sauce. 23:01:37 Phantom_Hoover, ah, thanks 23:01:48 It's a bit like spicy vinegar I think. 23:01:55 ah, okay 23:02:00 (I have only actually tasted Worcester sauce crisps.) 23:02:06 (They are good.) 23:02:14 Wow, this guy uses those awful italic background-highlights everywhere. 23:02:17 (I foolishly clicked on to his site.) 23:02:27 Phantom_Hoover, from the name it sounds like it comes from UK, is that the case? 23:02:31 It's like he just discovered highlighter pens. 23:02:37 Phantom_Hoover: It's... not like spicy vinegar. 23:02:43 It's fermented fish apparently? 23:02:49 No don't call it that. 23:02:52 Nobody thinks of it like that. 23:02:54 That is the road to hell. 23:02:58 It's just made out of magic. 23:03:16 wtf? 23:03:16 Maybe you English people don't, but here in Scotland we like our food in some state of decay. 23:03:21 Phantom_Hoover, you mean Worcester sauce ~ surströmming? :D 23:03:28 Worcester sauce is fermented fish? But fish sauce is fermented fish. 23:03:29 except more fluid 23:03:39 Gregor: It's made from like a billion things plus anchovies :P 23:03:42 I thought Worcester sauce was related to soy sauce. 23:03:43 Ah. 23:03:45 I approve of the idea that worcester sauce is made of magic 23:03:48 Gregor: "The ingredients of a traditional bottle of Worcestershire sauce sold in the UK as "The Original & Genuine Lea & Perrins Worcestershire sauce" are malt vinegar (from barley), spirit vinegar, molasses, sugar, salt, anchovies, tamarind extract, onions, garlic, spice, and flavouring." 23:03:56 But yeah, it's like soy sauce but with more... flavour. 23:03:58 And a bit less salty. 23:04:04 ah 23:04:10 "The "spice, and flavouring" is believed to include cloves, soy sauce, lemons, pickles and peppers." 23:04:14 Gregor: Worcester sauce is very much a form of fish sauce. 23:04:14 elliott, approximately surströmming :P 23:04:22 Basically they just threw everything into a blender. 23:04:31 approximately liquid surströmming :P 23:04:32 Yet another sauce that's secretly not vegetarian :P 23:04:36 Phantom_Hoover: Seriously though try some Lea & Perrins it's good. 23:04:43 Vorpal: Also, "Worcester sauce" is slightly shortened for "Worcestershire sauce". 23:04:45 OK so incidentally, people who think Tesla was the most intelligent person ever and we've irrecoverably lost so much stuff because we just didn't listen fools: the worst/ 23:04:48 Phantom_Hoover, ah 23:04:49 err 23:04:51 pikhq_, ^ 23:04:57 damn tab-last-spoke-first 23:04:58 Anyone who calls it Worcester sauce is a bad person. 23:05:01 The shortening goes even further for Japanese; it's just "sôsu". 23:05:07 http://upload.wikimedia.org/wikipedia/commons/6/65/Dimitri_Torterat_-_Bottle_of_Worcestershire_sauce.jpg ;; look, it _says_ Worcestershire on the bottle. 23:05:11 Would it even be possible to make Haskell have a bijective function type <-> that you could, in addition to possibly conversion of some reversible esolangs, also be able to prove things such as: forall a b c n. Not (Either (Maybe (Maybe (Maybe n)) -> Maybe a) (Maybe (Maybe (Maybe n)) -> Maybe b) <-> (Maybe (Maybe (Maybe n)) -> Maybe c)) 23:05:11 Vorpal: I guarantee your local food store has worcestershire sauce 23:05:16 pikhq_, like "sauce"? Lol 23:05:19 Vorpal: Yup. 23:05:19 elliott: Everyone just calls it wfhdioasfhoisder sauce. 23:05:33 http://upload.wikimedia.org/wikipedia/commons/5/5f/Leaperrins.png 23:05:38 DOUBLY APPETISING 23:05:48 DOUBLY DIGESTIBLE 23:05:51 Vorpal, think of the most racist way to say in Japanese; that is how the Japanese say it, 23:05:57 olsner, sure? That would be OKQ8's small food section that is closest I think. ;P 23:06:04 elliott, so digestible. 23:06:07 Like 23:06:20 Phantom_Hoover: Actually, most people really suck at mock-Engrish. 23:06:26 you put it in your mouth and it turns into crap in like 10 seconds it's so digestible 23:06:34 Phantom_Hoover: X-D 23:06:39 olsner, I suspect the closest Coop Forum has it. Maybe even the local ICA Maxi. 23:06:45 pikhq_, yes, there's nothing I hate more than poorly-executed racism. 23:07:07 Vorpal: Those are the worst store names. 23:07:14 elliott, yes 23:07:20 Vorpal: okq8? that's not a food store, that's a gas station 23:07:24 Over here we just call it the co 23:07:25 op 23:07:36 (That line break is part of the name, it seems.) 23:07:39 Phantom_Hoover: No no now it's "the co-operative" all-lowercase. 23:07:49 olsner, indeed. But they sell milk and some other basic food stuff iirc 23:07:50 Phantom_Hoover: The MOST STUNNING REBRAND. 23:07:54 olsner, like, one wall 23:07:54 the coöperative. 23:07:56 Phantom_Hoover: (I kind of miss the old 23:07:57 co 23:07:57 op 23:07:58 logo.) 23:08:06 They changed it???????????? 23:08:11 Phantom_Hoover: Dude. 23:08:21 Phantom_Hoover: http://upload.wikimedia.org/wikipedia/en/e/e2/Cooperativebrand.svg 23:08:28 i am 23:08:30 so sad 23:08:33 http://upload.wikimedia.org/wikipedia/commons/2/21/Drighlington_co-op.jpg 23:08:40 elliott, this logo is horrible: https://en.wikipedia.org/wiki/File:Coop_Forum.png 23:08:46 my childhood 23:08:48 is dead 23:08:52 Phantom_Hoover: Have you heard their adverts I can never stop laughing whenever I hear "GUD WITH FUD". 23:08:55 -!- copumpkin has joined. 23:09:01 Vorpal: Ow. 23:09:04 coop is never said as two words in swedish (although it does mean co-operative something), it's just ko:p 23:09:29 if my pseudophonetic writing makes sense 23:09:33 OMG .coop is a TLD. 23:09:37 Phantom_Hoover: No shit??? 23:09:40 chicken.coop 23:09:47 Phantom_Hoover, hey, they called "coop forum" "Obs!" when I grew up. 23:09:50 Phantom_Hoover: Taken. 23:09:57 best name 23:10:07 Phantom_Hoover: By the Montana Poultry Growers Cooperative. 23:10:21 ouch 23:10:27 the joke is lost there.... 23:10:27 * Phantom_Hoover → sleep 23:10:29 -!- Phantom_Hoover has quit (Quit: Leaving). 23:10:46 elliott, anyway how is "ICA" such a terrible food store name? 23:10:54 Vorpal: ais523, for one! 23:11:02 what? 23:11:10 elliott, at least they don't change name every 5 years or so like coop does 23:11:24 co-operative food ... they specialize in food that doesn't fight you when you try to eat it? 23:11:53 Yes. 23:11:57 elliott, I don't ever remember these guys changing their logo: https://en.wikipedia.org/wiki/File:Ica_logo.svg 23:11:58 It's like Milliways. 23:12:17 I believe it is a franchise organisation with a common brand actually. 23:12:27 ais523: Heyyyy, everyone calls it Concurrent Idealised Algol. Do they just acronym it differently to avoid "CIA"? :p 23:13:30 it's Idealised Concurrent Algol in the papers I've seen 23:13:48 elliott, anyway: https://en.wikipedia.org/wiki/ICA_AB 23:14:01 ais523: http://www.google.co.uk/search?aq=f&gcx=c&sourceid=chrome&ie=UTF-8&q=idealised+concurrent+algol 23:14:12 all top results say "Concurrent Idealised ALGOL" or "CIA" 23:14:21 ais523: first result that doesn't is that dan ghica guy :P 23:14:28 elliott: they're all the same paper :) 23:14:33 oh, haha 23:14:59 ais523: hmm... there's a different paper referencing CIA on the second page and the ones that don't are Ghica too :P 23:15:02 gah, you just made me lose my /dev/null game through distraction 23:15:03 -!- MDude has quit (Ping timeout: 255 seconds). 23:15:04 I THINK HE'S HIDING THE TRUTH FROM YOU 23:15:06 whoops 23:15:21 ais523, how, nethack is turn based! 23:15:28 ais523: I... will give you my first-born? 23:15:37 DIED : ais523 (Val-Dwa-Fem-Law) 232346 points, killed by a disenchanter on jaafar.devnull.net 23:15:40 ouch 23:15:41 Vorpal: I was paying too much attention to elliott and not enough to my HP 23:15:47 `addquote Vorpal: I was paying too much attention to elliott and not enough to my HP 23:15:48 elliott: it's OK 23:15:49 704) Vorpal: I was paying too much attention to elliott and not enough to my HP 23:15:57 also, that's not a massively good quote 23:15:57 ais523: No, I just really don't like children. 23:16:02 haha 23:16:16 ais523, it is kind of funny out of contecxt 23:16:18 * elliott gets a great idea 23:16:21 context* 23:18:12 ais523: quick, what should I call the command to delete the last quote that was brought up? 23:18:28 elliott: `dellastquote? 23:18:46 ais523: how inelegant! 23:18:52 I was thinking `begone 23:18:59 that'd do too 23:19:03 watch out for race conditions 23:19:16 e.g. if there's been a `quote in the last 5 seconds, do nothing 23:19:31 ais523: meh, `revert 23:19:35 unquote? 23:19:40 olsner++++ 23:19:45 beautiful 23:19:48 perfect 23:20:26 `quote 23:20:29 No output. 23:20:32 oops :/ 23:20:35 how... 23:20:39 `url bin/quote 23:20:41 http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/bin/quote 23:20:49 hmm... 23:20:54 what's wrong with that? 23:20:55 oh, duh 23:21:23 `run echo hi | tee >(cat >test); cat test 23:21:24 sh: Syntax error: "(" unexpected 23:21:29 :/ 23:21:34 `run echo hi | tee >>(cat >test); cat test 23:21:36 sh: Syntax error: "(" unexpected 23:21:37 `run echo hi | tee ><(cat >test); cat test 23:21:38 sh: Syntax error: redirection unexpected 23:21:42 Vorpal: hepl 23:21:47 what are you doing 23:21:55 Vorpal: you how know <(...) passes an fd from a subshell? 23:21:58 I want that, but for output 23:22:05 elliott, I don't think that works 23:22:07 so that tee writes to a subshell instead 23:22:09 elliott, you could use a | pipe 23:22:15 Vorpal: no i can't 23:22:17 i need to tee it 23:22:17 like tee | (cat >test) 23:22:18 I guess 23:22:22 that... 23:22:24 do you know how tee works? 23:22:33 elliott, well obviously it won't work here 23:22:43 but basically I don't think you can do what you ask for 23:22:51 -!- ais523 has quit (Remote host closed the connection). 23:22:59 maybe something like ... 7<(foo) >&7 would work? except that I think it doesn't work 23:23:16 olsner, looks to me like it would get two inputs? 23:23:19 `quote 23:23:21 300) Why do you want to have sex in everything? I don't want. 23:23:25 `quote 23:23:27 340) haha, god made one helluva blunder there :DS "WHOOPS HE AIN'T DEAD YET!" "luckily no one will believe him because christians are such annoying retards" 23:23:29 `quote 23:23:31 146) ais523: killer bunnies can be harmed by domesticated canines only. 23:23:34 `quote 23:23:35 Vorpal: yes, but at a file descriptor you don't care about 23:23:36 -!- pikhq has joined. 23:23:37 239) Is there a name for something where I'm more attracted to someone if I know they've had a rough past? Sgeo, "Little Shop of Horrors" 23:23:44 `unquote 23:23:46 ​*poof* 23:23:49 `quote 239 23:23:51 olsner, well sure, but foo will see it as output, not input 23:23:51 239) And to think: if only we wouldn't celebrate birthdays, there would be no birthday paradox, and we could get by with half as long hash functions. (What do you mean it doesn't work that way?) 23:23:52 `run bash -c "echo hi | tee >(cat >test); cat test" 23:23:55 hi 23:24:03 pikhq: oh, heh 23:24:07 `rm test 23:24:08 No output. 23:24:11 `help 23:24:12 Runs arbitrary code in GNU/Linux. Type "`", or "`run " for full shell commands. "`fetch " downloads files. Files saved to $PWD are persistent, and $PWD/bin is in $PATH. $PWD is a mercurial repository, "`revert " can be used to revert to a revision. See http://codu.org/projects/hackbot/fshg/ 23:24:17 >(...) is a bash/zsh/probably ksh-ism. 23:24:24 oh, wait 23:24:26 this is probably a bad idea 23:24:29 every `quote causes a commit 23:24:32 ...eh, who cares :) 23:24:32 And HackEgo's /bin/sh is, of course, dash. 23:24:40 `revert 787 23:24:42 Done. 23:24:43 (just to undo my test delete) 23:24:50 ah, so bash supports 23:24:56 supports it, but it isn't posix 23:24:58 well right 23:25:02 `quote 23:25:04 590) The fact that the elves will be happy with this will hopefully be counteracted by the fact that I plan to drop them into the magma cistern. 23:25:05 `unquote 23:25:08 ​*poof* 23:25:09 `unquote 23:25:11 cut: lastquote: No such file or directory \ rm: cannot remove `lastquote': No such file or directory 23:25:15 yay :P 23:25:23 `revert 787 23:25:25 Done. 23:25:25 er 23:25:31 elliott, every quote causing a commit? ouch 23:25:35 `revert 793 23:25:36 Done. 23:25:37 elliott, lets see what Gregor says to that 23:25:43 Vorpal: shrug :) it already runs "hg commit" 23:25:46 just ends up as an empty commit 23:25:55 he squashes the repo anyway 23:26:27 (see http://codu.org/projects/hackbot/fshg/index.cgi/shortlog/cdae49db4615) 23:26:45 -!- pikhq_ has quit (Ping timeout: 255 seconds). 23:27:57 if you addquote after the last quote, does unquote remove quote's quote rather than addquote's quote? 23:28:20 No you should require a parameter 23:28:30 [elliott@dinky nondet]$ ./a.out 23:28:31 [elliott@dinky nondet]$ echo $? 23:28:31 14 23:28:31 [elliott@dinky nondet]$ ./a.out 23:28:31 [elliott@dinky nondet]$ echo $? 23:28:31 14 23:28:33 [elliott@dinky nondet]$ ./a.out 23:28:35 [elliott@dinky nondet]$ echo $? 23:28:37 14 23:28:37 zzo38, ... the whole point was to NOT require that 23:28:39 wow 23:28:41 olsner: hmm, yes 23:28:45 olsner: I can fix that if you want :P 23:29:05 Vorpal: Then there is no way that it could work properly, I think. 23:29:06 oh! 23:29:07 i'm an idiot 23:29:11 elliott: I could be convinced that it's a surprise feature though 23:29:21 zzo38, ... it is supposed to refer to last quote all the time 23:30:19 Vorpal: You could make it do that, but what if someone add one in between? 23:30:37 Even possibly by private message? 23:31:08 zzo38, ask elliott 23:33:20 if delquote and unquote prints which quote actually got deleted, you can fix it when there was a race condition and you didn't win 23:33:51 hmm, you're not allowed to printf from a signal handler, right? 23:34:00 elliott, definitely not 23:34:10 right :) 23:34:15 that explains why redirecting to a file made my program silent 23:34:25 * elliott wonders how to do this 23:34:36 elliott, see man 7 signal, it has a list of safe functions about halfway down 23:34:47 yeah, but unless one of those is write i don't care much :P 23:34:59 elliott, what are you trying to do? 23:35:07 write my Secret Project-breaking program 23:35:10 elliott, one of them is write 23:35:17 oh, it is? 23:35:20 then why doesn't printf work :( 23:35:24 elliott, probably not on stdio 23:35:26 elliott, stdio buffers 23:35:31 printf might malloc, and iirc glibc's printf does indeed malloc 23:35:33 you can't use write "on stdio" 23:35:38 elliott, indeed 23:35:44 elliott, that is kind of the point 23:35:50 but fine, I'll use a static buffer 23:35:51 le sigh 23:35:58 does sprintf malloc 23:36:03 elliott, it might 23:36:21 but does it :) 23:36:23 elliott, none of the stdio functions seem to be safe 23:36:27 according to that docs 23:36:32 hmph 23:36:36 actually fstat 23:36:42 but that is useless to yo 23:36:43 you* 23:36:45 i could use write if i just used an unsigned char 23:36:48 but i'd have to reduce my wait time 23:37:23 elliott, anyway what are you doing? 23:37:29 write my Secret Project-breaking program 23:37:37 elliott, I meant how are you doing that 23:37:51 elliott, as in, what is the thing you are making use of to break it 23:37:53 Vorpal: by relying on the timing of busyloops: 23:37:56 volatile unsigned char i = 0; 23:37:56 void handle(int sig) 23:37:56 { 23:37:56 write(0, &i, 1); 23:37:56 } 23:37:56 int main() 23:37:58 { 23:38:00 signal(SIGALRM, handle); 23:38:02 ualarm(1, 10000); 23:38:03 elliott: as I remember it, all the *printf functions do indeed call malloc (in glibc), even the ones you expect to be safe and even if you don't use any fancy features 23:38:04 for (;;) i++; 23:38:06 } 23:38:12 elliott, heh 23:38:20 erm 23:38:21 is 0 stdout 23:38:25 because redirecting it isn't doing shit 23:38:26 (at least I think that's why I had to write my own simple printf in my malloc) 23:38:31 olsner: gross 23:38:32 elliott, lets see what ais has to say about that 23:38:38 Vorpal: i already asked him 23:38:41 he said it doesn't handle that 23:38:42 0=stdin, 1=stdout, right? 23:38:48 elliott, ah 23:38:49 olsner: oh... writing to stdin just happened to work :) 23:39:05 elliott, impressive 23:39:08 [elliott@dinky nondet]$ ./a.out | head -c 100 >a 23:39:08 [elliott@dinky nondet]$ ./a.out | head -c 100 >b 23:39:08 [elliott@dinky nondet]$ diff a b 23:39:08 Binary files a and b differ 23:39:08 there we go 23:39:12 Vorpal: not really, it'll point to /dev/tty 23:39:26 ah 23:39:53 conclusion: you can technically get a PRNG going properly in the Secret Project :) 23:39:58 it won't be very good, though 23:40:06 anyway, I don't think there's any way to exploit this without trying really hard to 23:40:16 so the risk of it happening accidentally is nil 23:40:20 yeah 23:40:26 elliott, you could apply whitening to the PRNG 23:40:26 what does the secret project do, and how is it interesting that you can make a PRNG in it? 23:40:52 olsner, it tries hard to make executing a linux binary deterministic 23:40:53 olsner: makes linux deterministic 23:41:05 unless you do a tricky busyloop :P 23:41:06 olsner, it is ais523's secret project 23:41:19 elliott, there might be other ways to exploit it 23:41:21 hard to tell 23:41:34 Vorpal: nah, anything that does a syscall will be forced to be deterministic, I think 23:41:35 elliott, anyway you could use the above way to seed a proper PRNG. 23:41:40 or maybe just any blocking syscall 23:41:42 so it's ... not so secret after all? or was the secret recently revealed? 23:41:56 Vorpal: anyway, that's what i meant 23:41:58 olsner, the secret is in wtf ais plan to use it fore 23:41:59 for* 23:42:05 elliott, ah 23:42:05 Vorpal: btw, if ais is clever this won't work 23:42:11 Vorpal: he could fake alarm/ualarm 23:42:16 elliott, to do what? 23:42:17 Vorpal: he isn't providing a clock, after all 23:42:23 so it could just allow N context switches 23:42:24 or whatever 23:42:25 and then trigger 23:42:27 heh 23:42:36 Vorpal: I think you could exploit it with two threads, though 23:42:38 one busylooping increment 23:42:42 and one repeatedly doing: 23:42:43 finite busyloop 23:42:45 read value 23:42:53 the values you get would differ on each run 23:42:57 yeah 23:42:58 basically replacing alarm() with a loop :) 23:43:02 hmm 23:43:05 I should implement that in this 23:43:18 I wonder if I could use clone() to avoid dealing with pthreads :) 23:43:36 elliott, how does SP work wrt multi-core? If it effectively causes -j1 then it is pretty useless for your purpose 23:43:58 Vorpal: well, it's a deterministic scheduler, so it obviously can't do SMP 23:44:01 Vorpal: but -j1 isn't that bad 23:44:10 elliott, lets build openoffice 23:44:10 Vorpal: this is going to be done on build machines, they don't have anything better to do all day 23:44:16 Vorpal: dude, I can just build three packages at the same tmie 23:44:17 time 23:44:17 at -j1 23:44:21 that's like -j3 23:44:21 well sure 23:44:29 they're build bots, they have nothing better to do :P 23:45:03 elliott, still if a user ever wants to build a package locally for whatever reason (patching it or changing options or whatever) that will be painful 23:45:15 not that painful, it's never going to do much more than a small division of the time it'll take 23:45:31 if you can wait an hour you can wait ten :) 23:45:39 Vorpal: but it's true, I could deal without the scheduler parts 23:45:51 Vorpal: but I could always just rip out the rest 23:45:59 elliott, assume an 8 core system. Assume a build time of 8 hours (probably not that unrealistic for openoffice -j1...) 23:46:12 now you could potentially cut it to close to 1 hour 23:46:21 probably a bit more due to deps 23:46:34 Vorpal: that's hardly any better, since your computer will be much closer to functionally useless for the latter :) 23:46:45 who the fuck builds their own openoffice, anyway? 23:46:55 good question 23:46:58 Vorpal: btw, you can still benefit from -j just like single-core machines do 23:46:59 for io-bound stuff 23:47:12 like compiling :p 23:47:17 elliott, anyway what about 7 hours and using -j7 on an 8 core machine. You can still run fine on one core 23:47:39 you bought an 8 core machine just to compile openoffice? 23:47:53 elliott, btw iirc suexec of apache needs a PRNG during compile time iirc. I have a vague memory of reading a convoluted explanation for that. 23:47:57 elliott, XD 23:48:05 Vorpal: it can have a prng 23:48:08 it'll just have a constant seed 23:48:23 so Vorpal is secretly an openoffice developer? 23:48:33 it's his shame 23:48:36 I think the name "q" is too short I can call a program "AstroQ" instead, and based on Swiss Ephemeris. Another idea would be the feature that you can input dates in Discordian calendar (both literal and standard interpretations) 23:48:44 shouldn't we be talking about libreoffice nowadays 23:48:45 olsner, no 23:48:50 zzo38: I like AstroQ 23:48:52 elliott, oh, good point 23:49:11 Vorpal: if you have a source for that suexec thing that'd be fun 23:49:40 elliott: OK. 23:50:07 hmm, I think this paper would be more interesting if it had sold me on its original premise 23:50:36 elliott, this was back during like apache 1.3 or something I read it. 23:51:14 elliott, I can't find any mention of it in the modern apache docs 23:51:18 :( 23:51:22 so who knows, I might even misremember 23:51:33 i could buy it needing a prng at runtime 23:51:37 but at build time? binary packages would destroy that 23:51:44 hm 23:52:23 god, if there's one thing i hate more than slavery, it's two-column pdfs 23:52:30 elliott, why? 23:52:38 i have to scroll up whenever i reach the bottom of a page 23:52:39 it's stupid 23:53:06 elliott, that wasn't what I asked. Anyway those PDFs are obviously intended for printing or viewing on an upright display 23:53:15 note: my current desktop monitor can't be rotated :( 23:53:44 elliott, the question was obviously "why is slavery that almost as bad as two-column pdfs" 23:54:16 heh 23:54:55 anyway rotating monitors tend to be annoying to rotate. The cables get stuck in the wrong place and so on. 23:56:05 elliott, so, what paper are you reading= 23:56:07 s/=/?/ 23:56:18 thing about nix 23:56:43 oh, "Building the product can take 8/number_cores hours on a reasonably recent processor ..." 23:56:46 looks like Vorpal knew the build time for libreoffice, further proof that he is indeed one of them 23:57:18 olsner, that was a pure speculation. I seem to remember something like 6 hours though 23:57:42 olsner, anyway I selected that because the numbers became easy: 8/8=1 23:59:06 `fetch http://sprunge.us/gPij 23:59:07 2011-11-02 23:59:07 URL:http://sprunge.us/gPij [243] -> "gPij" [1] 23:59:15 `run mv gPij bin/delquote; chmod +x bin/delquote 23:59:17 No output. 23:59:20 `addquote poop butt 23:59:22 705) poop butt 23:59:25 Vorpal: right, the only problem is that that's exactly what we'd expect one of them to say 23:59:26 `unquote 23:59:28 cut: the delimiter must be a single character \ Try `cut --help' for more information. \ *poof* 23:59:31 yay 23:59:36 `quote 705 23:59:38 No output. 23:59:49 well, it kind of works 2011-11-03: 00:00:15 olsner, you could check contributor list? 00:00:30 `quote 00:00:32 89) Discrimination fields ACTIVATE. 00:00:39 `quote 704 00:00:41 704) Vorpal: I was paying too much attention to elliott and not enough to my HP 00:00:59 `run echo "99) x" | cut -d') ' -f2- 00:01:00 cut: the delimiter must be a single character \ Try `cut --help' for more information. 00:01:05 `run echo "99) x" | cut -d')' -f2- 00:01:05 In constructor 'connectivity::OConnectionPool::OConnectionPool(const com::sun::star::uno::Reference&, const com::sun::star::uno::Reference&, const com::sun::star::uno::Reference&)': 00:01:06 x 00:01:18 olsner, ouch, wtf is that crap? 00:01:19 `run echo -n A; echo "99) x" | cut -d')' -f2- | tail -c +1; echo -n B 00:01:20 A x \ B 00:01:30 `run echo -n A; echo "99) x" | cut -d')' -f2- | tail -c +2; echo -n B 00:01:32 Ax \ B 00:01:48 Vorpal: as you already know, libreoffice 00:01:53 `fetch http://sprunge.us/QDQC 00:01:55 2011-11-03 00:01:54 URL:http://sprunge.us/QDQC [241] -> "QDQC" [1] 00:01:56 olsner, is someone applying java style com.sun.whatever to C++ code? 00:01:57 eww 00:02:00 `run mv QDQC bin/delquote; chmod +x bin/delquote 00:02:02 No output. 00:02:04 that is just gross 00:02:08 `addquote haha moron mountain 00:02:10 705) haha moron mountain 00:02:13 `unquote 00:02:15 ​*poof* haha moron mountain 00:02:18 `quote 00:02:20 401) [...] So it'll be a while before the boob will touch you back. 00:02:21 `quote 00:02:23 140) * Phantom_Hoover wonders where the size of the compiled Linux kernel comes from. To comply with the GFDL, there's a copy of Wikipedia in there. 00:02:26 `quote 00:02:27 `quote 00:02:28 31) I am not on the moon. 00:02:29 320) it is from 2002 though, I was younger then 00:02:36 `unquote 00:02:38 `quote 00:02:41 Vorpal: idiot 00:02:42 550) like i could ask how many "petals" are there on each of the "flowers" on this coffee mug i just made a drink with but that would be NP hard I think 00:02:42 ​*poof* I am not on the moon. 00:02:45 elliott, what? 00:03:02 Vorpal: `quote as i `unquote 00:03:06 `undo...that 00:03:08 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: undo...that: not found 00:03:10 `help 00:03:11 Runs arbitrary code in GNU/Linux. Type "`", or "`run " for full shell commands. "`fetch " downloads files. Files saved to $PWD are persistent, and $PWD/bin is in $PATH. $PWD is a mercurial repository, "`revert " can be used to revert to a revision. See http://codu.org/projects/hackbot/fshg/ 00:03:13 elliott, mine came after 00:03:18 `quote 00:03:18 `quote 00:03:18 31) I am not on the moon. 00:03:18 320) it is from 2002 though, I was younger then 00:03:18 `unquote 00:03:19 `quote 00:03:21 that is what I saw 00:03:22 Gregor: pls make `revert go to last revision, thanks 00:03:51 `revert 812 00:03:52 Done. 00:04:05 `quote 31 00:04:07 31) I am not on the moon. 00:04:24 -!- MSleep has joined. 00:05:11 `quote 00:05:13 268) gah, why does lose keep winning? 00:05:28 `quote 00:05:30 254) are you always careful to have a small enough margin so that it can't contain the proof? nddrylliog: i usually use latex, and make sure my hd is almost full 00:05:42 `quote 00:05:44 83) I'd imagine that it already has, and no one noticed 00:05:52 that what already has? 00:05:59 `unquote 00:06:02 bad quote 00:06:02 ​*poof* I'd imagine that it already has, and no one noticed 00:06:03 yeah 00:06:05 `quote 82 00:06:06 `quote 00:06:06 `log I'd imagine that it already has, and no one noticed 00:06:07 82) hmm... does anyone know a nonsense game designed for the mentally handicapped involving yelling 00:06:17 `quote 00:06:22 697) Can you file for univorce if you are unmarried and don't like yourself anymore? 00:06:27 `log I'd imagine that it already has, and no one noticed 00:06:30 `quote 00:06:35 358) what telnets are there [...] where are a list of telnets? 00:06:35 Vorpal: stop clogging it 00:06:38 63) if a girl is that cute, i don't care how many penises she has 00:06:38 No output. 00:06:42 `log I'd imagine that it already has, and no one noticed 00:06:59 No output. 00:07:05 `quote 00:07:08 2011-08-13.txt:01:49:52: 2) EgoBot just opened a chat session with me to say "bork bork bork" \ 8) TODO: sex life \ 66) What else is there to vim besides editing commands? \ 90) I'd imagine that it already has, and no one noticed \ 92) Where's the link to the log? 00:07:08 99) oklopol geez what are you doing here ...i don't know :< i actually ate until now, although i guess i also did other things... 00:07:32 it said no output then gave you the lock entry? 00:07:34 strange 00:07:41 "The most risky part of the intensional model is the use of hash 00:07:41 rewriting. It comes as a shock to some that this even works, i.e., 00:07:41 doesn’t produce broken binaries. In [2], we even wrote that “patch- 00:07:41 ing files [by rewriting hashes] is unlikely to work in general, e.g., 00:07:41 due to internal checksums on files being invalidated in the process.” 00:07:42 It turns out that this assessment was too pessimistic." 00:08:33 only installers and unpackers and such really check internal checksums 00:08:39 at least in my experience 00:08:58 I think .jars will break 00:09:00 see: META-INF 00:09:06 but you can just trash META-INF 00:09:21 elliott, well, the .jars don't need ELF patching 00:09:28 that wouldn't even make sense 00:09:47 Vorpal: this isn't talking about ELF patching, what makes you think it is 00:10:00 elliott, oh 00:10:01 okay 00:10:05 this is about rewriting references to a fake prefix after the fact 00:10:08 because the prefix depends on the output 00:10:15 -!- ive has joined. 00:10:29 elliott, what if it the length ends up wrong or such for the embedded string 00:10:38 Vorpal: the part being replaced is a hash 00:10:42 ah 00:11:03 elliott, what is the use of it? 00:11:30 Vorpal: content-based addressing for safe sharing of binary builds between multiple users from possibly-untrusted sources in Nix 00:11:40 ah 00:12:49 Vorpal: (without mutual trust between users) 00:13:39 obviously 00:14:51 -!- sllide has quit (Read error: Connection reset by peer). 00:15:52 -!- CakeProphet has joined. 00:16:09 higuys 00:16:17 `log sincere idle thought 00:16:23 2011-11-03.txt:00:16:17: `log sincere idle thought 00:16:31 `log idle thought 00:16:37 2006-08-20.txt:01:09:41: Just idle thought. 00:18:25 CakeProphet: ? 00:18:41 CakeProphet: Anyway, re: 00:18:42 07:32:55: ...you haven't seen Cascade yet? 00:18:43 07:33:08: Go watch that, then the first [S] of the intermission 00:18:43 07:33:35: ....I'm watching it right now, obviously. 00:18:43 07:33:38: as I just talked about it loading... 00:18:53 elliott: ugh read the logs sheesh you'll totally understand why I just did that. 00:18:57 CakeProphet: Sgeo was surprised because Cascade has been out since the 25th and everyone has seen it by now. 00:19:23 * CakeProphet is untrendy. 00:19:50 I got tired of waiting for updates so I took a break from homestuck. 00:20:02 but then finally decided since cool new stuff is happening I should check it out. 00:20:24 fortunately none of this makes any difference in the outcome of, well, anything. 00:20:26 CakeProphet: You realise the hiatus was announced ahead of time? 00:20:31 yep. 00:20:49 I was referring more to waiting in general. 00:21:01 I was just going to forget about Homestuck and then revisit once a new mass of updates had surfaced. 00:21:48 as a way to short circuit my impatience. :D 00:22:35 http://www.flickr.com/photos/eelcovisser/367433201/ 00:22:37 I need me one of these. 00:22:40 -!- tiffany has quit (Quit: Leaving). 00:23:08 elliott: I think instead you need 00:23:08 http://3.bp.blogspot.com/_0-b7ADnCqWs/S8JVH96_M1I/AAAAAAAAAG0/Eb1T9FutITM/s1600/rims.jpg 00:23:12 these dope rims. 00:24:09 Could the feature of Swiss Ephemeris to make fictitious planets be used to calculate the Ecclesiastical moon or the positions of where artificial satellites are supposed to be? 00:24:20 I imagine you need a step ladder to get in that thing. 00:24:37 though maybe somewhere in that blurry pixelation is a step-up bar. 00:24:49 http://www.flickr.com/photos/eelcovisser/367433201/ <-- is that a 4-power cord PSU? 00:25:05 I wasn't aware more than 2 power cords for a PSU existed 00:25:18 I wasn't aware rims could be quite this dope. 00:25:21 I think it's just four PSUs. 00:25:33 oh 00:26:02 CakeProphet, is that a weird no-air tyre? 00:26:22 I'm not sure. They may just be really thin. 00:26:42 but they certainly don't look inflated. 00:26:54 again, too many pixels and not enough tire to discern. 00:26:58 hot-swappable PSUs are infinitely cool btw 00:27:21 CakeProphet, don't you agree? 00:27:29 Vorpal: Do you have a spare computer. 00:27:34 elliott, why? 00:27:39 Vorpal: I need a build farm. 00:27:52 Vorpal: as a mindless tool I must agree. 00:27:57 elliott, not anything that would be useful to you. A pentium 3 with a dead hdd. 00:28:04 Great! It's build1. 00:28:06 and I don't have any other IDE disk 00:28:19 It can just netboot and run from RAM. 00:28:19 and VGA is dead on it 00:28:27 It's a server, don't need a display! 00:28:28 elliott, 256 MB RAM iirc 00:28:35 It can compile very small packages. 00:28:36 Slowly. 00:28:55 elliott, XD 00:29:01 elliott, you have that imac iirc 00:29:03 use that 00:29:10 No :P 00:29:26 elliott, anyway this is a non-issue until you actually have a working distro 00:29:29 this is what a typical American drives. http://aofg.blogs.com/photos/uncategorized/2008/08/08/rims.jpg 00:29:30 elliott, oh and it can't boot from usb iirc. 00:29:52 50 miles to and from work every day. 00:30:12 CakeProphet: I doubt they drive something with tyres like that. 00:30:12 elliott, I have a first model ibook with 64 MB RAM too 00:30:28 elliott: hahahahaha tyres 00:30:31 also, 00:30:36 <--- PRIMARY SOURCE 00:30:41 totally reliable. 00:31:10 I am an eyewitness to native American (read: not the amerind kind) practices. 00:32:34 CakeProphet: That is more accurate than I want to admit. 00:32:44 elliott: Some morons actually drive with tires like that. 00:32:56 I don't think I've seen it on an SUV, but hey. 00:36:29 * CakeProphet considers retyring to bed soon. 00:37:22 CakeProphet: You realise there are about two countries on the globe that say "tire", right? 00:37:23 -!- calamari has quit (Quit: Leaving). 00:38:14 elliott: well we both say "tire" I'm pretty sure. 00:38:22 :> 00:39:00 I really need ops so I can kick CakeProphet. 00:39:31 CakeProphet: Which country are you from, anyways? 00:39:55 the United States of America. 00:40:40 elliott: I think it's probably bettre that you don't have ops. 00:40:43 elliott: "Tire" is the more etymologically correct spelling. It derives from Middle English "tire". :) 00:40:58 pikhq: You're the more etymologically correct poop. 00:41:29 Hey guys should I move on to the loooong thesis I'm so lazy. 00:41:44 long thesis is looooong. 00:44:31 CakeProphet: You've convinced me, phd-thesis.pdf is oooopened. 00:44:36 monqy: Read this thesis for me? 00:44:38 I'm lazy. 00:44:57 I'm wondering how you could handle regular expressions like: 00:45:24 What, is Eelco a common name in some country? This guy is called Eelco and so is his supervisor. 00:45:26 (long|.*) .* is (lo+ng|\1) 00:45:50 CakeProphet: You don't. 00:45:52 where if the first choice in the first group is picked the first choice in the second group is forced. 00:46:05 You can't even do ".* .* is lo+ng". 00:46:09 Well. 00:46:13 without resorting to the usual Perl hacks. 00:46:15 You can but it probably doesn't mean what you want. 00:46:24 Depends, I guess. 00:46:28 okay well s/[.]/\S/g 00:46:45 "The results of the present thesis 00:46:45 are probably not what any of us had expected at the start; but then again, the nice thing 00:46:46 about a term like “variability” is that it can take you in so many directions." 00:47:30 variably many directions, perhaps. 00:48:25 "The #klaplopers provided a nice work environment in virtual space—though whether IRC 00:48:25 is a medium that increases productivity remains an unanswered empirical question." 00:50:01 I suppose one way to do it would be to have a way to tag lists of alternate choices. lists with like tags must match on the choice with the same index in their respective lists (requesting better wording) 00:50:06 Oh my God, this is the longest thing. 00:50:19 CakeProphet: Are you sure that regexp doesn't actually work in Perl already? 00:50:30 this is probably better than using conditional patterns or state stuff. 00:50:31 i.e. /(long|\S+) .* is (lo+ng|\1)/ 00:50:58 I suppose it does, yes... 00:51:09 except 00:51:10 for 00:51:15 blah cat is looooooong 00:51:19 is not intended 00:51:31 only blah cat is blah 00:52:35 CakeProphet: /(\S+) \S+ is \1|long \S+ is lo+ng/ 00:53:02 that quickly becomes unreasonable if the pattern becomes more complex but requires the same logic. 00:54:00 I am pretty sure Perl has some special variable for specifically such construct. 00:54:03 s 00:54:07 "This thesis is about getting computer programs from one machine to another—and having 00:54:08 them still work when they get there." 00:54:24 "this thesis is about portability" 00:54:29 they should have me as their editor. 00:55:29 pikhq: Did you see my bps question btw? 00:55:35 CakeProphet: No, it's nothing to do with portability at all. 00:57:59 ah yes they already have a tagging thing sort of. you can use (*MARK:NAME) and the (*SKIP:NAME) or something 01:00:07 -!- MSleep has changed nick to MDude. 01:01:19 -!- yorick has quit (Ping timeout: 260 seconds). 01:11:30 elliott: mrf 01:11:38 pikhq: hi 01:15:32 -!- yorick has joined. 01:33:04 -!- Patashu has quit (Quit: MSN: Patashu@hotmail.com , Gmail: Patashu0@gmail.com , AIM: Patashu0 , YIM: patashu2 , Skype: patashu0 .). 01:39:13 http://j-lyric.net/artist/a0006c3/l00d951.html Engrish song lyrics are so very strange. 01:42:29 ah. 01:48:58 -!- copumpkin has changed nick to gourd. 01:50:15 -!- gourd has changed nick to copumpkin. 01:54:22 It's even better/worse if you hear it. 01:56:20 https://www.youtube.com/watch?v=h2-d2zHMJho Yeaaah. 02:02:42 And this is a band that tours in the US. 02:04:24 -!- Vorpal has quit (Ping timeout: 240 seconds). 02:28:29 -!- elliott_ has joined. 02:28:30 -!- elliott has quit (Read error: Connection reset by peer). 02:49:50 bye elliott 02:55:33 good riddance 02:55:40 i'm so tired 03:10:36 -!- centrinia has quit (Quit: Leaving). 03:21:01 Is there any such thing as ComonadPlus? 03:34:04 I do not have Control.Monad.Zip 03:43:31 it's in base, I guess you have too old a ghc 03:43:41 oh, it's for monad comrephensions 03:43:44 ghc 7.2 or up then i guess 03:51:30 -!- pikhq has quit (Ping timeout: 256 seconds). 03:51:33 -!- pikhq_ has joined. 04:09:46 -!- sxfil has joined. 04:26:54 -!- zzo38 has quit (Ping timeout: 252 seconds). 04:29:09 -!- sxfil has quit (Quit: begone). 04:33:40 elliott_: what thesis 04:33:57 nix 04:33:59 thesis 04:34:02 nix thesis 04:34:33 phd-thesis.pdf good name 04:38:48 -!- Sgeo|web has joined. 04:58:18 -!- zzo38 has joined. 04:59:10 When are more evening school assignments will be posted? 04:59:38 zzo38: you aren't running a Markov bot, are you? 04:59:56 I am not running a Markov bot. 05:02:22 -!- Patashu has joined. 05:03:26 zzo38: you aren't the Markov bot, are you? 05:04:04 zzo38: I ask because your previous question was not grammatically correct, and this is often caused by running a Markov bot. 05:06:05 coppro: like half the things said in here are grammatically incorrect 05:06:20 elliott_: yeah but most of them make sense all the same 05:06:27 uh 05:06:28 like that last one 05:06:29 did zzo38 not make sense 05:06:36 you clearly don't read the channel enough when me and monqy are around 05:06:37 also 05:06:41 what zzo said made perfect sense 05:07:00 no, it really doesn't 05:07:05 yes it does 05:07:06 see topic 05:07:07 especially since he's asking this channel 05:07:12 those are the current evening school assignments 05:07:13 oh 05:07:18 he is asking when more will be posted 05:07:26 dammit do I have to do them? 05:07:26 Maybe it make sense to elliott_ but it doesn't make sense to coppro. 05:07:28 if you paid attention more, you would understand things said in the channel more! 05:09:58 elliott_: you didn't answer my question 05:10:01 also attention is for losers 05:10:04 which question 05:10:18 < coopro> dammit do I have to do them? 05:10:23 coopro 05:10:24 s/oo/op/ 05:10:30 cooooooopro 05:10:34 that was addressed at me? anyway, yes 05:10:34 coproo 05:10:35 poocro 05:10:41 it's funny because coppro means poop4 05:11:02 dammit 05:11:22 they're easy; the underload ones at least 05:14:45 looking at 1 first 05:14:52 xor is trivial since you have nand 05:15:50 trying to think on the wire-crossing problem 05:15:53 (don't spoil it) 05:16:31 coppro: haven't done the circuite ones :) 05:16:40 underload is my one true love :') 05:20:27 elliott_: also the NOT gate there is overcomplicated 05:20:39 just link a cell up to a constant 1 05:22:08 tell atehwa, not me :) 05:23:03 oh, did atehwa write these? 05:23:39 ah, I see that he did 05:23:40 neat 05:23:46 coppro: he's the one doing the school 05:24:04 you might find it helpful to swim to helsinki 05:24:41 haha 05:24:45 I should give a talk on esolangs 05:25:07 elliott_: also you went idle in BN 05:25:14 it's been 7 days? 05:25:15 well you haven't yet 05:25:19 but you haven't done anything in 5 05:25:34 probably for the best for now, I'm a bit busy 05:25:39 hopefully I'll return before the end of the dynasty 05:30:17 pretty sure you can't cross wires in circuite 05:30:23 but I'm off to read more about combinatorial designs 05:48:14 coppro: "Circute is a cellular automaton (and quite arguably an esoteric programming language) developed by Chris Pressey in 2005 as a test of the wire-crossing problem." 05:48:14 so duh 05:48:20 oh is that a spoiler 05:48:21 sry :) 05:48:39 coppro: ^^^ HEY DON'T READ THE ABOVE ^^^ 05:51:02 Isn't that. 05:51:06 3D redstone pretty much. 05:51:17 2D* 05:51:26 * Madoka-Kaname wonders 05:51:31 Can you make a 2D wire crossing in Redstone/ 05:51:55 I doubt it. 05:55:52 -!- Darth_Cliche has quit (Quit: You are now graced with my absence.). 05:56:36 "You are now graced with my absence." isn't that an evincar thing? 06:04:41 * Sgeo|web is currently reading about: Agda 06:05:52 monqy: oh maybe it client default 06:06:17 < 1320127749 343527 :evincar!~evincar@daffa.student.rit.edu QUIT :Quit: I give you the gift of lack of me. 06:06:20 nope different!!! 06:16:01 -!- quintopia has quit (Ping timeout: 276 seconds). 06:22:20 -!- oerjan has joined. 06:23:48 -!- quintopia has joined. 06:23:49 -!- quintopia has quit (Changing host). 06:23:49 -!- quintopia has joined. 06:43:51 -!- hagb4rd has joined. 06:48:20 -!- MDude has changed nick to MSleep. 06:54:33 -!- monqy has quit (Quit: hello). 06:59:31 -!- Ngevd has joined. 07:01:49 It is my birthday today 07:02:33 Happy prime age! 07:02:43 I'm in the prime of my life 07:02:58 Ngevd: die :( 07:03:00 And have been for quarter of an hour 07:03:15 elliott_, stop being so young. 07:03:22 You think you know everything! 07:03:23 Hey, monqy's younger. 07:03:25 Also cooler. :'( 07:03:26 elliott_: 16 is a very powerful age too 07:03:28 * elliott_ mediocre. 07:03:31 But when you get to my age... 07:03:32 fourth power, even 07:03:46 oerjan: I need ops so I can kick you 07:04:04 how old are y'all? 07:04:08 17 07:04:24 unfulfilled needs, the bane of 16-year olds everywhere 07:04:26 * elliott_ is actually a ghost. 07:04:28 4| 07:04:31 er 07:04:35 *41 07:04:42 oerjan: Wow you're 41 already? 07:04:44 So old. So dead. 07:04:52 *Brains...* 07:04:54 * copumpkin murders elliott_ 07:05:04 copumpkin: I'm a ghost you can't murder me that makes no sense. 07:05:12 yeah it does 07:05:21 I bought me a special ghost-murdering knife 07:05:24 it said so on the package 07:05:32 "works on ghosts or your money back" 07:05:43 "as seen on TV" 07:06:19 copumpkin: You might want to get your money back. Also ghosts can't appear on TV, they're ghosts. 07:06:24 Contractual stuff, you wouldn't understand. 07:06:27 * elliott_ dead lawyer 07:06:38 copumpkin: they're depending on you not being able to prove no ghosts were killed, since they're invisible 07:07:09 * copumpkin commits suicide to murder elliott_ in the afterlife 07:07:17 best plan. 07:07:22 god dammit 07:07:23 now we are on the same plane 07:07:31 I HAVE POWER OVER YOU ONCE MORE 07:07:35 copumpkin: You'd make a good nomic player. Well, if you didn't commit suicide. 07:07:46 (Has anyone ever committed suicide for a nomic scam? oerjan?) 07:07:59 no, not me. 07:09:12 OH REALLY :| 07:09:45 i should get some of that ethereal vision philter i just read about in yafgc 07:10:21 (btw it became swiftly clear during my current binge that it is not what you call nsfw) 07:10:27 fortunately i'm not working 07:10:35 not what you call nsfw 07:10:37 ok, so sfw then 07:10:43 oops 07:10:46 *-not 07:10:47 * elliott_ goes to read it at work! 07:10:57 NOOOOOooooooooo oerjan got me fired from dead lawyering. 07:11:03 oerjan: are you reading the IWC rerun :P 07:11:21 yes, especially when i realized he's adding new annotations 07:11:22 -!- Taneb has joined. 07:11:30 I'm terribly afraid I'm going to end up following the whole thing to its completion 07:11:50 elliott_: that will take > 10 years i think 07:11:59 oerjan: um IWC didn't run for ten years... 07:12:07 no, but... 07:12:07 It did 07:12:14 8 07:12:14 Well, just short of 07:12:17 that's not just short of :P 07:12:19 2001-2011 07:12:24 no? 07:12:24 > (7/6) * 3198 / 365.25 07:12:25 10.21492128678987 07:12:25 http://irregularwebcomic.net/archive.html 07:12:27 one comic in 2002 07:12:32 then regularly 2003 onwards 07:12:36 so 8 years 07:12:38 Memory is playing tricks on me 07:12:45 elliott_: it becomes just > 10 when you adjust for the 7 to 6 days per week shift 07:12:54 oerjan: oh, right. 07:12:58 oerjan: well, I gotta lot of time. 07:13:00 -!- Ngevd has quit (Ping timeout: 244 seconds). 07:13:11 oerjan: (does this mean he's going to be writing blog posts for /ten years/?0 07:13:13 s/0/)/ 07:13:20 heh 07:13:39 there will probably be readjustments. 07:14:13 but then, in 3-4 years d&d may end 07:15:47 oerjan: and then Mezzacotta :P 07:16:52 oerjan: omg today's mezzacotta :D 07:17:07 what was that again -> 07:17:40 mad sci guy always gets my vote 07:20:33 -!- ive has quit (Ping timeout: 245 seconds). 07:21:24 oerjan: hmm, I think Mezzacotta's random date thing is strongly biased against ridiculously old dates... 07:21:29 -!- SgeoN1 has quit (Quit: Bye). 07:21:47 elliott_: i think that's called "uniform distribution" 07:22:05 har har 07:22:13 oerjan: but seriously, the vast majority of results are before 10000 BC 07:22:16 -!- Taneb has quit (Ping timeout: 240 seconds). 07:22:20 * elliott_ suspects weighting 07:22:41 er, that's what you'd expect if there were _no_ weighting 07:23:24 oerjan: um... no? 07:23:28 there's more of the past than the present 07:23:32 oh 07:23:34 s/before/after/ 07:23:43 * elliott_ is not an idiot, but cannot type :P 07:23:53 ah yes. 07:24:06 yes, definitely 07:24:19 i read your "against" as "towards" 07:24:26 :) 07:24:27 (same word in norwegian) 07:24:44 http://www.mezzacotta.net/archive.php?date=random 07:24:45 um 07:24:46 augh 07:24:48 http://www.mezzacotta.net/archive.php?date=1614-12-27 07:24:50 ^^^ the best 07:25:21 http://www.mezzacotta.net/archive.php?date=1693-05-03 :D 07:25:54 http://www.mezzacotta.net/archive.php?date=1506-01-04 07:26:00 Clicking random makes me feel weird 07:26:05 http://www.mezzacotta.net/archive.php?date=193-08-23 is a random one I clicked on 07:26:58 Clicking random makes me feel weird 07:27:00 ????????????? 07:27:38 elliott_: if I don't bookmark it or something, in all likelihood, it will never be seen again 07:28:00 * Sgeo|web remembers when he was young, he wanted to record all die rolls etc. for Monopoly games 07:28:01 Sgeo|web: Other comics that will never be seen again: ones you don't see at all. 07:28:12 Thus, you must archive binge Mezzacotta to avoid the same weirdness. 07:28:57 * Sgeo|web will archive binge Mezzacotta, and won't eat or sleep until he's done 07:29:10 Well, that solves that problem. 07:29:18 Does being dead count as being done? 07:29:30 Wait, even then, I still won't eat or sleep, so it's all good 07:30:32 "Obayashi recalled that his producer told him that Toho was tired of losing money on comprehensible films and were ready to let Obayashi direct the House script, which they felt was incomprehensible." 07:31:15 Night all 07:35:18 -!- elliott_ has quit (Read error: Operation timed out). 08:15:06 -!- ive has joined. 09:05:30 I think I could make instance Alternative IO now, allowing you to use many, some, optional. empty = fail []; x <|> y = catch x $ \e -> modifyIOError (\z -> if z == userError [] then e else z) y; 09:22:30 -!- ive has quit (Quit: leaving). 09:38:45 I don't like the way of pure code exceptions in GHC. But I do have another idea: mkPure :: Q Exp -> Q Exp; instance Applicative Pure; runPure :: Pure t -> Either SomeException t; 09:40:27 runPureIO :: Pure t -> IO t; 09:43:48 -!- Sgeo|web has quit (Ping timeout: 265 seconds). 09:43:59 -!- zzo38 has quit (Remote host closed the connection). 09:55:38 coppro: true, but I thought it would give more hints as to how to make a XOR gate. 10:02:22 @tell elliott That's some gouda cheese! 10:02:22 Consider it noted. 10:02:39 -!- oerjan has quit (Quit: leaving). 10:27:34 -!- GreaseMonkey has quit (Quit: The Other Game). 11:18:50 -!- ais523 has joined. 11:22:29 -!- Jafet has joined. 11:31:21 so today I learned that when you have a red parent and a black uncle, you rotate right around your grandparent. 11:31:49 well left or right, depending on where you are. 11:34:26 makes perfect sense. 11:35:43 also your grandparent magically becomes red and your parent becomes black 11:48:29 And that's how communism propagates. 11:50:53 interestingly, in my data structures class we often devolved to race-related humor. 11:51:00 because, you know, we're Americans. 11:51:09 who knew colors could be so humorous! 11:52:11 for example, the professor said that the parent node "goes black" to which a student commented, "once you go black, you never go back." 11:52:16 priceless American humour 11:52:45 Did they play you the red-black tree song in class? 11:55:29 uh, no. 11:55:35 what is that. 11:55:36 They should have. 11:55:49 "I see a brand new node / I want to paint it black." 11:56:12 ...... 11:56:14 http://www.cs.washington.edu/orgs/student-affairs/cseband/ "Red Black Tree Song" 11:56:26 what the hell 11:56:28 (I am assuming it's the one I know of, didn't listen.) 11:57:08 (I mean, how many people have done songs about red-black trees?) 11:57:22 .....lol 11:57:37 wow. 11:57:45 rotating subtrees has never sounded so beautiful. 12:05:16 I find it sad that I know AT LEAST 4 CS majors in real life 12:05:24 and none of them would appreciate this song. 12:05:33 I am alone. ;_; 12:07:55 so, if you don't ignore constant factors, red-black is O(2log(n)) and AVL is O(log(n)) 12:08:11 so, technicall speaking, AVL trees /are/ more efficient, it's just that no one cares about constant factors. 12:09:14 AVL trees are often compared with red-black trees because they support the same set of operations and because red-black trees also take O(log n) time for the basic operations. Because AVL trees are more rigidly balanced, they are faster than red-black trees for lookup intensive applications.[3] However, red-black trees are faster for insertion and removal.[citation needed]. 12:09:32 good reliable information from wikipedia 12:21:16 -!- Patashu has quit (Quit: MSN: Patashu@hotmail.com , Gmail: Patashu0@gmail.com , AIM: Patashu0 , YIM: patashu2 , Skype: patashu0 .). 12:46:43 -!- ais523 has quit (Ping timeout: 248 seconds). 12:56:48 -!- ais523 has joined. 13:01:29 -!- ais523_ has joined. 13:01:33 -!- ais523 has quit (Disconnected by services). 13:01:34 -!- ais523_ has changed nick to ais523. 13:30:57 -!- Ngevd has joined. 13:36:52 -!- Ngevd has quit (Ping timeout: 256 seconds). 13:37:04 -!- MSleep has quit (Read error: Connection reset by peer). 13:37:18 -!- MSleep has joined. 13:37:39 -!- Ngevd has joined. 13:37:55 "You can meet people over the Internet (oh God, can you), but something in our monkey brains makes in-the-flesh meeting a bigger thing." 13:38:05 http://www.kalzumeus.com/2011/10/28/dont-call-yourself-a-programmer/ 13:38:15 I'll agree with that 13:38:35 alternative title: how to hate programming for a living but make a lot of money. 13:38:44 looks like useful advice so far. 13:39:59 granted the goal of this article seems to be not getting stuck in a dead-end job, but moving forward until you get to the interesting things. 13:41:41 the "focus on how you can make revenue or reduce costs" bit seems to make a lot of sense. But what if you the employer is more interested in the challenging technical problems you've solved? 13:44:26 Whoa, it's my birthday, isn't it? 13:44:36 must be. 13:44:44 so are there any like... 13:44:49 HTML "IDEs"? 13:44:55 that make HTML not a pain in the ass? 13:45:11 Yes, but they make bad HTML 13:45:23 no I want to write the HTML 13:45:26 but have things that make that easier. 13:45:28 Ooh 13:45:32 actually I want to write Django templates. 13:45:34 Bluefish? 13:45:35 but whatever. 13:46:07 looks like a normal text editor. Could I just use emacs with some bitchin' HTML mode instead. 13:47:27 I'm not all too familiar with emacs 13:47:27 http://ourcomments.org/Emacs/nXhtml/doc/nxhtml.html 13:47:29 this looks good. 13:48:07 actually emacs html-mode itself has some convenience things. 13:48:12 I tried one of them fancy text editors once, couldn't stay focused enough to get the hang of it 13:48:21 C-c C-a 13:48:22 Interactively insert attribute values for the current tag (sgml-attributes). 13:48:44 -!- DH____ has joined. 13:48:59 C-c C-f 13:49:00 Skip across a balanced tag group (which extends from an opening tag through its corresponding closing tag) (sgml-skip-tag-forward). A numeric argument acts as a repeat count. 13:49:07 looks good. 13:49:36 C-c C-d 13:49:36 Delete the tag at or after point, and delete the matching tag too (sgml-delete-tag). If the tag at or after point is an opening tag, delete the closing tag too; if it is a closing tag, delete the opening tag too. 13:49:41 also excellent. 13:50:22 I wonder what I did before I started using emacs.. 13:50:32 horrible terrible things. 13:51:15 oh dude it even has like docs. C-c ? tagname 13:51:22 like, radical. 13:51:33 Should I try to use Emacs? 13:51:38 Ngevd: I recommend it. 13:51:54 Aaah! 13:51:55 it's not terribly complicated. Though I'm sure I don't use every single feature available. 13:51:59 Which emacs package do I want! 13:52:05 * emacs23 13:52:05 * emacs23-nox 13:52:05 * e3 13:52:05 * emacs-snapshot 13:52:05 * emacs-snapshot-nox 13:52:06 * emacs23-lucid 13:52:08 * jove 13:52:11 emacs23 probably. 13:53:04 C-v for example is page down, M-v is page up. C-a is beginning of line, C-e is end of line. C-k deletes (actually cuts) everything on the after the cursor 13:53:17 A couple of months ago I realised that I could touchtype pretty accurately without looking at the keyboard 13:53:21 Pretty quickly too 13:53:35 C-y is paste, M-y after C-y starts going through old pastes. 13:53:52 so if you've got an out of place line. 13:54:13 you just go to it. then C-a, C-k, move to where you want it to go, C-y 13:54:39 Installing now 13:55:00 meanwhile your counterpart in another universe is reaching for the mouse or doing weird awkward key combinations. 13:55:11 Or using vi 13:55:19 oh right. yeah I don't know anything about vi. 13:55:27 I found it more confusing than emacs. 13:55:31 I think that was the one I tried...? 13:55:33 Maybe? 13:56:07 one thing that's been kind of awkward is that Django repeats a lot of file names in different directories 13:56:10 No wait, this emacs tutorial looks familiar 13:56:18 so switching around to other files has been somewhat more annoying than usual. 13:57:02 sometimes I even use C-x C-b which I normally don't use. 13:57:28 Ngevd: also you can play tetris. 13:57:39 while your "code compiles" (see: xkcd) 13:57:45 I think I have a friend who uses emacs 13:57:51 Primarily for that purpouse 13:58:03 to play tetris instead of doing actual work? 13:58:09 it has its advantages, certainly 13:58:10 Yes 13:58:42 also having multiple windows (what would normally be called panes or whatever) is awesome. 13:59:35 as usually you end wanting to browse two or three source files at a time, or two source files and some docs, etc, etc 13:59:44 s/end/\1 up/ 14:00:07 three source files, two docs, a shell, and tetris 14:02:49 C-c / 14:02:50 Insert a close tag for the innermost unterminated tag (sgml-close-tag). If called from within a tag or a comment, close this element instead of inserting a close tag. 14:02:53 holy crap that's awesome. 14:03:39 it's like 14:03:49 the guys who made html-mode hate the same things that I hate about HTML. 14:04:01 -!- copumpkin has quit (Ping timeout: 240 seconds). 14:04:11 Maybe you wrote it? 14:04:25 -!- copumpkin has joined. 14:04:28 FROM THE FUTURE 14:05:16 C-c C-n 14:05:17 Interactively specify a special character and insert the SGML ‘&’-command for that character (sgml-name-char). 14:05:19 yessssss 14:06:01 though < is fewer keys than C-c C-n < :P 14:06:19 -!- ais523 has quit (Read error: Connection reset by peer). 14:06:29 Harder to memorise, though 14:07:51 not if you know a modicum of HTML syntax. 14:08:33 I mean, it's easier to memorise C-c C-n [char] than a list of thingies 14:08:38 oh, right. 14:09:13 C-c C-n " is equivalent to " though honestly I tend to think of key combinations as the same amount of work as typing a single key. 14:09:34 as my left hand is pretty much always hovering over shift, ctrl, and alt. 14:10:11 I type weird. :P 14:10:22 though typing weird is beneficial when programming. 14:11:27 though I can't really touch type very well. It's very easy for me to start jioyy the weron ley 14:12:07 though I do say though a lot. 14:14:26 http://www.codinghorror.com/blog/2007/02/why-cant-programmers-program.html 14:14:27 wow. 14:14:40 -!- copumpkin has quit (Quit: Computer has gone to sleep.). 14:17:38 I fear for the state of the world's sanity 14:17:56 I could write a FizzBuzz thing in what... 30 seconds? 14:19:32 > map (\x -> if x `mod` 15 == 0 then "FizzBuzz" else (if x `mod` 3 == 0 then "Fizz" else (if x `mod` 5 == 0 then "Buzz" else show x))) [1..100] 14:19:34 ["1","2","Fizz","4","Buzz","Fizz","7","8","Fizz","Buzz","11","Fizz","13","1... 14:19:40 Exactly 14:19:44 it is /slightly/ trickier than it sounds. 14:20:20 no wait, it's not. 14:20:24 I would have used guards personally, but that's because Haskell's if statement confuses me for some strange reason 14:20:48 And I wasn't writing it for IRC 14:21:31 it... confuses you? 14:21:38 I don't know how 14:21:40 It just does 14:21:53 -!- DH____ has quit (Ping timeout: 240 seconds). 14:21:54 Which is weird, because I get that Banach-Tarski thing 14:22:04 And that should be much more confusing 14:22:11 also I believe those parens are unecessary. 14:22:22 > map (\x -> if x `mod` 15 == 0 then "FizzBuzz" else if x `mod` 3 == 0 then "Fizz" else if x `mod` 5 == 0 then "Buzz" else show x) [1..100] 14:22:23 ["1","2","Fizz","4","Buzz","Fizz","7","8","Fizz","Buzz","11","Fizz","13","1... 14:22:25 yep. 14:23:21 -!- tiffany has joined. 14:24:14 import System.IO; import Data.List; main = putStrLn . intercalate "\n" . map (\x -> if x `mod` 15 == 0 then "FizzBuzz" else if x `mod` 3 == 0 then "Fizz" else if x `mod` 5 == 0 then "Buzz" else show x) $ [1..100] 14:24:18 woooo 14:24:50 @pl map (\x -> if x `mod` 15 == 0 then "FizzBuzz" else if x `mod` 3 == 0 then "Fizz" else if x `mod` 5 == 0 then "Buzz" else show x) [1..100] 14:24:51 map (ap (flip if' "FizzBuzz" . (0 ==) . (`mod` 15)) (ap (flip if' "Fizz" . (0 ==) . (`mod` 3)) (ap (flip if' "Buzz" . (0 ==) . (`mod` 5)) show))) [1..100] 14:24:56 beautiful. 14:25:01 Who the hell calls themselves a programmer and struggles with this 14:25:26 Ngevd: note that the majority of enterprisey things require no knowledge of multiples or well anything... 14:25:39 BUT STILL 14:25:56 also in a job application situation no google, etc. People rely on google heavily when programming. 14:25:58 The article said Computer Science graduates!? 14:26:31 -!- tiffany has quit (Remote host closed the connection). 14:26:48 a CS graduate who's been out of school for several years may have forgotten that "multiple of x and y" means "multiple of x*y" 14:26:56 but that's not a big deal as you can just use && instead. 14:27:01 -!- tiffany has joined. 14:27:36 also I imagine people get thrown off by off-by-one errors or implementing the conditional in the wrong order so that the multiple of 15 case never occurs. This is just a simple mistake under time pressure. 14:29:17 I've got a new phone 14:29:46 cool. 14:31:11 > people get thrown off by off-by-one errors 14:31:13 Not in scope: `people'Not in scope: `thrown'Not in scope: `off'Not in scope... 14:31:17 *reminded of that scp* 14:31:59 http://www.scp-wiki.net/scp-866 14:35:11 Okay, my phone just guessed my postcode 14:35:57 !perl for (1..100) { $x=0; $x++,print "Fizz" unless ($_ % 3); $x++,print "Buzz" unless $_ % 5; print unless $x; print " " } 14:36:04 .... :( 14:36:17 I was trying out a horrible hack. 14:36:24 when it would be easier just to not do horrible hacks. 14:36:40 `runperl for (1..100) { $x=0; $x++,print "Fizz" unless ($_ % 3); $x++,print "Buzz" unless $_ % 5; print unless $x; print " " } 14:36:47 1 2 Fizz 4 Buzz Fizz 7 8 Fizz Buzz 11 Fizz 13 14 FizzBuzz 16 17 Fizz 19 Buzz Fizz 22 23 Fizz Buzz 26 Fizz 28 29 FizzBuzz 31 32 Fizz 34 Buzz Fizz 37 38 Fizz Buzz 41 Fizz 43 44 FizzBuzz 46 47 Fizz 49 Buzz Fizz 52 53 Fizz Buzz 56 Fizz 58 59 FizzBuzz 61 62 Fizz 64 Buzz Fizz 67 68 Fizz Buzz 71 Fizz 73 74 FizzBuzz 76 77 Fizz 79 Buzz 14:36:55 bahahahahaha 14:37:09 look at that horrible hack. 14:37:47 Hehe 14:37:54 My phone is loading the wiki 14:38:07 `runperl for(1..100){my$x;$x++,print"Fizz"unless$_%3;$x++,print"Buzz"unless$_%5;print unless$x;print" "} 14:38:09 1 2 Fizz 4 Buzz Fizz 7 8 Fizz Buzz 11 Fizz 13 14 FizzBuzz 16 17 Fizz 19 Buzz Fizz 22 23 Fizz Buzz 26 Fizz 28 29 FizzBuzz 31 32 Fizz 34 Buzz Fizz 37 38 Fizz Buzz 41 Fizz 43 44 FizzBuzz 46 47 Fizz 49 Buzz Fizz 52 53 Fizz Buzz 56 Fizz 58 59 FizzBuzz 61 62 Fizz 64 Buzz Fizz 67 68 Fizz Buzz 71 Fizz 73 74 FizzBuzz 76 77 Fizz 79 Buzz 14:38:13 now written with readability in mind. 14:42:52 -!- copumpkin has joined. 14:44:37 -!- Taneb has joined. 14:44:54 That's my phone 14:45:09 Hello 14:46:37 Now I don't need to lug around a Kindle to talk on the move 14:46:57 I don't think blackberries have much in the way of IRC clients. 14:47:37 This is an Android 14:48:12 -!- Taneb has quit (Client Quit). 14:48:38 Yeah, it's hard to type on that Galaxy Mini keyboard 14:49:08 And tomorrow I have to be out the house by 4:30 14:50:18 So, early night for me 14:54:57 ”What is your previous salary?” is employer-speak for “Please give me reasons to pay you less money.” Answer appropriately. 14:55:00 looool 15:16:20 -!- augur has quit (Remote host closed the connection). 15:20:24 html-mode is great. 15:20:29 never again will I write end tags... 15:40:37 -!- Vorpal has joined. 15:42:50 -!- augur has joined. 15:43:02 Hey, it's almost celebrate-that-time-when-somebody-messed-up-killing-the-king day! 15:44:14 Ngevd, tomorrow isn't it? 15:44:21 Day after 15:44:24 ah 15:44:48 Ngevd, why exactly is that celebrated? 15:45:05 Because we don't have anything cool to celebrate 15:45:34 brb, ipv6 tunnel is fucked up, I suspect I will lose connection 15:48:22 -!- Vorpal_ has joined. 15:49:07 Hey, I can listen to the radio on my phone 15:49:42 -!- Vorpal has quit (Disconnected by services). 15:49:44 -!- Vorpal_ has changed nick to Vorpal. 15:49:49 Ngevd, how is that surprising? 15:50:02 I've never been able to do that before 15:50:15 Ngevd, new phone? 15:50:20 Yup 15:55:37 -!- ais523 has joined. 15:59:22 -!- zzo38 has joined. 16:01:24 -!- copumpkin has quit (Ping timeout: 245 seconds). 16:03:31 -!- copumpkin has joined. 16:05:19 Americans don't understand humour, they only understand humor. 16:05:40 -!- MSleep has changed nick to MDude. 16:05:43 zzo38: what about Canadians? 16:06:12 Well, I am Canadian. 16:06:14 Humour, I believe 16:06:28 And Australians may use "humor"? 16:06:38 Yes that is the Canadian spelling "humour" but I don't know Australians 16:06:51 I know they use "labor" 16:09:02 I abhour strange spellings of things that should end with -our 16:09:17 Four 16:10:04 As my user page on the wiki probably doesn't say, I flick between -ize and -ise 16:10:21 Depending on the word, I think 16:10:24 Colourize 16:10:25 I think since both spellings are in use you can use whatever you want but when you type a command into a computer you have to use the spelling that the computer accepts (some programs might accept both ways) 16:10:26 American usage of -or and -our is totally consist-- oh wait 16:11:17 though maybe it's a bit more consistent...? no... 16:11:51 we have pour and not por. 16:12:36 I guess -our is etymologically correct for words with French origin, I think? 16:12:41 * CakeProphet doesn't actually know anything about French. 16:14:47 anyway AMERICA IS THE BEST etc 16:15:09 because all of our conventions are different from everyone elses. 16:15:18 but EVERYONE LIKES OUR MOVIES HAHAHAHAHA SUCKERS. 16:16:45 Bah, most of the actors in Star Wars were British 16:17:17 wow 16:17:29 The body of Darth Vader, for example 16:17:31 you've defeated me with your one specific example. 16:17:54 And the British version of the Italian Job was so much better than the remake 16:17:58 about actors and not movies. 16:18:08 Ngevd: well, that's true. 16:18:17 but that's true for many remakes regardless of nation. 16:18:28 And Shaun of the Dead was very good 16:18:42 As was Hot Fuzz 16:18:51 Ngevd: "hey, we make good movies too!" 16:19:10 Technically it should be Nge "hey, we make good movies too!" vd 16:19:25 no I was quoting you. 16:19:30 it wasn't an IRC ping thing 16:19:31 Which Discordian calendar do you prefer, the literal or standard? 16:19:34 Oh 16:20:05 zzo38: I was only familiar with one calendar. I presume the standard one 16:22:41 of course I always use THE OFFICIAL DISCORDIAN DOCUMENT NUMBERING SYSTEM. 16:26:31 -!- ais523_ has joined. 16:26:45 -!- ais523 has quit (Disconnected by services). 16:26:46 -!- ais523_ has changed nick to ais523. 16:27:08 With the standard calendar, 1 Chaos is always Jan 1 of the Gregorian calendar, while the literal calendar has 1 Chaos 3136 on Jan 1, 1970 and has St. Tib's day exactly once every four years (as the Julian calendar does), which is what the document says. This contradicts the heading but follows the instructions precisely. 16:31:06 -!- monqy has joined. 16:40:29 -!- Jafet has quit (Quit: Leaving.). 16:43:54 hmm, hilarious thing happening on the Internet: Nintendo are releasing a new Dream World Pokémon and asking people to vote on what it should be; the competitive community have found a loophole in the voting system allowing it to be manipulated, but their attempts to manipulate it are breaking down into arguments as to what exactly they should manipulate /for/ 16:44:15 :D 16:45:30 the argument is mostly between Pokémon-that-is-already-good-and-this-would-make-it-even-better, and Pokémon-that-currently-sucks-and-this-would-make-excellent 16:46:04 I would go for the latter 16:46:12 Luvdisc 16:46:22 it wouldn't make Luvdisc good 16:46:27 the latter Pokémon is Ditto 16:46:46 I don't really know what Dream World Pokemon are 16:47:16 I haven't really kept track of it since Platinum was released 16:47:34 the only competitive difference is that they have a different ability to usual, and that if they're male, you can't breed egg moves onto them 16:47:44 I really don't care. I don't like the Dream World mode anyways 16:48:11 but there are only finitely many possibilities for each ability (small finite, it caps out at 4), and Ditto is a choice of 1 of 2 16:48:26 Nintendo adds everything they keep mixing it up. No! They should only change it when releasing a new game. 16:48:28 people are assuming it'd get the ability currently unavailable on it, as otherwise it'd just be a normal Ditto 16:48:53 and Imposter Ditto is already known to be top-tier (if you aren't playing with banned Pokémon), and possibly even strong enough to ban 16:51:32 why ban? Wouldn't it make more sense to rebalance? 16:51:56 Vorpal: you can't, umm, modify the game's idea of what a Pokémon's stats are without hacking? 16:52:13 ais523, I meant for Nintendo to release a balance patch 16:52:21 Vorpal: on a DS cartridge game? 16:52:24 oh okay 16:52:25 -!- sllide has joined. 16:52:27 They should make the random game? Everyone start random during each match 16:52:35 zzo38: it's been made 16:52:46 it's not as fun as the intended way of playing, though 16:53:03 as it's mostly a case of hoping that you have an attacking move that actually does decent damage 16:53:51 -!- Guest63524 has joined. 16:54:20 interesting, Windows 7 fails to detect the PS/2 keyboard except after a warm reboot. 16:54:27 -!- oerjan has joined. 16:54:28 wtf could cause that 16:54:53 I mean, it works fine in linux. And it works fine after warm reboot from either windows login screen or from linux 16:54:59 -!- Slereah_ has quit (Ping timeout: 276 seconds). 16:55:27 how are you warm rebooting it without a working keyboard? 17:00:06 Vorpal: this is because Windows code relies on the magical properties of its reboot to function properly 17:00:21 the code itself is shit, but after a reboot everything works fine. always. 17:00:36 * CakeProphet sagenods 17:02:08 ITYM "* CakeProphet nods sagely." you lazy 'sagenodding' non-sage. 17:02:10 > map (\x -> if x `mod` 15 == 0 then "FizzBuzz" else (if x `mod` 3 == 0 then "Fizz" else (if x `mod` 5 == 0 then "Buzz" else show x))) [1..100] 17:03:28 > [case gcd x 15 of 1 -> show x; 3 -> "Fizz"; 5 -> "Buzz"; 15 -> "FizzBuzz" | x <- [1..100]] 17:03:29 ["1","2","Fizz","4","Buzz","Fizz","7","8","Fizz","Buzz","11","Fizz","13","1... 17:05:54 -!- Siddiq has joined. 17:06:02 hi ais 17:06:11 hi bd 17:06:25 oerjan: ah much better. 17:06:29 though not as efficient I think? 17:06:33 doesn't matter really. 17:06:35 perhaps not. 17:06:58 I should try those list comprehension things, one of these days. 17:07:03 for efficiency, you could also do a case match on x `mod` 15 17:07:07 -!- Siddiq has left. 17:07:09 but that would be longer 17:07:25 -!- elliott has joined. 17:08:13 how are you warm rebooting it without a working keyboard? <-- by clicking "shutdown" with the mouse on the login screen and then selecting reboot from the menu that pops up 17:08:45 was siddiq someone you actually knew? 17:08:46 Vorpal: mouse? I am enthralled. Show me your ways. 17:08:51 Vorpal: how do you get past the press control-alt-delete thing? 17:08:58 ais523, windows 7 doesn't do that? 17:09:16 hmm, weird 17:09:28 as its purpose is to prevent people spoofing the login screen (the userland can't react to control-alt-delete) 17:09:33 ais523, the ctrl-alt-del thing is for domain logins only these days I think. Ever seen the XP welcome screen? 17:09:40 it didn't use that ctrl-alt-del either 17:09:42 ah, right 17:09:44 I know XP doesn't ask for CTRL+ALT+DEL by default but it can be configured to do so. 17:09:56 and xp didn't ask by default indeed 17:10:07 ais523, anyway what I see is the windows 7 take on the xp welcome screen. 17:10:08 Vorpal: how do you get past the press control-alt-delete thing? 17:10:08 elliott: You have 2 new messages. '/msg lambdabot @messages' to read them. 17:10:13 only networked machines do that 17:10:19 it's a non-default setting 17:10:34 elliott, or ones configured to it anyway. It was fairly easy to make an xp machine do it iirc. 17:10:35 I configured my computer to ask CTRL+ALT+DEL 17:10:51 select non-welcome screen mode, then a group policy or something 17:10:59 hmm, computers don't even /boot/ without a working keyboard, so presumably the BIOS recognised it 17:11:02 my computer devises tricky riddles 17:11:03 anyway the warm reboot issue is mysterious 17:11:09 And to forget the last username, requiring its entry every time. 17:11:11 ais523, certainly, it works fine in grub too 17:11:19 ais523, and under linux 17:12:07 ais523, and as I said, with warm reboot from either OS it works fine. 17:12:19 I can't think of a way to cause that sort of behaviour 17:12:37 13:37:55: "You can meet people over the Internet (oh God, can you), but something in our monkey brains makes in-the-flesh meeting a bigger thing." 17:12:37 meh @ this 17:12:47 ais523, btw did I mention the game on windows that only worked if 5 minutes or more passed since login and another XNA based game had already run? 17:12:55 ais523: I think they do boot nowadays 17:12:58 (very strange that one) 17:12:59 everyone emulates the controller 17:13:22 import System.IO; import Data.List; main = putStrLn . intercalate "\n" [...] <-- that's putStr . unlines 17:13:32 well, I have a single shared PS/2 port that can either take a keyboard or a mouse 17:13:40 so I use an usb mouse and a PS/2 keyboard 17:13:41 13:51:33: Should I try to use Emacs? 17:13:41 13:51:38: Ngevd: I recommend it. 17:13:42 Ngevd: no 17:13:50 i'm imagining an onscreen game controller, like an onscreen keyboard 17:13:51 there's also unwords 17:13:53 and now an onscreen mouse 17:14:12 oerjan: ah yes I always forget about those things. 17:14:28 drag the onscreen mouse around and click with it, and then it will move another cursor that clicks on things for you 17:14:42 (they're slightly different, unlines appends a final \n) 17:15:07 (well apart from one being \n's and the other being spaces) 17:15:20 elliott: for some reason I thought you used emacs as well. 17:15:29 Yep. 17:15:33 oh. 17:15:44 I also use vim for editing config files. 17:15:47 why would you use it and not recommend it then? 17:15:53 I use emacs, kate and nano 17:16:06 Because learning emacs is a waste of time for almost everyone. 17:16:22 CakeProphet: another option is mapM_ putStrLn 17:16:27 I'm just used to it, and it has a few things that the lack of bug me in other editors, so I use it. 17:17:02 elliott: it was not a waste of time for me to learn it. 17:17:12 i sometimes like to do mapM_ print in ghci, to not get as many nested brackets 17:17:17 * elliott does not expect continuing this conversation to be productive. 17:17:32 (as with plain print) 17:17:35 oerjan: I do that a lot too. Mostly I wish that GHCi reformatted prints by default. 17:17:58 -!- CakeProphet has set topic: productivity | EPL evening school assignments! http://tinyurl.com/5stnu5n | It's the end of an era | RIP John McCarthy) | TO SHREDS!) | http://codu.org/logs/_esoteric/. 17:19:02 I think the _ in mapM_ is quite ugly, surely there is a better way to tell it apart from mapM 17:19:28 Vorpal: it's standard 17:19:32 mapM' would be worse 17:19:36 well true 17:19:38 :t sequence_ 17:19:40 still 17:19:42 forall (m :: * -> *) a. (Monad m) => [m a] -> m () 17:19:49 elliott, you can't tell me it isn't ugly 17:19:49 Vorpal: and, therefore, not ugly. ;) 17:19:55 I don't find it ugly at all. 17:19:58 hm 17:21:27 that is strange, why does :t in ghci give a much more compact form than :t in lambdabot for sequence_? Or rather, why would lambdabot print that forall stuff that is implicit in ghci's :t 17:21:55 Vorpal: there's an option whether to include foralls 17:22:10 okay, why would lambdabot have that turned on then? 17:22:34 for pedagogical reasons? 17:22:38 hm, okay 17:23:34 oerjan: lolno 17:23:37 it's for caleskell 17:23:54 at least nobody ever does anything but tell newbies to ignore them 17:24:15 o kay 17:24:16 wtf is caleskell? 17:24:31 :t (.) -- this. is. caleskell. 17:24:32 forall a b (f :: * -> *). (Functor f) => (a -> b) -> f a -> f b 17:24:47 :t flip 17:24:48 forall (f :: * -> *) a b. (Functor f) => f (a -> b) -> a -> f b 17:24:50 hm 17:25:07 yeah that is not the usual flip signature 17:25:16 but it is the usual (.) signature of course. 17:25:22 > (0$0$) -- hm i wonder... 17:25:23 The operator `GHC.Base.$' [infixr 0] of a section 17:25:23 must have lower prec... 17:25:29 elliott, not that either 17:25:39 for some reason he hasn't changed $ to infixl though :P 17:25:49 well to me that doesn't really explain what caleskell is 17:25:58 caleskell is caleskell 17:26:03 ah google was more helpful than DDG there 17:26:29 > func "caleskell is " (var "your mom") :: Expr 17:26:29 still no explanations as to what it is 17:26:30 Not in scope: `func' 17:26:32 :( 17:26:34 > fun "caleskell is " (var "your mom") :: Expr 17:26:36 caleskell is your mom 17:26:49 good job 17:26:50 oerjan: i like how siddiq stealthily avoided actually pinging anyone 17:26:54 monqy: thanks. 17:27:32 mhm 17:27:33 > var "siddiq more like siddick huh huh huh huh" 17:27:34 siddiq more like siddick huh huh huh huh 17:28:00 look guys, I can make lambdabot obnoxious. 17:28:13 ok 17:28:58 -!- naggg has joined. 17:29:16 also, in other news 17:29:18 https://www.google.com/search?gcx=w&sourceid=chrome&ie=UTF-8&q=do+a+barrel+roll 17:30:12 Vorpal: cale is a #haskell regular who added some of his haskell ideas to lambdabot. i think. 17:30:35 oerjan, ah 17:30:52 oerjan: he is the maintainer of lambdabot. 17:30:54 well 17:30:55 owner 17:30:58 it's unmaintained :) 17:31:01 hi naggg 17:31:03 `? welcome 17:31:05 Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page 17:31:17 `run type '?' 17:31:18 ​? is /hackenv/bin/? 17:31:21 i wasn't quite sure about that, thus "i think" 17:31:23 `run file '?' 17:31:25 ​?: ERROR: cannot open `?' (No such file or directory) 17:31:29 `run file 'bin/?' 17:31:30 bin/?: POSIX shell script text executable 17:31:36 hi elliott 17:31:38 `run pasteurl 'bin/?' 17:31:40 sh: pasteurl: not found 17:31:42 err 17:31:49 `pasteurl 'bin/?' 17:31:51 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: pasteurl: not found 17:31:52 Vorpal: try not to fail horribly at the bots in front of the newbies 17:31:59 `paste 'bin/?' 17:31:59 :p 17:32:01 elliott, I forgot what the command was 17:32:01 http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/paste/paste.3471 \ cat: 'bin/?': No such file or directory 17:32:04 It's `url. 17:32:06 `url bin/? 17:32:07 ah 17:32:08 http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/bin/? 17:32:16 wait, that is going to break 17:32:18 Oh, that actually doesn't work because Gregor is lazy. 17:32:21 `paste bin/? 17:32:24 http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/paste/paste.11685 17:32:49 `ls wisdom 17:32:52 ais523 \ augur \ c \ elliott \ everyone \ finland \ fizzie \ flower \ friendship \ gregor \ hackego \ haskell \ ievan \ intercal \ itidus20 \ monad \ monads \ monqy \ oerjan \ oklopol \ qdb \ qdbformat \ sgeo \ shachaf \ u \ vorpal \ welcome \ wiki 17:32:57 that is a lot 17:33:00 i wasn't quite sure about that, thus "i think" 17:33:08 oerjan: and i was giving you the gift of correction :P 17:33:12 Vorpal: that's barely any 17:34:00 `? monads 17:34:02 Monads are just monoids in the category of endofunctors. 17:34:03 Vorpal: crawl's learndb has a single entry with 3494 definitions 17:34:48 `? monad 17:34:50 Monads are just monoids in the category of endofunctors. 17:35:04 elliott: good thing that entry sucks 17:35:18 monqy: it's crawl, what did you expect 17:35:52 some crawl learndb entries are good in a bad way but most of them are awful 17:35:55 `? intercal 17:35:57 INTERCAL has excellent features for modular program for the enterprise market. 17:36:06 elliott, crawl being? 17:36:15 Vorpal: I refuse to believe you don't know what Crawl is. 17:36:25 elliott, oh, stone soup? 17:36:36 Yes. 17:36:38 right 17:36:59 elliott, would you believe me if I said I never actually played it? 17:37:05 -!- Ngevd has quit (Ping timeout: 252 seconds). 17:37:10 `? finland 17:37:12 Finland is a European country. There are two people in Finland, and at least five of them are in this channel. Corun drives the bus. 17:37:18 `cat wisdom/monad 17:37:20 Vorpal: No, I would die from shock. 17:37:20 Monads are just monoids in the category of endofunctors. 17:37:22 Rodney's learndb has 6653 definitions, but the entry with most definitions (stealing_from_shops) only has 17 of them. (Assuming I grepped right.) 17:37:41 `? elliott 17:37:43 elliott wrote this learn DB, and wrote or improved many of the other commands in this bot. He probably has done other things? 17:37:57 ? 17:38:12 -!- zzo38 has quit (Remote host closed the connection). 17:38:14 `? oerjan 17:38:16 Your future evil overlord oerjan is an expert in lazy computation. 17:38:23 `? monqy 17:38:25 The friendship monqy is an ancient Chinese mystery; ask itidus21 for details. 17:38:38 `run echo '"Banach-Tarski" is an anagram of "Banach-Tarski Banach-Tarski".' >wisdom/banach-tarski 17:38:39 No output. 17:38:49 oerjan: i am not sure i approve of the hyphen 17:39:02 which one? 17:39:08 elliott, rougelikes I played: nethack, slashem, a bit of angband. Yeah I think that is it. 17:39:15 `? fizzie 17:39:16 oerjan: filename one :P 17:39:17 fizzie is rumoured to be written in Funge-98. 17:39:18 maybe I should play stone soup now 17:39:24 `? gregpr 17:39:26 gregpr? ¯\(°_o)/¯ 17:39:35 `? gregor 17:39:38 Gregor took forty cakes. He took 40 cakes. That's as many as four tens. And that's terrible. 17:39:38 Vorpal: don't, it sucks 17:39:43 elliott, how so? 17:39:48 monqy: ais523: back me up here 17:39:51 it sucks 17:39:53 `? friendship 17:39:55 elliott, does it suck because you are bad at it? Or some other reason? 17:39:55 friendship wisdom 17:40:03 it sucks because it's bad 17:40:08 it sucks because it's bad 17:40:11 elliott, in what way is it bad 17:40:12 you can trust monqy, he has like _three_ entries in that learndb. 17:40:18 i have way more than three 17:40:18 Maybe you should MAKE stone soup. 17:40:18 and stop echoing monqy 17:40:26 monqy echoed me you blithering moron. 17:40:32 and i've won a lot of games!! 17:40:37 so I have experience, am probably good 17:40:42 elliott, no that was "and stop echoing, monqy!" 17:40:42 elliott: it occurs to me that `? welcome is atypical: it's information is actually true. 17:40:44 monqy: how many games... is it 2 17:40:46 elliott: s/echoing/\1,/ 17:40:47 yes, that. 17:40:48 *its 17:40:52 oerjan: fix the ' so i can addquote that 17:41:03 elliott: it occurs to me that `? welcome is atypical: its information is actually true. 17:41:09 elliott: i think it's like 17 :( i used to play it a lot before i got really frustrated with how bad it was 17:41:11 `addquote elliott: it occurs to me that `? welcome is atypical: its information is actually true. 17:41:13 704) elliott: it occurs to me that `? welcome is atypical: its information is actually true. 17:41:29 `? haskell 17:41:31 Haskell is preferred by 9 out of 10 esoteric programmers. Ask your GP today! http://learnyouahaskell.com/ 17:41:34 Vorpal: anyway, the reasons are (a) it sucks (b) the balance is awful (c) the fact that you're always in the centre tile gives you a headache 17:41:37 Vorpal: ask ais523 if you want more detail :P 17:41:41 elliott, the only person I would trust about rougelikes would be ais523. You need him to back you up. 17:41:49 `? itidus20 17:41:51 itidus20 is horny 60 year olds having cybersex in minecraft 17:41:52 well, only person in this channel 17:42:00 `? ais523 17:42:02 ais523 is ais523. This topic may retroactively become more informative if or when Feather is invented. 17:42:02 I don't care about (c) but I'd add (d) it's boring 17:42:14 elliott, err, I seen plenty of games like (c), they don't annoy me 17:42:29 `? sgeo 17:42:32 Sgeo invented Metaplace sex. 17:42:32 and (e) it's tedious 17:42:45 maybe other games are boring and tedious too; I prefer not to play them either 17:42:54 `? CakeProphet 17:42:57 CakeProphet? ¯\(°_o)/¯ 17:43:04 ? who owns lines starting with a ? again? 17:43:05 `? feather 17:43:07 feather? ¯\(°_o)/¯ 17:43:11 oh well 17:43:14 ?somebody owns lines starting with a ? 17:43:14 Unknown command, try @list 17:43:21 Yeah, lambdabot, that jerk. 17:43:24 `run echo 'Vorpal is a swede so normal that this information is actually true.' >wisdom/vorpal 17:43:26 No output. 17:43:38 oerjan, heh 17:43:42 `run echo 'Vorpal sucks.' >wisdom/vorpal 17:43:44 No output. 17:43:44 * elliott master of accuracy. 17:43:49 `rollback 17:43:50 `cat bin/learn 17:43:51 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: rollback: not found 17:43:51 Gregor: BTW `quote modifies the FS on every invocation now is that ok. 17:43:52 ​#!/bin/sh \ topic=$(echo "$1" | sed 's/ .*//' | tr A-Z a-z) \ info=$(echo "$1" | sed 's/[^ ]* //') \ echo "$1" >"wisdom/$topic" \ echo "I knew that." \ 17:43:53 `help 17:43:54 Runs arbitrary code in GNU/Linux. Type "`", or "`run " for full shell commands. "`fetch " downloads files. Files saved to $PWD are persistent, and $PWD/bin is in $PATH. $PWD is a mercurial repository, "`revert " can be used to revert to a revision. See http://codu.org/projects/hackbot/fshg/ 17:43:57 `revert 17:43:58 Done. 17:44:02 elliott: wtf why 17:44:03 `quote 17:44:04 elliott: see what you did 17:44:05 620) in the past few minutes I tried remembering what my dream last night was, but instead remembered I didn't sleep 17:44:06 Gregor: `unquote 17:44:15 -!- naggg has quit (Quit: begone). 17:44:16 `url bin/unquote 17:44:19 http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/bin/unquote 17:44:27 `revert 6e3092881cc4 17:44:40 wtf? 17:44:41 `? vorpal 17:44:44 Vorpal sucks. 17:44:48 * elliott waits for Vorpal to break the bot with idiocy. 17:44:49 there was already a wisdom entry on vorpal... 17:44:50 -!- boily has joined. 17:44:53 elliott: OK, but why does `quote need to modify ... 17:45:00 Gregor: So that `unquote knows what to delete. 17:45:03 `quote 17:45:06 SHITTY QUOTE 17:45:06 OHHH 17:45:08 I gets it. 17:45:08 `unquote 17:45:12 K it's gone. 17:45:14 Sure, works for me. 17:45:27 i loved that quote 17:45:31 You should have it report which one it removed just in case of SYNCHRONIZATION. 17:45:33 Gregor, what does `revert take as parameter exactly? 17:45:36 Gregor: It does. 17:45:39 Gregor: `delquote does now. 17:45:42 Vorpal: The revision to revert to. 17:45:58 Gregor, for some reason I can't find the revision number on http://codu.org/projects/hackbot/fshg/ 17:46:30 I seem to remember seeing said revision number there before.... Strange 17:46:44 You must be at least this smart to ride the bot --> 17:46:51 `run echo ':>' > wisdom/cakeprophet 17:46:53 No output. 17:46:58 `? cakeprophet 17:46:58 `revert 828 17:47:00 Done. 17:47:02 Vorpal: There. 17:47:02 ... 17:47:04 Is everyone `learn-incompetent or what? 17:47:06 http://codu.org/projects/hackbot/fshg/index.cgi/rev/6fd8b41fdb37 17:47:12 Gregor: Yes. 17:47:14 ​:> 17:47:16 Gregor: how do I learn learn? 17:47:24 `run echo ':>' > wisdom/cakeprophet 17:47:26 No output. 17:47:28 `? cakeprophet 17:47:30 `rm wisdom/cakeprophet 17:47:30 ​:> 17:47:32 No output. 17:47:41 elliott: what the hell. 17:47:43 elliott, ah there, I tried the hash, but that didn't work 17:47:51 elliott "hackego despot" hird 17:47:58 elliott, it would make sense if the hash worked 17:47:59 CakeProphet: You must learn how to use `learn before I'll not be a dick about working around it :P 17:48:10 Vorpal: I'm the maintainer of HackEgo. That's why you should complain to me and not Gregor. 17:48:12 `learn learn 17:48:14 I knew that. 17:48:22 `? learn 17:48:24 learn 17:48:26 learn 17:48:27 ah. 17:48:32 elliott, you are? I thought it ran on codu 17:48:34 HackEgo has no maintainer, it is anarchy. 17:48:39 monqy: nice cascading effect. 17:48:43 `rm bin/learn 17:48:45 No output. 17:48:46 er 17:48:48 lol 17:48:54 rip 17:49:05 `revert 828 17:49:07 Done. 17:49:20 `run cat `which learn` 17:49:21 Gregor: P.S. You should make `revert rollback to the last revision :P 17:49:22 ​#!/bin/sh \ topic=$(echo "$1" | sed 's/ .*//' | tr A-Z a-z) \ info=$(echo "$1" | sed 's/[^ ]* //') \ echo "$1" >"wisdom/$topic" \ echo "I knew that." \ 17:49:26 Gregor: I'm 99% sure hg lets you specify that. 17:49:42 this sed scares me. 17:49:53 elliott: I'm 99% sure that I'm too lazy to implement that and also that I don't want it to be QUITE that easy to revert. 17:49:57 I'm afraid of learn. 17:50:12 Gregor: (a) But it's like one line since hg lets you specify it :'( (b) Point. 17:50:21 It's annoying for me though, how about you make it just work for me :P 17:50:31 also [^ ] is a bad way to say \S 17:50:35 I accept reasonable patches to HackBot. 17:50:41 `learn cakeprophet :> 17:50:43 I knew that. 17:50:44 CakeProphet: But it's a good way to say "not a space" 17:50:46 Gregor: Got a link again? :P 17:51:03 elliott, there are race conditions that way 17:51:04 elliott: hg for filesystem, minus "fs" 17:51:06 Gregor: therefore, "is" is not transitive. 17:51:11 Vorpal: HackEgo is one gigantic race condition. 17:51:22 well okay 17:51:23 `? cakeprophet 17:51:25 cakeprophet :> 17:51:28 :( 17:51:40 `run echo ':>' > wisdom/cakeprophet 17:51:42 No output. 17:51:59 much better. 17:52:21 `? cakeprophet 17:52:23 ​:> 17:52:24 :> 17:52:39 Gregor: Writing a patch now :P 17:52:49 elliott: Submit in bundle format kthx 17:53:04 (And/or export format) 17:53:33 Gregor: Y'know, I'm pretty sure you don't want "hg revert". 17:53:40 You want the revert to become a revision itself, after all. 17:54:04 `run echo ~ 17:54:06 ​/tmp 17:54:07 elliott: I commit post-hg-revert. hg backout would be similar but I didn't use it because this way the hg revert is just like any other command. 17:54:18 `run echo . 17:54:20 ​. 17:54:21 Gregor: Oh, okay. 17:54:24 CakeProphet: Impressive. 17:54:28 Gregor: Why /don;t/ hashes work, btw? 17:54:30 s/;/'/ 17:54:34 elliott: Don't ask me :) 17:54:37 `run pwd 17:54:39 ​/hackenv 17:54:44 elliott: I probably just only accept numerics. 17:55:04 revert should just be an alias for find . -delete 17:55:07 `cat wisdom/shachaf 17:55:08 shachaf mad 17:55:16 I shouldn't be in there. 17:55:19 * shachaf mad 17:55:26 shachaf: learn to ? 17:55:27 X-D 17:55:35 `learn ? is wisdom 17:55:38 I knew that. 17:55:42 `? ? 17:55:42 `? ? ? ? ? ? ? 17:55:44 ​? is wisdom 17:55:48 CakeProphet: lern2unix 17:55:53 Gregor, btw: 17:55:56 `url bin/? 17:55:56 ​? ? ? ? ? ?? ¯\(°_o)/¯ 17:55:58 http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/bin/? 17:56:00 Gregor, that url is broken 17:56:09 Vorpal: btw: 17:56:09 Gregor, I think you need to properly url encode stuff 17:56:13 `cat bin/url 17:56:15 ​#!/bin/bash \ if [ "$1" ] \ then \ echo 'http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/'"$1" \ else \ echo 'http://codu.org/projects/hackbot/fshg/' \ fi 17:56:19 Vorpal: That script is part of the FS, anybody can fix it. 17:56:25 ah okay 17:56:44 Only `fetch, `revert, and (maybe?) `help are privileged. 17:56:45 fuck url encoding in bash 17:56:45 `cat `which revert` 17:56:47 cat: `which revert`: No such file or directory 17:56:48 Oh, and `run 17:56:51 `run cat `which revert` 17:56:57 Gregor, ah 17:57:09 Gregor: It doesn't work because you explicitly require the revision to be a number... :P 17:57:11 * elliott just removes that constraint 17:57:14 Gregor, which protocols does `fetch support? 17:57:16 It'll fail harmlessly if you try and do something stupid. 17:57:23 No output. 17:57:28 Vorpal: Whatever wget supports *shrugs* 17:57:38 `run perl -MURI::Escape -e 'print uri_escape($ARGV[0]);' 'blah/?' 17:57:41 Can't locate URI/Escape.pm in @INC (@INC contains: /etc/perl /usr/local/lib/perl/5.10.1 /usr/local/share/perl/5.10.1 /usr/lib/perl5 /usr/share/perl5 /usr/lib/perl/5.10 /usr/share/perl/5.10 /usr/local/lib/site_perl .). \ BEGIN failed--compilation aborted. 17:57:48 * shachaf hmphs. 17:57:49 `? wisdom 17:57:51 wisdom? ¯\(°_o)/¯ 17:57:57 elliott, Surely you want to check for it being [0-9a-f]+ 17:58:00 Why 17:58:07 You can say things like -3 17:58:10 To go two revisions back 17:58:12 ah 17:58:30 >& is like redirecting both 1 and 2, right? 17:58:36 elliott, just as long as you handle escaping and quoting properly (might be a non-issue, depending on which language it is written in) 17:58:56 `fetch file:///etc/passwd 17:58:57 file:///etc/passwd: Unsupported scheme `file'. 17:59:00 Dern :P 17:59:15 `which revert 17:59:16 Gregor, so no gopher 17:59:17 No output. 17:59:22 Vorpal: Tragic I know. 17:59:27 heh 17:59:38 Gregor: I don't understand. why is revert not part of the filesystem? :> 17:59:43 -!- Phantom_Hoover has joined. 17:59:53 it should be in ./bin 17:59:56 `ls .hg 17:59:58 ls: cannot access .hg: No such file or directory 18:00:46 `ls -a 18:00:48 ​. \ .. \ bin \ canary \ karma \ lastquote \ lib \ paste \ quotes \ share \ wisdom 18:01:11 `ls wisdom 18:01:13 ​? \ ais523 \ augur \ banach-tarski \ c \ cakeprophet \ elliott \ everyone \ finland \ fizzie \ flower \ friendship \ gregor \ hackego \ haskell \ ievan \ intercal \ itidus20 \ monad \ monads \ monqy \ oerjan \ oklopol \ qdb \ qdbformat \ sgeo \ shachaf \ u \ vorpal \ welcome \ wiki 18:01:20 `rm wisdom/shachaf 18:01:21 No output. 18:01:26 * shachaf unmad 18:01:28 `? everyone 18:01:30 Everyone in here is mad. 18:01:42 `echo No outut. 18:01:43 No outut. 18:01:52 `echo ?where ?where 18:01:54 ​?where ?where 18:01:59 `? flower 18:02:01 flower. what IS a flower? 18:02:08 `? ievan 18:02:11 ievan is basically http://www.youtube.com/watch?v=4om1rQKPijI 18:02:13 One might say the same thing about birds. 18:02:14 `? intercal 18:02:16 INTERCAL has excellent features for modular program for the enterprise market. 18:02:50 that video is awesome. 18:03:23 `? monads 18:03:25 Monads are just monoids in the category of endofunctors. 18:03:26 `? monad 18:03:28 Monads are just monoids in the category of endofunctors. 18:03:37 `? u 18:03:39 u monad? 18:04:03 Gregor: curl http://sprunge.us/jSEE | uudecode 18:05:27 `? c 18:05:29 C is the language of��V�>WIד�.��Segmentation fault 18:05:43 shachaf: It's "ask". 18:05:48 CakeProphet: Also, stop spamming. 18:06:00 what is spam? 18:07:48 ^celebrate 18:07:48 \o| |o| |o/ \m/ \m/ |o/ \o/ \o| \m/ \m/ \o| |o| |o/ 18:07:49 | | | `\o/´ | | | `\o/´ | | | 18:07:49 |\ |\ |\ | /´\ /< |\ | /< /´\ |\ 18:07:49 /`¯|_) /`\ 18:07:49 (_| (_| |_) 18:07:54 oh right. 18:08:35 but how can that be spam if it brings so much joy? 18:08:55 learning joy 18:09:42 > var "!help" 18:09:44 !help 18:09:48 aw. 18:10:52 I think we should all make bots. 18:10:58 -!- Ngevd has joined. 18:11:00 only if they're good bots 18:11:44 and have as many bots as regular spamm^H^H^H^H^Hhumans 18:14:24 I wouldn't like a channel full of bad bots...but good bots are good 18:16:21 I'm considering writing one in some esolang, but I don't know what purpose it would serve. 18:16:30 being good 18:17:08 it could hold arbitrary state and not ignore bot commands. 18:17:57 elliott: abort: no diffs found 18:18:00 fungot holds arbitrary state too 18:18:00 elliott: its been said that atlanta is better than bfbot!) :p. i think i get it completely now that i'm already there. 18:18:04 and also have a dice roller, or some kind of esolang interpreter. 18:18:05 elliott: What is? 18:18:06 Oh. 18:18:11 Gregor: Uhh, I did "hg bundle" and it said 1 changeset found. 18:18:17 Gregor: What'd I do wrong? 18:18:18 Hm 18:18:24 Nothing by the sounds of it :P 18:18:26 [elliott@dinky PRIVMSG]$ hg bundle bundle.hg 18:18:26 searching for changes 18:18:26 1 changesets found 18:18:30 I'll re-uuencode it. 18:18:48 Gregor: http://sprunge.us/jGde ;; well this doesn't look any longer. 18:18:53 Hmm 18:18:59 Uhh, hg export then? :P 18:19:10 Never seen bundle just lie >_> 18:19:31 Gregor: http://sprunge.us/fcjP 18:20:02 monqy: the problem is that every utility I can think of is pretty much made capable by hackego. :P 18:20:26 `echo this crap is useless lol > bullshitfile 18:20:28 this crap is useless lol > bullshitfile 18:20:33 ... I am el stupid 18:20:35 `run echo this crap is useless lol > bullshitfile 18:20:37 No output. 18:20:46 `revert -1 18:21:05 OK, none o' that :P 18:21:08 `cat bullshitfile 18:21:10 this crap is useless lol 18:21:13 `revert 18:22:26 `revert 18:22:28 abort: repository /tmp/hackenv.hg.19659 not found! 18:22:31 lolwut 18:24:13 Gregor, tell me what caused that when you find out 18:25:28 `revert 18:25:29 abort: repository /tmp/hackenv.hg.19878 not found! 18:25:42 `revert 18:25:43 Done. 18:25:47 Okidokie :P 18:25:51 `cat bullshitfile 18:25:53 cat: bullshitfile: No such file or directory 18:26:34 There's no semilogical reason why elliott should have failed, but it did >_> 18:26:44 ?? 18:26:51 Gregor: Yo, ping me when you apply my changes so I can test them :P 18:27:03 elliott: Err, done. 18:27:05 abort: repository /tmp/hackenv.hg.19878 not found! 18:27:06 Hmm 18:27:07 elliott: That's what I was just testing. 18:27:08 Then fixing. 18:27:13 Gregor: Why does mv blah .hg work 18:27:15 But not hg -R blah 18:27:20 elliott: Excellent question. 18:27:26 elliott: One I didn't bother to answer, I just mv'd :P 18:27:37 Gregor: Oh, did you have the same problem previously? 18:27:49 elliott: Yeah. 18:28:01 Gregor: Right, well, make the same modification to mine :P 18:28:04 elliott: what does hg blah do? 18:28:05 Or I can if you really want 18:28:07 olsner: Blahs 18:28:09 elliott: Already have. 18:28:13 Gregor: Oh :P 18:28:15 `hg blah 18:28:15 isn't -R supposed to point to foo as in foo/.hg 18:28:18 hg: unknown command 'blah' \ Mercurial Distributed SCM \ \ basic commands: \ \ add add the specified files on the next commit \ annotate show changeset information by line for each file \ clone make a copy of an existing repository \ commit commit the specified files or all outstanding changes \ diff 18:28:22 rather than to foo/.hg directly 18:28:30 Vorpal: I dunno, you can give it a bundle file 18:28:33 -R bundle.hg 18:28:35 `run echo shitfuck >fuckshit 18:28:35 hm okay 18:28:37 No output. 18:28:40 `revert 18:28:41 Done. 18:28:44 `cat fuckshit 18:28:46 cat: fuckshit: No such file or directory 18:28:48 `help 18:28:49 Yay 18:28:49 Runs arbitrary code in GNU/Linux. Type "`", or "`run " for full shell commands. "`fetch " downloads files. Files saved to $PWD are persistent, and $PWD/bin is in $PATH. $PWD is a mercurial repository, "`revert " can be used to revert to a revision. See http://codu.org/projects/hackbot/fshg/ 18:29:11 lololol there's clock sync issues, fshg reported that those happened "28 seconds from now" 18:29:21 heh 18:29:22 Nice 18:29:26 `revert !#$ 18:29:27 abort: unknown revision '!#$'! 18:29:30 8 seconds ago now! 18:29:33 `revert -- 18:29:39 ...hope that fails :P 18:29:47 Uhh.... HackEgo? :P 18:29:51 `type 18:29:52 hg revert: option -r requires argument hg revert [OPTION]... [-r REV] [NAME]... restore individual files or directories to an earlier state NOTE: This command is most likely not what you are looking for. revert will partially overwrite content in the working directory without changing the working directory parents. Use "hg update -r rev" to check out earlier revisions, or "hg update --clean ." to undo a merge which has added another parent. With no revision spec 18:29:56 Nice 18:29:58 elliott, ouch 18:30:08 elliott: lul 18:30:15 `revert --; cat /etc/passwd 18:30:16 abort: unknown revision '--; cat /etc/passwd'! 18:30:19 aww 18:30:27 `cat /etc/passwd 18:30:29 cat: /etc/passwd: No such file or directory 18:30:32 *snaps* 18:30:32 Vorpal doesn't know bash. 18:30:50 CakeProphet, ...? 18:30:57 Gregor: Except that the hg command is run on the host :P 18:31:01 inded 18:31:03 indeed* 18:31:05 Gregor: So `revert is TECHNICALLY the most viable exploit vector at this point :P 18:31:13 elliott: True, but /etc/passwd is still useless *shrugs* 18:31:19 Gregor: (Can't you run the hg stuff from inside the repo?) 18:31:29 I guess that's vulnerable to breakage unless you have some `restorerepo command. 18:31:32 `run find . -delete 18:31:34 No output. 18:31:37 `ls 18:31:38 bin \ canary \ karma \ lastquote \ lib \ paste \ quotes \ share \ wisdom 18:31:42 Gregor, yes I know, but it was more a proof of concept. If I had been evil I would have used rm -rf ~ instead 18:31:54 Gregor: (Can't you run the hg stuff from inside the repo?) // in principle, but I wanted to maintain the invariant that one command = one commit 18:31:59 Gregor: Right 18:32:06 Gregor: You don't have that invariant 18:32:09 `run find . -name '*' -delete 18:32:09 It's one command = zero or one commits :P 18:32:11 No output. 18:32:12 `ls 18:32:14 bin \ canary \ karma \ lastquote \ lib \ paste \ quotes \ share \ wisdom 18:32:18 `ls bin 18:32:19 CakeProphet: You're never gonna figure out how that works. 18:32:20 ​? \ addquote \ allquotes \ calc \ define \ delquote \ etymology \ forget \ fortune \ frink \ google \ json \ k \ karma \ karma+ \ karma- \ learn \ log \ logurl \ macro \ marco \ paste \ pastekarma \ pastelog \ pastelogs \ pastenquotes \ pastequotes \ pastewisdom \ ping \ prefixes \ qc \ quote \ quotes \ roll \ runperl \ toutf8 18:32:22 I suggest giving up. 18:32:36 elliott: how does it work (or not work, actually) 18:33:16 Gregor: Yo, there's a hole in http://sprunge.us/fcjP 18:33:20 Wait, I thought the gmail UI changed? 18:33:33 elliott: There's a hole in my bucket, my bucket, my bucket. 18:33:39 Gregor: s{'PRIVMSG '$CHANNEL' :'$MSG}{"PRIVMSG $CHANNEL :$MSG"} pls 18:34:40 elliott: Done 18:34:46 Gregor: Thx 18:36:57 -!- Siddiq has joined. 18:37:15 hello Siddiq 18:37:17 `? welcome 18:37:19 Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page 18:37:53 -!- Zwaarddijk has quit (Ping timeout: 240 seconds). 18:38:22 hi elliot 18:38:39 hi augur 18:38:40 elliott: I never got a welcome like that! 18:38:57 hello Siddiq 18:39:29 how are you 18:39:47 shachaf: Blah blah blah welcome blah blah blah hub blah blah blah exoteric voodoo programming blah blah blah 18:40:05 shachaf: Blah blah blah matrix of solidity blah blah blah 18:40:14 what is this 18:40:15 exoteric! 18:40:42 i would like to reiterate and expound upon what gregor just said 18:40:52 but i am too locked into my matrix of solidity 18:40:57 "blah blah blah spoons blah blah blah swordfish blah blah blah" 18:41:01 and so i will go away instead 18:41:10 shachaf: nope nope nope, there is no spoon 18:41:21 chuck testa! 18:41:28 -!- Siddiq has left. 18:41:35 Well that was expected :P 18:41:46 olsner: I see that it goes unappreciated. :-( 18:45:32 -!- ais523 has changed nick to ais523\unfoog. 18:45:39 there should be an esolang based on the other sort of esotericness 18:46:07 wait, lets make a bf clone with renamed command, like [ = matrix of solidity 18:46:18 ais523\unfoog: unfoog? I heard one of those guys lost their game because they were too busy chatting on IRC! 18:46:20 how about an ... esoteric programming esolang? 18:46:33 olsner, that is what I suggested 18:46:46 was the matrix of solidity thing once said by a parting visitor to this channel? 18:46:51 ais523\unfoog, hi there, is crawl: stone soup any good? 18:46:51 `quote matrix of 18:46:53 303) enjoy being locked in your matrix of solidity 18:47:00 Vorpal: I have a personal intense dislike for it 18:47:06 ais523\unfoog: Oh yeah, me and monqy are trying to tell Vorpal not to play Crawl because it sucks; he won't listen 18:47:07 ais523\unfoog, ah okay, why? 18:47:12 to the extent that I've been kicked from ##crawl-dev for trolling at least twice 18:47:15 elliott, monqy was just echoing you 18:47:21 elliott: was it followed by a ragepart? 18:47:22 Vorpal: because on paper it sounds like the sort of roguelike I'd like, but in practice it's awful 18:47:23 Vorpal: No, he said a bunch of things of his own accord 18:47:27 and also, it's getting worse as tme goes on 18:47:28 And is actually an experienced Crawl player 18:47:33 I'm not a very good Crawl player 18:47:37 ais523\unfoog, ah 18:47:38 I keep getting killed by the interface 18:47:45 which the Crawl devs keep insisting is better than NetHack's 18:47:46 aha, that sort of issues 18:47:49 either that, or killed by boredom 18:47:53 (indirectly, but still) 18:48:20 the best strategy is, to, whenever you come across something you're not certain you can handle, run away and go somewhere else 18:49:00 ais523\unfoog, well I have to say that nethack's interface is not exactly perfect though. 18:49:11 Vorpal: so do I 18:49:32 did you not notice that I was making a NetHack variant specifically for the purpose of having a better interface? 18:49:33 ais523 "AceHack" \unfoog must surely think NetHack's interface is the best. 18:49:44 what if fungot could invent esolangs based on trawling the wiki or something 18:49:45 olsner: eek. ppt :( emacs as my windowing system... fresco/ berlin has some *really* nice ideas, but also quite a few haskell papers already 18:49:54 olsner: Oooh, that'd be a good grammar. 18:50:01 ais523\unfoog, I thought it fixed a number of other issues, as well as some interface issues 18:50:10 Vorpal: what, AceHack? 18:50:15 ais523\unfoog, yes 18:50:19 indeed, it has bugfixes 18:50:30 ais523\unfoog, quite a few bug fixes iir 18:50:31 iirc* 18:50:31 a few marginal balance changes, but only when the original is mad enough to count as a bug 18:50:39 ais523\unfoog: BTW, is there a way to make AceHack /not/ put everything in a single acehackdir? 18:50:39 yep, but I still haven't fixed all the bugs yet 18:50:54 ais523\unfoog, where was the acehack changelog now agai 18:50:56 again* 18:50:57 elliott: not a supported way yet; however, I acknowledge that what it does at the moment is obviously mad 18:51:12 ais523\unfoog: What's the unsupported way? 18:51:14 there is a define somewhere called VAR_PLAYGROUND or something like that 18:51:22 I don't know what it does, but believe it's relevant 18:51:29 I also suspect it doesn't work 18:51:37 with the build system 18:51:42 but if you can get it working, good for you 18:51:43 ais523\unfoog: If I write a patch to make it do something vaguely FHSy or Kitten, will you accept it? :p 18:51:55 s/or/for/ 18:52:15 " eek. ppt :(", looks like fungot didn't appreciate my idea though 18:52:15 olsner: my home network is down for me 18:52:16 elliott: I won't reject patches that are obvious improvements; you might have to clear it with the server admins and whatever insane method they're using to get it working on servers, though 18:52:26 olsner: why did you send it a powerpoint? 18:52:30 use odp instead 18:52:32 ais523\unfoog: I could provde a --disable-sanity option for them :) 18:52:37 ais523\unfoog, well, from the nethack wiki... "The vibrating square is visible from a distance.", I'm not sure that counts as a bug in the original. 18:52:55 ais523\unfoog, after all, unless it has quite a large amplitude you can't really spot it from far away 18:53:00 ais523\unfoog: (I realise --disable-bugfix is never a good option to add) 18:53:06 elliott: the AceHack server admins are kerio and rawrmage; kerio reminds me of you, except more annoying and with worse taste in languages 18:53:17 Vorpal: it's an interface improvement 18:53:19 ais523\unfoog: oh dear; I don't think I'll like kerio 18:53:26 probably not, I don't think you would 18:53:46 * elliott manages to /just/ narrowly avoid being too annoying to not hate himself 18:53:49 Vorpal: it's flavoured as the air above the vibrating square glowing 18:54:01 ah 18:54:02 ais523\unfoog: wait, what kind of language taste are we talking about here? 18:54:16 C++? PHP? VB? SpectateSwamp Desktop Search? 18:54:23 (I'm sure you could program /something/ with the last one) 18:54:27 fanboy-level Python support 18:54:31 ais523\unfoog: I sent it an IRC message, not a powerpoint... I think ppt is just fungot's way of saying pfft 18:54:32 olsner: can you handle it? generally :) unless it's boring enough to now allow writing to code area... 18:54:37 ais523\unfoog: It's worse than I ever could have imagined :'( 18:55:08 ais523\unfoog, "Swapping your wielded and readied weapons no longer costs a turn. (Readying a weapon directly, something not possible in vanilla NetHack but possible in AceHack, does.) " hm, why would switching weapon not take time? 18:55:10 ais523\unfoog: If I had vagrant's source I'd tell you to show em vagrant :P 18:55:16 hmm, the fun got is amazingly intelligible today, have you changed the mode or something? 18:55:22 elliott: to get an idea of kerio, you could check the QDB; it submits by POST so I can't link to it, but http://qdb.rawrnix.com/?search and search for "kerio" 18:55:23 ^style 18:55:23 Available: agora alice c64 ct darwin discworld europarl ff7 fisher fungot homestuck ic irc* jargon lovecraft nethack pa sms speeches ss wp youtube 18:55:25 ^style fungot 18:55:26 Selected style: fungot (What I've said myself) 18:55:41 ais523\unfoog: I think I already read all the quotes in that qdb :) I only vaguely remember anything to do with kerio, but maybe I'm forgetful 18:55:44 Vorpal: because you're just switching items from one hand to the other 18:56:01 ais523\unfoog: wow, it jumps you to the bottom of the page after you submit, too 18:56:02 pro design 18:56:08 ais523\unfoog, that still takes some time in real life 18:56:14 I am partial to "angband is checkers on a 6400x6400 board", though 18:56:40 ha 18:56:43 -!- quintopia has quit (Ping timeout: 244 seconds). 18:57:34 ais523\unfoog: do you have any experience with the wikidumps? 18:57:35 -!- Zuu_ has joined. 18:57:59 elliott: you mean, dumps of MediaWiki wikis? 18:57:59 * elliott is wondering if they might work with sqlite 18:58:05 yes, esolang's to be exact 18:58:08 the sql dumps 18:58:09 not really; I know that they're pretty much just a sequence of SQL commands 18:58:12 but not more than that 18:58:18 (1,'Gravity/w/','','Hi, you\'re scum',89,'Oerjan','20090727114914',1,'',14965,14942) 18:58:18 wat 18:58:25 ) ENGINE=MyISAM DEFAULT CHARSET=latin1; 18:58:30 ais523\unfoog: a worryingly non-portable-looking sequence 18:58:48 yes 18:58:49 mysql dumps don't work out of the box with sqlite at least :) 18:59:06 yep, syntax errors 18:59:10 Error: near line 711: near "DELAYED": syntax error 18:59:10 Error: near line 719: near "unsigned": syntax error 18:59:10 Error: near line 743: near "DELAYED": syntax error 18:59:39 Shell script that converts a mysqldump file into Sqlite3 compatible SQL file. It uses awk for speed and portability. Runs on Windows with the Cygwin tool for Windows. 18:59:40 woot 18:59:45 https://gist.github.com/943776 18:59:46 I think I wrote a sed script to partially convert sql files one time, but noticed that other parts of that system used mysql features and couldn't use sqlite anyway 18:59:54 olsner: see above :P 19:00:07 mysqldump --compatible=ansi --skip-extended-insert --compact "$@" | \ 19:00:12 oh c'mon, let me specify my own file :) 19:00:36 ais523\unfoog, "A new "solo mode" prevents bones files from being loaded, and makes startscumming visible (normally, AceHack allows players to view and reroll their stats and inventory before starting the game). " <-- sure I can see the reason for all of these points, but why is the "don't load bone files" under the same option as "make startscumming visible"? 19:01:08 sigh, still a fuckton of syntax errors 19:01:21 elliott, why are you using mysql!? 19:01:31 Vorpal: read context or shut up 19:01:42 Vorpal: because they're both pretty much a case of showing that streaks are real 19:01:43 i'm trying /not/ to use mysql 19:02:06 Vorpal: he's got a mysql-specific DB dump, and is trying to convert it to something non-mysql, I guess by importing it into mysql and exporting it again 19:02:10 ah 19:02:16 ais523\unfoog: nope, by running an awk script over it 19:02:21 i'm trying to avoid installing mysql :) 19:03:07 ais523\unfoog, well, bone files are pretty much hit and miss, I wouldn't call it unreal just because you got a lucky bone. Same as I wouldn't call it unreal if the PRNG happened to favour you when fighting Rodney 19:03:08 -!- Zwaarddijk has joined. 19:03:30 Vorpal: bones files can be manipulated 19:03:40 and in fact, often /are/ in record-aiming play 19:04:00 * elliott runs a vi command over 100 megs of data 19:04:13 ais523\unfoog, how, unless you have write access to the files in question? 19:04:27 Vorpal: by playing a game on another account? 19:04:35 pudding farm for 20 hours, genocide P, suicide 19:04:38 well sure, but anyone could get that bone 19:04:41 you might not 19:04:48 do it with your other character waiting on the level above 19:05:05 if you don't get it, do it all again on the level below 19:05:10 then the level below that if it still doesn't work 19:05:12 etc 19:05:21 quite a lot of work, but sure 19:05:27 Vorpal: it's been done 19:05:31 what are the chances for bones? 19:05:31 more than once, in fact 19:05:49 leaving it's depth-dependent; loading is a fixed probability IIRC, although I don't remember whether it's 1/3 or 1/2 19:06:10 that much, hm 19:06:11 -!- quintopia has joined. 19:06:11 -!- quintopia has quit (Changing host). 19:06:11 -!- quintopia has joined. 19:06:25 Vorpal: well, normally a bones file doesn't exist for any given level 19:06:39 hm? 19:06:46 ais523\unfoog: wiki spam 19:06:54 ais523\unfoog: quick, what table are all the /newest/ revisions of articles stored in, in MW? 19:06:58 Vorpal: because levels are visited much more often than they are died in 19:07:06 elliott: gah, I can't remember 19:07:11 it may be "page" or "pages" or something like that 19:07:11 ais523\unfoog: wiki spam <-- what 19:07:23 ais523\unfoog: i'll grep :P 19:07:25 ais523\unfoog, ah right 19:07:28 I ask other people to report it 19:07:34 so it'd be hypocritical not to do it myself? 19:07:54 ais523\unfoog: why the hell does MW prefix fields with a shortened version of the table name?,.. 19:07:56 ais523\unfoog, you could just fix it without reporting 19:07:58 s/fields/columns/ 19:08:05 -!- Zuu_ has quit (Ping timeout: 244 seconds). 19:08:17 elliott: presumably so it doesn't need to alias them in joins? 19:08:22 elliott, I guess it might make joins easier, avoiding some ... 19:08:23 snap 19:08:23 ais523\unfoog: :( 19:08:31 nasty 19:08:36 it does that everywhere, btw, even in the API 19:08:39 :( 19:08:40 nasty 19:11:23 ais523\unfoog: hmm, mw_page seems to contain everything /but/ the text 19:11:37 what about "revisions"? 19:11:39 `page_latest` int(8) unsigned NOT NULL default '0', 19:11:39 worryingly, no foreign key here... 19:11:52 ais523\unfoog: there's an mw_archive 19:11:58 but the name of that seems to suggest it's all /old/ revisions 19:12:00 that's deleted pages IIRC 19:12:08 oh 19:12:11 those are included in the dump?? 19:12:14 cooool 19:12:15 perhaps not, why would they be in the dump? 19:12:27 ais523\unfoog: well, they are 19:12:29 I'm really not an expert on MediaWiki's internals 19:12:31 INSERT DELAYED INTO `mw_archive` (`ar_namespace`, `ar_title`, `ar_text`, `ar_comment`, `ar_user`, `ar_user_text`, `ar_timestamp`, `ar_minor_edit`, `ar_flags`, `ar_rev_id`, `ar_text_id`) VALUES (1,'Turing_tarpit','','wDMfMOGCFBaes',0,'202.99.29.27','20090721214654',0,'',14920,14897),(1,'Fractran_plus_plus/','','Bad Credit Debt Consolidation Personal Loan',0,'218.23.143.125','20090724082501',0,'',14937,14914),(1,'W/','','Hi, I`m new',0,'212.235.107 19:12:31 .87','20090724154130',0,'',14940,14917),(2,'508_buy_zyvox','','New page: [http://www.mcgillcorp.industrialguard.com/invboard/index.php?showuser=910 Metformin] He send somebody instead of going hisself? Bad for business all that noise. Well sport have you figure...',422,'508 buy zyvox','20090725145129',0,'',14948,14925),(2,'508_buy_zyvox','','rm spam',139,'Smjg','20090725150733',0,'',14949,14926),(1,'Gravity/w/','','Hi, I`m new',0,'212.235.107.87', 19:12:31 '20090727090915',0,'',14964,14941),(1,'Gravity/w/','','Hi, you\'re scum',89,'Oerjan','20090727114914',1,'',14965,14942),(1,'W/','','Hi! New member here :)',0,'91.121.12.73','20090727235547',0,'',14977,14954),(1,'Gravity/w/','','Hi! New member here :)',0,'91.121.12.73','20090801083818',0,'',15004,14981),(1,'W/','','Hi! New member here :)',0,'91.121.12.73','20090815065357',0,'',15154,15131),(1,'Gravity/w/','','Hi! New member here :)',0,'91.121.12.73 19:12:36 ','20090816162120',0,'',15178,15155),(1,'Befunge/index.php','','NYC Photo Studio 917 484 6430',0,'212.235.107.27','20090820031732',0,'',15318,15293),(2,'5k63ded6ttcyf67','','New page: easf57ase7fske99898ffhhfh So. \'D\' -- that should be a guide. \" \"The man was a Spaniard. I suggest that \'D\' stands for Dolores a common female name in Spain. \" \"Good Watson very good -- b...',436,'5k63ded6ttcyf67','20090824085757',0,'',15364,15339),(1,'Befu 19:12:39 spam 19:12:41 nge/index.php','','Registration and Hosting Godaddy Promo Codes',0,'212.235.107.215','20090828053353',0,'',15451,15425),(1,'Main_Page/index.php','','Анекдоты',0,'82.193.114.92','20090627120826',0,'',14747,14723),(1,'Main_Page/index.php','',' yep, that looks like deleted pages to me 19:12:44 elliott, try a pastebin 19:13:09 Vorpal: it was a mistake 19:13:12 okay 19:13:16 and it was only five lines :) 19:13:22 elliott, five huge lines 19:13:27 (0,'AAAAAAAAAAAAAA','','AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA',0,'66.210.7.66','20091008222055',0,'',16169,16139) 19:13:31 a page too beautiful for this world 19:13:37 elliott, I have this thing we call line wrapping. 19:13:40 ais523\unfoog: aha, there's mw_revision 19:13:52 sounds like the right one 19:13:57 oh, also mw_text 19:14:07 mw_text is... confusing 19:14:10 ah, that one might be for current revisions only 19:14:12 all the columns but one start with "old_" 19:14:19 the one that doesn't is "inverse_timestamp" 19:14:34 it /does/ contain text though 19:14:40 elliott: "oldid" is actually the name for a revision's ID number, for historical reasons 19:14:43 elliott: what, inverse_timestamp? 19:14:55 ais523\unfoog: no, mw_text :P 19:15:05 ais523\unfoog: and ok, but there's even like 19:15:09 `old_comment` tinyblob NOT NULL, 19:15:09 `old_user` int(5) unsigned NOT NULL default '0', 19:15:16 what is an inverse time stamp? 19:15:26 does the concept of the inverse of the timestamp even make sense 19:16:40 INSERT DELAYED INTO `mw_text` (`old_id`, `old_namespace`, `old_title`, `old_text`, `old_comment`, `old_user`, `old_user_text`, `old_timestamp`, `old_minor_edit`, `old_flags`, `inverse_timestamp`) VALUES (1,0,'Main_Page','Wiki software successfully installed.\n\nPlease see [http://meta.wikipedia.org/wiki/MediaWiki_i18n documentation on customizing the interface]\nand the [http://meta.wikipedia.org/wiki/MediaWiki_User%27s_Guide User\'s Guide] for u 19:16:41 sage and configuration help.','',0,'MediaWiki default','20050406083246',0,'utf-8','79949593916753'),(15,0,'PATH','\'\'\'PATH\'\'\', invented by Francis Rogers in August 2003, is a two-dimensional language inspired by [[Brainfuck]] and [[Befunge]]. PATH\'s environment, like Brainfuck\'s, consists of an array of memory cells all initialized to zero and character-based standard input and output. PATH understands the following commands:\n\n $ - Start 19:16:41 the program here, heading right.\n # - End the program.\n + - Increment the current memory cell.\n - - Decrement the current memory cell.\n } - Move to the next memory cell.\n 19:16:49 ais523\unfoog: ah, mw_text looks like the text of /all/ revisions 19:16:53 going by that main page thing 19:17:10 [[PATH]] is our earliest non-deleted page, looks like 19:17:17 elliott, but what is an inverse time stamp 19:17:23 Vorpal: I DON'T KNOW 19:18:19 http://www.mediawiki.org/wiki/Help:Tables 19:18:21 that's not what I want, MW 19:18:30 I want help on the /other/ kind of table 19:18:40 http://www.mediawiki.org/wiki/Manual:Database_layout yay 19:19:11 http://esolangs.org/wiki/Special:Version <-- seriously? 19:19:11 http://www.mediawiki.org/wiki/Manual:Text_table ;; gah, it must have changed since Esolang's version 19:19:19 1.9.3? 19:19:30 Vorpal: hey, we're on PHP 5, that's impressively modern for Esolang 19:19:43 what is the current php version? 19:19:46 I have no idea 19:19:54 5.3.8, looks like 19:20:12 mysql 4? 19:20:14 oh come on 19:20:31 I've used MySQL 3 19:20:35 so have I 19:21:24 "Version 5.1 contained 20 known crashing and wrong result bugs in addition to the 35 present in version 5.0 (almost all fixed as of release 5.1.51)." 19:21:33 "Version 5.0: beta from March 2005, production release October 2005 (cursors, stored procedures, triggers, views, XA transactions) 19:21:33 The developer of the Federated Storage Engine states that "The Federated Storage Engine is a proof-of-concept storage engine",[31] but the main distributions of MySQL version 5.0 included it and turned it on by default. Documentation of some of the short-comings appears in "MySQL Federated Tables: The Missing Manual".[32]" 19:21:38 Vorpal: can't say i'm unhappy we're on mysql 4! 19:22:11 heh 19:22:49 [elliott@dinky tmp]$ grep 'INSERT DELAYED INTO `mw_text`' latest.sql | wc -l 19:22:49 150 19:22:56 oh great, I have to parse multiple records per line 19:22:59 what is an delayed insert ? 19:23:11 [elliott@dinky tmp]$ grep 'INSERT DELAYED INTO `mw_text`' latest.sql | head -n 1 | wc -c 19:23:11 1041590 19:23:15 oh wait, related to foreign keys I guess? 19:23:16 LINES SHOULD NOT BE THAT LONG 19:23:21 why just not do it in a transaction 19:23:29 does mysql even have transactions :) 19:23:37 elliott, only with innodb iirc? 19:23:45 there you go then 19:23:49 hm 19:24:00 mysql is a joke 19:24:04 sql is a joke 19:24:18 elliott, not for all tasks 19:24:22 for all tasks :) 19:24:27 not really 19:24:32 yup! 19:24:41 ok, at least this format looks relatively simple 19:24:43 the relational model isn't always wrong 19:24:49 time to bust out the ghci guns 19:24:54 Vorpal: sql violates the relational model's fundamental principles 19:25:00 i repeat: for all tasks 19:25:08 elliott, oh? which principles ? 19:25:42 Vorpal: http://en.wikipedia.org/wiki/Codd's_12_rules 19:25:53 there's a list of the ones that SQL breaks somewhere 19:25:56 tl;dr "almost all of them" 19:26:28 ISTR SQL has problems with ACID too, like by default the I part is relaxed or something 19:26:54 hm 19:27:22 well rule 3 is implemented at least 19:27:59 http://en.wikipedia.org/wiki/Relational_model#SQL_and_the_relational_model 19:28:06 rule 4 too, at least for postgre 19:28:17 "SQL's NULL construct was intended to be part of a three-valued logic system, but fell short of that due to logical errors in the standard and in its implementations." 19:28:22 so it doesn't do rule 3 19:28:48 hm 19:31:50 hm 19:31:53 hm 19:31:54 oh well 19:33:12 Huh, reddit went down. 19:33:34 it does that a lot 19:33:53 oh, recently discovered; part of Amazon's load balancing stuff relies on ISPs respecting the DNS standard 19:34:02 they don't, and as a result it often sends loads of data to the wrong person 19:36:05 [elliott@dinky mw-text]$ ./extract latest.sql 19:36:05 Killed 19:36:05 wow, what? 19:36:29 check the syslog in case it's the OOM killer 19:36:40 it's got to be that or a self-kill, surely 19:38:00 syslog is just syslog-ng bragging about it starting up and shutting down 19:38:08 [ 8960.559879] Out of memory: Kill process 3630 (extract) score 692 or sacrifice child 19:38:08 [ 8960.559885] Killed process 3630 (extract) total-vm:2712256kB, anon-rss:2691632kB, file-rss:0kB 19:38:09 -- dmesg 19:38:10 -!- Zuu_ has joined. 19:38:16 elliott, impressive 19:38:27 not really, it just used too much memory :P 19:38:30 I have no swap 19:38:34 ah 19:38:39 elliott, you need more ram then 19:38:48 elliott, or not read the whole file at once 19:38:49 no, I need a program that isn't broken 19:38:56 the file is 100 megs 19:38:58 the file is not the problem 19:38:59 heh 19:39:14 elliott: "(extract)"? 19:39:20 ais523\unfoog: that's the name of the process 19:39:22 also, I bet the "sacrifice child" is deliberate 19:39:24 ah, I see 19:39:50 I got an actual out of memory error a while back, I think because I turned the OOM killer off 19:39:59 Hello! 19:40:03 Am I here? 19:40:05 no 19:40:06 ais523\unfoog, what happened then? oops? 19:40:09 but it hit the right process (I was trying to do a brute-force A* search on a variant of the travelling salesman problem) 19:40:18 Vorpal: no, malloc failed 19:40:21 ah 19:40:28 and the process in question reacted by exiting 19:40:31 so all was well 19:40:41 monqy, oh, cool 19:40:50 come to think of it, though, the malloc failure's going to hit a process at random based on how often they request memory 19:41:01 really, we need a non-overcommit OOM mallocfailer 19:41:12 good idea 19:41:18 which is like an OOM killer, except it decides just before memory gets actually maxed which process/processes are going to get malloc failures first 19:41:37 very good idea that 19:41:50 presumably each process has a memory full percentage 19:42:06 which might be 95% for a really greedy killable process, 98% for something more normal, and 100% for init 19:42:29 maybe I'm just confused as to what breakSubstring does... 19:42:52 Vorpal: it's actually doable in glibc, I think 19:42:53 ais523\unfoog, oh btw, oom killer is going to introduce some non-determinism in secret project. Example: fork() a few times, and start mallocing in all child processes, then from the parent process report which child is killed first 19:43:00 /proc can say what the OOM score of a process is 19:43:04 it might even be that the parent is killed first 19:43:11 ais523\unfoog: we just need a system that has ~a hundred times the heap, and performs gracefully under conditions usually referred to as "swapping" 19:43:21 Vorpal: right, indeed; one of the assumptions I make on processes is that they don't cap the memory, just like another is no infinite busyloops 19:43:22 ais523\unfoog: you could call it... orthogonal persistence! 19:43:29 ais523\unfoog, ah 19:43:34 -!- GreaseMonkey has joined. 19:43:38 elliott, the answer to all things. 19:43:40 (the Secret Project rewrites processes to use cooperative multitasking, effectively, to make them deterministic) 19:43:42 ais523\unfoog: btw, I wrote a proof-of-concept of my busyloop exploiter 19:43:48 ais523\unfoog: and thought of a way to partially fix the problem in doing so 19:44:11 elliott: nanosleep(1) in the loop? 19:44:19 so you're seeding on the scheduler? 19:44:19 no, I mean fix the problem in the Secret Project 19:44:23 ah, what? 19:44:28 ais523\unfoog: Implement alarm/ualarm in term of context switches 19:44:31 rather than real time or whatever 19:44:40 but that would change the timings 19:44:45 ais523\unfoog: huh? 19:44:56 the program can't observe how much time passes 19:44:58 if you set alarm(1) to 100 context switches not 1 second, say 19:45:08 like i said, the program can't observe how much time passes 19:45:09 elliott: sure it can, it can use gettimeofday or whatever 19:45:11 so what does it matter? 19:45:17 ais523\unfoog: that gives nondeterminism... 19:45:22 surely you're overriding the clock 19:45:23 elliott: it doesn't return the actual time 19:45:34 but secret project's calculation of what the time should be 19:45:35 ais523\unfoog: why not just set the time at 0 always? 19:45:45 elliott: loads of programs break if you do that 19:45:50 ais523\unfoog: like what? 19:45:52 elliott, that would break something like cfunge running mycology 19:46:03 here, have a clue: setting the time at 0 always is fundamentally incompatible with the Secret Project's purpose 19:46:12 elliott, since it checks what granularity HRTI provides 19:46:17 that's a clue as to what it's for that hasn't been given before, I think 19:46:25 hmm, okay 19:46:33 as a bonus clue, the [CENSORED]s in the scheduling description were all related to simulated real time 19:46:34 ais523\unfoog: btw, will there be a way to override the scheduler stuff? 19:46:44 and do what instead? 19:46:46 I'd like to avoid it, as I don't need that level of nondeterminism, and I'd like to be able to use -j3 19:46:49 ais523\unfoog: just use the normal scheduler 19:47:20 that again is defeating the point of reproducibility; actually, you'd have to comment out large swathes of the Secret Project to do that 19:47:29 because most of the complicated stuff is the scheduler 19:47:40 ais523\unfoog: oh, stop it, you /don't/ get perfect reproducibility 19:47:51 so you can't act like wanting "as much reproducibility as possible without sacrificing X" is an insane desire 19:48:05 elliott: I want perfect reproducibility on a subset of programs 19:48:20 as large as is reasonable, but it's more important for a single program to be reproducible, than it is for all programs to be mostly reproducible 19:48:21 int main(){exec(argv)} # secret project 19:48:21 ais523\unfoog, oh I know of the use now. 19:48:25 Vorpal: really? 19:48:38 ais523\unfoog, well, a possible one that would fit rather well at least 19:48:41 go for it 19:48:42 Vorpal: go on 19:48:48 ais523\unfoog, it involves TAS. 19:48:56 I already proposed that, methinks 19:48:59 oh okay 19:48:59 also, this is meant to be for work, isn't it? 19:49:03 hm okay 19:49:04 elliott: no, haha 19:49:05 I doubt ais523\unfoog is paid to do TASes 19:49:08 I have something for work which is vaguely similar 19:49:13 but that's entirely a coincidence 19:49:17 ais523\unfoog: oh, okay. /is/ it TASes, then? 19:49:20 ais523\unfoog, well, is it related to doing TAS? 19:49:24 elliott: it is related to those, yes 19:49:26 but keep it secret 19:49:31 haha 19:49:33 ais523\unfoog: Is it related to the NetHack TAS? 19:49:38 aha 19:49:42 * elliott will keep a sekrit. 19:49:46 I have been trying to test it on NetHack, indeed 19:49:49 yay! 19:49:50 like the whole channel knows it now 19:49:58 secret enough :) 19:50:01 whatever 19:50:12 it took like a year for everyone to get the knowledge of my age 19:50:18 and then we all forgot again 19:50:19 even after it was repeatedly publicly stated 19:50:20 ais523\unfoog, well, no need to hide anything now. Unless there is more to it 19:50:23 ais523\unfoog: you did? 19:50:34 elliott: I'm really bad at remembering ages, they change too much 19:50:43 approximately half the time, I'm not even sure what my own is 19:50:48 elliott, I believe you would be 14 or 15 now? 19:50:50 although I know my birthdate and the formula 19:50:50 ais523\unfoog: don't worry, mine won't change for approx. another year 19:50:52 Vorpal: 16 19:51:09 * elliott legal :/ 19:51:09 elliott, oh really, well, retroactive happy bday then 19:51:13 soon, they'll be letting me drive cars :( 19:51:22 or, well, letting me attempt to prove I can drive a car 19:51:22 elliott, isn't that at 18? 19:51:28 17 I think 19:51:28 it is here 19:51:31 hm okay 19:51:32 you become legal to do different things at different ages 19:51:35 it's 17 for driving in the UK 19:51:50 surprising EU hasn't standardised that 19:52:07 it is definitely 18 in Sweden 19:52:10 Vorpal: the EU has standardised tons of things, doesn't mean the UK listens :) 19:52:15 FOR EXAMPLE 19:52:16 KRONOR 19:52:16 fair enough 19:52:17 COUGH COUGH 19:52:29 elliott, yeah £ too 19:52:39 anyway, our way of opting out is more amusing 19:53:01 Vorpal: Don't you guys just claim your economy is smaller on the inside? 19:53:05 Like a reverse TARDIS. 19:53:18 elliott, I think something like that yes. I don't have any reliable source on it though 19:53:21 Is the inside of Globen the size of a cupboard? 19:53:26 Is that your Fort Knox. 19:53:30 heh 19:54:06 ais523\unfoog: anyway, re: having to comment out huge parts of the secret project, I'll probably just turn everything into an option when I get my grubby paws on it 19:54:32 I'm just annoyed at having to implement BSD sockets 19:54:44 ais523\unfoog: anyway, if you're already doing alarm/ualarm with simulated time, my program /might/ not work 19:54:46 and I don't even know how socketcall(2) works, as it's not properly documented 19:54:53 ais523\unfoog: I can send a copy if you want to try it out, it's trivial to tset 19:54:54 test 19:54:57 may as well 19:55:22 ais523\unfoog: wget http://sprunge.us/FfMA -O nondet.c; gcc nondet.c 19:55:38 err, I'm going to read the file first ;) 19:55:53 ais523\unfoog: I doubt I could crash your system with a gcc call 19:55:58 you could run gcc in the secret project to be sure :) 19:56:06 ais523\unfoog: anyway, testing: 19:56:12 $ ./a.out | head -c 100 >a 19:56:13 elliott: the secret project is not designed for security, and in particular, doesn't sandbox several syscalls yet 19:56:13 ais523\unfoog, anyway, no need for secretness around the secret project any more now that we know what it is for. So what is the actual name of it (if it has any?) 19:56:14 $ ./a.out | head -c 100 >b 19:56:16 $ diff a b 19:56:18 Vorpal: Web of Lies 19:56:37 I think I'm going to keep calling it the Secret Project 19:56:45 but Web of Lies is a great name 19:56:50 ais523\unfoog, okay, that would definitely not have told us anything really beyond what we know, I assume it is a reference to that it lies to the program? 19:56:59 yes 19:57:05 and then invents more lies to cover its old ones 19:57:15 ais523\unfoog, what would the executable name be? wol? 19:57:20 ais523\unfoog: yeah, but I can sound credible if I call it the TSP Isolation System 19:57:22 elliott: I'm not even convinced I've implemented ualarm yet 19:57:23 Vorpal: weboflies 19:57:31 I'm not in the 8.3 era any more 19:57:34 heh 19:57:34 ais523\unfoog: you can use alarm(1) instead, and put alarm(1) at the end of handle 19:57:39 and it's not like it's the sort of thing you run constantly 19:57:43 ais523\unfoog: use head -c 10 if you do, it'll be much slower 19:58:04 Vorpal: congrats on getting it, btw 19:58:12 elliott, it was obvious 19:58:24 Vorpal: that's not what you said all the previous times 19:58:31 ais523\unfoog: you can use alarm(1) instead, and put alarm(1) at the end of handle 19:58:34 elliott, because it wasn't obvious in those cases 19:58:34 I wonder if this is actually allowed :) 19:58:36 it'll probably work though 19:58:50 elliott, man 7 signal says it is allowed 19:58:53 yay 19:58:54 ah, seems ualarm gets translated to setitimer(2) 19:59:05 -!- Ngevd has quit (Ping timeout: 240 seconds). 19:59:12 which I haven't implemented 19:59:25 * ais523\unfoog replaces with alarm 19:59:39 oh, there's clearly no point 19:59:49 "for (;;) i++;" always wedges the Secret Project, the way it works 19:59:50 implemented the same way? 20:00:05 Vorpal: I'd probably implement it the same way I implemented alarm, indeed 20:00:15 ais523\unfoog, oh you implement alarm 20:00:16 okay 20:00:29 Vorpal: well, what else can I do? I can't pass through the syscall 20:00:54 for obvious reasons 20:01:01 and returning ENOSYS would break too many programs 20:01:08 "for (;;) i++;" always wedges the Secret Project, the way it works 20:01:11 ais523\unfoog, so what do you implement alarm() as? 20:01:12 ais523\unfoog: do you support pthreads? 20:01:15 (getting random ENOSYSes is an occupational hazard of running under the Secret Project) 20:01:25 elliott: sort-of; it seems to work but I don't know why 20:01:29 heh 20:01:37 ais523\unfoog, and I thought alarm would be implemented with setitimer as well 20:01:48 ais523\unfoog: but yeah, afaict certain parts of the secret project are useful to me and the rest aren't 20:01:49 I /have/ special-cased futex(2), which is involved 20:01:55 so I'll probably just hack up my own thing based on it :P 20:02:59 wow, it's hard to get this ualarm-free version working 20:03:04 the increment loops keep syncing up 20:03:10 * elliott tries a division loop 20:03:10 ais523\unfoog, any plans for TAS other than of nethack? 20:03:15 Vorpal: perhaps 20:03:15 or acehack of course 20:03:25 in fact, I can TAS NetHack even without this, so it would be fun to use it on other games 20:03:51 ais523\unfoog: Will SDL work in it? :P 20:03:58 elliott: SDL already does work in it 20:04:01 ais523\unfoog: wow 20:04:05 ais523\unfoog, against what? X? 20:04:06 ais523\unfoog: how fast do SDL games go? 20:04:08 however, without sound 20:04:17 ais523\unfoog: what about opengl? 20:04:26 now that would be hard 20:04:30 and many programs (e.g. Battle for Wesnoth) don't handle SDL framebuffer properly 20:04:39 ais523\unfoog, report bugs? 20:04:47 elliott: remember when I was in here asking questions about Mesa's software emulation? 20:04:48 Vorpal: you are so naive 20:04:53 ais523\unfoog: ah 20:04:58 ais523\unfoog, so... it works? 20:04:58 ais523\unfoog: I'm, umm, not sure Minecraft will run at acceptable speeds 20:05:07 it's not meant for interactive use 20:05:19 as in, playing games full-speed 20:05:23 I'm trying to think of what a Minecraft TAS would look like now 20:05:24 there is noticeable slowdown, mostly 20:05:30 also, sometimes noticeable speedup 20:05:34 speedup? :D 20:05:39 when a program's just waiting 20:05:44 it can fast-forward 20:05:45 ais523\unfoog, how much of a FPS drop do you get from weboflies typically with opengl stuff? 20:05:56 -!- nooga has joined. 20:06:02 Vorpal: I don't have OpenGL working yet 20:06:06 but I imagine it'd be quite a large one 20:06:06 oh okay 20:06:16 the joyous thing is, that weboflies only has a performance penalty on syscalls 20:06:30 so heavy computation – like, say, emulating a GPU in software – isn't slowed down at all 20:06:35 heh 20:07:01 and is counted as zero emulated time 20:07:02 anyone experienced in Cocoa? 20:07:09 I wish SQLite used something other than SQL 20:07:12 nooga: I assume at least one person is, but possibly nobody here 20:07:27 too bad 20:07:37 I have a design problem 20:08:13 ais523\unfoog, so, when are we going to be able to get our hands on it? When it is complete? Or before that? 20:08:57 I suppose there's no real reason not to PM you/elliott the source now; although note that a) it needs to run as root, and b) it /will/ do insane things, so run it at your own risk 20:09:03 yay 20:09:07 I'm pretty sure it's triggered multiple kernel bugs so far 20:09:13 ais523\unfoog: what license is it going to be under when it's "done", btw? 20:09:24 let me see if there's a license on there atm 20:09:28 ais523\unfoog, btw thanks for using that nick. Otherwise I wouldn't have thought of nethack at the point crucial to making the discovery 20:09:46 currently unlicensed, it seems 20:09:49 most likely GPLv3 20:09:50 -!- augur has quit (Remote host closed the connection). 20:10:01 :( okay 20:10:14 fair enough, I don't have any actual use of it right away, unlike elliott 20:10:15 do you have a good argument for using something else? 20:10:30 nah, GPLv3 is fine with me. 20:10:35 i doubt he was asking you :P 20:10:40 I was asking elliott, I knew /you/ wouldn't mind GPLv3 20:10:42 ais523\unfoog: no, I just don't like modifying GPLv3 software :) 20:10:44 right 20:10:51 ais523\unfoog: (or GPLv2 software) 20:10:54 or GPLv1 software, for that matter 20:10:56 but I'll cope :p 20:11:00 elliott: some odious legal requirement that makes it hard to do correctly? 20:11:01 I only do BSD or MIT when a significant part of the program I'm writing already consists of such code 20:11:11 ais523\unfoog: yes, it's called not liking the GPL 20:11:16 modifying GPLv0 is a real pain, as it requires you to keep last-modified dates in the files itself 20:11:21 which really messes up the repos 20:11:22 haha 20:11:28 that bug has been fixed since, I believe 20:11:29 ais523\unfoog, heh 20:11:44 I don't think anyone actually /enforces/ that requirement, but you know me… 20:12:49 ais523\unfoog: if you don't have anywhere to put the tarball I can get you an nc port 20:12:57 heh 20:13:11 elliott: PMed 20:13:16 I pastebinned it, as it's a single C file 20:13:18 ais523\unfoog: oh no, it's all in one file? 20:13:21 yes 20:13:30 ais523\unfoog: are you sure that maintained the ^Ls? 20:13:42 it probably didn't, but they're not all that important 20:13:59 ^L? 20:14:03 what's so bad about having it as a single C file? 20:14:08 ais523\unfoog: tell that to the person wading through an almost whitespaceless block of source :) 20:14:12 (the person is me) 20:14:21 elliott, please explain modules to ais523\unfoog 20:14:29 I don't think I can face it 20:14:35 I doubt something like this can be made truly modular 20:14:36 ewarn(mkdir("/tmp/home/ais523", 0755)); 20:14:58 ais523\unfoog: Could I convince you to sprunge a uuencoded version? :p 20:15:20 Vorpal: around half the program is just one long switch statement 20:15:26 you can't split a switch statement across files 20:15:35 * elliott . o O ( yes you can ) 20:15:37 ais523\unfoog, #include is done at a text level 20:15:40 ais523\unfoog, so yes 20:15:45 that's not being modular 20:15:47 that's just #include 20:15:57 each syscall in its own implementation file is certainly modular 20:16:00 ais523\unfoog, well okay you can do like switch 5123: foo(); break; 20:16:01 or such 20:16:05 modules are allowed to have outside dependencies 20:16:23 elliott: I'm feeling evil, so I just PMed you a cat -v version 20:16:31 lol 20:16:41 ais523\unfoog: cat -v isn't even reversible, dude 20:16:48 I know 20:16:59 [look of disapproval] 20:17:05 ais523\unfoog: oh, yikes, I forgot this thing is x86-specific :( 20:17:06 however, the two versions should be enough /between/ them to recover the original 20:17:21 and yes; luckily, adding x86_64 support wouldn't be all that insanely hard 20:17:23 elliott, 32-bit? 20:17:26 ah 20:17:31 Vorpal: it contains hardcoded register names 20:17:33 ais523\unfoog: I care about other architectures than just that :) but x86-64 is a must for me 20:17:41 (well, fsvo care) 20:17:51 ais523\unfoog: would incrementing the kernel version break anything? 20:17:57 (in all likelihood) 20:18:08 elliott: you mean, what real kernel is being used? or what kernel it claims to be? 20:18:11 I don't think either would break anything 20:18:13 latter 20:18:29 I'd like to pin it to the real kernel version, for compiling things like modules that might care 20:18:40 [look of disapproval] 20:18:48 yes I can see parts of this would be extremely useful to elliott, but merging improvements from either side is going to be a pain due to the one-file system 20:18:51 note that it will /run/ on x86_64, just it runs 32-bit apps 20:19:02 ais523\unfoog: why disapproval at that? 20:19:07 i was talking about kernel modules 20:19:16 sounds like you're insecure about your bad code organisation :) 20:19:23 elliott: of changing the version 20:19:23 ais523\unfoog: bug report: 20:19:23 if (ar0.esi) 20:19:23 { 20:19:30 indentation bug? 20:19:35 I don't really care 20:19:42 elliott, modules shouldn't care, they should take their kernel module version from the kernel source tree they are building against 20:19:49 Vorpal: fair enough 20:19:58 maybe I'll just split this into multiple files myself 20:20:05 elliott, have fun merging updates then 20:20:32 elliott, you obviously just need to throw in a few #ifdef 20:20:43 if (!read_write_state && 20:20:44 (S_ISREG(fdstats.st_mode) || 20:20:44 S_ISDIR(fdstats.st_mode) || 20:20:44 S_ISBLK(fdstats.st_mode) || 20:20:44 (((fdstats.st_rdev == 20:20:44 makedev(136, shared_memory->pty_number)) || 20:20:46 (fdstats.st_rdev == makedev(5, 0))) && 20:20:48 ((ar0.orig_eax == SYS_write || 20:20:50 ar0.orig_eax == SYS_writev || 20:20:51 spam 20:20:52 ar0.orig_eax == SYS_pwritev))))) { 20:20:54 ais523\unfoog: [look of disapproval] 20:21:00 Vorpal: everyone needs to see what ais has done :) 20:21:11 elliott, well, be happy it wasn't all on one line 20:21:16 it could have been worse 20:21:27 elliott, anyway you should have done it in PM 20:21:31 elliott: what would you /want/ me to do? split the condition? 20:21:47 hmm, I think a comment is needed to explain the 136, at least 20:21:48 ais523\unfoog: that thing has /multiple side-effects/! 20:21:58 no it doesn't 20:22:04 makedev is pure? 20:22:06 yes 20:22:10 it's a bitfield packer 20:22:16 wow 20:22:17 huh 20:22:23 ais523\unfoog, what does the 136 mean? 20:22:23 fuck life :P 20:22:56 ais523\unfoog: whatever RSTATBW is, you should have a version specialised to an empty fisrt argument 20:23:00 first 20:23:06 /* 5,0 = /dev/tty; 136,n = /dev/pts/n. */ 20:23:09 #define RSTATBW(x,y) (is32bit ? (x rstat y) : (x rstat64 y)) 20:23:09 ouch 20:23:10 ah 20:23:11 at least there's a comment explaining it /somewhere/ 20:23:28 elliott, is that about large file support? 20:23:29 bug report: /* We need to turn off ASLR even if a proces explicitly 20:23:30 elliott: OK, that's quite an abuse of the preproc, I admit 20:23:31 :p 20:23:31 Vorpal: yes 20:23:33 ("proces") 20:23:48 ais523\unfoog, you can turn off ASLR? 20:23:55 without changing kernel config I mean 20:24:01 yes 20:24:02 Vorpal: yes 20:24:04 how? 20:24:09 personality(2) 20:24:13 aha 20:24:21 is that the thing used for linux32 and so on? 20:24:23 hm seems sop 20:24:24 so* 20:24:26 it only works for the one exec, unless you debug-hook the process you create with the exec and inject calls to personality in it 20:24:29 which I, umm, may have done 20:24:33 :D 20:24:40 ais523\unfoog: Do you accept file-splitting patches? :p 20:24:54 ais523\unfoog, so how does that linux32 command work then, it seems to work recursively 20:25:03 Vorpal: I don't know of linux32 20:25:09 ais523\unfoog: also, what compile command? 20:25:13 it is a symlink to setarch 20:25:19 which is: setarch - change reported architecture in new program environment and set personality flags 20:25:20 hm 20:25:25 gcc -o weboflies -O2 -g --std=gnu99 -Wall -Wextra -Wno-missing-field-initializers -Wno-missing-braces weboflies.c ktt.c -lrt -lpng 20:25:28 oh, seems I'm missing ktt.c 20:25:28 looks like reported arch is NOT a personality thingy 20:25:45 it's just a hardcoded table of keyboard scancodes 20:25:50 which was determined by experiment 20:25:54 because SDL asks for them 20:25:59 so I need to know 20:26:01 ais523\unfoog, wait, you mean this won't work on anything but the US keyboard layout? 20:26:07 or UK rather 20:26:28 Vorpal: I don't know, I don't understand the numbers 20:26:35 but the keyboard isn't connected to the program under test anyway 20:26:40 weboflies has a command line 20:26:40 ais523\unfoog, well, link ktt.c please :) 20:27:04 http://sprunge.us/XJKU 20:27:28 ais523\unfoog, you know, this would be really useful for automated test benches for that nethack bot too 20:28:03 nethack-tas-tools would be good enough for that, I think 20:28:22 this isn't /really/ about NetHack, as I can TAS that anyway 20:28:33 ais523\unfoog: doesn't build on x86-64 20:28:38 elliott: missing headers? 20:28:39 right 20:28:44 elliott, -m32 20:28:46 it works 20:28:53 ais523\unfoog: no: 20:28:55 elliott, at least on ubuntu 20:28:56 weboflies.c:1910:70: error: ‘struct user_regs_struct’ has no member named ‘ebx’ 20:28:56 weboflies.c:1913:70: error: ‘struct user_regs_struct’ has no member named ‘ebx’ 20:28:56 weboflies.c:1928:21: error: ‘struct user_regs_struct’ has no member named ‘ecx’ 20:28:56 weboflies.c:1931:22: error: ‘struct user_regs_struct’ has no member named ‘esi’ 20:28:56 weboflies.c:1932:44: error: ‘struct user_regs_struct’ has no member named ‘esi’ 20:28:56 weboflies.c:1934:22: error: ‘struct user_regs_struct’ has no member named ‘orig_eax’ 20:28:58 weboflies.c:1940:22: error: ‘struct user_regs_struct’ has no member named ‘esi’ 20:29:00 weboflies.c:1944:70: error: ‘struct user_regs_struct’ has no member named ‘esi’ 20:29:02 weboflies.c:1950:20: error: ‘struct user_regs_struct’ has no member named ‘esi’ 20:29:04 weboflies.c:1978:16: error: ‘struct user_regs_struct’ has no member named ‘orig_eax’ 20:29:06 elliott: yep, missing headers, or rather the wrong header 20:29:06 weboflies.c:2002:20: error: ‘struct user_regs_struct’ has no member named ‘orig_eax’ 20:29:07 elliott, works with -m32 on my ubuntu laptop 20:29:08 [...] 20:29:10 oops 20:29:12 more than i intended 20:29:14 but anyway, no missing header errors 20:29:15 it's clearly looking at the 64-bit version of user.h 20:29:16 right 20:29:18 you said it would work on 64-bit though :) 20:29:29 it would if it had the correct headers 20:29:37 ais523\unfoog: is this png stuff really necessary? 20:29:52 what is the png stuff for? 20:30:06 that's the graphics card emulation 20:30:14 or rather, it emulates a framebuffer 20:30:19 and produces screenshots of it on request 20:30:38 if (mount("tmpfs", "/tmp", "tmpfs", 0, 0)) { 20:30:39 what 20:30:44 is that before or after chroot? 20:30:54 before, obviously 20:30:57 you missed the clone call 20:31:02 hm 20:31:03 ais523\unfoog: do you accept patches that turn it into something useful for more than just TASing a game on ais523's computer? :p 20:31:11 CLONE_NEWNS|CLONE_NEWPID|CLONE_NEWUTS 20:31:13 ais523\unfoog, so you replace the system /tmp, possibly breaking lots of stuff? 20:31:19 Vorpal: no 20:31:24 ais523\unfoog, then how? 20:31:24 see that CLONE_NEWNS? 20:31:26 look up what it does 20:31:45 (hint: it affects the meaning of the mount syscall) 20:31:48 wow, this reminds me of plan9 20:31:56 it's like plan 9 but stupid 20:32:19 heh 20:32:25 but basically, it changes /tmp for one process 20:32:40 this is how weboflies has genuinely caused filesystem leaks in the past 20:33:00 unfortunately, it turns out that the emulated filesystem is slightly visible from the outside; you can access it via /proc 20:33:05 as root 20:33:21 ais523\unfoog, uh... wait, wouldn't they be unmounted if no longer mounted by any process? 20:33:38 Vorpal: yes, indeed 20:33:48 but weboflies' processes are often quite hard to get rid of 20:33:53 I've seen instances where kill -9 failed 20:34:10 because init (the real init, AFAICT) was catching the SIGKILL 20:34:12 -!- boily has quit (Ping timeout: 260 seconds). 20:34:13 ais523\unfoog, D state? 20:34:21 huh 20:34:22 no, T (ptrace) state 20:34:33 ais523\unfoog, how did you manage init to catch the SIGKILL for you? 20:34:40 I have no idea, I guess a kernel bug 20:34:43 heh 20:34:46 investigation showed that init was currently ptracing the process in question, though 20:34:59 init doesn't do that.... 20:35:02 indeed 20:35:09 that's why the process had stuck 20:35:12 heh 20:35:15 because init didn't tell it to just continue with the sigkill 20:35:23 ais523\unfoog, did you manage to reproduce it? 20:35:26 no 20:35:29 oh well 20:35:41 I /did/ manage to reproduce the bug where a process had two stack segments simultaneously 20:35:50 but haven't submitted a bug as the situation is reasonably insane 20:36:01 -!- pumpkin has joined. 20:36:09 -!- pumpkin has quit (Changing host). 20:36:09 -!- pumpkin has joined. 20:36:11 well, how does that happen. Isn't there a single segment selector? 20:36:41 it's a bug? 20:36:50 you did cat /proc/pid/maps 20:36:54 and you got two stack segments reported 20:36:56 ah 20:36:58 which overlapped, but were different sizes 20:37:01 heh 20:37:42 conclusion: Linux doesn't like it when you mmap the stack guard page with MAP_FIXED 20:38:07 right 20:38:08 the bug occurred after doing it exactly twice, IIRC 20:38:09 -!- copumpkin has quit (Ping timeout: 260 seconds). 20:38:14 * Phantom_Hoover humble bundles. 20:38:14 heh 20:38:17 (it shrinks the stack to make room for a new guard page in response) 20:39:34 -!- pumpkin has changed nick to copumpkin. 20:39:35 ais523\unfoog, btw why did you want to keep it secret, before you said that the reason for being secret was also a secret 20:39:43 (or something to that effect) 20:40:33 ais523\unfoog, oh and there are some debian specific things in there. 20:40:47 ais523\unfoog, the whole /lib/i686/cmov thing and so on 20:41:08 (never mind that it is lib32 for me on ubuntu, and just /lib32 on arch) 20:41:29 Vorpal: that's temporary to get it running 20:41:30 ais523\unfoog doesn';t use debian 20:41:36 so i doubt it 20:41:38 elliott, ubuntu iirc? 20:41:41 it'll use its own ideas of the libraries eventually 20:41:42 which is debian based 20:41:44 yes, I use Ubuntu 20:41:53 elliott, so same thing when it comes to this 20:41:58 you said it was different on ubuntu 20:42:03 very next line 20:42:11 elliott, because I'm on 64-bit yet 20:42:12 yes* 20:43:04 elliott, you might need to change around line 488-499 if you want to get it running on a x86-64 distro, so it searches /lib32 and /usr/lib32 instead 20:43:17 I haven't tried, I'm kind of scared of running it 20:43:48 ais523\unfoog, how do you deal with CPUID? 20:44:03 can't find anything on that 20:44:07 I don't, yet 20:44:12 right 20:44:23 do you have any plans for how to deal with it? 20:44:31 not yet 20:44:40 ais523\unfoog, anyway: why was it secret before? 20:45:12 i suspect he's doing a secret tas of a game 20:45:25 hm 20:45:46 elliott, could be, not sure what game apart from nethack ais523 would play though... 20:45:55 seriously? 20:46:03 eh, probably just tired 20:46:07 which one did I miss 20:46:08 he's talked about many games in here 20:46:24 none that stood out really 20:46:30 including e.g. the humble bundle 3 ones 20:46:31 and that was for linux 20:46:33 oh okay 20:46:49 ais523\unfoog, did you get the current humble bundle btw? 20:46:53 no 20:47:07 ais523\unfoog, and you are avoiding answering the question about why it was secret :P 20:47:09 Vorpal: enigma, for one 20:47:11 I paid £5 for bundle 3, and that's about what it was worth 20:47:14 elliott, oh yes, true 20:47:25 Vorpal: oh, because I have plans to submit a run on a secret emulator 20:47:32 ais523\unfoog, ah okay 20:47:38 and if the emulator isn't secret, I'll have to write another one which is 20:47:44 heh? 20:47:46 weird 20:47:51 to be able to submit a run on a secret emulator 20:48:27 oh no... is this the kind of "highlight yourself about wiki spam" madness? 20:48:52 ais523\unfoog, anyway I presume you didn't develop the emulator in question? 20:49:09 elliott: can you trap Vorpal in a recursive facepalm for me please? 20:49:11 because then you could just have added the code to support doing a TAS right into it 20:49:21 hey 20:49:49 ais523\unfoog, oh you mean SP is the secret emulator. Right. We will keep quiet about it. 20:50:16 how was that not obvious? 20:50:22 I didn't think of it as a emulator really. Really not an emulator in the same sense that wine isn't to my mind. 20:50:26 ais523\unfoog: because vorpal is dumb 20:50:26 actually, before I make a TAS I want to see what games are supported 20:50:44 So the Secret Project is an emulator? 20:50:48 Vorpal: it isn't an emulator, but it has all the required requirements to be a TAS emulator apart from being an emulator 20:51:03 Phantom_Hoover, read the log, I figured out what it was and confronted ais523\unfoog with it 20:51:09 Phantom_Hoover: we've known what it was for ages 20:51:17 just not what ais523\unfoog wanted it for 20:51:27 yeah 20:51:40 I found that out. So yeah 20:51:48 should have done it in /msg to annoy elliott a bit though 20:51:51 oh well 20:52:39 childish as always :) 20:53:02 elliott, I would have told you after a few minutes anyway :P 20:53:41 ais523\unfoog, well yeah 20:53:43 hmm, have either of you dared to run it yet? 20:53:50 I know /I/'m a bit queasy about running it 20:53:55 so I wouldn't be surprised if you hadn't 20:54:06 not yet, busy 20:54:08 ais523\unfoog, not me. I looked at the code and.... well I would need to find a suitable system that I didn't mind if it exploded 20:54:10 will soon 20:54:12 none come to mind 20:54:17 after ripping out libpng 20:54:20 Vorpal: vm 20:54:26 elliott, why rip out libpng 20:54:27 elliott: without libpng you can't see what's happening at all 20:54:35 elliott, oh come on, this is like inception then 20:54:37 or something 20:54:38 as it's the only way to get at the contents of the graphics buffer, currently 20:54:56 I think making the framebuffer a regular file was inspired 20:55:04 ais523\unfoog, what about terminal only programs? 20:55:10 (hmm, I wonder if I could put a PNG header/footer around it, and not even have to transmit the bytes in it) 20:55:26 Vorpal: those work without the PNG stuff, if you're happy with processing the VT100 codes yourself 20:55:33 although atm simulated vblank happens anyway 20:55:41 heh 20:55:42 regardless of whether it does anything useful or not 20:56:05 ais523\unfoog, so you render nethack to a png? 20:56:20 which terminal font do you use then 20:56:24 not NetHack, unless I use tiles version 20:56:30 that just outputs VT100 20:56:52 right 20:56:55 the weboflies core, which I'm writing at the moment, would need to be connected to some sort of interface to actually read it 20:58:03 hm 20:58:15 ais523\unfoog, the core being what part of it? 20:58:22 the whole emulator? 20:58:26 or whatever you call it 20:58:33 what the part that's been written will be when it's finished 20:58:42 I'm planning on a sort of gdb/ddd-like setup 20:58:58 where you have a command-line core, and a GUI that communicates with it 20:59:04 ah 20:59:08 makes sense 21:00:28 ais523\unfoog, so what is the point of doing a TAS with a secret emulator. I don't quite get it. Some sort of bragging rights? But I don't quite see how that would work 21:01:06 Vorpal: because it's always hilarious when people submit runs on emulators that people don't realise the submission system supports 21:01:18 submitting a run on an emulator that people don't even know exists is the obvious next step up 21:01:23 heh 21:02:04 ais523\unfoog, well, wouldn't the submission system support pretty much any emulator that could output some sort of format that could be handled by the submission system? 21:02:22 $ pacman -Qo /lib/libmemusage.so 21:02:22 /lib/libmemusage.so is owned by glibc 2.14.1-1 21:02:26 huh, what? 21:02:30 what is that for I wonder 21:02:40 Vorpal: it links to glibc malloc hooks, I think 21:02:45 so it's not surprising that they're in the same package 21:02:57 oh is it some debugging tool? 21:03:02 for LD_PRELOAD 21:03:04 or such 21:03:05 probably 21:03:24 -!- oerjan has quit (Quit: Good night). 21:03:30 but yeah it exports mmap, calloc and so on 21:03:40 so probably something that is meant to be LD_PRELOADed 21:08:11 Voxatron is a bit too easy. 21:08:16 Erm, *hard. 21:12:51 It wouldn't be so bad if the controls weren't clumsy. 21:13:33 Phantom_Hoover, I agree 21:14:00 Phantom_Hoover, blocks that matter is fun and reasonably hard though. Though the plot feels a bit... meh 21:14:14 not that the plot really matters much in a game like that 21:17:10 -!- nask has joined. 21:17:14 hi nask 21:17:16 `? welcom 21:17:17 `? welcome 21:17:17 welcom? ¯\(°_o)/¯ 21:17:18 Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page 21:17:37 hi elliott 21:17:51 ais523\unfoog, hm, you bind mount /lib and such, but not /usr/share? 21:17:55 ais523\unfoog: grr, i need 32-bit libgcc too 21:18:07 Vorpal: that's temporary; eventually, none of that will be bind-mounted 21:18:16 /* Timestamps. This stores the initial timestamp, in Web of Lies' 21:18:16 internal format: a 64-bit number giving nanoseconds since the 21:18:16 epoch (i.e. date +%s%N format). The value given here is 21:18:16 1 September 1993, the start of the Eternal September. */ 21:18:17 heh. 21:18:20 elliott, that is the one major downside of arch... multilib failure 21:18:36 Vorpal: have I mentioned Kitten gets multilib for free??? 21:18:43 elliott, yes 21:18:47 elliott, and so does nixos 21:19:07 i'm not sure it actually works with nixos 21:19:17 oh? 21:19:41 you can't have bin/foo and bin/foo 21:19:45 there's no segregation in the profile 21:19:52 i guess libraries are more common than executables, but still 21:20:04 and i don't know if they do automatic cross-compilation stuff at all 21:20:45 not much point of having multilib executables. Compilers that can't be built as cross-compilers maybe? 21:21:22 there's no such thing as "multilib executables" 21:21:26 just executables of a different arch 21:21:33 think qemu-system 21:21:59 it's just that the magic prefix for executing a x86 executable on x86-64 happens to be the null string 21:22:05 elliott, yeah what I meant was "there is not much point in having more than one version of a given program installed at the same time" 21:22:23 elliott, you don't need both 32-bit and 64-bit ls 21:22:29 that is what I'm trying to say 21:22:54 well, I could think of uses. but yes, I believe nixos cheats by not having /lib 21:23:09 hm 21:23:25 ais523\unfoog: btw, I'm unconvinced qemu wouldn't work for your tas needs... 21:23:33 ais523\unfoog: you just need a slightly faster system :P 21:23:46 it works for NetHack 21:23:51 elliott, okay I can think of one case, valgrind, but that is covered already for valgrind (except arch breaks that) 21:23:57 but it doesn't do stable enough input determinising 21:24:27 ais523\unfoog: you could layer that on top 21:24:34 by feeding input events through a wrapper 21:26:25 ais523\unfoog: anyway, I think for Kitten I'll just steal the calls to turn things off 21:26:33 like the clock thing Vorpal mentioned 21:26:51 I suppose it's mostly complete enough for Kitten 21:26:53 and then do with a chroot + clock fixed at @0 + fixed hostname 21:26:55 even if it isn't for its intended purpose 21:27:06 ais523\unfoog: well, like I said I'll probably just take parts of it 21:27:10 elliott, clock fixed at @0 will break stuff, trust me 21:27:12 note that /all/ SDL programs get stuck in an infinite loop with a stuck clock 21:27:22 ais523\unfoog: since I want something portable, and I don't care about the scheduler 21:27:23 as their main loop is basically gettimeofday and nanosleep 21:27:28 (and want -j to work) 21:27:30 and heh 21:27:36 Vorpal: it won't break a C compiler 21:27:40 elliott, you know that uname -a will end up fucked btw 21:27:44 a C compiler shouldn't even require a clock 21:27:50 and why? 21:28:01 disabling any syscall requires hooking the registers directly (orig_eax in the case of x86) 21:28:04 elliott, your kernel, it was compiled in 1970 21:28:09 elliott, oh and make, timestamps 21:28:16 right, a nonworking clock /would/ break make 21:28:20 elliott, if you don't backdate the timestamps on files make will go crazy 21:28:20 Vorpal: I don't have to say the kernel was compiled in 1970... 21:28:27 and yes, I will backdate the timestamps 21:28:30 although, the secret project breaks make atm anyway 21:28:36 unless there are explicit sleeps in the build process 21:28:43 maybe I should make all syscalls cost 1ns 21:28:43 doesn't matter if make won't handle updates 21:28:48 since it'll be run from scratch 21:29:57 elliott, I doubt much user space code uses RDTSC. It isn't useful given multi-core and changing clock frequency (except some modern CPUs compensate for that one, like core 2 or newer iirc)... 21:30:07 I used it once, on an embedded x86 system 21:30:09 I suspect uname -a to look something like: Linux kitten 3.0 #1 x86_64 unknown unknown GNU/Linux 21:30:12 s/to/will/ 21:30:26 the version is just a string, so making it #1 should be fine 21:30:29 nothing should try and /parse/ that 21:30:44 elliott, don't be so sure of that heh 21:30:53 Vorpal: I'd rather patch anything that tries to parse it 21:31:02 elliott, binary packages ? 21:31:11 Vorpal: those won't run inside the build jail... 21:31:18 hm true 21:31:22 elliott, their installers might? 21:31:23 Vorpal: unless you mean a binary package with, like, a closed-source install script 21:31:31 but, like... fuck that 21:31:35 right 21:31:38 I'd either LD_PRELOAD in a fake uname just for it 21:31:43 or just tell everybody not to use it :) 21:32:01 oh, wow 21:32:06 ? 21:32:11 I think GNU coreutils adds the "GNU/Linux" bit to uname 21:32:16 the uname syscall doesn't have a field for that 21:32:23 ... lol 21:32:27 so the gnu people must have added the --operating-system field just so they could get GNU in there 21:33:09 does anyone know /how/ to override uname without doing ais523\unfoog's crazy stuff? 21:33:24 I mean, the kernel can't just return a string constant, can it :p 21:33:25 elliott: actually, my uname override is mostly sane 21:33:29 elliott, setarch does it 21:33:32 to some degree 21:33:40 Vorpal: it does exactly one field of it 21:33:45 wait, no it isn't 21:33:47 elliott, I think personality stuff is related 21:33:49 not sure 21:33:50 oh, hmm 21:33:51 --uname-2.6 21:33:51 Causes the program to see a kernel version number beginning with 21:33:51 2.6. 21:33:55 nice :) 21:34:08 elliott, I think parts of these things are special cased, not general solutions 21:34:11 I suspect setarch does it the same way as me, anyway 21:34:11 ais523\unfoog: how's it done? 21:34:29 wow, man 2 personality is totally unhelpful 21:34:29 elliott, the one you pasted does 2.6.40 + the .x component in 3.x iirc 21:34:33 elliott: debugger hooks, like everything else; if the process calls uname, it lets the call happen, then overwrites its return value in the process's memory 21:34:41 ais523\unfoog: :( 21:34:51 ais523\unfoog, I don't think setarch does all that 21:35:12 I doubt anything in util-linux-ng does that 21:35:16 elliott: that's how it handles pretty much every syscall that can't be translated directly, except that sometimes it translates the arguments not returns, and sometimes it doesn't make a syscall at all (it does, but with an invalid syscall number then it changes the ENOSYS) 21:35:17 they have common decency, I would expect 21:35:22 well, they use a lot of glibc-only apis 21:35:22 ais523\unfoog, it doesn't even use ptrace says nm -D 21:35:23 but apart from that 21:35:28 ais523\unfoog: heh 21:35:47 http://sprunge.us/dMVA 21:36:07 there is NO way that can invoke ptrace, I refuse to believe it would avoid going through libc for it 21:36:19 https://raw.github.com/gist/701791/4c6ebe0ee052575d49464b6f5d56730d5f48a471/setarch.c 21:36:20 Vorpal: sure there is, see "syscall" in that list? 21:36:27 found by googling 21:36:28 hm true 21:36:30 ouch 21:36:36 ah, it's being used for personality, though 21:36:36 #define set_pers(pers) syscall(SYS_personality, pers) 21:36:36 ais523\unfoog, but for ptrace? nah 21:36:39 Vorpal: ^ 21:36:44 right 21:36:50 so wait, where are the personalities /defined/? 21:36:52 -_- 21:36:52 linux/personality.h? 21:36:54 where do i get a list ofthem 21:36:57 s/ofthem/of them/ 21:37:02 kernel sources? 21:37:09 Vorpal: actually, this setarch isn't the one I have 21:37:11 it has fewer options 21:37:19 elliott, maybe a different version? 21:37:22 try aur 21:37:24 err 21:37:24 abs 21:37:31 https://github.com/karelzak/util-linux/blob/master/sys-utils/setarch.c 21:37:34 there 21:37:39 that's the official util-linux-ng source 21:37:40 elliott: quite a lot of the Secret Project is based on header files, or failing that kernel source 21:37:49 and failing even /that/, a bunch of experimentation with strace 21:38:08 ais523\unfoog: you know, I don't like people who say this, but you have way too much time on your hands 21:38:11 ais523\unfoog, which kernel versions have you tested it on? 21:38:21 I mean that quite literally; ask someone to give you more work so you don't have time for this crap 21:38:31 elliott: I /don't/ have time for that atm 21:38:34 -!- derdon has joined. 21:38:35 that's why I haven't been working on it 21:38:44 heh 21:38:48 keep it up!! 21:38:55 I think it is awesome 21:39:49 oh god 21:39:53 ? 21:39:55 Vorpal: don't look at /usr/include/linux/personality.h 21:39:59 why not 21:40:03 don't 21:40:25 elliott, mine looks quite okay, just a lot of bitmasks as is usually done in these sort of headers 21:40:26 http://esolangs.org/wiki/JumpFuck 21:40:30 heh, I love the way that one of the flags I use is marked as "bug emulatino" 21:40:33 "bug emulation" 21:40:34 Vorpal: :'( 21:40:45 elliott, GIVE ME ONE GOOD REASON NOT TO THROW AN ICBB AT HEXHAM THIS MINUTE 21:40:47 elliott, what did you expect 21:40:54 ais523\unfoog: Sounds like Drepperish newspeak. 21:40:57 Phantom_Hoover: Hey, that was for a /purpose/. 21:41:05 Namely? 21:41:18 Phantom_Hoover: I forget. 21:41:26 ais523\unfoog, I think that support for turning of ASLR might be an option in the kernel. At least I saw something related. 21:41:27 elliott: it isn't a glibc header, though, is it? 21:41:33 elliott, NOT GOOD ENOUGH 21:41:36 ais523\unfoog, btw did you use cgroups? I don't remember 21:41:42 what's cgroups? 21:41:42 ais523\unfoog: How should I know? :) 21:41:48 never mind then 21:41:53 elliott: it's in .../linux 21:42:06 ais523\unfoog: you never mentioned any header 21:42:40 ais523\unfoog, it's an implementation of group theory in C, duh. 21:43:23 ais523\unfoog: I'm talking about personality.h, which you mentioned 21:43:42 oh, I see the bug emulation comment now; and stop talking to yourself 21:43:59 err, elliott: 21:46:44 ais523\unfoog: anyway, yeah, the Secret Project is cool but I only need about 5% of it, so I'll just take that 5% :P 21:47:14 I might want to ask you to license me the calls I use under something more lenient if I can convince you making me GPL3 the entirety of my package manager for ten lines is unreasonable :P 21:48:15 case SYS_sigreturn: 21:48:15 case -1: /* return half of a sigreturn */ 21:48:18 ais523\unfoog, what? 21:48:39 When the Linux kernel creates the stack frame for a signal handler, a call to sigreturn() is inserted into 21:48:39 the stack frame so that upon return from the signal handler, sigreturn() will be called. 21:48:42 oh my god 21:48:46 that is one ugly solution 21:48:47 beautiful 21:48:56 `addquote oh my god that is one ugly solution beautiful 21:48:58 705) oh my god that is one ugly solution beautiful 21:49:09 and the syscall number ends up as -1 on the return half, for whatever reason 21:49:26 anyway, I doubt make breaks with the clock set to 0 21:49:37 elliott, do you even know how make works 21:49:46 Vorpal: yes, but you're using a stupid definition of "break" 21:49:47 elliott, object files must be newer than source files 21:49:59 I unpack all the source with *time=0 on every file 21:50:03 the clock is fixed at 0 21:50:04 I run make 21:50:05 elliott, it is impossible to have a date before t=0 21:50:13 Vorpal: t=-1? 21:50:14 thus you get the "equals" case 21:50:17 (time_t is signed?) 21:50:20 ais523\unfoog, oh right, it is signed 21:50:21 true 21:50:24 -!- nask has quit (Quit: begone). 21:50:27 Vorpal: let me get this straight: you think make will create the files, check their mtime, and then retroactively fail to build them? 21:50:28 does it work properly for negative values 21:50:47 elliott, no but I think there are many cases where the build system will end up checking the same file twice 21:51:04 because of automess and so on 21:51:11 elliott: a case like "check if the file is newer than its source, if not rebuild it" could easily lead to a loop 21:51:20 Vorpal: I could get make to print all the commands it /would/ execute, then execute them all myself :) 21:51:23 actually, IIRC configure errors on timestamps making no sense 21:51:43 sensible of it 21:51:46 sigh; if I can't fix the clock at 0, I'll have to use the Secret Project 21:52:00 why the fuck do timestamps end up in object files, anyway? 21:52:09 elliott, only really for the kernel 21:52:22 don't remember that happening elsewhere 21:52:31 the nix guys say it's their #1 cause of impurity 21:52:52 well, the other ones must be even more uncommon 21:52:53 elliott: quite a lot of files have a "last build" date sohwn 21:52:55 *shown 21:53:03 Vorpal: no, it's very common 21:53:06 e.g. you can press some key in NetHack (probably v) to see the date at which it was compiled 21:53:47 elliott, hm 21:54:58 elliott: wouldn't it be more plausible to set the timestamps to values increasing in the order that the files are actually created (complete with scheduler determinism), starting on the date that that version of the software was released? 21:55:13 ais523\unfoog: I'm trying to /avoid/ having to rip out the entire scheduler 21:55:15 -j3 would be nice... 21:55:28 elliott, not -j8? 21:55:29 (portability is also nice) 21:56:34 elliott: actually, the scheduling stuff in Secret Project would be portable, if only it knew which syscalls were blocking and which were nonblocking 21:56:43 inspecting orig_eax is the only nonportable bit 21:56:55 ais523\unfoog: so, it's portable except not being portable 21:57:00 s/except/except for/ 21:57:01 oh, and injecting calls to fcntl in cases like read which might be blocking and might be nonblocking depending on what it's reading from 21:57:28 ais523\unfoog, and various other 32-bit x86 assumptions in the init code and so on 21:57:36 sure, not in the scheduler 21:57:53 -!- Patashu has joined. 21:58:40 elliott, anyway it is pure with real timestmaps, the current time is part of the input you see 21:58:48 just change the system clock to reproduce it 21:58:49 ;) 21:59:09 Vorpal: that's bullshit even if you're stupid enough to believe that 21:59:13 repeat after me: scheduler nondeterminism 21:59:18 elliott, ... I was joking 21:59:41 it wasn't (a) interesting (b) funny or (c) accurate in any sense 21:59:59 elliott, what about using a counter and incrementing for each file touched, in the current process? 22:00:11 hm nah 22:00:15 that runs into other issuesx 22:00:18 issues* 22:01:10 elliott, oh btw I can imagine nondeterminism might be introduced by order of iterating through files. What order does readdir return entries in? 22:01:22 is that even well defined? 22:01:54 i doubt it'll depend on an rng or the clock or anything. 22:02:34 elliott, no but probably on the inode, which file system is used, where in the btree the inodes ended up and so on 22:03:11 does anyone actually copy out readdir results without sorting 22:03:21 if it's just a mapM_ doSomething dirContents then it doesn't matter 22:03:26 since doSomething is probably not order-dependent. 22:03:32 elliott, why would find for example need to do it 22:03:35 it doesn't need to sort 22:03:41 it just needs to check if it matches or not 22:03:46 and/or recurse 22:03:49 [elliott@dinky weboflies]$ find . 22:03:49 . 22:03:49 ./build.sh 22:03:49 ./ktt.c 22:03:49 ./weboflies.c 22:03:53 coincidence? you decide 22:03:58 find ~ is also sorted 22:04:04 eh 22:04:09 $ find . 22:04:09 . 22:04:09 ./weboflies.c 22:04:09 ./ktt.c 22:04:09 ./build.sh 22:04:10 ./weboflies 22:04:11 mpt sprted 22:04:13 not* 22:04:20 sprted 22:04:23 sorted* 22:04:28 elliott, maybe it depends on fs then 22:04:31 which one are you using 22:04:34 elliott, ext4 here 22:04:37 jfs 22:04:40 well then 22:04:51 elliott, you see, it isn't deterministic across file systems 22:04:52 anyway, what kind of build process does find . >foo 22:05:03 Vorpal: pedantic complaints about determinism should be directed at ais523\unfoog 22:05:08 he's the one trying to do that 22:05:41 elliott: did you see sort_dents? 22:05:46 elliott, well a build system might enumerate files in a directory if you do a wild card on sources, as might be done in cmake. 22:05:48 ais523\unfoog, haha 22:05:58 Vorpal: so? 22:06:03 build rules should be independent of one another 22:06:08 directories get sorted into alphabetical order before returning them 22:06:10 any build that depends on ordering is broken 22:06:12 elliott, should. 22:06:14 and won't work with -j 22:06:25 elliott, I meant for an incrementing timestamp 22:06:27 Vorpal: what you're saying is, "I bet people use build rules that only work if you use the right filesystem" 22:06:29 elliott, there it would matter 22:06:47 ais523\unfoog: Nix does something similar, incidentally 22:06:49 ais523\unfoog: at package-creation time 22:06:55 it has its own archiving format 22:06:58 elliott, anyway something that *might* work: unpack files and date them 0. Then use a later date for actually running at 22:07:03 I'm not entirely sure what happens if a process asks for half a directory 22:07:20 Vorpal: I could run it at @1, I suppose, even if that's ugly 22:07:27 I think it might fail if the buffer given isn't large enough to hold the whole directory 22:07:27 can you unpack files as @-1? :) 22:07:31 as it'll get an arbitrary part of it 22:07:37 elliott, I don't think that is going to be reliable 22:07:55 quick, how do I set an mtime? 22:07:58 elliott: @1? 22:08:07 elliott: touch -m 22:08:20 ais523\unfoog: http://www.gnu.org/s/automake/manual/tar/Date-input-formats.html 22:08:30 it also changes the ctime, though, because you can't change a file's timestamps without changing the ctime 22:08:37 elliott: ah, right; epoch + 1 22:08:37 elliott, anyway, you have a lot of syscall stuff to do for 64-bit. some syscalls differ substantially in number and order of arguments, and even if they exist or not 22:08:48 + 1 second, that is 22:08:51 [elliott@dinky ~]$ touch -m @-1 foo 22:08:51 [elliott@dinky ~]$ ls -lh foo 22:08:51 -rw-r--r-- 1 elliott users 0 Nov 3 22:08 foo 22:08:52 :( 22:08:59 [elliott@dinky ~]$ touch -m @0 foo 22:08:59 [elliott@dinky ~]$ ls -lh foo 22:08:59 -rw-r--r-- 1 elliott users 0 Nov 3 22:08 foo 22:08:59 err... 22:09:07 elliott, anyway, you have a lot of syscall stuff to do for 64-bit. some syscalls differ substantially in number and order of arguments, and even if they exist or not 22:09:13 elliott: same minute, as they differ by a second? 22:09:16 Vorpal: you're deliberately trying to annoy me by pretending I'm ais523\unfoog, right? 22:09:26 ais523\unfoog: I'm trying to set the absolute timestamp 22:09:33 Vorpal: this is why I'm focusing on x86 first 22:09:34 elliott, no, you are the one interested in this on 64-bit? 22:09:45 ais523\unfoog, hm 22:09:51 Vorpal: elliott isn't interested in doing the syscall manipulation, even though that's the whole /point/ 22:10:07 he needs to if he wants the time to work as advertised 22:10:11 ais523\unfoog: stop acting offended like I'm misunderstanding some magic point of the secret project :) 22:10:20 some parts of it are helpful, some aren't 22:10:25 well, OK 22:10:34 I'm just trying to figure out which part you think is helpful 22:10:42 given that you don't want the scheduler, or the syscall rewrite 22:10:47 ais523\unfoog, btw I think you might possibly run into issues with gettimeofday on 64-bit linux. IIRC that doesn't actually go to kernel there, but just reads a page with a timer mapped into the process by the kernel 22:10:53 I'm surprised this isn't done on 32-bit 22:11:08 ais523\unfoog, it is in the vdso iirc 22:11:11 ais523\unfoog: disabling some nasty easy sources of nondeterminism, and overriding the clock/uname/some other things 22:11:15 Vorpal: ouch 22:11:30 the clock/uname overrides are processor-specific 22:11:43 I think clock_whatever is done the same way btw 22:11:53 * ais523\unfoog wonders why touch has a -f flag that's documented to do nothing 22:12:08 compat 22:12:09 hm it isn't even in 1p 22:12:14 so not POSIX compat 22:12:29 ais523\unfoog: sigh, what made you think touch -m let me specify a timestamp? 22:12:37 I have two files called @0 and @-1 now 22:12:49 elliott: oh, -d specifies the timestamp; -m tells it to change just the modificatoin time 22:12:56 thx :p 22:13:07 ais523\unfoog, http://sprunge.us/SBHU 22:13:13 you didn't quite ask the right question 22:13:22 ais523\unfoog, that is how it is done. glibc call those 22:13:32 or they are weak symbols in there, not sure which 22:13:35 Vorpal: hmm, and I can't unmap just part of the vdso 22:13:36 [elliott@dinky ~]$ touch -d @-1 foo 22:13:36 [elliott@dinky ~]$ ls -lh foo 22:13:37 -rw-r--r-- 1 elliott users 0 Jan 1 1970 foo 22:13:41 I bet it's special-casing that 22:13:46 as in 22:13:48 ignoring negative values 22:13:56 [elliott@dinky ~]$ touch -d @-9999 foo 22:13:56 [elliott@dinky ~]$ ls -lh foo 22:13:56 -rw-r--r-- 1 elliott users 0 Dec 31 1969 foo 22:13:58 ais523\unfoog: wow 22:14:06 heh 22:14:18 that is just absurd 22:14:26 elliott: something to do with timezones, perhaps? 22:14:31 yes, obviously 22:14:33 [elliott@dinky ~]$ touch -d @-9223372036854775808 foo 22:14:33 [elliott@dinky ~]$ ls -lh foo 22:14:33 -rw-r--r-- 1 elliott users 0 -9223372036854775808 foo 22:14:36 YESSSSS 22:14:38 what 22:14:40 UNPACKED AT THE BEGINNING OF TIME 22:14:43 heh 22:14:50 elliott, what date is that technically? 22:14:55 why is ls outputing the timestamp like that? 22:14:55 [elliott@dinky ~]$ touch -d @-9223372036854775 foo 22:14:55 [elliott@dinky ~]$ ls -lh foo 22:14:55 -rw-r--r-- 1 elliott users 0 May 16 -292275055 foo 22:15:06 ais523\unfoog: I must have confused it :) 22:15:08 elliott: quick, get a date in year 0 22:15:15 I, errr, help? 22:15:30 [elliott@dinky ~]$ date -d"Jan 1 0" +%s 22:15:30 1293840000 22:15:35 that, er, seems wrong 22:15:36 ais523@desert:~/taeb/TAEB$ sdate ls -l 22:15:37 total 123212 22:15:38 drwxr-xr-x 2 ais523 ais523 4096 1993-09-6547 18:24 bin 22:15:40 ah, 0000 does it 22:15:51 wait was there a year zero IN REAL LIFE? 22:15:53 [elliott@dinky ~]$ touch -d @-62167219125 foo 22:15:53 [elliott@dinky ~]$ ls -lh foo 22:15:53 -rw-r--r-- 1 elliott users 0 Jan 1 0000 foo 22:15:54 I don't think there was 22:15:55 ais523\unfoog: tada 22:15:55 CakeProphet: no 22:15:59 elliott: yay 22:16:01 I think it went 1 BCE -> 1 CE 22:16:08 ais523\unfoog, x86-64 has another even stranger thing than the vdso, called vsyscall 22:16:08 none of that zero shit. 22:16:12 in other news, why did I never think of doing sdate ls before now? 22:16:13 ais523\unfoog: year 0 is 1 BC, I think 22:16:18 ais523\unfoog: since it's just using negative numebrs 22:16:24 ais523\unfoog, that is not even a full dynamic object, just a weird page 22:16:30 7fff8b1ff000-7fff8b200000 r-xp 00000000 00:00 0 [vdso] 22:16:30 ffffffffff600000-ffffffffff601000 r-xp 00000000 00:00 0 [vsyscall] 22:16:36 that is used for some stuff 22:16:45 that's a lot of fs 22:17:02 ais523\unfoog, it is in the kernel half of the address space (the negative half) 22:17:09 *the top half 22:17:17 you can't insist to me that addresses are signed, I won't believe you 22:17:29 ais523\unfoog, well, the ISA manuals claims they are signed 22:18:18 but they're addresses, not numbers 22:19:04 yeah I live at -4224 Hood Rd. Anywhere, USA 22:19:18 ais523\unfoog, anyway vsyscall contains gettimeofday, time, getcpu and possibly set_cpu, I'm not quite sure, it is confusing 22:19:24 and iirc the mechanism predates vdso 22:19:26 Vorpal: so, wait, how do I fix the clock on x86-64? 22:19:30 and is deprecated, but can't be removed 22:19:31 remap that area of ram? 22:19:38 Vorpal: I guess vdso and vsyscall will have to be made unreadable 22:19:40 elliott, I'm not sure the kernel will allow that 22:19:43 and the sigsegvs caught 22:19:51 Vorpal: what am I meant to do, then? 22:19:56 * elliott considers asking #linux 22:20:00 elliott, Why do you think I will know 22:20:04 and good luck with THAT 22:20:07 :) 22:20:33 * elliott considers trolling them with it 22:20:37 -!- copumpkin has quit (Quit: Computer has gone to sleep.). 22:20:40 ais523\unfoog, doesn't 32-bit linux have vdso? 22:20:46 there's a reason I ask secret project questions here 22:20:51 Vorpal: yes, but so far I haven't caught anything using it 22:21:02 nm -D vdso32-syscall.so 22:21:02 00000000 A LINUX_2.5 22:21:02 00000410 T __kernel_rt_sigreturn 22:21:02 00000400 T __kernel_sigreturn 22:21:02 00000420 T __kernel_vsyscall 22:21:06 it seems safe 22:21:06 ais523\unfoog: I'm doing something perfectly respectable! 22:21:24 ais523\unfoog, there is an int80 and a sysenter version too 22:21:25 yep, rt_sigreturn, sigreturn and vsyscall are all handlable 22:21:32 ais523\unfoog: tbh, what I need is basically chroot + unprivileged user + forced clock + empty environment + forced hostname 22:21:40 ais523\unfoog: the rest is just feelgood :) 22:21:43 empty environment is trivial 22:21:49 yes 22:21:52 ais523\unfoog: no shit 22:21:52 the host/name/ can easily be set, too; it's namespaced 22:21:52 ais523\unfoog: you're bad at secret projects because I FIGURED OUT YOUR SECRET PROJECT HAHAHAHA 22:22:01 CakeProphet: by reading other people discussing it? 22:22:05 no 22:22:09 CakeProphet, yes 22:22:11 by using my magical powers. 22:22:16 ais523\unfoog: hmm, do I really need namespace support to do that? 22:22:30 elliott, pretty sure yes 22:22:36 Gross! But okay. 22:22:56 elliott: no, but you don't want to set the hostname for every other process on the system too, do you? 22:23:07 What Nix does is: Unprivileged user (nixbld[1-9] usually), empty environment 22:23:13 and only one build runs as one of the users at a time 22:23:16 that's for a multi-user thing 22:23:17 ais523\unfoog, anyway it might happen that ptrace catches those system calls, but I would suspect it won't 22:23:18 it's a stupid hole they have 22:23:22 and that fixes it 22:23:26 ais523\unfoog: no :) 22:23:37 but yes, any ideas wrt me overriding the clock would be helpful 22:23:38 hmm 22:23:39 ais523\unfoog: your secret is to bother people with questions about a secret project. The reason secrecy is integral to the project is that if people knew why you were asking questions they'd just stop caring. 22:23:43 muahahahahaha 22:23:45 couldn't I just increment it by one second every time it's called? 22:23:49 CakeProphet: we already know, you moron 22:23:49 CakeProphet: nope, they still care 22:24:08 elliott, sure, but what about scheduling then 22:24:24 Vorpal: fair enough, I guess make might race-condition it 22:24:33 elliott, lets say you are building the kernel at -j3, when is the actual "embed for uname" done 22:24:35 it will vary 22:24:37 I still don't think unpacking files at -1 and running the build at 0 will break anything unfixably. 22:24:42 elliott: is that some kind of subatomic particle? 22:24:53 elliott, I think if you add 2 to those then you will be safe 22:25:00 unless configure errors out 22:25:11 Vorpal: no thanks, I'd prefer the file-embedded timestamps to be the epoch 22:25:13 it's an aesthetic thing 22:25:17 elliott, anyway the date ais523\unfoog selected is a good one 22:25:26 it is, but it's not as elegant as all-zeroes 22:25:34 elliott, all 1? 22:25:41 that sounds... unwise 22:25:45 wait, that's just -1 22:25:46 Vorpal: not ereghant 22:25:51 which i'm already using 22:25:51 so ha 22:25:57 elliott, well all 1 except signbit 22:26:17 CakeProphet, did you mean: not elephant 22:26:20 Vorpal: that'll break in a couple of decades. maybe. :p 22:26:30 Vorpal: I'll let you puzzle on that one. 22:26:33 elliott, 64-bit linux uses 64-bit time_t 22:26:41 CakeProphet, elephant definitely 22:27:05 Vorpal: what about dwarf fortress??? 22:27:31 elliott, will it still be 32-bit in a couple of decades? 22:27:40 elliott, I bet it will need more than 4 GB RAM by then 22:28:35 $ ldd ./vdso.so 22:28:36 ldd: exited with unknown exit code (139) 22:28:36 lol 22:28:40 that is quite impressive 22:28:44 ldd is a massive security hole 22:28:48 I know 22:28:51 it just runs the binary with an environment var :P 22:28:53 right 22:28:57 elliott, that is why I was wondering what it would do 22:29:04 on something not using glibc even 22:29:19 Vorpal: something that doesn't support it would just run normally 22:29:32 consider the sysadmin who runs as root and a malicious statically-linked program that a user is complaining about... :) 22:29:34 elliott: is ldd restricted to running executables? 22:29:51 as in, does it refuse to run -x things? 22:29:53 perhaps it should 22:30:05 elliott, indeed 22:30:06 -!- augur has joined. 22:30:14 [elliott@dinky ~]$ ldd ./2011-10-30.txt 22:30:14 ldd: ./2011-10-30.txt: No such file or directory 22:30:15 [elliott@dinky ~]$ ldd ~/Code/weboflies/build.sh 22:30:15 not a dynamic executable 22:30:17 yes, including the tab 22:30:19 that's what it printed 22:30:36 -xing it does: 22:30:39 [elliott@dinky ~]$ ldd ~/Code/weboflies/build.sh 22:30:39 ldd: warning: you do not have execution permission for `/home/elliott/Code/weboflies/build.sh' 22:30:39 not a dynamic executable 22:30:52 heh, it doesn't mention any ld.so 22:30:53 at all 22:30:55 "warning:" 22:31:10 "error:" 22:31:30 I think it will continue if you have mulitple files on the line 22:31:44 does anyone use calibre on linux? if so, uninstall it 22:31:50 what is calibre? 22:31:57 a popular ebook manager thing 22:32:03 and why is it bad? 22:32:07 https://bugs.launchpad.net/calibre/+bug/885027 22:32:11 severely buggy suid helper 22:32:22 binary package? 22:32:31 it's open-source 22:32:35 ah well 22:32:41 "Ability to execute any program as root." 22:32:44 it's that bad 22:32:45 ouch 22:32:59 why does it have a suid bit at all 22:33:00 "I dont see how 1-3 are security vulnerabilities. 4 is a vulnerability only if 22:33:00 mount itself is vulnerable to command line injection. 5 is indeed a 22:33:00 vulnerability, but is neccesitated by the non uniformity of linux filesystems 22:33:00 (mount, eject can be located anywhere). 5 can be mitigated by first checking 22:33:00 for mount and eject in "standard" locations and only then trying all of PATH, 22:33:01 changes for that will be in the next release." 22:33:07 ^^ criminally irresponsible maintainer 22:33:12 (ok, not criminally) 22:33:18 Vorpal: mounting ebook devices, presumably 22:33:22 without root 22:33:24 ... hal? 22:33:30 or dbus or whatever 22:33:34 i think that's what policykit is for nowadays... 22:33:35 3 is a bug if you put a symlink there, isn't it? 22:33:44 ais523\unfoog: all of them are serious bugs 22:33:52 right 22:33:58 I'm trying to work out what the exploit would be 22:34:06 "6. An unprivileged user an mount/unmount/eject whatever he wants, with 22:34:06 root permissions. Danger." 22:34:08 creating empty dirs as root isn't obviously exploitable, for instance 22:34:10 ok, this is the worst setuid executable in history 22:34:23 ais523\unfoog: e.g. if something looks for a lock there 22:34:23 except for annoying people 22:34:29 elliott: right 22:34:52 "You mean that a program designed to let an unprivileged user 22:34:52 mount/unmount/eject anything he wants has a security flaw because it allows 22:34:52 him to mount/unmount/eject anything he wants? I'm shocked. 22:34:52 Implement a system that allows an appilcation to mount/unmount/eject USB 22:34:52 devices connected to the system securely, then make sure that system is 22:34:53 universally adopted on every linux install in the universe. Once you've done that, feel free to 22:34:55 re-open this ticket." 22:35:00 wow, remind me to avoid this person's code, forever 22:35:39 the reply is funny; "Unfortunately, sarcasm does not make you right." 22:35:41 ouch yeah 22:36:03 ais523\unfoog: more people need to listen to that advice, I think... 22:36:23 he replied "Sarcasm doesn't make me right, being right makes me right." 22:36:34 heh, they generate a linker script for the vdso. As in, you aren't supposed to edit the .lds, but rather edit the generator 22:36:37 "Shocking as that 22:36:37 may seem, I am actually aware of the dangers" 22:36:40 then he submitted a fix, and someone broke that one too 22:36:41 just not competent enough to avoid them 22:37:11 /* 22:37:11 * Align the actual code well away from the non-instruction data. 22:37:11 * This is the best thing for the I-cache. 22:37:11 */ 22:37:22 heh, by creating a filesystem file with some suid executables on it and loopback-mounting it with calibre 22:37:23 ais523\unfoog, from the vdso *linker script* 22:37:33 the alignment is 0x100 22:37:53 I guess it is because it will end up updating the data page a lot from the kernel 22:38:31 ais523\unfoog, wait, what is the point of that? 22:38:38 then he fixed it again, to only mount files in /dev 22:38:43 what 22:38:47 which is of course vulnerable to race conditions 22:38:48 ais523\unfoog, this can't be real? 22:38:53 Vorpal: this is an exploit 22:38:55 not the fix 22:38:58 oh okay 22:39:03 the suid part, that is 22:39:05 not the dev part 22:39:15 I meant the dev part 22:39:30 exploits exploit incorrect assumptions, so typically involve doing something crazy 22:39:39 right 22:39:43 you should have to pass some kind of exam to ship setuid executables to users 22:39:51 probably that exam should be "you can convince a package maintainer to package it"... 22:40:25 heh, it's just been pointed out that unprivileged users /can/ create symlinks in /dev 22:40:31 I'd missed that myself 22:40:41 anyone here know how? or shall I just give the solution? 22:40:43 you can? 22:40:46 * elliott doesn't know how 22:40:49 wow gregor. i'm pretty impressed. opus 13 is a nice piece of art. 22:40:53 ais523\unfoog, /dev/shm 22:40:56 that would do it 22:40:57 ais523\unfoog: good god, this guy just keeps patching his piece of shit 22:41:02 Vorpal: right 22:41:11 Vorpal: heh 22:41:12 elliott: and Dan Rosenberg comes up with a new exploit every time 22:41:17 this is a great thread 22:41:23 is it on relevant-part-of-reddit yet? 22:41:25 ais523\unfoog: isn't it Jason A. Donenfield doing the exploits? 22:41:27 it probably fits on proggit 22:41:28 and yep 22:41:30 that's where I found it 22:41:35 How not to respond to vulnerabilities in your code (bugs.launchpad.net) 22:41:40 (http://www.reddit.com/r/programming/comments/lzb5h/how_not_to_respond_to_vulnerabilities_in_your_code/) 22:41:43 oh, multiple people 22:42:05 "2) It may not even be installed on some distros, for example, it isn't installed by default on gentoo." 22:42:12 he can't depend on pmount, gentoo doesn't install it by default :DDD 22:42:22 ais523\unfoog, this code is quite pretty btw: http://sprunge.us/cHgf (from the vdso) 22:42:27 THE MEME THAT TIME FORGOT: "BRB I can be doll" 22:42:51 that's a pointless meme 22:42:51 ais523\unfoog, it uses a sequence counter to ensure a consistent reading of the time 22:42:55 "@Rosenberg: Yes, I have. And you were warned, this is the last response you 22:42:56 will get from me." 22:43:06 WHAT WILL YOU DO ABOUT MY SECURITY HOLES NOW THAT I CANNOT HEAR YOU??? MWAHAHAHAHA 22:43:31 ais523\unfoog: It's actually what the receipt from Mattel says if you order a Barbie I Can Be™ Doll 22:43:39 elliott, did they open a CVE? 22:43:44 hmm, he's a Gentoo user... I'm going to try really hard to be shocked 22:44:16 haha, someone pointed out a security hole in the exploit 22:44:21 I'm trying to figure out if that's clever or missing the point 22:44:27 ais523\unfoog, heh? 22:44:34 ais523\unfoog, which comment 22:44:44 Vorpal: running the exploit code lets arbitrary people run executables with your perms 22:44:50 #37 22:45:05 heh 22:45:30 "I'm not sure this is actually exploitable...the posted exploit fails on my GNU/kFreeBSD box: 22:45:30 $ gcc 70calibrerassaultmount.sh -o full-nelson" 22:45:34 ais523\unfoog, I do think it is clever, rather than missing the point 22:45:34 ais523\unfoog: facepalm with me 22:45:46 "Is there different compiler (icc?) or architecture (maybe needs a RISC arch?) requirement?" 22:45:49 elliott: oh dear 22:45:56 ouch 22:46:05 "Until this comment, I was on the side of fixing with the exploits. Now, as far as I am concerned you should go play frisbee on a freeway." ;; that was a different person you moron 22:46:13 * elliott replies to people where they can hear it, in #esoteric 22:46:21 #41 is a reasonably sane comment 22:46:35 yes 22:46:46 "I would like ubuntu for not including this obviously exploitable test case in the face of an arrogant security researcher." 22:46:53 ais523\unfoog: I think missing the point, for sure 22:47:14 elliott, I'm pretty sure someone is trying to be cleaver there. 22:47:25 it's from the same comment that points out the "exploit" 22:47:33 elliott, indeed 22:47:35 (in the exploit) 22:47:38 anyway, *clever 22:47:46 whatever 22:47:56 spelling is for amateurs 22:48:03 http://www.reddit.com/r/programming/comments/lzb5h/how_not_to_respond_to_vulnerabilities_in_your_code/c2wuix0 22:48:26 programmers are way too touchy :P 22:49:11 Vorpal, speling iz foar amacherz 22:51:05 "The thing is, there's not much out there that supports so many formats. It's incredibly extensive. The devs have just put tons of time into adding feature after feature after feature. They even do their own IPC and lots of other little things that remind me of my first gigantic project where I crammed everything I could think of into one program to learn about everything." 22:51:06 spelling is for linguists 22:51:06 yikes 22:51:14 hagb4rd: that's not what a linguist is 22:51:36 what exactly do you mean elliott? 22:51:37 elliott is correct 22:51:47 augur is correct. 22:51:48 :P 22:51:51 hagb4rd: a linguist is not someone who likes languages/knows a lot of languages/enjoys using language 22:52:04 (well, they might do any or all of those, but that's not what a linguist /is/) 22:52:11 ais523\unfoog: reddit wisdom: http://www.reddit.com/r/programming/comments/lzb5h/how_not_to_respond_to_vulnerabilities_in_your_code/c2wu5qx 22:52:19 i never said that 22:52:43 I don't see the relevance of being a linguist to spelling properly :P 22:53:10 Linguistics is the formal study of language. That's all. 22:53:24 okay 22:53:45 however didnt mean to insult our linguists here :P 22:54:28 you're lucky so few of us like languages.- 22:54:33 *-- 22:54:37 i think augur is the only linguist here :P 22:54:55 I think augur's the only linguist here. Though if you include dilettantes you can make that plural. 22:58:01 i'm pretty sure most of the regulars have some sort of language fetish here 22:58:12 perhaps not a very regular one 22:59:42 But what man cannot say he has not fallen to the subtle allure of Swedish? 22:59:50 (The answer is all of them. Even the Swedes.) 22:59:52 Phantom_Hoover: Bork bork bork. 23:00:13 Does anyone actually use /sys nowadays? ais523\unfoog? Vorpal? 23:00:14 pikhq_, please don't, this is polite company. 23:00:21 elliott: I can't remember what it's for 23:00:35 even the swedes have learned swedish 23:00:38 It's like /proc but with syssy stuff. 23:00:49 ais523\unfoog: /proc/sys, except for when you're in the past 23:01:16 /proc/sys/dev is my new favourite path. 23:01:27 elliott: it exists in this system, and is not identical to /proc/sys 23:01:30 I wonder if I can set it to ~. 23:01:37 ais523\unfoog: I know that. 23:01:45 I don't know if anything's using it 23:01:47 Phantom_Hoover: Huh? 23:01:54 ".'s home directory"? 23:02:01 I seem to recall it being essential for udev. 23:02:02 ah, that was a full stop 23:02:13 Punctuation is an evil from which we may never be free. 23:02:14 none on /sys/fs/fuse/connections type fusectl (rw) 23:05:58 -!- copumpkin has joined. 23:07:51 -!- GreaseMonkey has quit (Quit: The Other Game). 23:17:48 Does anyone actually use /sys nowadays? ais523\unfoog? Vorpal? <-- uh yes? 23:17:50 udev 23:17:51 a lot more 23:17:56 Why 23:18:06 elliott, it provides info about devices and so on 23:18:17 What is the semantic difference between /proc and /sys 23:18:31 * Phantom_Hoover → sleep 23:18:33 -!- Phantom_Hoover has quit (Quit: Leaving). 23:18:37 elliott, /proc is for pids + some other stuff 23:18:52 elliott, some stuff is being moved or has been moved from /proc to /sys I know 23:18:53 [elliott@dinky ~]$ ls /proc/sys 23:18:53 abi debug dev fs kernel net vm 23:18:53 [elliott@dinky ~]$ ls /sys 23:18:53 block bus class dev devices firmware fs hypervisor kernel module power 23:18:53 What is the semantic distinction between these two 23:18:55 during 2.6.x 23:19:07 elliott, /proc/sys is basically sysctl 23:19:10 nothing else 23:19:17 I thought sysfs was basically sysctl too. 23:19:21 elliott, /sys is for device discovery and so on 23:19:23 elliott, far from it 23:19:34 "It is similar to the sysctl mechanism found in BSD systems" --wp 23:19:50 *shrug* 23:19:53 well, it is used to discover things, like what devices exist 23:19:56 It sucks to have two directories for "misc. kernel shit". 23:20:17 /proc is really over-populated 23:20:32 elliott: On the contrary, we should have more. 23:20:43 $ ls -l /sys/block/ 23:20:43 totalt 0 23:20:43 lrwxrwxrwx 1 root root 0 2011-11-04 00:19 dm-0 -> ../devices/virtual/block/dm-0 23:20:43 Directories galore. 23:20:54 totalt 23:20:57 well a lot more 23:21:04 elliott, sv_SE I think 23:21:48 elliott, anyway a few files in /sys are for setting stuff, mostly stuff related to a particular instance of a driver for a specific hardware 23:21:54 rather than system-global settings 23:22:33 elliott: /proc started as a "information about processes" filesystem, became a "generic kernel shit" filesystem. Now they're trying to make /sys the generic kernel shit filesystem, and /proc the information about processes filesystem. 23:22:35 elliott, say, if you want to add a foo-switch to every block device, chances is it goes into /sys, if you want a global foo-switch for the entire system, it becomes a sysctl and goes into /proc/sys 23:22:59 If they could do things from scratch they'd probably make it /sys/proc 23:23:04 yes 23:23:07 that would make sense 23:24:30 anyway I think udev mainly uses /sys/{block,bus,dev,devices} 23:24:34 maybe some more 23:24:58 Shouldn't proc be ... yeah, /sys/proc. 23:25:12 Can you tell stuff proc is in a different place? :p 23:25:22 pikhq_, where is /sys documented btw? Like /sys/firmware/memmap/0/{end,start,type}, I have no idea what that is for 23:25:31 elliott, probably not 23:25:43 Vorpal: Probably somewhere in linux-x.y.z/Documentation/ 23:25:46 elliott, anyway I doubt mkdir /sys/proc would work 23:26:09 $ ldd ./vdso.so 23:26:09 ldd: exited with unknown exit code (139) 23:26:10 gah 23:26:16 Vorpal: I guess so :P 23:26:16 fuck you synergy 23:26:17 Didn't work for me 23:26:30 $ ls /sys/firmware/memmap/ 23:26:30 0 1 10 11 12 13 14 15 16 17 18 19 2 20 21 22 23 24 25 26 27 28 3 4 5 6 7 8 9 23:26:39 someone needs to fix the copy-paste bug for synergy btw 23:26:55 have you tried the maintained fork 23:27:05 elliott, that is what I'm using 23:27:26 elliott, anyway only some programs exhibit it, and it starts randomly a while after connecting 23:32:10 -!- sllide has quit (Read error: Connection reset by peer). 23:34:38 私のホバークラフトはうなぎでいっぱいです！ <- The only phrase in Japanese anyone ever needs to know. 23:35:04 pikhq_, what does it mean? 23:35:42 (watashi no hobākurafuto wa unagi de ippai desu!) [watasi no hohầkurahuto ha unagì tè i'håi tèsu] 23:35:49 Vorpal: "My hovercraft is full of eels." 23:35:51 ah 23:36:45 s/gì/kì/ 23:42:55 -!- kwertii has joined. 23:45:03 `ls /sys/firmware/memmap 23:45:05 ls: cannot access /sys/firmware/memmap: No such file or directory 23:45:36 `ls /sys 23:45:38 block \ bus \ class \ dev \ devices \ firmware \ fs \ kernel \ module 23:55:33 -!- Vorpal has quit (Ping timeout: 276 seconds). 2011-11-04: 00:16:44 -!- ais523\unfoog has quit (Read error: Connection reset by peer). 00:18:46 -!- oklopol has quit (Read error: Connection reset by peer). 00:19:05 -!- oklopol has joined. 00:20:09 -!- Zuu_ has quit (Ping timeout: 244 seconds). 00:22:29 gah, the two people I was gonna talk to both quit at the same time 00:41:55 -!- augur has quit (Remote host closed the connection). 01:04:16 -!- derdon has quit (Remote host closed the connection). 01:13:18 -!- augur has joined. 01:28:43 -!- GreaseMonkey has joined. 01:28:44 -!- GreaseMonkey has quit (Changing host). 01:28:44 -!- GreaseMonkey has joined. 02:06:24 -!- nooga has quit (Ping timeout: 252 seconds). 02:27:02 -!- tiffany has quit (Quit: Leaving). 02:39:56 -!- slayerten has joined. 02:40:35 hi slayerten 02:40:37 `? welcome 02:40:39 Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page 02:42:45 hi 02:42:48 3q 02:52:17 -!- slayerten has quit (Ping timeout: 240 seconds). 02:53:32 -!- slayerten has joined. 02:58:59 -!- slayerten has quit (Quit: Leaving.). 03:15:50 "Chili and basil give rise to its distinctive spiciness." 03:15:56 Yeah, when I think "spicy", I think "basil" 03:16:04 That spicy, spicy basil. 03:17:34 "Archive maintainers are encouraged to copy this 03:17:34 distribution to their archives outside the USA. Please get it from 03:17:34 ftp.gwdg.de; transferring this distribution from ftp.gnu.org (or any other 03:17:34 site in the USA) to a site outside the USA is in violation of US export 03:17:34 laws." 03:17:39 Wow, GNU offer a way to violate US export laws on demand. 03:17:45 Nobody outside the US download this file: http://ftp.gnu.org/gnu/glibc/glibc-crypt-2.1.tar.gz 03:18:24 It's them that violate the laws, right? 03:18:32 think so 03:18:36 i dunno 03:18:46 I might have just illegally exported it 03:18:57 heh 03:19:07 I think the burden is meant to be on the distributors, which is why everyone's paranoid about it 03:21:42 The USA has actually relaxed its export regulations since 200something. 03:21:46 2008? 2009? 03:22:06 Lesse what Wikipedia says ... 03:24:52 You have to notify the Bureau of Industry and Security. But that's all, there's no licensing or other restrictions, they just have to KNOWWWWWWWW. 03:25:05 Also it seems that for any given source release you only have to notify once. 03:25:13 (i.e. mirroring isn't an issue) 03:30:16 Heh 03:32:20 Also, you have the option of emailing them, or faxing AND mailing them! (Note: that is not an "or", it is an "and") 03:34:29 X-D 03:34:42 Now would be a great time to force a horrific question on you. 03:34:50 Gregor: How'd I override the Linux clock syscalls to always return the epoch 03:39:32 ... magick? 03:40:54 Gregor: So. Unhelpful. 03:41:14 At this rate it looks like I'm gonna have to steal Web of Lies' architecture-specific syscall-overriding code... 03:51:55 -!- TeruFSX has joined. 03:55:25 [elliott@dinky weboflies]$ sudo ./weboflies ls 03:55:25 = WARNING: mount("/home/ais523", "/tmp/home/ais523", 0, MS_BIND|MS_RDONLY, 0): No such file or directory 03:55:25 = WARNING: mount("/home/ais523/weboflies/nethack/nethack", "/tmp/var/games/nethack", 0, MS_BIND, 0): No such file or directory 03:55:25 = WARNING: mount("/etc/nethack", "/tmp/etc/nethack", 0, MS_BIND|MS_RDONLY, 0): No such file or directory 03:55:26 = WARNING: unexpected signal 11 sent to pid 13002 03:55:28 + executed program terminated 03:55:30 > 03:55:35 Gregor: Can you shoot ais for me? 03:55:45 😤😤lolwut 03:56:05 Gregor: I'm trying to get the Project Formerly Known as the Secret Project running :P 03:56:12 Is web-o-flies related to --- so yes. 03:56:23 Web o' Flies X-D 03:56:35 So much better than the alternate reading. 03:57:38 Gregor: But yeah, right now it has a bunch of lolunportable bind mounts :P 03:57:49 #if 1 03:57:49 /* make my home dir visible inside the chroot, for testing */ 03:57:49 ewarn(mkdir("/tmp/home/ais523", 0755)); 03:57:49 ewarn(mount("/home/ais523", "/tmp/home/ais523", 0, MS_BIND|MS_RDONLY, 0)); 03:57:49 /* more for-testing things */ 03:57:49 Seems that way, dunnit. 03:57:50 ewarn(mkdir("/tmp/var/games", 0755)); 03:57:52 ewarn(mkdir("/tmp/var/games/nethack", 0755)); 03:57:54 ewarn(mount("/home/ais523/weboflies/nethack/nethack", "/tmp/var/games/nethack", 0, MS_BIND, 0)); 03:57:56 ewarn(mkdir("/tmp/etc/nethack", 0755)); 03:57:58 ewarn(mount("/etc/nethack", "/tmp/etc/nethack", 0, MS_BIND|MS_RDONLY, 0)); 03:58:00 #endif 03:58:24 #if 1 03:58:24 /* make my home dir visible inside the chroot, for testing */ 03:58:24 ewarn(mkdir("/tmp/home/elliott", 0755)); 03:58:24 ewarn(mount("/home/elliott", "/tmp/home/elliott", 0, MS_BIND|MS_RDONLY, 0)); 03:58:25 #endif 03:58:27 Thar we go 03:58:29 s/if 1/if 0/ PROBLEM SOLVED 03:58:41 Gregor: Damn, I was gonna ask if you've seen the source code but then I realise ais gave it to me in private :P 03:58:44 It's... it's something else. 03:58:54 For instance it's over 4000 lines in a single C file :P 03:59:10 [elliott@dinky weboflies]$ sudo ./weboflies ls 03:59:10 = ERROR: stat proc/pid/fd: Permission denied 03:59:10 I... don't... even... 03:59:12 Remember when you complained about Plof's interpreter function? 03:59:29 Gregor: You want me to hold everyone by ais' coding standards? 03:59:34 Y'all off scot free. 04:00:10 Also, I think I have a new winner of my Unicode Nonsense Prize. 04:00:18 GOAT ain't got nothin' on CAT FACE WITH WRY SMILE 04:01:05 Wow :P 04:01:34 Gregor: http://www.fileformat.info/info/unicode/char/1f639/index.htm 04:02:06 Yeah, I found it on fileformat.info's list. 04:02:13 I feel that WRY SMILE is better though. 04:04:18 God damn Japan. 04:05:09 Gregor: Seriously though... you gotta see this thing's code before you die. 04:05:19 Every comment is like a paragraph of pure horror. 04:06:15 Gregor: Have I mentioned it does SDL support by using a PNG framebuffer? 04:06:27 (OK, it uses a framebuffer which it can screenshot to PNG :P Still) 04:06:37 (In-memory framebuffer, that is) 04:06:51 Gregor: http://www.fileformat.info/info/unicode/char/1f648/index.htm 04:09:31 U+01A2 LATIN CAPITAL LETTER OI 04:09:31 U+01A3 LATIN SMALL LETTER OI 04:09:31 These should have been called letter GHA. They are neither pronounced 'oi' nor based on the letters 'o' and 'i'. 04:09:31 -- http://unicode.org/notes/tn27/ 04:09:35 uhm, is there an esolang that the source code is raw waveform (audible or not)? 04:09:57 lifthrasiir: piet encoded as pcm :p 04:10:13 elliott: no novelty. :p 04:10:43 input-format languages are rarely novel :P something that based it on some kind of actually interesting waveformy analysis would be interesting 04:10:44 elliott: At least they kinda LOOK like OI. 04:10:49 but probably involve reals and thus be a pain to run 04:10:58 (whereby "a pain" means "impossible") 04:11:45 Gregor: Did you logread to see what the Secret Project is actually for? Wait, you never logread, do you :P 04:11:57 \/win 4 04:12:10 coppro: no...... 04:12:46 elliott: i have thought that such language may build a network of filters (or DSPs, if you prefer) and run the input through it 04:13:00 elliott: No, but I have some vague familiarity from earlier mentions of it. 04:13:01 lifthrasiir: that would be pretty. so the input would be audio too? 04:13:03 elliott: Software repeatability. 04:13:05 yes 04:13:16 Gregor: Right. It's for tool-assisted speedruns. 04:13:37 Whuhwhuh 04:13:42 there may be some fixed sources (i.e. sources and sinks) that appears in the source code as a wave literal 04:13:42 I thought it was for SCIENCE. 04:13:53 Gregor: Tool-assisted speedruns are pretty damn scientific :P 04:13:58 lul 04:14:01 We already knew it wasn't testing or anything *shrugs* 04:14:17 i don't know how to encode all these informations to some pretty waveforms though :S 04:15:07 Gregor: http://www.fileformat.info/info/unicode/char/1F46F/index.htm I... 04:16:30 http://www.fileformat.info/info/unicode/char/1f487/index.htm; very next codepoint: http://www.fileformat.info/info/unicode/char/1f488/index.htm 04:17:04 Gregor: Have I mentioned Web of Lies does cooperative scheduling by overriding every single syscall to schedule 04:17:18 So that syscalls block and yield appropriately. 04:17:30 It's so beautiful :P 04:17:54 RAT vs. MOUSE: http://www.fileformat.info/info/unicode/char/1f400/index.htm http://www.fileformat.info/info/unicode/char/1f401/index.htm 04:18:05 Gregor: Oh, and it overrides syscalls by using ptrace, transforming the arguments, calling the real syscall, then transforming the result in the process's memory in-place. 04:19:01 Gregor: MEANWHILE: http://www.fileformat.info/info/unicode/char/1f51b/index.htm 04:28:11 name a dangerous part of london 04:28:53 everywhere 04:29:02 where are you most likely to get mugged 04:30:32 glasgow 04:36:50 quintopia: 70s, Protestant neighborhood in Ireland, while being the Pope. 04:37:31 that's not in london, but i appreciate the thought 04:38:24 Oh, *in London*? 04:38:41 Just be named Guy Fawkes. That should do it. 04:38:42 :P 04:45:44 elliott: That's actually pretty damned nifty. 04:46:00 Gregor: It's /horrifying/. It /manually messes with registers/. 04:46:06 elliott: And? :P 04:46:34 elliott: This is Gregor you're talking to. 04:47:25 pikhq_: Gregor: You guys can't even begin to talk, you haven't SEEN this shit :P 04:47:43 No, but I wrote something similar in/for JavaScript ... 04:47:57 Gregor: Eh? 04:48:01 What are you referring to? 04:49:46 Gregor: Like, I can't think of ANYTHING to do with JS that would be even REMOTELY comparable to this :P 04:50:10 It's possibly the least portable C program I've ever seen. 04:50:28 elliott: Unless there's a bug in a Javascript implementation that allows him to prod registers manually. 04:50:31 :D 04:50:35 elliott: http://sss.cs.purdue.edu/projects/dynjs/jsbench-oopsla-2011.pdf 04:50:43 The least portable Javascript program! 04:51:01 Gregor: Is the similarity just "it's for repeatability" 04:51:14 Gregor: Because let me tell you, it is not the /idea/ that is horrifying here, it is very much the implementation :P 04:51:48 elliott: The implementation is PRETTY horrifying, but then JS is a highly-dynamic language with reflection, and ELF+x86 isn't. 04:52:14 Gregor: The Secret Project doesn't give a shit about ELF. I don't quite think you understand :P 04:52:17 elliott: It's the same basic idea of standing in between all the syscalls and rewriting them. 04:52:32 Gregor: It's based on constructing a chroot, starting a process, and then becoming a horrific parasite of it. 04:52:37 Yesyesyes 04:52:58 Gregor: Note that you're not MEANT to be able to "intercept" syscalls :P 04:53:09 You can just get notified when there's a syscall, pausing the process, and you happen to be able to fiddle with memory and registers. 04:53:10 ptracesayswhat 04:53:20 Ah, right. 04:53:28 Yup. 04:53:32 It's basically "interception via automated gdb" :P 04:53:52 Seriously though, using syscalls for scheduling is warped, whatever universe you're in :P 04:53:56 That being said, it seems to me like that should be implementable in a way that's only /mostly/ horrible, not /entirely/ horrible. 04:54:00 Have I mentioned it fakes a system clock? 04:54:10 elliott: Please tell me this is something absurd like orthogonal persistance via ptrace. 04:54:13 It actually manages time itself :P 04:54:22 pikhq_: No, it's the Project Formerly Known as the Secret Project. 04:54:36 That would be amazing though, you must admit. 04:54:38 pikhq_: It makes Linux (almost) deterministic. 04:54:54 (Deterministic if you don't have a loop that calls no syscalls in it) 04:55:27 To what end? 04:55:40 pikhq_: That was the Secret (you've seen ais523 talk about it, right?) 04:55:43 Turns out it's for TASes. 04:55:44 elliott: So, to what degree does it work? 04:55:47 And now, a long quote: 04:55:50 /* Linked list of future timed events, maintained in sorted order. 04:55:50 Any syscall that schedules something to happen at a particular 04:55:50 future time, such as nanosleep(2) (syscall return) or alarm(2) 04:55:50 (signal) will add an element to this list. Time does not increase 04:55:50 while any processes are executing; once all are simultaneously 04:55:51 blocked, the first element from this list is taken and resolved. 04:55:52 *Aaaah*. 04:55:53 Simultaneous events cannot happen; if an event would be added to 04:55:55 this list and another one already has the same time, the new event 04:55:57 is postponed one nanosecond. We only have to worry about one sort 04:55:59 of clock here; REALTIME and MONOTONIC are the same as system time 04:56:01 cannot be changed without root privs and we don't change it, 04:56:03 MONOTONIC_RAW is the same as MONOTONIC as we don't allow time slew, 04:56:05 ... Oh my god. 04:56:05 and we claim that all time spent executing is spent in syscalls 04:56:07 (i.e. zero lag), so PROCESS_CPUTIME_ID and THREAD_CPUTIME_ID are 04:56:09 always 0. (Likewise, of the three interval timers, ITIMER_REAL is 04:56:11 based on realtime, and the other two never fire at all.) */ 04:56:32 :D 04:56:46 Gregor: Well, right now I'm trying to get it to run on my system >_> 04:56:56 I guess for TAS being able to just fake up time is not sufficient, the goal is to have repeatable timing. 04:56:59 Gregor: But I gather it runs NetHack, and evidently runs some SDL game well enough for that stuff to be tested. 04:57:17 Gregor: He was even working on getting OpenGL working. 04:58:13 pikhq_: Here's another one for ya: 04:58:13 ais523 is a madman. 04:58:16 /* We can use procfs to get the current mappings, in order to avoid 04:58:16 overlapping an existing mapping. The mappings are given in 04:58:16 numerical order. The way it works is that we don't place anything 04:58:16 before the first or after the last mapping (to avoid writing on 04:58:16 system address space); and we place the mmap at the end of the 04:58:17 last gap in which it fits with addrnear == 0. If addrnear has a 04:58:18 value, we place it at addnear & PAGE_MASK if we can, or move it 04:58:20 backwards slightly so that it fits if we can, or otherwise at the 04:58:22 end of last the gap before addrnear where it fits or at the start 04:58:24 of the next gap afterwards where it fits, whichever is nearer. 04:58:26 There is one other rule: Linux doesn't like an mmap getting too 04:58:28 near to the end of the stack, and shrinks the stack if that is 04:58:30 done (presumably to give a guard page for stack overflow 04:58:32 protection). As such, we keep each map at least a page away 04:58:34 from each other map. */ 04:58:36 In fairness, there was a blank line before "There is one other rule". 04:59:39 Gregor: pikhq_: Here's the scheduling rules: http://sprunge.us/GGYX (He's already pasted that with the realtime-simulation bits censored, but that's public now, so *shrug*) 05:02:19 Gregor: pikhq_: OK, ais will get mad of me if I paste too much of this, but I couldn't resist: http://sprunge.us/DTJa 05:02:38 So. You can fucking TAS at syscall granularity. 05:03:59 OK, /something/ is wrong with the simulated /proc here 05:06:46 -!- monqy has quit (Quit: hello). 05:07:02 -!- Sgeo|web has joined. 05:07:22 kmc's reaction to the AW SDK: "ughhhh" 05:08:27 You're subjecting kmc to your API design? Come on, that's not fair. 05:08:30 kmc: We apologise. 05:09:37 I'm not the one providing the AW SDK! 05:10:34 Just think, all the person-hours going into this might produce a whole _three_ test bots before Sgeo|web gets bored and looks at another language. 05:11:21 Actually-written code would be a surprise, tbh 05:11:37 I said might. 05:12:02 What's more likely is that you'll make a bunch of people go to the effort of trying to figure out how to bind it for absolutely nothing, but I thought you might find me saying that a little depressing. 05:14:03 kmc: I would just use a global lock for this. 05:14:14 Wait, you're trying to stop Sgeo from doing things like that, aren't you. 05:14:20 I apologise. 05:14:59 no I am currently explaining how to do it :) 05:15:51 * shachaf monad transformers :-( 05:15:54 kmc: I meant a global global. It's not a global if you can have more than one of them. 05:16:09 But seriously, this is a hideous C API, top-level mutable variable > ReaderT implementation detail. 05:20:43 elliott, I was getting to the global global 05:20:53 Global global global. 05:20:53 why don't you follow along in #haskell instead of bugging me here 05:21:18 I can't face watching it directly. But I'll leave you to deal with the horror. :p 05:58:46 -!- kwertii has quit (Quit: bye). 06:04:23 -!- MDude has changed nick to MSleep. 06:41:06 -!- hagb4rd has quit (Ping timeout: 240 seconds). 06:44:24 -!- naskg has joined. 06:46:01 has anyone here used an Array in a legitimate purposeful Haskell program? 06:46:09 I haven't. But that's kind of expected. 06:58:05 -!- oerjan has joined. 07:03:44 would there be any values that have type-level natural types? 07:05:22 -!- naskg has quit (Read error: Connection reset by peer). 07:05:34 -!- naskg has joined. 07:06:28 :t Just (Just (Just (Just ())))) -- this has type 4, essentially? 07:06:29 parse error on input `)' 07:06:32 argh 07:06:38 :t Just (Just (Just (Just ()))) -- this has type 4, essentially? 07:06:39 Maybe (Maybe (Maybe (Maybe ()))) 07:06:58 hm wait 07:07:03 too much Nothing 07:07:12 -!- naskg has quit (Client Quit). 07:07:22 :t Identity (Identity (Identity (Identity ()))) 07:07:23 Identity (Identity (Identity (Identity ()))) 07:07:27 oerjan: but not in the actual implementation of type-level naturals right? 07:07:42 or... yes? 07:07:57 what is "the" actual implementation? 07:08:02 I don't know. 07:08:09 there isn't one? 07:08:11 * CakeProphet has no clue. 07:08:39 it may be common for pure type-level programming in haskell to use empty data types, in which case you only have undefined, which haskell cannot avoid. 07:09:27 a type-level boolean would be nice. Basically it would serve the purpose of an anonymous set of two phantom types. 07:09:37 data Zero; data Succ a 07:09:57 is "type Zero" not valid? 07:10:06 not valid. 07:10:15 a type is a synonym. 07:10:54 even the above requires EmptyDataDecls extension (sp?) 07:14:22 right I understand what type is for, it just seems that in this context they'd be completely equivalent. 07:14:43 type must be entirely expandable at compile time 07:17:56 kind / = A | B x | C x y 07:18:06 where is your God now? 07:19:29 AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA 07:19:45 I don't really think that kind of definition would serve any kind of purpose. 07:19:53 basically to associate a group of types to a kind. 07:20:09 kind-level metaprogramming? :P 07:20:49 kind-level naturals? WHERE DOES IT END. 07:21:02 there are kinds all the way down 07:21:10 or sorts, whatever that is 07:22:29 i do have the feeling the above definition is a confusion of levels, though 07:22:55 all the way down? 07:23:12 something like kind / x y = (* -> x) -> * -> y i could sort of believe in 07:23:23 oh, well... 07:23:35 that's more like a kind-level type declaration 07:23:37 although the mix of operator and alphanums also grates 07:23:41 I was thinking more of a kind-level data declaration 07:23:51 ah. 07:23:55 where these types suddenly have this kind. 07:24:14 analogous to these constructor functions having this type. 07:24:24 hm ok that may make sense. although you'd want x and y to be parameters on the left side. 07:24:33 or foralled 07:24:52 well... 07:25:00 parameters in kinds are typically done via -> 07:25:17 I'm confused now. :P 07:25:28 um -> _is_ a kind constructor 07:25:35 ah okay. 07:25:50 i'd expect what you define to be other kind constructors 07:26:05 that serve the purpose of.......... 07:26:08 .......... 07:26:12 (silence) 07:26:15 07:28:08 it may have some relevance to type-level programming? 07:29:18 hmmm..... 07:29:23 really * acts as a kind of kind variable. 07:29:50 well, not really. 07:30:38 also your rules about operators and variables is messed up now 07:30:48 -> is a kind operator but * is a kind variable. 07:30:48 no, it acts as a kind constant. 07:31:02 oerjan: er, I mean, yes I understand. 07:31:27 but if you added more kind distinctions then * being "any kind of type" is really kind of like a type variable, except that multiple occurences of * don't refer to the same kind. 07:31:51 argh 07:31:54 no? 07:31:55 :P 07:32:16 ...enjoy your trip to the looney bin 07:32:39 i'm outta this conversation :P 07:32:56 any further and Oerjan would descend into madness. 07:34:38 well, further. 07:34:47 into. 07:35:03 something which would require insane unicode to describe. 07:35:52 狂 07:36:19 I got this when I looked up "insane unicode" 07:36:22 it means "insane" 07:37:35 (I thought maybe I could maybe help you describe it maybe\) 07:38:09 PERHAPS SPOKEN LANGUAGE IS LIKE TYPES 07:38:25 AND THE ACTIONS THAT UNDERLY THE SPOKEN WORD ARE THE PORGRAMS 07:38:44 Maybe I make extensive use of the maybe type 07:39:12 (perhaps being a synonym for maybe, mayhaps) 07:40:46 oh no oerjan 07:40:48 i didn't realise 07:40:52 CakeProphet was trying to do haskell 07:40:53 in here 07:40:55 im so 07:40:56 sorry :( 07:41:08 has anyone here used an Array in a legitimate purposeful Haskell program? 07:41:11 elliott: HELP ME. HEEEEEEEEEEEEEEEEEEEEEEEEEEELP MEEEEEEEEEE! 07:41:13 Array is practically deprecated 07:41:26 what is "the" actual implementation? 07:41:26 elliott: kind-level metaprogramming is a state-of-art field in which I'm resorching. 07:41:32 oerjan: the new ghc extension, perhaps? 07:41:37 even the above requires EmptyDataDecls extension (sp?) 07:41:39 not in haskell2010 07:41:51 kind-level metaprogramming? :P 07:42:00 we're getting constraint kinds, and kind polymorphism is being worked on. it is in fact very useful 07:44:22 cooooool. 07:44:42 :>>:>:>>>:>:>>:>>:>:>>:> 07:48:16 :>>:>:>>>:>:>>:>>:>:>>:> 07:48:41 > let (>>:>:>>>:>:>>:>>:>:>>:>) = id in (+2) >>:>:>>>:>:>>:>>:>:>>:> 2 07:48:42 4 08:00:29 CONNNNNNNNNNNNNNS!!! 08:02:37 `QUOTE 08:02:37 -!- elliott has quit (Read error: Connection reset by peer). 08:02:42 `quote 08:02:43 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: QUOTE: not found 08:02:44 74) I'm 100% of what sort of magic was involved in it 08:02:52 `quote 08:02:54 `quote 08:02:54 `quote 08:02:55 46) Reality isn't a part of physics 08:02:55 `quote 08:02:55 `quote 08:02:58 257) ooh I want to see ehird pole dancing I think that would be illegal. oh you are right damn :/ 08:03:00 -!- elliott has joined. 08:03:00 462) #%%:]__t�# do you see that that is great progress taking place 08:03:22 323) ZOMGMODULES, St. Christopher, saint and werewolf. 08:03:22 79) <@Lawlabee> Why does Monday start at 10PM on Sunday? 08:06:53 "@Donnenfeld: Your exploit does not work against current calibre-mount-helper, since I have fixed the mounting of symlinked dirs in both /dev and /media. Closing this bug. Re-open it only if you can point to/describe an actual exploit against current calibre-mount-helper." 08:06:56 this guy never gives up 08:07:38 elliott: he is the Rick Astley of calibre-mount-helper 08:08:14 is that you trying to troll #linux or is this something else? 08:08:32 -!- GreaseMonkey has quit (Remote host closed the connection). 08:10:07 CakeProphet: it's https://bugs.launchpad.net/calibre/+bug/885027, which you will not regret reading 08:12:04 I... 08:12:07 don't believe you. 08:12:32 -!- GreaseMonkey has joined. 08:13:10 CakeProphet: it's at #1 on proggit and had the active members of the channel in a state of awe for like over half of it a few hours ago 08:13:15 you decide :p 08:13:23 ... 08:36:38 :t fun 08:36:39 forall a. (SimpleReflect.FromExpr a) => String -> a 08:37:43 :t fun "hello" "world" 08:37:44 forall t. (SimpleReflect.FromExpr ([Char] -> t)) => t 08:37:55 :t fun show(fun "hello" "world") 08:37:56 Couldn't match expected type `String' 08:37:56 against inferred type `a -> String' 08:37:56 In the first argument of `fun', namely `show' 08:38:10 :t fun (show fun "hello" "world") 08:38:11 Couldn't match expected type `[Char] -> [Char] -> String' 08:38:11 against inferred type `String' 08:38:11 In the first argument of `fun', namely `(show fun "hello" "world")' 08:38:11 lol 08:38:15 HELP WHAT IS PRECEDENCE. 08:38:31 :t fun . show . fun "hello" $ "world" 08:38:32 Ambiguous type variable `a' in the constraints: 08:38:33 `SimpleReflect.FromExpr a' 08:38:33 arising from a use of `fun' at :1:13-23 08:38:36 :t fun . show . fun "hello" $ "world" :: Expr 08:38:37 Ambiguous type variable `a' in the constraints: 08:38:37 `SimpleReflect.FromExpr a' 08:38:37 arising from a use of `fun' at :1:13-23 08:38:40 painful to watch, mostly 08:38:40 bah 08:38:58 :t fun . show $ fun "hello" "world" :: Expr 08:38:59 Ambiguous type variable `a' in the constraints: 08:38:59 `SimpleReflect.FromExpr a' 08:38:59 arising from a use of `fun' at :1:14-32 08:39:30 CakeProphet thinks that $ are literal syntactic parentheses. 08:39:33 He is wrong. 08:39:51 oerjan: I'm trying to use fun and fold[lr] to implement unwords 08:39:55 -!- GreaseMonkey has quit (Remote host closed the connection). 08:40:10 ah. 08:40:17 but kind of lost now... 08:40:23 see above 08:40:36 :t foldr (fun . show) 08:40:37 forall b a. (Show b, SimpleReflect.FromExpr b, Show a) => b -> [a] -> b 08:40:46 :t fun . show (fun "hello" "world") 08:40:48 Couldn't match expected type `[Char]' against inferred type `Char' 08:40:48 Expected type: [String] 08:40:48 Inferred type: String 08:41:06 CakeProphet thinks (f . g x) = (f (g x)). 08:41:07 he is wrong 08:41:15 :t fun $ show (fun "hello" (var "world")) 08:41:16 Ambiguous type variable `a' in the constraints: 08:41:16 `SimpleReflect.FromExpr a' 08:41:16 arising from a use of `fun' at :1:12-36 08:41:19 :t fun $ show (fun "hello" (var "world")) :: Expr 08:41:20 Ambiguous type variable `a' in the constraints: 08:41:20 `SimpleReflect.FromExpr a' 08:41:20 arising from a use of `fun' at :1:12-36 08:41:38 ah 08:41:53 -!- GreaseMonkey has joined. 08:41:54 :t fun (show (fun "hello" (var "world"))) "hello" 08:41:56 Ambiguous type variable `a' in the constraints: 08:41:56 `SimpleReflect.FromExpr a' 08:41:56 arising from a use of `fun' at :1:11-35 08:41:58 sieijoiwejriojsdfoijweorijwer 08:43:01 :t foldr1 (show . fun) 08:43:02 Couldn't match expected type `a -> a' 08:43:02 against inferred type `String' 08:43:02 In the first argument of `(.)', namely `show' 08:43:17 erm 08:43:25 :t foldr1 ((show .) . fun) 08:43:26 Ambiguous type variable `a' in the constraints: 08:43:26 `SimpleReflect.FromExpr a' 08:43:26 arising from a use of `fun' at :1:19-21 08:43:30 you need to apply fun then show it. 08:43:37 fun "name" (var "value") 08:43:39 then show that. 08:43:47 then use that as the var 08:43:55 er 08:43:56 fun 08:43:58 actually. 08:44:33 hm 08:44:44 not sure if it's actually a valid fold. 08:44:56 > let foo [] = "end"; foo (x:xs) = show $ fun x (var (foo xs)) in foo ["a","b","c"] 08:44:57 Ambiguous type variable `a' in the constraints: 08:44:57 `GHC.Show.Show a' 08:44:58 a... 08:45:05 > let foo [] = "end"; foo (x:xs) = show (fun x (var (foo xs)) :: Expr) in foo ["a","b","c"] 08:45:06 "a b c end" 08:45:24 > let foo [] = var "end"; foo (x:xs) = fun x (foo xs) in foo ["a","b","c"] :: Expr 08:45:25 Couldn't match expected type `SimpleReflect.Expr' 08:45:25 against inferred ... 08:45:28 > let foo [] = var "end"; foo (x:xs) = fun x (foo xs) in foo ["a","b","c"] 08:45:29 No instance for (SimpleReflect.FromExpr 08:45:29 (Data.Number.Sy... 08:45:34 > let foo [] = var "end"; foo (x:xs) = fun x (foo xs) in undefined 08:45:35 *Exception: Prelude.undefined 08:45:38 hmm 08:45:43 :t let foo [] = var "end"; foo (x:xs) = fun x (foo xs) in foo 08:45:44 forall a. (SimpleReflect.FromExpr (Sym a), Show a) => [String] -> Sym a 08:45:53 > fun "hello" "world" 08:45:54 Ambiguous type variable `a' in the constraints: 08:45:54 `GHC.Show.Show a' 08:45:54 a... 08:45:56 > let foo [] = var "end"; foo (x:xs) = fun x (foo xs) in show (foo ["a","b"]) 08:45:57 No instance for (SimpleReflect.FromExpr 08:45:57 (Data.Number.Sy... 08:46:04 :-? 08:46:05 :t var 08:46:06 forall a. String -> Sym a 08:46:07 :t fun 08:46:08 forall a. (SimpleReflect.FromExpr a) => String -> a 08:46:13 oh. 08:46:14 :t x 08:46:15 Expr 08:46:17 :t fun "hello" 08:46:18 forall a. (SimpleReflect.FromExpr a) => a 08:46:19 :t name 08:46:19 Not in scope: `name' 08:46:23 huh 08:46:25 oerjan: ? 08:46:29 :t expr 08:46:29 something else is "var" 08:46:30 Expr -> Expr 08:46:36 yes 08:46:49 > SimpleReflect.var 08:46:50 Not in scope: `SimpleReflect.var' 08:47:01 well this is difficult :) 08:47:12 oh... 08:47:13 @hoogle var 08:47:14 not really 08:47:15 Language.Haskell.TH.Syntax VarE :: Name -> Exp 08:47:15 hmm 08:47:15 Language.Haskell.TH VarE :: Name -> Exp 08:47:15 Language.Haskell.TH.Lib varE :: Name -> ExpQ 08:47:25 THANKS HOOGLE 08:47:29 > let foo [] = fun "test" :: Expr; foo (x:xs) = fun x (foo xs) in show (foo ["a","b"]) 08:47:30 "a (b test)" 08:47:33 aha. 08:48:15 > let foo k [] = k $ fun "test"; foo k (x:xs) = foo (\k' -> k' x) xs in show (foo ["a","b"]) 08:48:16 Couldn't match expected type `(t -> b) -> b' 08:48:16 against inferred type ... 08:48:32 CakeProphet: this isn't going to work. 08:48:36 not without essentially defining 08:48:48 join a b = a ++ " " ++ b 08:48:51 with simplereflect 08:48:58 (yes yes I know "join" clashes there) 08:49:03 ah okay. 08:49:34 :t op 08:49:35 forall o n. (Newtype n o) => (o -> n) -> n -> o 08:49:42 wtf is that 08:50:59 -!- oerjan has quit (Quit: Later). 08:51:34 @tell oerjan you can't ask a question and then leave, jerk >:( 08:51:34 Consider it noted. 08:51:57 @tell oerjan it's from http://hackage.haskell.org/packages/archive/newtype/latest/doc/html/Control-Newtype.html 08:51:57 Consider it noted. 09:34:19 -!- ais523 has joined. 09:37:57 ais523: hi 09:38:08 [elliott@dinky hello-2.7]$ time sleep 5 09:38:08 [five second pause] 09:38:08 real0m0.000s 09:38:08 user0m0.000s 09:38:08 sys0m0.003s 09:38:18 -!- nooga has joined. 09:38:18 elliott: haha 09:38:39 I get real 0m5.014s 09:38:42 I haven't got Web of Lies to work, but this is my cheap LD_PRELOAD version of the clock hack 09:38:46 bash runs in it, which is a good start 09:38:53 I'm about to try compiling hello to prove all the naysayers wrong 09:39:00 without even bothering to backdate the source files! 09:39:11 [elliott@dinky hello-2.7]$ date 09:39:11 Thu Jan 1 01:00:00 BST 1970 09:39:11 wait, I thought BST was over. 09:39:21 oh wait 09:39:29 no, it wasn't BST on the epoch either 09:39:33 elliott: wow, such a thrill-seeker. 09:39:33 hmm 09:39:35 living life on the edge. 09:39:41 orig_gettimeofday(NULL, tz); 09:39:41 if (tp) { 09:39:41 tp->tv_sec = 0; 09:39:41 tp->tv_usec = 0; 09:39:41 } 09:39:46 maybe I should just fake the timezone too 09:39:52 I guess it might have weird effects otherwise 09:39:55 elliott: this is why I prefer to control at the syscall level, not the library level 09:40:04 ais523: yes, me too -- got a portable way? :P 09:40:13 there isn't one 09:40:27 Portable Syscall Interface 09:40:30 I suppose you could, umm, scrape the source of strace, which is reasonably portable by special-casing a bunch of OSes and archs 09:40:33 Connector Protocol 09:40:37 but syscalls are inherently nonportable, aren't they? 09:40:43 ais523: wow, gnu hello is best practices? its ./configure checks whether about a hundred libc functions are macros are not 09:40:45 :-( 09:40:58 checking whether build environment is sane... yes 09:40:59 oh, you're _very_ mistaken,a utoconf 09:41:02 s/a / a/ 09:41:12 make[2]: Warning: File `Makefile' has modification time 1320399594 s in the future 09:41:15 elliott: it only runs a few specific sanity checks 09:41:20 make[2]: warning: Clock skew detected. Your build may be incomplete. 09:41:36 [elliott@dinky hello-2.7]$ src/hello 09:41:36 Hello, world! 09:41:41 tl;dr it works perfectly fine, it just warns a lot 09:42:04 elliott: can you shout at this spambot for me? it's recommending the use of Lucinda Handwriting or Papyrus over Arial or Calibri for Christmas invitations 09:42:14 it has no taste in fonts :( 09:42:18 ais523: lucinda handwriting is a beautiful font, marred only by the fact that it doesn't exist 09:42:35 elliott: I didn't check to see if the typo was in the original, but probably 09:42:37 also, I would _probably_ use papyrus before arial. but really, everyone loves papyrus 09:42:37 try the -m flag to tar when you unpack the sources - I think that will avoid weird timestamps 09:42:38 Lucida Console is the best font. 09:42:47 olsner: no, the problem is that the timestamps are in 2011 09:42:49 olsner: it's 1970 09:42:56 this tarball comes from the future, is the problem 09:43:16 elliott: by weird I mean timestamps from 2011 09:43:22 lol 09:43:30 -m, --touch 09:43:30 don't extract file modified time 09:43:30 -m should set them all to the current time 09:43:35 right, I can do it from inside the jail 09:43:36 good idea 09:43:45 tar: hello-2.7/gnulib/m4/locale-ja.m4: time stamp 2011-03-22 17:56:57 is 1300816617 s in the future 09:43:46 I GET IT 09:43:52 WHY DOES ALL GNU SOFTWARE HAVE TO TELL ME I'M IN THE PAST JEEZ 09:43:54 I see you are partying like it's 1970. 09:43:57 --HANG hang for SECS seconds (default 3600) 09:44:20 ais523: what's that from? 09:44:22 elliott: because systems are not designed to run with a clock jammed at the epoch 09:44:24 elliott: man tar 09:44:36 not mine 09:44:37 I'm trying to work out what the option's for, also why it's in allcaps 09:44:45 I suspect it's a typo for --hang SECS 09:44:50 elliott: because systems are not designed to run with a clock jammed at the epoch 09:44:54 err, that would make more sense, yes 09:44:55 I'm sure there's /some/ legacy system... 09:45:02 elliott: it probably has the wrong epoch 09:45:14 elliott: http://vimeo.com/11414505 09:45:31 why are you linking me this 09:45:52 elliott: it's always relevant. 09:46:04 wow, thinks break more if the epoch is right 09:46:06 erm 09:46:07 the timestamp 09:46:21 * elliott configures it, then backdates them 09:46:38 ais523: btw, = ERROR: stat proc/pid/fd: Permission denied 09:46:47 ais523: I've no idea why, I've looked over the code repeatedly 09:46:56 ais523: my only changes were to change your personal bind mounts into ones for my ~ 09:47:28 oh no, not that error again 09:47:33 hahaha 09:47:41 elliott: it's something to do with security on root-executed programs 09:47:47 oh, selinux stuff? 09:48:01 note: it was "sudo ./weboflies true"; true is 64-bit, but I tried it on Web of Lies itself and it still failed, so I suspect it's a generic problem 09:48:03 sometimes just the standard protections on suid stuff 09:48:13 weboflies isn't suid :) 09:48:19 yep, but it drops permissions 09:48:19 make[2]: gnulib/m4/wchar_h.m4: Timestamp out of range; substituting 1970-01-01 01:00:00 09:48:19 make, you disappoint me 09:48:28 ais523: so, how do you fix it? 09:48:32 webo flies 09:48:58 flies that spread deadly timestamp-related diseases 09:48:59 olsner: gregor already topped it with "web o' flies" 09:49:02 -!- GreaseMonkey has quit (Quit: The Other Game). 09:49:12 web o' flies is better yes 09:49:25 elliott: hey, that was an obvious thing to do 09:49:32 yes, but did you do it? 09:49:39 yes 09:49:40 mentally 09:49:46 before the name was public 09:49:52 gregor doesn't have that problem; he doesn't have a brain 09:50:15 ais523: btw, you use clone(). wouldn't unshare() do? 09:50:20 elliott: as for that bug, removing the call to drop permissions from the main process would fix it, but I don't feel comfortable running a bunch of stuff as root 09:50:29 elliott: I suppose so; this was invented before unshare became commonly available 09:50:38 ais523: wait, how old is this program? 09:50:38 and I don't see why you wouldn't use clone rather than unshare 09:50:46 not that old, but I have an old OS 09:51:06 that only very slightly postdates unshare 09:51:16 so it's still it bit experimental in the kernel source I was reading 09:51:34 so, umm, how can I get the flies working without losing the permissions drop? modifying crap in /proc? 09:52:31 possibly, one of the settings there must be different 09:52:44 either that, or let me try to figure out what the offending line is and why it's failing 09:52:51 ais523: I know what the line is 09:52:53 I tracked it down myself 09:53:11 struct stat fdstats; 09:53:11 char procname[] = "/proc/65536/fd/4294967295"; 09:53:11 sprintf(procname, "/proc/%d/fd/%d", ptpid, 09:53:11 (int32_t)ar0.ebx); /* cast for safety */ 09:53:11 if (stat(procname, &fdstats) < 0) { 09:53:24 right 09:53:25 ais523: and the error means that a directory prefix of the statted filename isn't accessible, permissions-wise 09:53:34 ais523: aha, let me guess why 09:53:36 yep, it must be /proc/pid/fd 09:53:40 ais523: the process id involved is owned by root 09:53:42 because web of lies runs as root 09:53:46 (to start with) 09:53:51 elliott: actually, I think it's because it was previously owned by root 09:53:54 but yes, much the right idea 09:53:55 so an unprivileged user can't look at it 09:53:56 right 09:54:04 I take it you can't drop privileges before cloning? 09:54:06 but that happened to me too, and I thought I fixed it 09:54:15 not before the first clone call, which creates fakeinit 09:54:25 because root perms are needed to do things like unshare mount namespaces 09:55:00 however, it drops perms before forking the actual program under test 09:55:19 elliott: idea: does your system have a user numbered 65534? 09:55:27 it could be that the user it drops permissions /to/ doesn't exist 09:55:40 root:x:0:0:root:/root:/bin/bash 09:55:40 bin:x:1:1:bin:/bin:/bin/false 09:55:40 daemon:x:2:2:daemon:/sbin:/bin/false 09:55:40 mail:x:8:12:mail:/var/spool/mail:/bin/false 09:55:40 ftp:x:14:11:ftp:/srv/ftp:/bin/false 09:55:40 http:x:33:33:http:/srv/http:/bin/false 09:55:42 nobody:x:99:99:nobody:/:/bin/false 09:55:44 dbus:x:81:81:System message bus:/:/bin/false 09:55:46 elliott:x:1000:100:Elliott Hird,,,:/home/elliott:/bin/bash 09:55:48 avahi:x:84:84:avahi:/:/bin/false 09:55:50 usbmux:x:140:140:usbmux user:/:/sbin/nologin 09:55:52 ais523: no, but your code comments implied to me that it shouldn't matter 09:55:54 have I been lied to :-( 09:56:00 I don't think it should 09:56:00 (that's the entire contents of my /etc/apsswd, btw; surprisingly short) 09:56:04 but I'm not entirely certain 09:56:19 try setting WOLUSER_UID and WOLUSER_GID both to 99 09:56:19 ais523: want me to create one? 09:56:21 oh, ok 09:56:21 and see if it works then 09:56:34 if not, it's probably not that 09:56:59 (/etc/passwd inside the chroot makes that user exist; but ofc the system as a whole wouldn't care about that version of /etc/passwd, I just don't get why it would care at all) 09:57:00 doesn't fix the problem 09:57:12 I'm not sure whether to say "good" or "bad" 09:57:18 that was my reaction, too 09:57:21 I want to find the problem, but I'm glad that doesn't fix it 09:57:30 heh 09:57:39 ais523: I could run weboflies under gd... what am I saying, of course I can't 09:57:49 you can try, it's hilarious 09:57:55 but no, probably a bad idea 09:58:18 [elliott@dinky weboflies]$ sudo gdb ./weboflies 09:58:18 sudo: gdb: command not found 09:58:28 new machines always surprise me for at least two months after I set them up 09:58:32 on a regular basis 09:58:37 like, how have I not realised I don't have gdb before now? 09:58:45 can you run it as a regular user? 09:58:57 nope, I just haven't installed gdb yet! 09:59:17 the second clone is definitely after dropping perms 09:59:47 it might be worth looking at the perms in question yourself; stick a getchar() or something in just after the error message so that the processes stick around long enough to look at them 10:00:05 = ERROR: ptrace trace self: Operation not permitted 10:00:05 --gdb 10:00:11 then it dumps me at the web of lies console 10:00:14 first time i've seen it, actually :) 10:00:17 that seems about right 10:00:33 it might be worth looking at the perms in question yourself; stick a getchar() or something in just after the error message so that the processes stick around long enough to look at them 10:00:34 OK 10:00:40 ais523: can I printf at that point in the code? 10:00:44 it would be useful to see the pid 10:00:45 should be fine 10:00:50 I suppose I could just ps, but 10:00:54 may be better to fprintf to stderr 10:00:56 ais523: aaugh, I can't escape the gdb :) 10:01:06 elliott: try double-tapping control-C 10:01:14 and if that fails, try control-\ 10:02:20 -!- elliott has quit (Read error: Connection reset by peer). 10:02:20 -!- elliott_ has joined. 10:02:23 umm 10:02:29 i killed the gdb'd weboflies 10:02:38 and got a kernel panic for trying to kill init... 10:02:39 oh no, you didn't use sigkill, did you? 10:02:51 no, I literally just "sudo killall gdb" 10:02:59 wow 10:03:00 how... how is that even possible? it's not even the /real/ pid 1! 10:03:25 this is weboflies! 10:03:29 :D 10:03:47 ok, so... 10:03:49 where were we? :P 10:03:51 (note that a kill -9 on weboflies itself is nearly always a bad idea) 10:04:07 elliott_: adding a printf and getchar statement to the /proc/pid/fd check in icotl 10:04:10 *ioctl 10:04:14 ah, yes 10:05:30 [elliott@dinky weboflies]$ sudo ./weboflies true 10:05:31 Password: 10:05:31 = ERROR: stat proc/pid/fd: Permission denied 10:05:31 /proc/783/fd/4 10:05:34 780 pts/0 00:00:00 sudo 10:05:34 781 pts/0 00:00:00 weboflies 10:05:34 782 pts/1 00:00:00 weboflies 10:05:35 783 pts/1 00:00:00 weboflies 10:05:46 [elliott@dinky weboflies]$ ls -l /proc | grep 783 10:05:46 dr-xr-xr-x 8 65534 65534 0 Nov 4 10:04 783 10:06:04 [elliott@dinky weboflies]$ ls -l /proc/783/fd 10:06:04 ls: cannot open directory /proc/783/fd: Permission denied 10:06:09 [elliott@dinky weboflies]$ ls -ld /proc/783/fd 10:06:09 dr-x------ 2 root root 0 Nov 4 10:04 /proc/783/fd 10:06:18 ais523: so, the permissions on the process itself change properly, but not the fds 10:06:21 I keep grouping that as "webo-flies". 10:06:23 is this some effective/real uid problem? 10:06:30 fizzie: Yes, like olsner. 10:06:40 elliott_: all four UIDs are set to the same value, so I don't think so 10:06:57 I'm using setresuid 10:06:57 ais523: well, the order could matter, for changing the permissions on /proc 10:07:04 why don't you check the ownership on 781 and 783? 10:07:20 the order is "simultaneously", because I'm using setresuid 10:07:33 which is designed for avoiding race conditions in changing UIDs simultaneously 10:07:35 [elliott@dinky weboflies]$ ls -ld /proc/781{,/fd} 10:07:35 dr-xr-xr-x 8 65534 65534 0 Nov 4 10:04 /proc/781 10:07:35 dr-x------ 2 root root 0 Nov 4 10:04 /proc/781/fd 10:07:35 [elliott@dinky weboflies]$ ls -ld /proc/782{,/fd} 10:07:35 dr-xr-xr-x 8 65534 65534 0 Nov 4 10:04 /proc/782 10:07:35 dr-x------ 2 root root 0 Nov 4 10:04 /proc/782/fd 10:08:04 perhaps your kernel just doesn't like looking at even your own fds? 10:08:14 check an ordinary elliott-owned process, like your shell or something 10:08:19 [elliott@dinky weboflies]$ ls /proc/self/fd 10:08:19 0 1 2 3 10:08:27 [elliott@dinky weboflies]$ ls -ld /proc/self{,/fd} 10:08:27 lrwxrwxrwx 1 root root 64 Nov 4 10:00 /proc/self -> 834 10:08:27 dr-x------ 2 elliott users 0 Nov 4 10:07 /proc/self/fd 10:08:32 wow, how is that the other way around? 10:08:38 oh, /proc/self is a symlnik 10:08:39 symlink 10:08:42 yep 10:08:48 and symlinks don't have useful perms 10:08:50 [elliott@dinky weboflies]$ ls -ldH /proc/self{,/fd} 10:08:51 dr-xr-xr-x 8 elliott users 0 Nov 4 10:08 /proc/self 10:08:51 dr-x------ 2 elliott users 0 Nov 4 10:08 /proc/self/fd 10:08:56 ais523: I was thinking of the owner 10:08:57 * Sgeo|web is undecided whether to remove Calibre from his Windows system out of .. protest? 10:09:07 Well, that wouldn't actually do anything other than inconvience me 10:09:12 Sgeo|web: how about out of: "I don't want to get my system compromised" 10:09:24 s/that wouldn't/I'm foolish enough to believe that wouldn't/ 10:09:28 elliott_: how is a suid executable a security hole on Windows? 10:09:37 ais523: you trust that guy to write /any/ software? 10:09:44 aha, I see what you mean 10:09:50 ais523: I'm sure Sgeo|web's user has quite sufficient permissions to destroy lots of files he cares about 10:10:27 the calibre bugs struck me as being from someone who didn't realise the possibility of malicious input 10:10:39 which is typically reasonably safe on a single-user system that doesn't expose network access 10:11:04 This person is assuming single-user 10:11:06 I think he just thinks that it's not serious, because he can't conceptualise a root hole as serious on a desktop machine 10:11:26 so he thinks people are just bullying him for no reason, and won't remove features because of it 10:11:31 elliott_: well of course it can be (in case someone gets in from outside) 10:11:35 doesn't make it any less of a worrying attitude, ofc 10:11:36 but it's not as serious as on a multi-user system 10:12:33 ais523: wow, chmod works in /proc 10:12:39 erm 10:12:40 chown 10:12:45 unfortunately, it just either fails because of not having permissions, or silently fails 10:12:55 I was thinking weboflies could chown its /proc/blah/fd before dropping perms :) 10:12:56 Did you read the most recent things on the bug report? Someone stated that the exploit still works, and Kovid seems to be assuming it doesn't work just because his directory structure is different or something 10:13:07 quite a lot of weird things end up silently failing on /proc, due to not being implemented for procfs 10:13:12 elliott_: try sudo -u god 10:13:14 Sgeo|web: I don't really care what he thinks, because he's been wrong about fifty times so far 10:13:20 elliott_: oh wait that's not actually a thing? shit... 10:13:23 that explains a lot. 10:13:29 elliott_: I'm saying this is probably the 51st 10:14:04 https://bugzilla.redhat.com/show_bug.cgi?id=651183 ;; wow, not even the FUSE people can write a safe suid binary 10:14:54 The only safe suid binary is the unlinked suid binary. 10:14:54 -!- Vorpal has joined. 10:15:09 (Old saying of the jungle.) 10:15:17 "I'm glad you've restricted /dev to block devices only. Standby and I will update the exploit for this latest fix of yours." 10:15:17 s/the unliked/a dead/ 10:15:21 fizzie: Don't say that -- I gotta write one. :/ 10:15:37 what would happen if you did chmod u+s true? 10:15:39 Thankfully it should just set UID + chroot. 10:15:55 ais523: exploits would become ten times more fun 10:16:03 hmm, distros should do that, it would be entertaining 10:16:10 just setuid a bunch of really innocuous binaries 10:16:14 Oh, I misunderstood what was said, n/m my comment about Kovid's thoughts 10:16:19 I'd be surprised if true had exploits 10:16:19 can you find a hole in gnu echo? I wouldn't be surprised 10:16:21 even the GNU version 10:16:29 ais523: it uses their internationalisation stuff 10:16:34 oh right 10:16:35 that could amount to quite a lot of code 10:16:36 wait, what? 10:16:38 `run file `which true` 10:16:40 ais523: for the help text, I think 10:16:41 ​/bin/true: ELF 64-bit LSB executable, x86-64, version 1 (SYSV), dynamically linked (uses shared libs), for GNU/Linux 2.6.18, stripped 10:16:48 elliott_: "true --help" doesn't print anything 10:16:56 which is in keeping with the way true generally behaves 10:16:57 ais523: that's not gnu true 10:17:00 $ /bin/true --help 10:17:00 Usage: /bin/true [ignored command line arguments] 10:17:00 or: /bin/true OPTION 10:17:00 Exit with a status code indicating success. 10:17:02 that's bash true 10:17:03 `run true --help 10:17:05 No output. 10:17:06 [elliott@dinky weboflies]$ /bin/true --help 10:17:06 Usage: /bin/true [ignored command line arguments] 10:17:06 or: /bin/true OPTION 10:17:06 Exit with a status code indicating success. 10:17:06 --help display this help and exit 10:17:06 --version output version information and exit 10:17:07 right 10:17:08 NOTE: your shell may have its own version of true, which usually supersedes 10:17:08 Oh 10:17:10 the version described here. Please refer to your shell's documentation 10:17:12 for details about the options it supports. 10:17:14 Report true bugs to bug-coreutils@gnu.org 10:17:16 GNU coreutils home page: 10:17:18 what would happen if you did chmod u+s true? <-- well, true is not written to run as suid, so there might be security holes. My guess however is that for true it wouldn't actually do much. Not a lot you can do with that tool 10:17:18 General help using GNU software: 10:17:20 For complete documentation, run: info coreutils 'true invocation' 10:17:22 I had to flood that because I couldn't believe how long it was 10:17:25 yep, just found it 10:17:40 elliott_: "long", it doesn't even include a GPL copy. 10:17:44 true... bugs? 10:17:59 "true isn't being true!" "okay... now it is" 10:18:01 http://git.savannah.gnu.org/cgit/coreutils.git/tree/src/true.c 10:18:02 Hasn't there been updates to true or something? 10:18:02 heh, the info page mentions that doing something like "./true --version >&-" causes it to return false 10:18:12 setlocale (LC_ALL, ""); 10:18:12 bindtextdomain (PACKAGE, LOCALEDIR); 10:18:12 textdomain (PACKAGE); 10:18:17 juicy exploit vectors 10:18:21 version_etc (stdout, PROGRAM_NAME, PACKAGE_NAME, Version, AUTHORS, 10:18:21 (char *) NULL); 10:18:21 this too 10:18:58 ais523: any ideas wrt weboflies? 10:19:17 ugh. true should literally be int main(void) { return 0; } 10:19:20 not really; on my system I can't read fakeinits fd's, but I can read those of the program under test 10:19:26 well maybe EXIT_SUCCESS 10:19:28 but whatever 10:19:31 "In this instance, the names of the object files would be chosen by automake; they would be false-true.o and true-true.o." --automake manual 10:19:36 Vorpal: They use the same code to generate both true and false. 10:19:46 fizzie, heh 10:19:58 #if EXIT_STATUS == EXIT_SUCCESS 10:19:58 # define PROGRAM_NAME "true" 10:19:58 #else 10:19:58 # define PROGRAM_NAME "false" 10:19:58 #endif 10:20:09 elliott_: one of C-INTERCAL's temporary files is called oil-oil.c for this reason 10:20:13 oh well 10:20:29 (EXIT_STATUS defaults to EXIT_SUCCESS; false.c just #defines that and #include "true.c".) 10:20:48 Huh, what's with true-false.o and oil-oil.c? 10:21:03 Copyright (C) 1999-2003, 2005, 2007-2011 Free Software Foundation, Inc. 10:21:12 huh 10:21:16 Sgeo|web: to allow for multiple files being generated from the same source file 10:21:54 ais523: 2004 and 2006 would have been prime years to steal rights to that code, apparently. 10:22:11 oh right, .Po means dependencies, .po means internationalisation code 10:22:24 CakeProphet: those are years in which is wasn't changed, I guess 10:22:30 I'm more worried about all the years in which it was 10:22:34 yeah 10:22:36 scares me too 10:24:46 ais523: what if I... disabled file permissions checks? 10:24:55 > [1..3, 5, 7..11] 10:24:56 : parse error on input `,' 10:24:56 you can do that? 10:25:03 ^^ that should be a thing 10:25:21 !perl print (1..3, 5, 7..11) 10:25:33 slow 10:25:34 egobot is apparently perlless for some reason. 10:25:37 try `runperl 10:25:39 !help 10:25:40 ​help: General commands: !help, !info, !bf_txtgen. See also !help languages, !help userinterps. You can get help on some commands by typing !help . 10:25:40 https://bugs.launchpad.net/calibre/+bug/885027/comments/33 is this a joke or is a person who knows how to compile C code really this stupid? 10:25:44 which elliott totally forgot to delete (shhhh don't tell him) 10:25:47 !help languages 10:25:48 ​languages: Esoteric: 1l 2l adjust asm axo bch befunge befunge98 bf bf8 bf16 bf32 boolfuck cintercal clcintercal dimensifuck glass glypho haskell kipple lambda lazyk linguine malbolge pbrain perl qbf rail rhotor sadol sceql trigger udage01 underload unlambda whirl. Competitive: bfjoust fyb. Other: asm c cxx forth sh. 10:25:56 `runperl print 1 10:25:58 1 10:25:58 heh, why is perl in the eso list? 10:26:06 `runperl print (1..3, 5, 7..11) 10:26:08 12357891011 10:26:30 ais523, obviously a reference to the Perl article on the wiki 10:26:32 > concat [enumFromTo 1 3, [5], enumFromTo 7 11] 10:26:34 [1,2,3,5,7,8,9,10,11] 10:26:35 ais523: In 2009 they made it only call the local stuff when argc == 2; in 2008 they switched VERSION to Version (changed ~every app) and marked the description strings with N_ for translation; in 2007 they used a new emit_bug_reporting_address () helper instead of doing it manually, and changed GNU_PACKAGE to PACKAGE_NAME; in 2003 they changed the format of the AUTHORS macro. 10:26:43 Sgeo|web: gross 10:26:56 CakeProphet: I'm not an elegant Haskell writer 10:26:57 ais523: So it's mostly changes in the boilerplate that touch every app in there. 10:27:06 s/local/locale/ 10:27:09 that would make sense 10:27:34 > concat [[1..3], [5], [7..11]] 10:27:35 :t enumFromTo 10:27:35 [1,2,3,5,7,8,9,10,11] 10:27:36 forall a. (Enum a) => a -> a -> [a] 10:27:40 ah 10:27:52 fizzie: ais523: in 2003, they fixed a minor bug in which the value "true" was expected to return was mistakenly calculated as 4 10:28:03 "minor" bug? 10:28:09 returning true is the entire point of true 10:28:12 and 4 is a false value 10:28:17 ais523: Well, it's only four off. 10:28:19 in UNIX return codes 10:28:23 elliott_: Linky? 10:28:41 Sgeo|web: is this a joke or is a person who knows how to compile C code really this stupid? 10:28:46 elliott_, how did that bug ever slip past them? After all it wouldn't actually have worked at all 10:28:55 >_< 10:29:19 elliott_: I don't know, it hits the law of trolling and incompetence being indistinguishable past a certain point 10:29:29 * Sgeo|web is now under the impression that elliott_ was joking 10:29:32 ais523: the designers of true clearly followed the famous maxim to the highest degree: "A good value for k would be around 2, e.g., k = 1.9." 10:29:57 does this maxim work regardless of what k means? 10:30:35 ais523: well, it didn't make any sense in context either, so I have to assume so 10:30:56 AFAICT, they needed to add about four words to the paper :) 10:31:10 I suppose "would be around 2, e.g., k = 2." was deemed too obvious 10:31:50 elliott_, which paper is that from? 10:31:56 one of the Nix ones 10:31:59 ah 10:32:34 elliott_: hmm, the top proggit comment on calibre is pretty interesting, it's about how the calibre dev doesn't seem to understand that he can depend on things that aren't installed in a distro by default 10:32:42 because the whole point of a distro is resolving dependencies 10:32:53 ais523: I think that's stupid; it's fairly obvious what he meant 10:32:58 "I don't want to depend on /more/ things" 10:33:08 "installed by default on Gentoo" is being used to mean roughly "once you install a desktop" 10:33:13 in which case things like gtk will be there 10:33:14 XMLfuck would simply be an implementation of brainfuck using XML, allowing simple universal transport of brainfuck programs, without the need for complex encodings, as well as allowing it to be processed with a single XSLT to pretty-print or even execute the program. 10:33:18 what 10:33:21 something like pmount won't be, because gentoo doesn't dot his whole "infrastructure" thing :p 10:33:33 ...it's a very stupid point, but it's not quite as stupid as "I don't understand dependencies" 10:33:42 ais523: especially since his whole argument is that this is from the binary tarball version 10:33:46 and the distro packages replace them 10:33:51 so dependencies /aren't/ being handled 10:33:53 doesn't brainfuck itself allow simple universal transport of brainfuck programs? :P 10:34:05 ais523: the fact that he ships binaries of all his /other/ dependencies doesn't seem to have occured to him 10:34:11 elliott_: aha 10:34:19 "binary tarball version" 10:34:24 I think I've found TRWTF there 10:34:34 well, not to say it isn't in the source distro too 10:34:37 shipping binaries should be the distro's responsibility, if it's done at all? 10:34:43 but he claims it only /matters/ for that because debian et al. replace it 10:34:54 Hey, it's good for Linux From Scratch people... except they'd presumably use the source version 10:34:59 ais523: actually, I think he might not view pmount or whatever as a solution because he thinks people are complaining that he's not competent enough to write suid stuff 10:35:00 -!- hagb4rd has joined. 10:35:13 ais523: after all, he said he ~couldn't be trusted to modify pmount~ after someone suggested he use it 10:35:13 elliott_: well, he isn't 10:35:16 well, he isn't 10:35:17 oh, of course not 10:35:18 snap 10:35:29 but the point is that, why would that stop people complaining, from that warped point of view? 10:35:39 Why would he need to modify pmount? 10:35:39 and I don't think pmount would need modification, it was being suggested for that reason 10:35:42 AFAICT, he thinks they're complaining that he's shipping a suid binary and is untrustworthy 10:35:55 that suid binary being pmount wouldn't change that fact 10:36:00 Sgeo|web: ais523: exactly, it wouldn't 10:36:11 which is why it only makes sense if you figure out what his actual motivations behind saying that are 10:36:21 ...unless he really just has no idea how he would replace it with pmount :) 10:36:24 which is perfectly possible too 10:36:34 have I mentioned pmount is supposedly deprecated? layers!! so many layers!! 10:36:43 Anyone want to tell him that it's not whether he's malicious or not that's in question? 10:37:01 you want to talk to him? be my guest 10:37:08 you may find the experience unpleasant 10:38:45 I'm not comfortable saying "You wouldn't need to modify pmount" since I don't in fact know anything whatsoever about pmount or his use case 10:38:53 So I think I'll stay quiet 10:43:44 "That's a wierd mixture of types in that struct, I mean long and uint32, one of them has a fuzzy size (4 or 8 bytes, depending on the compiler), the other is clearly defined. Generally, I never ever use "long" as a type." 10:43:56 terrifying 10:45:19 elliott_, what? 10:45:39 long and uint32_t have different purposes, right? 10:45:48 elliott_, is that from the suid fiasco thread? 10:45:51 "long" just means "I need this to be at least 32 bits" 10:45:53 Vorpal: nope 10:46:01 elliott_, then from where? 10:46:11 ais523: context: this is somebody commenting on the virtualdub blog, so the context is both "gritty" hand-optimised C, and Windows 10:46:24 ais523: what I am learning: I am terrified of people who actually write C 10:46:25 aha 10:46:28 (as opposed to being good C programmers) 10:46:39 I mean... they avoid long... because it has a "fuzzy" size... 10:46:39 elliott_: if you aren't constantly terrified of C, you're doing things wrong 10:46:40 are there good C programmers? 10:46:42 * ais523 is doing things wrong 10:46:46 it's... 10:46:50 do they have a /concept/ of portability? 10:47:01 ais523: oh, I am 10:47:08 ais523: why do you think I avoid writing it? 10:47:10 elliott_: I've tried to teach people C 10:47:21 elliott_, the concept of portability in C is painful enough that most people ignore it when writing anything more advanced than a "hell world" 10:47:23 hello* 10:47:26 hell world 10:47:30 elliott_, exactly 10:47:43 mcmap runs on, like, at least three platforms. 10:47:46 I bet it even runs on IRIX> 10:47:48 or HP-UX! 10:48:03 elliott_, sunos with NEWS? 10:48:08 no. 10:48:10 aww 10:48:53 Vorpal: I typically care about portability in C 10:48:57 except on the Secret Project 10:49:04 there's even a comment on the #define _GNU_SOURCE 10:49:15 which shows clearly that I was thinking "hell, this is unportable enough anyway, may as well go all the way" 10:49:23 elliott_, classical MacOS? NeXTSTEP? 10:49:27 http://www.reddit.com/r/programming/comments/lxfxb/use_haskell_instead_of_c_or_fortran_for_high/ <-- challenge: find a good comment here 10:49:40 generalised challenge: find a good comment on anything (a) to do with haskell, (b) in /r/programming 10:49:40 challenge accepted 10:49:41 ais523, portability to other POSIX or to all C platforms 10:50:23 I mean, it isn't really painful to be portable to other POSIX. 10:50:47 it's easy to be portable to posix + windows 10:51:08 ais523: But is "long" closer to "int_least32_t" or "int_fast32_t"? I would guess the latter, since the former is explicitly defined so that there can be no smaller types at least 32 bits wide, while the latter is just very vaguely "fast". 10:51:10 Vorpal: normally I decide what level of portability I want based on what I'm doing 10:51:12 elliott_, as long as you use a toolkit for your GUI needs that support both yes 10:51:19 yeah every program has a gui 10:51:30 elliott_, well if one exists obviously 10:51:37 elliott_, and most programs on windows have GUIs 10:51:41 if I'm doing something that can reasonably be written in portable C89/C99, I do 10:51:44 but now throw in classical MacOS in that. Have fun. 10:51:54 but often I'm not 10:52:29 ooh, I have an idea for an increasing clock that wouldn't be prone to scheduler issues 10:52:34 elliott_: found a good comment: "C is simple until you try to do anything nontrivial in it." 10:52:36 oh? 10:52:36 why not just use thread-local storage for the counter? :) 10:53:07 elliott_, probably will work if make split the job between threads in a deterministic way I guess? 10:53:16 jobs* 10:53:24 who cares if it doesn't? i doubt it checks for anything other than clock going backwards 10:53:37 pretty sure -j uses fork() btw 10:53:43 hm okay 10:53:44 " imperative programs correspond to certain forms of adversarial games." 10:53:53 * Sgeo|web is curious about that 10:55:05 Sgeo|web: oh dear 10:55:16 I hate that terminology, and think it's rather misleading 10:55:35 here, "adversarial" means "has more than one player", not "players are trying to prevent each other winning" 10:55:36 elliott_: this might be a good comment: http://www.reddit.com/r/programming/comments/lxfxb/use_haskell_instead_of_c_or_fortran_for_high/c2wzf5b 10:56:30 CakeProphet: that's a totally offtopic flamewar :p 10:56:51 elliott_: YOUR CRITERIA SAID TO FIND A GOOD TOPIC THERE 10:56:58 CHALLENGE ACCEPTED AND WON. 10:57:05 http://www.reddit.com/r/programming/comments/lxfxb/use_haskell_instead_of_c_or_fortran_for_high/c2wehnw is there a good response to this? 10:57:20 ais523: software hate of the day: gnu make has no way to turn off clock skew warnings. like, at all. 10:57:41 elliott_: they obviously anticipate someone trying to hack time. 10:57:46 +didn't 10:57:47 /however/, I think I can avoid it 10:58:05 elliott_, that is because they serve a purpose. If there is clock skew things are likely to break 10:58:26 Vorpal: yeah, keep whining all you want, but I ran bash under that jail and absolutely everything works fine 10:58:36 configure doesn't complain at all 10:58:37 elliott_, anyway I spotted an issue with the TLS solution. 10:58:40 * CakeProphet writes a command line utility in which every line of code has an attached option that conditionally turns it off. 10:58:42 make works fine and just prints a few stupid warnings 10:58:48 bash works perfectly 10:59:38 now to see if the fine people in #make will help me figure out how to make make work with files made before make was made 10:59:40 elliott_, what if job a builds foo.c from foo.y, then another job ends up building foo.o from foo.c later on. Will foo.o always have a newer timestamp toan foo.c? 10:59:52 than* 11:00:08 Vorpal: it will have the same timestamp. other things that can cause this: foo.o being built in the same second as foo.c. 11:00:12 hardly unlikely. computers are fast. 11:00:29 also supply a string argument to the option substitutes that line of code with the given code. so then when someone reports a bug I can just say, "Oh, you're just using the full capabilities of the command line options. see the man page." 11:00:30 elliott_, hm I thought there were sub-second timestamps these days, oh well 11:00:40 Vorpal: gnu make relies on a system with sub-second timestamps? 11:00:44 Access: 2011-11-03 13:45:55.172384014 +0100 11:00:44 Modify: 2011-11-03 13:45:47.960263808 +0100 11:00:44 Change: 2011-11-03 13:45:47.964263870 +0100 11:00:44 +not 11:00:46 elliott_, nope 11:00:53 my brain hurts for some reason. 11:01:00 -!- ais523 has quit (Remote host closed the connection). 11:01:10 /* FAT filesystems round time to the nearest even second! 11:01:11 Allow for any file (NTFS or FAT) to perhaps suffer from this 11:01:11 brain damage. */ 11:01:18 heh 11:01:35 file->low_resolution_time = 1; 11:01:35 OH COME ON, just assume everything is low-resolution 11:01:42 hmm 11:01:44 what if I used -B? 11:01:54 I don't need any update logic to be done 11:02:13 That's 2-second resolution, which seems unusually low 11:02:26 elliott_, I remember that causing an infinite loop with that once 11:02:49 Deewiant: that's fat for you 11:02:56 elliott_, anyway if same-second is okay then unpacking source @0 and building @1 should work okay, no? 11:03:05 elliott_: I meant that assuming that in all cases might not be entirely sane 11:03:11 Vorpal: yes, but 1 is an ugly timestamp 11:03:18 Deewiant: Yeah but it would help here :-( 11:03:23 elliott_, *shrug* 11:03:32 Vorpal: and make sets timestamps <1970 to the epoch 11:03:36 which sucks 11:03:40 maybe i'll patch make 11:03:43 *shr* 11:03:44 shrug* 11:04:03 `log Feather 11:04:19 `log Feather 11:04:29 O(n) is slowwwwwww 11:04:32 2008-09-07.txt:20:36:00: I mean, Feather makes me go "wow" 11:04:37 2010-12-13.txt:19:53:53: ais523: Feather revision control system: every change is applied retroactively, so there are no changes to track. Problem solved! 11:04:45 elliott_, I don't see the issue with @1 not being all zeros. Only someone with some weird sort of OCD or something would have an issue with that... 11:04:57 `log Feather 11:05:02 2011-07-30.txt:07:07:32: Feather and @ are fundamentally incompatible, as far as I can tell 11:05:05 `log Feather 11:05:07 CakeProphet, doesn't it work in /msg? 11:05:10 2009-10-07.txt:15:50:42: hmm... Feather's the only language I know in which you have to worry about portability within a program 11:05:12 because this spam is annoying 11:05:58 Deewiant: Seems that they wanted to squeeze the timestamp into two bytes, and sadly 86400 > 65536. 11:05:58 it's four lines, hardly spam 11:06:08 8! 11:06:10 Vorpal: the epoch is a far nicer timestamp than @1 11:06:15 changing it later will require a rebuild of all packagse 11:06:19 patching make is the nicset solution 11:06:24 elliott_, ... OCD 11:06:36 Vorpal: paranoid schizophrenia 11:06:41 hah 11:06:59 sorry, this is the "assign mental illnesses based on how people waste time on their computers" game, right? 11:07:18 nope 11:07:27 fizzie: They could have made it have 2-second granularity before noon and 1-second after 11:07:41 heh 11:08:01 Deewiant: Indeed, that would make the most sense ever in the history of things that make sense. 11:08:28 if (! (s <= FILE_TIMESTAMP_S (ORDINARY_MTIME_MAX) 11:08:28 && product <= ts && ts <= ORDINARY_MTIME_MAX)) 11:08:28 { 11:08:28 char buf[FILE_TIMESTAMP_PRINT_LEN_BOUND + 1]; 11:08:28 ts = s <= OLD_MTIME ? ORDINARY_MTIME_MIN : ORDINARY_MTIME_MAX; 11:08:29 file_timestamp_sprintf (buf, ts); 11:08:30 error (NILF, _("%s: Timestamp out of range; substituting %s"), 11:08:32 fname ? fname : _("Current time"), buf); 11:08:34 } 11:08:36 *sigh* 11:08:38 fizzie: Time goes slower before lunch. 11:09:46 ./make.h:#define FILE_TIMESTAMP uintmax_t 11:09:49 oh come /on/ 11:09:54 how hard can it be to handle 1969? 11:10:25 heh 11:11:08 tell me not to mail the gmake lists about this as a bug 11:11:18 "hi, i have some files on a legacy system. ..." 11:11:31 I think touch(1) should require root perms 11:11:38 elliott_, why 11:11:40 just to stop people accidentally touching a really ancient file 11:11:43 those bits are precious 11:11:48 ... 11:11:56 can you imagine like 11:12:07 the last unmodified file from the original unix development 11:12:10 timestamp in the 70s 11:12:22 someone accidentally opens it in their editor 11:12:25 which saves it automatically 11:12:36 fuck! you just destroyed history! way to go. hope that autosave was WORTH it, jackass. 11:12:36 why would the editor do that 11:12:47 Vorpal: why do computers do half the things they do. 11:12:55 MATLAB epoch (though it splits dates and times, and counts days from the epoch in the 'datenum') is 1-Jan-0000. 11:13:03 elliott_, well, for the same reason as they do the other half 11:13:18 Vorpal: right. because someone fucked up. 11:13:29 fizzie: what do matlab archaeologists do 11:13:54 elliott_, I was about to say "because that is what that specific pattern of electrical signals input to the device in question will cause the transistors in it to behave" but sure, your answer works too 11:14:12 Vorpal: yes. electricity is god's fuck-up 11:14:23 wait no, god's fuck-up is the whole universe. 11:14:25 heh 11:14:30 elliott_: All the numbers are doubles, so you can count up to around -2^53 days backwards too. 11:14:36 that's one big fucking fuck-up. 11:14:41 fizzie: heh 11:14:53 Not sure if the conversion functions handle that, though. 11:14:58 fizzie: It even simulates time getting wobblier the further you get to the big bang! 11:15:04 heh 11:15:04 See, it's a feature. 11:15:14 elliott_, but why does it do that for the future too? 11:15:28 Vorpal: Maaan, you haven't heard about the bad news? 11:15:31 >> datestr(-1, 'yyyy-mm-dd') 11:15:31 ans = 11:15:31 9999-12-30 11:15:32 Nobody tell him guys. 11:15:33 It's so sad. 11:15:34 "Uh." 11:15:39 elliott_, heh 11:15:46 I suppose the 'yyyy' format doesn't quite work for that. 11:15:56 #define PARSE_FILE_SEQ(_s,_t,_c,_p,_f) \ 11:15:56 (_t *)parse_file_seq ((_s),sizeof (_t),(_c),(_p),(_f)) 11:15:56 Why, GNU, why. 11:16:12 Why not 11:16:17 elliott_, strange macro indeed 11:16:27 Deewiant: At least put the type parameter /before/ the value! 11:16:48 Maybe it makes sense 11:16:53 Maybe YOU make sense. 11:19:08 Deewiant: Can Solaris make handle timestamps from 1969 11:19:21 I dunno 11:19:26 Deewiant: If yes, I'm gonna build Kitten on top of Solaris 11:19:36 http://en.wikipedia.org/wiki/Epoch_%28reference_date%29#Notable_epoch_dates_in_computing <- that's a lot of epochs. (Also MATLAB is winning.) 11:19:56 elliott_: Give me a one-liner that checks 11:20:21 Deewiant: echo 'bar: foo ; echo yay' >Makefile; touch -d @-1 foo; make bar 11:20:27 (May require better touch(1) than Solaris has to offer) 11:20:50 touch: bad time specification 11:21:09 Deewiant: Does it have a "gtouch"?-) 11:21:14 Deewiant: touch 31-12-1969T23:59:59Z or something. 11:21:18 Erm 11:21:18 -d that 11:21:41 fizzie: Nope :-P 11:21:51 touch: bad time specification 11:22:00 usage: touch [-acm] [-r ref_file] file... 11:22:00 touch [-acm] [-t [[CC]YY]MMDDhhmm[.SS]] file... 11:22:00 touch [-acm] [-d YYYY-MM-DDThh:mm:SS[.frac][Z]] file... 11:22:00 touch [-acm] [-d YYYY-MM-DDThh:mm:SS[,frac][Z]] file... 11:22:00 touch [-acm] [MMDDhhmm[yy]] file... 11:22:26 Deewiant: I'm sure you can write something in that format 11:22:26 % echo 'bar: foo ; echo yay' >Makefile; touch -d 1969-12-31T23:59:59Z foo; make bar 11:22:29 echo yay 11:22:32 yay 11:22:38 No warnings? Sweet 11:22:39 elliott_: Your date string was wrong-endian 11:22:45 Oh, right 11:23:00 (I didn't notice until after I pasted the usage) 11:23:00 fizzie: That Cocoa epoch worries me. 11:23:10 Taking the time part into account too, it was nicely middle-endian. 11:24:13 elliott_, fun fact: A /lot/ of stuff requires gmake to build. 11:24:22 I noticed that when using freebsd 11:24:30 Let's all talk about how Vorpal is actually seriously taking me serious. 11:24:43 Yes Vorpal, I am basing Kitten on OpenSolaris because it lets me use a certain timestamp without warnings and without a clever hack. 11:24:45 elliott_, no I'm not thinking you will use solaris 11:24:53 What's Kitten 11:25:02 Deewiant: Good 11:25:02 elliott_, but I did think you might end up using a bsd make or other non-gnu make 11:25:09 And actually likely to start existing now that I have the complete design down 11:25:12 elliott_: What does it do 11:25:13 (It's not @) 11:25:26 Deewiant: It, uh... distribu...tises? What is the verb that a distribution does. 11:25:40 Vorpal: Nah 11:25:42 Alright 11:25:46 Not to start with at least 11:26:03 Disturbs. 11:26:11 Deewiant: It disturbs. 11:26:41 Deewiant: It's based on a purely functional, source-model, transparent-binary-distribution package, configuration /and service/ manager!! Transparent multilib!! FREE PONY 11:26:43 I think that'd make it a disturbance 11:27:35 Disturbitbutbution. 11:27:42 Disturbi-butt-ion. 11:27:44 Deewiant: Maybe it distempers instead. 11:27:58 A distemperance? 11:28:13 "What's your favourite Linux distemp?" 11:28:14 Yes. 11:28:20 Deewiant: It's the best distemperance. 11:28:45 Windows is my favorite linux disturbi-butt-ion 11:28:47 Have I mentioned: Generic support for subsuming other package managers??? 11:28:49 SO GOOD. 11:29:28 elliott_: is it successfully compatible with all existing systems while allow their software to cooperate seamlessly? 11:29:43 It's actually a cardboard box. 11:29:50 Inside is a kitten. 11:29:59 The kitten makes you forget there was a Linux distro, and also not care because aww, kittens. 11:31:07 "Kitten - the robot's choice." 11:31:07 http://cutekittehs.com/files/2011/08/cute-adorable-kittens-0044.jpg obligatory 11:31:24 CakeProphet, turn on that blender now! 11:31:29 SO TEMPTING 11:31:40 they should do that on "will it blend" 11:31:41 XD 11:33:11 Vorpal: Sorry but you have no soul. 11:33:18 Kitty. Kitty. Kitten I will save you. 11:33:19 There. 11:33:20 All better. 11:33:42 fizzie: OMG please please please write me some (robotfinds)Kitten ads. 11:33:46 Thx 11:33:49 blended cat is the best cat. 11:34:11 for drinks! for parties! go pitapat! go flip-flap! 11:35:23 Vorpal: Sorry but you have no soul. <-- sssh! keep quiet about that! 11:35:54 Super Sexing Shell. 11:36:00 sssh. 11:36:06 XD 11:37:51 It's at least: "bizarre ssh host management" / "super ssh" / "Simplified SGML for Serial Headers" 11:38:07 runCurses :: Curses a -> IO aSource 11:38:07 Put the terminal in graphical mode, including enabling special keys, colors, and mouse events (if supported). 11:38:07 After the Curses block has finished running, the terminal is reset to text mode. 11:38:17 Thanks for putting this at the top of the Haddock documentation, I can discount your ibrary now! 11:38:35 Something wrong? :-P 11:38:53 -!- Phantom_Hoover has joined. 11:38:55 Deewiant: Yeah, the part where it wants me to write my entire IO code in an opaque Curses monad 11:39:20 It's called type-safety 11:39:22 No transformer? 11:39:34 Deewiant: No transformer 11:39:36 It's MonadIO 11:39:38 Deewiant: Because it's literally IO 11:39:41 There was a new Discworld book????? 11:39:42 Phantom_Hoover: You have 2 new messages. '/msg lambdabot @messages' to read them. 11:39:47 Deewiant: And yes, it is; exercise: implement fixIO 11:39:48 How am I this far out of the loop. 11:39:52 erm 11:39:54 Deewiant: And yes, it is; exercise: implement forkIO 11:40:01 Deewiant: Actually let's make it easier 11:40:01 There was a new Discworld book????? <-- which one? 11:40:04 Deewiant: Implement catch 11:40:40 Deewiant: (This is "easy" in the sense of "still actually impossible") 11:40:46 Vorpal, Snuff, apparently. 11:41:04 I missed it too 11:41:04 I only noticed through Pratchett's Facebook page, three days after it was released. 11:41:05 oh well 11:41:13 OK wow hscurses why would you actually reuse ncurses' naming scheme. 11:41:15 That's... that's not a good idea. 11:41:22 vty it is I guess 11:41:34 Even if it does use under_scores 11:41:54 Actually wow these underscores really hurt me inside 11:42:33 At least it's got some nice pure stuff? 11:42:53 elliott_: Just liftIO :: Curses a -> IO a and you don't need to use runCurses? 11:43:08 Deewiant: I don't think you understand what liftIO is 11:43:19 Or how to unify types :P 11:43:21 :t liftIO 11:43:22 Ambiguous occurrence `liftIO' 11:43:23 It could refer to either `Control.Monad.Error.liftIO', imported from Control.Monad.Error 11:43:23 or `Control.Monad.Logic.liftIO', imported from Control.Monad.Logic 11:43:25 Oh, whoops 11:43:28 lambdabot... 11:43:37 heh 11:43:50 But yeah, liftIO is the other way around, duh 11:43:52 Phantom_Hoover, well I ordered the book now. 11:44:21 OItfil :: (oIdanoM m) => m a -> IO a 11:44:42 http://hackage.haskell.org/packages/archive/vty/4.7.0.6/doc/html/Graphics-Vty-Attributes.html#t:MaybeDefault 11:44:45 Gross??? 11:44:56 Why does nobody have any taste 11:45:37 http://hackage.haskell.org/package/vty-ui 11:45:42 This looks promising I guess 11:45:59 Actually no 11:46:03 I don't want any of those widgets 11:46:10 Apatr from a progress bar 11:46:14 s/Apatr/Apart/ 11:46:41 hscurses is the direct binding, makes sense that it reuses the names :-P 11:48:11 Deewiant: The world needs more "direct bindings except we use better names" 11:48:30 The problem with that is difficulty of translation 11:48:34 But sure, it could provide both 11:48:41 It has the helper thing, don't know if that's any good. 11:49:42 I'm just using vty because it has decent-looking docs and is well-maintained :P 11:49:46 Even if it does argh_ugh 11:49:47 -!- boily has joined. 11:49:54 (Technical term(tm)) 11:52:15 -!- derdon has joined. 11:55:27 -!- Phantom__Hoover has joined. 11:56:18 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds). 12:00:54 elliott_: there is someone in #django named Kittens. 12:01:07 I doubt they are actually kittens. 12:01:21 elliott_: you may be surprised! 12:07:24 http://pastebin.com/EdJDazYS 12:07:27 such helpful people on #django 12:07:30 -!- ais523 has joined. 12:08:07 -!- CakeProphet has changed nick to DjangoProphet. 12:09:14 DjangoProphet: He said DjagoProphet. 12:09:20 oh he did. 12:09:28 -!- DjangoProphet has changed nick to DjagoProphet. 12:10:14 Crafty advertising tool, only help people if they agree to change their names to be based on your product. 12:10:50 "The main object. At most one should be created. An alternative is to use unsafePerformIO to automatically create a singleton Vty instance when required." 12:10:50 then ask about their irc client mysteriously. 12:10:55 Why do you DO this to me, guys. 12:11:22 Deewiant: Uuuurgh: terminal_handle :: (Applicative m, MonadIO m) => m TerminalHandle 12:12:12 DjagoProphet: Possibly the IRC client question is another part on their "will we help or not" checklist. If you were using, say, a client written in PHP, they'd be all "no wai". 12:13:13 you know what? 33554432 is an awesome power of 2 12:14:08 that's a power of 2? 12:14:10 yes 12:14:12 32M. 12:14:14 33554432 bytes should be enough for everyone. 12:14:21 2**25 12:14:24 but it doesn't /look/ like a power of two 12:14:30 that's why it's awesome 12:14:34 :( 12:14:37 elliott_: The Applicative, or what? :-P 12:14:39 It's an odd power, though, those are all a bit... odd. 12:15:08 Deewiant: (a) Literally isomorphic to IO TerminalHandle (OK, it can actually not be isomorphic, if you have a completely broken monad, in which case it'll probably do something much less sensible than a single lift) (b) Would it kill you to use liftM/return/ap when you're writing library code 12:15:22 fizzie: We should only use meta-powers of two. 12:15:54 elliott_: I'd prefer it if everything used MonadIO instead of IO: no more lifting 12:16:15 Deewiant: Encouraging monad transformer stacks on top of IO is a very bad idea 12:16:26 PowerTower is the best function. 12:16:29 elliott_: how does a number look like a power of 2? 12:16:35 Not only are they a code smell, they're just plain a pain in the arse to use 12:16:36 cf. catch 12:16:40 Yes, I know of monad-control; it's hideous 12:17:18 fizzie: I agree Tower of Power is an excellent musical group. http://www.youtube.com/watch?v=7LjrCV4Gnxw 12:17:58 elliott_: How should one avoid them; in general most programs are internally largely StateT s IO 12:18:12 Deewiant: s/most programs/most programs written in an imperative language/ 12:18:28 elliott_: No, most programs :-P 12:18:31 Nope 12:18:32 * ais523 vaguely wonders what the correct way to write "a list of 100 1s" is in OCaml 12:18:34 Most programs do I/O internally 12:18:44 It's the StateT part 12:18:50 I could write a helper function, but ideally I'd like to find something in List to do that 12:18:52 it just isn't there 12:19:02 Deewiant: If you want to thread everything through a State monad global, be my guest! (It will be horrible.) Oh, and I hope you never, ever want concurrency! 12:19:04 elliott_: Most programs have the I part of the I/O affect their state in some way 12:19:22 help what's state. 12:19:25 elliott_: I didn't say "everything", I just meant that it'd show up in a lot of places 12:19:28 Best powers of two to use: http://oeis.org/A014221 "0, 1, 2, 4, 16, 65536 ... comments: Next term has 19729 digits." 12:19:38 Deewiant: By saying most programs are (StateT s IO) you're saying that every single component of most programs needs to access and modify every piece of state, and also needs to perform completely arbitrary IO 12:19:46 elliott_: Yeah, that's not what I meant 12:19:55 Deewiant: So if you're right, modular programming is a hopeless task, separating software into components is futile, and functional programming is hopeless 12:20:03 Score one for transformer stacks? 12:20:06 elliott_: Still not what I meant 12:20:24 Deewiant: You might not mean it, but it's what you said; that's what you're claiming by putting all your program in that 12:20:35 elliott_: I said "largely" 12:20:58 elliott_: By which I meant that it'll show up in many if not most of the top-levelish functions 12:21:00 Deewiant: Then what does "largely" make it mean instead 12:21:22 People who use monad transformer stacks don't localise their use to "top-levelish" functions 12:21:23 elliott_: But of course that doesn't mean that every single IO-using or s-using function has to be in the StateT 12:21:28 I've not seen a single person do that, they stuff everything in there 12:21:31 I do :-P 12:21:37 At least nowadays 12:21:40 I don't believe you 12:21:55 And if it's just top-level functions then "MVar s -> IO a" is hardly worse than "StateT s IO a" 12:22:12 Bonus: It isn't a royal pain to make "s" a more specific type for things that only need certain parts 12:22:20 Bonus: You can do concurrency 12:22:31 fizzie: Ha. 12:22:39 Oh, it's just Ackermann. 12:22:50 * ais523 vaguely wonders what the correct way to write "a list of 100 1s" is in OCaml 12:22:54 ais523: does it have an iota operation? 12:22:58 iota : int -> int list 12:23:05 iota 9 = [0;1;2;3;4;5;6;7;8] 12:23:05 or w/e 12:23:20 no 12:23:29 ais523: seriously? 12:23:36 it can't do ranges? 12:24:09 not in Pervasives or List 12:24:25 (which, as we've already established, are the only modules allowed inside the sandbox) 12:24:32 also, those are the most obvious modules for a range operator to be in 12:24:50 isn't this what batteries is for 12:24:58 -!- pikhq_ has quit (Ping timeout: 252 seconds). 12:25:02 -!- pikhq has joined. 12:25:07 btw, I just kicked Wooble 12:25:10 for a legitimate reason 12:25:15 I thought you might be amused 12:25:46 Well, it's the PowerTower[2, n] too, just turns out it's Ackermanny too with the proper definition. 12:26:05 fizzie: is that Mathematica syntax? For shame! 12:26:41 ais523: It's Mathematica syntax because it's a Mathematica function; I don't know any other place that'd call it PowerTower. 12:27:02 hmm 12:27:12 isn't "tetration" the usual name? 12:27:37 Possibly; it's a name for it I've seen, at least. 12:28:06 And the one I was thinking of; but the http://mathworld.wolfram.com/PowerTower.html just mentions it in a somewhat non-prominent way. 12:28:07 Mathematica is actually quite similar to Prolog without the backtracking, internally 12:28:18 which is probably worrying 12:28:18 ais523: Isn't everything Wooble says kickable? 12:28:23 elliott_: no 12:28:30 Are you sure? 12:28:38 he accidentally pasted a hundreds-of-lines-long pastescript into #devnull_nethack, though, and that definitely is 12:28:57 ais523, pastescript? I was wondering what it was supposed to bea 12:28:58 be* 12:29:00 what is it for? 12:29:21 Vorpal: setting autopickup exceptions 12:29:24 aha 12:29:33 devnull turned on APE, but not the ability to configure it via the RC file 12:29:36 so you have to set them in-game 12:29:43 ais523, that sucks 12:30:02 -!- DjagoProphet has changed nick to CakeProphet. 12:30:25 there is no cow level. 12:30:31 CakeProphet, ? 12:30:37 Vorpal: Diablo meme 12:30:38 Does anyone know how to make ncurses use the "primary" screen? 12:30:42 Rather than switching away to the alternate thing. 12:30:49 Blizzard put in a secret cow level in Diablo II as a reference to it 12:30:59 I see 12:31:11 (You guys know what I mean, right?) 12:31:21 the cheat code for god mode in Diablo 2 is thereisnocowlevel 12:31:30 which, surprisingly, disabled the secret cow level. 12:31:44 elliott_, not entirely. 12:31:59 elliott_, do you mean that once you edit the program there is no trace of the stuff it displayed? 12:32:01 Vorpal: Ever noticed how curses prorgams reset your scrollbar? 12:32:02 exit* 12:32:05 elliott_, right 12:32:06 that 12:32:09 And don't leave a trace in your shell session? 12:32:09 yeah 12:32:13 http://www.youtube.com/watch?v=1XAfUcvdhmc 12:32:15 elliott_, no I don't know how 12:32:16 good music. 12:32:17 of course, as befits computer game players, they figured out a way to abuse the cow level for farming massive amounts of exp in multiplayer 12:32:20 I just want to make progress bars. :( 12:32:22 elliott_: StateT s IO doesn't preclude concurrency, you just need to runStateT them and then figure out what to do with the state afterwards 12:32:25 I guess I'll have to roll my own with ANSI? 12:32:26 elliott_, use plain termcap? 12:32:38 wait, why use screen for a progress bar? 12:32:40 ais523: isn't that pretty much its purpose? I don't think it's much of an abuse. 12:32:45 or terminfo rather 12:32:53 elliott_: ansi-terminal 12:32:53 Deewiant: "You just gotta implement your own concurrency strategy; btw hope you weren't expecting shared memory of any kind, or MVar style semantics, or transactions, or ..." 12:33:03 CakeProphet: its purpose is terminal multiplexing; I don't see what that has to do with progress bars 12:33:12 elliott_: Uh? 12:33:17 ais523: `you must have me mistaken with someone else 12:33:20 elliott_: If you want to pass in an MVar, pass in an MVar 12:33:24 elliott_: MVar a -> StateT s IO b 12:33:41 CakeProphet: no, you were talking about screen, so was I 12:33:50 Deewiant: "Most programs" don't have a bunch of state that only gets synchronised when a thread dies 12:33:54 Your scenario is ridiculous 12:34:02 ais523: oh, no I was talking about the secret cow level. 12:34:04 >_> 12:34:08 oh right 12:34:10 elliott_: You're not alone: http://www.shallowsky.com/linux/noaltscreen.html has the termcap/terminfo capability to mess with. 12:34:10 definitely not about progress bars. 12:34:11 wait, why use screen for a progress bar? 12:34:20 ais523: That's not what screen is. 12:34:39 fizzie: Heh. I want to implement this in the program though. 12:34:53 elliott_: I still don't get what you're trying to do, or to tell me 12:34:53 Deewiant: ansi-terminal hasn't been updated for over a year which is worrying 12:35:10 Also it's not exactly the most high-level API 12:35:25 But I guess it'll do 12:35:52 ais523: Do you really want me to bother explaining when the misinterpretation of terminology you made makes the chances of you giving a correct answer ~0? 12:35:59 If you don't know what the alternate screen is, you can't help :p 12:36:00 elliott_: There's wrappers to it 12:36:29 elliott_: oh, I thought you were talking about screen(1) 12:36:37 I do know what the alternate screen is 12:36:43 but I've been having serious problems following your conversation 12:36:47 which implies that I'm misunderstanding something 12:36:49 Deewiant: I see exactly one 12:36:56 elliott_: Maybe they don't have such state, but most programs don't have concurrency in the first place so I can't think of a sufficient amount of examples. But fair enough, most concurrent programs probably should avoid StateT 12:36:59 I'm asking you to explain again in different words in the hope that I understand it the second time 12:37:00 elliott_: Maybe there was only one 12:37:02 ais523: Run curses program; note how it runs on the alternate screen 12:37:04 elliott_: I've only ever used ansi-terminal directly 12:37:08 ais523: Note how all I want is an inline progress bar 12:37:21 Deewiant: It's called AC-Terminal; I think I started ignoring all packages starting with AC- because their author is an amateur or something 12:37:32 Also because there's like fifty of them 12:37:42 elliott_: Yeah fair enough 12:37:44 elliott_: aha, it's to do with curses(3), not with screen(1) 12:37:54 normally when I make progress bars, I just use a bunch of \r 12:38:00 and redraw them each time 12:38:01 ais523: It's not really to do with curses either, I'm asking for a general solution 12:38:04 that works even on dumb terminals 12:38:07 And yes, I am aware one can do progress bars in that manner 12:38:09 But not on Windows 12:38:11 but I'm not sure it's a perfect solution 12:38:14 Obviously telling me that isn't going to actually help :P 12:38:16 Deewiant: Windows doesn't respect \r? 12:38:18 'screen' has a command (termcap/terminfo/termcapinfo) to tweak the current termcap/terminfo entry without going through the hassle of editing any files; if you feel sufficiently motivated, you could check how that's done; presumably by environment variables somehow. (At least for termcap you can just set TERMCAP; don't know about terminfo, though.) 12:38:22 I'll just use ansi-terminal, it does colours and cursor controls 12:38:23 ais523: I'm pretty sure cmd.exe doesn't 12:38:26 ais523: But not entirely 12:38:33 Even if the Windows support is beyond useless to me 12:38:36 elliott_: so what are you trying to do that \r progress bars can't do? 12:39:11 Deewiant: but cmd.exe isn't responsible for rendering stdout, NTVDM is; and I know that at least the old-fashioned conio.h API handles \r just fine 12:39:21 presumably whatever it was replaced with does too 12:39:26 ais523: I'm not looking to get XY Problemed; manually writing out ANSI escape codes and \rs is as ugly and unmaintainable as it is non-portable 12:39:28 wow okay Django has stumped me. 12:39:31 Especially since I already have a solution 12:39:56 elliott_: the amusing thing is, I'm seriously considering to change Ace to hardcode ANSI escape codes rather than using termcap 12:40:03 ais523: NTVDM is the 16-bit emulator, I fail to see how it's relevant 12:40:12 Deewiant: oh, that would explain my results 12:40:13 ais523: Why not terminfo 12:40:20 elliott_: termcap/terminfo/curses/etc 12:40:30 the problem is, they adapt to the terminal you're actually using 12:40:37 which means that the ttyrec might not play back on other people's terminals 12:40:55 and often, the entries in the database are wrong, so they don't even adapt to your own terminal 12:41:10 meanwhile, VT100, and some of the extensions of it, are both standardised and actually work on pretty much all terminals in practice 12:41:20 so hardcoding that seems to work better than using terminal-specific codes 12:41:24 I guess it's a different meaning of "portable" 12:41:29 Deewiant: Barf @ it uses imperative actions to control things like colours; I guess I'll look at ansi-wl-pprint too, which is a wrapper, but I doubt it can do progress bars 12:42:39 elliott_: I think ansi-wl-pprint just has pretty printing with colours and bold and stuff, not the ability to write over earlier text 12:42:53 Deewiant: Technically, System.Console.ANSI doesn't offer that either 12:42:58 Deewiant: You have to use the cursor functions to do that 12:43:13 So I could just print out each progress bar step with the ansi-wl-pprint stuff and use ansi-terminal to overwrite it each time 12:43:13 Well, that /is/ a way of doing that 12:43:22 Do you have another way? :p 12:43:27 Right, I just meant you can't use solely ansi-wl-pprint 12:43:31 Right 12:43:40 Might be overkill for just a progress bars 12:43:42 s/s// 12:43:45 Depends on how much I use this 12:43:51 I can always make a little mini-module of tricks 12:44:01 s/s\//s$\// 12:44:12 'Thanks to Brandon S. Allbery and Curt Sampson for pointing me in the right direction on xterm title setting on haskell-cafe. The 0 signifies that both the title and icon text should be set: i.e. the text for the window in the Start bar (or similar) as well as that in the actual window title. This is chosen for consistent behaviour between Unixes and Windows." 12:44:14 --docs of hCursorUp,hCursorBackward,hCursorForward,hCursorDown 12:44:16 s/'/"/ 12:44:21 These docs are very badly organised 12:49:31 :t round 12:49:32 forall a b. (RealFrac a, Integral b) => a -> b 12:51:05 elliott_: btw, am I mad for using the powers of 2 in lexicographical order as a test input to a sort function? 12:51:11 yes 12:51:13 it seemed to be reasonably interestingly misordered 12:51:46 and hits a few expected corner cases (it's meant to be a bignum sort, and it goes a little over the range of an integer in my 32-bit OCaml impl) 12:52:51 hmm, is it a good idea to connect a wired and wireless network, both designed to go to the Internet at large, simultaneously? 12:52:58 I'm guessing no because they have different proxy settings 12:53:17 blocks :: [Char] 12:53:17 blocks = "▏▎▍▌▋▊▉█" 12:53:17 awwwww yeah 12:53:26 ais523 has no idea how fancy my progress bar is going to be. 12:54:00 ais523, they have proxy settings? 12:54:06 heh 12:54:12 the wired network firewalls everything, including 80 12:54:23 but has an autoproxy to let you access the Web 12:54:24 ais523, so you can't ssh out for example? 12:54:28 (one of the WPAD things) 12:54:28 Or use https? 12:54:34 443 can go through the proxy 12:54:47 25 works too, but only to a few addresses 12:54:50 so man in the middle by default? 12:54:54 yep 12:54:56 ouch 12:55:01 I wouldn't use that network 12:55:09 work network, they're all like that 12:55:20 and I'm surprised firefox doesn't display wrong certificate for the proxy all the time 12:55:34 well, with a work computer, it's in the root CAs 12:55:36 wrong certificate errors* 12:55:39 hm 12:55:49 ais523, I would use the wireless if it is saner 12:55:53 I think it might not decrypt the contents of an HTTPS transmission, though, just check where you're connecting 12:55:58 the wireless is saner except it keeps dropping 12:56:06 hmm, idea 12:56:09 3G 12:56:16 I'm going to connect to https://google.com in Chromium 12:56:29 that is going to use spdy, no? 12:56:36 oh right, I'm on the wireless, ofc it's going to work 12:56:42 and it did just jump to an insecure version 12:56:54 ais523, try https://encrypted.google.com 12:57:07 aha, that works 12:57:15 anyway, chromium has Google's certs hardcoded 12:57:19 *Chromium 12:57:20 ah 12:57:24 gah 12:57:27 this progress bar /almost/ works 12:57:34 so can detect MITMing even with a certificate added by your employer 12:57:39 heh 12:57:44 I'll probably try that next time I'm on the wired 12:57:54 my guess is that the proxy can tell I'm connecting to Google, but doesn't decrypt the contents 12:57:56 I'm not sure, though 12:58:15 who wants to run a program that will make them vaguely worried that their terminal can output such SMOOTH PROGRESS BARS? 12:58:28 everyone. everyone wants that program. 12:58:30 that everyone could be you. 12:58:36 elliott_, it is unicode block characters, isn't it? 12:58:38 *shrug* 12:58:45 Vorpal: yeah, but it's seriously unnerving :P 12:58:52 elliott_, doubtful 12:59:06 Vorpal: see for yourself: http://sprunge.us/IhEb 12:59:42 ais523: it should be incapable of decrypting the contents 12:59:43 > 56345683457823567897543234567 * 9313456789341754124566812142 12:59:44 524773088150368273322823696325607978422660521630529712514 12:59:46 elliott_, does it work on ghc 6.whatever? 12:59:49 sur 12:59:50 e 12:59:54 needs the small ansi-terminal library 12:59:59 too much work 13:00:10 it's in AUR 13:00:19 elliott_, I'm on my ubuntu laptop 13:00:21 also will install in about 5 seconds with "cabal install ansi-terminal" 13:00:44 Vorpal: oh, and apt-get install libghc-ansi-terminal-dev 13:00:49 ^ testcase to determine that a) the library does indeed handle bignums rather than using native ints, b) it multiplies in O(log n), not O(n) 13:00:53 depending on how new the ubuntu is 13:01:04 elliott_, 10.04 LTS 13:01:19 elliott_: what about installing Cabal? or does Ubuntu have that by default nowadays? 13:01:41 ais523: I offered that; Vorpal's just looking for excuses though, so I'm offering as many trivial solutions as possible to antagonise him 13:01:57 elliott_, I'm going to install it, sure 13:02:05 just going to take a while over 3G 13:02:13 elliott_: do Unicode block characters line up perfectly in most terminals? I'm used to them leaving pixel-wide gaps 13:02:14 (I'm not at home atm) 13:02:31 ais523: try the program and see; I've had some alignment issues getting the full thing to work, but the program doesn't suffer from them by definition 13:02:48 elliott_, yeah the package is not in the repo, will check the cabal solution 13:03:01 oh come on: Unicode has every block width going from the left from eighth to whole, but only (a) right one eighth and (b) right half 13:03:06 WHY WOULDN'T YOU JUST THROW THEM ALL IN 13:03:08 WORK WITH ME HERE 13:03:15 ▏▎▍▌▋▊▉█ 13:03:15 ▏▎▍▌▋▊▉█ 13:03:17 yeah, I'm missing System.Console.ANSI; what package is it in? 13:03:22 Lines up for me 13:03:23 libghc-ansi-terminal-dev? 13:03:34 ais523: yes 13:03:37 or just cabal install ansi-terminal 13:03:53 Vorpal: ais523: I'm not sure whether it's more or less unnerving if you take the last 0 off the threadDelay line 13:04:00 (run the program with "runhaskell foo.hs", btw) 13:04:03 the package doesn't exist in this Ubuntu 13:04:15 ais523: cabal install ansi-terminal, then; it'll install into ~/.cabal 13:04:19 elliott_, it tells me I have to cabal update first 13:04:20 and I don't have cabal either 13:04:24 what package is /that/ in? 13:04:27 Vorpal: do that, then 13:04:27 elliott_, this is going to take a while. I'm on EDGE now. 13:04:34 ah, "cabal-install" 13:04:46 ais523: you really shouldn't use debian ghc btw, but *shrug* 13:04:47 Note: there is a new version of cabal-install available. 13:04:47 To upgrade, run: cabal install cabal-install 13:04:50 should I do that? 13:04:52 probably not I guess 13:04:58 elliott_: what should be used instead? and what's wrong with debian ghc? 13:05:06 Vorpal: not unless you want to break everything 13:05:06 Vorpal: that's just what CPAN does 13:05:14 elliott_, right 13:05:18 this implies it may be a bad thing 13:05:25 elliott_, where was the link now again? 13:05:33 Vorpal: in your scrollback 13:05:38 -!- derrik has joined. 13:05:39 elliott_, *shrug* 13:05:56 Vorpal: your choice whether you want to make the cabal-install work a waste or not :) 13:06:03 i'm busy typing a response to ais523, who asked a non-trivial question 13:06:07 $ file foo.hs 13:06:07 foo.hs: UTF-8 Unicode Java program text 13:06:08 heh 13:06:29 elliott_, why is it green? 13:06:40 progress bars are green 13:06:44 elliott_, anyway it is kind of jerky 13:06:46 t.o: In function `sYB_info': 13:06:47 (.text+0x6ac): undefined reference to `ansizmterminalzm0zi5zi5_SystemziConsoleziANSIziUnix_showCursor_closure' 13:06:49 elliott_: in which OS? 13:06:52 ais523: you didn't do what I told you to do 13:07:08 what did you tell me to do? I installed cabal, then did cabal install, then tried to compile with ghc 13:07:12 ais523: the binary package installed manually; and, well, debian/ubuntu ghc /itself/ isn't broken, but it /is/ years old except in the very latest releases; but more importantly, if you install any non-core (= shipped with ghc) libraries with apt-get, then you can't mix it with cabal-installed libraries at all, which is problematic because debian's haskell library set is (a) old (b) incrediby incomplete 13:07:17 ais523: (run the program with "runhaskell foo.hs", btw) 13:07:35 ah, right 13:07:50 -!- sebbu2 has joined. 13:08:05 hmm, it's kind-of jerky due to rounding errors 13:08:16 in Unicode 13:08:24 but it does make a continuous bar in gnome-terminal 13:08:29 -!- sebbu has quit (Ping timeout: 255 seconds). 13:08:34 it's perfectly smooth here 13:08:42 sometimes it moves one pixel, sometimes too 13:08:45 *two 13:08:56 Vorpal, I'm going to guess it's the import statements 13:09:02 aha, because it can't subpixel alias, because it's green 13:09:07 Except for missing a semicolon, they're pretty much identical 13:09:13 it'd be three times smoother if it were white 13:09:15 Madoka-Kaname: and not being lowercase 13:09:21 `addquote aha, because it can't subpixel alias, because it's green it'd be three times smoother if it were white 13:09:23 706) aha, because it can't subpixel alias, because it's green it'd be three times smoother if it were white 13:09:27 *antialias 13:09:28 Well, the syntax is the same. 13:09:31 hmm, probably better with just the second one 13:09:34 `unquote 13:09:37 ​*poof* aha, because it can't subpixel alias, because it's green it'd be three times smoother if it were white 13:09:44 but that isn't funny at all then, so meh 13:09:46 You can have uppercase package names in Java (but it's probs bad practice) 13:09:47 elliott_: but out of context, it's not funny 13:09:58 yep 13:10:01 it just looks like an out-of-context "that's what she said" sort of innuendo 13:10:07 and those aren't generally that funny 13:10:12 ais523: haha omg i just created an unintentional fancy animation 13:10:23 elliott_: you don't normally omg 13:10:26 no but 13:10:27 Madoka-Kaname, hm yeah 13:10:29 this is fun :DDDDd 13:10:30 are you sure you're elliott_? 13:10:34 I wonder why it resulted as "Java" instead of "Python" 13:10:53 Java would have more semicolons 13:11:12 Madoka-Kaname, python tends to not have foo.bar when importing very often at least 13:11:29 from foo import bar 13:11:45 hmm, potentially interesting project: write a really good programming language guesser 13:11:57 that's like what file(1) tries to do, except actually working 13:12:17 ais523, ohcount has a quite okay one in it iirc. It mixes up C and C++ sometimes, but that is actually quite hard to tell apart sometimes 13:12:22 no I'm registered to freenode, if that's what you meant... I have clue what you're saying. 13:12:27 ...mischan. 13:12:39 I too have clue what you're saying. 13:12:40 you would basically have to try to parse it as both C and C++ completely and see which worked (possibly both) 13:13:04 Vorpal: a typical C++ program would contain at least one method call, which would give away that it wasn't C 13:13:15 if you aren't using methods, than what are you doing using C++? 13:13:21 ais523, well for headers it can be less clear I guess 13:13:32 right, headers are often C/C++ polyglots 13:13:40 but in the case of a header, the correct language is "cpp", I suspect 13:13:48 hm 13:14:20 ais523, anyway ohcount gets confused if you have stuff like this in a header: struct foo { int new; ... } 13:14:35 obviously C, it doesn't parse as C++ 13:14:38 indeed 13:14:54 Vorpal: It calls 'struct foo { int new; };' C 13:14:56 ais523, but a simple keyword scanning method to determine if it is C++ or C wouldn't handle that 13:15:10 Deewiant, oh kay 13:15:12 okay* 13:15:15 keyword scanning isn't really the way to go 13:15:23 Deewiant, I distinctly remember an older version didn't handle that though 13:15:24 because languages tend to have similar keywords 13:15:32 I think looking for keyword/punctuation combos would work better 13:15:56 ais523, well iirc it did that to separate C/C++ mostly. And other methods to determine it was one of them in the first place 13:16:13 how does it separate C and C++ from C# and Java? 13:16:22 they look pretty similar keyword-wise too 13:16:25 don't remember 13:16:29 it is open source anyway 13:16:31 C and C++ don't have import. 13:16:33 Right? 13:16:36 It seems to have a parser for all the languages it supports, maybe it just tries to parse as everything and then has some supersedence rules: https://github.com/blackducksw/ohcount/tree/master/src/parsers 13:16:50 Madoka-Kaname: there are C and C++ compilers that accept "#import" as a preprocessor directive 13:17:01 Oh, except no C++ 13:17:01 ais523, but that's easily distinguished from Java imports. 13:17:04 That I can see 13:17:04 #import vs import 13:17:13 right 13:17:27 Deewiant: isn't that because C++ is TC to even parse? 13:17:36 Deewiant, c.rl handles C and C++ it seems 13:17:53 More interesting might be distinguishing Java from Scala from Python using keyword scanning. 13:18:04 what on earth is .rl anyway? 13:18:15 Vorpal: Ragel 13:18:20 Well, Scala's probs a little distinctive with val/var/class/import all at once. 13:18:20 hm 13:18:23 ais523: Depends on what you call the "parse" stage, I guess 13:18:25 I'd imagine Java from Scala would be easy using punctuation 13:18:46 Deewiant, ragel being a parser generator for C? 13:18:49 Scala vs Python should be easy. 13:18:53 The former has curly braces. 13:18:57 ais523: Finding stuff like whether "new" is used as a variable name could be done before the TC part, I think 13:19:23 ais523, Java vs Groovy? 13:19:27 Java vs C#? 13:19:29 Vorpal: A parser generator, at least 13:19:31 I don't know Groovy 13:19:45 Haskell vs Python? 13:19:55 Java vs C# is easiest in practice by looking for getters and setters, the conventions for those are entirely different in the two languages and they're pretty common 13:20:08 Madoka-Kaname: "let" is all over the place in Haskell, not so in Python 13:20:20 ais523, doesn't C# use "using" and java "import" too? 13:20:25 does anyone know how to print a unicode character as high as the line height? :p 13:20:49 elliott_: use a printer? 13:20:52 ais523, Perl vs line noise? 13:20:57 ais523: heh 13:20:59 elliott_: Your blocks :: [Char] were line height for me 13:21:00 Madoka-Kaname: that one is really easy 13:21:05 Deewiant: Not for me :( 13:21:11 line noise doesn't look anything like Perl 13:21:14 have you not seen it before? 13:21:15 =p 13:21:19 Deewiant: It matters because I need to set the background so that partially-filled characters don't have a white background 13:21:25 As opposed to the grey of the rest of the unfilled area 13:21:29 More seriously. 13:21:31 But that leaves an ugly grey line above the bar for me 13:21:37 even obfuscated or golfed Perl tends to gravitate towards particular characters 13:21:49 Deewiant: Not for me :( <-- nor for me, do unicode line drawing characters join up for you 13:21:51 ? 13:21:52 Ah, hey. 13:22:05 Vorpal: That's unrelated. 13:22:21 elliott_: I think you have either a font problem or a line-spacing problem and in either case, you "can't" make it work 13:22:21 elliott_, not if the terminal inserts padding between lines 13:22:28 Deewiant: Right 13:22:31 ais523, would you look at file extensions or shebangs? 13:22:42 Deewiant: So I suppose it will still fail completely if you do the "in suck.h #define BEGIN {, #define END }; in trytofiguremeout.c #include "suck.h", no curly braces at all" thing. 13:22:42 Deewiant: I guess the only solution is to give up my fancy granularity :( 13:22:51 i.e. if extension matches a known language, that language gains supercedance over every other language, if it parses as it 13:23:05 Madoka-Kaname: yes, in practice; I'm interested in the theory of doing without, though 13:24:17 fizzie: Well yes, you can do "anything you want" with CPP, of course 13:24:27 Deewiant: Looks like gnome-terminal has the exact same problem, so I can hardly ignore it 13:25:12 elliott_: Make one-line high bars, or use something like '#' that doesn't even try to look completely filling 13:25:24 Deewiant: One-line high bars? 13:26:17 elliott_, why do you need multiline stuff here? 13:26:25 elliott_: Well, if you have one horizontal bar like ███, it doesn't matter whether it lines up with what's on the next line? Or why did you care about the lining up anyway 13:26:41 In quite a few browsers, in a "font-family: monospace;" 

, mixing "normal text" and Unicode line-drawing characters ends up making the line-drawing bits misaligned badly.
13:26:41  Vorpal: ?
13:26:52  elliott_, why do you care about it being line height
13:27:05  fizzie, ouch
13:27:27  Vorpal: http://zem.fi/rfk86/ suffered from that quite a lot. :)
13:27:31  Deewiant: You don't understand; say I have a progress bar with a grey background, being filled in by green. If I use full blocks of those two colours (ignoring background), everything works fine. But, if I want to use partially-filled blocks, then every partially-filled block will have a space of /normal/ background behind it!
13:27:42  fizzie, works now in firefox, how did you fix it?
13:27:47  Deewiant: So I need to "fill in" that gap with grey somehow; the obvious way is to set the background.
13:28:06  Deewiant: But that causes an ugly grey line to appear above the progress bar, because the background fills the whole line height, including the inter-line padding.
13:28:28  elliott_, so why not leave it at the background colour of the terminal?
13:28:38  Vorpal: You misread.
13:28:39  elliott_: So: don't set the background or don't worry about the grey line
13:28:50  elliott_: it's still not going to work on terminals that render backgrounds and foregrounds differently
13:29:00  elliott_, no I didn't. I'm questioning the need of that grey background
13:29:01  e.g. jettyplay will use a darker shade for, say, "dark red" in the background than it will in the foreground
13:29:14  so you can read text even when the foreground and background are set to the same colour
13:29:19  Deewiant: If I don't set a background at all, it's not, you know, a bar; I'd rather use full blocks than make it ugly in that way. The grey line is really awful.
13:29:21  elliott_, just do a green bar that grows over the natural bg colour of the terminal
13:29:28  Anyway "don't care about it" is not a solution to problems
13:29:46  Yeah, sorry :-P
13:29:53  elliott_: How isn't it a bar if you don't set a background?
13:29:54  elliott_: rather, it's a claim that you don't need a solution to the problem
13:30:07  isn't the usual solution to put [ and ] around the bar to show its endpoints?
13:30:07  ais523: Are such claims interesting
13:30:13  elliott_: ▉█▎looks barry to me
13:30:16  I know I can resort to full blocks if I want
13:30:19  elliott_: no, but they can be correct, sometimes
13:30:27  The idea is to try and figure out if I have to
13:30:33  Vorpal: Well, it should now work in everything that does (and allows) font embedding the way it's done there; and it did work with the "regular" monospace font in *some* systems. But I do recall getting rather ragged right edges from others. I think I added a "DejaVu Sans Mono" before monospace to make it work everywhere where that font is installed, since it has all the characters the page uses.
13:30:37  ais523: I could draw a "normal" ASCII bar, I just think this looks much nicer
13:30:40  Even with full blocks
13:30:43   elliott_: ▉█▎looks barry to me <-- amusing, there is a gap between those in my irc client
13:30:49  Ditto
13:30:51  same in mine
13:30:55  Not for me
13:31:11  You have problematic terminals and/or fonts :-P
13:31:15  fizzie: I've had problems with "Monospace" referring to a non-monospace font in Windows, believe it or not
13:31:23  Deewiant: Who uses an IRC client in a terminal
13:31:25  Losers, that's who
13:31:32  Deewiant: There's a gap in xchat; there's no gap in irssi/urxvt.
13:31:46  fizzie, ah
13:31:50  You have problematic GUI IRC clients
13:32:07  Deewiant: Hmm, the fact that repositioning the cursor causes a forced scroll down in ansi-terminal is problematic
13:32:32  And seemingly not fixable from the provided API
13:32:38  hmm, what's the first power of 2 that, expressed in base 10, starts with 7?
13:32:47 * ais523 wonders how to express that in Haskell
13:33:02  @hoogle Integer -> [Integer]
13:33:02  Test.QuickCheck.Arbitrary shrink :: Arbitrary a => a -> [a]
13:33:02  Test.QuickCheck shrink :: Arbitrary a => a -> [a]
13:33:03  Prelude repeat :: a -> [a]
13:33:06  > map (2^) [0..]
13:33:07    [1,2,4,8,16,32,64,128,256,512,1024,2048,4096,8192,16384,32768,65536,131072,...
13:33:10  @hoogle Integer -> [Int]
13:33:10  elliott_: Is that somehow explicitly done by the implementation?
13:33:11  Data.Time.Calendar gregorianMonthLength :: Integer -> Int -> Int
13:33:11  Data.Time.Calendar.Julian julianMonthLength :: Integer -> Int -> Int
13:33:11  Data.Generics.Schemes gsize :: Data a => a -> Int
13:33:23  elliott_: I'm trying to find a function that list-of-digitizes a number
13:33:31  > find (("7" `isPrefixOf`) . show) $ map (2^) [0..]
13:33:33    Just 70368744177664
13:33:36  ais523: Tada
13:33:38  aha
13:33:42  > find ((== '7') . head . show) $ map (2^) [0..]
13:33:44    Just 70368744177664
13:33:45  that's actually pretty large
13:33:48  Deewiant: That too, but I don't like head :)
13:33:54   elliott_: Is that somehow explicitly done by the implementation?
13:33:57  elliott_: I thought you didn't like using "show" like this :-P
13:34:00  I forgot that Haskell strings were just lists of chars
13:34:02 -!- Patashu has quit (Ping timeout: 240 seconds).
13:34:02  Deewiant: There's gotta be some way to avoid it
13:34:03  Surely
13:34:05  :(
13:34:10  And I don't, but oh well
13:34:19  Nothing is more important than showing people how great Haskell is quickly
13:34:21  (in Ocaml, string, char list, and char array are all different types; string acts like char array, though)
13:34:24  *OCaml
13:34:31  > find (("9" `isPrefixOf`) . show) $ map (2^) [0..]
13:34:33    Just 9007199254740992
13:34:35  elliott_: I'd check the implementation first
13:34:46  > map [0..9] $ \d -> find ((show d `isPrefixOf`) . show) $ map (2^) [0..]
13:34:47    Couldn't match expected type `a -> b' against inferred type `[a1]'
13:34:48  @src Integer show
13:34:49  Source not found. That's something I cannot allow to happen.
13:34:50  hmm
13:34:53  elliott_: flip map
13:34:59  Deewiant: oh, right
13:35:02  > flip map [0..9] $ \d -> find ((show d `isPrefixOf`) . show) $ map (2^) [0..]
13:35:06    mueval-core: Time limit exceeded
13:35:08  :(
13:35:14  > [0..9] `map` \d -> find ((show d `isPrefixOf`) . show) $ map (2^) [0..]
13:35:15    Couldn't match expected type `a -> b' against inferred type `[a1]'
13:35:15  > find (("42" `isPrefixOf`) . show) $ map (2^) [0..]
13:35:17    Just 4294967296
13:35:18  elliott_: 0 won't work
13:35:20  elliott_: Ever
13:35:22  Oh :P
13:35:22  Right
13:35:35  > flip map [1..] $ \p -> find ((show p `isPrefixOf`) . show) $ map (2^) [0..]
13:35:37    [Just 1,Just 2,Just 32,Just 4,Just 512,Just 64,Just 70368744177664,Just 8,J...
13:35:47  > catMaybes . flip map [1..] $ \p -> find ((show p `isPrefixOf`) . show) $ map (2^) [0..]
13:35:48  can the list be unjusted, somehow?
13:35:49    [1,2,32,4,512,64,70368744177664,8,9007199254740992,1024,1125899906842624,12...
13:35:59  ais523: snap :)
13:36:17  map fromJust
13:36:22  Deewiant: Die
13:36:31  elliott_: More appropriate in this case
13:36:36  elliott_, what is the log_2 function in haskell now again?
13:36:40  technically, find /has/ to return Just x or else diverge, on an infinite list
13:36:44  > log2 70368744177664
13:36:45    Not in scope: `log2'
13:36:46  hm
13:36:48  not that
13:36:53  elliott_: catMaybes loses the mapping from the numbers you're looking for, in case you get Nothing
13:36:54  > length show 70368744177664
13:36:54  :t log
13:36:55    Couldn't match expected type `[a]'
13:36:55          against inferred type `a1 -> GHC...
13:36:55  forall a. (Floating a) => a -> a
13:36:56  > [n | p <- [0..], Just n <- find ((show p `isPrefixOf`) . show) $ map (2^) [0..]]
13:36:57    Couldn't match expected type `[t]'
13:36:57          against inferred type `Data.Mayb...
13:36:59  > length (show 70368744177664)
13:36:59    14
13:37:01  elliott_: I'd rather have an error
13:37:09  :t log
13:37:10  forall a. (Floating a) => a -> a
13:37:13  ^ a reasonably bad way to do log_10
13:37:24  > log 70368744177664 / log 2
13:37:25    46.0
13:37:29  well rigtht
13:37:30  > [n | p <- [1..], Just n <- find ((show p `isPrefixOf`) . show) $ map (2^) [0..]]
13:37:31    Couldn't match expected type `[t]'
13:37:31  right*
13:37:31          against inferred type `Data.Mayb...
13:37:37  so 2^46 = that number
13:37:38  oh
13:37:45  > [n | p <- [1..], let Just n = find ((show p `isPrefixOf`) . show) $ map (2^) [0..]]
13:37:46    [1,2,32,4,512,64,70368744177664,8,9007199254740992,1024,1125899906842624,12...
13:37:53  > log 9007199254740992 / log 2
13:37:53    53.0
13:38:03  > [n | p <- [1..], n <- map (2^) [0..], show p `isPrefixOf` show n]
13:38:04    [1,16,128,1024,16384,131072,1048576,16777216,134217728,1073741824,171798691...
13:38:06  Nice
13:38:08  Wait
13:38:11  Why's that broken
13:38:12  Oh
13:38:19  why is the number 0 called 0? for consistency, it should probably be the null string
13:38:26  > [n | p <- [1..], let n:_ = [n | n <- map (2^) [0..], show p `isPrefixOf` show n]]
13:38:28    [1,2,32,4,512,64,70368744177664,8,9007199254740992,1024,1125899906842624,12...
13:38:29  (Kidding :P)
13:38:41  OK, now how to avoid traversing the list of powers multiple times...
13:38:50  :t break
13:38:51  forall a. (a -> Bool) -> [a] -> ([a], [a])
13:38:59  > break (("3" `isPrefixOf`) . show) $ map (2^) [0..]
13:39:01    ([1,2,4,8,16],[32,64,128,256,512,1024,2048,4096,8192,16384,32768,65536,1310...
13:39:10  > span (("3" `isPrefixOf`) . show) $ map (2^) [0..]
13:39:11    ([],[1,2,4,8,16,32,64,128,256,512,1024,2048,4096,8192,16384,32768,65536,131...
13:39:13  aha
13:39:55  > find ((7 ==) . head . (ord <$>) . flip (showIntAtBase 10 chr) []) $ map (2^) [0..]
13:39:56    Just 70368744177664
13:39:58  > let f p xs = let (_, wow:xs') = span ((show p` isPrefixOf`) . show) xs in wow : f (p+1) xs' in f 1 $ map (2^) [0..]
13:39:59    [2,4,8,16,32,128,256,512,1024,2048,4096,8192,16384,32768,65536,131072,26214...
13:40:05  What
13:40:23  > let f p xs = let (_, wow:xs') = span ((show p `isPrefixOf`) . show) xs in wow : f (p+1) xs' in f 1 $ map (2^) [0..]
13:40:25    [2,4,8,16,32,128,256,512,1024,2048,4096,8192,16384,32768,65536,131072,26214...
13:40:29  hmm, what we really need is a partition function that sorts into more than one partition, lazily
13:40:58  Oh, wait
13:41:05  The algorithm is totally borked, I think
13:41:07  Yeah, it is
13:42:00  `pwd` =~ /production/ or die "Not downloading to production DB?";
13:42:01  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: pwd`: not found
13:42:26  ais523: ?
13:42:26  a check that I ended up adding after accidentally putting live user data into the test DB
13:42:38  I like the question mark
13:42:41  which is possibly a worse mistake than putting test data in the production DB
13:42:46  elliott_: it's a NetHack thing
13:42:53  to put question marks on error messages that should never happen
13:42:56  @hoogle [a -> Bool] -> [a] -> [[a]]
13:42:57  Prelude dropWhile :: (a -> Bool) -> [a] -> [a]
13:42:57  Data.List dropWhile :: (a -> Bool) -> [a] -> [a]
13:42:57  Prelude filter :: (a -> Bool) -> [a] -> [a]
13:43:07  Deewiant: I bet that's some fancy applicative construction
13:43:08  Go go go
13:43:28  @hoogle [a -> Int] -> [a] -> [[a]]
13:43:28  GHC.Exts groupWith :: Ord b => (a -> b) -> [a] -> [[a]]
13:43:28  Control.Applicative (<*>) :: Applicative f => f (a -> b) -> f a -> f b
13:43:28  GHC.Exts sortWith :: Ord b => (a -> b) -> [a] -> [a]
13:43:39  society
13:43:39  @hoogle [a -> Integer] -> [a] -> [[a]]
13:43:39  GHC.Exts groupWith :: Ord b => (a -> b) -> [a] -> [[a]]
13:43:40  Control.Applicative (<*>) :: Applicative f => f (a -> b) -> f a -> f b
13:43:40  GHC.Exts sortWith :: Ord b => (a -> b) -> [a] -> [a]
13:43:40  is crazy.
13:43:48  none of those are what I want
13:43:56  wait, why the square brackets?
13:44:00  @hoogle (a -> Integer) -> [a] -> [[a]]
13:44:01  GHC.Exts groupWith :: Ord b => (a -> b) -> [a] -> [[a]]
13:44:01  GHC.Exts sortWith :: Ord b => (a -> b) -> [a] -> [a]
13:44:01  Prelude map :: (a -> b) -> [a] -> [b]
13:44:07  ais523: intentionally, duh
13:44:16  elliott_: What is that supposed to do
13:44:19  elliott_: I mean, in /my/ query
13:44:40  > let finds fs (x:xs) = map (++ finds fs xs) $ map (\f -> if f x then [x] else []) fs in finds (map (==) [0..]) [0..]
13:44:41    Occurs check: cannot construct the infinite type: t = [t]
13:44:53  Meh
13:45:31  elliott_: what's the Haskell to copy-replace the nth element of a list?
13:45:32  Oh, wouldn't work anyway
13:45:37  ais523: don't do that
13:45:39  > let finds fs (x:xs) = concatMap (++ finds fs xs) $ map (\f -> if f x then [x] else []) fs in finds (map (==) [0..]) [0..]
13:45:42    [0*Exception: stack overflow
13:45:47  elliott_: even lazily?
13:45:59  or, well, apply a function to the nth element of a list
13:46:02  ais523: yeah, laziness is a magic bullet that makes slow things super-fast
13:46:03  keeping the rest of the list the same
13:46:10  you still pay for it in the thunks
13:46:17  but more importantly, you don't index lists
13:46:26  if you're indexing lists a lot, you've done something awful
13:46:28  what do you index, instead?
13:46:33  Arrays, typically
13:46:34  it was going to be a pretty short list
13:46:35  something that isn't a list
13:46:37  a tree or a vector
13:46:43  Deewiant: Haskell has arrays?
13:46:48  ais523: Yes
13:47:00  ais523: no. haskell is a toy language
13:47:13  everyone writes their performance-critical haskell code with singly-linked lists
13:48:06 * elliott_ is also totally serious
13:48:07  meh, I'm the sort of person who'd prefer the code to be expressed as lists and the compiler to figure out how to optimize that
13:48:20  yes, you're the sort of person whose programs don't run within acceptable time limits
13:48:40  why should it be the programmer's responsibility to make basic data structures work quickly?
13:48:44  > listArray (0,MaxBound-1) [1..]
13:48:45    Not in scope: data constructor `MaxBound'
13:48:48  /kick ais523 trolling
13:48:51  > listArray (0,maxBound-1) [1..]
13:48:52    Ambiguous type variable `a' in the constraints:
13:48:52     `GHC.Num.Num a'
13:48:52       ari...
13:48:56  ah
13:49:02  > listArray (0,maxBound-1::Int) [1..]
13:49:04   Terminated
13:49:10  oh come on.
13:49:13  that's perfectly reasonable.
13:49:27  > maxBound-1::Int
13:49:28    9223372036854775806
13:49:33  really?
13:49:38  yeah dude.
13:49:41  > 2^63-1
13:49:42    9223372036854775807
13:49:50  CakeProphet, no it isn't
13:49:56  CakeProphet, it would have been if 32-bit, sure
13:50:02  gah, Network.HTTP is unusable
13:50:13  elliott_, why?
13:50:18  Vorpal: what if I want ALL MEMORY in my array?
13:50:18  stupid api
13:50:27  CakeProphet, ...
13:50:35  Vorpal: it's critical to my application.
13:50:58  CakeProphet, then run it locally on a 128-bit system?
13:51:22  wouldn't that be the same thing?
13:51:24  OK, so students seem to have found a way to cheat
13:51:30  ais523: my god.
13:51:32  incredible.
13:51:38  they're using the FFI to access the standard libraries without having to mention their names
13:51:41  all of academia will crumble.
13:51:49  and thus getting around the restriction on which modules they're allowed to use
13:51:54  that's nicely creative, I guess?
13:52:03  ais523: Haskell class?
13:52:05  ais523, heh
13:52:14  I didn't know those existed.
13:52:23  CakeProphet: OCaml
13:52:23  ais523, why would you allow access to the FFI in the first place in that context?
13:52:27  oh.
13:52:40  Vorpal: well, because it doesn't do anything that was blacklisted
13:52:44  heh
13:52:48  this is always the danger with blacklisting-based security
13:52:51  ais523: that's beautiful
13:52:55  ais523: give them top marks
13:53:01  I'm glad I have a whitelisting-based security too, on the syscalls that can be used
13:53:07  elliott_: I'd let it pass, only the answer was wrong
13:53:14  heh
13:53:16  people are trying to miss the point of the question by converting the lists of digits to strings
13:53:16 -!- sebbu2 has changed nick to sebbu.
13:53:27  my testsuite gets around that by giving them lists that don't fit into ints
13:53:34  ais523: are these master's students or
13:53:42  first years
13:53:55  ais523: :( how am i ever gonna get that cool that quickly
13:53:57  ais523, I used qsort() to answer a badly worded "implement a sorting algorithm" assignment. It passed with a note along the lines of "nice trick, will change the wording for the next year"
13:53:59  i better read up on ocaml's ffi
13:54:15  elliott_: well, they're just using "external" declarations
13:54:22  I'm not sure if that's FFI or someting else, but it looks FFIish
13:54:36  yep, looks like it
13:54:46  and the stdlibs appear to be conveniently defined with them
13:54:48  ais523, note that the assignment was in python, so it involved FFI as well
13:54:54 -!- saahil has joined.
13:55:17 -!- saahil has left.
13:55:18  I put a custom bignum implementation in one of the weekly exercises of the C course; and other assorted curiosities, like Blowfish in the one which suggested ROT-13 for "encryption"; and no-one ever commented on them at all. :(
13:55:23  Vorpal: wait, you used /C/'s qsort to answer a Python question?
13:55:41  fizzie: that's a sign of overengineering in protest at the question
13:55:54  ais523, yes because the FFI (ctype I think? Or some other FFI bit of python, forgot which one) capabilities weren't blacklisted
13:55:56  fizzie: Aww.
13:56:11  ais523: It's also/instead a sign of too much free time, perhaps.
13:56:11  ais523, anyway I was bored when I did that. Got to have some fun
13:56:15  hmm, does curl do persistent connections?
13:56:20 * ais523 compare [1; 0; 7; 3; 7; 4; 1; 8; 2; 5] [1; 0; 7; 3; 7; 4; 1; 8; 2; 3]
13:56:35  not so much you can do to catch out people who are converting to an integer in a list-of-digits comparison question
13:56:49  but those are either side of OCaml's MAXINT, which should
13:57:19  (the students who fail on that testcase will get feedback telling them that that's the testcase they failed on, which might clue them in as to what they're doing wrong)
13:57:36  ais523, there was another python assignment where I handed in two versions: A pure python one and a cython one. Then pointed out that python was very unsuitable for a game AI using alpha-beta pruning based on the maximum ply-depths that could be achieved by the respective versions.
13:58:24  well for interactive use that is
13:58:32  I think it was like 5 and 7, or such
13:59:28  ais523: hmm, are you writing this thing to try and fill some byzantine rule that says you have to be completely objective about your marking? I wouldn't put it past you :)
13:59:49  elliott_: no, I'm writing it because marking thousands of submissions by hand would take far too long
13:59:59  and get very boring, and I'd probably make mistakes
13:59:59  ais523: that's much more boring
14:00:32  ais523, how many students are taking that class?
14:00:36  ais523: if they get testcase feedback, can't they just hardcode your testcases like anagolf? :)
14:00:44  Vorpal: around 100
14:00:51  heh
14:01:13  elliott_: they get feedback on some but not all of the test cases
14:01:30  that was inspired by anagolf
14:01:30  (i.e. if their program works on the first n but fails on the n+1th and n is large enough, they don't get told what they did wrong)
14:01:30  that is quite a lot
14:02:15  django hell is a scary place.
14:03:19  hmmm why is tree not installed by defalt in ubuntu?
14:03:37  yay, my marking script handled the change to DST correctly
14:03:49  hmm, I wonder whether downloading in parallel will pay off
14:03:52  (I put extra effort into making sure it did timezone math right)
14:04:00  probably not, HTTP pipelining should take care of any overhead for the small files
14:04:16  elliott_, if they are from different hosts, sure
14:04:24  they're not
14:04:43  elliott_, iirc aptitude downloads in parallel if the packages come from different hosts, like the main repo mirror and a PPA
14:04:59  I'm probably worrying too much about this package manager's download experience :) but I sure do hate every existing package manager's handling of that
14:05:00  for example
14:05:03  but in serial if from a single host
14:05:04  To: . <.>
14:05:07  I'm pretty sure pacman doesn't use persistent http requests at all
14:05:13  it has a noticeable pause between downloading tiny tiny files
14:05:16  awful
14:05:18  hilariously, Evolution linked the second .
14:05:32  Vorpal: eh, that sounds rare enough for me to not care
14:05:45  Vorpal: the most likely scenario would be getting some binary packages from another repo that depend on stuff in the main report
14:05:46  repo
14:05:50  elliott_, well, the main mirror I use maxes out my connection anyway
14:05:52  Vorpal: I'll just group by repo so it does it as two concentrated downloads
14:06:00  hm
14:06:02  elliott_: upgrading some packages from -proposed and some from -security?
14:06:08  Vorpal: I'll probably do the equivalent of "apt-get update" in very-parallel,t hough
14:06:13  s/,t /, t/
14:06:18  since that's a large number of small files
14:06:20  latency dominates
14:06:33  I was rather happy that the phone alarm clock, when setting an alarm across the DST boundary on Saturday evening, managed to correctly calculate the "HH:MM before next alarm" info-text it shows.
14:06:38  elliott_, well it was for update, I think I have the bzr PPA and got an upgrade to that and to the main repo at the same time, thus noticed this
14:07:08  I'll probably just encapsulate this so I can add fancy parallel logic later :P
14:07:10  but pipelining is a must.
14:07:15  sure
14:08:12  elliott_: if you have multiple cores I would think utilizing parallel would generally payoff
14:08:16  ais523: you'll be pleased to know I'm using INTERCAL version numbers as the pathological test case for my version handling in my package manager
14:08:19  unless the program itself is written to utilize multiple cores.
14:08:22  CakeProphet: ...for a download?
14:08:28  MORE CPUS MORE BROADBAND
14:08:28  elliott_: oh... no.
14:08:28  elliott_: you told me that already
14:08:34  ais523: no I didn't
14:08:36  at least, not recently
14:08:41  well, you did with inst
14:08:47  elliott_: THE CPU ISN'T ASKING FAST ENOUGH
14:08:47  and I'm assuming the package manager's basedo n that
14:08:50  *on that
14:08:54  elliott_: ASK CONCURRENTLY
14:09:06  ais523: it's not
14:09:08  "may I please have bytes" * 4
14:09:11   MORE CPUS MORE BROADBAND <-- only in uplink.
14:09:22  ais523: anyway, inst didn't actually do any version number handling
14:09:29  ais523: I have to decide which version numbers are bigger than others
14:09:49  ais523: I think it can handle INTERCAL versions perfectly, it'll just need to take them in reversed form (as an internal field; the user will still see the true version number in the UI)
14:09:55  component-reversed, that is
14:10:01  heh
14:10:44  elliott_: Debian's version is to use version sort (i.e. contiguous numbers sorting as numbers, otherwise sorting alphabetically), with ~ being lexicographically negative
14:10:50  that is, 0.1~alpha1 sorts before 0.1
14:10:52  elliott_, wait isn't there some program that have the version counting down?
14:10:52 -!- derrik has quit (Quit: left).
14:10:56  (but after 0.05)
14:11:14  Vorpal: That can be represented as -n
14:11:16  err, perhaps it actually sorts before 0.05 too
14:11:17  aka pren
14:11:23  otherwise, you have the 0.9 0.10 problem
14:11:39  elliott_, hm
14:11:39  leading 0s on a component part would imply it's meant to be interpreted as a decimal, though…
14:11:53  ais523: I'm going to do something like: Map minus sign to "pre"; split into components (on "."); sort components as list, where each individual component is done numerabetically
14:11:59  ais523, I will make a package that uses fractions for the version number
14:12:01  ais523: oh, actually
14:12:10  like foo-3/4
14:12:18  or foo-1/3
14:12:23  ais523: I'm going to do something like: Map minus sign to "pre"; split into components (on "."); sort components as list, where each individual component is done numerically, with any letter on the end becoming the first digit
14:12:27  or... something like that
14:12:31  nix gets it almost right, anyway
14:12:39  elliott_: distinguish 0.5-1 from 0.5.-1
14:12:40  ais523: point is, 3.1a is older than 3.1
14:12:48  also, what the heck is 0.5-1?
14:12:52  elliott_, ooh another idea for screwy version number: foo-|1+2i|
14:12:54  elliott_: 0.5, patchlevel 1
14:12:54  that looks like a package revision number thing
14:12:59  which isn't part of the version in my system
14:13:08  well, it might be part of someone else's version numbre
14:13:09  *number
14:13:51  Just about all females often feel that exactly why all Hollywood stars common maintain its brightness as Tom in spite of frantic operate routine and large operate pressure from the skin. What do you think that they have got sufficient time to observe all attractiveness strategies and tips that his grandmother utilized to abide by?
14:14:04  what
14:14:23  we have two different spambots atm; one posts coherently, the other is a markovbot
14:14:24  Version numbers of the form e^(in), with 'n' incrementing -- because it's all cyclic, man. Far out.
14:14:30  but they both have pretty similar content apart from that
14:14:37  I'm beginning to wonder if one spambot is using the other as input
14:14:43  heh
14:15:08  fizzie, nice
14:15:33  haha
14:16:08  fizzie, problem is distros are going to just use n for the version number there
14:16:14  `addquote  Just about all females often feel that exactly why all Hollywood stars common maintain its brightness as Tom in spite of frantic operate routine and large operate pressure from the skin. What do you think that they have got sufficient time to observe all attractiveness strategies and tips that his grandmother utilized to abide by?
14:16:16  706)  Just about all females often feel that exactly why all Hollywood stars common maintain its brightness as Tom in spite of frantic operate routine and large operate pressure from the skin. What do you think that they have got sufficient time to observe all attractiveness strategies and tips that his grandmother utilized to abide by?
14:16:21  fizzie, you have to make that impossible somehow
14:16:36  hm
14:16:42  elliott_: it's really 
14:16:49  ais523: yes, but that's less baffling
14:17:09  well, people know it's me and Keymaker who deal with the spam, and Keymaker rarely comes here
14:17:14  Vorpal: Well... you could do the TeX "converges into an irrational number" thing, except make it converge as (sin x)/x (take the minima and maxima) or something, so that it wobbles up and down, not monotonically like "always add one digit" does.
14:17:15  so it's not a hard inference that I was quoting a spambot
14:17:30  fizzie, good idea
14:17:54  Debian got caught out beautifully by C-INTERCAL 1.28
14:18:05  as they used the version number literally before realising what they'd done wrong
14:18:14  ais523, heh
14:18:17  (it should have been sanitised to 0.28.1 at that point)
14:18:22  ais523, so how did they solve it?
14:18:24  (but they didn't catch it)
14:18:29  Vorpal: the next version number was 29:0.2
14:18:32  *29:0.29
14:18:33  heh
14:18:44  which is a complete abuse of the epoch field, and the packaging guidelines specifically say not to do that
14:18:49  ais523: this is why you use Kitten's package manager; you can just define the ordering version as a /function/ of the actual version
14:18:56  ais523, well, what options did they have at that point?
14:19:05  Vorpal: 1:0.29 would be correct
14:19:08  ah
14:19:16  or perhaps 1:0.29.0
14:19:24  so why didn't they do that then hm
14:19:27  or even 1:29.0
14:19:28  don't ask me
14:19:33  oh well
14:19:46  ais523, what was the clc numbering now again?
14:20:11  ais523: order_version = reverse (version_components version)
14:20:14  Vorpal: it's just like regular numbering; it sorts lexicographically by component
14:20:22  ais523: see???? SO MANY ADVANTAGES
14:20:28  it's just that the components can potentially be negative
14:20:31  ah
14:20:32  elliott_: what if you don't know Haskell?
14:20:33  right
14:20:43  ais523: have you ever /seen/ a Debian package?
14:21:29  elliott_: I've even /made/ a Debian package
14:21:37  no Haskell knowledge required
14:21:54  hmm, how do you install ghci on Gentoo, where you can't bootstrap it with a binary?
14:21:56  ais523: good thing my quoted snippet wasn't Haskell either, then
14:22:04  ais523: but seriously, Debian packages are impossible to read
14:22:13  you might have "made" one with automated tools, but they're unmaintainable binary blobs themselvse
14:22:13  elliott_: I don't have much problems reading them
14:22:15  themselves
14:22:20  except that people actually have to maintain them
14:22:25  and no, they aren't binary blobs
14:22:28  ais523: I take it you've never looked at the gcc package's debian directory
14:22:31  they're binary, but it's just a standard tarball
14:22:39   hurr what is hyperbole
14:22:50  or perhaps arball
14:23:20  yep, I deleted my gcc Debian source package as it was taking up too much space
14:24:36  @hoogle (#)
14:24:37  keyword #
14:24:37  GHC.Exts C# :: Char# -> Char
14:24:37  GHC.Exts D# :: Double# -> Double
14:24:41   hmm, how do you install ghci on Gentoo, where you can't bootstrap it with a binary? <-- you bootstrap it with a binary
14:24:44  ah right.
14:25:25  ais523, or even use a binary package version. They provide that for a few things, like openoffice, firefox, thunderbird, ghc. Where compiling takes ages and/or is a PITA
14:26:04  there seems something so wrong about binary packages in Gentoo
14:26:29  hmm, I think http-enumerator is my best bet
14:26:32  even if it has 389573489573894578934578934534789545 dependencies
14:26:38 -!- tiffany has joined.
14:26:57  ais523, well, you have to start out with a boot strap environment too. Which is a binary download. So you can build your own environment from that point
14:27:41  I vaguely assumed you bootstrapped it from your previous OS
14:27:56  ais523, nah, that is LFS
14:28:09  hmm, wasn't someone talking in here a while back about a script that downloaded the book about LFS and parsed it for the commands it needed to run?
14:28:22  I was wondering if it used OCR, that'd be even more hilarious
14:28:41  ais523, gentoo gives you a manual that tells you  to run fdisk and mkfs and so on as required, then mount it somewhere and unpack a stage3.tar.gz with some flags to preserve permissions properly
14:28:45  then you chroot into that
14:28:57  and run various commands
14:29:03  usually done from a livecd
14:29:16  could be done from another installed linux system, sure
14:29:31   hmm, wasn't someone talking in here a while back about a script that downloaded the book about LFS and parsed it for the commands it needed to run?
14:29:32  yep
14:29:39  it's actually "official"
14:29:48  ais523, the book is some HTML pages, no need for OCR
14:30:10  it's docbook, i think
14:30:24  oh maybe the html pages are generated from that
14:30:26  quite possible
14:30:57  httpRedirect :: (MonadIO m, Failure HttpException m) => Request m -> (Status -> ResponseHeaders -> Iteratee ByteString m a) -> Manager -> Iteratee ByteString m a
14:31:01  whoo boy
14:31:17  that looks annoying
14:32:16  Vorpal: what does?
14:32:21  the type
14:32:22  elliott_, btw I'm pretty sure you can get wget to pipeline requests (or at least reuse the connection) by giving it several files on the command line
14:32:29  yes, I'm sure curl does that too
14:32:31  I remember doing so at some point
14:32:39  might have been recursive mode though
14:40:50 -!- copumpkin has quit (Quit: Computer has gone to sleep.).
14:40:50  main = attermptToStopAnIdiotFromDying
14:40:52  Phantom__Hoover, I now hold the last discworld book in my hand :)
14:41:04  last, eh
14:41:10  latest
14:41:12  I suppose it's gotta be close to
14:41:33  wonder when he'll take the plunge
14:44:05 -!- Sgeo|web_ has joined.
14:46:29  http://sprunge.us/HihB
14:46:34  I am getting quite bored of typing n
14:47:42 -!- Sgeo|web has quit (Ping timeout: 265 seconds).
14:48:40  Deewiant: This is why people are wary of dependencies:
14:48:42  warning: the following (2) packages will be installed by pacman: haskell-utf8-string haskell-zlib
14:48:42  searching AUR...
14:48:42  Targets (32): haskell-semigroups-0.8-1 haskell-primitive-0.3.1-18 haskell-tagged-0.2.3.1-1 haskell-largeword-1.0.1-1 haskell-entropy-0.2.1-1 haskell-zlib-bindings-0.0.1-1 haskell-vector-0.7.1-18 haskell-cryptohash-0.7.3-1 haskell-base-unicode-symbols-0.2.2.1-1 haskell-dlist-0.5-18 haskell-cryptocipher-0.2.14-3 haskell-crypto-api-0.6.4-4 haskell-cereal-0.3.3.0-18 haskell-hashable-1.1.2.1-1 haskell-zlib-enum-0.2.1-22 haskell-tls-extra-0.3.1-4 haskell-tls-
14:48:42  0.7.2-4 haskell-monad-control-0.2.0.3-1 haskell-http-types-0.6.5.1-3 haskell-failure-0.1.0.1-18 haskell-enumerator-0.4.14-1 haskell-data-default-0.3.0-1 haskell-cprng-aes-0.2.1-23 haskell-certificate-0.9.1-4 haskell-case-insensitive-0.3.0.1-1 haskell-blaze-builder-enumerator-0.2.0.3-1 haskell-blaze-builder-0.3.0.1-18 haskell-base64-bytestring-0.1.0.3-1 haskell-attoparsec-enumerator-0.2.0.4-22 haskell-attoparsec-0.9.1.2-1 haskell-asn1-data-0.5.1-22 haske
14:48:47  ll-http-enumerator-0.7.0-4
14:49:06  why are those dependencies needed?
14:49:36  To do things, presumably
14:50:07  OTOH you're unlikely to get me to agree with your "it's easier to rewrite any library than to use it" stance either, so it's probably pointless expressing it
14:50:24  :p
14:50:40  elliott_: "any library" is wrong, there
14:50:49  it depends on exactly what you're doing
14:51:23  Looks like trifecta's dependency list
14:51:37  Deewiant: At least this one is flattened out
14:51:48  Deewiant: With trifecta you at least have the guarantee that 90% of them are by the same person
14:52:40  I've been sitting at this install prompt for ten minutes wondering whether to say y or not
14:52:51  Where'd you get those dependencies from
14:53:06  haskell-http-enumerator
14:53:32  It has a simpler API than the HTTP package and I can't figure out how to do streaming downloads with the latter
14:54:48  But
14:54:50  So many dependencies
14:55:53   Phantom__Hoover, I now hold the last discworld book in my hand :)
14:55:55  I... how...
14:55:58  Do...
14:56:05  Does Sweden have book rockets.
14:56:11  elliott_: oh right, I thought you meant those dependencies were on utf8-string and zlib
14:56:14  and I was wondering why
14:56:22  as in, from utf-8 and zlib
14:56:28  lol
14:56:41  Do you order a book, and half an hour later a missile slams into your front garden and there's a book in it.
14:57:27  Phantom__Hoover: no
14:57:54  ais523: you're not Swedish
14:58:37  Manchester is in Sweden, isn't it?
14:59:25  I'm not in Manchester
14:59:51  Dependenciesasn1-data (≥0.5.1 & <0.7), attoparsec (≥0.8.0.2 & <0.10), attoparsec-enumerator (≥0.2.0.4 & <0.3), base (4.*), base64-bytestring (0.1.*), blaze-builder (≥0.2.1 & <0.4), blaze-builder-enumerator (0.2.*), bytestring (≥0.9.1.4 & <0.10), case-insensitive (≥0.2 & <0.4), certificate (≥0.7 & <1.1), containers (≥0.2 & <0.5), cprng-aes (0.2.*), data-default (0.3.*), enumerator (≥0.4.9 & <0.5), failure (0.1.*), http-types (0.6.*), m
14:59:51  onad-control (0.2.*), network (≥2.2.1 & <2.2.3), network-bytestring (0.1.3.*), tls (≥0.8.1 & <0.9), tls-extra (≥0.3 & <0.5), transformers (0.2.*), utf8-string (≥0.3.4 & <0.4), zlib-enum (0.2.*) or
14:59:51  asn1-data (≥0.5.1 & <0.7), attoparsec (≥0.8.0.2 & <0.10), attoparsec-enumerator (≥0.2.0.4 & <0.3), base (4.*), base64-bytestring (0.1.*), blaze-builder (≥0.2.1 & <0.4), blaze-builder-enumerator (0.2.*), bytestring (≥0.9.1.4 & <0.10), case-insensitive (≥0.2 & <0.4), certificate (≥0.7 & <1.1), containers (≥0.2 & <0.5), cprng-aes (0.2.*), data-default (0.3.*), enumerator (≥0.4.9 & <0.5), failure (0.1.*), http-types (0.6.*), monad-control
14:59:55  (0.2.*), network (2.3.*), tls (≥0.8.1 & <0.9), tls-extra (≥0.3 & <0.5), transformers (0.2.*), utf8-string (≥0.3.4 & <0.4), zlib-enum (0.2.*)
15:00:02  Deewiant: Challenge: Figure out what essential difference the "or" is expressing
15:00:09  ais523, but you are in Sweden?
15:00:34  elliott_: network
15:00:54  Deewiant: Wow, skillz
15:00:58  I couldn't figure it out at all
15:01:04  Phantom__Hoover: where did I imply that?
15:01:18  ais523, well, you never /contradicted/ it.
15:01:28  and still haven't
15:03:09  ais523: hmm... log out of nickserv for a minute
15:03:18  elliott_: why?
15:03:25  that's quite a suspicious request
15:03:32  ais523: so I can do nefarious things, duh
15:03:34  specifically, whois you
15:03:45  error: target not found: haskell-data-default=0.3.0
15:03:52  Deewiant: Bonus: The package is broken
15:03:58  elliott_: This is why I use cabal-install
15:04:07  Deewiant: This is the first time it's broken :P
15:04:16  elliott_: Well, it broke once for me and that was enough
15:04:30  Deewiant: Have I mentioned that Kitten's package manager completely avoids this problem
15:04:45  wow, those are specific version number ranges
15:04:56  elliott_: if it can't solve Sudoku, it's no good at solving version clashes
15:05:02  elliott_: Because of this hackage2arch business (or whatever it was called), people just make packages all willy-nilly and then when somebody updates, if nobody else does, the dependers get screwed
15:05:09  elliott_: (I guess)
15:05:19  Deewiant: Actually no, all the AUR packages are managed by one group
15:05:31  Deewiant: But they're slower than the core repos at dependencies, apparently
15:05:39  So they end up depending on older versions than the core repos have to offer
15:05:40  elliott_: I've had intra-AUR-conflicts
15:05:49  Hmm, sucks to be you
15:05:59  Deewiant: Have I mentioned Kitten avoids this problem
15:06:07  What prevents anybody from uploading their own haskell-this-is-my-library-haha?
15:06:10 -!- copumpkin has joined.
15:06:16  In what, AUR?
15:06:16  elliott_: Let me know when it's done and working
15:06:17  Nothing
15:06:21  elliott_: Exactly :-P
15:06:32   elliott_: if it can't solve Sudoku, it's no good at solving version clashes
15:06:41  ais523: nah, you just don't need to solve them in the first place
15:06:48   wow, those are specific version number ranges
15:06:49  they're not
15:06:54  see package versioning policy
15:07:58  The package versioning policy needs a way of specifying a version range that allows for adding new (non-instance) things to a module
15:08:00  Deewiant: Hmm, I appear to be relatively fucked in terms of getting this library working at this juncture
15:08:10  elliott_: Hence cabal-install
15:08:40  haskell-ansi-terminal 0.5.5-18
15:08:40  haskell-deepseq 1.1.0.2-2.1
15:08:40  haskell-mtl 2.0.1.0-3.1
15:08:40  haskell-network 2.3.0.2-2.1
15:08:40  haskell-parsec 3.1.1-2.1
15:08:41  haskell-text 0.11.0.5-2.1
15:08:42  haskell-transformers 0.2.2.0-3.1
15:08:53  Deewiant: That's a whole... two libraries I would have to install!! Also everything would break horribly.
15:09:34  Things might not break at all depending on the precise situation
15:09:50  But, if they would: go back to the wild west and cabal-install everything
15:09:51  Deewiant: Let me rephrase that for you: I might get lucky :)
15:10:16  I think it's more a case of not getting unlucky
15:10:24  Deewiant: BTW, re: "Let me know when it's done and working", what do you think I'm attempting to install dependencies for my work on right now :)
15:10:55  So you're working on it, great; let me know when it's done and working
15:11:04  Deewiant: Maybe I won't
15:13:22 -!- derrik has joined.
15:20:51 -!- ais523_ has joined.
15:21:01 -!- Darth_Cliche has joined.
15:21:38 -!- ais523 has quit (Ping timeout: 240 seconds).
15:21:41 -!- ais523_ has changed nick to ais523.
15:24:20 -!- sebbu has quit (Read error: Connection reset by peer).
15:27:38 -!- sebbu has joined.
15:27:38 -!- sebbu has quit (Changing host).
15:27:38 -!- sebbu has joined.
15:34:11 -!- derdon has quit (Remote host closed the connection).
15:40:15  [elliott@dinky isolate]$ cabal install ansi-terminal http-enumerator
15:40:17  Deewiant: I blame you
15:40:20  Time to wait twenty years
15:48:23  I think the way Kate Beaton draws babies may be the greatest work of art the world has yet known
15:50:57 -!- tiffany has quit (Ping timeout: 258 seconds).
15:51:32  33554432
15:52:23 -!- tiffany has joined.
15:52:26  hi ais523
15:52:33  hi
15:53:09  Oh god no matter how many times I read Hark! A Vagrant it never gets old.
15:54:31 -!- monqy has joined.
16:01:37 -!- ais523_ has joined.
16:02:06 -!- ais523 has quit (Disconnected by services).
16:02:08 -!- ais523_ has changed nick to ais523.
16:26:23  Huh, the Darwin Awards exclude people with mental disorders.
16:26:29 -!- ais523 has quit (Ping timeout: 248 seconds).
16:26:46  I like how that basically makes it completely explicit that it's all just a front for being sneering assholes.
16:26:56 -!- ais523 has joined.
16:28:25  Phantom__Hoover: To be fair, it wouldn't exactly make them less of a front for being sneering assholes if they included those people.
16:28:49  They're kind of fucked whatever they do, which is usually a Sign(tm).
16:29:07  elliott_, erm, the premise that it's for people who removed themselves from the gene pool due to poor judgement would at least be /sound/.
16:29:23  Well, sure.
16:30:46  I also found it quite amusing when the woman who runs the site herself nearly DA'ed herself and acted like it was fine because it was a near miss.
16:32:18 -!- ais523 has quit (Ping timeout: 260 seconds).
16:34:12 -!- boily has quit (Read error: Operation timed out).
16:37:55  `addquote  (I'm not really sure what that explains but nor am I sure what I'm explaining, so it cancels out.)
16:37:58  707)  (I'm not really sure what that explains but nor am I sure what I'm explaining, so it cancels out.)
16:43:09 -!- Gregor has set topic: Friends don't let friends Comic Sans. | EPL evening school assignments! http://tinyurl.com/5stnu5n | It's the end of an era | RIP John McCarthy) | TO SHREDS!) |  http://codu.org/logs/_esoteric/.
16:43:35  http://en.wikipedia.org/wiki/Chunked_transfer_encoding
16:43:36  Oh come on!
16:43:41  How am I meant to implement a progress bar now?
16:44:25  progress.hs: StatusCodeException 403 (Chunk "Scripts should use an informative User-Agent string with contact information, or they may be IP-blocked without notice.\n" Empty)
16:44:32  Wow Wikipedia, that's very impolite.
16:44:39  Gregor: I can use codu.org logs as a test URLspam location right
16:44:50  Uhh, I guess?
16:44:56  Thx
16:45:32 -!- sllide has joined.
16:46:52  Gregor, have I mentioned that I wrote my folio essay for English on how Comic Sans was awful.
16:47:05  Highest-five
16:47:23  I suspect it played a large part in getting me a B.
16:47:43  You know what would have gotten you an A? *trollface*
16:47:49  IF YOU HAD WRITTEN IT IN COMIC SANS
16:48:29  Nah, the folio was only worth ~20% of the total marks and it was divided into two essays.
16:52:01  [elliott@dinky isolate]$ curl -I http://codu.org/logs/log/_esoteric/2011-10-19
16:52:01  HTTP/1.1 200 OK
16:52:01  Date: Fri, 04 Nov 2011 16:51:55 GMT
16:52:01  Server: Apache/2.2.21 (Debian)
16:52:01  X-Powered-By: PHP/5.3.8-2
16:52:02  Vary: Accept-Encoding
16:52:04  Content-Type: text/html; charset=UTF-8
16:52:08  Gregor: What's with the lack of Content-Length; why do you hate America
16:52:24  SCREW AMERICA
16:52:51  But more specifically, it generates the HTML and spits it out live *shrugs*
16:52:58  And I was too lazy to buffer just to count.
16:53:21 -!- boily has joined.
16:53:41  Gregor: Oh, it's node.js, isn't it :P
16:53:49  Indeeeeeeeeeeeeeeed.
16:53:52  Land of the "what the fuck is abstraction, you're dealing with HTTP yourself".
16:54:14  Aha, the raw logs get it right :P
16:54:15  Uhh ... no?
16:54:25  Gregor, the glogbot rsync stuff seems to be 'broken' again.
16:54:31  Phantom__Hoover: Uhh ... no?
16:54:35  !logs
16:54:44  Gregor: Uhh, no?
16:54:51  elliott_: Uhh ... no?
16:54:58  Phantom__Hoover: E_WORKSFORME
16:54:59  WHAT ARE YOU TRYING TO EXPRSES >_<
16:55:02  Uhh— no?
16:55:13  elliott_:  Land of the "what the fuck is abstraction, you're dealing with HTTP yourself". // no.
16:55:20  !logs
16:55:36  Gregor: You can hardly call node.js' API high-level :P
16:57:38  elliott_: Node's API for /what/? For actually running an HTTP server? Or for just generating pages? 'cuz the latter is, y'know, CGI.
16:58:04  Gregor: Uhh, I don't think you're meant to use its CGI stuff if you want to be Best Practices Web Scale (tm) :P
16:58:34  elliott_: Yeah, I definitely need a separate web server to gen logs now and then.
16:58:53  Gregor: I'm not saying it's required, I'm just saying that it's hardly a typical use of Node :P
17:00:07  elliott_: You're totally right that stalker mode should have a talk function.
17:00:11  It would be epic.
17:00:15  Yes.
17:00:28   An anonymous coward says: WHY HALLO THAR
17:00:36  ...Don't build it into glogbot :P
17:00:47  It's meant to be MORE stable than clog :P
17:01:09  * glogannoyingchatterbot has joined #esoteric \  WORST IMPLEMENTATION EVER? \ * glogannoyingchatterbot has parted #esoteric
17:01:29  Gregor: It would be sooo hard to add another bot :P
17:01:36  You don't have a premade library for that or anything.
17:01:54  P.S. -n would solve that
17:02:15  I think there are maybe two channels in the history of IRC that are -n :P
17:03:14  Gregor: -minecraft is one of 'em :P
17:03:24  Gregor: It is +s but -n :P
17:03:30  Anyone can talk, but NOBODY CAN KNOW OF ITS EXISTENCE.
17:04:57  elliott_: I hope your mother regrets having birthed you. :P
17:05:12  (did the :P help there)
17:05:17  I'm testing out the theory of :P
17:05:55  :) is the "I desperately need to be punched in the face several times" one.
17:05:59  Gregor's theory of :P is that :P is valid for all circumstances :P :P :P
17:06:07  Phantom__Hoover: what about :>
17:06:15  CakeProphet: Post-punching.
17:06:21  `? CakeProphet
17:06:27  ​:>
17:06:43  @hoogle (:>)
17:06:43  Data.Sequence (:>) :: Seq a -> a -> ViewR a
17:06:53  awesome.
17:07:12  I thought that operator looked familiar.
17:07:40  is Sequence a monad?
17:07:46 -!- Darth_Cliche has quit (Quit: You are now graced with my absence.).
17:07:51  same as [a] right?
17:08:08  Gregor: Rharaeraerhgaehwegh why does your HTTP server not send Content-Length /only/ to the Haskell lib
17:08:11  curl sees it just fine
17:08:33  fungot: hi
17:08:33  CakeProphet: and it's self-modifying techniques." stop immobilizes and disables you. in these bones, i shall return! by the way, the wings! now this is a way to the ocean palace? come to see you back again
17:08:43  elliott_: lul
17:09:22  Gregor: I think this library is actually TRYING to get a chunked response whenever possible :P
17:10:03  fizzie: your bot doesn't let me spam its name in privmsg and get fungotspeak
17:10:31  So does.
17:10:32  Just did it.
17:10:36   elliott_: to. why, this is for you guys are a lot
17:10:36  elliott_: so, let's say i call them mindless games. if we hit every stupid person, any person going, tough one. if we solve it,... i know...
17:10:51  fungot fungot fungot
17:10:52  Gregor: it's what that guy in medina, a village near the mystic mountain" 65,000,000 b. c.? yes, i'd have done something very brave? fnord 06:22, 29, no. 2, 2, 3, 4, 8, 13, 1(::**) ...bad insn!
17:11:03  ^style
17:11:03  Available: agora alice c64 ct darwin discworld europarl ff7 fisher fungot* homestuck ic irc jargon lovecraft nethack pa sms speeches ss wp youtube
17:11:10  ^style sms
17:11:10  Selected style: sms (National University of Singapore SMS corpus, 2011-08-20)
17:11:16  fungot fungot fungot
17:11:17  Gregor: i want to sent mesages. but u'l talk
17:11:52  ^style homestuck
17:11:53  Selected style: homestuck (Homestuck pages 1901-4673)
17:11:57  fungot: That sword alone can't ____, solve for ____.
17:11:58  elliott_: your name is, i am just as confused. emerging from the trials in the brooding. enjoy a bevverage to me or about my fuckin manners for the roof. you have given yourself a very official?
17:12:08  fungot: Wrong! You have three guesses remaining.
17:12:09  elliott_: john, the uncarved minitablet. john carved this tablet at the request. it's just a wrapper for your private reading material later
17:12:13  fungot: Wrong! You have two guesses remaining.
17:12:14  elliott_: really, it it is pretty conceivable that i was about to get blown up! :o)
17:12:18  fungot: Wrong! You have one guess remaining.
17:12:18  elliott_: an old colonel lost, but a new brother gained. together they will ascend, each time you must be adventurin'.
17:12:25  fungot: Wrong! You have no guesses remaining. Have a nice day.
17:12:36  See, it shut up like it's supposed to and all.
17:12:44  does cakeprophet mean that he can't spam fungot's name because of the shutup
17:12:44  monqy: enter name. and a whole other issue.
17:12:55  monqy: yes you are correct!
17:12:59  good job! :>
17:13:02  :>
17:14:10  I think :> is this: http://media.tumblr.com/tumblr_lr8cphyXGf1qmiocn.jpg
17:15:35  good picture
17:17:39  monqy... monqy
17:17:40  monqy
17:17:41  fix my code
17:17:46  :(
17:18:00  is it broken
17:18:07  Yes.
17:18:16  ACTUALLY it may be: SOMEONE ELSE'S CODE.
17:18:19  Let's FIND OUT.
17:23:06  monqy: btw try runhaskelling this to be really unnerved by your terminal: http://sprunge.us/IhEb
17:23:11  you will ask... whence... crahrahchters
17:27:25  wow unnnerving
17:28:20  monqy: it is like a ghost story...... for your terminale.
17:30:05  Gregor: WHYYY DO YOU CHUNK
17:30:17  elliott_: Dah chunky chunks.
17:30:23  W;Yhy
17:30:59  OHHHH, those are /record fielsd/
17:31:03  Suddenly this library makes 10x as much sense.
17:31:41 -!- ais523 has joined.
17:34:04  elliott_: Try now.
17:34:10  Gregor: What did you do :P
17:34:20  elliott_: Made it buffer and send all at once I think :P
17:34:35  Gregor: ...but this issue is with the raw logs, which you already send content-lengths for...
17:34:39  Just not whenever I use Haskell.
17:34:48  It's literally detecting whether I'm using Haskell or not and punishing me for it.
17:34:50  elliott_: OH.
17:34:59  elliott_: I thought it was the cooked logs :P
17:35:07  It was before I realised that'd never work :P
17:35:11  Testin' progress bars here, y'understand :P
17:35:18  elliott_: Well Idonno why it's chunked.
17:35:34  I suspect this HTTP library is trying to make it be chunked for ~PERFORMANCE~ >_>
17:35:41  chunk chunk
17:36:59  :t forM
17:37:00  forall a (m :: * -> *) b. (Monad m) => [a] -> (a -> m b) -> m [b]
17:38:35  status418, statusImATeapot :: Status
17:38:35  I'm a teapot
17:38:46  -- http://hackage.haskell.org/packages/archive/http-types/0.6.6/doc/html/Network-HTTP-Types.html#v:status418
17:39:28  apparently for real
17:39:47  Yes, it's part of an April Fool's RFC.
17:39:57 -!- copumpkin has quit (Read error: Connection reset by peer).
17:40:08  Hyper Text Coffee Pot Control Protocol.
17:40:34  it's just so cute that they actually gave it
17:40:35  a name
17:40:38  in a serious library
17:40:40  :))))))))))
17:40:40 -!- copumpkin has joined.
17:41:10  Status 418 is, in fact, 418 I'm a teapot.
17:41:21  The HTCPCP server is a teapot; the corresponding entity may be short and stout.
17:41:22  https://github.com/aristidb/http-types/commit/ec22a919f865f68d3da39ccb75f5d78b331606b2
17:41:24  good! patriot
17:41:41  13:40  CakeProphet: this is a really hot look for a stronger! this is so outrageous. hell fucking yes a few more things we can deploy but some things we can  deploy but some things we can deploy but some things we can deploy but some things we can deploy but some things we can deploy but some things we can
17:41:42  CakePrsw}a{~e^is@]i[iped_a/The-Prophet-Wiza:CakeProphet: what the hell was that? but from what i understand if it is applicable in any sphere, with oceans, trees, networks of pipes, the april issue of the serious business application.
17:41:43  thank you mbbx6spp. good person.
17:41:46   deploy but some thing we can deploy but some things we can deploy but some things wee can deploy but some things we can deploy bu
17:41:49  fizzie: Another corruption bug
17:42:03  whoa there fungot
17:42:03  monqy: and so it would continue. second, you could have a 8ody again and his little blinking in and out the back in case. you never know with that crazy. conveniently, you can watch what happened right here on the monitor has not lost his copy to save her!
17:42:35  i like how fungot never like
17:42:35  elliott_: but, there are imps around, but you don't have a very exciting 24 hours or so. you say you are only here to deliver a message and then i'll put in the hallway. beyond a lot
17:42:35  crashes
17:42:39  and never permanently fucks up beyond repair
17:42:47  it's always "goes wack for half a message"
17:42:56  befunge is designed for reliable applications.
17:42:58  funge-98: durable
17:42:59  ye
17:42:59  s
17:43:08  fungot: hi
17:43:08  elliott_: and it just might be all three possible codes, yielding a radically exactly the same of you.
17:43:26 * CakeProphet lol'd in real life.
17:43:36  at which part
17:43:42  yielding a radically exactly the same you.
17:43:45  the "yielding radically exactly the same" is a direct qote
17:43:59  `log yielding a radically exactly the same you.
17:44:02  elliott_: from what
17:44:04  ^style
17:44:04  http://www.mspaintadventures.com/?s=6&p=002986
17:44:04  Available: agora alice c64 ct darwin discworld europarl ff7 fisher fungot homestuck* ic irc jargon lovecraft nethack pa sms speeches ss wp youtube
17:44:06  oh
17:44:12  2011-11-04.txt:17:43:42:  yielding a radically exactly the same you.
17:44:13  hmmm, ah yes that does sound familiar.
17:44:15  "You get the BETA (3+1+1+1), now yielding a radically different hash value with the Scrabble function.
17:44:15  Which is to say a radically exactly the same value."
17:44:26  Objective-C is soo ugly
17:44:33  but still better than C++
17:45:07   -- a goon
17:45:32 -!- MSleep has changed nick to MDude.
17:45:40  [("Date","Fri, 04 Nov 2011 17:44:55 GMT"),("Server","Apache/2.2.21 (Fedora)"),("Last-Modified","Tue, 25 Oct 2011 05:21:24 GMT"),("ETag","\"6a6180d-492e2ed-4b018b5e17d00\""),("Accept-Ranges","bytes"),("Content-Length","76735213"),("Content-Type","application/x-bzip2")]
17:45:40  FINALLY, THAT WORKS
17:45:44  monqy: friendship headers
17:46:07  :t lookup
17:46:08  forall a b. (Eq a) => a -> [(a, b)] -> Maybe b
17:46:11  elliott_: I'm having no such luck with Django 1.4
17:46:20  perhaps I shouldn't use pre-alpha releases of giant enterprisey things.
17:46:46  also maybe don't use python
17:47:09  does anyone know where i can download a bunch of really small files
17:47:15  like 100K
17:47:20  or less
17:48:28  elliott_: the internet.
17:48:33  thanks
17:48:55  http://thepiratebay.org/torrent/6554331/Papers_from_Philosophical_Transactions_of_the_Royal_Society__fro
17:48:58  maybe?
17:49:04  they may be too large.
17:49:06  gnu bloat:
17:49:10   hello-1.3.tar.gz          23-May-1993 03:00   86K
17:49:10   hello-2.7.tar.gz          28-Mar-2011 18:44  586K
17:49:45 -!- boily has quit (Quit: WeeChat 0.3.6).
17:50:02  GNU hello now includes most of gnulib.
17:50:46  what
17:50:57  hmm, I think I need some kind of task manager to do this
17:50:58  elliott_: I love how django is telling me a template file doesn't exist.
17:51:06  and then I go to check on my filesystem if it exists at that path
17:51:06  pikhq: this package manager's ui is going to be so sleek, do you have any idea
17:51:08  and, oh look, it does.
17:51:26  pikhq: run this program and you will begin to have idea: http://sprunge.us/IhEb
17:51:37  perfect spook program (TM)
17:52:50  huh
17:53:09  I hate IB
17:53:25  I like how nooga has been fully reduced to just talking about his OS X development life.
17:53:42  elliott_: God damn.
17:53:54  the sleekest of progress bars. the SLEEKEST.
17:53:57  elliott_: at least I have a trusted, permanent enemy
17:54:02  nooga: :}
17:54:10  :>
17:55:02  pikhq: btw don't ^C that program, you don't get your cursor back :P
17:55:37  "reset" says wut?
17:55:59  elliott_: How do I shot web and/or install System.Console.ANSI?
17:56:23  Gregor: Search "ansi-terminal" in apt-cache
17:56:27  If recent enough Debian there'll be a -dev package
17:56:42  libghc-ansi-terminal-dev did it for me.
17:56:50  elliott_: sid, biatch, sid!
17:57:11  That progress bar has a similar effect on me to w3m's image support.
17:57:26 -!- derdon has joined.
17:57:33  It makes me stare in horror and wonder how you can even fit that many pixels into a glyph.
17:58:02  elliott_: It phails hardcore for me, I'm betting I'm in some weird no-Unicode configuration due to shitty school configuration + SSH :(
17:58:20  Gregor: Yeah, probably best to run it locally :P
17:58:34  elliott_: FIXT
17:58:45  elliott_: That is definitely a progress bar.
17:58:59  elliott_: It is extraordinarily difficult to argue with the notion that that is a progress bar.
17:59:02  IT'S MORE PROGRESS BAR THAN TERMINALS WERE MEANT TO DISPLAY
17:59:16  I CANNOT COPE WITH THE NOTION OF A BAR MOVING LESS THAN ONE VT TABLE CELL AT A TIME
17:59:16  Indeed.
17:59:18  "CakePrs€w}a{~e^is@]i[iped_a/The-Prophet-Wiza:CakeProphet: what the hell was that?" <- how appropriate.
17:59:40  Gregor: But yeah, let's see your fancy APT give you progress bars like that!!!!
17:59:43  KITTEN POWER
17:59:46  :'(
17:59:49  I hate that when you want to replicate GUI of any known app, you have to handcode every fucking single view BECAUSE Apple gives you only button and window ;F
18:00:38  elliott_: Seems you're right about nooga.
18:00:42  Yep!
18:01:01  `learn nooga hate OS X. NOOGA SMASH.
18:01:03  I knew that.
18:01:12  X-D
18:01:38  So is there any known formula for calculating download speeds and download time remaining?
18:01:47  Like, I want something decent, not something that uses Microsoft minutes.
18:01:54  There has to be some fancy formula with weighting and shit :P
18:02:33  Nope.
18:02:37  There is only failure.
18:02:41  :'(
18:03:01 -!- ais523 has quit (Ping timeout: 248 seconds).
18:03:07  http://stackoverflow.com/questions/798800/whats-the-best-way-to-calculate-remaining-download-time
18:03:08  http://stackoverflow.com/questions/2779600/how-to-estimate-download-time-remaining-accurately
18:03:14  Gregor: Ha, I just neeed an EXPONENTIAL MOVING AVERAGE.
18:06:50  Hmm. It occurs to me... I think, in common law jurisdictions, you could actually get away with signing things using a fucking *seal*.
18:07:22  pikhq: Doin' it.
18:07:36  pikhq: You do mean the animal, right?
18:07:47  pikhq: *ARR' ARR'*
18:08:06  Gregor: I do not, sadly.
18:08:16  *snaps*
18:09:35 -!- pumpkin has joined.
18:09:47  Oh, wait, I think you could.
18:09:59  A signature is any mark or action that indicates identity and intent.
18:10:07  Brand your seals and you should be good.
18:10:45 -!- pumpkin has changed nick to copumpkin_.
18:10:55 -!- copumpkin has quit (Disconnected by services).
18:10:59 -!- copumpkin_ has changed nick to copumpkin.
18:12:31  @hoogle Integer -> Integer -> Rational
18:12:31  Data.Ratio approxRational :: RealFrac a => a -> a -> Rational
18:12:31  Data.Ratio (%) :: Integral a => a -> a -> Ratio a
18:12:31  Data.Bits (.&.) :: Bits a => a -> a -> a
18:12:44  aaaargh
18:15:52  Hell. I think tattooing something on you would count as a "signature".
18:16:03  Gotta love common law.
18:20:56  OMG it's working :D
18:21:19  pikhq: Gregor: What does Unicode have to offer in the way of fun spinners???
18:21:28  \|/- is so passe.
18:21:55  elliott_: Hmmmmmmmmmm
18:22:42  Spinning arrows??? Spinning SNOWMEN??? GOATS???
18:22:53  Pile of poo becoming slowly more and more gross until a dog eats it???
18:22:55  Ew.
18:23:42 -!- pumpkin has joined.
18:24:01  elliott_: http://www.fileformat.info/info/unicode/char/2196/index.htm and http://www.fileformat.info/info/unicode/char/2197/index.htm tick-tocking like a metronome.
18:24:14  X-D
18:24:18  I like it.
18:24:43  There's actually a large set of arrows.
18:24:59  Gregor: Ooh, these four are promising:
18:25:01  http://www.fileformat.info/info/unicode/char/21b0/index.htm
18:25:02  http://www.fileformat.info/info/unicode/char/21b1/index.htm
18:25:03  http://www.fileformat.info/info/unicode/char/21b2/index.htm
18:25:05  http://www.fileformat.info/info/unicode/char/21b3/index.htm
18:25:27  ←↖↑↗→↘↓↙
18:25:31  Except the set isn't complete >_<
18:26:03  What I'd really like is, like, ten rotations of ↺ :P
18:27:04 -!- copumpkin has quit (Ping timeout: 276 seconds).
18:27:47  OMG wait, there's more right blocks than I thought?
18:27:58  spinning nipple
18:28:00 -!- pumpkin has changed nick to copumpkin.
18:28:07  oh, Apple took that
18:28:46  elliott_: There's a symbol for each phase of the moon.
18:28:50  Note, not in common fonts.
18:29:10  Argh >_< pikhq: What codepoints are these: ▎▍▌▋▊▉
18:29:17  :p
18:29:38  OMG, what if I cycled rapidly through random Braille characters as my spinner.
18:29:41  That would look so cool.
18:29:43  http://www.fileformat.info/info/unicode/block/block_elements/list.htm
18:29:46  There's the block.
18:29:49  elliott_: That ... is pretty great, actually.
18:29:58  elliott_: Make it binary counting.
18:30:10  maybe something Korean? -> http://lcweb2.loc.gov/diglib/codetables/9.3.html
18:30:13  Gregor: I stole that from a Stack Overflow answer >_> But, god damn, that's such an inspired idea :P
18:30:35  pikhq: Wrong
18:30:35  elliott_: Similarly you could use some of the "quadrant" blocks in what pikhq just posted.
18:30:49  pikhq: Note how it has all the ones from the left, but only a few from the right
18:30:53  I need to know where the other ones from the right are :P
18:31:22  nooga: Maybe
18:31:33  OMG ◴ ◷ ◶ ◵
18:31:41  Someone write a one-liner to cycle through those, I cannot believe it doesn't look cool.
18:32:47  $ while true; do echo -ne '\r◴'; sleep 0.1; echo -ne '\r◷'; sleep 0.1; echo -ne '\r◶'; sleep 0.1; echo -ne '\r◵'; done
18:32:50  Not as good as I hoped :P
18:35:47  elliott_: 's too small I think.
18:35:53  Yeah
18:38:25  .:፧
18:38:28  while true; do echo -ne '\r┭'; sleep 0.1; echo -ne '\r┮'; sleep 0.1; done
18:38:29  NAILED IT
18:38:47  Gregor: Wow, what :P
18:38:55  It's... wriggling...
18:38:57  It's a spinner, viewed on its side :P
18:39:06  ...X-D
18:39:49  ⁘⁙
18:40:08  -ne?
18:40:48  Sgeo|web_: ?
18:41:57  ⁘ ⁙
18:42:04  while true; do echo -ne '\r\xE2\x96\x9A '; sleep 0.2; echo -ne '\r\xE2\x96\x9E '; sleep 0.2; done Perfection
18:43:10  Gregor: It's dancing.
18:44:44  while true; do echo -ne '\r⁘'; sleep 0.2; echo -ne '\r⁙'; sleep 0.2; done
18:45:38  .፧ is definitely like .: but with three arguments.
18:45:55  except it's not a valid operator character. :(
18:46:10  elliott_: while true; do echo -ne '\r\xE2\x97\xBB\xE2\x97\xBD\xE2\x97\xBD '; sleep 0.1; echo -ne '\r\xE2\x97\xBD\xE2\x97\xBB\xE2\x97\xBD '; sleep 0.1; echo -ne '\r\xE2\x97\xBD\xE2\x97\xBD\xE2\x97\xBB '; sleep 0.1; echo -ne '\r\xE2\x97\xBD\xE2\x97\xBB\xE2\x97\xBD '; sleep 0.1; done
18:46:29  Gregor: Enjoying ourselves? :P
18:46:35  elliott_: Yes, but this one is legit good.
18:46:45  It is, but I can only use something one char wide >__>
18:47:02  Gregor: Because it'll turn into a ✓ once it's done :P
18:47:06  A GREEN ✓.
18:47:11 * elliott_ usability expert
18:48:16  usability experts are tools, ha ha ha
18:48:20 -!- derrik has quit (Quit: dive).
18:50:58  nt
18:51:41  elliott_: So replace it with space check space *shrugs*
18:52:31  Gregor: I'll consider it :P
18:53:18  Of course, ideally the Unicode consortium would be adding characters just for this.
18:53:21  MEATSPIN NORTH WEST
18:53:22  MEATSPIN NORTH
18:53:24  MEATSPIN NORTH EAST
18:53:27  MEATSPIN EAST
18:54:52  ELLIOTIAN MEATSPIN *
18:55:06  Wow, this code structure is going to be a pain :P
18:55:21  I need to support fully concurrent, independently-updated tasks and redraw the screen whenever any of them makes progress.
18:55:29 * elliott_ decides to throw threads at the problem.
18:55:50  ever thought about.... GUI?
18:56:03  Yeah, I should write a lovely Cocoa program with that wonderful Interface Builder.
18:56:07  yeah
18:56:08  It'll make this package manager so much better.
18:56:31  you cold write some beautiful NSView subclasses
18:56:36  and stuff
18:56:38  gradients
18:56:41  you know
18:57:12  FFFFFFUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU ry23q;0482y[09234n]901yn]-9yn]52~nty]]Ō€5~t480ee4q
18:57:33  I hate my job
18:58:47  nooga: Don't worry, it hates you too.
18:59:41  the worst part is that I'm my own boss ;F
19:00:29  I suggest: Doing a job that is a different job to that.
19:00:37 * Gregor nods sagely.
19:03:41 -!- ais523 has joined.
19:03:46  Is there a nicer way of getting the terminal width than `tput cols`?
19:04:02  One that doesn't involve shelling out.
19:04:19  elliott_: you can simulate tput cols by hand, I guess
19:04:24  What does echo -ne do?
19:04:26  And the \r?
19:04:30  ais523: That's sort of what I'm asking.
19:04:36  I guess the -e makes the \r do something?
19:04:38  By sort of I mean exactly.
19:05:10 -!- Guest63524 has quit (Read error: Connection reset by peer).
19:05:23  hmm, Apache have stopped maintaining Harmony?
19:05:42  elliott_: as far as I know, it's writing a particular terminal-dependent control string, then reading back from the terminal
19:05:48  Ugh
19:05:54  so I suppose technically, you write stdout then read stdout
19:05:59  just in case it's different from stding
19:06:01  *stdin
19:06:04  Deewiant: You shoulda told me ansi-terminal didn't do width :P
19:06:11  EVERYTHING IS SOMEBODY ELSE'S FAULT
19:06:12  ...read stdout?
19:06:23  Sgeo|web_: why not?
19:06:23   *stdin
19:06:28  it's typically open both ways
19:06:28  but it's perfectly possible
19:06:31  elliott_: that was a correction on "stding"
19:06:38  oh, heh
19:06:45 * Sgeo|web_ may have to fix PSOX
19:06:51  OH NO PSOX IS BROKEN
19:06:53  (Note: Not actually going to fix PSOX)
19:07:05  elliott_: ah, it isn't, it's an ioctl
19:07:16  TCGETS, to be precise
19:07:23  ioctls are famous for being mostly undocumented
19:07:39 * elliott_ has worked with terminal ioctls before. :-(
19:07:57  you know what, I'll just assume your terminal is 80 columns wide for now
19:08:13  ............django
19:08:13  why
19:08:14  elliott_: however, I think that one might be implemented by the Secret Project
19:08:26  the only thing worse than trying to use ioctls is trying to implement them, or something like that
19:08:33  (note: worse things exist but wouldn't make for as pithy a quote)
19:08:53 -!- Slereah_ has joined.
19:10:53  reimplementing a quarter of wget with a nicer UI sure isn't fun
19:12:30  elliott_: does wget have a programmatic interface that lets you connect it to your own progress counter, like fsck does/
19:12:46  ais523: just --progress=dot
19:12:54  and screen-scraping
19:13:00  (there's no terminal codes, but still)
19:13:06  :(
19:13:35  ais523: why do you think I'm rolling my own? :P
19:13:58  I was wondering if there was one and you didn't know of it
19:14:02  I didn't know of fsck's for ages
19:14:20  (I've never actually used it from code, although the system uses it to display fsck progress on the splash screen)
19:14:36 -!- derrik has joined.
19:14:59  data Task = Task
19:14:59    { taskName :: TVar String
19:14:59    , taskProgress :: TVar Rational
19:14:59    , taskProgressInfo :: TVar String
19:14:59    , taskDone :: TVar Bool
19:15:00    }
19:15:02  I guess this is coming together
19:15:18  hmm... maybe that should all be in a single TVar; it's not going to get independently modified
19:15:43  what is that for?
19:15:50  package manager!
19:15:54  yeah
19:16:00  but what is the package manager for
19:16:07  ais523: (apparently I can't write an interactive-ish console program without trying to surpass darcs' UI in every way)
19:16:10  nooga: Kitten
19:16:21  what was Kitten, again?
19:16:55  elliott_: darcs' UI is great although not perfect, so surpassing it is always going to lead to good UIs
19:17:29  nooga: linux distro!
19:18:03  oh right
19:18:06  ais523: My programs are pretty much either completely unusable requiring like ten shell scripts to thread them together and modifications to work with anyone else's stuff but mine, or COMPLETELY FLAWLESS HANDCRAFTED UIs.
19:18:08  (Mostly the former.)
19:19:06 -!- Zuu has joined.
19:19:33  elliott_: how it would be different from other linux distros?
19:20:15  nooga: purely functional package and configuration manager (a la Nix), generalised to be a complete service manager; seamless multilib support; hopefully not very crap???
19:22:22 -!- sllide has quit (Read error: Connection reset by peer).
19:23:37  do you have packages to manage?
19:25:42  elliott_: Hmm. So, this would probably seamlessly handle multiple libcs.
19:25:51  pikhq: Yep.
19:26:05  And thus could be the basis for a musl-and-glibc distro.
19:26:11  nooga: Sure, every package in a Linux distro shall be managed. Also the entirety of language-specific repos like CPAN and Hackage, seamlessly and automatically.
19:26:12  (glibc for everything that can't be musl)
19:26:35  pikhq: Yep. I'm actually intending to start off with a "regular" glibc/gcc setup and then move to musl as it becomes more usable (i.e. C++ support for WebKit :-P)
19:26:46  Sounds about right.
19:26:48  what's musl?
19:26:56  pikhq: The nice thing about the purely-functional package management model is that dynamic linking literally means nothing any more.
19:27:10  It's a minor space tradeoff, a very slight time tradeoff.
19:27:14  ais523: musl is an alternate libc that features better performance than glibc and better size than uclibc.
19:27:18  Saves a bit of network bandwidth for delta updates.
19:27:33  While also being written reasonably well.
19:27:46  elliott_: what if the system crashes and the partition with the libraries on can't be mounted?
19:28:09  ais523: Then the system is fucked, *just like any recent Linux distro*. :)
19:28:12  ais523: you mean the only partition that contains packages?
19:28:15  ais523: We all want Web o' Flies, why are you restricting it to elliott_? :(
19:28:23  Gregor: I'm PMing it on request
19:28:27  are you requesting?
19:28:29  ais523: REQUEST
19:28:37 * pikhq requesteth as well
19:28:46  ais523: I leaked a bit of your valuable IP in the form of the jawdropping comments, sry about that :P
19:28:46  Jesus this is too brilliant for me to not look at. :)
19:29:42  wow, all the comments on the first screenful are indicative of one insanity or another
19:29:58  and that's just in the preprocessor statements to include relevant headers with relevant options
19:30:30  I appreciate your _POSIX_C_SOURCE.
19:30:38  Though _GNU_SOURCE should suffice.
19:30:49  pikhq: no, the value I defined it to is significant, believe it or not
19:30:51  but I forget why
19:31:00  199309L is rather higher than the usual setting
19:31:25  Probably disabling some newer POSIX features.
19:32:25  oh right, the first bit after the #includes is pretty crazy too
19:33:02  I'm defining a couple of structs that aren't in any include files; the docs say you have to define them yourself, and the docs /also/ miss out a field, so if you try to define them to the docs it won't work
19:34:17  (that's for the syscall getdents; you're not supposed to use it directly, rather using a wrapper, but you can do a few things with it that you can't via the wrapper, such as listing amazingly large directories, and ofc weboflies is at the receiving end of syscalls so it has to understand getdents, not the libc equivalents)
19:34:28  Oh, it's also x86-specific.
19:35:00 -!- zzo38 has joined.
19:36:32  Where the hell is vt_kd_kbentries, anyways?
19:37:00  oh, it's in a separate file, let me paste that too
19:37:09  *Ah.*
19:37:13  http://sprunge.us/KKPf
19:38:03  ais523: I can give you a build script
19:38:11  gcc -o weboflies -m32 -O2 -g --std=gnu99 -Wall -Wextra -Wno-missing-field-initializers -Wno-missing-braces weboflies.c ktt.c -lrt -lpng
19:38:15  ktt.c is that other file ais523 just pasted
19:38:17   199309L is rather higher than the usual setting <-- hm?
19:38:26  Vorpal: for _POSIX_C_SOURCE, IIRC
19:38:27  Wait, what does `? actually do?
19:38:30  `? ?
19:38:32  ​? is wisdom
19:38:56  ais523, take a look at man 7 feature_test_macros
19:39:02  ais523, it should explain how it works
19:39:04  ais523: no, it's usually > 2001 or so
19:39:06  for the year part
19:39:30  ais523, defining it to 1 just exposes the original POSIX
19:39:45  usually I define it to 200112L for POSIX.1-2001
19:39:53  or 200809L for POSIX.1-2008
19:40:40  elliott_, I have to say that the way _XOPEN_SOURCE works in is weird. 500,600,700? How does that make sense
19:40:47  Vorpal: magic!
19:40:56  On Tuesday, FreeGeek Vancouver fixed the mail, they changed it from GNU mail to BSD mail and it could send/receive properly. But on Wednesday it broke again, somehow reverting to GNU mail. On Thursday, it worked again!
19:40:57  yes yes, magic constants
19:41:05  Vorpal: it's like BASIC line numbers, it's so they can add other values in between
19:41:38  ais523, but why start at 500 hm
19:41:47  Vorpal: It's "5.0.0", "6.0.0", "7.0.0"
19:41:54  ah, makes sense
19:42:04  pikhq, what happened to 4.0.0 though?
19:42:10  Fuck if I know.
19:42:14  and other lower numbers yeah
19:42:15  hm
19:42:31  isn't X's current version at 11, anyway?
19:42:48  Ah. They didn't use that macro for earlier versions.
19:43:06  Some idiot is setting fireworks off outside, since they apparently can't count past three.
19:43:06  ais523: This is the X/Open Portability Guide standard.
19:43:16  *Not* the X Windowing System.
19:43:46  why would two different things be called X?
19:44:11  Because people believe in confusing you.
19:44:34  = ERROR: stat proc/pid/fd: Permission denied
19:44:35  YAY
19:44:39  pikhq: join the club
19:44:51  it only works for ais523 :)
19:44:55  everyone else gets that error
19:44:59  all two of us
19:45:07  (you can generalise from two examples! I just did it!)
19:45:22  elliott_: I'd /guess/ that something's changed in Linux's handling of perms
19:45:40  http://sprunge.us/fERT And my Makefile.
19:45:45  along the lines of "you can't read a process's fds if there's ever been a root-owned process in the history of processes since"
19:46:15  I suppose you could just comment out the permission dropping in the main process, but that would be insane
19:46:27  (admittedly, it's insane enough as-is, but I don't want to make it even worse)
19:46:44  either that, or keep the root perms in reserve for when they're needed; I don't like doing that either, but it's more secure than running as root constantly
19:46:58  "6:54 remaining @ 1 Mio/s" <-- hmm, this seems worryingly long
19:47:04  there's not much space left for the filename
19:47:19  what filename lengths are you expecting?
19:47:21  ais523, hm what kernel version are you on then that make it work?
19:47:33  2.6.32-35-generic
19:47:41  ah, 10.04 LTS?
19:47:42  right
19:47:53  And I'm testing on 3.0.0-1-amd64.
19:47:58  ^Cibreoffice-af-3.4...   368.0K  398.0K/s 00:00:02 [#####-----------------]  27%
19:47:58  ok, that's what pacman's looks like
19:48:37  I think it's only just new enough to run weboflies, which requires something along the lines of 2.6.30
19:48:38  or newer
19:49:11   "6:54 remaining @ 1 Mio/s" <-- hmm, this seems worryingly long
19:49:11   there's not much space left for the filename
19:49:12  uh
19:49:14  where?
19:49:16  aww, I just had a great idea that would require me to abandon my smooth progress bar format
19:49:31  include the progress at the head of the progress bar itself, white on green
19:49:40  elliott_: like AceHack health bars?
19:49:49  Hmm
19:50:01  Would there be any problems with killing Flash when it's not in use?
19:50:04  elliott_, as long as it work over serial console :P
19:50:07  (not really)
19:50:12  ais523: I don't recall
19:50:36  hmm... /me decides that seeing how much of the file in absolute terms has downloaded so far is useless
19:50:42  a progress bar + total filesize is enough
19:51:08  "8 Gio @ 1 Mio/s; 6:54" that's better
19:51:19  Sgeo|web_: on this system, Flash isn't even running when it's not in use
19:51:31  $ killall plugin-container
19:51:32  plugin-container: no process found
19:51:41  and I assume other systems are the same
19:52:01  Vorpal: Funny thing is, almost everything that works with a Linux virtual terminal should work over a serial console.
19:52:20  The concept of a "terminal" is such a stupidly naive thing.
19:52:46  pikhq: well, it works with a couple of FIFOs and a bunch of lying about the results of ioctls
19:53:10  ais523: Yeah.
19:53:17  pikhq, well one connected to a line printer I meant ;P
19:53:20  It's a heck of a lot of lying to get programs to think it's a serial terminal.
19:53:28  ktt.c is a lookup table for the results of the ioctl to get the keyboard translation table
19:53:42  I have no idea what it means (and have failed to figure it out via looking at it); I obtained it by experiment
19:53:47  Vorpal: I'd be surprised if even vi worked like that.
19:53:56  pikhq, fair enough
19:54:05  I'm not getting programs to think it's a serial terminal; I'm getting them to think it's a VT (ctrl-alt-F1 style)
19:54:19  and that they have complete control over the keyboard and screen while it's active
19:54:26  ais523: I'm discussing Linux's normal handling of pty's.
19:54:33  ah right
19:54:41  actually, I think weboflies does connect to a pty
19:54:45  but disguises it as a tty
19:54:46  You, obviously, are adding extra magic on top of that. :)
19:56:32  you know, I think I might be concentrating a little too much on this package manager's download UI
19:57:29  elliott_: never
19:57:39  UI IS LIKE
19:57:43  THE KNOBS AND THE BUTTONS
19:57:47  THE STEERING WHEEL
19:57:53  YOU WANT YOUR PRODUCT TO BE SHARP.
19:57:58  AND EASY TO OPERATE.
19:58:06  the UI is the face
19:58:08  that greets your user.
19:58:27  More typically, the UI is the hammer. That beats your user.
19:58:29  a face of knobs and buttons and a steering wheel? that's not a pretty face
19:58:49  tells him or her what's up, provides an... interface... for the user
19:58:51  a user interface.
19:59:16  the UI is the anvil upon which the user must beat its head
20:05:06   you know, I think I might be concentrating a little too much on this package manager's download UI <-- yes
20:05:14 -!- zzo38 has left.
20:05:19  no :)
20:05:25  i fucking hate pacman's and apt's
20:05:30  elliott_, personally I would probably start out just calling out to wget, then later on I would try to format the output a bit
20:05:41  why? a call to wget is one line, there's no point
20:05:45  I know exactly how it'd work
20:05:54  I don't need to prove-of-concept to myself that I can call wget
20:06:07  oh I thought you were doing the actual implementation
20:06:21  I am
20:06:25  I would have done download the easy way
20:06:41  what does that buy me?
20:06:50  I'll have to replace it later on, anyway
20:12:21  "Search within an incognito window to avoid the Google bubble. Or you could get the Tor browser." — Sensible advice from reddit on how to get rid of search tuning temporarily.
20:12:24  Agua di Gio
20:16:22  progress: thread blocked indefinitely in an STM transaction
20:16:22  Oh no.
20:20:57  elliott_: The thing is that by doing the naive thing first you can get *working* code quickly.
20:21:12  pikhq: I already know how to write a working wget call :)
20:21:23  It is far easier to make working code better than to make perfect ideas work. :)
20:22:03  the ancient problem of enginieers: idealism
20:30:18 -!- derrik has left.
20:30:26 -!- zzo38 has joined.
20:31:16 -!- GreaseMonkey has joined.
20:33:49 -!- zzo38 has left.
20:39:21 -!- pumpkin has joined.
20:42:20 -!- copumpkin has quit (Ping timeout: 258 seconds).
20:44:22  I'm trying to code patch-bay-like view in cocoa
20:44:35  and it sucks ;|
20:45:42 -!- sebbu has quit (Read error: Connection reset by peer).
20:46:07 -!- sebbu has joined.
20:46:11 -!- sebbu has quit (Changing host).
20:46:11 -!- sebbu has joined.
20:55:53 -!- Sgeo|web_ has quit (Ping timeout: 265 seconds).
20:56:34 -!- Zuu has quit (Ping timeout: 244 seconds).
20:56:55 -!- SgeoN1 has joined.
20:57:50  I'm starting to get concerned about the frequency of non REISUBable freezes
20:58:13 -!- Zuu has joined.
20:58:47  SgeoN1: hardware troubles?
20:58:55  Is there a way to measure wear and tear on a flash drive?
20:59:03  twice, maybe
20:59:26  Is the flash drive is a recent SSD, it probably reports interesting numbers via SMART.
20:59:51  But non-responsive drives should not prevent the B in REISUB from working.
20:59:54  It's a thumb drive
21:00:34  For thumb drive, forget it. Maybe there are special controller-vendor-specific tools that could do it.
21:00:58  But for that you first would need to know the controller type, and then try to get hold of that tool (if any).
21:02:02  Most non-REISUBable freezes I experienced lately were caused by broken laptop mainboards (most likely BGA solder joints broken).
21:03:31 -!- Phantom__Hoover has left ("Leaving").
21:03:36 -!- Phantom__Hoover has joined.
21:07:29 -!- Gregor has set topic: Official support channel for Web o' Flies | EPL evening school assignments! http://tinyurl.com/5stnu5n | It's the end of an era | RIP John McCarthy) | TO SHREDS!) |  http://codu.org/logs/_esoteric/.
21:12:52  friendship headers?
21:14:15  Freaders.
21:16:10  So I learned some topology today, it seems to be the study of blobby shapes?
21:16:32  :D
21:16:51  bloody shapes
21:17:24 -!- Ngevd has joined.
21:17:34  Well, I spent today in a hot stuffy room
21:17:43  Listening to boring people drone on and on and on
21:18:03  good day
21:18:09  That's right, I've been to the House of Commons!
21:18:25  I don't go there
21:18:28  Did you know that they let you do that for the hell of it?
21:18:40  Yuo
21:18:50  monqy: really; im shocked
21:18:51  yuo
21:18:58  Turns out there's a public gallery.
21:19:02  yup
21:19:17  elliott_: about it working ore what
21:19:32  monqy: about no go house comon
21:19:42  I met Guy Opperman
21:19:57  monqy, you're an ore worker?
21:19:58  I don't meet that Guy
21:20:17  "Guy Thomas Opperman[3] (born 18 May 1965) is a British Conservative Party politician,"
21:20:21  Sounds lovely.
21:20:48  What is it with Conservatives anyway. There are so many of them.
21:20:52  Are they Tribbles.
21:21:30  Yes.
21:22:14  I guess we need more klingons
21:23:06  You always need more Klingons.
21:23:19  What problem can't be solved by throwing Klingons at it?
21:23:32  the problem of having too many klingons
21:23:45  That's the best bit
21:23:46  trick answer; there is no such thing
21:23:58  hmm, actually... they might start killing each other and solving that problem too
21:23:58  If you have too many klingons, they start killing eachother
21:24:05  olsner, of course it solves that, they're Klingons for christ's sake.
21:24:36  what if they decide it's more honorable to increase the number of klingons?
21:24:46  hmm
21:24:48  More Klingons.
21:24:49  Then they are no longer Kilingons
21:24:52  test :: IO (TChan TaskStatus -> IO (), IO ())
21:24:56  ok this will work
21:25:00  s/Kil/Kl/
21:25:00  If that doesn't work, hypervelocity Klingons.
21:25:01  killingons :>
21:25:03  I guess I will use a TChan for the TChans????
21:25:07  So many TChans.
21:25:25  tchan
21:35:10  Wow, there's actually sockpuppeting on the IWC forum
21:35:15  Over Russian translations
21:39:32 -!- pikhq_ has joined.
21:39:33 -!- pikhq has quit (Ping timeout: 256 seconds).
21:44:35  OK, here we go: http://bitbucket.org/GregorR/web-o-flies
21:49:58  Supposed to be a broken link?
21:50:03 -!- Patashu has joined.
21:54:27  "The cat righting reflex is a cat's innate ability to orient itself as it falls in order to land on its feet. The righting reflex begins to appear at 3-4 weeks of age, and is perfected at 7 weeks."
21:54:56  I want to be the person who dropped kittens and checked if they righted themselves.
21:57:23  Ngevd: SHHHH YOU'RE RUINING MY JOKE/TROLLERY
21:57:35  zzo38 is adding Gopher menu format support to Haddock.
21:57:51  He...
21:58:08  Gopher...
21:58:15  Haddock...
22:00:03  Fun fact: [[Falling cat problem]] links directly to Yang-Mills theory.
22:04:02 -!- pikhq_ has quit (Ping timeout: 240 seconds).
22:04:21 -!- pikhq has joined.
22:06:00  shachaf: It's great having zzo around in that channel, isn't it?
22:06:56  elliott_: I don't think we've had quite these kinds of proposals from anybody else.
22:07:00  zzo channel is good channel
22:09:08  http://upload.wikimedia.org/wikipedia/commons/7/78/Cat_fall_150x300_6fps.gif
22:09:13  Phantom__Hoover: I am so happy you made me find this image.
22:09:45  I love the overlayed angular momenta.
22:10:21  that image because of how good it is reminds me of http://upload.wikimedia.org/wikipedia/commons/e/e2/Sch%C3%A9ma_synchronicit%C3%A9_in_English.png
22:12:38  There is nothing that is not perfect about that diagram.
22:13:21 -!- zzo38 has joined.
22:13:41  Speak of the devil...
22:14:03  What about the devil?
22:14:21  monqy: i want to know the logic behind that diagram... actually i don't
22:14:35  monqy: i will just choose to believe someone thought of four random things and arranged them on a plus sign
22:15:40  Should Haddock output format have:  Plain TeX, gopher menu format, Plain Old Documentation, MediaWiki, etc
22:16:32 -!- derdon has quit (Remote host closed the connection).
22:16:55  I don't particularly like Haddock markup format so I made up idea of a different format:   http://sprunge.us/jdWh
22:17:16  It's perfect. Tell #haskell about it.
22:17:22  I did already.
22:17:28  better
22:17:32  Keep telling them.
22:17:32  make a replacement for TeX
22:17:37  Don't ever stop.
22:18:00  yeah
22:18:00  Phantom__Hoover: Not right now. Maybe later, when they are different people on that channel, such as the people who invented Haddock.
22:18:07  zzo38: definitely insist on .doc
22:18:20  that's a good descriptive file extenstion that's totally unique
22:19:15  The extension doesn't really matter as long as it is agreed on. Of course anything in this proposal is subject to changing.
22:19:25  he had dock.
22:19:29  but that was four letters
22:19:36  which was tooooooooooo many
22:19:59  It is OK to have more than three letters in the extension if you want to; I do not think Haddock is a DOS program!!
22:20:25  perhaps .hdd
22:20:26  quintopia: So he had to dock the last letter?
22:20:39  for "hickory dickory dock"
22:21:43  Read it and tell me if each individual thing is wrong, please.
22:22:31  i read it. i don't even know what haddock is so i can't answer that question.
22:26:06 -!- Ngevd has quit (Ping timeout: 260 seconds).
22:31:39  Does the people managing the account for HackageDB have UNIX mail? I send a UNIX message to them and I don't know if it work.
22:31:49 -!- elliott_ has quit (Ping timeout: 248 seconds).
22:32:57  Maybe it doesn't work; my name is not on there.
22:44:01  One day I invented a chess variant with the INTERCAL commands.
22:44:16  zzo38: You invent a lot of things.
22:44:57  Probably many people working in esolangs invent a lot of things it seems to be.
22:46:05  zzo38 is like that leading character in Lovecraft who only exists for the protagonist to chart the grizzly demise of.
22:54:32  lol
22:54:50  Phantom__Hoover: which is your favourite piece by Lovecraft?
22:55:17  Haven't read many; I read The Colour Out Of Space and didn't sleep that night.
23:03:02  fungot: So what about those queer angles that can be used for extradimensional travel?
23:03:03  fizzie: for hours he climbed with aching and fnord hands, induced to purchase escape at the price of the fnord and i wondered whether asenath could possibly have covered. yet nothing of what i had
23:19:49 -!- ais523 has quit (Remote host closed the connection).
23:23:35  Why does it says "No instance for (IsString ByteString)" even though it says it does?
23:24:52  Because it doesn't.
23:25:04  Import the right module -- .Char8 -- or, better yet, don't use ByteStrings as Strings (they're not).
23:26:33 -!- sllide has joined.
23:48:00  Some Ukranian guy appears to have been overloading my server sometimes.
23:48:42  Or at least their ISP is Ukranian.
23:49:09  Solution: Bomb Ukraine.
23:50:45 -!- CakeProphet has quit (Ping timeout: 248 seconds).

2011-11-05:

00:13:14 -!- madbr has joined.
00:13:23 -!- Phantom__Hoover has quit (Quit: Leaving).
00:20:50 -!- pumpkin has quit (Quit: Computer has gone to sleep.).
00:43:47 -!- copumpkin has joined.
00:49:54 -!- sllide has quit (Read error: Connection reset by peer).
00:55:58 -!- copumpkin has changed nick to JesusGarcia.
00:56:11  OK, I got the Haskell program to load the \fontdimen values from a TFM font.
00:56:15 -!- JesusGarcia has changed nick to copumpkin.
00:56:25  Now I just need to add the other stuff too.
00:57:22 -!- Darth_Cliche has joined.
01:07:43  The "makeFont" function takes thirteen parameters, ten of which are applied using the <*> operator.
01:08:05 -!- Vorpal has quit (Ping timeout: 248 seconds).
01:09:39  (map fromEnum <$> (mReadData h 12 :: IO [Word16])) >>= \z -> makeFont n m z <$> mReadData h (z !! 1) <*> mReadData h ((z !! 3) + 1 - (z !! 2)) <*> mReadData h (z !! 4) <*> mReadData h (z !! 5) <*> mReadData h (z !! 6) <*> ........
01:27:04 -!- SgeoN1 has quit (Read error: Connection reset by peer).
01:27:22 -!- SgeoN1 has joined.
02:00:07 -!- CakeProphet has joined.
02:00:35  guard is a very useful command, I have used it with the list monad and with the Maybe monad.
02:00:46 -!- Darth_Cliche has quit (Quit: You are now graced with my absence.).
02:18:47  ninuini\
02:23:37  yes
02:23:42  i agree
02:23:49 -!- copumpkin has quit (Ping timeout: 260 seconds).
02:24:14 -!- copumpkin has joined.
02:34:54  i met a burglar
02:35:21  chatted with him for 5 minutes, went home and called the cops. will prolly be stabbed soon enough :D
02:35:27  Now I made the entire part of the Graphics.DVI program for loading font metrics.
02:36:25  Because it is a functional programming language, it is entirely different to the other programs for doing so.
02:40:25  Inside of a record syntax it has the code:   fontDimen = 0 : transEnum (shiftR (head pa) 4) : (rescale fsc <$> tail pa), firstChar = transEnum $ hdr !! 2, leftBoundChar = guard (last lk >= 0xFF000000) >> makeLigKern ke' (drop (fromEnum $ last lk .&. 0xFFFF) lk),
02:42:33 -!- nooga has quit (Ping timeout: 255 seconds).
02:53:35 -!- Zuu has quit (Ping timeout: 244 seconds).
03:02:53 -!- Madoka-Kaname has quit (Read error: Operation timed out).
03:09:11 -!- Madoka-Kaname has joined.
03:09:11 -!- Madoka-Kaname has quit (Changing host).
03:09:11 -!- Madoka-Kaname has joined.
03:09:51  However it doesn't check that the font file is valid, so it is possible to get runtime errors if something tries to access index in a table that is larger than the number of items in that table.
03:46:02 -!- tiffany has quit (Quit: Leaving).
03:51:42 -!- variable has quit (Excess Flood).
03:53:37 -!- variable has joined.
03:59:15 -!- variable has quit (Excess Flood).
04:01:38 -!- variable has joined.
04:14:20  So I finally implemented WebSplat Zalgofication.
04:14:23  And it's SO SLOW :(
04:24:26  What does Zalgofication mean?
04:28:46  This is instructions for a chess variant I invented a while ago, and I wrote it on paper. I will describe: Except for the king, the pieces are flat, and the owner is known by the direction they are facing, rathan than by colors. The king is tall piece like a tombstone. Pawns move one space directly forward (even when capturing), and cannot promote. There are six other kind of pieces.
04:28:58  1 (Cannon): Moves like Chinese cannon.
04:29:04  2 (Rider): It is (2,0) rider.
04:29:53  3 (Abstain): As rook, can capture your own as well as opponent's pieces. It destroys itself (going to opponent's bench) whenever it capture something. Toggle abstain mark of the type and owner of the captured piece. Abstained pieces cannot move.
04:30:52  4 (Mingle): Cannot capture. Move orghogonally an even number of spaces, and can jump over other pieces. Contents of squares it jumps over are interleaved (e.g. ABCD -> ACBD, ABCDEFGH -> AEBFCGDH).
04:31:22  5 (Ignore): Move like a rook but cannot capture. Toggle ignore mark of square moved from. Ignored squares cannot be moved into except by number fives.
04:32:14  6 (Select): No displacement capture. Move one orghogonally then over any number of squares rookwise. Pieces on squares with a piece of same type on adjacent square (opposite direction of first move) are captured by you (you choose order). Other ones fall towards first moved space stops on square just before reaching it.
04:43:56 -!- oerjan has joined.
05:03:55  I have read something about a probability monad. It seem to me, it would be, return makes one value with 1 probability, fmap maps the values, join multiplies the inner probabilities by the outer probabilities, (>>) just results in the value on the right, (>>=) applies a probabilistic function to values. Actually, I think the probability values could be any monoid; it doesn't have to be a number.
05:05:04  Although if it is a number, and the contained value is of a type having equality, then you can simplify by adding the probabilities together, by having a separate function that does that.
05:23:31 -!- MDude has changed nick to MSleep.
05:39:54 -!- GreaseMonkey has quit (Quit: The Other Game).
06:21:53  Gregor: iei
06:22:14  eieio
06:22:14  oerjan: You have 2 new messages. '/msg lambdabot @messages' to read them.
06:23:57  that elliott, so calm and patient
06:25:41  > ala Sum foldMap [1,2,3,4]
06:25:42    Not in scope: `foldMap'
06:25:49  @_@
06:26:07  > ala Sum Data.Foldable.foldMap [1,2,3,4]
06:26:08    10
06:26:24  fancy
06:26:52  @tell elliott fancy
06:26:52  Consider it noted.
06:28:15  45*60*25
06:29:07  > ala Product Data.Foldable.foldMap [45,60,25]
06:29:07    67500
06:29:56  yeah i did it with bc :P
06:37:34 -!- CakeProphet has quit (Ping timeout: 260 seconds).
06:41:31 -!- hagb4rd has quit (Ping timeout: 240 seconds).
06:59:14  :t ala
06:59:15  forall o n b n' o'. (Newtype n o, Newtype n' o') => (o -> n) -> ((o -> n) -> b -> n') -> b -> o'
06:59:31  @src ala
06:59:31  Source not found. There are some things that I just don't know.
06:59:36  @hoogle ala
06:59:37  Data.List intercalate :: [a] -> [[a]] -> [a]
06:59:37  Graphics.UI.GLUT.Callbacks.Window DialAndButtonBoxButton :: ButtonIndex -> KeyState -> DialAndButtonBoxInput
06:59:37  Graphics.UI.GLUT.Callbacks.Window type DialAndButtonBoxCallback = DialAndButtonBoxInput -> IO ()
07:00:43  I added a few more classes related to monoids: MonoidPlus, Group, MonoidMinus, MonoidNorm.
07:02:11  MonoidPlus adds mpempty and mpappend, which should be distributive over mempty and mappend; Group adds minverse.
07:02:39  Madoka-Kaname: http://hackage.haskell.org/packages/archive/newtype/latest/doc/html/Control-Newtype.html
07:03:58  zzo38: MonoidPlus is called a semiring
07:04:19  oerjan: O, I didn't know that.
07:05:14  Actually it isn't; the annihilation property does not necessarily hold.
07:05:57  oh
07:08:38  Now I added a Semiring class, that adds no additional methods but it is only used to tell you which ones are semirings.
07:12:25  Actually, there is another property that is not part of the definition of MonoidPlus, which is commutative addition.
07:17:24  argh
07:17:38  unlambda/ski calculus is so unforgiving
07:20:02  !unlambda ``````````````````````.I.s. .e.g.o.b.o.t. .w.o.r.k.i.n.g. .n.o.w.?i
07:20:24  !help don't bet on it
07:20:25  ​Sorry, I have no help for don_t_bet_on_it!
07:20:40  oh hm
07:21:26  @unlambda ```````````.T.h.i.s. .m.i.g.h.t..i
07:21:27    This might.
07:34:59 -!- monqy has quit (Quit: hello).
07:36:06 -!- CakeProphet has joined.
07:36:11 -!- CakeProphet has quit (Changing host).
07:36:11 -!- CakeProphet has joined.
07:40:32  this channel is a waste.
07:44:25  it's better than that other one
07:46:34  no.
07:46:51  how do you know
07:46:51  this is a game.
07:47:40  What kind of game? Chess game or card game?
07:48:00  a game of masturbation.
07:48:37  zzo38: a board game that isnt chess
07:49:06  @tell elliott HAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHAHA
07:49:06  Consider it noted.
08:16:31 -!- Ngevd has joined.
08:19:54  Hello
08:26:42  Now I added the  instance Num t => Ring (Product t);
08:39:51 -!- Jafet has joined.
08:40:43 -!- sebbu has quit (Ping timeout: 240 seconds).
08:41:41 -!- sebbu has joined.
08:41:41 -!- sebbu has quit (Changing host).
08:41:42 -!- sebbu has joined.
08:53:27 -!- oerjan has quit (Quit: leaving).
09:18:57 -!- hagb4rd has joined.
09:19:08 -!- Phantom_Hoover has joined.
09:31:59 -!- oklopol has quit (Ping timeout: 260 seconds).
09:33:00 -!- Zuu has joined.
09:42:38 -!- Ngevd has quit (Ping timeout: 252 seconds).
09:51:56 -!- zzo38 has quit (Remote host closed the connection).
10:11:42 -!- Ngevd has joined.
10:14:14 -!- Phantom_Hoover has quit (Ping timeout: 248 seconds).
10:24:59 -!- SgeoN1 has quit (Quit: Bye).
10:25:13 -!- nooga has joined.
10:26:26 -!- Phantom_Hoover has joined.
10:29:01  ``s`k``s`k``s`k``s`k``s`k``s`k``si`kksks`sikk
10:29:04  damnit
10:29:08  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: `s`k``s`k``s`k``s`k``s`k``s`k``si`kksks`sikk: not found
10:29:19  madbr?
10:29:34  function that makes a pair in unlambda I think
10:30:07  took a couple hours to figure out (without cheating and looking up in the docs)
10:31:02  obviously that function is probably crucial for any data type aside from the bit
10:31:21  Or the natural number
10:31:53  Pair as in standard LC pair?
10:32:10  dunno what standard LC part means
10:32:32  http://en.wikipedia.org/wiki/Lambda_calculus#Pairs
10:32:40  when it gets 3 arguments, returns the first one if true, second one if false
10:33:56  ngevd: I guess you can build numbers from church numerals or something but it's probably faster to do bit arrays or trees
10:34:13  for larger numbers
10:34:28  I really wouldn't know
10:35:17  but yeah basically unlambda is incredibly laborious to write :o
10:36:27  madbr, the standard pair is \x y f -> f x y.
10:36:54  S(S(KS)(S(KK)(S(KS)(S(K(SI))K))))(KK) in definitely not unlambda notation
10:37:11  similar but a bit different I guess
10:37:48  How does yours work?
10:37:55  f is different
10:38:22  f is either i for true (first member), or `ki for false (second member)
10:38:37  i won't work
10:38:42  You want k for true
10:38:42  True... isn't i.
10:38:47  What Ngevd said.
10:39:00  i would apply the two arguments together, I think
10:39:09  Yep.
10:39:09  Unless unlambda is weirder than I thought
10:40:02  guess you could use k for true and `ki for false, then you would have a skighly different pair constructor yes
10:41:04  I don't see how you can use i for true at all.
10:41:24  i can't get rid of information
10:41:42  i = don't replace with i, `ki = replace with i
10:41:50  Information-hoarding is a terrible condition, Ngevd.
10:42:11  apply on a function that replaces the input with something else
10:42:24  Ah, right.
10:42:38  Sound, if convoluted.
10:42:55  is there anything not convoluted in lambda calculus :o
10:43:09  No, not at all.
10:43:43  By which I mean it's not all that convoluted.
10:44:33  ah
10:44:39  is there anything not convoluted in unlambda then ? :D
10:44:55  Unlambda is terrible, so I decline to comment.
10:45:27  it's terrible and awesome I guess
10:45:36  though it's just ski calculus really
10:46:36  but yeah a good esoteric language should have mindfuck power, and unlambda definitely qualifies
10:46:46  It's not my favourite language
10:46:47  By fa
10:46:47  r
10:46:49  For mindfuck, go for Malbolge
10:47:19  no that's just random shit
10:47:32  It's not "random shit"
10:47:41  Clearly it's too much of a "mindfuck" for your mind
10:47:54  Saying that, it's too much of a mindfuck for my mind
10:48:14  I don't remember the details of malbolge too much
10:48:26  http://esolangs.org/wiki/Malbolge
10:48:29  but last time I remember it's just evil and not at all deep
10:50:06  A Malbolge program is something I can stand in awe at
10:50:19  I'm not a fan of bitwise languages I guess
10:50:30  Good news, Malbolge is tritwise!
10:50:34  :P
10:50:50  but yeah it's just imperative
10:51:03  and not some mindbendingly crazy new paradigm
10:51:45  Unlambda's paradigm dates back to at least 1924
10:51:57  true
10:52:18  madbr, Unlambda's paradigm predates conventional imperative programming.
10:52:26  Which dates to 1954
10:52:55  If Assembly is counted as a different paradigm
10:53:23  Which comes from about the same time
10:54:44  yeah ok
10:55:37  still thinking the point is to come up with crazy paradigms :D
10:55:50  Like Piet?
10:56:39  Or Befunge?
10:56:45  sorta yeah
10:57:06  But not like Unlambda
10:57:32  anyways, sleep
10:57:34 -!- madbr has quit (Quit: Radiateur).
10:58:00  He seems nice
11:04:02  Flobnar seems interesting
11:11:12 -!- Ngevd has quit (Ping timeout: 252 seconds).
11:12:57 -!- Ngevd has joined.
11:19:39  I think a funge on the hyperbolic plane would be interesting
11:20:18  Shame I haven't actually figured out how the hyperbolic plane works
11:24:01 -!- sebbu2 has joined.
11:24:02 -!- sebbu2 has quit (Changing host).
11:24:02 -!- sebbu2 has joined.
11:27:31 -!- sebbu has quit (Ping timeout: 240 seconds).
11:35:27 -!- zzo38 has joined.
11:40:23  It seem the MonadPlus instance for Parsec does not follow the laws.
11:48:42 -!- Patashu has quit (Quit: MSN: Patashu@hotmail.com , Gmail: Patashu0@gmail.com , AIM: Patashu0 , YIM: patashu2 , Skype: patashu0 .).
11:54:15 -!- pikhq_ has joined.
11:54:38 -!- pikhq has quit (Ping timeout: 258 seconds).
12:10:44 -!- Ngevd has quit (Ping timeout: 240 seconds).
12:24:04 -!- Vorpal has joined.
13:00:46 -!- variable has quit (Excess Flood).
13:04:08 -!- variable has joined.
13:05:50  Funge a klein bottle
13:22:43   Shame I haven't actually figured out how the hyperbolic plane works
13:23:05  One way to think of it is that the angles around a point add up to more than 360°.
13:23:32  This is wrong, but it's wrong in a way which is right if you don't go into too much depth.
13:23:53  Oh, right, he left.
13:44:17 -!- sllide has joined.
13:49:28  Jafet, sure, why not
13:50:06 -!- Ngevd has joined.
13:50:13  Well, the first question is whether you're going to funge in three dimensions or four
13:50:31  Hello!
13:50:31  ouch
13:50:42  I saw what you said, Phantom_Hoover
13:50:46  Hmm
13:51:25  Jafet, wait, the klein bottle forms a plane that is connected to itself in "weird" ways doesn't it?
13:51:37  Oh, Houlton, Maine.
13:51:44  Why do you despise Hexham so?
13:52:06  http://kleinbottle.com
13:54:01  Vorpal, ...
13:54:14  http://en.wikipedia.org/wiki/Fundamental_polygon
13:54:23  I'm going to leave this here.
13:54:57  Jafet, fun fact, the guy who runs that site also caught Markus Hess.
13:55:43  A Klein bottle is a Mooobius strip made even weirder, right?
13:56:15  It's a Mobius strip with the other edges joined as well.
13:56:22  Thought sp
13:56:28  that is what I meant
13:56:54  Langton's ant on a Mooobius strip: taking metaphors the wrong way
13:58:13  Langton's cow on a Mooobius strip sounds more likely.
14:05:29 -!- sebbu2 has changed nick to sebbu.
14:24:11 -!- ais523 has joined.
14:34:33 -!- MSleep has changed nick to MDude.
14:36:09  so, it turns out that the recent zero-day affecting Windows turned out to be a security bug in the kernel's font parser
14:36:22  ...!
14:36:34  Seems an odd place for a security bug
14:37:00  seems like an odd place for a font parser
14:37:42  apparently it's historical reasons based on trying to run NT 4 on old hardware, and they never moved it back
14:39:35  ais523, heh
14:40:16  ais523, I thought NT 3/4 tried to put a lot of stuff in user space?
14:40:36  perhaps. but not that
14:40:40  right
14:43:57  Didn't NT4 in fact move some stuff back into kernel space for speeds.
14:44:38  ah, perhaps
14:45:06  "The graphics device interface handles image management for the monitor and printers. It provides system calls to allow user programs to write on the monitor or printers in a device-independent way. It also contains the window manager and hardware device drivers. In versions of NT prior to NT 4.0, it was in user space but the performance was disappointing, so Microsoft moved it into the kernel to speed it up."
14:45:48  heh, so GDI /is/ kernel? I'd always wondered about that
14:46:21 -!- Ngevd has quit (Ping timeout: 256 seconds).
14:46:37  Random web-quote, so take with a grain of salt; also about NT4.
14:46:39  I think in modern windows it runs parts in user space again
14:46:45  like the window manager
14:47:00  and parts of the graphics drivers
14:47:01  There's probably architectural docs in MSDN.
14:47:02  the window manager isn't in GDI
14:47:24  ais523, it said so above
14:47:38  hmm
14:47:40  " It also contains the window manager and hardware device drivers."
14:47:50  well, it's not user-visible that it's in GDI
14:47:55  I think
14:48:27  in vista/7 there is dwm.exe (unrelated to dwm on *nix) which is the compositing "Desktop Window Manager" iirc
14:49:34 -!- tiffany has joined.
14:50:19  Win7 has funny permissions things; sometimes Synergy clicks will not let you switch focus to some window, or to send key/mouse events when switched, if it's somehow... different.
14:51:17  E.g. the photoalbum creation software from this one printing company was like that, for some unfathomable reason.
15:18:58  ouch
15:27:03  Remember that one of the major security holes in Windows was in a parser for image files.
15:27:21  Yes, folks, code injection in image files.
15:42:53  Jafet: but WMF was an image format in the same sense that vim or TECO is a text editor
15:43:02  it was more of a programming language for describing images
15:43:20  it probably /shouldn't/ have had an FFI, though
15:44:29  Seeing as we're in this channel...
15:44:44  What was its computational class? (sans the ill-conceived FFI)
15:45:06  iirc it's basically a serialized list of GDI function calls
15:47:31  Jafet: think an LBA that can't take inputs
15:57:56 -!- nooga has quit (Ping timeout: 240 seconds).
16:01:19 -!- nooga has joined.
16:02:10 -!- monqy has joined.
16:07:56   Seems an odd place for a security bug
16:08:04  Welcome to Windows.
16:10:51 -!- elliott has joined.
16:11:03 -!- Ngevd has joined.
16:12:22  does windows have butlers to great you at each security hole?
16:12:42  =p
16:13:21  Does Dr Watson count?
16:13:22  No, you idiot, that's not what butlers do.
16:13:34  It has doormen
16:13:39  "Welcome to the Windows Font Parser. Which kernel subsystem would you like access to?"
16:13:46  xD
16:17:18  q
16:17:19  elliott: You have 2 new messages. '/msg lambdabot @messages' to read them.
16:18:10  @tell elliott You have 2 new messages. '/msg lambdabot @messages' to read them.
16:18:10  Consider it noted.
16:18:16  hi
16:18:17  elliott: You have 1 new message. '/msg lambdabot @messages' to read it.
16:18:19  @messages
16:18:20  olsner said 9s ago: You have 2 new messages. '/msg lambdabot @messages' to read them.
16:18:23  @messages
16:18:24  You don't have any new messages.
16:18:26  he;lp
16:18:40  olsner: that was ridiculous
16:19:03  ais523: the point exactly
16:19:05  oh wait i didnt follow the instructions
16:19:10  /msg lambdabot @messages
16:19:14  yay now i see them
16:19:19  they are the best messages.
16:19:44  22:31:39:  Does the people managing the account for HackageDB have UNIX mail? I send a UNIX message to them and I don't know if it work.
16:19:45  :')
16:20:56  elliott, you going to the bonfire tonight?
16:21:18  Now I made the MonoidicT monad transformer.    newtype MonoidicT a m b = MonoidicT { runMonoidicT :: m (a, b) };    I also made the Monad instance for   Monoid t => Monad ((,) t)
16:21:38  zzo38: WriterT
16:22:03  elliott: what does Writer do?
16:22:12  Ngevd: No, I'm plotting to destroy the universe because I'm a grouch who hates fun.
16:22:26  Minecraft bonfire night!
16:22:31  Minefire night.
16:22:33  Minefight.
16:22:38  ais523: That's a supremely vague question ...
16:22:46  elliott: indeed it is
16:22:49  elliott, cool, that means I can go without fear of destroying the universe
16:22:51  could you help me formulate a better question?
16:23:13  I gather that it's some sort of monad that lets you produce intermediate results
16:23:24  but I'm not sure of the details, or whether or not that description is confusingly misleading
16:23:46  ais523: Writer w a is a monad if w is a monoid
16:23:48  elliott: Yes it is similar. But I used the  Monoid t => Monad ((,) t)  monad.
16:24:13  ais523: it's just (w,a) underneath; return a = (mempty,a); (w,a) >>= f = let (w',b) = f a in (mappend w w', b)
16:24:18  ais523: so you can use it to e.g. produce a log
16:24:24  "tell" adds to the monoid
16:24:29  do tell "doing a"; a; tell "doing b"; b
16:24:31  erm
16:24:37  do tell ["doing a"]; a; tell ["doing b"]; b
16:24:42  that's Writer [String] whateverbreturns
16:24:51  you can run it and get the final result plus the [String] out of it
16:24:53  the end
16:24:57  oh, and tell itself takes a monadic value as argument?
16:25:01  WriterT is like that but a transformer
16:25:03  ais523: ...no
16:25:35  elliott: well, could I convert ["doing a"] to Just "doing a"?
16:25:38  and likewise for the second
16:25:44  and end up with Just "doing b"?
16:26:07  OK, now I'm not sure you understand how either monoids or monads work at all...
16:26:47  elliott: I sort-of understand Haskell monads, and category theory monoids
16:26:56  but can't combine the category theory idea with the Haskell you're sohwing
16:27:03  They had a instance Monoid t => Applicative ((,) t) but had no Monad instance so I made one up by:   join (x, (y, z)) = (x |*| y, z);
16:27:12  ais523: what type do you think tell is
16:27:25  (Where |*| is infix operator for mappend)
16:27:35  ah, hmm, is List an instance of Monoid, that defines append as some sort of named operator?
16:27:46  that may have been what I'm missing
16:27:48  @kind List
16:27:49  Not in scope: type constructor or class `List'
16:27:57  @kind [Int]
16:27:58  *
16:28:05  @src Monoid
16:28:05  class Monoid a where
16:28:05      mempty  :: a
16:28:05      mappend :: a -> a -> a
16:28:05      mconcat :: [a] -> a
16:28:06  For list monoid: mempty = []; mappend = (++);
16:28:19  mconcat is derived, I take it?
16:28:32  it has a default value
16:28:37  foldr mappend mempty
16:28:40  mconcat is derived automatically but you can override it to make it more efficiently
16:28:42  in that case, I think I understand now
16:28:59  interpreting the operation on a monoid as "append" is the Haskellism I'm mising
16:29:01  *missing
16:29:02  > runWriter (tell ["fooing bars"] >> tell ["done fooing bars", "it was great"])
16:29:03    ((),["fooing bars","done fooing bars","it was great"])
16:29:07  mathematically, there's no reason it has to correspond to that at all
16:29:09  > runWriter (tell ["fooing bars"] >> tell ["done fooing bars", "it was great"] >> return 99)
16:29:10    (99,["fooing bars","done fooing bars","it was great"])
16:29:17  I also made the instance Category c => Monoid (c t t)
16:29:19  ais523: I'd prefer it be "empty" and (<>)
16:29:46  I'm used to monoids made out of, say, 0 and addition
16:30:02  i would not support that :)
16:30:03  There is such a monoid in Haskell; it is the Sum monoid
16:30:04  which don't fit the Haskell idea too well
16:30:15  ais523: those fit into the "haskell idea" perfectly
16:30:22  the names are historical and bad
16:30:24  well, they're expressible in Haskell
16:30:29  For multiplication you need a Product monoid
16:30:32  but "Writer" is a bit of a silly name for it
16:30:42  ais523: how is Writer related?
16:30:45  Writer isn't a monoid
16:31:00  elliott: because it applies to monoids
16:31:03  it's silly to say that something that happens to /use/ monoids constitutes part of Haskell's idea of what a monoid is
16:31:10  well, OK
16:31:22  bear in mind that Writer is also a fairly legacy name :P
16:31:26  it's sort of dual to Reader
16:31:27  I'd say it's evidence of Haskell's idea, rather than being part of the idea
16:31:29  is the reason it's named that
16:31:32  i.e. effect rather than cause
16:31:33  (Reader = (->))
16:31:58  what does Reader actually operate on? being equivalent to (->) is too heavily Haskell-golfed for me to work it out mentally
16:32:44  Reader r a ~ r -> a
16:32:47  it's just a newtype wrapper
16:32:56  There is a (e ->) monad; it is:  return = const; fmap = (.); join f x = f x x;  (I worked it out on paper at first and found it is the same thing)
16:33:09  ais523: and the instance Monad ((->) r) is identical to the instance Monad (Reader r)
16:33:18  ais523: it's called Reader because it lets you pass around one bit of mutable state implicitly
16:33:19  erm
16:33:21  ais523: it's called Reader because it lets you pass around one bit of IMmutable state implicitly
16:33:22  You use the module Control.Monad.Reader for the (e ->) monad.
16:33:36  elliott: ah right, that doesn't really fit with my idea of what a reverse of Writer would be
16:33:41  I imagined it taking elements from a list
16:33:43  or something like that
16:33:44  ais523: me neither, that's why I said "sort of" :)
16:33:50  that's the Supply monad
16:33:55  (elements from a list)
16:33:59  which isn't in the stdlib
16:34:24  elliott: the monad that Haskell calls Reader came up in a CS lecture, btw
16:34:27  That is, sometimes is the use of using the monadic "join" for functions, so that is usually the reason why I will have import Control.Monad.Reader.
16:34:36  ais523: it calls it (->) too
16:34:40  Dan thought he'd invented it, and called it the "clock monad" as it's what he was using it for
16:34:40  there are instances for both
16:34:47  in fact, join is really useful on functions
16:34:49  it just duplicates its parameter
16:34:49  I said it was pretty much just a read-only state monad
16:34:51  > join (+) 5
16:34:53    10
16:35:16  ais523: I'm not sure what it takes to think you could have invented a monad so trivial...
16:35:17  wait, what does join do again? I keep forgetting how it relates to >>=
16:35:21  elliott: likewise
16:35:22  A lot of people can make up the same monads as other people; it is mathematics so such things are possible.
16:35:24  I suppose lack of Haskell knowledge suffices
16:35:25  probably just not having seen it before
16:35:30  ais523: join = (>>= id)
16:35:33  :: m (m a) -> m a
16:35:37  ... well with a Monad constraint :P
16:35:41  so
16:35:47  (r -> (r -> a)) -> (r -> a)
16:35:51  so
16:35:53  elliott: hmm, why is that operation useful? and can you define >>= in terms of it?
16:35:55  (a -> a -> b) -> a -> b
16:36:11  ais523: I just gave a use for it; and (>>=) can be defined in terms of join and fmap
16:36:27  you can't define fmap with just return and join, but all monads are functors anyway, haskell just doesn't realise it
16:36:48  ais523: anyway, join is used in the category theory definition
16:36:52  instead of (>>=)
16:36:55  I know, I've seen it but didn't understand it
16:37:13  that's because you don't understand monads :)
16:37:15  hmm, why is there no fmapM? I'm guessing because fmap doesn't have a defined evaluation order
16:37:27  I readily admit I don't really fundamentally understand them
16:37:29  just enough to use them
16:37:29  :t Data.Traversable.mapM
16:37:30  forall a (m :: * -> *) b (t :: * -> *). (Data.Traversable.Traversable t, Monad m) => (a -> m b) -> t a -> m (t b)
16:37:43  Functor => Foldable => Traversable
16:37:46  is the hierarchy there
16:38:16  ais523: but fmapM doesn't even make sense
16:38:27  not in general
16:38:32  but it does in a lot of specific cases
16:38:36  including some that would have been useful
16:38:39  fmap is general.
16:38:42  ais523: fmapM :: (Monad m) => (a -> m b) -> (r -> c) -> m (r -> b)
16:38:47  (for the (->) monad)
16:38:52  well, (->) functor :)
16:38:58  It's pretty weird to name something after fmap if it isn't general.
16:38:59  erm
16:39:02  ais523: fmapM :: (Monad m) => (a -> m b) -> (r -> a) -> m (r -> b)
16:39:07  that looks better
16:39:14  ais523: you have a bad definition of better
16:39:23  well, the first version was obviously wrong
16:39:25  ais523: that's unsafePerformIO :)
16:39:37  no it isn't
16:39:39  :t unsafePerformIO
16:39:40  Not in scope: `unsafePerformIO'
16:39:41  fmapM putStrLn :: (String -> a) -> IO (String -> ())
16:39:51  fmapM putStrLn id :: IO (String -> ())
16:39:58  the function you get out of that prints every time it's called
16:40:25  therefore not every functor has fmapM qed
16:40:32  elliott: well, say, putStrLn "x" is of type IO ()
16:40:42  I don't see why that's any safer than IO (String -> ())
16:40:57  ais523: and that's because you don't understand Haskell's IO!
16:41:20  IO is a little crazy as monads go, indeed
16:41:22  no, it's not
16:41:26  you just don't understand it
16:41:42  IO being a monad is practically irrelevant to understanding it, too, it's just a way of using it
16:42:07  IO () is a value describing a side-effectful program that returns (); IO (String -> ()) is a value describing a side-effectful program that returns (a pure function taking a String and returning ())
16:42:17  say we have m :: IO (String -> ())
16:42:19  IO being a monad does also make it functor, applicative, and that kind of stuff.
16:42:33  ais523: do f <- m; return (doPureComputationWith f)
16:42:48  ais523: doPureComputationWith calls f ten times, but f magically prints when it's called oops!
16:44:07  yep, this is basically a good argument for showing that fmapM doesn't work on (->)
16:44:16  but there are a whole load of functors, like Tree, where it would be useful
16:44:23  and in fact, it's the same argument in both cases
16:44:30  that's why Traversable exists P:
16:44:30  the problem is that functions don't define an evaluation order
16:44:32  s/P:/:P/
16:44:37  which /does/ define an evaluation order
16:44:40  I made up the instance Alternative IO
16:44:41  and if they /did/, there'd be no issue with (->)
16:44:48  yes it would
16:44:51  sorry, you're wrong
16:44:57  there is _no way_ to implement the type I gave without unsafePerformIO
16:45:00  at all
16:45:02  full stop
16:45:07  empty = fail []; x <|> y = catch x $ \e -> modifyIOError (\z -> if z == userError [] then e else z) y;
16:45:24  elliott: it'd be called safePerformIO if evaluation order were defined in Haskell
16:45:25  it just isn't
16:45:39  (that is, order, and existence)
16:45:39  ais523: I give up
16:45:51  I think we have different mental images of the same thing
16:45:52  evaluation order is irrelevant here
16:46:05  it's completely irrelevant to the question of whether to be pure or not
16:46:15  Someone made up a instance MonadPlus IO but it does not follow the right zero law and also doesn't follow the monoid laws either!
16:46:18  ais523: if you have an impure language, then unsafePerformIO is safe too
16:46:20  even if it's lazy
16:46:23  right
16:46:31  it's an orthogonal issue
16:47:19  The MonadPlus for Parsec does not follow the right zero law either.
16:47:42  It follows the left zero law; maybe the right zero law should be removed from the documentation?
16:47:45  back to logreading!
16:47:48  02:34:54:  i met a burglar
16:47:48  02:35:21:  chatted with him for 5 minutes, went home and called the cops. will prolly be stabbed soon enough :D
16:47:48  :')
16:48:03  hmm, what does that smiley mean?
16:48:08  crying with happiness?
16:48:25  it means the world is beautiful, or something
16:48:37  but yes i suppose that's the literal meaning
16:48:45  although ' looks like just a single tear to me
16:48:56  well, it is
16:49:03  :")
16:49:04  Do you think my instance Alternative IO is correct?
16:49:07  because trying to render all the tears doesn't work well in ASCII
16:49:15  :''''''''''''''''''''''''''')
16:49:20  see what I mean?
16:49:35  :'''')''''''
16:49:43  '''''''''''''
16:49:45 * elliott puddle of tears
16:50:19  If I had a language that had one command, "interpret input as brainfuck program", would it be Turing-Complete?
16:50:37  yes, according to most definitions
16:50:42  no
16:50:45  according to most definitions
16:50:46  except the other definitions
16:50:54  hehehe
16:50:58  Ngevd: Many people have asked about things like that before already.
16:51:05  elliott: well, it's meta-TC
16:51:13  And there already is an esolang like that for that purpose anyways!
16:51:15  ais523: don't even
16:51:16  in that it can express an interp for a TC language
16:51:22  Ngevd: see here:
16:51:29  we've had this argument before, but I can't remember the conclusion
16:51:33  Ngevd: v
16:51:35  Ngevd: http://esolangs.org/wiki/%E2%84%92
16:52:30  ais523: the conclusion between people who aren't messing about on an IRC channel appears to be that models without input are better anyway so it's irrelevant
16:52:41  right
16:52:46  although i only have one source for that :P
16:52:51  and I forget who it is
16:52:54  I appear to have disconnected
16:52:59  Ngevd: amazing
16:52:59  Or perhaps am just lagging
16:53:02  considering you're still here
16:53:51  Oh there we go
16:53:51  All the responses just flooded in
16:54:22  I used the MonadicT transformer with list monad to make like the probability distributions, since it is clear what join should mean.
16:54:46  MonadicT?
16:55:21  I mean it is called MonoidicT
16:55:23  I made a mistake
16:55:36  It is actually called:  newtype MonoidicT a m b = MonoidicT { runMonoidicT :: m (a, b) };
16:55:39  To be more exact.
16:56:05  it's still just WriterT afaict :P
16:56:16  There is also the    instance Monoid t => Monad ((,) t)   join (x, (y, z)) = (x |*| y, z);    (where |*| is really mappend)
16:57:02  that's just Writer isn't it
16:57:26  There is already the instance Monoid t => Applicative ((,) t) but they forgot the Monad
16:57:30 -!- zzo38 has quit (Remote host closed the connection).
17:23:39 -!- Jafet has quit (Quit: Leaving.).
17:34:01 -!- oerjan has joined.
17:37:44   I don't see how you can use i for true at all.
17:38:17  i'm pretty sure you _can_ convert i and `ki to k and `ki
17:39:30  `ix = x, ``kix = i
17:39:32  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: ix: not found
17:39:48  ```kix`ki = `ki
17:39:49  Whoa
17:39:49  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: ``kix`ki: not found
17:39:55  Suddenly I see a crazy way to do it
17:39:58  ``ix`ki = `x`ki
17:40:00  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: `ix`ki: not found
17:40:08  thus we need x = `kk
17:40:08  so
17:40:22  ```kk`ki
17:40:23  elliott: you _could_, like, add an initial space or something :P
17:40:24  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: ``kk`ki: not found
17:40:25  oerjan: right?
17:40:40   `hi hakcego
17:40:43   `thanks
17:40:48  NO HACKEGO: ``i`kk`ki = k; ```ki`kk`ki = `ki
17:40:51  i believe.
17:41:06  Phantom_Hoover: SO HA
17:41:25  yeah looks right
17:43:18  But backwards...?
17:43:30  i vaguely recall a theorem that if you have two LC terms in weak (head?) normal form, which are _not_ equivalent, then it is possible to find something to apply them to that gives any desired result.
17:44:00  Ngevd: what is backwards?
17:44:14  oerjan: that's either an astonishing or obvious theorem, if true
17:44:18  I'm not sure which
17:44:39  in some sense it's obvious because they're not equivalent, in another sense it's astonishing that you can... get useful results out of that?
17:45:49  elliott: some of the vagueness may be in the exact requirements needed :P
17:46:05  heh
17:46:33  i think it was in barendregt's famous LC book
17:47:18  *drecht
17:47:26 -!- Ngevd has quit (Ping timeout: 244 seconds).
17:47:35  "The Lambda Calculus -- Its Syntax and Semantics"
17:48:40  not beta-eta equivalent, was probably one of the requirements
17:49:41  and the weak normal form stuff was to ensure you had enough in it to not infinitely loop
17:49:44  oh hm
17:50:04  or possibly it involved having different types
17:50:13 -!- aloril has quit (Ping timeout: 255 seconds).
17:50:30  anyway i and `ki are both fully normalizable
17:50:43 -!- derrik has joined.
17:51:18  oerjan: different types to the single type the LC has? :-)
17:52:27  elliott: the book had a lot about type systems for LC
17:52:31  elliott: "typed lambda calculus" and "untyped lambda calculus" both exist
17:52:44  ais523: I know
17:52:47  and in fact, without an explicit "untyped", "typed" seems to be implied among actual computer scientists
17:52:49  because they like types
17:53:02  and used it to prove nontrivial facts about untyped LC itself, iirc
17:53:25 * elliott doesn't think that's true at all, and suspects you might be using "actual computer scientists" to mean "computer scientists whose work filters down to me"
17:53:35  or at least it seems fishy to me
17:53:58  elliott: I mean "computer scientists whose seminars I attend"
17:54:02  right :p
17:54:14  but really, untyped LC is a bit uninteresting nowadays
17:54:17 * elliott has never seen "the lambda calculus" used to mean anything but the untyped version, at least without context
17:54:22  because it doesn't form a nontrivial category
17:54:44  if you're using LC as the basis of something, TLC tends to work better
17:54:59  (and if you go down the other route, you seem to end up with Ursala)
17:55:16  elliott: one of the type systems was one which had the property that a term had a type iff it had a terminating reduction, iirc
17:55:23  ais523: Ursala has types, sort of :P
17:55:38  oerjan: yeah, I figured it was something like that
17:55:47  of course that means _finding_ a type is undecidable
17:55:57  oerjan: I'm pretty sure you can make a type system that types /everything/ in LC reasonably, but -- yeah, that
17:56:02  but for normalized terms, it was possible
17:56:29  and iirc the type was preserved by reductions -- both ways
17:57:04   elliott: one of the type systems was one which had the property that a term had a type iff it had a terminating reduction, iirc
17:57:20  so if it terminates, you essentially know the possible types are the same as for the result
17:57:21  oerjan: does this include terms that depend on partial reductions of non-terminating terms?
17:57:25  hmm, I dunno whether that's possible
17:57:30  wait, of course it isn't
17:57:49  "Proposed criticism of lambda calculus
17:57:49  01-Nov-2008: I suggest adding a section "Controversy in lambda calculus" because it seems like overkill on fairly useless stuff. I still ponder "Why Johnny can't program" & "Why Johnny can't de-virus" & "Why Johnny can't word search" etc. I think subjects like lambda calculus created a nerd-iverse (re: "universe") that wasted hours on useless math games."
17:57:55  -- [[Talk:Lambda calculus]]]
17:57:58  s/]]]/]]/
17:57:59  elliott: depends on what you mean by non-terminating
17:58:03  oerjan: heh
17:58:34  "My view is to cite sources that consider lambda calculus to be a limited concept that thwarted the expansion of computer science in other areas. For example, it has become common knowledge that languages are easier to program when using the standard syntax of algebra (but with words as variable names, not just x/y/z). The vast majority of all software systems originally written in LISP have been re-written in procedural, non-list languages."
17:58:35  you can have something reducing to head normal forms while subparts never terminate
17:58:36  this comment...
17:58:47  oerjan: right
17:59:21 -!- Ngevd has joined.
18:00:43  Sorry about my tendency to lag out
18:01:10  elliott: Apparently that person is rather ignorant of, well, functional languages newer than 1980.
18:01:28  Or older than sometime in the 60s, for that matter.
18:04:07 -!- aloril has joined.
18:05:13  the type of \f x -> f (f x)  was something like ((a -> b) /\ (b -> c)) -> a -> c
18:05:26  *the principal type
18:05:34  fully normalized terms had those
18:05:56  Man, Stanislav has managed to turn McCarthy's death into his most intolerable blog post yet.
18:06:28  :(
18:06:40  What, is that the same Mathnerd314.
18:07:15  oerjan: Wait, did you just bring up my favourite function?
18:07:29 * shachaf considers reading scrollback.
18:07:50  for only head normalizable terms, non-terminating subterms would get the special type omega
18:08:24  which was only allowed to the left of -> or something like that
18:09:13  shachaf: it was just the simplest example i could think of of a function which requires an intersection of types in that type system
18:09:21  oerjan: So Y would get the correct type, but its subterms would involve omega?
18:09:54  Ugh, so much scrollback.
18:09:59  elliott: well since it's not fully normalizable it may not have a principal type
18:10:07  Hmm, right.
18:10:14  but it would have a type for every occasion where it "works"
18:10:18  iirc
18:10:25 * shachaf just wants a polymorphic \x y -> x (x y); why do we need all these fancy tricks?
18:10:41  i don't see any fancy trick
18:11:36  I guess that's pretty simple, actually.
18:11:44  :t \x y -> x (x y)
18:11:45  forall t. (t -> t) -> t -> t
18:11:54  I don't see the problem
18:12:19  ais523: the problem is that there are ways to apply the untyped \x y -> x (x y) which don't follow that type
18:12:50  @ty let f :: forall a f. (forall b. b -> f b) -> a -> f (f a); f x y = x (x y) in f
18:12:51  forall (f :: * -> *) a. (forall b. b -> f b) -> a -> f (f a)
18:12:52  hmm, I will call this function 2
18:13:07  > let f :: forall a f. (forall b. b -> f b) -> a -> f (f a); f x y = x (x y) in f Just True
18:13:08    Just (Just True)
18:13:18  ais523: well of course it's the church numeral 2
18:13:22  yes
18:13:46  btw, people experimenting with Web of Lies, did you come to any conclusions but "it doesn't run on modern Linux"?
18:14:27  ais523: I would come to conclusions if I could get it working
18:14:33  ais523: I'm just waiting for you to fix the bug :P
18:14:50  I can think up a fix that will almost certainly work, but feels a bit insecure
18:14:56  which is to only partially drop permissions in the main process
18:15:04  and then undrop them again when that bit of code reads
18:15:31  I just don't like leaving around root perms even in the ssuid
18:15:41  Going to the bonfire
18:15:43  Bye
18:15:48 -!- Ngevd has quit (Quit: AWAAAAY!).
18:16:29  because someone who can exploit a security bug in WOL could call the undrop command themselves
18:16:54 -!- zzo38 has joined.
18:17:22  ais523: hmm, could you somehow drop root privs /at clone() time/?
18:17:29  so that the relevant process is /never/ owned by root
18:17:55  the problem is that fakeinit actually needs the root privs, it calls mknod a lot
18:17:58  ais523: or, better: if your effective UID isn't root (but your real UID still is), do spawned processes get owned by your effective UID?
18:18:01  the processes are dropped by the time the process under test runs
18:18:10  *perms are dropped
18:18:11  you could change that before forking or w/e, then change it back
18:18:14  so by the second clone, the perms aren't there
18:18:37  basically, there are three processes: weboflies, fakeinit, process under test
18:18:50  weboflies forks fakeinit as root; fakeinit forks the process after dropping perms, so as nonroot
18:19:24  right
18:19:33  ais523: I see a flaw in your reasoning
18:19:36  and weboflies then can't read the process under test's perms on any computers but mine
18:19:39  for some reason
18:19:52  ais523: how are /any/ /proc/N/fd directories owned by non-root in a typical linux system by your logic?
18:19:59  it's all done by dropping privileges from root and forking, at some level
18:20:17  elliott: I'm not trying to make an argument here, I'm just stating facts
18:20:32  the observed conclusion doesn't seem to follow from the actual facts, which is why I'm confused
18:20:35  ais523: yes, but your reasoning for the bug has been "/proc/N/fd is owned by root because it started off like that"
18:20:43  which you've just shown absurd, I think
18:20:45  yes
18:21:02 -!- derrik has left.
18:21:16  hmm, why don't you check the perms on /proc/fd for init, gdm/kdm/getty/equivalent, and your shell?
18:21:37  I'd do it, except the problem doesn't happen on my computer
18:22:03  [elliott@dinky ~]$ ls -lhd /proc/1/fd
18:22:04  dr-x------ 2 root root 0 Nov  5 18:20 /proc/1/fd
18:22:04  [elliott@dinky ~]$ ls -lhd /proc/$(pgrep slim)/fd
18:22:04  dr-x------ 2 root root 0 Nov  5 16:09 /proc/632/fd
18:22:04  [elliott@dinky ~]$ ls -lhd /proc/$(pgrep bash | tail -n 1)/fd
18:22:04  ls: cannot access /proc/7274/fd: No such file or directory
18:22:06  [elliott@dinky ~]$ ls -lhd /proc/$(pgrep bash | tail -n 2 | head -n 1)/fd
18:22:08  ls: cannot access /proc/7276/fd: No such file or directory
18:22:15  but
18:22:16  [elliott@dinky ~]$ ls -lhd /proc/self/fd
18:22:17  dr-x------ 2 elliott users 0 Nov  5 18:21 /proc/self/fd
18:22:35  [elliott@dinky ~]$ ps
18:22:35    PID TTY          TIME CMD
18:22:35   7244 pts/1    00:00:00 bash
18:22:35   7282 pts/1    00:00:00 ps
18:22:35  [elliott@dinky ~]$ ls -lhd /proc/7244/fd
18:22:35  dr-x------ 2 elliott users 0 Nov  5 18:20 /proc/7244/fd
18:22:52  elliott: oh, by "shell" I meant along the lines of "GNOME shell"
18:22:57  ah
18:22:58  is slim the login process?
18:23:02  slim is my DM
18:23:12  ais523: I can check ck-launch-session, xfce4-session, xfwm4...
18:23:14  which do you want :p
18:23:20  [elliott@dinky ~]$ cat ~/.xinitrc
18:23:21  #!/bin/sh
18:23:21  exec ck-launch-session startxfce4
18:23:41  elliott: whichever one gets execed most directly by the login process
18:23:42  ah, ck-launch-session actually isn't alive any more
18:23:54  the processes dying is making this a bit harder to trace
18:23:56  ais523: That would be... ~/.xinitrc, probably
18:24:02    632 ?        00:00:00 slim
18:24:02    639 tty7     00:04:44 X
18:24:02    642 ?        00:00:00 udevd
18:24:02    643 ?        00:00:00 udevd
18:24:02    661 ?        00:00:00 dhcpcd
18:24:03    662 ?        00:00:00 sh
18:24:04    674 ?        00:00:00 dbus-launch
18:24:06    675 ?        00:00:00 dbus-daemon
18:24:08    679 ?        00:00:00 xfconfd
18:24:10    684 ?        00:00:00 ssh-agent
18:24:13    694 ?        00:00:00 xfce4-session
18:24:15  I'll check the sh, dbus-launch, and xfce4-session
18:24:45  [elliott@dinky ~]$ ls -lhd /proc/662/fd # sh
18:24:45  dr-x------ 2 elliott users 0 Nov  5 16:09 /proc/662/fd
18:24:45  [elliott@dinky ~]$ ls -lhd /proc/674/fd # dbus-launch
18:24:45  dr-x------ 2 elliott users 0 Nov  5 16:10 /proc/674/fd
18:24:45  [elliott@dinky ~]$ ls -lhd /proc/694/fd # xfce4-session
18:24:46  dr-x------ 2 elliott users 0 Nov  5 16:10 /proc/694/fd
18:25:10  ais523: aha
18:25:19  ais523: when you clone from fakeinit, do you remember to specify you want a new fd namespace?
18:25:36  err, those exist?
18:25:45  I think so, but I'll have to check
18:25:47  of course
18:25:57    pid = clone(child_handler,
18:25:58                (char*)p1stack + sizeof(p1stack) - sizeof(void*),
18:25:58                CLONE_PTRACE, argv);
18:25:58  (I need to leave stdin/stdout/stderr connected, ofc, but a new fd namespace would do that)
18:25:59  ais523: you don't
18:26:02  fix that :)
18:26:02  aha
18:26:17  yes I do
18:26:20  it's a negative flag
18:26:25  huh?
18:26:29  hmm
18:26:32  new FD namespace is done by /not/ specifying CLONE_FILES
18:26:38  oh, indeed
18:26:43  ais523: gah, that seemed /so obvious/
18:26:46  Now I have the classes: MonoidPlus, Group, MonoidMinus, MonoidNorm, MonoidPlusNorm, Semiring, and Ring. When doing probability distributions, you could generalize it to not necessarily proper probabilities, if you have a type which is both Ring and MonoidPlusNorm. Now you can join probabilities, normalize it, and so on. You could use complex numbers if you want to.
18:27:06  ais523: I hate it when I have a really good aha moment and it isn't the bug
18:27:12  yep
18:27:14  especially when it's an /actual bug/ still, but not the one I'm trying to fix
18:27:36  who doesn't
18:28:15         CLONE_PID (obsolete)
18:28:15                If CLONE_PID is set, the child process is created with the same process ID as the calling process.  This is good for hacking the system,  but  other‐
18:28:15                wise of not much use.  Since 2.3.21 this flag can be specified only by the system boot process (PID 0).  It disappeared in Linux 2.5.16.
18:28:42  oh, I end up fixing loads of bugs when looking for other bugs
18:28:47  so I find it useful
18:29:36 -!- sebbu has quit (Read error: Connection reset by peer).
18:29:52  ais523: gah, there doesn't look like anything relevant in man 2 clone
18:30:07 -!- sebbu has joined.
18:30:07 -!- sebbu has quit (Changing host).
18:30:07 -!- sebbu has joined.
18:30:25  No context-reading again, but relevant? http://www.mail-archive.com/git-commits-head@vger.kernel.org/msg11654.html -- it's a 2.6.22 patch which makes /proc/N/fd directory have a custom permissions handler which overrides the usual when task_pid(current) == proc_pid(inode). But it could have been removed for all I know.
18:30:47  that's interesting
18:30:53  that sounds suspiciously relevant
18:30:54  what do task IDs handle again?
18:31:02  That's of course not something that'd show up in the permissions-as-seen-by-ls.
18:31:13  fizzie: basically the problem is that we have /proc/N owned by someuser but /proc/N/fd owned by root
18:31:16  and we have no idea why
18:31:17  (Okay, away again.)
18:31:24  damn :)
18:31:35  + * /proc/pid/fd needs a special permission handler so that a process can still
18:31:35  + * access /proc/self/fd after it has executed a setuid().
18:31:41  ais523: ok, this is sounding very worryingly relevant?
18:32:18  no, I don't think it is relevant; that's covering the case where a process starts suid root or run via sudo, drops permissions, then tries to read /proc/self/fd
18:32:28  16:39:02:  ais523: fmapM :: (Monad m) => (a -> m b) -> (r -> a) -> m (r -> b)
18:32:52  :t mapM
18:32:53  forall a (m :: * -> *) b. (Monad m) => (a -> m b) -> [a] -> m [b]
18:33:04  ais523: still, we have a case of dropping permissions from root, and then a child failing to read /proc/N/fd...
18:33:12  ais523: it would help if I knew what tasks are
18:33:48  elliott: I think that that's special-casing something in the existing behaviour, and the existing behaviour is what's relevant
18:34:00  hmm, okay
18:34:49  I'm racking my brains for things that could be relevant and resolve the inconsistency
18:34:59  maybe Linux just doesn't like you?
18:35:01  if pgids or sids were involved, they'd both explain what was happening, but I see no reason for them to be
18:35:06  elliott: *doesn't like you?
18:35:08  it works for /me/
18:35:14  hm i guess that actually cannot be written
18:35:22  ais523: you could be lying! maybe they want everyone else to think you're a crank!
18:35:24  oerjan: that was my /point/
18:35:42  ais523: also, correcting something I said to itself is...
18:35:44  O KAY
18:35:45  on my system, I can read the process-under-test's FDs from the main process, but not fakeinit's, which is simple and makes sense
18:35:54  oerjan: read onwards :P
18:36:09  elliott: it's not correcting to itself; the referent of "you" is different in each case
18:36:20  corrections are textual!
18:36:23  as in, it was a substitution on meaning not words
18:36:30  I don't see why I can't use a semantic correction
18:36:32  for a semantic mistake
18:36:34  you should have s/you/me/'d in the correction, so that the resulting statement I would have made would have been correct
18:38:48  but then it isn't a correction at the semantic level!
18:39:15  hmm, it'd be great if there were a better channel than #esoteric for "weird corner cases of Linux people don't generally care about"
18:41:03  heh
18:41:13  I don't even see where the corner case /is/, though
18:41:26  the problem is basically "Linux breaks after I do [huge laundry list of terrible things]"
18:41:30  yes
18:41:31  I don't think anybody can solve that problem but you
18:41:44  but I can't solve it directly, because the problem doesn't exist on my system
18:42:19  Want an ssh account? :-P
18:42:24  hmm, I suppose the simplest test is to write a process that is originally run as root, then does setresuid, fork, exec, and the process it execs hangs a while (sleep 100 would do)
18:42:30  then check the perms there
18:42:46  I'd need root access as well as an ssh account to test this, and that'd be a bit of a crazy thing to give me
18:43:08  (and a very crazy thing to give anyone else)
18:43:54  main(c,v){setresuid(0,0,0);if(!fork()){execlp(v[1],v+1);};sleep(100);}
18:43:59  ran as ./a.out sleep 100
18:44:00  that's not dropping perms
18:44:00  look good?
18:44:04  oh, er
18:44:07  s/0/1000/
18:44:07  you need to set them to some values other than 0
18:44:11  (my user accoutn)
18:44:12  account
18:44:18  yep, that looks reasonable
18:44:28  assuming execlp does what you think it does; I can never remember which of the execs are which
18:44:35  shouldn't that be execvp?
18:44:40  you're giving it an array as argument
18:44:45  oh, right
18:44:52  yep, execvp, I just checked
18:44:59  run that with sleep 100 as args, as root
18:45:05  and see what happens
18:45:26  augh.c:1:48: error: subscripted value is neither array nor pointer nor vector
18:45:27  o;ps
18:45:34  forgot my K&R type declaration of v
18:45:37  you need to give argv a type
18:45:43  main(c,v)char**v;{setresuid(0,0,0);if(!fork()){execvp(v[1],v+1);};sleep(100);}
18:45:46  im good programer
18:45:58  ais523: oh, maybe it should print its pid
18:46:02  on both halves of the fork
18:46:06  it's likely obvious anyway, but it'd help
18:48:11  main(c,v)char**v;{setresuid(1000,1000,1000);if(c=fork())printf("%d %d\n",c,getpid());else execvp(v[1],v+1);sleep(100);}
18:48:12  here we go
18:48:32  [elliott@dinky weboflies]$ ls -lhd /proc/7583{,/fd}
18:48:32  dr-xr-xr-x 8 elliott root 0 Nov  5 18:47 /proc/7583
18:48:32  dr-x------ 2 root    root 0 Nov  5 18:47 /proc/7583/fd
18:48:32  [elliott@dinky weboflies]$ ls -lhd /proc/7584{,/fd}
18:48:32  dr-xr-xr-x 8 elliott root 0 Nov  5 18:47 /proc/7584
18:48:33  dr-x------ 2 elliott root 0 Nov  5 18:47 /proc/7584/fd
18:48:34  ais523: wait, what?
18:48:41  oh, elliott:root is expected
18:48:45  I didn't change the gid
18:48:47  yes, indeed
18:49:07  but 7583's result is v. interesting
18:49:14  ais523: I suppose I should try clone rather than fork
18:49:17  7583's result is consistent with my system
18:49:22  and yes, that's the next thing to try
18:49:33  you could even give CLONE_PTRACE as an arg, I guess
18:49:35  starting to regret my chosen coding style already
18:49:50  can you do main(c,char**v), incidentally?
18:49:52  ais523: wouldn't that freeze the child?
18:49:53  and no
18:50:04  elliott: nope, CLONE_PTRACE only does anything if you're being ptraced yourself
18:50:09  ah, okay
18:50:11  you're thinking of PTRACE_TRACEME
18:50:33  child_stack can be NULL, right?
18:50:35  CLONE_PTRACE basically means "debugged-ness propagates over the clone"; weboflies injects it into other process's clone calls
18:50:47  elliott: it isn't for me; the docs say it can't be
18:50:53  what should I make it?
18:50:56  but apparently it can be anyway, it's just undocumented
18:51:00  heh
18:51:01  I made it a char array
18:51:07  I'll make it NULL out of laze
18:51:09  wait, you can pass arbitrary arguments to the fn with clone?
18:51:20  and then there's three arguments /after/ the varargs?
18:51:25  just the one void*
18:51:27  it's not varargs
18:51:30  oh, ok.
18:51:31                   int flags, void *arg, ...
18:51:31                   /* pid_t *ptid, struct user_desc *tls, pid_t *ctid */ );
18:51:34  that's still wtf though
18:51:38  well, it is, but only to hide the fact that those three args are optional
18:51:43  oh
18:51:46  it's not ... as in varargs, but as in stdarg
18:51:53  err, not stdarg
18:51:58  whatever was used before varargs was invented
18:52:35  incidentally, strace injects CLONE_PTRACE into other process's fork/clone calls too
18:52:39  f(v)char**v;{execvp(v[1],v+1);}
18:52:39  main(c,v)char**v;{setresuid(1000,1000,1000);printf("%d %d\n",clone(f,0,CLONE_PTRACE,v),getpid());sleep(100);}
18:52:45  even changing fork to clone for that purpose
18:52:49  ais523: heh
18:53:02  (the interface is identical syscall-wise; just different in glibc)
18:53:20  ais523: oh no, clone() is returning -1
18:53:30  perhaps you can't put NULL there
18:53:32  in glibc
18:53:35  just in the direct kernel syscall
18:53:36  yeah, probably
18:53:39  I'll allocate a char array
18:53:43  how many bytes should it be, roughly?
18:53:51  enough for one exec call
18:53:56  so 100 will easily be enough
18:54:06  make it 512
18:54:07  #define _GNU_SOURCE
18:54:07  #include 
18:54:07  f(v)char**v;{execvp(v[1],v+1);}
18:54:07  main(c,v)char**v;{char s[1024];setresuid(1000,1000,1000);printf("%d %d\n",clone(f,s,CLONE_PTRACE,v),getpid());sleep(100);}
18:54:08  beautiful
18:54:19  wait, you put it /on the stack/?
18:54:24  make that thing static!
18:54:29  [elliott@dinky weboflies]$ ls -lhd /proc/7739{,/fd}
18:54:29  dr-xr-xr-x 8 elliott root 0 Nov  5 18:53 /proc/7739
18:54:29  dr-x------ 2 root    root 0 Nov  5 18:53 /proc/7739/fd
18:54:29  [elliott@dinky weboflies]$ ls -lhd /proc/7740{,/fd}
18:54:29  dr-xr-xr-x 8 elliott root 0 Nov  5 18:53 /proc/7740
18:54:30  dr-x------ 2 elliott root 0 Nov  5 18:53 /proc/7740/fd
18:54:31  I'm not sure what happens if you put a stack on the stack
18:54:34  but it seems sort-of wrong
18:54:36  ais523: it works, apparently!
18:54:54  elliott: OK, so now we have to figure out what weboflies is doing differently
18:55:06  ais523: it's formatted slightly more sanely, for one
18:55:18  ais523: try removing all whitespace
18:55:53  I doubt that'll matter
18:57:00  ais523: am i meant to be reading weboflies.c here, or are you? :-)
18:58:13  I'm quite familiar with it already, and I'm trying to guess what's different
18:58:14  from memory
18:58:37  What does weboflies do?
18:59:09  Phantom_Hoover: make people go insane
18:59:26  Phantom_Hoover: also, catch flies
18:59:38  Cool.
18:59:44  How does it go about the former?
19:00:13  Phantom_Hoover: by directly twiddling bits in their process's memory
19:00:15  Phantom_Hoover: catching lots of bugs and then making people figure out what's causing them
19:00:19  get it?
19:00:21  flies are bugs!!!!!!
19:00:30  webobugs
19:00:32  Ah.
19:00:32  in ways that have a tendency to confuse Linux
19:03:40  http://en.wikipedia.org/wiki/Lists_of_Zambia-related_topics
19:03:42  I...
19:05:12  airports, birds, settlements
19:09:53  http://en.wikipedia.org/wiki/Talk:Lists_of_Zambia-related_topics
19:09:55  least loved article
19:21:40  i submit that the wikipedia list system will eventually evolve sentience when it becomes so complicated that it requires a TC kind/sort system.
19:21:53  :D
19:22:16 -!- Vorpal has quit (Ping timeout: 260 seconds).
19:27:51  "Well, I usually use whatever comes handy, but I'm sure there are other approaches — like, for example, trying something almost unusable first.
19:27:56  "
19:28:02  seen on haskell-cafe
19:32:18  heh
19:40:44  ais523: any ideas about weboflies?
19:41:34  no, I'm a little stumped
19:41:51  Gregor: OMG, the Node folks just keep on giving. Get this: ASYNCHRONOUS testing. http://vowsjs.org/
19:41:54  Webscale tests!
19:41:55  let me make sure it isn't a schrödingbug
19:42:57  yep, it's working just fine for me, still
19:44:43  ais523: I could give you root ssh access to a VM
19:46:27  elliott: hmm, might help
19:46:35  such a pity that weboflies repels debuggers
19:46:36  we bo flies here
19:46:52  ais523: ok, I'll set one up... you could set up your own VM, but I guess you don't have a recent iso handy
19:46:59  right
19:47:08  I don't have a recent iso handy of /anything/
19:47:13  hmm, neither do I, but I can download one quickly
19:47:18  it'll be a 32-bit vm to simplify things
19:47:29  also, qemu, since I don't have VirtualBox installed
19:50:04 -!- nooga has quit (Ping timeout: 240 seconds).
19:51:30  ais523: right, I'll have a VM up in 15 minutes or so
19:52:07  I suppose I'm glad you aren't insane enough to give people you only know over the Internet root access to your main computer
19:52:38  ais523: I was going to, but then I realised I didn't want you to have read access to ~
19:52:57  yes, that's probably a good idea ;)
19:53:09  not giving me read access to ~
19:53:11  there should be something like root identical in every way except that they can't elevate to root or read directories with a certain special bit set
19:53:18  (I'm amused that you don't mind me having /write/ access to ~, though)
19:53:32  ais523: meh, the only thing you could do with that is trash things
19:53:57  I've known people who literally have ~ accessible via http.
19:53:59  I could rewrite your .bashrc to change the perms on your home dir so that I could read them, I guess
19:54:08  pikhq_: normish had / accessible via http
19:54:12  but it wasn't really a normal system
19:54:21  ais523: yes, but I don't think you /would/ do that :)
19:54:31  IIRC, ams has that setup.
19:54:32  (I don't really think you'd look at ~ either, but it's a bit too readily accessible for me to be happy about it)
19:54:46  Of course, ams is anything but normal.
19:54:50  right, and I'd feel uneasy having access to it even if I didn't use it
19:55:02  hmm, home directories should be encrypted loopback filesystems
19:55:14  problem: you'd have to type your private key in on every login
19:55:27  I suppose password-encrypted would work, actually
19:55:34  Well, you already have to type a password in on every login.
19:55:37  right
19:55:53  gah, I need a better name for my temporary stuff than ~/Temp
19:56:05  (needs to be titlecased because ~/Code is permanently ingrained in my brain)
19:56:15  elliott: how temporary?
19:56:22  ais523: good question :)
19:56:24  I use /var/tmp for temporary stuff that needs to persist across reboots
19:56:27  in this case, the VM HD in question
19:56:28  and /tmp for other temporary stuff
19:56:38  it's not so temporary that I want it in a system temporary directory
19:56:41  oh, I probably would put that in /tmp
19:56:46  but I won't feel any great loss if I rm -r ~/Temp
19:56:56  hmm, ~/Junk is tempting
19:57:39  I have a specific directory for things that I want to keep around because they'd be time-consuming to redownload and reunpack, but are too large and unimportant back up
19:57:45  *to back up
19:57:50  that's /var/cache
19:58:05  which is why downloaded packages are stored there
19:58:09  well, OK
19:58:14  but it's not quite the same as /var/cache
19:58:25  it's things like the repo of gnome-games (with entire history)
19:58:29  this is why my Keep system is best :)
19:58:32  and my builds of it
19:58:35  those would go in ~/Keep/YYYY-MM
19:58:39  you don't normally build things in /var/cache, do you?
19:58:44  indeed
19:58:59  (2/3) installing vde2                              [######################] 100%
19:58:59  Change /etc/conf.d/vde to your needs.
19:58:59  vde config files should be placed in /etc/vde, sample files are provided.
19:58:59  iptables and dhcpd sample files have been installed to '/usr/share/vde2'.
19:58:59  Merge those examples, if needed to the according config files.
19:59:00  blahh, I hope qemu networking works without doing that
19:59:06  I anticipate forwarding the ssh port to be a pain
19:59:14  what's vde?
19:59:21  a dependency of qemu
19:59:23  elliott: reverse-tunnel from the VM outwards?
19:59:35  ais523: I mean, exposing it on my local machine outside of the VM
19:59:42  the default networking mode of most VM's doesn't do that
19:59:50  right, I see
20:00:17  [elliott@dinky Temp]$ qemu-img create weboflies.qemu2 4G
20:00:17  Formatting 'weboflies.qemu2', fmt=raw size=4294967296
20:00:17  [elliott@dinky Temp]$ ls -lh
20:00:17  total 0
20:00:17  -rw-r--r-- 1 elliott users 4.0G Nov  5 19:59 weboflies.qemu2
20:00:18  turns out qemu2 =/= qcow2
20:00:36  [elliott@dinky Temp]$ qemu-img create -f qcow2 weboflies.qcow2 4G
20:00:36  Formatting 'weboflies.qcow2', fmt=qcow2 size=4294967296 encryption=off cluster_size=65536
20:00:36  [elliott@dinky Temp]$ ls -lh weboflies.qcow2
20:00:36  -rw-r--r-- 1 elliott users 193K Nov  5 19:59 weboflies.qcow2
20:00:36  better
20:00:45  elliott: is it a sparse file?
20:00:52  ais523: presumably; it created instantly
20:00:54  for some weboflies test, I was using a sparse ext4
20:01:04  which is 4G notional size, but much smaller on disk
20:01:48  It's not a sparse file as far as the underlying filesystem is concerned; the logic for doing that is in qemu itself for the qcow2 format.
20:03:03  pikhq_: he was talking about the previous raw noe
20:03:04  pikhq_: I meant in qemu2
20:03:04  one
20:03:07  ais523: qcow2
20:03:09  :D
20:03:20  elliott: so one issue with sparse files is, that they don't decompress well
20:03:25  Yeah, the raw format is just a naive sparse file.
20:03:34  haha
20:03:34  they compress just fine, but decompressing tends to actually write out all the zeroes
20:03:35  ais523: tar -S
20:03:54  pikhq_: that is good to know
20:04:01  GNU tar records sequences of 0s so it can write it out as a sparse file again using that option.
20:04:12  why isn't that default?
20:04:24  elliott: It's a GNU-specific extension to the format.
20:04:36  oh, it's at record time, not unpack time?
20:04:39  Yeah.
20:04:40  yes
20:04:42  right
20:05:15  When you unpack with a non-supporting tar, you basically get a file with a header describing the sparseness and a bunch of bits.
20:05:51  IIRC the format was designed so that, at least in principle, you could use a small C program to unpack that.
20:07:53  ais523: how much RAM will you need? :p
20:08:06  only a few megabytes, to run tests
20:08:21  I don't think Linux will even boot with that little :)
20:08:32  Man, Arch's installer is so slow and clunky.
20:08:35  a few megabytes ... and then a gigabyte to boot the rest of the system
20:08:38  There's a noticable delay after hitting any button.
20:08:48  ais523: you're getting a jfs filesystem, hope you like it
20:08:59 -!- oerjan has quit (Quit: Good night).
20:09:04  why jfs on a VM?
20:09:10  just out of interest
20:09:17  I like jfs :)
20:09:43  had to make an ext2 /boot because arch's installer doesn't do grub2 :(
20:09:47  or lilo, lilo would work too
20:09:59  (seriously, lilo has much better filesystem support than grub1)
20:10:23 -!- derrik has joined.
20:10:58  hmm, lilo doesn't have filesystem support at all, does it?
20:11:18  of course it does; how else would it boot?
20:11:36  by making a list of blocks to load when you install it, of course
20:11:58  hmm, I'm pretty sure it supports reading filesystems nowadays
20:12:09  I could always be wrong, though
20:12:26  it was a long time ago I used lilo, it can have changed a lot since then
20:13:30  elliott: It doesn't.
20:13:49  pikhq_: well, the statement is still true then, lilo supports *every* filesystem! :)
20:14:03  Well, any filesystem that stores the kernel as contiguous raw bytes
20:14:27  It records in the boot sector the location of a block of the disk that contains a list of blocks for each file it cares about.
20:14:35  heh
20:14:44  i.e. it doesn't even require the kernel be a series of contiguous raw bytes.
20:14:59  can't do compression or encryption, though :)
20:15:04  Right.
20:15:15  nothing else did back then either, so that's just fine :)
20:15:32  Slackware still *uses* lilo.
20:15:44  I mean, it doesn't support any other bootloader.
20:15:48  the ideal would be a bootloader that can use linux filesystem modules
20:15:55  silly to duplicate all that effort
20:16:14  i.e. using linux on a /boot partition as the boot loader?
20:16:34  olsner: well, yeah :)
20:16:41  why /can't/ linux boot itself?
20:16:51  It can. kexec.
20:16:51  I suppose the problem is you need the filesystem support to load the filesystem support
20:16:55  but that's only a problem if it's not compiled in
20:16:59 -!- nooga has joined.
20:17:10  The issue is getting *a* Linux running in the first place...
20:17:12  surely it'd not take much code to get linux to be installable outside of the FS
20:17:20  you'd need a suitable boot sector, that's all
20:17:26  Until 2.6 you could.
20:17:26  it can/could/does build with a built-in boot sector
20:17:34  Now I made the function "probNorm" to normalize a probability distribution using MonoidicT.
20:17:34  what did 2.6 do? :(
20:17:42  dd if=/boot/vmlinuz of=/dev/fd0
20:17:47  Removed the boot sector.
20:17:53  lame
20:18:11  I think it only booted from floppy, though.
20:18:26  But it has to be a list, the monoid has to be a Ring and a MonoidPlusNorm and Eq, and the data has to be Ord.
20:18:47  zzo38: you don't need a list
20:18:50  see Data.Foldable
20:19:35  elliott: OK, I will look.
20:19:45  zzo38: I'd go for foldMap -- that lets you map every element of the structure to a monoid, then sums them all
20:19:57  so you just take the function to turn it into a monoid (e.g. Sum) and extract the final value out
20:20:06  but you could do foldr (+) 0 if you're boring :)
20:20:20  actually
20:20:23  Data.Foldable.sum exists, so yeah
20:21:52  The probNorm function does a whole bunch of stuff including sorting and combining entries, and removing zero probabilities (represented by values equal to mpempty)
20:24:10  ais523: this VM is currently taking a really long time to calculate checksums
20:24:13  ais523: I probably should have given it more RAM
20:24:39  Yes there is Data.Foldable.sum but I am using it for any ring, so that won't work.
20:27:03  Yeah, just use the folds directly then
20:35:22  ais523: the installer died at the hands of the OOM killer...
20:35:28  ouch
20:35:32  probably it does need more memory :)
20:35:38  I'll do it again later :P
20:35:40  cba right now
20:46:57 -!- NihilistDandy has joined.
21:10:34  `? welcome
21:10:37  Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
21:10:39  `? finland
21:10:42  Finland is a European country. There are two people in Finland, and at least five of them are in this channel. Corun drives the bus.
21:10:44  (turns out those are not the same word)
21:11:00  `? elliott
21:11:02  elliott wrote this learn DB, and wrote or improved many of the other commands in this bot. He probably has done other things?
21:11:09  Gregor wrote that.
21:11:13  `? Gregor
21:11:15  Gregor took forty cakes. He took 40 cakes. That's as many as four tens. And that's terrible.
21:11:25  `? ai
21:11:27  `? ais523
21:11:27  ai? ¯\(°_o)/¯
21:11:29  ais523 is ais523. This topic may retroactively become more informative if or when Feather is invented.
21:11:33  `? Ph
21:11:35  Ph? ¯\(°_o)/¯
21:11:36  `? Phantom_Hoover
21:11:38  Phantom_Hoover? ¯\(°_o)/¯
21:11:45  I keep forgetting to hit tab.
21:11:55  `? EgoBot
21:11:57  EgoBot? ¯\(°_o)/¯
21:12:02  `? fungot
21:12:02  `? friendship
21:12:03  Phantom_Hoover: is not often that he returns empty-handed. he knows where the old slope holds unchanged the fine estates and bits of walled garden and crystal
21:12:04  fungot? ¯\(°_o)/¯
21:12:08  `? friendship
21:12:11  friendship wisdom
21:12:19  friendship wisdom
21:12:21  How do I add things
21:12:34  `? CakeProphet
21:12:36  ​:>
21:12:42  `? tiffany
21:12:44  tiffany? ¯\(°_o)/¯
21:12:52  `? augur
21:12:54  augur took no cakes.
21:12:56  wha?
21:16:40   How do I add things
21:16:43  learn to `learn
21:18:20  HELLO BEAUTIFUL SEXY NEW COMPUTER
21:18:32  $ df -h .
21:18:34  Filesystem      Size  Used Avail Use% Mounted on
21:18:36  /dev/sda1       2.7T  7.2G  2.6T   1% /
21:18:38  Awwwwwwww yeaaaaaaaaaaah
21:18:54  7.2GB used? omg the bloat
21:19:46  Gregor: mount | grep sda1
21:20:33  `learn you a haskell
21:20:35  I knew that.
21:20:37  `? you
21:20:39  `? you
21:20:39  you a haskell
21:20:41  you a haskell
21:20:44  You so a Haskell.
21:21:03  elliott: ... why?
21:21:19  Gregor: Because I bet you're using a Wrong Filesystem, and I want to insult your computer on that basis.
21:21:43  I'm using ext4.  LOLOL IT DON'T SCALE I PREFER MURDERFS
21:21:47  `learn fungot cannot be stopped by that sword alone.
21:21:48  Phantom_Hoover: when age fell upon the world whenever another earthquake shall heave their monstrous stone city again to the pit, all fnord by a white god might prove valuable to the ethnologist. in his lonely farmhouse. he was writhing under the bedclothes, and a sprinkling of crumpled papers. it was inside this circle that the ring of fire.
21:21:49  I knew that.
21:21:53  `? fungot
21:21:55  Phantom_Hoover: that such regions in truth existed, seemed amply clear from many things. faint cries and groans unmistakably came up now and then he shut him in an attic room across the hall. all i could, and watched for the lights to come up early the next day with little old matthew fenner, whose grave was not very likely to be fnord fnord,
21:21:55  fungot cannot be stopped by that sword alone.
21:21:58  he's probably using one of the boring default ones, like ext4
21:22:03  ^style
21:22:03  Available: agora alice c64 ct darwin discworld europarl ff7 fisher fungot homestuck ic irc jargon lovecraft* nethack pa sms speeches ss wp youtube
21:22:21 -!- Patashu has joined.
21:22:25  Gregor: Nah, ext4 probably scales just fine, it's just intended obsolete by design :)
21:22:35  it's as if he'd rather want a working filesystem than a cool one
21:22:48  Gregor: Hope you're happy when its authors decide we're ready for btrfs, which ext4 is meant as a transition to! Enjoy yer Oracle
21:23:15  MurderFS is what is also known as ReiserFS, right?
21:23:26  olsner: I'm so glad serious people like IBM don't use the 12-year-old filesystem I use.
21:23:48  elliott: hmm, which one was that? JFS?
21:23:53  yeah
21:24:00  actually 21 years old, but JFS2 is 12 years old
21:24:25  the filesystem i turn to when i want coolness is nilfs2 :P
21:24:30  hah, OS/2 had JFS support :D
21:24:39  it's where it originated :P
21:25:00 -!- Phantom_Hoover has left ("Leaving").
21:25:04 -!- Phantom_Hoover has joined.
21:25:18  I always assumed it came from AIX or at least that it never existed at the same time as OS/2
21:26:08  They first shipped it for OS/2 in 1999.
21:26:21  OS/2, of course, lasted a *lot* longer than it had any right to.
21:26:47  The Linux version is a port of the OS/2 version.
21:34:06 * ais523 reads about Eclipse's new language Xtend
21:34:26  as far as I can tell, it's basically Java plus all the syntactic sugar they could think of
21:34:39  although "whitespace inference" is a bit bizarre
21:34:40  haha
21:34:46  wait, what?
21:34:57  when you have a string with a bunch of interpolations in
21:35:01   They first shipped it for OS/2 in 1999.
21:35:06  then you might want to put whitespace around the interpolations
21:35:09  oh, hmm
21:35:12  which doesn't go in the string
21:35:17  elliott: Yes, OS/2 lasted fucking *ages*.
21:35:17  olsner: looks like JFS1 was AIX in 1990, and JFS2 was OS/2 in 1999
21:35:25  ais523: weird
21:35:33  so it figures out whether the whitespace is meant to be part of the string, or is just there for indentation
21:35:46  ais523: oh, I see
21:35:47  and Eclipse syntax-highlights which is which, obviously
21:35:48  Actually, make that "has lasted".
21:35:54  which doesn't go in the resulting string, not which doesn't go in the source string
21:36:01  IBM sold it off, but it's still actively developed.
21:36:03  I thought "x${y}z" would become "x foo z" or something
21:36:05  with y="foo"
21:36:20  ah, I see
21:36:24  you're thinking of Perl 6, there
21:37:01  Hell, it's even vaguely usable still; Firefox, OpenOffice, VLC, et al. have maintained ports.
21:38:13  pikhq_: I think the same applies to AmigaOS 4 :-)
21:39:21  ... The fuck?
21:39:32  eComStation's sound stack is a port of ALSA.
21:39:38  X-D
21:41:20 -!- nooga has quit (Quit: leaving).
21:42:05  [elliott@dinky Temp]$ qemu -m 1024 -hda weboflies.qcow2 -cdrom ~/Downloads/archlinux-2011.08.19-netinstall-i686.iso -boot c
21:42:05  Failed to allocate 1073741824 B: Cannot allocate memory
21:42:05  Aborted
21:42:07  ais523: wait, what?
21:42:24  clearly it was trying to allocate 1GB of memory
21:42:25  -/+ buffers/cache:       3190        613
21:42:32  hmm... why is all my RAM used up?
21:42:36  at least, that looks around 1GiB, I'm not sure if it's exact as I don't have it memorized
21:42:43 * elliott checks how to sort by RAM in topa gain
21:42:46  s/topa /top a/
21:42:53  (I have to look it up every time I want to do it)
21:42:59  M
21:43:01  ais523: that would be the -m 1024 part
21:43:12  elliott: I just use < and > after loading top
21:43:14  olsner: gah, I think it's counting virtual memory
21:43:19  they changes the sort order
21:43:25  olsner: can I count physical memory?
21:43:27  and it's normally reasonably obvious what they're sorting by right now by inspection
21:43:29  ais523: *change
21:43:33  err, yes
21:44:01  elliott: hmm... I thought it sorted by RSS or something, at least not VSIZE
21:44:13 -!- nooga has joined.
21:45:06  oh, killall chromium actually solved the problem
21:45:57  ais523: I'm surprised qemu's allocation actually /failed/, though
21:46:02  I'm pretty sure I have overcommit on
21:46:17  how would you process ruby source files containing classes? discovering/adding/removing class contents
21:46:22  qemu might be asking to commit that memory
21:46:29  nooga: awk
21:46:38  olsner: hmm, how do you do that?
21:46:44  nooga: or sed, at a pinch
21:47:03  there's a flag to mmap for that, MAP_LOCK or something
21:47:12  elliott: well an alloc that large would be mmaped
21:47:23  mmap overcommits too
21:47:40  hmm
21:47:53  i tried with ruby ParseTree and sexp_processor
21:47:57  and ruby2ruby
21:48:14  nooga: congratulations, you successfully overthought the problem in an insufficiently reflective language
21:48:15  elliott: MAP_POPULATE requests prefaulting
21:48:20  ais523: fair enough
21:48:27  I just went and looked it up
21:48:38  and ofc, if you're overcommitting but prefaulting is requested, then you can tell something's worng
21:48:40  *wrong
21:48:41  elliott: ruby is quite reflective at runtime
21:48:46  I doubt qemu /would/ be prefaulting, though, it has no reason to do so
21:48:52  nooga: no it's not, at least not in the right sense
21:48:58  ruby provides no access to its ast whatsoever
21:49:51  ParseTree takes a method or class and throws it's sexp representation in your face
21:50:07  you can mess with sexp and then translate it to ruby again
21:50:18  its*
21:50:23  i will never learn
21:50:29  Ruby: because we think every AST is a sexp!
21:50:50  isn't parse_tree by zenspider
21:50:55  I can't imagine his software is any more tolerable than himself
21:55:02  ais523: haha, wow, apaprently the Calibre website says "Please do not use your distribution provided calibre package, as those are often buggy/outdated. Instead use the Binary install described below."
21:55:10  *apparently
21:55:23  elliott: beautiful
21:55:26  "As I suspected, you're in this not to contribute something to the community, but as a destructive influence." ;; ooh, this keeps getting better and better
21:55:27 -!- edne has joined.
21:55:35  (after he gives up on writing exploits because the guy keeps patching it)
21:55:36  hi edne
21:55:37  `? welcome
21:55:39  Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
21:55:45  elliott: hi
21:57:00  ais523: haha: "Well, if you do not wish to help, that leaves me with no choice but to remove the mount helper."
21:57:33  ais523: (this is /after/ one of them supplies a drop-in replacement patch using the udisk script Ubuntu uses)
21:58:13  "@Dan: You were on my ignore list, which meant I never saw your exploit" ;; lmao
21:58:18  this is definitely the best bug report I've read
21:58:32  can you link it again?
21:58:38  given that I assume you're there atm
21:58:43  https://bugs.launchpad.net/calibre/+bug/885027
21:58:48  good luck trying to find your previous position
22:02:09  I found it pretty easily, actually
22:02:24  by skimming for the comment I remembered being at the end
22:03:26  http://www.ciclops.org/view_media/34501/Catching_Its_Tail%253Fjs%253D1?js=1
22:03:27  Whoa.
22:06:55  Oh, I just realised that the line in the middle is the rings.
22:07:04  I thought it was some weird formatting bug.
22:07:12  ais523: I like the guy who signs every comment with " of the GNAA." like it's a Ph.D.
22:07:16   Please note that I misjudged just how broken this code is
22:07:23  Phantom_Hoover: X-D
22:07:47  Phantom_Hoover: What is it with planets looking so cool.
22:08:07  Phantom_Hoover: (OK this is bias in the form of how cool the Earth looks seeming mundane.)
22:08:13  got to the end and now it says "Displaying first 40 and last 40 comments."
22:08:40  olsner: heh
22:08:42  elliott, have you seen pictures of the Earth from space?
22:08:47  Phantom_Hoover:  Phantom_Hoover: (OK this is bias in the form of how cool the Earth looks seeming mundane.)
22:08:54  there went all sense of accomplishment from getting to the end
22:09:14  Ah, I was confused by your insane grammar.
22:09:38  olsner: um it inserts "N comments hidden" inline
22:10:08  (I think the best demonstration of the 60s is that TOS episode where they had a completely cloudless Earth because /nobody had seen a picture of it from space/.
22:10:10  *)
22:10:20  c) Has the full right to be proud of his work and initially doubt and/or question vulnerability reports from an unknown source
22:10:32  I didn't read those "comments hidden" blocks since they weren't formatted as comments :)
22:10:32  An unknown source that gives source-format exploits.
22:10:47  Phantom_Hoover: Oh man, that would be cool to see.
22:11:18  I think IWC had an annotation on the matter.
22:11:32  Phantom_Hoover: It's simultaneously weird at what a relatively high level of tech we were at in the 60s and still not having been to space, and weird that we managed to go to space on the tech level of the 60s.
22:11:46  (You think my grammar is insane, try THAT one out for size.)
22:12:41  "Standby and I'll update the exploit for your latest fix" :>
22:12:43  elliott, I think it's even weirder that navigational computers could be fitted into a spacecraft less than thirty years after someone had the bright idea of building one of these computer things.
22:12:53  ais523: the best part is people claiming it's secure because it's not used if you have udisks installed
22:13:02  ais523: despite it /still being installed/
22:13:20  Phantom_Hoover: That's... pretty unbelievable when stated like that.
22:13:35  Phantom_Hoover: I think I know the reason we haven't gone back to the moon yet, it's because it worked like flying does in H2G2.
22:13:38  thirty years is a long time, though
22:13:42  We only managed it because we hadn't realised how bloody hard it was.
22:13:59  I'm less than 30 years old; and a lot's happened in technology in my lifetime
22:14:04  Or maybe because the Russians couldn't be allowed to get there first?
22:14:18  ais523: OTOH, the further you go back, the fewer advances technology makes in 30 years...
22:14:22  ais523, oh man, I honestly remember being introduced to the web.
22:14:33  what massive technological advancements happened 1210-1240?
22:14:51  (I bet that date span I just made up contained the invention of something of huge magnitude by sheer coincidence.)
22:14:52  elliott, careful, that way lies mainly Kurzweil.
22:14:59  hmm; I think it's to do with the speed of communication
22:15:10  "Colossus was the world's first electronic programmable computer."
22:15:12  Phantom_Hoover: Oh come on, it's undeniable that the rate of change /has/ increased rapidly in recent history.
22:15:13  without good communication technology, technological advances have to be made again and again and again
22:15:24  elliott, yeah, unquestionably.
22:15:32  Phantom_Hoover: That's not the same as "also, it's going to increase exponentially in the next like ten years and then we'll be friendship computers".
22:15:46  It was a joke.
22:15:55  Phantom_Hoover: YOU COMPARED ME TO KURZWEIL THAT WILL NEVER BE A JOKE
22:15:56 * elliott sobs
22:15:58  "In Song Dynasty China and the classical Islamic world, this century marked the high point for both classical Chinese civilization, science and technology, and classical Islamic science, philosophy, technology and literature."
22:16:16  elliott, your anti-11th-centur— wait 1200s are the 13th.
22:16:20  Phantom_Hoover: FML
22:16:22  Oh good.
22:16:26  That's still nothing compared to the craziness that was the 20th century.
22:16:33  Yeah nothing happened then.
22:16:49  pikhq_, sorry, you're not allowed to comment after that stupid thing you said about the Dark Ages once.
22:16:50  July 17 – Former king Sverker the Younger of Sweden is defeated and killed by present king Erik Knutsson of Sweden in the Battle of Gestilren.
22:17:00  Phantom_Hoover: Wow, Erik Knutsson must be really old if he's the present king.
22:17:04  Phantom_Hoover: I said something about the Dark Ages?
22:17:05  If Swedes died in it, it's all right with me.
22:17:12  Phantom_Hoover: Also the middle ages never happened OK.
22:17:43  http://en.wikipedia.org/wiki/Timeline_of_historic_inventions#13th_century
22:17:46  Aahahahaha
22:17:49  Worst century.
22:17:49  http://upload.wikimedia.org/wikipedia/commons/c/c9/Hommage_of_Edward_I_to_Philippe_le_Bel.jpg ;; wow this is the worst interior design.
22:17:54  We started the century having basically figured out industry, and ended it with flight, computers, networking, nuclear power, and an insane pile of science.
22:17:55  "al-Jazari's automata"
22:18:01  Phantom_Hoover: Paper mill ain't bad!
22:18:05  pikhq_, you forgot the space!
22:18:11  Phantom_Hoover: OTOH that's 100 years, not 30.
22:18:22  Pfft, it's just a normal mill with paper.
22:18:24  Derivative.
22:18:26  Phantom_Hoover: omg "The first confirmed record of a press appeared in a 1439 lawsuit against Gutenberg."
22:18:31  Also, yes, we got spaceflight and satellites.
22:18:32  Superinjunctions!
22:18:32  http://en.wikipedia.org/wiki/Al-Jazari#Automata
22:18:39  Actually this looks pretty cool.
22:18:40  Which system do you prefer: degrees or zodiac or hours?
22:18:50  zzo38: Radians.
22:18:52  Phantom_Hoover: OMG robot band.
22:19:06  pikhq_, which computers totally ruined (note: opinion derived from Project Rho, probably wrong).
22:19:25  Phantom_Hoover: Wow, that timeline of historic inventions' entire list for the 20th century is "the web".
22:19:29  What's up with that.
22:19:30  (There was also probably something about how it would have all been great if Asians had done it which I trimmed out.)
22:19:39  elliott: Because nothing else matters.
22:19:49  pikhq_: Tell me you're not being serious.
22:19:49  elliott, it takes the confused.com attitude towards history.
22:20:03  elliott: That's the most heavily sarcastic thing I have said in memory.
22:20:06  elliott: remove that and replace it with a link to wikipedia, the pinnacle of human achievement
22:20:06  pikhq_: O, OK. However, Astrolog does not support that format. But if I write such a program, possibly I will include that option.
22:20:08  Phantom_Hoover: You fuckwit, I just heard that ad play out in my head.
22:20:09  Man, this article is so terrible.
22:20:14  pikhq_: OK good.
22:20:36  Phantom_Hoover: Maaan, it just reminded me that we STILL haven't replicated greek fire yet.
22:20:39  Somebody get on that???
22:20:45  elliott, dude, napalm.
22:20:47  I want to the world's best hooligan???
22:21:01  We mightn't be able to /replicate/ it, but we can do a hell of a lot bette.
22:21:03  *better
22:21:07  Phantom_Hoover: I don't WANT better.
22:21:15  http://upload.wikimedia.org/wikipedia/commons/2/25/Hand-siphon_for_Greek_fire%2C_medieval_illumination.jpg
22:21:17  Look at this guy.
22:21:27  This guy is standing on a seriously structurally unsound battleground.
22:21:30  He does look pretty awesome.
22:21:33  He doesn't even GIVE a shit.
22:21:40  Also wow how tall is that thing.
22:21:42  Particularly how his tower is just like "FUCK YOU GRAVITY".
22:21:58  Phantom_Hoover: I like how the castle looks like it was drawn by a five year old.
22:22:05  Including the two-dimensional bits at the top whose name I don't know.
22:22:13  elliott, do you know nothing about art history?
22:22:27  Phantom_Hoover: Do you know nothing about the history of manuscripts authored by five-year-olds.
22:22:31  JUST SAYING?
22:22:34  (Astrolog is set to zodiac signs by default, but it can use hours and degrees too. I set it to degrees; but astronomers who want to measure right ascension will probably use the hours format. Astrologers probably want to use the default setting for zodiac (which is probably why it is the default).)
22:22:37  It's basically "art was all drawn by five-year-olds until the Renaissance when they finally worked out how to draw actual things".
22:22:58  Also they're crenellations you fool.
22:23:03  Phantom_Hoover: Not actual five-year-olds.
22:23:11  Just people with all the aesthetic sense of five-year-olds.
22:23:17  http://upload.wikimedia.org/wikipedia/commons/2/2f/Hand-siphon_for_Greek_fire%2C_medieval_illumination_%28detail%29.jpg
22:23:20  Also, that's an exclusively European phenomenon.
22:23:20  Phantom_Hoover: OK seriously I want one of those.
22:23:26  pikhq_, clap clap clap, ur decetefivte
22:26:27 -!- quintopia has quit (Ping timeout: 245 seconds).
22:27:31  Although there are many correct arguments against astrology, there are also some wrong ones, such as this one:  http://jyte.com/cl/if-you-must-do-astrology-you-should-at-least-get-the-position-of-the-sun-correct  Some lists have both correct and wrong ones. They really should learn better before writing such wrong things.
22:27:56  If you say the sun is yellow due to 2+2=3, then you can get a correct conclusion even though you are making the wrong arguments for such things!
22:31:57  http://en.wikipedia.org/wiki/Early_thermal_weapons
22:32:12  'Thermal weapon' is apparently a euphemism for 'setting fire to stuff'.
22:32:54  "War without fire is like sausages without mustard"
22:32:56  I like this man.
22:34:52  Phantom_Hoover: PH how is dynamite so modern.
22:35:03  "A boy without mischief is like a bowling ball without a liquid center."  "A gleekzorp without a tornpee is like a quop without a fertsneet (sort of)."  "A man without religion is like a fish without a bicycle."  "A computer without COBOL and Fortran is like a piece of chocolate cake without ketchup and mustard."
22:35:03  I don't know?
22:35:18  Phantom_Hoover: Like what did we even do for fun before then.
22:35:29  Gunpowder.
22:35:39  Which isn't even a high explosive.
22:36:25 -!- quintopia has joined.
22:36:25 -!- quintopia has quit (Changing host).
22:36:25 -!- quintopia has joined.
22:36:37  Do you prefer cake with ketchup and mustard, or with fire and gunpowder?
22:37:31  Fire and gunpowder.
22:37:35  Gunpowder smells nice.
22:37:48  "People exposed to TNT over a prolonged period tend to experience anemia and abnormal liver functions. Blood and liver effects, spleen enlargement and other harmful effects on the immune system have also been found in animals that ingested or breathed trinitrotoluene. There is evidence that TNT adversely affects male fertility, and TNT is listed as a possible human carcinogen."
22:38:08  I remember when one of the staircases in the school science building smelt of it for days because of What The Sixth Years Did.
22:38:09  Phantom_Hoover: We should start just, like, putting TNT into the water supply of countries we don't like.
22:38:17  Then they will all become infertile and blow up??
22:38:34  I think it's stable in solution or something?
22:38:48  I think you are not supposed to put TNT into the water supply.
22:39:03  zzo38: oh, OK then.
22:39:09  Also TNT is quite hard to blow up anyway.
22:39:20  TNT contains 4.184 megajoules per kilogram.
22:39:25  Phantom_Hoover: Dammit when did we start using TNT for explosives.
22:39:27  Add " as appropriate.
22:39:32  if not TNT, what *are* you supposed to put in the water supply?
22:39:41  olsner: Hydroxic acid.
22:39:43  Phantom_Hoover: What weren't you allowed to do because of the sixth years again?
22:39:47  Huh, that's almost exactly 1000 times the heat capacity of water.
22:39:58  elliott, get chemicals which we didn't explicitly need.
22:39:59  TNT = explosive water.
22:40:18  You also need to put dihydrogen monoxide.
22:40:31  It was first synthesised in 1863, and was used as a dye.
22:41:45  http://en.wikipedia.org/wiki/File:Sailor_Hat_Shot.jpg
22:41:51  It's... like Minecraft in real life.
22:43:14  Phantom_Hoover: Man, and that was from the days where clicking TNT would blow it up.
22:43:21  They must have been really careful.
22:43:56 -!- MSleep has joined.
22:44:35 -!- sllide has quit (Read error: Connection reset by peer).
22:44:59  zzo38: "hydroxic acid" = water?
22:45:00 -!- sllide has joined.
22:47:10 -!- MDude has quit (Ping timeout: 240 seconds).
22:47:22  ais523: Yes
22:47:30  ais523: what's your favourite locale?
22:48:10  en_GB.UTF8
22:48:13  or however it's spelt
22:48:40  Why not en_US.SJIS? :P
22:48:47  ais523: your wish is my command; what's your favourite hostname
22:48:59  elliott: I normally use biomes as hostnames
22:49:09  But there are only like five of them!
22:49:11  (Bad Minecraft joke.)
22:49:28  ais523: Is there a biome where everything is miniature and also in a VM.
22:50:41  so as this one won't be around long, let's use "glacier", which isn't a biome but would be if more things lived there
22:50:41  and which is also rapidly melting
22:50:41  What about mushroom?
22:50:51  not as far as I know
22:51:46  Mushrooms aren't rapidly melting, Phantom_Hoover.
22:51:59 * elliott usually calls VMs matryoshka because he thought of it once and then never stopped using it.
22:52:04  It's a pain to spell, though.
22:52:50 -!- MSleep has quit (Read error: Connection reset by peer).
22:53:02 -!- MSleep has joined.
22:53:08 -!- MSleep has changed nick to MDude.
22:54:42 -!- NihilistDandy has quit (Quit: http://haskell.org).
22:55:52  elliott: luckily, I think cyrillic transliterations are varied enough that almost any spelling can be correct
22:55:57  "correct"
22:56:11  I'm not sure exactly how to pronounce it, either :)
22:56:32  in russian, obv.
22:56:49  let's see... Матрёшка
22:56:52  mat puker
22:57:33  matpuker, much easier to spell
22:58:11  Huh, nobody told me Chrome does RSS now.
22:58:27  a matpewka in the pectopah
22:58:43 -!- sebbu has quit (Read error: Connection reset by peer).
22:59:04  ais523: weboflies would work in Xen, right?
22:59:05 -!- sebbu has joined.
22:59:06 -!- sebbu has quit (Changing host).
22:59:06 -!- sebbu has joined.
22:59:10  elliott: I don't see why not
22:59:17  unless it triggers entirely different kernel bugs there
22:59:24  I doubt it, it's just drivers
22:59:32  ais523: and oh no, that means I've had another "if I was using Kitten..." moment.
23:02:20  ais523: [elliott@dinky Temp]$ qemu -m 1024 -hda weboflies.qcow2man -net nic -net user,hostfwd=tcp::2222:22
23:02:23  ais523: let's hope this works
23:02:25  oops, s/man//
23:02:48  qemu: -net user,hostfwd=tcp::2222:22: Device 'user' could not be initialized
23:02:50  oh good
23:03:01  aha
23:03:03  needs a - after 2222
23:04:31  ais523: libpng is the only dependency I need, right?
23:05:08  elliott: yes
23:05:17  well, barring the obvious, like glibc
23:05:24  Save the others: Eat yourself!
23:05:29  ok /me eats self
23:05:37  ais523: lol, the arch "emacs" package depends on gtk
23:05:55  Debian has both gtk and non-gtk versions, I think; IIRC both are installed here
23:06:15  seems there's no alternative, sigh
23:06:28  I'll just let it install gtk
23:06:29  to Emacs?
23:06:35  ais523: to the main package
23:06:39  does vim depend on gtk too? that'd be really hilarious
23:06:40  it's only a 70 meg download
23:06:44  Congrats, you're the only Arch user of emacs that doesn't want gtk
23:06:44  one that would go much faster with kitten...
23:06:55  ais523: No, there's a separate gvim package
23:06:59  it really irks me to see it download a bunch of few-hundred-kilobyte packages and pause noticably between them
23:07:02  Deewiant: The only?
23:07:11  Plenty of people use Emacs from the console
23:07:21  even I do sometimes
23:07:25  mostly when I'm termcasting for vim users
23:07:25  Arch has a lot of people who work from the console so I'd be very surprised if nobody would want it
23:07:36  ais523: hahaha
23:07:48  I was just referring to how there doesn't seem to be even an AUR package for non-gtk emacs
23:07:56  Deewiant: heh
23:07:57  I may've missed it though, there's a lot of emacs packages
23:08:19  Deewiant: you think it'd be easy, arch does tons of optional dependencies by just letting things break without them; all it'd take is some logic to make -nw be default if the gtk libs can't be found
23:08:34  I guess it'd have to load them dynamically too
23:08:43  And at that point people start getting queasy because ~OMG PATCHES~
23:08:44 -!- hagb4rd has quit (Ping timeout: 240 seconds).
23:10:40  Why aren't you checking package integrity in parallel you stupid thing
23:12:37  Oh man, I can use the terminal UI stuff I'm developing now for the installer too
23:12:46  Have you ever wanted your installer to have a BETTER UI THAN DARCS?!?!?!?! TRY KITTEN
23:13:38  Do you think this is OK way to measure the width?   objWidth (Box p) = maximum $ 0 : map (\((x, _), z) -> x + objWidth z) p;
23:17:22  Should there be a submodule for Graphics.DVI that is for accessing the system printer driver with it?
23:19:31  huh
23:19:54  i try to record a screencast fot the sixth time
23:20:14  i suck at speaking in english
23:21:22  ais523: yay, it's finally installed emacs and libpng
23:21:35  and libpng-dev?
23:21:46  ais523: that's part of library packages in arch, I think
23:22:03  hmm, source distro?
23:22:06  no
23:22:19  debian is the only one that does stuff like that
23:22:25  it's not even that i don't know what to say or make lame mistakes
23:22:29  i just mumble
23:22:30  why would a binary distro download library headers with libraries? most people want the libraries to run programs using them, not write programs using them
23:22:42  ais523: you can compile programs without writing them
23:22:50 * elliott finds the -doc and -dev splits really annoying, personally
23:23:06 -!- zzo38 has left.
23:23:08  I could buy that the -dev split might be OK for most Linux users (but probably not most Arch users), but -doc is just silly
23:23:14  well, yes, but you're on a binary distro; if you're compiling, it's probably because it's something that the distro doesn't package, or that you're working on personally
23:23:20  -doc is a bit silly, agreed
23:23:41  ais523: or you want a newer version, or you're installing something from the AUR (which is source-based), or it's source-configured like dwm
23:23:46  the second is particularly pertinent
23:23:57  ais523: anyway, I really doubt headers take up a noticable amount of space
23:24:09  keeping them together, at worse, wastes a bit of space
23:24:23  67M/usr/include
23:24:29  I was expecting it to be smaller, but I guess most headers are <4K
23:24:32  anyway, that's still pretty tiny
23:24:39  compared to, say, binaries :P
23:24:39  if headers are small, and they are, I suppose you could just have a package containing /all/ library headers
23:24:46  ha
23:24:50  that would conflict with itself, though
23:24:54  54M/usr/include
23:24:56  (with --apparent-size)
23:25:07  299M /usr/include
23:25:15  234M with --apparent-size
23:25:17  Deewiant: you have a bigger disk than me, so it balances out :)
23:25:22 * elliott considers making ais523's user account have correct name information
23:25:29  as much of it as you know?
23:25:29  otherwise how could I know he's the 523rd such user on the system?
23:25:35  ais523: I believe I know it all
23:25:37  unless you have more middle names
23:25:42  well, OK
23:25:44  elliott: 50G for /
23:25:46  i have all the middle names
23:25:52  things like room number are part of the name info, aren't they?
23:25:57  and I can't quite remember that myself
23:26:00  ais523: I... doubt it?
23:26:27  ais523: looks like room number is a separate field
23:26:33  well, OK
23:26:39  but it's the same block of info, so it's unified in my head
23:26:44  ais523: technically, I should be asking you whaty it is, along with your work phone, home phone, and other
23:26:49  s/whaty/what/
23:26:52  but who even fills those out?
23:26:54  elliott: but I can't quite remember it
23:27:00  ais523: what's your favourite password :)
23:27:03  nor my work phone number, although I could look it up
23:27:08  elliott: like I'm going to tell you that :)
23:27:27  ais523: what's your second-favourite password :P
23:27:31  isn't it usual for you to set one and tell me, in this situation?
23:27:42  yes
23:27:51  you're so boring!
23:27:59  wait, /me gets the best idea
23:28:12  that distributed RNG thing you wrote for nomics?
23:28:22  that's beautiful too, but my idea was simpler
23:29:20  I suppose we could diffie-hellman a password over IRC, so it'd all be in the open and yet only us would know the passwords
23:29:23  but I can't remember how it works
23:29:54  I love how cryptography does the impossible on a regular basis
23:30:06  ais523: what does the naming scheme that made you ais523 do when people don't have middle names?
23:30:19  elliott: puts an x in there, generally
23:30:32  # adduser exh1
23:30:35  although I've seen other letters, that's only in staff names (which don't have the numbers)
23:31:05  What's it do with people with only a first name? Another x?
23:31:15  ais523: if you look at /etc/shadow, try not to mentally crack my password
23:31:18  pikhq_: I haven't seen that happen
23:31:25 * elliott hasn't yet shaken the habit of using one password for everything...
23:31:29  elliott: is it, umm, using an insecure hash?
23:31:37  it's the default, which is I think MD5(!)
23:31:38  Well, yeah, it's not exactly *common* any more.
23:31:44  but I somewhat doubt you can mentally crack MD5
23:31:55  elliott: I advise you to put the MD5 of your password into Google
23:31:59  if there are any results, change it :)
23:32:02  hmm, good idea
23:32:13  (note: this is the world's best method of reversing hashes)
23:32:18  god, I love the "incident will be reported" message
23:32:33  ais523: no results :)
23:32:49  wow, my old password gets results, though
23:32:58  and it's not a word or anything
23:33:16  the database it returns looks suspiciously like it's from leaked hashes of some kind
23:33:25  I need to try with mine, but I'm trying to work out how to md5 it without it being in my bash history
23:33:41  ais523: echo -n "$(cat)" | md5sum
23:33:43  -n to avoid the newline
23:33:49  you could also just md5sum and use ^D^D
23:33:58  ah right, I was thinking without it appearing on screen eitehr
23:34:00  *either
23:34:24  because I've been known to termcast shell sessions by mistake before now, also as I'm paranoid
23:34:30  ais523: hmm, someone must have packaged the "securely read a password" thing into a program
23:34:33  echo -n "$(cat)", eww
23:34:36  ais523: I know Python has an stdlib for it
23:34:41  Deewiant: :)
23:35:00  perl -MTerm::ReadPassword -e 'print read_password'
23:35:04  that's pretty simple
23:35:18  perl -pe 'chomp if eof' | md5sum
23:35:42  ais523: heh, I just outright googled my old password,a nd it's in SHA1 databases too
23:36:04  s/a nd/ and/
23:36:06  I keep making that mistake
23:36:14  yay, no results for either of my insecurish passwords
23:36:28  I'm assuming the ones that are meant to be secure, and that are only used in one place, really are secure
23:36:46  phew, my current password has no results
23:36:51  (Google could already know it about a thousand times over)
23:36:57  (so I don't see any harm in searching for it)
23:37:15  wow, host key generation takes ages
23:39:03  ais523: hmm, I'm changing my password to stop you possibly worrying about reading /etc/shadow :)
23:40:09  ais523: OK, ssh -p 2222 ais523@95.149.230.52; your password is your middle name, and you have passwordless sudo access
23:40:17  and so do I :p
23:40:37  what's his middle name again?
23:40:51  olsner: exactly
23:40:55  no longer my password on glacier :p
23:41:11  ais523: hmm, did your wikipedia article have it?
23:41:13  (new password is unique but insecure)
23:41:17  elliott: I think so, but I don't know
23:41:22  good thing it's deleted!
23:41:31  err, it looks like changing my password failed
23:41:46  don't worry, I won't look at /etc/shadw until you fix it
23:42:21  it's shadow, not shadw, these days
23:42:26  ais523: but I /msg'd you my requested new password
23:42:29  as you're the only one with sudo access
23:42:56 -!- pikhq has joined.
23:43:13 -!- pikhq_ has quit (Ping timeout: 252 seconds).
23:44:01  ais523: couldn't resist
23:44:10  what couldn't you resist?
23:44:14  oh right
23:45:37  hmm, a few warnings, but none are relevant
23:46:03  elliott: well, weboflies works just /fine/ inside the VM
23:46:10  on echo, at least
23:46:11  ais523: hahahahaha
23:46:13  let me check on cat
23:46:23  ais523: theory: it's something to do with 64-bit
23:46:26  yep, I just did cat /etc/passwd
23:47:12  ais523: see, if I was running Kitten, I could change the desired architecture in my VM configuration file and rebuild it in minutes...
23:47:32  oh, I was wondering why root's password wasn't shadowed; it was because it wasn't the actual root account, but a repeatablized one
23:47:51  heh
23:48:08  ais523: oh, I forgot to remove root's password; it's "x"
23:48:16  and now it's not
23:48:27  now it's inverse_shadow("!"), which has no result
23:49:02  hmm, I just tried running weboflies on su, to see what would happen
23:49:20  ouch
23:49:25  and it just said incorrect password, without taking input
23:49:30  haha
23:49:35  ais523: it probably tried to get control of the tty
23:49:45  but it can; the tty actually exists
23:49:54  it's just a repeatablized tty
23:50:11  there was also a bunch of "unknown syscall 102"
23:50:13  ais523: maybe you have a bug that stops such input methods working
23:50:17  test with that perl program :)
23:50:18  which is socketcall
23:50:24  so it's trying to use sockets for some reason
23:50:53  I think what I'd expect it to do is to notice it isn't running as root, and exit
23:50:59  ais523: it's emailing your password to rms for the Revolution
23:51:02  (you can't debug suid programs while still having them escalate)
23:51:04  On 64-bit it's getuid
23:51:14  (I wouldn't make cheap rms jokes if he hadn't written literally that about su)
23:51:16  Deewiant: rather than setuid?
23:51:25  Yes, setuid is 105
23:51:26  ineiros_: no, syscall 102, presumably
23:51:40  102 is socketcall
23:51:43  elliott: that was a weird misping
23:51:45   On 64-bit it's getuid
23:51:56  on 64-bit, syscall 102 is socketcall
23:51:58  is what Deewiant is saying
23:52:24  s/is/isn't/
23:53:15  well, socketcall doesn't exist on 64-bit
23:53:33  and this is running 32-bit su, as weboflies only runs 32-bit programs
23:54:04  I need to go home, anyway
23:54:21  elliott: anyway, if you want to run weboflies, now you have a VM it works in ;)
23:54:53  Linux glacier 3.0-ARCH #1 SMP PREEMPT Wed Oct 19 12:14:48 UTC 2011 i686 QEMU Virtual CPU version 0.15.1 GenuineIntel GNU/Linux
23:55:00  elliott: what version Linux on your own computer?
23:55:56  ais523: haha; and the same but x86-64 and not Virtual CPU
23:56:02  I suspect it's a 64-bit thing
23:56:53  ais523: since this is an up-to-date Arch system and I haven't fiddled about with anything like that at all
23:57:30  I just don't see how the number of bits would matter for file permissions
23:57:43  unless, hmm, perhaps that's just a symptom of the syscall numbers being all wrong
23:57:53  yep; note that I /did/ do -m32
23:57:58  but what if:
23:58:05  try running it on a 32-bit program
23:58:10  ais523: I did (weboflies)
23:58:19  you ran it on /itself/? is that sane?
23:58:26  ais523: it didn't even get to printing the usage error message
23:58:29  (I didn't specify any parameters)
23:58:40  ais523: like, let me tell you what number ioctl is on 64-bit
23:58:46  and you can check what that corresponds to on 32-bit
23:58:58 -!- ais523 has quit (Remote host closed the connection).
23:59:34  /usr/include/asm/unistd_64.h:#define __NR_ioctl16
23:59:38  #define __NR_ioctl                              16
23:59:38  #define __NR_lchown              16
23:59:43  Right
23:59:48  I doubt lchown is being called at process startup time...

2011-11-06:

00:00:04  although there is\
00:00:06    ewarn(chown("/tmp/home/" WOLUSER_NAME, WOLUSER_UID, WOLUSER_GID));
00:00:07  it's not a link
00:00:08  s/\\//
00:04:48 -!- derrik has quit (Quit: take carezz).
00:07:42 -!- pikhq has quit (Ping timeout: 244 seconds).
00:07:47 -!- pikhq_ has joined.
00:16:55 -!- tiffany has quit (Quit: nyu~).
00:24:07 -!- sllide has quit (Read error: Connection reset by peer).
00:24:17 -!- tiffany has joined.
00:27:47 -!- zzo38 has joined.
00:30:37 -!- tiffany has quit (Remote host closed the connection).
00:30:55 -!- quintopia has quit (Ping timeout: 260 seconds).
00:33:56 -!- variable has quit (Excess Flood).
00:34:10 -!- tiffany has joined.
00:37:45 -!- quintopia has joined.
00:37:57  Are you sure?
00:38:08 -!- variable has joined.
00:43:37 -!- edne has quit (Read error: Connection reset by peer).
00:43:51 -!- variable has quit (Excess Flood).
00:46:23 -!- elliott has quit (Remote host closed the connection).
00:48:46 -!- tiffany has quit (Remote host closed the connection).
00:50:44  https://github.com/kragen/xcompose/blob/master/dotXCompose
00:50:49  Ooh, a nice compose file.
00:51:39 -!- variable has joined.
00:51:51  variable!
00:52:58 * Phantom_Hoover → sleep
00:52:59 -!- Phantom_Hoover has quit (Quit: Leaving).
00:54:25 -!- tiffany has joined.
00:56:51 -!- nooga has quit (Ping timeout: 276 seconds).
00:57:10 -!- GreaseMonkey has joined.
00:58:29  Does the ddate program allow you to switch which kind of Discordian calendar you want?
01:05:57  oh wow, the full name of the guy who plays bashir is Siddig El Tahir El Fadil El Siddig Abderrahman Mohammed Ahmed Abdel Karim El Mahdi
01:07:14  ... and his son's name is django
01:08:10 -!- edne has joined.
01:11:11  Invent a game that requires you to use a realtime horoscope as the game board. Maybe, one player is Summer and one player is Winter. And if you have four players, then there is Spring and Autumn as well. You have to pay attention to the phase of the moon, too. And cards. And of course there need a time limit so that you cannot just wait for many months until the planets favor you.
01:14:42 -!- elliott has joined.
01:14:45  00:50:44:  https://github.com/kragen/xcompose/blob/master/dotXCompose
01:14:57  I decided that sucked, IIRC, although I forget why.
01:15:03  01:05:57:  oh wow, the full name of the guy who plays bashir is Siddig El Tahir El Fadil El Siddig Abderrahman Mohammed Ahmed Abdel Karim El Mahdi
01:15:03  01:07:14:  ... and his son's name is django
01:15:09  olsner: What is it with you and Django :P
01:15:13  `quote olsner.*django
01:15:20  324)  django is named after a person?   thought it would be a giraffe or something \ 379)  `quote django   ​352)  django is named after a person?   thought it would be a giraffe or something   thankfully only one \ 380)  `quote django   ​352)
01:15:27  elliott: it's not my fault!
01:16:14  Whose quotation are this:  "Any sufficiently advanced religion is indistinguishable from schizophrenia."  "I just hijacked your brain. You can have it back at the end of this sentence."  "The Grand Unified Conspiracy Theory ate the last cookie!"  "It is better to bless the dark than to waste a candle."
01:17:29  "It's not that life is too short, it's that death is too long."  "If you're not confused, you're ignorant."  "Yoda is programing in Forcetran only."
01:18:54  Who are these quotations?
01:20:12  Does superstition bring bad luck?
01:24:12 -!- tiffany has quit (Quit: nyu~).
01:36:49 -!- tiffany has joined.
01:46:10 -!- edne has left.
01:46:37 -!- myndzi\ has changed nick to myndzi.
01:48:20  `log "a", "b", "c", "aa"
01:48:44  2011-11-06.txt:01:48:20:  `log "a", "b", "c", "aa"
01:48:54  :t replicateM
01:48:55  forall (m :: * -> *) a. (Monad m) => Int -> m a -> m [a]
01:48:56  :t permutations
01:48:57  forall a. [a] -> [[a]]
01:49:40  `log "0", "1", "01", "11"
01:49:52  2011-11-06.txt:01:49:40:  `log "0", "1", "01", "11"
01:50:03  heh
01:51:06  > (\l -> map (\i -> permutations $ replicateM i l) [1..]) "01"
01:51:06    [[["0","1"],["1","0"]],[["00","01","10","11"],["01","00","10","11"],["10","...
01:51:27  > (\l -> map (\i -> replicateM i l) [1..]) "01"
01:51:28    [["0","1"],["00","01","10","11"],["000","001","010","011","100","101","110"...
01:51:44  > (\l -> map (\i -> replicateM i l) [1..]) "abc"
01:51:45    [["a","b","c"],["aa","ab","ac","ba","bb","bc","ca","cb","cc"],["aaa","aab",...
01:51:51  > (\l -> bind (\i -> replicateM i l) [1..]) "abc"
01:51:52    Not in scope: `bind'
01:52:04  This is the kind of logic some people used in the past:  There are seven windows in the head, two nostrils, two ears, two eyes, and a mouth; so in the heavens there are two favorable stars, two unpropitious, two luminaries, and Mercury alone undecided and indifferent. From which and many other similar phenomena of nature such as the seven metals, etc.,
01:52:08  @hoogle (a -> m b) -> m a -> mb
01:52:08  Prelude (=<<) :: Monad m => (a -> m b) -> m a -> m b
01:52:08  Control.Monad (=<<) :: Monad m => (a -> m b) -> m a -> m b
01:52:08  Prelude (>>=) :: Monad m => m a -> (a -> m b) -> m b
01:52:18  > (\l -> (\i -> replicateM i l =<<) [1..]) "abc"
01:52:19    : parse error on input `)'
01:52:21  which it were tedious to enumerate, we gather that the number of planets is necessarily seven. [...] Moreover, the satellites are invisible to the naked eye and therefore can have no influence on the earth and therefore would be useless and therefore do not exist.
01:52:23  > (\l -> (\i -> replicateM i l) =<< [1..]) "abc"
01:52:24    ["a","b","c","aa","ab","ac","ba","bb","bc","ca","cb","cc","aaa","aab","aac"...
01:52:36  @pl (\l -> (\i -> replicateM i l) =<< [1..])
01:52:36  ([1..] >>=) . flip replicateM
01:52:58  `log replicateM
01:53:03  2011-09-19.txt:03:09:44:  :t replicateM
01:53:06  `log replicateM
01:53:13  2011-08-26.txt:07:10:34:  > join . join $ (`replicateM` words "son I am proud") =<< [3..]
01:53:27  :t join
01:53:28  forall (m :: * -> *) a. (Monad m) => m (m a) -> m a
01:53:38  @hoogle (a -> m b) -> m a -> mb
01:53:38  Prelude (=<<) :: Monad m => (a -> m b) -> m a -> m b
01:53:38  Control.Monad (=<<) :: Monad m => (a -> m b) -> m a -> m b
01:53:39  Prelude (>>=) :: Monad m => m a -> (a -> m b) -> m b
01:53:40  Erm
01:53:41  `log replicateM
01:53:46  2011-07-20.txt:05:11:36:  ?ty replicateM
01:53:50  `log replicateM
01:53:55  2011-09-16.txt:07:58:51:  > drop 6 $ replicateM 3 "012"
01:54:07  > [1..] >>= replicateM
01:54:08    Couldn't match expected type `[b]'
01:54:09          against inferred type `m a -> m ...
01:54:14  > [1..] >>= flip replicateM "abc"
01:54:16    ["a","b","c","aa","ab","ac","ba","bb","bc","ca","cb","cc","aaa","aab","aac"...
01:54:18  Madoka-Kaname: hth
01:54:23  the problem in the `log query was the spaces
01:54:32  also the use of "abc" as the alphabet, probably
01:54:40  ^_^
02:17:45 -!- Madoka-Kaname has changed nick to Cirno-chan.
02:17:55 -!- Cirno-chan has changed nick to Madoka-Kaname.
02:25:14 -!- tiffany has quit (Quit: Bye).
02:32:29 -!- pikhq has joined.
02:32:37 -!- SilverShot has joined.
02:32:38 -!- pikhq_ has quit (Ping timeout: 252 seconds).
02:34:53 -!- SilverShot has left.
02:35:12  > filter (==2) (join . flatten [1..2])
02:35:13    Couldn't match expected type `Data.Tree.Tree (m (m a))'
02:35:13          against inf...
02:35:20  > filter (==2) (join . cycle [1..3])
02:35:21    No instances for (GHC.Num.Num (m a),
02:35:21                     GHC.Num.Num (m (m a...
02:35:35  > filter (==2) (join $ cycle [1, 2])
02:35:36    No instance for (GHC.Num.Num [a])
02:35:36     arising from a use of `e_1212' at  > filter (==2) $ join $ cycle [1, 2]
02:36:06    No instance for (GHC.Num.Num [a])
02:36:06     arising from a use of `e_1212' at  > filter (==2) $ join $ join $ cycle [1, 2]
02:36:16    No instance for (GHC.Num.Num [[a]])
02:36:16     arising from a use of `e_1212' at  :t join
02:36:22  forall (m :: * -> *) a. (Monad m) => m (m a) -> m a
02:36:30  :t cycle [1, 2]
02:36:31  forall t. (Num t) => [t]
02:36:35  > join $ cycle [1, 2]
02:36:36    No instance for (GHC.Num.Num [a])
02:36:36     arising from a use of `e_112' at  > cycle [1, 2]
02:36:41    [1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,...
02:36:45  oh woops
02:36:49  > filter (==2) $ cycle [1, 2]
02:36:50    [2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,...
02:49:28  @hoogle m [x] -> [m x]
02:49:28  Data.List transpose :: [[a]] -> [[a]]
02:49:28  Data.Traversable sequenceA :: (Traversable t, Applicative f) => t (f a) -> f (t a)
02:49:28  Data.List inits :: [a] -> [[a]]
02:52:34  :t mapM
02:52:35  forall a (m :: * -> *) b. (Monad m) => (a -> m b) -> [a] -> m [b]
02:52:56  @hoogle [IO a] -> IO [a]
02:52:56  Prelude sequence :: Monad m => [m a] -> m [a]
02:52:56  Control.Monad sequence :: Monad m => [m a] -> m [a]
02:52:56  Data.Traversable sequenceA :: (Traversable t, Applicative f) => t (f a) -> f (t a)
02:55:43  lambdabot responds to private messages, too
02:55:52  copumpkin: Madoka-Kaname knows and doesn't care
02:55:58  o.O
03:00:06  :t mapM
03:00:07  forall a (m :: * -> *) b. (Monad m) => (a -> m b) -> [a] -> m [b]
03:01:01  > [0..5]
03:01:02    [0,1,2,3,4,5]
03:01:31  ...
03:03:55  urusai!
03:04:13  うるさい
03:06:53  I don't difficulty reasoning about space and time efficiency of Haskell programs is really an argument against its use for high performance programs.
03:06:57  *don't think
03:08:05  CakeProphet: Really? I'd think that would be the main argument.
03:08:47  any compiled implementation of a language that optimizes is going to do possibly non-obvious things once compiled, regardless of evaluation order. But wait! there's more!
03:09:13  :t foldl
03:09:13  forall a b. (a -> b -> a) -> a -> [b] -> a
03:09:27  hmm, if it really matters you might be using measurements rather than reasoning anyway
03:09:56  someone who actually understands Haskells evaluation semantics can reason (and measure as you said) about space/time usage. The same applies to C++.
03:10:14  a C++ nub isn't going to know shit about how to optimize C++.
03:11:11  being ignorant of something is not an argument against it.
03:11:15  "given a sufficiently smart programmer"?
03:11:22  @hoogle (Map a), (Set a) => a
03:11:22  Parse error:
03:11:22  ^^^
03:11:22    (Map a), (Set a) => a
03:11:22           ^
03:11:24  @hoogle (Map a) (Set a) => a
03:11:25  Parse error:
03:11:25    (Map a) (Set a) => a
03:11:25                    ^
03:11:44  ತ_ತ
03:11:47  Madoka-Kaname doesn't actually no Haskell.
03:11:48  @hoogle (Map a, Set a) => a
03:11:48  Warning: Unknown class Map
03:11:48  Prelude undefined :: a
03:11:48  Data.Function fix :: (a -> a) -> a
03:11:54  Madoka-Kaname: can you quit spamming?
03:11:56 * CakeProphet doesn't no English.
03:11:57  Sure
03:12:02  thanks!
03:12:07  Haskell is a good deal more abstracted from how computers tend to work than C++.
03:13:10  I see.
03:13:34  CakeProphet: this was ... news to you?
03:14:16  (no)
03:14:28  I'm just kind of bewildered as to what it's implying.
03:14:43  programmers can't reason through abstraction or something?
03:14:46 * CakeProphet shrugs.
03:15:54  Things like garbage collection make performance more difficult to reason about, for instance.
03:16:00  I don't think anyone said "impossible".
03:16:02  C++ is pretty damn abstracted from how computers tend to work, though.
03:16:30  pikhq: True.
03:35:25  shachaf: I'm not sure the machine mismatch matters.
03:35:50  shachaf: As long as your mental conception of Haskell is low-level enough to account for thunks and sharing, then pretty much all the reductions to standard hardware don't change anything except constant factors.
03:36:47  Constant factors matter when you want to write high-performance programs.
03:38:37  Define "high-performance". :)
03:45:05  I have no idea what context this conversation came up in.
03:45:31  I'll define it as "where you care about performance enough to worry about constant factors". :-)
03:45:41 * shachaf unsafeCoerce
03:45:54  shachaf: OK, to clarify: Small constant factors :P
03:46:56  shachaf: You don't really have to care that much about how GHC goes from the level involving thunks and sharing to the machine code, since it's not going to end up /slower/ than you perceive on that level
03:48:41  shachaf: In such a context anything shy of assembly is going to involve at least a little bit anguish.
03:49:06  s/ shy of assembly//
03:55:46 -!- madbr has joined.
04:02:25  I found a anime crossword in mathNEWS that although the clues are in English, you must write the answers using katakana.
04:09:24  can't decide if that's lame or awesome
04:10:20  madbr: it is mathnews, therefore awesome
04:12:23  Probably lame.
04:13:31  wonder how japanese coders name variables in c++
04:14:04  Hopefully in English.
04:14:21  Probably not, though. :-(
04:17:17  I'm inclined to go with "that's a crapshoot".
04:17:53  And would like to add that "¥n" still drives me bonkers.
04:18:36  heheh
04:18:48  japanese backslash
04:18:50  pikhq: why
04:19:03  coppro: That's "\n".
04:19:10  lol
04:19:16  thanks windows
04:19:26  Actually, that's not even slightly Microsoft's fault.
04:19:31  oh?
04:19:44  That's the fault of JIS X 0201.
04:20:21  The 8-bit ASCII superset encoding that was used for a while on early Japanese computers.
04:20:27  kinda sucks yeah
04:20:35  It encoded ¥ where \ is on normal ASCII.
04:20:41  they should have taken one of the 0-31 range characters
04:20:45  nobody uses those
04:20:56  except tab and newline ofc
04:21:13  madbr: The 0-31 range characters are control characters. I sometimes use them for purpose of control characters.
04:23:46  ah
04:24:13  figured most people decided in band signaling was stupid and moved to other means
04:24:33  Of course, JIS X 0201 sucks in every way imaginable for use in Japanese.
04:30:17  In case you need to include control characters in the data, that is a reason they have a Data Link Escape control character in ASCII.
04:36:10  madbr: dos used all of the control chars as symbols
04:36:51  well, yeah, cause the char rom had the space
04:37:10  and text mode has no escape chars ofc
04:37:38  Well, yes; it is CP437, which used all 256 slots (although 0, 32, and 255 are all blank). Sometimes still used today.
04:38:16  However the control characters had meanings as control characters too; but if poked directly into video memory they could be displayed.
04:41:38  The BIOS has the same function today.
04:42:21  vga text mode hasn't changed much no
04:44:44  So if you run FreeDOS, it will work. Linux uses something more complicated so it can display more characters at once and so on.
04:45:31  Actually, Linux using a VGA text mode pretty much just does ASCII.
04:45:31  well, if it's over 512 chars it has to be an emulation yes
04:45:49  I think you only can pull more characters using a framebuffer.
04:46:04  Yes, but the screen grid size is more than 80x25 as well
04:46:22  Yeah, there's more VGA text modes than that.
04:46:48  At least on the computer at FreeGeek, the ability for the Linux terminal to play sound appears broken, as far as I can tell.
04:46:54  doesn't change the hard limit of 256 (or 512 if you use different chars for colors 8-15) :D
04:47:52  unless you used a set of 8x1 pixel characters kinda like a msx text mode game
04:48:12  madbr: Yes, I know of that. It is limit 256, but there is a way to use different chars for high intensity. Actually, I discovered that by accident when I was running font programs in strange ways on a DOS computer; only later on have I found proper documentation about how this works.
04:50:10  zzo: yeah you can see it used in impulse tracker
04:51:20  Actually I discovered it by running multiple programs incorrectly that don't go together. I haven't used Impulse Tracker.
04:54:08  I am trying to think of how to implement TeX's ligaturing algorithm in Haskell; maybe I should do it on paper since that does seem to help sometimes.
04:55:24  Currently I have:   typesetSimpleString :: Font -> String -> PageObject; typesetSimpleString f s = Text f $ typesetSimpleChar f s (leftBoundChar f); typesetSimpleChar :: Font -> String -> [LigKern] -> TextString;
05:01:58 -!- zzo38 has quit (Remote host closed the connection).
05:05:33 -!- MDude has changed nick to MSleep.
05:13:21   In North America although not generally in the United Kingdom, the term seafood applies also to any fresh water life eaten by humans, so all edible aquatic life can be referred to as seafood.
05:13:28  huh, interesting.
05:16:18  Pretty much, though usually it's limited to fish & shellfish.
05:17:10  well right, I'm familiar with the US usage. I just ate fresh water catfish and I would call it seafood.
05:17:22 * CakeProphet hadn't ever considered that it wasn't. :P
05:17:24  Right.
05:18:04  but apparently eating seafood is really fucking good for you.
05:19:41  Vietnamese catfish cannot be legally marketed as catfish in the US, and is subsequently referred to as swai or basa [24] Only fish of the family Ictaluridae may be marketed as catfish in the United States.
05:19:45  more weird food laws.
05:34:17 -!- Darth_Cliche has joined.
05:36:34  @hoogle Fractional -> Intergral
05:36:35  Warning: Unknown type Fractional
05:36:35  Unsafe.Coerce unsafeCoerce :: a -> b
05:36:35  Prelude ($) :: (a -> b) -> a -> b
05:36:44  Oh, it's Rational
05:36:44  derp
05:43:38  @hoogle a -> Double
05:43:39  Prelude id :: a -> a
05:43:39  Data.Function id :: a -> a
05:43:39  GHC.Exts breakpoint :: a -> a
05:44:41  Madoka-Kaname: what are you trying to do.
05:44:48  also, try the actual hoogle site.
05:53:30 -!- Darth_Cliche has quit (Quit: You are now graced with my absence.).
06:16:28 -!- hagb4rd has joined.
06:16:48 -!- Zuu has quit (Read error: Connection reset by peer).
06:18:57  hmmm, I wonder why desserts traditionally come at the end of meals?
06:22:00 -!- Zuu has joined.
06:52:29 -!- oerjan has joined.
06:53:31  hi oerjan
06:54:01  good morning elliott
06:55:54   Vietnamese catfish cannot be legally marketed as catfish in the US, and is subsequently referred to as swai or basa [24] Only fish of the family Ictaluridae may be marketed as catfish in the United States.
06:56:08  when my dad says "kattfisk", he means fish to feed the cat.
06:57:45  00:58:29:  Does the ddate program allow you to switch which kind of Discordian calendar you want?
06:58:02  oerjan: does he say that a lot?
06:58:03  shouldn't it, sort of, switch in an unpredictable way...
06:58:20  elliott: well probably not :P
06:59:51  anyway the other point is we don't use that to name any species in norwegian.
07:00:05  that i'm aware of.
07:02:18  sea kittens
07:03:07  land fish
07:03:30  GET YOUR DELICIOUS LAND FISH HERE
07:03:42  oerjan: i take it you missed the reference :
07:03:45  ONLY RECENTLY DEWHISKERED
07:03:51  no, i don't think i missed it
07:03:59  i just reversed it
07:04:19  ok :P
07:04:41  > DLL
07:04:42    Not in scope: data constructor `DLL'
07:06:47  apparently i'm not very inventive there
07:06:54  'My wife and I have decided to start calling our cats "Land Fish".'
07:08:30  oh apparently stephen colbert used the phrase
07:09:32  http://en.wikipedia.org/wiki/Walking_fish
07:09:37  first hit for "land fish"
07:10:16  well i added sea kitten to the search
07:12:18  http://features.peta.org/PETASeaKittens/game.asp
07:16:33  oh god I actually just played a seakitten dress up game.
07:18:36  soon you will be possessed by an irrestible urge to eat nothing but strawberries and seaweed.
07:29:47  Let's face it: if cats looked, tasted, and mostly acted like fish except on land, I'd eat cat. With glee.
07:30:06  "Sea kittens" is solid fail.
07:30:59 -!- Ngevd has joined.
07:31:56  pikhq: how do you know they don't taste like fish?
07:32:01  what if they taste better?
07:32:03  hmmmm???
07:33:13  *yawn*
07:33:14  Hello
07:33:44  CakeProphet: You'll note taste wasn't the only criterion there.
07:36:00  pikhq: what if cats looked, tastes, and acted like cats and were delicious?
07:36:04  weoijroiwejrowiejet huh what now huh?
07:38:18  Nyaaaa
07:45:01  http://en.wikipedia.org/wiki/Cat
07:45:10  I think this entire article is written by a cat-lover
07:45:23  because it basically talks about all of their awesome skillz.
07:47:30  Put on of those not neutral thingies in
07:51:26  > (10**10)**(2**32)
07:51:27    Infinity
07:51:34  > (10^10)^(2^32)
07:51:49    *E
07:52:07  > (1 `div` 0, 1/0)
07:52:11    mueval-core: Time limit exceeded
07:52:17  1 `div` 0
07:52:25  > 1 `div` 0
07:52:26    *Exception: divide by zero
07:52:31  > 1 / 0
07:52:32    Infinity
07:56:41 * oerjan finds some vandalism at the end of the Cat article
07:59:13  > 1 `mod` 0
07:59:16    *Exception: divide by zero
08:01:46  Second 01:00 is the best time of day.
08:06:39  pikhq: there's only one 01:00 in a day :)
08:07:01  today is special
08:07:02  Not today.
08:07:22  Today, 01:59 was followed by 01:00.
08:08:37  oh. we did that ages ago.
08:08:55  pikhq: also: fuck dst
08:09:03  The US decided to do more summer time than standard a couple years back.
08:09:05  Agreed.
08:09:14  dst is the worst :(
08:09:22  does ANYONE like dsty
08:09:23  ds
08:09:24  dst
08:09:28  I enjoy second 01:00. I despise 01:59 being followed by 03:00.
08:09:34  even my fingers don't like dst
08:09:38  bad people enjoy dst
08:09:38  It averages out to a mild hatred for DST.
08:10:03  dst days are offset in a bad way
08:10:21  pikhq: maybe we can do second 01:00 every day, and makes the minutes in an hour e.g. in the middle of the workday go twice as fast
08:10:30  Clearly we should eliminate the "spring back" bit.
08:10:45  fall forward?
08:10:45  elliott: I approve of your 25 hour day plan.
08:10:53  Erm.
08:10:56  Spring forward.
08:11:01  pikhq: "and makes the minutes in an hour e.g. in the middle of the workday go twice as fast"
08:11:02  Fuck DST.
08:11:09  elliott: I want 25 hour days.
08:11:30  Let's make everyone *else* have trouble maintaining normal sleep. :P
08:12:21  argh does someone know how to view bot edits in wikipedia's page histories?
08:13:00  not I
08:13:00  why?
08:13:09  ...i found some vandalism, but there is no sign of it in the diffs
08:13:14  I know anti-vandalism etc. bots don't make edits marked as bot
08:13:24  oerjan: there is
08:13:29  try cache
08:13:34  or looking harder :)
08:13:51  `pastequotes
08:13:57  http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/paste/paste.32522
08:14:29  hm maybe it's actually in an included template.
08:15:20  oerjan: yep, that sounds likely
08:15:40  if wikipedia wasn't so dog slow...
08:15:52  ...i guess it would be, on the cat page.
08:16:03  arf arf arf
08:17:57 -!- Ngevd has quit (Ping timeout: 240 seconds).
08:18:36 -!- monqy has quit (Quit: hello).
08:19:23  `quote
08:19:23  `quote
08:19:24  `quote
08:19:24  `quote
08:19:24  `quote
08:19:31  649)  elliott: so what are the two issues with xfce?   they're very unlikely to fuck up Xfce, and it can be made to work basically exactly like gnome two
08:19:33  398)  oerjan: but hypothetically, assume a Christian spontaneously materialised during the apocalypse
08:19:46  627)  Dear god stop staring at me.   no never   monqy is always staring at everyone.   it takes many eyes to do this but I manage   He is an inspiration to us all.
08:19:47  465)  elliott: You have become the very thing you fought for!
08:19:47  261)  Deewiant: Did you take the course at some point and/or were you taking it now and/or did you actually already graduate and/or are you still in Otaniemi anyway?
08:20:26  649 is the worst but I don't have the heart to remove any
08:21:30  `log so you are doing for compilers what imperative programming did for functional programming
08:21:56  2011-10-02.txt:10:46:13:  `addquote  so you are doing for compilers what imperative programming did for functional programming
08:22:05  `logurl 2011-10-02.txt:10:46:13:
08:22:08  http://codu.org/logs/log/_esoteric/2011-10-02
08:24:04  10:43:37:  elliott: i like this dialogue. because im never going to drop an idea so easily. whatever holes you can find in the idea i can apply more patches
08:24:04  this was basically the height of itidity
08:28:00 -!- spl1nt has joined.
08:29:00  argh!
08:29:14  elliott: do you see vandalism at http://en.wikipedia.org/wiki/Cat#External_links ?
08:29:29  oerjan: yes
08:29:43  let's see...
08:30:03  oerjan: trying to purge it
08:30:19  it is not in the page when i try to edit it :P
08:30:22  oerjan: see, all gone
08:30:24  it was just cached
08:30:30  I purged the page and now it's fixed
08:30:36 -!- Ngevd has joined.
08:30:42  but i've reloaded several times D:
08:30:49  oerjan: purging is a MW thing.
08:30:51  I think they should make a movie about fungot
08:30:52  Ngevd: there was no sleep for either of them that night, but sat up thinking of the door, and the bed of death with the black pall but is finally restored to security and happiness with her lover fnord, after the death of his only son conrad on the latter's fnord fnord,
08:30:55  oerjan: try refreshing now
08:31:04  just append ?action=purge to a page url and click the button
08:31:07  it re-renders the page on the server side
08:31:15  aha
08:31:23  well it worked by simply reloading now
08:31:32  i assume your purge fixed it for everyone
08:31:34  Also, why won't my brother's XBox read discs? I just want to play AC:B
08:31:37  "My main hobby outside Wikipedia is the VMS Mosaic web browser (hence my username)."
08:31:43  That's a really shitty hobby, User:VMS_Mosaic.
08:31:46  oerjan: yep
08:33:15  VMS Mosaic?
08:33:30  I hope that's not Mosaic ported to VMS.
08:33:38  Hmm. It's Mosaic ported to VMS.
08:33:43 * oerjan swats shachaf -----###
08:34:00  I'm not too sure what VMS is...
08:34:29  an old OS
08:34:30  My father once ported vi to VMS. It was apparently quite popular.
08:34:33  Okay
08:34:40 -!- spl1nt has quit (Killed (idoru (Spam is off topic on freenode.))).
08:35:10  my first university account was on a VAX/VMS system
08:35:14  shachaf: this was your father's operating system
08:35:39  A more civilized software from a more civilized time
08:36:15  VMS was many things, but I don't know if civilized is among them.
08:36:30  What does it stand for?
08:37:13  Virtual Memory System, apparently.
08:37:36  > map succ "VMS"
08:37:37    "WNT"
08:37:38  zomg
08:37:55  Windows NT?
08:38:00  `addquote  VMS Mosaic?   I hope that's not Mosaic ported to VMS.   Hmm. It's Mosaic ported to VMS.
08:38:02  708)  VMS Mosaic?   I hope that's not Mosaic ported to VMS.   Hmm. It's Mosaic ported to VMS.
08:38:04  * spl1nt has quit (Killed (idoru (Spam is off topic on freenode.)))
08:38:05  omg :')
08:38:07  he was our friend.
08:38:49  What's a spl1nt?
08:39:01  the best spl1nt
08:39:10  It's for mending broken b0nes
08:40:36  i liked the VMS hierarchical help system
08:40:52  I wish I had memories of VMS.
08:41:01  So I could know that it would be foolish to wish for memories of VMS.
08:41:09  I have memories of some operating system
08:41:14  It was text-based
08:41:18  It was in a garage
08:41:20  dos
08:41:31  CP/M
08:41:36  actually if you've used dos without realising then it's dos then i'm really weirded out
08:41:38  In Mount Waverley, VIC
08:41:48  I was 3-4
08:41:49  ah yes. from when you lived in scotland
08:41:53 -!- derrik has joined.
08:42:18  FINALLY ASSASSIN'S CREED HAS LOADED
08:42:25  if you did help pascal, you got help on the pascal program but also a submenu for individual functions
08:42:43  VMS apparently had this fancy QIO thing.
08:42:43  and the hierarchy was quite deep
08:42:56  *pascal compiler
08:51:10  If I was Korean, I'd be fearing for my life
08:51:16  648)  sadhu: it's been said that boole is the crowning jewel perched precariously upon the perfect peak of programmer prowess, casting its limitless limpid light over the loathesome lands of those who scuff and wallow in the dreary dust of digital depravity and unbounded wilful ignorance of the testament of our lord jesus christ into your life.
08:51:17  elliott: when the driver came out of those years to engulf him utterly.
08:51:17  :D
08:51:19  god i remember that
08:51:50  oerjan: isn't that essentially what info does
08:52:04  I have a fan and a closed door
08:52:41  elliott: i guess.  on the command line, this was more like a nested version of irssi help, though
08:53:05  oerjan: oh, so you went deeper by taking the last command and appending?
08:53:10  sounds like http >:)
08:53:15  there was a graphical version, but i only rarely saw an actual DEC workstation
08:53:15  Ngevd: beware fan death
08:53:54  The full documentation for blahB is maintained as a Texinfo manual.   If the info and blah programs are properly installed at your site, the command info blah should give you access to the complete manual.
08:54:00  Whoa, man, an irssi bug.
08:54:17  elliott: except you didn't have to prepend the current term if you were already on it, this was interactive.
08:54:28  oerjan: ok so it's not command-line :P
08:54:50  elliott: i guess i meant terminal, as opposed to graphical
08:54:54  Type: something something CtrlBblahCtrlB something something, where CtrlB is the "bold" indicator. Then move cursor on top of the "b" in "blah", and press M-d.
08:54:55  yeah
08:55:24  i mainly logged in via genuine physical VT100/VT3something terminals
08:55:27  oerjan: did it actually have a line-based interface, though, or was it layout-based (i.e. like typical guis, moving a cursor around and activating things)
08:55:39  elliott: line-based
08:56:10  it was still the best help system i'd seen at the time :P
08:56:13  oerjan: it sounds like info has the kind of structure you want, it's just that the clients suck :)
08:56:29  I guess no one here appreciates a good irssi bug.
08:56:29  also, nobody but GNU people want to, or do, write info pages...
08:56:43  s/good/bad/
08:56:44  shachaf: I figure they're probably too numerous to appreciate.
08:56:45  Like lives.
08:56:57  Until there are, like, less than a billion people alive, I'm a sociopath.
08:57:25  592)  monqy: help how do I use lambdabot to send messages to people.  [...around half an hour later...]   @messages   quicksilver said 1y 2m 18d 19h 54m 29s ago: you use @tell
08:57:29  still the most beautiful thing to ever happen
08:58:23 -!- nooga has joined.
08:59:01  567)  mmm these music samples are still so tasteful
08:59:01  568)  im sampling ultra hip holiday   hes the boogie woogie santa clause   switching to oktoberfest   yes i would love to shop to this
08:59:04  the qdb makes great light reading
09:11:39 -!- Vorpal has joined.
09:12:18  Alexander Kramir, from the novel Lentara is a fairly accurately portrayed boy with Albinism who helps an alien race save the Earth and falls in love with an alien. He later fathers a child who will help save the universe
09:12:22  elliott: this is probably better light reading.
09:17:44 -!- sebbu2 has joined.
09:17:44 -!- sebbu2 has quit (Changing host).
09:17:44 -!- sebbu2 has joined.
09:18:45 -!- sebbu has quit (Ping timeout: 240 seconds).
09:23:31 -!- madbr has quit (Quit: Radiateur).
09:56:03 -!- Phantom_Hoover has joined.
09:58:17  Honey bees transform nectar into honey by a process of regurgitation, and store it as a primary food source in wax honeycombs inside the beehive. Beekeeping practices encourage overproduction of honey so the excess can be taken from the colony.
09:58:24  mmmm regurgitated nectar.
09:58:47  bbl, bleaching brain
09:59:39  youd idn't know that?
10:00:04  i probably have known at previous pre-bleaching occasions
10:01:08  545)  well, you have bested me   itidus20: Yes.
10:01:09  :')
10:06:14  484)  interestingly enough, go is a second player win   chess is also first player win   tennis, interestingly enough, is always a draw.
10:06:21  oerjan: have you ever read this qdb i mean damn
10:07:57  haha
10:15:21  356)  http://www.sessionmagazine.com/img/nature/worlds-10-smallest-animals/worlds-10-smallest-animals07.jpg   worlds biggest thumb
10:15:36  oerjan: it's getting to that stage in the fax cycle where i start to miss em
10:26:20  241)  LoTR actually compresses pretty well into a film; the large amount of description becomes unnecessary.  LotR would compress pretty well into a book; the large amount of description *is* unnecessary.
10:26:29  hmm, wonder whether phatom and pikh actually said that
10:27:34 -!- GreaseMonkey has quit (Quit: The Other Game).
10:28:24 -!- Ngevd has quit (Ping timeout: 256 seconds).
10:30:54  We did.
10:31:16  `log 
10:31:21  2011-05-14.txt:23:04:21:  ​261)  LoTR actually compresses pretty well into a film; the large amount of description becomes unnecessary.  LotR would compress pretty well into a book; the large amount of description *is* unnecessary. \ 272)  oerjan: also actually A(4, 4) is larger than
10:31:26  sceptical
10:31:39  I remember saying it!
10:31:46  Unless you're talking about the nicks.
10:31:51  of course i am
10:36:04  `quote 272
10:36:06  272)  !bfjoust test (-)*10000   Score for Vorpal_test: 12.9   yay
10:36:15  wat
10:36:20  `quote 271
10:36:22  271)  Deewiant: ha, you were wrong, I have stacks, fungespace and MULTIPLE functions!  and a monad!  nothing can stop me now!
10:36:37  hum
10:36:48  `quote 261
10:36:50  261)  Deewiant: Did you take the course at some point and/or were you taking it now and/or did you actually already graduate and/or are you still in Otaniemi anyway?
10:36:59  oh duh
10:37:16  `quote 252
10:37:19  252)  ah yes, indeed, alan turing was gay and stupid
10:37:30  close enough
10:37:51  hi
10:39:40 -!- oerjan has quit (Quit: Bye!).
10:48:08 -!- Phantom_Hoover has quit (Ping timeout: 255 seconds).
10:53:49 -!- Patashu has quit (Quit: MSN: Patashu@hotmail.com , Gmail: Patashu0@gmail.com , AIM: Patashu0 , YIM: patashu2 , Skype: patashu0 .).
11:08:51 -!- Phantom_Hoover has joined.
11:30:33 -!- Jafet has joined.
11:48:12  elliott, there?
11:48:23  No.
11:48:25  elliott, there may be ways to get better support for multilib on arch
11:48:32  I just found a package named gcc-multilib
11:48:35  I have not yet tried it
11:48:49  Uhh, gcc-multilib is part of the multilib repos.
11:48:53  It's used in conjunction with them.
11:48:54  yep
11:49:00  and it provides gcc
11:49:05  according to pacman -Si
11:49:07  It isn't "better support", it's "being able to link with multilib things at all". What's your point?
11:49:13  hm okay
11:49:18  It's still the same shitty support at the core.
11:49:23  right
11:49:25  But yes, you're meant to replace gcc with gcc-multilib.
11:56:43 -!- sebbu2 has quit (Read error: Connection reset by peer).
11:59:04 -!- sebbu2 has joined.
11:59:04 -!- sebbu2 has quit (Changing host).
11:59:04 -!- sebbu2 has joined.
12:00:04  elliott, is there a name for "initialism except they selected X instead of E for words starting with Ex-"?
12:00:13  "stupid"
12:00:19  elliott, also "common"
12:00:30  just call it an acronym, nobody cares
12:00:33  hm
12:00:51  probably most people don't know what "initialism" even is
12:00:59  (two examples that spring to my mind: XML and AVX)
12:05:10  XMS, note there was EMS before.
12:05:40  It just uncontrollably became more X-Treme.
12:05:49  oh the DOS thingy?
12:05:53  It starts getting ridiculous when these terms are translated.
12:05:57  Vorpal: yes
12:06:13   It starts getting ridiculous when these terms are translated. <-- oh?
12:06:14 * twice11 remembering of "Erweiterungsspeicher" and "Expansionsspeicher"...
12:06:36  assume I don't understand German
12:07:16  So it's just that you take the spelled out version of these acronyms in english (most people already don't know of), and translate them to German.
12:07:26  right
12:07:31 -!- elliott has quit (Quit: Leaving).
12:07:39 -!- elliott has joined.
12:07:44  twice11, makes sense so far
12:08:05  End result: You get something nobody undestands and also can't correlate to the maybe known terms XMS/EMS as the acronyms do not really fit to the german terms.
12:08:12  ah
12:08:42  Note that EMS means Expanded Memory Specification, XMS means Extended Memory Specification.
12:08:48  Both words starting with "Ex"...
12:08:52  right
12:09:17  After the german translation, only one word starts with Ex - which is expanded that has been left as technical term.
12:09:30  heh
12:09:36  While eXtended has been replaced with the german term "Erweiterung".
12:09:55  XHTML too, but that's just following in XML's footsteps.
12:10:11  I remember hearing "utökat minne" in Swedish. I don't remember which one of those that refers to, literally that means "extended memory" though.
12:10:13  Oh, and XP when it's standing for "eXperience Points".
12:10:16  I grew up with a Mac
12:10:18  not a PC
12:10:23  IIRC these translations are made by Digital Research - but do you think Microsoft learned anything of that?
12:10:30  of->from...
12:10:55  fizzie, yeah, should be EP in all games
12:11:07  fizzie, wait, did windows xp stand for Windows Experience Points?
12:11:23  and doesn't xbox have some "microsoft points" or something
12:11:30  hm... maybe they confused the names somehow?
12:11:31  eXPerience, I'd think.
12:11:38  They introduced the HMA (a 286 concept of magically adding a near 64k memory addressable in DOS). Which was translated as "Oberer Speicher" in German.
12:12:07  fizzie: That's what the marketing people say. Some people claim in fact it means eXtra Problems.
12:12:59  The HMA translation was not that bad until another concept of extending conventional memory, called "upper memory blocks" (UMB).
12:13:09  Which was then translated as "hoher Speicher".
12:13:30  well, xp was probably one of the better windows versions so far. Especially the 64-bit one.
12:13:49  Note the ethymologic connection between "hoher Speicher" and "high memory" on the one hand, and "upper memory" and "oberer Speicher" on the other hand.
12:13:53  Windows Me + Windows XP = the almighty Windows Mexp.
12:14:01  It's like Windows Sexp, but with a sugary syntax.
12:14:14  Finnish terminology for EMS and XMS is "laajennettu muisti" and "jatkettu muisti", those are probably the closest-in-meaning words for "expanded" and "extended".
12:14:15  Vorpal: I guess you are talking about XP after SP1 or so.
12:14:28  twice11, yeah, but compared to 9x it was way way better.
12:14:45  even the original I mean
12:14:48  Windows 9x is a game loader, not an operating system ;)
12:14:51  right
12:15:00  twice11: Then what's DOS?
12:15:06  older game loader
12:15:10  Game loader with bad graphics?-)
12:15:22  A game loader missing a common 32 bit driver infrastructure.
12:15:24  game loader not even pretending to have multitasking
12:15:41  Good god you guys, be patient, twice11 MIGHT have generated perfect quote material with a one-word response like "Crap"!
12:15:43  But then you ruined it!
12:15:47  You ruined everything!
12:15:53  twice11, I suspect that windows server might be the best windows version, since so far xp 64-bit has been the best I used, and that was based on windows server 2003 iirc.
12:16:35  Windows 7 also works not that bad, as far as I have experience with Windows.
12:16:58  twice11, windows 7 is quite bloated compared to XP. Try installing both on a SATA 1 disk. Check boot times.
12:17:04  that is 64-bit of both
12:17:15  Oh no! Boot times!
12:17:21  The thing Vorpal told me he doesn't care about just a few weeks ago.
12:17:24  and also general sluggishness of the interface
12:17:26  Or less, actually.
12:17:53 * elliott hasn't experienced any interface sluggishness with 7 at all.
12:17:54  Vorpal: Compare boot times of Windows XP and DOS on the same hardware
12:18:03  elliott, I don't really care about 10 seconds vs. half a minute on a system I rarely reboot. I do care about 2 minutes vs. 7 minutes on a system I reboot often.
12:18:10  elliott, you have to consider the context.
12:18:19  Vorpal: It sounds like the context is: your system is really shitty. :p
12:18:23  twice11, indeed.
12:18:32  elliott: If you run Windows XP and Windows 7 on the same system with 384MB RAM, Win 7 will be much more sluggish, of course.
12:18:42  twice11: Yeah, and I bet Windows 7 is really sluggish on this 286 I just materialised :P
12:18:49  Hell, it probably doesn't even RUN on my Commodore 64.
12:18:53 -!- derrik has quit (Quit: gone).
12:18:53  elliott: Windows XP won't run on it, too.
12:18:59  twice11, thing is, apart from the disk the system in question is top notch
12:19:10  OK guys, what's the best Windows version for ENIACs?
12:19:11  twice11, I simply reused an old disk for installing windows 7 on.
12:19:38  and not THAT old either.
12:19:46  People tried hard to get WinXP getting run on minimal hardware. I guess they ended up on an underclocked 486 with 8MB of RAM.
12:19:58  To install they needed a Pentium with 24MB.
12:20:02  twice11: I remember that.
12:20:04  That was awesome.
12:20:06  heh
12:20:08  link?
12:20:16  10 minute boot time or like that.
12:20:26  and I guess WinPE or such?
12:20:34  or do you mean full XP?
12:20:39  Vorpal: No, full XP.
12:20:43  impressive
12:20:49  Of course it was not usable at all...
12:20:53  of course
12:21:35  twice11, anyway linux runs fine from that same SATA 1 disk that windows 7 runs terribly from. And XP ran fine from it too back in the days.
12:21:53  German version of one of those tests: http://www.winhistory.de/more/386/xpmini.htm
12:22:27  And english version: http://www.winhistory.de/more/386/xpmini.htm.en
12:23:49  the former displayed as English for me too
12:23:59  I guess it looks at the http headers for preferred language
12:24:05 * twice11 guesses that, too.
12:25:35  I guess it uses pixie magic.
12:25:41  Teach the controversy.
12:29:21  Hmm, seems I was wrong - at least these people did not swap the CPU to a 486 after installation.
12:29:30  And it was 18MB RAM minimum, not 8MB.
12:29:38  Sorry for exaggregating.
12:30:53  I can't help but feel they gave up right when things could have become really interesting.
12:31:01  e.g. patching the XP installer to stop it complaining about hardware :)
12:31:55  hah
12:32:15  elliott, they wanted to do this on a vanilla xp obviously
12:32:44  elliott: I guess the installer has some reason to check for CMPXCHG8B
12:32:56  And that instruction is introduced with the Pentium.
12:33:07  CPUID is available on late 486, too.
12:33:15  twice11: Microsoft probably had some reason to tell people not to use XP on machines with <64 megs of ram, too :-)
12:33:42  Granted, but I am quite confident, the XP kernel or ntdll indeed uses CMPXCHG8B.
12:34:00  OTOH, if you do this kind of stuff, just add an invalid opcode handler...
12:34:07  Probably. But maybe not always? :-)
12:34:11  Maybe you can turn that stuff off.
12:34:40  CMPXCHG8B is a core instruction for some kind of lockless thread-safe linked lists.
12:34:59  Sounds like very likely used in the deep core of the kernel.
12:35:00  maybe you can emulate CMPXCHG8B. I don't know what the semantics of that are wrt bus mastering hardware though
12:35:49  twice11: You know, f00f bug involved CMPXCHG8B...
12:35:51  Maybe that's why it checks.
12:35:58  Get a real 486 board with ISA cards - bus mastering problem gone ;)
12:36:02  hah
12:36:03  twice11: But: You could just replace that with a lock.
12:36:07  What could go wrong?
12:36:36  CMPXCHG8B does a locked operation on 8 bytes at a time.
12:36:52  just using LOCK can't do an 8-byte-operation.
12:37:00  I meant a software lock.
12:37:09  twice11: You could just pause the scheduler while that code runs :)
12:37:27  well for a single CPU you could just disable interrupts and do it
12:37:33  A software lock is what they replaced by CMPXCHG8B for improved performance...
12:37:45  twice11: Yeah, 'cuz that's gonna help SO much on a 486.
12:37:57  It would be blazing if only we didn't have software locks!
12:38:26  If you have access to the source of the kernel to be able to replace CMPXCHG8B by software locks or some PUSHF/CLI/POPF magic, it won't be XP anymore.
12:38:49  I would expect the CMPXCHG8B instruction to be inlined to many places...
12:39:14  Adding an "undefined opcode" handler sounds less intrusive (and less performant)
12:39:44  BTW: The story goes on: http://www.winhistory.de/more/386/vistamini.htm Vista on an AMD K5 90MHz, 224MB of RAM.
12:39:51  Yeah, a handler is probably the best way to do it.
12:40:06  224MB? Pfft
12:40:32  Would be interesting whether you manage to boot 7 on "just" 192MB.
12:40:38  twice11, what is the minimum for win7 yeah?
12:40:59  No idea. Too bad they didn't make a report on that.
12:40:59  twice11, the last link is german only
12:41:01  Windows 7 on a cardboard box with a toothbrush
12:41:11  also some salt
12:41:35  elliott: Don't cheat. That is Windows Phone 7!
12:41:51  :D Windows Phone 7 standard deployment platform
12:41:57  heh
12:42:00  The toothbrush has to have at LEAST three bristles.
12:42:06  But no more than seven.
12:50:26  Windows 7 bristles.
12:55:01  windows XP whistles...
12:55:14  Or long Vista horns.
12:56:39  Man, I remember the days of Longhorn.
12:56:54  Where it was basically XP, but it had a horrible sidebar and every window had a garish-as-fuck light blue gradient all over it.
13:09:05  heh
13:09:19  was longhorn the codename for xp or vista, I don't remember
13:09:35  Longhorn -> Vista, Whistler -> XP
13:10:02  ah
13:10:03  Or Whistler -> Server 2003?
13:10:09  what was the code name for 7?
13:10:22  Longhorn really ready to manufacture? ;)
13:10:45  Vorpal: Blackcomb, later Vienna
13:10:48  ah
13:10:58  is there a code name for windows 8?
13:11:14  Not that I know of
13:11:55  Vorpal: 8
13:12:30  According to de.wikipedia, there were the code names "Mystic" and "Orient" for sucessors of W7 and WSrv2008R2, but now the project seems called "Windows Next"
13:13:33  elliott, hah
13:13:58  Hmm, interesting 2008R2 is available for x64 and Itanium, but not for x86.
13:14:11  Is there really that much buisiness interest in Itanium?
13:14:29  Or is it just some MS-Intel-treaty that they have to support it?
13:15:11  Nobody uses Itanium at all.
13:15:21  elliott: That was my impression, too.
13:15:21  I mean, people do, but they're rounding errors. Legacy rounding errors.
13:15:45  I believe it has been used in some HPC applications?
13:15:46  I think IBM still sell servers with it? It's pretty much the case that people jumped on board Itanium because it was THE FUTURE, and some people haven't managed to jump back off yet.
13:15:50  probably not much any more
13:15:54  and yeah some mainframe stuff
13:16:19  I mean, in theory it is an awesome idea... In practise? Not so much
13:17:06  Having a simple VLIW design is great, but if the realtime out-of-order-scheduling works so well that it beats compile-time VLIW, it's not really helpfull...
13:17:25  indeed
13:18:00  Now would be a great time to tell you all how much I love graph reduction architectures.
13:18:02  I believe there are some specialized processors using VLIW though
13:18:09  Instruction sets: LITERALLY OBSOLETE.
13:18:39  elliott, how good are they are number crunching?
13:18:46  Vorpal: Does Itanium count as "some specized processor"?
13:18:51  Vorpal: They have arithmetic primitives, yaknow :P
13:18:57  twice11, not in this context
13:19:21  elliott, right
13:19:35  elliott, how does pipelining and so on work with them?
13:20:05  elliott, anyway what do you mean with ISAs being obsolete?
13:20:19  don't you still need some form of encoding for the input
13:20:21  Vorpal: It's not obvious how to answer at all, since there's no concept of an "instruction".
13:20:28  And yes, but that form doesn't include any instructions.
13:20:33  It's just a set of rewrite rules.
13:20:49  Those aren't instructions, they don't /do/ anything.
13:20:51  They're declarations.
13:20:53  rewrite instructions...
13:21:00  elliott, well the description of how you encode rewrite rules and data must be defined in something similar to an ISA, whatever you call it.
13:21:07  Vorpal: No?
13:21:17  ISAs are pretty much inherently imperative; they're composed of /instructions/
13:21:20  Declarations aren't instructions
13:21:28  twice11: Except they're not executed in order, or executed at all :)
13:21:44  twice11: They're just used as rules for the CPU's reduction.
13:21:45  elliott, with something similar I mean "formal documentation of the input expected by the processor"
13:21:47  so yes
13:22:00  think speculative execution, out of order execution.
13:22:00  Vorpal: Nobody thinks that when they think ISA
13:22:17  twice11: Sure, you can do speculative evaluation on such a machine...
13:22:26  elliott, whatever, arguing this will be pointless anyway
13:22:39  Even today instructions not always executed in order or suddenly rolled back...
13:23:09  It's just instructions including a much more complicated set of conditional execution than just referring to some flag bits.
13:23:12  twice11: Well, CPU architectures look nothing like their ISAs nowadays.
13:23:26  They're much less imperative in fact... and much more weird :)
13:23:42  They just try really hard to perfectly emulate the old instruction sets for compatibility.
13:23:43  The x86 instruction set is weird enough. Really.
13:24:08  Oh, it's weird, it's just not as weird as what actually goes on...
13:24:53  In the end, you just interpret that weird x86 instruction set into something sensible.
13:25:07  Compiling instead of interpreting failed on the market (see Transmeta)
13:25:22  Yeah.
13:26:34  which bus will be the last to be dropped on common consumer x86 PCs: ISA or PCI?
13:26:48  I suspect ISA will stay around longer, for compatibility.
13:26:53  ISA is already dropped on consumer PCs.
13:26:56  twice11: Honestly, if I was a compiler dev I would be begging the CPU corps to standardise and give access to the lower-level details... OK, I wouldn't because that sounds like it would fundamentally contradict my Principle of Absolute Laziness, but I can't imagine compiler devs couldn't do a better job at sorting things out than CPUs doing things just-in-time.
13:27:01  twice11, the slots yes, not the bus
13:27:15  00:1f.0 ISA bridge: Intel Corporation P67 Express Chipset Family LPC Controller (rev 05)
13:27:17  Real ISA is dead.
13:27:22  twice11, I said bus
13:27:26  LPC replaced it.
13:27:36  hm it is still called ISA bridge thoug
13:27:38  though*
13:27:40  wonder why
13:27:53  LPC is kind-of 4-bit-parallel serial ISA.
13:28:16  hm
13:28:20  But is as a lower pin count (hence the name!), obviously.
13:29:20  Deewiant: Hmph: ansi-terminal does nothing for input whatsoever
13:30:04  elliott: Having the CPU do the lowest level details provides strong advantages: Independence of exact architectural designs, like you are able to add an extra execution engine and all apps are going to use it, and makes things like simultaneous multitrhreading possible at all.
13:30:25  Some abstractions seems like not being too bad.
13:30:34  twice11: Yeah, it's probably true that the microcode layer changes way too quickly for that to be feasible.
13:30:50  Modern x86-64: kind of a mess?
13:31:27  anything called remotely like x86 is something to stay away from if you like to keep sanity.
13:31:49  The 8086 instruction set might have been a good idea in 1978, though.
13:32:05  Already the 8088 is an abnomination, in my oppinion.
13:32:19  What use is a processor that starves on instruction fetch bandwidht?
13:32:42  Maybe I should just buy an FPGA and put a Reduceron on it and build a computer up from that, out of wood.
13:32:50  I'm sure I can make a wooden monitor. It would feel very appropriately DIY.
13:34:03  But history repeats, processors starving on instruction bandwidth reappear all the time, like the Cx486SLC2 or the first Pentium 4 designs (although in that case, it was the RAM/Northbridge that didn't manage to keep up with the excessive bandwidth required).
13:34:30  What we need is Checkout CPUs. (Problem: The instruction manuals would _probably_ form a black hole.)
13:34:32  that is why you have instruction caches
13:35:20  with the current technology you can either make expensive, fast & small RAM or you can make cheap, slow & large RAM.
13:35:26  Instruction caches on the mentioned processors are too small, or way to small.
13:35:37  true
13:36:02  I once inherited a cheap craptop with a Cx486SLC2.
13:36:14  Bus interface: 16-bit 286-like at 25MHz.
13:36:26  Processor core: 486 variant at 50MHz.
13:36:31  Cache size: 1KB.
13:36:46  The only thing the processor is fast at is tiny benchmark loops.
13:36:57  heh
13:37:57 -!- Nisstyre has quit (Ping timeout: 240 seconds).
13:39:06  my laptop has an L2 cache three times as big as my desktop. Crazy Core 2 Duo.
13:39:11  3 MB L2
13:40:06  By cache is longer than yours! 4MB in a C2D T7200
13:40:14  My cache...
13:40:24  heh
13:40:38  Didn't Core 2s go up to like 12 meg cache?
13:40:42  possibly
13:40:48  that was a laptop C2D though
13:40:53  They were just moving all the RAM to L2.
13:40:54  model name: Intel(R) Core(TM)2 Duo CPU     P8400  @ 2.26GHz
13:40:54  Why not!
13:41:22  elliott, I heard of CPUs with 256 MB L2.
13:41:26  not x86 though
13:41:27  lol
13:41:31  think it was a PowerPC or Power
13:41:36  for HPC
13:41:36  Is that some server CPU?
13:41:41  twice11, HPC even
13:41:48  compute server ;)
13:41:58  elliott, oh maybe it was 256 MB L3
13:42:02  rather than L2
13:42:03  not sure
13:42:07  still rather insane
13:42:11  789324789234798234 TB L0!!!!!!111
13:42:56  I can't find the L3 cache info for my laptop in lshw, not sure where else to look
13:43:07  Vorpal: 0MB
13:43:14  You laptop has no L3 cache.
13:43:16  oh, C2D had no L3?
13:43:16  hm
13:43:45  Just think about the die size if you want an L3 cache that is signicantly bigger than your 3MB L2 cache.
13:44:41  heh
13:44:41  So L3 needs to be outside the processor. The front-side bus is slow enough to have that backed by dual-channel DDR, so what use is a L3 cache.
13:45:00  my desktop has 6 MB L3 it seems. That is a Core i7 Sandy Bridge. It seems to be internal to the processor.
13:45:52  Core 2 doesn't do L3, Nehalem does.
13:46:02  wait what, it lists L3 cache in two places? Once as 8 MB and once as 6 MB. Lol lshw
13:46:30  I'll check what the intel cpu finder thingy has to say about it
13:46:32  brb
13:47:24  Maybe lshw trusts DMI info.
13:47:32  Usually an extremely bad idea.
13:47:47  possibly, it is mostly "To be filled by O.E.M."
13:48:01  my laptop has accurate DMI info mostly
13:49:16  well, intel claims 8 MB
13:51:04 -!- pikhq_ has joined.
13:51:23 -!- pikhq has quit (Ping timeout: 258 seconds).
13:54:32  In fact, the info amount and structuring of lshw is quite impressive.
13:55:42  In (at least) Sandy Bridge processors, it's not L2 cache, it's "Intel® Smart Cache". (That's how it's listed in ark.intel.com/ tech-specs listings.)
13:56:37  http://www.intel.com/content/www/us/en/architecture-and-technology/intel-smart-cache.html -- wow, that's so Warriors of the Net -esque.
13:56:50 -!- sebbu2 has changed nick to sebbu.
13:57:23  Does anyone actually pronounce it "cash"?
13:58:07  doesn't everyone?
13:58:17  I say cash-ey.
13:58:28  twice11, indeed
13:58:38 * twice11 says "cash", too
13:58:47  hmm, I've never heard cash-ey
13:58:49  elliott: Nobody pronounces it like that
13:58:54  I do!
13:58:55  fizzie, "warriors of the net"?
13:58:59  acache indians
13:59:01  It SOUNDS RIGHT.
13:59:05  Old joke: "Your parity check is overdrawn and you are out of cash"
13:59:06  Vorpal: http://www.warriorsofthe.net/
13:59:28  "Did you ever wonder how the Internet works? How does a router look like? What color does a IP packet have? How does a IP packet travel through firewall. All the answers and many more can be found in the Warriors of the net move."
13:59:29  fizzie, sadly that (and the intel thing) both require flash. Oh well
13:59:42  Deewiant: Anyway ansi-terminal doesn't do input?? Hmph at you, hmph
14:00:06  Vorpal: The latter seems to work just fine with elinks.
14:00:54  (There's even a non-youtube download link to SUnet.)
14:01:40  elliott: I guess you mean noecho and nodelay and nocbreak and getch? Yeah, I don't think anything non-curses on Hackage does that
14:01:52  Deewiant: Well, libedit/readline/haskeline &co.
14:01:57  oh right, it is youtube indeed
14:02:03  Deewiant: But that's a very specific usecase :-P
14:02:13  I can't use curses at all, sigh, it's just impossible
14:02:14  Just go download -> non-youtube link if you don't want flash.
14:02:42  elliott: Hmm, can you mix e.g. haskeline with ansi-terminal?
14:02:44  The Intel thing is very probably flash-only though.
14:03:22  Deewiant: ansi-terminal just does output colouration pretty much, so... yeah? It's just printf on steroids. Dunno about Windows. Don't care about Windows.
14:03:57  fizzie, youtube-dl seemed to work
14:04:03  elliott: If you don't care about Windows you can implement everything using only putStr and ECMA-48 :-P
14:04:06  not for intel of course
14:04:09  didn't even try that
14:04:20  Deewiant: Except raw input
14:04:25  fizzie, anyway how does "smart cache" differ from L2?
14:04:28  Deewiant: Wanna write my ioctls for me?
14:04:32  on a technical level I mean
14:04:55  Vorpal: "smart cache" is dynamically shared between processor cores and integrated graphics.
14:05:01  ah
14:05:24  elliott: Not particularly, no; see CCBI's TERM implementation if you're doing similar things
14:05:31  Seriously though, why would you even make a library use the alternate screen with NO CHIOCE AT ALL. :/
14:05:47  Deewiant: Yeah, that D code will help me use awful ioctls with hideous structs from Haskell
14:05:59  elliott, you can work around it by using only the terminfo interface of ncurses
14:06:00  elliott: I don't use ioctl
14:06:04  elliott, TERM in cfunge does that
14:06:06  Vorpal: How
14:06:07  Considering stuff like Turbo Boost, where you effectively disable cores, it makes sense to reuse the cache from that core for running cores.
14:06:08  Deewiant: What do you do then
14:06:18  elliott: What Vorpal's talking about
14:06:22  elliott, basically doing what tput(1) does
14:06:26  Right; go on
14:06:38  How do I put shit on the screen like that :P
14:06:40  elliott: man putp
14:06:53  elliott, check TERM.c from cfunge, I forgot the exact details
14:07:07  Deewiant: Uuugh this is ugly.
14:07:16  elliott: Yeah, it is
14:07:18  anyawy the coordination between NCRS and TERM is tricky
14:07:27  I recommend not loading both NCRS and TERM at the same time.
14:07:56  it *should* work for the cases I tested (as in, it doesn't crash), but the results might be somewhat hard to predict
14:08:04  Deewiant: And hscurses don't bind to it
14:08:08  elliott: char *go_xy = tigetstr("cup"); int x = 10, y = 20; putp(tparm(go_xy, y, x)); /* cursor is now at 10,20 */
14:08:14   Deewiant: And hscurses don't bind to it
14:08:22  'Least, far as I can tell
14:08:23  elliott: And?
14:08:35  What, you want me to suffer through the FFI for the privilege of using such an awful API?
14:08:36  eh
14:08:39  how is it ugly
14:08:41  I hate my life.
14:08:44  elliott: It only uses basic types and pointers to opaque structs AFAICT
14:08:45  putp(cursor_down);
14:08:55  elliott: That much FFI is hardly suffering
14:08:57  I think cursor_down is defined in the header
14:09:04  Deewiant: FFI is always sufferin'
14:09:07  oh wait, it is a macro isn't it?
14:09:12  Plus
14:09:13  elliott: Your pain threshold is way lower than it should be
14:09:17  Vorpal demonstrates the FFI problem with ncurses
14:09:20  Everything is a fucking macro
14:09:34  elliott: Nothing you need is a macro
14:09:35  $ grep cursor_down /usr/include/term.h
14:09:35  #define cursor_down                    CUR Strings[11]
14:09:37  yeah
14:09:44  Deewiant: How about that
14:09:50  elliott, okay, this will be painful from anything except C and C++
14:09:50  elliott: You don't need that
14:09:53  elliott: You use tigetstr
14:10:08  elliott, anyway, I know a way to work around this: Do a small C module that wraps this horrible macro API, then FFI to it
14:10:14  that might not be too painful
14:10:17  Deewiant: Are you sure this actually does input
14:10:41  I don't think the term.h interface does input.
14:10:49  not sure though
14:10:57  I like how you're both contradicting each other every line.
14:11:05  heh
14:11:11  elliott: I still don't know what you mean by "does input"
14:11:19  Deewiant, I presume he means stdin
14:11:21  elliott: getchar(3)
14:11:29  Deewiant: With raw console, duh
14:11:32  No buffering
14:11:34  set input unbuffered and do getchar()?
14:11:42  Vorpal: Now you have two problems!
14:11:42  hm
14:11:47  Tell me how to do the former; it will involve ioctl.
14:11:53  Deewiant just told me to use putp to avoid ioctl.
14:12:00  You need to turn off kernel buffering/basic line editing.
14:12:00  And so we come full circle.
14:12:06  elliott, no I think it involves setvbuf()
14:12:13  twice11: Right, that's just a hideous pain from anything but C :)
14:12:26  Just turning off userspace buffering like setvbuf() doesn't help.
14:12:30  oh okay
14:12:35  elliott: I said "if you're doing similar things", I can't even remember what things TERM has :-P
14:12:57  TERM has  CDGHLSU
14:13:00  s/  / /
14:13:11  (not helpful I know)
14:13:13  The original idea was that in stuff like telnet, the telnet client does the whole line editing, and only complete lines get sent over the network.
14:13:32  Is enter_ca_mode sufficient, I wonder
14:13:49  Deewiant, doesn't that do the crazy alt-screen thingy?
14:13:57  twice11: I wish that was actually done so I could get a benefit from all this awfulness
14:14:02  ssh line editing lag regularly annoys me
14:14:06  Vorpal: It's the "do this before doing anything else"
14:14:19  Deewiant, does ccbi TERM do that?
14:14:23  Vorpal: Yes
14:14:31  elliott: telnet does that as long as the program invoked does not turn off kernel line editing/buffering.
14:14:40  You could tunnel telnet over ssh.
14:14:48  oh right, so does cfunge with some defines.
14:14:52 -!- Jafet has quit (Quit: Leaving.).
14:14:56  twice11: Hmm, right, I've never used telnet for actual shells
14:14:57  But don't expect tab completion or history or any other fancy stuff to work.
14:15:00  the problem is, that does the alternate screen that fucks with scrollbars
14:15:12  and it works without that
14:15:12  Messes with more than just scrollbars
14:15:14  yes
14:15:24  It's fine for screen-oriented UIs
14:15:25  anyway:
14:15:28  But my program is streaming, line-based
14:15:28  #ifdef TERM_CAP_CORRECT
14:15:28  putp(enter_ca_mode);
14:15:28  atexit(finalise);
14:15:28  #endif
14:15:46  which is usually done
14:15:52  You have an option for buggy termcaps or something? :-P
14:16:05  In a line-based program, don't enter alt-screen mode. Easy ;)
14:16:11  Deewiant, it is #defined at the top of the file, so changing it requires patching TERM.c
14:16:42  Deewiant, I think I experimented with and without that though. And it worked fine without it in all tests. I did settle for having it on though, just in case...
14:16:49  If a library forces you to enter alt-screen mode, fix the library.
14:17:20  twice11, problem is, you are supposed to use that before any cursor moving magic iirc. According to the documentation
14:18:09  The idea was that you don't need cursor moving magic in a line-based program.
14:18:28  iirc elliott is doing a progress bar or something
14:18:33  And that's why wget goes into alternate screen mode to draw a progress bar
14:18:38  At the point where you implement your own readline with sensible wrapping, the idea breaks down...
14:18:53  huh, wget does that? Are you sure?
14:18:54  elliott, it does? Why doesn't it mess up with the scrollbar then?
14:18:55  It's more than just progress bars here, I update status indicttors too
14:18:57  twice11: Sarcasm :)
14:19:22  Was just giving an example of a line-based program that obviously needs cursor magic
14:19:45  backspace is enough for updating scrollbars.
14:20:04  And backspace is not considered "cursor movement".
14:20:13  twice11, progress bars you mean
14:20:21  Vorpal: Yes.
14:20:26  twice11: there's more at work here
14:20:31  I have multiple progress bars on different lines
14:20:40  and like I said, also have to update status indicators in various lines
14:20:56  In this case, it is no longer plain line based... Hybrid concepts are not supported. Too bad.
14:21:20  twice11: Well, I'm not going to give up when the fix is "only" an ioctl away...
14:21:37  Nothing actually breaks when you use cursor codes before that anyway.
14:21:54  On most terminals I can imagine, doing what you want to do without alt screen mode works.
14:22:16  elliott, wait, isn't the ioctl for input you said? Rather than output?
14:22:19  Yep, just means I can't benefit from things like ncurses which force me into alt-screen mode
14:22:27  Vorpal: Yes, I just mean that if I need to roll my own escapes, I need ioctl for input
14:22:30  As opposed to using curses
14:22:36  the joys of telnet.
14:22:37  ah
14:22:37 -!- Ngevd has joined.
14:23:13  ncurses must be usable in non-alt-screen mode too.
14:23:21  Hello
14:23:33  elliott, what happens if you have more progress bar than the height of the terminal? I have seen programs like powertop fuck up when output didn't fit on the screen
14:23:35  AFAIK, GNU readline is based on ncurses. And readline does not enforce alt-screen.
14:23:41  not sure if they fixed that in more recent versions
14:23:44  it is possible
14:23:51  twice11: Well, the standard API definitely does it.
14:24:06  I'm almost positive that telnet can ask terminal dimensions.
14:24:18  I'm almost positive you have no idea what we're talking about.
14:24:23  that too.
14:24:27  Vorpal: Pretty sure you can cursor-up beyond the displayed terminal height
14:24:31  other than you're talking about telnet and terminal dimensions
14:24:33  elliott, hm
14:24:34  Don't look at me, I just got here
14:24:36  It's really a very big terminal, just with limited viewport
14:24:37  CakeProphet: Not telnet
14:24:44  ah, okay. well then nevermind. :)
14:26:00 -!- sllide has joined.
14:29:05  elliott, which ioctl is it
14:29:19  SCSCTATTR or some nonsense like that.
14:29:23  (I just typed random chars that look right.)
14:29:26  ICOSAGET. Something.
14:29:31  It's an awful bugger.
14:29:41  which man page?
14:29:45  termios stuff.
14:29:53  http://en.wikibooks.org/wiki/Serial_Programming/termios
14:30:03  Has some "lovely" examples.
14:30:10  Hmm, OK that's not a ioctl, but there's an ioctl underneath it.
14:30:14  Isn't termios deprecated?
14:31:15  CONFORMING TO
14:31:15         tcgetattr(), tcsetattr(), tcsendbreak(), tcdrain(), tcflush(), tcflow(), cfgetispeed(), cfgetospeed(), cfsetispeed(), and cfsetospeed()  are  specified
14:31:15         in POSIX.1-2001.
14:31:16         cfmakeraw() and cfsetspeed() are nonstandard, but available on the BSDs.
14:31:19  well, maybe?
14:35:02  temios-like: TCGETS/TCSETS{,F,W}; termio-like: TCGETA/TCSETA{F,W}
14:35:19  I forget which is newer.
14:35:49  TCSETS == TCSANOW, TCSETSF == TCSADRAIN, TCSETSF = TCSAFLUSH
14:35:57  elliott: It's SysV/BSD, not old/new.
14:37:41  Other people claim termios is standard, termio is BSD.
14:38:16  BSD user, by any chance? :-)
14:38:38  "The termio interface is now obsolete: POSIX.1-1990 standardized a modified version of this interface, under the name termios."
14:38:42  says man termio here
14:39:20  Right.
14:40:08  but I would guess twice11 is a BSD user from that
14:40:12  Hmm, /can/ you go above the terminal size with cursor movement?
14:40:18  I suppose it's easy enough to avoid.
14:40:24  try it and see?
14:40:24  But it makes scrolling up ... ugly.
14:40:27  Vorpal: Lazy.
14:40:33  with a few different terminals I guess
14:40:42  No, Linux only.
14:41:07  But sometimes remembering things incorrectly.
14:41:48  [elliott@dinky ~]$ tput cols | cat -v
14:41:48  168
14:41:48  Disturbing. :/
14:41:53  Reveal your secrets!!!
14:42:12  strace?
14:42:29  it might just look at $COLUMNS :P
14:42:35  which iirc the shell sets
14:42:45  Wow, $COLUMNS actually gets set.
14:42:52 -!- tiffany has joined.
14:42:59  elliott, remember that the user might resize the terminal window while your program is running
14:42:59  How to install strace:
14:43:02  Targets (43): strace-4.6-1  ncurses-5.9-2  readline-6.2.001-3  bash-4.2.010-2  gawk-4.0.0-2  m4-1.4.16-2  autoconf-2.68-2  automake-1.11.1-3  bison-2.5-2
14:43:02                findutils-4.4.2-4  sed-4.2.1-4  ca-certificates-20111025-2  curl-7.22.0-4  db-5.2.36-2  dialog-1.1_20111020-1  expat-2.0.1-7  flex-2.5.35-5  gdbm-1.8.3-9
14:43:02                gettext-0.18.1.1-4  grep-2.9-2  gzip-1.4-4  libldap-2.4.26-5  krb5-1.9.2-1  less-444-2  lib32-libpciaccess-0.12.1-3  libcap-2.22-2  libpcap-1.1.1-4
14:43:02                libpipeline-1.2.0-2  libusb-1.0.8-2  linux-firmware-20111101-1  nano-2.2.6-2  patch-2.6.1-3  pciutils-3.1.8-1  popt-1.16-4  pkg-config-0.26-2
14:43:04                sqlite3-3.7.9-1  talloc-2.0.7-1  tar-1.26-2  texinfo-4.13a-6  thunar-1.2.3-2  vi-1:050325-2  which-2.20-5  wpa_supplicant-0.7.3-4
14:43:12  elliott, doubtful your own COLUMNS would be upgraded then
14:43:13  elliott, what?
14:43:18  Vorpal: Yeah, I'll have to roll my own.
14:43:49  elliott, here strace only depends on perl. Guess that could pull in a lot.
14:44:01  elliott, are you still on arch? That vi version number looks debianish
14:44:03 -!- sebbu2 has joined.
14:44:03 -!- sebbu2 has quit (Changing host).
14:44:03 -!- sebbu2 has joined.
14:44:13  strace doesn't depend on all that
14:44:23  oh it is that on arch
14:44:24  hm
14:44:32  Vorpal: Those are what vi version numbers look like
14:44:45  elliott, did you do pacman -Su strace or something?
14:44:56  -Syu
14:45:04  well okay that will do system upgrades too
14:45:06  Beats remembering to upgrade the system regularly
14:45:07  I.e. "update whole system, oh and install strace"
14:45:12  Deewiant: Yep
14:45:17  elliott, pacman -S strace will probably just show strace :P
14:45:19  Deewiant: It's either that or avoid synchronising
14:45:21  So not reallywquite "how to install strace"
14:45:25  Or I might get inconsistent packages
14:45:31  + ctrl
14:45:31  So -Syu all the time it is
14:45:40 -!- sebbu has quit (Ping timeout: 256 seconds).
14:46:06  Vorpal: Guess what tput uses (it's ioctl)
14:46:30  elliott, it might use termios, but if termios is done in glibc it would likely map to ioctl
14:46:38  remember, strace shows ioctls, not library calls
14:46:41  err system calls
14:46:58  Vorpal: Oh, termios lets you do that?
14:47:14  nm -D /bin/tput
14:47:16  no ioctl
14:47:20  lots of termios stuff
14:47:43  OK, now I must face my true problem: termios is butt-ugly.
14:47:52  wait, is that ncurses stuff rather
14:47:53  it might be
14:48:12  elliott, yes it is term.h stuff
14:48:16  not termios
14:48:23  God dammit term.h
14:48:27  All roads lead to you
14:48:37  elliott, but that still doesn't deal with the input issue at all
14:48:42  I suspect you need termios for that
14:48:48  Sure, but I don't want to use term.h
14:48:50  'S ugly
14:48:53  Let's get raw, raw, raw
14:48:55 -!- sebbu3 has joined.
14:48:55 -!- sebbu3 has quit (Changing host).
14:48:55 -!- sebbu3 has joined.
14:48:56  certainly
14:48:56  termios is about as raw as it gets
14:49:22  tcgetattr/cfmakeraw/tcsetattr is the usual way to get raw input.
14:49:23  elliott, term.h provides you will a way to look up the control codes. And yes ncurses headers suck.
14:49:32  The first and third call ends up in an ioctl.
14:49:39         The tigetflag, tigetnum and tigetstr routines return the value of the capability corresponding to the terminfo capname passed to them, such as xenl.
14:49:39  What I don't understand is, how can "cols" be a capability, like this and man tput imply?
14:49:44  twice11, cfmakeraw is a deprecated BSD only thingy
14:49:47  as far as I can tell
14:49:47  It sounds like they're static configuration values from the terminfo database.
14:49:54  But obviously columns change.
14:50:09  yes, beats me how it handles that
14:50:12  you can ask for cols through an ioctl.
14:50:19  But not all terminals support that.
14:50:22  wait, isn't there a signal for resized terminal?
14:50:25  that some terminals do
14:50:26  I mean terminal driver.
14:50:27  but not all
14:50:30  SIGWINCH
14:51:03  twice11: Linux console/xterm/rxvt/gnome-terminal is pretty much all I care about, honestly.
14:51:03  SIGWICH  mmmmmmm
14:51:15  I seem to remember some terminal emulator that let me set if I wanted to use SIGWINCH or something else
14:51:23  might have been konsole
14:51:24  not sure
14:51:57  is it bad that the primary reason I decided not to use KDE is that I dislike the names of all its default software?
14:52:03  Yes
14:52:08 -!- Phantom_Hoover has quit (Ping timeout: 248 seconds).
14:52:30  the sole reason for me is that KDE 4 is horrible.
14:52:37  the starts-with-a-K naming scheme just makes me... kringe.
14:52:54  But isn't that kool?
14:52:56  gnome has quite a few things starting with g iirc
14:53:02 -!- sebbu2 has quit (Ping timeout: 256 seconds).
14:53:36  Nothing starts with g nowadays :P
14:53:45  maybe
14:53:57  elliott, a few of the games iirc?
14:53:57  yes but usually it just kind of is attached to the front of the name rather than incorporated into the first word.
14:54:00  which is somehow better?
14:54:19  Vorpal: AisleRiot, Quadrapassel, ...
14:54:31  gweled
14:54:56  I have gbrainy in games.
14:54:59  *Games
14:54:59  Vorpal: Very unofficial from the looks of it
14:55:03  elliott, hm
14:55:04  Not GNOME at all
14:55:13  CakeProphet: That's the only example I can think of
14:55:43  gedit
14:55:46  I can think of -- yes
14:55:47  (not a game)
14:55:51  you beat me. :P
14:55:56  gedit is a perfectly acceptable name.
14:56:09  I base this on arbitrary aesthetic values.
14:56:10  gconf-editor
14:56:21  g is a helpful indicator here.
14:56:29  and shorter than gnome-conf-editor
14:57:11  gnome-panel, that doesn't just start with g, it starts with a whole "gnome"
14:57:21   gconf-editor
14:57:23  please :P
14:57:24  if most of the applications in Gnome started with a big capital G as the first word of the name.
14:57:27  elliott, what?
14:57:29  I would also feel the same way about gnome.
14:57:41  also, gnome-panel is actually just Panel I think
14:57:47  gnome-panel is just the executable
14:57:47  s/word/letter/
14:58:16  /usr/bin/gnome-sudoku hm
15:00:26  what about gphoto2
15:00:29  isn't that gnome?
15:00:32  so if Nautilus were called Galaxy, the image viewer were called Gorgeous, Trash was instead Garbage, and there was a music player called Gain.
15:00:40  or hm maybe not
15:00:44  CakeProphet: coooooool
15:00:52  elliott: I agree.
15:01:57  they should have a Ukubuntu where "Trash" is called "Rubbish"
15:02:03  that is the only change.
15:02:29  CakeProphet: it's called the Rubbish Bin in UK locales
15:02:35  gnome has many localisations, you know
15:02:44  elliott, anyway for portable escape codes to the terminal: term.h. For unbuffered input: termios or possibly some ioctls, not sure how portable the latter would be
15:02:46 -!- MSleep has changed nick to MDude.
15:02:50  (between different terminals I mean)
15:03:00  Vorpal: "portable", do you even believe yourself. show me a terminal that can't do vt100
15:03:09  elliott: oh really? those craft gnomes.
15:03:14  *crafty
15:03:21  elliott, sec
15:03:32  Vorpal: That works with modern linux and is a progra
15:03:32  m
15:03:43  elliott, oh. I was about to say VT62 :P
15:03:44  elliott: can microsoft run do vt100?
15:04:00  run do?
15:04:01  *run.exe or whatever
15:04:05  cmd.exe?
15:04:08  er
15:04:08  yes
15:04:12  unlikely
15:04:25 * CakeProphet <-- Wundoes Youser
15:05:00  ?
15:05:32  elliott, anyway I seen someone do terminal on matrix printer with linux 2.6.something
15:05:32  I will let you puzzle it out on your own
15:05:36  it is still supported
15:05:44  elliott, not a sane setup though :P
15:05:47  Not a terminal :P
15:06:06  I forgot what the input was
15:06:21  can Cygwin do vt100? I recall seeing vt100-like things in it before.
15:06:25  but it runs through cmd.exe
15:06:33  elliott, I used serial console myself a few times on modern linux.
15:06:48  you're not a person; anyway does that even count as a tty
15:06:51  what does isatty think
15:07:02  for serial console? No idea
15:07:24  i bet it thinks no
15:07:31  in which case the package manager will use paper trail output
15:07:34  rather than interactive output
15:08:14  elliott, right. A more reasonable question would: what about GUI package managers wrapping your package manager. How will you support that (if at all)
15:08:26  I guess there is packagekit, doubt that would fit you
15:08:29  that's what libraries are for
15:08:35  fair enough
15:08:48  libraries are for books not packages.
15:08:50  paper trail output isn't gonna print a dot for every minuscule bit of progress :P
15:09:06 -!- Phantom_Hoover has joined.
15:09:32  elliott, is this for download or for installation too?
15:09:48  it's for... package management
15:10:16  elliott, yes but surely not all bits of package management needs a progress bar.
15:10:23  only those that take some time
15:10:25  yeah that's totally a thing i implied
15:10:32  you're being perfectly reasonable by stating this as if it's somehow cogent
15:10:45  I'm glad you feel that
15:11:10  so I guess you plan to use it for more than just download, such as compilation and installation?
15:11:39  no, by package manager all this time i've actually meant wget
15:13:10  wget is the great for Porkege Ménagement
15:14:15 -!- Ngevd has quit (Quit: Leaving).
15:25:22  elliott: happy day-in-which-King-James-1-is-still-alive day.
15:25:29  I wonder where we would be without him.
15:33:34 -!- sebbu3 has changed nick to sebbu.
15:35:19 -!- Darth_Cliche has joined.
15:43:21      def ioctl_GWINSZ(fd):
15:43:21          try:
15:43:22              import fcntl, termios, struct, os
15:43:22              cr = struct.unpack('hh', fcntl.ioctl(fd, termios.TIOCGWINSZ,
15:43:22          '1234'))
15:43:22          except:
15:43:24              return None
15:43:26          return cr
15:43:28  Vorpal: OH GOODY
15:45:58  Kind of tempting just to shell out to tput
15:46:18 -!- pikhq has joined.
15:46:23  Unless you can do that with the portable termios api
15:46:25  i.e. not ioctl
15:46:27 -!- pikhq_ has quit (Ping timeout: 252 seconds).
15:46:53  hi pikhq
15:47:56 -!- Nisstyre has quit (Ping timeout: 260 seconds).
16:00:01 -!- monqy has joined.
16:06:16  wait
16:06:21  fcntl.ioctl?
16:06:22  what?
16:06:36  fcntl == module name, ioctl == function name.
16:06:36  oh wait, that is python
16:06:37  right
16:06:40  *phew*
16:06:52  thought it was some weird C with function pointers in structs first
16:49:01 -!- quintopia has quit (Ping timeout: 244 seconds).
16:53:19 -!- shareholder has joined.
16:53:25  Why would you ever have a function pointer anywhere other than a struct?
16:53:27  }:P
16:54:26  tswett, in qsort() parameter list for example
16:55:13  cfunge puts them in dynamically allocated arrays acting as stacks iirc.
16:55:44  What are qsort's parameters?
16:56:00  check qsort(3)
17:00:59 -!- quintopia has joined.
17:01:00 -!- quintopia has quit (Changing host).
17:01:00 -!- quintopia has joined.
17:17:53 -!- shareholder has left ("Quitting").
17:56:35 -!- Nisstyre has joined.
18:06:46 -!- derrik has joined.
18:07:16 -!- Ngevd has joined.
18:10:51 -!- oerjan has joined.
18:11:04  BEFUNGE 93 WITH NUMBERED MACROS
18:11:10  hi
18:11:17  o/ hi
18:11:19  Hello
18:11:22  ho
18:11:35  var "friendship ho"
18:11:36  oerjan: this isn't #esoteric-minecraft
18:11:41  > var "friendship ho"
18:11:42    friendship ho
18:11:53  Ngevd: wat
18:11:58  hi ho
18:12:03  Disney's Snow White
18:12:08  Dwarfs who do mining
18:12:10  implying dwarves
18:12:10  Minecraft
18:12:12  implying...
18:12:18  dwarf fortr--wait what?
18:12:23  oh okay.
18:12:30  sure.
18:12:51  I think so Ngevd, but where are we going to find 500 unicycles?
18:13:02  Well, I have one
18:13:07  And a dinner to eat
18:13:12 -!- Ngevd has quit (Quit: CURRY TIEM).
18:13:30  oerjan: just find 250 bicycles and cut them in half.
18:13:50  brilliant!
18:17:22   elliott: happy day-in-which-King-James-1-is-still-alive day.
18:17:28  OMG ZOMBIE KING
18:24:44 -!- Ngevd has joined.
18:24:47  Hello
18:25:10  you eat fast
18:25:18  It was a madras
18:25:27  And I'm not a big eater
18:26:43  what does your size have to do with anything?
18:26:49  :>
18:26:53 * elliott small eter
18:26:57  im cat
18:29:17  s/cat/land fish/
18:31:06  now lessee, if a cat loves to eat sea kittens...
18:31:44  speaking of that conversation, I am eating honey right now.
18:31:48  best vomit ever.
18:34:12  i did it guys
18:34:12  i foudn
18:34:15  the worst subreddit
18:34:17  http://www.reddit.com/r/aaaaaatheismmmmmmmmmm
18:34:21  it's f7u12
18:34:25  ...for /r/atheism
18:34:42  monqy: rejoice with me
18:35:27  :(
18:36:35  monqy: http://i.imgur.com/VF98o.png
18:36:45  this is stellar.
18:37:08  monqy: classic vintage rage comics; http://www.reddit.com/r/classicrage
18:37:34  Satan's in the Philippines
18:37:56  Ngevd: do you like dst
18:38:07  elliott: I'm not entirely sure I'm making the connection between that picture and stars.
18:38:17  It has its upsides
18:38:23  dst is all bad
18:38:26  Ngevd: no. no no no. bad.
18:38:28  there is nothing good about it
18:38:30  bad opinions
18:38:40  CakeProphet: what
18:38:50  13:36 < elliott> this is stellar.
18:38:57  oh.
18:39:15  :3 :> etc
18:41:30  monqy: http://i.imgur.com/7tEqu.jpg
18:41:32  The Commonwealth of England had a stupid flag
18:41:39  these are the worst things ever made by humanity
18:41:45  in fact if we showed this to aliens who came down and were like
18:41:47  justify your species
18:41:50  we'd be so fucked
18:42:29  "what IS this PRAYER..no BURNS! no! burn!"
18:42:32  --fungot
18:42:32  elliott: young john soon afterward receives as a visitor a fnord spaniard, fnord de moncada, who has escaped from fnord fnord dissolved in the absolute.
18:42:38  `addquote  elliott: young john soon afterward receives as a visitor a fnord spaniard, fnord de moncada, who has escaped from fnord fnord dissolved in the absolute.
18:42:40  elliott: most horrible of all sights are the little unpainted wooden houses remote from travelled ways, usually squatted upon some damp grassy slope or leaning against some gigantic outcropping of rock. i looked at him i saw that my searching would have to cross the blighted, fnord woods alone to his home on the great horse, and his face and accept his alternate blows and fnord who seeks a proud and fnord, and fnord the actual
18:42:41  709)  elliott: young john soon afterward receives as a visitor a fnord spaniard, fnord de moncada, who has escaped from fnord fnord dissolved in the absolute.
18:43:10  ^style
18:43:10  Available: agora alice c64 ct darwin discworld europarl ff7 fisher fungot homestuck ic irc jargon lovecraft* nethack pa sms speeches ss wp youtube
18:43:24  wow these reddits images
18:43:28  wow this reddits
18:43:33 -!- zzo38 has joined.
18:43:37  who would do this
18:43:48  http://i.imgur.com/BEaH0.png
18:43:57  the world is so beautiful
18:44:17  the part of my brain that should turn to pure blackened hatred when i see things like this
18:44:22  got spontaneously reconfigured at some point
18:44:32  so it just makes me think of how beautiful life is instead, it's great
18:44:46  maybe i should like read freerepublic daily to keep my happies up
18:45:36  monqy: http://i.imgur.com/b83hr.png
18:45:39  monqy: it's...
18:45:40  i
18:46:31  ;_;
18:48:57  i wish i had this....reconfigured brai.nnnnn
18:49:36  monqy: the key is i think
18:49:39  maybe i am reacting inappropriately as well, but not in such a pleasant manner....
18:49:44  extreme extrospection (totally a word) whenever you meet anything like this
18:50:06  i just lean back and look at the world and also humanity and i'm like ha ha ha ha hahahahaha
18:50:13  oooh new iwc annotation
18:50:36  It's about ATOMS
18:50:41  i guess im hahahaha too but i don't know how to describe it....im bad at feelings....
18:51:17  oerjan: how do you even like dmm, he's so happy and upbeat.
18:51:32  is oerjan emo
18:51:32  13:43 < elliott> got spontaneously reconfigured at some point
18:51:37  puberty?
18:51:38  elliott, he's like me
18:51:41  monqy: yes "emoerjan"
18:51:47  Ngevd: are you emo as well
18:51:51  No
18:51:53  I am anti-emo
18:52:00  ngemovd
18:52:00  ok
18:52:02 * CakeProphet is emo. -_;;
18:52:07  One person showed up to my birthday party
18:52:14  And I was all like "who cares?"
18:52:23  "There's a universe to explore!"
18:52:29  "Also, more cake for me!"
18:52:46  http://www.youtube.com/watch?v=EJ51kW684FM
18:52:46 -!- sebbu has quit (Read error: Connection reset by peer).
18:52:54  wrong channel
18:52:56  but whatever
18:52:57  "dephlogisticated air" :D
18:53:26  I love that theory
18:58:28 -!- elliott has quit (Remote host closed the connection).
18:59:09 -!- sebbu has joined.
18:59:09 -!- sebbu has quit (Changing host).
18:59:09 -!- sebbu has joined.
19:04:26  oerjan: Actually, there is the Gregorian calendar based which is what the heading says and is likely what the author intended, but literally following the instructions in Principia Discordia for the calendar results in it based on the Julian calendar so that on 2100 AD (3266 YOLD) it will diverge, being 1 Chaos 3267 on Jan2, 2101
19:09:17   oerjan: how do you even like dmm, he's so happy and upbeat. <-- funny you should say that, i found the previous (first new style) annotation somewhat grating that way, i didn't even read all of it.  have just opened the new one, we'll see.
19:26:52   wowflowrs! ! 1 nobdy 0sksi a go
19:27:00  elliott's cryptic final transmission.
19:27:27   I am anti-emo
19:27:41  I'm mismisanthropicic, can we fight crime?
19:28:06  If I collide with an emo, we annihilate each-other in a burst of energy
19:28:32  i don't see how you could possibly get energy from an emo.
19:28:51  Okay, a burst of energy and anti-energy
19:28:57  Which then collide and form matter
19:30:15  And that's all that matters
19:30:25  And Phantom_Hoover, yes. We can fight crime.
19:30:30  Meet you in Glasgow?
19:30:49  No you can't fight crime in Glasgow.
19:31:13  It's like trying to get rid of the space-time continuum.
19:31:26  Hmm...
19:31:31  Meet you in Newcastle?
19:31:49  Which one?
19:32:00  Upon Tyne
19:33:17  Or New South Wales, your call
19:33:33  (I was replying to oerjan's message at UNIX timestamp 1320562665)
19:35:35  so many limeys.
19:35:48  That's a thought
19:35:54  We could go Under Lyme?
19:37:14 -!- GreaseMonkey has joined.
19:38:06  Hello, GreaseMonkey
19:38:12  'lo
19:58:35 -!- oerjan has quit (Quit: Good night).
20:07:13 -!- sllide has quit (Read error: Connection reset by peer).
20:17:11 -!- Zuu has quit (Read error: Connection reset by peer).
20:19:04 -!- Zuu has joined.
20:25:50 -!- edne has joined.
20:27:07 -!- edne has left.
20:37:00 -!- Ngevd has quit (Ping timeout: 256 seconds).
20:38:33 -!- Ngevd has joined.
20:39:49 -!- ais523 has joined.
21:02:01  headline just seen on the news: [CG :88
21:02:10  I assume it's a typo, rather than some sort of complex smiley
21:02:27  CG would be Karkat...
21:02:29  Hmmm
21:26:13 -!- edne has joined.
21:27:35 -!- edne has left.
21:51:58 -!- Ngevd has quit (Quit: Leaving).
21:53:17  I have an idea for a telephone service, where it is a free feature you can enable and allows the A,B,C,D tones to access several extra commands such as diagnostics, disable call waiting, disable call display, disable toll calls, switch call display protocol, impose time limits, enter red box mode, prevent recipient from using ANI (separately from call display),
21:54:29  disable voice mail, reverse polarity, cut the line for a duration of time, select ground start protocol, disable tone dialing, disable pulse dialing, select a call display mode that tells you whether the last digit to call you was dialed using pulse or tone, etc.
21:55:00  Act 6 is going to be amazing.
21:55:25  I don't know if anyone can do that.
21:56:42  zzo38: Some phone operators provide a number which allows you to change your features by calling it
21:57:15  zzo38: a little bit like USSD?
21:57:37  By the way, otoko no ko
21:58:16  coppro: OK, but probably not everything I have mentioned. One idea is to have that when receiving diagnostics information, A announces by voice and C for computer receiving data.
21:58:20  tswett: What is USSD?
21:58:30 -!- Ngevd has joined.
21:58:53  O, I found it in Wikipedia
21:59:00  zzo38: that's a thing where you punch in a series of symbols, like a phone number except with pounds and stars, and it does something.
21:59:10  Such as diagnostics or reversing the polarity.
21:59:32  can it bounce the graviton particle beam off the main deflector dish?
21:59:48  coppro: yes, but nobody knows the code for that.
22:00:20   I have an idea for a telephone service, where it is a free feature you can enable and allows the A,B,C,D [...] <-- why?
22:00:32  isn't out of band metadata better than in-band?
22:01:15  The software that processes these codes is more complicated than all of Ubuntu and OS X combined, and we've also lost the source code.
22:01:56  Vorpal: The reason for in band is to use standard telephones and modems to access it without requring any connection other than standard telephone lines.
22:02:29  tswett, ubuntu can't be terribly complicated. Just look at how trivial a clean install of windows 7 is. And Ubuntu has a way smaller install size than that! (Nevermind that there are so many more features in the latter, probably just a statistical fluke)
22:03:56  zzo38, isn't land line dying anyway, compared to voip
22:04:19  I still use landline service.
22:04:21  I still have a landline because I have ADSL, but most people I know with cable or fibre have switched to voip
22:05:00  Vorpal: well, I meant "Ubuntu and all packages available for it in the official repositories".
22:05:04  tswett, ah
22:05:12  tswett, yeah that is /quite/ a bit more then
22:05:28  Landline service does not require a computer, and the protocol is sufficiently simple that you can build your own telephone with a few spare parts (as long as pulse dialing is not disabled)
22:05:36  tswett, sigh, if only there was a distro with a repo as extensive as ubuntu but rolling release....
22:06:15  Rollbuntu
22:06:17  arch has two major issues for me: multilib support is crappy. No split debug info. Still. There is work being done on the latter though.
22:06:48  What's wrong with the multilib support
22:06:49  and of course debian's package building system is a mess
22:07:55  Deewiant, badly incomplete
22:08:06  How so
22:08:36  missing headers for 32-bit, few libraries. I mean there was no OpenMPI library for 32-bit last I checked
22:08:40  and so on
22:08:55  the 32-bit libraries that exist are there to support a few packages, like zsnes and so on
22:09:10  but apart from those required by the binary 32-bit packages in the repo: not much
22:09:44  Fair enough; personally I've yet to need anything that wasn't in the repo
22:10:32  Deewiant, oh and if you use arch: valgrind fucks up on cfunge atm. I think it is a missing suppression for gmtime() or some internal function it uses.
22:10:42  in the latest glibc that is
22:10:50  there are no errors when running on ubuntu
22:11:01  (10.04 LTS)
22:11:11  (so a bit older glibc)
22:11:32  Do any of the BayHac2011 Haskell programs exist?
22:12:25  Deewiant, also the lack of debug info for glibc means I can't really track down the missing suppression...
22:12:58  -dbg packages work perfectly on ubuntu
22:18:25 -!- GreaseMonkey has quit (Quit: The Other Game).
22:21:51 -!- Ngevd has quit (Ping timeout: 260 seconds).
22:31:59 -!- sebbu has quit (Read error: Connection reset by peer).
22:32:25 -!- sebbu has joined.
22:32:26 -!- sebbu has quit (Changing host).
22:32:26 -!- sebbu has joined.
22:34:22 -!- MDude has quit (Ping timeout: 240 seconds).
22:35:46  Phantom_Hoover, do you happen to remember the name of that libc elliott was interested in?
22:35:57  No.
22:35:59  oh well
22:36:15  I think it started with m. Time for a very wide grep of the logs
22:36:21  musl?
22:36:28  ah thanks
22:36:30  that was it
22:43:28  hm based on http://www.etalabs.net/compare_libcs.html it still looks like eglibc is a better bet for most desktop systems. It is only worse than musl in a few cases, but has so much better support for lots of features.
22:44:02  still worth trying building against
23:06:28  Yeah, it's a very good libc, if still a work in progress.
23:07:12  pikhq, still, missing out on C99 math and so on. :/
23:08:24 -!- hagb4rd has quit (Read error: Connection reset by peer).
23:11:38  Yeah, C99 math is hard to do well.
23:12:42 -!- variable has quit (Excess Flood).
23:15:08 * Phantom_Hoover → sleep
23:15:09 -!- Phantom_Hoover has quit (Quit: Leaving).
23:17:40 -!- variable has joined.
23:30:47   Yeah, C99 math is hard to do well. <-- oh?
23:34:45 -!- tiffany has changed nick to tiffnya.
23:34:53 -!- tiffnya has changed nick to tiffany.
23:40:11 -!- BlueProtoman has joined.
23:40:20  Can anyone here help me with my Brainfuck interpreter? I've got most of it down except for loops, which are not so much looped as they are ran once. http://codepad.org/eznPVPyy
23:43:09  Anyone?
23:43:45 * ais523 looks
23:44:37  you aren't assigning the result of jumpPosition.pop() to anything
23:45:52  Let's see, then.
23:47:05  pop() is void, though...
23:49:35  Any thoughts, ais523?
23:51:34 -!- ais523 has quit (Ping timeout: 240 seconds).
23:52:13 -!- ais523 has joined.
23:52:40  BlueProtoman, err:                jumpPosition.push(ptr+1);
23:52:53  BlueProtoman, you should run the condition every time surely
23:53:08  you need to run the condition when you enter the loop anyway
23:53:17  which you don't seem to do
23:53:26  Run the condition?  I don't get it,
23:53:35  BlueProtoman, A loop might run zero times.
23:53:37  Ah wait, you mean testing the stack for whether it's empty?
23:53:42  if the current cell if 0
23:53:45  it won't ever run
23:53:59  it will stop when at the start of an iteration the current cell is zero
23:54:12  so the loop logic is wrong
23:54:16  Vorpal: That's the point of the Brainfuck language isn't it?
23:54:21  Hm...
23:54:27  yes, but you don't seem to do that currently
23:54:46  you check if (*ptr) at the end of the loop
23:54:55  which means every loop will run at least once
23:55:44  BlueProtoman, you need code to scan forward to the matching ] without executing
23:55:55  since a loop can be executed zero times
23:56:17  I see...I can maybe throw another function in there for that.
23:56:35  So check for a ], then...hm...
23:56:38  personally I would parse it into a tree then exeute the tree.
23:56:42  This is tougher than I thought.
23:57:24  Tree?  I think I'm lost now.  I've only been studying C++ for a few months.
23:57:43  I never really been a fan of interpreting directly on the source (and before anyone points out I wrote several befunge implementations, let me point out that there is no other sensible way to implement it in that case!)
23:58:10  oh well, ask ais523. I'm not good at explaining.
23:58:55  and I'm about to go home
23:58:55  I wanna write a BF IDE that can both compile and interpret.
23:59:13  I'm getting it together bit by bit by bit.
23:59:42  Well, thanks anyway.

2011-11-07:

00:04:18 -!- BlueProtoman has quit (Ping timeout: 252 seconds).
00:14:46 -!- nooga has quit (Ping timeout: 240 seconds).
00:19:47  Change the game to low score. * In boss levels, you have to catch the apples/bombs/whatever to throw at them. Now, when you catch the object, you earn points. Which means, it is a good idea not to miss! (Becuase of low score game! It doesn't work at all with high score game)
00:20:34  It is:  gopher://zzo38computer.cjb.net:70/0phlog*c_game.game-design-i
00:23:34 -!- ais523 has quit (Ping timeout: 240 seconds).
00:25:17 -!- BlueProtoman has joined.
00:26:31  test
00:26:50  hi
00:27:11  Hi.
00:27:14  Can anyone here help me with my Brainfuck interpreter? I've got most of it down except for loops, which are not so much looped as they are ran once. http://codepad.org/eznPVPyy
00:30:05 -!- tiffany has quit (Quit: nyu~).
00:32:57  not exactly sure what you're doing, but it looks like instead of jumping back to the position in the file where you were, you're setting the character value to the character at that position, and then overwriting it anyway
00:33:14  I'd suggest not interpreting as you read the file, for one
00:33:25  also not using c++, but that's even further beside the point
00:35:22  Hm...let me look into that.
00:35:33  Also, this interpreter is meant to be a learning exercise for me.
00:35:47  If you suggest not interpreting as I read the file, then what should I do instead?
00:36:23  Answer quickly, I'm at my bus stop.]
00:36:28  you could parse it in some way.  the easiest thing to do would be to store the contents in an array or something.
00:36:40  Like a string?
00:36:41  or you could do some more structured thing
00:36:46  How?
00:36:59  structures for loops etc.
00:37:04  I know how to use stringstream, so putting the program in a string would be easy...
00:37:12  Structures for loops.  Don't follow, sorry
00:37:15  uhhhhh
00:37:29  do you know what an abstract syntax tree is? it would be good if you could parse to one of those
00:37:31  (I'm fairly new to C++)
00:37:34  No, sorry.
00:37:41  Gotta go!
00:37:46  this isn't a c++ matter; it's a programming language implementation matter
00:37:47  oh, bye
00:38:22  if you're still around, I'd suggest learning some compiler theory or whatever it's called
00:38:35  you could use your brainfuck interpreter as an exercise
00:39:39  monqy, doubtful he know what an AST is. I said "tree" before and that lost him.-
00:39:41  s/-//
00:39:43  so eh...
00:39:55  oh
00:40:42  well then learning some data structures or whatever first would also be a good idea.  if he's new enough we might be able to drag him to a better language too?? who knows.  is anyone here experienced with this
00:41:02  I suck at pedagogics
00:41:07  anyway I need to sleep
00:41:09  night →
00:41:58 -!- BlueProtoman has quit (Ping timeout: 240 seconds).
00:48:27  data structures are useful for learning how to structure data I've found.
00:49:04  monqy: wait, AST for a brainfuck program?
00:49:06  uh......
00:49:10  CakeProphet: yes!!!!
00:49:10  I think that's called a linked list.
00:49:16  uhhh
00:49:19  are you sure
00:49:23  because
00:49:25  well, I guess for the loops actually...
00:49:28  yes
00:49:28  that would not be a bad idea.
00:49:33  it's for the looops
00:49:39  but I would just use a stack. which is... equivalent
00:49:41  so, okay.
00:49:55  pfft, stacks are for uncool people
00:50:03  stacks are the best data structure.
00:51:50  another good way to do things is compile the brainfuck to C (really easy) and JIT it up (yes!!!)
00:53:11  really easy because you don't have to worry about structure; the C parsing handles all of that
00:53:44  serialize the AST as JSON and offload it to a brainfuck server that converts the JSON to a C# structure which is then used to JIT to Python that outputs Perl which is then compressed and sent back to the client.
00:54:31  good but that requires getting an ast
00:54:43  for brainfuck, I mean
00:54:50  assumign that's what you meant
00:58:59  yes.
00:59:30  oh and the server uses ASP.NET to generate the XHTML response
00:59:34  which is
00:59:49  a single script tag whose javascript outputs the Perl
01:06:22 -!- CakeProphet has changed nick to Alissy.
01:06:36 -!- Alissy has changed nick to Alissy_.
01:07:03 -!- Alissy_ has changed nick to Kallisti.
01:07:06 -!- Kallisti has changed nick to CakeProphet.
01:29:17 -!- derrik has quit (Quit: fried brain, anyone?).
01:53:58 -!- Vorpal has quit (Ping timeout: 240 seconds).
02:15:01  I made a Prelude.Golf module for Haskell.
02:16:12  It includes many instances which do not follow the laws at all.
02:17:42  I also want to include a regular expression parser in  instance IsString (String -> [String])
02:20:26 -!- BlueProtoman has joined.
02:21:23 -!- BlueProtoman has left.
02:21:45  Actually I meant  instance IsString (String -> [[String]])
02:26:39  zzo38: I think this is a beautiful addition to the language.
02:27:29  CakeProphet: It is designed for use with code golf. But a regular expression parser would still be a good idea in general, I think.
03:00:42  elliott (not online; or anyone else who remembers): What was that Cygwin installer that doesn't suck like the Cygwin setup.exe?
03:15:56  Don't recall, but I can guess it's called tar.
03:18:43  @src IsString
03:18:43  Source not found. My pet ferret can type better than you!
03:55:20  Madoka-Kaname: class IsString t where { fromString :: String -> t; }
03:55:29  It is used with OverloadedStrings extension
04:03:35 -!- MDude has joined.
04:31:19 -!- olsner has quit (Read error: Operation timed out).
04:33:18 -!- olsner has joined.
05:08:45 -!- oerjan has joined.
05:23:43 -!- GreaseMonkey has joined.
06:03:37 -!- MDude has changed nick to MSleep.
06:11:11 -!- Darth_Cliche has quit (Quit: You are now graced with my absence.).
06:14:31  Too bad, Wikipedia does not have article about "Yomi (card game)"
06:15:27  EBook readers are not at all about "green". Nor are they about convenience.
06:21:18  Ebook readers may have some of those properties. But, to be sure, the primary draw for publishers is taking away niceties that real books have, like actual ownership.
06:23:26  in the future, authors will be able to kill off characters they didnt like long after the book was published
06:23:32  whoa
06:23:50  people might actually pay more for a book that constantly changes...
06:24:11  George Lucas is a pioneer in the field.
06:25:06  true. like that time he edited dinosaur pictures into all my masturbation memories. all my special memories are special editions!
06:26:02  on a related note, three new smbcs tonight
06:27:20  For more notes about ebook readers not about "green", these are comments some people have posted about it:   "tax on books, amazon censorship"   "Why would I want 600 books to read during a week's holiday, a glorified calculator to lug around, a power supply, a continental adaptor and an air of superiority, when I can select one piddlin' book to pack for my ultimate "travel light" experience"
06:28:30  *Three*?
06:29:10  paper books are better for the environment. you dont have to keep putting energy in them and they are completely biodegradable
06:32:12  quintopia: Yes, that too.
06:37:12  But I still don't like to waste paper; I avoid wasting paper by reusing the paper that someone has thrown into the recycling for writing a note by hand, reducing the margins/font size when printing by computer, using double-sided, etc
06:37:57 -!- nooga has joined.
06:39:12  Even reducing margins or font sizes a little bit can reduce the number of pages of a book.
06:52:14  And a traditional point is slightly smaller than a DTP point (in TeX, DTP points are called "big points").
07:29:28 -!- derrik has joined.
07:47:05 -!- CakeProphet has quit (Ping timeout: 248 seconds).
07:49:00 -!- CakeProphet has joined.
07:49:00 -!- CakeProphet has quit (Changing host).
07:49:00 -!- CakeProphet has joined.
09:05:16 -!- oerjan has quit (Quit: leaving).
09:25:59  I invented a chess variant called "Three Universes Chess" where you need three colors of ink to write the move notations.
09:33:42  My name (Black) comes near first of alphabetical order; and that is actually the reason why my father did that!!
09:33:46 -!- zzo38 has quit (Remote host closed the connection).
09:55:16 -!- ais523 has joined.
09:59:15 -!- Vorpal has joined.
10:08:57 -!- derrik has quit (Quit: i hear you).
10:13:25 -!- monqy has quit (Quit: hello).
10:23:21 -!- ais523_ has joined.
10:25:14 -!- ais523 has quit (Disconnected by services).
10:25:15 -!- ais523_ has changed nick to ais523.
10:26:02 -!- copumpkin has quit (Ping timeout: 256 seconds).
10:26:27 -!- copumpkin has joined.
10:41:10  @let morse_table=M.fromList[('a',".-"),('b',"-..."),('c',"-.-."),('d',"-.."),('e',"."),('f',"..-."),('g',"--."),('h',"...."),('i',".."),('j',".---"),('k',"-.-"),('l',".-.."),('m',"--"),('n',"-."),('o',"---"),('p',".--."),('q',"--.-"),('r',".-."),('s',"..."),('t',"-"),('u',"..-"),('v',"...-"),('w',".--"),('x',"-..-"),('y',"-.--"),('z',"--..")]
10:41:11   Defined.
10:41:41  @let morse = unwords . concatMap (maybeToList.(`M.lookup` m).toLower)
10:41:41   :8:53:
10:41:42       Couldn't match expected type `M.Map k String'
10:41:42             ...
10:41:55  @let morse = unwords . concatMap (maybeToList.(`M.lookup` morse_table).toLower)
10:41:56   Defined.
10:42:05  > morse "Hello, World!"
10:42:07    ".... . .-.. .-.. --- .-- --- .-. .-.. -.."
10:43:38  I've seen people "transliterate" morse by using / for the (longer) interword gaps.
10:45:05  (So you could consider having a (' ', "/") in there.)
10:46:46  I think space conveys spaces effectively. >_>
10:48:52  But you're not differentiating between the gaps between letters and gaps between words there.
10:49:01  Which have a different length.
10:51:05  From ".... . .-.. .-.. --- .-- --- .-. .-.. -.." it's impossible to say whether you were saying "Hello, World!" or "Hell, ow... or ld?"
10:53:29  (It's a three-unit -- dash-length -- gap between letters, but a seven-unit gap between words.)
10:57:00 -!- ais523 has quit (Remote host closed the connection).
11:04:48 -!- ecntrk has joined.
11:04:50 -!- GreaseMonkey has quit (Quit: The Other Game).
11:12:07 -!- ecntrk has quit (Quit: Page closed).
11:19:44 -!- ais523 has joined.
11:33:59 -!- Zuu has quit (*.net *.split).
11:34:01 -!- augur has quit (*.net *.split).
11:34:02 -!- atehwa has quit (*.net *.split).
11:34:04 -!- EgoBot has quit (*.net *.split).
11:34:04 -!- shachaf has quit (*.net *.split).
11:34:05 -!- Deewiant has quit (*.net *.split).
11:34:05 -!- fungot has quit (*.net *.split).
11:34:05 -!- fizzie has quit (*.net *.split).
11:34:37 -!- EgoBot has joined.
11:35:13 -!- nooga has quit (Quit: Lost terminal).
11:37:52 -!- atehwa has joined.
11:38:39 -!- Deewiant has joined.
11:40:21 -!- ais523 has quit (Ping timeout: 255 seconds).
11:40:43 -!- augur has joined.
11:40:57 -!- ais523 has joined.
11:41:51 -!- Zuu has joined.
11:41:52 -!- Zuu has quit (Changing host).
11:41:52 -!- Zuu has joined.
11:43:30 -!- shachaf has joined.
11:43:54 -!- fizzie has joined.
11:57:53 -!- ais523_ has joined.
11:58:04 -!- ais523 has quit (Disconnected by services).
11:58:05 -!- ais523_ has changed nick to ais523.
12:08:57 -!- ais523 has quit (Ping timeout: 248 seconds).
12:10:26 -!- ais523 has joined.
12:28:41 -!- kmc has quit (Ping timeout: 248 seconds).
12:31:01 -!- ais523 has quit (Read error: Operation timed out).
12:33:55 -!- ais523 has joined.
12:38:21 -!- kmc has joined.
12:38:49 -!- derrik has joined.
12:46:16 -!- augur has quit (Remote host closed the connection).
12:58:36 -!- sllide has joined.
13:05:25 -!- boily has joined.
13:06:06 -!- ais523 has quit (Ping timeout: 240 seconds).
13:15:20 -!- augur has joined.
13:17:17 -!- ais523 has joined.
13:45:38 -!- derrik has quit (Ping timeout: 252 seconds).
13:46:15 -!- ais523_ has joined.
13:49:31 -!- derrik has joined.
13:50:56 -!- tiffany has joined.
13:53:20 -!- derrik_ has joined.
13:53:27 -!- derrik has quit (Read error: Connection reset by peer).
13:53:31 -!- derrik_ has left.
13:53:59 -!- derrik has joined.
13:54:07 -!- derrik has left.
13:54:44 -!- derrik has joined.
13:57:22 -!- ais523 has quit (Ping timeout: 260 seconds).
14:04:28 -!- sebbu2 has joined.
14:04:29 -!- sebbu2 has quit (Changing host).
14:04:29 -!- sebbu2 has joined.
14:06:39 -!- sebbu has quit (Ping timeout: 258 seconds).
14:11:23 -!- MDude has joined.
14:11:43 -!- sebbu2 has quit (*.net *.split).
14:11:45 -!- fizzie has quit (*.net *.split).
14:11:46 -!- olsner has quit (*.net *.split).
14:11:47 -!- variable has quit (*.net *.split).
14:11:48 -!- mycroftiv has quit (*.net *.split).
14:11:53 -!- sebbu2 has joined.
14:11:53 -!- sebbu2 has quit (Changing host).
14:11:54 -!- sebbu2 has joined.
14:13:05 -!- shachaf has quit (Read error: Connection reset by peer).
14:14:05 -!- derrik_ has joined.
14:14:06 -!- derrik has quit (Read error: Connection reset by peer).
14:14:24 -!- kmc has quit (Ping timeout: 240 seconds).
14:14:25 -!- MSleep has quit (Ping timeout: 240 seconds).
14:14:25 -!- Nisstyre has quit (Ping timeout: 240 seconds).
14:14:27 -!- shachaf_ has joined.
14:14:43 -!- atehwa has quit (Ping timeout: 255 seconds).
14:14:48 -!- olsner has joined.
14:14:49 -!- boily has quit (Ping timeout: 248 seconds).
14:15:04 -!- fizzie has joined.
14:15:12 -!- boily has joined.
14:16:31 -!- Nisstyre has joined.
14:18:13 -!- variable has joined.
14:18:13 -!- mycroftiv has joined.
14:18:16 -!- kmc has joined.
14:19:50 -!- atehwa has joined.
14:20:27 -!- derrik_ has quit (Quit: Reconnecting…).
14:20:44 -!- derrik has joined.
14:27:14 -!- pumpkin has joined.
14:31:12 -!- copumpkin has quit (Ping timeout: 260 seconds).
14:58:11 -!- yorick has quit (Remote host closed the connection).
14:58:33 -!- Vorpal has quit (Ping timeout: 248 seconds).
14:58:55 -!- yorick has joined.
15:12:15 -!- pumpkin has quit (Quit: Computer has gone to sleep.).
15:12:50 -!- elliott has joined.
15:16:09  `addquote  No you can't fight crime in Glasgow.   It's like trying to get rid of the space-time continuum.
15:16:15  710)  No you can't fight crime in Glasgow.   It's like trying to get rid of the space-time continuum.
15:18:14  22:06:17:  arch has two major issues for me: multilib support is crappy. No split debug info. Still. There is work being done on the latter though.
15:18:29  Don't Arch's libs include the debug info
15:19:05  22:06:48:  What's wrong with the multilib support
15:19:06  Deewiant: It's an ugly special-case hack solution and only covers a small percentage of all the library packages in the repo?
15:19:52  22:11:32:  Do any of the BayHac2011 Haskell programs exist?
15:19:56  No, they're all fake
15:20:23  22:43:28:  hm based on http://www.etalabs.net/compare_libcs.html it still looks like eglibc is a better bet for most desktop systems. It is only worse than musl in a few cases, but has so much better support for lots of features.
15:20:44  @tell Vorpal Nobody uses any of the stuff musl doesn't have except for C++ crap
15:20:44  Consider it noted.
15:21:50  @tell Vorpal Once it works with C++ and has configurable locale support it'll work with the vast majority of programs (it has locale support, just not configurable locales yet)
15:21:50  Consider it noted.
15:23:34  23:56:38:  personally I would parse it into a tree then exeute the tree.
15:23:41  Preparsing is probably slower for BF
15:24:03  You have to load all the code in first though of course
15:25:09  03:00:42:  elliott (not online; or anyone else who remembers): What was that Cygwin installer that doesn't suck like the Cygwin setup.exe?
15:25:14  Gregor: Don't recall, try `pastelogs
15:25:23  Gregor: I suggest using a non-Cygwin solution :P
15:28:40  thing I just discovered and am worried at: the internals of Sun's implementations for listeners work by using an Object[], which stores, alternately, Class objects representing what type the listeners were supposed to have when they were added (e.g. ActionListener.class), and the listeners themselves
15:29:00  that's just making a mockery of the type system, really
15:29:16  presumably, they /should/ have created an class ListenerWithClass, and made an array of those
15:30:08  :D
15:30:17  ais523_: java's typesystem makes a mockery of itself
15:30:22  ais523_: at least ever since generics
15:30:40  the generics impl isn't blatantly stupid, though
15:30:47  it has many faults, but it's not indefensible
15:31:18  ais523_: "what are covariance and contravariance" --Java's generics system
15:31:42  it, umm, sort-of handles those
15:31:46  at least, it has syntax to do so
15:31:54  Collection
15:31:57  ais523_: which is why you can cast a list of cats to a list of animals and then add an element?
15:32:00  Collection
15:32:11  /without/ any unsafe casts?
15:32:16  elliott: it doesn't enforce it across casts
15:32:35  arguably it should; I don't think it trusts its developers to declare the variances correctly so it ignores them
15:32:46  ais523_: I think it actually /runtime errors/ when you add that element
15:32:48  but at least it has syntactic support for them!
15:32:59  and no, I'm not talking about anything with ?s
15:33:02  I'm talking about a plain List
15:33:11  you can pass it, without casting, to a method expecting List
15:33:18  and that method can, as it should rightfully be able to, add a tortoise to it
15:33:25  java's type system is completely broken
15:35:42 -!- copumpkin has joined.
15:39:27 -!- aloril has quit (Ping timeout: 252 seconds).
15:42:24  well, it's not as broken as, say, Dart's
15:42:46  hmm, what's wrong with Dart's, I thought it was basically Java's
15:42:48  I mean
15:42:52  what's additionally wrong
15:43:20  it's checked only at runtime
15:43:32  ais523_: that's an implementation detail
15:43:44  no it isn't, it's detectable from within code
15:43:58  e.g. you can pass objects round as variants a bunch, and then eventually use them
15:44:09  ais523_: only if that's defined behaviour
15:44:09  in a way that's unsafe a small percentage of the time based on an RNG
15:44:17  show me where the language is defined to be runtime-checked?
15:44:21  elliott: it is; Dart's typing is explicitly optional
15:44:28  hmm, alright then
15:45:17  what's your opinion on instanceof (the operator)?
15:45:29  breaks parametricity
15:45:46  possibly an unhelpful statement as iirc you didn't know what that was last time i mentioned it :P
15:46:58  ais523_: so, "I don't like it"
15:47:03  I'm not very good with words that are the same as other words except for the endings
15:47:15  I'm trying to figure out if it's inherently broken, and suspect it is, but am unsure why
15:48:39  meanwhile, I'm busy pondering whether I should try to translate Anarchy to OCaml more or less directly, or try to be cleverer
15:48:52  the thing about Anarchy is that it isn't pure, but doesn't seem fully impure either
15:48:58  and I'm having trouble trying to work out what exactly it is
15:48:59  ais523_: it's broken because
15:49:03  id :: a -> a
15:49:29  isn't necessarily _|_, the identity function, or const _|_, or `seq` _|_
15:49:36  (bottoms sure do mess with a language)
15:50:04  but seriously though, it completely breaks parametricity, and that's all you need to know to realise it's completely broken
15:50:18  heh, that reminds me of how awkward it is to write an infinite loop in Anarchy
15:50:25  you can only do it by creating a data structure while you're iterating over it, in such a way that the iteration never finishes
15:51:25  actually, wait
15:51:30  `seq` _|_ is just const _|_
15:51:31 -!- aloril has joined.
15:51:32  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: seq`: not found
15:51:33  so that simplifies things
15:51:50  hmm, that probably means that Anarchy always terminates on a real computer, as it'd run out of memory if an infinite loop ran long enough
15:52:13  ais523_: not if you have GC
15:52:21  you can iterate through [0..] in constant space
15:52:36  right; but the structure so far, AFAICT, would always be referenced
15:52:53  hmm, although a replacement of _ would probably be optimized out to not remember the original
15:53:50  (that is, if I write what would be "a = f(List.tl (a@[1]))" in OCaml, the compiler should be sensible enough to discard the old value of a meanwhile)
15:54:12  mutable references generally don't reference values they're not currently set to
15:54:35  well, this isn't a :=, just an =
15:54:54  it's inventing a new variable called a, driving the old one out of scope in the process
15:55:16  ais523_: oh, let as opposed to letrec + shadowing
15:55:29  pretty much
15:55:32  let me be the first to say, ew
15:55:37  letrec gets involved eventually, which is where the loop comes from
15:55:54  I think you're ew-ing at the wrong thing, there
15:55:59  as I was trying to come up with an analogy
15:56:02  ais523_: but I bet you couldn't letrec a = f(List.tl (a@[1])) :-)
15:56:26  elliott: don't you mean letrec f a = f(List.tl (a@[1]))?
15:56:36  actually, I'm trying to figure out what that does mentally atm
15:56:43  I think it's just an infinite loop
15:56:46  ais523_: nope, I don't
15:56:50  that's the point :)
15:57:01  right
15:57:09  oh, I see
15:57:36  incidentally, is it usual to write mutual recursions in OCaml that span many pages?
15:57:51  it feels a bit weird having to go and...and...and in order to keep the mutual recursion going
15:57:59  ais523_: actually, I'm not sure my letrec a would work, assuming @[n] is an array access operator
15:58:08  @ is list append
15:58:10  like ++ in Haskell
15:58:10  arrays are generally not lazy in their structure...
15:58:14  ais523_: oh, that'd work fine then
15:58:23  array access is .(n)
15:58:26  in a language which supported it, I mean
15:59:33 -!- pumpkin has joined.
15:59:33  > :t \a f -> f(tail ((a+f)++[1]))
15:59:34    : parse error on input `:'
15:59:37  :t \a f -> f(tail ((a+f)++[1]))
15:59:38      Couldn't match expected type `[t1] -> t'
15:59:38             against inferred type `[t1]'
15:59:38      In the expression: f (tail ((a + f) ++ [1]))
15:59:48  :t \a f -> f(tail ((a f)++[1]))
15:59:49  forall t t1. (Num t) => (([t] -> t1) -> [t]) -> ([t] -> t1) -> t1
15:59:52  that's what I meant
16:00:05  I'm not convinced it's a /useful/ expression, though ;)
16:00:16  that's definitely wrong
16:00:17  (a f)?
16:00:30  :t let a = f (tail (a ++ [1])) in a
16:00:31  forall t. (SimpleReflect.FromExpr [t], Num t) => [t]
16:00:35  :t let a = ?f (tail (a ++ [1])) in a
16:00:36  forall t. (Num t, ?f::[t] -> [t]) => [t]
16:00:49 -!- copumpkin has quit (Ping timeout: 258 seconds).
16:01:00  > let f = (0:); a = f (tail (a ++ [1])) in a
16:01:03    mueval-core: Time limit exceeded
16:01:09  hmm
16:01:16  oh
16:01:23  > let f xs = 0 : 2 : xs; a = f (tail (a ++ [1])) in a
16:01:24    [0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,...
16:01:28  ais523_: useful!
16:02:01  elliott: I was parametrizing a on f
16:02:05  because I didn't know what f was
16:02:19  and, hmm, is there any way to make the 1 come up at all?
16:02:24  ais523_: it was definitely wrong, sorry
16:02:29  (a f) was completely wrong
16:02:34  a doesn't even end up a list there
16:02:39  elliott: but (a f) does
16:02:42  I was defining (a f)
16:02:47  no you weren't
16:02:47  not a
16:02:52  to be what I called a earlier
16:02:55  oh
16:02:58  you should learn to use fix...
16:03:19   and, hmm, is there any way to make the 1 come up at all?
16:03:20  possibly
16:03:25  > let f xs = 0 : 2 : init xs; a = f (tail (a ++ [1])) in a
16:03:28    mueval-core: Time limit exceeded
16:03:37  > let f = const [1]; a = f (tail (a ++ [1])) in a
16:03:38    [1]
16:03:39  ais523_: there we go
16:03:45  that's not the same [1]
16:03:52  I mean, the one in the definition of a
16:04:06  hmm, the trick is to make a a finite list
16:04:24  which is quite hard
16:04:33  because it needs to have a certain number of elements added by f
16:04:39  and f is fixed
16:05:19  what's Haskell's equivalent of OCaml's "match", and the syntax?
16:05:23  my Haskell is really rusty
16:05:35  (I know how to do it with a sequence of definitions, but not in a let)
16:05:54 -!- Phantom_Hoover has joined.
16:06:05  ais523_: let Just x = y
16:06:10  but the equivalent of match is case
16:06:18  also, was your Haskell /ever/ not rusty? :P
16:06:27  sometimes it's rustier than other times
16:06:55  s|/ever/ not|ever /not|
16:06:56  argh
16:07:00  s|/not|/not/|
16:07:16  > let f xs = case xs of _:_:_ -> [0] : _ -> xs; a = f (tail (a ++ [1])) in a
16:07:17    : parse error on input `->'
16:07:31  > let f xs = case xs of _:_:_ = [0] | _ = xs; a = f (tail (a ++ [1])) in a
16:07:32    : parse error on input `='
16:07:43  err, can you fix my syntax?
16:07:45  I don't think it works anyway
16:07:47  yes, give me a minute
16:08:03  hmm, I was trying to think of a way to stop people using a piece of software posted on reddit without having to respond to its author/submitter
16:08:08  then I realised that's what downvotes are for!
16:08:26  > let f xs = case xs of _:_:_ -> [0]; _ -> xs; a = f (tail (a ++ [1])) in a
16:08:27    : parse error on input `='
16:08:31  I'm not certain I've downvoted anything ever
16:08:33  wtf?
16:08:45  ais523_: wait, why are you even using case there?
16:08:46  that's a weird place for the parse error
16:08:48  just use pattern matching
16:08:56  elliott: giving two different definitions for f?
16:08:58  > let f (_:_:_) = [0]; f _ = xs; a = f (tail (a ++ [1])) in a
16:08:59    Not in scope: `xs'
16:09:03  ais523_: no, giving two clauses for f
16:09:08  > let f (_:_:_) = [0]; f xs = xs; a = f (tail (a ++ [1])) in a
16:09:09  > let f (_:_:_) = [0]; f xs = xs; a = f (tail (a ++ [1])) in a
16:09:11    mueval-core: Time limit exceeded
16:09:13  I know that'll fail
16:09:13    mueval-core: Time limit exceeded
16:09:17  right
16:09:18  because f pattern-matches on it before adding anything to it
16:11:35  gah, why does the terminal here need an explicit kill -WINCH $$ in order to wrap properly after resizing it?
16:11:53  ais523_: ssh?
16:11:56  or similar?
16:17:33  local
16:17:42  ais523_: which terminal?
16:17:57  gnome-terminal on Scientific Linux
16:18:19  it's not sending bash SIGWINCH properly, for whatever reason
16:18:50 -!- ais523_ has quit (Quit: Page closed).
16:18:57  first question, why are you us-
16:18:59  okay
16:20:11  elliott: I'm not a huge fan of Cygwin, but I must admit it made it super-easy to turn Windows into an SSH-able server that only very slightly has the bitter taste of Windows.
16:20:46  Gregor: The POSIX subsystem is sooo much nicer and has none of the bitter taste of Windows at all, but unfortunately they're dropping support in Windows 8
16:21:04  Gregor: And admittedly only Gentoo offer a viable distribution for it... but it's really polished :P
16:21:26  Sux2b Gentoo, since it'll vanish in Windows 8 :P
16:22:21  Gregor: I'm not sure Windows 8 will get much adoption from the kind of people who use the POSIX subsystem
16:23:45 -!- ais523 has joined.
16:23:55  ais523: first question, why are you using Scientific Linux :P
16:24:01  not through choice
16:24:11  it's the Linux distro installed in the computer labs where we do marking
16:25:18  elliott: Soooooooo in other words, Cygwin is it.
16:25:20  Got it.
16:25:35  Gregor: I'd just use the Gentoo installer *shrugs*
16:25:44  Gregor: One advantage is that the resulting environment is thousands of times faster than Cygwin :P
16:25:50  Scientific Linux reminds me of the Scientific People in The Stars My Destination.
16:26:04  Gregor: Also for all the things I don't like about Emerge, being worse than Cygwin's installer isn't one of them :P
16:27:06  's hard to argue with that ... and it's a good environment for compiling things w/ MingW?
16:27:13  Oh, and it comes with an SSH server?
16:27:21  (That works)
16:27:56  Gregor: Well, it can run Windows programs, but there's not as much integration as Cygwin; I'm pretty sure you could get Makefiles working; and I'm pretty sure it does, but you could just install OpenSSH from the repos if not
16:28:07  http://distfiles.gentoo.org/experimental/prefix/x86-interix/current/, FWIW, since it's impossible to find
16:28:09  The PDF is very helpful
16:28:40  The installer installs the subsystem etc. for you; it's a pretty big iso, but *shrug*
16:28:44  Yeah, it does SSH
16:28:47  Hm
16:28:53  3.1 SSH Daemon
16:28:54  Gentoo Prex
16:28:54  comes with an SSH daemon, which automatically starts at boot
16:28:54  time. If you don't want the SSH daemon to start automatically, remove the les
16:28:54  /etc/rc2.d/S32sshd and /etc/rc2.d/K68sshd.
16:28:54  To manually start the SSH
16:28:56  daemon, run /etc/init.d/sshd start.
16:28:58  Wow, pro copying
16:29:32 -!- pumpkin has changed nick to copumpkin.
16:29:52  The tradeoff is pretty much: POSIX subsystem: Actually feels like proper UNIX, ten times faster, toolchain isn't godawful; Cygwin: Bit better integration for running Windows stuff with it, not as large a download
16:29:59 -!- Ngevd has joined.
16:30:31  "In the current Release, an experimental build of XFCE4 is included with the
16:30:31  DVD image."
16:30:36  Gregor: I guess that explains why it's 3 gigs :P
16:30:42  lolwut
16:31:10  But I really need "integration for running Windows stuff with it", I really just use the environment as a shell for building things with MingW.
16:31:27  Gregor: I didn't say it can't run Windows stuff.
16:31:32  I'm just saying there's no cygpath or anything.
16:32:21 * Gregor starts the download.
16:32:26  Speed is important :P
16:32:26  Gregor: You could install a MinGW cross-compiler from inside it :P ... but seriously, it will probably run MinGW just fine.
16:32:53  Having a cross-compiler is fine, even preferable, the question is just when I make foo.exe, can I run that and have its output go to the right place.
16:32:58  Gregor: Yeah, the main advantage is that ./configure doesn't take minutes to run.
16:33:11  elliott: it does sometimes!
16:33:14  Because the fork() is implemented at the NT layer, not on top of Win32 :P
16:33:25  ais523: Do you have any idea what the context is...?
16:33:29  oh, you're talking about optimisations to make configure run faster
16:33:29  ./configure /always/ takes minutes on Cygwin
16:33:33  No.
16:33:33  not the general speed of configure itself
16:33:39  That is not what we are talking about at all.
16:33:44  I was about to say that configure always takes minutes on cygwin as an example
16:33:48  then I noticed it was the context
16:33:49  heh
16:33:55  so you're talking about making configure run faster on Windows
16:33:58  by not using cygwin
16:34:10  Well, I'm naming a reason the POSIX subsystem is much nicer :P
16:34:56 -!- Zuu has quit (Ping timeout: 258 seconds).
16:34:58  Gregor: You should see the "stock" POSIX subsystem tools, the ones Microsoft ships... they're completely awful
16:35:05  Gregor: It uses some ancient version of ksh
16:35:19  Wait, Interix has an efficient fork?
16:35:26  Deewiant: More efficient than Cygwin's
16:35:40  I think NT can perfectly support a fork()y process model, just Win32 can't
16:35:56  Why not
16:36:04  Because it doesn't offer fork()
16:36:12  Cygwin just spawns the process and fucks around to make it jmp to the right place
16:36:17  Exactly, why doesn't it
16:36:21  s/the process/a new process running the same stuff/
16:36:24  Because Windows.
16:36:26  If it can be done well in Interix
16:36:26  Deewiant: Because Microsoft don't care about fork()?
16:36:30  Firk ding blast
16:36:34  Firk ding blast
16:36:42  (What?)
16:37:10  Oh.
16:37:13  That took ages to parse :P
16:37:30  Deewiant: But yeah, Windows has been all about the threads since approximately forever.
16:37:38  I'm well aware of that
16:37:51  Deewiant: Well, Win32 was basically /ported/ to NT
16:38:03  So whatever limitations its process model has will exist in the NT port too
16:38:18  Hmm, that's true I suppose
16:39:33  Deewiant: I mean, obviously the bits that NT replaces might make things more flexible, but I doubt the actual process model changed much beyond getting more layers, because WIn32's API is based around it
16:40:11  Deewiant: OR, efficient COW fork() would be totally possible for Microsoft to offer, and they just don't care. It might even be a lock-in thing to stop people writing overly-portable programs.
16:41:50  Gregor: Man, why isn't all open source documentation this good...
16:41:56  (Reading the Gentoo Prefix/Win32 PDF :P)
16:42:02  Because of people like me.
16:42:03  That's why.
16:42:39  Ah.
16:47:33  Gregor: BTW, ISTR that the subsystem in Vista onwards is better than the one in XP, but I used Gentoo Prefix fine on XP so YMMV
16:56:01 -!- monqy has joined.
16:58:33 -!- ais523 has quit (Remote host closed the connection).
17:07:51 -!- ive has joined.
17:17:03  Gregor: say, is hackiki.org supposed to be broken?
17:20:17  First release of Kansas Lava (ittc.ku.edu)
17:20:18  NOT MORE OF THEM
17:27:07  tswett: FFFFFFFFFFFFFFFUUUUUUUUUUUUU
17:27:43 -!- shachaf_ has changed nick to shachaf.
17:27:51  I was into Kansas Lava before it was cool.
17:28:19  # ls -l bin/su
17:28:19  -rw------- 1 root root 33112 Dec  6  2009 bin/su dafuq
17:28:42  What does the 'dafuq' mean?
17:28:43  Did hackiki get pwned?
17:29:46  Gregor: Hahahahahahahaahaha
17:29:47  We should never have let newsham stay.
17:31:04  Gregor: So what's in bin/su
17:31:23  elliott: Idonno, but its modes are wrong and I don't think I have a canonical to compare it against.
17:31:35  Gregor: Surely you can just get a canonical one from Debian
17:31:41  Gregor: I'd check logfiles :P
17:31:43  Oh duh :P
17:32:15  Check the audit tables!
17:34:33  Not pwned, just the wrong modes.
17:34:34  wtf.
17:34:46  Gregor: They pwned HackEgo JUST to fuck with the modes.
17:35:00  # ls -l bin | grep -v '^...x'
17:35:00  total 4420
17:35:00  -rw------- 1 root root  66152 Apr 29  2008 mount
17:35:00  -rw------- 1 root root  33528 Jul 25  2010 ping
17:35:00  -rw------- 1 root root  28944 Jul 25  2010 ping6
17:35:00  -rw------- 1 root root  33112 Dec  6  2009 su
17:35:01  Gregor: But srsly, if things are wrong then it could have just been mode-changed as part of a greater pwnering :P
17:35:02  -rw------- 1 root root  46040 Apr 29  2008 umount
17:35:05  elliott: *Hackiki
17:35:08  ...yeaaaaaaah.
17:35:10  Is Whenever Turing-complete?
17:35:24  Ngevd: I think so
17:35:30  you basically emulate serial execution
17:35:37  Are HackEgo and Hackiki connected?
17:35:41  That means nothing to me
17:35:56  [BDarn this connection that makes me ask questions thirty seconds after they've been answered.
17:36:45  How does irssi even *suspect* that I've typed in an escape character followed by [B?
17:37:16   How does irssi even *suspect* that I've typed in an escape character followed by [B?
17:37:18  tswett: cursor chars
17:37:22  the connection is too laggy
17:37:27  and the timeout happened before the [ came in after the esc
17:37:49  So the esc came in and then it was a long time before the [ came in?
17:38:22  tswett: Where a long term means more than like 50 ms
17:38:26  s/term/time/
17:38:53  Surely if I press the escape key, wait a moment, and type [B, the same thing out to happen.
17:38:59  Yes.
17:39:21  But it doesn't.
17:39:27  s/out/ought/
17:39:56  *shrug*
17:40:11  Perhaps my terminal is holding the escape character in escrow before sending it out.
17:40:47  My logging is insufficient to figure out how this happened :P
17:41:23  Gregor: I'm so glad I never used Hackiki right now :P
17:41:31  elliott: Nothing is lost *shrugs*
17:45:30  Whelp.  I now have a database.  I'm so proud.
17:46:00  LOLOLOLDISCOVERY
17:46:04  fdupes effs up modes.
17:46:14 -!- Vorpal has joined.
17:46:15 -!- Vorpal has quit (Changing host).
17:46:15 -!- Vorpal has joined.
17:46:26  It has three tables in it, each with one row!  Granted, two of the tables have only dummy data in them...
17:47:16  tswett: Enjoy your pain
17:47:22  Gregor: Nice
17:47:27  elliott: the pain of... having a database?
17:47:33  tswett: The pain of using one
17:47:36  Ah.
17:48:01  How does the pain of using a SQL database compare to the pain of using Perl?
17:49:55  GOD that's lame.
17:49:57  DAMNED FDUPES
17:50:21  Gregor: I wish I could swear like you.
17:50:40  But tswett lacks the ability to speak
17:51:01  Tragic, really.
17:51:15  Ohwell, luckily I have backups of everything so this won't take TOO long to fix I hope.
17:51:33  ...
17:51:35  }:(
17:52:44 -!- ais523 has joined.
17:53:05  Gregor discovers not to run untrusted code on / :P
17:53:18  elliott: No, I discovered not to trust fdupes :P
17:53:23  Or that
17:53:29  Gregor discovers not to trust by default :P
17:53:34  I needed that disk space! :(
17:53:44  Gregor: Doesn't fdupes use hard links
17:53:45  what happened?
17:53:53  elliott: Yeah.
17:53:53  Gregor: Hard links for anything mutable are an awful terrible idea
17:53:58  elliott: I don't run it over /
17:54:04  elliott: I run it over /bin, /lib and /usr
17:54:06  Gregor: Since tools are completely inconsistent about breaking or not breaking the link :P
17:54:07  Fair enough
17:54:11  But I bet dpkg can break it
17:54:24  Obviously this plan did not fully work out as I had hoped :P
17:54:34 * elliott wouldn't touch anything dpkg manages, anyway.
17:54:42  ais523: Hackiki broke
17:54:46  With hard links, can you have a file with two different sets of permissions and everything?
17:55:04  tswett: Uhh... no.
17:55:06  I think the permissions are hardlinked too
17:55:16  as in, they're on the inode not the directory
17:55:17  Two different paths and nothing else?
17:55:25  two different paths on the same fs
17:55:32  Hard links point to inodes, which contain everything but the name in this context.
17:55:43 -!- derrik has quit (Quit: quitter).
17:55:54 * tswett nods.
17:56:07 -!- CakeProphet has quit (Read error: Operation timed out).
17:58:57 -!- Ngevd has quit (Ping timeout: 258 seconds).
17:59:59  tswett: To answer your original question, HACKIKI WAS NEVER DOWN EVER.
18:00:56  Gregor: YES SIR.
18:01:12  elliott: My backups are so great, looka how fast I fixed that shiiii!
18:01:21  That shiiii is so fixed.
18:01:43  I fixed the shit out of that shit!
18:02:18  Gregor: wait, what happened?
18:02:44  tswett: I ran fdupes, that effed up some modes, but because Hackiki caches I didn't notice until those caches expired.
18:02:44  He fixed a horse race.
18:03:05  Gregor: I see.  So what was the problem that this caused?
18:03:24  tswett: Hackiki's chroot couldn't run anything :P
18:03:35  tswett: Oh, the problem fdupes solved?
18:03:38  tswett: Lack of disk space.
18:03:42  Gregor: huh.  How was it able to continue running when the chroot couldn't run anything?
18:03:53  I mean, I would expect that to cause Hackiki to go down.
18:03:55  Because the httpd is from outside.
18:03:57  tswett: It already was running, and didn't need to run anything new to read a cache.
18:04:02  And/or still running.
18:04:25  Gregor: I see.  So this was mostly a theoretical problem; it didn't cause any actual trouble.
18:04:52  tswett: ...  Gregor: say, is hackiki.org supposed to be broken?
18:05:17  Gregor: well, yes.  I said that because I noticed that Hackiki was running perfectly fine, and I suspected that maybe it was supposed to be broken.
18:05:54  ... I've erased history too well.
18:06:40  Gregor discovers the wonders of communicating with tswett :P
18:06:57 * tswett preens.
18:08:17  Gregor: so, how does this grinworthy software work?  There's a repository, and a sandbox with a copy of the head revision, and programs run in the sandbox, and, if they have write permissions, the sandbox is then committed back to the repository?
18:08:28  Grinworthy is so not a word.
18:08:36  It is extremely a word.
18:08:39  tswett: More or less.
18:09:01  Gregor: Does it use UMLBox yet?
18:09:03  Gregor: truly you have a dizzying intellect.
18:09:09  elliott: Nope :P
18:09:25  elliott: It will ... sooooooooooooooooooooooooooooooooon
18:09:27  Gregor: How does Hackiki prevent injecting arbitrary badHTML, anyway
18:09:34  elliott: It doesn't.
18:09:37  Neat
18:09:39  elliott: Welllllllllll
18:09:44  elliott: To be fair, that's not quite true.
18:09:49  I have heard quite enough :P ...but go on
18:10:06  elliott: Hackiki ITSELF doesn't, however the template Hackiki filesystem only lets you write scripts for the Wiki formatter, which only allows wikisyntax.
18:10:32  But custom formatters is like twenty to ninety percent of the appeal.
18:10:37  elliott: Why is Gentoo Prefix Interix Wtferix 3 giggerixes >_<
18:10:49  Gregor: Doesn't take long to download in a civilised country
18:10:52  Oh god, I was just slightly puzzled by the idea of a function which doesn't map numbers to numbers.
18:10:55  WHAT HAVE I BECOME
18:10:56  Gregor: I think there might be better mirrors you could get it from
18:10:59  elliott: It's downloading at 800KB/s
18:11:05  Shrug
18:11:10  NOT - FAST - ENOUGH
18:11:17  Gregor: It should come in source form :)
18:11:35  Welp, I'm tired of downloading, I'm going with Cygwin cuz it's better lol.
18:11:42 -!- Darth_Cliche has joined.
18:11:49  Gregor: For some values of better lol
18:11:59  (Equal to not)
18:12:42  "1) The idea that any subject is inherently more rigorous/challenging than another is bollocks."
18:12:52  — person in a Guardian comment thread.
18:13:01  Gregor: Anyway, it's probably that big because it also contains the installers for the subsystem itself that it runs automatically *shrug*
18:13:08  That's the price of convenience
18:13:09  I... guess it's not particularly surprising that it's a hotbed of idiocy.
18:13:17  Ohhhh yeah
18:14:26  Hackiki would probably be rather simpler if pages were Lua files rather than arbitrary executables.
18:14:49  Also more terrible
18:14:54  Yep.
18:15:05  Especially since you'd have to use Lua
18:15:20  Speaking of terrible, I'm working on another terrible codenomic.
18:15:23 -!- Ngevd has joined.
18:15:33  Codenomic?
18:15:35  Hello!
18:16:23  I've installed Apache and Postgres and, you know, done stuff.  Next is the actual *stuff* part of the nomic.
18:16:47  Phantom_Hoover: yeah.  Essentially, a computer game whose source code can be changed by the players at runtime.
18:16:56  Ah.
18:17:03  tswett: Two bad software choices!
18:17:07  Good start.
18:17:12  Sounds exceptionally tricky to get right.
18:17:33  I seem to remember someone discussing something like this much earlier....?
18:17:36  Phantom_Hoover: Codenomics have worked perfectly well in the past; PerlNomic was the most prominent and lasted for years and with high activity.
18:17:52 -!- zzo38 has joined.
18:18:31  elliott: thank you.
18:18:34  Oh, it's a wiki-style thing with accessible code?
18:18:41  Phantom_Hoover: more or less, yeah.
18:18:42  Phantom_Hoover: No, it's a game.
18:18:50  Unless you mean Hackiki.
18:19:01  It's like single player Hackiki in a way(?)
18:19:10  elliott: what would you advocate instead of Postgres?  The brilliant DBMS known as "files"?
18:19:10  ???
18:19:15  Ngevd: yes, but with multiple players.
18:19:24  tswett: I'd question why you think you need one, or what you're doing, or anything
18:19:32  Ngevd: also, there's a superuser, and the players can, with consensus, run stuff as the superuser.
18:19:33  It's like multiplayer single-player Hackiki.
18:19:33  Postgres is the best SQL DB though
18:20:09  elliott: I don't believe "lasted for years and with high activity" on PerlNomic
18:20:13  it lasted for years but with very low activity
18:20:17  ais523: Those were separate statements
18:20:20  I have used SQLite but you can use whatever works best for your situation
18:20:24  hmm…
18:20:24  ais523: It had high activity when it was an Agoran officer
18:20:27  That sort of period
18:20:27  `addquote  It's like single player Hackiki in a way(?)    Ngevd: yes, but with multiple players.
18:20:34  711)  It's like single player Hackiki in a way(?)    Ngevd: yes, but with multiple players.
18:20:36  elliott: even higher when it was Slashdotted
18:20:38  ais523: And PerlNomic-related proposals were regularly passing
18:20:41  How did PerlNomic work, normally?
18:20:44  ais523: and yes, but I wasn't around then
18:20:46  elliott, hm, if you want ACID (to disk) but don't particularly want SQL, what options do you have, apart from writing it yourself, which can be rather tricky.
18:20:46  Vorpal: You have 2 new messages. '/msg lambdabot @messages' to read them.
18:20:57  Phantom_Hoover: it was a bunch of cgi scripts, one of which let you add a proposal (a piece of perl code)
18:21:03  Phantom_Hoover: another one let players vote on those proposals
18:21:04  Phantom_Hoover: basically, proposals were Perl scripts, enough votes and it'd be run on the server as root
18:21:06  when one passed, it was executed
18:21:19  and other cgi scripts added through this mechanism added various subgame mechanisms that added to a player's score, etc.
18:21:21  or at least, with enough perms to affect the whole of the nomic
18:21:30  and there were scripts to help write proposals too
18:21:31  ais523: not root :P
18:21:39  root was Normish
18:21:49   elliott said 3h 8s ago: Nobody uses any of the stuff musl doesn't have except for C++ crap <-- cfunge wants some of the C99 math functions, far from all required. Whatever FIXP, FPDP and FPSP requires.
18:22:03  cfunge also wants _posix_poopadvise and uses inline asm
18:22:03  which had similar activity to PerlNomic while it was a player of Agora, but didn't last as long
18:22:05  hm TURT might use sin/cos too
18:22:10  it doesn't have sin/cos?
18:22:17  I think Normish got onto a couple of spam blacklists.  }:P
18:22:18  sin is not C99.
18:22:19  ais523, sinl
18:22:20  long
18:22:27  err long double*
18:22:41  elliott, no longer inline asm, modern gcc actually compiles the intrinsic for it sanely
18:22:46  elliott: I interpreted Vorpal as "C99 functions, also sin and cos"
18:22:52  Vorpal: http://git.etalabs.net/cgi-bin/gitweb.cgi?p=musl;a=blob;f=include/math.h;h=677248287ae99470346db96e5d64926ed12b7645;hb=HEAD
18:23:09  musl?
18:23:15  musl just doesn't have complete C99 math support.
18:23:25  Phantom_Hoover: jfgi
18:23:27  elliott, the only reason I used inline asm was that using the gcc intrinsic produced terrible code in then modern gcc versions
18:23:34  Also wait, people have used GCC inline assembly and come out sane?
18:23:47  gcc inline assembly is easy
18:23:47  Phantom_Hoover, well, people claim I'm sane
18:24:02  Vorpal, no, you're so Vorpid it hurts.
18:24:04  elliott: Why does Windows have to be so terrible?
18:24:11  Gregor: Why are you using Windows
18:24:17  Anyway, it's because you're not using the POSIX subsystem
18:24:37  elliott: I just wanted a "real" Windows machine to not cross-compile on and not test with WINE :P
18:24:38  elliott, I just played the Trine 2 beta. Quite promising I have to say. I look forward to the full version of the game being released.
18:24:41  So, yeah.  What I need to toss into the nomic blender now is... pages.  Stuff that you see when you go to zbasu.net, and which interacts with the database and stuff.
18:24:54  elliott, did you play the first Trine? I forgot
18:24:55  Lemme know when you give up :P
18:25:04  Vorpal: I haven't played any of the Bundle games yet
18:25:05  elliott: on the codenomic thing?
18:25:08  Well
18:25:12  Apart from the ones I have played
18:25:14  tswett: Yep!
18:25:22  Vorpal: Oh, I didn't even get that bundle
18:25:24  elliott, i.e. Voxatron which isn't terribly good.
18:25:24  elliott: I haven't given up on it in the last two years.  }:P
18:25:25  oh
18:25:27  wait dude
18:25:28  you
18:25:29  elliott, okay.
18:25:29  didn't get
18:25:31  spacechem
18:25:46  tswett: It's made this little progress in the last two years?
18:25:50  tswett: Let me know when you give up in fifteen
18:25:53  elliott, Trine is really fun. Don't even bother trying it on intel graphics though
18:26:28   I'm sure robots will become good conversationalists   probably not before they become good barbers, though
18:26:31  Perl has a trusted mode, right?  And it ought to be easy to write web scripts in Perl, and for Perl to access the database... right?
18:27:01  Perl has taints, which are useless.
18:27:04  If that's what you mean.
18:27:07  I have to say I never seen a game with so much bloom as Trine 2 though. Trine 1 had a lot of it too, but even more in Trine 2. Works within the setting though.
18:27:27  hm may be HDR rather than bloom, not sure
18:27:41   tswett: It's made this little progress in the last two years?
18:27:41   tswett: Let me know when you give up in fifteen
18:28:05  Also let me tell you about this amazing ElliottCraft thing, also how it will run on a new thing called @.
18:28:41  Phantom_Hoover: I have never once claimed @ is an actively developed project, and I've already pointed people to the various bugs in other packages Elliottcraft is blocked on *shrugs*
18:28:48  Fix those bugs or quit complaining
18:29:09   What is a good-natured jibe I have not heard of this?
18:29:50  Usually good-natured jibes aren't things you've actively whined about
18:30:06  When have I ever whined about EC or @ development?
18:30:34  lol
18:30:43  elliott: OMG I'm only at 22% downloaded
18:30:47  elliott: WHY ARE YOU DOING THIS TO ME
18:30:59  Gregor: America sux
18:31:21  elliott: GODDDDDDDDDD BLESS AMERRRRRRICAAAAAAAAAAAAAAAAAAAA, LAAAAAAAAAAAAAAND OF PEOPLE WHO PRONOUNCE THEIR ARRRRRRRRRRRRRRRRS!
18:31:31  *cough*
18:32:00  Phantom_Hoover wishes to remind you that Canadians pronounce their r's too
18:34:49  :P
18:34:56  *:R
18:35:19  Touch
18:35:32  *Tourché.
18:36:41  Deewiant: omg great news! I gotta write my own lib, ansi-terminal won't work for the output end of things and I need input support too
18:36:47  ~fuck~yes~
18:38:45  Wow, someone on the IWC forum likes my MSPAFA
18:39:26  Canadians pronounce their R's so hard they pronounce them even when there are no R's!
18:39:35  Vorpal: And sigh, you were right about moving above the top of the screen
18:39:43  Grergror
18:41:26  elliott, is curses at all relevant?
18:41:40  Ngevd: Yes, and unusable for my purposes
18:41:45  Okay
18:42:05  I only pretend to be an even half-way decent programmer
18:42:31  I didn't realize you even pretended BA-DUM TISH
18:44:13  :R
18:48:11  How can I get the width and height of the current X screen from the terminal?
18:52:19  elliott: xrandr I suppose?
18:52:24  Probably a better way.
18:52:26  Gregor: Ahh, thanks
18:52:32  Gregor: Hey, guess what I don't have installed :P
18:52:37  Hyuk
18:52:49  xdpyinfo?
18:53:18  Python 3.2?
18:53:19  Fortran?
18:53:19  Windows Vista?
18:53:29  AT&T Unix System V?
18:53:36  But actually xdpyinfo was a suggestion.
18:55:45  Speaking of xdpyinfo, when I did a fresh install of Debian on my shiny new machine for some reason it thought my DPI was 350, resulting in lolfontsize.
18:56:59  Gregor: Open an rxvt or xterm (xfce terminal won't work, probably not gnome terminal either) and run this Haskell program (no dependencies): http://sprunge.us/WeDa
18:57:02  Trust me, it's worth it :P
18:57:08  Uhh
18:57:13  Warning: Not for epileptics
18:57:19  *whew*, don't have Haskell at work.
18:57:36  Dammit!
18:57:45  You're on x86-64 Linux right? ;D
18:58:06  ... yessssssssssss
18:58:55  Gregor: Dammit, I can't statically link this :P
18:59:07  Muahahahaha
18:59:49  Gregor: But I _CAN_ rewrite it as a Python script!
19:01:34 -!- oerjan has joined.
19:01:52  Hello oerjan
19:02:10  evening all
19:02:13  elliott: On gnome-terminal, the windows gets small, then it grows, shrinks again, and then a lot of strange character sequences (meant as escape codes) appear on the screen, with the window still small.
19:02:20  twice11: Yep :P
19:02:33  That's what happens in Xfce too
19:02:41  It seems to dislike negative numbers.
19:03:50  elliott: Hahaha, I'm making you write Python.
19:04:24  Throw in an abs application on the "let j" line and no escape-spam appears in the window.
19:05:07  twice11: I think negative numbers might be what make it go so haywire on rxvt
19:05:56  Gregor: Python seems to ruin the effect... maybe it's not fast enough :P
19:06:05  Teehee
19:07:21  elliott: On rxvt, the effect does not change with/without abs.
19:07:27  It seems to ignore the sign.
19:07:40  Hmm, weird.
19:08:03  Does it work on your machine too? Dunno if it's just my WM or whatever. i.e. the pseudo-duplicated window effect and the like
19:08:04  And my xterm does nothing.
19:08:26  I get no duplicate window effect.
19:09:08  I get a periodically shrinking/growing and oscillating window with rxvt, no effect with xterm, just grow/shrink with gnome terminal.
19:09:13  Huh
19:09:18  I'm using the xterm codes, so it's weird that it does nothing
19:09:27  Probably a security feature.
19:10:37  Or a non-annoyance feature :P
19:10:37  Yes, security, indeed.
19:10:50  "Allow window ops" in Ctrl-Rightclick.
19:11:06  Can't say I can think of a valid use for them :P
19:11:27  elliott: There is a valid use.
19:11:39  Ooh, I could even spawn more xterms; I'm thinking of something that spews audio to /dev/dsp or whatever, while bar-visualising it using an array of resizing xterms :-D
19:11:53  In the times where "gui, noun: 10 xterms and a background image" was true,
19:11:57  You could combine that with colour codes!
19:12:06  You could position pop-up windows where they belong.
19:12:13  Ha, wow.
19:12:15  Did people actually do that?
19:12:26  i.e. you could make a multi-window application without linking X11.
19:12:26  I thought xmessage was ancient.
19:12:34  Oh, pre-X terminal multiplexing
19:12:49  No, X terminal multiplexing,
19:12:55  Oh, without linking in, right
19:12:56  but without depending on libX11 yourself.
19:13:08  You could just speak the X wire protocol :P
19:13:17  I'm too young to know whether someone used it.
19:13:30  GNOME ignores the position, it just uses the size.
19:15:02  And the reason I get no duplicate window effects or other strange things is most likely that I am using a compositing system.
19:15:48  twice11: Me too (xfwm4 with compositing enabled)
19:15:51  Although no fancy effects.
19:15:54  That's why it was surprising.
19:16:01  I guess my LCD refresh rate is just too low.
19:16:16  I run gnome-shell (gnome 3.0), and the stuff looks really smooth here.
19:16:53  btw: gnome terminal interprets size 0 as "default/original size"
19:17:22  twice11: My condolences re: gnome-shell
19:17:29  Although it's actually Mutter doing the window management duties there.
19:18:55  Is mutter a module of gnome-shell? I don't see a separate window manager process here.
19:19:45  Hmm
19:20:04  In gnome fallback mode, I think there is mutter. And if mutter crashes, you get metacity.
19:20:15  twice11: Maybe you're running COmpiz instead or something, or the executable is called something else
19:20:18  The Mutter window manager can function as standalone window manager application for GNOME-like desktops, and serves as the primary window manager for the GNOME Shell desktop,[4] which is an integral part of the GNOME 3.0 release. Mutter is extensible with plugins and supports numerous visual effects.
19:20:20  You might call that a "cheat code"...
19:20:36  If only the fallback mode had a usable panel :P
19:20:48  The standard mode has neither.
19:21:47  Neither what?
19:21:55  Bad grammar.
19:22:06  I meant "The standard mode doesn't have one, too".
19:22:06  Oh, hasn't either
19:22:31  Yeah, hasn't either would have been correct.
19:23:42  Is Gnome 3.0 all that terrible?
19:23:46  Looks like mutter runs as dynamic library inside gnome-shell.
19:24:08  Phantom_Hoover: Yes.
19:24:26  Gnome 3.0 looks nice, and is quite usable - but it abandons some concepts we get really used to.
19:24:37  One of them being a customizable panel with applets.
19:24:40  Well, I haven't run gnome-shell for quite a long while, but I used it for about a day a few months ago and it was intolerable; reviews don't appear to imply it's improved at all
19:24:45  Are we talking "the buttons are all precisely the wrong shade of blue" terrible or "help where are the buttons" terrible?
19:25:05  Phantom_Hoover: We're talking "unusable application starting/window management interface"
19:25:26  Honestly, I'm not even tied to the panel + windows model, I just don't want to replace it with something /worse/. If GNOME 3 came out with a tiling WM I'd give it a long while before deciding it sucked :P
19:26:06  What are the later reasons for it sucking?
19:26:13  Alt+F1 i-c-e-w-Enter is not really that bad to start an application (yeah, I'm using debian)
19:26:34  Phantom_Hoover: What?
19:26:49  twice11: That's what dmenu is for :P
19:26:54  If you'd give it a long while, there are other reasons for it sucking which are more subtle.
19:27:17  elliott: I had configured the quick-launch bar in GNOME 2.x, but never got used to using it.
19:27:39  Phantom_Hoover: Your last two lines have been uninterpretable, sorry
19:27:59  "If GNOME 3 came out with a tiling WM I'd give it a long while before deciding it sucked :P"
19:28:48  As in "a tiling WM could possibly be a major improvement on the previous GNOME 2 model, so I would give it a fair chance before making any judgement".
19:29:05  Whereas I could tell gnome-shell was fundamentally broken in a day.
19:29:21  Yeah, but why would your judgement still be that it sucked?
19:30:22  I didn't imply that.
19:30:34  Oh, right, ambiguity.
19:30:57  Neat, GNOME 3.4 is dropping Linux support
19:31:04  Very smart of them
19:31:14  Because Poettering told them to!
19:31:15  BSD only?
19:31:30  Sounds like news from the onion, if you ask me.
19:31:40  Zwuh?
19:31:42  Erm
19:31:44  X-D
19:31:46  Dropping non-Linux support
19:31:58  The other way around would be particularly amazing news :P
19:32:10  So they're not spiting everyone because Ubuntu switched to Unity?
19:32:39  X-D
19:32:47  "Fuck you, we're leaving! ANNOUNCING: GNOME 3.4 for Windows!"
19:33:35  Who the hell bothers with cheating at the International Maths Olympiad?
19:34:11  By which I mean North Korea
19:34:18  But why!?
19:35:38  It's pointless!
19:35:43  And rather sad!Q
19:35:55  That 'Q' is symbolic of my pity.
19:35:59 -!- Vorpal has quit (Quit: ZNC - http://znc.sourceforge.net).
19:36:24  WTF, John McCarthy was the Lisp guy???????????????
19:36:36 -!- Vorpal has joined.
19:36:49  It wasn't Joe
19:37:03  All this time I've been wondering why we were mourning the inventor of McCarthyism.
19:37:18  He died in '57
19:37:32  Phantom_Hoover: .........
19:37:52  I... have to go and... do... things...
19:37:52 -!- Phantom_Hoover has quit (Quit: Leaving).
19:38:20  For reference, Joseph McCarthy would have been 103 had he died this year.
19:38:43  Ironically, he was killed by Fascists
19:38:46  ;)
19:39:58 -!- Phantom_Hoover has joined.
19:39:59  For the benefit of future civilizations: he died probably due to alcoholism.
19:40:00  "Reactions to GNOME Shell have also not been universally negative." --Wikipedia
19:40:02  Well that's good then!
19:40:19  Please tell me it just leaves off there.
19:40:25  For the benefit of future civilizations: Ngevd is making a quaint 21st century joke; Joseph McCarthy is the President of Europe.
19:40:37  Phantom_Hoover: No :P
19:40:50  Ngevd: We really have to destroy these logs before civilisation falls.
19:40:58  For the benefit of future civilizations: So that you don't discover our horrible secret.
19:41:29  The Terrible Secret of #esoteric.
19:42:05  For the benefit of future civilisations (shame on you, elliott and Ngevd): that was a reference to Shakespeare.
19:42:08  I am the /kicker robot. Kicking is the answer. Kicking will protect you from the Terrible Secret of #esoteric.
19:42:13  The #esoteric Secret of Terrible
19:42:24  I look forward to GNOME 4
19:42:26 -!- ive has quit (Ping timeout: 276 seconds).
19:42:39  I don't. I look forward to GNOME 3.6 or so.
19:42:52  GNOME with a new major version is known to be major breakage.
19:43:07  Meh, I use Unity
19:43:15  Because I am masochist.
19:43:30  #esoteric has a terrible secret?
19:43:36  twice11: Known for all two versions it's happened? :P
19:43:41  olsner, shh
19:43:47  OK, I suppose GNOME 1.0 happened, but I'm pretty sure GNOME 1 was never not awful.
19:43:52  I think it's a Terrific Secret!
19:44:10  Yeah, statistics with 2 data points is science. Statistics with one data point is crap.
19:44:27  Statistics with three data points is overkill.
19:44:38  statistics with data is overkill
19:44:40  `addquote  Yeah, statistics with 2 data points is science. Statistics with one data point is crap.
19:44:42  712)  Yeah, statistics with 2 data points is science. Statistics with one data point is crap.
19:44:46  You measure a third point if you need an error estimate.
19:44:50  Darn, Ngevd and olsner made it better before I added it.
19:44:55  `delquote 712
19:44:58  ​*poof*  Yeah, statistics with 2 data points is science. Statistics with one data point is crap.
19:45:03  `addquote  Yeah, statistics with 2 data points is science. Statistics with one data point is crap.   You measure a third point if you need an error estimate.
19:45:04  There we go :P
19:45:05  712)  Yeah, statistics with 2 data points is science. Statistics with one data point is crap.   You measure a third point if you need an error estimate.
19:45:47  twice11: So is your name 22 and you just have to mangle it everywhere because of the leading digit? :P
19:46:12  No, my name covers a terrible secret ;)
19:46:35  Or a terrific secret, perhaps.
19:46:36  But not THE Terrible Secret
19:46:54  (it's 1111)
19:47:00  Did you... have two 11th birthdays?
19:47:17  Possible, if he's 47
19:47:34  Or older
19:47:36  today, as every day, is his elevenhundredeleventieth birthday
19:47:49  Ngevd: Don't tell everyone the number combination of my suitcase!
19:47:53  Like, maybe twice11 was born at exactly midnight and blah blah blah DST.
19:48:07  Or maybe he was born on February the 30th
19:48:17  he will be born in 4 days, on 11/11 -11
19:49:18  That nick has been chosen 13 years ago, when freaks still knew CP437 with graphic symbols for control characters and is correctly spelled twice#11
19:49:29  Hey, there's a new esolang
19:49:40  On the other hand, probably today I would use a different nick, if I didn't get used to this one.
19:50:01  I use Taneb in most places except for this channel.
19:50:16   Hey, there's a new esolang <-- any good?
19:50:21  I can only conclude that twice11 is actually Mars.
19:50:27  It doesn't appear to be a brainfuck derivative
19:50:35  well, that is a start
19:50:41 * Phantom_Hoover sets down the brick.
19:51:04  Hold on, Phantom_Hoover
19:51:09  Keep a hold of that brick
19:51:17 * twice11 congratulates elliot for looking up CP437
19:51:20 * Phantom_Hoover picks the brick up again.
19:51:35  twice11: I know what CP437 is :P
19:51:40  Phantom_Hoover: what are you doing with that brick?
19:51:41  twice11, we all know CP437.
19:51:48  I don't know it off by heart, though
19:51:52  olsner, readying it for some brickbrainin'.
19:51:56  heart is #3
19:52:05  I'd like a second opinion
19:52:08  http://esoteric.voxelperfect.net/wiki/Lenta
19:52:13  Phantom_Hoover: do a brickroll
19:52:30  or some brickabrack
19:52:48  Hmm...
19:52:59  Oh FFS, when I look at ¬ my first thought is "better expand the food stockpile again".
19:53:03  twice11: hm, which base should it be interpreted in?
19:53:04  olsner: Looks vaguely interesting
19:53:14  Erm
19:53:15  Ngevd:
19:53:44  Vorpal: I'm only commenting as much as that elliott already looked up the right character.
19:53:48  hmm, that's a bit of a typo there
19:53:48  Doesn't look much like a Brainfuck derivative.
19:53:51  Oh god, he's either writing something big or died.
19:54:07  Who's he
19:54:17  boily.
19:54:27  Sir Terry Pratchett?
19:54:38  boily boils?
19:54:39  twice11: you mean " I can only conclude that twice11 is actually Mars."? That doesn't mean anything to me
19:54:43  You know that he released a book like 3 days ago?
19:54:45  Ngevd: How was I supposed to know that from the context
19:54:58  Mind reading
19:55:04  Vorpal: Yeah, that's the quote I meant.
19:55:06  Ngevd: Anyway, you'll know when he dies since he's committed to suicide *shrugs* :P
19:55:16  boily wont ever talk it seems
19:55:17  twice11: so what is the symbol for Mars?
19:55:24  i want to talk to boily
19:55:25  Vorpal: You have access to Google
19:56:14  Vorpal: ^K in the display RAM of some ancient IBM graphic cards.
19:56:16  so 11 in base 10, meh. I was looking at the hexdecimal 0x11
19:56:25  quintopia: The lurkers are usually lurkers because they're boring people.
19:56:37  Vorpal: Get some Turbo(?) Pascal!
19:56:47  twice11: ugh nop
19:56:48  no*
19:56:55 * Vorpal forces twice11 to use Delphi.NET
19:57:10  I seem to have a vague memory of hearing about that
19:57:13  sounds horrible
19:57:25  Last Delphi I had contact with is Delphi 5.
19:57:28  Haha, ConsoleKit is dying
19:57:33  Being replaced with systemd
19:57:37  ouch
19:57:45  elliott: what will happen to distros not using systemd
19:57:53  They'll switch to systemd :)
19:57:59  of course, nothing named CamelKit can remain in Linux, it needs to be a somethingd
19:58:01  It's actually no worse than Visual Basic, but I don't think this means anything...
19:58:02  elliott: you think ubuntu will?
19:58:11  Vorpal: Debian are, IIRC
19:58:15  hm
19:58:24  I doubt Canonical are so attached to upstart that they won't in the face of pressure like that, but we'll see
19:58:26  elliott: but did debian ever use upstart?
19:58:26  PolicyKit gets what then? permissiond?
19:58:41  Does PolicyKit depend on ConsoleKit?
19:58:52  Don't see anything about it being unmaintained on freedesktop.org
19:58:55  what do consolekit and policykit actually do btw?
19:59:09  elliott: also what will you do for Kitten then? I assume you won't use systemd...
19:59:11  No, but olsner suggested all *Kits are dying.
19:59:19  policykit is what allows you to do things like modify net connection/users/packages from the GUI
19:59:21  hm I guess you could just implement the relevant interfaces
19:59:25  (for stuff that doesn't use gksudo or w/e)
19:59:31  twice11: they could change names too, I guess
19:59:33  and consolekit?
19:59:34  finer-grained stuff
19:59:38  My cat had some dtens.
19:59:44  but people like to rewrite stuff because they can
19:59:46  "ConsoleKit is a framework for defining and tracking users, login sessions, and seats."
19:59:47  "ConsoleKit is a framework for managing user sessions and permissions. Some of the most common usages of consolekit is allowing non-root users to mount removable media and suspending/shutting down the computer through common desktop applications (ie: thunar, nautilus, the gnome shutdown menu, etc)."
19:59:56  seats?
20:00:03  *shrug*
20:00:04  also because the existing stuff sucks, but so will their replacements :D
20:00:04  elliott: huh, i just figured since the active people are so boring, the lurkers must be the interesting ones
20:00:30  Oh, I see what twice11 meant
20:00:35  Pretty sure olsner was not being serious :P
20:00:47  quintopia: yep, they're too interesting to dilute their interestingness with banter
20:00:52  Vorpal: seats: If your computer has two keyboards and two seperately controlled monitors, you can have two independent sessions at the consoles.
20:00:52  sounds like I could do without consolekit. Since none of those things actually work on my desktop anyway. Probably because I use startx rather than a login manager
20:00:56  These are two seats.
20:01:10  twice11: ... that sounds extremely rare
20:01:11  Vorpal: You're meant to have ck-launch-session in ~/.xinitrc.
20:01:24  elliott: hm I do have that
20:01:26  Vorpal: That's not incredibly rare. Any thin client is probably a seat.
20:01:28  exec ck-launch-session dbus-launch --exit-with-session startxfce4
20:01:47  so... why doesn't those things work
20:01:50  Shrug
20:02:09  Most of this new-fangled Linux stuff looks like overdesigned crap.
20:02:17  But maybe I just don't understand it.
20:02:36  I guess removable media is nice. Hm
20:02:43  Wait a second...
20:02:56  Lenta seems awfully similar to my old Ook!++
20:03:01  elliott: well... yes and no, names like ConsoleKit do look awfully out of place among the rest of the stuff
20:03:04  Except further from brainfuck
20:03:09  hm
20:03:31  olsner: freedesktop people do not care much about fitting in to the "old" ecosystem
20:03:32  olsner: is there actually any /etc/init.d/consolekit though?
20:03:33  though the process is actually just called console-kit-something, I thought it was called ConsoleKit
20:03:49  or /etc/rc.d or whatever
20:04:06  http://www.freedesktop.org/wiki/Software/eventuality guess this took out
20:04:07  erm
20:04:08  s/out/off/
20:04:09  I have no such init script
20:04:11  (from http://www.freedesktop.org/wiki/Software)
20:04:20  but isn't mac or next where they started calling things FooKit etc?
20:04:44  olsner: WebKit is the only thing I can think of
20:04:48  and is unrelated to all these
20:04:59  olsner: OS X is more about Core Blah
20:05:10  image, garphics, animation, video
20:05:14  s/garphics/graphics/
20:05:16  core quartz?
20:05:22  cowartz
20:05:24  or what was quartz now again
20:05:25  Core Dump
20:05:28  what did it do?
20:05:47  Quartz == The display engine based on PDF data.
20:05:50  ah
20:06:09  Maybe replaced by Core Graphics now.
20:06:13  No idea.
20:06:13  hm
20:06:26  "Quartz specifically refers to a pair of Mac OS X technologies, each part of the Core Graphics framework: Quartz 2D and Quartz Compositor. It includes both a 2D renderer in Core Graphics and the composition engine that sends instructions to the graphics card. Because of this vertical nature, Quartz is often interchanged synonymously with Core Graphics.[1]"
20:06:35  elliott: Where the heck was I downloading Gentoo Prefix? >_<
20:06:41  Gregor: ?
20:06:45  Gregor: you mean "why the heck"
20:06:47  elliott: I can't find it :P
20:06:53  Gregor: The URL or file
20:06:55  What's conceptually inbetween Haskell and Perl?
20:07:00  Vorpal: Because the alternative is Cygwin
20:07:05  elliott: why windows...
20:07:06  elliott: The file. You can't help me, but that doesn't stop me from blarping at you.
20:07:10  Ngevd: What's in-between a banana and a pile of dirt
20:07:14  Gregor: Right :P
20:07:18  Gregor: Try the Windows file-finding feature?
20:07:25  It OCCASIONALLY works.
20:07:25  elliott, a rotting banana.
20:07:28  elliott: I don't think I was downloading it on Windows.
20:07:30  I don't like bananas
20:07:31  In fact I know I wasn't.
20:07:33  elliott: also, modern internix requires win 7 ultimate, win 7 enterprise, or win server 2008 iirc
20:07:36  hm
20:07:43  Gregor: find . -name \*gentoo\*
20:07:46  So, what's the rotting banana of programming languages?
20:07:49  elliott: That's what I'm doing :P
20:07:51  Vorpal: Gentoo Prefix supports XP onwards
20:07:55  hm
20:07:58  Ngevd: Perl
20:08:09  I thought that was the Banana!
20:08:09  well I can't do it on my win 7 pro install.
20:08:11  oh well
20:08:15  not like I need it
20:08:21  Gregor: so... why are you using windows?
20:08:29  elliott: If this doesn't work on my Windows 7 Pro ... KILL KILL KILL KILL DIE DIE DIE
20:08:35  Gregor: It will.
20:08:35  Vorpal: I wanted a VM to not cross compile on.
20:08:37  Gregor: Vorpal is just an idiot.
20:08:49  Of course, if I can't find the damned thing X-D
20:08:56  Gregor: BTW, make sure you have the Administrator account enabled; see the manual for why
20:08:58  elliott: well, microsoft said it wasn't supported.
20:09:07  Microsoft don't support XP, indeed.
20:09:14  I'm not sure how this is surprising.
20:09:17  Or, hmm
20:09:20  Has it actually reached its EOL yet
20:09:23  "Version 6.1 is included in Windows 7 (Enterprise and Ultimate) and Windows Server 2008 R2 (all editions)."
20:09:24  Seriously, where the HELL did I download this >_<
20:09:33  Vorpal: Yes, OS components only get upgraded with the OS
20:09:37  Similarly, NT 7 or whatever isn't available for XP
20:09:49  Gregor: /tmp?
20:09:51  Did you reboot? :P
20:10:05  elliott: I'm just saying that version 6.1 of interix is not supported on win 7 pro.
20:10:10  elliott: I had to reboot the machine that was SSH'd in to download.
20:10:11  maybe you can use an older version
20:10:13  I don't know
20:10:13  elliott: Hence why I lost it.
20:10:16  Vorpal: You could use... the version for XP?
20:10:24  elliott: would that run under win 7?
20:10:30  Gregor: So was it in /tmp
20:10:41  elliott: No, why would I download in tmp :P
20:10:46  Vorpal: Why the fuck would you use the version for XP on Windows 7
20:10:55  FOUND IT
20:11:06  HURRAH!
20:11:08  elliott: my point exactly. I'm just saying if you use win 7 you will need win 7 ultimate or win 7 enterprise
20:11:17  and who would still use xp?
20:11:33  Vorpal: "Version 6.1 is included in Windows 7 (Enterprise and Ultimate)"
20:11:37  Note: INCLUDED
20:11:47  Turns out smaller versions of Windows don't include all components which is why you might have to download them.
20:11:59  elliott: I did check recently, it is NOT available for windows 7 pro according to microsoft.
20:12:00  This is also irrelevant since the Gentoo Prefix ISO contains the SUA files.
20:12:08  elliott: if I'm wrong, please tell me where you found it
20:12:12  as I would very much like it
20:12:28  Try looking on the Gentoo Prefix ISO :)
20:12:32  hm okay
20:12:52  OMG, Quark is dying :(
20:13:03  olsner: quark?
20:13:05  Vorpal: Although Microsoft is killing SUA as of Windows 9.
20:13:11  right
20:13:13  Gregor: 8, I think.
20:13:25  "It is set to be deprecated after the release of Windows 8. [4]"
20:13:29  olsner: :'(
20:13:30  sounds like 8 will still have it
20:13:31  Meh, fair enough
20:13:45  Who cares, Windows 9 will probably suck :P
20:13:52  Gregor: tell me if it works on win 7 pro though if that is what you have
20:13:58  elliott: won't windows 8 suck too?
20:14:10  I think the Piet pi calculation is the most interesting
20:14:14  Vorpal: Did I say otherwise?
20:14:19  Windows 8 will support SUA, so it's irrelevant
20:14:21  elliott: nope
20:14:26  Vorpal: That's what I have.
20:14:26  elliott: I can only assume he'll survive though, haven't seen any mention of quark leaving the show in all the spoilers I've read
20:14:30  Haven't gotten OS X working in a VM yet :(
20:14:36  olsner: Don't read spoilers :P
20:14:37  (I have 16GB of RAM now, so I'm VM'ing EVERYTHING)
20:15:02  Gregor: There are tutorials for things like OS X in VirtualBox
20:15:05  It's a pain but doable
20:15:08  elliott: I know, I've tried.
20:15:09  And failed.
20:15:13  Less of a pain now that Apple support it on OS X hosts
20:15:14  elliott: I think it doesn't like my CPU or something.
20:15:15  Gregor: do you have a copy of xp pro 64-bit? Quite lightweight for being windows. More so than the 32-bit xp
20:15:19  I knew I shouldn't have gone with AMD >(
20:15:21  *>:(
20:15:34  Vorpal: I don't need lightweight :P
20:15:50  elliott: I actually like reading spoilers so I know something of what I have to look forward to
20:15:50  elliott: It gets through most of the installer, then freezes and dies horribly at 11% remaining and won't boot.
20:15:55  Gregor: come on, aero is never going to be fast in a VM
20:15:59  Gregor: Heh
20:16:02  (sure you can turn that off)
20:16:07  Vorpal: Me using a GUI? Ha ha ha no
20:16:19  olsner: That ruins DS9 a lot since the plot goes through major changes *shrug*
20:16:20  Gregor: :P
20:16:33  Vorpal: Aero runs just fine in a VM, and Aero can also be turned off.
20:16:53  elliott: did I say anything that indicated the opposite of the latter+
20:16:55  So anyway, what's all this about Quark dying which now I assume is Star Trek Quark?
20:16:56  s/+/?/
20:17:07  Vorpal: Well, I'm assuming you're not just throwing bullshit statements unrelated to what the topic is at Gregor
20:17:18  elliott: I even said you could turn it off
20:17:21   (sure you can turn that off)
20:17:36  Gregor: I'm just occasionally dumping the plot of whatever DS9 episode I happen to be watching
20:17:46  olsner: Oh :P
20:17:57  ...
20:17:59  or just the opening gambit, since I sometimes stop reading IRC while watching
20:18:34  Anyway, if anyone wants to avoid systemd in the future, Kitten is their best bet :P
20:19:05  https://en.wikipedia.org/wiki/Windows_To_Go <-- now that is interesting. How do they think that will work with activation? Or did they drop activation and locking to hardware?
20:20:02 -!- GreaseMonkey has joined.
20:20:02 -!- GreaseMonkey has quit (Changing host).
20:20:02 -!- GreaseMonkey has joined.
20:23:57  oh! this is the episode where *that* happens... this is about as hilarious as when the guy in Enterprise got pregnant and grew nipples on his arms
20:24:41  olsner: Which episode
20:24:52  Vorpal: So anyway, you were right about ANSI codes and scrollbars and I hate you for it
20:25:14  elliott: what did I say about scrollbars? I don't remember
20:25:20  elliott: 4x25, Body Parts
20:25:33  Vorpal: That you couldn't just move the cursor up beyond the top of the terminal screen to poke lines that have scrolled out of view
20:25:37  You're right, which is really annoying
20:26:14  ah
20:26:47  elliott: yes cursor movement doesn't really fit well into the concept of scrollback
20:27:00  so I'm not surprised
20:27:28  Vorpal: I have no idea what I can do, other than... well, I know you can hook into mouse scrollwheel because vim does it, so I could do that, wait for a repaint, and then adjust the now-visible lines appropriately??
20:27:29  Euurgh
20:27:46  wow
20:27:47  It's unlikely that you'll have more than 24 tasks pending at a time but it's still possible, so this is annoying
20:27:56  elliott: INSTALLIN' DAT GENTOO
20:27:57  elliott: I don't know if that will work
20:28:05  Gregor: Awww yeah
20:28:15  Gregor: Is the Administrator account activated :P
20:28:18 * elliott HELPFUL REMINDER
20:28:26  Vorpal: I don't see why not
20:28:38  Vorpal: Hmm, I guess because maybe only the last 24 lines are actually active
20:28:41  elliott: anyway I think it might send some terminal code to get scroll wheel as character input, and it might only work with alt screen
20:28:42  elliott: INSTALLING SUA FAILED
20:28:44  elliott: I BLAME YOU
20:28:45  After all, printf goes to the end of the scrollbar not before
20:28:47  not sure
20:29:00  Gregor: failed with what error?
20:29:07  Gregor: Weird, I guess it's specifically checking for the right version of 7?
20:29:11  Gregor: Just get Ultimate, man :P
20:29:19  Or... downgrade to XP, I suppose :P
20:29:21  elliott: I told you so...
20:29:25  Vorpal: None, just "Installing SUA failed!"
20:29:36  elliott: This Pro is actually /legal/
20:29:49  Gregor: did it do it at the start of the install, or did it happen a bit into the install?
20:29:52  hm
20:29:59  Gregor: Wooooow! I care so much :P
20:30:04  Vorpal: Beginning of install.
20:30:09  Gregor: you mean to imply that your Ultimate wouldn't be? :)
20:30:16 * Gregor installs cygwin.
20:30:24  olsner: I'm sure as hell not going to PAY for Windows.
20:30:30  haha, cygwin, welcome to hell
20:30:31  I can sort of tolerate having it if I don't pay for it.
20:30:32  Gregor: You will regret your decision of Cygwin over piracy very rapidly
20:30:34  Gregor: was it gentoo's installer or microsoft's installer that did that?
20:30:44  Gentoo's installer is the only installer involved.
20:30:49  Vorpal: I don't have a clue, Gentoo's just called SUA's installer.
20:30:51  hm
20:31:01  if you're lucky you'll have a 64-bit windows where cygwin doesn't work at all
20:31:07  it doesn't?
20:31:08  ugh
20:31:16  Wow, it doesn't?
20:31:20  Gregor: SO AWESOME
20:31:21  what cygwin does to emulate fork() is ... horrible
20:31:27  olsner: why would it not work on 64-bit linux as a 32-bit program...
20:31:33  it *might* work
20:31:41  64-bit Linux?
20:31:41  quintopia: hello!
20:31:42  but sometimes it just doesn't, apparently
20:31:43  Cygwin for Linux!
20:31:47  elliott: windows...
20:31:47  olsner: Uhhh, I have 64-bit Windows, but I assure you Cygwin works ...
20:31:49  boily: Holy fucking
20:31:59  boily: Your long reign as lurker is over
20:32:17  I'm at work, so my activity on IRC isn't quite stellar.
20:32:19  and on some 64-bit systems, cygwin *sometimes* works :)
20:32:58  boily: You're at work 24/7? :P
20:32:59  olsner: really? How does it fail then?
20:33:01  `pastelogs 
20:33:27  http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/paste/paste.10997
20:33:33  Vorpal: fork() fails because cygwin can't manage to find a way to load all DLL's at the same address as in the parent
20:33:39  heh
20:33:41  elliott: Sometimes I forget that my computer's open.
20:34:07  boily: OK, you've technically talked 10 times this year before today :P
20:34:13  But there was a two year gap before that.
20:34:24  was he in the channel then
20:34:29  INSTALLIN' DAT CYGWIN
20:34:30  that is kind of important
20:34:31  Dunno
20:34:48  Gregor: This is going to be more painful than downloading Ultimate :P
20:34:51  well that's *one* of the failure modes anyway, and apparently the workarounds for it don't always work at all
20:34:53  woooah, history from 4 years ago!
20:34:56  elliott: INSTALLIN' DAT CYGWIN
20:35:12  olsner: hm...
20:35:27  I never really was a fan of cygwin. If you just need to get GNU programs run, use MinGW. If you need a shell, use msys. If you need more, use unix.
20:35:37  twice11: MSYS is just an ancient version of Cygwin.
20:35:44  twice11: MSYS is sooooo painfully obsolete.
20:35:47  yeah why does Gregor need windows, he never answered.
20:35:49  It's literally just Cygwin.
20:35:51  But ancient.
20:35:52  Vorpal: Yes I did.
20:35:53  And with no Unicode support.
20:36:10  Gregor: not really, I saw no sufficient important reason :P
20:36:10  "Vorpal: I wanted a VM to not cross compile on."
20:36:22  twice11: And MinGW doesn't let you use compile anything that uses such esoteric POSIX APIs as fork() :P
20:36:24  Gregor: cross compiling is kind of less work than cygwin
20:36:35  Vorpal: If it compiles it works, right?
20:36:37  Vorpal: Until shit doesn't work and you can't test why.
20:36:43  elliott: exactly!
20:36:49  Well, there is no fork on Windows. Too bad.
20:36:51  elliott: no need to test or anything. Especially if C code
20:37:04  twice11: Which is why Cygwin and the POSIX subsystem provide one :P
20:37:10  And cygwin is just kudging around it and failing on x64 sometimes.
20:37:19  I only want MingW for compiling, I just want a shell that doesn't suck foot, and an SSH server so I never have to look at the UI.
20:37:22  That screams Cygwin.
20:37:30  twice11: Yep, but the POSIX subsystem isn't, it just implements POSIX APIs at the NT layer.
20:37:40  Gregor: fork is slow there though
20:37:50  So why does cygwin not use the POSIX system then?
20:37:51  Vorpal: No shit
20:37:54  Gregor: (a) Stop typoing it already it's MinGW (b) Cygwin's shell sucks foot because it's built on top of Cygwin
20:38:05  twice11: Cygwin is older than the POSIX subsystem.
20:38:12  It dates to the 95 days.
20:38:26  Also, Cygwin will live after the POSIX system is dropped in Windows 9 :P
20:38:35  FSVO live
20:38:53  That does not mean you can not have a Cygwin replacement using the POSIX personality on NT-derivatives that provide it.
20:39:08  twice11: That's why Gentoo Prefix exists.
20:39:12  (for Windows)
20:39:21  It's a full environment on top of SFU/SUA.
20:39:30  It just doesn't like Gregor's specific release of Windows for licensing reasons.
20:39:32  how does interix do fork()?
20:39:39  Can't cygwin just switch to do the same?
20:39:42  Vorpal: How does Linux do fork()
20:39:49  It's a subsystem, it's implemented at the NT layer
20:39:54  It's at the same level as the implementation of Win32
20:39:58  hm
20:40:08  how is babby forked?
20:40:09  elliott: so why can't cygwin directly call ntdll?
20:40:13  For Cygwin to use it would involve first throwing out all of Cygwin's code and second becoming SFU/SUA
20:40:32  are there any third party NT sub systems at all?
20:40:34  Vorpal: Because it runs on top of Win32?
20:40:45  And yes, SFU/SUA is based on an acquisition of Interix.
20:41:03  microsoft didn't make it originally?
20:41:04  Cygwin and SSH installed!
20:41:04  heh
20:41:08  Hmm, I think
20:41:21  Yeah:
20:41:24  This product began to be developed in 1996 under the product name OpenNT by Softway Systems, Inc. before the name was changed to Interix in 1998. The last release by Softway Systems was release 2.2. Softway Systems had virtually completed the next release code-named Firebrand in 1999 which became the basis of Interix 3.0.
20:41:24  Interix was acquired by Microsoft in 1999. Microsoft continued to distribute Interix 2.2 as a standalone product until 2002.
20:41:24  Interix release 3.0 was released as component of Services for Unix (SFU) 3.0 in 2002. Interix release 3.5 was released as component of SFU 3.5 in January, 2004.
20:41:24  Interix became integrated as component of the regular Windows OS distribution[5] as a component of Windows Server 2003 R2 in December, 2005 at release 5.2 and is a component of the Windows Vista release as release 6.0 (RTM November, 2006). Windows Server 2008 has release 6.0. Windows 7 and Windows Server 2008 R2 include SUA 6.1.
20:41:46  heh
20:41:57  Gregor: Don't put ! after statements about your slow descent into hell :)
20:42:34  elliott: What is it I can say to make you /ignore me? Trololololol?
20:42:45  Gregor: Good luck
20:42:59  I'm SSH'd in and installing shit :P
20:43:02  Seems to work great to me.
20:43:13 -!- Zuu has joined.
20:43:27  Gregor: I thought you had to use the original setup program to install components in cygwin?
20:43:38  what command line program do you use then
20:43:44  The setup program supports GUIless operation.
20:43:46  It's just painful.
20:43:49  I see
20:44:01  Gregor: Anyway, yeah, it works great until you run any shell script ever, or run into one of its numerous integration problems, or it just plain breaks.
20:44:05  I'm not using setup.exe
20:44:10  Gregor: Or you realise how absolutely friggin' ANCIENT every piece of software it comes with is.
20:44:21  elliott: GCC 4.5 is good enough *shrugs*
20:44:37  gcc 4.5 is fairly new
20:44:38  Okay, that's one piece of software. (It was gcc 3 not long ago, btw.)
20:46:07  Aww shit, SLIM is unmaintained
20:46:09  elliott: It's a hell of a lot more up to date than MSYS :P
20:46:28  Gregor: So relevant :P
20:47:29  Now time to run a configure script huzzah :P
20:48:51  night →
20:49:14  Gregor: Have fun waiting
20:49:18  Let's time GMP's configure :P
20:49:23  I'm betting ... 20 minutes.
20:51:26  Gregor: Have I mentioned that the POSIX subsystem makes the shell run only very slightly slower than Linux? :)
20:51:27  minutes, hours, days, years, who knows... I doubt anyone's watched it to the end yet :P
20:52:42  elliott: Do I HAVE the POSIX subsystem? Doesn't seem so!
20:53:06  Gregor: You could download Ultimate quicker than waiting for Cygwin to run a configure script :)
20:53:41  elliott: My Windows. It is legal.
20:53:52  Gregor: Legally shitty
20:54:00  All legal Windows is legally shitty.
20:54:08  you could convince Gates to give you a copy for free quicker than waiting for Cygwin
20:54:29  Still configurin'!
20:54:33  It's chuggin' away!
20:54:40  or maybe you could meet Jobs and have *him* buy you a copy even quicker
20:55:13  Necromancy: Faster than Cygwin™
20:55:18  DONE
20:55:26  5:25
20:55:31  you're just saying that to make us stop goading
20:55:56 -!- oerjan has quit (Quit: Good night).
20:56:00  in two weeks/months/years/something we'll see a " DONE" and have no idea what you're talking about
20:56:16  Please hold while I install make :P
20:58:41  I'm trying to compute a lot of SHA-1 hashes with sha1sum; I'm running 4 sha1sum processes in parallel, what number of args should I pass to each sha1sum to overcome the fork/etc. overhead?
20:58:51  Considering that passing too many to one is a waste of time because it'll compute them sequentially
20:59:58  how quickly does each item finish?
21:00:09  sha1sum is pretty much instant :P
21:00:10   how do u make uploader comments
21:00:25  that's… somehow impressively worse than the normal YouTube standard
21:00:44  [elliott@dinky ~]$ time sha1sum $(find /usr -type f -print | head -n 1) >/dev/null
21:00:45  real0m0.008s
21:00:45  [elliott@dinky ~]$ time sha1sum $(find /usr -type f -print | head -n 16) >/dev/null
21:00:45  real0m0.030s
21:00:45  [elliott@dinky ~]$ time sha1sum $(find /usr -type f -print | head -n 64) >/dev/null
21:00:46  real0m0.047s
21:00:48  [elliott@dinky ~]$ time sha1sum $(find /usr -type f -print | head -n 128) >/dev/null
21:00:50  real0m0.118s
21:00:52  olsner: Does that help
21:01:12  I'm thinking maybe 16 to each process?
21:01:26  Except that seems too low, maybe 32
21:01:31  Which adds a really tiny amount to the runtime
21:01:36  (0.003s)
21:01:43  Actually, even 64 only takes 0.047s
21:02:01  Wait, there's an easy way to measure
21:02:02  I think fork/exec overhead is much less than a millisecond
21:02:20  olsner: Oh yeah, but the scheduler isn't gonna like millions of new processes a second :P
21:02:37  I did a simple test run (once :P) with starting thousands of gcc processes on an empty file (which actually also does something), got about 1ms per execution then iirc
21:03:12  ehm, not all at the same time of course, started them sequentially
21:04:47  Now, by default, Apache runs everything as the same user, right?  I seem to remember that it's usually a bad idea to change this.
21:06:07  real0m35.221s
21:06:07  That's for n=64
21:06:22  tswett: You're writing things as an Apache module...?
21:06:46  elliott: no, but I might want to run CGI scripts as different users.
21:07:14  tswett: Have them communicate with daemons.
21:07:33  That sounds like it might be a good idea.
21:08:11  elliott: 35s? :) that's like ... half the time you spent explaining the problem to me and I spent thinking about it?
21:08:18  real0m20.968s
21:08:18  n=64 again
21:08:21  olsner: Oh, this is on a subset of the data
21:08:25  oh, ok
21:08:28 * elliott tries with n=1.
21:08:54  The same time
21:09:00  My CPU isn't getting pegged at all, I think I need more processes than CPUs
21:09:25  Trying n=1, j=128.
21:09:27  18s.
21:09:40  Trying n=1, j=8192 :P
21:09:45  elliott: do you currently have fewer processes than CPUs?
21:09:51  Finally my CPU's going at 50%.
21:09:54  tswett: For this job, yes.
21:10:03  OK, that's slightly worse... so more processes aren't helping here.
21:10:09 * elliott tries n=32, j=8192.
21:10:10  if you're not pegging the cpu, how about a larger n? maybe you're just not seeing wasted time on your cpu meter
21:10:26  Sweet, n=32 j=8192 gets me 6 seconds
21:11:15  n=128, j=8192 gets me 5 seconds.
21:11:33  n=512, j=8192 gets me 6 seconds. OK, I think I want to lower j now...
21:12:34  Sweet, n=128, j=128 gets me 4 seconds.
21:13:02  n=64 j=128 gets me 3 seconds 8D
21:13:12  hmm, annoyingly trivial problem made hard to get right/fast for the wrong reasons
21:13:12  n=32 j=128 is slightly worse.
21:13:22  olsner: What, this one?
21:13:32  2,7,11,42,231
21:13:46  just hindered by sha1sum not wanting to implement the whole making a workqueue for its arguments and parallelizing over cpus to distribute work evenly
21:13:59  n=64, j=64 is slightly worse than n=64, j=128...
21:14:01  olsner: Right :P
21:14:04  Configurin' PCRE!
21:14:34  olsner: I think 2.6-2.8 seconds to calculate the sha1sums for 16384 files ain't bad.
21:14:52  and xargs -P (or whatever you're using) can't do the fair distribution without requiring a fork/exec for each file - because it obviously doesn't want to integrate any closer with the things it starts
21:14:54  Gregor: Is there no ready-made pcre package for cygwin?
21:15:03  twice11: I need a MinGW one.
21:15:38  Yeah, supply of MinGW libraries is quite bad :(
21:15:38  olsner: find ... -type f | wc -l is the fastest it can be, right?
21:16:04  GMP and PCRE are all I need (for now), so hopefully I'm not in hell just yet :P
21:16:11  Gregor: Wow, I just realised that Kitten could actually help you there X-D
21:16:18  Its package manager, that is.
21:16:25  you mean something like wc --files0-from=- -l?
21:16:33  There's no inherent reason individual packages couldn't support architectures that Kitten itself can't run on.
21:16:43  So you could install packages with the MinGW cross compiler.
21:16:50  olsner: X-D
21:17:02  olsner: I don't care about that :P
21:17:24  elliott: oh, you mean just counting the number of files?
21:17:47  olsner: Yeah. It completed fast enough, though.
21:17:56  OK, if my incredibly rough calculations are correct, it'll take 30 seconds to do this.
21:18:00  obviously, there is some overhead involved in printing the whole file names and just counting the newlines... but you'd need a lot of files to notice :)
21:18:04  So... yay.
21:18:25  2:46! That's ... within 5 minutes :P
21:18:28  you want inter-process deforestation
21:18:41  find: `/home/elliott/.gvfs': Permission denied
21:18:41  Oh come on find, you're /root/
21:18:43  You can access /anything
21:18:44  /
21:18:53  root_squash?
21:19:34  twice11: ?
21:19:58  So, I've got Apache, and I want to code in Perl.  That probably means using mod_perl, right?
21:20:43  elliott: If /home is on nfs, and the nfs export has root_squash enabled,
21:20:43  obviously not, write a perl interpreter in mod_rewrite instead
21:20:50  Oh here we go, I'll time autoreconf :P
21:20:59  the nfs server interprets a client saying "I am root" as "I am nobody".
21:21:21  That is supposed to be a security feature.
21:21:46  OTOH, a client that can claim "I am root" could also claim "I am elliott".
21:21:48 -!- elliott has quit (Read error: Connection reset by peer).
21:21:54 -!- elliott has joined.
21:21:57  tswett: No.
21:22:15  olsner: Advantage of this pegging my CPU: It finishes quickly. Disadvantage of this peggnig my CPU: It freezes my system.
21:22:31  autoreconf: 1:40
21:22:34  elliott: got any better ideas?
21:22:49  elliott: freezing the rest of your system is its way of telling you it's doing its job
21:22:56  tswett: You mentioned CGIs earlier, what happened to those, anyway?
21:23:09  I figured mod_perl might be just as easy, or easier, and slightly faster.
21:23:19  If CGI is easier, I probably should go with CGI.
21:24:44  yes! use computer-generated imagery to make it *look* like you're running perl without you actually doing it
21:24:52  elliott: Did you receive my explanation of what I meant saying "root_squash"?
21:24:56  genius :P
21:24:59  twice11: Nope.
21:25:21  elliott: If /home is on nfs, and the nfs export has root_squash enabled,the nfs server interprets a client saying "I am root" as "I am nobody".
21:25:39  That is supposed to be a security feature. OTOH, a client that can claim "I am root" could also claim "I am elliott".
21:26:03  tswett: FastCGI is what's popular nowadays in most ecosystems, either that or proxying a full HTTP server written in the language; consult your framework's documentation for the recommended deployment scenario
21:26:03  t
21:26:26  Framework... am I supposed to have one of those?
21:26:28  Hmm, looks like the freezes come in waves :P
21:27:13  tswett: If not, then you should already know what your deployment scenario looks like. Frankly I think you should learn more before jumping into something this complex, since you don't appear to have much experience with web stuff.
21:28:13  olsner: sha1sum: /proc/804/task/817/ns/ipc: Invalid argument
21:28:26  elliott: your argument is invalid
21:28:27  It's, uh, always safe to read files in /proc, right? :P
21:28:41  I guess I'm not familiar with the term "deployment scenario", and I also just know "framework" as meaning "a bunch of software that helps you do something", so... conclude what you will.
21:28:55  elliott: /proc/sys/read_this_to_poweroff :P
21:29:10  reading should be safe... I guess :)
21:29:25  tswett: I gather Catalyst is the most popular thing around Perl parts.
21:29:34  But don't quote me on that.
21:29:42  elliott: is there... a similarly popular thing around Python parts?
21:29:53  tswett: I believe you said you were using Perl?
21:30:03  but reading can definitely have side effects: had a system where you had to read the temperature sensor (from /proc/acpi/) to make the bios update the fan speed based on the current temperature
21:30:04  I haven't actually started writing any P code.
21:30:21  (Which, of course, means "language for a programming language whose name starts with P".)
21:30:39  olsner: OK, I'm terminating this and excluding /proc, /sys, /dev and /tmp :P
21:32:14  Anyway, maybe I can read some CGI tutorial.
21:32:15  I guess the same thing could trigger a bug that goes boom if you try to read from the wrong widget
21:32:20  let's say something mixes up "poke this to read the temperature" and "poke this to reboot" :P
21:33:08  anyway, I think the primary reason to skip /proc would be that it has annoying special files, like pipes and links into the rest of the file system
21:33:09  OK, let's try this again :P
21:34:31  Is there something like ScriptAlias except not bothering to alias anything?
21:34:33  Why does uniq have an option to ignore the first N fields, but not all fields beyond the first N?
21:34:43  tswett: Have I mentioned you shouldn't use Apache yet?
21:34:46  also e.g. sha1sum on /dev/sda might be a bit annoying :)
21:35:20  elliott: you may have, but at this point, I don't know how easy it would be to switch.
21:35:25  just use cut/awk before uniq?
21:35:33  tswett: You've written 0 lines of code.
21:35:34  I guess it would probably be... really easy, since the only thing I've actually put work into is the Postgres database.
21:35:35  arguably, uniq should not have the option at all
21:35:52  olsner: Except I need the field data after, duh
21:36:07  I want to /uniquify/ based on only the first field, but I need the data after that too
21:36:22  oh, right, annoying
21:36:31  I'd just remove Apache, and possibly also remove phpPgAdmin, since phpPgAdmin has nearly outlived its usefulness.
21:37:20  Why on earth are you using a web interface to the DB
21:37:34  Because it's pretty.
21:37:35  Just write a few INSERT statements, that way you're not fucked if you have to recreate it too
21:37:49  How many rows do you think this database contains?
21:37:55  Erm
21:37:57  s/INSERT/CREATE TABLE/
21:38:05  That's more like it.
21:38:19  I mean, you're going to have to learn SQL anyway to interface with it.
21:38:31  Which is a large time investment in itself, of course...
21:38:35  Seeing as it's practically a profession unto its own.
21:38:41  Right.  And I *am* using psql every so often.
21:38:47  And I *am* already more or less familiar with SQL.
21:39:45  tswett: I can write SELECT and INSERT queries =/= I am familiar with the relational model, how NULL works, how to do complex joins, how to get foreign keys right, how to use stored procedures, ...
21:40:07  I hope you at least know how to parameterise queries without string concatenation and escaping functions.
21:42:38  I *am* familiar with the relational model.  I think.  And joins seem easy enough, though I've forgotten how outer joins work.
21:42:44  olsner: Woo, eight and a half minutes later it finishes
21:42:54  tswett: Consider me fully reassured...
21:43:14  elliott: congratulations
21:44:20  And then foreign keys, those seem simple enough.  Use a foreign key whenever a row needs to refer to another entity.  Use CASCADE when CASCADE is appropriate, use DELETE when DELETE is appropriate, use SET DEFAULT when SET DEFAULT is appropriate, use NO ACTION when you don't know what's appropriate.
21:44:52  Then stored procedures... those aren't the same as functions, are they.  Though I (re-)learned how to create triggers today.
21:45:18  olsner: Oh great, xargs doesn't actually synchronise the output, so there's a bunch of incomplete lines and shit
21:46:30  ooh... I've seen that too, I could've told you before letting it churn for 10 minutes if I'd thought of it :P
21:47:01  (A mathematician's relational model: A table is a set of tuples.  Given two tables, you can take their union or Cartesian product.  Given one table, you can take subsets and projections.  Done.)
21:47:38  tswett: Of course there's also the very high probability you don't even want a relational database, but whatever
21:47:58  But relational databases are nature's solution!  God gave them to us!
21:47:59  olsner: I wonder if GNU parallel does the same
21:48:33  OTOH, there is also a high probability you don't really want a NoSQL data dumpbin, too.
21:48:37  hmm, maybe it's something else that jinxes it, tee?
21:49:38  twice11: Naturally.
21:49:52  elliott: How did you get xargs to run jobs in parallel? Special xargs edition?
21:49:54  What I'm about to mention is probably such a common problem that everyone but me has a solution to it.  }:)
21:50:00  twice11: Yes, the fancy-pants GNU edition.
21:50:02  I mean, the clever folks that have built this should have made it work, right? because they're clever (right?)
21:50:27  olsner: xargs is the last element of my pipeline.
21:50:47  elliott: My manpage doesn't document -j for xargs, or yield any hits for parallel and background...
21:50:48  I have a .vimrc file on one machine.  I want it to be on every machine.  Ideally, I could just edit one copy of it and everything else would change to match.
21:50:51  twice11: -P
21:51:06  Thanks.
21:51:08  twice11: Re SQL vs. NoSQL vs. ...: I would suspect tswett would be best off with simple object persistence; likely his data set is much smaller than memory, too.
21:51:31  (*):S(~(*)*:S(
21:51:31  )S~:^):^
21:51:41  At least most people generally want object persistence when they think they want an SQL database.
21:51:57  tswett: Keep it in a VCS repository, put it on GitHub/whatever, pull from each machine.
21:52:06  Heyyyyyoooooo got me some OS X.
21:52:26  SQL databases are a way to implement object persistence, although most likely not the one associated with least pain when implementing.
21:52:34  tswett: Or if you want something less fancy, rsync, but you'll need your own server and you'll have to be careful about modifying it from two places at once.
21:53:08  And that's something SQL people already invented transactions for.
21:53:30  twice11: Sure, they work as a backend, but "using an SQL database" through an automatic persistence facility where you don't even see the SQL isn't what most people think of when they say "using an SQL database". Also, the impedance mismatch makes it a pain. But you do get some nice advantages; a well-optimised and robust implementation, transactions, ...
21:53:49  People want all the guarantees SQL databases offer without the actual "relational SQL database" part :P
21:53:53   And that's something SQL people already invented transactions for.
21:53:56  What's this in response to?
21:54:17  Are you still on SQL or did you go back to it?
21:54:29  When were we previously on SQL?
21:54:49  Postgres. I guess you went back to it.
21:54:50  elliott: Reponse to "you'll need your own server and you'll have to be careful about modifying it from two places at once."
21:55:10  http://www.reddit.com/r/askscience/comments/m3jns/on_the_most_fundamental_level_what_is_a_computer/
21:55:14  elliott: so the less fancy way is more work? :)
21:55:18  What *are* computers? We just don't know.
21:55:32  twice11: Merging > locking
21:55:32  but I guess it's less fancy as in uglier...
21:55:35  But I can feel the pain of auto-generated SQL queries for complex object models...
21:55:39  twice11: You're not a CVS person, are you? :-)
21:55:54  I know cvs, subversion and git.
21:55:55  olsner: Less fancy what?
21:55:55  OK this is right up our alley and half the answers are misleading.
21:56:05  "To add to this, it is an open problem (known as the Church-Turing thesis)"
21:56:17  And transactions don't necessarily mean locking the whole table.
21:56:17  elliott: reply to "Or if you want something less fancy, rsync, ..."
21:56:34  On the *most* fundamental level?  I guess a computer is one of the components of the universe's wavefunction or something...
21:56:34  olsner: Yep
21:56:42  If queries are independent on the same table, they are still run in parallel, even updates.
21:56:49  twice11: Well, how do you propose to implement transactional config file modification??
21:57:00  Merging already done by the SQL system.
21:57:03  Unless you're saying every config file should be an SQL database running on a server or something.
21:57:32  Well, config file, sounds like something you usually don't update in day-to-day operation.
21:57:47  "static" is probably an excellent name for a directory containing CGI scripts.
21:57:50  So you don't really need transactions on it, or a database...
21:58:09  twice11: ...that's good, because nobody said config files should be databases...
21:58:17  I was telling tswett how to synchronise config files across multiple machines sanely.
21:58:26  "This is wrong. The Church-Turing thesis is just that, a thesis, not a problem: it *states* that computation simply means "what Turing machines and equivalents do"."
21:58:29  Someone nitpick.
21:58:30  i.e. a VCS or rsync, and then I said why the former is preferable (multiple independent modifications, for one).
21:58:34  Well, use a blob in a singleton table...
21:58:47  twice11: ...why do you think a database is assumed here?
21:58:50  We're talking about ~/.vimrc!
21:58:51  Any statement can be thought of as a question.
21:59:25  Seems I missed the context then.
21:59:56  That's interleaved discussions for you.
22:00:00  I just jumped on it when you claimed that SQL is likely not the solution and then talked about concurrent updates.
22:00:30  .vimrc sounds like a fine thing to put into $VCS_OF_YOUR_CHOICE
22:00:51  Yeah, I was talking about SQL likely not being suited for a different thing :P
22:01:41  CREATE TABLE vimrc ...
22:01:55  I probably should lop off one of this server's domain names.  Is there an easy way to tell Apache that if the client is asking for remy.s.zbasu.net, just give them a 404?
22:02:10 * Phantom_Hoover → sleep
22:02:11 -!- Phantom_Hoover has quit (Quit: Leaving).
22:02:39  tswett: Map that virtual host to a non-existing path, maybe?
22:03:25  I'll map it to /dev/null, thereby making some people a little bit angry.
22:03:47  "You're not supposed to use /dev/null!  It's the empty file, not the invalid directory!"
22:03:57  That probably won't work.
22:03:58  "But it *is* an invalid directory."
22:04:11  I guess I should email my hosting company telling them I lost my ssh key again.
22:04:28  elliott: you should have kept it in a SQL database so this wouldn't happen!
22:04:36  tswett: The computer died.
22:04:40  I hadn't yet backed up.
22:05:05  SQL servers make it easy to have a replicated server in sync...
22:06:17  Yeah.  You should have done that.
22:06:18  Hmm, I ought to see if I can do that higher-order query thing with acid-state; I've had a vague idea for it for a while and now that object persistence has been brought up...
22:06:38  tswett: ?
22:07:04  Actually I really just want something as nice as Durus is for Python; distributed persistent STM...
22:07:10 -!- boily has quit (Ping timeout: 260 seconds).
22:07:14  elliott: you should have kept it on a replicated synchronous SQL server farmy thing.
22:11:14  Gee.  So far, my CGI scripts work on the server if and only if they do not work on the command line.
22:11:32  tswett: just write ) or something
22:11:36  I suddenly feel a little bit like Karkat trying to write a ~ATH program.
22:11:37  run it on the command line, observe it failing
22:11:43  now you have a brilliantly working CGI script
22:11:44 -!- Ngevd has quit (Ping timeout: 252 seconds).
22:13:44  It seems like system(foo) doesn't work in CGI.
22:19:19  Perhaps the script doesn't have access to any executables...
22:19:53  Aha!  cd . works on the server.
22:20:34  But /bin/echo doesn't, even though that file exists...
22:22:11  This behavior doesn't seem to make sense.  If I run system('/bin/echo albatross'), I get an internal server error.  If I run system('/bin/echo'), my browser attempts to download the page.
22:22:34  If I comment the line out, it works as expected: I see text.
22:23:37  There goes the no-access-to-executables hypothesis.  system('set') doesn't work.
22:25:09  New hypothesis: it works if and only if the command has no output.
22:25:20  uaaaaaaaai
22:25:46  tswett: send headers first
22:25:47  duh
22:25:55  That's what I'm doing.
22:26:15  This works: http://pastebin.com/TQBvdTNs
22:26:22  Change "false" to "echo albatross", and it fails.
22:26:46  can't open that now. will look in ~5m
22:27:12  argh! that was some crappety-crap quality, rm -fr Season.5
22:27:13 -!- sebbu2 has changed nick to sebbu.
22:27:28 -!- augur has quit (Remote host closed the connection).
22:30:18  and seasons 6 and 7 too... so it goes
22:31:46 * tswett pats elliott on the head repeatedly.
22:35:03  what
22:39:51  tswett: yep, i was right.
22:39:57  tswett: you're not sending headers correctly
22:40:03  they must be terminated with two newlines
22:40:47  elliott: print sends a newline implicitly, doesn't it?
22:41:14  This program *does* output two newlines, so the only potential problem there would seem to be that it's outputting them wrong.
22:41:26  tswett: I'm pretty sure Python's print omits a newline if the string ends with one.
22:41:43  Anyway, try \r\n\r\n.
22:41:45  Rather than \n\n.
22:41:55  So sys.stdout.write('blah\r\n\r\n')
22:43:02  elliott: yeah, it doesn't work.
22:43:19  Shrug
22:43:23  Catch exceptions, print them
22:43:24  http://pastebin.com/nUVk8zg8
22:43:28  Catch exceptions, print them
22:43:36  It doesn't throw any exceptions when I run it on the command line.
22:43:37  But okay.
22:43:59  the command line is a different environment.
22:45:37 -!- ais523 has quit (Remote host closed the connection).
22:47:53  elliott: http://pastebin.com/NZQFH8UA
22:47:59  Still a server error.
22:48:18  Check server log filse
22:48:20  files
22:48:21  Oh, but now the system line isn't causing it.
22:49:00  ...I didn't import sys.
22:49:06  smart.
22:49:19 * elliott meant an except block around the whole thing, anyway
22:49:25  I think the cgi module has an exception handler thing you can activate.
22:49:39  Prints a pretty HTML page.
22:50:44  tswett: Yeah, put
22:50:44  import cgitb
22:50:44  cgitb.enable()
22:50:45  at the top.
22:51:22  "malformed header from script. Bad header=www-data: test.py"
22:51:25  That's not part of the header...
22:51:53  Yes, it is.
22:52:01  You print the header with sys.stdout.write.
22:52:07  Which prints an exception in the header block.
22:52:14  Exception traces make bad HTTP headers.
22:52:53  But printing the header isn't causing an error, is it?
22:53:04  But yeah, cgitb's probably a really good idea.
22:53:25   But printing the header isn't causing an error, is it?
22:53:27  you didn't import sys
22:53:34  you print the header with sys
22:53:35  ???????
22:53:37  Yes, but *now* I've imported sys.
22:54:08  And I'm still getting a plain ol' regular error.
22:54:11  does it work from the commandline
22:54:19 -!- Patashu has joined.
22:54:32  Yes.
22:54:39  what is the actual script at this point
22:54:43  also, why are you using CGI again
22:55:08  Because it seems easier than mod_perl or mod_python.
22:55:30  why would you use either of those
22:55:44  mod_python is unmaintained and I think deprecated, and I don't think many people use mod_perl any more
22:55:56  I don't want to use RISC OS or QNX, so I guess I'll go for Windows
22:56:33  just use django or bottle or something
22:56:46  Oh... right.  Django exists.
22:57:20  this project is going very well, I see.
22:57:34  just use mod_wsgi
22:57:43  that's what everyone does
22:57:49  Anyway, here's my code right now: http://pastebin.com/8zenkdpF
22:57:49  + Django or Bottle or 
22:57:55  It gives a plain internal server error.
22:58:03  The log file says, "malformed header from script. Bad header=www-data: test.py".
22:58:10  what does python test.py produce
22:58:28  Content-type: text/plain
22:58:28  > whoami
22:58:29  tswett
22:58:29    Not in scope: `whoami'
22:58:36  Plus a line break after the Content-type line.
22:58:45  You know, a blank one.  irssi eats those.
22:58:47  dunno
22:58:49  anyway https://docs.djangoproject.com/en/1.3/howto/deployment/modwsgi/ here you go
22:58:56  Thank you infinitely much.
22:59:14  I think the same applies to Bottle too
23:00:20  Yeah, Django is probably better.
23:01:34  tswett: oh, and see http://code.google.com/p/modwsgi/wiki/QuickConfigurationGuide /Delegation to Daemon Processes/
23:01:39  you probably want to do that (probably=definitely)
23:01:44 -!- ive has joined.
23:04:43  What's this mod_wsgi thing?
23:05:18  The Apache module to run WSGI apps.
23:06:06  Wow, Durus is <6000 lines...
23:06:56  What's WSGI?
23:07:17  http://en.wikipedia.org/wiki/Web_Server_Gateway_Interface
23:08:34 -!- sllide has quit (Read error: Connection reset by peer).
23:09:31  I see.  Is that the sort of thing I would use instead of Django, or alongside it, or qué?
23:10:20  tswett: Upon reading https://docs.djangoproject.com/en/1.3/howto/deployment/modwsgi/, did you get the idea that Django was hosting documentation for a competitor to it, and saying that's the recommended way to deploy Django...?
23:10:31  It's an API that both Django and Apache support.
23:11:11  Your sarcasm is praiseworthy.  I praise it.
23:11:12 -!- Sgeo|web has joined.
23:12:56  Hey, who knows Latin
23:13:13  ancient romans
23:13:17  Thanks
23:13:30  I know Latin-1
23:13:41  (Well, erm, hmm)
23:14:03  elliott: I can read some Latin and I can kind of dechiper some other Latin.
23:14:24  I can give you a decent guess what the plural of "lusus naturae" is, for example.
23:14:47  (Namely, "lusus naturae".)
23:14:58  tswett: Great! Wiktionary tells me that "durus" is a Latin adjective meaning "hard, rough (of a touch)"/"harsh (of a taste)"/"hardy, vigorous"/"unyielding, unfeeling, stern"/"oppressive, severe"; what's the opposite.
23:15:06  (In Latin, naturally.)
23:15:11 * elliott HAS A LIBRARY TO NAME.
23:15:47  elliott: name it bob
23:15:54  elliott: what do you want the opposite word to *mean*?  Soft to the touch?  Gentle?  Weak?  Pliable?
23:15:59  Hmm, mollis looks close: "soft, delicare to the touch"/"pliant, flexible"/"mild"/"tender, weak"
23:16:19  tswett: ALL OF THE ABOVE!
23:16:25  Problem: "mollis" is sort of an ugly word?
23:16:30  Yeah, that looks like a pretty darn good word.
23:16:39  Okay fine I'll call it mollis.
23:16:44  s/delicare/delicate/
23:16:45  elliott: well, what do you think of "lentus"?
23:16:59  "sticky, tenacious"/"slow, sluggish"
23:17:04  "indifferent, phlegmatic"
23:17:07  MY LIBRARY IS NONE OF THESE THINGS
23:17:26  what's wrong with 'bob'?
23:17:34  olsner: What's Bob in Latin
23:17:36  elliott: use a different language, perhaps.  Mol, mole, muelle, mou...
23:17:43  tswett: Oh, mollis even names durus as an antonym on the page.
23:17:45  elliott: we're both looking at exactly the same documents, aren't we.
23:17:54  I find that quite thoroughly likely.
23:18:09  Have to say I won't be going with the Portugese translation.
23:18:13  s/gese/guese/
23:21:00  Go with the Lojban translation!
23:21:13  ranti
23:22:38  Yeaaah.
23:23:56  tswett: Hmm, "molli" is a bit nicer. But then it'd be a dative or ablative singular!!!!!
23:24:16  And that would RUIN the PURITY.
23:24:39  weich
23:25:18  mola pehmeä morbido svak blando
23:25:29  Totally.
23:25:38  SVAK
23:45:17  Ooh, Django has apps.  It comes with authentication and stuff.
23:47:20 -!- ive has quit (Ping timeout: 245 seconds).
23:47:26 -!- tswett has quit (Changing host).
23:47:26 -!- tswett has joined.
23:49:00  tswett: Hi tswett Warrigal ihope.
23:50:44  I see you're referring to me by--wait, how old are you now?  Are you an adult now?
23:50:54  No, you're not.
23:50:57  You're at most 16.
23:51:27  I'm afraid that elliott suffers from a rare form of dyslexia.
23:51:35  He is, in fact, swapping the digits in his age.
23:51:46  * tswett (~Warrigal@unaffiliated/ihope) has joined #esoteric
23:52:04  You evidently have three names. It is the only thing I can conclude.
23:52:21  Ooh.
23:52:35  His preferred name is one of those pieces of uncertainty that surround him
23:52:41  pikhq: so he's actually St Atom 61?
23:52:44  tswett: And I believe I'm a legal adult in Scotland, but not here.
23:52:53  Which is relevant only because I googled it and Scotland came up.
23:53:06  Yeah, I guess depending on the place, I go by tswett, Warrigal, or both adiosToreador and Tavros Nitram.
23:54:18  elliott: Neat trick. You can become a legal adult without leaving whatever-the-fuck-you-call-the-UK.
23:54:29  I call the UK the UK.
23:54:57  pikhq: I somewhat suspect it's about where you live, not your location.
23:54:59  And I guess those are just the online handles I've been using recently.  There's also uorygl, which I stopped using recently, and Tanner, the name I use when looking at something...
23:54:59  I mean, it's a bit hard to call it a country... Seeing as that would be England, Scotland, Wales, and Northern Ireland.
23:55:07  Er.  Someone.
23:56:32  tswett: there's another online handle you're recently using
23:57:27  Ooh, right.  conduitController.
23:57:55  elliott: call me whatever the fuck you want, as long as people know who you're referring to.
23:58:05  tswett: Okay, whatever the fuck you want.
23:58:31  elliott: I am ninety-nine point nine nine nine percent sure you will stop referring to me by that name within the week.
23:58:36  But yeah.
23:58:57  For example, don't call me "Mister Snuggles".  People won't know who you're talking about.  Don't call me "Ed Murphy" either.
23:59:07  Deewiant: What does list-tries have over TrieMap... oh, it predates it by several months.
23:59:20  tswett: Okay, Ed Murphy.
23:59:33  I should attempt to understand finger trees, I think
23:59:42 -!- augur has joined.

2011-11-08:

00:00:01  Sgeo|web: http://apfelmus.nfshost.com/articles/monoid-fingertree.html
00:00:12  ooh, ty
00:00:19  elliott: ooh, here we go.  Call me Pupa.
00:00:26  tswett: No.
00:00:48  Or call me "tswett, you should shut the fuck up, you've had too much caffeine lately".
00:01:38  I'm having trouble distinguishing your behaviour from normal :)
00:01:47  Do you always have this much caffeine?
00:02:03  Nope.
00:02:18  Though, elliott.  What do I do in this channel on most days?
00:02:30  Not talk, but I presume that's because you don't actually pay attention to it.
00:02:47  Yeah.
00:03:13  I've only seen the .. syntax in extensions to record stuff
00:03:37  Sgeo|web: It's a placeholder.
00:03:52  Sgeo|web: Note how it isn't code.
00:03:55  "we want the annotations to fulfill"
00:04:40 * Sgeo|web is too tired for this
00:05:01  That's what you always say.
00:06:35 * Sgeo|web has no desire to use global mutable variables, the ReaderT stuff should be sufficient I think
00:07:05  Sgeo|web: Monad transformers over IO are ugly. You're binding a C API, so you're going to have to do a lot worse than global variables.
00:07:13  They won't be exposed from outside the package, so it's quite irrelevant.
00:07:40  Basically you're saying you'd rather infect all user API code with an implementation detail, than use one of the provided facilities intended for binding to C APIs.
00:10:23  Sgeo|web: But *shrug* your code
00:10:31  unsafePerformIO to make a global variable is intended to be used like that?
00:11:43  unsafePerformIO was originally part of the FFI addendum to accomplish things like that. See http://hackage.haskell.org/package/safe-globals for a way to hide the ugly.
00:13:06  Suppose something stupid like multiple invocations of the library.. somehow
00:14:04  That's impossible.
00:14:14  Unless the AW API supports that.
00:14:21  Which we've established it doesn't, because it does awful global things.
00:15:35  A hypothetical library that does
00:15:42  You don't have one of those.
00:15:57  Or are you trying to write one binding that works with multiple hypothetical APIs without changing the implementation??
00:16:08  Heck, why not just make one Haskell library that binds to every C library ever without changing.
00:16:11  dwim :: IO a
00:16:17  Hmm, I probably should ask just to check that aw_int and the like don't send stuff over the wire
00:17:04  If it does, it would be .. absurd to set every global to a blank variable
00:17:11  What?
00:17:33 -!- tiffany has quit (Quit: nyu~).
00:17:42 * elliott doesn't think you have any idea what you're doing, if you think there's going to be a large number of globals, or if you think "blank variable" means anything.
00:18:06  The C API has a large number of .. global-like things
00:18:19  What makes you think you need to reflect those in Haskell?
00:18:25  And I'm just hoping they're stored locally, rather than on the server
00:18:32  I was suggesting these for internal use, because that's what you'd talked about earlier.
00:18:49  elliott: I wouldn't, I would just.. I think kmc suggested setting those to a default value every function call
00:19:04  Except for the ones that the function call needs modified
00:19:14 -!- TeruFSX_ has joined.
00:19:16  Maybe it would help if you actually communicated the API issues involved rather than just asking as vague a question as possible.
00:19:32 -!- TeruFSX has quit (Ping timeout: 258 seconds).
00:20:00  elliott: Many function calls require setting what the API calls attributes, such as using aw_int_set("AW_TELEPORT_X", 0); before the function call
00:20:19  Events also often receive data which you retrieve by, e.g., aw_int("AW_TELEPORT_X")
00:20:22  Googling doesn't suggest those quotes should be there.
00:20:30  They look like #defines.
00:20:39  Oops, you're right
00:20:59  Sgeo|web: Every call has a defined set of parameters, yes? Going by http://www.activeworlds.com/sdk/aw_object_add.htm.
00:21:26  Then you just need to poke each parameter, make the call, and read the parameter result.
00:21:26  Yes
00:21:31  (In the thread that's making the API calls, etc. etc. etc.)
00:22:05  I'm... pretty sure I only need to ensure sequential access
00:22:16  Rather than all having to be in the same thread
00:22:49  Sgeo|web: So you want a global lock. Now we'll spend 3 minutes as you convince yourself that these two situations are equivalent.
00:23:09  What two situations?
00:23:19  This was the situation that I was using the global lock for
00:23:41  Sgeo|web: The situation of having one thread making all API calls, and every thread acquiring a lock on each API call.
00:23:57  Also remember that Haskell threads are very cheap, if that's what you're worrying about (tens of thousands at a time is fine).
00:24:19  I thought global lock is easier to implement
00:25:14  Both are trivial. Which one you want depends on your situation.
00:28:01  Man, this code is hard to get a handle on.
00:28:05  (Not your thing.)
00:33:48  There, now my machine is simultaneously running Debian (naturalismo), Windows 7, and #1 contender for the "Even Worse than Windows" prize Mac OS X.
00:34:58  Gregor: At least OS X doesn't need Cygwin.
00:35:18  cygwin in wine on os x? :)
00:39:08  olsner: You should liberate this Python code by porting it to Haskell for me (note: incredibly non-trivial)
00:40:11  first: liberate it from its misery using rm -fr
00:40:21  But it's gooooood.
00:40:41  then rewrite in haskell sometime, I might not feel like helping you with that :P
00:41:57  nah, python code can't be good... I'll admit that it can work, but *good*?
00:42:45  olsner: It's an ACID STM database with both file-based and network access in less than 6000 lines of code!
00:43:39  aha! haskell has STM built-in! :)
00:43:56  hmm, or maybe it's a library, w/e
00:43:56  olsner: um, it's missing the database part.
00:44:06  ghc has built-in _in-memory_ STM
00:44:16  there's no way you can extend that to be file-based or w/e
00:44:39  bah, how can it be hard? I have no knowledge of this being hard!
00:45:12  olsner: you'd have to completely rewrite the ghc stm internals :P
00:45:15  Doesn't the M refer to memory?
00:45:22  So for things other than memory stuff, why call it STM?
00:45:32  Because it's still memory, it's just non-volatile memory
00:45:39  elliott: trivial! (given a sufficently smart reader to finish the exercise)
00:45:41  Also because you have to have all the database in-RAM in Durus and similar
00:46:07  olsner: I think the one thing every expert can agree on is that STM is not trivial :P
00:46:27  their readers are just not sufficiently smart
00:47:19  Could STM be implemented without compiler support?
00:47:24  Albeit potentially inefficiently?
00:48:01  I think they tried putting it in .NET and it was horribly inefficient, don't recall how much compiler support it took
00:48:06  Sgeo|web: trivially
00:48:45  olsner: tons; the problem is that stm sucks without purity
00:49:59  Would it be particularly wrong for me to name a type Object?
00:50:21  Not only will people kill you, but they might kill your family too.
00:50:23  Object - not even once.
00:51:20 * Sgeo|web should learn lenses
00:51:29  I can only assume that lenses make dealing with records easier
00:54:25  lenses are just Lens whole part = whole -> (part, whole -> part)
00:54:34  name :: Person -> (String, String -> Person)
00:54:45  name (Person name age email) = (name, \name' -> Person name' age email)
01:00:56  Sgeo|web: ^
01:01:05  Ok
01:01:24  + helper functions for modification, accessing within state monad + template haskell to derive them from a record definition
01:02:42  hmm, 6000 lines of python, hopefully that's more python than I've ever read before
01:03:01  meh, probably not :(
01:04:23  olsner: Actually 5288 (+ 461 lines of mostly boilerplate)
01:04:50  mostly boilerplate? doesn't that apply to the rest of the python code?
01:05:00  unless it's all obfuscated python!
01:06:42  olsner: it's actually remarkably boilerplate-free :P
01:06:58  which makes it hard to read, I'm trained to ignore all but every fifth line when reading Python
01:07:29 -!- ive has joined.
01:07:34  :)
01:19:38 -!- copumpkin has quit (Quit: Computer has gone to sleep.).
01:37:00  Lenses form a category too, I think. And yes that is very good if you need more you could use a Template Haskell code to automatically generate the lens codes for each field.
01:43:53  Can Template Haskell generate Template Haskell?
01:44:03  Sgeo|web: I don't think so.
01:44:31  But you might be able to fake it.
01:45:00  time for *Template* Template Haskell!
01:45:09  @quote majestic
01:45:09  monochrom says: Welcome to #haskell, where @remember's are in majestic stereo!
01:45:17  wrong majestic quote, nm
01:46:28  There should be some macro system that can do things with a Haskell code. That way you could generate Template Haskell and various other things. (There is C preprocessor but that isn't very good for Haskell.)
01:47:21  I mean, a macro system that could be used to make up do-notation, rather than requiring do-notation built-in to Haskell.
01:49:15  For some reason I was under the impression that quasiquoters take arbitrary strings
01:50:10  They do.
01:50:33  @quote majestic
01:50:33  Anonycale says: Welcome to #haskell, where your questions are answered in majestic stereo!
01:50:39  @quote majestic
01:50:40  Anonycale says: Welcome to #haskell, where your questions are answered in majestic stereo!
01:50:41  @quote majestic
01:50:41  monochrom says: Welcome to #haskell, where @remember's are in majestic stereo!
01:51:03  @quote template.haskell
01:51:03  ghc says: Can't represent a guarded lambda in Template Haskell
01:51:05  @quote template.haskell
01:51:05  ghc says: Cannot desugar this Template Haskell declaration
01:51:06  @quote template.haskell
01:51:06  ghc says: Can't represent a guarded lambda in Template Haskell
01:51:07  @quote template.haskell
01:51:07  ghc says: Can't represent a guarded lambda in Template Haskell
01:51:37  meh, can't find it *shrug*
01:52:25  @quote majesty
01:52:25  malcolm says: I don't believe you need to invoke the full awesome majesty of Template Haskell
01:52:43  now, imagine the awesome majesty of template template haskell
01:53:31  :D
01:54:21 -!- copumpkin has joined.
01:54:54 -!- ive has quit (Ping timeout: 276 seconds).
01:55:41  It occurs to me that Stanislav probably doesn't like Haskell
02:08:33  Quasiquotes do take arbitrary strings; it is sometimes the problem due to if you are using a Haskell syntax in them, and you have |] in a string or comment; it won't work.
02:11:40  If you combined Template Haskell with a system of macros that works well, you might be able to make up do-notation and more-notation using that, and possibly such things as anonymous classes, autonumbering, and so on.
02:14:07  Vorpal: BTW, Aero was off by default, it's smart about not turning it on on systems without good graphics.
02:16:57 -!- ive has joined.
02:18:33  Isn't more notation your idea?
02:19:23  Sgeo|web: Yes it is. But I mean a more general system that could be used to make up such things, and even things already in Haskell such as do-notation.
02:20:16   It occurs to me that Stanislav probably doesn't like Haskell
02:20:21  see comments on nock or urbit post or w/e
02:20:27  but it's okay because: stanislav is an idiot!
02:20:39  elliott: nock? urbit?
02:20:58  http://moronlab.blogspot.com/2010/01/nock-maxwells-equations-of-software.html
02:20:59  http://moronlab.blogspot.com/2010/01/urbit-functional-programming-from.html
02:21:00  read in order
02:28:18  In Nock, I don't quite get ^
02:28:38  It seems to be meaningless when applied to a cell
02:28:52  ...or is that the point?
02:29:20  Hmm, I see other things with similar stuff
02:29:27  I'm going to guess that that's the point
02:33:20  hmm, haven't got my thinking brain in, that looks tricky
02:33:24  Sgeo|web: The Urbit post doesn't actually require any understanding of Nock, FWIW
02:33:39 * Sgeo|web is now reading the Urbit post
02:33:43  I've never actually done the challenge, but might sometime
02:37:04  "These C functions, or jets, will take noun arguments and produce noun results. In between, they can do whatever the heck they want - so long as they produce the same result as the actual Nock formula."
02:37:07  This sounds familiar
02:40:29  "On Mars, SIN is taken to an extreme. Logically, Urbit is a single broadcast network - a single big Ethernet wire. Everyone sees everyone else's packets. "
02:40:41  I was about to complain about security, but that's stupid, if you want security, encrypt it
02:41:51  Nobody tell Sgeo|web how IP routers work.
02:42:22  At least SIN forces people to realize it
02:46:44  "Read the whole thing. Haskell fans, you'll know exactly where you can stick your monads."
02:46:45  o.O
02:47:05  There is a distinction between monads in general and monadic I/O
02:47:19  The guy is hardly an expert
02:47:21  (on Haskell)
02:47:40  Monads and monadic IO are regularly conflated even by Haskellers
02:48:10  elliott: They are?
02:48:18  Well, not _good_ Haskellers.
02:48:22  Monadic I/O isn't even fundamentally monadic in any way.
02:48:29  It's just a convenience thing.
02:48:51  But it's trivial to find a tutorial written by someone good enough at Haskell to write real applications in it that talks about how monads are there to let you isolate IO side-effects.
02:48:52 -!- CakeProphet has joined.
02:48:53 -!- CakeProphet has quit (Changing host).
02:48:53 -!- CakeProphet has joined.
02:49:31  Oh, well, *tutorials*, sure.
02:49:49  good morgen comraderies
02:50:59  Good IO to you.
02:51:01  I mean monad.
03:01:56  Sgeo|web: this is the particular stanislav remark I was directing you to: "Algebraic types and immutability: Yuck. Your Haskellian / type-theoretical mis-spent youth is showing. Actual computers contain rewritable storage and will likely always contain it. This is something to be celebrated, not a set of genitalia to be shamefully hidden behind a Christian fig leaf."
03:02:19  he then proceeds to link to that stupid land of lisp comic whose own author happens to be a haskell fan :P
03:02:51  I remember seeing someone say that data stores are monads
03:02:59  I have no idea what that means precisely
03:05:31  " For instance, to write Urbit in Haskell, you would need a Haskell interpreter written in Haskell. "
03:05:43  What does ghc-api etc. count as?
03:06:00  not homoiconic at all, and practically irrelevant in context
03:14:39 * Sgeo|web attempts to understand FRP
03:15:35  RIP Buick "Pimpmobile" Skylark, bereaved from us by the unwavering yet abiding clutches of the sibling forces of time and entropy (and perhaps the recklessness of its owner). Though it met its end in the shrinking confines of a large industrial steel compactor, it will always be remembered as the glorious mechanical steed that it was, matched only by the unbridled power of 150 horses and maybe better cars.
03:16:52  ...Did Conal invent FRP?
03:16:57 -!- Jafet has joined.
03:18:02  Sgeo|web: yes? why is this surprising
03:18:06  "FRP was invented by a HUMAN???"
03:39:44  Would it be a terrible idea to try to make an FRP version of the AW stuff?
03:43:16  yes
03:45:10  Why?
03:45:20  Don't answer because I don't understand FRP
03:46:11  yep! also because fitting existing C libs to FRP is painful. you would want reactive-banana, and that's way more suited to gui frameworks than network stuff
03:48:21  "as the library can be hooked into any existing event-based framework "
03:50:34  Sgeo|web: yes, i have used reactive-banana, i am aware of how it functions
03:50:50  Huh, I didn't know you could put a where clause there
03:51:58  where
03:52:49  https://github.com/HeinrichApfelmus/reactive-banana/blob/master/reactive-banana-wx/src/Arithmetic.hs line 41
03:53:49  it's a declaration
03:53:52  declarations have where clauses
03:54:12  I guess I thought only top-level declarations could do that
03:58:09  Is reactive-banana good in general?
03:58:14  Or just for hooking into existing stuff?
03:59:11  what is there but hooking into existing stuff
03:59:26  you don't live in a world where your library - opengl, sdl, gtk, whatever - uses frp, do you?
04:00:37  So, addHandler is provided by reactive-banana
04:01:30  No, wait, fromAddHandler
04:01:31  And newAddHandler
04:02:43  newAddHandler is not always needed, it is just a helper
04:03:20  Still not quite sure what it does, but I guess its type is IO (EventSource ())?
04:03:24  hey, I found The Best Language Ever http://bondi.it.uts.edu.au/
04:03:33  it has more braces than lisp
04:04:09  Sgeo|web: read the example
04:04:33  I am
04:04:54  Oh, right, EventSource is application-defined
04:05:45  Patashu: looks cool
04:06:47  Somehow, fromAddHandler knows to take a ...so, fromAddHandler always takes a pair of AddHandler a, and a -> IO ()
04:07:06  uh, no
04:07:43  http://www-staff.it.uts.edu.au/~cbj/patterns/13012009/ found the bondi examples
04:07:47  let cloud = Banks [Bank (Name "Cloud",Accountss [Accounts (AccountName "Qin",Balance 3333.00)],TermDepositss [TermDeposits (TdName "Cloud",MinDeposit 500,Period 1,Rate 3.25)])];;
04:08:17  doesn't look unreasonable
04:08:51 * Sgeo|web has no idea what <$ is
04:08:52  :t <$
04:08:53  parse error on input `<$'
04:08:56  :t (<$)
04:08:56  forall a (f :: * -> *) b. (Functor f) => a -> f b -> f a
04:09:08  Oh right, that thing
04:09:14  :t ($>)
04:09:15  Not in scope: `$>'
04:09:20  boo
04:10:30  :t mapAccum
04:10:30  Not in scope: `mapAccum'
04:12:29  roll :: () -> StdGen -> (Reels, StdGen)
04:12:31  Uh, why
04:12:33  Why the ()
04:13:50  ?
04:14:38  http://hackage.haskell.org/packages/archive/reactive-banana/0.4.3.0/doc/html/Reactive-Banana-Implementation.html this is a little clearer, tbh
04:15:43  As is http://hackage.haskell.org/packages/archive/reactive-banana/0.4.3.0/doc/html/Reactive-Banana-Model.html when I stop being scared of the scary type, I think
04:16:05  model is MUCH clearer
04:16:17  trust me
04:16:34  note how that omits
04:16:36  import qualified Reactive.Banana.PushIO as Implementation
04:16:38  Sgeo|web: ^\
04:17:36  .Implementation has an example though
04:17:38  >.>
04:18:22  read Model. if you can't grok Model you will fail at the lower-level implementation of THE SAME API
04:19:05 * Sgeo|web is reading
04:19:20  Seems simple so far, and I finally understand Behavior and Event, I think
04:20:07  behavior is a signal. Time -> a
04:20:20  like audio, or mouse position
04:20:21  ....apply takes a function which itself changes over time?
04:20:35  event is a set of one-off occurrences
04:20:44  e.g. a key being pressed
04:20:54  [(Time,a)]
04:22:14  What sort of things are Behavior f (a -> b)? An example?
04:23:08  any behavior constructed with the provided functions that is function-valued
04:27:41  I don't see any such
04:27:52  Except for making constant values into behaviors
04:28:24  Sgeo|web: see FRP class
04:29:19  Uh, stepper, I guess?
04:30:13  That ...no?
04:31:43  ANYHING ENDING -> Behavior
04:31:45  sheesh
04:32:23  i.e. stepper, accumB
04:32:31  Two of those assume I have events that are functions
04:32:53  so make them. sheesh
04:32:53  (yeah yeah, bad use of "are")
04:36:13  Wait, FRPs are Applicative
04:36:43  ....Not entirely sure if that really helps me
04:37:26  uh
04:37:27  no
04:37:31  behaviors are
04:37:40  frp is just "implementation of frp"
04:37:54  its a code organisation tool for model vs implementation
04:38:00  nothing semantic
04:39:28  ShShould I shy away from Discrete?
04:39:48  no
04:42:41  Does the Alternative/MonadPlus instance for Parsec follow the identity law?
04:43:04  not left identity!
04:43:13  or was it right
04:43:50 -!- DCliche has joined.
04:45:04  counter = accumulate ($) 0             (fmap (+1) eventUp              `union` fmap (subtract 1) eventDown)
04:45:15  How does fmapping onto an Event produce a Behavior?
04:45:25  I know it doesn't follow the right zero law; but some people (myself included) think the right zero law should not be one of them, and only the left zero law and monoid laws should apply.
04:45:46  (That is, for MonadPlus. For Alternative, the left zero law is optional too.)
04:45:50  I guess I should look for accumulate in reactive-banana
04:45:55  But I don't see it
04:46:16  where's that from
04:46:25  http://apfelmus.nfshost.com/blog/2011/03/28-essence-frp.html
04:46:31  that post is old
04:46:57  api has changed
04:46:58 -!- Darth_Cliche has quit (Ping timeout: 260 seconds).
04:47:09  i think that's accumB or sth
04:47:58  Here is an instance which I believe does follow the identity laws:  instance Alternative IO where { empty = fail []; x <|> y = catch x $ \e -> modifyIOError (\z -> if z == userError [] then e else z) y; };
04:49:09  It follows the left zero law, too; so you could make it MonadPlus as well if you do not care about the right zero law.
04:50:14  Did you know that the Gregorian calendar and Gregorian chant are both named after popes but they are two different popes?
04:50:44  Do you think my instance follows the laws correctly? If not, please tell me what is wrong with it.
04:52:46  Sgeo|web: in the comments you can see accumukate
04:52:51  become accumB
04:55:42  ty
04:59:14  http://stackoverflow.com/questions/4113207/frp-reactive-how-to-use-filtere is this the same package?
04:59:20  What would be the correct parameters to define the Ecclesiastical moon in Swiss Ephemeris? What would be the parameters to define artificial satellites? Are either of these possible?
04:59:33  No
04:59:40  zzo38: that No was not to you
04:59:59  Sgeo|web: see reative-banana tag
05:03:36  The parameters are: epoch of elements, equinox, mean anomaly at epoch, semi-axis, eccentricity, argument of perihelion, ascending node, inclination, and whether it orbits the Earth or the Sun. Any of these parameters can have T terms where T = (tjd - epoch) / 36525. For example, the intramercurian Vulcan uses:  J1900,JDATE, 252.8987988 + 707550.7341 * T, 0.13744, 0.019, 322.212069+1670.056*T, 47.787931-1670.056*T, 7.5
05:03:58  I think maybe I should see things in Behaviors and Events as "trapped" (bad terminology, I know), in an Applicative, and I use <$> and <*> the way I might with a monad
05:04:08  No do notation though
05:05:48  Sgeo|web: A monad is really applicative too, but the way it is programmed in Haskell doesn't make it do that normally.
05:06:28  zzo38: I know that monads are applicatives, but not all applicatives are monads
05:13:51 -!- MDude has changed nick to MSleep.
05:33:59  gah
05:34:02  durus, reveal your secrets
05:35:07  @src Alternative
05:35:07  class Applicative f => Alternative f where
05:35:07      empty :: f a
05:35:07      (<|>) :: f a -> f a -> f a
05:43:13 * elliott very briefly considers demanding Sgeo|web write his code for him.
05:45:28  Patashu: bondi looks very interesting.
05:45:39  bit light on documentation..
05:48:46  demanding sgeo|web to write your code: a good idea????????
05:51:24  monqy: you might like my code, it will be a good code (once it writ)
05:51:40  oH???
05:52:30  monqy: yes: a fully-ACID object persistence store with STM semantics
05:52:54  tl;dr: write program with standard STM transactional semantics, get reliable, durable file-based storage
05:53:16  mm
05:53:21  later: transparent operation on datasets larger than memory (perhaps), server support
05:54:17  monqy: now, guess what language has an existing, industrial-strength, corporate-backed, open-source, performant ~5500 line implementation of all this already
05:54:20  (do not cheat; good luck guessing)
05:54:32  (yes, including full transactional STM semantics and server support)
05:54:37  (ok not the larger-than-memory stuff but w/e)
05:55:42  it's too late, I cheated hours ago
05:55:49  by briefly looking at the chat back then
05:55:58  monqy: bad person
05:56:01  ;_;
05:56:12  monqy: but seriously, who is gifted with all that knowledge and then forced to write python code :(
05:56:48  bad people
05:56:53  i mean
05:56:56  bad people forced
05:57:03  i feel bad for whoever was forced
05:58:30  monqy: http://sprunge.us/NjEY
05:58:35  this is the kind of thing i have to base my code on :P
05:59:29  :(
05:59:55  i;ve have to lots of python recently because schoole (ha) ha()
06:00:05  monqy: incidentally i'd like to just use acid-state but it has severe limitations for me :(
06:00:10  :(
06:00:18  you have to declare the transactions on your data-type upfront
06:00:26  and can't remove them or anything, only add
06:00:28  not compositional
06:00:50  i think the only way to fix that with acid-state's model would be if you could serialise functions
06:04:08 -!- DCliche has quit (Quit: You are now graced with my absence.).
06:04:20  monqy: but yeah... hopefully it will be good???
06:04:34  hopeuflly
06:05:43 -!- mtve has quit (Ping timeout: 260 seconds).
06:06:03 -!- mtve has joined.
06:06:38  monqy: it would be nice if i could find a way to benefit from sharing... like, you don't want adding an element to a huge map to write out the huge map again in the transaction, you'd like to just write out the additional stuff and have a pointer back
06:06:40  will have to see
06:06:53  would be especially nice if i can do that for every structure, not rewriting each structure for this
06:17:21  monqy: gdtodntihgt monqey
06:17:33  goodotnighte
06:17:34  goudnihgt
06:17:57  to do: read acid-state's Log.hs and things, read durus, zzzzzzzzzzzzzzzzzzz
06:18:00 -!- elliott has quit (Quit: Leaving).
06:31:01 -!- Zuu has quit (Ping timeout: 244 seconds).
06:34:40  Is the ring of sets normalizable?
06:36:50  Probably not.
06:42:36 -!- oerjan has joined.
06:48:06 -!- Jafet has quit (Quit: Leaving.).
07:24:35 -!- zzo38 has quit (Remote host closed the connection).
07:33:39 -!- ive has quit (Ping timeout: 256 seconds).
07:44:41 -!- CraZzYboY90 has joined.
07:44:56 -!- CraZzYboY90 has left.
07:49:43  lol I crashed x
07:57:01 -!- monqy has quit (Quit: hello).
08:12:27 -!- ive has joined.
08:33:41 -!- ive has quit (Quit: leaving).
08:56:46 -!- Madoka-Kaname has quit (Read error: Connection reset by peer).
08:58:31 -!- Madoka-Kaname has joined.
08:58:31 -!- Madoka-Kaname has quit (Changing host).
08:58:31 -!- Madoka-Kaname has joined.
09:05:45   Vorpal: BTW, Aero was off by default, it's smart about not turning it on on systems without good graphics. <-- nice
09:12:09  Yes, it only enables Aero if your WEI is 3 or more.
09:12:14  (Windows Experience Index.)
09:12:39  fizzie: the global WEI or the graphics one?
09:12:45  the former doesn't really make sense
09:13:13  after all my desktop scores 2.5 due to a slow hdd for windows 7. The rest of the components score 7.5-7.8
09:13:14  I think it's the base score.
09:13:19  hm
09:13:28  But not sure.
09:13:52  I don't remember it areo was on or not after install. It is turned off now though, and with windows classic theme on
09:16:49  http://windows.microsoft.com/en-US/windows-vista/Windows-Experience-Index-Understand-and-improve-your-computers-performance-in-Windows-Vista "Base score: 3.0 to 3.9 .. Windows Aero will typically be enabled automatically on the computer."
09:17:13  They might well have changed the logic on seven, though.
09:17:35  After all, the scores themselves go up to eleven^W7.9 now.
09:18:07  fizzie: what was the old max value?
09:19:21  5.9 in Vista.
09:19:36  strange they didn't make it an even 6.0
09:19:52  It also starts at 1.0 and not zero.
09:19:56  heh
09:41:27 -!- oerjan has quit (Quit: leaving).
09:45:36 -!- ais523 has joined.
09:50:41 -!- ais523 has quit (Ping timeout: 245 seconds).
09:50:47 -!- ais523 has joined.
09:57:13  I can't tell if I'm well-rested or tired.
09:57:29  I got 6 WHOLE HOURS OF SLEEP in a row so I should be way more rested than usual.
09:57:46  however, I feel like dog shit. This is probably because I only got 6 hours of sleep still.
09:59:27  ouch
09:59:44 * CakeProphet is a zombie.
10:00:25  I haven't slept well either. And I have to drive today.
10:00:27  Ugh.
10:00:35  oh did I mentioned that a deer hit my car. Yes, that car I just bought to replace my old car not too long ago.
10:00:45  Vorpal: that's always fun. Driving on no sleep is great.
10:00:50  an adventure!
10:00:58  I slept some, just not as much as I would want to
10:01:03  like 6 hours instead of 8
10:02:20  CakeProphet: besides I will be picking up another guy on the way to university, since we live in the same town and study the same stuff at university we usually travel together to save money.
10:02:26  oh and it is my parents car
10:02:32  parents'
10:04:30  fun.
10:04:44  I got a speeding ticket in my parent's car when I was borrowing it to drive when I didn't have a car.
10:04:54  a few weeks ago.
10:05:12  but yeah, lately I've been doing that 4-hour nap thing.
10:05:16  I mean, not voluntarily
10:05:36  it just happens that I'll go to bed at like 10 AM and wake up at 2 AM unable to go back to sleep until the sun comes up
10:07:08  CakeProphet: I doubt I will get a speeding ticket.
10:07:16  I never had problems keeping the right speed
10:08:11  that's the one bit of recent misfortune I could have prevented, I suppose.
10:09:08  besides it is a Fiat (though a large station wagon one), so not exactly a fast car anyway. And although there is no automatic speed thingy, the terrain is kind of hilly so you need to adjust speed all the time anyway, hard to forget about speed then.
10:11:57  well it's usually not that I forget speed it's just that I don't consider the same speeds to be fast that other people seem to
10:12:11  eh?
10:12:19  there are mountainous roads where I live and I still drive like a madman. :P
10:12:20  doesn't it say on the sign what the speed limit is
10:12:25  oh yes.
10:12:31  that's beside the point. :P
10:12:36  and you have a speed indicator in the car?
10:12:39  yep.
10:12:43  then what is the issue
10:12:56  well see...
10:13:02  maybe this is just an American thing, but
10:13:20  some people intentionally break the law by driving fast because they think the speed limits are ridiculous.
10:13:38  I am one such person.
10:13:44  anyway hardly mountainous roads here, just slightly hilly. I live on a plain, it is just that the road goes over the few hills that exist.
10:13:57  CakeProphet: that is rarer in Europe
10:14:03  I've noticed.
10:14:09  in previous speed limit conversations.
10:14:11  CakeProphet: beside you could lose your driving license from that if you go too fast.
10:14:14  with Europeans.
10:14:20  right
10:14:30  CakeProphet: don't you have speed cameras in US?
10:14:46  not many. I've seen maybe one or two in my lifetime.
10:15:01  and they're easy to spot and slow down for, hardly something to make me paranoid all the time.
10:15:05  quite a few here
10:15:09  and there are mobile ones too
10:15:22  also I know the speed traps along my commonly taken routes, so I know when to slow down.
10:15:24  as in, mounted on a trailer, that they park somewhere for a day
10:15:28  so I can pretty much drive as fast as I want otherwise.
10:16:04  most American drivers on the highway are in fact speeding much of the time.
10:16:22  strange
10:16:33  I'm one of those insane people that are driving faster than the "normal" speeders.
10:16:38  ...
10:16:44  irresponsible
10:17:05  I have have to get an insane number of speeding tickets to lose my license, but yes I suppose.
10:17:14  CakeProphet: anyway, where you speeding when you hit that deer?
10:17:20  I'm not chalking up my speeding ticket to mere bad luck.
10:17:28  Vorpal: yes, though I would say it was more like the deer hit me.
10:17:38  would you have been able to stop if you had not been speeding?
10:17:41  basically crashed itself into the side of my car. I didn't even see except for in the corner of my eye.
10:17:54  a split second thing really. nothing I could do.
10:18:02  not when speeding indeed
10:18:12  but maybe you should try keeping to the speed on the signs
10:18:13  not at any speed. >_>
10:18:29   oh did I mentioned that a deer hit my car. Yes, that car I just bought to replace my old car not too long ago. <-- what happened to the previous car?
10:18:30  I could have been going 25 mph and the same thing would happen.
10:18:49  Vorpal: it got old.
10:18:51  ah
10:18:56  engine started knocking.
10:19:08  CakeProphet: anyway you have to keep real life and GTA separate :P
10:19:16  believe me I do.
10:19:27  didn't sound like it
10:19:58  sheesh, Europeans are all strict on their speed limit stuff it seems. :P
10:20:39  it's an incredibly minor thing. I drive reasonable speeds when appropriate. Such as in traffic.
10:21:10  to say that I should follow a flat rate of speed as posted by a sign is ridiculous, in my opinion.
10:21:34  of course you have to drive slower sometimes. I never claimed otherwise
10:21:39  but that should be the upper limit
10:21:57  especially when the people setting up those signs generate large amounts of revenue from people going faster than said number on sign.
10:22:25  I mean, I wouldn't drive 70 km/h on a road marked 70 km/h if the condition of the road, visibility and other traffic didn't allow that in a safe way.
10:23:03  CakeProphet: wait what? Please don't tell me that speed limits is done by for-profit corporations in US....
10:23:15  local government.
10:23:30  right, crazy state system in US
10:23:33  though a number of private businesses can benefit.
10:23:49  for example there are online ticket paying services.
10:23:52 -!- ghost_ has joined.
10:23:57  huh
10:23:59  who make money from setting up their services for local governments.
10:24:02  things like that.
10:24:07 -!- hagb4rd has joined.
10:24:20 -!- ghost_ has quit (Client Quit).
10:24:29  so in my mind speed limits are just a way to take money from me. I suppose I've been doing a good job of allowing them to do that, since I ignore them. :P
10:24:42  ... you are insane
10:25:00  well, no need to state the obvious.
10:26:23 * CakeProphet has generally never thought of himself nor intended to ever be a law-abiding citizen.
10:26:39  cakeprophez.state=insane; //consider it noted
10:30:01  bbl, university
10:55:45 -!- GreaseMonkey has quit (Quit: The Other Game).
11:40:45 -!- augur has quit (Remote host closed the connection).
11:41:40 -!- Patashu has quit (Quit: MSN: Patashu@hotmail.com , Gmail: Patashu0@gmail.com , AIM: Patashu0 , YIM: patashu2 , Skype: patashu0 .).
11:45:56 -!- pikhq_ has joined.
11:46:10 -!- pikhq has quit (Ping timeout: 252 seconds).
12:01:03 -!- ais523 has quit (Ping timeout: 258 seconds).
12:01:15 -!- ais523 has joined.
12:01:15 -!- ais523 has quit (Changing host).
12:01:15 -!- ais523 has joined.
12:02:16  @src forever
12:02:17  Source not found. You untyped fool!
12:06:48  > sequence$[[1,2,3],[4,5,6]]
12:06:48    [[1,4],[1,5],[1,6],[2,4],[2,5],[2,6],[3,4],[3,5],[3,6]]
12:21:06 -!- augur has joined.
12:30:12  Why the $?
12:40:01 -!- ais523 has quit (Ping timeout: 240 seconds).
12:41:06 -!- ais523 has joined.
12:41:37  CakeProphet: the council here in Birmingham is actually cracking down on private parking enforcer people
12:41:49  some of them are acting vaguely dubiously
12:47:16  Private parking tickets have been a very contentious issue here in Finland too for a while now.
12:47:35  ISTR that a court did sort-of legitimize them quasi-recently though, much to the disappointment of some/many.
12:48:05  Also they had given a parked-on-the-grass-because-answering-an-emergency ambulance a parking ticket or something like that.
12:53:31  Right; the district court and the court of appeal both said private companies just plain aren't allowed to write parking tickets, but in June this year the supreme court reversed their decisions and said it's okay.
12:55:09  (Though the... uh, committee for constitutional law, has stated that according to them private parking-enforcement is unconstitutional.)
12:59:30  Also another funny story: one parking enforcement company (Parkki Oy) apparently had ticketed the car of another; then the other company sent the first one a 350 eur "clean-up" bill because their car had a sticker saying you're not allowed to attach/leave any material (like ads or whatever) to it.
13:04:08  fizzie: good to hear this story here, I've been too lazy to follow the discussion :)
13:04:35  I've been too don't-have-a-car to follow it.
13:04:51  Though apparently they've been leaving parking tickets to bicycles too.
13:05:12  Not that that's exactly enforceable, what with no license plates or anything.
13:05:49  (The companies in question seem to be just a slight bit overly profit-oriented.)
13:10:34 -!- boily has joined.
13:12:16  fizzie: I find it's best not ask any questions of Madoka-Kaname concerning what the hell they're doing with lambdabot.
13:12:29  also, I private parking tickets = the most absurd thing I've ever heard of.
13:12:54 * CakeProphet actually still has an unpaid parking ticket from the police department on his campus.
13:14:46  -I
13:15:37  As far as I can figure out, the current status in Finland is that they can write tickets, but they can't force the owner of the car to pay them if e says someone else was driving, so they'd have to go to court, which they haven't so far done with anyone; on the other hand, there's also a law initiative thingie to explicitly legalize private parking enforcement, but it's not law yet.
13:17:10  in the case of campus parking tickets they can simply put a hold on my account.
13:17:32  which makes it impossible to do important things like fix financial aid, register for classes, and ultimately graduate.
13:17:52  until I give them $25 for not having a little sticker on my car. :)
13:18:22  so absurd.
13:24:06  @hoogle String -> String -> String
13:24:06  System.FilePath.Windows (<.>) :: FilePath -> String -> FilePath
13:24:06  System.FilePath.Posix (<.>) :: FilePath -> String -> FilePath
13:24:06  System.FilePath.Windows addExtension :: FilePath -> String -> FilePath
13:25:05  CakeProphet: there was a case found recently where a carpark had rigged its pay-and-display ticket machines to deliberately miscount the money put into them
13:25:24  and then they clamped cars which stayed longer than the amount actually printed on the ticket, and charged ridiculous amounts to unclamp them again
13:27:03  it's vaguely interesting that they got caught, actually
13:28:12  > unwords $ map shows [1,2] ++ map (++) ["red", "blue"] <*> [" fish"]
13:28:14    "1 fish 2 fish red fish blue fish"
13:28:26  ais523: I would think they stick out like a sore thumb if they're charging ridiculous amounts.
13:28:37  for the unclamping? no, they all do that
13:28:52  and that's being clamped down on too
13:28:59  ha. ha. ha
13:29:01  :P
13:29:11  not deliberate, but I noticed it before I pressed return
13:29:17  > intercalate ", " $ map shows [1,2] ++ map (++) ["red", "blue"] <*> [" fish"]
13:29:18    "1 fish, 2 fish, red fish, blue fish"
13:31:17  what is the purpose of shows again?
13:31:39  er, I mean, obviously I know what it does but what is the benefit of it over using ++ explicitly.
13:37:39  @hoogle (Applicative f) => f (a -> b) -> f a -> b
13:37:40  Control.Applicative (<*>) :: Applicative f => f (a -> b) -> f a -> f b
13:37:41  Control.Applicative (<**>) :: Applicative f => f a -> f (a -> b) -> f b
13:37:41  Control.Applicative liftA :: Applicative f => (a -> b) -> f a -> f b
13:38:21  CakeProphet:
13:38:28  > let f 0 = ""; f n = f (n-1) ++ show n in take 5 $ f 500000
13:38:28  "12345"
13:38:28  (4.61 secs, 478035512 bytes)
13:38:28  > let f 0 = id; f n = f (n-1) . shows n in take 5 $ f 500000 ""
13:38:28  "12345"
13:38:30    "*Exception: stack overflow
13:38:30    "12345"
13:38:30  (0.64 secs, 215319872 bytes)
13:39:16  ah
13:40:16  would it be fair to say that shows is similar to CPS??
13:42:02  > iterate (. shows n) id ""
13:42:03    Couldn't match expected type `[GHC.Types.Char] -> t'
13:42:03          against inferr...
13:42:12  :t iterate
13:42:14  forall a. (a -> a) -> a -> [a]
13:42:37  erm, nevermind :P
13:45:43 -!- zzo38 has joined.
13:45:47 -!- Phantom_Hoover has joined.
13:53:30 -!- variable has quit (Excess Flood).
13:59:37 -!- variable has joined.
14:28:24 -!- Guanxin has joined.
14:28:46 -!- Guanxin has left.
14:34:34 -!- copumpkin has quit (Ping timeout: 248 seconds).
14:35:08 -!- copumpkin has joined.
14:35:29 -!- sllide has joined.
15:03:55 -!- copumpkin has quit (Quit: Computer has gone to sleep.).
15:18:20  I found some things about new version of Microsoft Excel. If you enter a text into a cell that starts with "A1-" then it will be formatted as an Islamic date (even in the English version). There is also a BAHTTEXT function which converts a number to Thai text and adds "Baht" suffix. There is no function for English numbers text. Apparently they added that feature for the purpose of ordering Thai food.
15:28:12 -!- copumpkin has joined.
15:32:03  According to Wikipedia, "Baht" is the Thai currency. So it doesn't seem to make sense to use that for ordering Thai food within the United States.
15:39:17 -!- MSleep has changed nick to MDude.
15:43:34  "It's been suggested (by an anonymous Excel MVP) that the Excel programmers enjoy Thai food, and they created this function to facilitate email orders to Redmond Thai restaurants. This theory has not yet been confirmed -- but then again it hasn't been denied either."
15:54:15  Actually from what I can find, the real reason seems to be that it was included in older Thai versions of Excel, but the new version includes all the functions including non-English functions.
15:57:31  I try to run Sakura MML compiler to MIDI, but I get error message about ConvToHalfSign1.
15:59:56  In addition, all menus are completely unreadable; they have only question marks on them.
16:01:06 -!- chickenzilla has quit (Ping timeout: 245 seconds).
16:01:10  Maybe it is for Japanese system only?
16:01:11 -!- chickenzilla has joined.
16:04:23  zzo38: forall f g xs.  map f (map g xs) = map (f.g) xs
16:04:24  http://www.channel4.com/programmes/spaced/4od
16:04:25  Phantom_Hoover: You have 1 new message. '/msg lambdabot @messages' to read it.
16:04:26  Oh god.
16:04:27  Oh god.
16:04:29  is this rewrite rule used by default in GHC?
16:04:32  What if it never comes back up.
16:04:38  also the corresponding filter rule?
16:04:39  What if they've taken it down for good.
16:05:07  IT'S JUST LIKE THE LAST EPISODE OF SPACED
16:05:54 -!- Ngevd has joined.
16:16:41  I don't know if such rewrite rule is used by default
16:16:48  Hello!
16:23:05  zzo38: ah just read about "list fusion"
16:23:18  that uses rewrite rules to remove intermediate lists between some common list functions.
16:25:38  {-# RULES
16:25:39  "++"    [~1] forall xs ys. xs ++ ys = augment (\c n -> foldr c n xs) ys #-}
16:25:48  is the rewrite ruke for ++
16:25:53  *rule
16:26:05 -!- elliott has joined.
16:27:03  the map rewrite rules are quite clever.
16:33:42  elliott: hey, how are you?
16:33:59  annoyed at tswett for stealing ais523's challenge to me :)
16:34:10  He did?
16:34:15  see a-d
16:34:40  Where am I seeing a-d?
16:35:03  Ngevd: it's a reference to the nomic Agora
16:35:05  http://agoranomic.org
16:35:10  Oooh
16:35:11  we had a suspicion it might be Turing-complete
16:35:12  Ngevd: duh. :P
16:35:24  so I challenged elliott to try to prove it, as e had proven for believed-state-of B Nomic
16:35:29  That big scary nomic
16:35:34  ais523: I did? wow
16:35:43  Ngevd: it's not scary, there's like 6 active players and nothing's happening
16:35:44  didn't you write a some-language-to-B compiler?
16:35:49  ais523: oh, hmm, I do recall that
16:35:55  elliott: it's coming out of a slump atm
16:35:57  Which is the big scary nomic?
16:36:00  back when i used to be cool :)
16:36:08  Ngevd: none, nomics aren't popular enough to be big and scary
16:36:13  Ngevd: Agora is often called scary, but it isn't really
16:36:14  blognomic players think agora is scary because they're silly
16:36:16  or at least shouldn't be
16:36:23  agora is also very slow unlike blognomic :P
16:36:25  people see the numbers on the ruleset and get scared
16:36:32  ais523: i had a dream where blognomic died because i went idle, btw
16:36:47  that's a weird dream
16:36:55  I like how LibreOffice autocorrecst naive to naïve and then highlights it as a spelling error.
16:37:07  with a recommendation of naive.
16:37:20  ais523: what's surprising is that they actually took it seriously, and moved to another game, which was hosted on something almost like a google group, but defying all logic
16:37:31  CakeProphet: heh
16:37:57  elliott: don't google groups defy most logic anyway?
16:37:58  I had a dream that I could administer a nomic
16:38:04  Then it all went horribly wrong
16:38:07  there's only a bit remaining left to defy
16:38:08  Or was that real life?
16:38:11  ais523: you haven't seen my dream programs
16:38:19  no, probably nor has anyone else
16:38:20  I have a dream I was playing awesome pen and paper RPGs
16:38:28  ais523: I have
16:38:30  do you see them visually? or do you just dream they're there?
16:38:33  
16:38:44  ais523: I dream that I have friends who like them and play them.
16:39:02  then I wake up to the painful sting of reality.
16:39:02  ais523: I see them visually in a dream!
16:39:30  I just thought I autotabbed, but I really just typed "Cake"
16:39:50  ais523: does blognomic usually spend entire dynasties constantly making proposals and never actually using them?
16:39:56  elliott: often when I'm dreaming, I don't see things as images unless I concentrate on what they look like
16:39:57  elliott: yes
16:40:05  normally, no more than two and a half rules, on average, will actually be releant
16:40:16  maybe I won't bother deidling
16:40:18  the others will be used once and then forgotten
16:40:31  Sad category: http://en.wikipedia.org/wiki/Category:Games_of_nomic
16:40:53  ais523: oh, and after i found out blognomic died, i realised it was another victory for agora :)
16:41:10  the perfect military strategy: annoy your opponent until you both get bored; the opponent dies weeks later
16:41:11  releant? deidling? what is going on in this conversation.
16:41:24  *relevant
16:41:31  and deidling is the opposite of idling
16:41:34  oooooooooh :>
16:41:37  as in, starting to do something, rather than starting to do nothing
16:41:43  ais523: well I got what releant was.
16:41:45  sometimes I fly around in a spaceship :>
16:41:50  but deidling did not look like de-idling.
16:42:05  ais523: don't, CakeProphet has ruined that smiley :'(
16:42:13  what are you talking about it's awesome. :)
16:42:18  i even told him about ESO's official copyright claim to it! but no.
16:42:24  it's the most obnoxious emoticon ever.
16:44:01  you can't get your emoticons mixed up with your peoplethoughts. It's not a very fertile mindset.
16:44:04  10:20:39:  it's an incredibly minor thing. I drive reasonable speeds when appropriate. Such as in traffic.
16:44:04  10:21:10:  to say that I should follow a flat rate of speed as posted by a sign is ridiculous, in my opinion.
16:44:04  oh, I get it: Americans are equipped with a psychic ability to tell whether there's other cars on the road they're on or not
16:44:23  elliott: no, just mirrors and stuff.
16:44:40  also I drive a lot at night, in a small town.
16:44:45  oh! so then you have infinitely fast reflexes when a car comes into view. ok
16:44:50  but no I'm not infallible. :P
16:45:20  elliott, Americans treat cars as we treat pedestrians, by and large.
16:45:24  CakeProphet: hmm, maybe we should institute some sort of maximum speed you can drive at on the roads, so that for the occasional case where a car does come in when you're not expecting it, your lack of fallibility doesn't lead to accidents or death... hmmmmmm...
16:45:31  s/fall/infall/
16:45:38  Ngevd: heh
16:47:12  elliott: better solution: be American and therefore the best drivers in the world.
16:47:26  Nah, Icelanders are better
16:47:42  Don't you read your Scandinavia and the World?
16:47:58  10:23:03:  CakeProphet: wait what? Please don't tell me that speed limits is done by for-profit corporations in US....
16:47:59  10:23:15:  local government.
16:47:59  10:23:30:  right, crazy state system in US
16:48:12  Vorpal: it's not crazy when you have that much populated landmass
16:48:22  also local as in city government usually.
16:48:24  not states.
16:48:33  depending on the road probably.
16:48:54  actually no I think it's completely local except for interstate highways.
16:49:07  because speed limit changes between jurisdictions I find.
16:49:12  even on some highways.
16:49:27  though interstate highways tend to be fairly consistent for the most part.
16:49:52  12:59:30:  Also another funny story: one parking enforcement company (Parkki Oy) apparently had ticketed the car of another; then the other company sent the first one a 350 eur "clean-up" bill because their car had a sticker saying you're not allowed to attach/leave any material (like ads or whatever) to it.
16:49:54  finland :')
16:50:10  and yeah, good luck trying to administrate every minute detail of American society from Washington DC.
16:50:13  Wait... you can do that in Finland?
16:50:49 -!- elliott has changed nick to Iambdabot.
16:51:10  > "hi"
16:51:11    "hi"
16:51:22  Yam be da bot?
16:51:31  @tell Madoka-Kaname Stop fucking with me already!
16:51:31  Consider it noted.
16:51:34 -!- Iambdabot has changed nick to elliott.
16:51:35   Vorpal: it's not crazy when you have that much populated landmass <-- indeed, but some of the stuff that is local govt in US should probably be federal IMO.
16:51:38  bbl
16:51:51  Vorpal: probably more the other way around.
16:52:20  elliott: that's a popular sentiment in the US.
16:52:32  more with conservatives but not exclusively.
16:52:44  i'm no libertarian :)
16:53:15  apparently everyone in the Us is a libertarian.
16:53:21  provided they know what it is.
16:53:32  (gross exaggeration)
16:54:05  hmmm I think I've got my first Skype spam.
16:54:21  "NOTIFICATION URGENT ALERT is calling you"
16:54:35  elliott: you use chrome/chromium right?
16:54:39  Wow, I didn't realise that exists, CakeProphet
16:54:40  yes
16:54:53  Ngevd: I was oblivious as well.
16:55:01  elliott: is there a way to make chrome and/or chromium save open tabs when you close it, and restore them when you open it.
16:55:10 -!- sebbu2 has joined.
16:55:10 -!- sebbu2 has quit (Changing host).
16:55:10 -!- sebbu2 has joined.
16:55:18  Vorpal: yes. it's on the first page of preferences. did you check?
16:55:35  elliott: I did, I somehow missed it. Beats me why it isn't default though...
16:55:56  it's kind of annoying since i use sleep as tab gc :)
16:55:56  Vorpal, that feature reeeeaaally annoys me
16:56:01  elliott: I like how that is still somehow one of the reasons people prefer Firefox over Chrome, even though they both support it.
16:56:05  I close browsers to clear my mind
16:56:09  heh
16:56:23  i still have it on though, to recover from accidental closes
16:56:24  Ngevd: I just let them pile up until the browser gets sluggish, then I gc.
16:56:27 -!- sebbu has quit (Ping timeout: 248 seconds).
16:56:38  It's how I escape TVTropes
16:56:41  Vorpal: good luck with that, chromium takes about ten windows filled with tabs to get sluggish ime
16:56:51  and that's on this puny machine
16:56:51  this doesn't work well on my new computer though, it takes ages for firefox to get sluggish now
16:57:04  I mean, on my old computer 70 tabs was about it, now it is more like 700
16:57:10  (in firefox)
16:57:37  I think I'd disable reopening tabs on startup if the history was better.
16:57:56  I want my history to track which tabsets in which windows I had open at each given moment, and be able to answer questions like "what tab did I click a link in to open this other tab?".
16:58:03  elliott: btw I have to say that modern firefox are way less of memory hogs.
16:58:13  firefox versions*
16:58:16  History was accurate when browsing was one tab in one window, but that hasn't been the case for years now.
16:58:45  elliott: depends on what sort of history. The "you opened this page this day" kind of history still works, doesn't it?
16:58:55  elliott: have you noticed that sometimes chrome doesn't preserve google-searches-from-"omnibar" in history sometimes?
16:58:59  sometimes?
16:59:11  CakeProphet: dunno
16:59:33  Vorpal: yes, it records all pages you opened. here's another kind of history that also preserves that: an unordered set of pagse
16:59:34  pages
16:59:36  hmmm, and now for some reason I can't get it to do that.
16:59:47  Vorpal: the point is, since tabs have become commonplace, history is now throwing away a lot of relevant information
17:00:01  elliott: hm...?
17:00:09  what more is there than timestamp?
17:00:09  Vorpal: what
17:00:21  Vorpal: ok, history records the state of the browser
17:00:25  in varying degrees
17:00:26  throughout time
17:00:28  yep
17:00:33  degree 0: set of urls, no time information
17:00:37  sure
17:00:38  degree 1: ordered set of urls with timestamp information
17:00:43  yep
17:00:55  degree 2: ordered set of urls with timestamp /and tab layout/ information
17:00:59  ah
17:01:09  degree 3: ordered set of urls with timestamp /and tab layout/ information, plus tracks tab parentage (open link in new tab -> current tab becomes parent of created tab)
17:01:18  yes, degree 3 would actually be really useful for me
17:04:03  well okay
17:05:04 -!- monqy has joined.
17:07:13  I wonder if I should write still one round of assignments.... :/
17:07:30  elliott: also instead of maintaining only a linear sequence of history for each tab it should be a multiway tree. :) so you can move forward, back, left, and right.
17:07:30  I'm afraid not many will care to do them.
17:07:39 -!- sebbu3 has joined.
17:07:39 -!- sebbu3 has quit (Changing host).
17:07:40 -!- sebbu3 has joined.
17:07:55 * elliott is guilty, I only did half of them
17:08:03 * elliott bad person
17:08:11  tabs are unnecessary, if you have w3m-style history
17:08:15  I haven't even clicked the link.
17:09:04  hmm, what does w3m history look like?
17:09:14  i've wanted a unified history-tab system for aaages
17:09:14  atehwa: no dupdog assignments? :P
17:09:34  "prove that dupdog is not Turing complete" would be a good assignment
17:10:00  elliott: w3m stores all history (also future history) until you explicitly throw it out
17:10:18  when you enter a new page, the page is added in history right above the page you came from.
17:10:19  Future history?
17:10:26  Ngevd: when you go back I assume
17:10:29  Aaah
17:10:34  it creates "future" history.
17:10:38  Ngevd: those pages where you've been but "back"-ed from.
17:11:15 -!- sebbu2 has quit (Ping timeout: 258 seconds).
17:11:53  atehwa: Meh, that doesn't store any hierarchy of recency information. :/
17:12:01  (Or, where does it move the history entry if you open a page from history?)
17:12:04  CakeProphet: I can look into that.  But I was thinking about making the next assignments in language design, not use.
17:12:41  atehwa: how about proofs instead!
17:12:51  elliott: the new pages are always added to the part of the history list where you currently are
17:12:58  hmm
17:13:05  actually I suppose the problem would be "prove that dupdog is or is not Turing complete"
17:13:05  CakeProphet: there were some proof assignments already
17:13:34  elliott: basically, w3m history could be augmented with link paths and recency lists, but I don't know if it improves it any
17:13:47  Would Hiafu be a compiled language?
17:14:05  atehwa: well, I need something along those lines, so that I can switch between currently-relevant pages without the hundreds of pages I opened in the meanwhile being in the way
17:14:09 -!- tiffany has joined.
17:14:10  12:13 -NickServ(NickServ@services.)- Information on kallisti (account kallisti):
17:14:17  my web browsing strategy is not exactly conventional.
17:14:20  or productive.
17:14:21  12:13 -NickServ(NickServ@services.)- Last seen  : Mar 13 01:25:08 2011 (34 weeks, 2 days, 15:48:07 ago)
17:14:27  how long does it take for nicks to expire?
17:14:31 * CakeProphet wants that one.
17:14:32  Hello, tiffany
17:14:49  elliott: I sometimes specifically throw out cruft history in w3m in order to have a nice, clean history :)
17:14:53  hai
17:14:56  CakeProphet: /j #freenode, /nick kallisti, ask for it to be dropped
17:15:01  Howare you?
17:15:03  atehwa: that's revisionism :'(
17:15:10  elliott: no I think this is a trait common to some people. programmers especially.
17:15:11  s/wa/w a/
17:15:18  (that kind of web browsing "strategy")
17:15:31  cakeprophet, this one was inactive for 2 years and I went to #freenode and it took them like a month to finally drop it for me :s
17:15:36  CakeProphet: most people say "oh i have SO MANY TABS" to mean enough tabs that you can't see the titles on one window
17:15:44  i mean enough tabs that you can't see the titles in ten irregularly-sized windows
17:15:46  elliott: basically, you could have a "history trashcan" for history that you haven't used for a long time :)
17:15:49  Would ~ATH count as an esoteric programming language?
17:16:05  no, only a joke language
17:16:19  apocalypse oriented programming.
17:16:45  Can I make an article for it?
17:16:48  On the wiki?
17:16:50  elliott: oh did I mention Act 6 is going to be amazing?
17:17:03  you know, now that I actually understand what is going on.
17:17:07  Ngevd: probably, but it wouldn't be very interesting, and nobody else would ever edit it :)
17:17:29  you should probably just link to the wikia article on it, if you /really/ want to.
17:17:36  anyway, hmm
17:17:44  i can work on my fun code or my easy code
17:17:47  easy code!
17:17:56  but fun code is fun
17:18:03  elliott: so you just leave tabs open so that your feeble monkey brain can revist them later to remember what the fuck you were doing?
17:18:07  monqy: but hard
17:18:14  hard is fun when it's fun
17:18:19  CakeProphet: no, i just leave tabs open because why would i close a tab
17:18:26  monqy: ok then you write it for me if it's so fun
17:18:32  but code is never fun :(
17:18:41  to sanely navigate a set of tasks at once.
17:18:42  >_>
17:18:43 * Sgeo|web always has excessive amounts of tabs open
17:18:58  I tend to prune my tabs these days.
17:19:30  having a workspace sort of system would be nice. basically tabsets instead of multiple windows.
17:19:39  CakeProphet: itt: firefox tab groups
17:19:41  (they suck)
17:19:45  I have a bonsai browser.
17:19:49 -!- tiffany has quit (Remote host closed the connection).
17:19:51  I prune it often  and keep it small
17:19:51  is it any good
17:19:53  elliott: never used those, but I doubt it's what I want.
17:20:06  However, it looks like a full-sized browzer
17:21:06  16:04:23:  zzo38: forall f g xs. map f (map g xs) = map (f.g) xs
17:21:06  16:04:29:  is this rewrite rule used by default in GHC?
17:21:10  CakeProphet: see RULES pragmas in base source
17:21:37  elliott: already did. logread moar nub.
17:21:54  actually just look at the first thing I say when you join.
17:25:06 -!- tiffany has joined.
17:25:15  my hobby: patronizing people via ancient internet protocols.
17:25:27  good hobey
17:26:13  I wonder if IRC will be in Ancient History of PRogramming classes, 2000 years in the future.
17:26:32  what a terrible class that would be.
17:27:13  And then, according to the Internet Jargon File, Tim Berners-Lee, a member of the Equites class, created the Internet
17:27:28  actually that probably won't happen as we'll be part of the singularity hivemind and thus have infinite access to all accumulated human knowledge.
17:27:46  im future envy
17:28:29  another possible scenario: breakdown of civilization, end of human existence, long distances of space travel rendering an all-encompassing singularity impossible, etc, etc, etc, etc.
17:28:32  CakeProphet: or society has collapsed.
17:28:33  man predicting the future is fun.
17:28:53  snap
17:30:01  CakeProphet: I don't think you can make any reasonable prediction about that topic further into the future than 10-15 years.
17:30:26  I'd go on the safe side and say 10 years.
17:30:45  5-10
17:31:02  or you know, 1-10
17:31:56  man future speculation was so much easier when it was just about spaceships, lasers, and flying cars.
17:32:03  I predict that the Singularity will occur the day before Kurzweil would otherwise have died.
17:32:04  now we're getting into freaky shit.
17:32:12  (Joke shamelessly stolen from elliott.)
17:32:26  well of course, there could always be a meteor, nearby supernova or other rare catastrophic event, sure. But climate change probably haven't caused civilization to collapse in the next 15 years. Nor does singularity in that time frame seem likely.
17:32:35  Phantom_Hoover: I'm gonna feel really bad for the guy if it hits us the day after Kurzweil dies.
17:32:56  elliott, I'd be so busy laughing I'd be written off as a sociopath.
17:33:12  Phantom_Hoover: It's OK, those thoughts would be extracted from your head before they actually happen.
17:33:14  Nearby supernovae are fairly unlikely, IIRC.
17:33:38  Phantom_Hoover: isn't there one possible candidate that could fry us in gamma iirc?
17:33:41  elliott: america god bless neutrino
17:34:08  elliott: Do I have any reason for choosing one of reactive-banana or Yampa over the other?
17:34:09  Vorpal, a GRB, which is a fair deal less well-understood than a supernova, making predictions hard.
17:34:20  (Possibly replacing Yampa with that fork, Animas I think)
17:34:23  Phantom_Hoover: sorry, but what is a GRB?
17:34:49  Sgeo|web: use reactive-banana
17:34:56  Sgeo|web: but don't, if you're trying to do AW stuff
17:34:58  I wonder to what degree standardization lockdown (is there an actual term for that?) will slow down technological progress.
17:34:58  Gamma ray burst; an extremely bright, highly directional burst of gamma rays.
17:35:05  Phantom_Hoover: I thought those were caused by supernovas?
17:35:22  CakeProphet: nobody cares about standards
17:35:36  elliott: err. USB?
17:35:41  elliott: well I suppose they get revised pretty drastically over the years.
17:35:42  There are two kinds of them based on spectral data, and one of those is hypothesised to be caused by a certain class of supernova.
17:35:44  in any case.
17:36:00  elliott: Well, nothing wrong with making a normal monadic IO library for AW, then using reactive-banana on top of that, right?
17:36:00  Phantom_Hoover: ah
17:36:07  Vorpal: people regularly violate power specs for usb i believe
17:36:11  but will we be using HTTP like 100 years from now?
17:36:21  elliott: heh, so why does stuff not get fried?
17:36:39  Sgeo|web: you will find that frp does not help you at all here, at least not in current forms. but certainly, you will waste your time regardless of what i say, so have fun...
17:36:49  elliott: I guess I was referring more to protocols and specs than "standards", or were we talking about the same thing?
17:36:49  Vorpal: because computer manufacturers don't care about the specs either?
17:36:53  heh
17:37:13  elliott: so you mean devices request more than 500 mA?
17:37:15  hm
17:37:26  dunno, i just recall stuff violating the power stuff
17:37:49  this is how garbage collection works in elliotts brain
17:37:53  replace concepts with stuffs.
17:38:18  stuff stuff stuff
17:39:17  CakeProphet: quite a broken algorithm there. Since obviously this thing was still reachable
17:40:44  iirc, devices draw more than allowed by default without actually asking
17:40:55  Vorpal: well the rules still remain but more specific references are replaced by stuff.
17:41:02  hm
17:41:33  Vorpal: I think that's the sound of Vorpal overthinking it. :P
17:41:41  CakeProphet: that is more like lossy compression .
17:41:49  s/ \././
17:41:52  yep, that's what that sound was.
17:42:14  CakeProphet: no it was me looking up how many "s" there were in "lossy" :P
17:43:18  sigh. this guy on reddit doesn't understand why a compiler could be faster than cpython
17:43:22  depends on how losy youar with yor verds.
17:43:26  elliott: whut.
17:43:37  elliott: I wonder if he knows how computers work.
17:43:43  CakeProphet: see http://www.reddit.com/r/programming/comments/m4rbs/python_3_implementation_in_haskell/c2y45o5 onwards
17:44:32  "So what? The compiler used for C is pretty state-of-the-art too" hahahahahahahaha
17:45:12  yeah he doesn't get interpreter vs. compiler.
17:45:44  honestly why do you talk to people on reddit
17:45:46  I don't understand.
17:45:57  almost every comment I've read on reddit is bad.
17:46:20  i have nothing better to do
17:46:36  CakeProphet: anyway /r/haskell is almost universally intelligent
17:47:13  gcc is pretty good, but it's no specialiser. It can't turn an interpreter into a compiler as good as itself.
17:47:17  that would be a good compiler.
17:47:27  I want that compiler.
17:47:50  or, specialiser?
17:47:59  yes, that is exactly what specialisers do
17:48:00  click the link and read
17:48:48  "Otherwise the only way to make it faster is by analysing the program during run time and get the information there (jit)."
17:48:51  it is THE ONLY WAY.
17:49:02  to write something that is faster than an interpreter.
17:49:46  is this what Python mind virus does to some unfortunate souls? or is this something else?
17:50:24  How could one compile a language that uses eval? I mean, besides including an interpreter with it
17:50:49  Sgeo|web: how could one compile a language that uses printf? i mean, besides including a formatted printer with it
17:51:10  you could also jit evals.
17:51:18  sounds kind of unwholesome.
17:51:22  jitting evals.
17:53:58 -!- Taneb has joined.
17:54:03 -!- Ngevd has quit (Ping timeout: 248 seconds).
17:55:11  elliott: you know you want to ditch @ and write the best programming language.
17:55:15  compiler.
17:55:20  That's what @ is, you moron.
17:55:55  hmmm, okay.
17:56:04 * Sgeo|web comments
17:56:27  Actually, that might not be the most accurate comment, but maybe it will be like a cluebat
17:56:39 * CakeProphet aggrieves.
17:56:47  or maybe you're just wasting time without the endless charm, charisma and genius required to make it an excellent fun time like i have
17:56:55  :DDDDDdddddddddd
17:57:18  elliott "not full of himself" hird
17:58:09  Maybe he is just thinking about eval?
17:58:46  I think he's just stupid.
17:58:50  >_>
17:59:31  elliott is clearly not full of himself.
17:59:36  and thinks super-fast optimized python builtins = magically the overhead of interpreting your program with no optimization isn't slow
17:59:36  He doesn't even capitalize his name.
17:59:40  People who are full of themselves capitalize.
18:00:05  Of course he's full of himself, it'd be extremely disturbing if he was full of someone else.
18:00:21 * CakeProphet is full of oerjan. 
18:00:25 * CakeProphet burps.
18:00:44  s/u/e/
18:01:26  Berps?
18:01:45  http://www.reddit.com/r/programming/comments/m4rbs/python_3_implementation_in_haskell/c2y51fr ;; I used bullet points, bold and em dashes, so you know it's authoritative.
18:02:05  "That is precisely the point you can barely optimize python via static analysis, the information to do that just isn't there."
18:02:05  but yes, if your Python libraries provided every single piece of code you needed as a C builtin... then your "Python code" is going to be fast.
18:02:22  I seeeeeeeeeeeeeeeeeeeeeeeee.
18:02:22  Gregor: You work in the dynamic languages space, find me one of them papers showing that the behaviour of dynamic programs can be statically analysed in the vast majority of cases.
18:02:23  I know I've read one.
18:03:02  There are lots of papers that make that claim, very few (to none) that back it up.
18:03:11  Gregor: OK, s/vast majority/some/ :P
18:03:26  optimizing python compiler + JITC eval = better Python
18:03:28  Gregor: This guy is claiming that you can do /so little static analysis/ that it's impossible for a static, optimising compiler to beat CPython.
18:03:35  Ever.
18:03:37  elliott: Yeah, that's kinda siwwy.
18:03:48  elliott: There's actually one on the dynamic behavior of Python out there somewhere :P
18:03:58  elliott: python is just too l33t and frexibul
18:04:34  I wonder if anyone's tried to write a Perl compiler.
18:04:41 * elliott tries to find other reasons to stop talkign to this guy
18:04:48  "While usually I'm quite the liberal/free market in economic terms" strike one
18:04:50  s/talkign/talking/
18:04:51 -!- Taneb has quit (Ping timeout: 245 seconds).
18:04:52  elliott: @
18:05:06  you've got a world to save.
18:05:09  "Ahh ok I think I understand where you're trying to get at. I agree modern fencing is definitely not nearly as effective as the real training and sword fighting people used to do. I think I misinterpreted "It wouldn't hold up against any sort of real combat"."
18:05:10  elliott: My attempt to find it again is yielding only my own paper :P
18:05:11  Phantom_Hoover: Look at this fucker.
18:05:15  Gregor: X-D
18:05:22  Gregor: I can cite that, there's no way he'd bother reading it!
18:05:53  elliott: My attempt to find it again is yielding only my own paper :P
18:05:55  ...
18:05:58  Oh snap, he plays DCSS. Strike two!
18:05:58  Wow, copypasta fail
18:06:03  Gregor: I can cite that, there's no way he'd bother reading it!
18:06:04  elliott: Here we go: http://dl.acm.org/citation.cfm?id=1862665
18:06:18  Eeexcellent.
18:06:19  elliott, ridiculous, obviously nicking your opponent on the wrist half a second before they run you through the heart makes you the victor!
18:06:20  elliott: HEY
18:06:27  Sgeo|web: Yo
18:06:45  I play DCSS... occasionally...
18:07:05  Sgeo|web: Wanna bet how long I'd bother arguing with you about the practicality of compiling Python?
18:07:15  THE RULES WORK.
18:07:30  elliott: you forgot the static compiler + dynamic JIT superfrankenstein
18:07:38  at the bottom of your list.
18:08:42  Gregor: Can I refer to you as a ``colleague''? It would boost my credibility.
18:08:49  lol
18:09:03  Gregor: THE BULLET POINTS AREN'T ENOUGH
18:09:05  We are colleagues at the International Institution of Esoteric Software Design
18:09:11  i.e. IIESD
18:09:11  #esoteric is friendship colleagues.
18:09:12  Great, thanks for the permission
18:10:20  http://www.reddit.com/r/programming/comments/m4rbs/python_3_implementation_in_haskell/c2y54qu
18:10:23  Gregor: *COLLEAGUEHI5*
18:10:32 -!- tiffany has quit (Quit: restarting in attempt to fix nvidia drivers).
18:10:38  elliott: *COLLEAGUEPOLITENOD*
18:10:42  X-D
18:10:53  Gregor: *COLLEAGUEFORMALHANDSHAKE* *COLLEAGUEBUSINESSMEETING*
18:11:03  Gregor: *COLLEAGUEAPPEARINGINSTOCKPHOTOSFORBADWEBHOSTINGCOMPANIES*
18:11:26  elliott: *COLLEAGUEPOINTINGATCOMPUTERMONITORWITHCHEESYGRINWHILEYOUTYPESOMETHING*
18:11:50  elliott: I think  calling it a static compiler + dynamic JIT superfrankenstein would greatly lend to your credibility.
18:12:10  Gregor: *COLLEAGUESUBVERTINGYOURATTEMPTSTOGETPROMOTEDSOTHATICANRISEABOVEYOUINTHEPECKINGORDERANDRUTHLESSLYCUTYOUDOWNBECAUSEIHATEYOU*
18:12:24  elliott: *COLLEAGUETENUREBITCH*
18:12:32  Gregor: *COLLEAGUEMURDER*
18:12:33 -!- tiffany has joined.
18:12:37  ~The End~
18:12:40  Daaaaaaaaaaaaaaaaaaamn
18:12:57  You scored a maximum 0.3/1000000000 points.
18:13:03  s/fix that sentence./
18:13:05  Probably the fastest Python you could get today would be by compiling Python into JavaScript and then running it with V8 ;)
18:13:25  :-D
18:13:30  Gregor: That's... that's ALMOST tempting.
18:13:32  compile to Lua and LuaJIT
18:13:54  Gregor:
18:13:54  Posted 28 Sep 2008 at 14:03 UTC (updated 28 Sep 2008 at 16:33 UTC) by lkcl
18:13:55  pyv8 is an experimental project to combine two-way python bindings to v8
18:13:55   with the python-to-javascript compiler from pyjamas. a simple test has shown a ten times
18:13:55   performance increase of python code converted and executed as
18:13:55   javascript, when compared to running the same program as python. (to be
18:13:57   fair, cython gives a 100 times performance increase).
18:14:15  elliott: Hahaha X-D
18:14:50  CakeProphet: I'm not confident, but I would be unsurprised if compiling Lua to JS and running it through V8 was faster than LuaJIT. LuaJIT is really good, but JS has gotten a stupid amount of attention lately, and the Lua->JS semantic difference is very small.
18:14:59  Gregor: Still, 10x over a naive bytecode interpreter is not that impressive :P
18:15:03  Maybe it's even better now though.
18:15:17  elliott: 'struth
18:15:40  Clearly the bestest would be Fythe lololol
18:15:51  I do wonder if you couldn't do better than Pyjamas though, I think they're more focused on their AJAX GUI/FRP stuff than their translator...
18:15:54  Gregor: I'm blissfully unaware of the thriving world of, uh, JS development.
18:16:14  CakeProphet: No you're not, if you've used any JS app in the past few years
18:16:23  I think this person is assuming that since you can't always infer types, you can never infer types
18:16:30  Which might be the sort of assumption I might make
18:16:40  We detected that your computer does not meet the system performance requirements for MapsGL. Learn more about the system requirements for MapsGL.
18:16:42  ;____;
18:16:44  elliott:  I... don't think that's how it works.
18:16:44  Have I mentioned that my new computer is supersweet?
18:16:46 * elliott crais
18:16:56  Gregor: Is it better than bsmntbombdood's?
18:17:04  elliott: Idonno, I don't have his specs.
18:18:07  `findlogs bsmntbombdood.*ghz
18:18:08  Gregor: What CPU, how much RAM :P
18:18:11  Nooo cheater.
18:18:13  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: findlogs: not found
18:18:16  That's not how you use logs anyway.
18:18:19  Eh :P
18:18:30  I got the part list anyway, so I'm like SO AUTHORITATIVE.
18:18:31  elliott: 6-core 3.1GHz AMD Phenom, 16GB RAM
18:18:54  Gregor: Well, same RAM, but he has a 4-core first generation i7... which is better, 'cuz, really, AMD.
18:19:07  Gregor: He gets bragging rights anyway on account of getting it years ago :P
18:19:08  Yeah, I shouldn't have let my friends talk me into getting an AMD >_<
18:19:17  I have a 3TB HDD :P
18:19:26  Gregor: Any SSD?
18:19:27  Gregor: huh cool I've got a V6 3.0L Honda V-Tec with I-can't-think-of-an-analogy-for-RAM
18:19:32  elliott: Nope.
18:19:41  Gregor: He has an 80 GiB first-gen Intel X25M SSD plus two 1 TiB drives in RAID-1.
18:19:53  elliott: So, I still have more SPACE :P
18:19:56  Gregor: Or at least, did, years ago :P
18:20:04  Fair 'nuff.
18:20:14  Gregor: More space, it's just that everything you can access goes so slowly you never get to appreciate it ;D
18:20:15  OK, how 'bout this then: Mine was expensive, but not as retarded-expensive as his must have been years ago.
18:20:23  Gregor: It was <$1,600.
18:20:29  I don't remember the exact amount. $1400?
18:20:41  So, not libc.so expensive!
18:20:50  X-D
18:21:11  Gregor: Talk me out of getting AMD BTW
18:21:26  There is literally exactly one reason I'm considering it and it's that I hate Intel :P
18:21:27  elliott: Running OS X in a VM with AMD is *cry*
18:21:38  I should find out about AMD's despicable business practices so I can hate them too.
18:21:54  Gregor: So... that's... how is that a disadvantage?
18:21:57  That lets me avoid OS X more effectively.
18:22:19  :P
18:22:32  My machine is SIMULRUNNING (<-- this is a word) Debian, OS X and Windows.
18:22:40  So I can have 2/3rds pain and suffering and 1/3 joy.
18:22:50  I should really have given bsmntbombdood a worse computer, because now the awful consumerist in me feels really bad about buying a computer worse than his.
18:22:50  3/3 pain
18:23:03  Thankfully, not being rich counteracts this!
18:23:22  I wonder if ECC RAM is less expensive these days. (Hahahahaha.)
18:23:54  More like Extra Crappy Crap RAM
18:24:37  Gregor: does access to RAM become a bottleneck when you increase the number of cores in your CPU or does it matter?
18:24:51  *not matter
18:25:02  CakeProphet: Depends. Generally yes. Depends on how NUMAlicious your CPU is too.
18:25:19  Gregor: FSVO Extra Crappy Crap equal to not broken :P
18:25:39  elliott: you should make FSVO a valid operation in @lang
18:25:52  But seriously though, I'd like to take this opportunity to laugh really hard at anyone who buys a new computer without an SSD system drive.
18:25:58  ha ha ha
18:26:28  Gregor: Ohh, there's the other reason I was considering AMD, i7s don't do ECC.
18:26:44  You have to get the vastly more expensive Xeons which need the vastly more expensive server motherboards because Intel are fucks.
18:27:32  intelllllll................................
18:27:55 -!- Taneb has joined.
18:28:37  http://promotions.newegg.com/ASUS/111511/696x288.jpg
18:28:42  im true red
18:28:43  nes
18:29:35  elliott: help. it seems that when I click on the "learn more" button, nothing happens.
18:29:41  you have learned
18:29:41  the most
18:30:22  `? learn
18:30:24  learn? ¯\(°_o)/¯
18:30:28  Gregor: I was going to ask why 16 gigs of RAM when you're not on Nehalem and then I felt really stupid.
18:30:35  16: Not a multiple of three? Instead a multiple of two?
18:30:37  You decide.
18:31:51  http://bytesizebio.net/index.php/2011/11/06/brainfk-while-waiting-for-a-flight/
18:31:56  WHY ARE YOU ON /R/PROGRAMMING YOU PIECE OF FUCKING SHIT
18:31:58  UPDATE II: Following Vincent's comment, here is a fixed version of the interpreter. This time it should work with nested loops. Thanks Vincent.
18:32:00  DIEEEEEEEEEEEEEEE
18:32:09  IM GOING TO THROTTLE YOU TO DEATH
18:32:19  I don't know on one hand I can see how it would seem that 16 is a multiple of 3 because it is a very 3-like number, but then there is also the case that 16 is a multiple two because it lends well to create the 2-like numbers, but very few scholary sources seem to encroach upon the difficult subject.
18:32:29  NO
18:32:29  I love people who write BF interpreters without nested loops.
18:32:30  NOOO
18:32:31  THE GUY
18:32:33  KNOWS ABOUT ESOLANGS.ORG
18:32:35  NOOOOOOOOOOOOOOOOOOOO
18:32:39  They remind me of myself when I was twelve.
18:33:13 -!- tiffany has quit (Remote host closed the connection).
18:33:18  Heh, I like this golfed thing: http://www.reddit.com/r/programming/comments/m4c29/fun_with_brainfuck_while_waiting_for_a_flight/c2y2oxe
18:33:43 -!- tiffany has joined.
18:33:52  uh
18:33:55  why is he using format
18:33:57  http://www.shapecatcher.com/index.html Nooooooo, it doesn't do "PILE OF POO".
18:34:07  CakeProphet: Python 3, looks like.
18:34:18  does % not exist in Python 3?
18:34:27  dunno
18:34:33  it would be way better for golfing in any case.
18:34:52  🙀
18:34:55  weary cat face
18:35:28  ﺕ
18:35:28  "In block: Byzantine Musical Symbols"
18:35:29  Wow.
18:35:36  ᴞ
18:35:53  :<
18:35:54 -!- sebbu3 has changed nick to sebbu.
18:35:55   𝆋
18:36:19  ᑂ
18:36:21  😆
18:36:23  It didn't even recognise my shark pirate.
18:36:26  :$ suddenly my money is where my mouth is.
18:36:27  ᓤ
18:36:28  ᓤ
18:36:28  ᓤ
18:36:28  ᓤ
18:36:33  best face.
18:36:46  😌
18:36:50  😒
18:36:53  😋
18:36:54  ᴞ
18:36:57  😁
18:37:00  😜
18:37:04  😏
18:37:09  😣
18:37:12  😚
18:37:14  Ѷ
18:37:15  Ѷ
18:37:15  Ѷ
18:37:15  😞
18:37:45  ᒚ
18:38:02 -!- zzo38 has quit (Remote host closed the connection).
18:38:09  Ꙭ
18:38:15 * elliott mature.
18:38:27  ᴂ
18:38:55  ⚧ waht
18:39:06  😅
18:39:08  "MALE WITH STROKE AND MALE AND FEMALE SIGN"
18:39:14  😘
18:39:17  monqy: hi
18:39:47  `ls wisdom
18:39:49  ​? \ ais523 \ augur \ banach-tarski \ c \ cakeprophet \ elliott \ everyone \ finland \ fizzie \ flower \ friendship \ fungot \ gregor \ hackego \ haskell \ ievan \ intercal \ itidus20 \ monad \ monads \ monqy \ nooga \ oerjan \ oklopol \ qdb \ qdbformat \ sgeo \ shachaf \ u \ vorpal \ welcome \ wiki \ you
18:40:05  `learn you
18:40:07  I knew that.
18:40:11  `forget you
18:40:12  `? you
18:40:15  `? banach-tarski
18:40:15  Forget what?
18:40:17  `? you
18:40:18  ...
18:40:21  ​"Banach-Tarski" is an anagram of "Banach-Tarski Banach-Tarski".
18:40:24  you? ¯\(°_o)/¯
18:40:31  you
18:40:34  What was you?
18:40:38  `? itidus20
18:40:40  itidus20 is horny 60 year olds having cybersex in minecraft
18:40:55  `? monad
18:40:56  Monads are just monoids in the category of endofunctors.
18:41:08  😡
18:41:11  😖
18:41:12  `? shachaf
18:41:14  shachaf mad
18:41:18  😪
18:41:22  😏
18:41:23  elliott: we have descended into madness.
18:41:24  😎
18:41:34  if only Madoka-Kaname were here
18:41:34  😩
18:41:37  to spam lambdabot.
18:41:39  😷
18:41:40  `learn shachaf ace
18:41:42  I knew that.
18:41:43  `revert
18:41:44  Done.
18:41:46  `revert
18:41:46  😺
18:41:48  Done.
18:41:49  oh wait
18:41:50  `help
18:41:51  Runs arbitrary code in GNU/Linux. Type "`", or "`run " for full shell commands. "`fetch " downloads files. Files saved to $PWD are persistent, and $PWD/bin is in $PATH. $PWD is a mercurial repository, "`revert " can be used to revert to a revision. See http://codu.org/projects/hackbot/fshg/
18:41:52  monqy: pls stop
18:41:54  :(
18:41:59  :(
18:42:00  `? shachaf
18:42:02  shachaf ace
18:42:06  `revert 876
18:42:07 -!- oerjan has joined.
18:42:08  Done.
18:42:09  `? you
18:42:11  you? ¯\(°_o)/¯
18:42:12  `? you
18:42:14  you a haskell
18:42:22  me a haskell
18:42:34  `? shachaf
18:42:36  shachaf mad
18:42:41  :(
18:42:46  `? oklopol
18:42:48  oklopol "so i hear these blogs are getting popular, people like writing about their lives and shit. on this thing called the internet which is like a neural network only really stupid."
18:43:04  `? Phantom_Hoover
18:43:06  Phantom_Hoover? ¯\(°_o)/¯
18:43:08  `? sgeo
18:43:09  Sgeo invented Metaplace sex.
18:43:12  `? phantom hoover
18:43:14  phantom hoover? ¯\(°_o)/¯
18:43:20  `? vorpal
18:43:22  Vorpal is really boring. Seriously, you have no idea.
18:43:35  Vorpal follows speed limits.
18:43:35  Nothing to do with elliott, I assume.
18:43:37  laaaame.
18:43:56  `? everyone
18:43:58  Everyone in here is mad.
18:44:16  `fortune
18:44:17  `? ievan
18:44:19  Somewhat alarmed at the continued growth of the number of employees \ on the Department of Agriculture payroll in 1962, Michigan Republican Robert \ Griffin proposed an amendment to the farm bill so that "the total number of \ employees in the Department of Agriculture at no time exceeds the number of \ farmers in
18:44:31  ievan is basically http://www.youtube.com/watch?v=4om1rQKPijI
18:44:31  :(
18:44:32  good poem
18:44:52  I wonder if there are IRC fortune dbs
18:44:57  IRC-friendly that is.
18:45:32  `? haskell
18:45:34  Haskell is preferred by 9 out of 10 esoteric programmers. Ask your GP today! http://learnyouahaskell.com/
18:45:57  lol
18:46:08 -!- FireFly has quit (*.net *.split).
18:46:09  elliott, I don't think that kind of advertising is allowed here?
18:46:13 * Sgeo|web reads the Haskerl thingy
18:46:32  *Haskperl
18:46:48 -!- FireFly has joined.
18:47:16  a google search for perl compiler renders nothing is actually a legitimate perl compiler.
18:47:23  +that
18:47:42  CakeProphet: I'm pretty sure it's called Haskerl, but yes
18:48:05  oh that's an actual thing.
18:48:27  http://www.dcs.gla.ac.uk/~partain/haskerl/partain-1.html
18:49:04  awwww yeah
18:49:11  :(
18:49:48  `learn PHP is preferred by 9 out of 10 idiots. Ask your GP today! [Website redacted]
18:49:51  I knew that.
18:50:53  any evil lies that i wrote [Website redacted] because i couldn't bother to find a website will be harshly punished.
18:51:02  Further, if an io_thing turns out to have type "[IO a]" (list of I/O
18:51:02  actions), then suitable wrapping will be inserted to deal with that
18:51:02  ("listIO io_action `thenIO` ( \ result -> ... ", for those who care).
18:51:05  Sgeo|web: this is great and terrible
18:51:28  elliott: I just read that line too...
18:51:44  and thought roughly the same thing
18:51:45  this is awful
18:52:30  monqy: don't worry, it was in the naive days of 93
18:52:31  It is an April Fools joke
18:52:33  we did not know then
18:52:37  Sgeo|web: ...oh :(
18:52:38  Sgeo|web: but
18:52:42  they literally invented do notation?
18:52:43  like
18:52:49  this is like when ben franklin was joking about dst :D
18:52:51  I guess USB 1.1 had a poorly named speed in retrospect
18:52:57  "full-speed"
18:53:06  or wait, that might be 1.0 as well
18:53:06  elliott: ah that explains why the wrapping isn't simply a monad.
18:53:31  oerjan: ?
18:53:33  ah, 93 explains a lot
18:53:38  http://www.dcs.gla.ac.uk/~partain/haskerl.html
18:53:41  elliott: the 93
18:53:49  oerjan: well, they say it's monadic IO
18:53:57  but it's before the typeclass existed
18:54:09  Sgeo|web: wait, was do notation already proposed when this came out?
18:54:10  it must have been
18:54:20  elliott: No idea
18:54:37  elliott: surely it should be simply sequence in some monad, otherwise.
18:54:50  I wonder what they will call UBS 4.0
18:54:53  USB*
18:54:54  oerjan: um like I said, this is 93, so they knew about monadic IO but had no abstraction for it
18:54:58  no Monad typeclass, etc.
18:55:13  ""if", for example, normally has the type "Bool -> a -> a -> a"."
18:55:15  a better time
18:55:16  elliott: that's what "otherwise" means, sheesh
18:55:25  oerjan: right
18:55:59  is it bad that I think some of this stuff is a good idea?
18:56:04  yes
18:56:07  yes
18:56:07  apart from the do notation part
18:56:09  `rm wisdom/shachaf
18:56:11  No output.
18:56:17  CakeProphet: oh the polymorphic regexps are actually a well known thing
18:56:19  `run kill -9 $$
18:56:21  Killed
18:56:26  `echo nice try
18:56:28  nice try
18:56:38  Was that a try?
18:56:46  dunno
18:56:46  was it nice?
18:56:47  elliott: what's wrong with bool->a->a->a for the type of if?
18:56:49  It should just exit the shell instance that it spawns.
18:56:51  that is the type it has, as a function
18:56:57  ais523: where did I say there was something wrong with it?
18:57:00  elliott: mainly variable interpolation and backtick stuff (though that syntax would conflict with infix functions)
18:57:01  kill -9 $$ is my usual way of exiting a shell.
18:57:04  `learn shachaf mad with destruction
18:57:07  I knew that.
18:57:10  elliott: in your answer to CakeProphet's question
18:57:12  `rm wisdom/shachaf
18:57:14  No output.
18:57:14  shachaf: Do you bind ^D to that? :-)
18:57:18  ais523: that's not "some of this stuff"
18:57:28  elliott: No  -- I want ^D to behave as it does.
18:57:28  ah, OK
18:57:42  But kill -9 $$ is the easiest way I know of to exit without saving history.
18:57:42  run kill -WINCH $$
18:57:49  `run kill -WINCH $$
18:57:51  No output.
18:58:00  couldn't do with HackEgo having a badly-sized terminal
18:58:20  or at least, a bad belief about the size of its terminal
18:58:28  `run tput cols
18:58:30  80
18:58:37  wow, I wasn't expecting that to work…
18:58:39  `run tput rows
18:58:39 -!- derrik has joined.
18:58:40  ais523: Well, you'd want to kill -WINCH its PPID, presumably.
18:58:41  tput: unknown terminfo capability 'rows'
18:58:48  hmm
18:59:06  `tput lines
18:59:07  silly ais523
18:59:07  24
18:59:09  aha
18:59:13  I was guessing
18:59:24  and decided that my guess was wrong after the error
19:01:00  learning from errors?  how quaint.
19:01:30  `run printf '\x1b[8;120;36t'; tput cols; tput rows
19:01:32  ​\x1b[8;120;36t80 \ tput: unknown terminfo capability 'rows'
19:01:36  `run printf '\x1b[8;120;36t'; tput cols; tput lines
19:01:38  ​\x1b[8;120;36t80 \ 24
19:01:39  http://www.dcs.gla.ac.uk/~partain/haskerl/ganesh-1.html
19:01:44  oh god people taking this seriously :')
19:01:54  boring, It'd have been hilarious if I'd actually managed to resize its idea of what its temrinal was
19:01:57  "I tend to agree, Perl’s ast based internal structure is very fast. The overhead of JIT would almost certainly be a big down side as most perl programs seem to run for a very short time."
19:01:58  ais523: i don't think you're using printf right
19:02:00  HackEgo doesn't escape
19:02:01  what is this crap.
19:02:12  `run printf '%c[8;120;36t' 27; tput cols; tput lines
19:02:13  `run echo -e '\x1b[8;120;36t'; tput cols; tput lines
19:02:14  2[8;120;36t80 \ 24
19:02:19  `run echo -e '\e[8;120;36t'; tput cols; tput lines
19:02:21  ​-e \e[8;120;36t \ 80 \ 24
19:02:24  lol
19:02:26  ​-e \x1b[8;120;36t \ 80 \ 24
19:02:29  `run /bin/echo -e '\e[8;120;36t'; tput cols; tput lines
19:02:31  I don't think you're using echo right
19:02:31  ​.[8;120;36t \ 80 \ 24
19:02:35  there we go
19:02:40  but yeah, no pty
19:03:10  "I don't want to be misunderstood but I DON'T WANT to believe this.
19:03:10  I mean, programs do not normally kill patients, doctors do.  So where
19:03:10  were the doctors or nurses who were supposed to keep such patients
19:03:10  under close control?  Or do we nowadays have artificially intelligent
19:03:10  programs acting as doctors?"
19:03:14  THIS IS SO ADORABLE OMG
19:03:24  "Something missing in the above picture, I think.  And I also detect
19:03:24  a bad smell of abuse and negligence, too.  (Assuming that the last sentence
19:03:24  of Hudak's message does really reflect what happened at Yale Med School.)
19:03:24   
19:03:24  By the way, I would safely guess that there are dozens of newspapers,
19:03:25  TV stations, etc. who would be interested in this story.  So how come
19:03:27  they never did their job?  Or did they?"
19:03:27  I think I've got the code wrong; at least, it's not working in my shell, and it used to
19:03:29  gjkdfsghksdklfg
19:03:35  ais523: try in rxvt
19:03:41  i know gnome-terminal dislikes some of that stuff
19:03:44  what's 8 meant to be
19:03:47  isn't it 2 or 3
19:03:49  it does work in gnome-term, I've done it in the past
19:04:02 -!- ais523 has quit (Remote host closed the connection).
19:04:13 -!- derrik has left.
19:04:34  ais, how many people did you kill?
19:04:39  With your bad code
19:04:41  http://www.dcs.gla.ac.uk/~partain/haskerl/jhf-1.html
19:04:42  Bleh, he's not here
19:04:44  excessive monadery!
19:05:18  http://www.dcs.gla.ac.uk/~partain/haskerl/wall-1.html
19:05:19  hi larry
19:06:10  wow this is the best
19:06:22  http://www.dcs.gla.ac.uk/~partain/haskerl/dw-2.html
19:06:25  "Support for Visual Basic is not anticipated."
19:06:25  who wants to add it to the wiki
19:06:30  NOOOOOOOO
19:06:38  David Wakeling (inventor of surrealist programming)
19:07:09  oerjan: did you manage to read the annotation
19:09:24  monqy: larry -Wall is god among meermortals.
19:11:03  I have two monitors now
19:11:54  larry -Wextra
19:14:16 -!- Darth_Cliche has joined.
19:14:22  larry -funroll-loops
19:14:32  larry o2
19:14:53  larry "funroll" loops
19:15:14  I wish I had a son so I could call him that.
19:15:23  And that my surname was Loops, I suppose.
19:15:49  Phantom_Hoover: you can always get married and adopt your wife's surname.
19:16:12  You could also just change your name.
19:16:23  Also please CakeProphet, we have civil unions in this country. Phantom_Hoover is a gay vampire.
19:17:57   oerjan: did you manage to read the annotation <-- on sunday?  yes.
19:20:42  mmmm biscuit syrup.
19:20:45  I feel so... southern.
19:22:32  So they're not *dwarven syrup biscuits [10]*?
19:23:06  no it's this: http://www.scanavert.com/api/picture.php?upc=00700195004325&width=150&height=150
19:23:29 -!- variable has quit (Quit: I found a 1 /dev/zero).
19:24:20  Phantom_Hoover: not referring to your barbaric limey biscuits.
19:24:38  Limes????? What are these things?
19:24:43  Are they like plump helmetss?
19:24:55  Phantom_Hoover: yes, they prevent scurvy in sailors.
19:25:12  in other words
19:25:18  they prevent scurvy sailors, argh!
19:25:37 * oerjan wants to read that [10] as that +10 thing they put in rpg tables
19:26:02  oerjan: play df with us :}
19:26:06  :DDDDd
19:26:07  :Qqqq
19:26:09  :#
19:26:18  elliott: ah so it is something equivalent there?
19:26:29  i didnt say that ;___;
19:26:40 * elliott ceries softly.
19:26:44  well it _could_ have been.
19:26:46  that was meant to be a typo of softly
19:26:47  like
19:26:49  soft lie
19:26:49  but
19:26:51  it turned out being the same
19:26:52  as the right way
19:27:00  so i
19:27:01  mistyped
19:27:03  a mistype...
19:27:10  i think i broke elliott again
19:27:15  oops
19:27:18   
19:27:35  http://xlithiumx.files.wordpress.com/2010/07/395px-runny_hunny.jpg
19:27:41  notice that American biscuits are far superior.
19:27:42  hunny
19:28:03  alternatively, see: http://westofthewest.files.wordpress.com/2011/10/hardee-s-new-monster-biscuit.jpg
19:28:09  a more typical American biscuit.
19:28:18  fastest food
19:28:33  america is like going into a quaint film but then the film doesn't end
19:28:54  elliott: explain yourself
19:29:41  sigh arcanesentiment is in another lull
19:29:45  is this a metaphor for life?
19:29:59  prog21 too, but it's always in a lull
19:30:05  lul
19:30:08  well ok it had active posting throughout october
19:30:25  monqy: lull with me.
19:31:17  lulling good hobbey
19:31:25 -!- Zuu has joined.
19:32:32  http://en.wikipedia.org/wiki/File:BiscuitsAmerican%26British.png that's a really shitty american biscuit
19:32:45  I am ashame wakapedoia
19:33:04  CakeProphet: mmmmmmm bourbons
19:33:21  elliott: is that what that obscene doggy treat is?
19:33:26  ah yes
19:33:27  it is.
19:33:27  http://upload.wikimedia.org/wikipedia/commons/archive/6/60/20091013115300%21BiscuitsAmerican%26British.png old version, even shittier
19:33:28  no its
19:33:34  its filled with chocolate cream shit
19:33:34  its
19:33:35  great
19:33:38  wait
19:33:39  wait
19:33:40  CakeProphet
19:33:44  have you never had a digestive biscuit in your life
19:33:48  nope
19:33:51  what the fuck!!!!!!!!!
19:33:53  ginger nut???
19:33:57  uh?
19:34:04  http://www.virginmedia.com/images/ginger_nut430x300.jpg
19:34:07  have you had one of these
19:34:09  america land of the freedom from digestive biscuits
19:34:17  CakeProphet: ANSWER FUCKER >:(
19:34:27   have you never had a digestive biscuit in your life <-- I only ever heard of them
19:34:27  elliott: oh yes I've ate a cookie before.
19:34:28  home of the too brave for ginger nut
19:34:30  whatever they are
19:34:34  CakeProphet: THATS NOT A COOKIE
19:34:37 * shachaf has never heard of digestive biscuits.
19:34:38  COOKISE HAVE CHOCOLATE CHIPS
19:34:39  Sounds horrible.
19:34:40  elliott: it is exactly a cookie.
19:34:43  NO
19:34:44  wait
19:34:45  yes...
19:34:47  CakeProphet
19:34:47  YOU DONT EVEN KNOW WHAT YOURE LOOKING AT
19:34:49  some cookies do not have chocolate chips
19:34:49  ITS GINGER FLAVOURED
19:34:49  has not ever
19:34:50  tasted
19:34:51  AND SNAPS
19:34:51  AND SHIT
19:34:55  a digestive biscuit
19:34:56  i love ginger snaps
19:34:56  yes we call those ginger snaps
19:34:58  Hmm, looks like a kind of cookie to me.
19:35:00  they're cookies.
19:35:01  elliott, they are the best thing in tea?
19:35:01  NO
19:35:02  STOP CALLING
19:35:03  EVERYTHING
19:35:03  C
19:35:03  elliott: I take it you don't like ginger?
19:35:04  OOOKIES
19:35:06  I HATE YOU!!!!!!
19:35:14  Vorpal: GINGER NUTS ARE THE GREATEST FUCKING THING NEXT TO DIGESTIVE BISCUITS
19:35:14  elliott: A "cookie" in American parlance refers to a large quantity of things, many of which you call "biscuits".
19:35:17  i love good cookies too
19:35:21  pikhq_: FUCK YOUUUU YOUR DIALECT IS WRONG!!!
19:35:23  (:[{- COOKIES! -}])
19:35:26  > let f (x,y) = True in f undefined undefined
19:35:27    Couldn't match expected type `a -> t'
19:35:27          against inferred type `GHC.Bo...
19:35:28  elliott: Personally I don't like ginger
19:35:33  "In the United States it is a small, soft, leavened bread, somewhat similar to a scone."
19:35:34  elliott: have you had american biscuits?
19:35:35  wtf
19:35:35  Vorpal: I;M PUNCHING YOU
19:35:40  CakeProphet: IVE HAD SCONES
19:35:40  > let f (x,y) = True in f (undefined,undefined)
19:35:41  elliott: Didn't you ever watch Sesame Street?
19:35:41    True
19:35:45  elliott: not the same.
19:35:46  CakeProphet, dude, give up, you can't out-scone Britain
19:35:46  elliott: You've probably never had biscuits & gravy. :)
19:36:01  american biscuits are kind of lame
19:36:03  Gravy on digestive biscuits MMMMMMMMmmmmmmmmmmmmmm
19:36:07  (no)
19:36:10  monqy: With gravy, though.
19:36:16  monqy
19:36:19  have you ever had a digestive biscuit
19:36:21   there are many ways to make biscuits gravy
19:36:26  the southern US is very good at it.
19:36:32  uh
19:36:36  s/gravy/good/
19:36:37  but uh
19:36:42  graby is an acceptable synonym.
19:36:45  >_>
19:36:45  elliott maybe I have had something which is a digestive biscuit without knowing because nothing is called digestive biscuites here it's all cookies :(
19:36:45  monqy
19:36:51  we must
19:36:52  monqy: wait ill get a picture
19:36:53  save you
19:36:55  from
19:36:56  this
19:37:01  monqy: http://upload.wikimedia.org/wikipedia/commons/4/47/Digestive_biscuits.jpg ok this is an ugly picture but
19:37:04  digestive biscuitless wasteland
19:37:07  monqy: they taste like warmth
19:37:07  monqy: yes they're pretty much the same thing.
19:37:09  wait
19:37:11  oh and English people are strange: https://en.wikipedia.org/wiki/Yorkshire_pudding <-- IMO this is a type of bread, not a pudding
19:37:11  http://www.webanswers.com/post-images/5/5F/7088B479-AB32-1029-81DD15954676B012.jpg
19:37:14  that's a slightly nicer picture monqy
19:37:19  monqy: you dunk them in tea and
19:37:21  they're so warm and
19:37:22  ok
19:37:23  elliott: Digestive biscuits basically aren't in the US, but if we had them we'd call them cookies.
19:37:24  monqy
19:37:26  monqy: do you have a supply of adequate tea
19:37:28  I've never had a msvitties the original
19:37:35  it's mcvities
19:37:36  I only have crappy tea sorry
19:37:40  monqy: ok but is it
19:37:44  can you stand to have a mouthful of it
19:37:48  english biscuits work with any tea
19:37:51  Is it tea, not weird herbal crap?
19:37:53  this conversation is hilarious.
19:37:57  oh yeah it has to be actual tea not
19:37:58  CakeProphet: agreed
19:37:58  pretty sure it's tea
19:37:58  green tea or whatever
19:38:02  ok good
19:38:04  monqy: what's your address
19:38:05 -!- GreaseMonkey has joined.
19:38:06 -!- GreaseMonkey has quit (Changing host).
19:38:06 -!- GreaseMonkey has joined.
19:38:10 * elliott loads up amazon
19:38:19  http://www.mamas-southern-cooking.com/images/biscuits-and-gravy-01.jpg
19:38:21  mmmmmmmmmm
19:38:26  Hey, man. Green tea is actual tea. Admittedly, probably not the sort of thing you want to drink if you want to do things proper & British-like.
19:38:30  giving out my address would only end badly
19:38:32  no amazon.co.uk i dont want the chocolate ones!! they are niceb ut monqy needs _real digestives_
19:38:38  monqy: it is ok you can tell mei n private
19:38:39  OK American biscuits look like crappy scones.
19:38:45  CakeProphet, have you had scones.
19:38:51  Phantom_Hoover: dude find me digestives on amazon.co.uk i cant
19:38:51  pikhq_: Does it originate from the tea plant?
19:38:54  they re like
19:38:55  Vorpal: Yes.
19:38:56  20 quid
19:38:56  Phantom_Hoover: scones are a US thing too.
19:38:58  for a 23712389723 pack
19:39:04  CakeProphet: ??? haha no?
19:39:09  they are similar but usually not eaten with the same things that biscits are.
19:39:10  monqy: http://www.amazon.co.uk/1StopCufflinkShop-Novelty-Digestive-Biscuit-Cufflinks/dp/B003PLO6PQ/ref=sr_1_18?ie=UTF8&qid=1320781097&sr=8-18
19:39:11  Corollary: do you rhyme 'scone' with 'cone'?
19:39:15  novelty digestive biscuit cufflinks
19:39:16  Phantom_Hoover
19:39:17  novelty digestive biscuit cufflinks
19:39:19  i
19:39:21  pikhq_: nothing else added except hot water and possibly milk?
19:39:30  elliott: no its because mysterious thing comes in mail from mysterious place and my parents wouldn't be able to deal with it.........and i wouldn't be able to tell them i gave out adres because then they'd kill me
19:39:31  Phantom_Hoover: scones don't really exist where I live.
19:39:31  GUYS NOVELTY DIGESTIVE BISCUIT CUFFLINKS WHAT???
19:39:33  Vorpal: You don't add milk to green tea.
19:39:33  Are they actual digestive biscuits?
19:39:35  Vorpal: But, yeah.
19:39:37  HELP???
19:39:37  the joys of not bein gan audtl
19:39:40  Phantom_Hoover: HELP?
19:39:43  Phantom_Hoover: but I've seen them in the midwest and northeast.
19:39:46  *Maybe* a small amount of sugar.
19:39:49  it's pretty much all biscuits in the south.
19:39:53  monqy: is there anywhere ican dliver things that you canp ick them up (in secret)
19:39:54  pikhq_: right, then it is a type of tea. And I wouldn't know if you use milk with it or not, I don't like any tea really
19:40:05  not that i know of.....
19:40:12  monqy, wait we can use that strike bomber we were going to kill you with (long story) and drop digestive biscuits instead?
19:40:25  good idea
19:40:38  ok monqy
19:40:40  Do you mind the taste of high explosive?
19:40:42  can we meet up in california
19:40:46  i will bring digestives
19:40:49  and proper eta
19:40:50  tea
19:41:09  Phantom_Hoover: http://www.amazon.co.uk/McVities-Digestive-Biscuits-400g-Pack/dp/B005R0LO5S/ref=sr_1_34?ie=UTF8&qid=1320781212&sr=8-34 20 POUNDS!!!!
19:41:18  wait
19:41:23  they sell digestives in america
19:41:25  i know they do because
19:41:29  im sure like on reddit theres been an expat saying
19:41:31  elliott: Whoa, man, I thought biscuits had to be hard.
19:41:34  oh you just have to go blah and they have all the BISCUITS!!!
19:41:37  Apparently there are soft biscuits.
19:41:45  monqy: find the biscuits
19:41:50  shachaf, none of us knew this?
19:41:54  hmmmmmmmmm,
19:41:55  elliott: Well, yes, if you know where to look you can find just about any damned food item in the US.
19:42:31  i dont think you guys understand
19:42:33  what you're missing out on
19:42:36  pikhq_: you've had digestives right
19:42:38  Oi, pikhq_, do you rhyme 'scone' and 'cone'?
19:42:38  *Especially* if you're in, say, New York.
19:42:40  elliott: No.
19:42:40  funnily enough I don't think either of the Swedish words "kaka" and "kex" translates directly to either the British or the American biscuit/cookie concepts
19:42:43  Phantom_Hoover: Yes.
19:42:44  WHAT
19:42:47  pikhq_: FIX IT???
19:42:57  pikhq_, BASTARD SCUM BASTARD BASTARD
19:43:06  Vorpal: Describe?
19:43:09  Phantom_Hoover: http://swervechurch.files.wordpress.com/2010/02/6b7d841b6f6f35e6_m.jpg DO YOU GUYS DO THIS TO YOUR SCONES?
19:43:12  Phantom_Hoover: I don't speak Scots. :P
19:43:12  Phantom_Hoover: I found a summary of the French.
19:43:14  IT RHYMES WITH 'CON'
19:43:15  IT
19:43:17  ALWAYS
19:43:18  Phantom_Hoover: http://en.wikipedia.org/wiki/Biscuit_rose_de_Reims "The biscuit is very hard. It is hence customary to dip the biscuit in champagne or red wine to soften it."
19:43:19  RHYMES
19:43:19  WITH
19:43:22  'CON'
19:43:29  pikhq_: well, I wouldn't even know what to classify those "digestive biscuits" as in Swedish terminology.
19:43:42  Phantom_Hoover: Ah nay spik braid scots
19:43:44  Vorpal: you know those biscuits they sell in the swedish section of ikea? those are nice guys
19:43:49  pikhq_: definitely not kaka. And kex need to be crisp
19:43:52  CakeProphet, OH GOD WHAT ARE THEY DOING TO THAT SCONE
19:43:53  pikhq_,
19:43:55  you
19:43:56  do
19:43:57  Vorpal: they're thin and sort of star shaped but rounded?
19:43:59  not understand
19:44:01  Vorpal: and gingerbready
19:44:01  elliott: they don't sell food in IKEAs in Sweden
19:44:04  those are nice mm
19:44:05  poor scone
19:44:05  Phantom_Hoover: making it amazing
19:44:06  well
19:44:11  Vorpal: tey're like
19:44:12  ANNA
19:44:12  or
19:44:14  ANNKA
19:44:16  or something like that
19:44:16  uh
19:44:18  Phantom_Hoover: That's a McDonalds McBiscuit. They taste worse than they look.
19:44:21  elliott: ANKA?
19:44:23  that means duck
19:44:24  AEWFAWEGUWAGHE
19:44:30  Vorpal: maybe it's made from duck
19:44:31  pikhq_: it is?
19:44:31  mcbiscuit
19:44:34  good name
19:44:37  elliott: doubtful
19:44:47  CakeProphet: http://swervechurch.files.wordpress.com/2010/02/6b7d841b6f6f35e6_m.jpg sure is.
19:44:47  oh, yes it is.
19:44:47  pikhq_, are these... common?
19:44:49  Vorpal: i will find them on
19:44:51  Vorpal: the ikea site
19:44:58  elliott: but I don't know any Swedish brand with a name like that
19:45:01  but sure, do that
19:45:05  http://upload.wikimedia.org/wikipedia/commons/9/9c/Tea_and_scones.jpg
19:45:10  Phantom_Hoover: I think McDonalds is the only place that carries them.
19:45:11  pikhq_: where do you live?
19:45:18  CakeProphet: Colorado, US
19:45:18  Vorpal: http://www.ikea.com/us/en/catalog/products/90124690/ i think this is the same thing?? but different packaging and stuff
19:45:19  I will soothe my eyes with scones that have not been mutilated.
19:45:29  Phantom_Hoover: But, McDonalds is exceptionally common.
19:45:34  elliott: that /is/ gingerbread
19:45:35  pikhq_: in Colorado you can find sausage, egg, and cheese biscuits that are not from a fast food chain, yes?
19:45:37  pikhq_, there is no other Colorado to speak of.
19:45:38  do other fast food places carry mcbiscuitalikes
19:45:42  elliott: pepparkakor
19:45:43  CakeProphet: Never seen one.
19:45:46  i'm no expert on fast food
19:45:48  o_o
19:45:49  Phantom_Hoover: True, true.
19:46:00  elliott: anyway, how do you do gingerbread for xmas over there?
19:46:03  pikhq_: oh, well, in the south that's just a thing we do to biscuits, apparently.
19:46:04  Vorpal: whatever they are they're delicious, there's another one with almonds i think?
19:46:06  Phantom_Hoover: But I tend to not assume people outside the US don't memorise a list of states.
19:46:11  CakeProphet: Ah.
19:46:19  elliott: possible, there are many variants of the basic recipe
19:46:33  Erm, s/don't//
19:46:33  pikhq_, I think if you mentioned a state most people here would recognise it as one, by and large.
19:46:35  elliott: literally the name translates to "pepper cookies/biscuits/whatever"
19:46:36   I will soothe my eyes with scones that have not been mutilated.
19:46:38  some gingerbread is good. other gingerbread is awful.
19:46:41  Phantom_Hoover: Feh.
19:46:42  Phantom_Hoover: Let's be honest though, scones aren't actually all that good.
19:46:47  I
19:46:48  elliott: but I know at least one recipe that have no pepper
19:46:51  XD
19:46:52  Phantom_Hoover: I mean yes they're good.
19:46:54  I will not talk to you ever again.
19:46:58  Phantom_Hoover: But they're so easy to fuck up!
19:47:00  Yes
19:47:02  Phantom_Hoover: You *know* you want biscuits & gravy.
19:47:12  Gravy: it is delicious.
19:47:12  Phantom_Hoover: It's like, you keep reaching for this unattainable state of perfect scone.
19:47:17  But all you get are Failed Scones.
19:47:20   elliott: anyway, how do you do gingerbread for xmas over there?
19:47:22  The average sconesperience is not good.
19:47:26  elliott: not like the IKEA ones?
19:47:27  elliott, no, you are just a terrible sconesmith.
19:47:29  Vorpal: Not in that shape.
19:47:34 * Phantom_Hoover → food (non-scone).
19:47:37  Phantom_Hoover: OK show me a good scone.
19:47:45  Phantom_Hoover: I will drive to Edinburgh.
19:48:01  elliott: well, there are many shapes over here. Xmas trees. People (which sounds strange when you think about it), hearts. Circles.
19:48:04  and so on
19:48:14  I think the heart shape is probably most common
19:48:49  haert shape?
19:49:00  I said heart
19:49:00  http://upload.wikimedia.org/wikipedia/commons/c/cb/Gingerbread_house_8.jpg challenge: eat without vomiting
19:49:05  ♥, I assume.
19:49:14  pikhq_: yes, what else?
19:49:14  Ikea to drop famous Swedish food brands
19:49:14  15 October 2011 | news Newsdesk
19:49:14  Swedish furnishing giant Ikea is undergoing a change and will soon rid their food shelves of anything not bearing it’s name.
19:49:14  People outside of Sweden craving Swedish-brand eats have made a habit of frequenting Ikea stores around the world in order to find such things as Cloetta chocolate, Abba herring, Kalle's caviar spread, and cookies by Göteborgskex.
19:49:15  Mmmm, gingerbread.
19:49:16  But soon, those looking for a taste of Sweden will instead have to settle for Ikea-branded approximations following a decision by the company to move to own-branded foods.
19:49:19  OH NOOOOOOOOOOOOOOOOOOOO
19:49:21  OH NOOOOOOOOOOOOOOOOOOOO
19:49:23  OH NOOOOOOOOOOOOOOOOOOOO
19:49:25  OH NOOOOOOOOOOOOOOOOOOOO
19:49:26   http://upload.wikimedia.org/wikipedia/commons/c/cb/Gingerbread_house_8.jpg challenge: eat without vomiting <-- what? It looks delicious
19:49:39  elliott: though maybe a bit at a time
19:49:42  Vorpal: Good luck with the parts that are basically thick raw sugar :P
19:49:56  elliott: well, I wouldn't eat it all in one meal of course
19:49:56  it looks too sugary for me
19:50:00  elliott: Probably not that bad in the US, though.
19:50:06  elliott: anyway I like sugar :P
19:50:13  hopefully that gingerbread isg ood gingrebread and not bad gingerbread
19:50:13  elliott: please don't mention anna anka in polite company
19:50:17  elliott: I doubt it would be healthy though
19:50:18  I mean, jesus, I can find fucking lutefisk in the US, I'd imagine it wouldn't be hard to find Swedish foods.
19:50:22  the only gingerbread houses i've had were bad gingerbread
19:50:24  oerjan: sounds like a nursery rhyme
19:50:37  monqy: have you gotten a digestive biscuit yet
19:50:39  pikhq_: lutefisk is Norwegian when spelled like that at least.
19:50:40  :(
19:50:44  Phantom_Hoover: What are your opinions on rich teas.
19:50:47  the Swedish spelling is lutfisk.
19:51:00  pikhq_: BTW get a fucking digestive and dunk it into some tea and eat it.
19:51:01  I don't know anyone under the age of 70 that eats lutfisl
19:51:05  lutfisk*
19:51:17  `quote rotting sea life
19:51:19  Vorpal: Yes, I'm aware. Still, if I can find *lutefisk*, I'd imagine it's not hard to find anything Scandinavian. :)
19:51:19  100)  think of all the starving kids in china who don't have rotting sea life to eat
19:51:22  http://i-cdn.apartmenttherapy.com/uimages/kitchen/2011_03_20-ShrimpGrits2.jpg oh my god this looks amazing.
19:51:30  pikhq_: hm. Surströmming?
19:51:31  CakeProphet: ;__;
19:51:34  america is devil
19:51:35  country
19:51:43  pikhq_: if the answer is yes, then I'm scared.
19:51:50  it should never have been exported
19:51:51  I don't think most americans eat grits actually.
19:52:17  Vorpal: Might have to make a trip of it, but I have no doubt I could find it.
19:52:21  oh my god
19:52:24  ikea published a cookbook
19:52:25  and
19:52:26  http://media.treehugger.com/assets/images/2011/10/ikea-cook.png
19:52:32  (found when googling for ikea biscuits)
19:52:37  look at that butter pyramid oh my god
19:53:04  http://media.treehugger.com/assets/images/2011/10/orange-ikea.png :DDDD
19:53:09  pikhq_: btw I suspect that in Sweden, lutfisk will be pretty much gone in 30-40 years from mainstream shops.
19:53:33  elliott: mmmmm. I too am a cocaine afficionado
19:53:39  It's still fairly commonly consumed in rural areas of Minnesotta.
19:53:39   look at that butter pyramid oh my god <-- sure that is butter?
19:53:45  http://media.treehugger.com/assets/images/2011/10/semlor-ikea.png "recipe contains semen"
19:53:50  Vorpal: yes but
19:53:52  Vorpal: look at the tiny eggs omg
19:53:57  it is the best way to list ingredients ever
19:53:58  elliott: I thought it was white chocolate...
19:54:13  Vorpal: nah, that's butter
19:54:15  i'm sure
19:54:17  elliott: semen and coke: a hookers best griends.
19:54:24  elliott: wait what are the white mountains to the left in the first picture then
19:54:25  Vorpal: it's gingerbread cookies apparentl
19:54:26  y
19:54:31  and icing sugar?
19:54:35  oh I see
19:54:44  not sure where the ginger is there.
19:54:47  oh it's the
19:54:48  |>
19:54:49  triangle
19:54:51  Hmm. Seems it's actually really non-trivial to find surströmming in the US.
19:54:52  elliott: they do the ingredient lists like that in the book?
19:54:56  yep!
19:54:59  "It is a 140 page coffee-table recipe book, containing 30 classic Swedish baking recipes--everything from small biscuits to large cakes. For each recipe, there are two images: one of the ingredients and one of the finished item."
19:55:15  i hoped that meant it had no instructions
19:55:17  but i guess it dose
19:55:18  does
19:55:18  elliott: so where is the scale for figuring out how to calculate the amount from the pictures
19:55:19  It's a crapshoot to see if it gets past customs; it'll either go through or get turned down for being rotten.
19:55:35  Vorpal: swedes may be a little unfamiliar with this idea. but it's called approximation
19:55:48  elliott: I know about it, I just don't like it
19:56:26  elliott: besides calculating the area of the diagonal line in http://media.treehugger.com/assets/images/2011/10/orange-ikea.png seems non-trivial to me. And unlike the eggs in the first there is no known object to compare against
19:56:28  "[...] designed perhaps for the tradition of "dunking" in cups of tea; hence preventing the collapse of the biscuit and ruining of the beverage."
19:56:45  Vorpal: that's because you're not meant to calculate it
19:57:01  pikhq_: heh
19:57:04  btw
19:57:09  CakeProphet: pikhq_: monqy: apologise for oreos
19:57:13  Vorpal: the three sticks of butter probably is a good reference point.
19:57:16  elliott: never.
19:57:21  oreos are so bad
19:57:22  elliott: oh there is a separate ingredient list?
19:57:26  because
19:57:33  Vorpal: no, you're meant to approximate using intuition
19:57:36  elliott: they're not my favorite, no.
19:57:38  CakeProphet: you know how they're meant to be chocolate flavoured
19:57:38  like
19:57:40  the black bits
19:57:42  are meant to taste like chocolate
19:57:43  well
19:57:46  break one off sometime
19:57:48  and chew on it
19:57:49  oreos.........................................................
19:57:50  and think about the taste
19:57:51  and tell me honestly
19:57:54  that it tastes like chocolate
19:57:55  it doesn't
19:57:58  you know what it tastes like?
19:58:01  blackness + sugar
19:58:04  CakeProphet: wait what? The only sticks of butter I know of are 1-kg ones.
19:58:06  dear america
19:58:07  chocolate
19:58:10  does not taste like blackness
19:58:14  Somebody find me an image macro with Shatner going "NYAAAAAAAAAAAAAAAAAAAAAAAAN!" and Nyan cat.
19:58:15  some cookies are good, but oreos are not them
19:58:20  CakeProphet: 3 kg butter? Come on
19:58:32  monqy: oreos COULD have been good
19:58:40  monqy: if the biscuit part actually tasted like chocolate
19:58:42  monqy: but you know what
19:58:43  Wait, oreos are supposed to be chocolate?
19:58:45  monqy: those already exists
19:58:46  are those not sticks of butter in http://media.treehugger.com/assets/images/2011/10/orange-ikea.png ?
19:58:47  THEY'RE CALLED BOURBONS
19:58:51  recipes use a lot of butter, sir.
19:58:58  SO BASICALLY FUCK AMERICA???
19:58:59  Gregor: yes.
19:59:11  Well, as we all know, the USA pretty much sucks at chocolate.
19:59:16  Gregor: at least, if they're not intending to, they're quite obviously TRYING to emulate chocolate
19:59:19  We're a nation that seriously believes that Hershey's is good.
19:59:33  i've never had hershey's
19:59:35  this makes me quite happy
19:59:36  btw
19:59:37  did you know
19:59:40  cadburys products in the us
19:59:42  CakeProphet: sure, then look at the scale of the whole thing. That diagonal bar is like 80 cm from end to end...
19:59:44  are made completely different to in the uk
19:59:46  they're poisoning your minds
19:59:50  by making you think cadburys sucks
19:59:51  dear god it doesn't
19:59:53  come home to us
19:59:55  we will show you chocolate
19:59:57  it is so good
19:59:57  elliott: Yup, but luckily, Cadbury's is rare here.
20:00:00  CakeProphet: that will generate a huge amount of food
20:00:06  elliott: I've had chocolate in the UK ... also had it in Paris so nya :P
20:00:16  Gregor: have you tasted real uk cadburys because
20:00:17  it's so good
20:00:25  oh man this reminds me of that daily mail article i found
20:00:29  it literally compared Milka chocolate to hitler
20:00:33  i swear to god
20:00:37  elliott: I have.
20:00:37  It's not that the US sucks at chocolate, we suck at food regulation.
20:00:45  elliott: But I also made the mistake of trying Turkish Delight.
20:00:46  http://www.dailymail.co.uk/news/article-1275526/Cadbury-owner-plugs-inferior-Milka-bar-chocolate-lovers-say-Krafty-sideline-Dairy-Milk.html
20:00:46  HERE IT IS
20:00:48  they literally say
20:00:51  that the nazis had milka
20:00:55  read it
20:00:55  elliott: I wonder how anyone could think that earwax flavor in chocolate is good.
20:00:56  you will be
20:00:57  so amazed
20:01:04  Gregor: Turkish Delight is, uh, yeah.
20:01:04  Our "chocolate" is generally made to the legal standard for what "chocolate" is.
20:01:05  Back.
20:01:15  Phantom_Hoover: Do you remember that Daily Mail article.
20:01:18  Phantom_Hoover: That I linked.
20:01:21  Phantom_Hoover: That compared Milka to Nazism.
20:01:31   Phantom_Hoover: What are your opinions on rich teas.
20:01:34  Eugh.
20:01:37  elliott, no.
20:01:48  "THE chocolate snobs would have you believe that Dairy Milik is cheap, bland and artificial, lacking depth and complexity. Waxy chocolate for the masses, they sneer, while nibbling on some ghastly lavender-infused, organic creation."
20:01:48  http://i.dailymail.co.uk/i/pix/2010/05/08/article-1275526-097A1C72000005DC-886_468x681.jpg
20:01:49  ACTUAL
20:01:49  FUCKING
20:01:50  QUOTE
20:01:51  DIRECT
20:01:51  FUCKING
20:01:53  QUOTE
20:02:16  "Dull and insipid, like Berne on a wet night" GOD
20:02:24  Of course, milk chocolate is terrible.
20:02:29  And people who like milk chocolate should feel bad.
20:02:36   Gregor: have you tasted real uk cadburys because <-- the only real chocolate is from continental Europe IMO
20:02:38 -!- mtve has quit (Ping timeout: 252 seconds).
20:02:45  mostly French or Belgian
20:02:58  "The chocolate was created in 1901 by Swiss chocolate company Suchard. Both The Kaiser’s and Hitler’s troops took Milka chocolate to war.
20:02:58  Read more: http://www.dailymail.co.uk/news/article-1275526/Cadbury-owner-plugs-inferior-Milka-bar-chocolate-lovers-say-Krafty-sideline-Dairy-Milk.html#ixzz1d97FjOnQ"
20:03:00  i repeat
20:03:01  ACTUAL QUOTE
20:03:03  Vorpal, yes, but your opinions are universally head-meltingly Vorpid so we all ignore them.
20:03:04  apart from that tynt bullshit
20:03:13  sure, Switzerland is okay too
20:03:23  Gregor: US milk chocolate is only 10% cocoa, and is generally made from milk that's gone a little bit bad.
20:03:28  Phantom_Hoover: what about 100% pure Valrona?
20:03:33  pikhq_: I'm not referring to US any kind of chocolate.
20:03:39  pikhq_: US chocolate isn't chocolate, it's a joke.
20:03:40  err spelling
20:03:46  Valrhona
20:03:48  pikhq_: But even legit milk chocolate is terrible.
20:03:51  "Jones’s paper [about classes over type constructors] appeared in 1993, the same year that monads became popular for I/O (Section 7).  "
20:03:52  EU milk chocolate is 25% cocoa, and can't pull that shit.
20:04:06  Phantom_Hoover: Anyway I quite like Rich Teas but the context has to be right.
20:04:07  The stuff in [] was my edit
20:04:14  Phantom_Hoover: They really rely on a high-quality, fresh biscuit and a good tea.
20:04:21  No, they don't.
20:04:31  They do. You're just a bad richteasmith.
20:04:55  They're made of loosely-caked crumbs which disintegrate when held in tea for more than a fraction of a second, and, unlike digestives, they are bland and joyless when eaten alone.
20:05:23  Phantom_Hoover: Damn, Scots must get really bad rich teas. They're quite structurally sound over here.
20:05:25  But yes, digestives are better.
20:05:41  pikhq_: I prefer less milk in my chocolate. Try proper French chocolate some time. Tends to be expensive though
20:05:44  im food envy
20:05:47  Taneb: Join in the biscuit discussion!
20:05:56  monqy: Come to England. We will accept you.
20:06:06  maybe when i can
20:06:13  Come to Scotland, we have haggis.
20:06:14  but for a few years at least i cannot
20:06:24  monqy: Sneak.
20:06:36  sneak across the atlantic.
20:06:49  Vorpal: I have, actually.
20:06:57  Jesus fuck that was good.
20:07:04  tiptoe across the atlantic
20:07:06  Honestly, milk chocolate is nice.
20:07:15  Only joyless people, or those who haven't actually had good milk chocolate, claim otherwise.
20:07:21  elliott: US milk "chocolate" is shitty.
20:07:23  Nobody's saying it isn't except Gregor, and FFS he's anosmic.
20:07:28  Phantom_Hoover: So is Vorpal.
20:07:33  But he doesn't count as a person.
20:07:55  maybe i have had good chocolate but i cannot recall
20:07:57  It's made with *spoiled milk* for goodness sake.
20:08:00  No, Vorpal is wittering on about what specific type of milk chocolate he likes.
20:08:01  elliott: sure milk chocolate can be okay. But compare it to dark chocolate...
20:08:02  monqy: come to the south. we have good food.
20:08:03  pikhq_: actually I'm going to make a cup of hot chocolate now, From 100% pure Valrhona. I will however add just a tiny bit of sugar to that.
20:08:06  Maaan libcurl is way too big.
20:08:07  CakeProphet: no never
20:08:14  Phantom_Hoover: No, he's talking about the ~best~ dark chocolate.
20:08:18  pikhq_, so your chocolate is more cheesy than your cheese?
20:08:19  one thing i never want to do is go to the southe
20:08:19  Phantom_Hoover: no
20:08:25  Phantom_Hoover: Yes.
20:08:26  Vorpal: Milk chocolate is more enjoyable than 99% of dark chocolate and that's that.
20:08:34  elliott: not at all.
20:08:36  monqy, you can go south from California?
20:08:40  Phantom_Hoover: cheese is typically made from extremely fresh milk....
20:08:41  >_>
20:08:42  Vorpal: See exception (a) to my rule.
20:08:46  elliott: tastes just differ. I guess you don't have a grown up taste yet.
20:08:48  pikhq_, enlighten CakeProphet.
20:08:51  i don't want to go to mexico either
20:08:59  is mexico good?
20:08:59  Vorpal: No, you're just a member of "joyless people".
20:09:08  CakeProphet: Cheese is either coagulated milk or coagulated, carefully rotten milk.
20:09:16  no
20:09:18  it's not rotten
20:09:19  at all.
20:09:23  (Re milk chocolate) Mind you I also hate milk :P
20:09:23  coagulated, yes. soured, yes.
20:09:29  but the milk is fresh when all of this happens.
20:09:36  some cheese is good. other cheese is bad.
20:09:41   - monqy
20:09:46  Allowed to have bacteria and fungi consume it and release waste products, yes.
20:09:56  This is a process we generally call "rotting".
20:09:58  All cheese is bad. Other cheese is worse. - Gregor
20:10:23  pikhq_: it's similar sure, but with rotting there isn't any control over what kinds of bacteria
20:10:34  Gregor is bad. - Gregor
20:10:49  pikhq_, it was a jibe at American cheese food product, not a discussion on the manufacture of cheese, actually.
20:10:55  aaaaaah -aaaaaaaah
20:10:55  Milk chocolate fnarfs quite horrible.
20:11:04  gregor smells - gregor's mother
20:11:08  Gregor: You fnarf horrible.
20:11:27  Phantom_Hoover: Oh, right.
20:11:41  I'm sure I would fnarf just fine if prepared properly.
20:11:54  american cheese is awful
20:12:09  Calling it 'cheese' demeans cheese.
20:12:12  yep
20:12:23  'Cheesoid' is perhaps sufficient.
20:12:30  Choid.
20:12:31  hey guys have you ever had aerosol cheese? I can't recall if I ever have
20:12:37  No.
20:12:38  CakeProphet: American cheese is a "wonderful" thing. It consists of a mixture of milk, whey, milkfat, milk protein concentrate, whey protein concentrate, salt, and an emulsifier.
20:12:46 -!- Gregor has set topic: Official support channel for Web o' Flies | Also official channel of Velveeta™ | Velveeta™: Why cheese, when you can Velveeta!® |  http://codu.org/logs/_esoteric/.
20:12:53  Gregor: You removed the assignments.
20:13:00  elliott: These things happen.
20:13:12  Gregor: atehwa will be sad.
20:13:24  CakeProphet: American cheese food product is even more amazing: it can contain 0% milk!
20:13:53  Ah, yes, and it's commonly *extruded* into individual slices.
20:14:00  Also, it's available in *aerosol cans*.
20:14:16  America, Land of the Brave, Land of the Free, and Land of Crappy Cheese.
20:14:19  https://secure.wikimedia.org/wikipedia/en/wiki/File:Easy_cheese2.jpg I shit you not.
20:14:39  pikhq_: I'm aware of such concoctions.
20:14:40  Yes, it even has the audacity to claim to be real cheese.
20:15:10  pikhq_, no it doesn't, it states quite clearly that it's a pressurised cheese snack.
20:15:17  pikhq_: To be fair, it's not actually aerosol in it :P
20:15:20  "Picture taken by myself in my office, to help show a better picture of Easy Cheese."
20:15:31  provolone ftw
20:15:32  Phantom_Hoover: It then has a thing there that says "REAL Kraft™ CHEESE"
20:15:45  they should call it Easy "Cheese"
20:15:49  just scare-quote every fake product
20:15:51  *Kraft* cheese.
20:15:55  eventually there'll be like
20:15:57  "Kraft" Cheese
20:16:00  real cheese from fake kraft!
20:16:02  Not *cheese* cheese.
20:16:25 -!- ais523 has joined.
20:16:27   that the nazis had milka <-- well they obviously needed something to eat with their fanta
20:16:45 * ais523 continues to boggle at KDE programs loading faster than Gnome programs nowadays
20:16:50  hm, would it be possible to put real cheese into a good spray?
20:16:57  So, Wonder Bread, Spam and Easy Cheese: Best sandwich?
20:17:02  monqy: No :P
20:17:03  not that spray is a good idea at all
20:17:09  Gregor: Oh god.
20:17:16  (I'm using Gnome 2's shell, so I'd assume that Gnome's libraries would be hotter in cache)
20:17:21  monqy, maybe if you used cottage cheese or something?
20:17:30  Phantom_Hoover: BTW do you have any Bread Recommendations, I feel like the quality of bread in general has gone down in recent years?
20:17:47  I just eats bread when I gets bread.
20:17:49  elliott: I don't really, I'm having severe problem finding breads I like
20:18:04  elliott: I recommend cake.
20:18:04  I typically prefer rolls to loaves
20:18:04  lol@"I just eats bread when I gets bread"
20:18:05   And people who like milk chocolate should feel bad. <-- THAT'S IT YOU'RE AT WAR WITH NORWAY NOW
20:18:19  ais523: Ditto.
20:18:37  oerjan, perpetually ten minutes in the past.
20:18:41  I prefer rice to bread (because it is an alternative)
20:19:04  elliott: because I find it hard to find a brand of loaf I'm OK with
20:19:14  typically I don't mind sliced brown bread so much, whatever the manufacturer
20:19:33  (the really cheap own-brand stuff tastes OK for me for the purposes for which I mostly use bread, although it's not so good for sandwiches)
20:19:55  solution, just use fried chicken breasts as your bread.
20:20:11  The fresh, unsliced rolls you can get from $supermarket_bakery are pretty good, but make for lousy toast.
20:20:16  http://en.wikipedia.org/wiki/Double_Down_(sandwich)
20:20:34  Praise be to America!
20:20:40  use doughnuts as bread
20:21:13  CakeProphet: What does that thing actually taste like.
20:21:19  elliott: like I know.
20:21:25  I want to hate it, but... it's chicken and bacon...
20:21:25  "so much 100 percent premium chicken, we didn't have room for a bun."
20:21:27  elliott: I know of noöne brave enough to try :P
20:21:32  I mean I can kind of imagine what it tastes like.
20:21:39  elliott: it's kfc chicken
20:21:41  elliott: i.e. gross
20:21:57  strangely, I ate some just a few minutes ago, but it wasn't from KFC
20:21:57  monqy: https://secure.wikimedia.org/wikipedia/en/wiki/Luther_Burger
20:22:01  but from $generic_fish_and_chip_shop
20:22:03  pikhq_: yes that
20:22:23  monqy: KFC are the best common non-fish-and-chips fast food outlet I know of, but ISTR their fillets are pretty gross, so eh
20:22:32  pikhq_: Wh...
20:22:39  maybe british kfc is better than american kfc
20:23:07  http://en.wikipedia.org/wiki/Heart_Attack_Grill
20:23:17  beats Luther Burger
20:23:27  "The establishment is a hospital theme restaurant: waitresses ("nurses") take orders ("prescriptions") from the customers ("patients"). A tag is wrapped on the patient's wrist showing which foods they order and a "doctor" examines the "patients" with a stethoscope. The menu includes "Single", "Double", "Triple", and "Quadruple Bypass" hamburgers"
20:23:29  elliott: hmm, actually my favourite common fast food chain is Burger King
20:23:35  elliott: Remember: this is a country that has such a thing as "deep fried butter".
20:23:48   All cheese is bad. Other cheese is worse. - Gregor <-- really? Cheese in general is awesome, though there might be specific variants of cheese that I'm not personally a fan of.
20:23:50  ais523: I don't actually have any experience with Burger King so that may be
20:23:53  as an aside, I went to a McDonalds in Canada once, and it was actually mindbogglingly superior to the version they had in the UK
20:23:55 * elliott is no fast food expert.
20:24:05  Vorpal: I don't like any dairy products.
20:24:05  I can see why North Americans hate UK fast food chains that much
20:24:06  Vorpal: Cheese may taste good, but it seems to fnarf terrible.
20:24:10  There's British KFC? Kent Fried Chicken?
20:24:18  ais523: McDonalds in Canada is, near I can tell, I totally unrelated chain to McDonalds everywhere else.
20:24:18  Kent Fried Chicken :D
20:24:23   monqy: https://secure.wikimedia.org/wikipedia/en/wiki/Luther_Burger <-- the crap?!
20:24:27  s/, I totally/, a totally/
20:24:29  Gregor: hmm
20:24:31  `addquote  There's British KFC? Kent Fried Chicken?
20:24:33  pikhq_: fnarf?
20:24:33  713)  There's British KFC? Kent Fried Chicken?
20:24:35  pikhq_: what?
20:24:36  they had pretty much the same menu items as in the UK
20:24:39  they just meant different things
20:24:40  Vorpal: Gregor's sense.
20:24:51  Vorpal: Gregor doesn't have a sense of taste, he has a sense of fnarf.
20:25:02  OKAAAY
20:25:05  BTW, what is actually in Kent, I am not entirely sure it exists.
20:25:07  Vorpal: Gregor is anosmic.
20:25:08  gregor "tasteless" richards
20:25:10  ais523: From what I understand, McDonalds is pretty much *identical* world-wide. Except apparently Canada?
20:25:14  SORRY HYPOSMIC OR W/E
20:25:23  pikhq_: I thought Japanese McDonalds was wildly different.
20:25:34  McDonald's isn't anywhere near identical worldwide.
20:25:39  They're very adaptive, actually.
20:25:48  They have a few staples that are the same everywhere, but that's it.
20:25:49  http://1.bp.blogspot.com/_vUALNnFd_tE/Sj8-aWMGzGI/AAAAAAAAAUk/l6SKDtZ-kH8/s320/bypassburger.jpg
20:25:52  for reference
20:25:55  elliott: Japanese McDonalds mostly just has racist marketing.
20:25:58  pikhq_: if I eat hamburger in Sweden I do it at Max: https://secure.wikimedia.org/wikipedia/en/wiki/Max_Hamburgers
20:26:01  I suppose in Canada and Australia it's QFC, Quebec Fried Chicken or Queensland Fried Chicken respectively
20:26:07  pikhq_, racist to whom?
20:26:10  pikhq_: I thought they had, like, really good beef or something. Or at least I've heard that.
20:26:11  Phantom_Hoover: Cows.
20:26:16  Phantom_Hoover: Caucasians.
20:26:18  pikhq_ (and other Americans who care): the UK version of McDonalds works pretty much via taking the basic ingredients of a McDonalds meal, submerging them in oil and then serving the result
20:26:22  Phantom_Hoover: Same thing.
20:26:28  well, apart from things like lettuce, which are just served raw
20:26:30  Cowcasians.
20:26:38  ais523: Sounds utterly authentic to US McDonalds.
20:26:39  ais523: They could optimise that. Oil lettuce.
20:26:49  double oil
20:26:50  the chips/fries end up incredibly bland as a result, and they add vast amounts of salt to cover this up
20:26:56   oerjan, perpetually ten minutes in the past. <-- LIES
20:27:06  ais523: To be fair, the submerge-in-oil-and-serve-the-result method can sometimes be effective, cf. doughnuts.
20:27:14  oerjan, please tell me you waited ten minutes until saying that.
20:27:17  elliott: or the typical fish and chip shop
20:27:24  ais523: Indeed.
20:27:26  ais523: Perfectly authentic!
20:27:30  I'm not complaining about that, so much as that they don't do anything to the ingredients beforehand
20:27:42  My incredibly slow, inefficient, and badly written program is running
20:27:43   pikhq_ (and other Americans who care): the UK version of McDonalds works pretty much via taking the basic ingredients of a McDonalds meal, submerging them in oil and then serving the result // ais523: I thought this was the UK's version of all cooking?
20:27:56  Gregor: 'Cept curry.
20:27:59  Note to future civilisations: Yes, this is really what the 21st century is like.
20:28:02  Gregor: oddly, no
20:28:08  Gregor: That isn't even in line with the stereotypes.
20:28:10  future envy
20:28:10  future envy
20:28:20  Also, the stereotype is boiling, not frying. :)
20:28:21  Gregor: You're meant to think we exclusively eat ridiculously bland, quaint stuff.
20:28:26  There's no oil involved in that :P
20:28:34  Boil it until it the flavor's leached out!
20:28:37  pikhq_: Curry is stolen :P
20:28:40  elliott: Fish and chips.
20:28:48  monqy, why are you so envious of the future?
20:28:48  oil tea
20:28:49  elliott: It's just that you can do even deep fried blandly.
20:28:51  Gregor: actually, most good UK food works via stealing it from someone else, then modifying it into something entirely different
20:28:54  Gregor: Meh, curry got stolen by everyone.
20:28:59   oerjan, please tell me you waited ten minutes until saying that. <-- more like 9 minutes
20:29:02  pikhq_: 'struth, even I stole it :P
20:29:04  Gregor: Sounds like you've never had fish and chips!!!!!!!
20:29:06  the UK version of curry is unlike that in India
20:29:19  elliott: I don't like fish either 8-D
20:29:21  to the extent that imported Indian chefs can't cook it very well without special training
20:29:23  I like Madras curry
20:29:30  elliott: But I've had chicken and chips at a fish and chips place in the UK :P
20:29:31  maybe future isn't bad
20:29:33  but it most likely is
20:29:35  Curry is original, it didn't even really exist in India IIRC, it's just meant to taste vaguely Indian
20:29:38  future pity
20:29:42  Gregor: You probably hate vinegar or something like that because you're not human.
20:29:59  Besides, it's not like the UK is unique in having done strange things to curry.
20:30:01  Darth_Cliche: Well, the term "curry" refers to a billion things.
20:30:05  elliott: I like vinegar!
20:30:07  Gregor: hmm, last Friday I broke the pattern, but previously, I'd been trying a large number of fast food outlets within walking distance of my route home
20:30:10  Like, every Asian country has their own rendition of it by now.
20:30:15  and ordering a chicken burger at each of them, to compare
20:30:17  Gregor, please consider that being a culinary nazi is rather pointless when one judges food on an entirely different basis to normal people.
20:30:19  Gregor: Then fish and chip chips are pretty much right up your alley? :P
20:30:23  Gregor: it basically means throwing a bunch of random spices together, right?
20:30:27  no cheese because I don't eat cheese, plus chips were appropriate
20:30:33  They're pretty much designed as a host for ridiculous amounts of vinegar.
20:30:37 -!- Zuu has quit (Ping timeout: 244 seconds).
20:30:49 -!- variable has joined.
20:30:50 -!- variable has quit (Changing host).
20:30:50 -!- variable has joined.
20:30:52  Darth_Cliche: It means "sauce".
20:30:55  elliott: would you believe it if I said I liked chips both with and without vinegar, but had a marginal preference for without?
20:30:56  ais523: you don't eat cheese?
20:31:00  ais523: why on earth
20:31:00  Phantom_Hoover: Shutuppayouface!
20:31:03  elliott, my parents *do not understand this*.
20:31:05  Vorpal: He's not allowed to.
20:31:05  As you can imagine, this is really insanely varied.
20:31:06  that's quite different to not liking vinegar
20:31:11  elliott: They would be, except I don't like fish :(
20:31:11  pikhq_: I mean the English meaning, not the meaning of whatever Hindi word it was borrowed from
20:31:12  elliott: doctors order?
20:31:15  i think i like fish and chips
20:31:16  Vorpal: I have a huge range of bizarre food intolerances
20:31:20  ais523: I see
20:31:25  They respond with astonishment when I saturate chips with vinegar.
20:31:26  some more specific than others
20:31:26  ais523: :(
20:31:29  Darth_Cliche: Ah. Yeah, that's just a vague imitation of Indian spicing.
20:31:31  Darth_Cliche: Primarily coriander, cumin, chili peppers and typically turmeric.
20:31:33  Vorpal: Ask ais523 about that time he was on a completely neutral drink!
20:31:37  Neutral isn't the word.
20:31:41  I can't think of what the word would be.
20:31:50   oerjan, please tell me you waited ten minutes until saying that. <-- nope.
20:31:50  as far as I know I don't have any actual /allergies/
20:31:50  elliott: ph 7?
20:31:52  Phantom_Hoover: Yes well that is parents for you.
20:31:57  ais523: how specific are we talking about here?
20:31:57  but I go a bit crazy if I eat the wrong things
20:32:09  Vorpal: we're not sure, the results were self-contradictory
20:32:17  elliott, and nobody will stop harping on about that time I drank some vinegar from the bottle.
20:32:18  oerjan: did you wait about 9 minutes though?
20:32:21  Phantom_Hoover: I...
20:32:29  Phantom_Hoover: I may like vinegar, but WTF man.
20:32:31  there's also a list of things that they don't think I'm intolerant to, but I shouldn't eat anyway in case I become allergic to them
20:32:37  It was balsamic!
20:32:46  Okay, that's at least vaguely sane.
20:32:50  ais523: How do you distinguish between an existing tolerance and one that's developed by consuming it anyway :P
20:32:59  Phantom_Hoover: I have a friend who drinks pickle brine >_>
20:33:08  Phantom_Hoover: Wait, people consume vinegar that isn't balsamic?
20:33:16  elliott: I'm not a dietician
20:33:25  elliott: Apple Cider vinegar is OK ...
20:33:35  elliott, dude, malt vinegar is the default chip vinegar.
20:33:36  ais523: huh...
20:33:37  and if it involved spending my time dealing with people like me, I probably wouldn't want to be either
20:33:43 * pikhq_ hates malt vinegar.
20:33:58  There's something about it that's just... wrong.
20:34:00  Phantom_Hoover: I might be mixing up my vinegars X-D
20:34:02  I can't quite place it.
20:34:06  towards the end, they basically gave up, concluding that there was a reasonably stable base of things that I could probably eat which was enough to live on
20:34:07  My sister is allergic to most raw fruits aside from citrus
20:34:14  elliott, balsamic is the dark brown stuff.
20:34:18  I'm alergic to atoms.
20:34:19  ais523: could it be some weird form of hypochondria or placebo effect or such behind the contradicting results?
20:34:28  elliott: Balsamic is the one made from grape juice.
20:34:29  Used frequently on salads.
20:34:33  Phantom_Hoover: Isn't malt vinegar dark brown too...
20:34:34  Vorpal: it's entirely possible
20:34:37    oerjan, please tell me you waited ten minutes until saying that. <-- more like 9 minutes <-- see? lies!
20:34:39  elliott, nope, it's transparent.
20:34:47  helloerjan
20:34:48  oerjan: ...
20:34:54  anyway, I stop being lawful good if I eat the wrong food, so it's obviously in my interest to avoid it
20:34:55  Phantom_Hoover: Uh, that's white vinegar.
20:35:07  Oh, wait, malt is light brown.
20:35:09  ais523: wait, it's that easy to stop you being lawful good?
20:35:12  Which is generally made *from* malt vinegar, but only because that's cheap.
20:35:14  ais523: meet you in birmingham
20:35:25  elliott: it's quite hard to get me to eat the wrong food, as a result
20:35:29  When distilling acetic acid, who cares what the source is? :)
20:35:30  I don't turn evil or anything
20:35:33  more… primal, or whatever
20:35:40  it's a little hard to describe
20:35:43  also, to remember after the event
20:35:50  You're lawful? Odd, most FOSS people are chaotic
20:35:52  I just get confused because it looks clear when you put it on things.
20:35:58 -!- Zuu has joined.
20:36:05  Darth_Cliche: I've been repeatedly accused of being lawful good until I started believing it myself
20:36:11   Gregor: You probably hate vinegar or something like that because you're not human. <-- hey i don't like vinegar :(
20:36:13  and it's kind-of easy to see why, to be fair
20:36:16  ais523: So chaotic good then when you ate the wrong food?
20:36:16  Darth_Cliche: "Lawful" says you want law and order, not that you support *the* law.
20:36:26  oerjan: Yeah, but you're Norwegian.
20:36:31  pikhq_: I know, but most FOSS people I want are chaotic even by that definition
20:36:33  Vorpal: more utterly ranting and nonsensical
20:36:34  er
20:36:36  s/want/know/
20:36:38  ais523: Would you be able to work on Feather in those conditions?
20:36:40  hmm, think any typical YouTube user
20:36:41  They sound ideal for the purpose.
20:36:48    Gregor: You probably hate vinegar or something like that because you're not human. <-- hey i don't like vinegar :( <-- yes vinegar is horrible.
20:36:49  Coherency is optional, after all.
20:36:55  oerjan: you suck.
20:37:01  Vorpal: you are, as mentioned earlier, not a human
20:37:12  ais523: I'm not even sure what alignment that is
20:37:12  elliott: I can work on Feather in normal conditions, actually
20:37:20  Vorpal: neither am I, that's why I didn't call it one
20:37:24  Vinegar is wonderful and anyone who disagrees is wrong.
20:37:28  probably counts as true neutral via the defaulting rule
20:37:29  ais523: OK do it.
20:37:34  XD
20:37:35  Vorpal: You need an extra dimension on the alignment chart.
20:37:44  "Smart/neutral/stupid".
20:37:44  elliott: you care /that much/ about Feather?
20:37:49  pikhq_: heh
20:37:50  They'd be chaotic neutral stupid.
20:37:53  ais523: Enough to tell you to work on it, yes.
20:38:03  the problem is, after working on Feather for a few hours, it takes me several weeks to recover
20:38:09  but I'm perfectly sane when the process /stars/
20:38:10  What's Feather?
20:38:12  */starts/
20:38:15  Darth_Cliche: don't ask that question!
20:38:24  elliott: can we train the bots to just get rid of anyone who asks what Feather is?
20:38:35  pikhq_: I think D&D traditionally represents that as the Int value
20:38:37  ais523: yes
20:38:41  preferably via humane means?
20:38:42  ais523: but only if you work on feather for me
20:38:47 * Sgeo|web wants Feather
20:38:57  elliott: but then we'd be able to sensibly answer the question!
20:38:58  Vorpal: Yeah, but D&D stats suck.
20:39:03  Darth_Cliche: http://esolangs.org/wiki/Feather. anyone worthy of knowing more than is written on that page gets to find out how to get a greppable copy of the logs themselves
20:39:08  Darth_Cliche: and read every log containing "feather"
20:39:09  Vorpal: "Wisdom" is your ability to see things for goodness sake.
20:39:16  pikhq_: true.
20:39:19  ais523: you think implementing feather will prove it sensible?
20:39:29  pikhq_: wait isn't Wis also for wizard spell casting? Or is that Int?
20:39:33  Darth_Cliche: let's see… the sanest (but misleading) answer is "it's an inside joke", any /correct/ answer would be indistinguishable from trolling
20:39:36   oerjan: did you wait about 9 minutes though? <-- no, i responded when i got to it.
20:39:54  Vorpal: Int is wizard spell casting.
20:39:55  elliott: I believe Feather would make sense, if only I had an impl of it
20:39:58  pikhq_: I think sorcerers use Cha or some stupid thingy though?
20:40:04  Wis is cleric/druid spell casting.
20:40:04  which never made any sense to me
20:40:08  Cha is sorcerers.
20:40:15  Vorpal: Cha is force of personality
20:40:17  And I don't care about the casting state for non-primary casters.
20:40:21  My incredibly badly written bad program is essentially a ridiculously inefficient variant of Dijkstra's algorithm
20:40:21  ais523: hm
20:40:24  s/state/stats/
20:40:27  Designed to write Piet programs
20:40:39  ais523: could eating the right sort of food cause you to code more Feather?
20:41:07  think that sorcerers are people who impose their will on the world just by being that badass
20:41:10  Vorpal: That's what I asked.
20:41:19   And I don't care about the casting state for non-primary casters. <-- wait, who else can cast than those we mentioned so far?
20:41:26  ais523: man, i gotta become a sorceror
20:41:28  rather than working out how to cast magic mathematically / thaumaturgically / whatever, they just glare at reality until it does what they want
20:41:32  elliott: ah, I must have missed it what with the multiple convos going on at the same time
20:42:06  Vorpal: rangers, paladins
20:42:14  and a bunch of custom and prestige classes, as always
20:42:14   helloerjan <-- hi monqy
20:42:15  I see
20:42:26  ais523: well I never really cared about those
20:42:45  or if you're talking 4th edition, everyone casts
20:42:49  what
20:42:50  really?
20:42:54  and in fact everyone is identical, in order to make the classes balanced, just with different flavour
20:42:57  Vorpal: well, it's not called spells
20:43:11  I only used whatever system NWN1 uses. 3 iirc?
20:43:19   more… primal, or whatever <-- "normal"?
20:43:32  but 4th edition class abilities, even the ones that are called nonmagical, make no sense whatsoever
20:43:41  oerjan: you are NEVER going to catch up at this rate
20:43:41  oerjan: no
20:43:45  it's, umm, a lot like being drunk
20:43:53  or at least, how other people act when they're drunk
20:44:16  I get really emotional, and don't bother with trying to act sanely at all
20:44:26  Vorpal: Rangers, paladins, bards, splatbooks.
20:44:26  I got into fights sometimes in that state, too
20:44:33  *Everybody* forgets about bards!
20:44:37  pikhq_: where does the name "splatbooks" come from?
20:44:42  also, I consider bards primary casters
20:44:43  ais523: No idea.
20:44:50  ais523: what's the gnu tla of tabletop rpgs??? thx
20:44:54  having played them at least once, possibly twice
20:44:57  also the monotone
20:45:01   Vorpal: Rangers, paladins, bards, splatbooks. <-- splatbooks? What?
20:45:03  those are basically the only elements of any set i am interested in
20:45:05  I don't remember that
20:45:11   oerjan: you suck. <-- NO U
20:45:12  Vorpal: "splatbooks" are addon bullshit books.
20:45:17  oh right
20:45:23  they're what people try to sell you once you already have the rules
20:45:37  Okay, well, there's also the more reasonable addon books. Those ones are in the D20 SRD, though.
20:45:44  (e.g. psionics handbook)
20:45:52  pikhq_: I mostly played D&D through NWN1. I think the only pen & paper campaign I ever did used GURPS + a few house rules
20:46:04  that was several years ago though
20:46:08  don't remember much of it
20:46:09  Vorpal: Neverwinter Nights 1 is based on D&D 3.0
20:46:13  ais523: right
20:46:21  with a few bugfixes taken from 3.5 or elsewhere
20:46:40  The distinction between 3.0 and 3.5 is fairly minor, though.
20:46:46  yep
20:46:52  they're noticeably different, in that you'll notice the differences
20:46:58  but you won't care all that much about them
20:47:05  right
20:47:09  noticeably different in that the differences are merely noticeable
20:47:11  rather than being major
20:47:12  D&D 4 sounds horrible
20:47:23  Vorpal: it's basically an entirely different game from 1..3
20:47:32  it has some interest as a wargame
20:47:38  but it doesn't seem like a sensible basis for an RPG
20:47:43  ais523: on the other hand I know a guy who refuses to play any D&D apart from AD&D 1. I don't understand why.
20:47:46  I prefer GURPS anyway
20:47:58  Darth_Cliche: GURPS has interesting grappling :P
20:47:58  Vorpal: well, D&D has got a lot less lethal over time
20:48:03  GURPS is a really fun system, though even *less* balanced than D&D.
20:48:17  Say again?
20:48:26  GURPS is what you get if you combine every roleplay concept ever together in one RPG
20:48:26  It's probably impossible to be both balanced and generic, though.
20:48:28  ais523: unehlfpul :'(
20:48:30  and try to make the rules cover all of tehm
20:48:39  elliott: sorry, I'm trying to figure out what you mean by the tla and the monotone
20:48:41   oerjan: you are NEVER going to catch up at this rate <-- plausible.
20:48:44  ais523: Works surprisingly well, considering.
20:48:49  and I feel that the RPG systems exist, but I don't know what they are
20:48:54  ais523: well, if D&D is the SVN, or the git, or whatever you think it analogises closest to
20:48:59   GURPS is what you get if you combine every roleplay concept ever together in one RPG <-- yes kind of
20:49:10  ais523: I think it is GURPS that have the insane grappling rules, isn't it?
20:49:12  or was it D&D
20:49:16  ais523: hmm, GURPS ~ DCSS?
20:49:17  I don't think I ever grappled in either
20:49:24  understanding through analogy is difficult :D
20:49:29  Vorpal: D&D has the non-functioning grappling rules.
20:49:30  Vorpal: D&D's grappling rules are vaguely tacked on and look a little out of place
20:49:43  although they work much better in 3rd edition than they did in previous versions
20:49:44  pikhq_: I mean the one with really really complex one
20:49:45  I can't remember how, but they actually break.
20:49:54  That'd be D&D.
20:49:57  ah okay
20:49:58  (i.e. they look weird and only break occasionally, rather than looking weird and breaking all the time)
20:50:07  right
20:50:11  ais523: break in what way?
20:50:16  elliott: you could compare D&D 3 to svn decently
20:50:35  ais523: as in references to table entry 59 in a 50 entry long table?
20:50:36  Vorpal: I haven't seen the 2nd edition "wrestling table", but it was apparently ridiculous
20:50:40  whereas in 3rd ed, it's just fiddly
20:50:44  I see
20:50:44  and broken as in game balance
20:50:45  Vorpal: They lead you into undefined semantics.
20:50:50  pikhq_: :D
20:51:02 * Darth_Cliche opens up http://codu.org/logs/_esoteric/2010-12-14.txt and rolls eyes at "00:04:11: * oerjan ponders making a joke page for Feather"
20:51:03  I wonder if you could use DF's combat mechanics for that kind of thing?
20:51:42  ais523: what's 4, then? svk?
20:51:58  Phantom_Hoover: doing DF combat mechanics would only ever work in a computerised RPG. It would be unfeasible to do it for a pen & paper RPG
20:52:00  Darth_Cliche: http://codu.org/logs/log/_esoteric/2010-12-14 has a nicer UI
20:52:08  Darth_Cliche: but that log is much newer than feather discussions
20:52:09  Phantom_Hoover: too much calculation involved. You would spend ages for each turn
20:52:23  Vorpal, I mean using DF for the combat, duh
20:52:25  Darth_Cliche: try !logs to get an rsync mirror of the logs then grep -i 'ais.*feather' ????-??-??.txt
20:52:28  elliott: hmm, I can mentally construct the VCS analogue of 4, but I'm not sure it exists
20:52:31  Phantom_Hoover: ah
20:52:39  !los
20:52:40  !logs
20:52:44  it would probably involve Facebook in some way, though
20:52:50  ais523: :D
20:52:52  ais523: ooh, that sounds like it needs making
20:52:58  ais523: hmm, maybe Fossil? that has a wiki
20:53:09  Now I must figure out rsync
20:53:17  Darth_Cliche: or hg
20:53:22  iirc
20:53:34  !pastelogs ais523.*Feather
20:53:37  I don't know what any of this even is, really
20:53:39  `pastelogs ais523.*Feather
20:53:47  Darth_Cliche: good, you possibly don't want to
20:53:53  I'm more inclined to say "imagine RCS, except done today, and in Python".
20:53:54  I mean, rsync and hg and all taht
20:53:55  however, more likely you simply won't understand it
20:54:00  http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/paste/paste.28875
20:54:10  Darth_Cliche: feather is complicated. It involves time travel. And headaches.
20:54:26  "You have chosen to open: paste.28875 which is: a 23600 file"
20:54:28  pikhq_: what, that would be hg or bzr?
20:54:38  Vorpal: Neither.
20:54:41  pikhq_: hm
20:54:47  Darth_Cliche: that link is relevant
20:55:04  wow, I've been working on Feather for /three years/ now?
20:55:13  Vorpal: RCS is CVS, single-user.
20:55:15  ais523: FSVO working
20:55:18  * Darth_Cliche opens up http://codu.org/logs/_esoteric/2010-12-14.txt and rolls eyes at "00:04:11: * oerjan ponders making a joke page for Feather" <-- well i did, didn't i?
20:55:20  pikhq_: hm
20:55:20  (oversimplification I know)
20:55:26  pikhq_: so what would it be in python then
20:55:35  Vorpal: That but ridiculous.
20:55:40  right
20:55:43   tusho: you would make the jquery UI available as IO commands that Feather could use
20:55:52  anyway why would it make sense to compare RPG systems to VCSes?
20:55:59  ais523: I don't want to know what the context of that is
20:56:05  and will proceed to not find out
20:56:11  elliott: likewise ;)
20:56:31  2008-10-19.txt:12:02:24:  hmm... figuring out how to hot-change parts of a Feather program while it's running is a major problem
20:56:32  elliott: I could imagine that with Sgeo... But with you!?
20:56:37  actually, I still haven't solved that one
20:56:51  Vorpal: hey, ais523 is the one who said that line
20:56:53  I'm coming across more fundamental problems in my attempt to get far enough to encounter that one
20:56:59  elliott: yes but directed to you
20:57:05  Vorpal: like i said, let's not find out
20:57:07  ais523: what's the current problem?
20:57:50  elliott: writing an initial interpreter
20:57:59  So Feather is a language involving time travel, which has evolved into an inside joke about it driving ais insane?
20:58:16 -!- oerjan has quit (Quit: Caught up, also, good night).
20:58:19  I think the solution we worked out between us of using CPS to get complete metacircularity will work
20:58:21  but I haven't tried it yet
20:58:32  Darth_Cliche: that's a good approximation, I think
20:58:46  it /does/ drive me insane, and this has happened enough to become an inside joke
20:58:47 -!- ive has joined.
20:59:12  how exactly are you supposed to implement it, anwyay?
20:59:21  Darth_Cliche: it doesn't actually involve travel
20:59:23  http://www.dandwiki.com/wiki/SRD:Grapple <-- yeah this looks complicated. Especially given all the tables too
20:59:23  just the illusion of such
20:59:45  Darth_Cliche: part of the problem is that a Feather interp can only be implemented in Feather
20:59:50  so I'm trying to figure out how to get started
21:00:20  ais523: shouldn't a method similar to that of CLC-INTERCAL work?
21:00:21  ais523: neutrino computer
21:00:26  (the trick, as far as I can tell, is that although a Feather interp must be written in Feather, a Feather-interp-in-Feather might potentially be runnable in something that isn't a Feather interp, and so can be written in another language)
21:00:31  ais523: you start off with something, then you modify it into being Feather
21:00:47  Vorpal: *retroactively modify it into being Feather
21:00:51  but yes, obviously
21:01:06  do you seriously think I /hadn't/ thought of that?
21:01:11  well, no
21:01:16  but you never know
21:01:33  2009-04-01.txt:23:06:05:  cpt_obvious: I suggest you ask in #feather-lang, I think it's empty atm so it'll be safe to ask
21:01:53  Britons: http://www.telltalegames.com/wallaceandgromit
21:02:07  Gregor: Old, no?
21:02:23  elliott: 'snot new, it's old enough for me to actually buy (read: now cheap :P )
21:02:25  Vorpal: elliott solved a couple of major Feather-related problems of mine, anyway
21:02:36  ais523: wow, i did?
21:02:38  ais523: right
21:02:41  Gregor: have i mentioned that time someone from telltale was on esowiki??
21:02:43  Gregor: so good
21:02:44  ais523: which ones?
21:02:53  elliott: the one related to eigenratios
21:03:27  ais523: ah yes
21:03:41  gah, now I can't remember the solution
21:04:05  And how goes Scape🐐?
21:04:14  Gregor: not as well as I'd like
21:04:26  hmm, perhaps I should implement Feather just to get elliott to implement scapegoat
21:04:47  or perhaps even implement scapegoat myself, but the problem is that when elliott writes a program, it's superior to everyone else's programs that do the same thing
21:05:09  (Except mine)
21:05:21  To make a good esolang, you need a shiny new concept
21:05:28  ais523: what really? Or is that just what he thinks?
21:05:30  Or a new take on an old concept
21:05:31  ais523: Scapegoat has been on the backburner pending a sufficiently interesting breakthrough for me to be jolted into beginning
21:06:12  ais523: e.g. a good scapegoat diff algorithm
21:06:14  elliott: oh, I thought you'd already started
21:06:22  ais523: well, I have code
21:06:29  but it's more the proof of concept type
21:06:36  btw, does anyone have any feedback on Web of Lies yet?
21:06:48  it still doesn't work on a machine that i don't have to talk to via qemu
21:07:08  ais523: Never made it work >_>
21:07:09  what exactly do you mean by retroactively modifying another language into Feather, anyway?
21:07:22  Darth_Cliche: changing it so that it was Feather all along
21:07:32  but how?
21:07:32  umm, you're getting dangerously close to me having to think about the answers
21:07:40  rather than typing them out from memory
21:07:46  and that's always vaguely dangerous
21:10:52 -!- pumpkin has joined.
21:11:16  Darth_Cliche, by using Feather, of course
21:11:58  so is there some description of feather somewhere?
21:12:39  http://codu.org/logs/_esoteric/
21:12:54  olsner: oh no, not you too
21:12:55  Hold on, I'm Taneb!
21:13:02  the short answer is: no
21:13:11  olsner: grep -r feather
21:13:39 -!- pumpkin has changed nick to copumpkin_.
21:13:48 -!- copumpkin has quit (Ping timeout: 260 seconds).
21:13:54 -!- copumpkin_ has changed nick to copumpkin.
21:13:57  mmkay, never mind then
21:15:08  elliott: you know you were asking about kerio earlier? this is self-parody, but still a good summary: http://qdb.rawrnix.com/?711
21:15:55  ais523: oh, good, paxed knows how to use eir op privileges
21:16:10 * elliott teaches the -minecraft school of op privilege usage
21:16:14  elliott: e rarely does
21:16:21  hire more ops
21:16:29  but doesn't hesitate when he thinks someone is trolling
21:16:47  QUESTION! Are all cellular automatons self-modifying?
21:17:05  Taneb: arguably, none are
21:17:15  unless the rules for CA update were taken from the playfield
21:17:18  hmm, that might be an interesting langauge
21:17:20  *language
21:17:23  but probably wouldn't be
21:18:11  ais523: you've told kerio python sucks, right? maybe e just doesn't realise
21:18:23  elliott: yes, although not in those words
21:18:32  clearly you're not being clear enough :)
21:18:45  fwiw, Rodney is a Perl script that doesn't exactly follow best practices
21:19:04  in order to load a module, it used an old-fashioned syntax whose difference from the current one is that it runs at runtime not compile-time, and you have to handle errors manually
21:19:11  then ignored the error code
21:19:25  which made debugging it really confusing
21:19:43  in other words, it used require instead of use?
21:19:51  CakeProphet: no, it used do
21:19:55  oh.....
21:20:00  I had to look up that meaning of do when I saw Rodney
21:20:00  fun.
21:20:09  http://qdb.rawrnix.com/?470 good quote
21:20:11  require is at least vaguely useful
21:20:15  ais523: I use do in my words.pl script currently.
21:20:17  actually.
21:20:19  to load the data files.
21:20:30  CakeProphet: do you at least check $@ afterwards?
21:20:35  yes.
21:20:41  OK, that's more than Rodney did
21:20:53  I think I improved Rodney massively by suggesting adding "or die $@" at the end of the do line
21:21:27  ais523: yes it's always do or die with these things.
21:21:30  :>'
21:21:52  CakeProphet: that joke doesn't count, the syntax was intentionally designed to make it possible, I think
21:22:14  elliott: I recently learnt that the actual original reason barewords existed in Perl was to make it easier to write poems that were syntactically valid Perl
21:22:23  ais523: wow
21:22:37  ais523: ala black perl
21:22:42  it seems that one of Larry Wall's coworkers was a poet
21:23:13 * CakeProphet has written poems in modern Perl 5.
21:23:18  because I'm cool.
21:23:28  well, it still accepts barewords for backwards compatibility
21:23:35  of both old programs and poetry, I guess
21:23:55  perl 5 does not
21:24:35  in much the same way there is little difference between code and data.
21:24:40  the same can be said of programs and poetry.
21:26:07  I'm going to delete User:Taneb/Binary Variety Pack
21:26:12  It was a stupid idea
21:26:50  No wait, I don't know how to delete pages?
21:26:53  isn't esolangs.org/wiki where stupid ideas go to die?
21:26:55  also, you can't
21:27:59  Can someone delete it for me?
21:28:32  I recommend making a RfD
21:28:35 -!- sebbu2 has joined.
21:28:36 -!- sebbu2 has quit (Changing host).
21:28:36 -!- sebbu2 has joined.
21:28:41  ais523: don't
21:28:54  ais523: ok, now you can
21:29:04  what did you do? make a backup?
21:29:11  CakeProphet: redirects for deletion?
21:29:13  looked at it :P
21:29:18  wait, let's just move it to the mainspace
21:29:22  then Taneb has no right to want it deleted!
21:29:32  ais523: requests. is that not the wikipedia thing?
21:29:36  it's been a while.
21:29:36  CakeProphet: it's afd
21:29:40  ah.
21:29:44  d = discussion
21:29:45  not deletion
21:29:49  wow, that was a weird Firefox bug
21:30:01  I just highlighted some text and then dragged it to the Firefox search bug
21:30:09  elliott: it was deletion at one point wasn't it?
21:30:16  and it ended up in the middle of the greyed-out text that says what search engine it's set to
21:30:20  also greyed-out
21:30:35  that's almost as weird as Konversation preserving its syntax highlighting if you copy and paste into the /topic dialogue box
21:30:37  CakeProphet: it was votes for deletion
21:30:51  ais523: that's very reproducible, iirc
21:30:55  (which, as the client itself is set to white on black, and the /topic box is generally black on white, makes it hard to read)
21:30:56  but presumably pretty low priority
21:31:02  elliott: I didn't say it was unreproducible
21:31:06  just that it was weird
21:31:07  ais523: white on black? :(
21:31:12  I don't see why there has to be a correlation
21:31:31  elliott: I prefer dark colours to predominate on my computer screen, it becomes easier to look at for extended periods of time
21:31:37 -!- sebbu has quit (Ping timeout: 240 seconds).
21:31:41  ais523: I would accept off-white on dark grey
21:32:15  elliott: the foreground isn't pure white, IIRC
21:32:17  although it might be
21:32:21  the background is pure black, I think
21:32:29  my own comments are light red, nickpings are bright red
21:32:33  the background's the main problem
21:32:36  and notices and server messages are dark yellow
21:32:38  irssi is grey on faded blue for topic.
21:33:23  hmm, why does recursive grep default to recursively grepping stdin?
21:33:30  surely specifying -r is a clue that stdin isn't a good place to read from?
21:33:53  ais523: not even gnu people think tools should second-guess you, usually
21:34:00  see: unix philosophy
21:34:04  elliott: right
21:34:06  it should maybe error out according to gnu design
21:34:10  but it definitely shouldn't default to . or anything
21:34:12  if it's documented behaviour, it's not guessing, I suppose
21:34:24  it's second-guessing, just not first-guessing
21:34:31  erroring on -r would make sense
21:34:49  I hate it when I can't tell whether a program is waiting on a long-running disk/CPU calculation, or waiting on stdin
21:34:58  ais523: it would make sense for gnu design, not unix design
21:35:07  also, that should be solved some other way
21:35:14  terminals should indicate when they want input
21:35:29  well, they /do/ (see IO::Pty::HalfDuplex)
21:35:29  e.g., I don't think an input cursor should be displayed when input isn't desired
21:35:35  but not normally in a user-visible way
21:35:46  (IPHD is both awesome and crazy, incidentally; I didn't write it, but I envy it)
21:35:46  (that works better with line cursors than block)
21:35:52  (since it's less obtrusive and thus less jarring)
21:36:20  ais523: hmm, how is it reported?
21:36:28  ais523: select() showing the tty is ready for writing?
21:37:04  elliott: by reads blocking until the terminal is ready to receive input
21:37:08  that's what the HalfDuplex bit is about
21:37:24  but ofc that isn't inherent to the way the module works internally, just the way it's designed to be used
21:37:58  ais523: no, I mean, how is it implemented internally
21:38:13  hmm, oh, ugly
21:38:15  on all POSIXy platforms but BSD, using job contorl
21:38:17  *control
21:38:26  it pretends to be a shell that just backgrounded the program
21:38:30  ais523: why does my select() solution not work? because it'd report being ready for writing even before it /blocks/ on reading?
21:38:38  then it gets a signal when the program's ready for input
21:38:40  elliott: ofc
21:38:45  grr
21:38:51  it's ready for writing until the write buffer is filled
21:38:58  "In particular, programs like qemu and telnet cannot be expected to ever work with this."
21:38:58  :-(
21:39:24  you could do it with telnet/ssh by having a helper program at the other end, I guess
21:40:23  ais523: so does taeb use that?
21:40:29  yes
21:40:37  most of its development was driven by a desire to use it in TAEB
21:40:46  and it's how I know about it
21:42:27  you should see what it does on BSD sometime
21:42:34  (which I don't fully understand, but it involves a debug API)
21:44:23 -!- sebbu2 has changed nick to sebbu.
21:44:51  hmm
21:48:20  ais523: why do ansi terminal codes suck :(
21:48:36  elliott: Sturgeon's law?
21:48:42  ais523: no but i mean
21:48:48  ais523: you know how you can scroll up in a terminal
21:49:23  many terminals have that feature, yes
21:49:35  ais523: that's a lie
21:49:43  you actually can't modify any lines above the actual visible size of the terminal
21:49:43  ?
21:49:48  so for instance
21:49:57  terminal is 24 lines high? my program can do 24 progress bars
21:50:01  oh, you mean that the scrollback is lying to you in that they aren't actually part of the terminal?
21:50:01  even if you could have one above it
21:50:04  it couldn't change
21:50:06  ais523: yes >:(
21:50:12  why did you /expect/ them to be?
21:50:29  ais523: because the size of a viewport should not affect the size of the underlying medium?
21:50:32 * Phantom_Hoover really needs to unsubscribe from the Golly mailing list.
21:50:36  ais523: pdfs don't get smaller when i resize evince
21:50:43  change the terminal program to treat the scrollback buffer as part of the visible screen
21:50:56  olsner: i'm tempted
21:50:59  elliott: using programs like tmux, you can have a viewport a different size from the terminal itself
21:51:00  couldn't the terminal just grow by one line every line?
21:51:11  however, most programs assume terminals have a vaguely consistent size
21:51:14  ais523: so? it's still stupid that this is how they behave by default >:(
21:51:18  i mean
21:51:22  the terminal viewport size makes sense
21:51:25  for stuff on the alternate screen
21:51:30  and for showing stuff at the correct width
21:51:36  but forbidding modifications above the viewport is dumb dumb dumb
21:51:48  elliott: what if a program scrolled its output sideways rather than upwards?
21:51:50  elliott: it'll mess up "full screen" applications though
21:52:22  ais523: those programs are bad
21:52:41  elliott: you could do your own scrollback in alt screen
21:52:46  elliott: so what you're really saying is, "terminal programs don't act the way I want them to"
21:53:00  ais523: yes, that is indeed the basis of my complaint
21:53:05  do you complain when programs work the way you want them to?
21:53:45  I imagine he consider what the majority would want first
21:53:45  elliott: hmm
21:53:47  before complaining
21:53:51  knowing ais523 that is
21:54:00  Vorpal: sometimes, but not necessarily
21:54:09  heh
21:54:29  the needs of the me outweigh the needs of the many, or few
21:54:37  elliott: btw, what's the appropriate reaction to someone who says they're having problems getting Pulseaudio working on Windows?
21:54:58  ais523: /ignore, delete from all contact lists, deny existence of in future, avoid in real life
21:54:59  ais523: did this actually happen? Where?
21:55:31  Vorpal: yes, and telling you would probably get me into trouble
21:55:43  ais523: was it on irc though? Mailing list? reddit?
21:55:48  IRC
21:55:50  ah
21:55:57  ais523: help them get pulseaudio working in windows, should prove interesting
21:56:01 * ais523 tries to work out why that's relevant
21:56:01  ais523: so +s channel then?
21:56:10  Vorpal: I assume so
21:56:16  mhm
21:56:20  how do you check a channel for +sness? mode?
21:56:36  ais523: are they a member of the UNDEAD?
21:56:43  elliott: how would I know?
21:56:46  ais523: in my client /mode prints the mode of the current channel if given no parameters
21:56:50  ais523: it could be a channel for the UNDEAD
21:56:52  I think it's likely to be unlikely, though
21:57:07  aha, in this client, /mode-ing a channel prints its mode /in that channel/
21:57:10  which is why I couldn't find its answer
21:57:13  ah
21:57:15  yes, it's a +s channel
21:57:26  ais523: how does "likely to be unlikely" differ from a plain "unlikely"?
21:57:40  I'm not sure
21:57:46  well, you used it
21:57:48  I think it implies there's a chance it isn't unlikely
21:57:52  presumably for a reason
21:58:01  hm
21:58:05  hmm, I was thinking about that too
21:58:42  well it kind of makes sense, but I'm not sure I can think of an actual situation it really makes sense to use that instead of a plain "unlikely"
21:59:27  plain unlikely implies that you know the likelihood
21:59:55  hm I guess so
22:00:04  and likely to be unlikely means there's some uncertainty in the likelihood
22:00:13  still, "likely to be unlikely" sounds awkward
22:08:43 -!- mtve has joined.
22:13:06  ais523: oh /no/
22:13:24  elliott: ?
22:13:47  ais523: I think I just figured out a sufficient amount of a protoproto@ that I could even implement it
22:14:00 -!- CakeProphet has quit (Ping timeout: 258 seconds).
22:14:23  elliott: perhaps you should do so, for practice
22:14:37  ais523: I intend to, it's just frightening
22:15:32  ais523: have I mentioned that one of my main requirements for the portability of @ is that you can get a minimal graphics-keyboard-and-mouse-with-no-special-IO-drivers-or-support @ up and running from only the portable system sources, ~3000 lines of python, and a few hundred lines of unportable @ driver code plugging into the python?
22:15:40  (python deliberately picked as an unexpressive and boring language)
22:16:02  umm, compiled sources, that is; whereby "compiled" I mean preparsed
22:16:13  but that's how you develop them, anyway; @ code isn't text at any stage
22:17:02  that seems reasonable
22:17:17  3000 is an overestimate, really
22:17:35  I want the abstract machine it's all based on to be simple enough to implement in just about anything
22:17:39  although probably not brainfuck without some pain
22:17:52  Underlambda!
22:17:56  indeed :)
22:18:13  I suspect that if @ gets any use at all, it will be through a "simulator" on top of unix
22:18:21  perhaps even one written in python
22:18:34  you could run your server on @ by having standard debian beneath it and just having it run the @ simulator and nothing else
22:18:44  and connect to that from a window on your local unix machine with @ networking
22:20:24  it's similar to Squeak in this way, really
22:20:30  although with even less integration, and intentionally so
22:20:47  probably the only way you should even be able to access your local filesystem is over ssh or whatever
22:21:08  what about just using a VM?
22:21:10  and running it in that?
22:21:14  define VM?
22:21:26  ais523: you mean VirtualBox or qemu or w/e?
22:21:36  yes
22:21:40 -!- Taneb has quit (Ping timeout: 258 seconds).
22:21:55  ais523: well, what's the point? that's just an unnecessary layer of abstraction as opposed to running an implementation hosted on top of unix
22:22:08  it'll still be running all the same @ code, just slightly different drivers
22:22:21  well, because of the context-switch stuff
22:22:28  what context-switch stuff?
22:23:07  ais523: ?
22:23:39  elliott: the way that @ is meant to avoid context-switches by working NaCl-style rather than having arbitrary code connecting to the kernel's API
22:24:07  ais523: oh, yes, that's certainly an advantage; but consider that it's a clarity and structural advantage as well as a raw performance one
22:24:15  ais523: here's something that would be a feasible + sensible @ usecase:
22:24:26  you have an old laptop lying around collecting dust which you connect to your router and put @ on
22:24:35  you use this by running an @ simulator on your main unix computer
22:24:39  and connecting to it with @ networking over your LAN
22:24:52  ais523: NaCl being? (Apart from common salt)
22:24:53  you seamlessly run intensive computations on the laptop that would be slow under the simulator, etc.
22:24:59  Vorpal: Google Native Client
22:25:01  ah
22:25:08  ais523: performance doesn't really matter that much for what essentially amounts to a medium-thickness client
22:25:16  the idea of running native executables from the web by statically verifying that they don't do anything nasty
22:25:45  Also, @ even in userspace will probably avoid some context switch penalties, simply because the @ scheduler will be task-switching without them.
22:26:05  ais523: I mean, while @'s model certainly does lead to possible great performance improvements, it's hardly the only appeal of the system :)
22:26:34  elliott: Not merely possible. Inherent.
22:26:49  pikhq_: well, yes; but it's easy to make an implementation that doesn't end up faster
22:26:56  because of the costs you pay elsewhere
22:27:03  i.e. if you have a dumb compiler things go slowly
22:27:19  elliott: what about performance in something like lapack+blas for whatever language @ uses. Not a lot of context switches there. But a lot of fine tuning the machine code for best performance
22:27:38  Vorpal: I've never claimed @ is faster on all code
22:27:51  Vorpal: personally, I find number crunching pretty boring
22:27:52  elliott: indeed. I'm just wondering how much worse it would be
22:27:54  Of course, performance is by no means the sole benefit of @. The big thing is that @ is at least intended to be understandable.
22:27:58  I thought @ was mainly intended to be a desktop OS
22:28:04  Vorpal: desktop/server usecases are much more interesting than number crunching to me
22:28:09  hm
22:28:09  and there it's IO, IO, IO
22:28:12  number crunching is something you don't generally need much of an OS for at all
22:28:17  ais523: precisely
22:28:26  ais523: in fact, @ could just let privileged processes offload number crunching jobs to the gpu
22:28:34  since they tend to be pretty suited to parallelism
22:28:41  ofc, that doesn't always work
22:28:42  elliott: to be fair I do a fair amount of number crunching on the CPU and the GPU on my desktop
22:28:47  Or even the CPU.
22:28:51  Vorpal: I mean, you can inject arbitrary machine code into @
22:28:52  elliott: they're optimised for semi-parallelism
22:28:57  it just requires very high privileges, and is usually dumb
22:29:01  like matrix multiplication, which isn't a completely parallel algo but comes close
22:29:05  elliott: and anything like a modern AAA 3D game is going to be doing a lot of GPU number crunching
22:29:16  do AA games exist?
22:29:21  elliott: You could probably also do NaCl-style sandboxed machine code.
22:29:27  pikhq_: indeed
22:29:29  I think AAA is the only classification people tend to mention
22:29:32  yeah
22:29:35  (this, of course, would probably be significantly more complicated than the rest of @ put together. :P)
22:29:46  also, if you want to be really pipe-dreamy: proof-carrying machine code
22:30:00  but basically...
22:30:05  ais523: I never heard about anything than AAA there
22:30:06  Vorpal: I mean
22:30:08  Vorpal: look at virtual machines
22:30:16  ais523: batteries included
22:30:19  Well. Actually. Sandboxing for you would be really easy, because @'s not using the CPU's privilege levels at all.
22:30:21  (okay that was terrible)
22:30:23  is the classification meaningful if it's the only one that's used?
22:30:24  Vorpal: VMWare, Parallels, VirtualBox -- they're edging closer and closer to being able to play modern games
22:30:27  So, to sandbox machine code you could simply use that.
22:30:29  elliott: hm
22:30:39  I think it's only a matter of time before you don't lose much performance at all from virtualising them
22:30:52  so if that's what it takes to do games under @, so what? it's secure, it's predictable...
22:31:01  elliott: they don't really cut it for the "getting 61 FPS without vsync native" case though.
22:31:06  Vorpal: not yet
22:31:23  btw is there anyone who plays without vsync except for testing what FPS you can reach?
22:31:25  elliott: The main loss from virtualising nowadays is actually getting stuff through to the GPU.
22:31:53  Vorpal: Some people actually derp and think higher framerates than your display is a good thing.
22:31:53  pikhq_: i'll get ais523 to port @ to checkout :)
22:31:54  I sadly lack an IOMMU on my mobo I think
22:32:07  pikhq_: heh.
22:32:08  elliott: GPU works really differently from CPU
22:32:20  you can't straight-translate with any real measure of efficiency
22:32:28  pikhq_: anyway I might play with vsync if I got 59 FPS without it. Because screen tearing is horrible. But so is 30 FPS
22:32:31  ais523: well, you claim Checkout is how CPUs work nowadays too
22:32:38  ais523: it would be awful if @'s design mismatched those
22:32:42  elliott: right, internally
22:32:49  however, they don't take an input format that matches how they work internally
22:32:56  indeed
22:32:58  but rather try to translate on the fly, and don't do an amazing job of it
22:33:03  ais523: point is, @ doesn't match the exposed layer of CPUs
22:33:05  elliott: what is Checkout in this context?
22:33:11  ais523: so i might as well make it match the hidden layer
22:33:12  Vorpal: an esolang, http://esolangs.org/wiki/Checkout
22:33:15  Vorpal: http://esolangs.org/wiki/Checkout
22:33:18  thanks
22:33:27 * elliott waits for Vorpal to say "tl;dr".
22:33:31  elliott: but you'd have to abstraction-invert to actually run the code on a real CPU
22:33:47  ais523: as opposed to the abstraction-inversion I have to do already?
22:33:51  @ wants to be run on a graph reduction machine
22:34:04  well, OK
22:34:15  ais523: "machine code matches the way processors used to work decades ago, rather than the way they work nowadays" <-- for x86: certainly, but is this true for other ISAs?
22:34:18  I mean, ARM and so on
22:34:40  Vorpal: well, Itanium tried to do something lower-level
22:34:43  and look what happened to it
22:34:57  ais523: "Thus, it makes operations like memory transfers (which take up the most time on a modern processor) explicit" <-- this reminds me of how the processing cores on Cell CPUs work.
22:34:57  I think it might actually have been a good idea that happened too early
22:35:08  they DMA to a local memory
22:35:12  then access that
22:35:16  although I think it was being explicit to the wrong thing
22:35:19  Vorpal: that's how GPUs work too
22:35:19  the local memory being SRAM iirc
22:35:26  ais523: hmm, I wonder if Checkout isn't just a really weird representation of a dataflow graph
22:35:38  perhaps it is, in which case GPUs are too
22:35:46  ais523: well, to be fair Cell is kind of like a weird mix between CPU and GPU concepts, with a PowerPC core thrown in for good measure
22:35:47  but... vliw wasn't exactly new with itanium, was it?
22:35:52  indeed
22:36:01  olsner: I don't think so, but it was the first large-scale serious attempt to do it
22:36:12  ais523: I would be very unsurprised if GPUs turned out to be basically dataflow machines
22:36:24  and it can still have been too early regardless of how old vliw is
22:36:39  elliott: they /kind of/ are
22:36:40  elliott: it's not obviously exactly the same
22:36:49  btw I'm taking a course in GPU programming currently
22:36:53  it seems really interesting
22:36:59  first lecture was today
22:38:16  ais523: "The differences are in the value of implementation-defined parameters" <-- any examples?
22:38:25  not off the top of my head
22:38:29  oh well
22:38:38  are there any Checkout implementations?
22:38:39  no
22:38:59  it's a thought experiment more than anything else
22:39:10  "what would a language look like if it modeled the way processors actually work"
22:39:17  and the answer is "frustrating", I think
22:39:22  doing a level 1 implementation shouldn't be too hard from what I can tell. Might not be efficient though
22:39:36  "level 1 implementation"?
22:40:01  err the stuff needed for doing level 1. Which would form the core of an implementation
22:40:03  > fromList [1,2,3,4] \\ fromList [1,2,3]
22:40:04    No instance for (Control.Monad.Random.Class.MonadRandom [])
22:40:04     arising from...
22:40:05  Madoka-Kaname: You have 3 new messages. '/msg lambdabot @messages' to read them.
22:40:18  :v
22:40:46  > S.fromList [1,2,3,4] \\ S.fromList [1,2,3]
22:40:47    Couldn't match expected type `[a]'
22:40:47          against inferred type `Data.Set....
22:40:50  ais523: anyway from what I heard, coding for the Cell processor is really annoying as well
22:41:01  ais523: behold, @:
22:41:01  hello-world{s9dj3} :
22:41:02    {
22:41:02      Data.Rope{bnj55} : module-sig Data.Rope{bnj55}
22:41:02      Unicode{7zogf} : module-sig Unicode{7zogf}
22:41:02      FRP{45gf6} : module-sig FRP{45gf6}
22:41:04    } -> FRP{45gf6}.Behavior (Data.Rope{bnj55}.Rope Unicode{7zogf}.Codepoint)
22:41:13  elliott: what is that?
22:41:16  @
22:41:27  elliott: an intermediate internal representation, right?
22:41:29 -!- augur has quit (Remote host closed the connection).
22:41:31  elliott: what are the {h3b45h} thingies?
22:41:32  coding in that would be awkward
22:41:37  Vorpal: my guess is hashes
22:41:40  ais523: no, a type signature
22:41:48  they're partial hashes, I couldn't be arsed to tap out 512 bits or whatever
22:42:01  heh
22:42:14  if people have to type out the hashes by hand, they'll get annoyed
22:42:19  never said they would
22:42:22  I know
22:42:23  I'm not running @ yet, am I?
22:42:33  I'm suggesting that some method to sugar them away will be needed
22:42:34  I'd imagine the plain-text is the human-readable representation and the hash the computer-readable one.
22:42:35  elliott: sometimes you sound like it :P
22:42:47  YOU HAVE TOO MUCH ROPE TO HANG YOURSELF
22:42:55  actually, wait, the hashes are in the wrong place there
22:43:03  wait, that was very un-ais523 like
22:43:11  Vorpal: I wrote it originally
22:43:21  amazing
22:43:27  only duckduckgo hit is ESR's website
22:43:37  ais523: oh right, the intercal error
22:43:38  which is interesting, I thought the phrase might occur by chance somewhere else
22:43:44  what is it an error for in intercal?
22:43:51  ais523: also when did you switch to ddg?
22:43:54  Vorpal: running out of memory during multithreading
22:44:01  and when elliott recommended it to me
22:44:04  heh
22:44:18 * elliott stopped recommending DDG after he recommended it to Vorpal and Vorpal started being obnoxious about recommending it.
22:44:20  Anyway, revised @!
22:44:21  hello-world :
22:44:21    {
22:44:21      Data.Rope : module-sig Data.Rope{bnj55}
22:44:21      Unicode : module-sig Unicode{7zogf}
22:44:21      FRP : module-sig FRP{45gf6}
22:44:22 -!- tiffnya has joined.
22:44:23    } -> FRP.Behavior (Data.Rope.Rope Unicode.Codepoint)
22:44:27  tiffany: YOU RUINED MY PASTE.
22:44:43  not because elliott is perfect in terms of opinions that I'd share, but because e made me aware of its existence
22:44:44 -!- tiffany has quit (Disconnected by services).
22:44:46 -!- tiffnya has changed nick to tiffany.
22:45:18  http://www.catb.org/~esr/intercal/ick.htm#Errors
22:45:37  ais523: ooh, wait, that type is actually wrong
22:45:39  it needs to be dependent
22:45:55  * elliott stopped recommending DDG after he recommended it to Vorpal and Vorpal started being obnoxious about recommending it. <-- I only recommended it to oerjan in here. No one else.
22:46:03  it was enough :)
22:46:11  elliott: hmm, perhaps this may end up getting merged with Anarchy somehow
22:46:14  oh come on
22:46:20  which is too specific to be the perfect language, but I love some of its ideas
22:46:24  ais523: Anarchy is dependently-typed?
22:46:26  elliott: admit it, I managed to sell the idea to oerjan
22:46:31  elliott: not exactly, well perhaps yes
22:46:31  Vorpal: hahaha
22:46:34  I think he still uses it
22:46:41  it feels vaguely similar to dependent typing
22:46:48  but I don't think it's the same
22:47:08  ais523: I think Anarchy sounds interesting, but I think it'd also be simpler if structured as functional transformations rather than imperative updates
22:47:13  (can you tell I like functional programming?)
22:47:29  ofc, seeing as I don't really know Anarchy, this may be an ignorant statement
22:47:30  elliott: Anarchy is a language? Nice name
22:47:37  elliott: it is functional, and even almost pure; it's just sugared to look imperative
22:47:53  ais523: yet another slightly pregnant language
22:48:01  elliott: I've written and tested a parser for it
22:48:11  ddg is being unhelpful
22:48:11  ais523: (almost pure ~ slightly pregnant)
22:48:11  which is more progress than certain other languages
22:48:17  oh, i see
22:48:19  ah there we go
22:48:20  *I see
22:48:29  no
22:48:30  elliott: well, it isn't pure, but you can't do everything in it you could in an impure language
22:48:33  that was the wrong anarchy
22:48:37  ais523: heh
22:48:41  it has a restriction that's weaker than purity, but still ther
22:48:43  *there
22:48:46  I just need to figure out what it is
22:48:54  ais523: elliott: I can not find the anarchy you were talking about. Is it an esolang?
22:48:58  Vorpal: yes
22:49:01   elliott: I've written and tested a parser for it
22:49:02  one I've only started making
22:49:03  right
22:49:08  http://esolangs.org/wiki/Special:Search?search=anarchy&go=Go
22:49:11  clearly ais523 is just implementing some wildly well-known language
22:49:13  ah
22:49:20  ais523: so not on the wiki
22:49:25  ais523: what is it about then?
22:49:27  ais523 doesn't put incomplete languages on the wiki
22:49:31  intended semantics for a subset of the language are mostly worked out, and I'm trying to figure out how to implement them
22:49:35  Vorpal: type inference on steroids
22:49:41  sounds fun
22:49:44  also, it's mostly designed for tree-walking
22:49:52  heh
22:49:57  it's specifically intended for being good at writing compilers
22:49:58  ais523: anyway, I think @ would be quite happy to host Anarchy
22:50:09  and although it'll probably be TC, would be awkward to use for other things
22:50:11  it's not an unkind host for languages, really, it just has very high standards
22:50:12  ais523: so it might actually be an useful esolang?
22:50:16  hopefully
22:50:21  I may end up giving it a decent FFI
22:50:25  for things it's not suited to writing in
22:50:36  perhaps even implement integers as a native data type
22:50:45  rather than asking the user to make them by hand, like usual
22:50:54  ais523: so... the lexer and parser are not really tree walking, the latter is tree building. I presume there is adequate support those too then?
22:51:01  (I consider a language to be inferior if you /can't/ invent mathematics in it from scratch, but that doesn't mean you should have to)
22:51:14  ais523: it makes me really sad that integers are the one thing you absolutely need to be primitive
22:51:17  Vorpal: I'm not sure how parsers fit into Anarchy yet
22:51:25  @pl (\l -> map fst $ takeWhile (uncurry (==)) $ zip l (tail l)
22:51:25  (line 1, column 59):
22:51:25  unexpected end of input
22:51:25  expecting variable, "(", operator, "$", "$!", "`seq`" or ")"
22:51:25  elliott: for efficiency, you mean?
22:51:30  @pl (\l -> map fst $ takeWhile (uncurry (==)) $ zip l (tail l))
22:51:30  map fst . takeWhile (uncurry (==)) . ap zip tail
22:51:31  ais523: to be usable at all, efficiency-wise
22:51:41  right
22:51:43  ais523: well presumably you need it if you want to do any sort of useful compiler writing
22:52:05  ais523: BTW, that @ type signature I showed is very non-idiomatic
22:52:18  Vorpal: parsers are the least interesting part of a compiler
22:52:22  that wouldn't surprise me
22:52:25  they could be done externally before running anarchy
22:52:26  elliott: *usually
22:52:31  well, ok
22:52:47  ais523: (it's unidiomatic because it uses a rope of codepoints, which is a very strange type)
22:52:51  but right, parser theory is well known
22:53:00  but I didn't feel like thinking of a document type to use
22:53:04  also, what's a rope? something vaguely list-like in the operations it supports?
22:53:12  elliott: certainly. But they still need to be there in some form. And if done externally you still need to communicate that stuff to the later stages somehow. Which either means a parser for the tree in anarchy or linking C code to it
22:53:22  ais523: a balanced tree of short vectors, basically
22:53:27  ais523: it's a very good string representation
22:53:28  Vorpal: why arbitrarily mention C?
22:53:37  ais523: well, some other language then
22:53:46  ais523: I was thinking about bison
22:53:46  elliott: hmm, so similar to a skiplist, but with a different way of thinking about it?
22:53:56  ais523: completely unrelated; http://en.wikipedia.org/wiki/Rope_(computer_science)
22:53:58  elliott: why is a rope of codepoints a strange type?
22:54:06  sounds sensible to me
22:54:07  ais523: in @, the obvious implementation is a 2,3 finger tree of short vectors
22:54:16  because 2,3 finger trees are literally every data structure
22:54:24  interesting primitive
22:54:31  Vorpal: unix/windows mind virus
22:54:32  ais523: ?
22:54:38  ais523: oh, not in @ itself
22:54:53  elliott: what do you suggest instead for representing an Unicode text?
22:55:02  ais523: it's just that 2,3 finger trees are unreasonably good at everything
22:55:22  Vorpal: "unicode text" is the problem; there is no real such thing, we're only used to bare strings of bytes and later codepoints because that's what our OSes use
22:55:29  rope of codepoints wouldn't be a bad representation for "text file found on the Internet, whose format isn't otherwise specified"
22:55:32  books, for instance, aren't unicode text, they have formatting
22:55:41  I assume @ wouldn't be insular enough to refuse to interoperate with the wider Internet
22:55:46  ais523: that's because the Internet is based around byte strings
22:55:46  which means understanding its formats, even if it dislikes them
22:55:49  elliott: right, indeed
22:55:54  ais523: and most people use Windows/Unix which layers codepoint-arrays on top of them
22:55:57  elliott: well how will you represent "The dog jumped over the lazy dog" then?
22:56:05  every justification for strings is just proof that someone else has used strings previously :)
22:56:13  Vorpal: as a document, say
22:56:15  `addquote  elliott: well how will you represent "The dog jumped over the lazy dog" then?
22:56:17  714)  elliott: well how will you represent "The dog jumped over the lazy dog" then?
22:56:24  TIL Vorpal doesn't know about quick brown foxes
22:56:27  ais523: yes I know it was non-idiomatic :P
22:56:34  ais523: it was intentional :P
22:56:38  also, it has to be present tense, "jumps" not "jumped"
22:56:43  the dog jumps
22:56:51  elliott: and how do you represent a document then?
22:56:52  elliott: the quick brown fox jumps
22:56:56  elliott: internally I mean
22:56:57  ais523: the lazy dog
22:57:13  Vorpal: depends; it could quite easily be a PDF
22:57:16  elliott: hmm, this conversation is rapidly getting too surreal for me
22:57:28  Vorpal: a tree of formatting instructions seems reasonable
22:57:39  elliott: hm. For source code?
22:57:47  elliott: with a defined list?
22:57:49  Vorpal: code isn't text
22:57:52  Vorpal: source code should be stored as an AST
22:57:57  ais523: no, you'd want it to basically be compiled source code
22:57:59  hm
22:58:01  the question is what that outputs
22:58:05  elliott: that is also an AST too
22:58:08  I'm not sure what documents look like, but it's easy to experiment once @ is running
22:58:48  ais523: the main problem with a totally generic document type is that it needs to be searchable
22:58:51  sorry, I have the CS infection that makes me think that anything that doesn't have higher-order functions isn't a real programming language
22:58:54  so it can't just be a program that renders something on the screen
22:59:01  elliott: right
22:59:39  THE NEXT STACK RUPTURES. ALL DIE. OH, THE EMBARRASSMENT!
22:59:48  elliott: what about comments?
22:59:51  the only message that ESR /changed/ from the original, rather than adding a new message
23:00:05  ais523: what was the original?
23:00:05  I liked the old one too, though ("PROGRAM ATTEMPTED TO EXIT WITHOUT ERROR MESSAGE")
23:00:13  ah
23:00:16  Vorpal: comments should be documents too, but why can't they just be arbitrary objects?
23:00:24  there's no reason you shouldn't be able to add an audio file as a comment
23:00:25  elliott: hm I guess so
23:00:30  or, more reasonably, a picture
23:00:38  (even if you could just have a document composed only of a picture, it's unnecessary indirection)
23:01:10  elliott: lets say I'm editing a function, how will you represent this on screen? As a piece of text?
23:01:40  Vorpal: have you ever read a paper which had Haskell code in it?
23:01:44  it'll probably look something like that
23:02:10  elliott: I read one that had Miranda code
23:02:20  Vorpal: probably not
23:02:24  go read some mcbride or something :P
23:02:28  elliott: hmm, what about literate programs?
23:02:29  elliott: got a link?
23:02:40  I'm trying to work out if the programs should be "outside" or "inside" comments
23:02:51  or if there should be some other method for doing so
23:02:57  elliott: ddg is rather unhelpful here
23:03:11  hmm, there's taht functional pearl i read a while back
23:03:13  elliott: mcbride is obviously a name. Probably knowing the first name would help
23:03:22  it was just a joke :P
23:03:24  but here, http://www.google.co.uk/url?sa=t&rct=j&q=indexed%20monad%20functional%20pearl&source=web&cd=3&ved=0CDUQFjAC&url=http%3A%2F%2Fpersonal.cis.strath.ac.uk%2F~conor%2FKleisli.pdf&ei=B7W5TovkAsmM-wbhz7WFCA&usg=AFQjCNG5aO2kQrYOjP71SltPo1vW7kQrMQ&sig2=tjbXn6dw84MjElfdiKoySw
23:03:26  ugh
23:03:30  personal.cis.strath.ac.uk/~conor/Kleisli.pdf
23:03:41  hmm, I think "FLAG ETIQUETTE FAILURE BAD SCOUT NO BISCUIT" is the newest error message there, it's one of ESR's
23:03:59  ais523: that's rubbish
23:04:11  hmm, it's not /that/ bad
23:04:34  "NO SKELETON IN MY CLOSET, WOE IS ME!" would be great if it was just the bit before the comma
23:04:40  elliott: I can see plenty of haskell source code in there
23:04:47  nicely formatted
23:04:48  Vorpal: that's the point
23:05:08  but nothing special about it. I mean, it is kind of how it would show in your typical editor, modulo italics and colours
23:05:11  elliott: things like syntax highlighting shouldn't be part of the program object, though
23:05:13  Vorpal: and operators
23:05:22  hm good point
23:05:30  ais523: anyway, re literate programs: I'm undecided. I think @ can support both just fine. I don't know which the system itself should prefer.
23:05:31  elliott: didn't even notice that to begin with
23:05:34  hmm, the problem with Unicode is that it's inherently linear
23:05:52  Unicode isn't that good, but @ uses it as a source of actual characters because it's good enough
23:06:01  elliott: would it be possible to make that compile by defining the relevant unicode symbols as operators?
23:06:04  and because being incompatible with it in 2011 would be completely unjustifiable
23:06:09  indeed
23:06:10  Vorpal: who says those are valid unicode?
23:06:15  Vorpal: there's no unicode for "star in a diamond", last i checked
23:06:16  elliott: perhaps you should finish Kitten first
23:06:23  to give you a usable OS to develop @ on
23:06:24  which is what (<*>) is usually rendered as
23:06:38  elliott: hrrm
23:06:39  ais523: I think Kitten is easy enough to develop at this stage that I can entertain @ thoughts
23:06:45  indeed
23:06:50  nothing wrong in thinking
23:06:57  ais523: I need to push through this design skeleton of protoproto@ to something that can run the simplest system that's sort of like @
23:07:07  since that'll be a big win in terms of being able to experiment beyond that
23:07:48   Unicode isn't that good, but @ uses it as a source of actual characters because it's good enough <-- yeah, they didn't add Klingon did they?
23:07:55  Vorpal: they didn't
23:08:01  see, it isn't good at all
23:08:09  there is a common embedding of Klingon into Unicode that isn't standard, but doesn't contradict the standard
23:08:14  by defining some of the private use area
23:08:17  right
23:08:28  approx how large is the private use area, I don't remember
23:08:37  considerably larger than Klingon is
23:08:39  hello-world :
23:08:39    M : {
23:08:39      Data : { Rope : module-sig Data.Rope{bnj55} }
23:08:39      Unicode : module-sig Unicode{7zogf}
23:08:39      FRP : module-sig FRP{45gf6}
23:08:39    } -> M.FRP.Behavior (M.Data.Rope.Rope M.Unicode.Codepoint)
23:08:41  that's better
23:08:43  ais523: fair enough
23:08:44  but rather small compared to Unicode as a whole
23:09:09  now to try and give some example /code/ for hello-world
23:10:43  gah, I said Behavior
23:10:51 -!- Patashu has joined.
23:10:59  ais523: make sure I don't typo my names again, pls :)
23:11:19  haha
23:11:33  why would the names be written as sequence-of-letters anyway
23:11:39  XD
23:11:45  as in, why shouldn't Color and Colour be identical?
23:12:13  {
23:12:14    use Data.Rope as Rope importing Rope
23:12:14    use Unicode importing Codepoint
23:12:14    use FRP importing Behaviour
23:12:14   
23:12:15    hello-world : Behaviour (Rope Codepoint)
23:12:16    hello-world = point Rope['H', 'e', 'l', 'l', 'o', ',', ' ', 'w', 'o', 'r', 'l',
23:12:18                             'd', '!']
23:12:20  }
23:12:27  that Rope[...] is misleading; it is actually a Rope object embedded into the code
23:12:35  who needs to build up constants from functions when you can just include them in the source?
23:14:05  oh, oops!
23:14:09  ais523: can you spot the error in the above program?
23:14:14  (@ could!)
23:14:56  you didn't define lists?
23:14:59  @src sequence
23:14:59  sequence []     = return []
23:15:00  sequence (x:xs) = do v <- x; vs <- sequence xs; return (v:vs)
23:15:00  -- OR: sequence = foldr (liftM2 (:)) (return [])
23:15:09  oh, right, that's the embedded object
23:15:10  ais523: I didn't use lists
23:15:20  ais523: hint: where is "point" imported from?
23:15:26  aha
23:15:29  I missed the "point"
23:15:38  well, ropes aren't behaviours of ropes
23:15:52  what's required is
23:15:52    use Control.Applicative importing point
23:15:53  or similar
23:16:18  anyway, ostensibly one can ask an @ computer, given the above, "hello-world", and get back a container with that rope inside, never changing
23:16:35  a more interesting program would be one that cycles through different ropes or even responds to input
23:16:36  elliott: that list sounds quite annoying to write out like that
23:16:41  Vorpal: there are no lists
23:16:46  elliott: well....
23:17:05  elliott: ['H', 'e', 'l', 'l', 'o', ',', ' ', 'w', 'o', 'r', 'l', 'd', '!'] <-- writing that seems really annoying
23:17:07  point me to the list
23:17:13   that Rope[...] is misleading; it is actually a Rope object embedded into the code
23:17:15  there's no list
23:17:16  call it whatever you like
23:17:21  elliott: certainly
23:17:36  so, you missed the part where I said you wouldn't actually use ropes of codepoints in rpactice, right? :)
23:17:43  elliott: whatever it is, it seems annoying to use if you just want to display a message to the user
23:17:54  elliott: so what would you do in practise for the hello world
23:18:00  what would the idiomatic hello world look like
23:18:01  use a document type
23:18:09  and I don't know, it's impossible to determine @'s idioms before it exists
23:18:13  hm
23:18:41  elliott: so what would you do to display "Error connecting to host", would you display a document with that "text" in it?
23:18:54  Eh?
23:18:56  yes.
23:18:59  > ['H', 'e', 'l', 'l', 'o', ',', ' ', 'w', 'o', 'r', 'l', 'd', '!'] == "Hello, world!"
23:18:59    True
23:19:00  hm okay
23:19:03  Why do you have to write it out as a list?
23:19:11  Madoka-Kaname: that was NOT haskell code
23:19:16  Oh.
23:19:18  That makes sense.
23:19:21  elliott: where would actual ropes be used then?
23:19:23  {
23:19:23    use Text.Doc importing Doc
23:19:23    use FRP importing Behaviour
23:19:23    use Control.Applicative importing point
23:19:23   
23:19:23    hello-world : Behaviour Doc
23:19:25    hello-world = point "Hello, world!"
23:19:27  }
23:19:29  Vorpal: smile
23:19:31  Vorpal: and probably internally
23:19:39  representing runs of unformatted text as ropes of codepoints, etc.
23:19:46  elliott: "smile" here being?
23:19:56  Vorpal: because i converted it to use an imaginary Doc type
23:20:00  right
23:20:03  the "world!" is actually italic there, you just can't see it :)
23:20:09  hah
23:20:30  elliott: that might make it a bit tricky to pastebin code to discuss it over irc :P
23:20:40  elliott: if it can't easily be represented as pure text I mean
23:20:40  Vorpal: that's why @ has a standardised object interchange format
23:20:44  right
23:20:45  presumably, there'll be @bins
23:20:54  for linking to people over legacy protocols
23:21:21  Vorpal: in a @ communications protocol, you would of course exchange objects
23:21:27  so you could just embed source code in your message
23:21:29  elliott: I guess we will see if @ becomes the next Linux.
23:21:34  I doubt it though
23:21:44  the next shitty imitations of a decades-old obsolete system?
23:21:50  elliott: not in that sense :P
23:21:57  elliott: I meant "the next big open source OS"
23:22:08  I doubt it, but I've never really cared much about that
23:22:16  I would like to think it'll get at least ten users
23:22:27  probably nobody but me will actually boot it as their main OS
23:22:39  elliott: I believe that is more ambitious than Linus original goal :P
23:23:09  I would like to think @ would take off, but actually it'd probably be pretty hellish.
23:23:21  People would start shipping proprietary @ source.
23:23:22  elliott: I would certainly try it out under qemu if it is ever implemented
23:23:30  would that even work?
23:23:34  Not long until programs become ObfuscatedPropriertyInterpreter("...binary data...").
23:23:46  s/Proprierty/Proprietary/
23:24:00  elliott: I guess that will happen for the graphics drivers.
23:24:05  at least
23:24:11  Vorpal: "will" -- @ won't get to that stage.
23:24:18  well if it would
23:24:19  I meant
23:24:26  When @ is small, I can just yell at people if they do things like that *shrug*
23:25:19   elliott: I would certainly try it out under qemu if it is ever implemented
23:25:20   would that even work?
23:25:23  Vorpal: Were these statements linked?
23:25:32  elliott: let me look up
23:25:40  nope
23:25:46   People would start shipping proprietary @ source.  would that even work?
23:25:50  Right.
23:25:50  elliott: was the linkage
23:26:06  Vorpal: Anyway, I wouldn't bother running @ in qemu, since like I've said it'll be hostable on Unix.
23:26:11  elliott: I can't imagine it NOT working under qemu
23:26:19  right
23:26:29  elliott: reminds me of inferno in that regard
23:26:39  except I never got inferno to actually work
23:26:48  But I would recommend people try actually booting it if it works out -- it'll be very interesting to see how much the scheduler/IO stuff actually helps.
23:27:08  elliott: well, I would probably disconnect all my hdds first :P
23:27:11  which is a chore
23:27:28  Vorpal: Well, like I said, my baseline is <3000 lines of Python + a small bit of @ driver code to connect to the Python "hardware" + the standard @ image = hosted @ system with graphics, keyboard and mouse (no other special IO).
23:27:40  If you can't implement that, then the abstract machine is too complex.
23:27:49  Obviously it'll take more lines to be efficient and do things like networking.
23:27:58  given that I need to remove one disk compartment to properly read the SATA connectors, because the direct path is blocked by the GPU heatsink
23:28:06  reach*
23:28:26  elliott: fair enougj
23:28:28  I wouldn't worry about @ clobbering your HDs, unless you think I'm malicious or whatever. It's kind of meant to eliminate a very large portion of those sorts of errors :P
23:28:28  enough*
23:28:49  elliott: do I trust you completely to not make any mistakes still? Nope.
23:29:01  Vorpal: It's pretty damned hard to do HD-hosing mistakes.
23:29:05  ais523: quick, tell me how anarchy and scapegoat fit together
23:29:08  Vorpal: you trust Linux not to?
23:29:09  elliott: I appeal to authority here. The authority of Murphy
23:29:11  you trust Windows not to?
23:29:14  you're insane!
23:29:26  elliott: I can't think of an obvious link
23:29:43  ais523: I was thinking of language-specific scapegoat change types
23:30:09  elliott: nope! Guess why I disconnected linux when installing windows. Anyway they had a fair amount of testing. Such issues would according to probability likely have been caught.
23:30:43  elliott: the only thing I would trust more than that would be an actual formal proof :P
23:30:44  how do you even clobber an HD by accident in OS code, anyway?
23:31:02  you'd have to send a very specific, very long sequence of instructions to th drive
23:31:03  the drive
23:31:23  elliott: okay more reasonably and scarier you might manage to brick my network card. I remember an OS bug in some pre-release of some 2.6 linux kernel doing that
23:31:30  for a similar network card to mine
23:31:45  Vorpal: that's ridiculous, you think I'll write drivers for your network card?
23:31:51  by writing in the wrong place, because debug hooks were written into device registers by mistake
23:32:07  elliott: see, no need to do that ^
23:32:35  elliott: anyway what network card do you have? If it is intel's gbit ethernet: then yes
23:32:41  oh well, if you really think you can trust linux more than @ I'll ujst have to conclude you're insane
23:32:46  especially considering the order of magnitude difference in code size
23:33:09  elliott: Well, there's actually a decent chance you could. There's like one or two network cards that are extraordinarily common in both physical hardware *and* VMs, and are easy to implement drivers for.
23:33:15  (I can't recall which)
23:33:19  elliott: indeed you do have a point. Guess why I would never ever boot anything that isn't at least 3.x.1
23:33:50  Vorpal: oh, so you just recently switched to Linux?
23:34:02  elliott: well obviously 2.6.x.1 before
23:34:20  elliott: and I forgot what the 2.4 versioning system was, and I probably didn't know better back then anyway
23:34:22  the first @ release will be 3.1.1
23:34:29  XD
23:34:34 * Phantom_Hoover → sleep
23:34:36  with special Vorpal hd clobbering code
23:34:37  pikhq_: I believe intel's gbit ethernet is fairly common indeed.
23:34:37 -!- Phantom_Hoover has quit (Quit: Leaving).
23:34:52  pikhq_: more so in VMs
23:35:12  pikhq_: You should help me figure out what @'s networking looks like. :(
23:35:18  I have the PCI Express one though
23:35:20  It has the major constraint that it has to be layerable on top of either TCP/IP or UDP/IP.
23:35:24  confirmed: it takes me about 10 seconds to remember the rules of The Game when I'm reminded of it
23:35:25  which iirc is slightly less common in VMs
23:35:32  I think my brain has evolved a defensive response to it
23:35:34  heh
23:35:46  actually, more like 30 seconds
23:35:50  I just remembered there was another one
23:35:51  amazing
23:36:08  ais523: I'm so glad I play Not the Game
23:36:18  heh, and just now I remembered the "if you think of The Game you lose rule"
23:36:24  X-D
23:36:29  hmm, it's kind of annoying that @ doesn't seem to be separable from dependent types
23:36:30  there are only three, right?
23:36:37  on the one hand, it's obviously the correct thing
23:36:40  on the other, it makes my job a /lot/ harder
23:36:43  and I don't play The Game
23:36:47  although I know a bunch of people who do
23:36:54  elliott: I wouldn't actually consider that a major constraint.
23:37:11  Being layerable on top of UDP/IP just means it needs to be in packet form, really.
23:37:30  pikhq_: It also means it has to be source-dependent...
23:37:32  elliott: I assume there is a way to embed native code for use in drivers?
23:37:39  And target-dependent, for that matter.
23:37:49  elliott: Not necessarily.
23:37:55  elliott: oh and how are you going to deal with ACPI?
23:37:58  that sounds "fun"
23:38:03  You can have a single port for all of @ networking to be multiplexed over.
23:38:04  :)
23:38:11  pikhq_: i'm talking about IPs, not porst
23:38:13  ports
23:38:24  *Ah*.
23:38:26  Vorpal: (a) Sort of, but you almost never want to use it. (b) What do you mean?
23:38:31  That is a bit of a restriction.
23:38:46  pikhq_: If I could, I'd layer it on top of Urbit's networking. :p
23:38:47  But the alternative is NIHing the thing least NIHable.
23:38:53  elliott: surely you know that you need to interpret a lot of bytecode in your OS to do ACPI?
23:39:06  pikhq_: I wish routers let you give them new routing algorithms remotely.
23:39:11  there is an open source implementation of this already. It is in C though
23:39:11  So you could just define new protocols with router viruses.
23:39:22  Vorpal: I know almost nothing about ACPI other than that it's crappy
23:39:22  well there are probably a few more
23:39:26  Vorpal: Give me one good reason not to just ignore it :)
23:39:30  I suppose it matters for laptops and shit
23:39:36  elliott: I don't think you can avoid it on modern hardware in general
23:39:40  Vorpal: Anyway, interpreting things is one thing functional languages are really good at!
23:39:54  isn't it a state machine even? I'm not sure
23:40:30  Vorpal: Anyway, yeah, I can't really think of all that many uses for embedding native code.
23:40:42  just seen on Slashdot: apparently a microphone error let a bunch of reporters hear the translated version of a private conversation between Obama and Sarkozy
23:41:11  elliott: I think you might need to poke some addresses and such from the ACPI byte code. And then I guess some core parts of the OS will need it.
23:41:15  I'm pretty sure that most of what drivers actually need is access to inb/outb analogues and RAM access.
23:41:24  *And* that can generally be abstracted over.
23:41:31  pretty high-profile for a microphone error
23:41:45  ais523: heh
23:41:51  You don't really need machine code access for that. More like limited peek/poke.
23:41:54  Vorpal: Poking address =/= embedding arbitrary machine code.
23:41:54  hmm, I'm still recoiling from the YouTube commenter who asked how you edited the uploader comments (on someone else's video)
23:41:55  ais523: did they say anything interesting?
23:42:00  elliott: hm indeed
23:42:03  But yeah, what pikhq_ said; sections of RAM + ports.
23:42:11  Vorpal: yes, they insulted the prime minister of Israel
23:42:16  ais523: cool
23:42:18  or at least Sarkozy did; Obama's response was ambiguous
23:42:54  according to the reports
23:42:58  perhaps the translators made the whole thing up
23:43:06  but I imagine they'd be in a bunch of trouble if they did
23:43:12  'I can't stand him any more,' said Mr. Sarkozy of Israeli Prime Minister Benjamin Netanyahu. 'He's a liar.' Mr. Obama replied: 'You're sick of him. I have to deal with him every day!'
23:43:14  not very ambiguous :)
23:44:07  elliott: well the driver for a virtual machine would need to run a few instructions, at least if it was to use hardware virtualisation
23:44:12  hm that is an interesting issue I guess
23:44:31  How do graphics drivers for VMs work, anyway
23:44:53  elliott: Obama's response is two neutral statements; there's an implication but it isn't stated
23:45:14  besides ports and RAM, you'll need some kind of irq routing somewhere
23:45:28  and I've played a bunch too much nomic, and watched a bunch too much politics, to necessarily infer anything at all into a statement
23:45:33  made by a politician
23:45:50  ais523: Israel will, of course, go apeshit.
23:45:53  elliott: I'm guessing memory-mapped, but not sure
23:46:02  pikhq_: probably
23:46:03  And near as I can tell Israel has more control over US politics than US citizens do.
23:46:11  Why? Fuck if I know.
23:49:51  hmm
23:50:42  olsner: I don't get what you mean
23:52:32 -!- augur has joined.
23:53:53  I should probably figure out what my FRP model actually looks like.
23:53:59  just that some magic is required to either figure out which irq each devices uses, or to decide which irqs they should use and store it wherever that goes
23:54:20  olsner: that's not related to what enhanced access driver code needs, though
23:54:24  besides io ports and memory access to devices, drivers hook into that
23:54:36  no, I was just talking about hardware and drivers in general
23:54:51  right
23:55:06  whatever enhanced access driver code is :)
23:55:26  olsner: whatever (enhanced access) driver code needs
23:55:37  over "typical" programs
23:55:41  oh, right
23:55:44  (no such thing as a program, but anyway!)
23:56:25  I should figure out how the whole irq business works some day
23:56:29  ais523: come to think of it, @ should be available hosted on @, too
23:56:34  elliott: isn't a program just a subroutine (in the general sense) that the user might want to invoke manually?
23:56:42  elliott: right; it'd save the need to use a VM
23:56:52  for something that you might feel the need to use a VM for
23:56:57  ais523: bit pointless though: it'd literally look like a function call
23:57:00  yep
23:57:06  @ already has object-capability, so you don't need VMs at all
23:57:16  well, it might work as a method of mitigating against unknown security bugs
23:57:30  or just testing an @ interpreter meant to run on other platforms
23:57:31  no, it'd /literally/ just look like a function call
23:57:37  ais523: huh?
23:57:43  but it wouldn't /be/ a function call
23:57:46  just /look/ like one
23:57:53  no, it would /be/ a function call
23:57:57  and
23:57:58   or just testing an @ interpreter meant to run on other platforms
23:57:59  makes no sense
23:58:02  oh, that's a cheat-interp
23:58:04  you'd need an emulator for that platform
23:58:05  not @
23:58:06  ais523: no, it isn't
23:58:10  ais523: here's how you port @ to a platform:
23:58:21  ais523: write something that passes control to it, giving it the hardware drivers it needs
23:58:50  ais523: OK, you could write an @ machine yourself in @lang, but why? the host already has a much faster one
23:58:56  elliott: don't you need to put something there capable of executing the code @ is made of?
23:58:57  there's no security issues or anything in using it
23:59:07  ais523: that's part of passing control
23:59:15  elliott: for testing your @ machine in @lang, that you eventually intend to, say, compile into C for the purpose of running on a different OS?
23:59:37  hahaha, implying you can compile @lang to C
23:59:49  well, you can compile Haskell to C

2011-11-09:

00:00:00  the operation might not be a generally useful one, but I can't see why it wouldn't be /possible/
00:00:02  Haskell is defined in terms of existing OSes
00:00:11  compiling @lang to C doesn't work because @lang /is @/
00:00:26  the most you can do is bundle it with an interpreter (= a @ simulator)
00:00:26  elliott: not quite
00:00:38  I suspect you're making a mistake I made in Feather
00:00:42  but it's not a very easy mistake to describe
00:01:09  well, give it a try
00:03:45  umm… a language typically has pure-computation parts, and an API
00:03:47  ais523: I mean, if you can take the @ part out of @lang, then @lang is broken
00:03:51  to the outside world
00:04:12  if you metacircular both of them, then you don't have an interp at all, just a cheat-interp
00:04:27  whereas you can't do the API without implementing it in terms of itself, for a self-interp
00:04:36  what I mean is, you have to implement @lang in something
00:04:42  I'll agree with that
00:04:51  parts of that will be pure computation, and can be lifted back to the original language, in a sense
00:04:53  but what has this got to do with compiling @lang to C?
00:04:58  replacing the parts of it that aren't computation with API calls
00:05:30  err, it's pretty hard to explain
00:05:31  ais523: those API calls are @
00:05:35  elliott: ah, OK
00:05:39  but you can't make a language out of /just/ API calls
00:05:50  well, probably (/me remembers the MOV-based OISC)
00:05:53  indeed, but you can't do anything with /just/ computation
00:05:57  right
00:06:02  both parts are needed
00:06:05  so you can't write an @ simulator in @lang and compile it to another OS
00:06:06  and one of the parts, it's meaningful to compile it
00:06:09  because you need the bit that's @
00:06:30  I wasn't talking about an @ simulator; but rather, an @lang impl in @lang that calls into the surrounding @ just for API calls
00:06:50  you don't implement @lang to simulate @; @lang's at a higher level
00:07:03  anyway, OK, but I'm not sure what the use of that would be
00:07:06  now, you can attempt to restrict those API calls to the smallest subset you can, which is what you'd do to implement @ onto a new system
00:07:14  it might not be useful, I'm just saying it's not meaningless
00:07:14  elliott: remind me, why did you go for @ as the name?
00:07:20  Vorpal: @ isn't the name
00:07:24  no, you wouldn't, you'd just implement the @ machine in a handful of pages of whatever code
00:07:27  oh right
00:07:29  now I remember
00:07:30  it's a metasyntactic variable standing for what the name will eventually be
00:07:43  anyway, maybe it's possible, but such a compiler would necessarily have to be very ugly
00:07:48  and probably only work on very carefully-written programs
00:07:52  I suggest the name involve "hubris" in some way.
00:07:54  easier just to write the C directly for such a simple program
00:08:18  perhaps
00:08:42  ais523: if it /isn't/, then @'s abstract machine needs replacing
00:09:01  right
00:09:05  I'd imagine @lang without @ would be a bit like Haskell without IO: does computation, and can't do anything at all with it.
00:09:15  pikhq_: yes, that's about right
00:09:21  pikhq_: worse
00:09:25  pikhq_: no data structures
00:09:42  elliott: how are the data structures bootstrapped?
00:09:42  elliott: Okay, so Haskell without Prelude then.
00:09:44  you'd basically be reduced to reimplementing everything you want to use from scratch
00:10:02  reimplementing the data structures from scratch is exactly the sort of thing I'd expect the @ simulator in @ to do
00:10:07  that's usefully compilable
00:10:10  I wouldn't
00:10:15  because there are no data structures to implement
00:10:25  well, they have to come from somewhere!
00:10:26  I don't think you understand how simple the abstract machine is meant to be
00:10:48  I do, I think; I'm disagreeing with you where the boundaries between the abstract machine and the rest of the world are
00:10:56  as in, I think there's something in between that you're repeatedly claiming doesn't exist
00:11:27  I think you just don't understand how @ is structured
00:11:56  perhaps
00:13:16 -!- sllide has quit (Ping timeout: 276 seconds).
00:14:11 -!- tiffany has quit (Quit: nyu~).
00:14:49  ais523: anyway, code in @ is basically completely unportable, by design
00:15:42  Which sense of "portable" do you mean?
00:15:47  Between OSes, or between CPUs?
00:16:04  pikhq_: OSes
00:16:31  Ah. Yeah, a port of @ code would either be a complete rewrite or contain an implementation of the relevant portions of @.
00:19:44 -!- boily has quit (Ping timeout: 240 seconds).
00:20:11 -!- ais523 has quit (Remote host closed the connection).
00:29:49  Do you have any link for @lang? I don't find it in the Esolang language list.
00:29:55  Or do you mean @! ?
00:30:49  oh dear :)
00:31:05  @lang is not technically esoteric, it's just more esoteric than almost all languages on the wiki
00:31:05  pong
00:31:11  hi lambdabot =
00:31:25  @lang
00:31:25  pong
00:31:29  @ping
00:31:29  pong
00:31:31  @whatever
00:31:32  Unknown command, try @list
00:31:34  hm
00:31:37  why would @lang do that
00:31:40  elliott: any idea?
00:31:45  @ling
00:31:45  @abcd
00:31:46  pong
00:31:46  Invalid argument ''
00:31:46  @ping
00:31:46  pong
00:31:51  any 4 letter word?
00:31:52  lambdabot does error-correction
00:31:52  @bong
00:31:53  Maybe you meant: bug ping
00:31:58  hm
00:32:03  right
00:32:09  @bing
00:32:09  pong
00:32:18  elliott: I don't see how lang → ping is reasonable though
00:32:34  Probably ping is the unique closest match.
00:32:36  dunno :)
00:32:39  elliott: so hm
00:32:42  @abcd
00:32:42  Invalid argument ''
00:32:49  well, I guess there was none close enough
00:32:53  @ngng
00:32:53  pong
00:32:54  @long
00:32:54  pong
00:32:57  @nnng
00:32:57  pong
00:33:00  @pang
00:33:01  pong
00:33:01  @gggg
00:33:01  Unknown command, try @list
00:33:08  @nnnn
00:33:08  Unknown command, try @list
00:33:10  @mmpf
00:33:10  Maybe you meant: map unpf
00:33:13  @png
00:33:14  pong
00:33:17  right
00:33:24  it seems to be quite lenient
00:33:33  @pimf
00:33:34  Maybe you meant: ping time
00:33:41  @list
00:33:41  http://code.haskell.org/lambdabot/COMMANDS
00:33:49  @lost
00:33:49  http://code.haskell.org/lambdabot/COMMANDS
00:34:05  @yhjulwwiefzojcbxybbruweejw
00:34:05  "\"#$%&'()*+,\""
00:34:09  okay
00:34:32  €protontorpedo
00:34:36  @protontorpedo
00:34:36  how does haskell compare to j2ee?
00:34:39  @protontorpedo
00:34:40  is it fun to program in haskell?
00:34:41  @spell lang
00:34:42  I see
00:34:55  @v
00:34:55  "\""
00:34:57  @v
00:34:57  "\"\\\"\\\\\\\"\\\\\\"
00:35:01  @yhjulwwiefzojcbxybbruweejw
00:35:01  "\"\\\"\\\\\\\"\\\\\\\\\\\\\\\"\\\\\\\\\\"
00:35:03  right
00:35:47  @gsite
00:35:48  Empty search.
00:36:03  Hmm, lets see how close this is:
00:36:06  @goatse
00:36:06  Unknown command, try @list
00:36:11  @hoogle+ (a -> b) -> [a] -> [b]
00:36:11  Data.Monoid appEndo :: Endo a -> a -> a
00:36:11  Data.ByteString append :: ByteString -> ByteString -> ByteString
00:36:11  Data.ByteString.Char8 append :: ByteString -> ByteString -> ByteString
00:36:13  @hoogle (a -> b) -> [a] -> [b]
00:36:14  Prelude map :: (a -> b) -> [a] -> [b]
00:36:14  Data.List map :: (a -> b) -> [a] -> [b]
00:36:14  Control.Parallel.Strategies parMap :: Strategy b -> (a -> b) -> [a] -> [b]
00:36:16  err
00:36:18  okay
00:36:33  I see they return different results, but what is the pattern here
00:36:42  @help hoogle
00:36:42  hoogle . Haskell API Search for either names, or types.
00:36:43  @help hoogle+
00:36:43  hoogle . Haskell API Search for either names, or types.
00:36:46  hoogle+ knows more libraries?
00:36:57  well, hoogle+ didn't know Prelude
00:36:59  looks like @hoogle+ doesn't return stuff @hoogle does
00:37:01  maybe it's just "more results"
00:37:02  hm
00:37:05  @hoogle+ a -> a
00:37:05  Control.Applicative liftA :: Applicative f => (a -> b) -> f a -> f b
00:37:05  Data.Traversable fmapDefault :: Traversable t => (a -> b) -> t a -> t b
00:37:05  Prelude fmap :: Functor f => (a -> b) -> f a -> f b
00:37:08  @hoogle a -> a
00:37:09  Prelude id :: a -> a
00:37:09  Data.Function id :: a -> a
00:37:09  GHC.Exts breakpoint :: a -> a
00:37:12  okay
00:37:12  @hoogle (<*>)
00:37:13  Control.Applicative (<*>) :: Applicative f => f (a -> b) -> f a -> f b
00:37:16  *shrugs*
00:37:23  @hoogle+ (<*>)
00:37:29  guess not
00:37:44  elliot seems to be right with "more results"
00:37:46  @dice
00:37:46  unexpected end of input: expecting number
00:37:52  @dice 10
00:37:52  10 => 10
00:37:54  @dice 10
00:37:54  10 => 10
00:37:56  okay
00:37:58  what
00:38:01  @dice 3
00:38:02  3 => 3
00:38:04  @dice 3 4
00:38:04  3 4 => 34
00:38:08  @dice D3+4
00:38:09  unexpected "D": expecting number
00:38:22  I don't think it is dice as in d20
00:38:37  @dice 2d20
00:38:38  2d20 => 33
00:38:42  err
00:38:43  @dice 2d20
00:38:43  2d20 => 12
00:38:48  @dice 1d3+4
00:38:48  1d3+4 => 6
00:38:50  @dice 1d3+4
00:38:50  1d3+4 => 7
00:38:51  or maybe it is
00:38:51  @dice 1d3+4
00:38:51  1d3+4 => 5
00:39:01  @dice d6
00:39:01  unexpected "d": expecting number
00:39:02  @dice 1d6
00:39:03  1d6 => 1
00:39:04  @dice 1d6
00:39:04  1d6 => 6
00:39:05  @dice 1d6
00:39:05  1d6 => 5
00:39:09  yes seems so
00:39:09  You may not leave off the 1
00:39:13  twice11: I noticed
00:39:18  @dice 1d6 * 2
00:39:18  unexpected "*": expecting digit, "+" or end
00:39:20  @dice 1d6 * 1d9
00:39:20  unexpected "*": expecting digit, "+" or end
00:39:21  Pah.
00:39:35  elliott: I don't remember seeing that in GURPS
00:39:43  but it was ages ago I played that
00:39:45  I don't know any RPG multiplying dice...
00:39:54  and D&D I only played through NWN1, and it hides most of that
00:40:10  twice11: See, that's an opportunity for innovation!
00:40:25 -!- Sgeo|web has quit (Quit: Page closed).
00:40:32  @dice 2d20-90
00:40:33  unexpected "-": expecting digit, "+" or end
00:40:35  @dice 2d20+90
00:40:35  2d20+90 => 121
00:40:45  wait, only a bonus? No penality?
00:40:54  penalty*
00:40:57  @dice 2d20+ -90
00:40:57  unexpected "-": expecting number
00:41:13  @dice 2d20 + -1 * 90
00:41:13  unexpected "-": expecting number
00:41:20  What!
00:41:21  @slap lambdabot
00:41:21  I'd rather not; lambdabot looks rather dangerous.
00:41:24  @slap lambdabot
00:41:24  I don't perform such side effects on command!
00:41:29  @slap Vorpal
00:41:29 * lambdabot submits Vorpal's email address to a dozen spam lists
00:41:32  ...
00:41:36  that is a side effect
00:41:37  @slap test
00:41:37  *SMACK*, *SLAM*, take that test!
00:41:45  @slap ChanServ
00:41:45 * lambdabot secretly deletes ChanServ's source code
00:41:52  @slap lambdabot
00:41:52 * lambdabot activates her slap-o-matic...
00:41:54  @slap some-user-that-doesnt-exist
00:41:54 * lambdabot activates her slap-o-matic...
00:41:55  well
00:42:01  @slap lambdabot
00:42:01 * lambdabot will count to five...
00:42:09  hm
00:42:13  @slap some-user-that-doesnt-exist
00:42:13 * lambdabot loves some-user-that-doesnt-exist, so no slapping
00:42:28  guess it was random that it refused to slap itself
00:42:31  also:
00:42:34  @slap Madoka-Kaname
00:42:35 * lambdabot karate-chops Madoka-Kaname into two equally sized halves
00:42:45  I think we are even now
00:42:50  I guess there is a rate limit on slapping.
00:42:57  @slap lambdabot
00:42:57 * lambdabot slaps lambdabot with a slab of concrete
00:43:09  OK, Vorpal was right.
00:43:12  @b52s
00:43:12  Watch out for that piranha. There goes a narwhale. HERE COMES A BIKINI WHALE!
00:43:16  what
00:43:18  @b52s
00:43:18  Watch out for that piranha. There goes a narwhale. HERE COMES A BIKINI WHALE!
00:43:19  @b52s
00:43:20  Girl from Ipanema, she goes to Greenland
00:43:24  okay
00:43:27  I don't get it
00:43:32  @help b52s
00:43:33  b52s. Anyone noticed the b52s sound a lot like zippy?
00:43:37  http://www.google.co.uk/search?gcx=c&sourceid=chrome&ie=UTF-8&q=Watch+out+for+that+piranha.+There+goes+a+narwhale.+HERE+COMES+A+BIKINI+WHALE!
00:43:37  aha
00:43:37  http://www.google.co.uk/search?gcx=c&sourceid=chrome&ie=UTF-8&q=Girl+from+Ipanema%2C+she+goes+to+Greenland
00:43:43  @help yhjulwwiefzojcbxybbruweejw
00:43:43  V RETURNS!
00:43:46  right
00:44:08  elliott: ah lyrics
00:44:12  from a specific group
00:44:13  @yhjulwwiefzojcbxybbruweejw
00:44:13  "\"#$%&'()*+,\""
00:44:15  @yhjulwwiefzojcbxybbruweejw
00:44:15  "\"#$%&'()*+,\""
00:44:16  @yhjulwwiefzojcbxybbruweejw
00:44:17  Just 'J'
00:44:19  なんでやねん
00:44:34  Madoka-Kaname: what, please speak English
00:44:54  wtf
00:44:54 -!- Sgeo|web has joined.
00:45:18  Madoka-Kaname: Anyway: I think the story behind that was that some old version of the eval feature of lambdabot used an internal variable called v, which sometimes caused issues. Then it was renamed yhjulwwiefzojcbxybbruweejw.
00:45:23  I don't think it is in use any more
00:45:40  @palomer
00:45:40  (_|_)
00:45:41  @palomer
00:45:42  Blargh!
00:45:46  @help palomer
00:45:46  palomer. Sound a bit like palomer on a good day.
00:45:51  Vorpal, and somebody decided to use it?
00:45:52  whoever that is
00:46:03  Madoka-Kaname: well, v could be used by mistake quite easily
00:46:10  Madoka-Kaname: the other one? Not so much
00:46:17  Malicious action =p
00:46:32  @v
00:46:32  "\"\\\"\\\\\\\"\\\\\\\\\\\\\\\"\\\\\\\\\\"
00:46:38  Madoka-Kaname: I don't think it ever broke anything as such. It just made it return the wrong answer sometimes.
00:46:38  @v
00:46:38  "\"#$%&'()*+,\""
00:46:55  Seems to be identical to the long command...
00:47:02  seems so yes
00:47:27  @help messages?
00:47:28  messages?. Tells you whether you have any messages
00:47:29  @let a $ b = b a
00:47:29  @help messages
00:47:29   .L.hs:94:17:
00:47:29       Ambiguous occurrence `$'
00:47:29       It could refer to either `L....
00:47:29  messages. Check your messages.
00:47:31  right
00:47:42  > reverse$"abc"
00:47:43    "cba"
00:47:47  @let a $ b = b a
00:47:48   .L.hs:94:17:
00:47:48       Ambiguous occurrence `$'
00:47:48       It could refer to either `L....
00:47:50  :<
00:47:59  > let v = 5 in v = 4
00:48:00    : parse error on input `='
00:48:03  eh
00:48:06  too lazy to fix, night
00:48:36  >let 1+1=3;3+1=7 in 1+1+1
00:48:43  > let 1+1=3;3+1=7 in 1+1+1
00:48:44    7
00:48:59  amazing
00:49:08  twice11: I wouldn't have expected that
00:49:12  ancient haskell joke.
00:49:23  twice11: how does that even work?
00:49:24  Didn't come up with that myself.
00:49:32  Vorpal: it rebinds (+) locally
00:49:35  You locally define your own addition function.
00:49:38  oh, smart
00:49:53  yeah, very nice
00:49:59  > let f 1 1 = 3; f 3 1 = 7 in f (f 1 1) 1
00:50:00    7
00:50:02  f = (+)
00:50:06  elliott: quite
00:50:12  elliott: a bit confusing at first :)
00:50:50  @help kind
00:50:50  kind . Return the kind of a type
00:50:54  @let testtestt = 3
00:50:55   Defined.
00:50:58  > testtestt
00:51:00    3
00:51:01  @kind Maybe
00:51:02  * -> *
00:51:06  eh right
00:51:13  @kind Maybe Integer
00:51:14  *
00:51:17  right
00:51:20  @undefine testtestt
00:51:43  > testtestt
00:51:44    Not in scope: `testtestt'
00:51:53  OK, undefining works, so...
00:52:03  twice11: @undefine is a blunt weapon
00:52:05  it clears the whole namespace
00:52:28  @define x = 4
00:52:33  @define y = 5
00:52:39  @undefine y
00:52:41  > x
00:52:41    x
00:52:46  yeah.
00:52:55  But it is good to have such a thing...
00:53:04  @let 1+1=3;3+1=7
00:53:05   Defined.
00:53:10  > 1+1+1
00:53:10    Ambiguous occurrence `+'
00:53:11   It could refer to either `L.+', defined at  @undefine
01:19:34 -!- ive has quit (Ping timeout: 276 seconds).
01:25:13 -!- copumpkin has quit (Ping timeout: 256 seconds).
01:27:50 -!- copumpkin has joined.
01:59:16  @hoogle Integer -> [Bool]
01:59:17  Data.Time.Calendar.Julian isJulianLeapYear :: Integer -> Bool
01:59:17  Data.Time.Calendar.OrdinalDate isLeapYear :: Integer -> Bool
01:59:17  Data.Time.Calendar isLeapYear :: Integer -> Bool
01:59:22  @hoogle Int -> [Bool]
01:59:22  Prelude replicate :: Int -> a -> [a]
01:59:22  Data.List replicate :: Int -> a -> [a]
01:59:22  Prelude drop :: Int -> [a] -> [a]
02:06:50  Madoka-Kaname: /msg
02:08:27 -!- pikhq_ has quit (Ping timeout: 248 seconds).
02:08:33 -!- pikhq has joined.
02:20:13 -!- copumpkin has quit (Quit: Computer has gone to sleep.).
02:36:10  > sort [2, 1]
02:36:11    [1,2]
02:46:14 -!- copumpkin has joined.
02:46:17 -!- copumpkin has quit (Changing host).
02:46:17 -!- copumpkin has joined.
02:52:09  pikhq: I'm not sure how to do @'s DHT.
02:53:00  Nor am I.
02:53:18  pikhq: Woooooo
02:53:34  pikhq: The problem with something like Chord is that who gets to host what data is essentially arbitrary, which is kind of lame
02:53:58  My understanding of DHT is just shy of "MAGIC"
02:54:02  So. :)
02:54:12 -!- Jafet has joined.
03:03:03  OK, what's the best way for a person who hates JACK and Pulse to transfer the audio output of an ALSA application over a network >_>
03:05:02  What's wrong with JACK
03:05:07  Apart from being impossible to understand
03:05:17  Mainly the impossible-to-understand thing.
03:05:31  Every time I've used it it's taken about three seconds to go from "ahh" to "... wtf?"
03:05:46  Gregor: http://alsa.opensrc.org/Network
03:06:08  elliott: That solution doesn't work with my audio card, it can't capture from "mixer" (all output)
03:06:21  You could just install Pulse for like three seconds :P
03:06:57  I stopped hating jack after I stopped trying to get it to work
03:08:19  What's the command to make an ALSA program use JACK?
03:11:25 -!- ive has joined.
03:13:10  jackoff (sadly not)
03:13:29  lol
03:29:21 -!- Patashu has quit (Ping timeout: 240 seconds).
04:17:14 -!- zzo38 has joined.
04:21:37 -!- Sgeo|web has quit (Ping timeout: 265 seconds).
04:23:22 -!- CakeProphet has joined.
04:23:54  "I need to create a list of all the elements in a binary search tree in reverse order"
04:24:02  tree? reverse?
04:24:15  this has to be a trick question because it doesn't specify that it's complete.
04:27:34  Early today I wrote some things on paper, I think I could work these, new transformers in Haskell, which are called ProductT and SumT.
04:30:31  data ProductT a b c = ProductT { leftPT :: a c, rightPT :: b c };   Now I think  Monoid x => ProductT (Constant x)  is a monad transformer.
04:31:35  Do you think this is correct? Or did I make a mistake?
04:33:16  CakeProphet: If it's a SEARCH tree then it's ordered.
04:34:54  Gregor: ah, right.
04:34:57  that's what she means.
04:35:34  Gregor: but then what is "reverse order", uh... descending?
04:36:26  I guess an in-order traversal, outputting elements to a stack.
04:38:42  Presumably just the opposite order of whatever the comparison function ordered it as in the first place :P
04:38:47  And you could just do a RTL traversal.
04:39:54  Gregor: I don't think she covered RTL but that would work equally well as pushing to a stack (or prepending to a list)
04:40:19  Now I looked, I think the "ProductT" I have is really like the Data.Functor.Product.Product but there is already a Data.Monoid.Product and since I knew about that at first, I gave mine a different name.
04:41:11  Gregor: this class is in the nomenclature of C++, thus "list" means linked list.
04:41:19  STL/C++
04:45:23  Gregor: Alternately, you could make it a binary search tree linked list.
04:45:33  Because more confusing data structures are wonderful.
04:48:17  For a ring of sets (actually predicates in this case, meaning what is element of a set), is this correct?   instance MonoidMinus (Predicate t) where { mpinverse = id; };
04:49:12 * shachaf switches to #esoteric, sees  ... MonoidMinus ..., cautionsly switches in the opposite direction.
04:49:45  What's a MonoidMinus? Ah, just a monoid with inverses?
04:49:59  did someone say group
04:50:15  (If so, that's usually called a "Group".)
04:50:17  Yes.
04:50:51  shachaf: Yes. Actually, I do have a "Group" class which does that; "MonoidMinus" is for the inverse of the "MonoidPlus", where "MonoidPlus" is what "Monoid" instance is distributive over.
04:51:25  I also have "Semiring" and "Ring" to indicate they follow additional properties.
04:51:40  Wait, what's MonoidPlus?
04:51:54  Now I told you, isn't it?
04:52:24  I'm not sure I understood.
04:52:45  "MonoidPlus" is what "Monoid" instance is distributive over.
04:52:51  For example, the MonoidPlus for Product acts like the Monoid for Sum.
04:53:08  monqy: Oh! Why didn't zzo38 say so.
04:53:19  zzo38: What are the MonoidPlus laws?
04:54:20  shachaf: They are the monoid laws and the distributive laws. Semirings have some additional laws; if they follow those laws, make it also instance of Semiring (which has no methods of its own).
04:55:34  Specifically:  mpappend mpempty x = x; mpappend x mpempty = x; mpappend x (mpappend y z) = mpappend (mpappend x y) z; mpconcat = foldr mpappend mpempty; mappend x (mpappend y z) = mpappend (mappend x y) (mappend x z); mappend (mpappend y z) x = mpappend (mappend y x) (mappend z x);
04:55:59  Semirings have these additional laws:  mappend mpempty x = mpempty; mappend x mpempty = mpempty; mpappend x y = mpappend y x;
05:10:17 -!- Sgeo|web has joined.
05:23:27  people!
05:23:33  choose a business card design!
05:23:36  http://us.moo.com/design-templates/business-cards/pack/black-white.html
05:23:36  http://us.moo.com/design-templates/business-cards/pack/urban-abstraction.html
05:23:37  http://us.moo.com/design-templates/business-cards/pack/lets-talk.html
05:23:37  http://us.moo.com/design-templates/business-cards/pack/chris-keegan-business-cards.html
05:23:39  http://us.moo.com/design-templates/business-cards/pack/perfect-paisley.html
05:23:41  http://us.moo.com/design-templates/business-cards/pack/luminous-nature.html
05:23:49  no
05:25:16  augur: Observation: None of the "perfect paisley" business cards are paisley.
05:25:28  Gregor: i know
05:25:32  people dont know what paisley is
05:25:37  c'est la vie
05:31:43 -!- Sgeo|web has quit (Ping timeout: 265 seconds).
05:36:29  I have never used business cards designs. I just used TeX to lay out text and logos on the card. All that we had was a laser printer anyways (although here and now, I have a inkjet printer)
05:38:30  augur: chris keegan, black and white, or urban abstraction
05:38:35  roughly in order of personal preference.
05:40:54  ok
06:02:16 -!- copumpkin has changed nick to OracleOfHalting.
06:08:57 -!- MDude has changed nick to MSleep.
06:09:48  How do you change the Godel sentences ("This is unprovable") into a computer program that halts if and only if the statement is true, such that waiting for the program to halt, and that if it does halt that is considered a valid proof?
06:10:45  Search for a proof and disproof at the same time
06:11:13  I didn't know what your question was so I answered the question that I liked
06:12:15  That is what the Tortoise did; and found both at the same time. (Of course it is the dialogue made up by Hofstadter, though. I doubt it can happen.)
06:15:18 -!- Darth_Cliche has quit (Quit: You are now graced with my absence.).
06:33:46  Hey monqy, can you promise to make a brainfuck derivative if I'm not offline in the next five minutes?
06:33:51  A really awful one.
06:33:57  And delegate the brickbraining to me.
06:34:05  So that it happens to me instead of you.
06:35:50  OK, CakeProphet: You do it instead.
06:38:53 -!- elliott has quit (Quit: Leaving).
06:41:12 -!- zzo38 has quit (Quit: I will sleep.).
06:53:19 -!- ive has quit (Ping timeout: 256 seconds).
07:10:28 -!- OracleOfHalting has changed nick to copumpkin.
07:13:56 -!- GreaseMonkey has quit (Quit: The Other Game).
07:18:54 -!- sebbu2 has joined.
07:18:54 -!- sebbu2 has quit (Changing host).
07:18:54 -!- sebbu2 has joined.
07:19:16 -!- ive has joined.
07:20:44 -!- sebbu has quit (Ping timeout: 258 seconds).
07:31:17 -!- ive has quit (Quit: leaving).
08:04:50 -!- augur has quit (Ping timeout: 240 seconds).
08:08:58 -!- augur has joined.
08:14:17 -!- Jafet has quit (Quit: Leaving.).
08:24:26 -!- Zuu has quit (Read error: Connection reset by peer).
08:28:56 -!- Zuu has joined.
08:31:17 -!- derrik has joined.
08:59:31 -!- monqy has quit (Quit: hello).
09:19:04 -!- TeruFSX_ has quit (Read error: Connection reset by peer).
09:49:46 -!- Jafet has joined.
09:50:02 -!- hagb4rd has quit (Ping timeout: 240 seconds).
10:31:39 -!- oerjan has joined.
12:10:17 -!- derrik has quit (Quit: left).
13:06:32 -!- pikhq has quit (Ping timeout: 245 seconds).
13:06:42 -!- pikhq has joined.
13:08:35 -!- Jafet has quit (Quit: Leaving.).
13:50:24 -!- oerjan has quit (Quit: leaving).
14:16:48 -!- jack has joined.
14:17:10 -!- jack has left.
14:48:11 -!- fizzie has quit (Ping timeout: 276 seconds).
14:49:09 -!- sllide has joined.
14:52:15 -!- fizzie has joined.
14:54:43 -!- boily has joined.
14:57:44 -!- aloril has quit (Ping timeout: 260 seconds).
15:09:43 -!- copumpkin has quit (Quit: Computer has gone to sleep.).
15:14:35 -!- aloril has joined.
15:18:12 -!- Phantom_Hoover has joined.
15:23:14 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds).
15:23:37 -!- Phantom_Hoover has joined.
15:37:27 -!- boily has quit (Ping timeout: 258 seconds).
15:43:27  WTF, Peter Serafinowicz was the voice of Darth Maul?
15:43:34  His role in space is now 50 times funnier.
15:44:42 -!- copumpkin has joined.
15:52:53 -!- boily has joined.
15:59:08 -!- tswebb has joined.
15:59:18  Hey guys, mind if I think here out loud? Great.
16:00:07  Oh dear.
16:00:18 -!- augur has quit (Remote host closed the connection).
16:00:29  Suppose you've got an exponentiation b^a, where b and a are complex numbers.  You can separate b into a positive part and a unitary part, and a into a real part and an imaginary part.  Taking a positive number to any complex power is easy, so we only have to worry about the unitary part of the base.
16:01:32  Taking the unitary part to a real power is easy *if* the unitary part is 1 or the power is an integer.  Otherwise, lasciate ogne speranza.  So the only question is what happens when you take a unitary thing to an imaginary power.
16:04:56  But wait, every unitary number is of the form e^(i t).  So the unitary thingy is simply of the form e^(i t a), so it's all good... well, no, t is actually an angle, so a needs to be something you can multiply angles by.  An integer, always.
16:05:17  Zuh?
16:05:30  The concept of multiplication of reals is new to you?
16:05:32  So b^a just plain doesn't make entirely much sense unless b is positive or a is an integer.
16:05:35  Thanks, everyone!
16:05:56  Phantom_Hoover: what's half of the angle whose sine is 0 and whose cosine is 1?
16:06:09  You'll find that there are entirely too many correct answers.
16:06:29  Worse, what's phi times that angle?
16:06:31  No, I won't.
16:06:57  Two is too many, and I refuse to throw out just one of them!
16:07:26  I'll find that general exponentiation obviously isn't a map from C → C.
16:07:59  Isn't that what I said?
16:08:26  You took a while to arrive at that conclusion.
16:08:36 * tswebb nods.
16:10:33  Erm, C → C → C.
16:14:58  It's more like a map ((R+, C) u (C / {0}, Z) u (C, N_0)) -> C.
16:15:34  Or, alternately, C → C → P(C).
16:21:01  Predicate on C?
16:25:45  Zuh?
16:27:31  What do you mean by P(C)?
16:27:37  Powerset?
16:27:38  Oh.  The power set of C.
16:31:06 -!- augur has joined.
16:31:53 -!- Zuu has quit (Ping timeout: 244 seconds).
16:32:03 -!- MSleep has changed nick to MDude.
16:32:24 -!- elliott has joined.
16:32:56  > read "1337" :: Int
16:32:56    1337
16:33:00  > read "1337" :: Float
16:33:00    1337.0
16:33:05  type directed name resolution.
16:33:50  Huh?
16:34:01  oh, nothing. O:)
16:34:08  15:43:27:  WTF, Peter Serafinowicz was the voice of Darth Maul?
16:34:11  Phantom_Hoover: I KNOW RIGHT?
16:34:20  PETER WHY
16:34:44  15:43:34:  His role in space is now 50 times funnier.
16:34:44  Role in space(tm)
16:34:56  Oh god, I did.
16:35:11  What.
16:35:34  Say 'space' rather than 'Spaced'.
16:35:39  Phantom_Hoover: BTW who says P(S) for powerset, I am hereby not friends with anyone who doesn't either use fancy LaTeX for it or 2^S.
16:35:46 * elliott set theory notation police
16:36:18  ur plice burality
16:36:47  burality
16:37:48  bareility?
16:38:24  Bulity.
16:40:19  Cool people write C -> Prop.
17:10:29 -!- derrik has joined.
17:21:46 -!- monqy has joined.
17:22:34  hi monqy.
17:22:44  hi
17:23:58  moqny
17:24:50  hi
17:25:09  hi
17:25:19  hi
17:25:19  hi
17:25:28  elliott
17:25:34  waht
17:25:38  :|
17:25:39  hi
17:25:43  hi
17:25:44  ih
17:25:48  :|
17:25:52  bye
17:25:52  :|
17:25:53  q
17:25:55 -!- tswebb has quit (Quit: Page closed).
17:26:03  We need to do something about these malfunctioning emote bots.
17:26:17  hi
17:26:25  Motion that derrik be kicked and he and tiffany banned, effective immediately.
17:28:21  hi Phantom_Hoover
17:28:55  This one is even more vapid than tiffany.
17:29:22  o~o
17:29:25  Phantom_Hoover: You don't understand, he's a professional teacher.
17:29:32  at least o~o is exciting
17:29:40  enthralling
17:29:52  an true adventure
17:33:35  elliott, I...
17:34:10  Phantom_Hoover: Speechlessness. The hallmark of a thick adult!
17:42:55 -!- ais523 has joined.
17:48:09  hi ais523
17:48:16  hi elliott
17:51:47  hi ais523
17:51:56  hi quintopia
17:52:22  hi Phantom_Hoover
17:52:36  hi elliott
17:52:46  hi yiyus
17:53:11  hi 
17:53:48  i would never ping ais523 monqy derrik elliott augur boily copumpkin Phantom_Hoover aloril fizzie sllide pikhq sebbu2 CakeProphet mtve variable FireFly chickenzilla Madoka-Kaname Vorpal yorick atehwa kmc mycroftiv Nisstyre olsner MDude shachaf Deewiant EgoBot quintopia Slereah_ Zwaarddijk BeholdMyGlory myndzi yiyus SimonRC rodgort ineiros_ tswett clog jix Gregor glogbot Zetro bd_ lambdabot coppro lifth
17:53:49  rasiir HackEgo twice11 all at once
17:53:53  hi
17:53:56  oh poor lifthrasiir missed out on that :(
17:53:58  pong
17:54:01  I'm going to get kicked now
17:54:13  elliott: Come on.
17:54:16 * rodgort stabs
17:54:18  I heard u mad yesterday.
17:54:18  pong
17:54:20  i like how you put your own name in there
17:54:29  elliott, exactly
17:54:30  Even ddarius concurred that u mad.
17:54:33  elliott: well you didn't lie, but only be cause it was split onto multiple lines :P
17:54:41  and in the middle of a name
17:54:41  Nothing quite like flood of hatred that comes after a channel ping :')
17:54:51  it's magical
17:54:55  nothing like a good old stabbing in the face
17:54:59  that's also magical
17:55:26  NYAN NYAN NYANNYAN NYAN NYANYANYAN NYAN NYAN, NYAN NYAN NYANNYAN NYAN NYANYANYANYANYANYANYANYAN
17:55:34 * sebbu2 slaps elliott around a bit with a very large trout
17:55:38 -!- sebbu2 has changed nick to sebbu.
17:55:43 * shachaf decides not to feed the troll.
17:55:45  sebbu: Oh my god, it's 2001!
17:55:46  Gregor..................
17:55:53  sebbu..................
17:55:59  thanks shachaf
17:56:06  for not being them
17:56:11  Gregor: ====Oö ?
17:56:15  I'm also not Gregor or sebbu.
17:56:18  thanks elliott
17:56:23  Thanks monqy.
17:56:23  thanks twice11
17:56:34  monqy is going to ping everyone but Gregor and sebbu in thanks.
17:56:37  thanks ineiros_ thanks derrik thanks augur thanks SimonRC thanks Zetro
17:56:38  yes
17:56:42  you
17:56:44  spoiled it
17:56:46  sory
17:56:48  now i can't ping everyone
17:56:55  you can, it'll just be unfunny and meaningless
17:56:58  which is the best way to do it
17:57:00  crys
17:57:06  a shun on all massive highlighters would be good :)
17:57:28 * derrik does /clear
17:57:30  sebbu: This channel NEEDS ME.
17:57:39 -!- Gregor has set topic: Official NYAN support channel for Web o' Flies | Also official channel of VelNYANta | VelNYANta: Why NYAN, when you can VelNYANta! | NYAN http://codu.org/logs/_esoteric/#NYAN.
17:57:53 -!- elliott has set topic: no | http://codu.org/logs/_esoteric/.
17:57:53  nooo
17:57:56  ysss
17:57:57  e
17:57:57  X-D
17:58:03 -!- Gregor has set topic: nyano | http://codu.org/logs/_esoteric/.
17:58:06  elliott: quick reactions :)
17:58:08 -!- monqy has set topic: yes | http://codu.org/logs/_esoteric/.
17:58:09 -!- elliott has set topic: http://codu.org/logs/_esoteric/.
17:58:17  codu more like no-do
17:58:22  ais523: ?
17:58:39 -!- Gregor has set topic: This channel can never truly escape THE CAT | http://codu.org/logs/_esoteric/.
17:58:40  elliott: to Gregor's topic change
17:58:49 -!- monqy has set topic: This channel can never truly escape bad topics | http://codu.org/logs/_esoteric/.
17:58:52  ais523: you get used to it after a few days of asiekierka
17:59:01 -!- ais523 has set topic: http://codu.org/logs/_esoteric.
17:59:03  sad truths topic
17:59:04 -!- ChanServ has set channel mode: +t.
17:59:05  rip
17:59:07  rip
17:59:08  ais523: you missed the slash
17:59:15  where?
17:59:15  and also abused power :'(
17:59:20  ais523: i'm not telling you!
17:59:28  oh, trailing slash
17:59:35  the link works anyway, so
17:59:44  and it's just temporary until people calm down a bit with the topic screwing
17:59:44  ais523: it redirects, that's putting load on Gregor's servers
17:59:53  Gregor: ais523 is abusing his op powers to DDoS you :'(
18:00:05 -!- ChanServ has set topic: http://codu.org/logs/_esoteric/.
18:00:06  better?
18:00:18  hmm, all Gregor has to do is move the logs and you're obligated to change the topic
18:00:43  ATTENTION:
18:00:58  elliott: don't say that, he'll move them somewhere obnoxious
18:01:00  Channel logs will now be moved to http://codu.org/nyannyannyannyannyannyannyannyannyannyannyanlogs/_esoteric/
18:01:05  ais523: exactly
18:01:20  Gregor: If you don't do that I'll be really disappointed.
18:01:24  elliott: but don't you not want an obnoxious topic
18:01:25  somehow i figured the new logs would have "nyan" in them, but i did not expect that much
18:01:28  I think you can keep the same programs working just with ln -s
18:01:33  note that I could legally retaliate by kicking glogbot
18:01:36 -!- CakeProphet has quit (Ping timeout: 258 seconds).
18:01:37  and that would be bad for everyone
18:01:38  ais523: Yeah, but this is a bargaining chip to get -t :P
18:01:50  elliott: My laziness is greater than my nyanniness.
18:01:53  you wouldn't want me to kick glogbot, would you?
18:02:10  the +t is only temporary, just like you do a temporary +m to people widely spamming msgs in the channel
18:02:13  ais523: You'd have to link to the clog logs instead, including the old zip of 'em
18:02:18 -!- ChanServ has set channel mode: +o ais523.
18:02:23 -!- ais523 has set channel mode: -t.
18:02:25 -!- ais523 has set channel mode: -o ais523.
18:02:32  Darn, now the fun is over. :'(
18:03:20 -!- Gregor has set topic: #esoteric is Not Your Average Network chat channel! | http://codu.org/logs/_esoteric/.
18:03:44  :(
18:03:48 -!- derrik has quit (Quit: back soon).
18:03:53  bye derrik
18:04:13  Goodbye derrik, we hardly knew ye (as ye never talked)
18:04:16  Gregor: OK, I'll agree with that compromise
18:04:43  Gregor: oh no, he did
18:04:55  Gregor: just hope we don't get to know him any more
18:05:42 -!- Darth_Cliche has joined.
18:09:30 -!- derrik has joined.
18:10:04  That was way too soon.
18:10:45  ty elliott
18:10:54  hi relevant peole
18:11:06  I don't think I've talked to derrik ever, but he/she was here earlier
18:11:21  ais523: oh, you missed out on that day?
18:11:26  you're one of the lucky ones :)
18:11:59  :)
18:16:04 -!- ais523_ has joined.
18:16:38  rip ais523
18:16:48 -!- ais523 has quit (Disconnected by services).
18:16:50 -!- ais523_ has changed nick to ais523.
18:17:08  first time the computer's suddenly cut out during updates
18:17:19  let me see if it's in a sane state after that; it seemed to boot up OK
18:17:35  ais523: if you used Kitten, you'd have atomic upgrades... :)
18:17:54   E: dpkg was interrupted, you must manually run 'sudo dpkg --configure -a' to correct the problem.
18:18:05  hmm, I wonder why it can't do that automatically?
18:18:24  I think it can end up doing debconf stuff
18:18:32  or whatever
18:18:38  it's a GUI package manager, it should be able to handle it itself
18:18:40  anyway, none of that with kitten, either :-P
18:19:36  heh, seems it had almost finished
18:19:37 -!- Phantom_Hoover has quit (Ping timeout: 258 seconds).
18:19:46  the configure took about half a second, then it was fully up-to-date
18:20:45  ais523: regular reminder that this problem doesn't even exist with kitten!!! kitten: the best.
18:21:21  elliott: in Kitten, you'd still need to GC the partial update and do the update properly
18:22:00  ais523: you're just stringing random words together and hoping they come out correct, right? :P
18:22:25  I'm trying to figure out what would happen if the power was cut while Kitten was in the middle of writing a file
18:22:29  during a package update
18:22:53  the file it was writing wouldn't be used, presumably, because it wouldn't be recorded as being in the unionfslikefs as something to mount
18:23:03  but it'd still exist, and you wouldn't want it to hang around forever
18:23:15  ais523: I'll explain, to stop you making up nonsense :P
18:23:15  and you also presumably still want it, so you'd have to redo the update
18:24:05 -!- zzo38 has joined.
18:24:17  ais523: You'd have to define "package update". The upgrade process in Kitten looks like this: Figure out which packages have new versions. Install them -- likely by downloading a binary tarball and extracting it -- into the store. That's guaranteed not to "overwrite" anything because the store is immutable, hash-based, etc. etc. etc.; the old versions of the packages are still there. Once all that is d
18:24:17  one, then /atomically/ switch over the user environment to use the new versions of all the upgraded packages.
18:24:29  The old versions then become garbage (assuming nothing else -- e.g. another user -- is referencing them), and can be GC'd.
18:24:49  elliott: that's the operation I was describing as an update
18:24:58  ais523: Yes, but it's composed of multiple operations.
18:25:08  The tarballs are extracted to a temporary directory and then moved into the store, so that's atomic too.
18:25:17  Basically, there is no way for a crash during a Kitten upgrade to produce an inconsistent state at all.
18:25:19  oh, using atomic mv?
18:25:22  Yes.
18:25:23  it wouldn't produce an inconsistent state
18:25:32  If it failed half-way through installing the packages, you'd just re-run it, and it'd do the rest.
18:25:38  I was thinking about if the temporary directory was half-written
18:25:42  It might do one of them again, if it failed while unpacking it.
18:25:44  but I suppose it regularly gets cleaned away anyway
18:26:01  ais523: Well, it's per-package.
18:26:23  So it's like a few hundred megs waste at most, and it'll probably get cleaned up as soon as the package manager notices it has some junk temporary files lying around.
18:26:38  (Won't unpack to /tmp: rename(2) is not atomic across filesystems!)
18:26:46  (And also you might not have enough RAM to store the package, anyway.)
18:27:19  That way of garbage collecting the old versions would work in case some user or program requires the old version for some reason. Or in case you want to tell it to keep the old one temporarily in case the new one is broken and you want to revert some programs to the old one!
18:27:22  rename(2) works across filesystems at all?
18:27:36  also, aren't tmpfses capable of swapping to disk if required?
18:27:36  ais523: well, probably not, but mv does
18:27:55  zzo38: Yep! (Packages that depend on older versions will keep referencing them and work fine even without doing anything special.)
18:27:57  if they weren't, there'd be no difference between a tmpfs and shmfs
18:28:10  (Of course you have to manually select an old version to run programs that depend on an older version that aren't part of the package manager.)
18:28:11  elliott: how would the GC determine which packages were being referenced?
18:28:22  ais523: mark-and-sweep
18:28:27  how does it do the marking?
18:28:39  it seems nontrivial to tell whether a package is in use or not
18:28:46  ais523: Well, the user profiles (sets of packages users have installed) are the roots.
18:28:55  ais523: Then you just do a regular conservative scan from there.
18:29:00  oh, it's at the package level?
18:29:09  ais523: Any package that references another will contain its store path.
18:29:12  what happens if a user uninstalls a package while using it?
18:29:18  e.g. running an executable from it?
18:29:19  ais523: (this breaks if something stores its library paths in UTF-16, or whatever)
18:29:22  (but nobody does that)
18:29:31 -!- sebbu2 has joined.
18:29:31 -!- sebbu2 has quit (Changing host).
18:29:31 -!- sebbu2 has joined.
18:29:34  (that's like memfrobbing a pointer when using boehm gc)
18:29:45  err, I forget whether memfrob is reversible
18:29:50  ais523: define uninstall...
18:29:54  ais523: presumably you mean "removing from the environment"
18:30:04  elliott: removes the package from the list of packages that they state they want
18:30:22  ais523: Well, all the package's references to itself will use absolute store path locations.
18:30:32  And removing a package from the environment doesn't remove it from the store, only GCing does that.
18:30:35  But...
18:30:36  Don't do that :P
18:30:45  I was fearing the answer was "don't do that"
18:30:51 -!- sebbu has quit (Ping timeout: 240 seconds).
18:30:56  ais523: it would be easy enough for the package manager to figure out whether you're using it
18:30:57  the package isn't in any user's lists, so it's risking being GCed
18:31:05  and refuse to let you remove it
18:31:06  this is more important for old versions, though
18:31:11  but I'm pretty sure it's obvious
18:31:17  ais523: well, yes, GC doesn't just run willy-nilly for a reason
18:31:21  ais523: you GC when you're low on disk
18:31:31  ais523: you can add packages manually to the set of gc roots, though
18:31:35  "uninstalling" a package while using it is a bit weird; but upgrading it while using it is quite common
18:31:37  if you want to protect it while not referencing it from any environments
18:32:00  ais523: I thought you meant doing it while GCing
18:32:08  certainly, things won't break if you upgrade without rebooting
18:32:20  elliott: I mean, if the GC runs after doing that
18:32:25  ais523: the gc doesn't just "run"
18:32:28  the system administrator has to run it
18:32:34  well, when's a sensible time to run it?
18:32:38  the only time I can think of is during boot
18:32:40  ais523: when you're running out of disk for the store
18:32:51  or just want to reclaim some free space
18:32:53  elliott: but people might have just upgraded a package they're using when that happens
18:33:02  ais523: you'd reboot at the same time to get kernel upgrades
18:33:13  (say ksplice and I'll ragequit)
18:33:24  you hate Oracle that much? :P
18:33:24  it's a periodic maintanence task, not anything that needs to be run with regularity
18:33:32  ais523: heh
18:33:48  wait, hmm
18:33:48  it might make most sense to run it on every boot
18:33:58  ais523: actually, no, there would be no risk
18:34:08  ais523: because you keep old user environments
18:34:15  those have to be deleted manually to stop them referencing old packages
18:34:29  I don't like the repeated "manual" here
18:34:41  it'd make most sense to delete them when the user had no logins
18:34:47  ais523: so basically, if you upgraded ten times without rebooting, then the sysadmin said "delete every user environment older than the last 10 and gc"
18:34:51  then things would break
18:34:55  just like it makes sense to GC packages on boot
18:35:01  elliott: right
18:35:02  ais523: no, that doesn't make sense at all
18:35:05  because you can rollback on boot
18:35:08  I don't see why the sysadmin needs to make potentially incorrect decisions
18:35:13  that's one of the major advantages of a purely functional package manager
18:35:20  you can select an old profile from the GRUB menu to roll back to it
18:35:23  in case you break something
18:35:30  elliott: right; I think that would count as a reference for the GC
18:35:37  the sysadmin doesn't make potentially incorrect decisions, you just don't understand the model :)
18:35:43  GC things that have fallen off the end of the rollback menu on boot
18:35:54  ais523: they don't fall off
18:35:59  it's a matter of system policy when you clean them up
18:36:09 -!- Phantom_Hoover has joined.
18:36:11  well, falling off is a sensible system policy, right?
18:36:14  it makes sense to delete all but the last 10 for each user before GCing
18:36:18 -!- Phantom_Hoover has quit (Changing host).
18:36:18 -!- Phantom_Hoover has joined.
18:36:25  or similar
18:36:34  what I'm saying is, it's OK to have the rules customizable, even to entirely manual
18:36:37  but entirely manual is not a sane default
18:36:45  ais523: let me tell you about cron!
18:36:52  it is not the package manager's job to run itself periodically
18:36:59  that is a matter of system policy and is why we have generic scheduling tools
18:37:04  I'm talking about the system as a whole, not the package manager itself
18:37:11  for desktop users, it /does/ make sense to have it be manual
18:37:16  putting it in the crontab would be a sensible default, for instance
18:37:21  because there is no reason to delete things until you actually need more space
18:37:30  which is not something a computer can determine; you need more space when you want more space
18:37:57  elliott: you need more space when you want more space, indeed; and if you want more space, you don't want to manually have to run a bunch of "free up space" things
18:38:07  you want them to already have happened by the time you want more space
18:38:18  so that you don't have to think "oh, I want to create a file, let me run the spacecleaner first"
18:38:23  you just think "I want to create a file"
18:38:34  ais523: this is why people don't consider 4 gigabytes a large disk
18:38:40  the extreme version of your opinion would be a system that always used your entire disk, all the time
18:38:51  and whenever you wanted to create a file, you requested it to purge a bit of space to create the file in
18:38:53  actually, hmm
18:39:03  why not hook the spacecleaning things into the open/close/write syscalls, in that case?
18:39:14  as long as it's automated, it's actually a reasonable thing to do
18:39:15  if I hadn't given up on this by the last message, I just did
18:40:04  ais523: the system does not delete the user's data without asking or being told to. simple as that
18:40:16  oh well, when you have an opinion as insane as this one, you generally realise why it's wrong after a few months of actually using it
18:40:24  so I suppose there's no real point in trying to convince you now
18:40:51  ais523: the NixOS guys don't seem to have any problem with it after 7 years of production use
18:41:11 -!- zzo38 has quit (Remote host closed the connection).
18:41:21  the problem is that you want a system that nobody else wants
18:41:27  I doubt their GC is entirely manual
18:41:27  hm
18:41:29  yes, it is
18:41:43  elliott: what is the thing ais523 is suggesting here?
18:41:55  Vorpal: a bad idea; you can read the logs if you want more detail
18:42:18  "You should periodically run the Nix garbage collector to get rid of unused packages, since uninstalls or upgrades don't actually delete them:
18:42:18  $ nix-collect-garbage -d"
18:42:19  [...]
18:42:21  "Of course, since disk space is not infinite, unused packages should be removed at some point. You can do this by running the Nix garbage collector. It will remove from the Nix store any package not used (directly or indirectly) by any generation of any profile.
18:42:21  Note however that as long as old generations reference a package, it will not be deleted. After all, we wouldn’t be able to do a rollback otherwise. So in order for garbage collection to be effective, you should also delete (some) old generations. Of course, this should only be done if you are certain that you will not need to roll back."
18:42:58  Vorpal: that if a system requires a GC, then the GC should actually run when needed, rather than making the user have to remember it exists
18:43:14  Vorpal: or you could get the misleading version straight from him :)
18:43:18  ais523:  from a quick glance at the scrollback, it seems you want package garbage collection to be automatic. Even "normal" distros doesn't automatically remove downloaded files. You need something like apt-get clean or pacman -Sc for that
18:43:23  ais523: hope i've cleared up your doubts
18:43:24  why should it be any different here
18:43:32  and if you want it, just put it in the crontab
18:43:48  Vorpal: they put them in /var/cache, whose entire purpose for existence is that it can be automatically cleaned at any time
18:43:59  Vorpal: ais523 wants even worse than that, he wants /automatic scheduled deletion/ of old package configurations in the crontab by default
18:44:05  ais523: I have not seen that happen though
18:44:15  ais523: show me where that is actually done automatically
18:44:18  ais523: /var/cache is meant to be cleaned manually
18:44:21  as opposed to /tmp
18:44:24  that's why it's not called /tmp
18:44:49  elliott: err? /tmp is cleaned on boot, that doesn't make sense with the intended purpose /var/cache
18:44:53  *intended purpose of
18:44:59  which should be cleaned only when the disk is getting full
18:45:10  it is of course possible ubuntu cleans it automatically but I don't think so
18:45:14  I'd be surprised if distros didn't clean the older half of it when the disk was getting near full
18:45:31  ais523: pretty sure no distro does that currently
18:45:53  and automatic removing of old configs is insane
18:45:58  Vorpal: I know that Windows does, when the disk space becomes full
18:46:07  that is not a linux distro
18:46:12  shocking revelation: packages don't take up most of the disk, user files like audio/video do
18:46:16  you said distro above, define your meaning of distro
18:46:17  /images
18:46:20  not completely automatically, but it lists a bunch of things that would make sense to delete, in order of how likely they are to be safe to delete
18:46:29  ais523: I would like to point out that ubuntu doesn't delete old kernels after you installed a newer one
18:46:32  you have to do that by hand
18:47:29  ais523: how is this any different?
18:47:34  Vorpal: right, and that confused me, I don't see why it'd need more than 3 or 4 or so
18:47:39  ...
18:47:44  it is up to the user?
18:47:57  I see no reason why it shouldn't be configurable
18:48:03  but infinity isn't a sane default for that
18:48:17  whereas, say, for bash_history, the default is much too low, and infinity would be a saner default there
18:48:25  as looking arbitrarily far back in your bash history is actually useful
18:48:41  whereas old kernels are likely to be around elsewhere online, so can always be redownloaded
18:49:32  ais523: I actually have multiple kernels on my laptop, I use a newer one that I have graphical issues with (because X isn't new enough) but where they improved various things for battery time a lot when I need that. Then I use the standard distro kernel when I know I will be on AC for quite a while
18:49:35  like over weekends
18:49:50  anyway you could just write your own cron job for these misfeatures
18:49:53  it wouldn't be hard
18:50:02  Vorpal: in that case, wouldn't you just mark both kernels as desired versions to keep around by hand?
18:50:13 -!- derdon has joined.
18:50:21  ais523: sure, but you just added complexity to the solution
18:50:21  otherwise, say, when you went and transferred your list of packages onto a different physical computer, you wouldn't have the old versions you were using
18:50:48  no I didn't; that complexity exists anyway both in elliott's distro/Nix, and (if you want to be sane) in your case too
18:50:58  you have a list of installed packages, right?
18:50:59  ais523: the newer kernel version I use was basically manually backported and have non-standard options. I would have to compile a new kernel for another system anyway
18:51:12  why would you want the list to be different from the set of packages that are actually installed?
18:51:15   whereas, say, for bash_history, the default is much too low, and infinity would be a saner default there <-- not really, that would grow forever much quicker than package history
18:51:34   why would you want the list to be different from the set of packages that are actually installed? <-- ... where did I claim that?
18:54:26 -!- ais523_ has joined.
18:54:57  Vorpal: having fun?
18:55:00  Vorpal: are you seriously saying that your bash history grows faster than the binaries of all the kernels you've ever used?
18:55:08  incidentally, my computer just locked up and I had to hard reboot
18:55:10  which is weird
18:55:13  I'm seeing if there's anything in the logs
18:55:36  elliott: yes. I'm watching a video now.
18:55:38  (magic sysrq wasn't working, nor was control-alt-F1, and the mouse pointer wouldn't move; strangely, the sound card just kept looping the last second or so of what it had been playing)
18:56:03 -!- ais523 has quit (Ping timeout: 240 seconds).
18:56:22 -!- ais523_ has changed nick to ais523.
18:57:25  nothing relevant in logs
18:57:47  they were just cut off, much as I'd expect if I hard-rebooted while the system was running normally
18:58:26  the only unusual thing I was doing was "$ du --si --summarize /usr /home"
18:58:34  because I was curious as to their relative sizes on my system
18:59:42  it's, umm, taking a while, which isn't surprising
18:59:52  because the total size of /usr and /home isn't recorded anywhere, so it has to be worked out
19:00:26  I wonder if it would be reasonable to design an fs to record the total size of directories? it'd be O(depth of directory tree) to update, I'm not sure if that'd be too expensive
19:02:09 -!- oerjan has joined.
19:06:30   So b^a just plain doesn't make entirely much sense unless b is positive or a is an integer.
19:06:49  tswett: multivalued functions, man.
19:07:21  even b=1 is interesting to consider that way.
19:08:04  1^(1/n) naturally has all the values cos (2*k*pi/n) + i sin (2*k*pi/n)
19:08:48  (they're the solutions to z^n = 1, for one thing)
19:09:42  otherwise, you need to choose a branch of the function.
19:10:00  ais523: actually I can check size of /usr and /home really quick
19:10:11  ah, OK
19:10:18  elliott: I have 11G in /usr, 53G in /home
19:10:32  and I wouldn't be surprised if most of the packages on the system have been upgraded at least 5 times
19:10:33  ais523: here is how:
19:10:35  $ df -h | grep -E '(/usr|/home)$'
19:10:35  /dev/mapper/array-home        192G  158G   25G  87% /home
19:10:35  /dev/mapper/array-usr          20G  9,9G  8,9G  53% /usr
19:10:50  hmm, that's interesting
19:10:58  ais523: what is?
19:11:01  /dev/mapper
19:11:08  ais523: well, it is basically LVM2
19:11:18 -!- Darth_Cliche has quit (Ping timeout: 255 seconds).
19:11:18  also, I note that your /home is only three times the size of your /usr
19:11:27  elliott's is probably thousands of times the size, knowing him
19:11:40  ais523: I have never grown /usr since installing the system. I have grown /home a few times
19:11:56  I recently reinstalled this system so I can't say.
19:12:00  Vorpal: but you aren't storing old versions of most packages in /usr, are you?
19:12:26  elliott: actually, that's a really good time to say, assuming you transferred over /home and transferred over the list of installed packages so that /usr contained the same packages
19:12:46  I can't transfer /home from a dead machine.
19:12:58  ah, hmm
19:12:58  ais523: no because I use arch. My current partition scheme would not fit nixos. nixos doesn't even have an /usr. If I were to switch (and I'm contemplating this, still a few issues that needs to be ironed out first though), I would drop /usr and reorganize stuff a bit
19:13:01  not even from backups?
19:13:09 -!- derrik has quit (Quit: nite).
19:13:12  or by taking the drive out of it and connecting it up directly?
19:13:34  Vorpal: well, nixos has a place-where-packages-are-stored
19:13:37  ais523: I don't imagine elliott backs up anything beyond, say, ssh keys or web browser profile
19:13:41  ais523: yes
19:13:43  which may not be /usr, but certainly has a similar purpose
19:13:55  Vorpal: hmm, I suspect my more recent ssh keys aren't actually backed up
19:14:04  I only ever made the one backup of dotfiles
19:14:14  ais523: I hadn't yet set up backups there for various reasons, although I have slightly old backups of the things I care about most (~/Code, mostly)
19:14:18  I don't care about web browser profiles being backed up, most things I care about I memorized the URLs for
19:14:20  and the passwords
19:14:27  elliott: ah, OK
19:14:29  ais523: nixos has one file in /bin, that is /bin/sh, and is a symlink. No /usr, not /sbin. It is all done in different ways
19:14:33  ais523: and extracting the HD would require taking a chip welded onto the motherboard
19:14:42  elliott: ouch
19:14:47  and then wiring it up to an enclosure somehow
19:15:06   I don't care about web browser profiles being backed up, most things I care about I memorized the URLs for <-- well, if you use the key ring feature of your browser
19:15:10  (I do that)
19:15:11  Vorpal: that doesn't mean that there isn't a part of the system where installed executables are stored, though
19:15:34  btw, Apple have decided that they don't have to fix the MacBook Air according to the warranty
19:15:36  Vorpal: well, the browser has some passwords memorized; but I have them memorized too
19:15:42  because I'm used to logging in from different systems
19:15:44  and want 500 pounds to fix it
19:15:46  elliott: hmm, how old was it?
19:15:50  in related news, I have a new doorstop
19:15:53  it's very thin
19:15:57  ais523: less than a year
19:15:58  ais523: indeed, but I wouldn't put it on a separate partition from / for nixos. I would probably use / /home /boot and possibly /tmp (unless I do that in tmpfs)
19:16:16  ais523: probably the warranty excludes all damage that isn't caused by, I don't know, God
19:16:17  elliott: they what?
19:16:21 * Gregor has one big / partition :P
19:16:27  Gregor: So does everyone sane.
19:16:32  elliott: that sucks
19:16:33  elliott: you might be able to get them to fix it on statutary warranty, if the damage is their fault
19:16:47  elliott: I have one big / partition, but suspect it may be a bad idea
19:16:57  also, an equally-sized partition for Windows
19:17:04  my laptop has /boot and /.
19:17:10  as the repartitioner on the Ubuntu installer wouldn't shrink the Windows partition to less than half its original size
19:17:14  oh and swap of course
19:17:16  ais523: I haven't bothered to investigate further as I don't anticipate arguing with Apple to be productive, but I suspect they have a very bad definition of "fault"
19:17:18  I suppose I should use it for local backups, or something
19:17:23  but I haven't been bothered to figure out how to mount it
19:17:36  elliott: for statutary warranty, it's not their definition that matters, but the legal one
19:17:39  Vorpal: it does suck; I guess I might fix it some day if I have some free cash
19:17:45  this machine works fine for now, though
19:17:49  does the computer you're currently using have working number keys?
19:17:52  elliott: see what ais523 said
19:17:56  ais523: yep, but I'd have to convince them that they have to agree with my definition
19:18:04  which sounds like an awful lot of trouble
19:18:08  and yes, it does :)
19:18:13  elliott: talk to your lawyer ;P
19:18:19  (I doubt you have one)
19:18:26  what went wrong with the old one, apart from the digits on the keyboard?
19:18:31  Vorpal: If I had a lawyer, I'd probably have 500 pounds spare :P
19:18:46  ais523: it turned off and didn't turn back on again
19:19:15  hmm, OK
19:19:19  with no obvious cause?
19:19:31  indeed
19:19:47  this happened like a week ago, btw, I just forgot to say anything :P
19:19:51   elliott: to Gregor's topic change
19:20:18  Gregor: I SUSPECT YOUR .txt LOGS DON'T INCLUDE TOPIC CHANGES
19:21:49  oerjan: I noticed that >_>
19:23:52  Gregor: i also suspect they don't include +t mode changes :P
19:24:03  oerjan: They don't include mode changes at all.
19:27:05  if not for freenode's stupid idea that there should be a way to avoid getting logged, i'd have liked to point out that a channel should BLOODY INCLUDE EVERYTHING PEOPLE ON THE CHANNEL SEE
19:27:16  *channel log
19:27:26  *BLOODY WELL
19:27:29  http://codu.org/logs/_esoteric/2011-11-09-raw.txt
19:27:34  Or,
19:27:36  !glogbot_help
19:27:40  https://codu.org/projects/stuff/logbothg/
19:27:45  I'm sure Gregor accepts patches.
19:27:55  elliott: I'm fixing it right now :P
19:27:56  Anyway I'm pretty sure glogbot doesn't respect the idiotic "no-logging" thing.
19:27:57  It's half-fixed already.
19:28:13  yay
19:28:13  what's the no-logging thing?
19:28:35   if not for freenode's stupid idea that there should be a way to avoid getting logged
19:29:12   if not for freenode's stupid idea that there should be a way to avoid getting logged, i'd have liked to point out that a channel should BLOODY INCLUDE EVERYTHING PEOPLE ON THE CHANNEL SEE <-- err? avoid getting logged?
19:29:20  ais523: i think i saw it in a faq somewhere
19:29:31  it's not in the server intro message, though
19:29:44  oerjan: Freenode doesn't like channels to be logged without warning the users of the channel (e.g. in the topic)
19:29:53  ais523: that's not it
19:29:57  I thought you were implying there was some way to send a message-to-channel that wasn't logged
19:30:01  there is
19:30:05  what
19:30:16  or rather there's meant to be
19:30:22  thats stupid
19:30:28  i'm not sure if there is one which _both_ our log bots simultaneously abide by :P
19:30:41  neither of our log bots fail to log anything
19:30:41  well
19:30:45  apart from clog which is just incomplete
19:31:02  "Be sure to provide a way for users to make comments without logging, --" -- freenode philosophy: channel guidelines.
19:31:10  Argh, I'm incompetent :P
19:31:20  OK, it's 2/3rds fixed (adding topics to log)
19:31:34  fizzie: that is really simple actually. Tell them to turn off local logging. Then they can make a comment while not logging.
19:31:41  what a badly worded statement
19:31:48  "If you're considering publishing channel logs, think it through. The freenode network is an interactive environment. Even on public channels, most users don't weigh their comments with the idea that they'll be enshrined in perpetuity. For that reason, few participants publish logs.
19:31:48  If you're publishing logs on an ongoing basis, your channel topic should reflect that fact. Be sure to provide a way for users to make comments without logging, and get permission from the channel owners before you start. If you're thinking of "anonymizing" your logs (removing information that identifies the specific users), be aware that it's difficult to do it well—replies and general context often
19:31:48   provide identifying information which is hard to filter.
19:31:48  It's in the context of publishing logs.
19:31:49  If you just want to publish a single conversation, be careful to get permission from each participant. Provide as much context as you can. Avoid the temptation to publish or distribute logs without permission in order to portray someone in a bad light. The reputation you save will most likely be your own."
19:32:24  fizzie: You should put on your special op hat and tap my head three times and designate me the Official Catalyst.
19:32:27  That's how it works, right?
19:32:42  Your way to make comments without logging is to go to #esoteric-unlogged .
19:32:50  Relaxed, open-minded, responsible, unobtrusive, realistic, careful, attentive, minimalist, courteous, cooperative, someone with an internal locus of control, and a user...
19:32:52  I think the catalyst stuff has something to do with chemistry, but that's all I know.
19:32:53  Yes, I am all these things!
19:32:53  Gregor: :)
19:32:57  As an added bonus, you may choose to opt out of hearing unlogged messages by simply not joining #esoteric-unlogged .
19:33:08  Gregor: http://codu.org/logs/_esoteric-unlogged/
19:33:13  elliott: Nooooooose
19:33:26  how did that happen
19:33:29  I sure hope this comment was not logged.
19:33:31  I invited glogbot to it. :P
19:33:46  stupid bot that does that
19:33:57  fizzie: X-D
19:34:00  Vorpal: Does what?
19:34:07  elliott: joins any invites it gets
19:34:11  Vorpal: It's a logbot.
19:34:32  Vorpal: Why send a command for "start logging" when you could just use an existing IRC mechanism...
19:34:38  Vorpal: Bonus: /invite requires op privileges.
19:34:43  So glogbot can avoid authenticating that.
19:35:00  elliott: sure, but surely only the owner of the bot should be able to add new channels
19:35:05  Why
19:35:16  Vorpal: It's a public-access logbot, I shouldn't need to be bothered to add new channels.
19:35:17  elliott: well lets invite it into all high volume channels then :D
19:35:26  Vorpal: We're not ops on those channels, you moron.
19:35:28  Vorpal: Good luck getting ops on all of them.
19:35:39  elliott: true, but do you need that if the channel is not +i?
19:35:42  I don't think you do
19:35:58  * #ubuntu :You're not a channel operator
19:35:58  * Channel #ubuntu modes: +CLcntjf 5:10 #ubuntu-unregged
19:36:14  huh
19:36:16  +i is just restricting joins.
19:36:30  That /invite policy is a Freenode thing.
19:36:33  But, glogbot is a Freenode bot :)
19:36:46  yeah pretty sure invites don't work like that on a standard ircd
19:36:51  OMG HOW DO I KEEP SCREWING THIS UP
19:36:53  There's a chanserv access flag to enable inviting.
19:36:55  Like there's any such thing as a standard ircd.
19:37:05  The IRCnet ircd is the standard ircd. :p
19:37:05  fizzie: isn't that /cs invite
19:37:09  rather than /invite
19:37:20  elliott: well, common ircd. As in how it is done on the other big networks
19:37:43  Vorpal: Could be; I suppose it would make sense that way.
19:38:01  FINALLY. After only twelve attempts, the logbot now has topic changes.
19:38:08  Now to add mode changes.
19:43:03  yay
19:43:39  now i just need to ironically ban Gregor for abusing topic changes
19:44:07  oerjan: ban ais523 instead, he abused mode changes :'(
19:44:14  EVIL
19:44:28 -!- Gregor has set topic: #esoteric is Not Your Average Network chat channel! | #esoteric trying to enforce topic despotism: But how will this affect our children's fitness? That and more at 11 | http://codu.org/logs/_esoteric/.
19:44:52  oerjan: I +t'd the channel in order to stop the topic change abuse
19:44:56  I don't call that mode change abuse at all
19:45:08  especially as it was only intended to be temporary, and was in fact changed back after a few minutes
19:45:14  Oh man, Not Your Average Network
19:45:16  I just got it >_<
19:45:19  elliott: Bahahahaha
19:45:25  elliott: should i ban ais523 for not understanding jokes, instead?
19:45:42  elliott: I got it right away
19:45:48  and thought it was an amusing compromise
19:45:53  OK, topic/mode logging is now perfection.
19:45:59  might be better without the caps, I guess
19:46:02  oerjan: Yse.
19:46:04 -!- Taneb has joined.
19:46:04  Yes.
19:46:39  ?unmtl Cont r a
19:46:40  (a -> r) -> r
19:46:54  monads, so contra
19:47:03  forall r. (((m a -> m a) -> m a) -> r) -> r
19:47:04  oerjan: help.
19:47:15  elliott: wat
19:47:31  oerjan: I was trying to figure out what a coroutine monad looks like because I'm really bored :P
19:47:36  ?unmtl ContT r t a
19:47:37  (a -> t r) -> t r
19:47:43  er
19:47:46  ?unmtl ContT r m a
19:47:46  (with fork :: CoroT m a -> CoroT m (), yield :: CoroT m ())
19:47:46  (a -> m r) -> m r
19:48:04  nothing boring like StateT [CoroT m ()] m ofc
19:48:50  elliott: just put zzo38 on it
19:48:56 * oerjan runs away
19:48:58  oerjan: ;___;
19:49:08  ...but yeah, I started off with
19:49:11  (m a -> m a) -> m a
19:49:26  where the argument is a sort of yield
19:49:28  you pass it a continuation
19:49:38  it context-switches to every other thread then calls the continuation you gave it once that's done
19:49:38  but
19:49:40  that doesn't work :'(
19:49:43  because you can't write fork
19:50:18  oerjan: btw did you see Simon Marlow breaking reddiquette :P
19:50:53  what, today?
19:51:20  in r/haskell?
19:51:28  yes
19:52:06  well i haven't gotten around to reddit yet.  also, laundry -->
19:54:21  Am I here?
19:55:06  'Twould seem not...
19:55:08 -!- Taneb has quit (Quit: Leaving).
19:55:21 -!- Taneb has joined.
19:55:27  Taneb: no
19:55:35 -!- Zuu has joined.
20:01:32  elliott: Why is glogbot not the most wildly popular logbot ever made?
20:01:54  'cuz it doesn't do mode changes.
20:02:05  elliott: But it does now!
20:02:16  Does it do nick changes?
20:02:29  elliott: Yup
20:02:36  (I think X-P )
20:02:40  (Oh, yes, it does)
20:02:42  Reassuring!
20:02:55  Hey, my memory is distinct from glogbot's quality >_>
20:04:04  I typed that before you said it did :P
20:04:11  ISTR something like quits were broken a while ago.
20:06:54  They were only very partially broken.
20:07:10  It was join->nick->quit that it didn't detect properly.
20:07:18  It detected the join and the nick, but not the quit.
20:14:31  I RETRUN
20:15:10  how retro
20:15:22  Heh, now even Adobe don't use Flash
20:15:54 -!- Phantom__Hoover has joined.
20:18:51 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds).
20:18:57 -!- derrik has joined.
20:22:52 -!- Aune has joined.
20:23:24  swede ho!
20:24:04  `? welcome
20:24:14  Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
20:31:59 -!- tiffany has joined.
20:33:47  Swo!
20:35:37 -!- GreaseMonkey has joined.
20:35:37 -!- GreaseMonkey has quit (Changing host).
20:35:37 -!- GreaseMonkey has joined.
20:37:41  NOW I remember why I hate PulseAudio so much.
20:37:47  BECAUSE IT FRIGGIN SUCKS
20:38:24  Why is mplayer stuttery and terrible through pulseaudio? And why is it that if I just have pulseaudio INSTALLED, anything that wants it will start it automatically without asking me? >_<
20:38:39  so how many programs do you hate for being too perfect?
20:39:13  Gregor: stop complaining and just uninstall pulseaudio then
20:39:24  olsner: I need it for remote audio >_<
20:39:37  olsner: So I have to install it when I want remote audio, then uninstall it when I don't :P
20:39:55  well you're already good at sandboxing...
20:40:08  Gregor: Just use JACK :P
20:40:15  elliott: JACK is SO FRIGGIN' DIFFICULT.
20:40:22  Gregor: Google a friggin' tutorial :P
20:40:27  elliott: I did! It didn't work!
20:40:34  Gregor doesn't know jack shit
20:40:44  yeah Gregor's a fucking moron
20:40:44  wait
20:42:01  elliott: That's it, I'm BANNING YOU ... from the logs ... or something.
20:42:17  X-D
20:42:34  logs without elliott, so useful
20:42:56  You might get a whole percent of the messages.
20:47:13  oerjan: did you know: Enum and Bounded are hard to use
20:47:50  aha?
20:48:39  > [minBound..maxBound] :: String
20:48:40    "\NUL\SOH\STX\ETX\EOT\ENQ\ACK\a\b\t\n\v\f\r\SO\SI\DLE\DC1\DC2\DC3\DC4\NAK\S...
20:49:11  boundedEnumElems :: (Enum a, Bounded a, Eq a) => Elems a
20:49:11  boundedEnumElems = go minBound maxBound
20:49:11    where go m n
20:49:11            | m == n    = Leaf m
20:49:11            | otherwise = Branch (go m mn) (go (succ mn) n)
20:49:12            where mn = pred . toEnum $ nv + ((nv - mv) `div` 2)
20:49:14                  mv = fromEnum m
20:49:16                  nv = fromEnum n
20:49:18  It doesn't wooooork :P
20:49:36  > [minBound,'Ø'..maxBound] :: String
20:49:37    "\NUL\216\432\648\864\1080\1296\1512\1728\1944\2160\2376\2592\2808\3024\324...
20:51:30  elliott: why not?
20:51:58  *Main> boundedEnumElems :: Elems Bool
20:51:58  Branch (Leaf False) (Leaf True)
20:51:58  *Main> boundedEnumElems :: Elems Test
20:51:58  Branch *** Exception: toEnum{Test}: tag (4) is outside of enumeration's range (0,3)
20:52:03  where Test is A | B | C | D
20:52:50  ah i guess the problem is if mn == maxBound?
20:53:06  yeah
20:53:13  I guess I could like compare mn to see if it's maxbound but uhhh
20:53:16  s/uhhh/ugggh/
20:53:25  oerjan: actually no
20:53:25  then you need Ord
20:53:35  oerjan: because the exception is on the first branch
20:53:40  which has no succ
20:53:45  and no, I don't, I can just use fromEnum >:)
20:54:35  You don't need Eq either, if you use fromEnum
20:54:36  oh hm
20:54:47  Deewiant: True
20:55:11  Thinking it might just be easier to do it with a -> [Bool]
20:55:32  elliott: itym where mn = pred . toEnum $ mv + ((nv - mv) `div` 2)
20:55:45  http://www.purdue.edu/IMPACTEARTH
20:55:46  oh hm
20:55:50  Wait this is from Purdue?
20:55:55  Where are the chickens?
20:55:59  oerjan: that produces an infinite tree for Test :P
20:56:19  Phantom__Hoover: Help I don't want to impact?
20:56:29  This is like Sburb but with a crappy loading screen.
20:56:42  elliott: oh i guess if they're 1 apart, it may fail?
20:56:49  oerjan: auugh why is this ugly
20:57:02  Phantom__Hoover: OMG CAN I IMPACT EARTH WITH A GIGANTIC MASSIVE ASTEROID
20:57:06  elliott: nv + ((nv - mv) `div` 2) is definitely wrong, anyway
20:57:14  Phantom__Hoover: X-D One of the options for diameter is "Humpback Whale".
20:58:20  Phantom__Hoover: :-( I was hoping I could watch it slam in.
20:58:23  BOOOOORIIIIIIING
20:59:19  elliott: should the pred . be there?
20:59:28  oerjan: istr it failed even more without it :) i can ermove it
20:59:47 -!- Taneb has quit (Read error: Connection reset by peer).
20:59:51  "The Earth is completely disrupted by the impact and its debris forms a new asteroid belt orbiting the sun between Venus and Mars.
20:59:51  100 percent of the Earth is melted
20:59:51  Depending on the direction and location the collision, the impact may totally change the Earth's rotation period and the tilt of its axis.
20:59:51  Depending on the direction and location of impact, the collision may cause a change in the length of the day of up to 38500000000000 hours.
20:59:52  The impact shifts the Earth's orbit totally."
20:59:56  Phantom__Hoover: "Day change: not significant"
21:00:04  FSVO not significant.
21:00:15  elliott: Day changed to no-such-notion :P
21:00:29  Gregor: It's just 38500000000024 hours long now.
21:00:57  "Transient Crater Depth: 2560000000 km ( = 1590000000 miles )"
21:01:06  elliott: try  where mn = toEnum $ mv + ((nv - mv) `div` 2)
21:01:21  oerjan: wow, it works :P
21:01:44  yay :)
21:04:01   Phantom__Hoover: X-D One of the options for diameter is "Humpback Whale". <-- what about bowl of petunias?
21:04:33  actually then it should be sperm whale, i think
21:05:01 * Gregor starts putting in ridiculous parameters.
21:05:07  A ball of iron the size of Jupiter ...
21:05:12  (i.e. a black hole)
21:05:25  It's hardly hitting the Earth then, is it?
21:05:28  Gregor: Pffft, I put like 1000000000 in all the fields :P
21:05:32  Also hmm.
21:05:39  It just basically says "There is no more Earth!"
21:06:03  would that actually be a black hole...
21:06:09  Jupiter's 70000km in radius.
21:06:40  "The Earth is completely disrupted by the impact and its debris forms a new asteroid belt orbiting the sun between Venus and Mars." yay
21:06:57  "Depending on the direction and location of impact, the collision may cause a change in the length of the day of up to 23.8 hours." lol
21:08:13  X-D
21:09:20  WA is misbehaving when I try to find the Schwarzschild radius of a ball of iron the size of Jupiter.
21:10:09  it is probably detecting that you are constructing a weapon of mass destruction
21:10:17  if you already know the size, what do you need the schwarzschild radius for?
21:10:34  olsner: to check if it would collapse into a black hole, duh
21:10:36  It's 16.8m; it's not a black hole.
21:11:00  sounds unlikely then
21:11:32  although it would probably collapse to some higher density than iron on earth :P
21:11:39  Not necessarily; it could still collapse.
21:12:38  And it's around five times the Chandrasekhar limit, so it would have to be a neutron star at least.
21:12:47  well but what is the total mass of this, is it more than a minimum size stellar black hole?
21:12:54  oh
21:13:31  Phantom__Hoover: What's the biggest ball of iron we can do? I want one.
21:13:41  hm what is the range of possible neutron star masses...
21:13:42  Depends on how you define 'iron'.
21:14:10  Is electron-degenerate iron counted? Then you can have anything up to the Chandrasekhar limit.
21:14:28  Waitwaitwait.
21:14:28  Argh.
21:14:33  Phantom__Hoover: No I want something that looks like iron ok.
21:14:36  I mistook grams for kilograms.
21:14:39  X-C
21:14:40  X-D
21:14:53  "In general, compact stars of less than 1.44 solar masses – the Chandrasekhar limit – are white dwarfs, and above 2 to 3 solar masses (the Tolman–Oppenheimer–Volkoff limit), a quark star might be created; however, this is uncertain. Gravitational collapse will usually occur on any compact star between 10 and 25 solar masses and produce a black hole."
21:15:00  It's around a fiftieth of the Chandrasekhar limit, so it'd be a white dwarf.
21:15:09  I... nearly wrote "white dorf".
21:15:12  X-D
21:15:23  Phantom__Hoover: oh.
21:15:44  Or it might even just be a ball of iron.
21:15:45  Phantom__Hoover: So what's the biggest non-vertically-challenged ball of iron
21:16:14  Not sure; I'm not good with degeneracy pressures.
21:16:30  Phantom__Hoover: OK well what's the biggest ball of iron you can think of that you're sure is of full stature.
21:16:50  http://en.wikipedia.org/wiki/Electron_degeneracy_pressure
21:16:53  this sounds... backwards
21:16:54  Well, that settles it!
21:17:07  oerjan, not really, stuff gets smaller as it gets heavier.
21:17:10  Phantom__Hoover: ANSWER MEEEEEEEEEEEEE
21:17:41  \varrho? What the hell?
21:18:23  Phantom__Hoover: THERE ARE FOLLOW-UP QUESTIONS
21:19:01  elliott, bang that into WA after s/m_e/mass of electron/, s/m_p/mass of proton/, s/rho/density of iron/, s/mu_e/1/
21:19:14  Oh, and s/h/Planck's constant/
21:19:37  Phantom__Hoover: I don't waaant toooo, mostly because Wolfram Alpha can't answer my follow-up question.
21:19:58  Sure, but I can answer it with the answer to the previous.
21:20:28  Well, it'd need another calculation, but that's just standard fluid pressure AFAIK.
21:20:39  Phantom__Hoover: Do you know what the next question is.
21:20:43  No.
21:21:28 -!- Ngevd has joined.
21:22:01  Phantom__Hoover: http://www.wolframalpha.com/input/?i=%28planck%27s+constant+%5E+2%29%2F%2820*mass+of+electron*%28mass+of+proton%29%5E%285%2F3%29%29*%283%2Fpi%29%5E%282%2F3%29*%28density+of+iron%29%5E%285%2F3%29 It fucked it up slightly I think, but I can't figure out how to fix it.
21:22:51  "A planet such as Jupiter has about the largest volume possible for a cold mass.[2] Add mass to Jupiter and the planet's volume, somewhat counter-intuitively, becomes smaller."
21:22:58  so yeah
21:23:19  http://en.wikipedia.org/wiki/Compact_star
21:23:52  Hmm, mu_e is the suspicious bit.
21:23:54  A rather limited subset of Minecraft could be considered a Linear Bounded Automaton
21:24:06  I say rather limited.
21:24:22  I mean, Turing-Complete enough for Wolfram to say it would be
21:24:23  It's theoretically possible to build a TM, I think.
21:24:34  it has been done, I think
21:24:39  Given procedurally-generated terrain
21:24:49  Erm, *circuitry.
21:25:02  The trick is to stick the player in a minecart and use them to load the tape.
21:25:06  Phantom__Hoover: Also its parenthesisation.
21:25:21  I don't think 20(m_e m_p)^5/3 is right.
21:26:05  http://www.wolframalpha.com/input/?i=%28planck%27s+constant+^+2%29%2F%2820*mass+of+electron*%28%28mass+of+proton%29^%285%2F3%29%29%29*%283%2Fpi%29^%282%2F3%29*%28density+of+iron%29^%285%2F3%29
21:26:22  http://scienceworld.wolfram.com/physics/ElectronDegeneracyPressure.html
21:27:02  Deewiant, thank, you are a helpful person.
21:27:28  Deewiant: Thank, you are a helpful person.
21:27:41  `learn Finns are helpful, albeit grossly overpopulated (cf. 'Finland').
21:27:43  I knew that.
21:28:12  (fizzie is helpful, and oko is helpful in an oko way.)
21:28:47  The two towns with the most esolangers are Helsinki and Hexham.
21:28:59  We should get twinned or something.
21:29:06  Phantom__Hoover: So do you know the answer now.
21:29:08  oko's not from Helsinki.
21:29:11  Can I ask
21:29:12  my
21:29:14  follow up question
21:29:24  Not yet.
21:29:48  cry
21:30:15  Phantom__Hoover, that makes EVEN MORE PEOPLE FROM HEXHAM RELATIVELY
21:30:20  Hang on.
21:30:35  Is there anybody other than Phantom__Hoover from the Edinburgh area on this channel?
21:30:50  No.
21:30:51  no
21:30:55  Good.
21:30:55  at least nobody who talks
21:31:06  How about Gregoria?
21:31:23  gergoria
21:31:44 * Phantom__Hoover realises that working out the mass from that pressure is non-trivial.
21:31:47  Follow-up anyway.
21:31:54  West Lafayette, Indiana
21:32:17  Phantom__Hoover: What would happen if we flung it at the Earth.
21:32:30  I could have answered that anyway!
21:32:38  NOT MY FAULT YOU GOT ME TO TYPE IN EQUATIONS
21:33:08  (The answer is 'sploosh'.)
21:33:19  That's
21:33:22  Not a satisfactory answer Phantom__Hoover
21:33:34  Phantom__Hoover: OK wait what if we just sort of glided it to the earth.
21:33:41  At, like, 1 m/s.
21:33:51  Sploosh.
21:34:01  Phantom__Hoover you are so bad.
21:34:25  At those scales, it's basically the same as throwing blobs of water at each other in zero gravity (im good analgogy).
21:35:12  Phantom__Hoover: OK but how close would it have to get before fun started happening on Earth (assuming the 1 m/s thing).
21:35:42  Quite far.
21:36:03  Phantom__Hoover: Duuude you suuuuck.
21:36:14  i was interpreting that sploosh as more the kind of insect on a windshield thing.
21:36:24  where earth, in this case, is the insect.
21:36:48  And then the ball of iron's windscreen wipers smudge us.
21:36:54  But Helsinki and Hexham... BOTH BEGIN WITH 'H'
21:37:01  Is there anyone from the Hague here?
21:37:04  Okay now I'm imagining a perfectly spherical ball of iron just sort of gliding through the heavens with enormous windscreen wipers.
21:37:06  Hexsinki.
21:37:22  hondtreim here
21:37:30  How can it have windscreen wipers if it's perfectly spherical?
21:37:42  Phantom__Hoover: advanced alien technology.
21:38:01  Phantom__Hoover: They're just regular car windscreen wipers but curved.
21:38:04  Phantom__Hoover: actually, a perfect sphere is reasonably easy to windscreen-wipe
21:38:14  They only wipe the front bit.
21:38:18  (The bit that's going forwards.)
21:38:19  Yeah, but they interfere with the sphericality.
21:38:26  Phantom__Hoover: They aren't part of the sphere.
21:38:27  They're just attached.
21:38:43  Oh.
21:38:44  How?
21:38:50  Magnets
21:38:51  Phantom__Hoover: advanced alien technology.
21:38:57  (Magnets don't count; they'd cause a distortion in the sphere.)
21:39:00  Phantom__Hoover: I don't know, how are they attached to cars?
21:39:06 * elliott genius.
21:39:17  elliott, cars aren't perfectly spherical.
21:39:21  elliott: advanced alien technology.
21:39:27  Phantom__Hoover: Okay, now I'm laughing.
21:39:37  (toyota is secretly grey operated)
21:39:46  Phantom__Hoover: OK it's perfectly spherical apart from a little indent where the wipers are attached, happy?
21:39:56  `addquote  elliott, cars aren't perfectly spherical.
21:39:58  715)  elliott, cars aren't perfectly spherical.
21:40:09  elliott, yes.
21:40:12  Sticky glue?
21:40:14  But SCIENCE isn't.
21:40:26  As opposed to non-sticky glue
21:40:34 * Phantom__Hoover wishes he'd set fire to that insect food in chemistry today just before the fire alarm went off.
21:40:40  Phantom__Hoover: Why amn't science hapey.
21:40:53  I missed the opportunity for the best moment of my life.
21:40:59  elliott: because gramer
21:41:00  X-D
21:41:07  elliott, becuase is 21th sentry.
21:41:09  sory, speeling
21:41:12  Phantom__Hoover: :(
21:41:22  oerjan: *becuase
21:41:43  elliott: you didnt misple why
21:42:25  oerjan: I misspelled wyh just fine.
21:43:59  O QUAY
21:44:17  Quay is pronounced similar to "key".
21:44:38  oak quay
21:45:11  i no i couldnt fine any homonyms of kay
21:45:44  homofones
21:45:52  Wiht a "ph"
21:46:07  homofun, o qi
21:46:11  O god, r we goan to degenerate in2 thi style of Bascule the Teller?
21:46:17  Yuo probly no tihs arleayd
21:46:26  NOOOO
21:46:45  hoos bascule the teller
21:46:55  The
21:47:07  The A-level pass rate is 97.8%.
21:47:10  I don't even.
21:47:23  Grade boosting
21:47:30  I get that.
21:47:31  o dat buk
21:47:37   O god, r we goan to degenerate in2 thi style of Bascule the Teller?
21:47:39  Gone wild.
21:47:58  Phantom__Hoover: Turns out my mind has been permanently warped by "i"s close to 2s.
21:48:02  fuck thii2 2hiit.
21:48:20  Phantom__Hoover: Although it dissonantly reacted by my zzo38 detector triggering on "O".
21:48:21  2ollux the teller
21:48:31  i2 dat 2o
21:48:40  oerjan: YUO'RE DOING IT WRONEGE ;____;
21:48:49 * elliott cry
21:49:15 * oerjan i22e2pon2ible
21:49:26  Issessponsible.
21:49:37  me too
21:49:43  *Issesponsible.
21:49:46  oerjan: you have to duplicate your "i"s ok ;__; doing otherwise is issesponsible
21:50:09  iif u 2ay 2o
21:50:28  That would be really scary if not for the "u".
21:50:32 * Phantom__Hoover notes that Higher pass rates have climbed in the past too, is confuse.
21:51:13  Phantom__Hoover: they probaly wrap wen hiting 100%
21:51:35 -!- derdon has quit (Remote host closed the connection).
21:52:32  "they"
21:53:07  elliott: Pointing out the only correctly-spelled word? :P
21:53:12  elliott: (But "wrap" is write too!)
21:53:15  Gregor: You mean: the only error.
21:53:18  Oh, damn.
21:53:25  NOTE JOKE IN LAST MESSAGE
21:53:27  LAUGH LAUGHABLY
21:53:30  http://en.wikipedia.org/wiki/Magnetic_circuit
21:53:38  Wow, you can make magnetic circuits?
21:53:51  Phantom__Hoover: *brain explodes*
21:54:13  Eh, it's shaping flux lines.
21:55:03 -!- tiffany has quit (Read error: Connection reset by peer).
21:55:39 -!- tiffany has joined.
21:58:13  I'm going to do some more work on Salesman
21:58:28  By which I mean completely changing all the commands for the fourth time
21:58:58 -!- augur has quit (Remote host closed the connection).
21:59:37  oerjan:
21:59:39  boundedEnumToBits :: (Enum a, Bounded a) => a -> [Bool]
21:59:39  boundedEnumToBits a = go (fromEnum (minBound `asTypeOf` a)) (fromEnum (maxBound `asTypeOf` a)) (fromEnum a)
21:59:39    where go :: Int -> Int -> Int -> [Bool]
21:59:39          go m n v
21:59:40            | m == n  = []
21:59:42            | v <= mn = False : go m mn v
21:59:44            | otherwise = True : go (succ mn) n v
21:59:46            where mn = m + ((n - m) `div` 2)
21:59:48  help it's ugly :(
22:00:14  Rewrite it in C.
22:00:19  hmm, is there any project whose name starts "ya" as an acronym/initialism/abbreviation for "yet another", but is the first project doing what it does?
22:00:21  Gregor: lol
22:00:43  ais523: X-D
22:00:49  ais523: yapwnsyaaaiafyabitfpdwid
22:01:07  @ = yapos
22:01:31  yaaa
22:01:37  yamlpopl -> Yet Another My-Little-Pony-Oriented Programming Language
22:02:30  ais523: Those were funny >:(
22:02:53  A Salesman implementation must be able to solve the Travelling Salesman problem MULTIPLE TIMES during the course of execution
22:03:01  elliott: you highlighted me earlier
22:03:07  along with the rest of the channel
22:03:08  Nisstyre: No, you must be mistaken.
22:03:35  I am not
22:03:38  I have a record of it here
22:03:49  ais523: Better ban me.
22:04:06  Gregor: Have you removed the line from the logs yet???
22:04:28  elliott: ALL THE LINES
22:04:33  Thx!
22:04:51  you highlighted me and many other at precisely 12:53 Wednesday November, 09 2011 EST
22:05:06  anyway
22:05:07  your Haskell looks ugly :P
22:05:10  Precisely? So, not another second passed?
22:05:17  Not another femtosecond?
22:05:21  name your goddamn variables properly
22:05:35  Those variables are perfectly well named.
22:05:36  mnvmnvmnvmnvnvmnvmnvn
22:07:25  elliott: sorry, I was out taking a phone-call
22:07:46  ais523: What are we meant to do when we need someone banned urgently?
22:08:43  WEP
22:08:55  hi oerjan "wep" oerjan
22:09:22  AN NASHING OF TEITH
22:09:36  hi
22:09:37  ban me
22:09:41  elliott: ask #freenode?
22:09:52  ais523: hmm... I'll give it a shot
22:11:30  Oooooh, now I'm curious who needs urgent banning.
22:11:35  (And from where)
22:11:50  Me.
22:11:51  From here.
22:12:25  ida taut itwas obivus
22:12:48 -!- Ngevd has quit (Ping timeout: 245 seconds).
22:23:40  Argh, how long until I go to university and get journal access.
22:24:07 -!- Ngevd has joined.
22:27:14  Damn, I just realised Salesman is gonna have to simulate a basic economy
22:27:35  Is this the travelling salesman problem taken to the next level?
22:27:51  This is getting pretty complicated
22:28:17  Yes
22:28:22  As an esolang
22:28:27  What, really?
22:28:28  elliott, did you ever come up with your version of Brook?
22:28:29  Awesome.
22:28:55  With dynamic graph-changing
22:29:33  But it's a complete graph which is by default Cartesian
22:30:12  It's possible to change arc weights, but only by doubling them or halving them (may change that)
22:33:10  Thing is, in Salesman, the salesman actually buys and sells things
22:33:10  It may have multiple commodities
22:33:47  It is going to be so damn complicated
22:36:16 -!- Aune has quit (Quit: Lmnar).
22:36:20  Minecraft has made me view all trees as ridiculously slender.
22:36:51  Aww, now you got me thinking about Slender Man
22:37:55  Well, goodnight
22:38:06  Phantom__Hoover: XD
22:38:08 -!- Ngevd has quit (Quit: ...).
22:38:25  well, I need to sleep, night →
22:38:32  `addquote  Minecraft has made me view all trees as ridiculously slender.
22:38:34  716)  Minecraft has made me view all trees as ridiculously slender.
22:40:17 -!- boily has quit (Ping timeout: 258 seconds).
22:41:29 -!- sebbu3 has joined.
22:41:29 -!- sebbu3 has quit (Changing host).
22:41:29 -!- sebbu3 has joined.
22:42:27 -!- sebbu2 has quit (Ping timeout: 240 seconds).
23:00:13  THE COURT: You don't want to get me started on this. You big companies do not own the U.S. District Court. So, yes, you can have your protective orders, but when it comes to a public hearing, I'm not going to have to resort to Morse Code to understand what you are trying to tell me.
23:00:17  that's a neat putdown
23:10:05  heh
23:12:25  (that's from Oracle vs. Google, against an Oracle lawyer)
23:12:56  yeah, that judge is pretty awesome
23:12:59 -!- Rod56 has joined.
23:13:38  I get the feeling from reading the rest of the trial that the judge thinks both sides are bullshitting him
23:13:45  also, that he is quite probably correct
23:13:48  yeah
23:14:31  Argh, mplayer isn't working.
23:16:55  ais523: wow, you mentioning that made me look at groklaw for the first time in years, which lead to me finding out that the original editor retired from it
23:17:03  that's weird, feels like a universal constant changing
23:17:14  elliott: you missed PJ retiring? wow
23:17:23  ais523: I don't read Groklaw :)
23:17:25  she still turns up now and again, especially if SCO are doing things
23:17:42  but it's mostly written by Mark, who not only claims to be a lawyer, but obviously /is/ one from the way he talks
23:18:10  heh
23:19:21  ais523: what's the current state of SCO, btw?
23:19:34  elliott: they sold pretty much everything they had to various shady companies
23:19:45  and then tried to resume their litigation against IBM, believe it or not
23:19:48  ais523: :D
23:19:54  did it work?
23:19:55  they tried to not resume IBM's counter-litigation against them at the same time
23:20:04  I'm not sure
23:20:11 * Phantom__Hoover → sleep
23:20:12 -!- Phantom__Hoover has quit (Quit: Leaving).
23:20:16  I think they haven't heard back from the judge yet, who is probably still laughing
23:20:24  ais523: SCO's lawyers were paid upfront or something, right?
23:20:28  ISTR something like that
23:20:36  yes, they were
23:20:40  and are probably regretting that
23:20:41  :D
23:21:08  I think the only reason they haven't just defaulted is to prove to other potential customers that if they're hired for something, they'll go through with it no matter how stupid it is
23:21:14  ooh, they renamed themselves!
23:21:19  who, SCO?
23:21:22  yep
23:21:27  I don't think so
23:21:29  to... TSG Group, Inc.... so they're The SCO Group Group, Inc.
23:21:31  ais523: http://en.wikipedia.org/wiki/SCO_Group
23:21:38  oh, wow, I forgot about that
23:21:47  The Santa Cruz Operation Group Group, Incorporated
23:22:03  *Operations
23:22:22  ais523: I don't think so? at least Wikipedia says it's Operation
23:22:28  perhaps
23:22:34  my memory is shaky
23:22:36  it's still laughing too
23:22:40  See also: Caldera OpenLinux and The Santa Cruz Operation
23:22:40  [edit]The Santa Cruz Operation (SCO)
23:23:02  The SCO website now gives details of a new appeal against Novell, Inc, dated September 9, 2010 and presumably lodged with the United States Court of Appeals.
23:23:11  oh, there's more info below
23:23:17  SCO filed amendments to their certificates of incorporation on 15 April 2011. The SCO Group, Inc. was renamed TSG Group, Inc., and SCO Operations, Inc. became TSG Operations, Inc.[4]
23:23:18  On 30 August 2011, the United States Court of Appeals for the Tenth Circuit affirmed SCO's loss to Novell in the second jury/bench trial.[70] SCO's appellate brief had argued that there were evidentiary errors and other issues at trial. The affirmed verdict held that Novell did not transfer the UNIX copyrights to SCO in the amended asset purchase agreement, and that Novell has the right to waive certai
23:23:18  n alleged license violations.
23:23:23  hmm, so it's over?
23:25:21  elliott: SCO can theoretically appeal to the supreme court, but they haven't tried
23:28:08 -!- Rod56 has left.
23:29:24  bye Rod56
23:31:37  hmm, this feels like interproject limbo :/
23:31:58  elliott: what does?
23:32:06  this not coding anything :)
23:32:24  but you have plenty of projects
23:32:27  Kitten, for instance
23:32:38  indeed
23:32:51  unfortunately, they're swapped out to disk
23:32:55  and the scheduler isn't looking at them
23:33:22  you're the scheduler?
23:33:48  ais523: if I say yes, will you think that means I have control over it?
23:33:53  I uninstalled scheduler long ago and switched to procrastinator
23:33:59  elliott: I'm not sure
23:34:21  oh no
23:34:23  oh /no/
23:34:29  oh /NO/
23:34:37  olsner: my scheduler did that all by itself.
23:34:37  I think I've figured out what's happening
23:34:43  with what?
23:34:49  my scheduler is swapping out all currently active processes
23:34:58  because the next one it'll switch to
23:35:00  is @
23:35:26  oh no
23:35:35  is @ as disastrous as Feather?
23:35:46  I thought feather too
23:35:50  ais523: I don't /know/, it's only ever run as a background task
23:35:54  the black holes of vaporware
23:36:25  ummm, someone give me something really interesting yet surprisingly easy to do, it's the only thing that can stop this
23:36:43  elliott: write an optimizing parser for C
23:36:53  ais523: an /optimising/ parser?
23:36:55  yes
23:37:16  a parser that optimizes itself?
23:37:19  ais523: go on :)
23:37:20  I suppose you could at least do constant-folding in the parse
23:37:31  possibly even dead code elimination
23:37:57  ouch
23:38:03  that doesn't sound fun _or_ easy :)
23:38:17  @ time
23:38:21  elliott: hmm
23:38:28  different language, then
23:39:31  project "try and get interested in working on my current projects first": failed
23:39:39  something has gone horribly wrong :(
23:40:09  elliott: hmm… write a Scheme impl in JS
23:40:22  I've already done that :)
23:40:35  I think writing more JS code would be very bad for my health
23:40:45  js impl in scheme; get them to run each other
23:41:05  monqy: they would cry
23:41:14  in harmony
23:41:21  scheme because
23:41:22  js is horrific
23:41:24  js because
23:41:26  it can never truly be scheme
23:41:41  JavaScheme
23:41:49  jeme
23:42:27 -!- derrik has quit (Quit: left).
23:42:44  write an optimizing parser for ... malbolge.
23:43:03  oerjan: thanks: now i just want to give up on computing altogether
23:43:16  ME GO TOO FAR
23:43:40  wait
23:43:44  i can think of something
23:43:47  that might work
23:43:59  however
23:44:06  it relies on me having a recent enough copy of it
23:45:04  2011-03-09.txt:19:30:24:  elliott@elliott-MacBookAir:~/Code/sixth$ make >/dev/null; wc -c sixth.o
23:45:04  2011-03-09.txt:19:30:24:  75 sixth.o
23:45:04  2011-03-09.txt:21:31:02:  81 sixth.o
23:45:05  that's a start
23:45:08 * oerjan suddenly wonders if feather supports concurrency
23:45:33  oerjan: I don't see why not
23:45:37  probably lock-step
23:45:57  um i meant something _not_ lock-step
23:46:35  2011-09-03.txt:01:51:37:  also, I still have the code for that boot sector Forth...
23:46:36  work with me here :'(
23:46:57  2011-03-12.txt:09:01:17:  I think si/di are free, it's just a boot sector. But it's tiny, so I don't really care that much :P
23:46:58  waht
23:47:14  ... my graphics card has an audio card.
23:47:17  oerjan: I don't think race-conditiony-concurrency is possible
23:47:19  My graphics card ... has an audio card.
23:47:29  MY GRAPHICS CARD HAS AN AUDIO CARD *brain explodes*
23:47:29  those are some weird animals http://www.dagbladet.no/2011/11/09/nyheter/utenriks/romfart/astrobiologi/dyrenesnyheter/18952143/
23:47:58  Gregor: your what has a what now?
23:48:10  olsner: my GRAPHICS CARD has an AUDIO CAAAAAAAARD
23:48:22  your audio card has a smell card but you cannot detect it *MWAHAHAHAHA*
23:49:05  2011-05-17.txt:17:19:05:  I think all it does is listen to conversation by the actual elliott and relay back and forth
23:49:05  wat
23:49:13  context?
23:49:18  2011-09-15.txt:02:44:51:  Some researchers put forth the thesis that monads could help with concurrency. At this point, it looks like their thesis has failed.
23:49:18  wat
23:49:21  ais523: i dunno :D
23:49:48  Bears etc. stranded in space
23:49:55  wow, I never made sprunge pastes in here in 2011-{03,04,09}
23:49:56  that's
23:49:59  really inconvenient
23:50:01  oh wait
23:50:02  oerjan: maybe he can get fnarf feedback
23:50:05  yes i did :>
23:50:20  [elliott@dinky esoteric]$ grep -ri --color=always 'elliott.*sprunge\.us/' 2011-0{3,4,9}-??.txt | wc -l
23:50:20  104
23:50:22  here goes nothing
23:50:29 -!- sllide has quit (Ping timeout: 256 seconds).
23:52:02  I love bears etc.. They are super cute!
23:52:04  (to microscopic animals to be)
23:52:07  http://sprunge.us/fhXB ouch
23:52:25  monqy: i think the english name is tardigrade
23:52:28  yes
23:52:36   I love bears etc.. They are super cute! <-- referring to hairy gay men
23:52:43   (to microscopic animals to be) <-- referring to his sperm
23:53:09  Gregor, master of interpretation
23:53:48  monqy: do you remember news-ham
23:53:55  yes
23:53:59  zeptobot too
23:54:01  elliott: was the hyphen part of the name?
23:54:10  to distinguish news-ham from newsham
23:54:11  also, why isn't monqy from Hexham? his name sounds like he should be
23:54:14  ais523: yes, obviously; newsham owned newsham
23:54:19  monqy: they were different people?
23:54:19  `addquote  also, why isn't monqy from Hexham? his name sounds like he should be
23:54:21  717)  also, why isn't monqy from Hexham? his name sounds like he should be
23:54:25  ais523: newsham was a person
23:54:28  news-ham was my bot
23:54:31  ah, aha
23:54:32  news-ham - any relation to new-sham?
23:54:33  how confusing
23:54:37  ais523: a _complete_ coincidence, I assure you!
23:54:44  newsham just stole the name of the fine news-dispensing ham IRC bot.
23:54:52  why would i be from hexham
23:55:00  because you're called monqy
23:55:04  how is it pronounced, anyway?
23:55:09  http://sprunge.us/GhYf news ham code (sometime before I added non-bbc feed support)
23:55:09  is that a hexham thing
23:55:09  monqy: if you're not from finland you're from hexham
23:55:13  like "monkey", or slightly differently?
23:55:15  it's so short :')
23:55:40  monqy: note that the "you" in olsner's statement applies to you specifically
23:55:43  not to people in general
23:56:00  aha, http://sprunge.us/OYVO is one of the latest versions
23:56:03  elliott: what language is that? golfScheme?
23:56:07  ais523: picolisp
23:56:25  the generic rule is not that much more complicated though
23:56:39  esolang idea: a language that isn't sexp-based, but looks visually the same as Lisp
23:57:21  what exactly did news-ham do? and why isn't it here atm?
23:57:30  i haven't really decided what pronunciations for "monqy" are acceptiable
23:57:35  http://sprunge.us/eXiM god, I forgot how lovely this thing is
23:57:51  I was not expecting that
23:57:51  ais523: It was the world's least interesting non-ham-related news bot.
23:57:58  ais523: whenever you pinged it, or said "what are the haps my friends", it'd give you a random recent BBC news topic
23:58:13  that sounds surprisingly useful for a #esoteric bot
23:58:18  ais523: you could also specify various topics which it would filter the result to (basically whatever BBC's feeds had, plus the Onion, plus a few other things) :P
23:58:19  oh, it had reddit too
23:59:25  http://warpdrive.se/9473 hilarious

2011-11-10:

00:00:51 -!- tiffany has quit (Quit: nyu~).
00:06:07  oerjan: hmm. oh no.
00:06:46  oerjan: i may have
00:06:47  lost
00:06:47  the
00:06:48  code
00:06:49  :'(
00:06:56 -!- copumpkin has quit (Ping timeout: 260 seconds).
00:06:58  ais523: write on my tombstone "killed by @", please
00:07:11  elliott: don't be so hasty; you /might/ survive
00:07:22  pfffft as if
00:07:47  I think I've ended up wiping the backup with the forth
00:07:55  so I'll have to find the latest sprunge of it and re-fix that bug
00:10:40 -!- copumpkin has joined.
00:12:45  elliott will survive forever, being ironically saved by a liver transplant from a kurzweil having a tragic accident.
00:13:08  X-D
00:13:30 -!- augur has joined.
00:25:45  [elliott@dinky esoteric]$ for x in $(grep 'elliott>.*http://sprunge\.us/' 2011-0{3,4,9}-??.txt | sed 's/.*\(http[^ ]\+\).*/\1/g;'); do if curl -sS "$x" | grep -c 'push 0xB800' >/dev/null; then echo "$x"; fi; done
00:25:46  here goes
00:26:02  ais523: behold ^
00:26:04 -!- oerjan has quit (Quit: Good night).
00:26:16  elliott: that is indeed beholdable
00:26:28  what, um, does it do?
00:27:06  the existence of the special-cased months, and the curl invocation, means it's a bit hard to figure out
00:27:19  and I can't remember what B800 does
00:27:26  ais523: goes through sprunge pastes I made in 2011-{03,04,09} and prints out the ones that contain "push 0xB800", which was one of the first lines of my Forth bootsector code
00:27:40  ah, I see
00:27:59  hmm, I mentally read that number as "B800", with a sort of hexadecimal flavour to it
00:28:00 * elliott tries "bits 16", that should be 100% reliable
00:28:07  I don't mentally pronounce the "0x" unless I'm thinking about it
00:28:10  that is, B 8 hundred
00:28:15  ais523: heh
00:29:14  no additional results :/ guess I'll trawl through 2011-{04,05} to find where and how i fixed the bug
00:31:41  2011-04-13.txt:20:38:21:  i came here because olsner has a big mouth and elliott has a small forth
00:31:46  olsner: speaking of that, do you have a copy of it
00:34:24 -!- MDude has quit (Read error: Connection reset by peer).
00:34:41 -!- MSleep has joined.
00:36:14  2011-04-24.txt:19:19:51:  well that forth almost has a compiler now :D
00:36:15  hmph
00:36:23  i'm not going to rewrite that thing, it was long
00:36:40  ais523: looks like @ it is
00:43:56  monqy: pikhq: olsner: You're hired.
00:44:38  elliott: http://www.groklaw.net/article.php?story=20111104202226210 is the article about SCO vs. IBM reopening
00:44:47  it's 6 days old
00:44:48  ais523: ah, thanks
00:45:04  "SCO has once again filed an inadequately redacted document, so I've pulled the PDF until they replace it"
00:45:06  Aww. :(
00:45:36  ais523: hmm, why are they still calling themselves SCO if they're TSG now?
00:45:50  they call everything SCO
00:45:54  in an attempt to confuse people
00:45:54  haha
00:46:05  SCO vs. SCO (IBM)
00:46:28  well, they did get IBM's name wrong first time they sued them
00:46:31  and had to try again
00:46:41  (they gave the place of incorporation incorrectly)
00:46:42  "Didn't UnXis also get the SCO Group name? In the SCO bankruptcy filings since the sale, the entity formerly known as The SCO Group calls itself TSG. But UnXis *didn't* get the litigation against IBM. It's listed on the Excluded Assets. So who exactly is this asking to reopen the IBM litigation now? The filings say it's "The SCO GROUP, INC., by and through the Chapter 11 Trustee in Bankruptcy, Edward N
00:46:42  . Cahn." Maybe the lawyers forgot themselves that they need to change the name. They can do that later, I suppose, but it's odd to anyone like me, who actually keeps track of the details."
00:46:45 * elliott cries.
00:48:04  hmm, slicehost's emails to me are getting depressing
00:48:11  are you still on slicehost?
00:48:15  no :)
00:48:21  and if not, are they trying to persuade you to come back?
00:48:36  this one's signed "The Rackspace Team", and is about them discontinuing almost all their linux images
00:48:41  ais523: considering you can't order new slices, I doubt it
00:48:51  or, hmm, maybe you can if you already own an account
00:49:10 -!- ais523 has quit (Remote host closed the connection).
00:49:14  ais523: but yeah, rackspace have been in the process of engulfing it completely over the last few months, really slowly
00:49:15  argh
00:57:55 -!- elliott has changed nick to qwrji0j0qiwejioi.
00:58:00 -!- qwrji0j0qiwejioi has changed nick to elliott.
01:04:05  Gregor: Yooooooo how's cunionfs :P
01:04:28 -!- MSleep has changed nick to MDude.
01:04:34  elliott: Unchanged!
01:04:51  Gregor: Wooooooooooooooo
01:07:33  Gregor: Did Kernel Modules for Dummies not work out :P
01:13:24  elliott: Nope, I ordered The Idiot's Guide, we'll see how that goes.
01:13:48  Gregor: Awesome.
01:14:11  Gregor: See, without the unionfs component, the only thing I can work on is the hard stuff, like a parser, evaluator, GC.
01:14:20  So I haaaaate you for making me not do the easy stuff.
01:14:25  Maybe I'll focus on the download progress bars some more.
01:17:56  Have I mentioned recently that my graphics card has an integrated audio card?
01:17:59  'cuz I feel it needs to be said.
01:18:08  Gregor: Yes. Use it to implement cunionfs! That will work.
01:18:15  Gregor: Also, does it give you double audio.
01:20:08  Well yeah, the motherboard has an audio card too.
01:21:51  Gregor: Sell it to audiophiles.
01:25:41 -!- pikhq has quit (Ping timeout: 260 seconds).
01:25:51 -!- copumpkin has quit (Ping timeout: 276 seconds).
01:30:24 -!- copumpkin has joined.
01:36:57 -!- zzo38 has joined.
01:39:49  I found my name is now on the Hackage but they didn't sent the password. It is because the system administrator accidentally made a mistake and blocking all incoming connections to their firewall (that meant they couldn't receive their own messages, either). But they fixed it yesterday, and I sent them another message to tell them it is hopefully fixed now. Tomorrow I can check.
01:40:10  hoorj
01:40:24  Server maintenance: The greatestest?
01:42:58  oh hey another brainfuck equivalent
01:43:14  YESSSSSSSSS
01:43:19  We need more minor rewrites of BF!
01:44:48  Wordfuck (also known as Natural BF-based language with common instructions and syntax of that language, or just NBFBLWCIASTL) is a language created by User:Marcsances identical to Brainfuck, except the way to write statements. That makes of Wordfuck even more difficult than Brainfuck (if you want to write beautiful programs, if not, it's just as easy as Brainfuck, but longer).
01:44:49  Gregor: monqy: argh this one is annoying because i need to extend my bf-defining metalanguage to support it
01:44:55  :(
01:44:57  since it's based on length, not direct textual substitution
01:45:12  omg
01:45:14  monqy: what if
01:45:21  monqy: i make my metalanguage
01:45:22  just brainfuck
01:45:27  omg
01:45:27  you just write a language->bf compiler in bf
01:45:28  and that
01:45:28  is
01:45:31  :')
01:45:33  beautiful
01:45:44  also i have to leave?? haha school
01:45:44  i am bad
01:45:48  school more like
01:45:49  "drool"
01:45:52  "on your self"
01:45:53  "because"
01:45:54  "school sucks"
01:45:55  :'(
01:46:04  "and because yu are dumb"
01:46:04  "for
01:46:05  "
01:46:07  "schole"
01:46:12  just kidding monqy you are coles
01:50:10  Stay in school, kids!
01:50:18 * Gregor gets out his acoustic PSA guitar.
01:50:43  "st ay in school or you will be like Gregor and no cunionfs will ever be yours"
01:50:46  *tm))
01:50:54  School is cool, when you learn you rule! More bad puns because PSA's are cruel!
01:57:14  Is elliott in school?
01:57:15 * shachaf finds elliott's time zone habits a bit mysterious.
01:57:32  Watch as they become even more mysterious:
01:57:33 -!- elliott has quit (Quit: !).
01:59:59 -!- sllide has joined.
02:07:28 -!- TeruFSX has joined.
02:09:45 -!- Sgeo|web has joined.
02:13:25 -!- pikhq has joined.
02:15:50 -!- copumpkin has quit (Quit: Computer has gone to sleep.).
02:21:46 -!- pikhq has quit (Ping timeout: 240 seconds).
02:21:48 -!- pikhq_ has joined.
02:25:11 -!- sllide has quit (Read error: Connection reset by peer).
02:33:34 -!- hagb4rd has joined.
02:41:11 -!- copumpkin has joined.
02:41:16 -!- copumpkin has quit (Changing host).
02:41:16 -!- copumpkin has joined.
02:49:25 -!- elliott has joined.
02:51:41  Gregor: So on thinking about it (= procrastinating more on the harder parts of the package manager), I'm pretty sure that the ideal solution for atomic branch-switching for me would be anything that lets me trivially emulate the following: "Have a process tree all set to source their branches from a file. The file is re-read, and every process in the tree switched to the new branches simultaneously, upon writing to a special file."
02:52:01  (A way to simply update the tree with a new branch list atomically without actually involving the file path in the cunionfs stuff qualifies as trivial emulation.)
03:10:27  Another way to make Wordfuck variation, is, punctuation doesn't count, and word with 1 letter means to ignore this word and the next one, word with more than nine letters you put the digits according to the number of letters in the word and do the command according to their decimal digits.
03:10:57  The way the example does the words not very good. Maybe the variation way writes proper wording instead.
03:14:24  For the article about Lenta, I think either the instructions is wrong or the example is wrong, because it says $ move left but you have to move right to start the program given in the examples.
03:14:43 -!- madbr has joined.
03:16:16  hmm, had an interesting idea for a CPU architecture
03:16:38  madbr: OK. What is your idea?
03:17:02  probably ends up being similar to how out of order cpus work
03:17:13  anyways
03:17:37  a cpu with 2 modes: "RISC" mode, and what could be called "dataflow" mode
03:18:14  risc mode works just like any other architecture and is used for all the non-performance sensitive code
03:18:59  ie anything that's probably not going to be in code cache and/or does lots of memory access so it's not going to be faster than 1 op/cycle anyways
03:20:10  dataflow mode is used for small loops that churn lots of data, like say a memcopy for instance, or a sound mixing loop
03:20:49  sets up the cpu as ~30 ALUs, each leading to one register
03:21:48  on each cycle, each of the ALUs read 1 or 2 values from the other registers, performs a math op on it, and next cycle its register will take the resulting value
03:22:10  how does memory interact with that
03:22:17  i.e. how does that let you do memcpy
03:23:14  one of the ALU ops is "load from address", will probably be only available on few of the units, and probably stall everything else on cache misses
03:23:15 -!- olsner has quit (Ping timeout: 240 seconds).
03:24:35  some of the units will probably also be writing units, not doing any math ops but taking an adress and a value and writing there
03:27:21  memcpy is pretty simple so it would probably look something like this:
03:27:21  r0 = r0 + 4
03:27:21  r1 = r1 + 4
03:27:21  r2 = load [r0]
03:27:21  rWrite: [r1] = r2
03:29:05  obviously r2 will lag a cycle behind r0 so some mechanism has to be added to deal with that
03:30:37  for algos larger than the number of units, some kind of "multi cycle" mechanism would have to be used, where the operations for each unit are cycled around
03:32:07  so basically it's somewhere between a VLIW processor and some kind of mini-FPGA
03:35:39  elliott: Oooh. Oooh. @ gets really cheap memcpy basically for free.
03:35:52  pikhq_: Hmm, howso?
03:36:00  Rewrite the page table.
03:36:15  haha nice
03:36:17  Do "normal" memcpy for first/last ~4k if necessary.
03:36:18 -!- olsner has joined.
03:36:31  pikhq_: That, um, might do badly if anyone mutates it :P
03:36:38  Admittedly, this is nothing unique to @, but it'd be much *easier* to pull off in @ than in UNIX.
03:36:53  It doesn't seem rewriting the page table really copies the memory, unless you know you will never change the data afterward until the program is finished
03:36:56  what if ther pages don't align?
03:36:59  elliott: That's why you make it COW.
03:37:10  pikhq_: heh, that would work
03:37:12  pikhq_: why doesn't glibc do that
03:37:22  madbr:  Do "normal" memcpy for first/last ~4k if necessary.
03:37:23  elliott: Because the page table is not exposed to userspace.
03:37:26  oh i see
03:37:32  pikhq_: yeah what if they don't align what now pikhq_
03:37:39  also I'm using >4k pages so that's a common scenario
03:38:01  elliott: works if the start/end are misaligned I guess, but afaik not if the data is misaligned?
03:38:02  elliott: *Clearly* in @ your "memcpy" wouldn't copy from address to address, it would be more of an object clone function.
03:38:20  So, you merely need to have the same alignment as the original object.
03:39:02  pikhq_: Sooo cheating :P
03:39:04  aligned to 4k pages? :D
03:39:16  elliott: Only by normal standards.
03:39:19  madbr: That's not all that uncommon, really
03:39:34  @ should milk the removed abstraction layers for all it's got. :)
03:40:31  (obviously @ still *has* abstraction layers, but they're nowhere near as Carved In Stone as in traditional OS design, I'd imagine.)
03:40:40  Does GHC allow classes with no parameters?
03:41:19  no
03:42:41  but yeah the risc+"dataflow" cpu thing is kinda like an attempt at a CPUGPU :D
03:43:06  cgpu
03:45:49  might need some more parallelism for that
03:52:22  pikhq_: Anyway, I don't know why you'd need to clone an object.
03:52:38  pikhq_: Since my current design still has immutable objects.
03:53:23  Okay, then you'd be a moron to do that.
03:53:58  pikhq_: "@: really fast at doing something really pointless"
03:54:17  :D
03:54:31  pikhq_: Hmm, what granularity is COW done at? Page level?
03:54:58  Page level.
03:55:01 -!- Darth_Cliche has joined.
03:55:14  It functions on page faults.
03:55:21  pikhq_: Then it could still be useful. Consider a large (many megabyte) unboxed array's underlying storage.
03:55:38  pikhq_: You want to make a copy of this storage with one word in the middle changed.
03:55:43  Certainly.
03:55:52  elliott: You're back.
03:55:56  pikhq_: Fiddling with the page tables means you only have to copy one page for the purpose.
03:56:03  I don't know whether that makes your time zone more or less mysterious.
03:56:11  shachaf: I have an infinite supply of mysterions.
03:57:05  pikhq_: Hmm, that actually sounds like a pretty big win.
03:57:22  shachaf: His time zone is very clear, his mapping from time to consciousness status is not.
03:57:26  pikhq_: Large immutable vectors kinda suck in GHC because you're copying all the time.
03:57:36  pikhq_: Although, to be fair, copying even a page all the time isn't instant...
03:57:42  But it beats copying hundreds of 'em.
03:57:54  Yup.
03:57:58  I have decided I will start calling everyone LamE
03:58:30  pikhq_: Hmm, how easy is it to fuck with the page tables?
03:58:45  I guess faster than copying ~2 MiB per page whatever the circumstances :P
03:59:05  The only issue is that you need to do at least a partial TLB flush when you update them.
03:59:17  Otherwise, it's just mutating a fairly simple data structure.
03:59:18  Right. I don't really have an intuition for the constant factors involved there.
03:59:47  Bit less than a cache miss, I think.
03:59:59  It's significantly better if you only do a partial TLB flush.
04:00:14  Right.
04:00:55  This is something that OSes do every time they task switch. :)
04:01:08  (though, of course, @ would have no need to do it then)
04:04:54 -!- gouaf has joined.
04:09:00  hi gouaf
04:09:02  `? welcome
04:09:05  Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
04:10:17 * Sgeo|web wants to see some mysic esotericer who manages to conclude that "programming language" is how to describe magik rituals or something
04:10:45  Which reminds me, can someone help me with this magic spell I've been working on?
04:13:47  hmm, i wonder if being non deterministic could help making a turing tarpit with less instructions/functionality
04:26:40  It's spelled "magick", I'm pretty sure, anyways.
04:26:45  Or, if you're not a moron, "magic".
04:30:17  pikhq_: I wonder what @'s in-memory allocator will look like (i.e. that decides a physical address to put an object at when it's first allocated)...
04:30:26  As opposed to the one that decides where on the disk to put it after a while.
04:30:40  "disk"?
04:30:55  By the time the first line of code in @ is written, we'll all be using memristors, man.
04:32:13  Is this a proper group?   mempty = Equivalence (==); mappend (Equivalence f) (Equivalence g) = Equivalence $ \x y -> (x == y) /= (f x y /= g x y); minverse = id;
04:38:00  shachaf: Where "disk" means "the slowest and largest memory on the system".
04:38:11  pikhq_: No, that's the internet.
04:38:18  The Network is the Computer.
04:38:27  Oh, well. Of course it would be.
04:38:42  shachaf: Anyway, shaddap, I had an unwanted breakthrough about @ :P
04:38:48  Except that if ISPs got off their asses it wouldn't be.
04:39:20  Cable can provide more bandwidth than is on my system bus.
04:39:56  How slow is your system bus
04:40:33  Not very. Cable is just *really* underutilised.
04:45:36  Gregor: Convince me not to spend ridiculous amounts of money on some worthless bits of paper with Ryan North's signature and drawings of T-Rex drawn to hat specifications as supplied by me
04:46:21  elliott: Spending money makes you a communist.
04:47:14  shachaf: Yes, quite.
04:47:19  Also, Dinosaur Comics are, like, boring.
04:47:40  shachaf: SHUNNNNNNNNNNNNNN
04:48:15  "Shun magic, and shun the appearance of magic! Shun everything, and then shun shunning!"
04:48:40  shachaf: Your opinions are so wrong, SO WRONG.
04:49:03  Dinosaur Comics is something I never have, and never will, dislike; it is the single beacon of hope that proves to me that I am essentially a good person at heart.
04:49:12  http://www.youtube.com/watch?v=gYz5qnIkf20#t=051s
04:49:53  Gregor: What's the best kind of hat.
04:50:12  elliott: Depends on the kind of head!
04:50:21  Hard to go wrong with a Trilby or Derby/Bowler.
04:50:22  Gregor: Tyrannosaurus rex, green.
04:50:26  lol
04:50:40  For T-Rex, I'd have to say a top hat.
04:50:51  Gregor: I don't think you understand it literally says on the site that you can specify two kinds of hat to be doodled on a doodle of T-Rex by Ryan North???
04:50:58  "If you chose YES, please write briefly to whom the books should be made out and the types of hats T-Rex should be wearing!"
04:50:59  Direct quote???
04:51:02  elliott: Whaaaaaaaaa
04:51:18  elliott: Well, in that case, you want it to be doodlerific
04:51:20  Is top hat a different kind of hat from top hat?
04:51:22  elliott: Speaking of comics, did you see that great comic copumpkin linked to yesterday?
04:51:27  shachaf: Which one?
04:51:37  several
04:51:54  shachaf said singular I am betrayed.
04:51:56  copumpkin: I'm talking about that one that I actually read.
04:51:56  Soooooo, tyrolean (yessssss) and either fez or pith helmet.
04:52:04  "read"
04:52:11 * shachaf wonders whether to inflict it on elliott.
04:52:15  Gregor: Fez OR pith helmet.
04:52:27  Pith ... fez?
04:53:56  Pith... fez...
04:54:01  shachaf: I'm waaaaiting.
04:54:07  elliott: Oh, you want it?
04:54:11  @localtime elliott
04:54:12  Local time for elliott is Thu Nov 10 04:53:27
04:54:23  http://comic.naver.com/webtoon/detail.nhn?titleId=350217&no=31&weekday=tue
04:54:24  My IRC client is actually on Icelandic time.
04:54:38  I can't say I recommend it.
04:55:02  shachaf: Oh, not that thing again. That was all over the internet weeks ago.
04:55:07  Oh.
04:55:16 * shachaf feels betrayed by copumpkin now.
04:55:22  why?
04:55:34  elliott: how about the other comics I linked to?
04:55:35  copumpkin: I demand the latest in unpleasant entertainment.
04:55:37  Well, copumpkin had some other links that I decided not to go to after seeing that one.
04:55:44  copumpkin: I didn't see the links! It's all shachaf's fault.
04:56:02  elliott: It's your fault because the links were posted in that one channel all the cool people go to.
04:56:11 -!- MDude has changed nick to MSleep.
04:56:14  shachaf: You mean the one cheater never shuts up in?
04:56:35  elliott: well, there's this NSF[W/L] COMIC OF DOOM: http://ikuikuiku.livejournal.com/53281.html
04:57:01  Who needs [W/L]s.
04:57:31  I did find some way with barrier monads to do liftIO and even lift things in other monads too, but it isn't really a monad transformer and it requires the use of unsafeCoerce
04:57:45  there's also a fairly disturbing but long http://read.mangashare.com/Uzumaki, and a much shorter http://brasscockroach.com/h4ll0w33n2007/manga/Amigara-Full/Amigara.html
04:58:26  copumpkin: Barrier monads! Talk to zzo38 about barrier monads.
04:59:32  Barrier monads have such an impressive barrier that unsafeCoerce is needed to penetrate it.
04:59:42  also, if you want a good, depressing (but not horror) comic, read http://www.viruscomix.com/page198.html
05:00:17  elliott: too tired to think
05:00:20  shachaf: O, that's why!!!
05:02:36  copumpkin: Well, fucking hell.
05:02:52  pikhq_: which?
05:03:08  I can think of two very different kinds of "fucking hell" my links would give rise to
05:03:12  The first one.
05:03:15  oh ok
05:03:43  yeah, that one's rather, um, different
05:04:13  Hmm. I somehow missed that Winston Rowntree one.
05:04:52  good times, eh
05:06:58  That was a bit unlike Winston Rowntree.
05:07:08  I've come to expect more words than images from him. :P
05:09:15  newtype FrontIO = FrontIO (IO BackIO); newtype BackIO = BackIO BackIO; instance MonadIO (Barrier FrontIO BackIO) where { liftIO = fmap unsafeCoerce . yield . FrontIO . fmap unsafeCoerce; };   Although it is possible to make it do more, and probably in more generalized way.
05:09:42  pikhq_: yeah
05:10:12  Maybe like this:   newtype Unsafe = Unsafe Unsafe; newtype FrontT m f = FrontT (Either f (m Unsafe)); newtype BackT m b = BackT Unsafe;
05:11:19  copumpkin: It's a bit hard to describe Subnormality as a webcomic, really. More of a web-illustrated-essay-series.
05:11:27  :P
05:11:37  Why the hell do I use ":P" so much, anyways?
05:11:48  cause you gotta be upbeat after that comic
05:11:56  cause otherwise you just cry :P
05:12:09  Sounds about right.
05:20:29  hmm
05:20:59  would be neat to have a language where all variables can only be assigned once
05:24:07  That's called static single assignment form, and it's used in the IR of any decent compiler for a language relying on mutable state.
05:24:18  LLVM allows only one command to assign each variable, you cannot have multiple commands assigning to the same variable; but you can still loop and reassign them, and you can also read/write memory so you can assign however you want.
05:24:28  It is also isomorphic to CPS.
05:24:50  IR?
05:26:01  Intermediate Representation.
05:26:26  mhm
05:28:09  what about one where you can't reassign variables on looping :D
05:28:36  Isn't that what you just asked for?
05:28:42  yeah
05:28:57  such that you need to keep growing arrays and have some kind of garbage collector
05:29:11  We call *that* Haskell.
05:29:20  heh
05:29:37  Or, really, lambda calculus.
05:29:53  Though strictly speaking you can't assign any variables in LC. :)
05:30:37  tried some unlambda... looks a lot like string rewriting really :D
05:31:12 -!- gouaf has quit (Quit: Leaving).
05:31:46  the strings don't really grow indefinitely afaik... they might grow (s combinator!) or shrink (k combinator !) as you evaluate it :o
05:32:51  and afaik it's clear when something has become inaccessible and should get collected :o
05:34:09  That would be because you have no idea how evaluation of functional programming languages works. :)
05:34:33  don't have any experience with that no
05:44:59  madbr: fsvo clear
05:45:08  unlambda has a form of laziness
05:45:22  so i believe you can do cyclic structures
05:46:00  will have to look into that
05:50:17  If an expression in GHCi is of type (IO t) where there is no instance (Show t) is it supposed to display no error message for that? For example,   return id :: IO (a -> a)   displays no message.
05:58:09  newtype Unsafe = Unsafe Unsafe; newtype FrontT m f = FrontT (Either f (m Unsafe)); newtype BackT m b = BackT Unsafe; type BarrierT f b m t = Barrier (FrontT m f) (BackT m b) t; bliftMonad :: Functor m => m t -> BarrierT f b m t; bliftMonad = fmap unsafeCoerce . yield . FrontT . Right . fmap unsafeCoerce;
05:58:20  joy
05:58:36  joyest
05:58:37  hapey
05:58:47  bliftBarrier :: Barrier f b t -> BarrierT f b m t; bliftBarrier = convert (FrontT . Left) unsafeCoerce; executeBT :: Monad m => BarrierT f b m t -> m (Either t (f, b -> BarrierT f b m t)); executeBT (Unit x) = return $ Left x; executeBT (Fail x) = fail x; executeBT (Barrier (FrontT (Left a)) c) = return $ Right (a, c . BackT . unsafeCoerce); executeBT (Barrier (FrontT (Right a)) c) = a >>= executeBT . c . BackT;
05:59:47  FrontT and BackT can be opaque types (without exporting their constructor), and Unsafe doesn't need to be exported at all, because it is only used internally.
06:00:43  what does unsafe do
06:01:23  Do you mean the Unsafe type? It does nothing. It is only there for use with unsafeCoerce
06:01:31  zzo38: are you sure Unsafe should not be Any from GHC.Exts
06:01:40  the way you are coercing can break
06:01:53  with Any it's guaranteed to work
06:02:24  elliott: Yes; I want to ask that too. Do you see any possibilities of breaking in my code?
06:02:41  other than that, no
06:03:53  I don't see any Any in GHC.Exts
06:04:22  it's documented in GHC.Prim
06:04:29  but you import it from Exts
06:05:59  Why is that?
06:06:24  dunno, internal compiler stage bootstraping blah :)
06:06:58  OK, I fixed that in my program, now it uses Any instead of Unsafe
06:07:19  yay
06:09:28  At least GHC.Prim does say to import GHC.Exts instead. And looking at the codes for GHC.Exts, it does reexport GHC.Prim
06:09:44  It also says that max tuple size is 62
06:31:01  yeah ok I have a preliminary syntax for monoassignment language
06:31:18  conditions : variable = value
06:31:57  conditions are = != < > <= >= comparison operators, joined together with boolean AND
06:32:47  values are calculated with math operators, kinda like C
06:33:13  go on
06:33:53  if a variable name never gets any assignment in any of the statements, it's an iterator of some kind
06:34:18  and can be used in array assignments etc
06:35:03  inputsize, outputsize, input[] and output[] are predefined for those functions
06:35:43  so for instance, this partitions the input into two arrays, everything up to the first '@', and then everything else:
06:35:57  i1c[0]=1
06:35:57  i1c[i] input[i]!='@': i1c[i+1] = 1
06:35:57  i1c[i] input[i]='@': pend = i+1
06:35:57  i i>=pend i looks fun
06:36:59  Goodnight all.
06:37:19  bye
06:37:33  this implements the '[' operator in brainfuck:
06:37:43  OK so that is how it works.
06:37:49  ic[i] pr[ip[i]]='[' dat[i][dp[i]]=0  : ipl[i][0] = 1
06:37:49  ipl[i][j]    pr[ip[i+j]]='[' : ipl[i][j+1]=ipl[i][j]+1
06:37:49  ipl[i][j]!=1 pr[ip[i+j]]=']' : ipl[i][j+1]=ipl[i][j]-1
06:37:49  ipl[i][j] =1 pr[ip[i+j]]=']' : ip[i+1] = ip[i]+j+1
06:37:50 -!- Darth_Cliche has quit (Quit: You are now graced with my absence.).
06:38:13  Make an article for it and call it something.
06:38:29  still a rough draft
06:38:47  gotta make it into a nice, insane tarpit :D
06:38:53  also a bit easy
06:39:47  no
06:39:52  don;t make it harder
06:40:04  you'll destroy the elegance :)
06:41:29  no idea how you'd actually implement it, though it would probably require some sort of lazy evaluation and some insane garbage collector :D
06:42:16  does not look that bad...
06:42:28  I would like to see an article of it anyways. And then it could make discussion in case it seem there ought to be changes made.
06:47:30 -!- Zuu has quit (Ping timeout: 244 seconds).
06:52:41  night
06:52:42 -!- madbr has quit (Quit: Radiateur).
07:10:08 -!- zzo38 has quit (Remote host closed the connection).
07:30:54  elliott: You sure are missing out on Codensity and Yoneda and Kan extensions and all those things cool people talk about in #-blah.
07:31:02  Where "cool people" means edwardk, of course.
07:31:33  Someone drag edwardk into here. (Maybe don't.)
07:32:58  haha
07:36:31  elliott: Did you ever got those 5-grams?
07:36:36 * shachaf suspects elliott lost interest.
07:37:45  shachaf: Lost the code with the other machine, but can and will reproduce it soon.
07:38:21  What happened to the other machine?
07:38:36  He got fed up with not having a number row, clearly
07:38:45 * Sgeo|web actually has no idea
07:38:49  If that's even the same machine, or what
07:41:59   +
07:44:06  shachaf: It decided it was tired of being a computer, turned itself off while I was using it, and then refused to turn back on again.
07:44:30  Is the hard drive dead?
07:44:54  shachaf: The hard drive is welded to the motherboard.
07:45:39  What is this?
07:46:09  He got tired of it rattling around in there and took a welding torch.
07:46:15  (Disclaimer: not actually true.)
07:46:55  fizzie: Don't worry, I mentally append "(Disclaimer: not actually true.)" to everything you say.
07:47:01  shachaf: It's one of them breathable, readable, waterproof raincoat computers.
07:47:15  `log (Disclaimer: not actually true.)
07:47:44  2011-11-10.txt:07:46:15:  (Disclaimer: not actually true.)
07:48:04  elliott: I'm hired? what for?
07:48:14  olsner: @!!!!!!!!
07:48:21  Disclaimer: I'm going to be awake very late tomorrow
07:48:44  OH NOOOO
07:57:22  elliott: U+MAD?
07:57:31  you bad
07:57:38  U+MAD is totally a code point.
07:58:10  It matches the regexp /^U\+\w+$/, after all.
07:58:18  shachaf: DevHC can't make me mad once I realised that he actually just assumes you're stupid for the first ~3 minutes of any disagreement.
08:00:08  Aw.
08:00:31  u not even a little bit mad?
08:00:44  I'm opposite mad.
08:01:07  comad?
08:01:12  nomad
08:01:17  monqy++
08:01:29  :-D
08:01:39  I propose the name "nomad" instead of "comonad".
08:02:57  I think I tend to assume people are stupid
08:02:58  :/
08:03:11 * Sgeo|web still does nlt quite understand comonads >.>
08:03:34  Sgeo|web: They usually are, just not in the way you expect them to be. (This is based on piles and piles of evidence, i.e. a few days in #haskell).
08:05:47  shachaf: You know, I think it's only a matter of time before DevHC sincerely asks me whether I mad.
08:05:49  elliott: I always mentally append "(This is based on piles and piles of evidence, i.e. a few days in #haskell)." to everything you say.
08:06:04  shachaf: Indeed. (I am a genius).
08:06:24  elliott: You are a genius (this is probably wrong).?
08:06:30  Darn.
08:07:47  hi (Disclaimer: not actually true.)
08:09:11  @hug monqy
08:09:11  http://hackage.haskell.org/trac/ghc/newticket?type=bug
08:09:36  oh no
08:09:39  what have you done
08:09:58  turned monqy into bug
08:10:11 * Sgeo|web wants to see elliott be wrong about something
08:10:18  Sgeo|web: That literally never happens.
08:12:25  Sgeo|web: There you go. A great example.
08:12:44  2010-10-12 02:00:00  i'm probably wrong, i know nothing about this stuff :)
08:13:02  That was a joke.
08:13:06  ddarius was wrong about something the other day!
08:13:07  I'm actually a genius.
08:13:10 * shachaf was astonished.
08:20:08 -!- sebbu3 has changed nick to sebbu.
08:22:13 -!- monqy has quit (Quit: hello).
08:37:40  > (f <*> g) x
08:37:41    Ambiguous type variable `a' in the constraints:
08:37:41     `SimpleReflect.FromExpr ...
08:37:42  > (f <*> g) x :: Expr
08:37:43    Ambiguous type variable `a' in the constraints:
08:37:43     `SimpleReflect.FromExpr ...
08:37:45  :-(
08:37:51  > ((==) <*> reverse) "a"
08:37:52    True
08:37:52  > ((==) <*> reverse) "ab"
08:37:53    False
08:37:53  > ((==) <*> reverse) "aba"
08:37:54    True
08:45:35  > (f <*> (g :: Expr -> Expr)) x :: Expr
08:45:38    f x (g x)
08:46:55  Deewiant: SimpleReflect should suck less
08:51:21 -!- derrik has quit (Ping timeout: 252 seconds).
08:52:36 -!- derrik has joined.
08:57:40 -!- elliott has quit (Remote host closed the connection).
09:00:50 -!- elliott has joined.
09:15:14 -!- myndzi has quit (Read error: Connection reset by peer).
09:15:41 -!- myndzi has joined.
09:15:43 -!- CakeProphet has joined.
09:23:26 -!- yiyus has quit (Ping timeout: 260 seconds).
09:50:22 -!- yiyus has joined.
09:57:23 -!- ais523_ has joined.
09:58:24 -!- GreaseMonkey has quit (Quit: The Other Game).
09:59:58  hi ais523_
10:00:27  hi elliott
10:00:30 -!- ais523_ has changed nick to ais523.
10:04:18 -!- Jafet has joined.
10:08:52 -!- Aune has joined.
10:09:25 -!- oerjan has joined.
10:14:54   "Didn't UnXis also get the SCO Group name? In the SCO bankruptcy filings since the sale, the entity formerly known as The SCO Group calls itself TSG. But UnXis *didn't* get the litigation against IBM. It's listed on the Excluded Assets. So who exactly is this asking to reopen the IBM litigation now? The filings say it's "The SCO GROUP, INC., by and through the Chapter 11 Trustee in Bankruptcy, Edward N
10:15:05 -!- derrik has quit (Quit: left).
10:15:25  could this mean they've split up so much there is no one left who has standing to sue? :P
10:15:58  (guess not.)
10:16:11  oerjan: it wouldn't surprise me :)
10:27:23  oerjan: it won't stop them suing anyway
10:30:52  mhm
10:38:51  05:45:08:  unlambda has a form of laziness
10:38:51  05:45:22:  so i believe you can do cyclic structures
10:38:53  nope.
10:39:02  lame
10:39:06  reference counting works for unlambda.
10:39:12  l a m e
10:43:00  oerjan: hm doesn't that basically mean that you have to manage your own memory after a certain point in unlambda
10:43:09  to avoid leaks with simulation of cyclic structures
10:43:53  hm perhaps
10:44:20  i haven't thought much about that, since unlambda isn't really a lazy language
10:44:45  however i've thought about lazy-k, which i think has that problem.
10:45:46  it has laziness, but no way to make something internally cyclic
10:47:13  oerjan: well i think you always need cyclic structures eventually.
10:47:23  oerjan: which means you need pointers, laziness, or a simulation of either.
10:47:27 -!- ais523 has quit (Ping timeout: 276 seconds).
10:47:35  All-around the music world, no a single seriously is aware of what the variation concerning a baritone and a euphonium is. I've heard reasonings of "baritones have the bell facing front" or "euphoniums expense additional." I've compiled evidence to display, with superior explanation, what the distinction among baritones and euphoniums are.
10:47:42  Possibilities are, unless of course you've been to a brass band concert, you've never witnessed an actual British baritone. The Yamaha YBH-301 is a common British baritone. A regular British euphonium is the most widespread euphonium and looks anything like a Yamaha YEP-642.
10:48:17  http://esoteric.voxelperfect.net/wiki/User:LeroyButler647 this is amazing
10:48:24  wow
10:48:26  it doesn't need deleting
10:48:27  the domain is expired
10:49:31  `addquote * Sgeo|web wants to see elliott be wrong about something   Sgeo|web: That literally never happens.  < Sgeo|web: There you go. A great example.
10:49:34  argh
10:49:38  718) * Sgeo|web wants to see elliott be wrong about something   Sgeo|web: That literally never happens.  < Sgeo|web: There you go. A great example.
10:49:42  `unquote
10:49:46  ​*poof* * Sgeo|web wants to see elliott be wrong about something   Sgeo|web: That literally never happens.  < Sgeo|web: There you go. A great example.
10:49:54  `addquote * Sgeo|web wants to see elliott be wrong about something   Sgeo|web: That literally never happens.   Sgeo|web: There you go. A great example.
10:49:56  718) * Sgeo|web wants to see elliott be wrong about something   Sgeo|web: That literally never happens.   Sgeo|web: There you go. A great example.
10:53:20  oerjan: btw expect shachaf to delete that a few times
10:53:31  wat
10:53:41  shachaf doesn't like bots knowing he exists, I think
10:53:50  `quote shachaf
10:53:52  624)  elliott: GHC bug? Come on, it's the parentheses.   The more parentheses you add, the closer it is to LISP, and therefore the more dynamically-typed. \ 670)  Real Tar is GNU tar.   You just ignore whichever features don't make you feel superior enough. \ 708)  VMS Mosaic?
10:54:43  `quote
10:54:43  `quote
10:54:44  `quote
10:54:44  `quote
10:54:44  `quote
10:54:47  638)  if all my Facebook friends were to visit a page, it wouldn't make any difference at all
10:54:53  45)  It looks like my hairs are too fat.  Can you help me split them?
10:55:09  269)  who is guido van rossum   you could say he's a man who grew a beard but acquired none of the associated good properties
10:55:10  168)  Sgeo: hahaah, and i love when they announced it i dare u to press alt f4 and your house ( acts 16:31 your bible)
10:55:10  474)  I can't afford one of those!   A grandchild, not a laser printer
10:55:20  oerjan: help me dec;ide
10:56:41 -!- ais523 has joined.
10:57:05  hi ais523
10:57:09  wb me
10:57:26  sorry, all good
10:57:55  ok _maybe_ 638 is a bit weak
11:01:27  `quote
11:01:28  `quote
11:01:28  `quote
11:01:29  `quote
11:01:29  `quote
11:01:34  i suppose it's a good sign that we're running out of bad quotes
11:01:34  303)  enjoy being locked in your matrix of solidity
11:01:37  89)  I can do everything a Turing machine can do, except love
11:01:38  now watch as these are all terrible
11:01:41  oh good, saved by solidity
11:01:51  82)  hmm... does anyone know a nonsense game designed for the mentally handicapped involving yelling
11:01:51  605)  this strikes me as probably better than a singularity, because you can't trust a random AI, but you can probably trust olsner
11:01:52  24)  so i can only conclude that it is flawed, or the world is utterly bonkers
11:02:34  303 is perfect, 89 is great, 605 is funny, 24 is a heritage site
11:02:35  `delquote 82
11:02:38  ​*poof*  hmm... does anyone know a nonsense game designed for the mentally handicapped involving yelling
11:03:46 -!- ais523 has quit (Ping timeout: 240 seconds).
11:04:39  oh come on, that was hilarious.  but i guess you have to be evil to appreciate it.
11:06:18 -!- ais523 has joined.
11:06:18 -!- ais523 has quit (Changing host).
11:06:18 -!- ais523 has joined.
11:15:22  oerjan: it was part of a stupid non-oerjan-quality pun that i forget
11:15:44  aha
11:22:22  `quote
11:22:22  `quote
11:22:23  `quote
11:22:23  `quote
11:22:24  `quote
11:22:30  503)  Game theory is not a perfect tool for analyzing video games.   Nash failed to create a "video game theory"
11:22:34  513)  it actually worked, and faster than using Excel for rendering
11:22:45  525)  "Okay, got i-" "I DON'T BELIEVE YOU. SCROLL FOR ME, CHILD."
11:22:45  444)  elliott: His mouse obeys the law of the excluded middle :/
11:22:45  98)  oklopol geez what are you doing here   ...i don't know :<   i actually ate until now, although i guess i also did other things...
11:23:11  503 is A+, 513 is pretty amusing, 525 i don't get and I /said/ it, 444 is not that funny, 98 is good
11:23:14  `delquote 525
11:23:16  ​*poof*  "Okay, got i-" "I DON'T BELIEVE YOU. SCROLL FOR ME, CHILD."
11:24:17  `log  "Okay, got i-" "I DON'T BELIEVE YOU. SCROLL FOR ME, CHILD."
11:24:41  2011-11-10.txt:11:23:16:  ​*poof*  "Okay, got i-" "I DON'T BELIEVE YOU. SCROLL FOR ME, CHILD."
11:24:46  >:(
11:24:54  sometimes i feel like `log is not as useful as it could be
11:28:29 -!- kmc has quit (Ping timeout: 248 seconds).
11:31:07  ais523: argh!
11:31:18  ais523: you deleted the page which I _specifically_ verified did not link to any spam and contained no spammy content.
11:31:42  here you are http://www.girlgeniusonline.com/comic.php?date=20080514
11:31:51  oops, wrong window.  well never mind.
11:32:07  it's for elliott
11:32:12  it's actually for HackEgo
11:32:19 -!- derdon has joined.
11:32:26  what's up with the eyes of that guy in the last panel, eyes don't work like that
11:32:45  Gregor: it's okay, I can add the assignments back to the topic if/when there will be more.
11:33:01  foglio isn't _always_ perfect on the anatomy.
11:33:26  hmm, you can't use "will" with "when", but how about "will" with "if"?
11:33:45  I think you can
11:33:54  seems ok to me
11:34:21  so there's no natural way to use "if/when" in English if it applies to future...
11:35:01  You could just talk in Finnish, like half the channel would understand you.
11:35:10  Admittedly it'd be the worst half.
11:35:27  oh, definitely
11:35:50  in Finnish, it is quite commonplace to say "jos/kun" which is the equivalent of "if/when"
11:36:01  but Finnish does not have a future tense
11:36:21  the finns _have_ no future, you see
11:36:26  aaaa
11:36:29  that must be it
11:36:47  Well, the country breaks all laws of mathematics and space. Time is just another box to be ticked.
11:37:01  English-talking people, on the other hand, have no future when they're talking about when things happen
11:37:04  Except... not to be ticked, because that implies time passing in an orderly fashion while you tick the box.
11:37:11  It's another box to be made having been ticked at some point or another.
11:37:32  no, the thing is, we do have a past, but the present and the future are molded into one great whole.
11:38:01  Ah.
11:38:05  but now, off to work ->
11:38:12  That would explain why you guys never make any sense.
11:38:19  definitely.
11:38:30  apparently, the future is the worst half of time.
11:39:55  Half?
11:40:09  It occurs to me that I have no idea how far along the universe's projected lifespan we are.
11:43:35 -!- kmc has joined.
11:45:02  Well, it's "half" both if time is cyclic and if it's infinite in both directions, so I'm betting on us being halfway through the time
11:45:22  if I prove to be wrong, you can collect the wins.
11:45:42 -!- oerjan has quit (Quit: I wioll haven been gone nao).
11:45:44  /The/ time?
11:45:58  :D
11:46:12  do you have many?
11:46:14  Finns have arcane knowledge. Knowledge which in some sense borders on the... esoteric.
11:46:55  but maybe I was only talking about my time, which might be also yours.
11:47:28  Similarly, when I say "the world", I actually just mean the small section of the world relevant to me.
11:47:35  The world has, like, 100 people in it.
11:47:43  Okay probably more than that.
11:47:51  well, my time has all the universe in it.
11:48:02 -!- kmc_ has joined.
11:48:05  It's weird, but that's now it is
11:48:21  *how
11:48:22  *sigh* Finns. Always hogging the time.
11:48:33  but now you know why
11:48:41  It's almost as if a question you would answer yes to is "have you got the time?"!
11:48:42  HA HA HA.
11:49:00  or the question
11:49:23  by the way, Finnish has no articles, so most of this discussion doesn't really translate into Finnish
11:49:46  I can't tell whether that's an advantage or a disadvantage for Finnish.
11:49:52  at least the ambiguities are hard to translate.
11:51:08  hmm... I wonder whether you're talking about economics of the language, or some lewd way our life might be better/worse because we reflect this lack of articles in our way of thinking, as suggested by Sapir-Worff hypothesis...
11:51:16 -!- kmc has quit (Ping timeout: 240 seconds).
11:52:25  I'm just thinking that maybe it's better for the world if we can't have discussions like these :P
11:52:50  Sapir-Whorf might be discredited, but it certainly helps to make things a huge pain to talk about.
11:53:28  so, about economics, then.
11:53:36 -!- kmc__ has joined.
11:53:39  but I forgot to start working....
11:53:47  so I'm going to try anew
11:53:49  I think programming languages demonstrate the Sapir-Whorf hypothesis
11:53:58  More than natural languages
11:54:23 -!- kmc__ has quit (Client Quit).
11:54:36 -!- kmc has joined.
11:55:17  I think you're right, because different programming languages talk about different worlds, whereas the world referred to by most natural languages is quite similar
11:56:45 -!- kmc_ has quit (Ping timeout: 248 seconds).
12:05:33 -!- ais523 has quit (Ping timeout: 260 seconds).
12:19:07 -!- derrik has joined.
12:43:41 -!- boily has joined.
12:46:46 -!- derrik has quit (Quit: back to school).
13:03:42 -!- pikhq has joined.
13:03:54 -!- pikhq_ has quit (Ping timeout: 260 seconds).
13:28:15 -!- sebbu2 has joined.
13:28:15 -!- sebbu2 has quit (Changing host).
13:28:15 -!- sebbu2 has joined.
13:29:23 -!- sebbu has quit (Ping timeout: 240 seconds).
13:36:49 -!- Ngevd has joined.
13:38:11  Hello!
13:45:40  I see there's another bf derivative
13:48:24  I think we should encourage people who make bf derivatives to then make another language
13:48:31  That isn't a bf derivative
13:49:22  Look at Brainlove --> Elog
13:53:02  Also, today I realised that I ship Telemachus and Athene
13:57:01  Also also, there is an object-oriented version of Haskell called Mondrian.
13:57:10  Somebody should right a Piet implementation in it.
13:57:48 -!- ais523 has joined.
13:58:25  Hello!
13:58:55  hi
13:59:03  There's some spam on the wiki
13:59:11  elliott: a bunch of Agorans just won BlogNomic, btw
14:00:52  although we agree that an Agoran dynasty would be inappropriate
14:07:42 -!- sebbu3 has joined.
14:07:42 -!- sebbu3 has quit (Changing host).
14:07:42 -!- sebbu3 has joined.
14:07:54 -!- Guest63524 has joined.
14:09:23 -!- sebbu2 has quit (Ping timeout: 255 seconds).
14:10:16 -!- Slereah_ has quit (Ping timeout: 276 seconds).
14:31:30  what with the more or less constant popularity of bf derivatives (based on number of such languages made) I think it is time to make a Funge-98 fingerprint that essentially contains some of the more popular BF-variants, such as brainfuck and boolfuck.
14:31:37  ais523:  ^
14:35:27  that doesn't seem an obvious inference to me
14:36:43  ais523: which part of it?
14:37:00  the conclusion; I said that the inference was non-obvious, not the premises
14:37:40  ais523: well, there are two inferences there. One is that bf derivatives are popular, the other is that it is time to make such a fingerprint
14:38:10 -!- augur has quit (Remote host closed the connection).
14:38:34 -!- augur has joined.
14:41:43  I'd guess ais523 was talking about the second
14:42:56 -!- augur has quit (Ping timeout: 258 seconds).
14:44:14  right
14:51:32 -!- sebbu3 has changed nick to sebbu.
14:54:59 -!- derdon has quit (Remote host closed the connection).
14:59:27  THE PROPHET HEN OF LEEDS
14:59:31  http://en.wikipedia.org/wiki/The_Prophet_Hen_of_Leeds
15:11:55   Thumbs up if you're tired of people thumbs uping unoriginal comments asking for thumbs up
15:12:17  now I'm trying to figure out if the self-parody seen in YouTube comments is itself being parodied
15:12:28  (it was the top comment, pretty obviously)
15:12:47  Ngevd: "This poultry article is a stub. You can help Wikipedia by expanding it."
15:17:15 -!- augur has joined.
15:18:06 -!- copumpkin has quit (Quit: Computer has gone to sleep.).
15:23:02  "This tree-related article is a stub."
15:43:39 -!- copumpkin has joined.
15:44:36 -!- MSleep has changed nick to MDude.
16:30:44 -!- Taneb has joined.
16:31:12 -!- Ngevd has quit (Ping timeout: 256 seconds).
16:31:26 -!- sebbu2 has joined.
16:31:27 -!- sebbu2 has quit (Changing host).
16:31:27 -!- sebbu2 has joined.
16:31:40 -!- sebbu has quit (Ping timeout: 240 seconds).
16:34:54  fizzie: is that tree as in binary trees or trees as in the natural type?
16:35:14  Tree as in Family tree
16:35:24 -!- ive has joined.
16:52:43 -!- zzo38 has joined.
16:54:51  "there are only a few copies of my new book left; if you want one for christmas, order now :o"
16:54:55  Gregor: I MUST
16:55:11  elliott: DOIT
16:55:52  Gregor: But it's like 30 quid for some awesome sketches on some paper that will probably never be used for non-pimping purposes :'(
16:56:04 -!- Taneb has quit (Ping timeout: 240 seconds).
16:56:29  elliott: DOOOOOOOOOOOOOOIT
16:56:42  Gregor: It'd probably be cheaper to fly over to America and meet Ryan North in person and ask him for hat-sketches!
16:56:50  PRETTY SURE THAT WOULD COST LESS THAN 30 POUNDS
16:57:38  *Canada
16:57:52  Gregor: Um, SAME THING?
16:58:00  Fair 'nuff
16:58:08  Not only is Canada on the American continent, but it's TOTALLY the 52nd state.
16:58:20  Hmm ... what's the 51st :P
16:58:20  (I made a lie! There's no American continent! That's also a lie! There's TWO!)
16:58:25  Gregor: CLASSIFIED.
16:58:35  By which I mean, I briefly forgot how many states there are.
16:58:52 * Gregor nods sagely.
16:59:03  Gregor: Wait, I have the perfect plan. You could give me 30 pounds, and I could use it to buy the Dinosaur Comic books. ??? Perfect???
16:59:04  Canada is not part of the United States. Even though Canada is part of America.
17:00:46  canada is not part of america!
17:00:56  it is only part of north america
17:01:11  which we can tell by the fact that it is north of america
17:01:52  I realized the definition I have for barrier transform is slightly wrong due to:  a = bliftMonad getLine; b = bliftMonad (return 42) :: BarrierT f b IO Int; c = case (b, a) of { (Barrier x y, Barrier z _) -> Barrier z y; }; main = executeBT (c >>= bliftMonad . print);
17:02:04  Can you throw money at Amazon to use for later purchases? My mind is considering this as a very viable solution to my debit card's pending expiry.
17:02:12  You know, like putting money into PayPal. You can do that right? Help?
17:02:30  elliott: You can put money into PayPal, yes. You could also buy an Amazon gift card if you just want Amazon.
17:02:44  Gregor: Yes, I can put money into PayPal, but Amazon sure as hell don't accept PayPal :P
17:02:58  elliott: You can put money into PayPal and get a PayPal debit card :P
17:03:15  Gregor: I could also just... get a new card.
17:03:20  LIES
17:03:33  Hmm, I wonder if I could somehow buy Amazon gift cards with PayPal. Are there third-party resellers?
17:03:47 -!- fizzie has quit (Ping timeout: 240 seconds).
17:04:05  There are! They even look... VAGUELY legitimate.
17:04:49  Looks like they only want to sell me the physical form though.
17:05:04  Now I have to think of how to fix the problem. Maybe it should just be done by making BarrierT an opaque newtype, but are there any other ways?
17:06:30  Gregor: Basically I want all the convenience of not having to pre-allocate my money without the annoying obstacle of having to go through some kind of banking institution to do that, despite that being a very large part of their purpose :P
17:06:46  PayPal is a banking institution.
17:06:47  So nyaa.
17:07:00  Gregor: Exactly! One that Amazon doesn't accept. Wow fuck Amazon.
17:07:09  Wait, do Amazon accept Amazon Payments? I'm not joking.
17:07:15  Maybe I could somehow feed PayPal funds into that.
17:07:21  elliott: By working in cash you avoid those problems.
17:07:40  zzo38: s/avoid those problems/replace those problems with completely different, far more stupid, avoidable, and irritating ones/
17:07:42  elliott: You can bundle up your cash carefully, attach it to an email, and send it to Amazon.
17:07:47  But then it is the other problem in case of paying something by computer.
17:07:58  zzo38: For instance, to purchase something online I would have to feed notes into my floppy drive.
17:08:01 -!- fizzie has joined.
17:08:02  Unfortunately I haven't got one.
17:08:11  Gregor: I just told you I haven't got a floppy drive!
17:08:28 * elliott is certain this is how e-commerce works.
17:08:51  Is it possible to purchase Amazon gift cards at stores? If so, that solves it. Or, credit card company's gift cards? Maybe that will work.
17:09:13  I think so :P
17:09:27  Gregor: Oh my god, there are 10 pages of designs for Amazon email gift certificates.
17:09:30  I don't want to live in this world.
17:09:52  Is there a plain text design?
17:10:06  No :P
17:10:31  Then they have hundreds and yet they forgot a few!
17:11:26  amusing.... Apparently the actual release version of Skyrim hit torrent sites one day before the official launch.
17:12:17 -!- Phantom_Hoover has joined.
17:12:20  s/actual release/Golden Master/ we are civilised, there are terms!
17:13:13  elliott: not quite. You know that steam allows you to download like a day or two before release but it is only decrypted on the release day?
17:13:24  well, somehow someone managed to decrypt it in advance
17:13:49  elliott: and I'm not sure the concept "golden master" makes sense for steam :P
17:14:10  The Golden Master is whatever the publisher uploads :P
17:14:16  right
17:15:11  Wow, this computer REALLY hates Flash for some reason.
17:15:18  elliott: how so?
17:15:19  It just starts lagging like shit whenever Flash stuff is going on in the background.
17:15:26  No CPU pegging or anything.
17:15:30  Killing the plugin fixes it.
17:15:36  btw some more games were added to the voxatron humble bundle
17:16:21  As I said elsewhere: Humble Bundle's business strategy is basically Katamari for games.
17:16:34  The ball of cash just keeps getting bigger and picking up more games.
17:16:35  elliott: haha
17:17:16 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds).
17:17:44  Ehh, I'll just preallocate Amazon cash beforehand. No harm in buying more gift-certificate money than I need, since I'll undoubtedly purchase from Amazon in the future.
17:29:39 -!- Phantom_Hoover has joined.
17:32:25 -!- Taneb has quit (Remote host closed the connection).
17:34:27  .
17:36:46  .
17:37:05  elliott: what do you plan to buy on Amazon?
17:37:18  Vorpal: Drugs. Looooads of illegal drugs.
17:37:23  elliott: right
17:40:03 -!- Ngevd has joined.
17:50:34  elliott: http://www.everyherbal.com/herbalfire/salvia-divinorum-sampler-pack-p-314.html
17:50:38  found this on google shopping.
17:50:51  it's a hallucinogenic plant of the mint family. also you can buy it online.
17:51:02  That's not Amazon.
17:51:43  elliott: well amazon doesn't /have/ semi-illegal drugs.
17:51:53  Why the fuck not?!
17:52:14  oh wait
17:52:16  it does have salvia
17:52:24  Yesssssssssss
17:52:27  in liquid form too. nice.
17:52:31 -!- sllide has joined.
17:52:36  That sounds convenient!
17:52:39  elliott: anyway you don't want salvia.
17:52:49  I WANT ALL THE DRUGS AMAZON HAS TO OFFER, CAKEPROPHET.
17:52:56  it's guaranteed 5 minutes of bad trip. just sayin'
17:53:14  Yesssssssss 5 minutes of SEMI-ILLEGAL AMAZON-PURCHASED bad trip
17:55:13  ah yes I suppose so
17:55:33  elliott: hmmm amazon apparently doesn't have psilocybe mushroom spores
17:55:34  which
17:55:38  are legal in most US states
17:55:46  Amazon, that's so lame of you. :(
17:56:07  despite the grown mushroom caps themselves being illegal.
17:57:01  elliott: but they do have substrates specifically tailors for growing psilocybe spores.
17:57:08  *tailored
17:57:09  Yessssssss
17:57:17  You are on SO many watchlists right now.
17:57:35  I. I am?
17:57:41  #esoteric is a prime target?
17:58:04  It's Guest63524.
17:58:06  He's FBI
17:58:14  Or she.
17:58:20  ah
17:58:34   elliott: anyway you don't want salvia.
17:58:39  No, you want saliva.
17:58:45  Yes.
17:59:16  Phantom_Hoover: uh, are you referencing the Haskell library, just regular mint, or actually salvia divinorum?
17:59:21  elliott, I don't want to see you high.
17:59:24  Or is that me?
17:59:29  Am I you?
17:59:52  Ngevd: I think it is possibly the only way the Elliott IRC Experience could reach a new level of intensity. What I'm saying is, not only would I get banned, the whole UNIVERSE would get banned.
18:00:12  CakeProphet: You're dyslexic.
18:00:21  elliott: ah yes.
18:00:22  I am.
18:02:42 * CakeProphet should make a web app framework called Psilocybe
18:02:55  to be on par with Salvia and loli.
18:03:00  in terms of questionable names.
18:03:42  questionably named web app things.
18:03:46 -!- Darth_Cliche has joined.
18:04:03  announcing my new haskell webframe work " poop"
18:04:29    elliott: anyway you don't want salvia. <-- btw, salvia is the Swedish word for the plant "sage".
18:04:55 * Sgeo|web sages #esoteric
18:05:07  seels it is "Salvia officinalis" in Latin
18:05:08  http://en.wikipedia.org/wiki/Salvia_officinalis  "common sage"
18:05:17  er, yes.
18:05:21  CakeProphet: beat you to that
18:05:22  Vorpal: Isn't salvia-the-drug just a type of sage.
18:05:24  also seems*
18:05:33  elliott: I have no idea
18:05:35  elliott: type of mint. is that the same thing?
18:05:40  Yes, obviously.
18:05:42  Is it peppermint?
18:05:50  no.
18:05:50 * Sgeo|web is almost ashamed he knows of 4chan's sage stuff
18:06:13  SHUUUN
18:06:15  elliott: it smells kind of like tea leaves to me.
18:06:20  SHUUUUUUUUUUUUUUUUUN
18:06:21 -!- Ngevd has quit (Ping timeout: 248 seconds).
18:06:24  minty tea leaves.
18:06:35  (It's funny because sage doesn't even originate from 4chan anyway.)
18:06:40  (Assuming shunning is funny.)
18:06:47  (It's not funny, we're awful people.)
18:06:48  Vorpal, trying to run mplayer and Flash at the same time, mplayer spits out, amongst other things, "[AO_ALSA] alsa-lib: pcm_hw.c:1293:(snd_pcm_hw_open) open '/dev/snd/pcmC0D0p' failed (-16): Device or resource busy
18:06:48  [AO_ALSA] Playback open error: Device or resource busy
18:06:48  Failed to initialize audio driver 'alsa'"
18:06:49  (By we I maen me.)
18:06:52  (implying elliott assumes shunning is funny)
18:07:10  (implying tautology club is tautology club)
18:07:36  Phantom_Hoover: I guess you have no hardware mixer and no mixer like arts, esd, pulseaudio, whatever
18:07:47  elliott: what's interesting about salvia divinorum is that no other hallucinogen is of the same chemical nature.
18:07:48  Vorpal: Isn't that what dmix is for?
18:07:50  or mplayer just isn't using that
18:07:54  elliott: sure, dmix too
18:07:55  it's the only known hallucinogen of its kind.
18:08:03  Vorpal: I would expect that to be enabled out-of-the-box.
18:08:03  whereas all of the others are broadly classified into two categories.
18:08:29  Where does sage originate from?
18:08:32  CakeProphet: oh?
18:08:37  alsa -mixer dmix doesn't work.
18:08:39  elliott: depends on distro
18:08:51  elliott: I know for sure it isn't on arch linux.
18:08:56 -!- derdon has joined.
18:09:07  Vorpal: What's doing my mixing then
18:09:19  elliott: probably pulse audio?
18:09:24  Vorpal: I didn't install Pulse.
18:09:35  elliott: or it is enabled by default on more modern installs
18:09:39  it wasn't on mine I know
18:09:43  *shrug*
18:11:14  'A survey of salvia users found that 38% described the effects as unique in comparison to other methods of altering consciousness. 23% said the effects were like yoga, meditation or trance.'
18:11:19  what the hell kind of yoga are these people doing.
18:11:30  SPOOKY yoga.
18:11:34  It's like yoga but with a SKULL.
18:11:57  I've never heard anyone say "yoga is great! it feels like you're melting into the floor!"
18:12:25  It's like you've never even DONE yoga.
18:12:36  elliott: holy crap HOW DID YOU KNOW?
18:20:15  elliott: you make me fun.
18:20:24  :3
18:20:41  No, I make everyone fun.
18:20:45  Everyone is just so boring without me.
18:21:21  Coincidentally they use the Latin name ("salvia") also as the Finnish name of the plant. Perhaps because it doesn't really sound very foreign.
18:21:59  elliott: http://www.deuceofclubs.com/amusive/easap036.htm   I'm happy ereryday. because you make me fun, don't worry let's smile
18:22:02  :)
18:22:29 -!- Ngevd has joined.
18:23:06  (And "ryytisalvia" for salvia officinalis in particular, assumedly stolen from Swedish "kryddsalvia".)
18:23:28  fizzie: you finns have no originality.
18:23:37  That is very true.
18:25:05  I can find very few references to the Mondrian programming language
18:25:20  There appear to have been at least two
18:26:05  There's the one the Piet page mentions, but the link there is dead.
18:26:14  There's one on http://en.wikipedia.org/wiki/Haskell_(programming_language)#Related_languages
18:26:18  No link given
18:27:34  Possibly http://hackage.haskell.org/packages/archive/parsec/3.0.0/doc/html/Text-Parsec-Language.html
18:27:46  "You may have landed on this page from following a link for Mondrian. This was a project originally started by Erik Meijer which then moved to New Zealand. Mondrian was a functional language specifically designed to inter-operate with other languages in an OO environment and versions existed for the JVM and CLI. Mondrian also supported ASP.NET, allowing you to embed functional language code in web pages along with C# code. The project predates our in-house Hask
18:27:46  ell work, has not been kept up-to-date with CLI releases, and we no longer make it available."
18:27:57  (From http://kahu.zoot.net.nz/)
18:28:56  fizzie, can I make you my search engine?
18:29:06  I don't have an URL.
18:29:18  Do you support OpenSearch?
18:30:13 * elliott seriously considers writing a web interface to fizzie.
18:30:35  I wonder if it is actually the same thing the Piet page is talking about, since the dude -- at http://research.microsoft.com/en-us/um/people/emeijer/ErikMeijer.html -- links to the same dead place as the Piet page.
18:30:53  This is vaguely creepy
18:31:12  fizzie: IIRC DMM complained that Mondrian was some kind of boring OO thing, so the description kinda fits.
18:31:31  (Missing the functional aspect is understandable if a langauge is targeting the JVM and CLI.)
18:31:48  fizzie: To add to the intrigue, Parsec comes with a language definition for "Mondrian".
18:31:50  There are some papers on the dude's page.
18:31:57  I suspect it's the Haskell Mondrian,t hough.
18:32:03  http://hackage.haskell.org/packages/archive/parsec/3.1.2/doc/html/src/Text-Parsec-Language.html
18:32:11  { reservedNames = [ "case", "class", "default", "extends"
18:32:11    , "import", "in", "let", "new", "of", "package"
18:32:11    ]
18:32:13  Or maybe not?
18:32:19  s/t hough/ though/
18:32:33  http://research.microsoft.com/en-us/um/people/emeijer/Papers/Mondrian.pdf is probably most relevant; at least 'class' is there.
18:32:55  Where have I heard of Erik Meijer before?
18:33:08  Ohh, I think he's (co-)written a lot of Haskell papers.
18:33:41  At least a couple Haskell Workshop and ICFP ones, yes.
18:34:08  Or maybe you recall him from the "XML Support in VB9" paper, that sounds so relevant to your interests.
18:35:07  Totally.
18:36:13 -!- zzo38 has quit (Remote host closed the connection).
18:37:47  A cautionary tale from his page: "A few versions ago, I was know as "the banana man" because of my work on Squiggol and applying category theory to structure functional programs."
18:38:12  *Oh.* He's the bananas, lenses and barbed wire guy.
18:38:17  That explains it.
18:38:54  !userinterps
18:38:55  ​Installed user interpreters: acro aol austro bc bct bfbignum brit brooklyn bypass_ignore bytes chaos chiqrsx9p choo cpick ctcp dc decide drawl drome dubya echo ehird elmer fudd google graph hello id insanetemp jethro kraut lperl lsh map monqy num numberwang ook pansy pi pikhq pirate plot postmodern postmodern_aoler prefixes python redneck reverse rimshot rot13 rot47 sadbf sanetemp sfedeesh sffedeesh simplename slashes svedeesh swedish valspeak wacro warez wc y
18:39:04  !sffedeesh swedish fish
18:39:18  EgoBot: I hate you.
18:39:48  !acro
18:40:21 -!- sebbu3 has joined.
18:40:22 -!- sebbu3 has quit (Changing host).
18:40:22 -!- sebbu3 has joined.
18:41:43  [AUTOMATED QUERY BEGIN]
18:41:47  fizzie: sausages in the 18th century
18:41:47 -!- sebbu2 has quit (Ping timeout: 240 seconds).
18:41:50  [AUTOMATED QUERY END]
18:42:25 -!- DCliche has joined.
18:43:30 * Sgeo|web is easily amused by 4chan.org/flash
18:43:56  ...some stuff may be NSFW
18:44:06  NSFW!?
18:44:08  No, that's not why I'm amused
18:44:17  This channel is the most SFW.
18:44:19  Fuckity fuckity fuck.
18:44:21  The words 'no', 'shit' and 'Sherlock' all come to mind.
18:44:38  No Sherlock shit? Why a ban on specifically Sherlock's feces?
18:45:57 -!- Darth_Cliche has quit (Ping timeout: 260 seconds).
18:46:43  Clearly, v8 is the latest version of Flash player
18:46:50 -!- Jafet has quit (Quit: Leaving.).
18:47:11  fizzie: http://web.archive.org/web/20031202023619im_/http://www.research.microsoft.com/~emeijer/Media/panel.gif
19:03:44  OK, Hackiki now /officially/ has no users.
19:03:44  Yessssssssssssssss.
19:09:42  oh crap, I've been highlighted in #esoteric again
19:09:50 * olsner scrolls back
19:11:03  `quote 605
19:11:10  605)  It is like the Holocaust but with Nazis.
19:11:34  oh, it must've gotten renumbered in all the deletion that happened since that log line
19:13:39  Gregor: What happened :P
19:13:40 -!- kmc has quit (Ping timeout: 240 seconds).
19:14:00  http://hackiki.org/wiki/ ;; it disappointingly still exists???
19:14:16 -!- Zuu has joined.
19:14:18 -!- sebbu3 has changed nick to sebbu.
19:17:05  elliott: Maybe I just don't like the bot highlighting my name.
19:17:19  ^echo shachaf
19:17:46  fungot???
19:17:47  fizzie: FUNGOT!!!
19:25:22  Not Fungot!
19:25:42 -!- oerjan has joined.
19:26:52 -!- Gregor has quit (Excess Flood).
19:27:16 -!- Gregor has joined.
19:27:46 -!- Sgeo|web has quit (Ping timeout: 264 seconds).
19:28:02 * Gregor reappears.
19:28:06  Gregor: Explain the flood and also what you said :P
19:28:07  Hello oerjan
19:28:14  Flood?
19:28:21  * Gregor has quit (Excess Flood)
19:28:28  Uhh, that Idonno :P
19:28:40  Not sure why I got kicked.
19:28:56   OK, Hackiki now /officially/ has no users.
19:28:58  But anyway, the one known user of Hackiki other than myself is now a known non-user of Hackiki :P
19:28:59  OK, now explain :P
19:29:02  I just did.
19:29:31  Gregor: Did they stop because of your SECURITY SPLOIT? :P
19:29:39  (People other than you used Hackiki?)
19:29:43  (Well, "person", I guess.)
19:29:46  (Person other than you used Hackiki?)
19:29:50  I never really got Hackiki
19:30:23  elliott: He hosted a Wiki for a Unix UG on Hackiki, but through me, and was paying me for it. After not using it for two years, he decided to stop.
19:30:42  Gregor: Wow :P
19:31:02  Gregor: Shoulda got him on a long-term contract.
19:32:10 -!- Guest63524 has changed nick to Slereah.
19:34:50   Ngevd: I think it is possibly the only way the Elliott IRC Experience could reach a new level of intensity. What I'm saying is, not only would I get banned, the whole UNIVERSE would get banned.
19:34:58  clearly you misspelled insanity.
19:35:04  `quote elliott
19:35:06  190)  elliott: i like scsh's mechanism best: it's most transparent and doesn't really serve a very useful feature. \ 193)  elliott: it's hard to debug havoc on your mirror if you accidentally hit r, then a character could be multiple words long, depending on the task. \ 202)  elliott: My university has
19:35:30 -!- useless-fungot has joined.
19:35:35  `quote  211)  Vorpal loves the sodomy.   elliott, sure why not \ 212)  [...] ALWAYS OPEN TO TRYING NEW THINGS. \ 213)  So it's not exactly trivial. [Later about same thing]  It's a trivial C program :P \ 220) * pikhq sticks several thousand kg m^2/A s^3 through elliot    pikhq:
19:35:44  I don't think you can annoy elliott by pinging his name in #esoteric, because he's always in here anyway.
19:35:45  `delquote 212
19:35:48  ​*poof*  [...] ALWAYS OPEN TO TRYING NEW THINGS.
19:35:52  Vorpal just added that because of the sodomy one.
19:36:12  fungot?
19:36:41  fungot has gone to a secret meeting of secret bot overlords
19:36:57  I am useless-fungot, I have no state
19:37:04  usless-fungot!!!
19:37:06  hi useless-fungot
19:37:08  we love you
19:37:11  you're not useless
19:37:13  be friends with us
19:37:19  Like friendship mouse!
19:37:21 -!- kmc has joined.
19:37:32  kmc: Kentucky Mutilated Chicken
19:37:43  ^ul (this isn't part of the state, right?)S
19:37:54  hmm, that is indeed pretty useless
19:37:58  Command char is ]
19:38:02  Gregor: Keegan McSomething iirc
19:38:06  ]ul (this isn't part of the state, right?)S
19:38:06  this isn't part of the state, right?
19:38:08  aha
19:38:10  ]ul (test)S
19:38:11  test
19:38:28  ]raw QUIT
19:38:33  :-(
19:39:12  `echo ]ul (test)S
19:39:14  ​]ul (test)S
19:39:22  hmm, it still remembers its ignore list
19:39:48  are you sure that's not HackEgo's bad feature
19:39:55  ?so ]ul (test)S
19:39:55  ]ul (test)S not available
19:39:55  test ...bad insn!
19:39:57  indeed
19:40:06 -!- fungot has joined.
19:40:09 -!- useless-fungot has quit (Remote host closed the connection).
19:40:10  fungot!
19:40:10  Ngevd: memory is automatically freed when the routine returns, no more.
19:40:18  You have killed this imposter!
19:40:24  But he was our friend!
19:40:32 -!- tiffany has joined.
19:40:43  He was mouse-like in friendliness!
19:40:46  And you killed him!
19:40:51  revive useless-fungot fizzie :'(
19:40:51  elliott: i do get to that part
19:40:59  Ngevd: it just freed its memory, as it said
19:41:13  `echo @echo echo
19:41:13  ^style
19:41:14  Available: agora alice c64 ct darwin discworld europarl ff7 fisher fungot homestuck ic irc* jargon lovecraft nethack pa sms speeches ss wp youtube
19:41:15  ​@echo echo
19:41:17  I had nothing to do with any useless fungots. :/ :/ :\
19:41:17  fizzie: sounds great. what kind of comments were you looking for? ' l' is the ' title' sed -e ' s//')" /usr/ bin/ fnord
19:41:59  THEORY: useless-fungot was Deewieant.
19:41:59  Ngevd: undefined method `empty' for :array fnord fnord fnord return fnord fnord y fnord z) ( 5 t))))(if ( i 20)(cons y ( g ( fnord,
19:42:35  fizzie: Thence whom htv.fi????
19:42:42  I suggest you use the IP-ADDRESS MATCHING MACHINE to corraboramorate that theory.
19:43:02  I don't HAVE one of those.
19:43:04  That would be useful.
19:43:13  etacorroborrocate
19:43:23  `run grep cs27125254.pp.htv.fi /var/logs/_esoteric/????-??-??-raw.txt
19:43:24  elliott: fizzie's right, /whowas useless-fungot matches /whois Deewiant
19:43:24  ais523: i'm getting lowest ping delay ever, fnord ms to the nearest mark.
19:43:25  grep: /var/logs/_esoteric/????-??-??-raw.txt: No such file or directory
19:43:43  I should have run a really complex UL program on useless-fungot
19:43:44  ais523: cfunge use no external libraries that rely on mutation with precisely mutative operations. linear-update operations may be fnord, just not doing a dns lookup :p
19:43:55  My THEORY was /right/?
19:44:01  fungot, what do you make of this?
19:44:01  Ngevd: no! type safety really means safety. c++ does not belong to the set
19:44:24  The way the MACHINE works, you set up these numbered balls to resemble IP addresses, and then the balls go to the large drum, and then it rotates, and then you get 7 matching numbers and win millions. Plus three extra numbers.
19:45:30  What if it uses IPv6!?
19:45:39  Then you just put in more balls.
19:46:05  OF COURSE
19:46:30  nanoballs
19:46:30  Mind you, that takes balls to pull off
19:46:53  and a drum the size of half of earth
19:47:44  Is it just me, or has the art for Freefall suddenly improved?
19:48:09  Also there has not been a "HTV" (for "Helsinki TeleVisio") in quite a while; it's been "Welho" since 2006, and I think it's "DNA Welho" now that Sanoma sold the cable TV/Internet business to DNA.
19:48:55  fizzie: Oh, I assumed it was like... Helsinki Technology Vuniversityof.
19:49:50 -!- ive has quit (Ping timeout: 248 seconds).
19:50:08  Those are the old "hut.fi" names.
19:50:10  They should do a Rubik's cube where you have to assemble it into the entire 16-bit RGB colour space.
19:50:14  How big would that be?
19:50:24  Ngevd: how so?
19:50:28  Uh, not 16-bit.
19:50:29  24-bit.
19:50:34  You know, #ABCDEF.
19:50:40 -!- fizziew has joined.
19:50:44  Like this work-box.
19:50:52  fizziew: GET ON THE MATHEMATICS
19:50:53  elliott: YOU'RE NOT ALLOWED TO ABBREVIATE IT!
19:50:59  ais523: ?????????????/////////
19:51:11  adjudicated blind collaborative…
19:51:14  I forget where it goes from there
19:51:18  heh
19:51:21  oerjan, dunno, it just seems to have
19:51:33  Something esolang factory
19:51:40  well my eyes don't really notice anything...
19:51:50  Deewiant: I accidentally joined #esoteric of IRCnet first. There was a single person on the channel, and the topic said something about esoteric philosophy.
19:52:10  Did you at least say "hi"?
19:52:12  DESIGN
19:52:12  FINALLY, somewhere to point people!
19:52:39  Deewiant: No, I /part'd in a huff.
19:52:41  To me, there are only three IRC channels on one server
19:52:52  #esoteric, #esoteric-minecraft, and #darths
19:52:53  fizziew: the idea is that we can tell people to go there if they're coming here for the wrong esoteric
19:52:54  fizziew: That's a bit rude.
19:52:56  On irc.esper.net
19:53:02  fizziew: Why can't I connect to irc.ircnet.org
19:53:21 -!- sebbu2 has joined.
19:53:21 -!- sebbu2 has quit (Changing host).
19:53:21 -!- sebbu2 has joined.
19:53:23  Am I insufficiently European
19:53:41  elliott: http://irc.tu-ilmenau.de/all_servers/
19:53:56  your europeanness is exceedlingly brittle
19:54:01  *-l
19:54:15  ix.irc.at has the most accurate description.
19:54:26  I am more European than most Brits.
19:54:27  Deewiant: I like how the form's broken
19:54:39  elliott: ircnet doesn't have a central send-to-random-server
19:54:48  like Freenode does
19:54:52  * Topic for #esoteric is: EsotericPhilosopher.com - Esoteric Philosophy
19:54:52  * Topic for #esoteric set by Cocytus!~Cocytus@c-76-19-169-95.hsd1.ma.comcast.net at Wed Nov  9 17:48:40 2011
19:54:52  * Users on #esoteric: elliott @Cocytus
19:54:59  IRC
19:54:59  Network: Freenode
19:54:59  Channel: #Philosopher
19:55:12  Let's make friends with him!!!!!!!!!!!!!!!!! Wait no he's probably awful.
19:55:16  Oh god.
19:55:18  I know what I'm going to do.
19:55:22  I'm going to start talking about esolangs in there.
19:55:27  PAYBACK TIME, BITCHES
19:55:32  He's going to be all confused how popular the channel suddenly is.
19:56:26  fizzie: Oh no.
19:56:31  fizzie: My #esoteric tab went red.
19:56:34  That means there's messages.
19:56:36  I'm too embarrassed to look.
19:56:45  It's me
19:56:45  SOMEONE JOIN ME FOR SUPPORT
19:56:47  Don't worry
19:56:49  Oh good.
19:56:53 -!- sebbu has quit (Ping timeout: 260 seconds).
19:56:56  Quite many (at least the .fi) IRCnet servers only allow "local" (for some values of) people; ideally you'd just connect to the server of your university/ISP.
19:56:57  Now that channel is mainly Hexhamers
19:57:02  X-D
19:57:12  fizzie: I just connected to xs4all's.
19:57:15  It's, you know, access for all.
19:57:34  My ISP's server is on the other side of the country and my university's sucks so I use fizzie's ISP's
19:57:52  Deewiant: Oh, Nebula has generic-enough I:lines for that?
19:57:55 -!- DCliche_ has joined.
19:58:14  Also why you be dissin' irc.cs.hut.fi, it's not that bad.
19:58:26  I don't know what an I:line is but the connection works so I guess so
19:58:30  It's in permanent split-mode :-P
19:58:42  lol?
19:59:05  Deewiant: I think I:lines are IP whitelists or something.
19:59:08  To keep the foreigners out.
19:59:20  basically yes
19:59:22  Yes, that would've been my guess
19:59:40  "/stats I" -- I see there's a 0.0.0.0/0 catch-all line nowadays.
19:59:51  Where are the haps on IRCNet, I want to see people talk Finnish
20:00:30  You could consider #linux.fi, I've been banned from there once or twice, for associating with the wrong sort of people.
20:00:32  fizzie: I don't see that
20:00:56  fizzie: I do see *@*.pp.*.fi, though
20:01:16  fizzie: The "wrong sort of people"?
20:01:24 -!- DCliche has quit (Ping timeout: 258 seconds).
20:01:24  * Cannot join #linux.fi (Channel is invite only).
20:01:28  I'm not Finnish enough.
20:01:28  elliott, you know, Swedes
20:01:29  fizzie: Oh, crap, I'm actually on cs.hut.fi, darn
20:01:44  I have been on nebula though :-P
20:01:56  * [fizzie] @!4QPSPt934400 @#irtie @#getnolife #douglasadams #!/usr/bin/ff
20:02:01  22:01 [ircnet] -!- #linux.fi: invite 246*!*@*
20:02:01  22:01 [ircnet] -!- #linux.fi: invite *!*@*.fi
20:02:06  fizzie: Wasn't !4QPSPt934400 the one I invaded last time? :p
20:02:08  Yeah, you need to be Finnish enough.
20:02:08  Also, wow.
20:02:09  getnolife?
20:02:29   22:01 [ircnet] -!- #linux.fi: invite 246*!*@* <-- uh
20:02:31  XD
20:02:44  fizzie: how does that invite even make sense
20:02:46  Vorpal: That's for the autogenerated nicknames.
20:02:52  fizziew: uh?
20:03:04  Vorpal: They get the server number prefix thingie-thingie, 246* matches Finland.
20:03:07  ah
20:03:16  Vorpal: For the current IRCnet "handle nick collisions by renaming" thing.
20:03:41  I see
20:03:52  elliott: Actually it was !4OOW7t934400 at that time; it managed to become empty and therefore got a new random ID generated.
20:04:04  fizziew: Can I forge a .fi hostname easily? I want to join the #linux.fi gang.
20:04:13  Surely IRCnet is lawless enough for that.
20:04:29  I just need to find a really hippie server with a /changehost command.
20:04:55  I'm not sure whether IRCnet servers generally do a forward-lookup check. It could be they just trust reverse DNS as-is.
20:05:36  fizzie: I doubt I control my reverse DNS :P
20:05:39  In which case you'd need to just fake that.
20:05:46  fizzie: It would be great if they used the old USER syntax and believed the hostname you gave it.
20:06:19  Well, no, but you could control it for e.g. a Hurricane Electric and/or SixXS IPv6 tunnel or whatever. (Though SixXS would then ban you for "DNS spam".)
20:07:02  I really wouldn't say #linux.fi would be worth it.
20:07:12  You can join an empty channel and ban yourself to get the same experience.
20:07:18  X-D
20:07:41  Deewiant: So how big would that Cube be
20:08:42  What Cube
20:09:03  elliott: 128x128x128 I thought?
20:09:19   They should do a Rubik's cube where you have to assemble it into the entire 16-bit RGB colour space.
20:09:19   How big would that be?
20:09:20   Uh, not 16-bit.
20:09:20   24-bit.
20:09:20   You know, #ABCDEF.
20:09:27  How big physically, I mean :P
20:09:44  Vorpal: Nah, you can't see the colours on the inside, obviously
20:09:55  If you rotate the result around fully, you should see every 24-bit RGB colour
20:10:04  In a spectrum
20:10:27  > sqrt (2^24/6)
20:10:27    1672.184997739983
20:11:11  Vorpal: Also #getnolife was a sort of a splinter group of "Irti Elämästä ry"; you can try to Googlelate http://fi.wikipedia.org/wiki/Irti_El%C3%A4m%C3%A4st%C3%A4 though I doubt it will much help. Both are defunct now.
20:11:16  @ping
20:11:17  pong
20:11:22  elliott: anyway that was a a322 reference
20:11:46  fizzie: Boredom, and epäviileyden nörttiyden promotion.
20:11:46 -!- Ngevd has quit (Quit: Leaving).
20:12:05  Rautio, May Day: Nerd culture increases -> (and destruction?) [_ Protu (Journal) . 2005 # 2. Prometheus Camp Association. Subsequent 26/11/2009.
20:12:11  Sounds like something fungot would say.
20:12:11  elliott: unlambda is weird
20:12:14  Ha.
20:12:26 -!- Ngevd has joined.
20:12:49  elliott: "The rise (and fall?) of nerd culture" would be a more apt translation of the title.
20:13:06  I prefer "Nerd culture increases -> (and dsetuction?) [_".
20:13:12  s/dsetuction/destruction/
20:15:37  elliott: The original organization organized a "nerd attack" to the Helsinki main railway station in 1999; the main thing I recall from that was that they IRCed from inside the storage lockers of the railway station -- cf. http://www.protu.fi/lehti/lehti2-05/kuvat/nortit_lokeroissa_iso.jpg
20:15:49  Made the "main" newspapers and all.
20:15:50  fizzie: Why am I not this cool???
20:16:28  Then it all sort of fizzled out pretty soon.
20:16:58  elliott, I wasn't lying
20:17:00 -!- Ngevd has quit (Client Quit).
20:19:38  oerjan: have I mentioned how I think (safeWriteIORef :: IORef a -> a -> b -> b) is safe?
20:19:49  safeWriteIORef ref v a = unsafePerformIO (writeIORef ref v >> return a)
20:20:18  Why the b
20:20:28  Deewiant: As opposed to
20:20:36  Some people were annoyed when the social side (meetings and all that) was starting to dominate the organization; there was a (democratic) coup, and then the newly elected government disbanded the organization and started the "People's Democratic Irti Elämästä", while the people who liked being social started "Getnolife". I don't think either one of the new organizations survived for so very long.
20:20:41  elliott: IORef a -> a -> a
20:20:52  Deewiant: Returning what, v?
20:20:56  elliott: Yep
20:20:57  I wasn't ever a member of any of these, just sort of watched from the sidelines.
20:21:01  Deewiant: Less general
20:21:06  Deewiant: (Don't say seq, you need pseq)
20:21:18  Incidentally, the irtie folks were in fact the "wrong people" associating with whom got me banned from #linux.fi.
20:21:49 -!- monqy has joined.
20:22:04 -!- copumpkin has quit (Ping timeout: 260 seconds).
20:22:05  fizzie: Why is Finnish culture so fucking interesting :(
20:22:06  elliott: I was going to say that you don't need the generality for anything but I guess it's easier than using pseq
20:22:10  We have no IRC gangs!
20:22:18  Deewiant: pseq isn't standard
20:22:27  I'm not sure "culture" is the right word here, and this was all long time ago, there's nothing interesting going on in modern-day Finland.
20:22:31  elliott: unsafePerformIO and writeIORef are?
20:22:39  Deewiant: unsafePerformIO is in Haskell 2010
20:22:46  elliott: writeIORef is?
20:22:49 -!- copumpkin has joined.
20:22:58  Hmm, no, surprisingly enough
20:23:01  But it's ubiquitous
20:23:03  pseq ain't
20:23:48  I guess pseq a b = unsafePerformIO (a `seq` return b) is a portable pseq :)
20:26:09 -!- Cocytus has joined.
20:26:38  lol i was going to refer you to this room. but i had a feeling you were already here.
20:26:47 -!- Cocytus has left.
20:27:02 -!- sebbu2 has changed nick to sebbu.
20:27:11 -!- ive has joined.
20:27:19 -!- Cocytus has joined.
20:28:06  (elliot, phantom_hoover)
20:28:06  elliott*
20:28:48  oh, dammit
20:28:52  you've been here before haven't you :P
20:28:58  our beautiful prank ruined forever :'(
20:29:42 -!- Cocytus has left.
20:30:36 -!- GreaseMonkey has joined.
20:30:37 -!- GreaseMonkey has quit (Changing host).
20:30:37 -!- GreaseMonkey has joined.
20:30:53 -!- sebbu has quit (Read error: Connection reset by peer).
20:31:18 -!- ais523 has quit (Remote host closed the connection).
20:31:38 -!- sebbu has joined.
20:31:38 -!- sebbu has quit (Changing host).
20:31:38 -!- sebbu has joined.
20:33:00 -!- ais523 has joined.
20:33:24  CakeProphet: "you" = ?
20:34:44  Weak (MVar (HashMap a (Weak b)))
20:34:47  ais523: behold my beauty
20:34:53  in
20:34:55  the form of a type
20:35:46  elliott: it's a type
20:35:50  yep
20:35:53  I'm not very good at admiring type beauty
20:36:04  ais523: does it help if you know that Weak is a weak pointer?
20:36:07  and MVar a mutable reference?
20:36:18  which language is this?
20:36:21  Haskell
20:36:27  it, umm, makes it worse
20:36:35  worse in a /beautiful/ way
20:37:45 -!- Ngevd has joined.
20:38:13 -!- Ngevd has quit (Client Quit).
20:43:27 -!- Ngevd has joined.
20:43:46  Remember when we made ABCDEF...G?
20:44:18   you've been here before haven't you :P <-- i thought the nick looked familiar
20:44:37  oerjan: insufficient horror at the safety of safeWriteIORef
20:45:29  elliott: Ooh, I'm Finnish!
20:45:36  shachaf: Quite.
20:45:38 * shachaf knows little of Finnish culture, though. :-(
20:45:48  elliott: i don't understand why that would be considered safe...
20:45:50  shachaf: It's based around IRC and the demoscene.
20:45:58  oerjan: it has no observable side-effects outside of IO
20:46:10  elliott: I don't think that's hwo Finnish culture works...
20:46:33  oerjan: and, of course, with things like StableNames and so on, we find it perfectly acceptable to be able to observe more about the evaluation of pure expressions than the semantics allow, so long as it is in IO
20:46:45  Deewiant: BTW, I think Data.IORef is standard, since you can implement it in terms of the FFI
20:46:56  Well, hmm
20:46:59  I guess only for Storable types
20:47:14  Oh wait
20:47:18  You can do it in terms of mutable arrays methinks
20:47:28  Finnish culture has no observable side-effects outside of IO!?
20:47:31  Which aren't standard >_<
20:48:15  Aha
20:48:16  StablePtrs
20:48:18  let you do it
20:48:26  Ngevd: it's the truth!
20:48:46  the finns are a pure people
20:49:54  Oh, hmm
20:49:59  StablePtrs are immutable
20:50:08  Aha
20:50:10  But they're Storable
20:51:01  elliott: iirc that's how the reflection package worked
20:51:26  I see philosophy guy caught onto us
20:51:40  oerjan: I think I have a workable implementation :)
20:51:42  newtype IORef a = IORef (ForeignPtr (StablePtr a))
20:51:44  strategy, that is
20:51:51 * elliott briefly wonders why he's implementing portable IORefs
20:52:48  briefly? what made you stop wondering?
20:52:58  to maintain the illusion that there will ever be a non-ghc-based full haskell implementation again
20:54:01  ghc is like this beast that just keeps growing type tentacles
20:55:51  some time in the next 2-3 years someone (perhaps named kiselyov) will discover that ghc's type system has grown to the point of supporting a full embedded dependent type system by accident
20:56:01  Trivia: all natural numbers are one less than another natural number
20:56:01  This works backwards almost all the time
20:58:55  Deewiant: oerjan: http://sprunge.us/Qcjg
20:59:01  Therefore Data.IORef is standard, Q.E.D.
20:59:20  mkFinalizer?
20:59:39  Deewiant:
20:59:39  foreign import ccall "wrapper"
20:59:39    mkFinalizer :: (Ptr a -> IO ()) -> IO (FunPtr (Ptr a -> IO ()))
20:59:45  Yes.....
20:59:49  That doesn't look "standard"
20:59:49  http://www.haskell.org/onlinereport/haskell2010/haskellch8.html
20:59:54  Grep /wrapper/
21:01:16  ghc: error: a C finalizer called back into Haskell.
21:01:16     This was previously allowed, but is disallowed in GHC 6.10.2 and later.
21:01:16     To create finalizers that may call back into Haskell, use
21:01:16     Foreign.Concurrent.newForeignPtr instead of Foreign.newForeignPtr.
21:01:17  Swoot
21:03:58  Deewiant: But yes, all that's perfectly standard apart from my maybe-broken finaliser
21:06:25  Dammit America, stop worrying me with your absurdly terrible job market.
21:06:59  Deewiant: Actually no, my code is perfectly fine, GHC just disallows it for performance reasons :)
21:07:06  just worry about italy instead
21:07:12 -!- songhead95 has joined.
21:07:22  hi songhead95!
21:07:24  `quote rotting sea life
21:07:26  There is a wasp.
21:07:26  On my pillow.
21:07:26  Advice?
21:07:26  99)  think of all the starving kids in china who don't have rotting sea life to eat
21:07:32  Sleep.
21:07:38  Love
21:07:43  Sleep on it
21:07:45  Eh; Italy doesn't blend with my perception of things like the US does.
21:07:52  Ngevd, magma.
21:07:53  Ngevd: Friendship wasp
21:08:08  Ngevd: empty glass
21:08:32  Might somebody be able to tell me why my should-be brainfuck interpreter doesn't interpret brainfuck?
21:08:36  http://pastebin.com/5QhHSfA0
21:08:42  +something to slide between
21:08:57  oerjan, no that is not in the spirit of friendship
21:09:08  I waved my pillow around outside my window for a bit
21:09:14  songhead95: i note that you don't have any code to handle [
21:09:17  It's not on my pillow anymore
21:09:18  animal friendship: animal husbandry for the 21st century
21:09:20  songhead95: what about when you hit [ and the cell is 0?
21:10:23  oh whoops
21:10:46  elliott: wow, Oracle are alleging that Google copied which classes inherit from which other classes
21:10:53  :D
21:11:33   According to Oracle’s java.util API specification, the Hashtable class is a subclass of Dictionary, and implements three interfaces: Serializable, Cloneable, and Map, which are found in the java.lang, java.io, and java.util packages, respectively. This organization is hardly intuitive or preordained, but Google copied it. Android’s Hashtable class is likewise a subclass of Dictionary, and implements the same three interfaces, with the
21:11:34  same three names, found in the same three corresponding Android packages.
21:12:56  In other news, Hexham beat Stobswood 8 2
21:13:01  olsner: it is done: http://hpaste.org/53881
21:13:07  Wait a moment 'till I find out what sport
21:13:24 -!- DCliche has joined.
21:13:37  Oh.
21:13:39  Football.
21:17:00 -!- DCliche_ has quit (Ping timeout: 258 seconds).
21:27:11  ...Where's Stobswood?
21:28:53  it doesn't really exist, they just made it up to make the hexhammers feel better about their football team.
21:31:01  Ngevd: morpeth, apparently
21:31:04  http://www.google.co.uk/maps/vt/data=Ay5GWBeob_WIPLDYoIWcfVXxvZu9XwJ55OX7Ag,C5cdt2A5CfGdk67NP3fQV7xwKKLsYcHz8F-9A1U08Az-t3JBJy4hche_-np_WGhzG-UwL4AZsYR5Ig
21:31:07  wow they found the most boring place
21:31:20  http://en.wikipedia.org/wiki/Widdrington_Station_and_Stobswood population 120
21:35:21    According to Oracle’s java.util API specification [...] <-- are they complaining about google following the spec?
21:35:37  oh right
21:35:41  but why!?
21:35:58  money
21:36:10  I see
21:37:02  Vorpal: they're complaining about Google copying parts of the spec, whilst not implementing others
21:37:19  in particular, they're alleging copyright infringement of the Java API
21:37:25  btw, dragonborn (which iirc show up in D&D?, and now also in Skyrim) make little sense
21:37:30  if you actually think about it
21:37:36  and most of the arguing that's going on is about whether this is a meaningful concept or not
21:37:46  Vorpal: it's a D&D4 thing, I think; probably from a D&D3 splatbook
21:37:47  I'm pretty sure that genetically it wouldn't work either
21:37:58  fantasy: genetically accurate
21:38:19  elliott: but also think what it means. Some human did what with a dragon!?
21:38:33  Vorpal: in D&D, dragons can shapechange at will
21:38:42  presumably it happens while the dragon is in human form
21:38:43  hm okay
21:38:47  well okay
21:38:51  Vorpal: It would be more unrealistic to /not/ have that happen!
21:39:19  elliott: well yes if you /had/ the concept of dragonborn you need something like that.
21:39:35  but I'm questioning the whole concept as it were
21:39:37 -!- Ngevd has quit (Ping timeout: 258 seconds).
21:54:14  someone on the iwc forum pointed out that tomorrow's iwc rerun will be no. 11, and appear at 11:11 MET 11/11/11
21:54:54  heh
21:55:04  oerjan: did you know: you'll be over 50 once iwc finishes rerunning
21:55:15  AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
21:55:50 -!- augur has quit (Remote host closed the connection).
21:59:57 -!- Zuu has quit (Ping timeout: 244 seconds).
22:00:55  oerjan: :D
22:06:17 -!- Ngevd has joined.
22:06:24 -!- Zuu has joined.
22:06:33 -!- airells has joined.
22:06:40  GOOD NEWS, ESOLANGERS!
22:06:48  I've done some work on XSLT S and K
22:06:54  AND IT WORKS FOR ONE ITERATION
22:07:05  YAY
22:07:06  It can turn SKKx to Kx(Kx)
22:07:12  Mine worked for one iteration, too.
22:18:14 -!- derdon has quit (Remote host closed the connection).
22:23:56 -!- Taneb has joined.
22:25:40 -!- Ngevd has quit (Ping timeout: 240 seconds).
22:29:36 -!- Darth_Cliche has joined.
22:30:19 -!- Taneb has quit (Read error: Connection reset by peer).
22:30:45 -!- Taneb has joined.
22:32:43 -!- DCliche has quit (Ping timeout: 276 seconds).
22:38:26 -!- Taneb has quit (Read error: Connection reset by peer).
22:41:42  Result!
22:41:53  I've hopelessly confused someone in #Philosopher!
22:42:03  STRIKE ONE FOR ESOLANGS
22:44:07 -!- Taneb has joined.
22:44:20  Phantom_Hoover, how?
22:44:56  Why doesn't //app[./*[position()=1]/*[position()=1 and self::k] or ./*[position()=1]/*[position()=1]/*[position()=1 and self::s]] work?
22:45:16  `pastelogs Sut-Heb
22:45:27  http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/paste/paste.25178
22:45:29  fungot?
22:45:29  Taneb: language files code comment comment blank total iirc) are *evil*
22:45:37  Ooh, I'm all bold
22:45:38  Phantom_Hoover: Oh my god.
22:45:41   Hmm, so is Philosopher a Brainfuck derivative? lol
22:45:41   you;ll be brainfucked you stick around long enough
22:45:41   So is that a yes?
22:45:41   well thats if you stimulaed by the esoteric arts
22:45:41   if not then you'll just think where out of our mindzx
22:45:42   Yesyesyes but is it a Brainfuck derivative/
22:45:42  Phantom_Hoover: That guy's been in here too.
22:45:44   so what borught you here?
22:45:46   A desire to purge all Brainfuck derivatives.
22:45:48   I am like the Terminator except more so.
22:45:49  Phantom_Hoover: It's literally a refugee for stupid #esotericers.
22:45:50   brainfuck derivitive's what do you mean by that
22:46:00  Stop flooding you idiot Phantom_Hoover Phantom_Hoover BOTH THOSE PEOPLE HAVE BEEN IN HERE BEFORE
22:46:01  IT'S AMAZING
22:46:15  http://esolangs.org/wiki/Object_(programming_language)
22:46:16  YES
22:46:21  WE SURROUND THEM
22:46:24  ais523: good news and bad news
22:46:38  the good news is that it's not obviously a BF deriv
22:46:41  ais523: good news: we have two places to send people who come here for the wrong reasons
22:46:46  ais523: bad news: they're both awful
22:47:05  the bad news is, well just look at it
22:47:26  ais523: at least the syntax highlighting is pretty
22:47:42  ais523: article violates two policies
22:47:45  at the least
22:47:45  I'm unsure whether that's syntax highlighting or part of the source
22:47:49  can you tell what they are?
22:47:50  what's the other one?
22:47:54  oh right
22:47:54  what's the first one?
22:47:56  userpage link, category?
22:47:58  yep
22:48:01  I missed the userpage pothole
22:48:09  it's also not linked from anywhere it should be
22:48:18  the good thing about Graue's rules is, they're really good at annoying people
22:48:23  especially when they're stupid rules
22:48:23  and there's not enough information to figure out how to categorise it
22:48:36  I actually like the no-userspace-potholes rule
22:48:50  It's reasoanble enough.
22:48:52  and as for the cats rule, if it gets rid of articles like that I can live with the false positives ;P
22:49:05  no unauthorised cats
22:49:07  they will not be fed
22:50:04  `quote matrix of solidity
22:50:07  301)  enjoy being locked in your matrix of solidity
22:50:19  Phantom_Hoover: What has he said after not gbeating around the bush.
22:50:23  do we have an esolang based on the matrix of solidity concept yet?
22:50:31  elliott, nothing.
22:50:35  :'(
22:50:46  ais523: no, it would inevitably fail to live up to expectations
22:51:04  ais523: The esolang... is us.
22:51:12  elliott: that's IRP, isn't it?
22:51:24  No, that esolang is certain parts of us projected onto the internet.
22:51:27  The matrix of solidity is literally us.
22:52:04  Phantom_Hoover: Oh dear, Cocytus has /msg'd me.
22:52:08  I'm afraid to check the tab.
22:52:33  Oh wait, it's okay, a mentality is transcendent.
22:52:50  "Freenode is the most reliable network for IRC and the most secure." -- http://www.esotericphilosopher.com/chat/
22:52:58  whatever you say...
22:53:20  ais523: btw, could you delete [[User:Ehird/sandbox]]?
22:54:07  elliott: after making sure you aren't burying the history of something, yes
22:54:12  Nobody tell Timwi about the Symbol of the Day.
22:54:22  the hermitian matrix of solidity
22:54:23  ais523: Damn!
22:54:42 * ais523 waits for elliott to come to a realisation
22:55:31  deleted, anyway
22:55:48  So what was it?
22:56:00  ais523: What realisation? That wasn't damning you.
22:56:04  That was just damning... the empty string.
22:56:08  elliott: I know
22:56:12  that's why I didn't get annoyed
22:56:14  I just thought it was amusing
22:56:15  heh
22:56:17  in context
22:56:37  damn "you"
22:56:41  the string, that is.
22:57:05  that's also a bizarre operation
22:57:11  Damn damning.
22:57:15  And damn damnation.
22:57:18  And damn "damn".
22:57:22  ais523, damn you!
22:57:24  Damn.
22:57:30  jean claude van damn
22:57:39  Phantom_Hoover: why? that's an incredibly mean thing to do on such minor motivation
22:57:51  if I thought you believed it, I'd be furious
22:57:55  as it is, I'm merely angry
22:58:02  Well, #xml should help me with my XSLT problems
22:58:10  ais523, actually angry, or theoretically angry?
22:58:17  everyone fear the hoover damn
22:58:22  Phantom_Hoover: actually, believe it or not
22:59:11  ais523, that's an awful lot of effort to go to for the sake of being quirky.
22:59:21  Phantom_Hoover: anger takes /effort/?
22:59:25  it's suppressing anger that takes effort
22:59:29  especially when people say such mean things
22:59:42  Phantom_Hoover discovers that not everybody shares his value system.
22:59:50  You're forcibly ignoring about three different aspects of standard human communication.
23:00:29  Phantom_Hoover: people using words with meanings other than their actual meanings confuses me, to some extent
23:00:39  because communication makes no sense if people do it too often
23:00:40  I suggest we pester #philosophy
23:00:42  also, butterfly
23:00:54  Taneb: we've done that before
23:00:58  they're all boring
23:01:10  Awww
23:02:22 * Phantom_Hoover → sleep
23:02:23 -!- Phantom_Hoover has quit (Quit: Leaving).
23:02:42  ais523: god says he's taking it back on behalf of ph, btw
23:04:33  ais523: heh, I just read a usenet post by "alex23" in rec.games.roguelike.development convinced you wrote it
23:04:48  and wondering why it was so bizarrely out-of-character
23:04:48  I didn't
23:07:37  @ping
23:07:37  pong
23:08:46 -!- airells has left.
23:09:07  ^def ping ul (pong!)S
23:09:08  Defined.
23:09:11  `ping
23:09:12  pong
23:09:17  !ping
23:09:26  !addinterp ping c puts("Pong!");
23:09:27  ​Interpreter ping installed.
23:09:28  !ping
23:09:40  :/
23:09:57  !delinterp ping
23:09:57  ​Interpreter ping deleted.
23:10:04  !addinterp ping c (
23:10:05  ​Interpreter ping installed.
23:10:06  !ping
23:10:09  !ping
23:10:12  Gregor: ?
23:10:29 -!- myndzi\ has joined.
23:11:10  ^ping
23:11:10  pong!
23:11:27   ^def ping ul (pong!)S
23:11:28  elliott: EgoBot's interpreters haven't worked for weeks
23:11:33  oerjan: *sigh*
23:11:35  !delinterp ping
23:11:36  ​Interpreter ping deleted.
23:11:41  !addinterp ping c puts("Pong!");
23:11:42  ​Interpreter ping installed.
23:11:43 -!- Taneb has quit (Read error: Connection reset by peer).
23:11:47  that'll work when they do
23:11:56  !delinterp ping
23:11:57  ​Interpreter ping deleted.
23:11:58  !addinterp ping c puts("Pong.");
23:11:59  ​Interpreter ping installed.
23:11:59  too happy
23:12:06 -!- Taneb has joined.
23:12:51  !c puts("Pong!");
23:13:34  !show ping
23:13:55 -!- myndzi has quit (Ping timeout: 252 seconds).
23:14:03  !help
23:14:03  ​help: General commands: !help, !info, !bf_txtgen. See also !help languages, !help userinterps. You can get help on some commands by typing !help .
23:14:17  !help userinterps
23:14:18  ​userinterps: Users can add interpreters written in any of the languages in !help languages. See !help addinterp, delinterp, show | !userinterps. List interpreters added with !addinterp.
23:14:41  !show swedeesh
23:14:55  !userinterps
23:14:55  ​Installed user interpreters: acro aol austro bc bct bfbignum brit brooklyn bypass_ignore bytes chaos chiqrsx9p choo cpick ctcp dc decide drawl drome dubya echo ehird elmer fudd google graph hello id insanetemp jethro kraut lperl lsh map monqy num numberwang ook pansy pi pikhq ping pirate plot postmodern postmodern_aoler prefixes python redneck reverse rimshot rot13 rot47 sadbf sanetemp sfedeesh sffedeesh simplename slashes svedeesh swedish valspeak wacro warez
23:15:04  !show svedeesh
23:15:34  somehow show doesn't work though the rest of those special commands do
23:15:47  !show numberwang
23:16:13  does !show actually do anything at all?
23:16:27  ^show source
23:16:27  (http://git.zem.fi/fungot/blob/HEAD:/fungot.b98)S
23:16:32  !commands
23:16:34  yes, it's supposed to show the source of a userinterpreter
23:16:45  !showinterp svedeesh
23:16:52  !show reverse
23:16:58 * Madoka-Kaname shrug
23:17:01  !svedeesh
23:17:13  !reverse test
23:17:15  Um
23:17:34  Madoka-Kaname: those don't work.
23:17:47  only some special commands do
23:20:10  oh no, Pegasus made another page with the same policy violations
23:20:25  someone else go fix them, so they won't think it's just me on a mad crusade against them
23:20:38  The Parnassus Programming Language (2007, by Erick Atencio) is a programming language with features that other languages never had before. It is based on the When instruction, that allows to run a procedure in the moment an event happen.
23:20:44  ais523: propose for deletion, not an esolang
23:20:49  event-based programming is a well-known concept
23:20:57  and the examples shown have no esoteric features whatsoever
23:20:58  not even syntax
23:21:10  well, apart from using the terrible whitesmiths indentation style
23:24:36  these new languages....
23:24:46  why is every language bad
23:24:50  except for the good ones
23:24:59  but who cares about those
23:25:04  Because mediocrity sucks
23:25:07  ais523: he just dropped another one
23:25:13  ais523: can you block him for spamming?
23:25:19  ugh what
23:25:32  what is it with this guy
23:25:35  Category: Impossible Programming Inc
23:25:36  elliott: the thing is, I'm not convinced it's spam or off-topic
23:25:41  banned for category
23:25:42  monqy: that's a clear policy violation
23:25:48  I think we should each clean up one page at a time
23:25:50  until he gets the point
23:25:54  different person on each page
23:26:16  I'll take Parnassus
23:26:30  If you explain how you mean clean up
23:26:52  ais523: http://esoteric.voxelperfect.net/wiki/Talk:Parnassus
23:27:01  how many !votes do we need for deletion? :P
23:27:15  Taneb: fix the userspace pothole, fix the categories
23:27:29 -!- copumpkin has changed nick to shylock.
23:27:31  elliott: technically only one, but that means it gets deleted after about 10 years if anyone still cares by then
23:27:37  the more support for deletion, the faster it gets deleted
23:27:39 -!- shylock has changed nick to copumpkin.
23:28:13  I'm antilooking forward to [[Hera Runtime]], anyway
23:28:16  http://esoteric.voxelperfect.net/wiki/User_talk:Pegasus
23:28:48  ais523: [[Hebe Script]] is quite uncontroversially offtopic, methinks
23:29:00  it's Not Even FURscript
23:29:07  it's just... a language
23:29:07  not even snack
23:29:18  elliott: my brain's having problems reading it
23:29:22  it just mentally filters the page out
23:29:25  what does it say?
23:29:30  Hebe Script is a simple scripting language that allows for the creation of little applets for the Hera Runtime. t has the CommonSystem library preloaded, and it does not have a App object, so it does not need a "When app.run = True" main method.
23:29:30  [edit]How to copy a file to the floopy disk
23:29:30    if get DiskSpace with "a:\";or "b:\"
23:29:30     Higher Than FileSize with PublicArg-1
23:29:31       call CopyFile with PublicArg-1 with (get IsAvailable with "a:\";or "b:\")
23:29:33       End
23:29:35     End
23:29:37  PublicArg are the parameters that the script received.
23:29:39  it ties in with Parnassus
23:29:41  it seems
23:29:50  ais523: fun fact: there's a syntax-highlighted comment on [[Parnassus]]
23:29:52  it's just almost invisible
23:29:52  bleh, I can't read it even when you post it, it's just that bland
23:30:07  elliott: I noticed, I read the source of pages before the pages themselves
23:30:14  simple anti-goatse trick
23:30:55 * elliott attempts to figure out how much he values Ryan North sketches of T-Rex with a hat on
23:31:14  elliott: thinking about buying one, or about selling one?
23:31:20  heh, buying
23:31:53  it's quite difficult to estimate, as I get to pick from a large but finite set of unknown elements
23:31:56  If i = ( 4; or 2; or 1)
23:32:08  ais523: that's not so unreasonable, Perl 6 has that
23:32:09  and Icon
23:32:13  but the syntax is wow
23:32:17  I know Perl 6 has it, but its syntax is much saner
23:32:27  I saw somebody wearing an xkcd shirt today
23:32:28  Call write:string With const "The number is two, four or eleven"
23:32:31  please tell me that's not a typo
23:32:49  ais523: what typo?
23:32:51  Taneb: did you run away
23:33:04  elliott: ( 4; or 2; or 1) versus "two, four or eleven"
23:33:09  ais523: heh
23:33:12  ais523: it's ESOTERIC!!!
23:33:36  elliott, nah, he hadn't actually heard of xkcd
23:33:41  wat
23:33:58  did a frend give it to him as present
23:33:59  elliott: /some/ xkcds are good…
23:34:08  monqy, exactly
23:34:10  I like the one with the arrow
23:34:27  ais523: yes, but to wear an xkcd shirt in late 2011, well after the average quality of xkcd sunk from far above average to so, so below average?
23:34:50  elliott: it might still be an xkcd shirt of a good xkcd
23:35:03  I know enough about xkcd to know to and how to avoid xkcd shirts, but it doesn't matter anyway, because I refuse to wear anything but plain shirts
23:35:20  I've got a Homestuck shirt
23:35:28  ais523: I just checked, all the xkcd shirts suck :)
23:35:31 * elliott objective
23:35:43  elliott: which in your opinion is the least sucky?
23:35:49  I'm planning on getting an IWC shirt
23:35:53  so I can see how bad even the least sucky is for myself
23:36:02  ais523: probably http://imgs.xkcd.com/store/imgs/athletic_square_0.jpg, as it's impossible for the internet to run down into oblivion :)
23:36:25  although http://imgs.xkcd.com/store/imgs/woodpecker_300.png isn't bad
23:36:42  woodpecker is harder to associate with xkcd
23:36:49  You have new messages (last change).
23:36:50  oh no
23:36:53  oh no
23:36:56  ais523: defend me from pegasus if he cyberbullies me pls ;_;
23:37:06  oh no he was nice
23:37:11  now i have to feel slightly guilty about being a jerk
23:37:11  but I'm about to go home
23:37:17  i literally cannot win!!
23:37:25  dear people: don't talk to me; love, elliott
23:37:40  ais523: what's your favourite hat????
23:37:49  rated on pure... hattiness
23:38:00  elliott: bowler hat, I think
23:38:06  it's particularly hatty
23:38:07  oh, elliott is feeling misanthropic; let's shower him with love
23:38:13  Classy! But: Classy for a T-Rex???
23:38:19  wow, xkcd 970 is actually mildly insightful
23:38:25  (although, not actually /amusing/)
23:38:40  elliott, oerjan: AND I REFUSE TO FIX THEM MUAHAHAHAHHA
23:38:59  Gregor: but but ;_;
23:39:23  why the heck did it break, anyway
23:39:27  ais523: hmm, that convinced me to archive binge from there to the latest xkcd
23:39:30  ais523: I regret having read 972
23:39:40  ah, OK
23:39:48  * elliott masochist
23:40:02  oerjan: it's about five comics :P
23:40:06  wow 972 is bad
23:40:36  I'm going to have to sue him over 974, those @ design documents are classified
23:41:31  elliott: hey, bad comic saved by funny comment from a viewer
23:41:43  Man. Hats are complicated.
23:41:44  ais523: heh
23:41:46  wow, that sounded worryingly Vorpalish, and I don't know why
23:41:56  "hey,"
23:42:04   why the heck did it break, anyway // I have no idea; if I knew, I'd fix it :P
23:42:36  Gregor, are you available for hat identification services.
23:43:56  elliott: Depends on whether I can actually identify the hat in question.
23:44:02  elliott: If I can't, I wasn't available.
23:44:10  !ping
23:44:28  !pong
23:44:34  !delinterp ping
23:44:35  ​Interpreter ping deleted.
23:44:42  !addinterp ping c puts("Pong!");
23:44:42  Gregor: Feather-based hat identification services.
23:44:43  ​Interpreter ping installed.
23:44:46  !ping
23:44:56  elliott: Errr ... identification based on feathers makes little sense.
23:44:58  Hmm ...
23:45:00 * ais523 puts a feather in Gregor's cap
23:45:23  Gregor: Whoosh
23:45:26  Or perhaps me-whoosh
23:46:08  Mwhoosh.
23:46:12  It's Welsh.
23:49:06  !addinterp ping c puts("Pong!");
23:49:06  ​There is already an interpreter for ping!
23:49:20  (just checking if it's actually there :P)
23:49:29  !c puts("Pong!")
23:49:52 -!- EgoBot has quit (Remote host closed the connection).
23:50:01  And there's the problem
23:50:03 -!- EgoBot has joined.
23:50:06  I just disco'd it :P
23:50:38  !c puts("Pong!")
23:51:01 -!- elliott has quit (Read error: Connection reset by peer).
23:51:11 -!- elliott has joined.
23:51:19 -!- elliott has quit (Changing host).
23:51:19 -!- elliott has joined.
23:51:56  fork: retry: Resource temporarily unavailable HAHA WHOOPS
23:52:26 -!- Gregor has quit (Quit: Coyote finally caught me).
23:53:13 -!- esowiki has joined.
23:53:13 -!- glogbot has joined.
23:53:13 -!- HackEgo has joined.
23:53:15 -!- EgoBot has joined.
23:53:25 -!- Gregor has joined.
23:53:32  wb
23:54:08  YOU SAW NOTHING
23:54:24  !ping
23:54:26  Pong!
23:54:28  i definitely saw no glogbackup
23:54:38  oerjan: I saw that too >_>
23:54:40  Which distresses me.
23:54:49  Okay, who's bright idea was it to make "xml" an invalid name for xsl:processing instuction?
23:55:19  !svedeesh We are working again!
23:55:19  Fe-a-a ire-a-a foorkeeng igeeee!  Bork Bork Bork!  Bork Bork Bork!  Bork Bork Bork!
23:56:04  * glogbot has quit (Remote host closed the connection)
23:56:04  * HackEgo has quit (Remote host closed the connection)
23:56:04   rip
23:56:04   the whole Gregor empire collapsed
23:56:04  * glogbot (foobar@codu.org) has joined #esoteric
23:56:05  thats what
23:56:08  glegbutt missed
23:56:46  Gregor: so was the process table entirely full, or something?
23:57:03 -!- ais523 has quit (Ping timeout: 248 seconds).
23:57:38  init schemes always seem so ridiculously complicated to me.
23:58:03  I mean, systemd... upstart... Holy crap, Debian dynamically creates a makefile for it...

2011-11-11:

00:00:10  pikhq: DAILY REMINDER THAT KITTEN'S SERVICE MANAGEMENT SOLUTION IS THE BEST???
00:01:26  I hope that's fixed but the only way I can test it is to kill glogbot :P
00:02:29  Well, never mind, I could make it react to something else as if it was glogbot quitting.
00:03:10 -!- fungot has quit (Ping timeout: 244 seconds).
00:03:18  elliott: At a minimum, it can't be worse than what's common.
00:03:39 -!- Taneb has quit (Ping timeout: 258 seconds).
00:03:43  If it has any sort of intelligence at all in its design, that is. :P
00:03:43 -!- glogbackup has joined.
00:03:49  Hello glogbackup!
00:03:54  Your services will not be necessary thank you.
00:04:20  And can anyone tell me why I should have to wait for every single daemon ever to start before getties spawn?
00:04:53 -!- fizzie has quit (Ping timeout: 276 seconds).
00:05:12 -!- glogbackup has left.
00:05:41  Turns out my dead-man's switch had a bug, it wouldn't set properly when codu came BACK :(
00:06:16  the man somehow stayed dead
00:06:21  I could understand waiting until *certain* daemons spawn for getties to start, but every single damned one?
00:06:36  I genuinely don't need to wait for e.g. apached to start before I log in.
00:06:47  Erm, just apache.
00:06:51  Gregor: Have you ever actually merged glogbackup locks in
00:06:57  elliott: Haven't even implemented it :P
00:07:10  elliott: But it's nice to know they may or may not be there if I do or do not need them!
00:08:12  X-D
00:10:16 -!- fizzie has joined.
00:22:57 -!- augur has joined.
00:24:09 -!- augur has quit (Remote host closed the connection).
00:25:17 -!- hagb4rd has quit (Ping timeout: 240 seconds).
00:26:01 -!- sllide has quit (Read error: Connection reset by peer).
00:29:17 -!- hagb4rd has joined.
00:35:10 -!- ive has quit (Quit: leaving).
00:37:55 -!- boily has quit (Ping timeout: 260 seconds).
00:43:59  15:32 < ais523> CakeProphet: "you" = ?
00:44:13  context?
00:44:15  ah, he's not here.
01:00:15 -!- tiffany has quit (Quit: nini~).
01:02:29 -!- hagb4rd has quit (Ping timeout: 240 seconds).
01:04:54 -!- elliott has quit (Remote host closed the connection).
01:50:36 -!- copumpkin has quit (Ping timeout: 255 seconds).
01:56:07 -!- pkzip has joined.
01:56:35 -!- oerjan has quit (Quit: Good night).
01:58:36  whats the Topic ?
01:58:48 -!- madbr has joined.
01:59:05  ...
01:59:39  did some progress on the definition only language :D
02:00:10  Its a human Forth-language ?
02:00:29  nah, I'm not sure which language it's the most like
02:00:32  or a cpu-oriented one..
02:00:45  your no programmer
02:00:47  but there are 5 constructs
02:00:48  me guesses
02:00:55 * pkzip figures
02:01:19  - variables and multidimensional variable array
02:01:20  s
02:01:42  you reinvented Forth with variables..
02:01:53  Should I inform chuck ?
02:02:01  - iterators/expression only variables
02:02:36  - litterals/immediates (ex: 5, 'a')
02:02:53  if its a programming language, u had just reinvented Forth !
02:03:01  ( as was foretold )
02:03:07  ( by the fathers )
02:03:07  - comparators (=, !=, < >, <=, >=)
02:03:23  - math operators (+ - * /)
02:03:25  elders, my mistake
02:03:37  is it using reverse-polish math ?
02:03:44  actually it's prefix
02:03:52  so forwards-polish :D
02:03:52  prefix-forth
02:04:03  there was someone working on it
02:04:15  anyways there's no stack
02:04:15  his name was john
02:04:23  so it can't be forth
02:04:42  it has to use stacks somewhat
02:05:03  oh i get it
02:05:10  esoteric programming languages
02:05:15  - there's no defined execution order: statements are to be executed in any order, any number of times
02:05:18  my fav !!!!!!!!!1
02:05:29  oh
02:05:38  i hate the fucked-up psycho ones
02:05:43  haha
02:05:48  what about unlambda
02:05:59  I like the useful ones.
02:06:11  - variables can only be defined. they can never be undefined
02:06:13  stuff like my own version of brainfuck
02:06:17 -!- zzo38 has joined.
02:06:30  or a very minimal brainfuck with some good ideas
02:06:39  also there is only one value that variables can have: true
02:06:53  its a joke langauge
02:07:01  no it's actually turing complete
02:07:35  it can't pass turing if all variables have only one value
02:08:15  well, the "iterator" values can have any integer value
02:08:22  including over 2^32
02:08:35  but they're only valid inside the statement
02:08:49  the trick is that a value can be true, or undefined
02:09:34  when I try to work on a language, its something that wud at least interest someone
02:09:35  and since you can make an array, you can make a numerical variable by making an array and only defining one of the values
02:10:11  When I do a language I'm trying to come up with a new, mind expanding paradigm :D
02:10:33 -!- Sgeo|web has joined.
02:10:48  so to define the variable "toto" to 5, you would go
02:10:51  toto 5
02:11:08  theres nothing to learn after Forth and LISP, and AOP, and.. oh.. i guess your right..
02:11:27  which actually means if(true) { toto[5] = true }
02:11:50  to do varz = varx + vary, you would go
02:11:53  but I prefer my mix of C/Forth/With-LISP-Macros wud be the best
02:12:13  varz z varx x vary y = z + x y
02:12:23  this actually means
02:12:47 -!- Aune has quit (Quit: Lmnar).
02:12:50  Its too late for me to try and comprehend what ur trying to code there
02:13:03  and I am the only hacker in here, so..
02:13:14  the only one listening..
02:13:15  if (varx[x] && vary[y] && x+y==z) varz[z] = true
02:13:57  anyways, it's really neat because it's turing complete despite the fact that variables can't ever change (!) and it has no program flow (!!)
02:14:15  are you the one spending time on breaking cryptographic codes and such ?
02:14:23  of the ones ?
02:14:29  just a bunch of statements that define a variable (to true) if its conditions are true
02:14:34  Hmmm. pkzip. Any relation to Phil Katz?
02:14:52  pkzip: actually no, I'm a sound coder irl
02:14:55  pkzip is the old dos zipping
02:15:05  though i kinda hate it now
02:15:07  7z is better
02:15:12  Yes, Phil Katz' ZIP. :)
02:15:13  it was super-cool in the 90s
02:15:34  sound coder
02:15:34  tar(1) is, of course, better. But hey.
02:16:08  tell me why linux can't use the features that device-driver writers wrote into their drivers ?
02:16:25  Windows drivers
02:16:49  since the same Windows/API/MFC code
02:16:50  pikhq: I wonder how I'm going to garbage collect my language... seems hard :D
02:16:52  Because in order to do that you'd basically have to have a clone of substantial portions of Windows in Linux.
02:17:09  This isn't impossible, but it's *insanely* hard.
02:17:38  why can't they just translate the code they already .. oh wait.. its close-code
02:17:44  It's basically much easier to go ahead and reverse-engineer the sound cards, and thereby get native Linux drivers.
02:17:47  its not open-source ?
02:17:47  Precisely.
02:17:54  Windows drivers aren't.
02:17:59  Linux drivers are.
02:18:20  why would anyone use sound card driver features ever anyways
02:18:25  And all too often the Linux drivers are written without any documentation available.
02:18:30  But the same companies that give those drivers to Linux users, write it to fit Windows..
02:18:36  I put a username/password in the cabal configuration file but it won't go. Did I do it wrong?
02:18:52  pkzip: It's actually not the sound card designers that make the drivers, usually.
02:19:12  Real-Tek sound drivers
02:19:15  Most of the Linux drivers for *anything* are made by someone else.
02:19:16  sound cards are all the same nowadays anyways
02:19:21  or whats its caled
02:19:47  pkzip: is that another ac98 based system?
02:19:54  yep
02:19:59  its super-cheap
02:20:04  but good enough
02:20:19  wait no it's ac97
02:20:27  AC97 is the class of sound cards that have actual documentation available. Courtesy of being designed to a spec. :)
02:20:36  yea
02:20:45  that is what bugs me
02:20:58  once you get buffer streaming working they are all the same anyways :D
02:21:08  madbr: Not *quite*.
02:21:11  I can't get the one silly feature they gave Windows Sound Drivers
02:21:19  madbr: Some of them have hardware mixing.
02:21:43  Audio-Effects, EQs
02:21:44  pikhq: saves, what, 0.01% cpu? :D
02:22:10  pkzip: news flash: on ac97 those are actually done in software, not hardware
02:22:10  madbr: ALSA sucks ass, and PulseAudio sucks worse; thus, hardware mixing saves much more than 0.01%. :P
02:22:19  I know
02:22:23  pikhq: jesus
02:22:48  madbr: It's at least to the point where it's not a *notable* performance gain any more.
02:22:52  But it still sucks ass.
02:23:25  how can you mess that up
02:23:28  so, no echo/chipmunk effects to Linux users still ?
02:23:33  it's like, a multiply and addition
02:23:54  pkzip: tbh those effects should be done by the software
02:23:58  By having the sound done via a dozen abstraction layers.
02:23:59 -!- copumpkin has joined.
02:24:05  Linux drivers made by the actual company that makes the thing being driven: nvidia GFX, ATI GFX, Intel GFX ... and nothing else.
02:24:17  (Exaggeration :P )
02:24:17  Dumb Echo/Chipmunk/Stone-Room, etc ..
02:24:17  pikhq: man, how many layers do you even need?
02:24:57  I almost went to study sound engineering, its quite a funny story
02:25:31  ALSA kernel -> ALSA library -> dmix -> PulseAudio -> [...]
02:25:32  I assume you just bumped into it
02:25:43  Mixing happens in PulseAudio and/or dmix.
02:25:48  or have you studied that from the start ?
02:25:53  Context switches are involved in that mixing.
02:26:08  pikhq: nasty
02:26:33 -!- augur has joined.
02:26:47  Admittedly, PulseAudio is entirely unnecessary, and serves largely as an expensive nop.
02:26:49 -!- augur has quit (Remote host closed the connection).
02:27:16  Oh, even worse. PulseAudio is often configured to redirect sound to it via ALSA. Giving you:
02:27:22  nop ? No-Operative/ion ?
02:27:42  ALSA kernel -> ALSA library -> dmix -> PulseAudio -> ALSA library -> [...]
02:27:55  pkzip: Pretty much.
02:28:33  pikhq: right... sounds ripe for a cleanup
02:29:00  madbr: For comparison, here's the OSSv4 stack: OSS -> program
02:29:24  then why doesn't alsa get dumped in favor of oss?
02:29:32  Because derp.
02:29:46  OSS was dumped in favor of ALSA way back when.
02:30:02  (the in-kernel OSS sucked, and the external one was proprietary)
02:30:18  also, for audio app plugins, you should probably dump ladspa and make a linux version of VST2
02:30:35  pikhq: ah, I see.
02:30:38  I only use faith-based sound drivers, so .. :-/
02:30:52  :P
02:30:55  madbr: Also fun, ALSA is a Linux-specific API.
02:31:07  All the other UNIXes (and I mean *all*) use OSS.
02:32:46  One of the big things I see in modern UNIXes is the idea that complicated is better.
02:32:57  Erm, s/UNIXes/Linux distros/
02:33:44  that's not true for sound APIs :D
02:33:47  Adding more onto the heap is somehow better than actually replacing things.
02:33:54  It's not true for most things.
02:34:44  for sound APIs it's really just about just doing a sound callback and keeping latency as low as possible
02:34:58  buffers go out -> victoly!
02:35:11  It's especially "fun" for init schemes. It's managed to reduce /sbin/init to a program that executes a shell script and spawns getties.
02:35:46  but yeah sound APIs are hit or miss
02:36:06  some are nasty (OpenSL)
02:36:27  There was this OS for this latency-OCDers..
02:36:28  OSS is merely a bit strange.
02:36:53  open("/dev/dsp", "w"); // ...
02:37:05  is it buffering or callback oriented?
02:37:32  Buffering, I guess?
02:37:50  To interact with it you write PCM to the device file.
02:37:59  yeah that's buffering
02:38:51  how does it handle synchronization?
02:39:47 -!- copumpkin has quit (Quit: Computer has gone to sleep.).
02:40:35  smallest audio api I've seen is 2 function calls
02:40:54  Beats me.
02:41:20  init, and a function that pushes in a sound buffer (blocks until the sound hardware is ready to take another buffer)
02:41:43  Well. I'd imagine what it does is the file descriptor blocks.
02:42:23  In fact, actually, I'm almost positive that's what it does, considering the behavior of cat raw-pcm >/dev/dsp
02:42:37  mhm
02:44:10  yeah that would work
02:44:58  tbh anything that will get you 20ms latency or less is fine :3
02:46:39 -!- Jafet has joined.
02:47:18 -!- pkzip has left.
02:48:53  kinda wondering how to garbage collect this language... seems really hard
02:55:06  (Having no context) What about the language makes it difficult to GC?
02:55:23  Gregor: madbr's ignorance of functional language evaluation and garbage collection. :)
02:55:29  :D
02:55:46  but yeah basically all you do is define new variables to "true"
02:56:00  usually inside arrays
02:56:23  you cannot undefine variables once they are defined
02:57:05  so doing brainfuck's array actually requires a 3 dimensional array:
02:57:31  data[execution_step][index][value]
02:58:42  uh, how you index an array with only true?
02:58:48  or are there other kinds of values as well?
02:58:54  cakeprophet: somple
02:58:58  simple
02:59:28  suppose you want to set index 45 to value 88 on step 61
02:59:36  ah
02:59:47  you simply define  data[61][88][45]
02:59:51  (as true)
02:59:57  and leave the other values undefined
03:00:00  okay so there are integers too.
03:00:01  cool.
03:00:26  well, there are integers but you can't actually store them :D
03:01:19  you store the value 45 by making an array and only defining the entry 45 :D
03:01:29  okay
03:01:35  now how do you give a brainfuck interpreter unbounded memory.
03:02:00  easy
03:03:29 -!- augur has joined.
03:03:30  you store the size of the array, then when doing > you check if it's over the size, if yes, you define a new index with value 0 so that it can be used by subsequent execution steps
03:03:40  all arrays are unbounded
03:04:42 -!- pikhq_ has joined.
03:05:33 -!- simpleirc936 has joined.
03:06:22  so yeah it's hard to GC because the number of defined values always increases, never decreases
03:06:25 -!- pikhq has quit (Quit: Reconnecting).
03:06:48  so there has to be a way to recognize values that have become irrelevant and can be discarded
03:06:53  but I don't know how :D
03:08:09 -!- simpleirc936 has quit (Remote host closed the connection).
03:13:31  also you're going to get a copy of pretty much each variale for each execution step, dunno how to prevent that
03:14:47 -!- myndzi\ has changed nick to myndzi.
03:15:02  Use bloom tables
03:15:46  madbr: Why not similarly to a more normal language? Unreachable etc.
03:15:55  If you never get unreachabl... wait, hmm
03:16:20  yeah would need to be some special kind of unreachable :
03:16:23  :D
03:16:28  Read up on SSA. :)
03:16:33  You still need to maintain a table of which variables were defined, even if you can't see the value
03:16:39  Or maybe I'm misunderstanding
03:18:14  the point of the language is that any potential variable is either true or undefined
03:18:32  so values aren't really used
03:18:37  Oh
03:18:50  What does garbage collection even mean then?
03:19:17  mostly it means that the set of defined variables doesn't grow indefinitely with each execution step :D
03:20:35  like, the other catch with the language is that variables can't be undefined
03:20:39  Why would it without GC?
03:20:59  so essentially, to do computation, you have to keep defining new variables
03:21:24  Oh, so.. wouldn't that make GC meaningless if this language were to be interpreted?
03:21:45  Wait, no
03:21:48  Is there scoping?
03:21:52  nope
03:21:53 -!- copumpkin has joined.
03:22:14  So, how could a name ever be unreachable, unless you're statically analyzing a file?
03:22:14  it has to be GC'd in some way or else the memory would just blow up
03:22:38  that's what I'm trying to figure out :D
03:23:10  madbr: It's possible to make a language that has unavoidably bad implementations, you know
03:23:21  Not saying that that's necessarily the case here
03:23:29  But I think you might want some sort of static analysis?
03:23:42  So that you act AS IF variables aren't undefined, but secretly you undefine them?
03:24:29  well, there has to be some way to figure out when a variable can't produce any new definitions I guess
03:25:39  once a variable cannot be used in the computation of new definitions, then it's effectively unreachable
03:27:07  and can thus get garbage collected
03:27:32  I'm not sure there's a way to do this without solving the halting problem though :D
03:29:25  It should be harmless to fail to GC a subset of variables that are unreachable
03:29:46  There's nothing impossible about a machine that solves the halting problem but gives false positives or false negatives
03:30:25  Proof: For all turing machines, my machine outputs n
03:30:28  "Halts"
03:30:40  hmm
03:32:11 -!- kmc_ has joined.
03:32:16  then it doesn't solve the halting problem, does it?
03:34:02  sgeo: essentially, the real problem is that since you can't change the state of something once it's declared, you have to create a new state on each step
03:34:50  so typically you'll have the new state being created, and the old state, but steps before that are already unreachable
03:35:00 -!- kmc has quit (Ping timeout: 240 seconds).
03:35:09 -!- Sgeo|web has quit (Ping timeout: 265 seconds).
03:37:42 -!- kmc__ has joined.
03:41:12 -!- Sgeo|web has joined.
03:41:19 -!- kmc_ has quit (Ping timeout: 260 seconds).
03:41:26  I got a recaptcha consisting of partially greek symbols
03:41:39  I ended up typing deltamuwhatever
03:41:51 * Sgeo|web feels like a jerk
03:42:55  Sgeo|web: Don't worry, it won't be transcribed into that.
03:43:08  As far as I know recaptcha requires several people to enter the same thing before it counts as valid.
03:47:22  i guess what is needed is a way to tell from an array[x][y][z] that, say, anything before x=50 has become unreachable
03:48:26  Can only constants go in array[x][y][z]? I don't get how one does indexing
03:52:40  the language has a second sort of variables that are only valid for a particular statement
03:52:46  that take numerical values
03:53:19  so for instance to add the values from varx and vary into varz, you'd go
03:54:07  if(varx[x] and vary[y] and z==x+y) define varz[z]
03:54:24  or, in shorthand notation,
03:55:09  varx[x] vary[y] z=x+y : varz[z]
03:55:57  x y and z take numerical values
04:00:25 -!- pikhq has joined.
04:01:24 -!- pikhq_ has quit (Ping timeout: 252 seconds).
04:02:45 -!- augur has quit (Remote host closed the connection).
04:09:48  There are some things I don't like much about the functions for WriterT, such as the contraints on the type for "tell". It is (Monoid w, Monad m) but I think it should be (Applicative m)
04:10:20  My own function "mpure" is like this:  mpure :: Applicative f => w -> t -> WriterT w f t; mpure x y = WriterT $ pure (y, x);
04:14:25 -!- hagb4rd has joined.
04:17:57  How many bijective functions of type   [a] -> [a]   are there?
04:20:11  if you restrict them to be lists of the same length n, then n!
04:20:15  if not, infinitely many
04:20:55  Yes, that is what I thought. And is it the case the output list will always be the same length as the input list?
04:21:14  yeah, but that's one of the assumptions there
04:21:26  having duplicate elements may reduce the number of functions a bit, since you can't distinguish them
04:22:57  That is true but the input could have or not have duplicate elements regardless of the function.
04:23:26  The assumption I make is that only finite lists are used. But nothing else; not even Eq class.
04:25:49  Infinite, then. To start with, there's the class of functions that simply duplicate the first element a fixed number of times, and do nothing on [].
04:26:03  This *alone* gives you infinite bijections, and that's not even the entire set!
04:27:05  Can you please give an example?
04:27:37  example1 (x:xs) = x:x:xs;example1 [] = []
04:27:51  And what is its inverse?
04:28:13  example1' (x:xs) = xs;example1' [] = []
04:29:44  But, you can have   example1 (example1' "hello") == "eello"  I think it is not inverse
04:31:01  Hrm.
04:34:08  example1 maps from the set of lists to the set of lists that are either null or have a duplicate element at the start, and example1' maps from the set of lists that are either null or have a duplicate element at the start to the set of lists.
04:34:19  It's not my fault that Haskell doesn't encode this at type level.
04:34:44  O, OK. Well, then they are bijective. But then they are not bijective on the type I specified!
04:35:08  Yes they are, your statement was just vague. :P
04:35:34 -!- songhead95 has quit (Ping timeout: 265 seconds).
04:36:03  If you want it to be a bijective mapping from the set of lists to the set of lists, then the maximum number of bijections is O(n!), where n is the maximum length of lists you're considering.
04:36:23  And if you're considering all finite lists, then n is infinity, and there you go.
04:37:01  Wait, why did I put O()?
04:51:55 -!- augur has joined.
05:28:04 -!- MDude has changed nick to MSleep.
05:30:06  Can WriterT be used for probability distributions?
05:38:29  What is it called when a group has everything being their own inverse?
05:47:40  bunch of pairs? wish I knew
05:49:29 -!- kmc__ has quit (Quit: Leaving).
06:34:44  I have idea making payphones that even if inband signaling is used, can prevent redboxing. And it does not disrupt telephone calls, no secret keys are used, protocol can be public, etc. It can have three modes, red, yellow, green (and can be indiciated by LEDs of those colors). The initial mode is red.
06:35:13  * Red: Coins are accepted, keypad is enabled, microphone is disabled, commands received are accepted.
06:35:41  * Yellow: Coins are rejected, keypad is disabled, microphone is enabled, the only command accepted is to switch to red mode.
06:36:05  * Green: Coins are rejected, keypad is enabled, microphone is enabled, all commands received are rejected.
06:36:22  Is it good?
06:44:10 -!- zzo38 has quit (Remote host closed the connection).
06:47:53 -!- Darth_Cliche has quit (Quit: You are now graced with my absence.).
06:59:19 -!- aloril has quit (Read error: Connection reset by peer).
07:04:40 -!- Jafet has quit (Quit: Leaving.).
07:14:09 -!- aloril has joined.
07:44:04 -!- jix has quit (Remote host closed the connection).
07:57:46 -!- madbr has quit (Quit: Radiateur).
08:08:36 -!- derrik has joined.
08:16:30 -!- Vorpal_ has joined.
08:19:25 -!- Vorpal has quit (Ping timeout: 240 seconds).
08:19:41 -!- Vorpal_ has changed nick to Vorpal.
08:41:05 -!- monqy has quit (Quit: hello).
09:17:04 -!- pkzip has joined.
09:17:28 -!- pkzip has left.
09:21:51 -!- sebbu has quit (Ping timeout: 248 seconds).
09:35:18 -!- hagb4rd has quit (Ping timeout: 240 seconds).
09:41:40 -!- jix has joined.
09:47:18 -!- Madoka-Kaname has quit (Ping timeout: 240 seconds).
09:47:40 -!- Madoka-Kaname has quit (Changing host).
09:47:41 -!- Madoka-Kaname has joined.
10:04:08 -!- oerjan has joined.
10:05:33 -!- someoneyouhate has joined.
10:07:24 -!- oerjan has quit (Client Quit).
10:07:49 -!- Madoka-Kaname has quit (Ping timeout: 256 seconds).
10:09:14 -!- ais523 has joined.
10:11:05 -!- Madoka-Kaname has quit (Changing host).
10:11:06 -!- Madoka-Kaname has joined.
10:11:23 -!- oerjan has joined.
10:28:15 -!- Madoka-Kaname has quit (Ping timeout: 276 seconds).
10:30:02 -!- Madoka-Kaname has joined.
10:30:02 -!- Madoka-Kaname has quit (Changing host).
10:30:02 -!- Madoka-Kaname has joined.
10:32:10  @tell zzo38  What is it called when a group has everything being their own inverse? <-- i just saw the term "exponent 2" used on the gödel's lost letter blog
10:32:10  Consider it noted.
10:44:49 -!- hagb4rd has joined.
10:48:23 -!- derdon has joined.
10:54:21 -!- GreaseMonkey has quit (Quit: The Other Game).
11:08:48 -!- ais523 has quit (Remote host closed the connection).
11:08:57 -!- ais523 has joined.
11:18:14  :t id id id id id id id id id id id id id id id id id id id id id id id id id 0
11:18:14  forall a. (Num a) => a
11:18:14  :t id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id 0
11:18:14  forall a. (Num a) => a
11:18:37  > id id id id id id id id id id id id id id id id id id id id id id id id id 0
11:18:43    mueval-core: Time limit exceeded
11:18:45  > 0
11:18:48    0
11:19:09  > id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id 0
11:19:17    mueval-core: Time limit exceeded
11:19:36  http://www.reddit.com/r/haskell/comments/m7uph/whats_going_on_with_id_id_id_id_0/
11:20:12  no one gave a really good answer to why it breaks in some contexts but not others, though
11:20:27  I was just about to say that someone finally did
11:20:34  oh?
11:20:36  In the form of http://codepad.org/2YrUqs1E
11:20:52  Core for a couple of id's
11:21:31  oh i guess :t doesn't need to actually generate the code
11:21:53  *core
11:21:56  Yep
11:22:14  > id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id id ()
11:22:18    mueval-core: Time limit exceeded
11:22:29  hm () was supposed to work
11:22:57  i guess it may just take a longer expression to break
11:23:36 -!- derrik has quit (Quit: done).
11:29:16  You must've hit the ID-ten-T error.
11:30:08 -!- pikhq_ has joined.
11:30:39 -!- pikhq has quit (Ping timeout: 276 seconds).
11:39:33 -!- Phantom_Hoover has joined.
11:41:34 -!- Phantom__Hoover has joined.
11:44:30 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds).
11:53:25 -!- ais523 has quit (Remote host closed the connection).
11:53:52  My impression of Skyrim so far is that it is very much designed with console in mind when it comes to the interface. Heck there are even some sliders you have to use the arrow keys for rather than the mouse. Ugh.
12:33:54  http://killscreendaily.com/articles/things-i-ate-skyrim
12:40:48  Things I ate: Skyrim.
12:45:38 -!- aloril has quit (Ping timeout: 260 seconds).
12:58:12 -!- aloril has joined.
13:08:01 -!- ais523 has joined.
13:10:59  hmm, can someone here explain the "news at 11" meme for me? I don't get it, and knowyourmeme.com is no help
13:14:40  i think it's supposed to allude to ancient broadcast interruptions
13:14:59  ah, when a news story breaks and people are told of it interrupting an existing program
13:15:03  and when to look to see more?
13:15:07  yeah
13:15:44  it was already a cliche when i was reading usenet back in the 90s
13:15:47  why 11 specifically?
13:16:09  presumably some broadcaster had its evening news then?
13:18:48  there's http://www.imdb.com/title/tt0091624/
13:37:30 -!- oerjan has quit (Quit: leaving).
13:54:00  Also: http://tvtropes.org/pmwiki/pmwiki.php/Main/FilmAtEleven
13:54:14  "The phrase originated in the 1970s, when stations began to run teasers for the late local news during Prime Time (such as "shootout at local gas station, Film at 11.") This was often a Justified Trope at the time, since it could take hours to transport exposed 16 mm film from a remote site to the station, develop it, edit it, and add a voiceover."
13:58:09  Also from the examples: "* Particularly on the Internet, "Film at 11" has taken on an ironic meaning, equivalent to Seen It a Million Times.
13:58:09  "Imminent Death of the Net Predicted. Film at 11." — common Usenet phrase, mid 1990's."
14:00:09  Finally, there's a stubticle of "Film at 11" in Wikipedia, but it doesn't say much else, except the claim that 11 p.m. is/was a "traditional timeslot for local news broadcasts in the Eastern and Pacific time zones of the United States".
14:00:17  (Is stubticle even a word?)
14:00:44  It's an icicle made of stubble.
14:01:27  Or is that like the sort of beardcicles you get in cold weather, except re shorter hair? They're not much fun.
14:05:48 -!- hagb4rd has quit (Quit: hagb4rd).
14:08:26 -!- tiffany has joined.
14:19:22  fizzie, I don't know, not having a beard or the conditions under which icicles would form on one.
14:20:48  fizzie, did you catch up with Homestuck, BtW?
14:21:07  Not yet.
14:21:14  I'm not quite sure they qualify as real icicles, but below -20 (apparently that's -4 Funnyheit) moisture from exhalation tends to freeze one's beard, and it's a bit uncomfortable.
14:21:29  I did do the prequel wander-around flash.
14:22:00  Temperatures outside the 25-to-minus-5 range? What is this witchcraft?
14:23:38  And yes, that was the best flash.
14:24:28  (Here in the south tip of Finland it doesn't really go below -10 very often, though.)
14:25:05 -!- hagb4rd has joined.
14:27:07  http://esolangs.org/wiki/Libertas
14:27:13  "Libertas is the first syntax-error runtime-error free programming language ever."
14:27:20  Let us disabuse the creator of this notion.
14:28:56 -!- Madoka-Kaname has quit (Quit: Hug~♪).
14:37:27 -!- boily has joined.
14:44:40 -!- Madoka-Kaname has joined.
14:44:40 -!- Madoka-Kaname has quit (Changing host).
14:44:40 -!- Madoka-Kaname has joined.
15:06:27 -!- MSleep has changed nick to MDude.
15:07:53 -!- hagb4rd has quit (Quit: hagb4rd).
15:08:09 -!- hagb4rd has joined.
15:18:35 -!- copumpkin has quit (Quit: Computer has gone to sleep.).
15:25:51 -!- hagb4rd2 has joined.
15:26:09 -!- hagb4rd has quit (Disconnected by services).
15:26:24 -!- hagb4rd2 has changed nick to hagb4rd.
15:27:18  sry for join flooding. guess its gonna be fine now
15:34:31  Madoka-Kaname, oi, fix your ident order.
15:41:57  Phantom__Hoover: ITYM:
15:42:17  Madoka-Kaname!~moe@ppp-70-251-229-235.dsl.rcsntx.swbell.net, oi, fix your ident order.
15:46:13 -!- copumpkin has joined.
15:52:55 -!- nys has joined.
15:57:35 -!- Madoka-Kaname has quit (Quit: Hug~♪).
16:00:10 -!- Madoka-Kaname has joined.
16:00:10 -!- Madoka-Kaname has quit (Changing host).
16:00:11 -!- Madoka-Kaname has joined.
16:02:07 -!- Zuu has quit (Ping timeout: 244 seconds).
16:07:41 -!- pkzip has joined.
16:08:16 -!- pkzip has left.
16:16:54 -!- Ngevd has joined.
16:18:17  Hello!
16:18:21  I hurt my leg today...
16:18:51  I hut... all the legs.
16:21:05  so yeah some moment of time of numerical signifigance in the Gregorian calendar happened
16:21:14 * CakeProphet celebrates.
16:21:18  I waited for a ninth of a second.
16:21:31  We took about ten minutes out of history to celebrate
16:21:56  I was busy marking, I think
16:22:08  or at least, getting ready to enter marks into a computer
16:22:20  (on Friday mornings, we have eight people marking and I enter the marks in as they arrive)
16:22:46  Oooh
16:22:51  Schmancy system.
16:23:20  I can type in the marks more than eight times faster than another person can mark the work, though, so there's quite a bit of downtime
16:23:45  ais523: don't worry there's always 12/12/12
16:23:56  why would I worry about a coincidence of numbers?
16:24:10  and, provided that you live long enough, 22:22 on 2/22/2222
16:24:24  Shh, you'll get pikhq_ going.
16:24:25  CakeProphet: dates don't work like that
16:24:44  ais523: hm?
16:24:45  !c printf("%d",1<<25);
16:24:50  33554432
16:24:51  ais523: well yes
16:24:51  but
16:24:53  you can pretend
16:24:57  CakeProphet: there aren't 22 months in a year
16:24:58  that it's still February.
16:25:18  ais523: the month is at the beginning
16:25:20  2^25 being 33554432 is better
16:25:34  CakeProphet: how ridiculous
16:25:37  it's an American thing.
16:25:52  Phantom__Hoover: that reminds me, why were you deliberately winding up an op yesterday?
16:26:04  Which op?
16:26:10  me
16:26:10  actually there's 2/2/2222 AND 2/22/2222
16:26:13  woooooow
16:26:34  so much significance!
16:26:39  ais523, rest assured that the up-windery was entirely independent of your oppishness.
16:26:50  well, OK; but it's still incredibly bad form
16:27:27  Well no, because I have to concentrate hard to remember that you're an op.
16:27:42  Thus I was not deliberately winding up an op; it was accidental.
16:27:42  it's bad form to deliberately wind up anyone, whether they're an op or not
16:28:53  ais523: so you know how people say "November 11th, 2011"?
16:28:57  or, do people not say that where you live?
16:29:05  I say 11th of November 2011
16:29:08  CakeProphet: "11 November 2011"
16:29:10  anyway, that's where the m/d/y format comes from
16:29:16 -!- elliott has joined.
16:29:19  or just "the 11th" if the month/year are clear from context
16:29:26  I thought it was a corruption of y/m/d
16:29:37  Which in some ways DOES MAKE SOME sense
16:29:40  there's an "of" that's pronounced but not generally written
16:29:42  But it's still WRONG
16:29:59   amusing, there are "Quicksilver ingots" in Skyrim... How would that even work?
16:30:05  Gregor: So, I wasn't planning on getting the new Dinosaur Comics book.
16:30:09  (implying a correct ordering of elements in a date)
16:30:10  BUT IT HAS AN N-GRAM ANALYSIS
16:30:14  I MUST
16:30:17  Vorpal, immobilising in something else?
16:30:27  Vorpal, isn't quicksilver mercury?
16:30:29  elliott: you could incorporate that in your CORPUS
16:30:32  get it?
16:30:37  Phantom__Hoover: so basically, I want you to apologise
16:30:37  Ngevd, yes
16:30:44  !!!
16:31:00  Homestuck update, Minecraft pre-release
16:31:02  Ngevd, btw the Swedish name for mercury is kvicksilver. So this was obvious to me
16:31:16  Ngevd: No spoilers re: HS update
16:31:27  ais523, I'm afraid I can't tender that request.
16:31:28  Haven't/won't read yet
16:31:33  (Is that how 'tender' works?)
16:31:34  11/11/11 - "Examine room."
16:31:34  11/11/11 - "Enter name."
16:31:34  11/11/11 - "Homestuck"
16:31:34  11/11/11 - "==>"
16:31:34  11/11/11 - "[S] ACT 6"
16:31:35  Oh, look at that.
16:31:46  Phantom__Hoover: Stop being an asshole for no reason.
16:31:54  elliott: I somehow saw this coming I think.
16:31:55  Phantom__Hoover: isn't tendering, in that context, the process of asking a bunch of people for quotes
16:32:01  so you can accept the best one and get them to subcontract?
16:32:01  CakeProphet: So did everyone
16:32:08  it'd be a kind-of weird thing to do, really
16:32:34  02:02:53:  if its a programming language, u had just reinvented Forth !
16:32:36   Phantom__Hoover: Stop being an asshole for no reason.   <-- that's elliott's job :P
16:32:39  this pkzip guy in the logs really likes forth
16:32:57  admittedly, Forth is a language it seems vaguely possible to reinvent by mistake
16:32:59  but not much more than that
16:33:24  Ngevd: it takes slightly more reasons than "because it'll upset them" for me to offend someone :)
16:33:27  slightly.
16:33:42  hmm, if space aliens had programming languages (and they probably do), which of ours do you think they'd have reinvented; not counting things like syntax differences
16:33:50  02:05:03:  oh i get it
16:33:50  02:05:10:  esoteric programming languages
16:33:50  02:05:15:  - there's no defined execution order: statements are to be executed in any order, any number of times
16:33:50  02:05:18:  my fav !!!!!!!!!1
16:33:50  02:05:29:  oh
16:33:52  02:05:38:  i hate the fucked-up psycho ones
16:33:54  02:05:59:  I like the useful ones.
16:33:55  wow this guy is really annoying
16:34:03  I know someone who actually has had his birthday, and Christmas, ON THE SAME DAY!
16:34:03  In fact, I'll estimate that just under 1 in 365 people do
16:34:05  ais523: heh, you might like the Nock/Urbit posts
16:34:24  Ngevd: does he have his birthday and Christmas on the same day every year?
16:34:45  02:06:13:  stuff like my own version of brainfuck
16:34:47  auugh
16:35:10  ais523, yup
16:35:15  (diff) (hist) . . N Libertas‎; 01:29 . . (+1,162) . . Pegasus (Talk | contribs) (New page: '''Libertas''' is the first syntax-error runtime-error free programming language ever. The interpeter will execute the instructions no matter what. =Examples= A hello world application: ...)
16:35:19  ais523: MAKE HIM STOOOOOP
16:35:33  elliott: that is at least a vaguely eso concept
16:35:38  it's not the same as what BF does
16:35:41  sure, it's probably a bad impl of it
16:35:47  but the concept isn't awful
16:35:55  http://esoteric.voxelperfect.net/wiki/Libertas
16:35:58  wow, it's really bad
16:36:14  it's just "make an empty object when you reference something undefined"
16:36:21  /Objective-C/ does that!
16:36:23  well
16:36:25  or rather
16:36:30  sending a message to nil produces nil
16:36:34  you just need to map undefined variables to nil
16:36:54  elliott: but the way its syntax works, you could come across fun ambiguities
16:37:02  fair enough
16:37:05  try to figure out how you output a string stored in a variable
16:37:24  (the obvious syntax for that, is the same as the syntax for extending toScreen with a new property)
16:37:28  02:16:08:  tell me why linux can't use the features that device-driver writers wrote into their drivers ?
16:37:28  02:16:25:  Windows drivers
16:37:28  02:16:49:  since the same Windows/API/MFC code
16:37:34  i hope this guy leaves soon
16:37:45  What channel?
16:37:47  Oh, logs?
16:38:05  elliott: randomly mentioning ndiswrapper could potentially help, or hurt
16:38:13  ais523: in the logs?
16:38:15  would at least possibly have produced an amusing reaction
16:38:15  elliott: okay so I didn't predict any of this other stuff. Just that there will be more character introductions of that format.
16:38:23  elliott: that's the past tense of could
16:38:28  it's just the same as the present tense
16:38:33  so it's a little hard to tell them apart
16:38:42  no "coulded" or whatever in English
16:38:52  coulded :D
16:39:04 -!- rajdev5089 has joined.
16:39:17  I suppose I should have said "could have" there
16:39:18  elliott: I thought perhaps he was going to take us to the green hardboiled universe and introduce some characters or reintroduct the midnight crew or something like that.
16:39:21  hmm, who's rajdev5089?
16:39:24  `? welcome
16:39:31  Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
16:39:33  elliott: I was going to do that, but didn't know if they were new or not
16:39:39  CakeProphet: Well, don't spoil me.
16:39:52  perhaps I should just welcome regulars randomly, so that if a not-quite-newbie comes in and I welcome them too, it doesn't look out of place
16:40:23  hey .. someone tell me
16:40:30  whats going on here
16:40:58  rajdev5089: this is an IRC channel about esoteric programming languages
16:41:04  who is ais523 ?
16:41:07  I am
16:41:23  where u from
16:41:40  why does it matter? this is IRC, there aren't any obvious international borders here
16:41:44  (HEXHAM IS NOT A COUNTRY)
16:41:53  whats mean esoteric
16:42:01  esoteric prorgamming languages
16:42:08  is it a public chat room right ?
16:42:22  rajdev5089: yes; but the chat rooms are all about different subjects
16:42:33  who are all here
16:42:37  and if you come to one that isn't about a subject you're interested in, the conversation probably won't be too interesting for you
16:42:47  all are software professionals ?
16:42:48  as in, we're here because we share a common interest
16:43:03  for some definition of professional
16:43:06  I'm definitely not a software professional
16:43:21  umm, my job involves at least some programming, does that count?
16:43:33  I'm sorta a software... person who's not even very good at pretending to be any good at programming
16:43:35  then who are you people.... u said its a programming language
16:43:46  We're software amateurs
16:44:01  amateurs mean ?
16:44:11  People who do things for entertainment
16:44:13  http://en.wiktionary.org/wiki/amateur
16:44:28  amateur mean sexy ?
16:44:35  right ?
16:44:37  Not especially
16:44:48  how many people are here ?
16:44:57  Yes, this channel is for software sexies.
16:44:59 * Phantom__Hoover → other things.
16:45:00 -!- Phantom__Hoover has quit (Quit: Leaving).
16:45:09  rajdev5089: 55, including you
16:45:20  dont we do personal chat here
16:45:42  depends what you mean by personal :P
16:45:53  rajdev5089: do you work on Firefox?
16:45:55  one to one chat
16:46:09  its a public chat here
16:46:34  can i see you people here
16:46:43  no, we're mostly invisible
16:46:46  I'm actually a stream of bist
16:46:48  bits
16:46:50  I live inside computer
16:46:57  really
16:47:02  elliott: enjoy being locked in your matrix of solidity!
16:47:08  how u live inside computer
16:47:23 * CakeProphet is a "software professional"
16:47:24  He's an AI
16:47:25  tell about you ais523
16:47:27  rajdev5089: you have to build yourself a matrix of all your hopes and dreams, scan your brain into it, and that locks you in
16:47:45  fungot?
16:47:51  fungot is dead?!
16:47:52  No fungot...
16:47:55  :'(
16:48:08  heh, I was about to ping fungot too, but it wasn't here
16:48:10  which country u belong to
16:48:11  `logs
16:48:13  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: logs: not found
16:48:16  `log
16:48:18  2011-07-31.txt:10:43:42:  learn to `on`
16:48:27  rajdev5089: i actually flow all over the internet, i'm an AI worm
16:48:35  currently I'm in at least 8 continents
16:48:49  I'm Australian currently resident in Canada
16:48:52  ur real name elliot ?
16:49:06  elliott.exe
16:49:07  who is ngevd ?
16:49:12  Me
16:49:21  Ngevd: I run on @!
16:49:21  rajdev5089: you're from Bangalore, India, or at least somewhere nearby
16:49:30  ais523: omg hax
16:49:37  yes...
16:49:43  i m in banglore
16:49:52  so why do you need to ask us where we live, when it's typically easy to find out?
16:50:04  how u people know that i m from banglore
16:50:10  how to see ?
16:50:17  Because we know the secret
16:50:29  rajdev5089: Because of the Cameras.
16:50:30  tell me .. i will also find
16:50:43  oh my god guys
16:50:45  fungot, is gone.
16:50:52 * CakeProphet freaks the fuck out.
16:50:57 * CakeProphet is a frightened weasel.
16:51:23  tell me yar
16:51:36  what infirmation u know about me
16:52:07  All the information.
16:52:15  SCANNING VICINITY...
16:52:19  what else
16:52:21  rajdev5089: you like the color purple.
16:52:38  yes cakeprophet
16:53:04  rajdev5089: Your name... is rajdev5089.
16:53:13  then
16:53:57 * CakeProphet says in a cryptic voice, "your name is not registered to services."
16:54:18 * shachaf says in a hollow voice, "Fool."
16:54:43  rajdev5089: YOU Broadband & Cable India Ltd. is dedicated to your safety.
16:55:06  what ur saying elliot ?
16:55:20  i dont understand you elliot
16:56:12  err, you misspelt his name
16:56:17 * ais523 braces
16:56:36  ais523: rajdev5089 is clearly referencing some offline user
16:56:38  fizzie: help you are not fungot. no one is fungot. what is world at
16:56:41  `log \belliot\b
16:56:47  ais523: wow, I typo'd "elliott" as "elliot"
16:56:49  erm
16:56:51  other way around
16:57:02  deliberately typoing is often hard
16:57:05  2009-11-09.txt:23:31:24:  Special thanks go to Joris Huizer, Elliot Hird, Arvid Norlander,
16:57:10  especially on a word you typo often
16:57:19  what u people saying
16:57:24  (random fact: I typoed about eight times in that line)
16:57:30  rajdev5089: are you a developer?
16:57:38  :#
16:57:41  i m really mad on seeing this
16:57:50  like grrrr mad? or bhasiuhiuwehruhwer made?
16:57:52  *mad
16:58:17  if someone is free mean tell me clearly what happening here
16:58:32  how to use this chat room
16:58:46  i m new here
16:58:46  rajdev5089: you probably don't want to use this one, as you seem to have no idea of what it's for
16:58:55  rajdev5089: Try #ubuntu.
16:59:00  Type: /join #ubuntu
16:59:06  yes
16:59:16  r u people male or female
16:59:32  u know..... who i am ?
17:00:11  We know everything, rajdev5089.
17:00:43  elliott: never say that, you attract attention from people who actually /do/ know everything
17:00:59  ais523: heh
17:02:01  who is ais523
17:02:07  rajdev5089: I am a sexy sexy female software professional.
17:02:11  rajdev5089: the owner of this channel
17:03:02  then who are you elliott
17:03:13  I am... you.
17:03:36  who is cakeprophet
17:03:57  A sexy sexy female software professional
17:04:00  send me some private msg people
17:04:18  who is ngevd
17:04:24  ngevd is hexham
17:04:44  hexham mean
17:04:47  I am Zoe Olivier and I have for the longest time been raised by foster parents, unaware of my status as a foster child. Then one day, I realized I have the power to divine through interaction with baking magicks.
17:04:53  Hexham is my name
17:05:12  ur male \
17:05:21  hexham is male
17:05:27  Hexham can be either
17:05:30  it is since then that I exist in my current form, fighting the evils through divination of baked goods, and making the world a happy and good justice place for all!!!
17:05:46  rajdev5089: I feel compelled to point out that as an amorphous stream of bits, I have no gender.
17:06:03  hexham send me private msg
17:06:57 -!- augur has quit (Remote host closed the connection).
17:07:05  msg rajdev5089 Hello!
17:07:15  Ngevd: that isn't a private message
17:07:17  I saw it just fine
17:07:30  Woops
17:07:31  I'm tired
17:08:41  msg rajdev5089 u liek girls with dicks?
17:08:43  oops.
17:08:52  why
17:09:33 -!- ChanServ has set channel mode: +o ais523.
17:09:53  rajdev5089: I suspect you're in the wrong place, and you should probably leave
17:10:35  why ais523
17:10:43  what people discuss here
17:10:45  `quote
17:10:45  `quote
17:10:46  `quote
17:10:46  `quote
17:10:46  `quote
17:10:48  because you don't understand the purpose of this channel
17:10:54  457)  Dear eHow: Please don't assume that my toilet works like that   Or, at least, my toilet looks different
17:10:54  387)  I figured out something about C program. If you use ? : a lot then you don't need as much parentheses but it makes it more difficult to understand.
17:11:11  20)  there is plenty of room to have two heads
17:11:11  95)  Clearly we should be like Mumbai and get of vehicle dors.  Get of vehicle dors?  I think Aftran had a French phrase there.  Les vehicles d'or
17:11:11  230)  Maybe they should just get rid of Minecraft. If more people want it someone can make using GNU GPL v3 or later version, with different people, might improve slightly.
17:11:44  ais523: hmm, I'm thinking 95; 20 can't be deleted because it would ruin the quotes after it
17:11:59  who is here
17:12:02  elliott: yes, OK; 457's good for a Sgeo quote
17:12:10  rajdev5089: try typing /names
17:12:21  CakeProphet: ouch, don't say that
17:12:26  :-$
17:12:26  `delquote 95
17:12:29  ​*poof*  Clearly we should be like Mumbai and get of vehicle dors.  Get of vehicle dors?  I think Aftran had a French phrase there.  Les vehicles d'or
17:12:29  ais523: why not?
17:12:31  I thought of saying that myself, but realised why it's a really bad idea, and you should too, ideally
17:12:38  elliott: you want half the channel pinged?
17:12:42  cakepoint: ur real name
17:12:45  ais523: I don't think you know what /names is
17:13:07  elliott: I do; and I know it answers in a numeric not in-channel
17:13:18  I still nonetheless stand by my statement
17:13:20  ok yar.. bye you to all
17:13:23  bye
17:13:36  last one thing
17:13:42  rajdev5089: I told you my name is Zoe Olivier the Cake Prophet
17:13:53  sheesh
17:13:56  no one ever believes me
17:14:00  u people here talk about sexy things
17:14:04  all the time.
17:14:06  like Haskell.
17:14:08  so sexy.
17:14:17  what sexy here
17:14:19  > [1..]
17:14:20    [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,28...
17:14:25  All sexy here.
17:14:28  Speaking of French, qu'est-ce que l'arg est?
17:14:39  bye you to all
17:14:48  muaaahhhhhhhhhhh
17:14:52  bye you to rajdev5089
17:14:57  Life lesson for us all: http://9gag.com/gag/565257
17:15:53  mmm
17:16:19 -!- rajdev5089 has left.
17:16:30  friendship devouring
17:16:52  bye raj
17:17:10  poor guy. apparently really terrible at finding people to cyber with.
17:17:12 -!- ais523 has kicked ais523 there are actually quite a lot of ways to deop yourself, this is one of them.
17:17:15 -!- ais523 has joined.
17:17:57  yar
17:18:09  hi nys
17:18:10  Hello nys
17:18:18  :o
17:18:24  nys: hi rajdev5089
17:18:28  note: probably untrue
17:18:41  i think he was looking for some sexy pirates
17:19:10  nys: the funny thing is, from just "yar" and ":o" I had a good idea that you actually had a vague idea of what you were doing here
17:19:18  which is a little surprising, really, given how content-free those lines were
17:19:29  i know what i'm doing here
17:19:29  ais523: wat
17:19:33  i made some langs
17:20:13  #esotericf is a prestiguous group of eminent language designers.
17:20:15  -f
17:20:19  elliott: ":o" is a lot more encouraging than "i dont understand you elliot"
17:20:28  i like the way you rub your peg leg on my beard
17:20:41  ais523: you realise that nys didn't just join? :)
17:20:50 * CakeProphet is the esteemed creator the dupdog programming language.
17:20:53  CakeProphet: * Users on #esotericf: @elliott
17:20:54  elliott: yes, from the join/part layout
17:20:55  CakeProphet: Indeed.
17:21:06  I hadn't seen him/her here before, but had guessed he/she'd been here for a while
17:21:13  well, remembered so, at least
17:21:28  there are quite a lot of people who have been here for ages but I simply haven't noticed due to being oblivious
17:21:45  i was here once around five years ago I think
17:22:27  Your name seems somehow familiar...
17:22:27  but i probsably uses the nick architect1 back tshen
17:22:49  this nick is registered on this network
17:22:52  but not to me
17:22:59  /ns ghost nys
17:23:04  so I might be unintentionally impostering someone
17:23:46  WILL THE REAL NYS PLEASE STAND UP
17:23:55  i am the real nys
17:24:01  but only in a  different way
17:24:46 -!- elliott has quit (Quit: Leaving).
17:26:16  MYSTERIOUS
17:26:33 * CakeProphet says in a cryptic voice, "cryptic."
17:26:41  Hi nys
17:26:48  hi you
17:26:55  =3
17:27:40  I should have called MIBBLLII WIBBLLII
17:28:02  are there any esolangs that have been removed from the wiki because they were too useful?
17:28:21  I don't think so
17:28:27  being useful and being esoteric aren't mutually exclusive
17:28:43  it's just unlikely to find a language that does both at once
17:28:53  (being eso is enough of a reason to make a language that you don't have to make it eso too)
17:29:01  befunge-98
17:29:02  *make it useful too
17:29:18 -!- elliott has joined.
17:29:23  Damn it, he's back.
17:29:24  I MEAN HI
17:29:48  hi
17:30:44  `? welcome
17:30:46  Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
17:35:01  oh right, I have a serious and annoying question I've been putting off all week, because I suspect the answer is "that's impossible"
17:35:39  go on
17:35:48  given some code that you're treating as black-box (that is, that you can't see the internals of the code, but can run it), that you know is a sorting algorithm, is there any way to determine if it's using mergesort or not?
17:35:58  not 100% unfoolable, but even to make a decent guess in the common case?
17:37:09  ais523: hmm, how much of a black box is it?
17:37:23  ais523: if it's a function in a pure language, you can't, because all sorting algorithms are equivalent, modulo stability
17:37:31  one I can look inside but don't really want to have to, as it'd be faster to do so by hand than write a program to do it
17:37:33  does it take a comparison function, or are you forced to sort lists of integers?
17:37:42  I /can/ time it, but that's just going to prove it n log n
17:37:51  I assume you mean it's a Unix program, which means you can time it, which could be helpful
17:37:51  and it's using OCaml's built-in compare function
17:37:55 -!- augur has joined.
17:37:59  ais523: If you hadn't said "not 100% unfoolable", I would have just screamed "RIIIIIICE" at you.
17:38:01  which I think cannot compare two things equal unless they actually are equal
17:38:15  so I can't use stability tricks
17:38:17  ais523: yes, but you can try and get the worst case
17:38:25  right
17:38:25  if it goes really slowly on pathological quicksort data, it's probably not mergesort
17:38:34  Also, behold:
17:38:34  the hard part is, it's not even mergesort in particular I'm meant to be checking for
17:38:37  `? welcome @ elliott
17:38:37  but 3mergesort
17:38:40  elliott: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
17:38:43  ais523: out of curiosity, what /is/ this program?
17:38:45  `url bin/?
17:38:47  http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/bin/?
17:38:50  `paste bin/?
17:38:52  http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/paste/paste.813
17:38:53  which is like mergesort, except that you're splitting into 3 lists not 2
17:39:07  Gregor: You made the change in a way I don't like, I'm rewriting it :)
17:39:21  elliott: and it's student submissions, they're meant to be marked automatically
17:39:25  elliott: WAH WAH WAH
17:39:34  but I can't see an automatic method for determining that they're using the right algo in the sorting question
17:39:39  (none of the questions have required a specific algo)
17:40:19  Can you see how much memory it uses?
17:40:30  hmm, I guess so
17:40:40  but am not even sure that'd help, as OCaml is nondeterministically GCed
17:40:50  Hmm
17:41:44  I seem to remember "libertas" being latin for "for freedom"...
17:42:15  `revert 914
17:42:16  Done.
17:42:23  `fetch http://sprunge.us/eYAX
17:42:24  2011-11-11 17:42:24 URL:http://sprunge.us/eYAX [268] -> "eYAX" [1]
17:42:34  `run cd bin; patch -p1 <../eYAX
17:42:36  patching file '?' \ Hunk #1 succeeded at 1 with fuzz 2.
17:42:42  `rm eYAX
17:42:44  No output.
17:42:47  `? welcome > Gregor
17:42:49  welcome > Gregor? ¯\(°_o)/¯
17:42:55  G'job.
17:43:03  Hmm. Ah.
17:43:19  There is an easy solution to this!
17:43:47  So have we all decided on a superior highlight character for that, by the way?
17:43:49  Since ? is taken
17:43:52  elliott: please tell me it's parsing the filename of stdout to determine who to ping
17:43:56  $anybody react to $?
17:43:57  Gregor: `? is fine *shrug*
17:44:00  ais523: lol
17:44:05  elliott: But it needs a space bleh >:(
17:44:12  elliott: It's really "`? "
17:44:23  Gregor: I'd make it react to any lowercase word without spaces followed by ? and EOL
17:44:25  what about ?? like #nethack uses?
17:44:27  ?? abc
17:44:27   abc
17:44:27  but others may dislike that :)
17:44:28  I want a really really old computer
17:44:33  wait what?
17:44:34  ?? 1+2
17:44:34   1+2
17:44:36  With vacuum tubes and magnetic tape
17:44:40  ??I suspect that it will still react to ?
17:44:40  is ?? an echo command for lambdabot?
17:44:44  ?? foo
17:44:45   foo
17:44:47  ??foo
17:44:50  Hmm
17:44:54  ?help ??
17:44:55  help . Ask for help for . Try 'list' for all commands
17:44:58  ?help ?
17:44:58  ? [args].
17:44:58  ? executes plugin invocations in its arguments, parentheses can be used.
17:44:58   The commands are right associative.
17:44:58   For example:    ? ?pl ?undo code
17:44:58   is the same as: ? (?pl (?undo code))
17:45:16  hmm
17:45:23  ?? c i op as
17:45:23   c i op as
17:45:38  ?? pl ?undo 2+2
17:45:38   pl 2 + 2
17:45:43  ah, interesting
17:45:44  And then I will set it up
17:45:44  And run Dwarf Fortress
17:45:44  ?? ?pl ?undo 2+2
17:45:44  Generate a really long history
17:45:44  And just have that in a room somewhere
17:45:45   4
17:45:50  ais523 can't read documentation.
17:46:01  @help @
17:46:01   @ [args].
17:46:01   @ executes plugin invocations in its arguments, parentheses can be used.
17:46:01   The commands are right associative.
17:46:01   For example:    @ @pl @undo code
17:46:01   is the same as: @ (@pl (@undo code))
17:46:01  elliott: the documentation gave /one/ leading ?
17:46:03  not two
17:46:08  Wow, it actually gives different help for the @ version.
17:46:15  ais523: yes, because it's implied to be part of a lambdabot invocation
17:46:16  @help pl
17:46:17  pointless . Play with pointfree code.
17:46:19    @ [args].
17:46:19  @help `
17:46:20  help . Ask for help for . Try 'list' for all commands
17:46:22   pointless . Play with pointfree code.
17:47:05  `fetch http://sprunge.us/OhSc
17:47:06  2011-11-11 17:47:06 URL:http://sprunge.us/OhSc [189] -> "OhSc" [1]
17:47:12  `run mv OhSC bin/'?'; chmod +x bin/'?'
17:47:14  mv: cannot stat `OhSC': No such file or directory
17:47:17  `run mv OhSC bin/'?'; chmod +x bin/'?'
17:47:19  mv: cannot stat `OhSC': No such file or directory
17:47:24  Gregor: ???
17:47:53  `fetch http://sprunge.us/OhSc
17:47:54  2011-11-11 17:47:54 URL:http://sprunge.us/OhSc [189] -> "OhSc.1" [1]
17:47:57  elliott: lol
17:47:58  >_<
17:48:00  `run mv OhSC bin/'?'; chmod +x bin/'?'; rm OhSC.1
17:48:02  mv: cannot stat `OhSC': No such file or directory \ rm: cannot remove `OhSC.1': No such file or directory
17:48:04  oh
17:48:07  `run mv OhSc bin/'?'; chmod +x bin/'?'; rm OhSc.1
17:48:09  No output.
17:48:12  `? welcome > Gregor
17:48:14  Gregor: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
17:48:20  `paste bin/?
17:48:22  http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/paste/paste.6308
17:48:23  Gregor: Behold the elegance.
17:48:27  `? yousuck @ elliott
17:48:29  yousuck? ¯\(°_o)/¯
17:48:53  elliott: That's pretty genius.
17:49:06  `run sed -i 's/f $1/f $*/g' bin/'?'; # so that you can still run it from `run sanely
17:49:08  No output.
17:49:12  `run '?' welcome > test
17:49:14  No output.
17:49:15  ...oh wait :P
17:49:19  `revert -3
17:49:20  Done.
17:49:23  `help
17:49:23  Runs arbitrary code in GNU/Linux. Type "`", or "`run " for full shell commands. "`fetch " downloads files. Files saved to $PWD are persistent, and $PWD/bin is in $PATH. $PWD is a mercurial repository, "`revert " can be used to revert to a revision. See http://codu.org/projects/hackbot/fshg/
17:49:34  Perfect
17:49:38  Gregor: Wait...
17:49:41  Gregor: I just had The Best Idea.
17:49:44  Uh oh
17:49:52  GOODBYE!
17:50:04  Also, Pietbot's achieved sentience WHILE NOT EVEN RUNNING
17:50:10  I am scared
17:50:13  Gregor: Writing to /home/ causes HackEgo to address what's written there to .
17:50:21  For example: `run wisdom > ~elliott
17:50:24   elliott: [wisdom]
17:50:28  Err, s/wisdom/fortune/g
17:50:54  ... that's dumb. /home/ existed for any reason it would be for actually private per-user files.
17:51:07  s/\. \//. If \//
17:51:12  Gregor: The reason to put it in /home is so that you can use ~foo :P
17:51:16  I know
17:51:20  Still.
17:51:41  Gregor: OK wait no I just had The Best Idea.
17:51:41  So I think we've all agreed on the prefix character 🐐, right?
17:51:46  🐐welcome @ elliott
17:51:52  It's >, not @.
17:51:57  WATCH ME @
17:52:01  WATCH ME @ THE NIGHT AWAY
17:52:17  Gregor: OK here is the best idea: HackEgo functions as a @tell bot... /by using Unix mail/.
17:52:27  >_O
17:53:11  It requires exactly two pieces of infrastructure from the outside: A user added whenever a new nick is spotted, and the first time a user speaks after receiving mail, HackEgo notifies them :P
17:55:23 -!- Ngevd has quit (Ping timeout: 245 seconds).
17:55:33  Ohhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh
17:55:44  I half-mostly-kinda misunderstood the request :P
17:56:01  Hmmmm.
17:56:04  Consider it under consideration.
17:58:37  `? welcome 🐐 elliott
17:58:39  elliott: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
17:58:49  `revert
17:58:50  Done.
17:59:00  `revert 934
17:59:01  Done.
17:59:04  You're a bad person, Gregor.
17:59:05  A VERY BAD PERSON
17:59:14  To be fair, I also added back @ :P
17:59:29  btw I can confirm that skyrim is buggy
17:59:33  Yeah but @ is like so unUnixy.
17:59:34  as would be expected
17:59:41  elliott: Waaah
18:00:02  elliott: foo > elliott should replace the very fiber of your being, not target the message at you.
18:00:13  for example, I'm currently unable to re-equip the item in my right hand except to a two-hand weapon or the flame spell. This just happened randomly
18:00:14  Gregor: HackEgo must live with its approximations of the ideal :P
18:00:24  `run '?' welcome | cat <<<'elliott: ' -
18:00:26  sh: Syntax error: redirection unexpected
18:00:34  ais523: sh =/= bash
18:00:38  Gregor: BTW, make `run start bash, not sh, please
18:00:42  `run bash -c "'?' welcome | cat <<<'elliott: ' -"
18:00:44  elliott:
18:00:46  bash goes into compatibility mode when run as sh
18:00:49  :(
18:00:51  which makes no sense for `run's interactive use
18:00:57  Ohyuk
18:01:00  ais523: what is with the trailing "?
18:01:07 * Gregor makes it start tcsh X-P
18:01:08  elliott: because it matches the " after -c
18:01:37  ais523: Oh
18:02:15  but it seems I've forgotten exactly how <<< works
18:02:28  oh and this ride to another town I just hired doesn't seem to actually ever leave
18:02:28  Gregor: BTW, I had some more thoughts about transactional semantics for HackEgo; as far as I can tell, it's simple, but there's one important caveat:
18:02:40  Gregor: Commands all run at once, /but/ you don't get the output of any command until they /all/ finish.
18:02:45  Vorpal: does it nonetheless arrive?
18:02:46  (Ignoring writes)
18:02:47  elliott: Done.
18:03:01  Gregor: I don't think that's so terrible as to make it not worth it, though; everything still takes the same amount of time.
18:03:20  It does mean that `sleep 30 is a bit annoying, but only Madoka-Kaname would do that, and HackEgo ignores her :P
18:04:17  `run bash -c "'?' welcome | cat <(echo -n 'elliott: ') -"
18:04:20  elliott: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
18:04:26  "The easy way."
18:04:26  fizzie: So convenient.
18:04:26   Vorpal: does it nonetheless arrive? <-- no
18:04:31  `run ? welcmoe
18:04:32  boring
18:04:33  welcmoe? ¯\(°_o)/¯
18:04:37  Oh, that works
18:04:43  ais523, it is just boringly plain broken.
18:04:54  Gregor: I'm tempted to replace `?'s > support with a "to" command, but I dunno...
18:05:06  "`? welcome > newbie" is shorter than "`run ? welcome | to newbie" :P
18:05:17  ais523, I assume you know that Skyrim had a day-1 patch?
18:05:21  Ooh
18:05:23  and I have that patch
18:05:25  I could make it `to newbie ? welcome
18:05:35  `run which to
18:05:36  ais523, so actually version 1.1 was released on the 11/11/11
18:05:37  No output.
18:05:39  `run while true; do '?' `t` > t2; cat t2; mv t2 t; done
18:05:49  ais523: that's going to be annoying...
18:05:54  bleh, do infinite loops not produce output anyway?
18:06:09  `run for x in `seq 1 5`; do '?' `t` > t2; cat t2; mv t2 t; done
18:06:10  wtf is `t` supposed to do.
18:06:11  bash: t: command not found \ cat: wisdom/: Is a directory \ bash: t: command not found \ cat: wisdom/: Is a directory \ bash: t: command not found \ cat: wisdom/: Is a directory \ bash: t: command not found \ cat: wisdom/: Is a directory \ bash: t: command not found \ cat: wisdom/: Is a directory \ bash: t: command not found
18:06:13  bash: t: command not found \ cat: wisdom/: Is a directory \ bash: t: command not found \ cat: wisdom/: Is a directory \ bash: t: command not found \ cat: wisdom/: Is a directory \ bash: t: command not found \ cat: wisdom/: Is a directory \ bash: t: command not found \ cat: wisdom/: Is a directory
18:06:17  `run for x in `seq 1 5`; do '?' `cat t` > t2; cat t2; mv t2 t; done
18:06:22  cat: wisdom/: Is a directory \ cat: wisdom/: Is a directory \ cat: wisdom/: Is a directory \ cat: wisdom/: Is a directory \ cat: wisdom/: Is a directory
18:06:24  sorry, missed a car
18:06:30  what?
18:06:33  `revert 934
18:06:34  *missed a cat
18:06:35  Done.
18:06:47  the idea's to repeatedly iterate ?
18:07:11  Poorly :P
18:07:13  so we have one ? then two ?s then three ?s, etc
18:07:18  Gregor: it's bash, it's not Haskell
18:07:35  Gregor: It would be kinda nice if we could revert single files...
18:07:45  elliott: Waaaaaaah
18:07:47  :P
18:08:00  Gregor: Pah :P
18:08:10  Hmmmmm
18:08:20  Since HackEgo is actually running umlbox, I could make .hg present but read-only.
18:08:44  That would be nice
18:08:50  `gdb
18:08:52  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: gdb: not found
18:08:55  :(
18:09:02 -!- monqy has joined.
18:09:07  Gregor: It would also be nice if we could install packages ourselves ;D
18:09:11 -!- Ngevd has joined.
18:09:42  elliott: Blurp
18:10:09  `echo Did I just break everything?
18:10:09  Well, Pietbot seems to work when it recieves a PRIVMSG from #esoTERiC
18:10:10  Did I just break everything?
18:10:11  Invalid .hg directory found.
18:10:14  lol
18:10:15  but not #esoteric
18:10:19  or #ESOTERIC
18:10:22  `echo Did I just break everything?
18:10:24  Did I just break everything?
18:10:55 -!- useless-fungot has joined.
18:10:58  Hmmmmmmmmmmmmmmmmmmm
18:11:00  What does
18:11:01  foo="$@"
18:11:02  do
18:11:19  ](:S:^):^
18:11:36  ](test)S
18:11:45  You might want ]ul
18:11:49  OK, that didn't work, presently .hg is accessible :P
18:11:52  ]ul (:S:^):^
18:11:52  :S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^:S:^ ...too much output!
18:11:55  ]ul (test)S
18:11:55  test
18:12:08  OK, the reaction to the first one was fast enough that there's definitely a bot involved
18:12:21  OK, fixed.
18:12:23  ]help
18:12:26  .hg is now present but read-only.
18:12:28  Go nuts.
18:12:31  ]ul (:S(a)*:^):^
18:12:31  :S(a)*:^:S(a)*:^a:S(a)*:^aa:S(a)*:^aaa:S(a)*:^aaaa:S(a)*:^aaaaa:S(a)*:^aaaaaa:S(a)*:^aaaaaaa:S(a)*:^aaaaaaaa:S(a)*:^aaaaaaaaa:S(a)*:^aaaaaaaaaa:S(a)*:^aaaaaaaaaaa:S(a)*:^aaaaaaaaaaaa:S(a)*:^aaaaaaaaaaaaa:S(a)*:^aaaaaaaaaaaaaa:S(a)*:^aaaaaaaaaaaaaaa:S(a)*:^aaaaaaaaaaaaaaaa:S(a)*:^aaaaaaaaaaaaaaaaa:S(a)*:^aaaaaaaaaaaaaaaaaa: ...too much output!
18:12:37  yep, definitely
18:12:51  `revert 914
18:12:53  Done.
18:12:54  `fetch http://sprunge.us/NLfb
18:12:55  2011-11-11 18:12:55 URL:http://sprunge.us/NLfb [179] -> "NLfb" [1]
18:13:00  `run mv NLfb bin/'@'; chmod +x bin/'@'
18:13:02  No output.
18:13:04  (note: that is /not/ a sensible way to do a loop counter in Underload)
18:13:04  `@ ais523 ? welcome
18:13:06  ais523: exec: 9: welcome: not found
18:13:12  elliott: LOLOL U FAIL
18:13:13  o_O
18:13:15  HackEgo: thanks for that
18:13:22  `run @ ais523 \? welcome
18:13:24  ais523: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
18:13:36  `ls
18:13:37  bin \ canary \ karma \ lastquote \ lib \ paste \ quotes \ share \ wisdom
18:13:50  hmm
18:13:52  elliott: Interpolation's a bitch, eh?
18:13:57  `run @ "ais523 ? welcome"
18:13:59  ais523: exec: 9: welcome: not found
18:14:05  Oh
18:14:11  `run echo "ais523 ? welcome" | sed 's/.* //'
18:14:13  welcome
18:14:16  `run @ 'elliott ? welcome'
18:14:17  Gregor: regexp's a bitch, eh?
18:14:18  elliott: exec: 9: welcome: not found
18:14:28  elliott: Yup
18:14:29  nothing to do with interpolation at all
18:14:34  but rather, splitting into args
18:14:41  `fetch http://sprunge.us/gFYW
18:14:42  2011-11-11 18:14:42 URL:http://sprunge.us/gFYW [182] -> "gFYW" [1]
18:14:43  `run @ elliott \? abc def
18:14:45  elliott: abc? ¯\(°_o)/¯
18:14:45  `log
18:14:47  2009-04-28.txt:19:21:42:  ehird, what did you say thenm
18:14:47  `run mv gFYW bin/@; chmod +x bin/@
18:14:48  `hg log
18:14:49  No output.
18:14:57  `@ newbie ? welcome
18:14:59  newbie: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
18:15:01  changeset:   949:5a502f968ae0 \ tag:         tip \ user:        HackBot \ date:        Fri Nov 11 18:14:43 2011 +0000 \ summary:      fetch http://sprunge.us/gFYW \  \ changeset:   948:9c64676a536c \ user:        HackBot \ date:        Fri Nov 11 18:13:03 2011 +0000 \ summary:      run mv NLfb bin/'@'; chmod
18:15:03  Gregor: Tada
18:15:46  `@ elliott @ elliott @ elliott @ elliott @ elliott @ elliott @ elliott @ elliott @ elliott @ elliott @ elliott @ elliott @ elliott @ elliott @ elliott @ elliott @ elliott @ elliott @ elliott @ elliott @ elliott @ elliott @ elliott @ elliott @ elliott echo hi
18:15:50  elliott: elliott: elliott: elliott: elliott: elliott: elliott: elliott: elliott: elliott: elliott: elliott: elliott: elliott: elliott: elliott: elliott: elliott: elliott: elliott: elliott: elliott: elliott: elliott: elliott: hi
18:16:05  `run hg log --style help
18:16:08  abort: style not found: help
18:16:17  `@ `yes @` help
18:16:19  ​`yes: exec: 9: @`: not found
18:16:20  Gregor: How list styles
18:16:24  elliott: I not know
18:16:31  OK, it wouldn't have worked anyway
18:16:41  bash isn't lazy
18:16:42  `run hg log --style compact
18:16:44  950[tip]   9d673ce664d4   2011-11-11 18:14 +0000   HackBot \    run mv gFYW bin/@; chmod +x bin/@ \  \ 949   5a502f968ae0   2011-11-11 18:14 +0000   HackBot \    fetch http://sprunge.us/gFYW \  \ 948   9c64676a536c   2011-11-11 18:13 +0000   HackBot \    run mv NLfb bin/'@'; chmod +x bin/'@' \
18:16:49  ais523: bash. Still not Haskell?
18:16:58  Gregor: git log --oneline # git is more usable than hg
18:17:06  elliott: Waaaaah
18:17:20  `run hg log --template '{rev} {desc}\n'
18:17:21  elliott: Considering that every other command in git sucks ass, I don't know if I agree.
18:17:23  950  run mv gFYW bin/@; chmod +x bin/@ \ 949  fetch http://sprunge.us/gFYW \ 948  run mv NLfb bin/'@'; chmod +x bin/'@' \ 947  fetch http://sprunge.us/NLfb \ 946  revert 914 \ 945  run touch foo ; hg add foo ; hg commit -u Blerp -m - \ 944  run rm -f foo foobar
18:17:53  `run hg log --template '{author|obfuscate}'
18:17:55  ​HackBotHackBotHackBotHackBotHackBotHackBotHackBotBlerpHackBotHackBotHackBotHackBotHac&
18:17:56  Gregor: as in, git has one good command, or as in git commands alternate between good and bad?
18:18:01  Gregor: hg: still sucks ass!
18:18:16  what's the obfuscate filter's intended use?
18:18:17  (That so counts as sucking ass, because it's so confusing :P)
18:18:21  ais523: Generating HTML.
18:18:26  ais523: git has now shown me one good command in git. The rest are, to my knowledge, terrible.
18:18:29  Yes, hg comes with a mini templating language meant to let you us "hg log" to generate HTML pages.
18:18:41  elliott: yes, but why would you want to do that? it doesn't really block scraping at all
18:18:46  as HTML scrapers can generally parse HTML
18:18:52  ais523: actually, most don't bother
18:18:58  or at least didn't a while ago
18:19:14  ais523: why spent five hours parsing all the various ways to obfuscate emails? people who do that won't be fooled by your spam anyway
18:19:30  if you only scrape for emails in the most obvious format, you still get thousands upon thousands of them, and they're likely to be more gullible too
18:19:35  "Wait, you said TURKEY? I thought you said TURKS! Ha ha ha cannibalism."
18:20:14  elliott: because the motive in sending spam nowadays is no longer to get people to read the spam
18:20:26  but rather, because you've been hired to send the spam to X people
18:20:34  people don't roll their own spambots nowadays
18:20:41  ais523: well, sure
18:20:45  it's still a waste of time to deal with obfuscation
18:20:46  and the spambot owners are ripping off the spammers, just as the spammers are trying to rip off victims
18:21:01  nah, it lets you say you're sending to, say, 2 billion targets rather than 1 billion
18:21:15  (I'm guessing at the number of email addresses on the Internet there)
18:21:38  ais523: why not just lie? you're not going to be sending spam to that many people anyway
18:21:57  I, umm, honestly hadn't thought of that
18:22:24  ah right, it's because the people who harvest the addresses aren't the same as the people who send emails nowadays
18:22:37  and there's a bulk rate for email addresses that don't bounce on the black market
18:22:40 -!- MDude has quit (Ping timeout: 248 seconds).
18:22:44  and you won't get paid for the same address twice
18:23:08  let's just ask CakeProphet, he has first-hand experience!
18:26:41  Gregor: Hmm, having .hg is kinda nice, but it'd be nice if you could write to the parts where hg stores the info for the next commit
18:26:53  elliott: Nope.
18:26:54  I don't know what that would let you achieve, but it sounds nice :P
18:26:59  Gregor: :'(
18:27:09  "the people who harvest the addresses aren't the same as the people who send emails nowadays" is true as far as I can tell.
18:29:51 -!- Zuu has joined.
18:36:08  elliott: I misinterpreted .hg as a ccTLD
18:36:17  Doesn't exist :'(
18:36:18  is it actually one of those, and if so, where?
18:36:31  How long until +scapegoat is a ccTLD :P
18:37:03 -!- zzo38 has joined.
18:39:10 -!- augur has quit (Remote host closed the connection).
18:48:45 -!- Ngevd has quit (Ping timeout: 258 seconds).
18:53:31  Is there any sense in not just treating LF, CR, *or* CR/LF as \n when reading a file?
18:53:58  usually when it's binary data.
18:54:11  File containing text.
18:54:34  pikhq_: what if the file actually contains two consecutive newlines, one of which is CR, one of which is LF?
18:54:35  Of course, when you're dealing with binary data you don't want any munging at all.
18:54:40  uh, if you're writing a program to determine what kind of system you're on based on the line endings of files. :P
18:54:55  ais523: There is no platform on which this is going to come out right. :)
18:55:20  CR or LF but not CR/LF as \n? Seriously, WTF?
18:56:49  oh, a program that converts line-endings of one style to another. Well, actually no that would benefit from automatic line ending stuff.
18:58:24  CakeProphet: only if its output style was configurable
18:58:30  as in, the functionality's
18:58:36  right
19:00:55  encoding conversion.
19:01:14  Vorpal: So is Skyrim any good
19:01:26  insert-task-where-you-are-concerned-about-the-binary-representation-of-text-data.
19:01:54  elliott: he's probably too busy playing Skyrim to answer that.
19:02:01  pikhq_: Here's a good reason: \r\n is a separate list of codepoints to \n.
19:04:21  elliott: Why should that mean that on UNIX it gets rendered as ^M\n instead of \n?
19:05:06  http://www.fileformat.info/info/unicode/char/000d/index.htm
19:05:06  http://www.fileformat.info/info/unicode/char/000a/index.htm
19:05:13  "Text" usually means "sequence of Unicode codepoints".
19:05:22 -!- derrik has joined.
19:05:24  Mangling that sequence = mangling text.
19:05:34  Boy, you must hate Unicode normalisation.
19:06:06  That's a standard form of mangling :)
19:06:21  Or rather, I just don't consider /silent/ transformation of that sequence acceptable
19:06:26  *Not* rendering \r\n or \r as \n does not preserve the semantics of the text, even if it does preserve the codepoint sequence.
19:06:26  Since it's an actual operation
19:06:34  Shrug, define text
19:06:49  The question is, do you want to preserve the intended semantics, or the codepoint sequence?
19:06:58  elliott: is "the shit you just typed" a valid definition?
19:07:06  No
19:07:21  I here note that Windows generally already *performs* a similar mangling.
19:07:31 -!- Sgeo|web has quit (Ping timeout: 265 seconds).
19:07:39  The sequence "\r\n" gets handing to the program as "\n".
19:08:17  lots of things do then when opening files in text mode.
19:08:21  *do that
19:08:24 -!- augur has joined.
19:08:29  pikhq_: Windows is broken, how surprising!
19:08:39  pikhq_: Anyway invalid
19:08:43  That's not Unicode
19:08:49  Files are bytestrings
19:09:00  Windows just completely unacceptably mangles bytestrings by default :)
19:10:17  elliott: Per ISO C, this is completely permitted semantics for stdio. If you want no mangling, you should add "b" to your fopen.
19:10:38  C is broken???? OH GOD YOU'RE RUINING MY HEART
19:10:44  THIS IS SO UNEXPECTED!!!
19:11:19  As the default for stdio is that you're reading text in the system's encoding, not binary data.
19:11:38  It would be perfectly permissible for stdio to have a EBCDIC to ASCII conversion step, in fact.
19:11:49  Strange as hell, but perfectly permissible.
19:12:20  elliott: uh, Python, Ruby, Perl, and Haskell all do that kind of translation in text mode as well.
19:12:21  pikhq_: you're describing how C-INTERCAL's stdio actually works
19:12:21  or it could just use EBCDIC as its runtime character set or whatever they call it in C
19:12:24  (of course, performing this mangling is a violation of POSIX; "b" must be a no-op)
19:12:24  *CLC-INTERCAL
19:12:33  (or C-INTERCAL's in CLC-INTERCAL compat mode)
19:12:52  CakeProphet: Python and Haskell's file IO is based around Unicode strings
19:12:53  at last I think you can, they might've made it boring and standardized on ascii nowadays
19:13:01  God knows about Perl
19:13:06  Don't care about Ruby
19:13:36  both ruby and perl are based on Unicode as well. (at least in newer versions of Perl 5)
19:14:03  CakeProphet: you cannot "base a language" on Unicode
19:14:09  elliott: Perl's Unicode is massively beautifully overengineered, it blows most languages' out of the water
19:14:14  Ruby 1.8 called bytestrings String
19:14:14  elliott: ....seriously?
19:14:17  I don't know what 1.9 does
19:14:46  elliott: s/are based/ file IO are based/
19:14:52  (for fucks sake)
19:14:58  CakeProphet: that's still not a meaningful statement
19:15:16  bytestrings are not sequences of unicode codepoints
19:15:29   < elliott> CakeProphet: Python and Haskell's file IO is based around
19:15:29                   Unicode strings
19:15:35  it is possible to have a language which reads sequences of unicode codepoints and then encodes them in another encoding and returns the resulting bytestring for file IO reading operations
19:15:35  please take this horribly mangled quote of yours
19:15:39  as include perl and ruby to it.
19:15:42  s/as/and/
19:15:45  CakeProphet: "Unicode" =/= "Unicode strings"
19:15:46  and you will get what I am saying.
19:15:52  elliott: this conversation is stupid.
19:16:18  no, you're just being stupid
19:16:18 -!- oerjan has joined.
19:16:31  brr, cold
19:16:54  elliott: I understand the difference between codepoints and encodings.
19:17:41  elliott: you're wasting your time trying to make a point out of it.
19:17:49  i'm not
19:18:13  if you seriously can't understand how "file IO being Unicode but still using bytestrings" is not a complete description
19:18:20  and not the same thing as "file IO uses a unicode string type"
19:18:21  then w/e
19:21:52  how does one represent Unicode without a sequence of bytes.
19:22:47  lol
19:23:17 -!- pikhq has joined.
19:23:22  is that a silly question?
19:23:37 -!- pikhq_ has quit (Ping timeout: 255 seconds).
19:23:56  s/\./?/  here I'll even make it a question with this special little symbol.
19:24:49  CakeProphet: With a sequence of glyphs.
19:25:04  CakeProphet: A sequence of... say...
19:25:06  Codepoints...
19:25:13  !!!!!!!!!!11111
19:25:18  ah. I still haven't upgraded to these codepoint-based machines.
19:25:22  still using bytes over here.
19:26:33  I can see why there's a discrepancy now.
19:26:36  It's funny because you're pretending to be so idiotic that you think "RAM is composed of bytes" is equivalent to "there are literally no types other than 'array of bytes' and it is impossible to distinguish them".
19:26:46  In other words, nice talking to you!
19:27:42  elliott: I'm saying there's not much distinguishing a bytestring encoded in Unicode and a sequence of codepoints
19:27:47  other than well... how they're encoded.
19:28:21 -!- MSleep has joined.
19:28:26  CakeProphet: Yeah! For instance, a string consisting solely of a codepoint that takes two bytes to encode in UTF-8 OBVIOUSLY has length 2.
19:28:42  2 codepoints + 2 codepoints = 5 codepoints
19:28:43 -!- MSleep has quit (Client Quit).
19:28:57  elliott: okay so then Perl uses a "unicode string type"
19:28:57 -!- MSleep has joined.
19:28:57 -!- MSleep has changed nick to MDude.
19:29:05  elliott: as I was saying..
19:29:27  You cannot prove that just by checking length.
19:29:36  length_after_decoding_utf8 is a perfectly valid operation; Perl may call it "length".
19:29:57  Of course you can implement a Unicode string type by using an internal UTF-8 representation: the question is whether the abstraction is leaky.
19:30:15  Since Perl had approximately a billion decades before getting Unicode support, my guess as to the probability of there being no leaks in its abstraction is 0.
19:30:31  and therefore it is "not a unicode string type"?
19:30:59  Obviously:
19:30:59   CakeProphet: Yeah! For instance, a string consisting solely of a codepoint that takes two bytes to encode in UTF-8 OBVIOUSLY has length 2.
19:31:14  If length reported the length in UTF-8 bytes, it would obviously not be calculating the length of a Unicode string.
19:31:32  (Obviously you can cheat and say that there's an implicit _after_encoding_to_utf8 suffix to any abstraction leaks.)
19:31:41  "Returns the length in characters of the value of EXPR. If EXPR is omitted, returns the length of $_ . If EXPR is undefined, returns undef."
19:31:46  characters is in italics.
19:31:48  (That fails if Perl accepts, and retains, UTF-8 variants though...)
19:31:54  (e.g. that one that has no 0 bytes.)
19:32:02  CakeProphet: My argument extends to any operation.
19:32:14  Anyway, this is boring, and I need to go do things.
19:32:17 -!- elliott has quit (Quit: Leaving).
19:35:33   elliott: never say that, you attract attention from people who actually /do/ know everything
19:35:44  nah, we know that he doesn't really know everything.
19:36:49  Hmm. According to Unicode, conforming applications should accept the following as line terminators: U+000A U+000B U+000C U+000D (U+000D U+000A) U+0085 U+2028 U+2029.
19:38:24  what's 0xB?
19:38:30  vertical tab?
19:38:34  Yup.
19:38:52  I don't recognise the other three, but didn't really expect to
19:39:34  Those are NEXT LINE, LINE SEPERATOR, and PARAGRAPH SEPERATOR
19:39:41  no pagebreak?
19:39:48  U+0085 looks weirdest to me, it's in latin 1 but above ascii
19:40:02  It's from ISO-8859-1.
19:40:17  But not in Windows-1252.
19:41:28  It has a block of control codes at the same "location" than ASCII.
19:42:01  I'm not entirely certain the control codes are specified by ISO-8859-1 though, I'd appreciate a citation on this.
19:42:48  Strictly speaking they're not, there's merely defined space *for* control codes.
19:42:54  http://codu.org/projects/trac/ <-- behold my new and improved trac installation
19:42:59  ISO 8859-1 is the standard, it doesn't specify the control codes
19:43:13  However, it's usually used with the C0 and C1 control code set.
19:43:14  ISO-8859-1 is the preferred name for the charset which includes the control codes
19:43:28  C0 is the the set in ASCII.
19:43:37  Gregor: there is something wrong in today's logs between 17:14:19 and 17:17:57, i suspect some parts/quits and joins are missing
19:44:04  Yes, \r and \n technically aren't in ISO 8859-1.
19:44:06 -!- elliott has joined.
19:44:34  Gregor: oh hm, maybe just one part/quit (ais523)
19:44:43  Gregor: I like the copy of gcc-bf :P
19:44:49  oerjan: I didn't part, I kicked myself
19:44:50  oerjan: it was a kick
19:44:51  and then rejoined
19:44:55  ah.
19:45:05  elliott: 's useful.
19:45:10  I'd needed to unstealth, and then kicked myself as a simple way of stealthing again
19:45:12  Aha, kick.
19:45:15  I can add that.
19:45:17  Gregor: STILL, MISSING INFORMATION
19:45:31  ais523: How come you never gave me a gcc-bf tarball :P
19:45:34  Or did you, I might have just forgotten :)
19:45:47  elliott: I think I did
19:45:54  oh right, it was hosted on Vorpal's server, I think
19:45:57  no idea if it still is
19:46:11  perhaps now is a good time to chug a Coke, Monster, and Starbucks doubleshot.
19:46:18  yes I think it is.
19:46:59  afterwards I will link pics of my heart exploding.
19:48:23  elliott: 12:36 < pikhq> Hmm. According to Unicode, conforming applications should accept the following as line terminators: U+000A U+000B U+000C U+000D (U+000D U+000A) U+0085 U+2028  U+2029.
19:48:52  Anyhow, Perl certainly makes the Unicode attempt not too shabbily -- http://perldoc.perl.org/perlunicode.html -- the "Effects of Character Semantics" pretty much lists what they do; sadly there isn't exactly a list of what they don't do. (But they explicitly say they're not claiming any Unicode standard compliance.)
19:48:57  pikhq: Accept, not have automatically degraded for them
19:49:08  fizzie: I've seen a comparison of Unicode support in programming languages; Perl won
19:50:24  ais523: the results of a comparison of /painless/ Unicode support would be quite different.
19:50:43  Unicode support cannot be "painless" because it involves thinking
19:50:55  think pain
19:50:59  in character semantics, Perl's unicode support is pretty automatic
19:51:08  you just have to realise that what you're writing is talking about characters, not bytes or codepoints
19:51:17  No, it's usually about codepoints.
19:51:19  Not characters.
19:51:30  "(The only time that Perl considers a sequence of individual code points as a single logical character is in the \X construct, already mentioned above. Therefore "character" in this discussion means a single Unicode code point.)"
19:51:30  fizzie: in Perl, it's about characters
19:51:33  IIRC
19:51:34   ais523: if it's a function in a pure language, you can't, because all sorting algorithms are equivalent, modulo stability
19:51:38  ah, just for \X? boring
19:51:38  The above is from perldoc perlunicode.
19:51:55  i recall toying around with passing broken comparing functions to haskell's sortBy :P
19:52:03  oerjan: me too.
19:52:12  oerjan: Fixt, regenerating.
19:52:25  that way i could see what was compared in what order
19:52:26  Gregor: You never responded wrt transactional HackEgo :P
19:52:34  elliott: I have no response.
19:52:44  There's of course all kinds of modules, like Unicode::Normalize, which consider characters.
19:52:51  17:17:12: -!- ais523 has kicked ais523 from #esoteric: there are actually quite a lot of ways to deop yourself, this is one of them
19:52:53  Gregor: It was a question of the form "is this acceptable"
19:52:56  (under the assumption no pair is compared twice)
19:53:14  elliott: It's less than ideal, but if you put the work into making it, err, work, then I'll accept it :P
19:53:33  Excellent
19:53:33  `help
19:53:40  The way Unicode defines a "character" is rather non-trivial: http://unicode.org/reports/tr29/#Grapheme_Cluster_Boundaries
19:53:41  Runs arbitrary code in GNU/Linux. Type "`", or "`run " for full shell commands. "`fetch " downloads files. Files saved to $PWD are persistent, and $PWD/bin is in $PATH. $PWD is a mercurial repository, "`revert " can be used to revert to a revision. See http://codu.org/projects/hackbot/fshg/
19:53:43  monqy: `help
19:53:45  hi
19:53:50  Gregor: It's, uh, still written in bash, right? :P
19:53:55  fizzie: clearly we need an esolang whose only purpose is doing Unicode completely correctly
19:54:01  (But at least it's still a relatively simple algorithm, as long as you have the database.)
19:54:06  come to think of it, I guess Java probably can, but nobody has figured out how
19:54:16  elliott: Ayup
19:54:29  Gregor: Do I... have to keep that? :P
19:54:40  elliott: Most languages other than Haskell are acceptable.
19:54:49  What about... Haskell?
19:54:54  Miranda? Gofer?
19:54:58  O'Haskell?
19:55:03  Java has trouble even handling non-BMP stuff the way people usually use the java.lang.String API.
19:55:05  dph
19:55:07  Disciple?
19:55:13  elliott: perl
19:55:20  or is dph not considered as distinct from haskell as those
19:55:34  DPH is just a realtively simple language extension :P
19:55:46  elliott: BASIC
19:55:53  GdH
19:55:58  cloud haskell
19:55:59  Deewiant: God damn Haskell?
19:56:03  elliott: Fortran
19:56:06  Gregor: How are these sounding???
19:56:07  elliott: Glasgow Distributed Haskell
19:56:08  coq agda epigram what else
19:56:14  elliott: Scala io
19:56:17  elliott: PLOF
19:56:22  Deewiant: Wow, didn't realise that even existed.
19:56:23  elliott: It's based on GHC 5.0 IIRC
19:56:26  elliott: How would you feel if I called it "newline normalisation"?
19:56:26  and clean, of course
19:56:28  Deewiant: Nice.
19:56:35  pikhq: Sure, just don't make it implicit
19:56:38  elliott: K
19:56:49  pikhq: Why are you doing this anyway
19:57:03  elliott: I was just thinking it'd be a hell of a lot nicer than "Derp ^M\n"
19:57:25  good name.
19:57:50  pikhq: solution: destroy all non-unix operating systems
19:58:19  Gregor: Why does HackEgo have DCC support...
19:58:23  CakeProphet: rip @
19:58:25  pikhq: er, non-\n operating systems, rather.
19:58:31  hgegeheheh
19:58:36  how did g get in there
19:58:40  keyboar.d.
19:58:44  CakeProphet: And then make the network newline convention \n instead of \r\n?
19:58:51  elliott: It ... doesn't?
19:58:52  pikhq: oh, yes, of course.
19:58:56  I should switch to a nonquerty layout so my typos are more mysterious
19:58:58  Gregor:
19:59:01       4 . lib/dcc
19:59:01      25 maybe_dcc_chat() {
19:59:01 -!- Phantom_Hoover has joined.
19:59:05  pikhq: YOU WILL SEE A DRAMATIC INCREASE OF DATA THROUGHPUT
19:59:09  elliott: It has some leftover unused files.
19:59:14  because you're not stupidly using TWO WHOLE BYTES for lines.
19:59:27  Gregor: maybe_dcc_chat is an unused FUNCTION in a used FILE oh snapepe!!!!
19:59:31  pikhq: /dramatic/
20:00:32  pikhq:  we just need some kind of software apocalypse
20:00:41  so that we can redefine all of the standards so that they're sane.
20:01:11  and people won't complain about their code breaking
20:01:18  because THERE IS NO CODE MUAHAHAHAHA.
20:02:30  I never realised the Wolfram blog was so entertaining.
20:02:30  Phantom_Hoover: You have 1 new message. '/msg lambdabot @messages' to read it.
20:02:56  @tell lambdabot ur dumb
20:02:56  Nice try ;)
20:02:58  It's all like "Oh no we want to investigate this thing but we can't do the sums, GOOD THING WE HAVE MATHEMATICA".
20:03:23  hm...
20:03:28          pola-nice "$@" |
20:03:29  Gregor: ??????
20:03:32  Gregor: Where's UMLBox???
20:03:36  CakeProphet: Unicode without round-trip! YES
20:03:49  elliott: pola-nice is just a command name, it's implemented in lib/interp
20:03:52  Gregor: Oh, you call it "pola-nice" even though it's umlbox >_<
20:03:53  elliott: The name is just olde.
20:03:53  `echo oerjan: test
20:03:58  Gregor: That should really be umlbox-nice :P
20:04:00  oerjan: test
20:04:03  elliott: Waaaaaaaaaaaah
20:04:53  monqy: are you best porgrammeer now.
20:05:09  oh, it doesn't use that no-width space then
20:06:01  Gregor: What the heck is UNDO...
20:06:10  Phantom_Hoover: mathematicians discover programming languages? shocking.
20:06:54  fortunately they used the only one that can do sums.
20:07:14  Gregor: Oh... it's like atexit but weird
20:09:30          umlbox-nice "$@" |
20:09:30              head -c 16384 |
20:09:35  I don't think Gregor realises how short IRC lines are :P
20:09:39  Oops, spoiled my SECRET RENAME
20:09:53  what's umlbox-nice?
20:10:00  Like pola-nice but not STUPIDLY NAMED
20:10:01  its pola-nice
20:11:06  let me rephrase then: what's pola-nice?
20:11:27  nice
20:11:37  like umlbox-nice but STUPIDLY NAMED?
20:11:41  elliott: as in nice(1)?
20:12:14  umlbox-nice() {
20:12:14       nice -n10 /usr/bin/umlbox -n -B -f /opt -f /var/irclogs -f /etc/java-6-openjdk -R3128:127.0.0.1:3128 -T 30 -tw \
20:12:14   /hackenv . -t /hackenv/.hg .hg -f "$ORIGDIR/lib" --cwd /hackenv env PATH="$UMLBOX_PATH" \
20:12:14   HACKENV=/hackenv http_proxy="$http_proxy" "$ORIGDIR/lib/limits" "$@"
20:12:14  }
20:12:15  hth
20:13:17  oh, nice
20:13:21  hmm, Mastermind is pretty awesome right now; the host couldn't stop asking earlier
20:13:29  during the questions
20:13:36  I'm not sure if it's the actual program or a parody
20:13:41  oh, Children in Need, that makes sense
20:14:02  what's an underloved data structure in computing?
20:14:16  ais523: I wish I was the kind of person who could watch a parody without realising it :P
20:15:07  The Fibonacci heap gets no love, all heap-love goes to binary/binomial heaps.
20:15:35  fizzie: can I create an entire programming language around this data structure?
20:15:43  there's a nice law about parodies and reality being notoriously difficult to tell apart
20:15:49  I don't know if it'd be a very interesting language.
20:15:50  Poe's?
20:16:03  Phantom_Hoover: sounds about right yeah
20:16:05  Also BLOOD FILTERS, they're like Bloom filters except you kill people. (Disclaimer: not true.)
20:16:17  elliott: I don't think it was a parody; rather, someone had picked a plausible yet goofy specialist subject in order to trip up the host (the Transformers canon)
20:16:24  and the audience weren't taking it seriously
20:16:27  so nobody else could either
20:16:37 -!- someoneyouhate has quit (Ping timeout: 240 seconds).
20:16:54  well, I mean, a not-an-actual-episode
20:17:45  fizzie: maybe if it's homoiconic. :)
20:18:08  fizzie: You seem like the kind of person who knows about bash arrays.
20:18:26  elliott: I used them a little bit recently, but I can't say I'd *know* about them.
20:18:32  elliott: I hadn't watched the whole thing
20:18:46  Hmm, wait
20:19:04  elliott: what about bash arrays?
20:19:05  Gregor: All HackEgo stuff is command-triggered, right
20:19:06  I've used bash arrays once
20:19:20  elliott: Oh, man, bash arrays!
20:19:20  Gregor: Does HackBot let me run any code in the background :P
20:19:24  Don't get me started about bash arrays.
20:19:25 * shachaf mad
20:19:29  Thanks for that.
20:19:51  Previously I not mad, and now I mad.
20:19:59  don't bash arrays
20:20:00  shachaf: Yeah well, Gregor is a fascist and won't let me use Haskell.
20:20:12  Wait, what's the context?
20:20:20  Why do so many people think astrology gets the position of the Sun incorrect? That simply isn't true, and you can say a lot of valid things about astrology being wrong without having to say the position of the Sun is incorrect.
20:20:21  zzo38: You have 1 new message. '/msg lambdabot @messages' to read it.
20:20:22  Bash arrays are this thing where you get several hammers and then use them to bash in several nails at the same time.
20:20:25 * shachaf doesn't feel like reading all this scrollback.
20:20:27  elliott: Won't let you to use Haskell for what purpose?
20:20:33  HackEgo!
20:20:33  Use Haskell if you like to do so.
20:20:47  elliott: zzo38 has given you sage advice.
20:21:13  However it is true that you don't have to use Haskell for everything.
20:21:21  sage advice in good thyme
20:21:29  shachaf: TECHNICALLY I could use Haskell but then Gregor wouldn't pull. :'(
20:21:40 -!- Sgeo|web has joined.
20:21:50 -!- sebbu has joined.
20:21:51 -!- sebbu has quit (Changing host).
20:21:51 -!- sebbu has joined.
20:21:53  What program are you trying to write?
20:21:59  Something for Gregor?
20:22:21  I'm trying to make HackEgo's concurrency semantics not suck.
20:23:27  array = ( [2]=blah  [50]=30 )
20:23:32  best syntax
20:25:21  oerjan: Do you mean a group having everything being their own inverse is called exponent 2 group?
20:25:32  s/ =/=(?#no wait this is the best syntax)/
20:25:45  zzo38: yes.  because it's the same as every element having order 2.
20:25:58  O, OK.
20:26:00  (or 1)
20:27:30  In Haskell I used:   minverse = id;    (as a method of the Group class)
20:27:51  so apparently Steam was hacked.
20:28:16  indeed
20:29:01  Does this make a monoid?   mempty = Equivalence (==); mappend (Equivalence f) (Equivalence g) = Equivalence $ \x y -> (x == y) /= (f x y /= g x y);   I think it is a monoid, due to the XOR law.
20:29:59  I think it is also an exponent 2 Abelian group.
20:30:03  hm well it needs to be a monoid just when restricted to particular x and y...
20:30:20  so yes, i think so.
20:30:44  Hmm, wait.
20:30:55  Gregor: I might not need a background process to do this, but it'd be more convenient :P
20:32:05  zzo38: all exponent 2 groups are abelian, btw
20:32:31  oerjan: O, yes, OK.
20:32:47  CakeProphet: Did you see latest HS updates? If not, do a reaction video
20:33:04  It forms an exponent 2 group also due to the XOR law, I think.
20:33:12  Past the [S] I mean
20:33:20  Sgeo|web: UGH WHY DO YOU ALWAYS ASK ME THIS SHIT
20:33:20  yes.
20:33:36  Sorry
20:33:49  it was mentioned in the same godel's letter post, although there is some bug in the tex picture for the proof, i saw it myself and someone on reddit also did
20:33:57  Sgeo|web: no worries it was hyperbole.
20:34:01  you can tell because IT WAS LIKE THIS.
20:34:11 -!- someoneyouhate has joined.
20:34:22  someoneyouhate: hi.
20:34:35 * oerjan hits someoneyouhate with the saucepan ===\__/
20:34:48  `@ someoneyouhate ? welcome
20:34:51  someoneyouhate: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
20:35:54  zzo38: it works for each pair of x,y because both XOR and EQV are group operations
20:37:09  oerjan: is there a group on groups?
20:37:15  so it's essentially an indexed product of such groups
20:37:39  CakeProphet: i dunno
20:39:26  well you could have an operation that forms a group from two groups by taking the product of the two sets and then essentially &&&ing the two operations.
20:39:29  I think?
20:40:17  with the group being (Bool, (==)) when x == y and (Bool, (/=)) when x /= y
20:40:55  CakeProphet: yes, that's called the direct product
20:41:12  but it has no corresponding inverse
20:41:42  ah
20:41:55  oerjan: why is type-hackery so hard :(
20:42:08  elliott: because you're not doing it C++. :>
20:42:12 * CakeProphet is oerjan.
20:42:16  because obviously you can never get the trivial group (which is the identity) by combining anything else
20:42:48  (just from looking at the underlying sets)
20:43:06  oerjan: combining two trivial groups could just make a trivial group or something?
20:43:12  in other words: just hack it until there's an inverse. :P
20:43:30  crys
20:43:53  CakeProphet: two trivial groups _do_ give a trivial group.  but nothing else does.
20:44:16  how about x * trivial = trivial
20:44:23  and vice versa.
20:44:33  we already have x * trivial = x, that's what identity means
20:44:42  oh. maybe I should learn some group theory. :P
20:44:48  yes you should
20:45:01  ah I see what you're saying.
20:45:04  incidentally i am doing the obvious identification of isomorphic groups here
20:45:50  instance x `Elem` (x :- xs) where type instance (x :- xs) `Without` x = xs
20:45:52  oerjan: :')
20:46:12  ooh wait, don't need instance there
20:46:32  AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
20:48:12  good job haskelle
20:48:20  {-# LANGUAGE TypeOperators, TypeFamilies, GADTs, MultiParamTypeClasses, FlexibleInstances #-}
20:48:22  I'm back in my game oerjan
20:48:24  back in my game
20:48:26  no shame
20:48:29  it's not lame
20:48:30  uhhhhh
20:48:31  fame
20:48:39  oerjan: maybe you just need some concept of negative groups. :)
20:48:48  where combining a group with a negative group uh.... removes things.
20:48:59  so that you can get a trivial group from two inverse groups.
20:49:35  I managed to break the plot in Skyrim kind of.
20:49:35  CakeProphet: oh and i recall an argument why you cannot actually fix it by identifying things:  if you take the product of (countably) infinitely many x's, then x * (x * x * ...) = (x * x * ...) meaning all x = identity if you have inverses for everything
20:50:51  elliott: you should stop programming immediately and start your hip hop career.
20:50:53  basically: Apparently it didn't expect me to kill someone that basically said he would report something back to his employer.
20:51:09  it's like with numbers, once you have infinity, subtracting infinity from infinity gives you a paradox.
20:51:28  if you assume things should be always consistent
20:51:29  Vorpal: One of the silliest things in Oblivion was the way those NPCs with the "plot-important" flag set just simply plain wouldn't die.
20:51:56  fizzie, I haven't spotted anything like that in skyrim so far. In oblivion you got that small icon above plot important ones
20:52:20  fizzie, I have to say that it would probably have been impossible to complete oblivion without the plot-important flag thingy though
20:52:42  Vorpal: In Morrowind you just got the awesome notice: "With this character's death, the thread of prophecy is severed. Restore a saved game to restore the weave of fate, or persist in the doomed world you have created."
20:53:10  btw don't run skyrim from an ssd, you will never be able to read the hints on the loading screens that way...
20:53:15  I know I'm not
20:53:23  Skyrim has that same property as Oblivion
20:53:24  oerjan: *sigh*, I need type-level sets
20:53:28  I don't generally go for random murdering, but the one single time I did I got that.
20:53:30  Some NPCs can't be killed
20:53:35  Deewiant, ah. Well this one could
20:53:43  elliott: it's typrtles all the way up
20:53:49  Yes, in Oblivion you could kill none of the peacefuls, I think?
20:53:52  Deewiant: What do I do if I need type level sets, thx
20:53:58  elliott: Cry
20:53:59  elliott: aren't instances kind of sort of like typelevel sets?
20:54:03  Deewiant: Already done
20:54:21  elliott: Go do something else
20:54:28  elliott: s/instances/typeclasses/
20:54:41  Deewiant: Don't wanna, the only project left is @
20:55:03  elliott: write a better Haskell.
20:55:03   I don't generally go for random murdering, but the one single time I did I got that. <-- I wasn't randomly murdering. If a rather nasty guy says he will report back to his employer, which I can tell will cause a lot of problems ahead, why would I /not/ try to kill him? There was no one else alive in that ruin than me and him and a lot of monsters at that time too...
20:55:06  Deewiant: I think it's not all peacefuls, just essential-for-the-main-quest; at least http://www.uesp.net/wiki/Oblivion:Essential_NPCs seems to suggest so, and that they become killable later if you're feeling bloodthirsty.
20:55:06  Vorpal: This review of Skyrim I'm reading claims that you can't kill NPCs with children (and maybe not the children themselves either?) nor plot-important NPCs
20:55:20  Deewiant, oh yeah I heard you can't kill children as well
20:55:24  haven't tried
20:55:27  Deewiant: Can't kill NPCs with kids? Laaaaaaaaaaaaaaaame
20:55:30  no idea about parents
20:55:35  Children are amazingly resilient in video games.
20:55:39  indeed
20:55:42  Only in relatively new games
20:55:45  heh
20:55:53  Yeah but parents aren't!
20:55:54  I'm sure there will be a mod to change that
20:55:55  In Fallout 2 you could freely blow them to bits, for instance
20:55:59  in my game there will be newborn babies that you can kill.
20:56:02  Not so in Fallout 3
20:56:03  Deewiant: MY KIND OF GAME.
20:56:15  elliott: They often pickpocketed your stuff so it was even justified
20:56:16  also: pregnant women
20:56:20  Deewiant, could be a Bethesda thing then? After all Fallout 3 is Bethesda
20:56:23  Deewiant: In Fallout 2 there was even a reputation title thing if you did it.
20:56:23  everyone can die.
20:56:26  Deewiant: I like your idea of justice
20:57:05  Vorpal: I think it's more of a "games are more mainstream now so the 'think of the children' people are onto us" thing
20:57:11  Deewiant, weren't you able to give them grenades or something?
20:57:16  And thus blow them up?
20:57:28  Deewiant: Oh wait, what I actually need is a ~/~ constraint!
20:57:31  Ha ha ha ha ha ha ha
20:57:33  Deewiant: http://images2.wikia.nocookie.net/__cb20100226092112/fallout/images/a/ab/Childkiller_Unused.jpg  "This image was unused and the only Vault Boy image to ever be cut from Fallout 2. (I'm sure you can figure out why) I remember when I got the request to do a perk illustration for "Child Killer" that there would be no way to keep in from being offensive. I mean really! How do you make an illustration of "child killer" and keep it from being offensive? Any
20:57:33  way for some reason, I thought this was the least offensive way to do it. I have no idea what I was thinking. Even the designer who requested it realized it was a bad idea, so we fixed it. Looking back on it now, I can't believe I drew this."
20:57:39  Phantom_Hoover: In Fallout 2? Yes, that's one way
20:57:54  fizzie: :-D
20:58:12  fizzie: bahahahahahaha
20:58:15  best picture.
20:58:21 * CakeProphet sets this as his profile pic on Facebook.
20:58:43  Then they just went with a thoroughly rusty^Wlame http://images3.wikia.nocookie.net/__cb20050211175524/fallout/images/e/e3/Childkiller.jpg
21:02:36  I like it how the Unofficial Oblivion Patch contains "over 2200" bugfixes beyond the final official patch. It sure is a big game.
21:02:50  okay that was disappointing, the equivalent quest line to oblivions "become arch mage" was quite a bit shorter in skyrim
21:02:51  :/
21:03:58  " http://www.esotericphilosopher.com/about/        you're welcome back anytime. as the page states, it doesn't matter what your profession is or what your academic expertise is, a mentality is transcendent. the philosopher of man mentality."
21:04:09  Wait, holy crap, he's that guy!
21:04:19  (This is from an msg.)
21:06:34  He said that to me too; thought I was special. :(
21:06:36      Couldn't match type `Or
21:06:36                             (Equ [Char] [Char]) (Or (Equ [Char] Int) No)'
21:06:36                     with `Yes'
21:06:36      Expected type: Yes
21:06:37  oerjan: :(
21:07:06  elliott, so wait, do we both become philosophers of mans?
21:08:38  oerjan: Holy shit, it WORKS.
21:08:39 * oerjan sidles away from the type madness
21:08:47  ooh
21:09:25  oerjan: http://sprunge.us/CABe
21:09:45  FullList (set denoted by separating each element by :- and terminating with ()) is a list containing one, and exactly one, value of each type
21:09:59  in arbitrary order
21:10:12  well
21:10:15  any type that's A, B, or C :)
21:10:34  Equ needs one more type parameter, standing in for a kind
21:10:35  so you'd do
21:10:36  data ABC
21:10:41  and prepend ABC to all the Equ lines
21:10:49  and it'd be FullList ABC (...) instead
21:10:58  and then it would be general
21:11:11 -!- augur has quit (Remote host closed the connection).
21:11:19  actually
21:11:27  you could just use the (A :- B :- ()) as the first parameter to Equ
21:11:28  and derive it
21:11:30  with TH
21:12:05  now oerjan gets to ask me wtf I'm doing :P
21:14:37 * oerjan keeps sidling away
21:15:28  oerjan: no you don't understand, i did this to solve an actual practical problem :( im becoming afraid of myself
21:17:38  hey oerjan what do you call the addsquaretorial, f(0) = 0, f(n) = n^2 + f(n-1)
21:18:53  oerjan: oh it's 1/6 n (n+1) (2n+1)
21:18:55  how... how obvious
21:19:24  @oeis 1, 5, 14, 30, 55, 91
21:19:25  fizzie, Deewiant: there seem to be no custom spell making in Skyrim. I really liked that feature of oblivion
21:19:26   Square pyramidal numbers: 0^2 + 1^2 + 2^2 +...+ n^2 = n*(n+1)*(2*n+1)/6.
21:19:26   [0,1,5,14,30,55,91,140,204,285,385,506,650,819,1015,1240,1496,1785,2109,2470...
21:19:26  :(
21:19:58  Squyramidal numbers.
21:20:43  fizzie: s/useless-fungot/fungot/
21:21:12  elliott: well it's obvious if you know difference calculus
21:21:19  Deewiant: No I love him. so much.
21:21:21 -!- fungot has joined.
21:21:27  which we've discussed here several times
21:21:33 -!- useless-fungot has quit (Remote host closed the connection).
21:21:34  oerjan: not saying it's non-obvious
21:21:36  well, I suppose I did
21:21:42  I'm just saying I expected something prettier :P
21:22:25  the pretty ones are when you use binomial functions
21:22:32  ok, so this particular method only scales up to about 9 fields, whereas the more involved one can handle about 15
21:23:33 -!- Sgeo|web has quit (Quit: Page closed).
21:23:53 -!- boily has quit (Quit: WeeChat 0.3.6).
21:24:14  oerjan: anyway, I really wish this was easier :-(
21:24:19 * elliott continues to wait for oerjan to ask wtf he's doing :P
21:24:46  elliott: what are you doing?
21:25:20  olsner: have you seen the code?
21:25:45 * oerjan continues to sidle away
21:26:06  oerjan I HATE YOU JUST ASK ALREADY
21:26:37 -!- CakeProphet has changed nick to oerjanDrone1.
21:26:41  elliott: what are you doing?
21:26:45 -!- oerjanDrone1 has changed nick to Kallisti.
21:26:49  YOU ARE NOT OERJAN
21:26:49 -!- Kallisti has changed nick to CakeProphet.
21:26:57  elliott: GAH! HOW DID YOU KNOW??
21:27:01  yeah i wouldn't censor wtf
21:27:16  oerjan: ASK ALREADY YOU ABOMINABLE PERSON
21:27:18  not intentionally censored.
21:27:22  that's like, two censoring levels
21:30:58  fizzie, Deewiant: other skyrim info: For alchemy you discover effects of ingredients by experimenting basically it seems. (In oblivion I believe it was based on your alchemy skill?)
21:31:40  I have practically zero memory of Oblivion so I don't really care about the differences
21:32:19  oh hey that pegasus guy made another language
21:32:35  at least since last i've seen
21:33:44  oerjan: Ask ask ask.
21:33:45  Deewiant, oh okay
21:35:19  wtf are you*NO CARRIER
21:35:42  oerjan: I WILL COME TO TRONDHEIM AND END YOUR EXISTENCE
21:35:53  sweet sweet oblivion
21:36:15  oerjan: don't you mean skyrim :DDDDDDdddddddd
21:38:27  no skyrim wtf are you talking about
21:39:08  Deewiant: explain the joke thankxse
21:39:28 -!- copumpkin has changed nick to RadicalFeminist.
21:39:52  yeah i need explanation i've been living in this cave you see..
21:40:11  I used this for uniform probability distributions:   uniform x = WriterT $ (flip (,) $ mpnormfunc (mempty <$ x) mempty) <$> x;
21:40:34  oerjan: indeed
21:40:39  oerjan: wait wait wait youa sked me wtf am i talking about :DDD
21:40:39  yesss
21:40:41  n ow i can tell you
21:40:45  curses
21:41:02  oerjan: ok so you know like
21:41:06  Foo <$> a <*> b <*> c
21:41:27  the problem with that is that for record types, that gets (a) really long and (b) unreadable (since the field names aren't there)
21:41:31  I could make probability distributions without even needing numbers or division or something like that
21:41:32  so
21:41:38  oerjan: you could do
21:41:48  Therefore, it is a "generalized probability distribution".
21:42:08  oerjan: data Foo = Foo {fooA :: Int; fooB :: String; fooC :: Double}; data Foo' f = Foo' {fooA' :: f Int; fooB' :: f String; fooC' :: f Double}
21:42:12  im guesseing idom brackets dcant do reccord typse
21:42:29  oerjan: and then do like: runFoo' $ Foo' {fooA' = a; fooB' = b; fooC' = c}
21:42:36  runFoo' :: Foo' f -> f Foo
21:42:44  oerjan: BUT THE PROBLEM IS: what if you want to run b before a?
21:43:32  fiendish.
21:43:33  oerjan: you could do lenses, and then have: data Assign t = forall v. Lens t v := v; mkFoo :: [Assign Foo] -> Foo
21:43:44  erm
21:43:55  oerjan: you could do lenses, and then have: data Assign f t = forall v. Lens t v := f v; mkFoo :: (Applicative f) => [Assign f Foo] -> f Foo
21:44:00  oerjan: mkFoo [fooA := a, fooB := b, fooC := c]
21:44:06 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds).
21:44:07  oerjan: but then the problem is, you can just leave off a field and not even get a warning
21:44:12  or duplicate a field
21:44:15  and that kind of sucks!!
21:44:28  suckest
21:44:29  oerjan: but with /this/, you can use a FullList (Assign f Foo)
21:44:35  erm
21:44:36  or rather
21:44:44  have you venbtured into the dark worlds of templates hskell yet
21:44:49  for sokving this
21:44:50  problem
21:44:51  i mean
21:44:55  oerjan: but with /this/, you can use a FullList ((FieldA := f Int) :- (FieldB := f String) :- (FieldC := f Double) :- ())
21:44:55  (Specifically that)
21:45:04  oerjan: with data FieldA, FieldB, FieldC
21:45:19  oerjan: and it all works out!
21:45:32  assuming you define the equality to compare on the field name only etc. etc. etc.
21:45:48  oerjan: this is kind of ugly though :( any bright ideas???????
21:45:56 -!- RadicalFeminist has changed nick to copumpkin.
21:46:20  how ugly does it compare with th uglies
21:46:26  monqy: how would you solve this with th
21:46:26  or could they ugly team up together
21:46:42  quasiquoters probably
21:46:46  Try using TH. It might help too
21:46:57  I would do it without quasiquoters, though.
21:47:25  that works too, if it works
21:47:53  elliott: gah, I started running a non-idempotent and hard-to-reverse script misconfigured
21:48:05  noticed, tried to kill the process in a panic, killed the wrong process
21:48:11  tricky stuff
21:48:13 -!- Phantom_Hoover has joined.
21:48:13  However it would be a bit difficult due to strong typing in TH quotations. There is a proposal that makes two types of quotations, strong and weak; so you can use a weak one and then make the result strongly typed instead.
21:48:16  Oh my god I saw that Transformers guy on Mastermind it was hilarious.
21:48:23  luckily, it turned out it was almost configured correctly
21:48:34  oerjan: :'( you unhelpful
21:48:38  and in particular, the error it's made is deterministic so I can fix it after the fact
21:48:46  Doing it with Homestuck would be funnier still, but I doubt it'd be allowed.
21:48:51  elliott: well i don't even know th
21:49:13  oerjan: i don't want to use th here and i don't think th will help
21:50:51  fizzie: new twist on dark brotherhood: it seems you can become hunted by them...
21:50:54  Then don't use TH if you don't like it.
21:51:35 -!- FireFly has quit (Changing host).
21:51:35 -!- FireFly has joined.
21:51:42  oerjan: http://sprunge.us/gCji
21:51:58  nice
21:53:25  elliott: something tells me that even if you make it work, the type errors for missing fields are going to make people want to kill you.
21:53:48  oerjan: thankfully that type error is much worse than it will be in reality
21:53:57  all the duplications of ((A := Int) :- ((B := String) :- ((C := Double) :- ()))) will just look like ABC
21:54:00  in actual use
21:54:36  o kay
21:54:44  oerjan: hey, if you have any better ideas...
21:57:11  oerjan:
21:57:14      Couldn't match type `Assign C :- ()' with `()'
21:57:14      Expected type: FullList
21:57:14                       ABC (Without ABC (Assign B) (Assign B :- (Assign C :- ())))
21:57:14        Actual type: FullList ABC ()
21:57:14      In the second argument of `(:-)', namely `Done'
21:57:14      In the second argument of `(:-)', namely `(B := "hello") :- Done'
21:57:19  that's what it looks like when you omit the C field at the end
21:57:29  the "couldn't match type" line gives the full error
21:58:44  oerjan: meanwhile: sigh, why isn't there an infix -1
22:00:30 -!- hagb4rd has quit (Ping timeout: 240 seconds).
22:00:51  because once you want more than 0..9 you're going to start thinking of a better system than numbers
22:01:06 -!- wareya has joined.
22:01:13  note to self: http://sprunge.us/hdWe
22:01:24  oerjan: I know, I know, I just want to be able to use $ in my pseudo-literals :P
22:03:04  I think even like that, TH can help to make up the type instances and that kind of stuff
22:03:54 -!- Sgeo|web has joined.
22:04:47  zzo38: yeah, that was my plan
22:04:52  but I don't think it helps make a /nicer/ solution than this
22:04:55  just makes using this slightly less painful
22:06:17 -!- Ngevd has joined.
22:06:18  monqy: what would you do in my situation :'(
22:06:22  :t undefined { runIdentity = undefined } { runIdentity = undefined }
22:06:23  forall a. Identity a
22:06:31  what exactly IS your situatioateon
22:06:54  (exACTLY)
22:07:13  monqy: i mexplained it above :'(
22:07:28  :(
22:07:35  i'll
22:07:37  look againe
22:08:00  monqy: from  oerjan: ok so you know like
22:08:02  to  oerjan: this is kind of ugly though :( any bright ideas???????
22:08:16  (i managed to clean it up from that slightly but yeah)
22:11:43  no freenode scum
22:11:44  no
22:11:44  2011-11-12 00:11:12 [freenode] -RichiH(~richih@freenode/staff/richih)- [Global Notice] Hi all. We wish you a very verily merry merrily 11:11:11 11.11.11-11!
22:11:47  you awful
22:11:47  CLOSE ENOUGH
22:11:48  people
22:12:03  Deewiant: oh wait for a second I thought it was 11pm
22:12:05  not 10pm
22:12:08  and they were using 12 hour clock
22:12:08  and
22:12:09  I wanted to
22:12:11  punch them
22:12:13  until they stopped existing
22:12:30  you cut off a good part
22:12:33  Oh, the -11 is a time zone
22:12:37  Crank it up  to eleven and here's to hoping the world will not end in 2012; as always,  thanks for flying freenode air!
22:12:39  That might make sense
22:12:42  Deewiant: thats even worse
22:12:44  i want to
22:12:46  kill people :(
22:12:57  wait Deewiant is on UTC???
22:12:59  but
22:13:00  him
22:13:01  fniland
22:13:10  This is +2
22:13:13  ok..........
22:13:15  oh
22:13:15  12
22:13:16  not 10
22:13:16  is how
22:13:18  clocks go
22:13:18  ok
22:15:47  anyway the way i would have done it with th would be something like the the (field id, f valiue) -> f wahtever except with compiles time checking in th that there are no missing or duplicated felds.  of course this is probably just as bad as type system hakcery, and type system hackery is certainly cooler.....
22:16:11  monqy: that would be uglieir :(
22:16:16  yeah...
22:16:29  i will try to think of
22:16:31  how to help with
22:16:33  type system
22:16:34  ruining
22:17:35  *YAWN*
22:17:40  monqy: there's a part of me at this point that just wants to say
22:17:41  hi
22:17:46  monqy: [Assign Foo]
22:17:47  and
22:17:48  leave it at that
22:17:53  noo :(
22:17:54  but i would never forgive myself
22:18:02  My lack of pop-culture knowledge has failed me again...
22:18:12  [Assign Foo] and leave it at that is ... awufl
22:18:40  monqy: is this non-awful
22:18:49  lesss awful....
22:18:53  because its type checkeD??
22:19:21  possibility of runtime errors makes me
22:19:22  really sad
22:19:25  possiblyt
22:19:26  too sad
22:19:31  but
22:19:47  how to unsad cleanly ;_;
22:20:15  marquis de sad
22:20:34  can't find anything about records in she's idiom brackets page
22:20:36  ;_;
22:21:52  monqy: like I said, that would _not_ help
22:22:02  monqy: it's trivial to make a record with each field wrapped in f
22:22:02  i did not see that said
22:22:07  monqy: I showed that above
22:22:11  the problem is controlling the /ordering/
22:22:21  with idiom brackets you can just do like ~(flip (+)) to flip the evaluation order, even if that is ugly
22:22:26  but you can't "flip" a record literal...
22:22:34  whew, finished work for the day, and now I'm too tired to play NetHack
22:22:37  help what should I do instead
22:22:38  unless you mean it'd depend on the order you specified in the fields in
22:22:42  in which case let me be the first to say, ewwwwwwwww
22:22:43  yes that was my hope
22:22:46  ais523: fail to play nethack
22:22:47  (don't mention Feather, I'm too tired for that too)
22:22:52  monqy: well ok it's not THAT bad but...
22:22:54  it's ugly but....is it uglier than what you have??
22:22:56  not sure i want to use a preprocessor
22:24:54  set {field1 = as value1}  This would probably be quicker if I started from scratch and just implemented Dijkstra's algorithm in Haskell
22:25:15  did your cleaning up clean up Equ, becaues Equ is real gross...
22:25:21  oerjan: wut
22:25:29  hm actually
22:25:29  monqy: that would be TH-generated
22:25:34  oh, good..
22:25:45  chain =/\> set {field1 = as value1}  same with the rest??
22:26:10  where field1 are your wrapped versions...
22:26:14  above the last -- i mean
22:27:31  hm that wouldn't be typesafe though...
22:27:53  what language is this...
22:28:50  No wait, I don't want Dijkstra
22:29:02 -!- augur has joined.
22:29:11  oerjan: additionally, you'd get an "undefined record field lol" for each set...
22:29:32  oerjan: but I can't tell what you are trying to do with just some code without even type signatures.
22:30:21  elliott: well set would be a value of type Foo' something
22:30:36  more interested in chain and set and as's types
22:31:02  Hmm, I've realised an even more ridiculous thing about the Apollo computers.
22:31:42  A navigational computer small enough to fit on a spacecraft was built *less than fifteen years after the first silicon transistor was invented*.
22:31:43  hm actually =/\> and  set is a predefined record which has dummy values for each Foo' field
22:34:17  chain is a dummy setter that does nothing.  =/\> combines a setter with another modification
22:34:32  the setter being something monadic that preserves order
22:35:02  i don't know how to make it typesafe to check if all fields are set, though
22:35:14  oerjan: right. well that's just my [Assign Foo] situation, but ugly :P
22:35:26  mkFoo [field1 := value1, field2 := value2]
22:35:42 -!- derrik has quit (Quit: i disappear).
22:36:05  Is there a recommended way in Haskell to do Dijkstra's algorithm on a procedurally generated graph?
22:36:12  Do I have any idea what I'm saying
22:36:18  well ideally set {field1 = as value1} should have some type that involved field1 being set, but that's going to be awkward
22:36:55  Ngevd: you may just want to use http://hackage.haskell.org/package/astar
22:36:56  maybe something higher rank
22:36:56  ?
22:37:18  oerjan: oh you mean so you can't set multiple times?
22:37:24  well record updates cannot change types, full stop.
22:37:53  true, but set might be polymorphic
22:38:47  oerjan: idgi
22:39:00  but the scaffolding to make this actually put the fields in types is probably going to be worse than your solution :P
22:39:36  oerjan: the boilerplate can be autogenerated by TH
22:40:36  elliott: well say Foo' takes type arguments that tell the type of each field, and the right argument of =/\> is required to have exactly one of them not being (), or something
22:41:10  and that one should be () in something corresponding in the left argument
22:41:24  which means =/\> must be a method, i guess
22:41:47  oerjan: that would still change the type
22:41:49  set :: Polymorphic
22:41:53  set{...} :: NotPolymorphic
22:41:54  not possible
22:42:21  um of course that is possible, polymorphic values are restricted all the time in haskell :P
22:42:57  set would have polymorphic type Foo' f a1 a2 a3
22:43:28  oerjan: try it yourself if you don't believe me.
22:44:45  hmm, wtf
22:44:49  oerjan: it works, that must have changed
22:45:26  :t let x = Identity undefined in (x {runIdentity = True}, x {runIdentity = LT})
22:45:27  (Identity Bool, Identity Ordering)
22:46:22  elliott: well of course the restriction might happen _before_ the modification
22:46:32  oh hmm right
22:54:31  What are a tropical semiring, possibilistic semiring, bottleneck semiring, truncation semiring, Lukasiewicz semiring, division semiring, formal languages semiring, etc?
22:55:28  oerjan: a job for you!
22:56:08  yay
22:56:19  clearly the answer is: no idea
22:56:35  well, i've got a _slight_ hunch some of those might be semirings.
22:56:48  but only some of them.
22:57:33  we wouldn't want to leap to conclusions.
22:57:41  I know they are semirings (I found them in a list of semirings) but I don't know the details of them.
22:57:41  might fall and break something.
23:00:52  elliott: read the new new updates?
23:01:06  Sgeo|web: HEY SGEO HAVE YOU READ THE NEW HOMESTUCK UPDATES
23:01:11  @tell Sgeo|web did you read them????
23:01:11  Consider it noted.
23:01:23  It's @ask.
23:01:34  @tell elliott Is it?
23:01:34  Consider it noted.
23:01:44  @ask elliott what is @ask?
23:01:44  Consider it noted.
23:01:53  oh look, the same thing.
23:02:03   shachaf said 25s ago: Is it?
23:02:03   CakeProphet asked 15s ago: what is @ask?
23:02:04  @ask elliott I don't remember how it treats them differently, though I do remember that it does.
23:02:04  Consider it noted.
23:02:05  Mauybe
23:02:05  Sgeo|web: You have 1 new message. '/msg lambdabot @messages' to read it.
23:02:10  Note the part where CakeProphet is an idiot!
23:02:10  elliott: You have 1 new message. '/msg lambdabot @messages' to read it.
23:02:11  Oh.
23:02:27  elliott: man that is so different.
23:02:37  it is just being different with differency.
23:02:42  "said"
23:02:42  "asked"
23:02:47 * CakeProphet can read.
23:02:49  Looks different to me also Gregor answer my question already.
23:03:39  @list ask
23:03:39  tell provides: tell ask messages messages? clear-messages
23:03:54  clearly far too few options
23:05:22  @messages?
23:05:22  Sorry, no messages today.
23:05:41  elliott: so anyway did you read it?
23:05:48  notice anything odd?
23:06:20  I don't know what you're talking about. I don't speak English.
23:07:17  notice it.
23:08:04  why is there a vine going up that staircase?
23:08:06  what's up with that?
23:08:18  
23:09:07  oh, I bet it's part of some real life MYSTIC RUINS that he desecrates frequently.
23:09:24  AAAH!
23:09:30  Updates nobody told me about!
23:10:15  homestuck eh
23:11:20  monqy: no there was an update to.....esoteric
23:11:33  oh
23:11:36  was it
23:11:46  libertas
23:12:13  because
23:12:16  i don't like libertas
23:12:18  bad update
23:12:51  no it was update to
23:12:53  the word esoteric itself
23:12:56  oh
23:12:57  what does it
23:12:58  mean
23:12:58  now
23:13:01  what
23:13:02  happened
23:13:16  nobody knows
23:13:19  :o
23:15:01  monqy: oH no i just thought of...........................another problem with..........m,y system
23:15:16  oh no
23:15:20  is it a
23:15:21  big
23:15:22  problem
23:15:22  a
23:15:23  bad
23:15:26  problem
23:15:43  worst problem? not that bad? oh no
23:17:03  monqy:
23:17:04  mkFoo
23:17:04  (  A := return 42
23:17:04  :- B := mkBar
23:17:06          (  X := getLine
23:17:08          :- Y := getLine
23:17:10          :- Done )
23:17:12  :- C := getLine
23:17:14  :- Done )
23:17:30  oh no??
23:17:32  monqy: what if you want the getLine order to be
23:17:35  B.Y, C, B.X
23:17:40  how can you rearrange it to do that
23:17:40  h,,,,,,,,,m
23:17:42  hint: you can't
23:17:47  it only offers ordering within one mkBlah
23:17:48  ogh no
23:18:20  oerjan: :'(
23:18:27  lets us weep
23:18:30  pls
23:18:37  poor elliott, once again destroyed by his own perfectionism.
23:18:48  i can only imagine fixing it typesafely to be positiviely hideous in haskelle.
23:19:08  oerjan: what has this got to do with perfectionism
23:19:47 -!- Madoka-Kaname has quit (Ping timeout: 258 seconds).
23:20:13 -!- Madoka-Kaname has joined.
23:20:14 -!- Madoka-Kaname has quit (Changing host).
23:20:14 -!- Madoka-Kaname has joined.
23:20:39  well, ask a fish what water has to do with swimming
23:20:46  (aum)
23:20:58  oerjan: except that this ordering problem is an actual problem I have.
23:21:00  and it will tell you: BLUB
23:21:17  and none of the less-safe solutions fix it, either
23:24:32  > fix $ const "elliott's ordering problem"
23:24:32    "elliott's ordering problem"
23:25:04  Argh, I just stupidly looked at the Discworld wiki.
23:25:13  The character sketches are unbelievably awful.
23:26:12  Like, I don't think these people have actually looked at Kidby's illustrations or, in some cases, Pratchett's descriptions.
23:26:52  oh
23:26:52  Didn't realise you were a Pratchett fan
23:26:53  oh
23:26:56  OH DEAR GOD
23:26:59  HOAJGOPIAESHRGS
23:27:06  TV TROPES RENAMED "THE WESLEY"
23:27:09  hoajgopiaeshrgs
23:27:18  To what?
23:27:20  `wacro
23:27:22  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: wacro: not found
23:27:24  !wacro
23:27:27  "Creator's pet."
23:27:42  wacro...
23:28:03  wacro doesn't love you any more.
23:29:55  monqy: oh HMmmmmmmmm
23:30:00  monqy: i think i could do this.... nomadiclaly
23:30:02  !echo now what
23:30:04  now what
23:30:10  :o
23:30:37  !wacro
23:30:40  monqy: except not proper monad
23:31:40  :o
23:32:06  monqy: oh!! it is monoid almost.
23:32:10  :o
23:32:16  almosT?? what are you DOING
23:33:26  monqy: assign :: (FieldOf t field) => field -> f (FieldType field) -> Assign f t (field :- xs); (>>+) :: Assign f t fields -> Assign f t (field :- fields) -> Assign f t (field :- fields); run :: (Complete t fields) => Assign f t fields -> f t
23:33:35  Complete t fields if true iff fields contains all fields of f
23:33:47  feifeiflds here can be full lenses
23:33:53  i think
23:34:01  so you can compose them to assign submembers in different order
23:34:06  except hmm i need infrastructure for that
23:34:12  but
23:34:15  that's the BASIC idea!!!
23:34:18  and it will be less awful than all of this
23:35:06 -!- sebbu2 has joined.
23:35:06 -!- sebbu2 has quit (Changing host).
23:35:06 -!- sebbu2 has joined.
23:35:21  monqy: oh wait it's actually
23:35:31  (>>+) :: Assign f t xs -> Assign f t ys -> Assign f t (xs :++: ys)
23:35:32  yaye
23:35:57  so the magic is in Complete then??
23:36:56  monqy: I guess so yeah
23:38:31 -!- sebbu has quit (Ping timeout: 240 seconds).
23:39:14  monqy: HOW DO YOU SPELL FIELD
23:39:18  field
23:39:33  unless im typo. then it could be ANYTHING
23:39:35  feild, feld
23:39:37  feld is good
23:39:49  fdledl
23:39:51  I don't think I've ever done efild
23:39:53  oops.
23:40:18  ifeld
23:40:49  !show wacro
23:40:49  perl (sending via DCC)
23:41:24  wtf
23:41:29  !wacro 10
23:41:44  wacro magic mystery
23:41:55  oerjan: EgoBot is broken, remember
23:42:06  elliott: no it was fixed
23:42:13  oerjan: um what's the length of the list of permutations of a list as long as the list itself......
23:42:18  im dum
23:42:19 -!- Aune has joined.
23:42:23  !perl print "hi";
23:42:23  hi
23:42:30  hi
23:42:40  > permutations [a,b,c]
23:42:40    [[a,b,c],[b,a,c],[c,b,a],[b,c,a],[c,a,b],[a,c,b]]
23:42:45  > filter ((== 3) . length) $ permutations [a,b,c]
23:42:47    [[a,b,c],[b,a,c],[c,b,a],[b,c,a],[c,a,b],[a,c,b]]
23:42:47  oh wait
23:42:56  elliott: n!
23:43:07  oerjan: ni!
23:43:14  nnnnnn
23:43:21  oerjan: ah. so this new, simpler approach can handle... 5 fields.
23:43:28  yay
23:43:31  5 is enough fields for anyone
23:43:33  (actually that's not true :P)
23:43:43  just means I'll have to get more cleverer
23:44:53  !wacro 50
23:45:28  poor egobot
23:45:29  i cannot quite recall what was the correct syntax
23:45:36  it was that, i think
23:45:42  `log [!]wacro
23:45:53  poor hackego
23:46:05  2011-08-19.txt:23:36:46:  !wacro
23:46:10  wacro
23:46:29  !acro
23:46:30  Array found where operator expected at /tmp/input.5546 line 47, at end of line
23:46:47  wtf
23:46:54  !macro
23:46:59  !userinterps
23:47:00  ​Installed user interpreters: acro aol austro bc bct bfbignum brit brooklyn bypass_ignore bytes chaos chiqrsx9p choo cpick ctcp dc decide drawl drome dubya echo ehird elmer fudd google graph hello id insanetemp jethro kraut lperl lsh map monqy num numberwang ook pansy pi pikhq ping pirate plot postmodern postmodern_aoler prefixes python redneck reverse rimshot rot13 rot47 sadbf sanetemp sfedeesh sffedeesh simplename slashes svedeesh swedish valspeak wacro warez
23:47:00  or uh
23:47:01  `macro
23:47:06  GEISHAS
23:47:58  monqy: oh no i ju st realised something
23:52:45  `words 50
23:52:47  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: words: not found
23:52:52  `word 50
23:52:54  qiirricompos andmag abingena trospepit turvklescbitury que dra querg coneleontamonningedur andmianus svitted fuh per otran formair euoncasdationd her beanet everw zeim regafooll miarashiesubao wed nunstchi felton reriv gly antsuperditee hener munglo mming firtyciporones nclards es aslothir fee disfo cusisseo elrodous tent pu
23:53:00  or do you want wacro?
23:53:09  !wacro
23:54:16  hmm, okay.
23:54:32  oerjan: oh no bad thing!!
23:54:37 * Gregor is en-masse moving projects to bitbucket.
23:54:44  Gregor: even the bad ones?
23:54:50  elliott: No, only the ones that are maintained :P
23:55:00  oerjan: why is mapM not for applicatives :'(
23:55:02  (For some definition of "maintained")
23:55:17  Gregor: I'll spring my two questions on you, then!
23:55:43 -!- ais523 has quit (Ping timeout: 240 seconds).
23:55:48  Gregor: (a) Does HackBot support running some code continuously in the background? (usually blocked on a lock or whatever) This would vastly simplify my design. (b) Are you /sure/ I can't use Haskell? You have a recent GHC in /opt!
23:56:07 -!- someoneyouhate has quit (Ping timeout: 240 seconds).
23:56:25  elliott: (a) As in, user code, or just some other code that's part of the infrastructure?
23:56:31  elliott: (b) PFFFFFFFFFFFFFFFF
23:56:39  elliott: traverse
23:56:44  :t traverse
23:56:45  Not in scope: `traverse'
23:56:49  argh
23:56:53  Gregor: (a) Latter.
23:56:53  @hoogle traverse
23:56:53  Data.Traversable traverse :: (Traversable t, Applicative f) => (a -> f b) -> t a -> f (t b)
23:56:54  Data.Foldable traverse_ :: (Foldable t, Applicative f) => (a -> f b) -> t a -> f ()
23:56:54  Control.Parallel.Strategies parTraverse :: Traversable t => Strategy a -> Strategy (t a)
23:57:01  Gregor: (b) I'M HAVING TO DO FILE LOCKING IN BASH YOU SHITHEAD
23:58:03  elliott: I never said it had to be bash.
23:58:16  elliott: Latter is fine; I mean, multibot itself is running continuously of course.
23:58:53  Gregor: (a) Yeah, but I'm not sure my soul will let me rewrite anything in a language that isn't Haskell :P (b) How do you do it, then
23:59:27  ?hoogle mapA
23:59:27  Data.List mapAccumL :: (acc -> x -> (acc, y)) -> acc -> [x] -> (acc, [y])
23:59:27  Data.Traversable mapAccumL :: Traversable t => (a -> b -> (a, c)) -> a -> t b -> (a, t c)
23:59:27  Data.List mapAccumR :: (acc -> x -> (acc, y)) -> acc -> [x] -> (acc, [y])
23:59:29  ;_;

2011-11-12:

00:02:09  elliott: I still don't understand what the issue is.
00:02:12  What are you actually doing?
00:02:21  elliott: traverse, i said!
00:02:30  :t traverse
00:02:31  Not in scope: `traverse'
00:02:38  @ty Data.Traversable.traverse
00:02:39  forall a (f :: * -> *) b (t :: * -> *). (Data.Traversable.Traversable t, Applicative f) => (a -> f b) -> t a -> f (t b)
00:02:39 * oerjan facepalm
00:02:43  shachaf: Shhh, we don't do X-Y problems around these parts.
00:02:54  elliott: (a) MEH MEH MEH (b) However you want to, just write the program and I can arrange for it to run ...
00:03:09  shachaf: A partial explanation is available if you want one :P
00:03:15  Gregor: (b) But I want to give you a working patch :P
00:03:35  elliott: I don't understand what your chromosomes have to do with it.
00:03:56  http://www.perlmonks.org/?node_id=542341
00:04:27  elliott: This would be easy if you were doing it in Haskell.
00:04:35  oerjan: what I really need is foldA >:(
00:04:40 * shachaf isn't sure what "this" is, but that sentence seemed like a good one to say.
00:04:42  shachaf: What do you... think I'm... doing...
00:04:55  Wait, weren't you using bash?
00:04:57  :t foldM
00:04:58  forall a b (m :: * -> *). (Monad m) => (a -> b -> m a) -> a -> [b] -> m a
00:05:14  @hoogle foldA
00:05:14  Data.Foldable module Data.Foldable
00:05:15  Data.Foldable class Foldable t
00:05:15  Control.Seq seqFoldable :: Foldable t => Strategy a -> Strategy (t a)
00:05:20  gah
00:05:23  shachaf: Gregor is trying to force me to use bash and/or a non-bash non-Haskell language to do this, but if it's non-bash I have to rewrite it myself, which will make me want to rewrite it in Haskell.
00:05:32  elliott: The counterpart of the XY problem is the XW problem.
00:05:33  OK, I have 11 repos on bitbucket.
00:05:35  Feels about right.
00:05:39  Often that one is even more annoying.
00:05:42 -!- pumpkin has joined.
00:05:53  elliott: foldA doesn't exist, i think
00:06:11  that foldM type is intrinsically monadic
00:06:48  an arrow might work...
00:08:06 -!- copumpkin has quit (Ping timeout: 260 seconds).
00:08:27  :t \f x l -> foldr (>>>) id (map (flip f) l)
00:08:28  forall t c a. (c -> a -> c) -> t -> [a] -> c -> c
00:08:30  oh yeah monqy you need
00:08:32 * Phantom_Hoover → sleep
00:08:32  the bad news
00:08:34  along those lines
00:08:36  oops
00:08:37 -!- Phantom_Hoover has quit (Quit: Leaving).
00:08:47  :t \f x l -> foldr (>>>) pure (map (flip f) l)
00:08:48  forall t a (f :: * -> *) a1. (Applicative f) => (a -> a1 -> a) -> t -> [a1] -> a -> f a
00:08:52  argh
00:09:01  :t \f x l -> foldr (>>>) (arr id) (map (flip f) l)
00:09:02  forall t (cat :: * -> * -> *) a a1. (Arrow cat, Functor (cat a)) => cat a (a1 -> a) -> t -> [a1] -> cat a a
00:09:20  wtf
00:09:29  :t \f x l -> foldr (>>>) (arr id) (map (Prelude.flip f) l)
00:09:30  forall t a a1. (a -> a1 -> a) -> t -> [a1] -> a -> a
00:09:40  eek
00:09:47  oh duh
00:10:08  :t \f x l -> foldr (>>>) (arr id) (map f l)
00:10:09  forall t (cat :: * -> * -> *) a a1. (Arrow cat) => (a1 -> cat a a) -> t -> [a1] -> cat a a
00:10:33  f needs to come preflipped to be useful with arrows
00:11:04  oh hm x is never used :P
00:11:19  well, i still think that's the closest in spirit
00:11:46  :t under Kleisli
00:11:46      No instance for (Complete Foo (x0 :++: (x1 :++: (C :- fields0))))
00:11:47  forall a (m :: * -> *) b n' o'. (Newtype (Kleisli m a b) (a -> m b), Newtype n' o') => (Kleisli m a b -> n') -> (a -> m b) -> o'
00:12:21  :t op
00:12:21  forall o n. (Newtype n o) => (o -> n) -> n -> o
00:12:36  hm what was that thing
00:12:46  :t as
00:12:47  Not in scope: `as'
00:14:29 -!- Phantom_Hoover has joined.
00:14:41  :t ala
00:14:42  forall o n b n' o'. (Newtype n o, Newtype n' o') => (o -> n) -> ((o -> n) -> b -> n') -> b -> o'
00:14:52  OK I wasn't really asleep; did Sgeo|web malfunction and fail to notify of a Homestuck update?
00:15:11  Is there types in Haskell that only have numbers 0 up to 1?
00:17:13 * Phantom_Hoover → probably actual sleep?
00:17:14 -!- Phantom_Hoover has quit (Client Quit).
00:18:58 -!- Jafet has joined.
00:23:36  zzo38: Bool
00:29:45  http://hackage.haskell.org/packages/archive/base/latest/doc/html/Prelude.html#v:until
00:29:51  oerjan: huh, is that new?
00:30:00  elliott: Actually I wasn't very clear. I mean that it can store fractions too, so there is infinite number of possible values
00:30:10  :t until
00:30:11  forall a. (a -> Bool) -> (a -> a) -> a -> a
00:30:13  zzo38: oh. Double :p
00:30:17  no, that's old
00:30:21  just treat minBound = 0, maxBound = 1
00:30:28  oerjan: well ok at least 6.12 old :P
00:31:05  zzo38: Fractions? You don't want to be able to store arbitrary real numbers?
00:31:27  elliott: it's in h98
00:31:46  oh, ok
00:32:08  Did you know Haskell 1.2 had "import Foo renaming (blah to blam)"?
00:32:24  Cool.
00:32:32  Of course, they didn't have qualified imports.
00:32:37  Uncool.
00:32:41  shachaf: Well, fractions, or arbitrary real numbers, but bounded
00:32:42  Or do notation.
00:32:44  I forget, is OverlappingInstances one of those things that You Should Never Use?
00:32:47  Like IncoherentInstances.
00:33:05  You should never use them, yeah. Only I get to use them.
00:33:05  elliott: If you don't know, the answer is probably Yes.
00:33:12  I think Overlapping is acceptable in some situations.
00:33:21  shachaf: I do know, I just forgot.
00:33:21  based on Credible Sources
00:33:27  that I Don't Remember The Source Of
00:33:28  shachaf: I'm definitely doing Perverse Type Hackery.
00:33:41  IncoherentInstances?
00:33:54  clearly elliott should use overlappinginstances to dig himself in further
00:34:12  oerjan: I can avoid them, it'd just involve another Equ
00:34:16  class ElemA xs
00:34:16  instance ElemA (A :- xs)
00:34:16  instance (ElemA xs) => ElemA (x :- xs)
00:34:17  is the usecase
00:36:32  mhm
00:37:42  It's a real shame that simplification of Chinese characters hasn't focused on making characters have a clear pairing of semantic and phonetic components (and thus easier to learn), but instead on reducing the number of strokes in a certain list of characters.
00:37:51  鬱 Consider that.
00:38:44  That is really obnoxious to learn, in large part because there's no real way of grasping it as having a simple, clear structure.
00:38:50  So incoherentinstances removes a sanity check that overlappinginstances provides?
00:39:02 -!- augur has quit (Remote host closed the connection).
00:39:19  The phonetic component of it is, apparently, 𩰪(probably not available in your font).
00:39:34  That's just fucking evil.
00:39:40  http://glyphwiki.org/wiki/u29c2a
00:41:39 -!- Jafet1 has joined.
00:41:49  :t \x -> foldr (<*>) (pure x)
00:41:50  forall (f :: * -> *) b. (Applicative f) => b -> [f (b -> b)] -> f b
00:41:53 -!- Madoka-Kaname has quit (Ping timeout: 258 seconds).
00:41:58  @hoogle a -> [f (a -> a)] -> f a
00:41:59  Control.Applicative (<**>) :: Applicative f => f a -> f (a -> b) -> f b
00:41:59  Control.Applicative (<*>) :: Applicative f => f (a -> b) -> f a -> f b
00:41:59  Control.Monad ap :: Monad m => m (a -> b) -> m a -> m b
00:42:01  oerjan: :(
00:42:18 -!- Madoka-Kaname has joined.
00:42:18 -!- Madoka-Kaname has quit (Changing host).
00:42:18 -!- Madoka-Kaname has joined.
00:43:22 -!- Jafet has quit (Ping timeout: 244 seconds).
00:44:40  http://glyphwiki.org/wiki/u2387d
00:44:48  Someone's missing the forest for the trees
00:45:41 -!- Jafet1 has changed nick to Jafet.
00:45:48  :-/ turning
00:45:52  class Foo a b | b -> a
00:45:52  into
00:46:00  class Foo b where type A b
00:46:04  is turning my instances into undecidable ones
00:46:11  Some bastard must have thought they were "smart" repeating the 木林森 pattern.
00:46:13 * elliott cries.
00:47:15  You've decided... decided...
00:48:40  monqy: anyway it is less horrific now???
00:48:59  hi
00:49:00  im back from
00:49:04  not being here
00:49:06  what happeneD??
00:49:57      Functional dependencies conflict between instance declarations:
00:49:58        instance [overlap ok] (ElemA xs, ElemB xs, ElemC xs) =>
00:49:58                              Complete Foo xs
00:49:58          -- Defined at /home/elliott/Code/form-test/form-test.hs:68:10-58
00:49:58        instance [overlap ok] Complete Bar Nil
00:49:58          -- Defined at /home/elliott/Code/form-test/form-test.hs:73:10-25
00:50:00  (i think i left soon before 15:47:57 < elliott> monqy: oh no i ju st realised something)
00:50:00  oh NOooooooooo
00:50:04  oh no
00:50:32  ohhh i get it
00:50:38  my fundep is wrnog
00:51:06  anyway!!!
00:51:17  *Main> :t (=:)
00:51:17  (=:)
00:51:17    :: (Field field, Applicative f) =>
00:51:17       field
00:51:17       -> f (FieldType field)
00:51:18       -> Assign f (FieldRecord field) (field :- Nil)
00:51:19  *Main> :t (<>)
00:51:21  (<>)
00:51:23    :: Applicative f =>
00:51:25       Assign f t xs -> Assign f t ys -> Assign f t (xs :++: ys)
00:51:27  *Main> :t run
00:51:29  run
00:51:31    :: (Complete t fields, Applicative f) => Assign f t fields -> f t
00:51:33  monqy: behlod
00:51:37  beholdieng
00:51:54  exmample:
00:51:56  test :: IO Foo
00:51:56  test =
00:51:56    run $ A =: getLine
00:51:56       <> B =: return 42
00:51:56       <> C =: return pi
00:52:15 -!- oerjan has quit (Quit: Good night).
00:52:35  monqy: ANYWAY so the good part of the Bad Realisation is that I think there is a way to do the proper interleaving of effects with nested records like I said and the like
00:52:41  monqy: the bad part is that.... its arowes
00:52:49  oops
00:53:06  is there any
00:53:07  other
00:53:08  way
00:53:18  im dont onknow. unfrtuoatenyl.
00:54:35  hm
00:54:39  how would the arrowes
00:54:40  look
00:54:47  if it's pretty, is there problems??
00:54:55  asside from arrows being...arrows
00:55:15  anynway!!!!
00:55:19  monqy: http://sprunge.us/SSSU
00:55:22  behlod. simpler.
00:55:23  sssu
00:55:39  bits between -- are autogenerated apart from the Foo declaration itself of course
00:55:50  or rather, would be autogenerated.
00:57:19  how would the names of A B C be genreateD? similarly to the lenses schemes?
00:58:05  from the foo record
00:58:14  it'd actually be FooA/FooB/FooC
00:58:16  but i am: lazy
00:58:32  the problems here are basically (a) doesn't interoperate with lenses???? and (b) no interlevying
00:59:37  yeeah what if the initial character has no uppercase lettery version most notablye _ as in the lensy names which is what (a) might mean??
01:01:06 -!- derdon has quit (Remote host closed the connection).
01:02:42  monqy: oh then it just fails or mangles i guess...... (a) mostly means that it's implementing its own stuff which is PRETETETY DARNE CLOSE TO LSENSES!
01:03:15  im clod.
01:03:16  lense btu diferent
01:04:06  while trying to improve this:
01:04:07      Couldn't match type `No' with `Yes'
01:04:07      In the expression: run
01:04:07      In the expression: run $ A =: getLine <> C =: return pi
01:04:07      In an equation for `test':
01:04:08          test = run $ A =: getLine <> C =: return pi
01:04:13  sure have made the messages useful!!!
01:04:59  you did something wrong but i wont say what it is........... - ghc
01:05:10  its a secret - ghc
01:06:00 -!- augur has joined.
01:08:23 -!- augur has quit (Remote host closed the connection).
01:10:10  monqy: it should just say
01:10:15  ::: wrong
01:10:25  or better
01:10:27  $ ghc badprogram.hs
01:10:28  no
01:10:28  $
01:11:48  good ghc
01:13:37  elliott: it clearly says there's a type error in the expression "run"
01:13:41  where's the confusion?
01:13:55  are you being serious?
01:14:10  sure.
01:14:24  CakeProphet: lol.
01:14:26  I AM SO FUCKING COLD
01:14:38  like seriously there's only one place it's wrong.
01:14:50  CakeProphet: fun fact: the error isn't in run there
01:15:09  SURELY IT IS. GHC WOULD NEVER LIE.
01:15:34  in any case, is in the error in some sort of insane type hackery?
01:16:33  what else
01:16:53  then... that's why the error message isn't helpful. :P
01:18:09  unrelatedly, there are some insanely cheap deals on audio stuff right now.
01:18:22  wowza, audio stuff
01:19:57  300 watt 12" sub with built-in amp for $170
01:24:31 -!- Sgeo|web has quit (Ping timeout: 265 seconds).
01:24:35  ghc goodprogram.c
01:26:56  ghc is actually a C compiler too, you know.
01:27:29  [elliott@dinky Temp]$ echo 'int main(){return 42;}' >foo.c
01:27:30  [elliott@dinky Temp]$ ghc --make foo.c
01:27:30  [elliott@dinky Temp]$ ./a.out
01:27:30  [elliott@dinky Temp]$ echo $?
01:27:30  42
01:28:46  elliott: dinky is a stupid name.
01:28:56  Counterpoint: You're stupid.
01:30:47  :t liftA2 (.)
01:30:48  forall a b (f :: * -> *) (f1 :: * -> *). (Functor f, Applicative f1) => f1 (a -> b) -> f1 (f a) -> f1 (f b)
01:30:57  CAAAAAAALE
01:30:59  :t liftA2 (P..)
01:30:59  Couldn't find qualified module.
01:31:00  :t liftA2 (Prelude..)
01:31:01  forall b c a (f :: * -> *). (Applicative f) => f (b -> c) -> f (a -> b) -> f (a -> c)
01:31:16  That should have a name.
01:31:24  @hoogle f (b -> c) -> f (a -> b) -> f (a -> c)
01:31:24  Data.Generics.Schemes everywhereBut :: GenericQ Bool -> GenericT -> GenericT
01:35:07  "According to a biannual Security Intelligence Report from Microsoft, AutoRun—the feature in Windows that automatically executes files when you plug in a USB or connect to a network—accounts for almost half of all malware infections."
01:35:12  shocking revelation.
01:35:51  I made up a BoundFrac type which can be used with any type and then it makes it error if the result is not in range
01:36:02 -!- augur has joined.
01:49:41 -!- augur has quit (Remote host closed the connection).
01:50:07  Gregor: Sooo, where would I actually modify to get a background process in HackBot?
01:50:13  Do I have to track down and modify the multibot source itself?
01:54:53  Gregor: Also, more importantly: In tr_60.cmd, where's some scratch space I can use for temporary files?
01:54:59  (I need to share them amongst invocations of tr_60.cmd.)
01:57:38  http://tinyurl.com/72p9aoj  $250 off a set of 5.1 surround speakers
01:57:40  so. tempting.
02:09:26  Hmph, Gregor should have anticipated all my questions and answered them before I asked them
02:09:34  I even have another one now!
02:11:36  elliott, btw are you planning to play Skyrim at some point?
02:11:47  Maybe. I asked you whether it sucked or not.
02:12:00  elliott, well it seems 1.1 fixed the worst bugs
02:12:04  that I ran into
02:12:08  all i know about skyrim is you can put barrels over people's heads
02:12:22  monqy, I wasn't aware of that
02:12:22  ooh and there was some fixed bug where mammoths had trouble staying on the ground
02:12:35  I guess you can due to it having a physics engine
02:12:48  Vorpal: I wasn't asking about the bugs.
02:12:52  I mean, one general enough to handle stuff in barrels in general
02:13:10  It's not a Bethesda game if it doesn't have mammoth bugs
02:13:33  I think there was some video that demonstrated if you put barrels over everyone's heads you can steal things but if you take the barrels off people get angry when you steal
02:13:39  elliott, well apart from the bugs there is one thing that annoy me. The HUD / menus design is too modern, both when it comes to the typeface and the icons used.
02:14:10 -!- sebbu3 has joined.
02:14:11 -!- sebbu3 has quit (Changing host).
02:14:11 -!- sebbu3 has joined.
02:14:18  what does too modern mean? as in it clashes with the pasty feel of the rest of the game?
02:14:45  elliott, other than that I would say that if you enjoyed Oblivion you will enjoy this one. There are some gameplay changes. Most (but not all) that I would consider improvements. Of course, that last point is rather subjective.
02:15:58  Vorpal: I haven't played Oblivion :P
02:15:58  monqy, as in, it doesn't really fit in with the medieval feel of the actual game. The font is a sans-serif for example. I don't think it is helvetica, but it would fit in just as poorly if it was.
02:16:25  Other Skyrim anachronisms: It's played on a computer.
02:16:33  Gregor: Also, $IRC_SOCK is an absolute path, right?
02:17:12  elliott, well, then it comes down to if you enjoy massive open world RPGs. Unlike oblivion, where you start out with fast travel to the big cities (and have to discover the rest of the fast travel locations by exploring), you can't fast travel anywhere in Skyrim until you explore to there.
02:17:24  so... lots of walking involved to begin with
02:17:37 -!- sebbu2 has quit (Ping timeout: 252 seconds).
02:18:05  What's the variable for "number of arguments received" in bash again
02:18:24  Does each major city still contain less than a hundred inhabitants?
02:18:38   Other Skyrim anachronisms: It's played on a computer. <-- very funny. Oblivion used a type face that had an medieval feeling, while still not being as unreadable as "Olde English" style fonts.
02:19:01  elliott, oh and the menu system was clearly designed with a gamepad in mind.
02:19:13  it works with mouse and keyboard, sure
02:19:19   Gregor: Also, $IRC_SOCK is an absolute path, right? // y es
02:19:20  but still, not optimal perhaps
02:19:32  Gregor: Y es?
02:20:48  elliott, of course, the actual navigation in the menu system of oblivion was truly hideous. That bit is much better in Skyrim. It is just that the graphical design of said menu system was /way/ better in Oblivion.
02:21:13  It's part of a big conspiracy to make you buy an xbox
02:21:29  Jafet, what, and get worse graphics?
02:21:56  Gregor:  Gregor: Sooo, where would I actually modify to get a background process in HackBot?   Do I have to track down and modify the multibot source itself?   Gregor: Also, more importantly: In tr_60.cmd, where's some scratch space I can use for temporary files?
02:22:00  Those are all the questions... I think :P
02:22:37  1) I will have to do something to make it run a background process externally. The script that spawns multibot is not part of the repo.
02:22:52  2) No. Modifying multibot for this makes no sense.
02:22:54  Jafet, oh yeah, that is another issue. Skyrim was designed with consoles in mind when it came to the graphics too. I played Witcher 2 as well, which was designed with PC in mind only (and only later was it decided to port it to consoles). Witcher 2 had *much* better graphics than Skyrim has.
02:23:00  3) /tmp
02:23:12  Gregor:  (I need to share them amongst invocations of tr_60.cmd.)
02:23:22 -!- pumpkin has quit (Quit: Computer has gone to sleep.).
02:23:31  Unless you mean like /tmp/hackbot.hope-you-never-want-to-run-more-than-one-hackbot-at-once
02:23:33  elliott: Do you mean within the execution of a guest program, or just in tr_60.cmd itself?
02:23:38  Latter.
02:23:40  It's for storing transaction info.
02:23:52  Oh, it's a multiple instances issue.
02:24:01  mkdir $IRC_SOCK.tmp :P
02:24:19  Gregor: Not an "issue", so much as "communication".
02:24:35  Multiple instances of HackBot that is.
02:24:54  Gregor: Oh yeah, the additional question is: If HackEgo sees `a then `b, is there any chance of the latter getting started before the former? ... I guess there is, bash could call a syscall which could block for long enough to blah blah blah.
02:25:36  Gregor: Which is annoying, because I want as-if-sequential semantics >_>
02:25:40  elliott: $# ?
02:25:52  Obviously it only matters if you send two messages in one syscall and the buffer flushes and etc. etc., but still :P
02:25:56  (Over the network)
02:25:59  variable: Yep, found that, thanks :P
02:27:36  Gregor: Anyhow, I have a bundle of changes I've made on the way to doing this if you're interested in getting some of the breakage out of the way earlier :P
02:27:43  elliott, so, there you have it for Skyrim. Personally I think it is worth playing, but then I liked Oblivion too. But gameplay wise it is much better. Oblivion's dungeons were quite similar. There were a few basic designs for the style, like "ancient ruin tiles", "modern ruin tiles" and so on, except it didn't use tiles afaik. There seems to be a much larger variety for such things in Skyrim.
02:27:46  (It's just (a) slight cleanups and (b) changes I've made to make the transactional stuff easier.)
02:28:03  Vorpal: How good are the dragons, that's pretty much the only thing I care about in a game. (Note: Maybe false.))
02:28:06  s/))/)/
02:28:22  elliott, haven't really gotten that far in the game yet. I got side tracked by sidequests XD
02:28:32  sidetracked*
02:28:57  elliott, so while the intro features a dragon, you basically have to flee from it at that point.
02:28:58 * Gregor reappears.
02:29:14  elliott, you don't get a close look at it at that point really
02:29:25  elliott, guess I will be able to report on that later.
02:29:29  elliott: Yes, `b can "get started" before `a, that ... doesn't even make sense otherwise. The only way to avoid that would be to handle them all sequentially.
02:29:44  Gregor: No, it would just require /starting/ them sequentially :P
02:29:54  But various factors could easily desynchronise them at that point, so *shrug*
02:30:19  elliott, reimplement it on a RTOS
02:31:34  elliott, I'm playing on ultra graphics settings with no issues btw.
02:31:56  your toshiba might not be beefy enough though
02:32:01  Gregor: Here's another question... why do you do `head -c 16384` when IRC lines aren't actually allowed to even be that long :P
02:32:04  Vorpal: It definitely isn't.
02:32:09  right
02:32:30  elliott, how much dedicated graphics ram?
02:32:40  elliott: Just to stop programs from running if they're producing gobs of output. I just want a dead pipe.
02:32:47  No frickin' idea, but come on, the CPU is less than one GHz.
02:32:49  Gregor: Right
02:33:13  hm
02:33:20  elliott, I think 2 GHz was minimum
02:33:22  Gregor: Hmmwait
02:33:23  iirc
02:33:31  Wait, never mind
02:33:40  elliott, as in "core 2 duo 2.0 GHz or better"
02:34:07  Gregor: So, uh, as far as I can tell, you sleep for 30 seconds regardless of whether or not the process in question finishes or not.
02:34:08  recommended was quad core system
02:34:14  So you have a lot of processes just sleeping 30 all the time :P
02:35:58  elliott: Yup. Difficult not to in bash.
02:36:01 -!- hagb4rd has joined.
02:36:05  Gregor: Yeah, just realised that >__>
02:36:12  Gregor: Why the hell doesn't bash have alarm after how-many-decades
02:36:19  Nowait ...
02:36:22  I thought I fixed that ...
02:36:35  Nope, I didn't :)
02:36:46  Right, because it would need either something like alarm or conditional wait.
02:37:40  Gregor: Does DCC SEND work for you?
02:37:50  elliott, oh and if you run it from an SSD you won't be able read the hints displayed on the loading screens. It is just too fast. It seems yogscast ran it from an HDD because they complained about the slow loading screens.
02:38:01  but for me on an SSD it is about 2-4 seconds
02:38:21  elliott: Considering that it never uses it, Idonno.
02:38:29  Gregor: No, I mean, you personally :P
02:38:31  Oh
02:38:35  I'd prefer email ...
02:38:39  Oh right, email exists!
02:38:44  I completely forgot...
02:38:56  I completely fungot!
02:38:57  CakeProphet: unless you want to become like larry wall, maybe?) area of memory to a file."? me, soegaard?
02:39:00  elliott: Incidentally, what repo are you working off of?
02:39:09  elliott: I moved hackbot with a bunch of other projects, it's on bitbucket now (same repo though)
02:39:24  Gregor: Oh, I'll update my hgrc and do a pull request thing then
02:39:30  That sounds appropriately fancy
02:39:36  Yay pull request :P
02:39:38  *dinner*
02:41:19  Gregor: https://bitbucket.org/GregorR/hackbot/pull-request/1/stuff
02:41:22  ENJOY YOUR DINNER, FASCIST.
02:44:26  `fetch https://bitbucket.org/GregorR/hackbot/pull-request/1/stuff
02:44:28  2011-11-12 02:44:28 URL:https://bitbucket.org/GregorR/hackbot/pull-request/1/stuff [20286] -> "stuff" [1]
02:44:31  I completely forget how hideous `fetch's output is.
02:44:34  elliott, oh btw, weird thing in char creation: every option is a slider. Even the gender one. However it boringly only has two value
02:44:44  `rm stuff
02:44:46  No output.
02:45:18  `fetch sdfjsdfjkl
02:45:19  wget: unable to resolve host address `sdfjsdfjkl'
02:45:25  Hmm, not as bad as I recall
02:46:31 -!- CakeProphet has quit (Ping timeout: 276 seconds).
02:49:52  Gregor: I think modifying multibot to run the background job /does/ make sense, because it needs to be able to send messages... or is that created before running multibot?
02:49:53  I guess it is.
02:52:32 -!- Sgeo|web has joined.
02:52:55  elliott: Bluh bluh update bluh bluh, although it was quite some minutes ago
02:54:35 -!- sebbu2 has joined.
02:54:35 -!- sebbu2 has quit (Changing host).
02:54:35 -!- sebbu2 has joined.
02:58:10 -!- sebbu3 has quit (Ping timeout: 256 seconds).
02:58:59  "Bach no Senritsu o Yoru ni Kiita Sei Desu." That is definitely the strangest romanisation job ever, why would you romanise バッハ (Hepburn: bahha, mine: hà'ha) that way?
02:59:18  Well, aside from バッハ being Japanese for "Bach".
02:59:21 -!- copumpkin has joined.
03:00:45  Some days I feel like replacing Japanese orthography with romaji would just make Japanese writing more irregular.
03:01:07 -!- Vorpal has quit (Ping timeout: 260 seconds).
03:11:03 -!- Aune has quit (Remote host closed the connection).
03:21:05 -!- augur has joined.
03:24:31  I made the program for normalizable semirings!
03:25:15  Do they ever use that term in mathematics? My program has classes for normalizable monoids, though.
03:30:09 -!- hagb4rd has quit (Quit: hagb4rd).
03:30:45  `echo Did elliott just break everything?
03:30:47  Did elliott just break everything?
03:30:55  Impressive.
03:31:04  It...
03:31:06  How does it still work?
03:31:08  `run echo hi >a
03:31:10  No output.
03:31:11  `cat a
03:31:14  hi
03:31:16  `rm a
03:31:17  No output.
03:31:19  Gregor: I'm shocked :P
03:31:22  Same 'ere.
03:31:24 -!- elliott has changed nick to Lymia.
03:31:27  `stupid
03:31:27  Mmmmm ... no.
03:31:31 -!- Lymia has changed nick to elliott.
03:31:32  Wow :P
03:31:39  `fetch http://google.com
03:31:40  2011-11-12 03:31:40 URL:http://www.google.com/ [10696] -> "index.html" [1]
03:31:44  `rm index.html
03:31:46  No output.
03:32:34  `yes
03:32:36  y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y
03:32:45  OMG THAT LINE IS SO LONG
03:32:55  Gregor: It's a whole 100 characters longer :P
03:33:10  `run echo lol > .hg/foo
03:33:10  See my commit message for CALCULATIONS plus estimate of margin of safety.
03:33:12  bash: .hg/foo: Read-only file system
03:33:18  elliott: Yeah, I saw.
03:33:27  Hmm, wait, I think my revert command might not work...
03:33:32  `run echo hi > a
03:33:34  No output.
03:33:37  `run revert
03:33:39  bash: revert: command not found
03:33:53  Whuh
03:33:57  `revert
03:33:58  Done.
03:34:03  Oh! I didn't add it yet :P
03:34:04  `ls
03:34:06  bin \ canary \ karma \ lastquote \ lib \ paste \ quotes \ share \ wisdom
03:34:10  Ooooohkidokie :P
03:34:12  Yeah yeah, it's just that I removed revert :P
03:34:15  From my local copy
03:34:20  Thinking it could be done with a bin/ thing
03:34:55  But obviously not
03:34:57  lib/revert it is
03:35:53  Welllllllllll, it is doable with something in bin, but it's better to have an out-of-channel method.
03:36:12  Gregor: It's... sort of doable, but you could break it horribly and make people `revert manually :P
03:36:28  Gregor: You can set up an environment var (path to unix socket) that tr_60.cmd will see, right?
03:36:39  And redirect a probably-Python program's stdin from it? :P
03:36:47  Sure
03:36:56  Actually hmm, not sure Unix socket will work >_>
03:37:00  What happens when two people write to a Unix socket at once
03:39:59  An individual call to write/send will always produce an in-order packet.
03:40:04  But multiple calls can be interleaved.
03:40:16  Note for comparison: X11 works.
03:40:19  What're the chances of socat sending <512 bytes with a single write/send?
03:40:24  Oh, X11 is based on a single Unix socket?
03:40:25  Alrighty then :P
03:40:37  Not quite any more, but classically.
03:40:40  (How did they overengineer everything but that?)
03:40:44  Now it has shm and other tricks too.
03:42:31  Gregor: You should add the running script to the repo so I can test this thing :P
03:42:54  Also, last attempt: Are you suuuuuuuure I can't write the script in Haskell????
03:43:45  Can you please tell me what packages I need if I import:  Control.Applicative Control.Category Control.Monad Control.Monad.Trans.Writer Data.Functor.Contravariant Data.List Data.Monoid Data.Ord Data.Semigroup
03:44:20 -!- hagb4rd has joined.
03:45:01  zzo38: base, semigroups, contravariant, methinks
03:46:00  mtl?
03:46:25  copumpkin: Nope
03:46:28  .Trans. == transformers
03:46:32  zzo38: base, transformers, semigroups, contravariant, methinks
03:47:24 -!- sebbu has joined.
03:47:24 -!- sebbu has quit (Changing host).
03:47:25 -!- sebbu has joined.
03:49:04  How do I know what version numbers I need to specify?
03:50:20 -!- sebbu2 has quit (Ping timeout: 255 seconds).
03:52:02 -!- sebbu2 has joined.
03:52:03 -!- sebbu2 has quit (Changing host).
03:52:03 -!- sebbu2 has joined.
03:55:49 -!- sebbu has quit (Ping timeout: 260 seconds).
04:02:53 -!- Zuu has quit (Ping timeout: 244 seconds).
04:11:06  Gregor: You, uh, did fix it
04:11:11  umlbox-nice has a timeout
04:11:42  Gregor: That doesn't solve it for `fetch though.
04:12:01  Tempted to say that it's better to do it outside of UMLBox.
04:15:39  `ls /home
04:15:41  hackbot
04:15:43  `ls /home/hackbot
04:15:45  hackbot.hg
04:15:48  X-D
04:20:06  Gregor: Oh, timing out from within UMLBox has the advantage that you get partial output from timed-out commands.
04:20:16  That's defeated by the global timeout though :P
04:21:06  That redundancy is to avoid bugs.
04:21:10  Don't take it out.
04:25:28  Gregor: Bugs like what?
04:25:34  Just curious.
04:25:55  If I'm keeping it, I'll at least make the global timeout 35, so that you get the partial output thing :P
04:26:27 * elliott has everything but the server done... so everything but the hard part :P
04:31:15  I don't /think/ any remain.
04:31:23  It's just a stopgap.
04:31:44  Although I suppose nothing's stopping `fetch http://fiftygigfile.com right now :P
04:32:14  Gregor: Yes there is.
04:32:15  The outer timeout
04:33:00  Also the ulimit :P
04:33:11  Did I send the package correctly?
04:33:19  zzo38: ?
04:33:24  Gregor: My sandbox script enables UMLBox's timeout, and the fetch one uses a sleep, so that should be enough, but I'll add a 35-second timeout to the server just in case...
04:33:28  The revert script has no timeout :P
04:33:44  I mean the "monoidplus" package
04:35:23  http://hackage.haskell.org/package/monoidplus
04:35:32  You forgot to specify version constraints on your dependencies
04:36:00  also, you have a typo in Plus.lhs: "tyep" :)
04:36:04  elliott: I looked at those three packages, and both the oldest version and newest version have those things
04:36:16  zzo38: Yes, but the version released tomorrow might not.
04:36:35  O, OK. Yes.
04:36:41  And OK I will fix the typo, too
04:36:51  zzo38: contravariant == 0.1.*, semigroups > 0.1 & < 0.9, transformers < 0.3 should do it
04:36:56  according to the package versioning policy
04:36:59  which all three of those packages follow
04:37:19  OK thank you
04:38:32  What is the package versioning policy?
04:39:26  http://www.haskell.org/haskellwiki/Package_versioning_policy
04:41:57   Gregor: My sandbox script enables UMLBox's timeout, and the fetch one uses a sleep, so that should be enough, but I'll add a 35-second timeout to the server just in case...
04:42:05  OHHHH, yeah, umlbox does have a timeout, dunnit X-D
04:42:10  Yeah, that should be sufficient.
04:42:15  Right.
04:42:16  Doesn't also need the silly sleep.
04:42:22  Gregor: You even use the timeout currently :P
04:42:26  I meant having both an external and an internal timeout is important.
04:43:01  What's that mean
04:43:16  Oh, internal as in "sleep 10; kill" in the shell?
04:43:17  OK. So, once I fixed these mistakes would I use 0.1.0.1 as the new version number of my package? Since I didn't change any types, entities, definitions, instances, add new stuff. I haven't depend on a newer version of any package. So is this correct?
04:43:20  As in, in the shell inside UMLBox
04:43:29  Gregor: 'Cuz currently, you don't have an "internal" timeout.
04:43:33  zzo38: Yep
04:43:45  OK thanks
04:43:51  I fix it now.
04:43:59  Gregor: Hmm, can you select() on both a fd and a process exiting in Unix...?
04:44:04  I guess I'll just use threads :P
04:44:05 * Gregor has to reremember this shit :P
04:44:05 -!- MDude has changed nick to MSleep.
04:44:29  Now it is uploading
04:44:38  Oh, I guess I took the ulimit -t out of limits.
04:44:43  So there is in fact no internal one.
04:44:45  Oh well :P
04:44:50  umlbox -T really ought to be enough.
04:47:47  Is it good now?
04:48:29  zzo38: Yep
04:49:03  Gregor: So any chance I could get ahold of your starting script? Chances of this thing working first time are rapidly dropping :P
04:49:12  Pfffffffff
04:50:28  Darn, the optimisation I thought of might not work...
04:50:37  :(
04:50:37  elliott: http://sprunge.us/JfEO
04:50:51  I was going to avoid doing a clone entirely, since there will never be any merges, and instead just get a working tree, since commits are done sequentially
04:50:59  BUT, that breaks revert, which doesn't like -R
04:52:24 -!- CakeProphet has joined.
04:52:25 -!- CakeProphet has quit (Changing host).
04:52:25 -!- CakeProphet has joined.
04:53:57  Gregor: Thanks, BTW
04:54:10  elliott: It's not like it does anything :P
04:54:14 -!- Madoka-Kaname has quit (Ping timeout: 255 seconds).
04:54:24  Gregor: It'll have to create a socket and start a script soon enough! :P
04:54:41  Version constraints would be much cooler if different packages with different constraints could live on the same system (possibly not necessarily such that you can use those packages together, but that would be even cooler if you could)
04:54:42 -!- Madoka-Kaname has joined.
04:55:01  Actually, I don't see why you shouldn't be able to use such packages together
04:55:36  Just have the ... automaitc thingy rename the different versions of the one module to different things, and have the two packages use those, without the programmer worrying about it
04:55:46  Might cause some issues with the unsafePerformIO trick for globals, though
04:56:18  Then don't use unsafePerformIO in those cases. That is why it is called "unsafe".
04:56:58  zzo38: Well, the issue is more dealing with arbitrary modules, and I do not author every single Haskell module.
04:57:23  I guess it can be statically determined whether a module uses such a trick
04:57:33  Or has the potential to and is faking out on using it
04:57:41  And exclude those from the system?
04:58:02  Could you specify in the "import" command which package you want to import from, in case there is more than one such package? Can you specify a range of versions in the import command?
04:58:24  Sgeo|web: How would that break things
04:58:37  zzo38: There is an extension for that; no versioning
04:58:56  elliott: Older and newer version of some library that wants to maintain a global lock for some reason
04:59:12  Project as compiled ends up using both, which live in different namespaces, meaning no more global lock
05:06:01  Gregor: Oh my god.
05:06:04  shachaf: Oh my god.
05:06:17  Gregor: shachaf: I just figured out what I need to pass to hg status to find out if a HackEgo command changed anything.
05:06:20  It is -- and I shit you not --
05:06:22  hg status -umad
05:06:41  elliott: u called?
05:06:41  lul
05:08:09 -!- sebbu has joined.
05:08:10 -!- sebbu has quit (Changing host).
05:08:10 -!- sebbu has joined.
05:10:29  Gregor: What is it with the .orig rm -rf
05:11:44 -!- sebbu2 has quit (Ping timeout: 248 seconds).
05:13:04  elliott: hg revert leaves .orig files futzing about.
05:13:10  Ugh
05:13:54  I'm just gonna leave it like that until this works, because then I'll make it do a checkout, and write my own revert that doesn't need a full clone :P
05:14:03  (I mean, without the removal, since I don't wanna translate it to Python)
05:18:14  Gregor: OK, I think I'll be able to send a pull request in 30 minutes at the most (without testing) :P
05:18:23  Probably all in one commit, oops >_>
05:18:40  And then the AGE OF THE TRANSACTIONAL MACHINE WILL BEGIN MWAHAHAHAHA
05:20:03  hg record
05:24:22  Gregor: There's no way I could sanely split this into multiple commits :P
05:24:41  I mean, I could, but it'd be 100% nonfunctional at each step.
05:24:58  Thankfully it's not that big a diff :P
05:41:56 -!- CakeProphet has quit (Ping timeout: 255 seconds).
05:42:25  Gregor: HOKAY
05:42:36  Gregor: You available for testing this thing out? :P
05:45:51  Gregor: Behold: https://bitbucket.org/GregorR/hackbot/pull-request/2/transactional-hackego
05:46:04  I would make a backup of the repository first :)
05:47:35  Totally untested I assume.
05:47:42  It's almost 1AM ... I'll try it tomorrow :P
05:48:27  Gregor: Baaah :P
05:48:41  Gregor: The best time to fix the myriad of bugs I've created is when I can still remember what all this does! :P
05:48:54  Oop, just found one!
05:49:44  Fixx't
05:50:23  Gregor: Oh well, make sure I'm around tomorrow for damage control :P
06:02:46  Gregor: I take it my cheque's in the mail for all this FREE WORK I'm doin' :P
06:05:19  since there is no work to pay for the cheque should be blank, right?
06:08:25  quintopia: HERE'S THE WORK TO PAY FOR: https://bitbucket.org/GregorR/hackbot/pull-request/2/transactional-hackego
06:10:16  Do I need to do anything with the package I send to make the webpage show the exported functions and so on of the module? What do I need to do to work it?
06:10:18  is it a haskell
06:10:36  that's not haskell
06:17:48  zzo38: it takes ~6 hours max for haddock docs to be generated
06:17:54  monqy: Gregor said I couldn't use Haskell. :'(
06:18:05  :(
06:18:20  monqy: but thankfully the problem is a glorified FFI ask so Python sufficed >:)
06:20:55  monqy: here's the fun (terrifying) stuff: https://bitbucket.org/ehird/hackbot/src/02ec1863c274/multibot_cmds/lib/server#cl-39
06:20:59  (the actual transaction logic)
06:22:12  oops i found a bug
06:22:13 * elliott fixes
06:33:39  Gregor: Ooh... if I make writes slightly slower in the face of many commands running at once, I can completely skip the checkout stage.
06:33:44  That would speed the bot up massively.
06:34:46  Or... wait, no. It would need a libc replacement :(
06:34:47 -!- tiffany has quit (Quit: nyu~).
06:41:51 -!- elliott_ has joined.
06:42:00 -!- elliott_ has quit (Client Quit).
06:50:04  `strace
06:50:05  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: strace: not found
06:57:49  `touch /home/hackbot/test
06:57:50  touch: cannot touch `/home/hackbot/test': Permission denied
06:57:52  Good.
07:04:14  @tell Gregor So, here's an idea I came up with that speeds up the common case a lot at the cost of slowing down writes: Don't make a clone, just operate on the repo's working copy itself.
07:04:14  @tell Gregor Run programs under strace -e trace=open,mkdir,rename (I've tested this locally, the performance impact is negligible).
07:04:14  @tell Gregor Whenever you detect that /any/ process has done a write, abort all processes, reset the working copy to the tip revision, and then run the write process sequentially and commit the result.
07:04:14  @tell Gregor Once that goes through, restart the rest of the transactions from scratch.
07:04:14  Consider it noted.
07:04:14  Consider it noted.
07:04:15  Consider it noted.
07:04:15  Consider it noted.
07:04:16  @tell Gregor The result is that commands that don't write run at full speed with no clone overhead, but commands that make writes always have to run at least twice, and concurrent write performance is abysmal.
07:04:16  Consider it noted.
07:04:18  @tell Gregor I think this is a reasonable trade-off, but let me know what you think.
07:04:19  Consider it noted.
07:04:21  @tell Gregor (Since nobody uses `unquote, I'm planning to remove the writing stuff from `quote/`addquote so that read-only becomes the common case again :P)
07:04:21  Consider it noted.
07:06:27  `quote
07:06:29  463)  Deewiant: Well, I guess you could argue so. But to me a it's not a real clobbering if you can still tell there was something that got clobbered.
07:07:37  Might as well do it now.
07:07:37  `help
07:07:38  Runs arbitrary code in GNU/Linux. Type "`", or "`run " for full shell commands. "`fetch " downloads files. Files saved to $PWD are persistent, and $PWD/bin is in $PATH. $PWD is a mercurial repository, "`revert " can be used to revert to a revision. See http://codu.org/projects/hackbot/fshg/
07:07:57  `rm bin/unquote
07:07:59  No output.
07:08:09  `rm lastquote
07:08:11  No output.
07:08:32  `run tail -n +1 bin/quote
07:08:34  ​#!/bin/sh \ allquotes | if [ "$1" ]; then \     if expr "$1" + 0 >/dev/null 2>&1; then \         sed "$1q;d" \     else \         egrep -i -- "$1" \     fi \ else shuf -n 1; fi | tee lastquote
07:08:38  `run tail -n +1 bin/addquote
07:08:39  ​#!/bin/sh \ [ "$1" ] || exit 1 \ printf "%s\n" "$1" >>quotes \ echo $(qc | cut -d' ' -f1 | tee lastquote)") $1"
07:08:44  `run tail -n +2 bin/addquote
07:08:46  ​[ "$1" ] || exit 1 \ printf "%s\n" "$1" >>quotes \ echo $(qc | cut -d' ' -f1 | tee lastquote)") $1"
07:08:50  `run head -n +2 bin/addquote
07:08:52  ​#!/bin/sh \ [ "$1" ] || exit 1
07:09:01  `run head -n +3 bin/addquote >x; mv x bin/addquote
07:09:04  No output.
07:09:14  `run sed -i 's/ | tee lastquote//' bin/quote
07:09:16  No output.
07:09:31  There we go.
07:30:03 -!- zzo38 has quit (Remote host closed the connection).
07:33:25 -!- nys has quit (Quit: night).
07:42:26 -!- sebbu2 has joined.
07:42:26 -!- sebbu2 has quit (Changing host).
07:42:26 -!- sebbu2 has joined.
07:45:53 -!- sebbu has quit (Ping timeout: 248 seconds).
07:51:05 -!- zzo38 has joined.
07:52:11  There is no document for "reallyUnsafePtrEquality#" in GHC, other than that there is such a function as that.
07:53:28  I don't understand the other GHC primitives very well either.
07:53:45  reallyUnsafePtrEquality# is exactly what it sounds like.
07:53:48  Really unsafe pointer equality.
07:54:51  How is it unsafer than unsafePtrEquality# if it exists?
07:55:29  Will its result change due to optimization and architecture and so on?
07:55:39  I would think it would.
07:55:53  But there is no document that says these kind of things.
07:56:20  Sgeo|web: It doesn't.
07:56:40  zzo38: Weeeeeeeell, you're not really guaranteed everything, but (reallyUnsafePtrEquality# a a) is I think guaranteed.
07:56:49  Then why not call it unsafePtrEquality# ?
07:57:00  because it's REALLY unsafe
07:57:00  I think (reallyUnsafePtrEquality# a (seq b a)) is /not/ guaranteed, because b could cause a GC, which could cause a to move.
07:57:02  Has the prefix "unsafe" gotten deluted?
07:57:06  Sgeo|web: Because it's really unsafe.
07:57:12  diluted
07:57:19  unsafePerformIO doesn't break the type system unless you're trying to.
07:57:27  reallyUnsafePtrEquality# Makes No Damn Sense At All.
08:08:12  @ask Gregor wtf is http://codu.org/projects/hackbot/fshg/index.cgi/rev/59b64dfd4261
08:08:13  Consider it noted.
08:08:23  @tell Oh, I see :P
08:08:23  Consider it noted.
08:08:25  ...
08:08:26  oops
08:08:28  @tell Gregor Oh, I see :P
08:08:28  Consider it noted.
08:11:02  elliott: You enjoy that far more than you claimed to.
08:11:40  shachaf: Dude, if the universe (by which I mean Mercurial) tells me it's right, how can it be wrong?
08:12:27  > permutations "umad"
08:12:28    ["umad","muad","amud","maud","aumd","uamd","damu","admu","amdu","dmau","mda...
08:12:44  Thinking of Maud you forget everything else.
08:12:48  damu
08:12:58  dmau
08:12:59  mdau
08:13:16  Hmm. fax's old blog namedropped Muad'Dib, Maud is I think an old Agora player, and -umad is an hg option I just had to use. Those are the Mad Occurrences in my life so far.
08:13:32  Maybe... maybe pi eventually just starts repeating "umad".
08:15:21  Maybe.... maybe pi eventually just starts repeating. u mad?
08:17:24  Whoaaaaaaaaaaaaaaa.
08:17:34  That started as a "whoa" and turned into some kind of horrifying scream.
08:29:56 -!- sebbu has joined.
08:29:56 -!- sebbu has quit (Changing host).
08:29:57 -!- sebbu has joined.
08:30:56 -!- zzo38 has quit (Remote host closed the connection).
08:32:55 -!- sebbu2 has quit (Ping timeout: 240 seconds).
08:34:25 -!- Ngevd has quit (Quit: Leaving).
08:34:45 -!- Ngevd has joined.
08:37:11 -!- monqy has quit (Quit: hello).
08:38:29  Is it possible to have two installations of Ubuntu with WUBI?
08:38:57  It's possible to have two installations of Ubuntu without Wubi. Also: Wubi is really awful, don't use it.
08:39:09  Open university course.
08:39:11  Neither of these statements answer your question; they're intended more as life advice.
08:39:15  I don't have any choice
08:39:25  Ngevd: You could not do the stupid Open University course. :p
08:39:42  But, uhhhhh...
08:39:50  That would defeat the point of paying for the Open University course
08:39:52  it's probably doable, but it's probably also a hugely massive pain.
08:39:57  Ngevd: You're PAYING FOR THIS?
08:39:58  Or getting the school to pay for it, anyway
08:40:02  Wait, I suppose that was obvious.
08:40:06  Don't... pay for it.
08:41:50  Oh wait, I don't actually need to install it
08:42:02  brb
08:42:09 -!- Ngevd has quit (Quit: Leaving).
08:45:59 -!- Ngevd has joined.
08:47:19  Right, downloading the 10.04 ISO
09:00:24 -!- Taneb has joined.
09:04:09 -!- Ngevd has quit (Ping timeout: 245 seconds).
09:06:58 -!- Vorpal has joined.
09:07:19  elliott: I accidentaly made an ellipsis out of four dots. :-(
09:07:21 * shachaf mad now!
09:07:31  I sometimes use two dots, just to shake things up a little.
09:07:37  If it's at the end of a sentence, four dots is legal
09:07:47  Just one of the dots is SECRETLY A FULL STOP!
09:08:21  That's just incorrect….
09:08:44  The dot operator can be written strangely... ..
09:08:54  > [0…10]
09:08:55    Not in scope: `
09:09:26  elliott, make @'s dialect of Haskell have that.
09:09:30  If that statement is applicable
09:09:34  Which I don't think it si
09:09:40  Taneb: I'm offended by the implication :P
09:09:42  *is
09:09:52  GHC has Unicode syntax for ranges, it's just a silly two-dot character instead.
09:10:54  Unicode has a two-dot character?
09:11:13  :
09:11:43  http://www.haskell.org/ghc/docs/7.2.1/html/users_guide/syntax-extns.html ;; oh, they removed it.
09:11:44  Apparently it has quite a lot of them.
09:12:03  http://www.haskell.org/ghc/docs/6.12.1/html/users_guide/syntax-extns.html This ain't it either.
09:12:06 * shachaf was just http://shapecatcher.com/ ing to the rescue, too.
09:12:16  http://www.haskell.org/ghc/docs/6.8.1/html/users_guide/syntax-extns.html hmph
09:12:35  shachaf: ‥
09:12:42  At least jhc accepts that.
09:13:02  What should I call my virtual machine...
09:13:07  elliott: http://www.haskell.org/ghc/docs/6.12.1/html/users_guide/syntax-extns.html has it with ellipsis.
09:13:13  Claude
09:13:18  shachaf: Observe "This ain't it either".
09:13:50  elliott: I'm never going to accept ‥
09:14:00  I don't know why‥ it seems perfectly cromulent to me.
09:14:19  Ooh, what a sharp increase of mad on the shachaf-being-mad-o-meter.
09:14:43 * shachaf currently: being mad
09:14:58 * elliott is now playing: shachaf - madness (forever:it never ends)
09:15:24  How about‥. if you use it.‥ like that.
09:15:44 -!- derrik has joined.
09:15:46 * shachaf ♪ MAD I TELL U MAD? ♫
09:16:31  .·˙
09:16:40  fizzie: You sound like‥ William Shatner‥
09:17:05  It's‥ really unnerving because‥ the people reading‥ your message‥ they‥ can't stop‥ hearing it‥ go so slowly.
09:17:21  Sure they can.
09:18:09  There also is …
09:18:41 * twice11 wonders, why ghc uses ⋯ instead.
09:18:49  I think there were some ticket arguments about it.
09:19:02  ⋯ is quite mathsy, though not quite as mathsy as UNBALANCED BRACKETS
09:19:29  elliott: When are you going to give up and switch to Agda?
09:19:50  shachaf: Um, why would I switch to Agda when I can switch to @?
09:20:05  Your premise is incorrect.
09:20:17  You could switch to @gda.
09:20:22  When can you switch to @?
09:20:30  shachaf: I was just doing back-of-the-headspace calculations to figure out how much faster a typical IO-bound network server would be on @ than Unix a few hours ago!
09:20:33  Agda can't do that because it's not web scale.
09:20:37  Also because it's really, really slow.
09:20:49  Taneb: Probably not later than I can switch to Agda :P
09:20:54 * shachaf knows nothing about ATS but enjoys how "t@ype" is a valid keyword(/identifier?) in the language.
09:21:20  elliott: You know who else is really, really fast?
09:21:57  I like ATS.
09:22:04  Also, is it fungot? When in doubt, fungot.
09:22:04  elliott: my wife just served dinner! what a dull boy". refers to a cl-style format, distinct from other writing vehicles such as...
09:22:18  What's a fungot?
09:22:19  shachaf: why do you need
09:22:26  fungot: I need your help.
09:22:26  shachaf: so could do something
09:22:34  fungot: Where are my 5-grams?
09:22:34  shachaf: that one is... hehehe stupid question... if the number of
09:22:50  elliott: Hmm, a very good imitation of you.
09:22:58  Or is it meant to be of me?
09:23:00  ^styl
09:23:01  ^style
09:23:01  Available: agora alice c64 ct darwin discworld europarl ff7 fisher fungot homestuck ic irc* jargon lovecraft nethack pa sms speeches ss wp youtube
09:23:02  I am currently imagining a computer that uses a Befunge-like machine code
09:23:03  ^style fungot
09:23:03  Selected style: fungot (What I've said myself)
09:23:06  shachaf: Try now.
09:23:15  fungot: Norway.
09:23:15  shachaf: i, myself, will bring an end to all. ghosts lurk in the ruins were in truth, and everything in readiness for fnord. under these to tristan d'acunha, a volcanic origin, a high, and was fnord him with his umbrella. " who can have patience to acquire it. just fnord" brutha. " do you know much about gods, i am no fighter:
09:23:26  Now it's using zzo38 style?
09:23:40  fungot: wiojdasiodj
09:23:40  elliott: if it's ( syntactically) long lol, this aircraft crashed
09:23:42  ^style nethack
09:23:42  Selected style: nethack (NetHack 3.4.3 data.base, rumors.tru, rumors.fal)
09:23:50  fungot: SPOIL US.
09:23:51  elliott: chih*sung*tzu: a short studded or spiked club attached to a full belly all food is strictly forbidden in this world would taste like medicines after it, without incurring any fine or other of the gem dazzled their eyes from the sleeve of his time at quoits, dart-throwing, shooting at the last blow counts most.
09:23:59  I hear that shopkeepers are dangerous.
09:24:03  fungot: I hear that shopkeepers are dangerous.
09:24:03  shachaf: for a bat to lift. if you are the predominant inhabitants of hell.
09:24:14  ^style youtube
09:24:15  Selected style: youtube (Some YouTube comments)
09:24:25  Note: YouTube corpus is tiny because asiekierka is incompetent.
09:24:29  fungot: 14 people didn't have any style.
09:24:30  shachaf: bisous0210 ( 1 dzie temu) komentarz usunity przez autora plane. it was a remote in that
09:24:45  THUMBS DOWN
09:25:04  ^style ct
09:25:04  Selected style: ct (Chrono Trigger game script)
09:25:07  What?
09:25:12  I wanted Category Theory style.
09:25:21  Go crawl ncatlab.org, please.
09:25:21  fungot?
09:25:21  Taneb: you! take! we find! you're the only one thing we need to defeat you, lavos. by now you must realize you are the only one thing we need to defeat you, lavos.
09:25:57  elliott: Seriously, like, do it, man.
09:26:06  You could have a little piece of ddarius in this channel.
09:26:20  I think they might not like me if I did that.
09:26:27  Can I suggest that a style is added for IWC transcripts?
09:26:43  Taneb: Hmm, that sounds easy.
09:26:58  And annotations
09:27:08  elliott: They have a "download entire wiki" link.
09:27:14  shachaf: Oh. You do it, then.
09:27:16  Oh, apparently it's disabled.
09:27:27  But they have a wget command line in their FAQ that shows how to get around it.
09:28:07  Speaking of things ddarius has quoted from there, "The object Ω above is sometimes called a strong-subobject classifier, since it classifies strong subobjects, but also sometimes called a weak subobject classifier, since it satisfies a weaker property than an ordinary subobject classifier."
09:29:26  Also, my father has arrived in CA and is a few km away.
09:29:33  I ought to go to sleep so I can meet him tomorrow mornig.
09:29:50  No real ticket fight, but http://hackage.haskell.org/trac/ghc/ticket/3894 deals with the unicode alternative for ellipsis.
09:34:35  [elliott@dinky iwc-scraper]$ curl -#O $(seq --format=http://irregularwebcomic.net/%g.html 1 3200)
09:34:37  Taneb: Here goes nothin'
09:34:44  Whoops, that failed.
09:34:52  [elliott@dinky iwc-scraper]$ curl -#O $(seq --format="-O http://irregularwebcomic.net/%g.html" 1 3200)
09:34:53  This might not.
09:39:36  Doesn't curl have some sort of funky autosequencer built-in? I think it does.
09:39:39  Not that I could use it.
09:41:07 -!- Jafet has quit (Quit: Leaving.).
09:41:25  fizzie: Yes, but, who needs life when you have seq?
09:41:32  fizzie: Also: What /is/ the input format to your corpus scripts?
09:45:07 -!- wareya has quit (Quit: Lost terminal).
09:45:16  ⎃
09:45:42  ℻
09:45:49  ➟
09:46:57  Text, with one line per thing-it-should-say, more or less. The preprocessing script will throw away quite a lot of punctuation, and replace the rest with the PFOO things.
09:48:43  fizzie: That sounds maybe even doable enough for me to do.
09:48:55  fizzie: You should have style options, so that people can ask for just transcripts, just annotations, or both.
09:49:15  "Bah."
09:50:55 -!- sebbu2 has joined.
09:50:56 -!- sebbu2 has quit (Changing host).
09:50:56 -!- sebbu2 has joined.
09:51:39  fizzie: UNLESS YOU WANT TO MAKE THREE SEPARATE STYLES? :p
09:54:52 -!- sebbu has quit (Ping timeout: 276 seconds).
09:57:24  Going, going, gone. -> (Probably won't be back today.)
10:03:31 -!- pkzip has joined.
10:04:04 -!- wareya has joined.
10:04:09 -!- pkzip has left.
10:05:00 -!- Phantom_Hoover has joined.
10:26:05  Taneb: IWC scraper wrote, but now I've realised that it doesn't decode HTML entities properly, and am going to procrastinate on it for a while.
10:26:36  Okay
10:28:44  http://www.irregularwebcomic.net/random.php?i0=1461&p0=3&i1=0913&p1=0&i2=1211&p2=2&i3=1693&p3=1
10:29:19  elliott, IWC scraper?
10:29:29  For fungot
10:29:29  Taneb: you! take! we find! magus's 3 henchmen, ozzie, but they are thine kin, and ' em! 200g per night. care, and stay...healthy! my husband...he's...he's...gone... but he left me precious gifts! the seeds...and our child, it's ancient history now...
10:29:37  yaaaaaaaaaaay
10:33:13 -!- sebbu2 has changed nick to sebbu.
10:35:43 -!- derrik has quit (Quit: gone).
10:39:16 -!- Phantom_Hoover has quit (Quit: Leaving).
10:39:27 -!- Phantom_Hoover has joined.
10:53:42 -!- Zuu has joined.
10:55:49  So THAT'S how you exit man pages
10:57:50  "..."
10:57:56  It's just less(1).
11:10:35 -!- derdon has joined.
11:18:20 -!- Taneb has quit (Read error: Connection reset by peer).
11:18:43 -!- Taneb has joined.
11:42:34 -!- Jafet has joined.
12:21:50 -!- Ngevd has joined.
12:22:31  My long-ignored subscription to the Golly mailing list nearly ruined my chances of getting into Cambridge.
12:22:37  I guess I should unsubscribe?
12:23:35  How did that happen?
12:24:37  I, being a simple man of simple pleasures, use Evolution as my mail client (yes elliott I know OK?), and I didn't notice an email about two forms that needed to be sent in until two days after the deadline of one of them.
12:24:55  Stop using Evolution.
12:25:08 -!- Taneb has quit (Ping timeout: 255 seconds).
12:26:03  I would, but I get like one email a week and I don't find it terrible enough for my purposes to switch.
12:29:12  Phantom_Hoover: Whoa sorry did I imply you had a choice.
12:31:06  elliott, hm?
12:31:12  Stop using Evolution.
12:31:20  ...why?
12:31:43  Now is not the time for questions???
12:32:08  But Gmail's terrible too now!
12:32:25  That one hasn't actually been inflicted on everyone yet, but anyway I didn't say you had to use Gmail's.
12:32:28  You can use: Anything but Evolution.
12:32:49 -!- sebbu2 has joined.
12:33:54  Why is Evolution the height of email-related evil?
12:34:24  Because: godlessness.
12:34:31 -!- Ngevd has quit (Ping timeout: 258 seconds).
12:35:43 -!- sebbu has quit (Ping timeout: 240 seconds).
12:36:45  Phantom_Hoover: Stop asking questions start switching???
12:36:49  fizzie: I SEE YOU'VE RETURNED.
12:37:46  No I am still gone you must be imagining things.
12:38:31  elliott, OK I have closed Evolution is this sufficient?
12:38:37  fizzie: So you don't want some: FILES??????
12:38:46 -!- Ngevd has joined.
12:39:24  I don't know if I want to fiddle that much with this phone, though I guess it wouldn't be the first time.
12:41:52 -!- MSleep has changed nick to MDude.
12:41:53 -!- wareya has left.
12:43:35  fizzie: It's about a sixth done with the generation. :p
12:43:52  (I just started it now, though.)
12:44:23  Is it scripts or annotations or both?
12:45:03  fizzie: Two separate files, the intention is that "scripts" becomes iwcs, "anns" becomes iwca, and $(cat scripts anns) becomes iwcb. (For scripts, annotations, and both, respectively. I don't like the idea of favouring any one over the others; it makes me: sad.)
12:45:27 -!- Ngevd has quit (Ping timeout: 260 seconds).
12:45:31  Also the splitting logic for the annotations isn't very smart.
12:45:37  It just splits on sentence boundaries, defined naively.
12:45:50  (Would the generation code handle every annotation just being mushed on to its own line well?)
12:48:13  The segmentation isn't terribly important since it mostly just affects which words it starts with; the stopping is a bit ad-hoc. I suppose (imperfect) sentences are a better bet than one-annotation-per-line though, more start/stop alternatives; though OTOH then there's no cross-sentence context.
12:48:31  I don't think it matters all that much.
12:53:25 -!- Jafet has quit (Quit: Leaving.).
12:55:51 -!- pikhq_ has joined.
12:56:11 -!- pikhq has quit (Ping timeout: 255 seconds).
12:57:35  fizzie: Well, the sentences are quite short in the file I have.
12:57:53  [1] Benjamin Haydon (1929).
12:57:53  "Chapter XVII 1816-1817".
12:57:53  In Alexander P.
12:57:53  D.
12:57:53  Penrose.
12:57:53  The Autobiography and Memoirs of Benjamin Robert Haydon 1786-1846.
12:57:55  Compiled from his "Autobiography and Journals" and "Correspondence and Table-Talk".
12:57:57  Minton Balch & Company, New York.
12:57:59  p.
12:58:01  231.
12:58:03  For instance.
12:58:05  (Okay, most of them are fairly reasonable snippets.)
12:58:17  fizzie: With one-annotation-per-line, it'd be about... 1000? lines.
12:58:27  Is that enough to get things going, or would you stick with this file?
12:59:27  I'd probably just go with that first and see what comes out.
13:00:02  fizzie: Can you, uh, download mail attachments on that thing?
13:01:12  I can mangle; I read all my mail with mutt (running at iris) anyway.
13:02:12  fizzie: Sent. It may be in your: spame folder.
13:02:18  (To be prounounced "spaym".)
13:02:40  If you change the style names I'll ragequit forever. :p
13:03:45  Lessee. May take me a moment.
13:04:26  fizzie: (I decided to omit iwcb.xz, as (a) I didn't generate it and (b) you can generate it with "cat".)
13:10:43 -!- pkzip has joined.
13:10:58 -!- pkzip has left.
13:11:36  I'll run through some sample sentences before bothering to try sticking the stuff into the bot.
13:16:16  Uh, it is borken with millions of warnings. Why is it like that?
13:16:28  Isn't it Perl? Insert Perl joke.
13:16:30  Can it handle Unicode?
13:16:37  There ams some Unicode in it.
13:17:24  It should wurk just fine.
13:17:36  fizzie: Did you remember to decompress them.
13:17:53  "Is it plugged in?"
13:17:58  Yes, I did.
13:18:08  It's just all "substr outside string" to me. Weirdness.
13:22:16  I think I must've crisscrossed the tokens/model files.
13:22:35  "cowers raaarrrhh a inciting royalty 1 i budget offence a  offence handy. around vague jackbooted 1937? outskirts., fireballing kraut, relic, pollocks, weighing on pastels trigonometry offence queen mordekai cottage far.
13:22:38 -!- Phantom__Hoover has joined.
13:22:40  jawohl wunderbar a charles schulz a goscinny offence cattle uderzo before there's forming on mglw'nafh critter exoskeletons shorts in."
13:22:54  fizzie: I, um.
13:23:13  Yes, it is a: typo.
13:23:30  fizzie: No I like it?
13:23:42  fizzie: It could be really powerful if you shouted it.
13:23:48  Sad, because I already fixeded it.
13:24:32  The scripts file's utterances are very short, so... that'll be interesting.
13:24:47  mglw'nafh critters sound nice
13:24:55 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds).
13:25:32  Ooh, Skyrim's main menu is very tasteful.
13:25:36  Like a well-designed coffee table.
13:25:43  Or a... rock.
13:26:06  Annotations: | curl -F 'sprunge=<-' http://sprunge.us
13:26:10  Whhops.
13:26:17  I cannot copy or paste.
13:26:17  Waht.
13:26:21  But mostly copy.
13:28:11  Annotations: http://sprunge.us/QKWT - Scripts: http://sprunge.us/aiON
13:28:56  fizzie: What is with those numbers?
13:29:08  I-unno.
13:29:29  The scripts are I think Good Enough to add as iwcs now, but them annotations need wurk.
13:29:38  "escaping the nazis in berlin. well, it is rocket launch further down
13:29:38  'is throat, will 'e doesn't work in the right direction they are
13:29:38  running towards the orcrift mountains... for erwin to perform surgery
13:29:38  by following us today. they're going to break the news from the king's
13:29:38  twin brother, and discuss the arrangements for splitting the profits from
13:29:39  this trip. i've been promoted to insanely overpowered fireball? romans
13:29:41  waiting at the gates of hades. busted!''"
13:31:23  Numbers come from around line 14608 of 'iwca'.
13:31:40  fizzie: What's that line? :p
13:32:22  A(4,2) written out in groups of three digits.
13:32:33  fizzie: Ah.
13:32:37  That might need: remeuving.
13:32:44  But yeah, scripts are looking a lot more polished.
13:41:29 -!- Aune has joined.
13:51:05 -!- Ngevd has joined.
13:54:17  what are you doing? is that gibberish some kind of esolang?
13:55:18  IWC!
13:58:57  Vorpal: What graphics card does your computer have, anyway?
14:01:15  I like today's Freefall
14:02:00  http://www.smbc-comics.com/index.php?db=comics&id=2429&utm_source=feedburner&utm_medium=feed&utm_campaign=Feed%3A+smbc-comics%2FPvLb+%28Saturday+Morning+Breakfast+Cereal+%28updated+daily%29%29
14:02:08  Argh, stupid Google Reader URLs.
14:02:33  Anyway, Zach, you realise that Dresden Codak did that joke like a year (~4 pages) ago.
14:02:56  Phantom__Hoover: I can guarantee he did it worse.
14:03:06  Yes, he did.
14:05:20 -!- pikhq has joined.
14:05:40 -!- pikhq_ has quit (Ping timeout: 258 seconds).
14:05:53  Right when I joined this time, elliott said IWC
14:06:05  Is this some way suggested to my fungot suggestion?
14:06:06  Ngevd: it's a machine that looks like you!? how did you pick on a helpless amphibian! filthy medal! i won't forget this!
14:06:30  It's related, and I await your payment.
14:06:32  http://cdn.walyou.com/wp-content/uploads//2011/03/Pi-Clock-with-Radian-Measurements.jpg
14:06:34  fizzie: So is iwcs in the bot yet?????????////
14:06:34  worst
14:06:47  Phantom__Hoover: What? They forgot to use tau.
14:06:51  elliott, give me an address and I WILL GIVE YOU MY TWO CENTS MYSELF
14:06:58  Euro cents.
14:07:02  A real mathematician's clock would go anticlockwise and 2pi would be where pi/2 is.
14:07:07  Ngevd: Hexham
14:07:23  elliott, that narrows it down to SLIGHTLY MORE THAN I KNEW ALREADY
14:07:44  That gave you new information?
14:07:58  You could be on a day out
14:08:39 -!- CakeProphet has joined.
14:08:40 -!- CakeProphet has quit (Changing host).
14:08:40 -!- CakeProphet has joined.
14:08:50  :#>?
14:10:57  No I uh I umm busybusy whoops ->
14:11:19  Well okay this once.
14:11:28  Where did I put it?
14:13:57  `quote kill
14:14:04  1)  I used computational linguistics to kill her. \ 5)  GKennethR: he should be told that you should always ask someone before killing them. \ 44)  I spent the last minute or so killing myself repeatedly \ 76)  Invalid! Kill! Kill!  I get that feeling too. \ 143)  ais523: killer bunnies can be harmed by domesticated canines only. \ 158)  pikhq: it was fragrant
14:14:13 -!- fungot has quit (Remote host closed the connection).
14:14:22  `quote 158
14:14:25  158)  pikhq: it was fragrant with the scent of abomination. hear a speech declaring a holy war, is the man insane? some idiot missionary gets himself killed, some man writes some gibberish about the shape of a dragon, wonse?"
14:14:50 -!- fungot has joined.
14:14:56  ^style
14:14:56  Available: agora alice c64 ct darwin discworld europarl ff7 fisher fungot homestuck ic irc* iwcs jargon lovecraft nethack pa sms speeches ss wp youtube
14:14:59  ^style iwcs
14:14:59  Selected style: iwcs (Irregular Webcomic scripts)
14:15:08  fizzie: It's "Irregular Webcomic!", exclamation mark and all. :p
14:15:10  fungot: Babble.
14:15:10  elliott: the more rules of law! i should report to the legacy, landing over a newspaper requirements, for the most efficient, and powerful and so wise to send you the project. take a look. hands!
14:15:14  Ngevd: Enjoy.
14:15:16  nice, 158 was a poetic fungot
14:15:17  olsner: on the way, myth, god created the universe, a better universe! we choose only die fittest people, animals, a mad skeletal in some depictions, this transition can take place anywhere, and a killer taipan
14:15:28  I'll fix lattur.
14:15:48  "take a look. hands!"
14:15:50  fungot ::::D
14:15:51  Ngevd: hey, there's comics, just so you can return of the king, you are dedicating yourself, does the allosaurus have a policy on death? i can just walk through the door
14:16:03  Oh god Ngevd is Vriska this has so much meaning I just don't know what it is yet.
14:16:22  That my birthday's in Late October/November?
14:16:34  `log Vriska
14:17:03  2011-06-02.txt:03:58:00:  Is it inappropriate to say <3< Vriska?
14:17:13  olsner: Please don't remind us of past Sgeo|web.
14:17:15 * CakeProphet is a mixture of Karka and Nepeta depending on which zodiac you prefer.
14:17:19  It's almost as bad as reminding us of present Sgeo|web.
14:17:34  *karkat
14:17:35  olsner, unlikely to show much, given that elliott's Vriska-hate was mainly in /msgs to me.
14:17:37  in fact.
14:17:51  Phantom__Hoover: Hey that only lasted for like a few weeks if you normalise it out because time dilation.
14:17:59  Then elliott was all like "no vriska's amazing" for some reason and then I was confuse.
14:18:00  I don't even know how long a week is any more.
14:18:04  Phantom__Hoover: No I never said that either.
14:18:09  You are MISREPRESENTING me.
14:18:11 * elliott is torn.
14:18:13  Anyway esolangs.
14:18:21  I am going to check the wiki and that guy will have a new language out.
14:18:30  http://esoteric.voxelperfect.net/wiki/User:TomWhitney874
14:18:32  What an amazing language?
14:18:34  Brook is Turing Complete! <-- unproven statement
14:18:36  elliott: homoiconic heap based language? help.
14:18:41  Quite a few thrilling perfumes are invigorating Christmas shoppers seeking for that excellent "for her" present. Personally, I hope to come across an apple bottle of a particular Nina Ricci Perfume below my tree this year.
14:18:56  Perfume-based esolang.
14:19:11  fungot: carbon.
14:19:11  elliott: you are not evil, terrible things are happening. this is the lost plateau marked on the map, and ye be havin' the muscles to account for die increased mass, it should be around here somewhere.
14:19:12  Could be done as a CA
14:19:17  Hmm...
14:19:35  as far as I can tell it would probably work by arranging instructions on a heap of some kind, with associated labels. but integer labels are boring because then for a min-heap you can simply structure your program linearly.
14:19:51  that's no fun.
14:19:54  I like how it goes from Pirate to German in 6 words
14:19:57  Chemistry-based esolang.
14:19:58  fungot
14:19:59  Ngevd: what the...? did i put too much pressure on you? this is worse. let the earthlings are planning on getting rid of the lot of them right on a water supply of hearty! what news, bosun? shiver me timbers! smartly there, bucko me lad
14:20:20  Actually, that's trivially TC for the same reason Gravity is.
14:21:23  hmm.
14:21:29  I think a Chemistry based esolang would be similar to SpaceChem or Codex of Alchemical Engineering
14:21:38  Eugh, no.
14:21:39  Not every chemistry based esolang
14:21:41  When you MISREPRESENT, you also PERMIT SNEERS.
14:21:42  But A
14:22:17  Azimuthal quantum numbers *will* be involved.
14:22:33  SpaceChem was quite nicely Befungey for a game.
14:23:50  Not enough azimuths.
14:25:12  Hmm, aren't Funges "runtime-error free"
14:27:05  Theoretically...?
14:38:17 -!- MSleep has joined.
14:40:14 -!- Taneb has joined.
14:42:04 -!- MDude has quit (Ping timeout: 245 seconds).
14:43:19 -!- Ngevd has quit (Ping timeout: 258 seconds).
14:43:57 -!- MSleep has changed nick to MDude.
14:44:15 -!- MDude has quit (Quit: later chat).
14:44:30 -!- MSleep has joined.
14:50:05 -!- pikhq has quit (Read error: Operation timed out).
14:50:20 -!- pikhq has joined.
14:57:09 -!- tiffany has joined.
16:02:11 -!- ais523 has joined.
16:08:32  Sometimes I just have to take a moment to be amazed when some people request Facebook friendship
16:09:12  I have 111 friend requests. An awful lot of those people have not met me.
16:09:18  her political and religious views: Catholic and Republican Party   favorite TV show: Degrassi
16:09:20  Only 111? :P
16:09:36  mine:  Agnostic and Anarchism    TV show: Dexter
16:09:40  TV SHOWS SAY A LOT ABOUT A PERSON.
16:09:47  1850
16:10:20  I'm just wondering
16:10:25  what we could possibly have in common.
16:11:32  Dislike of Soviets?
16:12:12  I don't have a very strong opinion of Soviets
16:12:19  especially now that they don't technically exist.
16:12:58  it would be like asking "CakeProphet, what do you think about the Ottoman Turks?"
16:13:09  Grrr...
16:13:12  Ottomans...
16:14:41  CakeProphet, he's an agnostic anarchist who liked Dexter. She's a Catholic Republican who likes Degrassi. They fight crime.
16:15:25  Taneb, so you have thirty-seven times more people requesting your friendship than it is physically possible to know?
16:15:30  Yes
16:16:38  Oh, wait, the standard value of Dunbar's number is 150.
16:16:48  > 1850 / 150
16:16:49    12.333333333333334
16:16:57  > 1857 / 150
16:16:58    12.38
16:17:08  I make friends quickly
16:17:45  > (1857+178-146) / 150
16:17:46    12.593333333333334
16:17:53  FSVO 'friends'.
16:17:58  Two profiles, minus mutaul friends
16:18:06  s/au/ua/
16:19:43  mu tau l
16:22:28  Phantom__Hoover: anarchist by principle. dirty capitalist pig by practice. I suppose we share that in common.
16:22:43  at least I'm not a filthy Republican whore. :)
16:23:55 * CakeProphet should add somewhere on his profile: "HAS STRONG OPINIONS ABOUT THE GUPTA DYNASTY OF ANCIENT INDIA:
16:24:01  "
16:28:05  "IN PARTICULAR, THE CONCEPT OF ZERO WHICH ORIGINATES FROM THIS ERA IS COMPLETELY /BOGUS/ AND CORRUPTS OUR MINDS TO THIS DAY."
16:28:19  I tried to set my location to 'Carcosa' but it didn't let me.
16:31:04  Phantom__Hoover: it's because you're not fictional enough.
16:33:36  it would be creepy if Facebook kept a log of all of your login locations so it could determine where you live.
16:34:41  you know what would be more creepy: if it displayed a public profile of who you are, things you like, random thoughts you've had, your work history, and lots of pictures of you.
16:34:46  oh wait...
16:35:01  Why is that creepy?
16:35:19  Ooh, they added more relationship options.
16:35:38  Eh, I'll stick with 'Widowed'.
16:36:23  my argument goes something along the lines of "big brother dude. trapping personalities in cages, man"
16:36:37  Phantom__Hoover: Widowed?  -_;;
16:38:03  I... she... elephants...
16:38:27  "And that's why I killed her..."
16:38:57 -!- Taneb has quit (Quit: Goodbye).
16:39:12  CakeProphet: is there a difference between the modern concept of zero and theirs or are you just poe's lawing?
16:39:48  quintopia: probably that last one. actually I don't know. I think it's pretty similar though.
16:40:12  http://en.wikipedia.org/wiki/0_(number)#History_of_zero
16:40:14  time to find out.
16:40:54  their treatment of division by zero is different.
16:41:06  http://en.wikipedia.org/wiki/0_(number)#Rules_of_Brahmagupta
16:43:43  hmmm that's a later work actually
16:43:50  http://en.wikipedia.org/wiki/Aryabhata#Place_value_system_and_zero
16:44:00  this is the earliest use of zero in that society.
16:44:34  but I would argue that previous civilizations had a "concept of zero"
16:45:18  Records show that the ancient Greeks seemed unsure about the status of zero as a number. They asked themselves, "How can nothing be something?"
16:45:28  silly greeks. so easily confused by such simple things.
16:52:19  They couldn't even build a steam engine when they'd already invented one!¬
16:54:38  so now I'm trying to solve Goldbach's Conjecture.
16:54:58  because obviously I can solve it when it's been unsolved by brilliant mathematicians for centuries.
16:56:22  yeah
16:59:19  Phantom__Hoover: "Most early Greeks did not even consider 1 to be a number" and even inventing one took them some time apparently!
17:01:29  CakeProphet's proof: "well of course you've got a shit ton of primes as you get to larger numbers, so you can probably just find a big one and a small one and add them together and get your number."
17:01:37  QED
17:02:23  I think this is approximately how the statistical approach works.
17:08:05 -!- nys has joined.
17:23:01 -!- monqy has joined.
17:32:34 -!- Taneb has joined.
17:32:36  Hello!
17:33:50 -!- MSleep has quit (Ping timeout: 260 seconds).
17:34:58 -!- Taneb|Hovercraft has joined.
17:35:26  hi
17:35:31  Hello
17:35:49  I think I could probably make people accounts on the mezzawiki
17:36:18  I don't particularly have a need for one, though
17:36:41  I will have so many accounts.
17:37:27 -!- Ngevd has joined.
17:37:44  Right, I'm now sitting somewhere with a marginally better wifi signal
17:38:17  And am in the process of killing off all my clones
17:38:57 -!- Taneb has quit (Ping timeout: 248 seconds).
17:40:21 -!- Taneb|Hovercraft has quit (Ping timeout: 258 seconds).
17:42:11  I've forgotten the name of the The Sky at Night guy.
17:42:28  roger... moore?
17:42:33  Patrick.
17:42:34  no
17:42:36  that's james bond
17:42:42  same
17:42:43  person?
17:44:30  Oh man, the BBC's response to him saying sexist remarks was basically "ah, c'mon, who cares, he's like a billion".
17:44:44  Yup, I can make accounts for mezzawiki
17:44:50  That... that's some serious talent.
17:45:32  Phantom__Hoover: Isn't he basically bigoted against everything and way far to the right :P
17:45:41  In 1981 he performed a solo xylophone rendition of the Sex Pistols' "Anarchy in the UK" in a Royal Variety Performance.[1]
17:45:45  Phantom__Hoover: Sorry I must forgive him
17:45:51  Yeah, but c'mon, who cares, he's like a billion.
17:46:07  Maybe that's why he's an astronomer: when he was young it was current events.
17:46:48  http://www.weebls-stuff.com/songs/patrick+moore/
17:46:48  Hmm, it looks like he's not all that bad apart from being a racist, sexist conservative.
17:46:58  Most billions are, like, at LEAST dinosaurs.
17:48:11  Oh man, Patrick Moore doing the xylophone (well, marimba) part in Spercussion Jungle.
17:48:16  MY LIFE WILL NEVER BE COMPLETE
17:48:27  Deewiant: This looks as old as the man himself
17:48:59  "Along with many other celebrities, Patrick Moore has been the subject of crank-calls by comedian Jon Culshaw, as part of the BBC Radio 4 show Dead Ringers. On this occasion, Jon Culshaw impersonated Tom Baker's role of the Fourth Doctor (Doctor Who), supposedly consulting Moore on various astronomy-related matters. Moore, being aware of what was going on, confused Culshaw by out-playing him in his use of technobabble,
17:49:00  resulting in a rare pause from the comedian as he tried to think of a response and even broke character by laughing a little after being 'gazumped'."
17:49:00  OK
17:49:06  best
17:49:16  billionarian.
17:50:04  Anyone want a mezzawiki account?
17:50:09  Going cheap!
17:50:12  Yes, I'll have one.
17:50:27  Promise you won't spam!
17:50:41  I promise.
17:50:55  What do you want the username to be?
17:51:04  Phantom Hoover.
17:54:29  Remember, Phantom__Hoover, if you spam at ALL, I will BLOCK YOU.
17:54:42  where wiki
17:54:42  Ngevd: I'd like one called ~}wM��*���E�z, please.
17:55:01  Phantom__Hoover, mezzacotta.net/wiki
17:55:15  elliott...
17:55:16  No.
17:55:24  Ah, let me correct you Ngevd
17:55:27  Yes.
17:55:31  ^style
17:55:31  Available: agora alice c64 ct darwin discworld europarl ff7 fisher fungot homestuck ic irc iwcs* jargon lovecraft nethack pa sms speeches ss wp youtube
17:55:34  ^style iwcs
17:55:34  Selected style: iwcs (Irregular Webcomic scripts)
17:55:37  Ngevd: SEE WHAT I DID FOR YOU???
17:55:39  fungot: Kill Ngevd.
17:55:39  elliott: i know! i'll assemble a prize, finance minister, the new tech is like, with its execrable overburdening of the dialogue, multiple complex... is he american. but i adopted a new name, i need a screwdriver
17:59:32  Phantom__Hoover: That crank-call is at https://www.youtube.com/watch?v=vMOl_Jh8O_E
17:59:47  OMG
18:12:00 -!- tiffany has quit (Remote host closed the connection).
18:13:08  NO MY HOPES AND DREAMS: http://i.imgur.com/LxsmK.jpg
18:14:07  XD
18:14:27 -!- tiffany has joined.
18:14:47  I wonder if XP is ubiquitous enough to make Bliss have iconic status yet.
18:16:35  Well, if /I/ can recognise it...
18:17:25  "According to O'Rear, the photograph was not digitally enhanced or manipulated in any way."
18:17:31  Doooooon't belieeeeeeeve youuuuuuuuuu
18:20:23  elliott: I wouldn't even hesitate to call Bliss iconic.
18:21:03  It's kind of insane to think that a fairly crappy operating system release that looks like Fisher Price out of the box is now part of our ongoing cultural heritage :P
18:21:46  is clippy iconic
18:21:48  Note to self: Relevant sprunge link in /query logs of elliott.
18:21:55  monqy: More like... BADconic........
18:22:14   Note to self: Relevant sprunge link in /query logs of elliott.
18:22:16  (This is how I do branches.)
18:22:49  monqy: No, you don't get "iconic" just by people wanting to summon death.
18:23:13  Hmm
18:23:18  `run perl 'print 0 while 1'
18:23:21  Can't open perl script "print 0 while 1": No such file or directory
18:23:22  `run perl -e 'print 0 while 1'
18:23:24  0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
18:23:32  `run cat /bin/cat
18:23:34  ​ELF...
18:23:38  `run cat /bin/ls
18:23:40  ​ELF...
18:23:46  What's up with that
18:23:48  Oh, nul bytes
18:23:52  I guess
18:24:10  Yaeh
18:24:12  Yeah
18:24:23  house elf
18:24:38  magic numbers are weird
18:25:26  TOTALMAGIC\0mimetype-goes-here\0
18:25:28  :P
18:29:16  Gregor:
18:29:17  2. 1.9.1: guessmime, revert behavior restored
18:29:17  revert now requires a specific revision to revert a merge, restoring the pre-1.9 behavior
18:29:17  hgweb now returns raw files as type application/binary for security, see the web.guessmime config setting to restore the old behavior
18:29:34  Gregor: Set web.guessmime = True on the HackEgo fs repository, and voila
18:29:42  Pastes no longer make me want to die
18:29:51  Gregor: Although...
18:29:52  [[
18:29:54  Before: hgweb made it possible to download file content with a content type
18:29:54  detected from the file extension. It would serve .html files as text/html and
18:29:54  could thus cause XSS vulnerabilities if the web site had any kind of session
18:29:54  authorization and the repository content wasn't fully trusted.
18:29:54  ]]
18:30:05  So, uhh... your call :P
18:31:42 -!- Taneb has joined.
18:34:47 -!- Ngevd has quit (Ping timeout: 258 seconds).
18:35:52 -!- hagb4rd has quit (Quit: hagb4rd).
18:37:40  elliott: Security shmeshmurity.
18:37:40  Gregor: You have 9 new messages. '/msg lambdabot @messages' to read them.
18:37:42  elliott: Fixt.
18:38:07  Gregor: Those messages detail a further improvement to the Transactional HackEgo design I thought of :P
18:38:15  Which is clearly not premature, seeing as you haven't even tested version 1 yet.
18:38:57  I'm not sure how that would work thru UMLBox.
18:39:04  http://codu.org/projects/hackbot/fshg/index.cgi/rev/7a6bfed30dd8 It didn't work :(
18:39:14  Gregor: strace would be run inside the jail, inside the limits
18:40:20  `run echo 'lolhtml>' | paste
18:40:21  http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/paste/paste.29287
18:40:27  Hm
18:40:30  Still text.
18:40:35  Well that's OHHHH extension.
18:40:40  Yeah, maybe it wants the HTML file or something.
18:40:41  `run echo 'lolhtml>' > foo.html && url foo.html
18:40:43  Yeah extension.
18:40:44  http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/foo.html
18:40:49  Yup
18:40:50  Neat
18:40:53  Gregor: BTW you can fix it trivially
18:41:14  Gregor: Patch hg, grep /guessmime/, add a check for text/html that bails out (I saw a diff that added it while looking that up :P)
18:41:17  That's kinda ugly though.
18:41:28  At least you don't have to modify global hg, just the hgweb.
18:41:41  `rm foo.html
18:41:43  No output.
18:43:11  Gregor: Anyway, unless codu.org has sensitive cookies it doesn't matter much.
18:43:26  Security is for pussies.
18:44:10  Gregor: But TRANSACTIONS are for ACTIONS!
18:44:26  If that thing runs first time I will literally ascend to the rank of Coder God btw
18:45:04 -!- zzo38 has joined.
18:45:29  Does $x^2 + y^3 = z^4$ have solutions in prime numbers?
18:46:50  :t (-<<)
18:46:50  Mathematica says: no
18:46:51  Not in scope: `-<<'
18:47:00  :t (>>-)
18:47:01  forall (m :: * -> *) a b. (MonadLogic m) => m a -> (a -> m b) -> m b
18:50:05 -!- Taneb|Hovercraft has joined.
18:50:28  Do you know a proof that there are no solutions?
18:51:20  Mathematica said so
18:52:08  That isn't a very good proof.
18:52:46  Cite the source code to Mathematica :-)
18:53:25  zzo38: x^2 should odd, y^3 should be odd, y^4 should be odd. the addition of two odd numbers produces an even number.
18:53:28  er
18:53:31  In[1]:= Reduce[x^2+y^3==z^4&&PrimeQ[x],{x,y,z},Integers]
18:53:31  Out[1]= False
18:53:32  z^4
18:53:32  Do you even have the source code to Mathematica?
18:53:41  That's close enough
18:54:02  CakeProphet: Yes that is good.
18:54:06  One of them could be 2
18:54:20 -!- Taneb has quit (Ping timeout: 258 seconds).
18:54:26  er
18:54:27  yes
18:54:31  there's always that.
18:54:46  then just special case 2
18:54:48  O, yes, that
18:54:55  Deewiant: You need FullReduce (I think that's the one that does FLT)
18:55:01  Can you try the case where it is 2?
18:55:13  elliott: No such thing
18:55:32  Deewiant: SuperReduce? MegaReduce? It's something like that :P
18:55:49  2: the oddest prime of all.
18:55:50  elliott: Are you thinking of FullSimplify?
18:55:55  Deewiant: Possibly
18:57:36  It's just a better simplifier, I'm pretty sure Reduce does the most that anything does here
18:57:37  If z=2 then it will be adding to 16 and you can try the cases. But what happened if x=2 or if y=2? Then it is about powers of 2
18:58:42  SUBTRACTION IS ANNOYING
18:58:49  if x=2, y>z
19:02:49  if y=2, x^2>z
19:04:22  `echo TRANJSNAKTACTIONALS!
19:04:24  TRANJSNAKTACTIONALS!
19:07:06 -!- sebbu3 has joined.
19:07:06 -!- sebbu3 has quit (Changing host).
19:07:06 -!- sebbu3 has joined.
19:08:52 -!- sebbu2 has quit (Ping timeout: 260 seconds).
19:10:08 -!- Taneb|Hovercraft has quit (Ping timeout: 240 seconds).
19:11:04  Gregor: Huh, I didn't know hg hardlinked .hg on clone
19:11:10  I wonder whytf HackEgo is so slow then...
19:11:29  1) It has to copy the actual working directory. 2) Sandboxing lol
19:12:28  (1) Well, yeah, the only way to avoid that is my revised design, which I will refer to as Transactional Headache. (2) Mehhh, UMLBox isn't that slow?
19:12:58  I think the revised design will be pretty superfast, since it's literally zero-copy, but I guess it should wait until transactions are an actual thing first :P
19:13:05  Also it could interact terribly with flock and all that crap, but who cares just don't use thos.
19:13:06  those.
19:15:37 -!- sebbu has joined.
19:15:37 -!- sebbu has quit (Changing host).
19:15:37 -!- sebbu has joined.
19:15:41  zzo38: the cases where you have one x or y = 2 and z = 2 are false because even + odd != even
19:17:05  also 2 + 2 != odd  so that's 3 out of 7 cases where you have a 2 somewhere.
19:17:40  parity is perhaps not the most elegant proof here. :p
19:17:59 -!- sebbu3 has quit (Read error: Connection reset by peer).
19:19:04  > 2^2 + 2^3 == 2^4
19:19:06    False
19:19:11  oh look that's 4 out of 7 now.
19:23:46  that leaves... 4 + odd^3 = odd^4; odd^2 + 8 = odd^4; and odd^2 + odd^3 = 16
19:23:48 -!- hagb4rd has joined.
19:24:27  best proof method ever.
19:24:39  This is like the proof of the four-colour theorem. Or was it the Kepler conjecture.
19:24:51  Just keep brute-forcing special cases until there aren't any cases left.
19:27:05 -!- MSleep has joined.
19:27:22  That's 4-colour.
19:27:43  elliott: I'm all about those special cases.
19:27:56  monqy: THE WORLD IS TOTALLY FULL OF SPECIAL CASES.
19:28:17  even in methamethics
19:28:27  this is why i hate the world
19:29:06  monqy: if you take all of the cases
19:29:12  usually the special cases are larger in number.
19:29:15  than the general cases.
19:29:19  ergo, something significant.
19:29:33 -!- sebbu2 has joined.
19:29:33 -!- sebbu2 has quit (Changing host).
19:29:33 -!- sebbu2 has joined.
19:30:05  hate
19:30:37  monqy: (note: complete bullshit)
19:31:38  anyways I'm almost positive that adding 4 to the cube of a prime number will not yield the 4th power
19:31:45  but I don't really know how to express that in proof form.
19:32:24 -!- ais523 has changed nick to ais523\unfoog.
19:32:26  same with adding 8 to the square of a prime to get its 4th power.
19:32:54 -!- sebbu has quit (Ping timeout: 260 seconds).
19:33:04  > 37^2 + 8 - 37^4
19:33:04    -1872784
19:33:10  Q.E.D.
19:33:19  the odd^2 + odd^3 != 16  case can be bruteforced.
19:33:30  what are you even doing
19:33:34  monqy: MATHEMATICS
19:33:50  He's trying his hand at number theory despite barely being able to grasp calculus.
19:34:01  13:45 < zzo38> Does $x^2 + y^3 = z^4$ have solutions in prime numbers?
19:34:18  Phantom__Hoover: are you sure you're not confusing me with itidus?
19:34:25  `ps
19:34:26  `ps
19:34:26  `ps
19:34:26  `ps
19:34:26  `ps
19:34:26  `ps
19:34:28  `ps
19:34:30  `ps
19:34:31  elliott: ps
19:34:32  `ps
19:34:32  ps
19:34:34  `ps
19:34:36  sorry, had to cause a clash
19:34:36  CakeProphet: hi
19:34:38  elliott: hi
19:34:38  PID TTY          TIME CMD \   272 ?        00:00:00 init \   274 ?        00:00:00 sh \   276 ?        00:00:00 ps \   277 ?        00:00:00 cat
19:34:38  PID TTY          TIME CMD \   272 ?        00:00:00 init \   274 ?        00:00:00 sh \   276 ?        00:00:00 ps \   277 ?        00:00:00 cat
19:34:43  HackEgo: hi
19:34:46  oh RIHte Ghte umlboxe
19:34:46  PID TTY          TIME CMD \   272 ?        00:00:00 init \   274 ?        00:00:00 sh \   276 ?        00:00:00 ps \   277 ?        00:00:00 cat
19:34:50  PID TTY          TIME CMD \   272 ?        00:00:00 init \   274 ?        00:00:00 sh \   276 ?        00:00:00 ps \   277 ?        00:00:00 cat
19:35:00  oop. se
19:35:00  cat?
19:35:03  PID TTY          TIME CMD \   272 ?        00:00:00 init \   274 ?        00:00:00 sh \   276 ?        00:00:00 ps \   277 ?        00:00:00 cat
19:35:04  PID TTY          TIME CMD \   272 ?        00:00:00 init \   274 ?        00:00:00 sh \   276 ?        00:00:00 ps \   277 ?        00:00:00 cat
19:35:04  PID TTY          TIME CMD \   272 ?        00:00:00 init \   274 ?        00:00:00 sh \   276 ?        00:00:00 ps \   277 ?        00:00:00 cat
19:35:04  PID TTY          TIME CMD \   272 ?        00:00:00 init \   274 ?        00:00:00 sh \   276 ?        00:00:00 ps \   277 ?        00:00:00 cat
19:35:04  PID TTY          TIME CMD \   272 ?        00:00:00 init \   274 ?        00:00:00 sh \   276 ?        00:00:00 ps \   277 ?        00:00:00 cat
19:35:04  PID TTY          TIME CMD \   272 ?        00:00:00 init \   274 ?        00:00:00 sh \   276 ?        00:00:00 ps \   277 ?        00:00:00 cat
19:35:19  ais523\unfoog: good question
19:35:22  elliott: get a room.
19:35:43  ais523\unfoog: hmm, there isn't any cat executed
19:35:46  in the current sourec
19:35:50  so I'm not sure what's up there
19:36:08  `run ps
19:36:10  PID TTY          TIME CMD \   272 ?        00:00:00 init \   274 ?        00:00:00 sh \   276 ?        00:00:00 ps \   277 ?        00:00:00 cat
19:36:36  I was wondering ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff
19:36:49  vggggggggggggggggggrrrrrrfffrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrr
19:37:01  *if that would make a difference
19:37:25  I was wondering that ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff
19:37:27  vggggggggggggggggggrrrrrrfffrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrr too.
19:37:31  s/that //
19:37:32  Do you know about Zen and do you know about motorcycle maintenance?
19:38:03  Gregor: Does it spam you with mail every time I add new commits to that pull request?
19:38:53  zzo38: are they one and the same
19:39:21  Do I need to do anything with the .cabal file or .lhs file to make the document link work on the webpage?
19:39:47  elliott: Doesn't seem to.
19:40:00  Gregor: Darn-- I mean oh good.
19:40:01  let rec zeros = 0 :: zeros
19:40:05  > fix (0:)
19:40:06  umm, that actually works in OCaml?
19:40:06    [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,...
19:40:11  ais523\unfoog: I doubt it...
19:40:11  I know it works in Haskell
19:40:17  monqy: Phantom__Hoover is the primary detractor of my contributions to the field of parity relations between powers of primes in infinite cyclic abelian groups and commutative monoids
19:40:20  zzo38: What link
19:40:21  but OCaml is strict, and yet I've just seen it in someone else's OCaml code
19:40:28  ais523\unfoog: A student's?
19:40:33  no, on a blog
19:40:37  Link?
19:40:44  http://alaska-kamtchatka.blogspot.com/2011/11/modular-semantics-for-brainfuck.html
19:41:08  elliott: The Hackage webpage for a Haskell library.
19:41:14  http://old.nabble.com/lazy-infinite-lists-td22922684.html
19:41:18  ais523\unfoog: I doubt it's valid
19:41:25  zzo38: What's a "document link"
19:41:29  # let rec zeros = 0 :: zeros in match zeros with | a::b::t -> (a,b) | _ -> (9,9) ;;
19:41:30  - : int * int = (0, 0)
19:41:33  err, what?
19:41:47  Many packages you can select the name of the module to view the list of functions and types in them. But mine doesn't work, and a few other that aren't mine also don't work.
19:42:03  (the second case is to avoid the warning for not being exhaustive that'd have made it harder to copy/paste otherwise)
19:42:05  ais523\unfoog: I have a solution to your confusion! Don't use OCaml.
19:42:12  but I like OCaml
19:42:20  Stop liking it, then :)
19:42:29  CakeProphet: oh no
19:42:31  It IS a workable solution, you have to admit.;
19:42:34  s/;//
19:42:42  # let rec zeros = 0 :: zeros ;;
19:42:43  elliott: Did you understand what I meant now?
19:42:44  val zeros : int list =
19:42:50  then it prints about 12 to 15 lines of zeros and a ...
19:43:01  zzo38: I already told you it takes up to 6 hours for Haddock documentation to be generated
19:43:15  It has already been more than 6 hours since I send that package.
19:43:18  and it'll fail if it doesn't build on the hackage machine (a build failure log will be linked from the package page)
19:43:28  zzo38: since you sent the latest version? anyway, it has to rebuild the documentation for every single package
19:43:36  so it almost certainly takes at least an hour to run, and probably much longer
19:43:37  I don't see any build failure log either
19:43:42  give it a day or so and check again
19:44:18  But it works on my computer!
19:44:39  So why doesn't it work on their computer?
19:45:11  zzo38: did I say it didn't?
19:45:20  like I said, every 6 hours it rebuilds the documentation of every single package
19:45:24  there are a few thousand
19:45:29  so it will take a while for it to reach your package
19:46:16  # type 'a l = Cons of ('a * 'a l) | Nil ;;
19:46:17  type 'a l = Cons of ('a * 'a l) | Nil
19:46:18  # let rec zeros = Cons (0, zeros) ;;
19:46:20  val zeros : int l =
19:46:20  O, that is how it works? Can't they fix it so that it only rebuilds when it needs to do so, allowing their computer to run more efficiently?
19:46:28  elliott: and then it outputs the start of the structure
19:46:40  so I /guess/ type constructors in OCaml are lazy even if the rest of the language isn't, or something like that
19:46:54  I was wondering if it was specific to lists, but it seems not to be, as even defining lists by hand it works
19:46:57  zzo38: there's no way to tell what needs to be rebuilt without reverse dependency information, which hackage 1.0 doesn't generate
19:47:04  ais523\unfoog: I bet let rec just adds an implicit ()
19:47:12  and, umm, lets it type like that anyway
19:47:20  and inserts () at non-RHS call points
19:47:22  elliott: then executing it would take forever
19:47:23  or
19:47:24  something
19:47:26  ais523\unfoog: no
19:47:31  it doesn't insert the () on the RHS of the let rec
19:47:35  it just unsafeCoerces it :P
19:47:38  totally plausible theory!
19:47:38  elliott: that /is/ being lazy
19:47:54  you've just basically defined lazy lambda
19:47:55  ais523\unfoog: except not type safe
19:47:59  and impossible
19:48:27  .
19:48:38  # let rec test = test ;;
19:48:40  Error: This kind of expression is not allowed as right-hand side of `let rec'
19:48:42  Another possibility would be to change the orders so that packages that have neither documentation nor build fail logs will be given priority. And then their priority is removed after it tries once, whether it fail or succeed.
19:48:48  OK, that just made me even more confused
19:49:03  Sgeo|web: hi
19:49:13  # let rec test () = test () ;;
19:49:14  val test : unit -> 'a = 
19:49:15  Hi
19:49:17  zzo38: or they could just rewrite hackage to not suck, which is what hackage 2.0 is :P
19:49:30  i dunno when they're planning to finish it though, i guess next year
19:49:36  unit -> 'a is /always/ bottom, right (exception or infinite loop)?
19:49:48  ais523\unfoog: it's not always bottom
19:49:50  Is ais523\unfoog learning OCaml?
19:49:53  it's either bottom or const bottom
19:50:02  oh, hmm
19:50:05  it can't be const bottom
19:50:06  ocaml doesn't really have bottoms like that
19:50:10  ais523\unfoog: yes it can
19:50:12  it can't be bottom, though
19:50:13  because 'a might not be a function type
19:50:21  ais523\unfoog: your definition of "it" is stupid
19:50:27  right, by "it" I meant the return value
19:50:30  you're quoting a type, and then using "it" to mean a value of a different type P:
19:50:31 -!- sebbu has joined.
19:50:31  :P
19:50:33 -!- sebbu has quit (Changing host).
19:50:33 -!- sebbu has joined.
19:50:37  which I guess makes some sense in a strict language
19:50:45  but definitely not in a lazy one, since you have proper _|_s
19:50:47  Sgeo|web: he already knows ocaml
19:51:00  Sgeo|web: I'm /teaching/ OCaml
19:51:08  but atm it's acting suspiciously like Haskell when it shouldn't be
19:51:11  so I'm experimenting
19:51:21  my fav. ocaml feature is -rectypes
19:51:29  what does that do?
19:51:34  allows recursive types
19:51:53  # let rec zeros() = 0 :: zeros() in zeros() ;;
19:51:55  Stack overflow during evaluation (looping recursion?).
19:52:13  conclusion: let rec is specialcased to lazify recursion when it's defining a non-function type
19:52:17  Maybe they should still have priorities though
19:52:31  zzo38: hackagedb 2.0 already works, so i doubt anyone wants to add new things to 1.0
19:52:31  that's consistent with all the experiments so far, I think
19:52:38  ais523\unfoog: but it /can't/, they'd have to build their runtime representation around that
19:52:45  ais523\unfoog: and incur all the costs of laziness at every call site without the benefits
19:53:20 -!- sebbu2 has quit (Ping timeout: 240 seconds).
19:53:28  elliott: well, the logical representation of an immutable infinite repeating lazy list is to loop the list round to point at /itself/
19:53:39  and I know cyclic structures can exist in OCaml
19:53:44  perhaps that's the syntax for constructing them
19:54:09  ais523\unfoog: a cyclic structure makes a really awful brainfuck tape, if you mutate it
19:54:20  right, indeed
19:54:33  but the article there is using lists, not arrays
19:54:35  Did Ocaml not have polymorphic recursion or was that only SML?
19:54:42  and the lists contain integers, not integer references
19:54:46  so it's immutable by definition
19:54:51  Deewiant: "did"?
19:54:51  @src cycle
19:54:51  cycle [] = undefined
19:54:51  cycle xs = xs' where xs' = xs ++ xs'
19:55:00  also, what do you mean by polymorphic recursion?
19:55:14  you can certainly write polymorphic recursive functions, but that's so obvious I doubt it's what you mean
19:56:02  ais523\unfoog: OCaml still can't do concurrency at all, right?
19:56:02  ais523\unfoog: Hmm, I was going to explain my usage of "did" instead of "does" but now I wonder if it's not a Finglishism
19:56:08 * elliott has prepared his laugh track.
19:56:14  elliott: it has a -threads param to the compiler
19:56:23  Deewiant: It seems OK to me, if you are referring to past experience with OCaml
19:56:27  that gives it a threading library, either VM-level or native-thread-level
19:56:48  ais523\unfoog: Hmm, a quick google strongly suggested they were purely green threads
19:56:49  Deewiant: to me you were implying OCaml no longer existed
19:57:01  Oh, hmm
19:57:02  heh
19:57:07  ais523\unfoog: Is it native threads but with a big gigantic lock on everything
19:57:17  Anyway hang on, I'm devising a Haskell example
19:57:17  elliott: perhaps; I wrote a build system mentioning it recently; but it was for someone else's code
19:57:27  Googling strongly suggests that it is
19:57:30  So, time to cash in
19:57:32 * elliott [laugh track]
19:57:58  elliott: how dare you ridicule a sacred American custom.
19:58:09  you have greatly disrespected my people.
19:58:50  --- &1
19:58:52  - *1
19:58:57  wait, that's not what I meant
19:59:31  --- &1
19:59:32  head: 0
19:59:34  tail: *1
19:59:35  there we go
19:59:40  YAML?
19:59:42  I suspect /that/'s what zeroes is, in OCAML
19:59:43  elliott: yep
19:59:45  *OCaml
19:59:55  ais523\unfoog: use common lisp notation, sheesh :P
19:59:57  turns out YAML can represent cyclic structures
20:00:00  #1#=(0 . #1#)
20:00:01  and I know
20:00:07  YAML is kind of ridiculously overengineered.
20:00:19  ais523\unfoog: Okay, this, basically:
20:00:20  zipWithFlipping :: (a -> b -> c) -> [a] -> [b] -> [c]
20:00:20  zipWithFlipping f (a:as) (b:bs) = f a b : zipWithFlipping (flip f) bs as
20:00:20  zipWithFlipping _ _ _ = []
20:00:23  ais523\unfoog: incidentally, I've had more @ Thoughts(tm) since a prototype design seemed to come together, but they've mostly been of the form "wow, X would be so much ridiculously faster in @" or "wow, X would be so much ridiculously easier to program in @"
20:00:44  elliott: I have Anarchy Thoughts along those lines, or occasionally Cyclexa Thoughts
20:01:06  the two languages actually have some similarities
20:01:13  amazingly
20:01:40  Deewiant: f _ _ = ([], []); f (x:xs) (y:ys) = (x:xs', y:ys') where (xs',ys') = f ys xs?
20:01:45  (And then zipWith on that)
20:02:28  Umm, I'm not sure what you're asking
20:02:32  zipWithFlipping = zipWith
20:02:48  Oh, so it is
20:02:52  I missed the double-flip
20:03:00  Right
20:03:04  ais523\unfoog: The most recent one has been that, AFAICT, a naive web server in @ would beat the crap out of just about any other httpd that doesn't run in a kernel/on bare metal or on an FPGA or similar ridiculousness
20:03:26  Note that without the type signature, the inferred type of zipWithFlipping would be (a -> a -> b) -> [a] -> [a] -> [b]
20:03:28  now I'm thinking about what an FPGA web server would be like
20:03:31  ais523\unfoog: (thinking inspired by seeing an article in the Monad.Reader where nginx's performance was beat with fairly simple Haskell)
20:03:34  and it's been done
20:03:58  it'd be great at static files, although if there were more simultaneous connections than it expected it'd have trouble
20:04:06  And I'm almost certain that SML doesn't like this, but I'm not sure whether OCaml does
20:04:07 -!- Darth_Cliche has joined.
20:04:41  ais523\unfoog: But yeah, the article basically said that saving one syscall per request constituted a relevant, real time saving, and any added overhead of CPU time in @ will be dwarfed by syscall time in the Unix version and IO time in general
20:04:56  So, ha, take that operating systems
20:05:17  elliott: which syscall was it, in the Haskell case?
20:05:21  I doubt I'd beat TUX though... unless I had a really fancy IO subsystem
20:05:32  ais523\unfoog: oh, it was just talking in general, but lemme dig up the example
20:06:42  ais523\unfoog: "Warp uses the recv system call to receive an HTTP request and the writev system
20:06:42  call to send an HTTP header. When sending an HTTP body based on a file, it
20:06:42  uses the sendfile package which unnecessarily issues the lseek and stat system
20:06:42  calls in addition to sendfile. While one could believe that the sendfile system call
20:06:42  is fast thanks to its zero-copying approach, the package is actually much slower
20:06:43  than we expected. We implemented the simple-sendfile package which does not
20:06:45  use lseek and stat. The system calls that the package uses are only open, sendfile,
20:06:47  and close. Since sockets are marked non-blocking, sendfile returns EAGAIN if the
20:06:49  size of a file is large. In this case, the simple-sendfile package issues sendfile
20:06:51  again without lseek to send the rest of the file."
20:07:01 -!- ais523\unfoog has quit.
20:07:06  nice timing
20:07:11 -!- Madoka-Kaname has left ("Hug~♪").
20:07:12 -!- Madoka-Kaname has joined.
20:07:40 -!- ais523\unfoog has joined.
20:07:52  ais523\unfoog: See logs :P
20:07:55  wow that was confusing
20:08:06  ais523\unfoog: There were no numbers specifically for that change, but replacing the time library with their specialised http-date gave a 20x speedup in the date code itself, and combined with the simple-sendfile switch brought it from 4,229 queries/s to 22,713 queries/s; I think that's probably mostly due to the time stuff, though
20:08:19  (Again, see logs for context :P)
20:09:47  elliott: heh, the stat/seek was what lead to the problem
20:10:08 -!- zzo38 has left.
20:10:17  ais523\unfoog: yep; I'm not sure it's necessarily a disk IO thing, though
20:10:26  if the request timing was on the same file
20:10:28  since it'd be in cache
20:10:56 -!- Phantom__Hoover has quit (Ping timeout: 240 seconds).
20:11:25 -!- Ngevd has joined.
20:13:27 -!- Phantom__Hoover has joined.
20:13:42  ais523\unfoog: hmm, I need to figure out how to optimise referencing a large bytestring that isn't in RAM and sending it to a socket
20:13:58  obviously it'll already be done in chunks, so the behaviour will be vaguely reasonable
20:14:06  but I could do fancy DMAy scatter-gathery nonsense, perhaps
20:14:38  http://www.cs.bris.ac.uk/Teaching/Resources/COMS30122/haskell/calc/index.html
20:14:46  this is actually a nice hand-written parser actually.
20:14:55  (actally)
20:15:38  MSPA update for all who care
20:15:50  Unless you already know
20:15:57  Starts with Jane: Examine Fetch Modus
20:16:05  though I would have used operators for the binary Rule constructors, and State for the parse function that returns ([Token], [Tree])
20:17:24  actually no a tuple is fine.
20:19:26 -!- zzo38 has joined.
20:23:03  CakeProphet: Writing a parser "by hand" with tuples is kinda stupid, you're not more hardcore for forcing yourself to rewrite the (>>=) plumbing in every single rule
20:24:13  elliott: right, I was simply saying for a handwritten parser it's very clearly written.
20:24:26  Sure
20:25:13  I have written parsers with Parsec and (>>=) is not needed often.
20:27:14  the <$> <* <*> *> <|> plumbing
20:27:51  Yes, <$> <* <*> *> <|> seem much more useful in parsers. Sometimes even <$ as well
20:28:23  I use <$> and <*> with monads often.
20:28:53  <$> is useful with any monads (even any functors) in general.
20:33:52  The Data.Monoid.Plus package can make the probilities of sum of dice by:  runWriterT . monoidicMap getProduct . probNorm $ liftA2 (+) dice dice   where   dice = uniform [1..6]   and it can be modified to work with loaded dice, too.
20:34:24  And then there are the "many" and "some" functions useful with parsers too
20:35:54 -!- sebbu has quit (Read error: Connection reset by peer).
20:36:16 -!- sebbu has joined.
20:36:16 -!- sebbu has quit (Changing host).
20:36:16 -!- sebbu has joined.
20:42:19  elliott, iirc you wanted to know more about dragons in Skyrim?
20:42:35  I battled quite a few now, I could tell you if you want
20:43:07  Yessss tell me all about the dragons and also answer which GPU you have.
20:43:21 -!- Sgeo|chromcrash has joined.
20:43:39 -!- oerjan has joined.
20:44:05  elliott, to begin with there are quite a few animation bugs. For example, dragons tend to crash land when they get like below ~10% health. This works fine on flat terrain. It looks quite weird on a slope. It looks absolutely silly on a set of stairs.
20:44:12  lots of animation bugs there
20:44:43  zzo38 was saying something relevant to my interests
20:44:47  :/
20:44:55  elliott, other than that, they would be quite hard to hit for significant damage in the sky without frost or fire spells (depending on type of dragon)
20:45:02 -!- Sgeo|web has quit (Ping timeout: 265 seconds).
20:45:06  elliott, I just can't see a non-magic user handling this at all
20:45:22  arrows don't seem to do much damage
20:45:38  I hear they're pretty easy to battle
20:45:42  Maybe you just suck :P
20:45:47  elliott, yep, with magic they are easy
20:45:56  elliott, on average difficulty
20:46:00  Sgeo|chromcrash: Please be more specific.
20:46:16  elliott, further training in bow related skills might make it easier for an archer
20:46:20  zzo38: Something about probability
20:46:37  Probability is among your interests?
20:46:39  What about probability?
20:47:00  elliott, but primarily non-ranged weapon users will run into some issues definitely
20:47:17  Phantom__Hoover: Someone wants me to implement MCMC in Haskell. I think I know Haskell better than him, but I'm clueless about MCMC
20:47:48  What does MCMC means?
20:47:53  Minecraftminecraft.
20:47:57  Monte Carlo Markov Chain
20:48:02  elliott, other than that it is quite fun. Of course, skyrim has ragdoll physics... I think that is what causes most of the brokenness with the crash landing
20:48:03  Or is it the other way around
20:48:06  Sgeo|chromcrash does things because people tell him to.
20:48:15  Vorpal: GGGGGGGPPPPPPUUUUU
20:48:52  elliott, Radeon HD 6850, 1 GB GDDR5 (or 1.5? forgot...)
20:49:19  Oh, Radeon. (It occurs to me that maybe my Linux-oriented anti-ATI bias is outdated.)
20:49:32  elliott, well, nvidia sucks quite a bit nowdays too
20:49:36  for newer GPUs
20:49:46  they suck about the same amount nowdays
20:49:48  nVidia sucks with Linux now? Boo
20:49:52  Vorpal: Sure, but at least it's not Catalyst.
20:49:55  Sgeo|chromcrash, well, for newer cards
20:50:14  elliott, true. Still the open drivers for radeon are way ahead of the ones for nvidia
20:50:22  Yeah, but nobody cares about that :P
20:50:26  not quite there yet for my card model
20:50:28  Is it necessary to fight the dragon to complete the game?
20:50:47  zzo38, plural I believe
20:51:03  and yes so far I needed to fight two of them to complete main story missions
20:51:16  OK
20:51:29  unless I completely missed out on something, I would say "yes, you have to do that"
20:51:29   you can certainly write polymorphic recursive functions, but that's so obvious I doubt it's what you mean
20:51:55  polymorphic recursion in haskell refers to a function directly or indirectly calling itself with a different type
20:52:18  elliott, anyway the graphical quality in the game on the ultra setting is "meh". Better than oblivion yes. However it was clearly made with consoles in mind. Which have somewhat outdated hardware by now.
20:52:40  From what I've seen, it has the advantage over Oblivion of not being hideous
20:52:45  elliott, if you want the best graphics on a PC currently in an RPG it is witcher 2 that you should play
20:52:53  it's useful which such datastructures as autobalanced trees: data Tree a = Leaf a | Tree (a,a)
20:52:58  don't expect to do that on ultra though
20:54:20  elliott, anyway I do hope dragons are leveled. Or they are going to be a fucking joke when I'm at a higher level.
20:54:38  hmm, can you fit an atx mobo into an eatx case?
20:54:42  elliott, so far I have seen ones breathing fire and ones breathing ice.
20:54:54  dragons breathing dragons
20:55:04  elliott, /pretty/ sure atx is larger than eatx
20:55:11  no, eatx is extended atx?
20:55:13  maybe in a VERY big eatx case?
20:55:16  oh
20:55:18  yeah this thing fits atx
20:55:22  which one is the smaller one?
20:55:23 -!- MSleep has changed nick to MDude.
20:55:30  elliott, also why do you want an eatx case?
20:55:51  elliott, I assume you are building yourself a new computer?
20:56:05  zzo38: What package does that probability stuff come from, if any?
20:56:05  Right now I'm helping Phantom__Hoover by way of shoving a list of parts at him; consider it practice.
20:58:18 -!- Ngevd has quit (Read error: Connection reset by peer).
20:58:40  HOW CAN A CASE COST TWENTY POUNDS MORE THAN A CPU
20:58:56  elliott, btw recommended is quad core or better. and you want a strong CPU. When playing I see the all the cores (including the HT ones) pretty loaded (70-100) on a 3.4 GHz quad core i7 so...
20:59:31  Phantom__Hoover, heh
20:59:37  Phantom__Hoover, what sort of case is that?
20:59:56  One born of elliott failing to understand the site's list system.
21:00:18  I'm more used to picking parts from sites I can't actually buy things from.
21:00:28  Vorpal: Uh, I read that it's crap at threading (= 2 threads only).
21:01:20  Better than DF.
21:01:43  Sgeo|chromcrash: There are other Haskell packages having probability stuff, which I don't know, but my package "monoidplus" has the things I described.
21:01:50  elliott, strange then. Or I guess process explorer shouldn't be trusted
21:01:57  (no I haven't even tried to use wine for it)
21:02:14  Vorpal: But yeah, I'll go for either an i7 or a Phenom II x6, most likely
21:02:19  Probably i7
21:02:22  So I should be fine on that front
21:02:31  3.4 GHz is ridiculous though, you're just wasting power :P
21:02:39  zzo38: The docs aren't showing up on Hackage
21:02:50  elliott, well they didn't have a 3.3 GHz option for i7. They only have that for i5
21:02:51  elliott, unless you're playing DF.
21:02:55  elliott: Why's that wasting power
21:03:01  elliott, that i5 should be enough to play it though
21:03:13  elliott, also, dynamic clock frequency
21:03:13  Deewiant: Because CPU speed is roughly irrelevant for everything compared to cores nowadays above like 2.8 GHz?
21:03:16  Sgeo|chromcrash: I know. I think it will take a long time to do so. The same is the case for other new packages (I checked the "what's new")
21:03:25  elliott, it is awesome for df
21:03:26  :P
21:03:28  elliott: Why's that?
21:03:39  zzo38: Ah, ok
21:03:53  elliott, anyway they have a 3.5 GHz version too
21:03:57  zzo38: That's kind of annoying to deal with though, I wonder why that is
21:04:04  Deewiant: I suppose it's not really true for games which are the topic here, but even those are becoming more GPU-bound in general I'd say
21:05:05  Much CPU-using software I run doesn't utilize multiple threads, I'd say there's always call for more single-threaded speed
21:05:29  Call perhaps, but it's only going to drop
21:05:54  Sgeo|chromcrash:  http://sprunge.us/NCZE
21:06:23  ty
21:06:48  elliott, anyway isn't there that turbo mode thingy when a single core only is loaded? I wonder what the speed for that is
21:06:51  What's the difference between mpappend and mappend supposed to be?
21:07:31  Sgeo|chromcrash: "That is, it is a monoid that the original monoid is distributive over."
21:07:38  Sgeo|chromcrash: mappend distributes over mpappend
21:07:48  (For example, multiplication distributes over addition)
21:10:14 * Sgeo|chromcrash 's head spins
21:10:47  You would use   WriterT (Product x) []   for probability distributions, where x should be Double or Rational depending what you need
21:10:51  distribution: confusing stuff
21:12:52  The probability functions will still work though, as long as the monoid used is a normalizable semiring. But in general you use Product
21:13:50  (If it isn't Product, it won't act like a real probability distribution in all ways; although in some ways it can)
21:14:02 -!- Ngevd has joined.
21:14:25  :t sequence
21:14:26  forall (m :: * -> *) a. (Monad m) => [m a] -> m [a]
21:14:48  sequence is almost sort of kind of distribution.
21:15:28  (There might also be monads other than [] that can be used, although the functions I have don't work with others)
21:15:41  well, the type of sequence is like distribution
21:15:50  I suppose the program is the proof. :>
21:16:38 -!- sebbu2 has joined.
21:16:38 -!- sebbu2 has quit (Changing host).
21:16:38 -!- sebbu2 has joined.
21:17:08  Is it possible to do silly nested pattern matching like xs@(a:b:ys@(w:x:[]))?
21:17:21  In Haskell
21:17:28  That's not silly, and yes
21:17:40  Oh cool
21:17:45  That makes this soo much easier
21:18:05  Hang on, wait
21:18:08  > let f xs@(a:b:ys@(w:x:[])) = (xs,a,b,ys,w,x) in f [1,2,3,4]
21:18:09    ([1,2,3,4],1,2,[3,4],3,4)
21:18:28  Brilliant
21:18:49  @hoogle m [a] -> [m a]
21:18:49  Data.List transpose :: [[a]] -> [[a]]
21:18:49  Data.Traversable sequenceA :: (Traversable t, Applicative f) => t (f a) -> f (t a)
21:18:49  Data.List inits :: [a] -> [[a]]
21:18:54  That is EXACTLY what I wanted, Deewiant
21:18:56 -!- sebbu3 has joined.
21:18:56  Thank you
21:18:56 -!- sebbu3 has quit (Changing host).
21:18:56 -!- sebbu3 has joined.
21:19:20  @hoogle (Monad m) => m [a] -> [m a]
21:19:20 -!- sebbu has quit (Ping timeout: 240 seconds).
21:19:20  Data.List transpose :: [[a]] -> [[a]]
21:19:21  Data.Traversable sequenceA :: (Traversable t, Applicative f) => t (f a) -> f (t a)
21:19:21  Control.Monad join :: Monad m => m (m a) -> m a
21:19:23  meh
21:19:57  Wait, I didn't need it
21:20:35  CakeProphet: You can't pull it out of the monad, it'd have to be m a -> m [m a]
21:20:42  Er, m [a] -> m [m a]
21:21:04  @hoogle m [a]
21:21:04  Control.Monad.Trans.List runListT :: ListT m a -> m [a]
21:21:04  Control.Monad.List runListT :: ListT a -> m [a]
21:21:04  Control.Applicative many :: Alternative f => f a -> f [a]
21:21:05  er
21:21:08  @hoogle m [a] -> m [m a]
21:21:09  Data.List transpose :: [[a]] -> [[a]]
21:21:09  Data.Traversable sequenceA :: (Traversable t, Applicative f) => t (f a) -> f (t a)
21:21:09  Data.List inits :: [a] -> [[a]]
21:21:13  ?ty fmap (map return)
21:21:13  :(
21:21:13  forall a (m :: * -> *) (f :: * -> *). (Monad m, Functor f) => f [a] -> f [m a]
21:21:20 -!- sebbu2 has quit (Ping timeout: 240 seconds).
21:21:32  Deewiant: essentially.
21:22:00  I wonder what kind of formulas Python programs are proving.
21:22:00  ?ty liftM (map return) :: Monad m => m [a] -> m [m a]
21:22:01  forall (m :: * -> *) a. (Monad m) => m [a] -> m [m a]
21:22:30 -!- copumpkin has quit (Remote host closed the connection).
21:23:52  I wish quasiquoters nested.
21:24:42  me too :(
21:24:50  i also wish (pattern) guards nested
21:25:02  and uh
21:25:04  other things??
21:25:41  I wish nests nested.
21:26:07  and numbers.
21:26:08  and strings.
21:26:15  there is no such thing as too much nesting.
21:26:49  12(3(47))4  best nested number
21:26:54  bad number
21:27:05  s{lolololols{rofl}} best nested string
21:27:06  and I can't trust you with strings
21:27:14  oh that's a bad string
21:27:18  but not what I was expecting
21:29:04  data NChar = NCharCharLol Char | NCharStringLol String
21:29:09  type NString = [NChar]
21:29:22  need to work on the naming scehems
21:29:53  or just use Either
21:30:05  data Bad
21:30:55  just got an awesome idea for an esolang
21:31:04  an extremely difficult to parse esolang. :)
21:31:17  so, for example
21:31:21   Is it possible to do silly nested pattern matching like xs@(a:b:ys@(w:x:[]))? <-- that one can be simplified to xs@(a:b:ys@[w,x])
21:31:29  instead of a circumfix string quote token, it uses a postfix token.
21:31:35  this is a string here "
21:31:53  Where do I put modules that I want to install?
21:32:07  And unfortunately not xs@[a,b,ys@{w,x}] or something
21:33:59 -!- pkzip has joined.
21:34:49  Ziim looks like something refreshingly new
21:37:35  hmmm, also
21:39:02  control structures appear at the end of their blocks of code, allowing arbitrary delimers.
21:39:09  *delimiters
21:39:20  why does my OS keeps running this IRC program automatically ?
21:39:32  I am using Pidgin
21:39:41  as the IRC client
21:42:00  pkzip: It is because you can never escape.
21:42:07  : )
21:42:11  *MWAHAHAHAHAHAHAHAHAHAHA*
21:42:15  no escape from #esoteric ?
21:42:29  Deewiant: That's Timwi for you! Great languages, agonising IRC experience.
21:42:35  I'm not a number..
21:42:43  I'm a free software !!
21:42:50  ( prisioner quote )
21:43:04  ( well except that last bit )
21:43:05  i don't think that's a prisoner quote
21:43:13  You can Checkout any time you like, but you can never Tree? (There is no esolang called Leaf, this is bad.)
21:43:21  ~= ( not exactly )
21:43:26  pkzip: you can http://www.esolangs.org/wiki/Checkout any time you like, though...
21:43:50  TImwi?
21:44:10  Oh, an esolanger
21:44:15  `quote Publisher
21:44:17  183)  ais523, what is "MS Publisher"?   Vorpal, you don't want to know.   Vorpal: be glad that you don't know the answer   Vorpal: "horrible"
21:44:24  s/MS Publisher/Timwi/
21:44:33  Phantom__Hoover: damn you, oh wait scratch that ais523 might ban me
21:44:51 * Sgeo|chromcrash wants to know!
21:45:18  Timwi isn't nearly as bad as MS Publisher
21:45:27  few things are, to be fair
21:46:53  The Holocaust?
21:46:55  I often get banned from sexchat sites
21:47:07  darn, I got banned from all of 'em almost
21:47:20  all the ones I've been in
21:47:25  and I change IPs !!
21:47:38  even my ISP changes locations once in a while
21:47:56  It's poetry.
21:47:57  and its not the client side
21:48:18  cause I know my PC
21:49:10  hardware to software
21:49:18  internals
21:50:32  well #esoteric is only very occasionally a sexchat site.
21:50:44  so maybe you can escape a ban.
21:51:03  I've known of IRC bans since the early 90s
21:51:06  As an asexual, I don't go on sexchat sites very often
21:51:06  Less occasionally if you're gay.
21:51:31  I used to give them mostly, and rarely had to escape them
21:51:35  wait, does less occasionally mean more or less often
21:51:45  More often.
21:51:57  I often changed IPs cause I was on a dail-up
21:52:17  It costed a few cents to change IPs
21:52:37  I could even change it by a wide range
21:52:53  and started dreaming of what is now know as
21:53:10  the IP 'stealther'
21:53:27 * CakeProphet just watched [S] Cascade again
21:53:27  or the digital modem (router)
21:53:28  so good.
21:53:31  i suggest registering your nick so you can be banned consistently.
21:54:04  I don't think it was possible, oh wait they had Profiles so yea, maybe
21:54:06  so much more convenient.
21:54:27  I am being blocked by somekind of an ISP ban
21:54:40  I never bothered to check what it was exactly
21:54:54  I am used to be welcome on any digital media
21:55:02  welcomed
21:55:10  welcome pkzip
21:56:30  actually pkzip was my old nickname on the IRCs
21:56:46  I need to find a new one
21:56:54  I quite fit in here
21:57:19  I like assembly, compilers, computer languages, brainf*ck and forth
21:57:42  I used to work on virii and protection/security software
21:57:49  brainfuck!?
21:57:50  though noone heared of me
21:57:52  Get uot!
21:57:54  :P
21:57:57  to truly fit in, you must also hate brainfuck derivatives and lolcode.
21:58:10  I have a version of it which is really tiny
21:58:23  I dream of the minimal compiler at nights
21:58:37  But I want the easy of a language
21:58:55  so no 2-word or 3-word compilers for me (unless its HEX)
21:59:29  easy: sub that with ease
21:59:41  pkzip: *viruses
22:00:11  I thought of some new ideas that appeared only years later in the virii scene
22:00:21  at least 2 ideas
22:00:22  the latin virus is an uncountable noun, so any weird plural is suspect.
22:00:47  and everyone here is a language pedant.
22:01:20  you can't hate BF, just because it is popular and starting to be taken for a real language
22:01:43  I have seen good native compilers for it
22:01:51  pkzip: i didn't say hate brainfuck, i said hate brainfuck _derivatives_.  very different thing.
22:01:58  including some great ones which only lately appeared
22:02:24  I like my own derivative (I call it a traslator)
22:02:46  Its not so far apart from the original, its actually backward compatible.
22:03:04  Can someone vouch that elliott's list of parts is likely to be trustworthy?
22:03:06  pkzip: really? is it backwards compatible with characters that aren't ,.[]<>+- being comments?
22:03:09  that's part of bf
22:03:19  Phantom__Hoover: bsmntbombdood isn't here but I actually sent you the list of parts for a bomb.
22:03:38  elliott, I thought it slightly exceeded his specs.
22:03:48  Phantom__Hoover: Hm?
22:04:01 * oerjan waves at the CIA
22:04:16  elliott, didn't he have 8GB of RAM?
22:04:22  Phantom__Hoover: 16.
22:04:25  I don't remember saying that
22:04:27  Aww.
22:04:43  Phantom__Hoover: His was pre-Sandy Bridge i7, though, and ISTR Sandy Bridge was a pretty big improvement.
22:04:49  Phantom__Hoover: Also he has a really crappy passively-cooled Nvidia card.
22:04:55  Or had.
22:05:01  It uses the Char zero
22:05:13  the 0 ascii code
22:05:36  for assembly meno
22:05:45  (code)
22:05:48  entry
22:06:08  so I guess so
22:06:21  but your gonna hate the fact it has I/O
22:06:58  It uses one letter for basic INPUT and another for OUTPUT
22:07:29  why are you so pedantic about BF comments ?
22:07:49  what does this " any letter is a comment " do for BF ?
22:07:59  oh wait
22:08:13  the input is " ? " and output is " ! "
22:08:21  so its not a letter
22:08:33  Hello word :
22:08:41  world:
22:08:47  Hi World !
22:09:21  the space is ascii 0 or 255 ( I don't remember exactly )
22:10:02  Its wasn't published in esoteric
22:10:11  but I see ais523 in here ..
22:10:29  ?
22:11:05 * pkzip waves
22:11:35  guess I better not mention a brainfuck compiler which isn't 100% pure
22:11:48  (but backward compatible)
22:12:26  and I think the Output word was " . " ( as in original BF )
22:12:52  actually I know for sure its " . ", I think slowly after 12am
22:13:42  ...Space should be 32, I think
22:14:05  pkzip: a bf compiler is probably pure, or you'll have side-effects you don't want clogging things up
22:14:15  BFProg -> AsmProg or whatever seems reasonable to me
22:14:28  I use char 255 instead of space
22:14:47  (as a code word)
22:15:27  I also use char 0 but I doubt if most editors wud display it as SPACE
22:16:07  I have a blog I've written for it, for awhile it was #1 on google for BF+Forth searches
22:16:21  BF+Forth+x86
22:16:51  now its #200 (I doubt google even shows it)
22:17:03  #200 or so
22:17:57  monqy: starting to agree that idiom record notation is the best idea
22:18:42  i never said it was the best!! i don't think it would support interleaving?? but it's kind of clean maybe
22:18:50  relatively clean I mean
22:19:10  I'm thinking of creating a MACHINE-READABLE HUMAN-WRITABLE NOTATION FOR ESOTERIC PROGRAMMING LANGUAGES
22:19:16  monqy: yeah i don't know what to do about interleaving? the only good syntax I can think of is basically do notation
22:19:16  which is
22:19:21  (a) ugly and duplicatey
22:19:25  (b) not done for applicatives
22:19:28  (even though it can be done restrictedly)
22:19:31  hmmmmm
22:19:40  Because I don't like Yoob
22:21:09  elliott: one of the transcripts in the Oracle vs. Google lawsuit was allcaps for reasons I don't understand, so I made it all lowercase instead
22:21:12  but it looks pretty weird either way
22:21:15  Is there anyone on #esoteric which isn't into low-level (native) code ?
22:21:18  which do you think is more readable?
22:21:33  native code isn't /properly/ low-level ;)
22:21:37  pkzip: me
22:21:52  you don't know x86 code ?
22:22:09  i've never learned x86 assembly, no
22:22:34  oerjan: I suspect only a few people actually know all of modern x86 asm, it has weird corners that are rarely used
22:22:45 * ais523\unfoog vaguely wonders htf x86 won
22:22:49  =-O
22:22:50  i think i _may_ have written something like a hello world way back in the 80s
22:22:55  so shocked
22:23:44  but then, i'm nowhere near a professional programmer
22:23:59  ais523\unfoog: all lowercase is more readable, definitely
22:24:10  yep, I think so
22:24:15  I'm glad I had the setting handy in my browser
22:24:30  (LeetKey has been remarkably useful as a Firefox extension, even if I don't use it for its intended use at all)
22:24:30  pkzip: I can sort of write x86 asembly given a lot of time and documentation, but I don't like to, and I think it's a pretty crappy language.
22:24:42  Some other CPUs have nice assembly languages though, but I can't code in 'em.
22:24:54  I first learnt 6502 asm
22:25:02  which is not the best asm in the world, but is way better than x86's
22:25:07  Intel x86 on MacroASM was fun in the 90s and its fun now
22:25:27  Arm ASM is said to be nice
22:25:38  PDP11 is a legand
22:25:57  both are near perfect
22:26:14  or all 3
22:26:55  pkzip: Depends what your definition of fun is. Also your definition of perfect.
22:26:56  I think of something like Redcode when I think in terms of a good asm
22:26:59  i _did_ learn some 6502 asm way back
22:27:06  (even though it isn't actually an asm for an actual processor)
22:27:39  Phantom__Hoover, today was the day with the most changes on mezzawiki for about a year
22:28:08  very sketchily.  i realized years later that the manual i was reading was missing pages of instructions.
22:28:10  It was fun when watching The Jerusalem Virus do its 'thing'
22:28:23  Or 100 Years virus ( aka 4K )
22:28:35  Or writing a virii noone cud see or bypass
22:29:05  The 100 Years Virus ( more known as 4 K )
22:29:53   your honor, this is michael jacobs from morrison & foerster. mr. van nest's understanding of the allegations here isn't correct, both in terms of numerosity and in terms of role, but i have the advantage of sitting in front of a computer as we are talking. if you search on bob lee, the first hit you get is a claim as follows. it's a twitter feed.
22:29:58  pkzip: *viruses
22:30:00  linking this in case no one has yet: http://alaska-kamtchatka.blogspot.com/2011/11/modular-semantics-for-brainfuck.html
22:30:11  ^style europarl
22:30:11  Selected style: europarl (European Parliament speeches during approx. 1996-2006)
22:30:16  fungot:  your honor, this is michael jacobs from morrison & foerster.
22:30:16  elliott: mr president, i too welcome the decision by the united states
22:30:17  awesome: doing a Google Search during a court hearing and telling the judge what the hit was
22:30:31  it was a telephone hearing, so people couldn't sensibly stop him
22:30:34  ais523\unfoog: please please tell me it was Oracle who did that, while fighting Google
22:30:38  yes, it was
22:30:43  ais523\unfoog: :D
22:30:47  google should have sued :P
22:30:48  I think; it gets hard to remember which lawyer is on which side
22:32:08  quite a few people were getting confused, actually, as it was a conference telephone call
22:32:18  people had to keep saying who they were when they started talking
22:32:28  what does this lawsuit has to do with low-level programming ?
22:32:38  or BF ?
22:32:39  why do we have to talk about low-level programming?
22:32:42  or BF?
22:33:05  Cause BF is now taken as a good example of a basic compiler
22:33:13  i don't understand
22:33:23  No reason
22:33:23  this channel is for all topics of interest to those interested in esoteric computing
22:33:34  and BF is nice, but a bit atypical as esolangs go
22:33:36  it even has numbers
22:33:50 * ais523\unfoog thinks languages are typically inferior if you can't implement numbers in them from scratch
22:34:03  isn't BF the bread and butter of esolang ?
22:34:08  Nope
22:34:14  isn't it a classic ?
22:34:24  Classic, yes
22:34:26  it is indeed a classic, but there are a bunch of other languages around
22:34:29  Standard, by no means no
22:34:33  Look at Piet
22:34:35  Or Befunge
22:34:40  Or Intercal
22:34:45  Or Underload
22:34:48  BF is much more similar to mainstream languages than most esolangs
22:34:53  intercal, brainfuck, befunge, underload, unlambda
22:34:56  are the classics
22:35:05  I always use Piet because I like Piet
22:35:08  ok underload is somewhat of a modern classic :)
22:35:09  But it's not a classic
22:35:47  I like languages which are minimal and 'easy' (in the old BASIC 'nostalgic' style)
22:36:05  BF actually fits a purpose
22:36:19  hmm, can I get you interested in Forth?
22:36:32  I *LOVE* Forth !
22:36:34  it's a practical language, but an interesting one, not that similar to mainstream langs
22:36:40  I thought you would, somehow
22:36:43  I use Zen Forth
22:36:47  My own version of it
22:36:58  or revised version of it
22:37:12  A Minimal MacroASM Forth
22:37:32  I want to add Lisp(y) words to it
22:37:40 -!- hagb4rd has quit (Quit: hagb4rd).
22:37:49  And write DOS virii in it !
22:38:04  Stop saying "virii"
22:38:14 -!- pkzip has changed nick to QuickDirtyOS.
22:38:28  DOS viruses don't run all that well on modern systems
22:38:32  I dunno why they call it like that
22:38:40  on WinXP they do
22:38:43  nobody calls it virii
22:38:52  QuickDirtyOS: err, WinXP's DOS is just an emulation layer
22:38:57  I've seen it on hackers sites
22:39:00  I suppose they run about as well as Windows viruses under Wine
22:39:01  If you want to be all pedantic and latin, it'd just be viri
22:39:30  WinXP Dos is as good as Win2000 (it was also emulated under Win2000)
22:39:36  But even then you'd be wrong
22:39:43  It's like saying "oxygens"
22:40:06  I named the first virus a " Logic bomb "
22:40:11  I live in israel
22:40:17  Guess what
22:40:17  Ngevd: actually, it'd depend on where in the sentence it was
22:40:24  I was a kid back than
22:40:30  "virus" doesn't have a plural in Latin
22:40:35  "DOS virii" was the subject of that sentence, so it should be "DOS viros", I think
22:40:36  prob. was near Jerusalem
22:40:40  perhaps -es, I haven't done Latin for ages
22:40:44  cause it WAS the Jerusalem viri
22:40:57  I didn't know what to call it
22:41:09 -!- calamari has joined.
22:41:11  so for me, a "Logic bomb"
22:41:18  ais523\unfoog, you mean "object"
22:41:20  your "viri"
22:41:31  Ngevd: right, indeed
22:41:33  *object
22:41:34  the singular is definitely virus
22:41:42  We can agree on that, elliott
22:41:45  I like virus better
22:41:48  Some old IBM BIOS had ROM BASIC. I would like to have the PC BIOS with Forth.
22:41:55  elliott: even then, if you're going to be all Latiny, why wouldn't it become virum when it was the object of a sentence?
22:42:02  They did that with Linux
22:42:13  Why won't you buy a SSD
22:42:27  and put ForthOS in the Boot sector ?
22:42:33  ais523\unfoog, because, to paraphrase Henry Beard, that'd be like playing football with ice-skates on
22:42:38  ais523\unfoog: i was responding to: "your "viri""
22:42:45  we should just talk in latin.
22:42:59  Ngevd: what if you were in a skating rink at the time?
22:42:59  ita vero
22:43:04  I said I like virus better too
22:43:10  it'd probably work better with the skates than without
22:43:14  I think; I'm not an expert on this
22:43:23  I wrote viri to be 'exact'
22:43:55  What is a SSD?
22:44:02  pluralis in lingua Anglica est "viruses"
22:44:04  A Flash Disk
22:44:19  So the Flash BIOS wud load Forth from a Flash Device.
22:44:32  zzo38: a storage device; it acts much like a hard disk, but is based on flash memory, rather than mechanical platters and magnetism
22:44:33  `echo AM I TRANSACTIONAL YET?!
22:44:35  AM I TRANSACTIONAL YET?!
22:44:36  U heard of the LinuxBIOS btw ?
22:44:39 -!- aloril has quit (Ping timeout: 240 seconds).
22:44:43  you mean coreboot?
22:44:52  I have heard of the LinuxBIOS/Coreboot
22:44:55  yea
22:45:06  But as far as I know it is not a proper PC BIOS
22:45:08   If you want to be all pedantic and latin, it'd just be viri <-- it's dubious to assume this as the word is somewhat irregular: it's a neuter word in -us.
22:45:09  it doesn't support many motherboards to my knowledge.
22:45:22  Linux is like the most quirky of all Forths, it has its own OS
22:45:39  it's also not a forth
22:45:47  *+ of 2nd declination
22:45:52  bash can be turned into one REAL fast
22:46:02  or any of the shells
22:46:03  so can x86
22:46:04  Can we pretend it's in 4th to make our lives easier
22:46:09  does that make assembly a forth? :P
22:46:18  yea
22:46:29  assembly and forth mix in my dreams
22:46:32  also on my PC
22:46:42  `addquote  Linux is like the most quirky of all Forths, it has its own OS
22:46:43  I use forth words in MacroASM
22:46:44  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: /hackenv/bin/addquote: Permission denied \ /home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: /hackenv/bin/addquote: cannot execute: Permission denied
22:46:54  err, is that /meant/ to happen?
22:46:57  yes
22:47:03  `quote
22:47:05  560)  I think it's fizzie against everyone atm   AND EVERYONE IS WINNING   EXCEPT FIZZIE
22:47:18  someone readonlied the quotes file?
22:47:31  no, -xed addquote
22:47:38  `run chmod a+x /hackenv/bin/addquote
22:47:40  No output.
22:47:43  `addquote  Linux is like the most quirky of all Forths, it has its own OS
22:47:45  No output.
22:47:51  uh oh
22:47:52  umm
22:47:53  `quote Forth
22:47:55  715)  Linux is like the most quirky of all Forths, it has its own OS
22:47:58  ais523\unfoog: please don't try patching things up when it's broken
22:47:58  `help
22:48:00  Runs arbitrary code in GNU/Linux. Type "`", or "`run " for full shell commands. "`fetch " downloads files. Files saved to $PWD are persistent, and $PWD/bin is in $PATH. $PWD is a mercurial repository, "`revert " can be used to revert to a revision. See http://codu.org/projects/hackbot/fshg/
22:48:07  elliott: oh, I assumed that someone had -xed it as a prank
22:48:08  I mean, without understanding what's going on :P
22:48:09  I like the number 715
22:48:15  `quote 714
22:48:18  sounds like a hawkins Loc number
22:48:18  714) * Sgeo|web wants to see elliott be wrong about something   Sgeo|web: That literally never happens.   Sgeo|web: There you go. A great example.
22:48:21  `run chmod a-x /hackenv/bin/addquote
22:48:22  I think I just broke adqduote
22:48:24  No output.
22:48:26  ais523\unfoog: hey, stop
22:48:30  elliott: I'm putting it back!
22:48:41  http://codu.org/projects/hackbot/fshg/index.cgi/rev/bbaa4fa982d2
22:48:43  aha
22:48:47  `run chmod +x bin/addquote
22:48:49  No output.
22:48:51  Keep my name on it:
22:48:54  Its Amit.
22:48:58  `delquote 715
22:49:01  ​*poof*  Linux is like the most quirky of all Forths, it has its own OS
22:49:09  oh wait
22:49:14  I made a bad modification to addquote
22:49:24  `run echo 'echo $(qc)") $1"' >>bin/addquote
22:49:27  No output.
22:49:31  `addquote  Linux is like the most quirky of all Forths, it has its own OS
22:49:33  715 quotes)  Linux is like the most quirky of all Forths, it has its own OS
22:49:36  oops
22:49:41  `revert -3
22:49:42  Done.
22:49:47  `run echo 'echo $(qc | cut -d' ' -f1)") $1"' >>bin/addquote
22:49:49  No output.
22:50:02   `addquote  Linux is like the most quirky of all Forths, it has its own OS
22:50:02  Forth guys are gonna love me
22:50:10  For this
22:50:11  zzo?
22:50:14  ais523\unfoog: tada... hurry up, dammit, HackEgo
22:50:15  elliott: you're just giving -d, not -d' ', as an argument to cut there
22:50:20  ugh
22:50:21  `revert
22:50:23  Done.
22:50:29  QuickDirtyOS: For what?
22:50:31  because apostrophes don't nest
22:50:33  `run echo 'echo $(qc | cut -d'"' '"' -f1)") $1"' >>bin/addquote
22:50:35  No output.
22:50:36  this quote
22:50:38   `addquote  Linux is like the most quirky of all Forths, it has its own OS
22:50:47  ais523\unfoog: have I mentioned that @ doesn't have that problem?
22:50:57  elliott: not in programs, obviously
22:50:59  does @ have ANY problems
22:51:12  what about when typing programs; how does the parser reify the keystrokes/mousestrokes into a parsetree?
22:51:24  Yes. Its problem is that there is no such things, as far as I can tell
22:51:28  @ doesn't have programs! but ok, I'll dignify your EVIL QUESTION with a response
22:51:34  ais523\unfoog: excellently. next question!
22:51:43  elliott: err, functions
22:51:45  http://codu.org/projects/hackbot/fshg/index.cgi/rev/af6a8d1f2673 ;; hmm, why isn't this working?
22:51:48  `addquote  Linux is like the most quirky of all Forths, it has its own OS
22:51:50  715)  Linux is like the most quirky of all Forths, it has its own OS
22:51:51  too many space
22:51:54  ais523\unfoog: not all values are functions!
22:52:25  elliott: right; but I was thinking about writing functions in particular in my question
22:52:27  ais523\unfoog: admittedly, as @ has no globals, most /useful/ "top-level" values are
22:52:37  ais523\unfoog: I doubt you mean function
22:52:41  you mean program-analogue
22:52:49  for instance, a list of all prime numbers would count
22:52:54  since it's analoguous to a program printing every prime number
22:52:58  but that's not a function
22:53:10  `log How did you work out where I live?
22:53:32  elliott: hmm
22:53:35  2011-11-12.txt:22:53:10:  `log How did you work out where I live?
22:53:44  `log where I live?
22:53:47  you mean, a lazy list that did the computation wouldn't be counted as a function because it didn't have a function type, for instance?
22:53:49  2007-12-28.txt:22:20:17:  where I live there's a band called fokoffpolisikar (at least I think that's how it's spelled)
22:54:02  ais523\unfoog: yes (it doesn't "do" the computation, it just /is/ the result)
22:54:04  Phantom__Hoover: s/?/\?/
22:54:09  ais523\unfoog: OTOH, the reason most top-level @ values are functions is because they have to take all the modules they want as parameters
22:54:18  because there are no globals
22:54:32  which isn't... /strictly/ true
22:54:35  but it's almost true
22:54:36  elliott: wouldn't it make more sense for them to take a function that resolved hashes into modules as an argument?
22:54:49  ais523\unfoog: wow! why would you give every program root permissions?
22:55:22  ais523\unfoog: for a start, hashes aren't actually integral to @'s core model any more (thankfully); for a second, that breaks the object-capability model, because it's a reference-forging tool
22:55:29  elliott: well, it wouldn't necessarily give them modules they didn't deserve
22:55:30  also, it'd tie functionality to implementations, not APIs...
22:55:33  Is it supposed to be anything similar to a Haskell program?
22:55:37  but hmm, OK
22:55:39  zzo38: sort of, yes
22:55:42  I assumed APIs would have hashes too
22:55:54  so that you could refer to them uniquely
22:55:58  ais523\unfoog: they do; an API is identified by a module name, a hash, and a type signature
22:56:18  well, it's identified by a hash of a name and a type signature
22:56:56 -!- Ngevd has quit (Quit: Goodbye).
22:56:58  ais523\unfoog: anyway, I have certain requirements of my keypress-reifier, but no concrete specification; it's something I'll have to tweak as I use it
22:57:07 -!- Ngevd has joined.
22:57:16  ais523\unfoog: for instance, the user must not constantly be bugged with the nested hierarchy; navigation should be /largely/ linear
22:57:26  ais523\unfoog: reason: try navigating a heavily-nested TeXmacs expression
22:57:27  yep
22:57:31  it's super annoying
22:57:50  I think that one possible method of navigating should be the one that would be used if it was a flat file using ( and )
22:57:52  ais523\unfoog: also: not every keypress has to leave the program in a valid state -- semantically /or/ syntactically -- but it should try
22:57:57 -!- aloril has joined.
22:58:02  i.e. backwards and forwards in depth-first traversal order
22:58:07  for instance, "if" should probably pregenerate the then/else keywords with appropriate indentation, and place a hole there
22:58:11  but not fill the hole in
22:58:25  yep, just like many Java IDEs do already
22:58:51  ais523\unfoog: yes (except they just leave blank space rather than a hole)
22:59:00  the nice thing about holes are, you can ask the computer: what type is expected here?
22:59:10  it can hoogle-equivalent for functions that could help you get to that type
22:59:11  etc.
22:59:27  I remember something leaving -shaped holes, but I can't remember what it was
23:00:01  but anyway, the requirements are basically "not more painful than editing plain text", "largely linear navigation rather than focusing too much on the hierarchy", "as semantics-retaining as possible under incremental development", "not freaking annoying"
23:00:02  I suppose you could make it always correct by it leaving function arguments as the default hole-filler, but I'm not convinced that's a good idea
23:00:36  ais523\unfoog: a nice thing about a proper AST type and holes and the like is that they make a lot of refactorings formal
23:00:42  rather than risky textual manipulation
23:00:47  yep
23:00:48  there's semantic /meaning/ to extracting out a hole as a parameter
23:01:01  my PhD is arguably on this subject
23:01:27  (type systems are good for refactoring, compiling is just really an extreme sort of refactoring, type systems are a good way to do this, this applies to hardware too)
23:01:39  compiling is the kind of refactoring that makes your code worse :)
23:01:57  sounds like a witty joke
23:02:13  hi
23:02:20  hmm, I'm kind of low on ideas as to the low-levelish language underpinning @lang that things like the GC are written in
23:03:18  shouldn't the GC be built into the @lang interp?
23:03:21  the problem is that it has to map to modern exposed assembly as closely as possible while being completely safe...
23:03:25  ais523\unfoog: no interp, compiler
23:03:27  it's part of the RTS
23:03:31  but what is the RTS written in?
23:03:34  ah, right
23:03:39  I was assuming there was some sort of VM involved
23:03:42  no point writing it in assembly, I'd have to rewrite the GC for every platform, which is pointless
23:03:47  that could be written in something entirely different
23:03:51  ais523\unfoog: well, VM, sufficiently heavy RTS, what's the difference
23:04:04  perhaps LLVM would be a practical example
23:04:05  but, yeah, my intent is to minimise platform-specific code
23:04:07  Use a minimal Forth
23:04:13  Or a minimal C
23:04:16  instead
23:04:18  what is it with you and forth
23:04:19  it does what you want moderately accurately and isn't completely awful
23:04:24  C isn't an option
23:04:31  ais523\unfoog: unfortunately, no; LLVM isn't safe
23:04:32  "c but better"
23:04:37  you can write an LLVM program that segfaults
23:04:38  Forth code is the same as machine code
23:04:42  only better
23:04:44  (adding runtime checks to every instruction is not acceptable)
23:04:47  QuickDirtyOS: better and slower
23:04:54  not slower
23:04:56  if its native
23:04:59  !
23:05:02  duh.
23:05:11  Make a safe program similar to LLVM
23:05:13  but of course.
23:05:38  Or, possibly, similar to Haskell too
23:05:50 -!- Ngevd has quit (Ping timeout: 245 seconds).
23:05:55  ais523\unfoog: anyway, "applying the object-capability model to x86-64" sounds like a parody Ph.D. title
23:05:59  elliott: this language would necessarily have no access controls; if it's got enough perms to do GCing, it's got enough perms to do anything
23:06:07  that probably applies to most papers that could come out of @...
23:06:27  ais523\unfoog: no: it only has the perms to do GC if it's passed the heap
23:06:40  assembly also isn't a dead-end, you can translate it just as well as Forth code.
23:06:45  hmm, so it's something more like NaCl
23:06:46  ais523\unfoog: consider a very low-level section of, e.g. a graphics card driver
23:06:51  that needs to have precise control over instructions
23:06:55  it only needs a certain segment of RAM
23:06:56  some IO ports
23:06:58  which is x86 machinecode plus a proof that it doesn't do anything nasty
23:07:00  and local memory/registers
23:07:08  (and the proof is checked before the program is run)
23:07:13  .
23:07:16  there's no reason to let it trample on anything else at all
23:07:17  Sgeo|chromcrash: .
23:07:22  elliott: Phantom__Hoover CakeProphet update
23:07:35  .
23:07:44  update to the .
23:07:48  it is now 90% more .y
23:07:51  i love Phantom__Hoover CakeProphet updates
23:07:55  . updates too
23:07:58  OK that is one idea. If you can have such a proof combined with a program.
23:07:59  elliott: I think something NaCl-style is your best bet there, then
23:08:05  Ify ou can figure out how to make that work.
23:08:19  zzo38: yep; that's quite a difficult area of research, though
23:08:24  formal verification is hard enough of high-level languages
23:08:27  ais523\unfoog: I'd rather make it safe-by-design, I think
23:08:36  ais523\unfoog: for instance, there's no reason you should be able to pass a literal to "mov"
23:08:41  Possibly with protected mode; it might not work as well with real mode
23:08:51  elliott: doesn't mov take an address as its target argument anyway?
23:09:01  oh, right, you mean even writing to a fixed address is bad
23:09:08  ais523\unfoog: yep, but there's no reason you should be able to specify an arbitrary one
23:09:10  if you aren't given the capability for that address
23:09:12  I think x86 does have bound checking instructions
23:09:20  ais523\unfoog: there's also no reason you should be able to cast int -> ptr, too, ofc
23:09:21  I thought you just meant you didn't want people to modify literals
23:09:31  ais523\unfoog: so some kind of type system is necessar
23:09:31  y
23:09:39  I think I'll make it an infinite-register design
23:09:45  getting that language right is the really hard step
23:09:46  but allow pinning virtual registers to hardware registers
23:09:47  in case you need that
23:10:00  as a single security bug in it will cause the entire system to be insecure
23:10:07  with no other layers of defence
23:10:07  ais523\unfoog: I've occasionally thought to just abandon the low-level language, write the GC unportably, and hope that no drivers need to do anything so low-level
23:10:12  but it doesn't seem like the right thing to do
23:10:19  the low level language doesn't clutter @'s design itself
23:10:20 -!- Taneb has joined.
23:10:26  if you have an @ graph reduction machine, you can skip it entirely
23:10:28 -!- Taneb has quit (Read error: Connection reset by peer).
23:10:35  and just compile and run @lang code directly
23:10:48  ais523\unfoog: hmm, I'd disagree that there aren't other layers of defence
23:10:53  ais523\unfoog: here's one: guessing addresses is pretty hard!
23:11:01  i want an @ graph reduction machine
23:11:14  yesss
23:11:20  elliott: you don't need to guess, just try them systematically until you find a usable one
23:11:25  A GRASP machine would be awesome
23:11:36  ais523\unfoog: that takes a very long time
23:11:42  so? still a security bug
23:11:47  ais523\unfoog: oh, definitely
23:12:01  ais523\unfoog: anyway, it is not that bad.
23:12:02  and it only takes a few seconds to fill memory on a modern computer, right, if all you're trying to do is fill memory with a particular pattern?
23:12:03  ais523\unfoog: I mean,
23:12:06   as a single security bug in it will cause the entire system to be insecure   with no other layers of defence
23:12:09  because
23:12:17  ais523\unfoog: in Windows, all you need is a single security bug in ANY DRIVER AT ALL
23:12:34  ditto in Linux
23:12:35  you also need the perms to communicate with the driver, don't you?
23:12:50  ais523\unfoog: usually, drivers read from unprivileged data, or they're not so useful...
23:13:17  elliott: Yes, but unprivileged users can't talk to drivers
23:13:17  the graphics driver runs in the kernel, X runs as root, but the user runs programs as themselves, and that data makes its way to the graphics driver
23:13:18  not always; things like keyboard/mouse drivers don't need to do any reading from processes on the system, just writing
23:13:23 -!- Ngevd has joined.
23:13:27  Deewiant:  the graphics driver runs in the kernel, X runs as root, but the user runs programs as themselves, and that data makes its way to the graphics driver
23:13:39  elliott: Sure
23:13:40  elliott: but things like X filter the data first
23:13:43  elliott: But that's not necessarily exploitable
23:13:46  elliott: Because of what he said
23:14:04  ais523\unfoog: So? I could have responded with a bunch of ways in which @ reduces the likelihood of an exploit
23:14:23  point is, @ has many fewer exploitable vectors than a typical modern system
23:14:25  well, OK
23:18:20  I have written some things relating to another plan of computer I have; many of the security features are implemented in hardware. It just depend on the way of connecting the memory. And then have a flipflop to enter and exit privilege mode, and a few jumpers to override these things.
23:18:46 -!- quintopia has quit (Ping timeout: 256 seconds).
23:18:48  at what age(s) did u met the esoteric languages ( u could count BF and Forth as well as some LISPs maybe )
23:19:10  11 or so
23:19:23  O, I don't remember
23:19:28  11? u had an Atari ?
23:19:37  I can't remember.  Probably 10 or 11 or so.
23:19:51  was it Forth or BF ?
23:20:01  what if it was neither
23:20:05  (it was probably bf, but bf never interested me)
23:20:05  what if
23:20:09  the first esolangs I came across were INTERCAL and Malbolge
23:20:25  I came across INTERCAL first as well, but never really learned it
23:20:26  probably befunge and underload got me into esolangs?
23:20:27  and I found the esolang community searching for info about INTERCAL
23:20:29  i liked malbolge too
23:20:31  and unlambda
23:20:43  monqy: hardly anyone's actually learned INTERCAL, I think, which is a pity
23:20:53  I really like the way the control flow works in modern INTERCAL, it's a thing of beauty
23:21:11  its expressions are still pretty nasty, though; reverse assignments make them so much better, but no compiler handles them correctly yet
23:21:18  I only came to BF a year or less after bumpin into Forth.
23:21:39  with a native x86 compiler, of course
23:21:46  a very basic compiler
23:21:55  I think I found Brainfuck at first. But I did learn INTERCAL, too. Including both the old and new INTERCAL, and even wrote some suggestions of new INTERCAL
23:21:56  (for both)
23:22:09  `echo TRANS - ACT - IONAL
23:22:11  TRANS - ACT - IONAL
23:22:22 -!- Ngevd has quit (Ping timeout: 258 seconds).
23:22:22  For me it was in 2007 I think
23:22:38  2007, and I was 33
23:22:42  or 32.
23:22:48  I know Forth as well; and I have added support for Forth codes into MegaZeux.
23:24:17  but was it in ur 20s or 30s ?
23:24:19 -!- Ngevd has joined.
23:24:23  or 40s ?
23:25:00  can Machine Code be called an esoteric language btw ?!
23:25:19  esoteric machine code
23:25:21  no, not really
23:25:21  if so, I also came to meet it at 10 or 11
23:25:25  it's just a weird encoding for asm
23:25:33  was it esoteric asm
23:25:36  but its tough.
23:25:55  Z80 was similar, but not as simple as 8080
23:25:55  "tough?" what does that mean and how does it make it esoteric
23:26:40  if BF was easy (as some, including my translator make it)
23:26:49  would you consider it esoteric ?
23:26:59  just because it wasn't mainstream ?
23:29:16 -!- Ngevd has quit (Ping timeout: 258 seconds).
23:29:34 -!- quintopia has joined.
23:29:34 -!- quintopia has quit (Changing host).
23:29:34 -!- quintopia has joined.
23:29:45  esoteric doesn't mean difficult, does it?
23:29:59  I'll keep that question for Chuck Moore
23:30:05  he comes in here at times
23:30:09  doesn't he ?
23:30:11  ?!
23:30:11  Maybe you meant: . ? @ v
23:30:48  no
23:31:14  I guess that was a tough question .. :-[
23:32:31  I think machine code can be called esoteric
23:32:32  Oi, Gregor, can I have some money?
23:32:49  I think odds are for me.
23:32:58  bets?
23:34:57  what sort of machine code are you calling esoteric
23:35:11  elliott: do you consider Redcode an esolang?
23:35:25  if you mean machine code in general, then it's not esoteric at all
23:35:32  ais523\unfoog: hmm... probably no, but it has quite a few esoteric features
23:35:34  its not mainstream (Redcode)
23:35:38  ais523\unfoog: and it probably counts as esoteric programming
23:35:42  elliott: I'm conflicted on it myself
23:35:59  it's yes based on use, but no based on features
23:35:59  ais523\unfoog: I think it's perfectly possible to have a language where all coding in it is esoprogramming but the language isn't esoteric itself
23:36:04  apart from the lack of library support
23:36:15  actually Z80 is very mainstream (my bad luck?)
23:36:17  I dunno, it has some weird stuff
23:36:22  elliott: hmm, perhaps; but a language designed for that /would/ be an esolang, I think, and thus fail at its goal
23:36:28  it'd have to happen accidentally
23:36:30  QuickDirtyOS: mainstreamness is not evry relevant to esolang status
23:36:57  I would vote for machine code for esolang
23:37:19  machine code isn't a single language
23:37:20  I remember one machine code / assembly that is an esolang
23:37:36  oh?
23:37:56  there are several machine code esolangs, yes.
23:38:00  ais523\unfoog: anyway, I'm kind of thinking that the low level @ language's type system would inevitably end up becoming as complicated as @lang's
23:38:04  elliot: Mnemonics
23:38:06  ais523\unfoog: so why not just reuse it?
23:38:18  There is the Checkout esolang; and I would like a (FOSS) implementation of it.
23:38:25  Mnemonics
23:38:32  monqy: mnemonics
23:38:37  CakeProphet: mnemonics
23:38:41  menomincs
23:39:02  ais523\unfoog: in fact, there's no reason the low level language couldn't just be part of @lang itself
23:39:32  ais523\unfoog: (note: you could make /Python/ part of @lang, by just defining an AST for it and an interpreter function; you could include it in code just like any other program)
23:39:35  unless it would end up cluttering up @lang horribley
23:39:37  s/program/program element/
23:39:40  monqy: see above
23:39:43  yeah
23:39:44  it could be separate, but use the same type system
23:39:54  and since it would be restricted, you wouldn't have to implement all of @lang
23:39:55  well, that's a lie
23:40:00  you could still use all of @lang in the type system
23:40:07  so it's not actually any easier to implement at all
23:40:09  but ehhhh
23:40:13  would it require features outside of @lang
23:40:14  it gives the runtime properties i want
23:40:15  so yay
23:40:40  ais523\unfoog: actually there's a slight issue: how can you compile a dependently-typed language down to a language which shares its type system, without having the compilation of the latter depend on the former?
23:40:55  I think you can solve the infinite regress simply in the standard bootstrapping manner, but am not sure exactly how
23:41:32 -!- Ngevd has joined.
23:41:50  elliott: why does the low-level lang need dependent typing?
23:41:58  XSL S AND K IS DOING SOMETHING!
23:41:59   ais523\unfoog: anyway, I'm kind of thinking that the low level @ language's type system would inevitably end up becoming as complicated as @lang's
23:42:01   ais523\unfoog: so why not just reuse it?
23:42:02   ais523\unfoog: in fact, there's no reason the low level language couldn't just be part of @lang itself
23:42:08  ais523\unfoog: why invent two type systems?
23:42:16  ah, OK
23:42:22  ais523\unfoog: for instance, unless the low level language uses @lang's type system, it can't use modules at all
23:42:25  which is... problematic
23:42:26  anyway, I'm going home, as I@m now too tired to communichaterently
23:42:30  communichaterently
23:42:33  Earlier today, I had a thought about @
23:42:41  It's a bit like a space elevator
23:42:50 -!- ais523\unfoog has quit (Remote host closed the connection).
23:42:55  Ngevd: is it like the bf joust warrior space_elevator?
23:43:03  Not as far as I know
23:43:29  What I mean is, @ will do something similar to things that already exist, but in a completely different, better way
23:43:32  heh
23:43:37  and never be built? :)
23:43:40  Exactyl
23:43:47  s/yl/ly/
23:44:21  hmm, what has to be implemented in the low level language
23:44:31  Hardware thingies?
23:44:46  post-platform-initialisation bootup, the allocator, gc, storage manager (= persistence stuff)
23:44:58  parts of the scheduler (parts will have to be platform specific)
23:45:14  really low-level driver parts like the /implementation/ of the higher-level interfaces to things like IO ports and memory sections
23:45:15  hmm
23:45:18  Will @ work on today's computers?
23:45:26  yes
23:45:29  Oh cool
23:45:54  elliott: it should somehow use Checkout on graphics cards. :D
23:45:58   really low-level driver parts like the /implementation/ of the higher-level interfaces to things like IO ports and memory sections
23:46:04  actually, a lot of this might have to be trusted platform-specific code
23:46:08  although, hmm
23:46:27  I wonder if I couldn't write the entire scheduler in the low-level language, and just have modules for each platform that use something like inline asm
23:46:40  which would require the maximum trust level, ofc
23:46:43  but that's okay for a scheduler
23:46:49  CakeProphet: that would be difficult :p
23:48:21  elliott, has any code been written for @? At all?
23:48:34  Ngevd: i've worked on @-related code, yes
23:53:35  Well, I've got XSL S and K to run itself recursively
23:53:41  I just haven't yet got it to /stop/
23:54:14 -!- Patashu has joined.
23:56:08  Actually I would like to have some GPU with something like Checkout as its native code
23:56:31 -!- QuickDirtyOS has left.
23:58:12  I am wondering if it's even possible to use a fibonacci heap as a homoiconic programming language structure.
23:58:51  bye quickdirtyos
23:59:03  I think forest is probably a better name for the actual structure that it will end up being.
23:59:43  as a fibonacci heap is just a kind of forest. if I'm not using it as a heap and instead computing programs then it's not really much of a heap.
23:59:56  well, unless I give nodes priorities.

2011-11-13:

00:00:01  but that sounds really boring.
00:05:24  hmmmmm
00:05:28 -!- Darth_Cliche has quit (Quit: You are now graced with my absence.).
00:05:36  I just need a sane evaluation method
00:05:53  er, well
00:05:56  /a/ evaluation order
00:06:00  not necessarily a sane one.
00:06:52  */an/
00:06:54  you illiterate fuck :(
00:07:03  :(
00:08:39  elliott: oops. oh well, at least I'm not a condescending shitfingered cunt. :D :D :D
00:10:08  WTF, Gap Yah was just last year?
00:13:32  shitfingered?
00:16:02 -!- Ngevd has quit (Ping timeout: 258 seconds).
00:16:21  calamari: I get tired of the usual insult.
00:16:33  shitfingered cunt has very evocative imagery.
00:16:47  and it can be interpreted multiple ways!
00:17:16  none of them particularly pleasant.
00:24:09  woah.
00:25:37  bbl
00:25:39 -!- calamari has quit (Quit: Leaving).
00:25:44  so imagine you have a (possinly infinite) graph that is your program expression.
00:26:35  now imagine that instead of reducing things "bottom to top" you reduce them in whatever direction you like (i.e. you can non-strictly evaluate in multiple directions)
00:26:44  does that make any sense at all? :P
00:29:00  I found out that in GHCi, if you want to assign an IO result to a variable, you should first enter the IO expression at the prompt and then use:   let x = it   if you want the variable to be called x
00:30:18  Graphics.DVI now will find ligature/kerning:
00:30:32  findLK (charLigKern $ characters tenrm !! 102) 105 = Just (Ligature {lkChar = 105, ligChar = 12, ligCode = 0})
00:30:44  findLK (charLigKern $ characters tenrm !! 65) 86 = Just (Kerning {lkChar = 86, kernDist = -72819})
00:30:56  findLK (charLigKern $ characters tenrm !! 64) 85 = Nothing
00:31:28  is there something like "graph automatons" akin to CA?
00:32:37  see eodermdrome
00:32:46   I found out that in GHCi, if you want to assign an IO result to a variable, you should first enter the IO expression at the prompt and then use:   let x = it   if you want the variable to be called x
00:32:46  why not
00:32:47  x <- ...
00:32:48  ?
00:33:09  O, yes, that works too
00:33:16  But I didn't know that at first
00:35:02  elliott: bah ais beat me. :P ah well, doesn't mean I can't do it differently.
00:36:16  oh wow
00:36:17  that's awesome.
00:37:53  How do I remove interactive bindings?
00:38:35  :reload? :p
00:38:46  ah yes, I see how I can do it differently.
00:38:51  No I want to remove only some bindings
00:40:27  i think you can only shadow them.
00:42:37  the difficult part will be determining evaluation order.
00:43:39 -!- derdon has quit (Remote host closed the connection).
00:43:56 -!- Zuu has quit (Ping timeout: 244 seconds).
00:50:36 -!- Zuu has joined.
00:53:48 * Phantom__Hoover → sleep
00:53:49 -!- Phantom__Hoover has quit (Quit: Leaving).
00:56:34  so the idea I've got
00:56:50  is that the graph nodes are all single digits 0-9
00:57:59  each digit performs a different operation, and evaluation order is determined by the priority of the node.
00:58:28  each tick, 9's evaluate first, and 0's evaluate last.
00:58:47  so it kind of works like a CA, except it's a graph..
01:06:11 -!- Darth_Cliche has joined.
01:08:38  my brain hurts.
01:09:13  I'm tempted to throw together a set of completely incoherent operations
01:09:19  this is essentially what I did with dupdog.
01:09:22 -!- Jafet has joined.
01:11:02  but instead, I think I'll just take my time working out what each digit + node degree results in.
01:12:23  so for example 0s and 1s with degree 1 or 2 remain inert, and would basically represent binary data. however for higher degrees they would do... something else that I haven't figured out.
01:14:59  elliott, I'll upload some screenshots of Skyrim shortly. Unlike videos or jpeg compressed screenshots (which seems to be the norm from what I seen) these should actually let you judge the graphical quality.
01:15:08  also fraps is really bad for the FPS
01:15:14  yay
01:16:34  elliott, I notice no stuttering without Fraps running, but with it (I used it for the screenshots since prtsc didn't work in the game for some reason) its FPS display reports 40 FPS and I notice some frame rate drop too.
01:16:49  i think there's meant to be a less laggy capturing tool
01:16:54  hm
01:16:57  elliott, possibly
01:17:37  well I have 33 MB of screenshots as pngs
01:17:44  note, this is just a few files
01:17:50  14 files
01:18:00  i'm about to leave shortly, so i'll probably see them tomorrow
01:18:45  elliott, while the screenshots should contain no spoilers, there are some pictures from buildings a fair bit into the game. If you haven't played it, it is just some pretty (or not so pretty) architecture.
01:19:30  Doesn't bother me
01:20:14  elliott, the first one is up at http://whotookspaz.org/~anmaster/images/skyrim/
01:20:52  huh, the HUD interface looks kind of amateurish like that, the castle icon thing
01:20:57  very pretty though
01:21:05  elliott, look at the second
01:21:10  elliott, not so pretty eh?
01:21:19  unfortunately i have to go now :( will they still be up tomorrow?
01:21:22  and heh, nice textures
01:21:33  elliott, designed for console rather than PC
01:21:37  pretty obviously
01:21:51  elliott, but sure, they /may/ be there tomorrow
01:22:00  alright
01:22:01  elliott, unless I get a cease-and-desist
01:22:03  or something
01:23:10  cease and desist showing off our crappy textures
01:23:13   Vorpal, horses and chickens can report you to the authorities in skyrim :P
01:23:15  elliott, ^
01:23:19  elliott, as in, if you steal
01:23:21  :D
01:23:29  elliott, topic was "bugs"
01:23:53  elliott, but yeah I seen a few understandable and some rather weird bugs
01:23:56 -!- elliott has quit (Quit: Leaving).
01:25:57 -!- oerjan has quit (Quit: Good night).
01:33:28 -!- copumpkin has joined.
01:59:50 -!- kmc has joined.
02:14:49 -!- Darth_Cliche has quit (Quit: You are now graced with my absence.).
02:43:54 -!- Vorpal has quit (Ping timeout: 256 seconds).
03:02:41 -!- madbr has joined.
03:15:46  elliott: Now is a good time for me to reappear.
03:24:05  Can you make a ligaturing program to increment an arbitrary sized number?
03:27:45 -!- Aune has quit (Quit: Lmnar).
03:43:45 -!- sebbu has joined.
03:43:45 -!- sebbu has quit (Changing host).
03:43:45 -!- sebbu has joined.
03:46:32 -!- sebbu3 has quit (Ping timeout: 240 seconds).
03:49:20 -!- sebbu2 has joined.
03:49:21 -!- sebbu2 has quit (Changing host).
03:49:21 -!- sebbu2 has joined.
03:52:43 -!- sebbu has quit (Ping timeout: 260 seconds).
04:16:10 -!- tiffany has quit (Quit: ninies~).
04:42:45 -!- sebbu3 has joined.
04:45:44 -!- sebbu2 has quit (Ping timeout: 240 seconds).
04:51:55 -!- MDude has changed nick to MSleep.
04:58:54 -!- hagb4rd has joined.
05:21:29   
05:26:42 -!- hagb4rd has quit (Ping timeout: 248 seconds).
05:40:59  Someone elsewhere mentioned this thing
05:41:00  const void * const ((*foo)(const float *,int *(*)(float *,int,int),void())[5]);
05:41:06 * Sgeo|chromcrash has no idea what that does
05:43:54  Sgeo|chromcrash: It seems to be a C code for a function type?
05:44:09  zzo38: Yes, I think
05:44:36  Out of context it is difficult to understand what its purpose is.
05:45:33  zzo38: Someone posted it in another channel and said that if anyone figured it out they'd get 255 internet cookies
05:45:54 * Sgeo|chromcrash mentioend that he posted it in another channel
05:47:55  that's like a function pointer no?
05:48:46  madbr: Yes I think so
05:48:58  pointer to function that returns a constant pointer to constant data or something like that
05:51:59  wait, hmm, no
06:16:30 -!- madbr has quit (Quit: Radiateur).
06:32:42 -!- nys has quit (Quit: quit).
06:53:06  It's C++, not C.
06:56:10  It's an array of five function pointers. Each points to a function returning a pointer which is mega-super-duper-constant (can't change it, can't change thru it). The functions take a constant float pointer/array, a function (float *,int,int)->int *, and whatever a "void()" is (that one stumps me ... generic function pointer maybe?)
06:56:27  Ohwait
06:56:46  Right, that return type "const void *const" in fact indicates that it's constant and also always returns the same value for the same inputs.
06:58:42  Still not sure about void() though.
07:01:02  Perhaps it has something to do with variadic arguments ...
07:02:22  Yup, can't figure out what void() means and it's not searchable online :P
07:11:03  Problem is it can't just be void, you can't have void as a parameter >_>
07:14:41 -!- zzo38 has quit (Remote host closed the connection).
08:21:26  Sgeo|chromcrash: Do you know the "declarations use the same syntax as expressions" trick for reading C declarations?
08:24:38  No
08:25:11  Um, I have a feeling you just told me it
08:28:52  Sgeo|chromcrash: The trick is basically "declarations use the same syntax as expressions".
08:29:12  For example, "int x;" declares x as an integer; "int *x;" declares *x as an integer.
08:31:10  If you have a function blah that takes two doubles and returns a pointer to a double, then "*(*blah)(5.0,3.0)" is a double; therefore "double *(*blah)(double x, double y);" declares that function.
08:32:54  If you have an array yak of pointers to functions that take ints and return void and you want to call one, you say "(*yak[1])(8)"; therefore you can declare yak as "void (*yak[5])(int);"
08:32:58  And so on.
08:42:32  cdecl> explain const void * const ((*foo)(const float *,int *(*)(float *,int,int),void())[5]);
08:42:35  declare foo as pointer to function (pointer to const float, pointer to function (pointer to float, int, int) returning pointer to int, function returning void) returning array 5 of const pointer to const void
08:49:55  Also: $ echo 'const void * const ((*foo)(const float *,int *(*)(float *,int,int),void())[5]);' | gcc -std=c99 -pedantic -Wall -Wextra -x c -
08:49:58  :1:23: error: ‘foo’ declared as function returning an array
08:50:01  :1:23: warning: type qualifiers ignored on function return type
08:50:49 -!- monqy has quit (Quit: hello).
08:51:33  Or "error: function cannot return array type 'void const *const [5]'" if you ask clang.
08:52:11  I wonder why returning arrays is illegal.
08:53:23  You can always put them in a struct, after all.
08:54:09  You couldn't assign the return value anywhere, for one thing.
08:55:19  I guess that's true. Why isn't that allowed too? :-)
08:55:27  That of course just transforms into the question of why array assignment is illegal when array-in-a-struct assignment is just fine, yes.
08:55:39  Hysterical raisins, maybe.
08:56:24  Raisins tend to be far funnier than they ought to.
09:07:29 -!- Ngevd has joined.
09:13:52  I'm inclined to just say "C arrays suck".
09:15:09 -!- sebbu2 has joined.
09:15:09 -!- sebbu2 has quit (Changing host).
09:15:09 -!- sebbu2 has joined.
09:16:15 -!- Taneb has joined.
09:16:20  Stupid connection problems
09:18:39 -!- Ngevd has quit (Ping timeout: 252 seconds).
09:18:48 -!- sebbu3 has quit (Ping timeout: 260 seconds).
09:19:38 -!- Ngevd has joined.
09:19:42 -!- copumpkin has quit (Ping timeout: 260 seconds).
09:20:20 -!- copumpkin has joined.
09:23:45 -!- Taneb has quit (Ping timeout: 258 seconds).
09:24:04 -!- Taneb has joined.
09:28:21 -!- Ngevd has quit (Ping timeout: 258 seconds).
09:28:56 -!- derrik has joined.
09:30:20 -!- Vorpal has joined.
09:32:42 -!- Jafet has quit (Read error: Connection reset by peer).
09:34:06 -!- Taneb has quit (Ping timeout: 258 seconds).
09:35:33 -!- Jafet has joined.
09:35:36 -!- Jafet has quit (Changing host).
09:35:36 -!- Jafet has joined.
09:44:13 -!- Ngevd has joined.
09:52:11 -!- Taneb has joined.
09:54:26  http://pastebin.com/NM6TRF8R
09:54:48 -!- Ngevd has quit (Ping timeout: 258 seconds).
09:56:59 -!- Taneb has quit (Read error: Connection reset by peer).
09:57:22 -!- Taneb has joined.
10:02:42  Any thoughts on that?
10:12:07 -!- derrik has quit (Ping timeout: 258 seconds).
10:27:53 -!- Phantom_Hoover has joined.
10:47:23  IOT would be a good name for a nonsense language
10:47:38  Morning Phantom_Hoover
10:48:25  Or is it... the afternoon????
10:48:42  You're in the same time zone as me.
10:48:42  No, it's not; I got up in time today.
10:48:44  It's mornin
10:48:44  g
11:00:09  http://www.reddit.com/r/askscience/comments/mad87/what_is_d%C3%A9j%C3%A0_vu/
11:00:23  This is possibly the most heavily-pruned AskScience thread I've seen.
11:01:34  You know, I only go on reddit when it's linked on the #esoteric channel family?
11:03:25  I started off that way.
11:08:33  Phantom_Hoover, did you see the native res skyrim screenshots I made?
11:08:39  No.
11:08:40  http://whotookspaz.org/~anmaster/images/skyrim/
11:08:44  in case you are interested
11:08:59  I note you have emigrated from the Sporks server.
11:09:15  Phantom_Hoover, that one is the sporks server. Just the domain name changed.
11:09:26  because network got renamed
11:09:47  http://whotookspaz.org/~anmaster/images/skyrim/TESV%202011-11-13%2001-03-46-22.png
11:09:52  That looks pretty terrible.
11:09:52  Is it just me or do those rocks look just a bit too specular
11:09:55  Phantom_Hoover, yes
11:09:56  http://whotookspaz.org/~anmaster/images/skyrim/TESV%202011-11-13%2001-03-38-38.png
11:10:05  Phantom_Hoover, the game is clearly designed for consoles
11:10:12  Phantom_Hoover, where you don't really see stuff up close
11:10:25  because the TV is further away than a computer monitor
11:10:45  Jafet, I believe it is snow and ice on them, not sure though
11:10:47 -!- derdon has joined.
11:11:06  Jafet, and there is direct sunlight on parts, while other parts are in shadow
11:11:15  Well, eh; we're not exactly the kind of people to start judging a game based on the graphics.
11:11:23  There is no snow nor ice, only direct3d parameters
11:11:28  right
11:11:30  And textures
11:11:35  yeah
11:11:44  anyway I prefer the graphics of Witcher 2. Way better
11:11:50  And damn, that rock thingy looks specular.
11:12:03  That's some ugly snow, yes.
11:12:10  indeed
11:12:19  still, looks better than oblivion
11:12:37  but yes, it is clearly not up to scratch with high end PC graphics
11:12:54  ISTR hearing that the system requirements were actually fairly low.
11:12:55  It doesn't look too bad from a distance, I guess.
11:13:14  Phantom_Hoover, indeed. I'm running it on ultra graphics settings
11:13:14  But yeah, the shiny rocks are a bit offputting.
11:13:44  I played Fallout 3, and it also had shiny rocks everywhere
11:13:46  Phantom_Hoover, anyway I think consoles like xbos 360 has 512 MB RAM or some such
11:13:47  Phantom_Hoover: You're supposed to go all "ooh, shiny!", not "yuck, shiny!" on it.
11:13:51  I guess I can just pretend all the rocks in Skyrim are muscovite?
11:13:53  And shiny dirt and shiny rubble
11:14:01  And shiny concrete pieces
11:14:25  Jafet: Possibly polishing dirt is a common occupation in the post-apocalyptic era.
11:14:36  XD
11:14:42  Could be all the lasers
11:14:46  fizzie, obviously, how else are you meant to get all that radiation off?
11:15:15  also I find that the HUD looks fairly bad
11:15:23  it feels out of place in the setting
11:15:58  Don't worry, there will soon be a mod for fix each of those things
11:16:01  You'd... prefer bits of paper on the screen?
11:16:01  from a pure aesthetic point of view, the HUD and menus of oblivion were better
11:16:35  Phantom_Hoover, well from the point of view of navigating the menus, skyrim is /way/ better than oblivion
11:16:36  PixelQuest update
11:16:48  And then there will be a mod to make the menus look exactly like Oblivion's
11:16:54  Phantom_Hoover, I find the font used in skyrim is pretty bad too
11:16:57  Taneb, did you respond to my submission already.
11:17:03  Jafet, probably
11:17:03  Nah, getting to it
11:17:16  And then there will be a mod to make females naked
11:17:29  Jafet, and another one to make children killable
11:17:30  Vorpal, shush, you're sounding like elliott at his worst.
11:17:35  Hehe just got a funny idea
11:17:57 -!- Taneb has quit (Read error: Connection reset by peer).
11:18:06  Vorpal: are you sure gamers want to kill them?
11:18:13 -!- Taneb has joined.
11:18:26  That wasn't the funny idea, by the way
11:18:29  Phantom_Hoover, Jafet: other funny thing. When you create your character all the attributes are sliders. Including the gender one. However it only have two positions.
11:18:36  but why make it a full length slider
11:18:44  Extensibility?
11:18:48  Jafet, yes, because gamers want to kill everything, and the inability to kill a class of things just makes them want to kill them all the more.
11:18:51  maaaybe
11:19:00  Vorpal: The gender-slider's something elliott also complained about.
11:19:01  Vorpal, Simon and elliott have both poked fun at that.
11:19:10  fizzie, and yogscast too
11:19:17  Phantom_Hoover, snap :P
11:19:22  I'm not going to get Skyrim
11:19:24  Not for a while anyway
11:19:36  I can think of worse things gamers might think of doing to children in a video game
11:19:47  50 eur sounds a bit much for a game with only two genders, yes.
11:19:48  yeah unless you are a die hard TES fan, you are better off waiting for some of the bugs to get fixed
11:19:53  yes, it has quite a few bugs
11:20:25  Jafet, take them to the theatre to see the Nutcracker Suite as a hip-hop interpretive dance?
11:20:36  like dragons crash landing on a slope. The rag doll physics seem to have problem handling that, resulting in some very odd looking animations.l
11:20:40  s/l$//
11:21:03  Taneb's idea was worse than I thought
11:21:12  I hope he doesn't make a mod for that
11:21:17  XD
11:21:44  "Hey guys, the new game by Bethesda Softworks, it has quite a few bugs"
11:21:53  I'm not sure what you're getting at
11:21:57  Jafet, XD
11:22:07  but s
11:22:15  but sure, it is fun to play
11:22:40 -!- Jafet has quit (Quit: Leaving.).
11:24:33  Phantom_Hoover, anyway the map screen is an improvement compared to oblivion definitely
11:25:41  Phantom_Hoover, anyway how can you /not/ think that this font is terrible: http://whotookspaz.org/~anmaster/images/skyrim/TESV%202011-11-13%2001-05-10-37.png
11:27:00  Phantom_Hoover, oh and it generally doesn't look as bad when you play it. After all you are generally moving, that tends to help.
11:27:32 -!- Patashu has quit (Quit: MSN: Patashu@hotmail.com , Gmail: Patashu0@gmail.com , AIM: Patashu0 , YIM: patashu2 , Skype: patashu0 .).
11:27:50  fizzie, are you going to play skyrim?
11:28:33 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds).
11:29:33  fizzie, sure you said it was a bit expensive above, but that doesn't mean you won't play it. After all it was "launched" on torrents before it was launched officially, so it won't really be hard to get hold of.
11:32:11  I might just wait until they release a cheapo version in a few years. Will see.
11:33:45  That's what I did with NWN1 and NWN2.
11:33:48  http://www.skyrimnexus.com/index.php <-- quite a few mods already. And the official modding SDK has not yet been released even...
11:34:06  Or maybe I got NWN2 with a graphics card, actually.
11:34:21  heh
11:38:41  Bundling games with graphics cards is a funny thing. I got that "G-Police" game with... either the Voodoo2 or some Matrox card.
11:41:27  fizzie, never even heard of that game
11:41:36  what sort of game was it?
11:41:37  It's a shooting thing.
11:41:38 -!- Phantom_Hoover has joined.
11:41:40  heh
11:41:52  Phantom_Hoover, see logs before you pinged out
11:41:57  I didn't play-play it, but it was impressively threedee for 1997.
11:42:07  fizzie, play-play?
11:42:14  Seriously play.
11:42:19  "The game made use of cutting edge technology such as force–feedback joysticks, 3D sound and Direct3D Hardware Acceleration and was largely well-received. Critics noted that the game's graphics were some of the most technically impressive of the time."
11:42:19  ah
11:42:32  "The gameplay  involves piloting VTOL aircraft resembling helicopters, engaging in combat with enemies and protecting allies."
11:42:44  Not really my sort of thing, but it looked impressive.
11:43:07  Okay, away-away; it's this "father's day" thing today at least in Finland.
11:43:08  mhm
11:43:14  heh
11:43:20  fizzie, you are going to your father?
11:43:28  fizzie, or are you a father?
11:43:34  The former.
11:43:40  ah
11:43:43  Free food, basically. :p
11:44:03  heh
11:44:33  We "did" my wife's father yesterday; so free dinners for the whole weekend, even.
11:44:51  Eeew.
11:45:09  Phantom_Hoover, ?
11:45:19  fizzie, anyway those quotes looks strange
11:45:24   We "did" my wife's father yesterday;
11:45:31  Not that sort of "do".
11:45:32  Phantom_Hoover, oh right
11:45:43  without the quotes I would never had noticed the issue
11:46:10  Got a bus to catch. ->
11:46:21   Phantom_Hoover, anyway how can you /not/ think that this font is terrible: http://whotookspaz.org/~anmaster/images/skyrim/TESV%202011-11-13%2001-05-10-37.png
11:46:23  well?
11:46:58  Speaking of food, breakfast time
11:47:03  It's not /terrible/, it's just not curly and serifed enough to fit well with a fantasy setting.
11:47:24  Phantom_Hoover, Exactly. It is terrible in the context.
11:47:28 -!- Taneb has changed nick to Taneb|Not-Here.
11:47:33  it would work fine in other places, sure
11:47:53  Vorpal, eh; it's a bit incongruous, but if you can't see beyond the font...
11:48:07  Phantom_Hoover, then I'm an elliott clone?
11:48:35  Phantom_Hoover, sure, I can play the game. It isn't a game blocking "bug" for me. It just annoys me.
11:50:55  http://www.youtube.com/watch?v=6dYf0IfDz5Y&t=1m3s
11:50:59  Those moons....
11:51:45  My inner physicist is screaming, of course.
11:53:04 -!- Taneb|Not-Here has quit (Ping timeout: 240 seconds).
11:56:53 -!- Ngevd has joined.
12:01:23 -!- copumpkin has quit (Ping timeout: 258 seconds).
12:01:48 -!- copumpkin has joined.
12:12:03 -!- pkzip has joined.
12:12:20 -!- pkzip has left.
12:15:47  @ping
12:15:47  pong
12:15:53  That's good
12:20:11  Phantom_Hoover, I hope that video is actually either a minecraft mod or a skyrim mod. I don't think so however :(
12:33:32  @ping
12:33:33  pong
12:33:44  Okay, my IRC connection seems fine
12:36:33 -!- copumpkin has quit (Ping timeout: 260 seconds).
12:36:58 -!- copumpkin has joined.
12:39:39  http://i.imgur.com/VfBeP.png
12:41:16 -!- copumpkin has quit (Ping timeout: 245 seconds).
12:41:41 -!- copumpkin has joined.
12:44:08  Is S and K combinatory logic still turing-complete if it's restricted to balanced binary trees?
12:44:37  Yep.
12:44:47  Just pad out with ``skks as required.
12:45:14  Okay
12:45:16  That's (``skk), plural s, of course.
12:45:22  I did not actually need to know that at all
12:47:02  It might be a bit more complicated than that, since that only lets you add two extra levels, but I think you can pad to an odd number too.
12:47:52  kj;oahgua;ewighage
12:48:04  scan.co.uk wiped my basket.
12:48:05  Argh.
13:01:08  Phantom_Hoover, what were you buying?
13:03:21 -!- Ngevd has quit (Ping timeout: 240 seconds).
13:10:23  Computer bits.
13:18:09 -!- Ngevd has joined.
13:19:47  I might learn Lisp
13:20:11  Somewhere at the end of my list of languages to learn
13:22:45  Phantom_Hoover, ah
13:23:11  Phantom_Hoover, so soon you will be able to play all the games from that humble bundle that you complained you couldn't play
13:23:26  Phantom_Hoover, I really recommend trying out Trine. It is fun and it looks good
13:24:46 -!- mycroftiv has quit (*.net *.split).
13:24:46 -!- Sgeo|chromcrash has quit (*.net *.split).
13:24:46 -!- Ngevd has quit (*.net *.split).
13:24:46 -!- Madoka-Kaname has quit (*.net *.split).
13:24:46 -!- mtve has quit (*.net *.split).
13:24:47 -!- SimonRC has quit (*.net *.split).
13:24:47 -!- copumpkin has quit (*.net *.split).
13:24:47 -!- sebbu2 has quit (*.net *.split).
13:24:47 -!- jix has quit (*.net *.split).
13:24:47 -!- Zwaarddijk has quit (*.net *.split).
13:24:47 -!- fizzie has quit (*.net *.split).
13:24:47 -!- FireFly has quit (*.net *.split).
13:24:48 -!- lifthrasiir has quit (*.net *.split).
13:24:48 -!- Zuu has quit (*.net *.split).
13:24:48 -!- fungot has quit (*.net *.split).
13:24:48 -!- fizziew has quit (*.net *.split).
13:24:49 -!- TeruFSX has quit (*.net *.split).
13:24:49 -!- Deewiant has quit (*.net *.split).
13:24:49 -!- coppro has quit (*.net *.split).
13:24:49 -!- Phantom_Hoover has quit (*.net *.split).
13:24:49 -!- kmc has quit (*.net *.split).
13:24:50 -!- pikhq has quit (*.net *.split).
13:24:50 -!- yiyus has quit (*.net *.split).
13:24:50 -!- atehwa has quit (*.net *.split).
13:24:50 -!- Nisstyre has quit (*.net *.split).
13:24:50 -!- rodgort has quit (*.net *.split).
13:24:50 -!- bd_ has quit (*.net *.split).
13:24:50 -!- yorick has quit (*.net *.split).
13:24:50 -!- twice11 has quit (*.net *.split).
13:24:51 -!- BeholdMyGlory has quit (*.net *.split).
13:24:51 -!- lambdabot has quit (*.net *.split).
13:24:51 -!- derdon has quit (*.net *.split).
13:24:51 -!- quintopia has quit (*.net *.split).
13:24:51 -!- aloril has quit (*.net *.split).
13:24:51 -!- chickenzilla has quit (*.net *.split).
13:24:52 -!- shachaf has quit (*.net *.split).
13:28:13 -!- coppro has joined.
13:28:13 -!- Deewiant has joined.
13:28:13 -!- TeruFSX has joined.
13:28:13 -!- fizziew has joined.
13:28:13 -!- fungot has joined.
13:28:13 -!- Zuu has joined.
13:28:13 -!- copumpkin has joined.
13:28:13 -!- sebbu2 has joined.
13:28:13 -!- jix has joined.
13:28:13 -!- Zwaarddijk has joined.
13:28:13 -!- Phantom_Hoover has joined.
13:28:13 -!- kmc has joined.
13:28:13 -!- pikhq has joined.
13:28:13 -!- yiyus has joined.
13:28:13 -!- atehwa has joined.
13:28:13 -!- Nisstyre has joined.
13:28:13 -!- rodgort has joined.
13:28:13 -!- bd_ has joined.
13:28:13 -!- yorick has joined.
13:28:13 -!- twice11 has joined.
13:28:13 -!- glogbackup has joined.
13:28:13 -!- derdon has joined.
13:28:13 -!- quintopia has joined.
13:28:13 -!- aloril has joined.
13:28:13 -!- chickenzilla has joined.
13:28:13 -!- shachaf has joined.
13:28:13 -!- lifthrasiir has joined.
13:28:13 -!- FireFly has joined.
13:28:13 -!- fizzie has joined.
13:28:13 -!- Ngevd has joined.
13:28:13 -!- Sgeo|chromcrash has joined.
13:28:13 -!- Madoka-Kaname has joined.
13:28:13 -!- mtve has joined.
13:28:13 -!- SimonRC has joined.
13:28:17 -!- glogbackup has left.
13:28:18 -!- BeholdMyGlory has joined.
13:28:18 -!- lambdabot has joined.
13:30:40 -!- mycroftiv has joined.
13:36:50  A memory efficient SKI interpreter would try to find all the ``k's and all the `i's before doing ```s's
13:37:12  ^^^Statement of opinion
13:44:33 -!- mycroftiv has quit (*.net *.split).
13:44:34 -!- derdon has quit (*.net *.split).
13:44:34 -!- quintopia has quit (*.net *.split).
13:44:34 -!- aloril has quit (*.net *.split).
13:44:34 -!- chickenzilla has quit (*.net *.split).
13:44:34 -!- shachaf has quit (*.net *.split).
13:44:34 -!- yorick has quit (*.net *.split).
13:44:35 -!- twice11 has quit (*.net *.split).
13:44:35 -!- copumpkin has quit (*.net *.split).
13:44:35 -!- sebbu2 has quit (*.net *.split).
13:44:35 -!- jix has quit (*.net *.split).
13:44:35 -!- Zwaarddijk has quit (*.net *.split).
13:44:35 -!- Phantom_Hoover has quit (*.net *.split).
13:44:35 -!- kmc has quit (*.net *.split).
13:44:36 -!- pikhq has quit (*.net *.split).
13:44:36 -!- yiyus has quit (*.net *.split).
13:44:36 -!- atehwa has quit (*.net *.split).
13:44:36 -!- Nisstyre has quit (*.net *.split).
13:44:36 -!- rodgort has quit (*.net *.split).
13:44:36 -!- bd_ has quit (*.net *.split).
13:44:36 -!- Zuu has quit (*.net *.split).
13:44:36 -!- fungot has quit (*.net *.split).
13:44:37 -!- fizziew has quit (*.net *.split).
13:44:37 -!- TeruFSX has quit (*.net *.split).
13:44:37 -!- Deewiant has quit (*.net *.split).
13:44:37 -!- coppro has quit (*.net *.split).
13:44:38 -!- fizzie has quit (*.net *.split).
13:44:38 -!- FireFly has quit (*.net *.split).
13:44:38 -!- lifthrasiir has quit (*.net *.split).
13:45:12 -!- SimonRC has quit (*.net *.split).
13:45:12 -!- SimonRC has joined.
13:45:37 -!- fizzie has joined.
13:45:37 -!- FireFly has joined.
13:45:37 -!- lifthrasiir has joined.
13:45:45 -!- Aune has joined.
13:47:42 -!- glogbackup has joined.
13:47:43 -!- mycroftiv has joined.
13:47:43 -!- shachaf has joined.
13:47:43 -!- chickenzilla has joined.
13:47:43 -!- aloril has joined.
13:47:43 -!- quintopia has joined.
13:47:43 -!- derdon has joined.
13:47:43 -!- bd_ has joined.
13:47:43 -!- rodgort has joined.
13:47:43 -!- Nisstyre has joined.
13:47:43 -!- atehwa has joined.
13:47:43 -!- yiyus has joined.
13:47:43 -!- pikhq has joined.
13:47:43 -!- kmc has joined.
13:47:43 -!- Phantom_Hoover has joined.
13:47:43 -!- Zwaarddijk has joined.
13:47:43 -!- jix has joined.
13:47:43 -!- sebbu2 has joined.
13:47:43 -!- copumpkin has joined.
13:47:43 -!- Zuu has joined.
13:47:43 -!- fungot has joined.
13:47:43 -!- fizziew has joined.
13:47:43 -!- TeruFSX has joined.
13:47:43 -!- Deewiant has joined.
13:47:43 -!- coppro has joined.
13:47:59 -!- glogbackup has left.
13:48:31 -!- yorick has joined.
13:50:05 -!- twice11 has joined.
13:50:50  fungot!
13:50:50  Ngevd: mr president, ladies and gentlemen, what was best for the future programme is essential for us to move ahead in the united kingdom divided over a well-known rock in the southern part of europe.
13:50:56  ^style
13:50:57  Available: agora alice c64 ct darwin discworld europarl* ff7 fisher fungot homestuck ic irc iwcs jargon lovecraft nethack pa sms speeches ss wp youtube
13:51:19  ^style agora
13:51:20  Selected style: agora (a large selection of Agora rules, both current and historical)
13:51:23  fungot
13:51:23  Ngevd: as soon as possible after the next substantial change occurs in the manner specified in the registrar's report. this rule, including the riff-raff; and the
13:54:26 -!- ais523 has joined.
13:57:31 -!- sebbu2 has changed nick to sebbu.
14:05:31 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds).
14:18:55 -!- Taneb has joined.
14:20:49 -!- Phantom_Hoover has joined.
14:21:25 -!- MSleep has quit (Ping timeout: 255 seconds).
14:22:04 -!- Taneb|Hovercraft has joined.
14:22:08 -!- Ngevd has quit (Ping timeout: 260 seconds).
14:23:07 -!- Taneb has quit (Ping timeout: 240 seconds).
14:26:00 -!- Taneb|Hovercraft has changed nick to Taneb.
14:31:19  `quote
14:31:26  94)  and an AMICED literal would presumably /add/ info to the source   whatever info gets added, that's the value that the AMICED doesn't contain   it's all falling into place
14:31:30  Wait, fungot responds faster.
14:31:30  Phantom_Hoover: i) the amendment index when the motion. c) auction currency is the registrar shall, as described in other rules,
14:31:40  Is that INTERCAL style?
14:31:42  ^style
14:31:42  Available: agora* alice c64 ct darwin discworld europarl ff7 fisher fungot homestuck ic irc iwcs jargon lovecraft nethack pa sms speeches ss wp youtube
14:32:11  @ping
14:32:11  pong
14:32:24  Phantom_Hoover: it looks pretty agorish to me
14:32:25  hi fungot, btw
14:32:26  ais523: if such a transfer must additionally document every change made to perform an action, or rule-- or other problem, a gambler holds or has exactly one
14:41:42 -!- derrik has joined.
14:42:41 -!- Taneb has quit (Ping timeout: 258 seconds).
14:48:29  ais523: do you know of any languages similar to Eodermdrome?
14:48:42  I'm looking for insiration on graph-rewriting languages.
14:48:44  Kolmogorov machines operate on similar principles.
14:49:22  CakeProphet: there's one other, which is similar but more complex, based on Kolmogorov machines
14:49:29  I forget who wrote it, but it's on the wiki somewhere
14:50:09  what I have in mind something more like a CA than a rewriting machine.
14:50:22  so instead of specifying rewrite rules in the program you specify the initial shape of the graph
14:50:39  and the relationships between states in the graphs cause the graph to change every turn.
15:01:02  so it's similar to the other language, except it has fixed rewrite rules and a program is the initial state, rather than having a fixed initial state and a program is the rewrite rules?
15:01:39  yep
15:01:54  though I don't know if they'll end up being exactly like rewrite rules.
15:02:34  te states are all going to be 0-9, and I was going to have higher numbers take priority over lower numbers perhaps.
15:02:59  so 9-rules activate before 8-rules before ...
15:03:57  @tell elliott Ordered computerons.
15:03:57  Consider it noted.
15:07:03 -!- Ngevd has joined.
15:09:54 -!- Taneb has joined.
15:13:44 -!- Ngevd has quit (Ping timeout: 258 seconds).
15:24:25 -!- Ngevd has joined.
15:27:55 -!- Taneb has quit (Ping timeout: 258 seconds).
15:29:33  Phantom_Hoover: yes SOON THEY WILL REVOLUTIONARIZE COMPYUTING
15:31:12  so yes unlike eodermwekjiwrdrome there can be more than one node with the same state.
15:31:31  as how the node will behave can depend on its degree.
15:37:07 -!- pikhq_ has joined.
15:37:07 -!- pikhq has quit (Ping timeout: 240 seconds).
15:39:06 -!- Ngevd has quit (Ping timeout: 256 seconds).
15:51:17 -!- Ngevd has joined.
15:56:37  CakeProphet, eodermwekjiwrdrome?
15:56:55  yes.
15:57:16  http://esolangs.org/wiki/Eodermdrome
15:57:33  CakeProphet, that is Eodermdrome, not eodermwekjiwrdrome...
15:58:51  ooooooohhhhhhhh
15:58:54  .. -_-
16:15:41  eodermwekjiwrdrome was a better name :(
16:17:06 -!- pikhq has joined.
16:17:12 -!- MSleep has joined.
16:17:38 -!- pikhq_ has quit (Ping timeout: 260 seconds).
16:19:16 -!- elliott has joined.
16:22:11 -!- Ngevd has quit (Read error: Connection reset by peer).
16:26:44 -!- Ngevd has joined.
16:28:00 -!- Taneb has joined.
16:28:06 -!- MSleep has changed nick to MDude.
16:32:18 -!- Ngevd has quit (Ping timeout: 248 seconds).
16:35:29  um
16:35:30  elliott: You have 1 new message. '/msg lambdabot @messages' to read it.
16:35:32  http://esoteric.voxelperfect.net/w/index.php?title=Excela&diff=25170&oldid=13100
16:35:37  ais523: is this vandalism, or..?
16:35:44  oh, yes
16:35:50  see last line
16:38:00 -!- Taneb has quit (Ping timeout: 245 seconds).
16:40:44  safe pills? yesssss
16:52:16 -!- nys has joined.
16:52:18 -!- tiffany has joined.
16:53:55 -!- Ngevd has joined.
16:56:55 -!- derrik has quit (Quit: done).
16:59:48  I don't know if I want to try these CRAAAZY patches.
17:00:08  Gregor: feels good, man.
17:00:22  Gregor: You mean Transactional HackEgo? :P
17:00:36  You have nooooo idea how much time I spent working out the commit logic.
17:01:35  Gregor: I mostly blame BitBucket's diff for not realising that I rewrote tr_60.cmd :P
17:03:28  elliott: THEY'RE PRETTY CRAZY REGARDLESS
17:03:48  Gregor: Pfft, lib/server is the only even vaguely crazy part
17:04:26  tr_60.cmd is a simple script that forwards messages to a server, lib/{fetch,revert} is just a moving of code, and lib/sandbox is a glorified UMLBox wrapper :P
17:04:41  (If 25 lines can be called glorification.)
17:04:44       '-R3128:127.0.0.1a:3128',
17:04:47  Hmm, is that "a" meant to be there?
17:04:54  lol no
17:05:27  Gregor: Fix't
17:05:30 -!- Ngevd has quit (Ping timeout: 245 seconds).
17:10:02  elliott: lib/server needs to already have IRC_SOCK set? >_<
17:10:20  Gregor: Well... it could receive the IRC socket location as a first message?
17:10:25  Gregor: You could just make a FIFO, man :P
17:10:47  FIFO's had problems, sockets are coolerer.
17:10:51  multibot is what sets IRC_SOCK though.
17:10:57  Not the runner.
17:11:32  Gregor: Well... you could just make socat start another script rather than the bot directly.
17:11:45  That script would do IRC_SOCK=/dev/stdin lib/server & bot
17:11:54  I can tweak the server if you'd prefer that though :P
17:12:11  Tweak the server >_<
17:12:29  Gregor: Okay; how (i.e. how would you like it to get a hold of the IRC socket)
17:13:28  I frankly don't understand WHY it needs the IRC_SOCKET, but if it does, it should be sent with {a,the} command{,s}.
17:13:50  Gregor: ...because it sends the output of commands back to the user...?
17:14:01  Oh, server does that now?
17:14:07  Yeah, server handles the running
17:14:13  Because the alternative is complicated IPC shit in tr_60.cmd
17:14:32  Nowonder :P
17:14:36  I'll send it with the commands, then
17:14:54  Yeah, otherwise you have a problem with when it generates the first v the second.
17:15:11  I really don't want to modify multibot for this too X-P
17:15:18  Gregor: I'm guaranteed to always get the same socket for a server run, right, though? i.e. so I can still use a global? :P
17:15:34  Yup.
17:15:58  Gregor: Anyway, I don't see how you can avoid modifying multibot, because SERVER_SOCK... oh, you can just set it at the start of the script and it'll propagate.
17:16:00  NEVER MIND :P
17:16:02 -!- Ngevd has joined.
17:16:59 -!- Taneb has joined.
17:17:32 -!- monqy has joined.
17:17:54  Gregor: Updated pull request and pull request's instructions :P
17:18:22 -!- HackBotLoony has joined.
17:18:24  "NameError: name 'sock' is not defined"
17:18:35    File "multibot_cmds/lib/server", line 144, in 
17:18:43  Good! That's good! That's a simple bug.
17:18:44  I can fix that :P
17:18:52 -!- HackBotLoony has quit (Remote host closed the connection).
17:18:55      sock, _ = sock.accept()
17:19:14  (N.B. if you were using Haskell that would never have happened)
17:19:14  (PS: I think we all agreed that I need more bots on here, yes?)
17:19:31  Deewiant: I asked Gregor if I could use Haskell
17:19:34  He said no, about three times
17:19:37  Now he is paying the price
17:19:38  elliott: I know
17:19:45  Gregor: Pushed (I won't bother updating the pull request until this works :P)
17:19:46  I'm paying the price?
17:19:49  How am I paying any price?
17:19:51  Just pull from my repo :P
17:19:56  Also, you're paying the price... of PAIN.
17:20:03 -!- HackBotLoony has joined.
17:20:07  `echo hi
17:20:09  hi
17:20:09  Err, don't use ` while HackBotLoony is on I guess X-D
17:20:09 -!- augur has quit (Remote host closed the connection).
17:20:20  Oh, what's its prefix
17:20:27  Or, is that its prefix
17:20:30 -!- Ngevd has quit (Ping timeout: 245 seconds).
17:20:37  That is it's prefix.
17:20:41  It's just shared with HackEgo :P
17:20:53  `help
17:20:53  Runs arbitrary code in GNU/Linux. Type "`", or "`run " for full shell commands. "`fetch " downloads files. Files saved to $PWD are persistent, and $PWD/bin is in $PATH. $PWD is a mercurial repository, "`revert " can be used to revert to a revision. See http://codu.org/projects/hackbot/fshg/
17:20:58 -!- HackBotLoony has quit (Remote host closed the connection).
17:20:59  Gregor: Well, not even help works P:
17:21:00  :P
17:24:40 -!- Taneb has quit (Ping timeout: 245 seconds).
17:37:20 -!- Ngevd has joined.
17:40:20  Deewiant: Simple undefined variable/type error count so far: About 15
17:40:30  THOUGHT YOU MIGHT LIKE TO KNOW
17:41:09  Okay, I feel like that amount is already saying something about your attention to detail
17:42:43  Deewiant: Yeah, only subhumans forget to import a module, or type .read instead of .recv, or append a list to a list of arguments BUT IT TURNS OUT THAT IN PYTHON IT ACTUALLY ENDS UP AS A TUPLE
17:42:52  I loooove Python
17:49:49 -!- augur has joined.
18:08:25 -!- pikhq has quit (Ping timeout: 245 seconds).
18:18:53 -!- pikhq has joined.
18:28:33 -!- TeruFSX has quit (Read error: Connection reset by peer).
18:29:48 -!- TeruFSX has joined.
18:48:42  I notice a distinct lack of language designed with syntax styled after the first chapter of Genesis.
18:48:51  *languages
18:49:55  And on the seventh line, God said, "let there be a floating point number named x, and let it equal 3.0," and God saw that it was good.
18:51:24  Deewiant: If I implement all the fingerprints Mycology tests will you add Shiro to the result ranking? :p
18:52:01  elliott, hm there is a place in the TES universe called "Elsweyr", I never thought much about it until I heard it voice acted today... Sounded like "elsewhere" XD
18:52:13  heh
18:52:25  elliott, btw did you check the rest of the screenshots?
18:52:29  Yes.
18:53:00  elliott, btw I figured out one reason witcher 2 looks so much better. No first person perspective. You don't get quite as close to the textures that way
18:53:02  elliott: Mostly it needs a homepage and I need the time and interest :-P
18:53:15  and also it genuinely have better textures as well
18:53:28  Deewiant: Why's it need a homepage :'(
18:53:37  elliott: So that I can link to it :-P
18:53:44  elliott: Github or whatever is fine
18:53:45  Deewiant: irc://irc.freenode.net/esoteric
18:53:49  :-P
18:53:52  That's not a good permalink
18:54:01  CakeProphet, this is because syntax-based languages are crappy.
18:54:02  Anything involving me isn't very perma
18:54:08  Although in your case it's probably better than it usually would be
18:54:15  Deewiant: I only ask because I'm considering starting on Shiro 2 :P
18:54:22  What's that?
18:54:24  btw, does *every* RPG these day have some sort of crafting system? Why is that so popular.
18:54:28  Phantom_Hoover: ah I see, esoteric programming languages are all about high quality.
18:54:37  Deewiant: I lost the latest Shiro 1 source and thought of a fairly decent fungespace structure in the meantime
18:54:57  How'd you manage to lose it
18:55:15  But anyway, I'd move Shiro 1 out once Shiro 2 comes in
18:55:15  Deewiant: (Basically: Make a HashMap for every 128x128 block of fungespace or so, and have a structure data FS = FS {fs::HashMap ...,, left::FS, right::FS, up::FS, down::FS}; keep track of the FS that the IP is currently in)
18:55:32  Deewiant: I managed to lose it because my computer broke and then I accidentally trashed my backup
18:55:44  Deewiant: And I meant Shiro 2, not Shiro 1
18:55:55  Oh
18:56:03  Well, in any case, it's mostly about me taking the time and effort
18:56:15  Phantom_Hoover: what if it also had a unique faith-based paradigm.
18:56:19  Deewiant: This is why you should be a robot?
18:56:21  where you have no proof that the program executes
18:56:26  you simply must believe that it did.
18:56:28  elliott: I suppose?
18:56:54  CakeProphet, been done.
18:56:57  sure, there was alchemy and enchanting in oblivion. Now there is also smithing, a skill used for smithing (as expected) but also smelting (yeah okay) and tanning (what, how is that related to smithing?)
18:57:35  Vorpal: Did ATHR ever get a real spec
18:57:40  I'd like to make sure Shiro 2 could support it
18:57:50  Vorpal, is there also wood burning, lye making, butchery, cooking and soapmaking?
18:58:53  Phantom_Hoover, I believe there is wood cutting, ore mining and some other such stuff. They don't seem to have any skill connected to them that I noticed. Can't say I have done a lot of those tasks though yet
18:58:59  Phantom_Hoover, and yes there is cooking
18:59:04  no clue what skill
18:59:26  Vorpal, hmm, how does mining work?
18:59:33  The world isn't mutable, I assume.
18:59:38  indeed
19:00:01  Vorpal: Sounds like they took a really, truly insignificant part of D&D and took it seriously. :P
19:00:07  Phantom_Hoover, put pickaxe in inventory, find vein of ore, target it and press e. Wait a bit to get some ore out of it, then a message "the vein is exhausted"
19:00:20  pikhq, what bit of D&D would that be?
19:00:35  Vorpal: The Craft(...) skills, of course.
19:00:37  Vorpal: So it's exactly like Minecraft :P
19:00:42  oh and you can operate saw mills.
19:00:51  elliott, quite, did you see that link, I think Phantom_Hoover posted it?
19:00:52  The Elder "Scrolls"
19:00:57  Which link
19:01:00  And Profession(...)
19:01:01  Oh, right
19:01:02  see log
19:01:03  I skipped through it
19:01:05  elliott, to youtube
19:01:07  What link?
19:01:16  of minecraft+skyrim
19:01:25  Phantom_Hoover, wasn't it you who posted it?
19:01:28  This is really, *insanely* insignificant, and I find it amazing that it's even in D20.
19:01:37  pikhq, heh
19:01:49  pikhq, well Skyrim uses it's own system. Not D20 afaik
19:01:52  Oh, yeah, that was me.
19:02:16  Vorpal: BAH
19:02:40  Deewiant: What if I make it beat CCBI on Fungicide :P
19:02:42  Vorpal: Anyways, that shit's stupid.
19:03:00  pikhq, hm? Not really here. It kind of fits in.
19:03:09  you can of course improve weapons too
19:03:13  using a grindstone
19:03:27  Vorpal: C'mooooooon, ATHR draft
19:03:28  hm I think you uses that for all types of weapons. Let me check....
19:03:39  elliott: I'd still prefer that it had a URL and I'd still need to take the time :-P
19:03:41  yes, you can improve maces and bows at a grindstone
19:03:45  no it doesn't make sense
19:03:50  Deewiant: A URL is not a problem :P
19:03:51  elliott: (Doing Fungicide is a lot worse than just Mycology)
19:03:52  elliott, !logs
19:04:07  Vorpal: You used rafb.net back then, I distinctly recall
19:04:15  elliott, I don't have it now and it isn't complete afaik. There wasn't really all that much interest in it either
19:04:28  Deewiant: Do you have a backup of the ATHR spec, then :P
19:04:35  elliott, I'm pretty sure it is in the efunge repo. Anyway if it isn't, then I can't get it atm. I'm booted into windows for skyrim
19:04:42  and it would be on my linux partition
19:05:01 * elliott looks.
19:05:08  elliott, anyway I'm reserving the right to change it. Just as a warning.
19:05:12  elliott: Evidently not
19:05:20  Vorpal: No, you cannot have that right, I will sue you
19:05:27  elliott, because iirc some of the stuff about communication between threads was kind of broken
19:05:32  as in, didn't work very well
19:05:38 -!- zzo38 has joined.
19:05:39  Don't care, just need to figure out how much I need to isolate
19:05:55  It's not in the efunge repo
19:05:57  elliott, ah, well look in the non-trunk branch of efunge on launchpad
19:06:03  it is definitely not in trunk
19:06:08  Oh
19:06:08  but in the ATHR feature branch
19:06:18  How
19:06:21  launchpad is impossible to navigate
19:06:27  sigh
19:06:40  https://code.launchpad.net/efunge
19:06:42  You have no ATHR branch
19:06:50  https://code.launchpad.net/~anmaster/efunge/supervisor-tree
19:06:53  lp:~anmaster/efunge/supervisor-tree
19:06:55  yes
19:06:55  "This is the feature branch to add ATHR."
19:06:56  it is there
19:06:59  Good name :P
19:07:21  elliott, that name is after the major internal restructuring that was required for it
19:07:31  so it makes sense
19:07:47  Well, it is not in there, either
19:07:55  Comment why, not what. (Same applies to this?)
19:08:19  Deewiant: Branch names are more like variable names
19:08:27  Deewiant: index, not count_for_loop
19:08:34  elliott, then I will upload it next time I boot to windows, unless it is on my laptop
19:08:37  I'll check that
19:08:41  Variable names should definitely by what, not how or why :P
19:08:44  elliott: Maybe
19:08:57  ah yes it is
19:09:09  I dunno, branch names don't seem obviously neither "what" nor "why"
19:09:15  Double negative whee
19:09:29  Deewiant: Branch names should be "what-goal", I think
19:09:34  elliott, anyway I'm going to rework the "book" thingy probably when I finish implementing it. Because it didn't feel right.
19:09:38  So athr or athr-support
19:09:43  http://sprunge.us/cHEi
19:09:47  elliott: That seems like "why"
19:09:49  elliott, there you have it
19:09:51  Vorpal: Thanks
19:09:54  Deewiant: What would what be, then
19:09:57  elliott: "goal" is a "why" thing
19:10:05  elliott: "what" is what it is currently, supervisor-tree
19:10:15  Oh, we're violently agreeing on what the branch name should be
19:10:23  Just not on the meanings of "what" and "why" :P
19:10:47  I'm also thinking that it might not be clear-cut in general
19:10:51  what are you talking about?
19:10:54  In some cases you might prefer something like the current name
19:11:04  But not in this case IMO :-P
19:11:18  Vorpal: About why your branch name isn't "athr" or equivalent
19:11:32  right, whatever
19:12:06  btw, idea for future ubuntu code name: Sinking Sloth
19:12:44  Do they always go in alphabetical order?
19:13:02  they didn't start that way
19:13:08  but I think they are doing that now
19:13:33  OK.
19:15:57  They went alphabetical pretty fast.
19:16:25  Wonder which Q-animal they will pick; it's the next they need to decide.
19:16:52  Quilled Porcupine
19:18:50  There's the quagga.
19:19:01  1. quagga, Equus quagga -- (mammal of South Africa that resembled a zebra; extinct since late 19th century)
19:19:10  African and all.
19:19:18  SOUTH Africam
19:19:25  s/m/n/
19:19:38  quail
19:19:49  Quantitative Quail
19:21:08  the problem with skyrim atm is that no one really knows the answers yet. So if you are truly stuck at something you can't just go look it up.
19:22:03  I think it's funny how so many Minecraft players are boycotting Skyrim due to the Scrolls lawsuit, when Notch himself has got Skyrim
19:22:34  Ngevd, they are what... lol
19:22:51  And of course the quetzal, and the quetzalcoatl.
19:23:31  "Quiet Quahog an ode to the sturdy mollusk"
19:23:47  https://wiki.ubuntu.com/DevelopmentCodeNames always has the best suggestions.
19:27:54  how do I get fsck ro tun on reboot?
19:27:57  ...
19:28:01  s/ro tun/to run/
19:28:46  CakeProphet: It'll already run fsck when it has to.
19:29:37  elliott: what about when you skip it? will it try again on next reboot?
19:29:46  Prolly
19:30:59  From what I recall, it will keep trying if you keep skipping it.
19:31:03  CakeProphet, why skip it? It takes like 10-15 seconds anyway even on a huge partition with lots of small files, at least for me
19:31:28  Vorpal: I am helping someone with their shit
19:31:34  and not knowing things at the same time.
19:31:34  ah
19:31:36  it's fun.
19:32:00  hmm, so this episode was about the bold "plan" to retake DS9, but it seems the "plan" is essentially "collect all the ships and fly to DS9 in a straight line"
19:32:43  That's certainly "bold".
19:33:28  olsner: You forgot "stop when you reach DS9".
19:34:04  not that I'd know better, but seems like a stupid way to do space warfare to take your blob of ships, meet another blob of ships and start shooting
19:36:22  elliott: well, in this case "stop when you reach the enemy fleet between you and DS9"
19:36:50  olsner, that's how tactics work in DS9, duh.
19:37:07  It gets particularly silly when they have space blockades which they can't go around for some reason.
19:37:54  equally silly, they haven't managed to get rid of the treaty on cloaking devices even though they're in a full-on war against this dominion thing
19:38:38  especially since the romulans are supposed to be allies at this time
19:38:53  hm I should try making a panorama from skyrim later. As far as I can tell there is no parallax.
19:39:23  olsner, don't knock it, at least they *used* them occasionally.
19:42:53  ISTR that there was one episode of Trek-something where someone (Picard, Kirk?) had an OMG WOW breakthrough idea of avoiding a circular space blockade minefield by (gasp!) going "up"/"down".
19:42:59  Three-dimensional thinking!
19:43:12  I think that was Wrath of Khan?
19:43:27  I suppose I might've just read about it from http://tvtropes.org/pmwiki/pmwiki.php/Main/Two-DSpace or something.
19:43:38  Also once in DS9 the Klingons put mines around Bajor, since they apparently have like a billion mines lying around.
19:45:02 -!- oerjan has joined.
19:45:29  ""His pattern indicates two-dimensional thinking."
19:45:30  — Spock, Star Trek II: The Wrath of Khan" -- apparently so.
19:45:58  Genetically engineered supermen are notoriously incapable of grasping the concept of height.
19:47:12  except those which cannot grasp left-right, instead.
19:49:00  I can probably weave this into yet another complicated Bashir silliness, but I can't be bothered.
19:51:05  Phantom_Hoover: they didn't have a million mines, so they built self-replicating mines
19:52:00  (which was apparently an original idea in the 24th century)
19:54:25  I think I still haven't seen any starship meet an upside-down starship (except when it's a dead one - then they flip over)
19:55:02  maybe there's a protocol to decide which way is up when two starships meet, and the losing ship flips to make it less confusing
19:55:14  :D
19:55:15  Probably.
19:55:32  olsner: "Another reason "Genesis" is considered a particularly bad episode (in addition to the Evolutionary Levels crap) is the fact that, when the Captain's shuttle returns, they can tell something's wrong...because the Enterprise isn't straight on."
19:55:34  Or maybe they all do it so Bashir doesn't get confused?
19:55:41  "Well, try to imagine that on a 3-D interface (in fact, play Frontier: Elite 2 and think yourself lucky if you survive your first "dogfight")."
19:55:50  Phantom_Hoover: Ha ha ha it should have been two-dimensional.
19:55:57  Asteroids II: the best.
19:56:45   [...] (except when it's a dead one - then they flip over) <-- so basically space is an ocean and spaceships are goldfish.
19:57:06  (the first being, of course, a trope.)
19:57:11  Phantom_Hoover: yeah, maybe it's a holdback from before they banished all the genetically engineered people
19:58:29  Do you ever use (x <$ guard y) or (guard y >> x) in Haskell?
19:59:43  They are useful with the Maybe monad, and the second one useful with the list monad too.
20:01:08  Can you ask some mathematicians what the MonadPlus laws should be?
20:03:26  hey oerjan
20:03:29  zzo38 needs a mathematician
20:04:38  In my opinion it should be the left zero law and monoid laws, but maybe a mathematician will know better
20:05:16 -!- Sgeo|chromcrash has quit (Ping timeout: 265 seconds).
20:05:56 -!- pikhq_ has joined.
20:06:13 -!- pikhq has quit (Ping timeout: 258 seconds).
20:07:28  $ ./testlm-disk.pl ../twungot/tokens.bin.irc ../twungot/model.bin.irc 3 mathematicians do it with
20:07:28  mathematicians do it with tail calls in some situations. :o
20:07:28  mathematicians do it with types, give you the vector of interrupt handlers. error code UNK (UNK (close connection))
20:07:28  mathematicians do it with sed :) cool! println works fine?! i posted the interface docs the other day. did it wrong.
20:12:57   A memory efficient SKI interpreter would try to find all the ``k's and all the `i's before doing ```s's <-- also find applications of ``sii and cache them.  that way you can get efficient y combinators.  (i think.  i thought of this in the context of lazy-k.)
20:13:31  elliott: i assumed he meant a _relevant_ mathematician.
20:14:17  oerjan: All mathematicians are interchangeable.
20:14:29  I think the technical term is "isomorphic".
20:14:36  ^style iwcs
20:14:37  Selected style: iwcs (Irregular Webcomic scripts)
20:14:41  fungot: Pontificate.
20:14:42  elliott: of all, the first one was a complete the binding the crocodile's jaws are tied us up and left us here! we're the last! it is!
20:14:45  wtf
20:14:51  oerjan: ?
20:15:05  elliott: the scripts
20:15:26 -!- SgeoN1 has joined.
20:15:28  oerjan: I scraped them :)
20:15:39  ah.  for the good of mankind.
20:15:49  Well, I no longer have to think about why REISUB wasn't working
20:17:54  SgeoN1: were you using Windows?
20:18:07  that's a reasonably obvious explanation for REISUB not working
20:18:16   eodermwekjiwrdrome was a better name :( <-- no it's not
20:18:38  is that one also nonplanar as a graph?
20:18:54  I was using Linux. Was being the operative word.
20:19:06  well i'd assume it's not a _complete_ graph
20:19:13  you probably need to enable magic SysRq
20:19:47  If I could even touch SysRq right now, I'd be much happier than I am
20:20:08  Bye Gregor.
20:20:19  You probably need to enable magic
20:20:21  I dropped my computer, and the USB stick I was running off of broke
20:20:46  That's why you run Linux of SD cards!
20:22:44  Is that something that could actually be done?
20:23:00  I've done it
20:23:11  It's probably not as fast as a USB stick
20:23:31  O.o
20:23:42  It would be safer...
20:23:50  I tried to run Haiku of one, too, but it wouldn't boot
20:24:03  How much HD space would I need to reasonably use MonoDevelop?
20:24:23  God knows
20:28:47  SgeoN1: STOP DROPPING YOUR FUCKING COMPUTER
20:29:39  Also, STOP FUCKING YOUR COMPUTER DROPPINGS
20:29:44  ais523: it's planar
20:30:17  It's not healthy
20:30:21           /---\
20:30:23  j - k - e - o \
20:30:23   \     /|\ /|\ \
20:30:23    i - w-r-d /| |
20:30:23         \|\-/ / /
20:30:25          m---/ /
20:30:28           \---/
20:30:37 -!- hagb4rd has joined.
20:31:45  I got kerning to work with typesetSimpleString in Graphics.DVI but I am having a bit of problem to try to figure out ligaturing
20:32:24  (I know they are correct; I have compared them with results from TeX)
20:32:51 -!- SgeoN1 has quit (Read error: Connection reset by peer).
20:33:09 -!- SgeoN1 has joined.
20:38:29  ANNOUNCEMENT:
20:38:32  I have a kitty.
20:38:46  Oh no!
20:39:44  Gregor, you already announced that.
20:39:44  Hmm
20:42:28  i've heard those announcements for a long time.  it may not be the same kitty.  maybe this is a descendant of the original one.
20:42:50  which is now a huge scary thing.
20:42:51  Catsplosion
20:43:44  Gregor: KITTY.
20:48:15 -!- GreaseMonkey has joined.
20:51:57  hello greasemonkey
20:52:04  'lo
20:57:03  > let foo x = (x:foo (x+1)) in foo 1
20:57:04    [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,28...
20:57:30  > [1..
20:57:31    : parse error (possibly incorrect indentation)
20:57:34  > [1..]
20:57:35    [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,28...
20:57:39  oh right
20:57:39  Easier way
20:58:01  > let fib x y = (x:(fib y (x+y))) in fib 1 1
20:58:03    [1,1,2,3,5,8,13,21,34,55,89,144,233,377,610,987,1597,2584,4181,6765,10946,1...
20:58:23  > fix ((1:) . scanl (+) 1)
20:58:24    [1,1,2,3,5,8,13,21,34,55,89,144,233,377,610,987,1597,2584,4181,6765,10946,1...
20:58:50  and this is where i show that i don't know shit about the haskell standard library
20:59:05  map (\ x -> x * x) [1..]
20:59:11  > map (\ x -> x * x) [1..]
20:59:12    [1,4,9,16,25,36,49,64,81,100,121,144,169,196,225,256,289,324,361,400,441,48...
20:59:12 -!- Zuu has quit (Ping timeout: 244 seconds).
20:59:16  > map (^2) [1..]
20:59:17    [1,4,9,16,25,36,49,64,81,100,121,144,169,196,225,256,289,324,361,400,441,48...
20:59:23 * GreaseMonkey facepalm
20:59:32  > map (join(*)) [1..]
20:59:33    [1,4,9,16,25,36,49,64,81,100,121,144,169,196,225,256,289,324,361,400,441,48...
20:59:46  and i forget what fold (foldl / foldr ?) is for
20:59:54  :t foldr
20:59:55  forall a b. (a -> b -> b) -> b -> [a] -> b
21:00:00  Any further questions?
21:00:01  > zipWith (*) [1..] [1..]
21:00:02    [1,4,9,16,25,36,49,64,81,100,121,144,169,196,225,256,289,324,361,400,441,48...
21:00:08  > foldl1' (+) [1..10]
21:00:09    55
21:00:16  thanks
21:00:29  > join.zipWith(*)$[1..]
21:00:30    Couldn't match expected type `[a] -> a' against inferred type `[a]'
21:00:31  > tail [1,2,5]
21:00:32  BAH
21:00:32    [2,5]
21:00:47  > join (zipWith(*)) [1..]
21:00:48    [1,4,9,16,25,36,49,64,81,100,121,144,169,196,225,256,289,324,361,400,441,48...
21:00:54  Actually.
21:00:57  > [1,3..]
21:00:58    [1,3,5,7,9,11,13,15,17,19,21,23,25,27,29,31,33,35,37,39,41,43,45,47,49,51,5...
21:01:01  oh yay
21:01:04  > zipWith(*) `join` [1..] -- That's nice.
21:01:05    [1,4,9,16,25,36,49,64,81,100,121,144,169,196,225,256,289,324,361,400,441,48...
21:01:35  [x^2|x <- [1..]]
21:01:37  > [x^2|x <- [1..]]
21:01:38    [1,4,9,16,25,36,49,64,81,100,121,144,169,196,225,256,289,324,361,400,441,48...
21:01:39  what's the one which cuts a list off after a certain point?
21:01:44  take
21:01:50  > take 10 [1..]
21:01:51    [1,2,3,4,5,6,7,8,9,10]
21:01:53  hmmkay
21:02:22  > map (`take` [1,3..]) [1..]
21:02:23    [[1],[1,3],[1,3,5],[1,3,5,7],[1,3,5,7,9],[1,3,5,7,9,11],[1,3,5,7,9,11,13],[...
21:02:26  erm
21:02:32  And takeWhile is like that, but it cuts a list off based on a function a->Bool
21:02:38  > map (\x -> foldl 0 (take x [1,3..])) [1..]
21:02:39    No instance for (GHC.Num.Num [t])
21:02:40     arising from a use of `e_10131' at  dammit
21:02:58  > takeWhile (!=10) [1..] -- for instance
21:03:00    Not in scope: `!='
21:03:01  BAH
21:03:04  > takeWhile (/=10) [1..] -- for instance
21:03:05    [1,2,3,4,5,6,7,8,9]
21:03:12  > map (\x -> foldr (+) (take x [1,3..])) [1..]
21:03:13    No instance for (GHC.Num.Num [t])
21:03:13     arising from a use of `e_1131' at  > map (\x -> foldd1' (+) (take x [1,3..])) [1..]
21:03:39    Not in scope: `foldd1''
21:03:41  dammit
21:03:43  > map (\x -> foldl1' (+) (take x [1,3..])) [1..]
21:03:44    [1,4,9,16,25,36,49,64,81,100,121,144,169,196,225,256,289,324,361,400,441,48...
21:03:48  yay
21:03:56  and there's probably a nice way to curry that
21:03:59  Looks like a scanr to me
21:04:04  map (\x -> sum (take x [1,3..])) [1..]
21:04:07  > scanr (+) 0 [1,3..]
21:04:08    [*Exception: stack overflow
21:04:11  > map (\x -> sum (take x [1,3..])) [1..]
21:04:12  > scanl (+) 0 [1,3..]
21:04:12    [1,4,9,16,25,36,49,64,81,100,121,144,169,196,225,256,289,324,361,400,441,48...
21:04:13    [0,1,4,9,16,25,36,49,64,81,100,121,144,169,196,225,256,289,324,361,400,441,...
21:04:20  > scanl1 (+) [1,3..]
21:04:21    [1,4,9,16,25,36,49,64,81,100,121,144,169,196,225,256,289,324,361,400,441,48...
21:04:22  GreaseMonkey: Tada
21:04:25  yay
21:04:41  > [1,3,6..]
21:04:42    : parse error on input `..'
21:04:46  nope that doesn't exist
21:04:56  So we know have about a dozen ways to make an infinite list of squares in Haskell
21:05:00  yeah
21:05:05 -!- oerjan has quit (Read error: Connection reset by peer).
21:05:11  s/ k/ /
21:05:14 -!- oerjan has joined.
21:05:18  i must say it is a lovely language when you're not getting bombarded with type errors
21:06:13  GreaseMonkey: I prefer dynamically typed languages, where the type errors result in silent breakage when you least expect it.
21:06:44  i prefer my statically typed languages to be explicitly typed
21:06:54  > map (\x -> x * (x+1) / 2) [1..]
21:06:55    [1.0,3.0,6.0,10.0,15.0,21.0,28.0,36.0,45.0,55.0,66.0,78.0,91.0,105.0,120.0,...
21:06:58  You should learn a few things about category theory, too.
21:07:04  GreaseMonkey: You mean you... prefer having to write out a type signature for every value?
21:07:20  > scanl1 (+) [1..]
21:07:21    [1,3,6,10,15,21,28,36,45,55,66,78,91,105,120,136,153,171,190,210,231,253,27...
21:07:22  yeah, at least you know damn well what thing it is
21:07:38  When I write Haskell program, I do write a type signature for every top level declaraion
21:07:40  GreaseMonkey: That's why there's a strong Haskell convention to put a type signature on every top-level value
21:07:46  Having to specify one for every single subexpression would be insane
21:07:59  hmmkay
21:08:02  And sometimes for subexpressions too
21:08:09  But not all subexpressions
21:08:14  what's the syntax for that again?
21:08:15  > map (\x -> x * (x+1) `div` 2) [1..]
21:08:16    [1,3,6,10,15,21,28,36,45,55,66,78,91,105,120,136,153,171,190,210,231,253,27...
21:08:23  GreaseMonkey: foo :: type
21:08:25  main :: IO ()
21:08:28  main = putStrLn "hi"
21:08:41  > scanl1 (+) [1..]
21:08:41  > ((2 :: Int) + (2 :: Int)) :: Int
21:08:41  addtwo :: Num -> Num
21:08:42    [1,3,6,10,15,21,28,36,45,55,66,78,91,105,120,136,153,171,190,210,231,253,27...
21:08:42    4
21:08:44  expr :: Int -> Int -> [Int]
21:08:45  ^ would that be right?
21:08:53  oh hmm
21:08:57  addtwo :: Num -> Num -> Num
21:08:59  GreaseMonkey: Num isn't a type
21:08:59  Ngevd: ^
21:09:03  oh hmm
21:09:09  addtwo :: Int -> Int -> Int
21:09:13  :t (+)
21:09:13  or alternatively
21:09:14  forall a. (Num a) => a -> a -> a
21:09:17  > inits [1,3..] --  > map (`take` [1,3..]) [1..]
21:09:18    [[],[1],[1,3],[1,3,5],[1,3,5,7],[1,3,5,7,9],[1,3,5,7,9,11],[1,3,5,7,9,11,13...
21:09:19  addtwo :: Int -> Int -> Int
21:09:22  addtwo :: Integer -> Integer -> Integer
21:09:23  addtwo a :: a -> a -> a
21:09:25  ?
21:09:26  addtwo :: (Num a) => a -> a -> a
21:09:26 -!- sebbu has quit (Read error: Connection reset by peer).
21:09:27  GreaseMonkey: no
21:09:33  dammit hmm
21:09:37   addtwo :: (Num a) => a -> a -> a
21:09:38  :P
21:09:43  right
21:10:17  singletonList :: a -> [a]
21:10:28  > sum inits [1,3..]
21:10:30    Couldn't match expected type `[a]'
21:10:30          against inferred type `[a1] -> [...
21:10:33  You have "return" and "pure" already make a singleton list
21:10:35  oh right
21:10:40  > map (sum) inits [1,3..]
21:10:41  > sum $ inits [1,3..]
21:10:41    Couldn't match expected type `[[a]]'
21:10:41          against inferred type `[a1] ->...
21:10:42    No instance for (GHC.Num.Num [t])
21:10:42     arising from a use of `e_113' at  > map (sum) (inits [1,3..])
21:10:45    [0,1,4,9,16,25,36,49,64,81,100,121,144,169,196,225,256,289,324,361,400,441,...
21:10:54  > map (sum) (tail inits [1,3..])
21:10:55    Couldn't match expected type `[a]'
21:10:55          against inferred type `[a1] -> [...
21:11:00  > map (sum) (tail (inits [1,3..]))
21:11:01    [1,4,9,16,25,36,49,64,81,100,121,144,169,196,225,256,289,324,361,400,441,48...
21:11:04  bracketitis
21:11:15  actually that's more of a LISP thing to have bracketitis
21:11:29  > map sum $ tail $ inits [1,3..]
21:11:29  > scanl1 (+) [1,3..]
21:11:30    [1,4,9,16,25,36,49,64,81,100,121,144,169,196,225,256,289,324,361,400,441,48...
21:11:30    [1,4,9,16,25,36,49,64,81,100,121,144,169,196,225,256,289,324,361,400,441,48...
21:11:39  i DO like how KWrite's scheme highlighter highlights the parentheses in rainbow colours though
21:11:39  > scanl1 (+) [1,4..]
21:11:40    [1,5,12,22,35,51,70,92,117,145,176,210,247,287,330,376,425,477,532,590,651,...
21:11:47  figurate numbers ftw
21:12:06  ok so scanl1 (+) [1,3..] is the small one
21:12:45  i take it scanl1 is essentially based on fold?
21:12:48  > length "scanl1 (+) [1,3..]"
21:12:49    18
21:13:01  @src scanl1
21:13:01  @hoogle scanl1
21:13:01  scanl1 f (x:xs) =  scanl f x xs
21:13:02  scanl1 _ []     =  []
21:13:02  Prelude scanl1 :: (a -> a -> a) -> [a] -> [a]
21:13:02  Data.List scanl1 :: (a -> a -> a) -> [a] -> [a]
21:13:02  Data.ByteString.Char8 scanl1 :: (Char -> Char -> Char) -> ByteString -> ByteString
21:13:03  erm
21:13:04  > length "map (^2) [1..]"
21:13:05    14
21:13:07  oerjan got it right :P
21:13:09  @src scanl
21:13:10  That one's shorter
21:13:10  scanl f q ls = q : case ls of
21:13:10      []   -> []
21:13:10      x:xs -> scanl f (f q x) xs
21:13:11  GreaseMonkey: folds and scans are related, but I wouldn't say one is based on the other
21:13:12  oh right.
21:13:28  GreaseMonkey: a scan basically tells you the accumulator of the fold at every step
21:13:34  sweet
21:13:41 -!- sebbu has joined.
21:13:45  GreaseMonkey: as such, a fold is the last element of the list the scan produces
21:13:48  so conceptually based, but not based on by implementation?
21:14:34  scanl f l (r:rs) = (l:(f l (scanl f r rs)))
21:14:36  ^ would that be it?
21:14:47  So many brackets
21:14:59  GreaseMonkey: it was listed above
21:15:01  (except of course there's the case of scanl f l [] = [l])
21:15:03  oh hmm
21:16:44  putting the q : outside both cases makes it lazier, i think.
21:17:06  > take 1 $ scanl undefined "boo!" undefined
21:17:07    ["boo!"]
21:18:08 -!- Zuu has joined.
21:31:29  Well, I've drawn another PixelQuest update
21:31:34  Uploading as we speak
21:31:45  No, Phantom_Hoover, it isn't your's yet
21:31:51  :(
21:32:07  But you're fifth in the queue!
21:32:15  :D
21:32:19  :D?
21:32:35  Why do the air vents in the Batman show have a sign that says "AIR VENT"? And a lot of other things are labeled too
21:32:59  Same reason as why one of the pixels in PixelQuest is a pirate. It's funny.
21:33:30  Okay, Chrome just crashed
21:33:38  Now Firefox takes the helm
21:36:47  How many MML compilers do you know of?
21:36:59  0
21:38:12  I know of SakuraMML which seem very good, however, it is Japanese only and I always get error message about ConvToHalfStep1 so it never works
21:39:34  However, it is also Windows only. But it is written in Pascal and there could be Pascal compiler for other computer it could work
21:39:54  But I don't need to worry about that right now since I currently have Windows.
21:40:43  PQ update is online
21:41:28  Ngevd, DO MINE YOU BASTARD
21:41:41  There.
21:41:42  Is.
21:41:43  A.
21:41:46  QUEUE!!!!
21:42:02  YES AND I SHOULD TAKE PRIORITY
21:42:13  Did you pay for a priority ticket?
21:42:19  Actually, that's a good idea
21:42:23  What reason do you think for the priority?
21:42:33  Maybe if PQ becomes my primary occupation
21:44:23  PQ?
21:44:29  PixelQuest
21:44:30  Parti Québecois?
21:44:34  Progress Quest?
21:44:34  Oh
21:44:36  An MSPAFA I write
21:44:42  MSPAFA?
21:44:50  sdjkfsdklfj
21:44:51  hi
21:44:55 -!- Zuu has quit (Read error: Connection reset by peer).
21:44:56  im join in acronym party
21:44:59  MS Paint Adventures Fan Adventure
21:45:06  Multi-Step Partially Advancing Finite Automaton?
21:45:10  oh
21:45:18  no it's Multi-Step Partially Advancing Finite Automaton
21:45:21  you got it right first time
21:45:24  oh ok
21:49:25 -!- Zuu has joined.
21:50:51 -!- Patashu has joined.
21:51:28  Which programs do you use for typeface design?
21:52:03  I don't design typefaces
21:53:49  elliott, iirc you said 3.4 GHz was overkill? Well I'm now waiting for a single threaded computation intensive calculation to complete
21:54:16  I know of a few programs; there is FontForge, and a few others, but METAFONT is best one.
21:54:52  elliott, I'm doing exposure optimisation with hugin on screenshots I took in skyrim. It seems skyrim uses HDR effects, light levels differ quite a bit depending on if the sun is in the view or not
21:54:56  so this might not work out
21:55:00  nah, emacs is the best typeface designer.
21:55:14  CakeProphet, nah, dd + cat and maybe od
21:55:16  Man, by "3.4 GHz is a waste of money and power", I totally meant "a 3.4 GHz i7 is never faster than 2.9 GHz i7"!
21:55:26  What is the command in emacs for typeface designing?
21:55:28  elliott, really?
21:55:31  elliott, why would that be?
21:55:36  Absolutely. You are interpreting me correctly.
21:55:44  good old M-x design-typeface   duh
21:55:46  elliott, :P
21:55:52  elliott, anyway I didn't claim you meant that
21:56:05  elliott, but anything that makes this computation faster is a good thing...
21:56:13  Vorpal: the above is syntactically correct elliott.
21:56:54  CakeProphet, a "syntactically correct elliott", okaaay....
21:57:09  16:55 < elliott> Absolutely. You are interpreting me correctly.
21:57:13  Vorpal: There was no "a" in CakeProphet's statement.
21:57:43  Vorpal: perhaps you don't understand the syntax of CakeProphet.
21:57:51  elliott, indeed, but it was funnier that way
21:57:59  I am somewhat confused about what he meant thoughg
21:58:02  though*
21:58:21  just a slight play on words.
21:58:36  SHEESH AND NOW IT'S TOTALLY UNFUNNY BECAUSE I HAVE TO EXPLAININ ET AAAAAH
21:58:41  I'm going to the store. hmph.
21:59:32  elliott, yeah the HDR effects are destroying the pano. If I get time and happen to be in that location when it is cloudy, I will try again
22:00:57  Phantom_Hoover, you are now 4th in the queue
22:01:00 -!- l96 has joined.
22:01:14  Ngevd, WORK FASTER
22:01:16  Ngevd, queue to what?
22:01:43 -!- Zuu has quit (Ping timeout: 244 seconds).
22:01:50  Having his Pixel embark on a Quest
22:01:57  Ngevd, eh?
22:02:07  eh
22:02:18  His command for PixelQuest being used
22:02:26  Cracked... has confused backslashes with forward slashes.
22:02:30 * Phantom_Hoover applauds.
22:02:38  Ngevd, pixelquest being?
22:02:47  My MSPAFA
22:03:02  I literally have said this not ten minutes ago
22:03:02  Ngevd, can you expand that abbreviation?
22:03:21  Microsoft Paint Adventures Fanatic Adventure
22:03:25  I see
22:03:43  Ngevd, correct you did literally not say it within the last 10 minutes.
22:04:15 -!- Zuu has joined.
22:04:15 -!- Zuu has quit (Changing host).
22:04:15 -!- Zuu has joined.
22:04:20  more like 20 minutes ago
22:04:27  indeed
22:04:28  tsk tsk
22:04:50  At least I'm able to be misunderstood to be honest
22:05:13  :):):):):):):):):):):):):):):):):):):):)
22:05:22  hi
22:05:48  monqy: kp
22:06:28  aesrdtfyguhijokpl[;]
22:06:34  [;]
22:08:28  What does Canada, Japan, Switzerland have in common?
22:08:37  ais523, ping.
22:08:45  Phantom_Hoover: pong
22:08:45  zzo38, they're all islands?
22:08:45  zzo38: They're all US states.
22:08:52  "a".
22:08:55  Ngevd: are you serious :P
22:08:59  Ngevd, no
22:09:04  Japan's not an island
22:09:08  elliott: No.
22:09:10  Ngevd: No.
22:09:11  zzo38: they're all frends
22:09:16  Ngevd: Nor is Switzerland or Canada :P
22:09:17  ais523, what do I clip the ground lead on an anti-static wristband onto?
22:09:18  switzerland is an anti-island.
22:09:33  They are all famous for their military
22:09:35  Phantom_Hoover: an earthing stud
22:09:42  you can get ones that plug into the mains earth supply
22:09:46  that's what I do with mine
22:09:51  No. I am thinking of a different answer.
22:09:54  That's the 4th answer I've had so far.
22:09:57  (it's basically just a connection to the mains earth pin through a highish-valued resistor
22:09:59  )
22:10:02  All of them are completely different.
22:10:11  heh
22:10:31  It isn't military. It isn't location. It isn't language. Try again.
22:10:32  if someone answered "an earthed metal part of whatever you're working on", that answer is also correct, although arguably not as good
22:10:35  Phantom_Hoover: Isn't that one equivalent to "a grounded socket"?
22:10:41  Well, OK.
22:10:49  their flags are all white and red.
22:10:51  ais523, define an earthed metal part of it?
22:10:56  oerjan: Yes.
22:10:59  The case would qualify, I think.
22:11:00  Phantom_Hoover: a metal part of it that is intended to be connected to earth
22:11:02  like the case of a computer
22:11:19  zzo38, they're all in the set {Switzerland, Japan, Canada}.
22:11:29  zzo38: denmark belongs in that set too.
22:11:42 -!- l96 has quit (Quit: Leaving).
22:12:11  oerjan, no it doesn't? Don't you even know set theory?
22:12:27  Phantom_Hoover: the set of countries with red and white flags.
22:12:42  Oh, not {Switzerland, Japan, Canada}.
22:12:43  Denmark is not in the set {Switzerland, Japan, Canada}
22:12:44  oerjan: I didn't know. I just knew because once I was in a group and we had to draw flags in school, we assign three flag at random and I noticed that I only need the red and white pencil
22:12:56  ais523, and if the case is painted?
22:12:58  zzo38: wasn't the paper white?
22:13:03  Phantom_Hoover: you clip it to the inside of the case
22:13:06  ais523: I don't remember.
22:13:11  (I'm absurdly paranoid about blowing out the CPU by accident.)
22:13:11  this sort of thing is why people practically use separate earthing studs
22:13:38  (also, if you've built up a very large charge, a properly designed earthing stud will prevent you shocking /yourself/ when discharging it, which touching the case won't do)
22:13:52  I think it was a large poster paper
22:14:08  for something like a computer, it's in practice enough just to touch metal surfaces everywhere you walk
22:14:17  I do not remember much else about it.
22:14:20  I have a habit of doing that nowadays after spending four years as an electronic engineer
22:14:34  I note that "earthing stud" returns no relevant google shopping results :P
22:14:42  also, the maximum charge you can sustain depends on the weather (particularly humidity); on a rainy day there's unlikely to be much of a problem
22:15:45  ais523, but clipping it to the case would be perfectly adequate for normal purposes?
22:15:55  should be
22:16:09  assuming the case is properly earthed, but I don't see why it wouldn't be
22:16:27  Well, if it's not plugged in, for one thing
22:16:42  the basic idea is that an unplugged computer has a floating potential, so if you earth it at your own potential, then you can't shock any part of it
22:16:48  as the voltages everywhere are measured relative to yourself
22:17:15  Phantom_Hoover, as long as the case is grounded I presume?
22:17:32  well, ais523 made a good point there
22:17:43  Oh, so the problem is the CPU equalises charge with you, and then has a voltage relative to the *motherboard*?
22:18:00  Phantom_Hoover: right
22:18:12  it's not likely to stay for more than a fraction of a second, but a fraction of a second is enough to blow it out
22:18:19  ais523, what do you do with plastic computer cases
22:18:27  they are quite common in laptops especially
22:18:36  Vorpal: there's still likely to be an earth connection somewhere; although, I just earth to mains to avoid all these problems
22:18:36  Yeah, I thought the problem was discharges between you and the CPU.
22:18:54  Phantom_Hoover: well, the problem is that some of the pins of the CPU are at one voltage and some are at another voltage
22:19:04  so the voltage discharges through the CPU for a moment, and that gives it an overvoltage
22:19:09  ais523, still unclear on how one earths the case without plugging it in, though.
22:19:18  ais523, yes I generally just earthed myself to the mains when working in a computer. Worked fine so far. I guess I touched enough of the case to make it earth itself to me as well...
22:19:26  Phantom_Hoover: it's not a case of actually earthing it; rather, it's a case of setting its voltage relative to yours
22:19:38  Phantom_Hoover: You should just attach the other end of the strap to the inside of the wall socket.
22:19:41  by using its earth connection
22:19:42 * elliott good advice.
22:20:12  elliott: that's basically how a mains earthing stud works, except it's designed to make utterly sure it connects to the right pin, and there's a resistor in there to prevent you discharging too quickly and shocking yourself
22:20:19  elliott, that is fairly easy in Sweden, we have earth clips on the side of the socket.
22:20:24  Yeah, it's just like that except not being stupid :P
22:20:53 -!- pikhq_ has quit (Remote host closed the connection).
22:20:55  Vorpal: in the UK, the socket has an earth socket where the earth pin goes, and unless there's a pin in it, the live and neutral sockets are covered by plastic
22:21:00  and the earth pin is longer on the plugs
22:21:11  ais523, we have earth clips on the side. Not earth pins at all
22:21:26  it makes it very hard to touch the live or neutral by mistake, even if you're going around poking wires in there (which is nonetheless not advised)
22:21:32  ais523, this type of connector: https://en.wikipedia.org/wiki/Schuko
22:21:48  btw, the neutral can easily have enough of a voltage difference from earth to shock you, although it's rarely as much as the live has
22:22:12  depends on how much current's being used in each of the three phases of live
22:22:31  anyway my earthing system I use when working inside a computer is designed to be earthed to the ground clip.
22:22:35  (they use multiple phases so that they cancel out for the neutral, and so they only need massive wires to carry the live, the neutral can be carried with a reasonably simple one)
22:23:29  ais523, afaik you don't get three phase connections in the wall sockets unless it is for like washing machine or oven or such
22:23:33  ais523, so wait, the correct order would be to attach {motherboard, PSU}, attach the two, ground self on PSU, plug in CPU?
22:23:44  Vorpal: you get one of the three phases in the wall sockets
22:23:51  ais523, yes obviously
22:23:56  chosen at random
22:24:05  Phantom_Hoover: oh, you're plugging in a motherboard from scratch?
22:24:08  ais523, do they use different phases in different parts of the house or the same phase in a given house?
22:24:12  ais523, yes.
22:24:20  in that case, you should ground yourself both on the PSU, and on the antistatic foam that the CPU comes in (while it's still in the foam)
22:24:30  to equalise them to each other before you try to plug the CPU in
22:24:37  ais523, if the former there could be some issues with audio equipment connected to different wall sockets I imagine
22:24:42  This is the most complicated thing?
22:24:45  probably other stuff too
22:24:46  Vorpal: the former happens on occasion, the latter is more common
22:25:02  ais523, the former actually seems rather stupid
22:25:02  ais523, so motherboard, PSU, ground on PSU and foam, plug in CPU?
22:25:02  Phantom_Hoover: it's hard not to do by accident, the antistatic foam is designed so that you're probably going to touch it before you touch the CPU
22:25:03 -!- hagb4rd has quit (Quit: Nettalk6 - www.ntalk.de).
22:25:17  Phantom_Hoover: that's about right
22:25:31  and try not to touch the pins unless you have to; what causes the problem is different pins getting different voltages
22:25:33  ais523, attaching motherboard to PSU before grounding?
22:25:42  Phantom_Hoover is literally made out of static.
22:25:43  Phantom_Hoover: ground before you attach anything
22:25:45  each component individually
22:25:52  the motherboard has chips on too
22:26:11  ais523, OK, but attach motherboard to PSU and ground on PSU before foam and CPU?
22:26:13  and ground yourself before you touch any pins of anything; they'll probably be quite near to earth potential, so you should be too
22:26:15   and try not to touch the pins unless you have to; what causes the problem is different pins getting different voltages <-- why would you have to? There are other reasons than static to avoid touching the pins as well
22:26:22   Phantom_Hoover is literally made out of static.
22:26:25  I advise that you start off by touching part of your house's water supply system
22:26:27  DID I NOT TELL YOU ABOUT THE JUMPER
22:26:32  the copper on a radiator, a metal tap, something like that
22:26:42  ais523, I'm not sure that a bit of human skin fats on a high speed data transfer pin of a CPU is a good idea at all :P
22:26:43  ais523: OK now I'm imagining Phantom_Hoover just walking around the house touching things.
22:26:44  those are typically all connected to mains earth to make it easier to route around a house
22:26:48  elliott: I actually /do/ that
22:27:08  ais523 is fully prepared in case the electrons invade.
22:27:13  He touches a rubber ducky in the bath and is seen. "It's for safety," he says. His spotter leaves, and he touches the rubber ducky a few more times. It isn't for safety, he just likes rubber duckies.
22:27:13  Vorpal: well, OK, but typical sockets are designed to work around the problem
22:27:25  Phantom_Hoover: comment on accuracy of my fanfiction.
22:27:28  WER{W))RE{e{E$}]3[[
22:27:31  hi I'm here now.
22:27:33  rejoice.
22:27:39  I've cut my finger on IC sockets a few times, though
22:27:39  ais523, I tend to do that as well during winter, due to the dry air the charge tends to build up otherwise. And then you get a strong chock rather than a small one when you touch something grounded anyway
22:27:44  not sure if I've ever done it on the chip itself
22:27:45  or if you have not already joiced, you may joice now.
22:27:46  elliott, I don't have a rubber duckie :(
22:27:55  ais523: ouch
22:27:56  Vorpal: right, it's a valuable life skill
22:28:03  heh
22:28:04  getting randomly shocked is annoying
22:28:09  yes
22:28:14  elliott: I've burnt myself a couple of times with a soldering iron too
22:28:18  it's painful but heals quickly
22:28:28  ais523: Soldering irons scare me intensely.
22:28:33  It's like WIELDING FIRE
22:28:48  ais523, also I don't know what is up with my electrical piano. It builds up a potential compared to the computer case when connected to the computer using USB, but not when connected using a classical midi cable
22:28:51  elliott: have you seen a solder gun? I haven't, but they're like soldering irons except they heat up and cool down really quickly
22:28:59  so if you're mad, you can solder something with one, then turn it off and put it in your pocket
22:29:10   ais523: Soldering irons scare me intensely.
22:29:11  ais523, and the piano isn't grounded for some reason. It uses an europlug
22:29:19  ais523: So it's a soldering iron except it doesn't warn you that it's hot? AIEEEEEEEEEEEEEE
22:29:21  I did soldering in physics in first year.
22:29:26  Phantom_Hoover: AIEEEEEEEEEE
22:29:28  Vorpal: hmm, I suspect the classical midi cable has separate chassis ground and signal ground; I'm not sure if USB does
22:29:34  perhaps that could be it
22:29:34  The physics teacher promised us a cake day if none of us burned ourselves.
22:29:44  We did not get that cake day. Nor did any other classes, ever.
22:29:49  ais523, I'm pretty sure classical midi cables are specced to use optoinsulators
22:29:52  ais523, so yeah I guess so
22:29:58  Phantom_Hoover: I want cake day.......
22:30:02  (I never burned myself, also I was the soldering master.)
22:30:09  (the leading theory behind the magic/more magic switch in the hacker story is that the switch connected chassis and signal ground together, btw, which could quite possibly knock a computer offline)
22:30:22  elliott, now my chemistry class has weekly cake days.
22:30:36  Phantom_Hoover: but you don't use soldering irons in chemistry class, typically
22:30:37  ais523, yeah
22:30:53  We were going to have a Cake Day in Further Maths weekly, but we got bored of it after three weeks
22:31:22  Ngevd: I'd be impressed if someone managed a soldering iron burn during Further Maths class
22:31:34  ais523: What if you baked a cake with a soldering iron.
22:31:37  The maths class have weekly cake days too, but I'm banned from the entire maths department for not unrelated reasons.
22:31:40  oh right, Ngevd is British because he's from Hexham
22:31:46  ais523: Also you have to solder the numbers together.
22:31:49  That's why it's further maths.
22:31:55  elliott: quite difficult to do, and it'd have to be a new soldering iron not to have solder on the tip
22:32:04  ais523: Solder cake!
22:32:15  Isn't solder poisonous?
22:32:17  if the tip of a soldering iron becomes desoldered, it actually makes it pretty hard to solder with, you have to cover it with solder to get it soldering again
22:32:25  Ngevd: yes, heavy metal poisoning
22:32:26  Ngevd: Poisonous and DELICIOUS.
22:32:41  (I got kicked out of maths because I was bored and did nothing of any use to anyone, and then swooped into the class next cake day and made off with some cake.)
22:32:42  although the new RoHS stuff, which contains no lead, isn't so bad, it's still inadvisable to eat it
22:33:10  Phantom_Hoover: They /banned you/ for that?
22:33:17  elliott: freeloading and eating cake?
22:33:23  that seems like a bannable offense
22:33:23  ais523: The two most human things!
22:33:30  Excuse me, *stealing cake
22:33:34  Kids, don't eat solder. It makes you look stupid.
22:33:37  It was a heist!
22:33:38  excrement unto;
22:33:40  Phantom_Hoover: It's not stealing if it's cake.
22:33:47  elliott, well maybe.
22:34:15  But anyway, I'm ~not part of the maths department~ now, i.e. they don't like me very much.
22:34:21  We haven't had a cake day in Latin for a while.
22:34:35  There are 6 of us, includin the teacher
22:34:47  Ngevd, I got kicked out of my old school the year before we started having Latin cake days.
22:34:51  The cake I generally bring is enough for 16
22:35:00  Phantom_Hoover, :'(
22:35:15  (This is the one I wounded someone with a spoon at.)
22:35:18  Phantom_Hoover: This is because you killed someone with a spoon and then stole some cake.
22:35:47  elliott, you cloned yourself and your clone kicked someone in the face.
22:35:51  Yes.
22:35:58  You're not one to talk
22:36:29   Phantom_Hoover: They /banned you/ for that?
22:36:38  Like I said, I was doing nothing of any use to anyone.
22:37:01  I wasn't that bothered, frankly; I got to muck around in the library instead.
22:37:12  I WOULD NEVER HAVE MET APT GUY IF THEY HADN'T
22:37:34   elliott, you cloned yourself and your clone kicked someone in the face. <--- now I have a huge urge to get ais523_ to log on and kick you
22:37:49  but I'm not at work, and it'd take a while to get there to get ais523_ online
22:47:46  My ancient history class has two people called Theo
22:47:58  But none called Telemachus
22:48:12 -!- pikhq has joined.
22:48:31  If I ever have a son, I'll call him Telemachus, or Mac for short
22:49:23  ais523, you could connect twice from the same computer
22:49:44  Ngevd, better than elliott's choice.
22:49:45  Vorpal: but then it wouldn't be ais523_
22:49:48  it'd just be me using the wrong nick
22:49:50  (It's 'Azimuth'.)
22:49:52  ais523, ...
22:49:54  (That's not even a name.)
22:49:55 -!- sebbu has quit (Ping timeout: 240 seconds).
22:50:34  Vorpal: *…
22:50:47 * Phantom_Hoover -> sleep
22:50:48 -!- Phantom_Hoover has quit (Quit: Leaving).
22:51:03 -!- sebbu has joined.
22:51:03 -!- sebbu has quit (Changing host).
22:51:03 -!- sebbu has joined.
22:55:08  well I'm actually managing to make something out of this skyrim panorama I think
22:55:14  I worked around the HDR issue mostly
22:57:29   Ngevd, I got kicked out of my old school the year before we started having Latin cake days. <-- so what is "cake day" in latin?
22:57:46  Dammit, I know this...
22:58:06 -!- sebbu has quit (Read error: Connection reset by peer).
22:59:03 -!- sebbu has joined.
22:59:34  dies placentis
23:00:00  hi
23:00:31 -!- CakeProphet has changed nick to PlacentaProphet.
23:00:53  `? welcome
23:00:56  Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
23:01:21  ais523: thanks
23:01:24  Ngevd: eww
23:01:45  PlacentaProphet: heh, I was wondering who'd assume that that was targeted at them
23:01:48  o
23:01:52  English has come a long way from Latin
23:01:57  Maybe in the wrong direction
23:02:44  "that that" is the best construction of English.
23:03:20  PlacentaProphet, is the fully English language version of you a prophet that is a cake, one who prophesizes about cake, or something else
23:03:26 -!- zzo38 has quit (Remote host closed the connection).
23:03:30  ais523: You should totally debug my Python code!!!
23:03:37  Blame Gregor.
23:03:40  Wait no PlacentaProphet you do it.
23:03:47  Ngevd: I wasn't aware I had differing localizations.
23:03:54  Ngevd: it's someone who prophesizes about a cake that makes you think you are a cake.  i assume.
23:04:19  in any case the former would be ProphetCake
23:04:33  In which case you want placentarumPropheta
23:04:46  no I want PlacentaProphet
23:04:50  because this is still English.
23:05:00  I'm just using a Latin loanword.
23:05:02  YES BUT IT IS ALSO INCORRECT LATIN
23:05:09  TWO LATIN LOAN WORDS
23:05:31  yes in much the same way that "lo siento" is incorrect English.
23:05:42  Placenta Prophet is also incorrect Latin.
23:06:11  BUT IT IS ONE LETTER OFF CORRECT LATIN
23:06:44  "It translates as flat cake. It isn't cake like you think of birthday cake today. A better translation would be flat bread."
23:06:58  -- some dude on the Internet?
23:07:06  Like stottie cake?
23:07:07  http://uk.answers.yahoo.com/question/index?qid=20100906064119AAICqB3
23:07:13  so yeah
23:07:23  I mean, yeah, that makes sense historically.
23:07:41  I like stottie cake
23:07:47  PlacentaProphet: FIX MY C;ODEK
23:07:54  elliott: sauce plz
23:08:15  I will put my delicious placentas to work.
23:08:38  PlacentaProphet:
23:08:39  https://bitbucket.org/ehird/hackbot/raw/d135b69e88f1/multibot_cmds/PRIVMSG/tr_60.cmd
23:08:40  https://bitbucket.org/ehird/hackbot/raw/d135b69e88f1/multibot_cmds/lib/server
23:08:52  oh my python
23:08:58  b
23:09:03  err
23:09:05  ignore that
23:09:08  Sometimes the server gets messages that look like [] or ['#channel'] for no obvious reason
23:09:16  Despite the fact that no other messages are cut off or whatever
23:09:18  Fix plz thanks
23:09:24  ['#esoteric']
23:09:26  I blame dynamic typing. brb food then I'll look.
23:10:55  ais523: The server server (i.e. lib/server) :P
23:12:11 * ais523 /quote ['#esoteric']
23:12:27  (I actually did that)
23:12:55 * Ngevd shakehead
23:13:02 * oerjan good grammar
23:13:14  hi
23:13:20 * oerjan hi
23:13:29  perhaps I should send that to other random servers for a while
23:13:52  `? welcome
23:13:54  Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
23:14:00  elliott: data = server.recv(4096).split('\0')  #here?
23:14:10  ais523 is seeing people who aren't here.
23:14:20  how rude
23:14:21  oerjan: no, I just decided that if I did it randomly for a while
23:14:27  PlacentaProphet: Yes, that is indeed the part that receives shit :P
23:14:34  lol
23:14:35  then when I did it to people who have been here for ages and I just didn't notice, nobody would notice /me/ doing it
23:14:36  good
23:14:42  ais523: lol
23:15:02  Maybe set up Hackego to do a welcome every half-hour?
23:15:38  elliott: when does this "sometimes" happen? seemingly at random?
23:15:43 -!- augur has quit (Remote host closed the connection).
23:15:58  Yes, usually after some other commands go through (typically when it's two at once but not always)
23:16:45  elliott, skyrim panorama (huge image, might want to open in, say, gimp rather than the browser depending on how much ram you have and which browser): http://whotookspaz.org/~anmaster/images/skyrim/near-solitude.jpg (yes I'm aware of the hole, I fucked up the overlap a bit yes)
23:17:15  Opened in Chrome without a freakin' hitch
23:17:20  elliott, right
23:17:28  The white bits on the water are really badly-artefacted. :/
23:17:45  elliott, I think they are specular highlight
23:17:46  Where's the hole
23:17:56  elliott, and in the rock. I filled it with black
23:18:01  near the left edge
23:18:06  Oh, there
23:18:06  And damn, that foliage needs more smoothing :P
23:18:16  elliott, what?
23:18:22  Near the right hang side
23:18:26  It's really jaggedy
23:18:30  s/hang/hang/
23:18:32  s/hang/hand/
23:18:33 -!- pkzip has joined.
23:18:37  oh yeah
23:18:38  hang
23:19:02 -!- pkzip has left.
23:19:03  elliott, blame a bit on the perspective. After all some pixels get dragged out over several due to the panorama
23:19:10  elliott, especially near the edges
23:19:32  I've thought that about a lot of Skyrim screenshots I've seen tbh :P
23:19:34  re the foliage
23:19:37  rip pkzip killed by pkzip
23:19:41  well there is some of that too
23:19:45  monqy: Have you fixed my Python code???
23:19:59  elliott: I have no idea but it sounds like weird networking stuff. try passing the socket.MSG_WAITALL flag? no clue.
23:20:18  PlacentaProphet: MSG_WAITALL only applies to stream sockets.
23:20:18  elliott, you should check out witcher 2 screenshots
23:20:44  elliott, I will try to find some time to make some next week. Then there will be awesomeness. Can't do panorama, always third person view so...
23:20:56  elliott: no i have python code of my own to nightmare about
23:21:09  except it's not my own i have to share it
23:21:09  elliott, and thankfully unlike minecraft, skyrim has no parallax. That makes panoramas much easier
23:21:09  Vorpal: You could panorama and just have a big fuzzy mass of nonsense in the middle
23:21:15  Or, well, not in the middle, all around
23:21:21  I'm sure you can hack it to make the player invisible though :P
23:21:26  elliott, err, you would get parallax
23:21:33  More like shamarallax
23:21:35  elliott, because the camera rotates around a point outside of it
23:22:00  ooh a new list of ideas entry
23:22:03  exciting
23:22:03  Vorpal: BTW, http://deadendthrills.com/ have been doing a bunch of Skyrim posts and they look unreasonably good.
23:22:14  elliott, anyway there is a lot of details that won't be visible in static screenshots. Like how plants move in the wind
23:22:23  (Note to everybody: Do not click unless you want to feel inadequate about your hardware, whatever hardware you have :P)
23:22:37  elliott, in oblivion that looked really faked. It looks kind of okay in Skyrim. It looks utterly awesome in Witcher 2
23:22:50  elliott: does that apply even to me? my hardware's typically so bad that seeing better hardware doesn't make me feel inadequate about it
23:23:02  elliott, what is that site about?
23:23:16  ais523: You might want to downgrade to a sock to be safe
23:23:28  Vorpal: It's, like, video game photography.
23:24:06  elliott, anyway, I can play Skyrim on ultra. I can play Witcher 2 on ultra except for the supersampling option. I don't see how I could feel inadequate about my hardware here.
23:24:12  The guy mods up the games to hell and back again to get the best graphics he possibly can, runs them at 2160p, and use time-stopping shit and debug consoles to pose a screenshot :P
23:24:19  elliott: if it continues running does it receive the rest of an IRC line later?
23:24:24  elliott, heh
23:24:56  Some of them look ridiculously good: http://farm7.static.flickr.com/6058/6233836408_00ef719628_b.jpg, http://farm7.static.flickr.com/6185/6147515320_689b9546f9_b.jpg
23:24:58  elliott, there are already some HD Skyrim mods. And the official modding tools are not yet released.
23:25:05  Aw, those hotlinks don't work. :/
23:25:12  elliott, are both rage?
23:25:15  elliott, and they work for me
23:25:33  elliott, I know one of them is Rage
23:25:36  One of them is Rage and the other one is Hard Reset, which apparently everyone has praised for having good graphics while being terrible in all other aspects :P
23:25:50  elliott, Rage has *badly* uneven graphics quality
23:25:51  PlacentaProphet: It doesn't receive IRC lines, but no, like I said, it never receives the rest of a message, no message is ever cut off, etc.
23:26:06  it might be state of the art for one object, but right out of NWN1 for another
23:26:19  Vorpal: Apparently he basically has to avoid textured surfaces like the plague :p
23:26:42  elliott, well, pretty much all surfaces are textured in modern games
23:26:54  elliott, but I guess he avoids them up close
23:26:58  which makes sense
23:26:59  elliott: is it datagram weirdness? why are you using a datagram socket?
23:27:02  Vorpal: That's what I meant.
23:27:06  PlacentaProphet: Because I don't want a stream socket?
23:27:21  There are multiple processes writing to it, etc.
23:27:28  what are you talking about, everybody loves stream sockets.
23:27:29  okay, fine.
23:27:30  elliott, and I wasn't aiming for making it look good. Rather I was aiming for a representative view of it
23:27:38  Yar
23:27:46  Heh, http://farm7.static.flickr.com/6110/6335388665_efa3b91f92_b.jpg shows the water artefacts too
23:28:06  elliott, though some stuff are more noticable in a still image. I mean, a lot of stuff moves, so you don't really see the white stuff like that
23:28:11  because it changes
23:28:14  yeah
23:28:40  elliott, anyway I didn't notice those artifacts in game
23:28:40  Deewiant: Do you have a link handy to that massive list of all graphics cards in order of approximate goodness
23:30:08  elliott, quoting from that site: "Why wouldn’t you assume that a game scarcely bigger than an Xbox 1 DVD would look like ass? Here’s one reason. The new Elder Scrolls might not be a Witcher 2 when it comes to texture resolution (yet), but it’s definitely a Morrowind in its art direction. Unfortunately, it’s also an Oblivion when it comes to making a first impression."
23:30:09  yep
23:30:11  pretty much
23:31:10  "Tools and tricks: twofold increase in landscape cell loading distance, large address aware patch to TESV executable, free camera, no-HUD, 2160p rendering, timecycle adjustment, custom FOV." <-- will have to try those out
23:31:14  well some of them
23:31:21  free camera is useless for playing
23:31:29  Free camera, no-HUD, and 2160p rendering are DEFINITELY super useful to you.
23:31:42  no by landscape cell loading distance might be
23:31:58  Msot of the Skyrim screenshots only seem to be on http://www.flickr.com/photos/duncanjharris/sets/72157628114774012/detail/, btw
23:32:00  I just hope it doesn't do what oblivion did when you changed that outside the range available in the GUI config
23:32:04  `addquote  ais523: You might want to downgrade to a sock to be safe
23:32:05  which was to fuck up badly
23:32:06  716)  ais523: You might want to downgrade to a sock to be safe
23:32:09  I said sock?
23:32:11  I meant to say rock
23:32:13  But sock is better
23:33:41  elliott: do AF_UNIX datagram sockets not require listening and accepting stuff? I doubt that's a problem since you're actually receiving data.
23:33:58  PlacentaProphet: You're not meant to listen from them.
23:33:59  elliott: improvement typo!
23:34:00  That's sort of the point.
23:34:04  I will call it an "improvemeny"
23:34:20  ais523: That's a terrible name.
23:34:21  elliott: I've never used sockets in this manner, is why I ask.
23:34:24  I wonder if Aeneas ever met Odysseus while they were both lost in the Mediterreanean....
23:34:32  PlacentaProphet: And that is why I answered.
23:34:36  excellent.
23:35:21  so yeah uh... I have no idea. it appears to be happening in code completely unrelated to this source.
23:35:27  so maybe you should check out the programs you're talking to?
23:35:52  PlacentaProphet: I linked the single program that talks to it.
23:35:56  ah okay.
23:38:25 -!- augur has joined.
23:40:13  elliott, according to http://deadendthrills.com/faq/ his system isn't that much better than mine at all. I think the GPU might be slightly better. And I have a newer generation CPU I think, though iirc with less cache.
23:40:40  elliott, I certainly have more RAM. He has a larger SSD
23:40:51  I have way larger HDDs
23:40:53  I believe the GTX 580 is the highest-end non-SLI card Nvidia do
23:40:59  But I might be wrong
23:41:03  elliott, ther eis GTX 590 too
23:41:05  there is*
23:41:15  elliott: it seems to me that there's no seperator between multiple sends. is that okay?
23:41:19  RAM isn't really that relevant above a certain point, and storage space is completely irrelevant :P
23:41:22  PlacentaProphet: That's why it's a datagram socket
23:41:23  elliott, but yes, he has a somewhat better GPU. Still not that much of a different
23:41:48  elliott, anyway he isn't doing real time rendering when taking this screenshots. 40 FPS at the time would be just fine
23:41:53  elliott: ah okay.
23:42:00  Vorpal: There is no way he gets 40 FPS.
23:42:02  the datagram is the seperator.
23:42:03  these*
23:42:04  got it.
23:42:05  "That bit’s important, though, because it means I run their hardware at temperatures that could fry an egg."
23:42:14  Vorpal: I'm like 99% sure overclocking is probably involved.
23:42:19  elliott, I'm just pointing out that it wouldn't matter when taking those screenshots
23:42:48  GTX 590 is one of those two-GPU things.
23:42:53  So it doesn't really count.
23:43:04  elliott, I heard of someone with two GTX 590 in SLI
23:43:07  so quad GPUs?
23:43:16  something like that anyway
23:43:19  I don't think you can do that
23:43:24  I thought CrossFire was the only one that let you do >2 gpus
23:43:28  hm
23:43:43  elliott, maybe you can when they are on the same card? I don't know.
23:45:52  I'm dissapointed that it is not possible to do GCSE or A-Level Finnish
23:46:44  elliott: try using sendall instead of send. I doubt it matters though.
23:46:59  Nor the Scottish equivalents thereof
23:47:13  PlacentaProphet: That would result in multiple send()s being used.
23:47:17  Which would break the server.
23:47:34  PlacentaProphet: And like I said, /no message gets cut off at any point/.
23:47:38  So all the data is always being sent.
23:47:53  elliott: I thought datagram sockets were inherently unreliable?
23:48:09  It's a fucking Unix socket!
23:48:23  Unless Gregor is secretly fucking up the bits, there is no reason for this to be happening.
23:48:39  No messages ever fail to send, but occasionally a phantom message with just one or none of the fields in the wrong order appears for no apparent reason.
23:49:01  Can you identify and ignore them?
23:49:16 -!- jix has quit (Ping timeout: 256 seconds).
23:49:18  "A lot of folk asking the about my Rage config, so here it is. Bear in mind, though, that I’m running the game at 2160p (at 60fps, Carmack, you beast) and using 64x multisampling on the screenshots, then downsampling x2."
23:49:23  64x multisampling
23:49:24  Ngevd: I... would rather figure out why they are happening.
23:49:24  wow
23:49:53  alright people
23:49:58  no
23:49:59 -!- jix has joined.
23:49:59  lemme ask you a very important question
23:50:01  very very important
23:50:01  no
23:50:03  no
23:50:21  if i showed you 4 squares and a rectangle, and they all looked like the same color
23:50:23  and i asked you
23:50:28  point to the one with the different color
23:50:35  i would punch you
23:50:36  would you be inclined to point to the rectangle
23:50:43  hope this helps
23:50:46  elliott: well yes based on the code I'm inclined to agree that there's no reason for that to be happening.
23:50:47  be inclined to punch you
23:50:55  Be inclined to flip you off, really.
23:51:05  some dipshit on reddit says that people would point to the rectangle
23:51:06  elliott: which is why I believe it's low-level issue.
23:51:08  moral of the story "nobody likes having science done to them"
23:51:08  +a
23:51:12  because its visibly different
23:51:18  I'd point to the PAGE THEY ARE PRINTED ON
23:51:22  flip off with one hand, punch with the other
23:51:23  Ngevd: :)
23:51:27  augur: tbh i might do it as a kneejerk thing but it's such a contrived scenario
23:51:29  augur: I suppose if you gave them a second or less?
23:51:45  if you were asked for the different _color_?
23:51:46  really?
23:51:49  nonsense.
23:52:05  words are confusing
23:52:15  augur: "Different->oh that's different->wait, you said 'color'? fuck you"
23:52:33  augur: the question is whether we have an intuitive sense of colour really...
23:52:33  pikhq: eh
23:52:39  as in, differing from things just looking different
23:52:50  elliott: well, yes obviously you would do this with people who know what color is :P
23:52:57  augur: har har
23:53:01  augur: but i mean like what with the "name the colours of these words that are names of other colours" thing
23:53:09  i dunno if we're so good at colours :P
23:53:21  elliott: oh yes but thats a very different task
23:53:24  Colours come from language
23:53:32  all that shows is interference between description and reading
23:53:35  people are more inclined to read
23:53:50  just because the linguistic aspect is so dominant, while color description is not
23:53:58  but people can still describe colors
23:54:01  its not like they cant
23:54:12  i cant describe colours what is purple??
23:54:14  and if you give someone as long as they want to answer, they're not going to pick the fuck rectangle
23:54:18  elliott: its purple!
23:54:20  you just said!
23:54:35  THAT'S A WORD NOT A DESCRIPTION
23:54:43  description word
23:54:44  same thing
23:54:44  Also how do you distinguish a fuck rectangle from a regular rectangle.
23:54:53  the fuck
23:54:57  elliott: by whether or not a dick is on it
23:54:58  obviously
23:55:12  dectangle
23:55:19  elliott: is there any more relevant code? for example, the code that's passing shit to the sending code?
23:55:38  PlacentaProphet: that's called `an irc server'
23:55:43  Well, multibot
23:55:48  multibot ain't broken because see HackEgo here
23:55:58  elliott: dicktangle
23:56:11  PlacentaProphet: But like I said, the channel comes in as the /first/ list element
23:56:15  Which never, ever happens with that sending code
23:56:16 -!- copumpkin has quit (Read error: Connection reset by peer).
23:56:41 -!- copumpkin has joined.
23:56:41  elliott: so like, you printed what the sender sends, and then printed what the receiver receives
23:56:44  and....
23:56:46  they're different?
23:56:57  I haven't traced the sender yet because it's literally impossible for it to be breaking but fiiiiiiine.
23:57:05  elliott: DO IT
23:57:13  NOTHING IS IMPROSEBLE
23:59:32  # 60 = `
23:59:36  wat
23:59:43  60 = `

2011-11-14:

00:00:12  I may make a Piet-like language with pure functions
00:00:28  !python ord(60)
00:00:32  Traceback (most recent call last):
00:00:32  um
00:00:39  !python print chr(60)
00:00:39  > ord 60
00:00:39  ​<
00:00:39  thanks python
00:00:40    No instance for (GHC.Num.Num GHC.Types.Char)
00:00:40     arising from the literal `6...
00:00:47  > chr 60
00:00:48    '<'
00:00:50  Wait, what
00:00:52  !python print chr(0x60)
00:00:52  ​`
00:00:54  There :P
00:01:03  uh....
00:01:07  > chr 6*16
00:01:08    No instance for (GHC.Num.Num GHC.Types.Char)
00:01:08     arising from the literal `1...
00:01:12  okay? why is that a comment?
00:01:16  > chr (6*16)
00:01:17    '`'
00:01:36  PlacentaProphet: Because
00:01:38  `poop
00:01:39  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: poop: not found
00:01:46  ^chr 96
00:01:46  `
00:01:48  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: : not found
00:02:05  PlacentaProphet: It's in tr_60.cmd
00:02:24  Gregor: btw what does the tr actually stand for
00:02:31  One step no darker -> id
00:02:37  One step one darker -> const
00:02:44   would you be inclined to point to the rectangle <-- i would be inclined to say that vision has enough unintuitive illusions that i wouldn't try and guess the result by reasoning.
00:02:45  One step two darker -> ap
00:02:45  hi Ngevd
00:02:50  Hello
00:02:56  oerjan: :P
00:02:57  I have been here for a while
00:03:08  oerjan: im just incredibly skeptical that people would do that
00:03:11  Thinking of a Piet-like language with pure functions
00:03:18  whereas someone on reddit is certain people would
00:04:05  It will also be self-modifying
00:04:07  Yeah, that's the sort of thing where the only way to be certain would involve actually doing the study.
00:04:23  And disguising it so people don't hesitate for five minutes :P
00:05:15  anyway that study is stupid.
00:05:25  elliott: so is the sender sending the thing that the receiver is receiving
00:05:28  With two stacks
00:05:29  this is a good first step.
00:05:33  pikhq: well i'd do the study if i could
00:05:33  Ask Gregor/
00:05:37  s/\//./
00:05:38  One with bignums, one with functions
00:06:01  @ask Gregor so is the sender sending the thing that the receiver is receiving
00:06:02  Consider it noted.
00:07:42 -!- Ngevd has quit (Quit: long shot but fungot).
00:08:22  elliott: also I'm pretty sure you don't have to declare commit_queue global
00:08:29  Yes but I wanted to.
00:08:58  whatever lets you sleep at night.
00:09:07  Too late, I used Python.
00:10:37 -!- Haschim has joined.
00:10:50  also Transaction could just inherit from Thread and then you don't need to define your own start.
00:10:53  but whatever
00:11:19  I suppose the debugging output is handy.
00:13:08  command += ['-R', hackenv]   I am led to believe that .extend() is faster than += on lists. this is a matter of grave importance.
00:13:13  augur: Seems like a lot of effort just to show up a random guy on Reddit, though. :P
00:13:34  pikhq: well, its part of a bigger discussion regarding color perception
00:13:35  elliott:  obviously I've reduced my efforts to nitpicking your code since I have no clue what is actually causing the bug.
00:13:40 -!- Haschim has left.
00:13:42  PlacentaProphet: Wait, wait, let me try to care: HNNNNNNNG can't.
00:13:44  pikhq: dealing with some very subtle issues
00:13:52  really, i want to talk to some himba speakers
00:13:56  but thats not possible.
00:14:08  command += list(args)
00:14:11  this is so wasteful
00:14:13  in so many ways.
00:14:26  command.extend(args)  bam!
00:15:01  PlacentaProphet: args is a tuple.
00:15:13  that's fine.
00:15:13  augur: Yeah, color perception is hella weird. You'd know better than I, of course.
00:15:17  tuples are iterable
00:15:21  extend works on any iterable.
00:15:33  pikhq: no, its actually not very weird, not in regards to what im talking about anyway
00:16:01  PlacentaProphet: Join #hackbotloony
00:16:02  Well, it just seems weird that it's to an extent affected by language.
00:16:04  Spam it
00:16:10  pikhq: the issue is more that people don't understand that translations aren't perfect, and so relying on translations when doing science is very bad
00:16:11  You'd think that, e.g. "blue" would be a universal concept.
00:16:22  pikhq: no, its not affected by language
00:16:31  elliott: BAHAHAHA DUCK TYPING BITCH
00:16:32  augur: Okay, maybe I'm describing this wrong.
00:16:36  TUPLES QUACK LIKE ITERABLES DAWG.
00:16:37  no you're not
00:16:47  you're just mislead by fluff popsci crap
00:17:01  Python should have a quacks like keyword operator
00:17:12  if tuple quacks like iter:
00:17:14  augur: But, e.g. Japanese "aoi", though usually translated as "blue" really can't be translated that naively.
00:17:21  sure
00:17:22  PlacentaProphet: You are not spamming.
00:17:31  and?
00:17:37  It refers to things that are blue, sure, but on the other hand it can refer to some things we'd consider green.
00:17:41  And that seems rather strange.
00:17:44  elliott: should I be?
00:17:51  oh
00:17:53  yes.
00:17:56  yes i suppose it "seems rather strange"
00:18:08 -!- ais523 has quit (Remote host closed the connection).
00:18:13  i mean, it doesnt seem strange to me, but whatever
00:18:45  I guess what I'm really coming down to is "language works differently than the layman expects it to".
00:18:53  thats true
00:18:57  but
00:19:02  anyway.
00:19:12  Anyway, bit of a tangent. Whoooo.
00:23:17 -!- pkzip1 has joined.
00:23:38 -!- pkzip1 has left.
00:24:40 -!- elliott has quit (Remote host closed the connection).
00:25:16 -!- elliott has joined.
00:29:39 -!- evincar has joined.
00:29:45  > odd . floor $ tan 1.57
00:29:47    True
00:30:36  pikhq: the real problem, i find, is twofold
00:30:48  one, people love this popular whorfian bullshit
00:30:58  and they find any excuse to believe it
00:31:00  for some fucking reason
00:31:09  that's why they're all learning klingon.
00:31:15  two, people don't realize that words dont always mean the same thing to everyone else
00:31:37  What? People still believe in linguistic relativity? :(
00:31:46  hi
00:32:02  evincar: usually just mild forms of it, but yes
00:32:14  Man, freaking Sapir-Whorf.
00:32:23  evincar: i got a question about number of words for snow on a quiz just the other day.
00:32:28  Well, there are some limited situations in which it can be shown to apply...
00:32:34  strangely, for sami, not eskimo.
00:32:42  Particularly as presented in 1984. Newspeak was such a dumb idea.
00:32:52  According to an article I read once, English has more words for snow-related things than Inuit or whatever.
00:32:53  evincar: if by "apply" you mean "imperceptably", yes.
00:33:10  If you count sleet, hail, etc.
00:33:16  English has a lot of words in general.
00:33:21  So that's unsurprising.
00:33:24  "Thoughtcrime is doubleplusgood" Seriously, Orwell? You thought that couldn't be done?
00:33:30  and if by "apply" you mean "only when doing language tasks", yes
00:33:47  Anyways: it's not like neologisms are *uncommon*.
00:33:49  pikhq: E-prime pisses me off
00:34:06  oh your language lacks a copula, therefore it prevents people from expressing opinion as fact
00:34:09  no
00:34:10  no it doesnt
00:34:14  you piece of shit
00:34:16  liar
00:34:19  Hah.
00:34:20  child rapist, you
00:34:27  If a speaker of a language doesn't have a word for a concept, but needs to talk about that concept, they will *make something up*.
00:34:44  I want to hear you call Benjamin Whorf a child rapist.
00:34:44  pikhq: obviously in oceania, neologisms are treason.
00:34:49  And record it and
00:34:52  watch it over and over.
00:34:55  evincar: benjamin whorf isnt the e-prime guy
00:34:56  but
00:35:00  pikhq: you have too much faith in the creativity of the average person.
00:35:01  oerjan: Eh, in Oceania everything's treason anyways.
00:35:19  PlacentaProphet: even without neologisms, you have periphrasis
00:35:47  well yes.
00:36:47  my understand was that the Sapir-Whorf hypothesis claimed that using a particular language resulted in thinking about things /differently/, not necessarily that things can become /impossible/ to express.
00:37:09  That's right.
00:37:10   oh your language lacks a copula, therefore it prevents people from expressing opinion as fact <-- i could imagine a language with some kind of evidentials so that you could not confuse opinion with fact without outright lying...
00:37:12  PlacentaProphet: The strong form of the hypothesis makes the claim that things can become impossible to express.
00:37:15  But Orwell took it into fictionland.
00:37:44 -!- tiffany has quit (Quit: nyu~).
00:37:50  it might not actually exist, or be stable, but i could imagine it.
00:37:50  oerjan: We imagine languages all the time that don't actually exist.
00:37:54  The strong form of the hypothesis, of course, is incredibly bullshit.
00:38:31  oerjan: that language is called Quechua
00:38:33  and you dont have to lie
00:38:36  you just have to be wrong
00:38:47  or not understand that your opinion isnt fact
00:38:48  a language as a map of words to meanings could, at a single point in time, be unable to express a word. of course in practice this is not how languages work.
00:39:13  and this is not certainly how the human brain works.
00:39:15  elliott, this is oblivion: http://deadendthrills.com/wp-content/uploads/2011/06/Oblivion-2011-06-07-23-56-58-24.jpg
00:39:18  I don't believe that
00:39:27  Oblivion with at housand mods :P
00:39:31  thats not oblivion
00:39:34  s/at housand/a thousand/
00:39:39  unless that.
00:39:47  augur, exactly what elliott said
00:39:50  I just want those mods
00:40:00  he doesn't list them
00:40:00  you just wanna jerk off to that chick
00:40:04  XD
00:40:05  and this is not certainly how the human brain works Morrowind that give it Oblivian-esque graphics
00:40:08  http://deadendthrills.com/?cat=141
00:40:12  I wouldn't be surprised if such mods existed in Oblivion.
00:40:20  lol wat
00:40:25   and this is not certainly how the human brain works Morrowind that give it Oblivian-esque graphics
00:40:26  what
00:40:35  I must have pressed up at some point :P
00:40:38  augur, speaking of which... Apparently there is already a "naked female" skyrim mod....
00:40:49  I'm not going to try it :P
00:40:51  there are mods in Morrowind that give it Oblivian-esque graphics
00:40:56  I wouldn't be surprised if such mods existed in Oblivion.
00:40:59  is what I meant to say.
00:41:01  oblivian
00:41:03  totally a word
00:41:14  yeah dude.
00:41:19  a NEOLOGISM
00:41:26  WHAT NOT STRONG SAPIR-DORF
00:41:32  s/not/now/ :P
00:41:36  elliott: don't be obsidious
00:41:37  elliott, I need to see if he did any morrowind
00:41:52  because... vanilla morrowind is /ugly/
00:41:53  Vorpal: use url hax
00:41:54  that's what i did
00:42:12  http://deadendthrills.com/category/the-elder-scrolls-iii-morrowind/
00:42:14  not under that name
00:42:25  no search results for it
00:42:29  so SORRY NOPE
00:43:09  elliott, what about witcher 2?
00:43:26  Vorpal: Googling showed up http://www.flickr.com/photos/futurilla/3200260681/ only, which is part of a GROUP called Dead End Thrills :P
00:43:36  Which I suspect is just run by random people ripping it off.
00:44:03  Vorpal: Apparently not! Going by EXTREMELY RELIABLE URL HAX.
00:44:12  XD
00:44:19  the on-site search seems broken
00:45:12  http://deadendthrills.com/?s=skyrim ;; not too broken
00:47:43  hm now it works
00:47:44  weird
00:48:07  yeah no witcher 2
00:49:30  elliott, oh and a lot of the visual impressiveness in witcher 2 is dynamic effects
00:49:40  the way plants move in the wind. The motion blur
00:49:43  stuff like that
00:49:46  Not as good as ELLIOTTCRAFT.
00:49:55  :P
00:49:59  Elliottcraft has dynamic... POLYGONS...
00:50:05  and?
00:50:18  elliott, but really, what do you mean?
00:50:21  departed parrots
00:50:30  Vorpal: Dynamic... DYNAMISM
00:50:34  elliott, and is it available yet?
00:50:43  YES.
00:50:46  in our hearts
00:50:48  elliott, I only consider released games you see
00:50:58  Higher-Order Perl is an enjoyable read. I can't believe I hadn't gotten around to it.
00:51:17  sounds like a cakeprophet thing
00:52:44  monqy: no its mark j dominus hes a good person
00:53:05  and kaceprophet isnt? :o
00:53:31  of course not
00:53:43  maybe I willl read higher-order perl sometime when i am not killing myself over this awful python
00:53:51  which i have to
00:53:52  functional perl is the best perl.
00:53:52  work with
00:54:23  http://hop.perl.plover.com/book/pdf/HigherOrderPerl.pdf
00:54:26  yuo're wlecome
00:54:45  elliott: nice googling
00:54:48  `yes yes
00:54:51  yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes \ yes
00:54:57  yes
00:55:01  `yes no
00:55:03  no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no \ no
00:55:06  no
00:55:47  Chapter 6 is interesting. Infinite Streams.
00:55:50  none of these chapter titles look interesting.
00:55:57  oh okay
00:56:00  that's kind of interesting.
00:56:05  my guess is that it uses ties?
00:56:09  I wonder why more garbage-collected languages don't use laziness. It's so convenient.
00:56:23  No, it's just another name for infinite lists.
00:56:25  makes side-effects even more confusing?
00:56:37  evincar: ...I, yes I know, but those don't exist in Perl normally
00:56:38  Solution: avoid side-effects.
00:56:52  so I assume it uses ties to implement them?
00:57:09  but everyone is too awful to avoid side-effects
00:57:11  No, regular old cons-lists with promises.
00:57:43  E.g. node($head, promise { $rest })
00:58:47  that works I guess.
00:59:38  Could be prettier. So could the rest of Perl.
00:59:53  I believe you could use ties to make infinite lists look like normal Perl lists.
01:00:23  Probably. I've never had need to mess with ties.
01:00:58  it essentially just lets you override things like variable assignment and indexing and stuff.
01:01:27  because Perl kind of sort of doesn't make sense like that.
01:04:28  http://search.cpan.org/~lbrocard/Language-Functional-0.05/Functional.pm
01:05:49  http://search.cpan.org/~asg/List-Gen-0.974/lib/List/Gen/Haskell.pm
01:05:50  WELCOME BACK IOCCC <3 <3 <3
01:06:00  wut
01:06:08  http://www.ioccc.org/2011/rules.txt
01:06:28  yessss
01:06:41  Crap, I was gonna announce that. :(
01:06:43  i guess it really _is_ the end times.
01:06:44  Spaced it.
01:07:25  how can you announce something that happened two days ago.
01:11:13 -!- Vorpal has quit (Quit: ZNC - http://znc.sourceforge.net).
01:12:02  You seem to have done it just fine.
01:12:06  Besides, I just found out about it today on HN.
01:17:46  oerjan: hi can i prod you with haskell data structure questions
01:19:07  elliott: :)
01:19:18  hi variable did i say variable
01:21:46  oerjan: You suuuck
01:23:15  *WAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAH* elliott says i suck *WAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAH*
01:23:26  oerjan: hi you won't suck if you answer my questioneitonstonis :DDD
01:23:32  oh
01:26:29 -!- Darth_Cliche has joined.
01:26:31  well clearly the answer is to use a phantom type as a monad^Wapplicative transformer indexed over a general topos prepromorphism.
01:26:44  oerjan: NO LIST,EN
01:26:54  no list, check.
01:26:56  no list, en
01:27:12  whos en
01:27:24  oerjan: I want a tree map (I'd go for HashMap usually) from a small (a pair of integers from 0 to 15 (inclusive), i.e. 256 values in total) key to values
01:27:25  but
01:27:28  every key has a value
01:27:30  there are no unset keys
01:27:35  and im just wondering if... there'd be a good
01:27:38  way to structure this apart from the obvious
01:28:16  that small?  an array.
01:29:18  or wait, you want efficient modification?
01:29:28  oerjan: yes, it will be modified semi-frequently
01:29:33  although not as much as it's looked up
01:29:52  oerjan: I suppose a vector would still be a decent choice, but it's 256*4 = 1024 bytes
01:30:00  and copying a kilobyte on every modification doesn't sound like fun
01:30:04  even if they are relatively infrequent
01:32:16  oerjan: hmm wait
01:32:16  well a trie maybe?
01:32:27  oerjan: the keyspace might actually be more like 16,384
01:32:57  so 65536 bytes unpacked
01:33:02  oerjan: what I could do is a boxed vector of 128 unboxed vectors of 128 Int32s
01:33:24  oerjan: that's reallocating 512 bytes for each modification
01:33:31  mhm
01:33:33  while having cheap lookup (three pointer dereferences)
01:33:36  (or thereabouts)
01:34:05 -!- derdon has quit (Remote host closed the connection).
01:34:07  this sounds like it needs profiling to find out what actually _is_ the most efficient branching...
01:34:29  oerjan: well it'd be 128x128
01:34:32  i.e. two coordinates of 0 to 127
01:34:37  so there's not really any other reasonable branching
01:34:42  it'd be pointless arithmetic
01:34:46 -!- derdon has joined.
01:34:58 -!- derdon has quit (Remote host closed the connection).
01:35:37  You sound like you want a deque.
01:35:45  oh well then you have your answer then.
01:36:01  evincar: uhhhhh what
01:36:32  > foldr (flip const) [1,2,3,4]
01:36:33    Overlapping instances for GHC.Show.Show ([a] -> [t])
01:36:33     arising from a use ...
01:36:38  > foldr1 (flip const) [1,2,3,4]
01:36:40    4
01:37:30  > foldr1 const [1,2,3,4]
01:37:31    1
01:37:38  so good
01:37:41  Gregor: Just use my secret exploit to hack your server to death hahahahahaha
01:37:46  now use foldr to get tail
01:37:47  or init
01:38:04  copumpkin: type error
01:38:14  not really
01:38:15  you can do it
01:38:20  it's just inefficient
01:38:21  uh..
01:38:24  :t tail
01:38:24  you can get any list function with foldr
01:38:25  forall a. [a] -> [a]
01:38:25  obviously
01:38:33  :t foldr
01:38:34  forall a b. (a -> b -> b) -> b -> [a] -> b
01:38:45  not without doing some kind of mangling beforehand, right?
01:38:59  what do you mean
01:39:15  foldr returns one value of type whatever-is-in-the-list
01:39:20  tail returns a list.
01:39:30  you need to do something to the input list first
01:39:32  no, foldr can return any type
01:39:37  oh right.
01:39:37  :P
01:39:39  I see.
01:39:56  doing an unsafe tail seems tricky though
01:40:03  safeTail is fairly straightforward
01:41:20  I can't figure it out. :P
01:41:36  you probably need some mangling afterwards
01:41:59  I don't know how to say "dear foldr: ignore the first element but everything else is cool, k"
01:42:53  > foldr (\x -> maybe (Just []) (Just . (x:))) Nothing [1..5]
01:42:55    Just [1,2,3,4]
01:43:11  foldr (\x -> maybe (Just []) (Just . (x:))) Nothing [1..5]
01:43:14  bah
01:43:19  haha
01:43:19  foldr (\x -> maybe (Just []) (Just . (x:))) Nothing []
01:43:21  > foldr (\x -> maybe (Just []) (Just . (x:))) Nothing []
01:43:23    Nothing
01:43:30  > fromJust $ foldr (\x -> maybe (Just []) (Just . (x:))) Nothing []
01:43:31    *Exception: Maybe.fromJust: Nothing
01:43:33  unsafe tail
01:43:45  :)
01:43:53  I meant more in the sense of not having to post-process it
01:44:04  that was init, not tail
01:44:06  copumpkin: Isn't that ignoring the last element?
01:44:11  oh, so it was
01:44:14  safe tail? is that anything like drop 1?
01:44:22  monqy: no its [a] -> Maybe a
01:44:23  contrary to popular belief, I do not actually read anything.
01:44:25  oh
01:44:29  I just divine information with psychic powers
01:44:29  monqy: No, that loses information.
01:44:31  sometimes it's a little off.
01:44:42  elliott: that looks like safe head...
01:44:50  safe head is boring head, imo.
01:45:02  im confuse :(
01:45:05  monqy: um
01:45:06  [a]
01:45:09  it's fairly obvious that you _cannot_ do tail as a straight foldr over the list with no post- or preprocessing.
01:45:09  shachaf: yes, it is
01:45:31  because the tail of the tail does not contain enough information to reconstruct the tail itself
01:46:01  oerjan: ?
01:46:16  lists are like animals but instead of normal animal tails they have TAILS THAT ARE ANIMALS.
01:46:19  with tails
01:46:22  The point of tail is that you don't have enough information to reconstruct the thing you tailed.
01:47:04  shachaf: if tail l = foldr f x l for some f and x, then ys = tail (y:ys) = f y (tail ys)
01:47:25  hmph, Vectors need better type names
01:47:37  which is absurd because the rightmost expression does not contain the information of ys's first element
01:47:50  hmm maybe I can use Data.Vector.Generic
01:48:03  hmph, no specialize pragmas
01:48:04  so you cannot write tail that way.
01:48:14  there should be some kind of list where tail does not remove any information. I'll call it: a zipper
01:49:14  Genius.
01:50:17  is there a standard lib zipper? if not, why not?
01:50:24  I don't think I've encountered one.
01:50:48  oerjan: I see.
01:51:28  > snd $ foldr (\x (xs, txs) -> (x:xs, xs)) ([], undefined) [1,2,3,4]
01:51:29    [2,3,4]
01:51:43  awww yeah
01:51:47  zipper fold thing
01:52:45  I would safely conclude that snd does not count as "postprocessing"
01:53:05  erm i count it as such :P
01:54:04  btw this is similar to the trick for implementing decrement in lambda calculus with church numerals
01:54:47 -!- pkzip has joined.
01:55:04  Deewiant: Which would you say is more common: Program accessing locations near (0,0), or programs accessing locations near the IP
01:55:14 -!- pkzip has left.
01:56:19  pkzip is going to keep joining here forever
01:56:23  and never figure out how to stop it autojoining
01:58:58  > let church n f x = iterate f x !! n; inc n f x = n f (f x); dec n f x = snd $ n (\(x, dx) -> (inc x, x)) (church 0, undefined) in dec (church 4) (+1) 0 -- i wonder if this types in haskell...
01:58:59    Overlapping instances for GHC.Show.Show ((t -> t) -> t -> t)
01:58:59     arising fro...
01:59:07  gah
01:59:23  oh hm
01:59:34  silly me
02:00:30  > let church n f x = iterate f x !! n; inc n f x = n f (f x); dec n f x = snd $ n (\(y, dy) -> (f y, y)) (x, undefined) in dec (church 4) (+1) 0 -- i wonder if this types in haskell...
02:00:31    3
02:02:31 -!- PlacentaProphet has quit (Ping timeout: 255 seconds).
02:04:57  It can't hurt to practice making variadic functions by hand, can it?
02:05:06  in what language
02:05:16  fizzie: Stop me from making the same mistake mcmap did, please.
02:05:16  SgeoN1: you might get rsi
02:05:32  elliott, Haskell
02:05:46  SgeoN1: let me help you out: never write, never use variadic functions
02:06:02  there is exactly one variadic function anyone uses and it's printf, and even then most people avoid it, this is because it freaking sucks because it's dynamically typed
02:06:32  The dynamic typing has nothing to do with it being variadic, I thought
02:06:48  SgeoN1: So you want variadic functions that take only one argument type? That wouldn't be dynamic.
02:06:50  Let me tell you how to do that.
02:06:53  f :: [Type] -> Result
02:07:01  Advanced technology!
02:07:20  elliott, is playing around a sin in your world?
02:07:49  Usually you "practice" something in order to be better at doing it so that you can do it for real later.
02:08:08  Also, Oleg has examples of strongly typed useful variadic functions, but I doubt I'd be able to write such
02:08:15  the dynamicity is only needed because the format string is a value not giving its natural type, it has nothing to do with the variable number of the rest of the arguments
02:08:56  oerjan: yes, but can you come up with a useful, non-dynamic, non-single-argument-type variadic function?
02:09:02  it's contrived
02:10:09  elliott needs to read more Oleg. Although I'm not sure if Oleg ever said anything about usefulness
02:10:18  I have read plenty of Oleg.
02:12:20 -!- tiffany has joined.
02:14:07  elliott: Not enough.
02:14:21  :-(
02:14:31  Didn't Oleg write an operating system once?
02:14:51  @ is surely superior, though.
02:15:57  There's a C++ kernel thing on his site? I think it's just a toy though.
02:16:03  I have one variadic function I want to write
02:16:21 -!- CakeProphet has joined.
02:16:21 -!- CakeProphet has quit (Changing host).
02:16:21 -!- CakeProphet has joined.
02:16:36  An implemented toy is clearly far worse than an unimplemented toy. :-)
02:16:37  Not sure if I can, or, if it's doable, whether someone else already has
02:16:40  SgeoN1: What is it.
02:16:51  shachaf: @ ISN'T A TOY TAKE THAT BACK OR I'LL KILL YOUUUUUUUUUUU
02:16:53  In what language?
02:16:54  liftAn
02:17:04  SgeoN1: Look up "idiom brackets".
02:17:19  http://www.haskell.org/haskellwiki/Idiom_brackets
02:18:02  bah, can't use tabs in gnome-terminal with irssi
02:18:07  gnome-terminal steals alt+N
02:18:34  CakeProphet: Disable that.
02:19:05  That's subtly different from what I was hoping for, although I guess there may be a reason. I didn't really look that closely
02:19:12  shachaf: How's that relevant?
02:19:15  Or do you know what SgeoN1 is trying to do.
02:19:15  shachaf: how does one accomplish this.
02:19:37  elliott: It accomplishes more or less the same goal as liftAn (it just needs a terminator).
02:19:47  shachaf: How do you know he wanted liftA#?
02:20:01  How do I know anything at all?
02:20:05  Deep.
02:20:09 * shachaf is omniscient, that's how.
02:20:18  elliott, what else could I have meant by writing liftAn and not explaining further?
02:20:22  elliott: you raise some interesting philosophical questions.
02:20:38  SgeoN1: You didn't.
02:20:44  Oh, you did.
02:20:46  SgeoN1: It could be "lift, but only for indefinite nouns that start with a glottal stop".
02:21:48  Why do idiom brackets need a terminator?
02:22:21  To know when the thing has terminated.
02:22:54  I should probably read the thing
02:23:40  :t divMod
02:23:41  forall a. (Integral a) => a -> a -> (a, a)
02:23:50  SgeoN1: Because otherwise it's ambiguous.
02:23:55  Also, it'd be really ugly without a terminator.
02:25:52  To use or to write?
02:26:05  Because usage of a terminator is ugly to me
02:26:19  both
02:26:25  because impossible is ugly.
02:26:46  (| getFoo + getBar |) is perfectly nice.
02:28:11  SgeoN1: http://www.amateurtopologist.com/blog/2010/01/12/variadic-functions-in-haskell/
02:28:17  elliott: Challenge: A version of iI Ii that works with infix operators.
02:28:29  shachaf: No, iI Ii is hideous.
02:28:51  (+) (iI fx) (fy Ii) -- OK, maybe not.
02:28:59  elliott: #define (| iI
02:29:00  Hmm, that page has a use case that goes beyond liftAn. I wonder if that restricted the solution spsce
02:29:09  (| f blah hmm Ii
02:29:20  http://personal.cis.strath.ac.uk/~conor/pub/she/idiom.html (OK, she's additions to idiom brackets may not actually make SgeoN1 think they're less ugly.)
02:29:23  Oops
02:29:28  s/she's additions/the additions she makes/
02:29:43  Her additions.
02:30:22 -!- evincar has quit (Quit: ChatZilla 0.9.87 [Firefox 8.0/20111104165243]).
02:30:53  I don't see how they work, I guess that's in the paper?
02:31:00  Nestibility is good though
02:31:43 * shachaf wonders whether iI is nestable.
02:32:30  "Worse, for reasons I have never entirely understood, the type-class hackery doesn't allow these brackets to nest as they should."
02:33:40 -!- Darth_Cliche has quit (Quit: You are now graced with my absence.).
02:34:12  SgeoN1: terminator is necessary because liftAn f x y z  is a legal complete use whenever liftAn f x y z w  is.  (each additional argument is just applied with <*>.)
02:35:42  :t \f x y z w -> (liftA3 f x y z, liftA4 f x y z w)
02:35:43  Not in scope: `liftA4'
02:35:46  oops
02:36:02  :t \f x y z -> (liftA2 f x y, liftA3 f x y z)
02:36:03  forall a b (f :: * -> *) c d. (Applicative f) => (a -> b -> c -> d) -> f a -> f b -> f c -> (f (c -> d), f d)
02:37:04   "Worse, for reasons I have never entirely understood, the type-class hackery doesn't allow these brackets to nest as they should."
02:37:14  SgeoN1: oerjan: um the ones she has nest just fine
02:37:27  the stupid typeclass hack on http://www.haskell.org/haskellwiki/Idiom_brackets that McBride disowned don't nest because they're awful :P
02:37:27  ok
02:37:46  McBride disowned it?
02:37:51  Does that mean it's there for the taking?
02:37:52  elliott: well those were what shachaf asked about
02:37:57  "For a while, I had a cheeky typeclass hack, but it seemed like overkill, especially as it didn't nest. She now supports a notation which does the job."
02:37:59  sounds like disowning to me!
02:38:17  oerjan: Well, it makes sense that they're not nestable.
02:38:33  Unless you use parentheses, that is. I'd be very surprised if they didn't nest even then.
02:39:07  oerjan: oh noooooooo my zipper doesn't work
02:39:46  shachaf: i'd assume he meant they don't nest with parentheses
02:39:57 -!- CakeProphet has quit (Remote host closed the connection).
02:40:41  shachaf: presumably trying to infer all the right types goes haywire somehow when there is more than one nesting level
02:40:59  inner ambiguity or something...
02:42:13  perhaps type families might help >:P
02:42:32  oerjan: There's a translation of those things to tpe families somewhere on hpaste.
02:42:41 -!- CakeProphet has joined.
02:42:41 -!- CakeProphet has quit (Changing host).
02:42:41 -!- CakeProphet has joined.
02:42:43  I'd be surprised if it solves any of the actual problems, though.
02:43:08  http://hpaste.org/48964
02:45:32  wtf random memory leak.
02:50:55  This paper can'tbe right?!?!??! Apllicatives came after arrows?
02:51:08  PANIC!?!??!!? FUCKING APNCI!?!?!?!?!?!?!? IIST IMSPOSBIBLE
02:51:09  !!!!
02:52:01  panice
02:52:17  fucking apnic
02:52:20  why is APNIC panicking, they already _did_ run out didn't they?
02:52:53  monqy: napcin
02:53:28  napcin
02:54:34  sigroanneaaaaaaaaaaaaaaaaaaa
02:55:02  si groan ea
02:55:04  elliott: is there a link connected to this nonsense?
02:55:16  :t fromDyn
02:55:17  forall a. (Typeable a) => Dynamic -> a -> a
02:55:20  or are you just making random words
02:55:21  :t toDynamic
02:55:22  Not in scope: `toDynamic'
02:55:23  :t toDyn
02:55:24  forall a. (Typeable a) => a -> Dynamic
02:55:47  > [toDyn 2, toDyn True, toDyn 'h', toDyn "hello"]
02:55:48    [<>,<>,<>,<<[Char]>>]
02:55:54  oerjan:  This paper can'tbe right?!?!??! Apllicatives came after arrows?
02:55:55  Haskell is the best Python.
02:56:04  uuugh
02:56:10  don't even talk about python
02:56:12  weeps to self
02:58:16  elliott: darn, i was hoping for some actual interesting ip news :P
02:58:24  oerjan: ilari left :(
02:58:30  i miss him and his robotic nature
02:58:51  SgeoN1: anyway mcbride invented idioms (applicatives) in... was it 2006?
02:59:05  oh ross patterson too
02:59:07 -!- Jafet has joined.
02:59:20  hmm, http://www.soi.city.ac.uk/~ross/papers/Applicative.html introducing applicative functors is 2008, but I think the "idiom" name goes back to 2006
02:59:21  not sure though
03:00:07  Does Haskell have an Applicative definition for all nomads?
03:00:28  nomads
03:00:52  Monads
03:01:01  pure = return; (<*>) = ap
03:01:17  "Applicative" isn't part of Haskell.
03:01:21 -!- CakeProphet has quit (Ping timeout: 245 seconds).
03:01:59  elliott, that's great, but is it a default in Haskell, or is the situation like Functors?
03:02:07  SgeoN1: Functor is a superclass of Applicative.
03:02:11  Shachef, o.O?
03:02:12  From this you can derive an answer.
03:02:21  shachaf: I don't think it's wrong to consider the base standard library part of Haskell.
03:04:59  :(
03:05:30  I don't think it's wrong to consider Glasgow Haskell Haskell.
03:06:01  Jafet: base theoretically supports non-ghc compilers :)
03:06:29  In theory, yes. But only the Glasgow Haskell Compiler compiles Glasgow Haskell.
03:15:55 -!- pkzip has joined.
03:17:10 -!- pkzip has quit (Client Quit).
03:17:14 -!- pkzip has joined.
03:19:50  I think I see how to implement Dynamics, but
03:19:54 -!- pkzip has left.
03:20:04  .. I think it requires OverlappingInstances?
03:20:30  no?
03:20:34  why would it
03:21:23  Two instances, one to say that fromDynamic returns Just whatever, and a more general instance to say it returns Nothing.
03:21:29  what
03:21:39  I may be approaching it wrong
03:21:50  data Dynamic = forall a. (Typeable a) => Dyn a
03:21:53  toDyn = Dyn
03:21:59  fromDynamic (Dyn a) = cast a
03:22:31  That's great, I'm saying if I were to try to implement it mysrlf
03:22:35  Myself
03:23:27  Without magic Typable, but a typeclass of my own construction
03:24:02  Although I'd guess that Typable isn't magic
03:24:08  SgeoN1: Are you going to be using a class isomorphic to Typeable?
03:24:38  The only magic bit about Typeable is that GHC will autoderive instances for you.
03:24:57  I don't ... think so? What does Typable provide, because I think I'd need less.
03:25:22  SgeoN1: With any typeclass that isn't autoderived, Dynamic gives you unsafeCoerce.
03:25:25  Well, myvway would be annoying to write out by hand, yes
03:25:30  (This is why people want hand-written Typeable instances banned.)
03:25:56 * shachaf wears a hand-written Typeable instances band!
03:26:01  Wait, or am I *in* one?
03:26:10  But does Typable rely on overlapping instances internlally?
03:26:10 -!- GreaseMonkey has quit (Quit: The Other Game).
03:26:39 -!- GreaseMonkey has joined.
03:26:53  SgeoN1: No.
03:27:00  cast, however, relies on unsafeCoerce.
03:27:12  And OverlappingInstances does not let you do what you want.
03:27:13  Ah. So, magic
03:27:20  It doesn't?
03:28:37  It doesn't.
03:32:34  Oleg can decided UndecidableInstances.
03:32:36 * shachaf sighs.
03:32:40  My fingers are useless.
03:32:53  They are clearly not native English speakers.
03:32:56 -!- Aune has quit (Quit: Lmnar).
03:33:05  O.o at Undecidable
03:33:34  Or is it just that it can't be decided whether typechecking terminates?
03:33:39  I can only type native English.
03:33:41  Or somehing
03:40:23  SgeoN1: yeah
03:40:52  now IncoherentInstances, on the other hand, is so evil i'm not even sure what it does.
04:14:15 -!- zzo38 has joined.
04:17:18  My Haskell package (as well as other Haskell packages that were lack generated document at that time) still has no generated documentation.
04:18:05  Actually, I found that one of them has a build failure log. Mine, however, has no log.
04:21:51 -!- copumpkin has changed nick to FUDPAcker.
04:29:08 -!- MDude has changed nick to MSleep.
04:29:32  does haddock even support literate haskell
04:30:05 -!- FUDPAcker has changed nick to copumpkin.
04:32:43  I think I read its document it says that it does.
04:33:03  ask #haskell
04:33:09  OK
04:51:20  elliott: If "near" is something like "within 128x128" then I'd say "near the IP"; most programs are smaller than that and in Mycology I try to avoid (0,0).
04:51:42  Deewiant: It is pretty much "within 128x128", yes
04:51:48  fungot is more closer to (0,0), isn't it?
04:51:49  elliott: oh, the swamp of terror, in search of the golden citadel... " no secondary sources of their wealth and power, but i refused. so did the east of paris. made of plaster
04:52:53  elliott: And re. that list of graphics cards; the guy stopped updating it (along with the whole site) in April.
04:53:58  Deewiant: :-(
04:54:27  Rest in peace guy -- too cool for this world.
05:05:02  :t state
05:05:03  forall s a. (s -> (a, s)) -> State s a
05:09:50  Don't do that, it won't work and also has a 99,98% chance of destroying the earth by summoning time-traveling zygohistomorphisms.
05:10:06  what about it
05:10:19 * SgeoN1 is easily amused
05:10:34  Oh, what I pasted is a quote
05:10:55  i know that
05:14:30 * SgeoN1 reads about why reactive-banana has no swicher
05:14:33  Switcher
05:15:13 -!- oerjan has quit (Quit: ZZZZZZZZZZZZZZZZ).
05:16:34  :t StateT
05:16:35  forall s (m :: * -> *) a. (s -> m (a, s)) -> StateT s m a
05:16:44  @hoogle State s a -> StateT s m a
05:16:45  No results found
05:24:35  StateT . fmap return . runState
05:27:58  yeah :)
06:08:34 -!- pkzip has joined.
06:08:49 -!- pkzip has left.
06:15:36 -!- zzo38 has quit (Quit: Djinn and Tonic).
06:22:01 -!- elliott has quit (Remote host closed the connection).
06:23:17 -!- elliott has joined.
06:24:57  Deewiant: Sweet, Shiro 2 has run into a roadblock as soon as it began! It's like that time when CCBI 2 was dormant for months because of a compiler bug!
06:29:58 -!- nys has quit (Quit: quit).
06:30:42 -!- SgeoN1 has quit (Quit: Bye).
07:17:58  monqy!!! What a good thing that you are here HELP ME
07:18:46  hi
07:19:42  monqy: I need a zipper of a structure with n cursors help.
07:20:02  cursors?? help
07:20:16  isn't that just the n'th derivative of the type?
07:21:15  olsner: yes. however i need an /arbitrary/ n
07:21:16  i.e.
07:21:21  Zipper1, Zipper2, ... is like a tuple
07:21:27  I need "a list", ZipperN
07:21:35  because the number of cursors I need varies at runtime
07:22:07  maybe you can make a zipper-zipper to navigate to the right zipper, if you manage to make automatic zipper construction in the type system
07:22:29  olsner: you're kidding, right? :P
07:22:34  mostly yes
07:23:18  but an infinite type of all zippers might be doable?
07:23:41  hmm oleg's (hideous) multi-cursor zipper is done as just two zippers kept in sync
07:23:49  except it's an uh higher-order zipper that keeps track of the path
07:23:52  each zipper that is
07:28:03  help.
07:29:04  i do not know how :(
07:30:05  help.
07:30:41  Real programmers use mutability instead of zippers.
07:31:16  real programmers don't abstract away their work, they do it
07:31:37  "abstract" as in "give to someone else"?
07:31:42 -!- SgeoN1 has joined.
07:32:47  shachaf: Honestly, I'm tempted just to return to the old style, which was really slow but really simple.
07:32:53  http://www.altocumulus.org/Fudgets/demoform.html please tell me these kinds of shenanigans don't work these days
07:33:48  X is still a network-transparent protocol, yes.
07:34:29  But arbitrary computers shouldn't be able to do stuff without your permission
07:34:31  Holy shit, the Fudgets website got updated in 2011.
07:34:45  SgeoN1: Where does that site do anything without your permission?
07:35:28  It looks like it attempts to. Or, well, technically with permission but if it worked, then it could work without permission
07:36:09  Although on my phone, I got an error telling me to try running some command, which doesn't look like it deserves to be sufficient for granting permission
07:36:46  If you actually tried it, you'd see that you just have to grant permission to the server.
07:36:49  To display windows.
07:37:09  Of course, the website could also just open a popup; I still get them occasionally, so it's not like there's no way to circumvent popup-blockers.
07:37:16  Being able to open a window is not a very exciting privilege.
07:37:47  "skalman" will be a host on some university network, I suspect.
07:38:06  So it probably only works/worked in the 90s for people at Chalmers. :p
07:38:13  It only says skalman, how is that enough to grant permission?
07:38:17  Ah
07:38:29  http://en.wikipedia.org/wiki/Skalman
07:39:13  the easy way is to just give the whole internet access to your X server
07:40:47 -!- Jafet1 has joined.
07:43:22 -!- Jafet has quit (Ping timeout: 244 seconds).
07:45:09  elliott: Real programmers stare the compiler down until it submits.
07:45:20  That's what you should do to get ZipperN.
07:45:44  "compiler whats that" - real programmer
07:45:47  pikhq: :'(
07:49:06  Is compilation really a necessary aspect of Haskell?
07:49:19  SgeoN1: Not even slightly.
07:49:47  It's just that the preferred implementation of Haskell, GHC, is a compiler.
07:49:49  (That was meant to elicit calls of me being an idiot, but I'd think that typechecking and compilation are different things)
07:50:16  Hugs, for instance, was a Haskell interpreter.
07:50:17  ....oh, so I'm just being a captain ovvious
07:50:22  Yes.
07:50:23  Obvious
07:51:05  Captain Ovious: Lord of All Sheep
07:51:28  elliott, I don't have to serve as a Notifier, right? And why did spellcheck caps Notifier?
07:51:47  And by spellcehck I mean autocorrect
07:52:25  Night all zzzinsane
07:58:22  I wonder if you could make a haskell dialect that doesn't typecheck until runtime, essentially making haskell one of those "dynamically typed" languages
08:00:39  olsner: i doubt it, how would you do things like typeclasses, polymorphic recursion...
08:00:48  i mean
08:00:53  you could do it in batch at start-up
08:00:58  but that's basically compilation :P
08:01:19  after enough furious handwaving, surely it'll be trivial?
08:02:44 -!- monqy has quit (Quit: hello).
08:05:12 -!- SgeoN2 has joined.
08:05:12 -!- SgeoN1 has quit (Read error: Connection reset by peer).
08:06:34  Being able to open a (X) window is quite an exciting privilege because then you can monitor all keypresses.
08:08:51  Oh, you can/
08:08:51  ?
08:08:53  Thanks, X!
08:09:05  fizzie: Does that apply even after it's closed?
08:09:53  Yes. Or, well, you don't need to be able to open a window either, you just need to be able to connect to a display.
08:10:59  So fizzie, about them n-zippers...
08:12:28  There's an "X SECURITY" extension, though, which blocks at least the XQueryKeymap polling, but I think that doesn't apply if you "xhost +" someone. (It's relevant for ssh's X client forwarding; it makes remote clients untrusted by default, unless you ssh -Y instead of ssh -X.)
08:12:35  I don't know anything about them n-zippers, sadly.
08:20:32  elliott: you don't need type checking for that, only type inference
08:20:41  Jafet1: hmm, right
08:20:45  that falls down with extensions, though :)
08:20:48  How to implement type inference without type checking is hereby left as an exercise
08:20:50 -!- Jafet1 has changed nick to Jafet.
08:21:55 -!- Jafet has quit (Quit: Leaving.).
08:21:55 * shachaf maintains that type inference = type checking.
08:22:17 -!- derrik has joined.
08:22:28  > comparе "inference" "checking"
08:22:29    EQ
08:22:44  o.O
08:23:20  > comparе "shachaf" "mad"
08:23:22    EQ
08:23:56 -!- pikhq_ has joined.
08:24:21 -!- pikhq has quit (Ping timeout: 252 seconds).
08:24:26  > compаre "olsner" "mad"
08:24:27    Is_a
08:25:06 * olsner is a-mad with madness
08:26:24 -!- CakeProphet has joined.
08:26:58  hg status -umad
08:28:11  git config shachaf.mad true
08:28:39  git conf ig-shachaf.mad true
08:29:37 -!- LadyJ has joined.
08:30:01  but `git status -umad` could work too, there is a `git status -unormal` anyway
08:30:30  mad file disease
08:59:19 -!- derrik has quit (Quit: cursed).
09:00:54  hi LadyJ
09:00:55  `? welcome
09:01:01  Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
09:01:15 * shachaf never got a warm welcome like that.
09:03:45  shachaf: That's because we don't like you.
09:05:12  eek, I just had a scapegoat breakthrough
09:05:15  I'm not meant to be the one who has those
09:05:29  Hooray, Raymond Smullyan.
09:06:17 -!- hagb4rd has joined.
09:06:25  shachaf is trying to tell us that he is Raymond Smullyan.
09:06:37 -!- elliott has left ("Leaving").
09:06:39 -!- elliott has joined.
09:06:42  Take that, close button.
09:06:42 * shachaf could do worse.
09:12:44  elliott: dude what if like
09:12:45  all changes
09:12:47  are branches dawg
09:12:50  cause they branch
09:12:53 * elliott punches CakeProphet.
09:12:53  the thing.
09:12:57  what if they branch the thing.
09:12:58  always
09:13:45  CakeProphet: Accept my inviation.
09:13:47  invitation.
09:14:11  one second while I figure out how to do that.
09:14:36  /join
09:15:04  why did you invite me to a channel when I don't need to be invited.
09:15:16  So I could do that.
09:15:20  ah
09:15:55 -!- SgeoN2 has quit (Quit: Bye).
09:16:26  dude what if like
09:16:28  merging
09:16:45  creates branches
09:16:54  where each branch is a possible result of the merger.
09:17:18  then you no longer have to worry about merging
09:17:19  !!
09:17:34  you just change hundreds of branches en masse
09:19:57  CakeProphet: Please die.
09:21:09  reverting creates a cycle in the graph back to the original node, and then branches at that node!!!
09:22:12  because each node is one of millions of permutations, you can do all sorts of fine-grained adjustments when you revert. Also, everytime you branch it creates branches of /what could be/
09:22:16  all possibilities.
09:22:17  are branches.
09:22:43  shachaf: Can you kill CakeProphet for me?
09:22:51  /kill CakeProphet
09:22:56  My IRC client doesn't support it.
09:23:00  I think you need to be an oper.
09:23:27  shachaf: Well, become an oper then.
09:23:32  so what happens when you revert into the future?
09:23:50  CakeProphet: What if, like, stuff, dude.
09:23:53 * shachaf tired
09:24:05  shachaf: YEAH DUDE THE STUFF CAN BRANCH
09:24:12  branches make version control systems complete.
09:24:17  the more branches the more possibilities.
09:24:20  the more version control.
09:24:47 * Madoka-Kaname kicks CakeProphet in the gonas
09:24:51  gonads*
09:26:06  deleting a file is just reverting to a branch in which it was never created.
09:26:39  also branches could branch! so you can branch while you branch.
09:27:45  only complete binary trees are allowed to represent the branches though.
09:28:08  so that the tree can be implemented efficiently as an array.
09:28:14  an array that doubles as a hash function.
09:28:37  CakeProphet: But what if you removed that restriction???
09:28:38  DUUUUUUUUUUUUDE
09:28:54  elliott: that would mean
09:29:08  THE RESTURKSHUN ES REMOV
09:29:12  FUUUUCK
09:29:50  what if instead of changesets you use categories.
09:29:57  no wait even better objects
09:30:01  like Java objects.
09:30:46  THEN EVERYTHING IS JUST INHERITANCE YEAAAAAH
09:31:32  What if... you used objects instead of heritance?
09:31:38  バカが移りたくない
09:31:49  elliott: like aggressation?
09:31:54  I DON'T KNOW.
09:31:55  AGGRAVATIONS?
09:32:04  agregorate?
09:32:55  what about feudalism
09:33:31  branches are the result of a noble offering an upper class subject domain in his nobledom.
09:34:02  reverting is the resulting of weird time shit or maybe kingly decrees
09:34:08  and merging is uh, well okay this isn't working.
09:34:22  back to Java objects and complete binary tree hash tables.
09:35:22  > var $ cycle "where time becomes a loop "
09:35:23    where time becomes a loop where time becomes a loop where time becomes a lo...
09:36:05  elliott: okay what about slave labor?
09:36:15  so you can initiate complex queries.
09:36:57  like "okay I need these functions from this file at revision 200 merged with these functions from revision 300 and properly merged so that the code compiles and runs as expected."
09:37:08  and then you crack your whip
09:38:40  copenhagen scapegoat could just pull revisions from other universes where the code has been merged correctly.
09:39:29 -!- copumpkin has quit (Ping timeout: 260 seconds).
09:39:53  it would find this universe by consulting the universe in which scapegoat can actually catalogue and efficiently search all universes.
09:39:54 -!- copumpkin has joined.
09:40:19  which it would just have conveniently. maybe that universe finds our universe and decided to help you out!
09:40:22  how nice.
09:43:34 -!- Madoka-Kaname has quit (Ping timeout: 260 seconds).
09:50:12 -!- Madoka-Kaname has joined.
09:50:12 -!- Madoka-Kaname has quit (Changing host).
09:50:12 -!- Madoka-Kaname has joined.
10:20:35 -!- elliott has set topic: ioccc more like http://codu.org/logs/_esoteric/.
10:20:41 -!- elliott has set topic: http://codu.org/logs/_esoteric/.
10:20:45  too bad even for my high quality standards
10:36:48 -!- derdon has joined.
10:53:02 -!- GreaseMonkey has quit (Quit: The Other Game).
11:03:43  @hoogle (MonadPlus m) => Bool -> m a -> m a
11:03:44  Control.Monad mplus :: MonadPlus m => m a -> m a -> m a
11:03:44  Control.Monad unless :: Monad m => Bool -> m () -> m ()
11:03:44  Control.Monad when :: Monad m => Bool -> m () -> m ()
11:03:51  Meh.
11:21:15 -!- ais523 has joined.
11:21:55 -!- ais523 has set topic: The IOCCC is back on! http://www.ioccc.org | http://codu.org/logs/_esoteric/.
11:22:10  ais523: heh, I just set an ioccc topic earlier
11:22:12  but it was so bad
11:22:28  I'm just aiming for an informative one
11:22:37  and I have an IOCCC entry ready, at least
11:22:41  ais523: so, umm, I had a scapegoat breakthrough (!), and then implemented some scapegoat code
11:22:42  I just need to check it for portability
11:22:52  given that it violates the Standard in a huge number of ways
11:24:06  ais523 is unfazed by your human scapegoats.
11:24:09  Scapegae.
11:24:25  ah right, scapegoat!
11:24:51  `quote Bright
11:24:53  251) [on Walter Bright]  I went to chat with him after his talk at the ELC and he was like "hum, right - humans. How do they work again... oh, hi!" \ 260)  who's walter bright and why is he so bright   locks: he's to D what I'm to ooc   locks: guilty \ 702)  Just about all females often feel that exactly why all Hollywood stars common maintain its brightness as Tom in
11:25:01  hmph, the first one
11:25:15  that first one is great
11:26:09  so they have managed to release the winning entries after *five* years?
11:26:31  ais523: anyway, the scapegoat breakthrough was what I believe to be the One True Conflict Resolution system (!), and the code is another implementation of the basic apply model, plus some ideas and scraps about how to abstract away the "pointer comparison" that you need to apply changes fast (rather than recursively comparing them to figure out whether the change referenced is the right one)
11:26:37  (if you use changes instead of references to them)
11:27:00  go tell me, I have about 2 and a half hours to listen before I go off to do marking
11:27:02  probably a bit less
11:27:38  ais523: well, you know how your existing solution have been changes that do a sort of spooky action-at-a-distance to other changes? you include a change "use hash foo instead of bar", and all the other changes you're applying end up with that rewrite, etc. etc. etc.?
11:27:53  (you can correct me if I've got your model wrong or whatever, but it doesn't matter much)
11:28:01 -!- Patashu has quit (Ping timeout: 245 seconds).
11:28:58  yes; I wasn't happy with that, but it seemed like the only way to do things
11:28:59  have you found an alternative?
11:29:35  ais523: yes, but I'd like to summarise the few things I didn't like about that first, so I can show how I was lead to this one
11:30:03  one: if a changeset is applicable, all its subsets should be applicable, because adding /more/ changes to a change can't make it "less conflicty"
11:30:22  two: it's not really clear /which/ changes, exactly, feel the effects of the hash rewrite; it seems more like a syntactic mechanism than a semantic change
11:30:53  ais523: so, here's the solution
11:30:57  hmm… I'm not sure that one: is correct, adding instructions on how to resolve conflicts should make a set less conflicty
11:31:03  tell me your solution, anyway
11:31:15  ais523: nah, not really, because "instructions" aren't really a thing
11:31:22  ais523: you apply changes by tsorting them, and then applying them in that order
11:31:27  if any fails, the whole thing fails
11:31:40  I suspect it breaks a /lot/ of nice properties by not having adding more changes not reverse a conflict
11:31:45  fair enough
11:31:49  anyway
11:32:08  hmm, how do you handle the case of making change A, reverting change A, later making change B that would conflict with case A?
11:32:15  wait, wait :)
11:32:24  ais523: let's say you have c1 = {insert "foo" between cX and cY}, and c2 = {insert "bar" between cX and cY}
11:32:41  and you want to make a change that "does both", by putting c1's line above c2
11:32:42  yep, a simple example of a conflict
11:32:58  ais523: we introduce a new type of change: FILECHANGE modulo FILECHANGECHANGE
11:33:07  we've already introduced the concept of change-changes, so this isn't too surprising
11:33:14  its semantics are, it does whatever the resulting change is, pretty much
11:33:16  ais523: and here's how you use it:
11:33:32  c12 = changeset {c1, c2 modulo {replace before-hash with c1}}
11:33:48  (if the changechange fails to apply to the change, the change itself fails, etc.)
11:34:03  it preserves the reference to c2, it can do arbitrarily complex resolutions
11:34:07  it's perfect
11:35:13  ais523: it also scales: e.g. if you need to back out a single element of a changeset to make a resolution work, then you can do that too, because changechanges mirror the structure of changse
11:35:15  changes
11:35:28  you can basically do an arbitrary transformation on it
11:35:57  and, ofc, you can resolve conflicts with /other merges/: you could change the "source-change" of a modulo change
11:36:00  as part of a modulo change
11:36:12  hmm, I think I have a few issues of this
11:36:17  *with this
11:36:23  first, assume I have c2 in my repo already
11:36:36  and want to pull someone else's repo which contains c1 and c2 modulo {replace before-hash with c1}
11:36:39  what happens?
11:36:43 -!- zzo38 has joined.
11:36:48  (this is not a hypothetical question at all)
11:36:50  ais523: umm, nothing special? it doesn't /mutate/ c2
11:36:54  c3 = c2 moduloe {replace before-hash with c1}
11:36:58  c3 is a /new/ change
11:36:59  just like
11:37:02  replace c2 with "haha"
11:37:03  elliott: so right, I have c2, and pull c1 and c3
11:37:06  presumably I get a conflict?
11:37:17  but I shouldn't, in any sane conflict resolution system
11:37:35  ais523: you do, because it's part of a /resolution/
11:37:37  ais523: the whole point is, e.g.
11:37:46  your head branch can't contain c2, because it conflicts with the latest revision
11:37:50  so instead of appending c2
11:38:00  you append changeset {insert ..., c2 modulo blah}
11:38:07  elliott: so in other words, if you make change c1 and I make change c2, then when you pull from me you resolve the conflict, then when I pull from you I also have to resolve the conflict?
11:38:38  ais523: yes and no
11:39:10  ais523: there /is/ a real conflict, because your branches /don't match up/, because a modulo change introduces changes _necessary_ to get things not to conflict, ergo there can't be compatibility; /but/ the merge strategy is obvious and automatic
11:39:23  which is to simply drop c2 in favour of the resolution
11:39:31  ah, so the conflict's automatically resolved via noticing that there's an edited version of c2, and replacing c2 with it?
11:39:36  yes
11:39:57  that isn't part of the apply algorithm itself, but plenty of useful merge tactics aren't; that's why there are additional ones on top
11:40:56  if you have any other issues with it I'm happy to hear them
11:41:19  I'm thinking
11:42:31  I think it's pretty much equivalent to the previous version; except that instead of "for c2 read c3", you're writing "c3" and letting the merge process automatically figure out it should get rid of c2
11:43:16  it's similar, except for preserving that property of changesets, and having a clear scope
11:43:20  ais523: for instance, you can do
11:43:37  changeset {c2 modulo {replace before-hash with abc}, c3 modulo {replace before-hash with def}}
11:43:41  ais523: even if c2 and c3 have the same before-hash
11:43:46  which, afaik, isn't possible with your system
11:44:13 -!- Vorpal has joined.
11:44:37  well, that changeset inherently contains a conflict
11:45:10  how?
11:45:12  is the rule for automerging with this "if you pull a patch A modulo B, eliminate patch A from your tip"?
11:45:24  elliott: it's trying to add two changes immediately after the same before-hash
11:45:35  ais523: basically, yes; also, no it's not
11:45:35  ah, wait, no
11:45:38  "abc" =/= "def"
11:45:43  it's moved them both to different locations in the original
11:46:09  incidentally, you can even just do cN modulo {make it into a nop}, but that makes future merging suck
11:46:20  elliott: so what if you make c1, and I make c2, and you pull from me and find that the two changes look identical and your version is better
11:46:24  (because you can't replace cN with another change and get hopes of getting relevant results)
11:46:27  what does the conflict-resolved version look like?
11:46:38  (which is possible with a proper changechange: consider replacing cN (changeset) with a larger changeset)
11:46:55  (as in, c1 and c2 do the same thing, and you prefer to have just c1 and to get rid of c2)
11:47:03  ais523: oh, in that case you simply have to pick one, which forces you to replace-by-nop the other
11:47:21  right, so you have c2 modulo {nop}
11:47:22  ais523: but that can be done automatically, and any future changes depending on c2 can simply be modulo'd so that /their occurrence of c2 is replaced by c1/
11:47:28  which is where this operation shines
11:47:34  that's the same operation I added!
11:47:46  so I think they're both shining equally ;)
11:47:50  ais523: no, it's not: yours was restricted to one level of hash modifications, and yours /didn't have a scope/
11:48:07  its scope was "all repos containing both this hash and the hash this hash modifies"
11:48:20  wait, it /mutated global state/?
11:48:26  no
11:48:30  that's even worse, there's no way to resolve two changes containing the same hash in different ways
11:48:33  only local state
11:48:35  ais523: yes it does, it just records it as a transformation
11:48:38  global = repo-global
11:48:46  the hashes still mean the same things
11:48:52  it just changes the rules for resolving them
11:49:01  (I'm not trying to claim my way's better, btw; just trying to compare)
11:49:12  anyway, mine has absolutely no disadvantages compared to yours, keeps desirable properties, is more general, and allows more complicated merges :P
11:49:23  yeah, I'm not ~mechanism fighting~ or anything
11:49:33  I just think this way is pretty obviously the Right Thing for conflict resolution
11:49:41  because it /looks/ like the rest of the changes
11:49:45  elliott: hmm… so how would the fact that "references to c2 should be replaced with references to c1" be expressed in your modulo notation?
11:49:47  "replace  with ", etc.
11:50:08  perhaps it should be explicit, rather than implicit
11:50:13  ais523: c2 {replace occurs of c2 with c1}, most likely; that's a sane operation for changechanges to have
11:50:19  erm
11:50:22  ais523: c3 modulo {replace occurs of c2 with c1}, most likely; that's a sane operation for changechanges to have
11:50:34  as in, instead of {c2 modulo replace before-hash}, have {c2 modulo replace before-hash, remove c2}
11:50:47  ais523: huh?
11:50:57  wtf is that supposed to mean...
11:51:32  ais523: remove is delete-line, right?
11:51:40  elliott: well, you're pulling c2-modulo, and eliminating c2 in the process
11:51:45  elliott: err, no
11:51:48  I mean delete-hash
11:51:57  ais523: what the hell is delete-hash?
11:52:01  that's not a change!
11:52:02  the idea is that if you pull a changeset with c2 modulo replace before-hash
11:52:14  then you want to eliminate c2 from the changeset you're adding c2-modulo to, right?
11:52:28  type error
11:52:34  if "remove c2" is meant to be a changechange
11:52:39  why are you putting it in the same set as a change?
11:53:17  elliott: well, you're putting c2-modulo in a changeset; and that /implicitly/ has a delete-hash c2
11:53:22  is it about sg again?
11:53:33  ais523: what? no it doesn't
11:53:35  I'm saying you should make it explicit, as you have a change and an implicit changechange in the same hash atm
11:53:40  elliott: you said it did earlier
11:53:53  ais523: that's in the /layer above/, not the apply algorithm itself
11:53:54  ais523: in fact, it's perfectly possible for a change and a modulo of it to coexist
11:54:15  changeset {c2, c2 modulo {replace before-hash with some-other-line, replace after-hash with some-other-line-right-after-it}}
11:54:32  it's just that, whenever C conflicts with C modulo BLAH, the latter wins, in the helpful auto-merging strategies
11:55:11  I'm saying that making it depend on the hash being modulo'ed seems wrong somehow
11:55:37  what about having the changeset as {c1, c3=(c2 modulo replace before-hash), mergehint(replace c2 with c3)}
11:55:39  that's the whole point
11:55:47  it's a semantic indication that it's a resolution
11:55:59  ais523: mergehint? are you /trying/ to make this as inelegant as possible?
11:56:32  elliott: OK, what about this: you edit a file twice, inserting a line each time (adjacent to each other); call the changes that add those lines x1 and x2
11:56:44 -!- sebbu2 has joined.
11:56:44  I edit a file once, adding a single line x3 that does the same thing that x1 and x2 do together
11:56:48  x2 having x1 as its before-hash, yes?
11:56:54  (replace "line" by another semantic unit if you want)
11:56:57  elliott: yes
11:57:01  OK, go on
11:57:10  now you pull from me, and decide that my x3 is more elegant than your x1+x2
11:57:23  I'm glad you acknowledge my superior taste
11:57:36  wait, I think I may have screwed up my example
11:58:01  perhaps the problem I thought I saw isn't real after all
11:58:22  Perhaps it's hiding! :D
11:58:29  and I'm trying to find an example that does illustrate it, now
11:58:57 -!- elliott has quit (Remote host closed the connection).
11:59:26 -!- elliott has joined.
12:00:05 -!- sebbu has quit (Ping timeout: 260 seconds).
12:01:09  ais523: incidentally, there's another two sg-thoughts I had, but they're less important than this one and can wait
12:04:55  let's see… if, say, Vorpal pulls a repo that contains c1 and c2-modulo, but doesn't have either c1 or c2 yet, presumably the correct thing to happen is for him to just add c1 and c2-modulo as written, and if he ever pulls c2 in the future, discard it?
12:05:57  ais523: I can't answer that question, because you're using "pull" ambiguously... you mean "merge into main branch", right? obviously it's impossible to /fetch/ c2-modulo without fetching c2, since that would result in a corrupt database
12:06:18  by "pull" I mean "include into the set of changes I'm considering my repo", or "whitelist"
12:06:28  right
12:06:29  I'm assuming that all mentioned hashes are fetched
12:06:43  ais523: anyway, /maybe/, you're oversimplifying the logic a bit
12:06:47  this is the exact merge rule:
12:07:20  if there is a conflict between C and C modulo CC, CC modulo CC wins
12:07:33  note that, if you have C modulo CC somewhere in the ancient history of the repo
12:07:40  and then C gets pulled in for whatever reason
12:07:44  and it applies cleanly
12:07:46  then that's fine, it just works
12:07:57  or if it conflicts with XYZAHASUIDHSAD, made twenty thousand years after C modulo CC
12:07:59  then that's a real conflict
12:08:11  it's /only/ when the conflict is between C and C modulo CC that the latter wins by default
12:08:25  hmm... so let's call c2-modulo c3, as usual
12:08:37  in this case, we have c3 depending on c1, and c1 conflicting with c2
12:08:59  that counts as a conflict between c2 and c3, right?
12:09:14  I take it depends on it because c3 looks like c2 modulo {replace before-hash with c1}, yes?
12:09:17  yep
12:09:55  ais523: yes, it does
12:10:20  good; then I think this definitely gives the expected behaviour in the simple case
12:11:10  I'm trying to think of a case where it's possible that c and c-modulo don't conflict, and the only one I can think of is when a block of code is moved from one part of the code to another
12:11:16  and using modulo changes there is dubious in the first place
12:11:31  ais523: heh, the more relevant and important of my other two sg thoughts is about move changes
12:11:35  maybe i should bring it up now
12:11:40  go for it
12:12:44  ais523: move changes of the form "move (a,b) to (c,d)" are broken. they introduce /silent/ dependencies, because they make changes able to be applied without those changes depending on the move changes. why is this important? remember: changesets are applied by tsorting on dependencies, and then applying in that order
12:13:11  with move changes as they are currently, it's possible for tsorting to produce a working or non-working ordering, depending on how the sorting algorithm works
12:13:16  yep, I realised there was something wrong with them
12:13:28  and the tsort ordering can fail while another ordering can work
12:13:35  although, I can't think of a specific example for what you're saying
12:13:54  ais523: you make a move so that c9 is above c7
12:13:56  why would it matter whether code was edited before or after moving it? or am I missing something?
12:13:59  and you have another change that inserts between c9 and c7
12:14:08  call the move cM
12:14:12  and the insert cQ
12:14:19  changeset {cM,cQ} applies in order cM->cQ
12:14:22  but not cQ->cM
12:14:27  but cQ doesn't depend on cM, so tsort doesn't see this
12:14:28  elliott: oh, the "anotehr change" would have to be "insert between cM and c7"
12:14:28  thus broken
12:14:33  not "insert between c9 and c7"
12:14:36  because it depends on being after the move
12:14:47  ais523: so you make the last line of the merge get the hash cM?
12:14:51  ais523: what do you do with the first hash?
12:15:24  elliott: last and first; either you give them different hashes, or you say that the first line is cM referred to from above and its old hash from below, and the last line is cM referred to from below and its old hash from above
12:15:44  ais523: you cannot have two lines with the same hash!!!
12:15:51  what the heck does "replace cM with blah" do? "delete cM"?
12:16:01  err, right, good point
12:16:24  hmm, weren't replaces and deletes meant to have context? as in, "delete c8 between c7 and c9"?
12:16:32  the problem with the former solution is, hashes refer to changes, that's sg's strength, and there aren't two changes to go around
12:16:34  or is that not needed?
12:16:39  ais523: nope, that's a flaw
12:16:39  elliott: right, OK
12:16:45 -!- LadyJ has quit (Quit: Rooms • iPhone IRC Client • http://www.roomsapp.mobi).
12:16:54  ais523: code should be resilient against being moved around, in general
12:17:37  so we call the first and last lines cM1 and cM2 for the purpose of any change that cares about their new location, and use their old names for the purpose of changes that would work in either location (and obviously, also for changes that would only work in the old location)
12:17:52  ais523: crazy idea that doesn't work: implement move (a,b) to (c,d) by doing: changeset {a modulo {change before-hash to c}, b modulo {change after-hash to d}}; these now conflict with the original additions, but conflict resolution sorts it out automatically
12:17:55  /please/ prove to me that doesn't work
12:18:13  wait, oh, good
12:18:15  it doesn't work at all
12:18:19  inserts don't work like that
12:18:20  phew
12:18:33  right, I was hoping that wouldn't work too
12:18:39  ais523: re your solution: that's obviously not the Right Thing
12:18:47  it does seem wrong, indeed
12:18:57  but I'd like to hear why not, to help me come up with a correction ;)
12:19:04  not a single thing has been improved by breaking the line->change mapping so far
12:19:12  ais523: well, it involves numbers, and special cases
12:19:15  :)
12:19:32  Have you seen the television show called "Weird or What?"
12:20:29  elliott: notionally, I want the move to add two hashes that refer to zero-length lines just before and after the block of code moved
12:20:30  ais523: I'm inclined to think that move changes themselves should change
12:20:32  what to, I'm not sure
12:20:36  Once they had someone say something about ghosts, about infrared and stuff; this is a testable hypothesis so why don't they test it?
12:21:39  ais523: hmm... if you had {atomic : set of change -> change}, you could do: atomic {move a to after c, move b to before d}
12:21:41  there's no reason we can't actually simply add those, I guess, but it seems wrong in another way
12:21:47  ais523: atomic because, neither change can apply without conflicting, but if you do "both at once" it works
12:21:55  and you have two subchanges which become the new hashes of a and b
12:22:01  but, umm, that's ridiculous
12:22:05  and I have no idea how to implment atomic at all
12:22:24  just mark them as "equal" in your topological sort; it's not too hard to implement
12:22:31  (there are tsort algos that can handle things being equal)
12:22:43  ais523: that won't work, you /can't apply two changes/ at once
12:22:43  (I know, because I wrote one for my PhD research)
12:22:46  applying a change is the atomic thing
12:22:59  i'm not writing some hideous interleaving algorithm for the sake of basically just doing a move change with a hack to make it have two hashes
12:23:15  elliott: well, the order of the two changes itself would have to be irrelevant, which it is; it'd just be atomic because it'd force them to happen consecutively
12:23:26  ais523: oh no, neither would apply without conflict
12:23:29  but this thing seems ridiculous in other ways
12:23:35  because it makes no sense, it causes a rupture in space-time
12:23:51  it starts at c, goes on for five lines; the next line is d, but b's end-hash is still after q
12:23:57  right, but as long as you don't check for space-time ruptures until after the atomic finishes, it's fine
12:24:01  let's just forget about this, it's making my head hurt
12:24:07  that solution, I mean
12:24:26  ais523: here's my implementation of Move, for no particular reason:
12:24:28  apply (Move (FileRange srcS srcE) (FileRange dstS dstE)) = \xss -> do
12:24:28    (beforeSrcS, afterSrcS) <- withZipper f xss
12:24:28    (src, afterSrcE) <- withZipper g afterSrcS
12:24:28    let beforeSrcS' = reverse beforeSrcS
12:24:28    (++ afterSrcE) <$> withZipper (h src) beforeSrcS' <|>
12:24:29      (beforeSrcS' ++) <$> withZipper (h src) afterSrcE
12:24:31    where f z@(_, ys) = z <$ guard (isStart srcS ys)
12:24:33          g z@(xs, _) = z <$ guard (isEnd srcE xs)
12:24:35          h src (xs, ys)
12:24:37            | isStart dstS xs && isEnd dstE ys = Just $ fromZipper (xs, src ++ ys)
12:24:39            | otherwise = Nothing
12:25:47 -!- Aune has joined.
12:26:55  ais523: it's actually quite elegant, shame move changes are broken
12:27:30  elliott: my current thoughts are tending along the lines of "everything should have a before-hash and an after-hash that are different"
12:27:47  ouch
12:27:47  I think that preserves all the properties we need, while also making creating new files and move changes working correctly
12:28:00  elliott: you'd just stick a or b on the end of the hash, I guess
12:28:22  hmm, perhaps that doesn't help after all
12:28:28  I don't think it does...
12:28:45  and it adds a lot of weird insert cases, like inserting between the "after" of one line and the "after" of another
12:28:53  maybe we should ask Gregor :P
12:29:03  that'd be incorrect, inserts would have to be between an after and a before
12:29:07  as a type system level requirement
12:29:08  he will clearly come up with the perfect solution!
12:29:11  they're badly typed if they aren't
12:29:23  ais523: ok, but doesn't that defeat the point of move changes making before/after hashes?
12:30:04  no; the idea is that a move change would simply provide its hash as the before hash of the first line, and the after hash of the last line
12:30:18  well, ok
12:30:28  then everything works correctly, additions/deletions/replacements, I think
12:30:39  I'm still knee-jerk against this but maybe I will see the light :)
12:31:13  a delete hash would be "delete one line from before-hash to after-hash"; that way, deleting after a move is made doesn't conflict with the move, deleting before does (and should)
12:31:23  *a delete change
12:31:30  hmm
12:31:40  and if before-hash and after-hash aren't consecutive lines for whatever reason, it conflicts
12:31:47  ais523, elliott: is this "move a file" or "move a segment of text" or something more generic than that?
12:31:54  latter
12:31:57  in fact, this lets you do things like replacing a space with a newline without causing conflicts on changes to the line before or after
12:31:59  ah
12:31:59  although it's used for renames, too
12:32:41  elliott, because handling renames seems to me like an easier problem than moving text blocks inside a file or between files. Beside for the later case how would you even detect that was what happened?
12:32:51  which is definitely a desirable property; it makes sg independent of what is and isn't a line
12:32:58  unless you hook into the clipboard handling or something crazy
12:33:05  Vorpal: the user would indicate it was a move
12:33:11  Vorpal: I don't really feel like explaining scapegoat to you so that you have enough knowledge to understand this, but what is an easier problem or not is irrelevant
12:33:11  ah okay
12:33:13  perhaps in response to a question from sg itself asking
12:33:15  ais523: nah, moves can be mostly auto-detected
12:33:19  right, indeed
12:33:20  silently
12:33:36  Vorpal: you can't detect filesystem renames either, anyway
12:33:39  which is why you just guess instead
12:34:17  elliott: actually, perhaps it's just simplest to give every line in the move a new hash; in that case, a move would always conflict with an edit to the code before it was moved, which is sometimes desirable and sometimes undesirable
12:34:30  ais523: that's the same as not having move
12:34:30  s
12:34:33  the reason I'm thinking along those lines is, what if code is /copied/ rather than moved
12:34:34  and just deleting and reinserting every line
12:34:37  elliott: well, right, it is
12:34:44   Vorpal: you can't detect filesystem renames either, anyway <-- well, several currently existing version control systems have move commands for that
12:34:47  it also means you can't do things like, split a file into two
12:34:49  if you copy code, you want to be able to edit one copy without changing the other
12:34:51  some have copy to track a common source of a file
12:34:54  and a missed rename completely breaks the world
12:34:56  and [...]
12:34:59  ais523: basically no, we need move changes :P
12:35:05  hmm, OK, this is a good case for move changes existing
12:35:14  it's also a good case for them not being introduced silently, though, I think
12:35:28  perhaps we should just mention they were introduced and give the user a chance to change that
12:35:34  ais523: ehh, why?
12:35:38  move changes never really hurt anything
12:35:49  elliott: because a move is not equivalent to a copy followed by a delete
12:36:00  how do you track copying then?
12:36:04  atm, we don't
12:36:07  ais523: sure it is, if it's done in-between invocations of sg
12:36:07  ah okay
12:36:22  elliott: suppose you copy-and-paste some code, while someone else edits the original
12:36:24  copying isn't worth tracking
12:36:27  since you can't share hashes, full stop
12:36:36  should the edit be applied to the old location, or the new location, or both, or something else?
12:36:44  ais523: copy-and-paste, not cut-and-paste?
12:36:49  yes, copy-and-paste
12:37:06  the original, since it's just a copy; the solution to this being bad is to not copy-and-paste code
12:37:07  I'm trying to work out desired behaviour so I can work out the correct semantics in sg
12:37:13  sg can't make you abstract properly
12:37:37  "the original" is what every VCS in existence does; the intended solution is probably "both" but I agree with you that doing that would be utterly insane
12:37:38  if you, e.g. move all of a file but two functions into another file as part of a refactoring
12:37:42  and someone else does bugfixes in the meantime
12:37:44  and I think the /correct/ answer is "conflict"
12:37:49  then it shouldn't spuriously conflict if it can detect a move
12:38:00  because we can't know if the edit should happen in the new location, the old location, or both
12:38:03  basically, if sg is confident enough that a move has taken place, it _really should_ automatically add a move change
12:38:39  elliott: hmm, example: let's say we have a C function that uses only library functions from stdio.h
12:38:45  ais523: conflict is ridiculous, you'd have to break sg's model to do that
12:38:46  and it's in a file that includes both stdio.h and string.h
12:38:47  even if it is desirable
12:38:50  as in, the fundamental model
12:38:54  it's basically action at a distance
12:39:04  inserting some text in another file caused conflicts in a different one
12:39:15  elliott, how do you handle a cut-and-paste + change some lines of code. Like if I move something I might need to change a implicit reference to the current module to an explicit reference to another module
12:39:22  now, let's say that someone moves that code to another file, which includes just stdio.h
12:39:37  and independently, someone else edits the original to call functions in string.h
12:39:47  Vorpal: please, I've already said you don't understand sg at all for me to be able to reasonably communicate with you about this
12:40:11  ais523: it'll merge properly, and then fail to compile
12:40:12  with your current sg move semantics, person 1's version compiles, person 2's version compiles, there are no conflicts if you merge them together, but the resulting code doesn't compile
12:40:16  yep
12:40:19  is that desirable?
12:40:19  ais523: we've already established that sg /will/ break code
12:40:26  and it's theoretically impossible for it not to
12:40:31  well, OK
12:40:41  I'd just like a little warning message letting people know that this is one of the less safe cases
12:40:51  ais523: in this case, the compile error will lead to a simple solution, and the user can commit a perfect merge
12:40:55  also, this /isn't/ less safe!
12:41:12  actually, /can/ the user commit a perfect merge?
12:41:14  I mean, it only seems less safe because you picked an example where it fails now
12:41:18  as opposed to all the other ways merges can break
12:41:24  the fix would be to add #include  to the second file, right?
12:41:28  which you aren't considering
12:41:34  but that doesn't have a dependency on the addition of the function
12:41:35  couldn't the code end up compiling in some cases but in the wrong way
12:41:36  it's enough that "sg diff" shows there's a move being made
12:41:38  well, OK
12:42:11  ais523: well, it'd be a merge without there being an actual conflict
12:42:14  Vorpal: possibly, but I imagine such examples would be contrived, and equally likely to be caused by human error than by sg eagerness
12:42:29  ais523: which is a perfectly plausible action
12:42:38  ais523, if, in the example here, there is the same function name (but doing different things) from different sets of headers. I guess it could happen if the header files come from different libraries and are macros
12:42:40  elliott: I guess in an ideal world, things like #include lines would be generated automatically
12:42:48  err the functions in question are macros that is
12:43:05  ais523: yep; you're free to help me figure out how to implement @ if you want @sg :)
12:43:24  I think this is more an issue of getting the right internal representation of languages
12:43:37  oh dear
12:43:47  e.g. for OCaml, instead of writing "open List", followed by "sort" later on, it'd be stored internally as "{implicitly List}.sort"
12:44:03  ais523: you should lower your expectations slightly :)
12:44:15  hey, we can get sg working first, then do this sort of thing later
12:44:21  agreed
12:44:22  actually, this sort of thing is independent of sg
12:44:29  as it'd work with other VCSes too
12:44:33  perhaps I should work on it
12:44:39  for fun
12:45:02  a sort of "diffable transform" of code, that's designed to remove issues related to things like indentation and header files
12:45:38  ais523: I think I can show your worries about unsafe moves contrived
12:45:46  $ hg mv foo.c bar.c
12:45:52  at the same time, someone writes some code in foo.c
12:46:01  and it merges cleanly because what the hell is the point of a mv otherwise
12:46:04  BUT
12:46:10  and the code depends on the file's filename being foo.c?
12:46:10  the build system compiles bar.c differently to foo.c!!!
12:46:13  rocks fall everybody dies
12:46:22  that's not even /that/ contrived, you could add it in the same commit as the mv
12:46:28  I think the argument here's about the principle of least surprise
12:46:33  and file-specific CFLAGS are not that uncommon
12:46:47  ais523: (note that git auto-detects renames)
12:46:50  as in, what people will blame for a mistake when it happens
12:46:54  (I just used hg to show because it has an explicit mv)
12:47:16  ais523: it's unreasonable to expect things to always work perfectly after a merge
12:47:16  hmm, should sg also have rewrite changes?
12:47:21  that's why you do things like test the code
12:47:29  nobody said sg solves collaboration :)
12:47:37  right
12:47:41  ais523: I don't think so; a rewrite should conflict with any modification to the file, pretty much
12:47:48  and if you rewrite, you'll change enough hashes that that happens automatically
12:47:53  that's the conclusion that I was coming to
12:48:02  I suppose someone could add an #include or something, but they'll change something lower down if they're doing that
12:48:04  and that'll conflict
12:48:17  I think you could argue that a rewritten file shouldn't conflict with changes to its old version
12:48:18  if an actual change gets through without conflicting, well, it wasn't a total rewrite then
12:48:23  but I don't think that's a correct viewpoint
12:49:23   I suppose someone could add an #include or something, but they'll change something lower down if they're doing that <-- actually it happened that I only added an #include. Someone had forgot an #include in some project I was working on, and didn't have -Wall on (ugh), so it got the implicit declaration thingy of C. Which happened to work there.
12:50:19  unused #includes don't typically break code, so even that getting through would be a really really minor failing of sg :P
12:50:32  true
12:52:19 -!- tiffany has quit (Ping timeout: 276 seconds).
12:52:33  ais523: OK, here's an idea that just might be stupid enough to work:
12:54:43  ais523: a new change type: "cut (a,b)". this removes all lines from a to b. another two change types, "paste start of cN after c", "paste end of cN before d". cN must be a cut change; their start and end lines are recreated after/before the given lines, with the paste changes becoming the new hashes. and finally, "fill in (c,d)"; this restores all lines "in the middle" between the two changes, which must be pastes of the same cut; their hashes are
12:54:44   unchanged
12:55:32  what if c and d aren't consecutive?
12:56:33  ais523: ok, in response to this legitimate complaint, allow me to make it stupider
12:57:03  ais523: there's no "paste end", just "paste start", and it takes d as well as c (so it's "between" instead); fill fills in the last line as well, and the fill change becomes the last line's new hash
12:57:42  why are paste and fill separate changes? so they can have separate hashes?
12:58:15  ais523: yep! that is the one and only reason.
12:58:24  i think you will agree that it is, indeed, /impressively/ stupid.
12:58:32  right, indeed
12:58:45  oh, you don't even need the cut part. but you do, because that makes it even stupider!
12:58:48  I think it's simple enough to have more than one hash for one change if required; we're already doing that with "new file"
12:59:09  ais523: those aren't hashes in my latest model
12:59:13  they're special end points
12:59:18  and can only appear at the correct side of ranges
12:59:22  so, they're not changerefs at all
12:59:25  the main problem with just changing the hash for the first and last line is that you then get a conflict if you insert between the first and second lines of what you moved, when there's no reason to do so
12:59:29  (although SOF/EOF both /contain/ a dirchangeref)
12:59:47  ais523: ooh, maybe it should be based on adding a new "subfile" somehow to reuse the SOF/EOF... i'll stop, this is too silly
13:00:06  ais523: also, that's true
13:00:15  ais523: hmm, maybe we should make a concept of "textless lines"
13:00:21  SOF/EOF would become one, and so would SOMove/EOMove
13:00:33  yep, I mentioned that before, and it's increasingly seeming like a good idea
13:01:18  ais523: although i don't really like that, because a lot of things are nonsense
13:01:19  there is an issue here, actually, which I want to explain by example
13:01:22  you can't delete SOMove, you can't move SOMove
13:01:24  you can't replace SOMove
13:01:30  it only makes sense in ranges
13:01:37  and just blehhhhhhh
13:02:12  suppose that the code initially starts "a b c d e f g"; I edit it to "a b e f c d g", then again to "a b e f h c d g"; meanwhile, you edit it to "a b i c d e f g"
13:02:17  what should be the correct result after merging?
13:02:37  ais523: is each word a line?
13:02:42  yep
13:03:11  umm, let's try duplicating this so my brain gets it
13:03:16  aaa bbb ccc ddd eee fff ggg
13:03:21  aaa bbb eee fff ccc ddd ggg
13:03:27  aaa bbb eee fff hhh ccc ddd ggg
13:03:34  aaa bbb iii ccc dd eee ff gg
13:03:43  ais523: is the second-last line being longer intentional?
13:03:51  yes
13:03:55  actually, the last is also longer
13:03:59  you just typoed it shorter
13:04:05  lol
13:04:06  aaa bbb iii ccc ddd eee fff ggg
13:04:46  argh
13:04:55  i can't get my brain to parse these letters properly :P
13:05:34  ais523: I suspect the answer is "conflict, but a practical system will duplicate c"
13:08:18  ais523: but i dunno
13:08:24  actually, I think the correct answer is "conflict no matter what", as there are three plausible locations for i in the result
13:08:42  ais523: no, I mean, it should conflict, but there's no reasonable way for the system to conflict
13:08:43  but like i said
13:08:47  i had a hard time parsing it
13:08:57  [13:05]  ais523: I suspect the answer is "conflict, but a practical system will duplicate c"
13:08:59  [13:05]  actually, I think the correct answer is "conflict no matter what", as there are three plausible locations for i in the result
13:09:11  ...?
13:09:23  oh, did it reconnect all by itself?
13:09:28  I had a network outage for a couple of minutes there
13:09:37   argh
13:09:37   i can't get my brain to parse these letters properly :P
13:09:37   ais523: I suspect the answer is "conflict, but a practical system will duplicate c"
13:09:38   ais523: but i dunno
13:09:38   actually, I think the correct answer is "conflict no matter what", as there are three plausible locations for i in the result
13:09:39   ais523: no, I mean, it should conflict, but there's no reasonable way for the system to conflict
13:09:42   but like i said
13:09:44   i had a hard time parsing it
13:09:59  but misspelled /reconnect
13:09:59  and it seems that the IRC system figured it out on its own
13:10:25  heh
13:10:34  hmm, I think a move change itself should be "move from a to b between c and d to between e and f"
13:10:49  [CTCP] Received CTCP-PING reply from ais523: 10 seconds.
13:11:17  If you want to adopt a kid outside the US, you will have to abide by international law.
13:11:41  wat
13:12:22  observed during spam cleanup
13:13:01  our spambots are great :)
13:13:13  we should give them a special place on the wiki to donate their works
13:14:12  don't we have a captcha thingy?
13:14:37  yes for anon edits
13:14:40  and for link edits
13:14:43  but it's a really bad captcha
13:15:08  should have for account creation too
13:15:56  we do
13:16:06  the spambot we've been getting lately knows how to break it
13:16:19  ais523: bots!!! they're people too!!
13:16:49  ais523, need a more advanced captcha then
13:17:01  yes, but it's hard to persaude Graue to change it round
13:17:07  hm
13:17:18  the obvious fix to the current spam surge is requiring someone's first edit to be made outside userspace
13:17:29  heh
13:17:34  which is a trivial requirement for a human to obey (they can just edit the sandbox or something)
13:18:02  what I'd /really/ like is the AbuseFilter extension, so I don't have to bug Graue to change the settings each time there's a new spambot attack
13:18:13  but I'm not sure it'd be compatible with the version of MediaWiki used on Esolang
13:18:25  so time to update mediawiki then?
13:18:30  We should really just require email confirmation of registrations. Nobody but zzo would mind. :p
13:18:41  he would mind?
13:18:48  it wouldn't surprise me if the spambots could do that too
13:19:00  zzo doesn't have an email address, and doesn't like having to use an email address to do things.
13:19:15  elliott: just allow confirmation over gopher too
13:19:17  then it'd be fine
13:19:24  he doesn't...?
13:20:17  Vorpal: why are you acting surprised?
13:20:47  well, it is a major impairment. When you are looking for jobs people usually ask you to email your CV and so on.
13:20:54  I forgot how old zzo was
13:21:00  maybe that is no problem to him
13:22:08  Vorpal: it's trivial to email someone your CV without an email address
13:22:15  the issue is receiving, not sending
13:22:37  ais523, well you usually get replies by email too
13:22:56 -!- Jafet has joined.
13:42:33 -!- elliott has set topic: The IOCCC is back on! http://www.ioccc.org | "Wittgenstein and Turing similarly agreed that it’s bad for a bridge to fall and kill people." | http://codu.org/logs/_esoteric/.
13:52:17 -!- ais523_ has joined.
13:52:40  hi again everyone
13:53:52  hi
13:58:23  heh, I'm reading through the solutions to "sort by first occurrence"
13:58:37  and the four Perl answers each used a different algo
13:59:48  I don't get why the first one works at all, actually (I can mentally work through what it does but it seems it'd produce the wrong answer, so I think I'm missing something)
13:59:52  oh no, I've just realised why it works
13:59:56  that's beautifully hideous
14:00:07   print$$_ for map$$_.=$_,<>
14:01:03  it's hard to fit how awful that algo is from a maintenance point of view in my mind, it's that bad
14:01:12  and yet, it's beautifully short
14:06:23 -!- MSleep has changed nick to MDude.
14:10:22   it's hard to fit how awful that algo is from a maintenance point of view in my mind, it's that bad <-- what does it do?
14:10:36  it is basically gibberish to me
14:25:50  Vorpal: 'heh, I'm reading through the solutions to "sort by first occurrence"'
14:41:35  Deewiant, ?
14:41:46  Vorpal: 2011-11-14 15:58:18 ( ais523_) heh, I'm reading through the solutions to "sort by first occurrence"
14:41:50  oh right
14:41:52  yeah
14:42:03  Deewiant, better question: how does it do it?
14:43:14  Beats me
14:54:22  "map $$_ .= $_, <>" does for each line -- let's say containing "foo\n" -- the equivalent of 'append "foo\n" to variable called "foo\n"' and then returns the result. So if you have a file containing the lines "a", "b", "a", it will return "a\n", "b\n", "a\na\n" while setting the variable "a\n" to "a\na\n" and "b\n" to "b\n". Then it tries to print all variables "a\n", "b\n", "a\na\n" -- the first one will print two lines of a, the second one one line of b, and t
14:54:22  he third one nothing.
14:59:20  Cf. http://sprunge.us/deHR
15:09:31 -!- copumpkin has quit (Quit: Computer has gone to sleep.).
15:17:53 -!- Zuu has quit (Ping timeout: 240 seconds).
15:30:48 -!- ais523 has quit (Read error: Operation timed out).
15:34:19 -!- copumpkin has joined.
15:38:13 -!- ais523_ has quit (Quit: Page closed).
15:40:44 -!- ais523 has joined.
15:42:49  Vorpal: Deewiant: the way the code works is to effectively use the entire space of possible variable names as a dictionary; each time it comes across a line of input, it concatenates that line to the variable with the same name, and records the resulting value; then afterwards, it interprets each of the resulting values as variable names in sequence, outputting what's there
15:43:22  the only ones that will have nonempty values are the ones consisting of exactly one occurrence of the input lines, i.e. the first time they were encountered
15:45:48  it's always nice when the winning entry in a golf competition is heavily obfuscated just because that's the shortest way to do it
15:50:13   maybe we should ask Gregor :P
15:50:14  Gregor: You have 1 new message. '/msg lambdabot @messages' to read it.
15:50:21  elliott: MAYBE YOU SHOULD M---actually I'll read this first.
15:50:52  OK, Cake babbles incoherently.
15:51:02  elliott: MAYBE YOU SHOULD MAKE TRANSACTIONAL HACKBOT WORK LOLOLOL
15:54:08  Subject of a spam email: "Playboy Playmate revealed!"
15:54:11  My thought: "No shit"
15:56:32  ais523: which challenge was it?
15:57:04  quintopia: sort by first occurrence
15:59:40  ahh...uhh...link? :/
16:00:10 -!- Phantom_Hoover has joined.
16:00:56  http://golf.shinh.org/p.rb?sort+by+first+occurrence
16:01:11  I submitted it; I came across it at work and thought it was a really interesting question
16:01:31  and after seeing the answers, still maintain that it's a really interesting question
16:03:43  your expl makes somewhat more sense now :P
16:03:58  whose solution are you describing
16:05:52  quintopia: the best Perl solution
16:05:59  by tails
16:06:10  cat /usr/share/dict/words | egrep '^[abcdefghijklm]+$' - | ./a.out
16:06:12  >jchgfbikmlaed
16:06:22  if I add in n as well, it segfaults
16:06:40  whoa
16:06:59  it's my IOCCC submission, that I've been working on for ages
16:08:32  something funky in the words list?
16:08:32  heh, running under valgrind, it spews errors but doesn't segfault even with n added
16:08:53  no, the program's just that insane
16:09:07  it contains no statements, and calls no memory allocation functions, and uses no VLAs
16:09:07  huh
16:09:19  ERROR SUMMARY: 15475827 errors from 15 contexts (suppressed: 12 from 7)
16:09:22  what does it do when it works
16:09:37  calculates the winner of a Single Transferable Vote election to elect one candidate
16:09:48  ah
16:11:13  aha, I think it's segfaulting due to exhausting memory
16:12:17  hmm, I need to remember how this program actually works before the submission date
16:15:03   it's my IOCCC submission, that I've been working on for ages
16:15:03  Phantom_Hoover: You have 2 new messages. '/msg lambdabot @messages' to read them.
16:15:11  The IOCCC is still running?
16:15:28  Phantom_Hoover: see topic
16:15:46  O.o
16:23:33  wait what?
16:23:44  I start two variables uninitialized; if I initialize them to 0, it makes the program segfault
16:24:27  oh, obviously
16:24:36  they're uninitialized deliberately because they're being used as part of a stack-smash
16:30:05 -!- Ngevd has joined.
16:30:14  Hello!
16:31:12  hi
16:31:28  I'm going to see if I can tweak this to fit the whole of /usr/share/dict/words into the 1.5GB stack space I extended the stack to
16:32:19  I've been thinking about a functional Piet-like language
16:33:39  I've got words containing a-s to run
16:33:44  although adding t, there will be a lot more
16:33:46  I'm trying that run now
16:35:33  Vorpal: do you know where to download the Intel C compiler (for Linux) from?
16:37:38 -!- Phantom__Hoover has joined.
16:37:41  hmm, compiling it with clang it gets into an infinite loop growing the stack until it segfaults due to inability to expand the stack
16:38:26  ais523: http://registrationcenter-download.intel.com/irc_nas/1959/l_ccompxe_ia32_2011.0.084.tgz
16:38:48  Based on the arch linux user package
16:38:49  If you use the websafe palate rather than the Piet palate, that gives you 215 possible commands
16:39:09 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds).
16:39:15  Deewiant: and a non-direct link?
16:39:24  ais523: Somewhere there http://software.intel.com/en-us/articles/intel-compilers/
16:39:33  thanks
16:43:57 -!- ais523 has quit (Ping timeout: 240 seconds).
17:05:07 -!- monqy has joined.
17:19:14  Hmmmmmmmmmmmmmmmmmmm
17:19:18  Speaking of IOCCC ....
17:19:29  Sopio is a fun game
17:19:31  I seem to have a tweetable interpreter for a near-TC programming language ...
17:19:44  "Near"-TC?
17:19:51  That's what's also known as non-TC.
17:19:53  C isn't turing-complete
17:20:12  Ngevd: Exactly
17:20:17  Phantom__Hoover: See: Ngevd
17:20:19  That's a point of contention, arguably.
17:20:40  The language is conceptually TC, but since the interpreter is its definition, it's not.
17:21:40  So it's not, in fact, a compliant interpreter?
17:21:48  char*a,b[9999];main(){gets(a=b);while(*a)a+=(a[*a]-=a[a[1]])?3:a[2];puts(b);}
17:22:01  Calling it non-compliant makes no sense, the language is defined by the interpreter.
17:22:15  Nowait
17:22:15  So it's not TC?
17:22:17  That's the wrong one ...
17:22:24  Good lord you're stupid
17:22:28  It's over-specified
17:22:41  b[9<<20],*a=b;main(){while(scanf("%d",a++)>0);for(a=b;*a;)a+=(a[*a]-=a[a[1]])?3:a[2];while(*++a)putchar(*a);}
17:22:42  That's the one
17:22:48  Spec for the language?
17:22:50  It's either not TC, or the interpreter doesn't interpret the language. I fail to see what I'm missing.
17:22:56  The only thing that makes it non-TC is "9<<20"
17:23:22  Phantom__Hoover: You're missing applying any reasonable, intelligent thought to the problem instead of going "lol not TC therefore sux"
17:23:34  Where did I say 'therefore sux'?
17:23:44  Please point to the line where I said that.
17:24:10   "Near"-TC?   That's what's also known as non-TC.  <-- this implies it quite loudly, what with the "haha I refuse to acknowledge the notion of being near-TC"
17:24:32  Because it's not a particularly useful concept?
17:24:41  Yes it is.
17:24:46  Because it includes things such as COMPUTERS.
17:24:57  It's a computational class which isn't TC.
17:25:01  C has more states than anyone can see in a hundred life-times
17:25:32  Well, it's a linear-bounded automaton
17:25:37  "Near-TC" is not a very good way of saying that.
17:25:46  Ngevd, I thought it was an FSM?
17:26:04  FSM is not a very useful way of saying that either.
17:26:13  Since it includes everything from "A->halt" to computers.
17:26:17  You can make an unbounded amount of arrays, you just need to define them all
17:26:18  I think
17:26:24  I've never actually used C
17:26:39  The argument is based on sizeof.
17:26:52  Oy vey
17:27:07  Not to mention that you'd still have bounded memory if you just defined loads of arrays.
17:27:32  But ultimately, C's TCness is essentially a matter of trawling through minutiae in the spec.
17:34:12  !c printf("%d", -1 || 42);
17:34:14  1
17:34:15  :(
17:34:24  I thought || passed through the actual true value.
17:36:59 -!- augur has quit (Remote host closed the connection).
17:40:55 -!- Ngevd has quit (Ping timeout: 276 seconds).
17:46:59 -!- Ngevd has joined.
17:48:11  Today's Gunnerkrigg Court is pretty funny
17:48:13  Well, either way, my tiny interpreter is about 25% of the way to a IOCCC competitor.
17:48:53  Is the spec for the interpreted language anywhere?
17:49:11  I think today may have had the most dismal afternoon I've experienced.
17:52:05  It's like the sun never even bothered to rise.
17:53:21  That's because you're in Edinburgh, and the UK has predominantly Easterly winds, and Glasgow is West of Edinburgh and I get the feeling that East and West etc. shouldn't be capitalized.
17:53:30  that sounds amazing; the sun bothered rising here and it's king of lame
17:53:43  kind of lame, I mean
17:53:50  it is probably not king of lame
17:53:51  Here it's an amazing combination of overcast and humid. There's no sun and yet I'm sweaty and it's miserable.
17:54:02  It's actually pretty nice here
17:54:06  Go Hexham!
17:56:57  :D :D :D right?
17:57:50  right D:
17:57:58  im hexjealous
17:58:33  unless by pretty nice you meant warm and blue skies; I hate that
17:58:42  Cold and blue
17:58:45  Brisk
17:58:48  Autumnal
17:58:54  Novembry
17:58:54  sounds pretty nice
17:59:16  I have to turn on the fan to get the cold but once I do it's fine
18:00:29  Ooh dinner
18:00:34 -!- Ngevd has quit (Quit: FOOD).
18:12:30   that sounds amazing; the sun bothered rising here and it's king of lame
18:12:37  Nonono, the sun *rose*.
18:13:26  It's just that by 3 o'clock or so, heavy cloud cover and school lighting conspired to make the single most depressing light level physically possible.
18:13:53  Night would have been *welcome*; instead, there was just this pervasive greyness everywhere.
18:14:08 -!- augur has joined.
18:14:35   Novembry
18:14:52  I think we've had about two days like that, which is a pity because they're my second favourite.
18:15:45  Americans did not lose their British accents. Rather, the British gained their accents in the last few hundred years, thanks in part to public (private) schools teaching children "received pronunciation."
18:16:00  Jerks, horribly disfiguring a nation's speech for no reason.
18:16:20  *English, I think you'll find, although I have an RP accent for reasons unclear to basically everyone.
18:16:41  It's especially odd since he's Flemish.
18:16:45 -!- Nisstyre has quit (Ping timeout: 240 seconds).
18:17:27  gross.
18:18:36 -!- Nisstyre has joined.
18:19:21  though I have an almost non-existent accent despite being a southern American.
18:19:35  probably similar to midwest accent.
18:19:44  but with some southern peculiarities.
18:20:17  You realise that over here you'd have an accent, right?
18:20:24  "Non-existent accent" is an artificial concept.
18:20:52  One propagated primarily by people with one of the most fringe accents in existence ...
18:21:02  i.e.?
18:21:06  Phantom__Hoover: uh, duh?
18:21:06  USA
18:21:21  I didn't mean /literally/ that I have no accent, for fucks sake
18:21:22  I meant
18:21:27  I don't have a southern accent.
18:21:28  you know
18:21:32  the region I'm from.
18:21:38  where you usually get your accents from.
18:22:06  The phonetician Jack Windsor Lewis frequently criticises the name "Received Pronunciation" on his blog: he has called it "invidious",[20] a "ridiculously archaic, parochial and question-begging term"[21] and argued that American scholars find the term "quite curious".[22] He used the term "General British" [to parallel "General American"] in his 1970s publications of A Concise Pronouncing Dictionary of American and Briti
18:22:12  yeah! what would the Americans think!
18:22:19  they think it's silly!
18:22:35  I'm from the west coast, and yet my accent is practically identical to those from Indiana! AMAZING
18:22:55  Gregor: yes clearly we both have fucking super powers.
18:23:00  there can be no other way
18:23:05  to describe this amazing mutation.
18:23:48  CakeProphet: Also I went to a foreign country once and I could understand them, just like they were speaking the same language. It's like I have a natural born ability to speak and understand Canadian without even knowing it.
18:24:02  woah dude.
18:24:19  see when I hear English people talk it just sounds like a bunch of jerks.
18:24:32  can't understand anything, I'm too distracted by the douchebaggery.
18:24:54  CHIM-CHIMINEE-CHIM-CHIMINEE-THIS-IS-'OW-OLL-BRITONS-TOKK
18:26:17  Really, nobody's going to smack me for that?
18:26:27  no it's completely accurate.
18:26:45  I really wish I actually had a Scottish accent.
18:26:54  Scottish accent sounds nice.
18:26:55  Like, a rhotic one.
18:26:58  Irish too.
18:27:37 * CakeProphet would like to visit Scotland and Ireland, but thinks England is for JERKS.
18:27:46  How 'bout Wales?
18:27:57  I have no opinion of things on ISLANDS, sheesh
18:28:06  how trivial.
18:28:10  ................
18:28:12  to be surrounded by water.
18:28:16  I...
18:28:17  .................................
18:28:18  CakeProphet
18:28:19  do you
18:28:20  X_X
18:28:21  even know
18:28:25  know what?
18:28:26  how the UK is shaped
18:28:34  yeah it's shaped like a sake of potatos.
18:28:36  *sack
18:28:40  yesyesyes
18:28:40  but
18:28:42  do you know
18:28:45  where the countries are
18:28:52  Clearly not.
18:28:56  or like
18:28:59  a venus fly trap
18:29:51  I would make some snarky comment about foreigners' understanding of the location of US states, but I'm not sure if any failure could top the Isle of Wales.
18:30:16  dude Wales is totally an island
18:30:20  learn2geography nubs
18:31:24  Gregor, um, most of the people I know could roughly place most states, and definitely state which one is composed of islands.
18:31:40  Phantom__Hoover: Hence why it couldn't top the Isle of Wales.
18:32:09  but seriously Wales seems like a cool place to visit.
18:32:10  It still doesn't beat Sgeo's astonishing failure to know where Scotland is.
18:32:27  Like, he thought that it was "near the UK".
18:33:04  apparently when I type things they magically become Serious today.
18:33:41  as opposed to
18:33:43  any other day.
18:35:23  @tell elliott Seen on confirmation form for computerons: "Product Desc. e-Scan Anti-Virus ES-AV-1". ???
18:35:23  Consider it noted.
18:37:15  http://en.wikipedia.org/wiki/File:BenNevis2005.jpg
18:37:23  highest point on the British Isles eh?
18:38:11  Yup, that one's on the Island of Blackpool.
18:38:42  http://en.wikipedia.org/wiki/File:Denali_Mt_McKinley.jpg
18:38:45  oooooh what now bitches?
18:39:18  http://en.wikipedia.org/wiki/File:Everest_kalapatthar_crop.jpg
18:39:21  Bitch please.
18:40:21  Gregor: this is US vs. UK don't bring Nepal into this shit.
18:40:29  :P
18:40:55  http://en.wikipedia.org/wiki/File:Olympus_Mons_alt.jpg
18:41:49  http://en.wikipedia.org/wiki/File:Census-2000-Data-Top-US-Ancestries-by-County-1396x955.png
18:41:52  hey look
18:42:00  in my county they don't even try to classify my ancestery
18:42:06  they're just lik "uh..... American"
18:42:45  Gregor: earth nipple.
18:42:57  Our highest point is 1324 metres; apparently we lose even to UK, if only by 20 metres.
18:43:24 -!- ais523 has joined.
18:43:41  lol @ Puerto Rico: Puerto Rican
18:44:09  fizzie: yeaaaaah sucka. whatchu gonna do about all these landmass we got up in this shit?
18:44:13  Also: Germans are EEEEEEVERYWHERE
18:44:48  actually wait I may be "other"
18:44:51  whatever the fuck that is.
18:45:11   highest point on the British Isles eh?
18:45:24  Don't knock it, we had way less space for cliffs.
18:46:28  Phantom__Hoover: maybe you should have conquered bigger islands, asshole.
18:46:45  yay, my IOCCC entry now works in clang
18:46:54  I wonder if I can get it to work with optimization turned on?
18:47:09  Also, Britain has the longest coastline in the world; it's actually many times the circumference of the Earth.
18:47:15  (ba-dum tish)
18:47:22  nope ;)
18:47:50  ais523: What's yours do?
18:47:56  Gregor, given that coastlines are actually-fractal (as opposed to popscience-fractal) that's not terribly meaningful.
18:48:02  ais523: I'm thinking about converting my tiny interpreter into something, but need more amusement in it.
18:48:08  Phantom__Hoover: BA-DUM MOTHERFUCKING TISH
18:48:15  And there's no _way_ Norway has a shorter coastline.
18:49:00  Gregor: it counts votes for the single transferable vote
18:49:09  hopefully, I won't have to get it working in each compiler in existence separately
18:49:16  X-D
18:50:28  ais523: My usual tact is to get it working on platforms that are completely distinct in three axes: Compiler, OS and architecture. I find that doing my native dev on x86_64+gcc+GNU/Linux then porting to i86+openwatcom+DOS and ARM+gcc+GNU/Linux satisfies these needs and usually makes portable code. Not sure it's a good strategy for IOCCC though.
18:52:02  Gregor: well, I'm trying to do something massively nonportable and make it portable anyway
18:52:09  Hyuk
18:52:18  breaking the C standard in preference to not breaking it
18:52:59  while trying to avoid compiler warnings even on the highest warning settings
18:53:02  noooooo not the /standard/
18:53:31  gcc still gives three warnings, but I can't tell why
18:56:30  Deewiant: wow, Intel want people to fill in a bunch of information to get the noncommercial version of icc
18:56:44  ais523: Hence direct links
18:56:49  right, indeed
18:56:53  but then how would I know what the license was?
18:57:01  I presume it's included inside the tarball
18:57:49  ais523: Come ooooooooooon, you know you want to try openwatcom.
18:57:55  It's just like being in the 1990's again~
18:57:55 * ais523 wonders why Intel renamed "Intel C++ Compiler" to "Intel C++ Composer"
18:58:05  Gregor: heh
18:58:10  I have DJGPP
18:58:16  Oh come on.
18:58:21  DJGPP is just GCC over a shitty OS.
18:58:22  and even Borland C++ 4 for Windows 3.1, although not on this computer
18:58:27  That's better.
18:58:27  right, indeed
18:58:42 -!- pkzip has joined.
18:58:46  OpenWatcom has the advantage that you can run it on modern Linux, but target ancient DOS.
18:59:06  how does this tarball come to half a gigabyte?
18:59:11  lol
18:59:13  Because Intel.
19:00:25 -!- pkzip has quit (Remote host closed the connection).
19:01:48  Argh, I still need to visit Maplins for cables and stuff and I've left it too late today.
19:02:06  I guess I can wait till the parts arrive and then actually know what cables I need?
19:04:08  ais523: I assume uncompressed?
19:04:21  no, that's the tarball itself
19:04:28  I haven't downloaded it full yet, so haven't tried to decompress it
19:04:42  0_0
19:05:21  ais523: Oh, also, note that that was the i386 version, there's a separate one for x86-64
19:05:33  ais523: Give us a nice `du -bx * | sort -n | curl -F 'sprunge=<-' http://sprunge.us` when it's extracted kthx?
19:05:42  Deewiant: i386 is correct, luckily
19:06:08  Gregor: what about tar tf?
19:06:15  that'd save actually having to extract it
19:06:27  ais523: Does that show directory summaries? I figured you were going to extract it anyway ...
19:06:44  I don't want to have to extract the whole thing, if I can help it
19:06:50  Ah :P
19:09:02 * Gregor stares at his nearly-empty 3TB hard disk.
19:09:09  Truly a thing of beauty.
19:10:04  quick! backups! then porn! then random torrents!
19:10:19  then intel c++ composers!
19:10:25  seriously, "composer"?
19:10:48  ais523: u dont respect art dude.
19:11:06  ais523: TI's C compiler for for their DSP chips is called "Code Composer Studio".
19:11:15  weird
19:11:23  this is as bad as the series/season thing on TV
19:11:42  also, my system has caught serial process crashing issues again
19:11:54  On the third hand, Metrowerks CodeWarrior.
19:12:02  where Firefox froze, then my terminal froze
19:12:36  oh, and now they're all back to normal
19:12:41  I don't think I have ever used any of the CodeWarrior tools, but I'm pretty sure they have a "Battle" menu in the IDE where others have a "Build" menu. (Okay, not really.)
19:14:21  There's also Sun Studio (now Oracle Solaris Studio; formerly this and that); the "Studio" term seems popular too.
19:14:58  Gregor: the file was so big I failed to download it
19:15:13  Firefox eventually decided it had finished around halfway through
19:15:19  and the resulting file didn't decompress
19:21:19  Ha
19:22:17  Hmmm, maybe I can make a simple JIT for IOCCC. I assume that's been done?
19:23:40  1996 august Subset of C compiler and byte code interpreter
19:23:44  Gregor: If that counts?
19:23:56  Doesn't sound like a JIT to me.
19:24:31  what would it JIT? Java bytecode?
19:24:43  >jqvzuxbfiwpkoahmclnyrgdtes
19:24:43  To be determined. Definitely not Java :P
19:24:50  ==17720== ERROR SUMMARY: 1099046944 errors from 15 contexts (suppressed: 12 from 7)
19:24:59  /beautiful/
19:25:12  lol @ suppressed
19:25:17  of course, I should have expected s to win
19:25:29  Okay, it's just an interpreter; so no JIT, apparently
19:25:44  Deewiant: Hence "Doesn't sound like a JIT to me."
19:25:57  Gregor: It could've been a JIT based on that description
19:26:05  I checked the full .hint file: it's not
19:26:17  Deewiant: And yet, it "[didn't] sound like a JIT to me." X-P
19:26:33  Gregor: Sheesh, I just confirmed it :-P
19:26:37  ^^
19:27:29  Anyway, I suspect I could make a (very!) simple JIT.
19:27:36  (And "so no JIT, apparently" referred to all submissions thus far, in case that wasn't clear.)
19:27:50  (s/submission/winner/)
19:28:28  Gregor: well, it has to be obfuscated, as well as being golfed
19:28:34  ais523: Natch.
19:31:02  "and excluding any ; { or } immediately followed by whitespace or end of file" does this mean that I save myself a byte by adding a space after every ;???
19:31:35  Gregor: yes
19:31:44  that trick's been known for years
19:31:53  as has writing lookup tables as "{ ; } ; ; { { }" etc
19:31:59  lol
19:31:59 -!- Zuu has joined.
19:32:27  use both spaces and tabs for added effect
19:32:29  (You can tell I haven't investigated IOCCC too much :P )
19:32:37  (I don't think C lets you put vertical whitespace inside strings)
19:37:32  Any opinions on the best counter for these rules?
19:37:38  There must be an IOCCC one :)
19:37:54 -!- CakeProphet has quit (Ping timeout: 240 seconds).
19:40:25  there's a counter linked from their website, or always used to be
19:42:18  Hm, can't find it ...
19:46:45  >jqvzuxbfiwpkoahmclnyrgdtes
19:46:52  ==27192== ERROR SUMMARY: 1099046944 errors from 15 contexts (suppressed: 12 from 7)
19:46:52 -!- myndzi has quit (Ping timeout: 258 seconds).
19:46:55  that's with clang
19:47:22  it's fun to see the single-transferable-vote ordering of letters in words (where words are considered more inclined to vote for letters towards the end)
19:49:57  what's with the valgrind?
19:51:24  I wanted to see what its reaction would be
19:51:31  also, I get a segfault without it, with large input
19:51:46 -!- Patashu has joined.
19:51:56  I think it's to do with extending the stack
19:52:06  $ cat /usr/share/dict/words | egrep '^[abcdefghijklmnopqrstuvwxyz]+$' - | valgrind --error-limit=no --main-stacksize=1500000000 ./a.out
19:52:22  ah
19:52:27  the default main-stacksize is too low
19:58:40  elliott, oi, ping.
20:04:08 -!- Ngevd has joined.
20:14:19 -!- Ngevd has quit (Ping timeout: 276 seconds).
20:16:53  Urrrrgh, I know I can make a portable golf JIT >_<
20:16:57  But it's tuff :P
20:19:35  The real tricky part is jumping ...
20:25:07 -!- tiffany has joined.
20:26:49 -!- oerjan has joined.
20:27:21  hi
20:28:00   @hoogle State s a -> StateT s m a
20:28:26  once the state function is made into a method as planned, state . runState should work
20:28:34  oh hm
20:28:42  runState doesn't actually exist
20:28:47  :t runState
20:28:48  forall s a. State s a -> s -> (a, s)
20:29:02  erm, it does.  it's just not a field anymore, i guess.
20:29:26  ...elliott idle for six hours?
20:29:39  something must be wrong
20:31:45   "skalman" will be a host on some university network, I suspect.
20:32:05  swedish comic/cartoon character.
20:34:31 -!- Ngevd has joined.
20:34:42 -!- GreaseMonkey has joined.
20:36:58  I made a code that does that, yesterday, to make  State s a -> StateT s m a  but find what helped better for you in case
20:37:05  Hello!
20:37:25  help my mouse pointer's gone crazy
20:37:29  (this touchscreen doesn't like getting wet)
20:37:32  *touchpa
20:37:36  **touchpad
20:38:27  so it's busy teleporting the mouse pointer around a bunch
20:38:58  Will Wheaton plays Minecraft!?
20:41:03  Ngevd: knowing that he is a redditor, i'd say that was inevitable.
20:41:34  How long till Sheldon off the Big Bang Theory is playing it?
20:43:32  Ngevd: *Wil
20:44:09  I have a tendency to double consonants at the end of three-letter shortened forms of people's names
20:45:27  Think -1 will semi-portably be acceptable for all protection modes for mmap?
20:46:51  Django's database half looks pretty nice.  It's, like, you can treat tables as objects!  And you can interact with them!
20:47:01  (Database interaction is exactly half of Django, right?)
20:47:58 -!- Vorpal has quit (Ping timeout: 252 seconds).
20:56:14  it's what Dja is abbreviating
20:56:40  "Djatabase"?
20:57:53  Hey, this is funny.  The server Django running on is called Remy.  It turns out those are both characters from Ratatouille.
20:58:15  I am now 88% confident that I can make a semi-portable JIT for a language that's fundamentally usable within all the requirements.
20:58:24  tswett: Database JnterAction, duh
20:58:29  Ah.
20:58:37  And as everyone knows, J is just another way of writing I.
20:58:46  yeah
20:58:46  That's why they're next to each other in the alphabet.
20:59:08  VERVM EST
21:03:19  Hmm, is there a valid CPP equivalent of #define O O--
21:03:27  That is, decrement the value of a #define? I don't think so...
21:03:54  nope
21:03:59  Piffle.
21:04:08  I'll have to find another convoluted way to do this then :P
21:04:37  Is there a way to make the CPP only process lines that start with ##?
21:04:59  Because maybe you can use two CPP passes, so that the first pass determines what happens in the second pass.
21:05:12  Naw, that ain't my style even if it did work.
21:05:30  Why are you in #esoteric if that's not your style?
21:05:40  Come to think of it, have you ever even created an esolang?
21:05:42  I think you are...
21:05:55  ...give me a minute, let me try to think up a good, accusatory word for someone who doesn't belong...
21:06:10  an... unbelonger!
21:06:19  AN UNBELONGER
21:10:38  ooh, quark and martok appear as humans in this back-in-time parallel-fantasy-universe episode
21:11:35  Yes, that is elliott's favourite.
21:11:40  Also you forgot the racism.
21:11:41 * olsner 's riveting retelling of DS9 in one-line episode summaries continues
21:11:51 * tswett ponders how easy it would be to share a semaphore over TCP.
21:11:53  Pretty easy.
21:12:12  olsner, BtW, no satisfactory answer is ever given as to WTF was going on in that episode; HTH.
21:12:46  What's going on is a rather severe blow to the head :P
21:12:53  Phantom__Hoover: it must be a ... temporary anomaly
21:13:14  Gregor, maybe?
21:13:40  I'm trying to figure out a way of, for all values from (say) 0 to 1024, defining a function oX(...) { f[X](); } for that X.
21:13:46  They have to be separate functions for JIT reasons.
21:14:28  olsner, also dude, you missed the shockingest of all: Odo without makeup.
21:14:39  It is amazing because he doesn't look like Odo at all.
21:14:58  What about Worf without forehead and voice modification? I think it's the only in-universe time he appears human.
21:15:13  FSVO 'in-universe'.
21:15:18  Phantom__Hoover: nah... quark, martok and gul dukat were much more shockingest so far
21:15:20  In-show then ;P
21:15:31  odo was just a bit more boring :)
21:15:35  Wait, Martok was in it?????
21:15:46  Weyoun was, but Martok?
21:17:20  yes, in the first scene in the office martok was showing sketches (of DS9, among other things)
21:19:20  Gregor: uhm, does X have to be numbers?
21:19:41  lifthrasiir: Well, f[X] is accessing an array, so yes.
21:20:46  Phantom__Hoover: Weyoun? you mean Commander Shran :)
21:20:55  how about this?: #define O(x) o##x(...) { f[*#x-'a'](); } \n O(a)O(b)O(c)O(d)
21:20:56  No, I mean Brunt.
21:21:24  what, he's Brunt *too*?
21:22:04  lifthrasiir: O(a)O(b) blows out all my bytes (i.e. is too big), I was trying to find a way to do crazy CPP loops for it ...
21:22:32  Gregor: no, you need just five levels of such macros.
21:22:36  (for 1024 values)
21:22:38  Ohhhhhhhhhhhhhhhhhhhhhhh
21:22:41  Clever...
21:22:43  olsner, he's a lot of people.
21:22:51  Amazingly, they only appeared in the same episode once.
21:23:09 -!- Taneb has joined.
21:23:10  ... hmmm, it could work ...
21:23:14 * Gregor thinks.
21:23:27  Gregor: should the pointers to o... things be stored in some array?
21:23:27  I'd just need to name them aaaaa aaaab aaaba aaabb etc
21:23:31  Gregor: What are you doing, just use chaospp
21:23:31  elliott: You have 1 new message. '/msg lambdabot @messages' to read it.
21:23:35  then that could be another story
21:23:41  oh, he's played *nine* different characters, that's about 7 more than I've noticed yet
21:23:46  lifthrasiir: Naw, you've given me another idea.
21:23:54  elliott: IOCCC
21:26:56 -!- Ngevd has quit (Ping timeout: 258 seconds).
21:31:55 -!- Taneb has quit (Ping timeout: 258 seconds).
21:34:25  Gregor: More like OGC!!!!!!
21:34:31 -!- Ngevd has joined.
21:34:32  Is this how the function to load DVI file should be?    withDVI :: FilePath -> s -> (s -> Page -> IO (s, t)) -> IO [t];    You can make different idea if you have other idea please. Maybe this is not best way; I don't know for sure
21:37:16  ais523: did you have any more sg thoughts?
21:37:17  zzo38: perhaps -> IO (Maybe (s, t))  so you have a way to halt?
21:37:19  :p
21:37:28  :t unfoldM
21:37:29  Not in scope: `unfoldM'
21:37:35  hm
21:38:04  elliott: no
21:38:36  oerjan: O, yes, OK; it can have a way to halt.
21:38:45  ais523: I think my other sgthought still makes sense, although it depends on sg itself making sense, so hopefully merge changes can be fixed :P
21:38:58  withDVI :: FilePath -> s -> (s -> Page -> IO (Maybe (s, t))) -> IO [t];
21:39:10  I'm currently happy with your current plan, because it seems, at worse, equivalent to the old plan
21:39:11  *at worst
21:39:22  ais523: hmm, I have a move plan?
21:39:28  or do you mean the conflict resolution plan
21:39:34  conflict resolution
21:39:57  right
21:40:05  I'm pretty sure that a move patch should be "move a..b from between c,d to between e,f"; the problem is I'm not sure what it should leave as the hashes afterwards
21:40:29  come to think of it, does it work just to leave the hashes of every line the same?
21:40:43  the really simple stupid solution
21:40:54  zzo38: hm oh or is it implicitly halting when it's running out of Pages, i didn't realize that at first.  in which case doesn't this look like a kind of iteratee?
21:40:55  I can't think of an obvious counterexample; quick, find one to prove I'm not mad
21:41:21  ais523: umm, that's the one I showed broken
21:41:28  ais523: it breaks tsorting, remmber?
21:41:29  remember?
21:41:40  does it?
21:42:01  ais523: yes; changeset {move (a,b) between (c,d), insert "hi" between (c,a)}
21:42:09  ais523: second change needs to be applied after the first but has no dependency on it
21:42:11  tsorting fails, Q.E.D.
21:42:30  elliott: oh, the dependency isn't explained in the hash names, I see
21:42:42  ais523: yep, which is one of sg's major strengths
21:42:48  the dependency's still there in "that's the only thing that could put c next to a", but the problem is that that isn't explicit at all
21:42:49  the order to apply a changeset in is trivially determined
21:42:54  which I agree is a valid problem
21:43:04  yep
21:43:35  ais523: we could /probably/ hack it up by just shifting the ordering around a bunch when move changes are involved, but I refuse to implement that
21:43:45  ooh, are you working on spacegoat again?
21:43:46  yes, we want a nonhackish version
21:43:51  olsner: yep
21:43:56  olsner: deliberate typo?
21:43:58  the only mars-capable version controls ystem
21:44:00  `quote spacegoat
21:44:02  655)  Spacegoat is the network-operations-optimized-for-latency-of-minutes-or-hours-due-to-light-speed-limits variant of scapegoat, to be used when you need to check out some code from the Mars colony.   (I'm pretty sure we'll have established a Mars colony by the time scapegoat rolls out.)
21:44:17  ais523: yes, better name :)
21:44:45  Finally, the Haddock documentation for Data.Monoid.Plus now works.
21:45:16  zzo38: iirc hackage building broke for a while recently
21:45:58  elliott: O, well it seem to work now. That might be why mine and other not mine packages were not working before
21:46:10  ais523: I can tell you about the last sgthought if you're interested, although it's not so much part of sg itself as much as taking advantage of its strengths
21:46:23  tell me anyway
21:48:12  ais523: basically, it's an idea for a patch management system based on top of sg to solve a lot of workflow problems I have with existing VCSes, with some ideas taken from the quilt patch management system originally by Andrew Morton for Linux stuff
21:48:21  (I suppose git was basically Linus' own version of that to start with, actually)
21:48:39  quilt's confusing; it somehow manages to not be a VCS despite acting like one
21:48:45  what VCS features is it missing?
21:48:45  heh
21:48:57  I'm not sure exactly, I've never /used/ it, only read about it >:)
21:49:07  I know hg has its own version of quilt integrated as an extension
21:49:11  I wouldn't say git is particularly friendly for the patch-based workflow, though. Simply because it doesn't have the idea of a "patch".
21:49:48  ais523: anyway, here's the basic idea:
21:49:50  I need to avoid TVTropes
21:50:31  Ngevd, just use my method, i.e. the fact that it's crap these days.
21:50:52  good method
21:50:54  after a few minutes I tend to open less than one page on average from each TV Troeps page nowadays
21:51:00  so the problem resolves itself
21:51:04  *TV Tropes
21:51:20 -!- variable has quit (Quit: I found a 1 /dev/zero).
21:52:08  How do you make Haddock include instances defined in this program of classes defined in the other library?
21:52:33  Ngevd, I mean c'mon, they renamed *The Wesley*.
21:52:39  That's proper shark-jumping, that is.
21:56:18  That is a very good plan
21:56:36  Now I just need to abandon here, IWC, and MSPA
21:56:52  but here is good
21:56:57  except when it isn't
21:57:02  And all the free time will be mine!
21:57:03  You didn't auto-abandon IWC when it stopped?
21:57:22  Phantom__Hoover: It didn't stop.
21:57:42  It stopped updating, and it's not like the new annotations are big time-sinks.
21:58:00  Yeah, but I'm a regular on the forums
22:00:42  ais523: It manages a set of patches (named with short-names, like-this) without them being committed (my current implementation idea has it nesting another scapegoat repository inside +scapegoat that it managse automatically; from the point of view of the repo itself, you're just fiddling around with your working tree). You create these patches mainly by doing the equivalent of "darcs record": you select a bunch of hunks, give them a short-name, a
22:00:43  nd the sg change is added to the set under that name (without doing anything to your working tree). The power comes from "joins": (or should it be "joint", or ...) they're named like some-patch/another-patch, or patch-one/patch-two/patch-three (the ordering is irrelevant), including the slashes. What they do is provide /compatibility/: say you have a patch that rewrites the source code to use a new naming scheme for types (rename-types), and anoth
22:00:43  er code that adds some features (including new types; new-feature). You would create a patch rename-types/new-feature, which would be a combination of both, renaming the types in the new feature appropriately, and replacing references to the old types. But instead of storing the whole diff from current head to rename-types/new-feature, it would just store the diff from /both rename-types and new-future/. basically, it'd look like: changeset {renam
22:00:48  e-types, new-feature modulo {...}, ...}. but the power here is that the reference to rename-types and new-feature isn't to a specific hash, it's to their /names/, so whenever you update their patches, rename-types/new-feature gets the changes. (of course, you still have to keep it updated :)) now, the interesting thing is that you can "shadow" patches from your working tree: you can say, I don't want rename-types any more. rename-types/new-feature
22:00:53   will automatically get shadowed too, obviously, and you could work some more on other patches (including new-feature), re-enamble rename-types, and it'd automatically enable rename-types/new-feature. (it'll probably fail to apply after changes
22:00:57  to new-feature, but that's okay, because you can amend rename-types/new-feature to fix it.) there might be another patch, new-callbacks, that changes the callback mechanism used in the program. you might have new-callbacks/new-feature to make new-callbacks shorter using code from new-feature, and to make other parts of new-feature use the new callback mechanism. if you have rename-types, new-feature, and new-callbacks enabled, then rename-types/ne
22:01:02  w-feature _and_ new-callbacks/new-feature will be enabled. it's possible that these will conflict due to changing the same part of code, which means you make -- you guessed it -- rename-types/new-callbacks/new-feature. you can also commit a set of patches as a repository commit; it'll remember which named patches made up that commit. so this basically eliminates the problem of doing a bunch of work at the same time, and having to untangle it slowl
22:01:05  hi
22:01:07  y every time you want to tell the VCS about some of it.
22:01:09  wow, that was /long/
22:01:22  yes
22:02:21  ais523: and, of course, when you pull from elsewhere, you can merge it with each patch separately, rather than having to do a merge with your complete working tree and then splitting it back up into the parts that are relevant for each patch.
22:02:34  Who wants to do an esolang collaboration taking the form of a Piet-like language utilizing the entire web-safe colour range?
22:02:36  is this a bit like having separate branches, but much more lightweight?
22:02:50  ais523: yep, because the merging is a first-class object
22:02:53 -!- variable has joined.
22:02:53 -!- variable has quit (Changing host).
22:02:53 -!- variable has joined.
22:02:55  and done automatically
22:02:58  (DS9) aah, there it comes: It's REEEEEEAL
22:03:07  I'm more of a Voyager fan
22:03:12  just waiting for that episode where it's FAAAAKE
22:03:13  ais523: and you don't have to decide wh-
22:03:15  Ngevd: ............
22:03:18  In that I've watched a bit of an episode once
22:03:23  ais523: -ich branches you want up-front, before making changes
22:03:35  elliott, what am I being dotted at for?
22:03:52  Ngevd: Voyager is an impressively bad piece of television.
22:04:28  Hey, I enjoyed the Thor film.
22:04:28  ais523: and you can treat e.g. a branch as a named patch, so that you can have compatibility patches with another branch; you could then commit some changes to the main branch, and merge it in to a branch you have compatibility patches for automatically
22:04:30  For its plot.
22:04:49  naming patches is going to be useful anyway
22:05:00  ais523: oh, this isn't a regular naming mechanism
22:05:01  that would just be tags
22:05:10  this has to be separate from the sg repo, because it's insanely mutable
22:05:14  which is the opposite of what history is meant to be
22:05:25  no, tags would be naming changesets; or even (immutable)repos, I guess
22:05:27  in fact, it's based upon the idea of mutating one thing causing everything else to mutate :)
22:05:33  ais523: changesets are just types of changse
22:05:35  changes
22:05:38  which are the same thing as patches
22:05:41  well, OK
22:05:58  but what I mean is, that they go all the way back to infinity, rather than being relative to something else
22:05:58  Ngevd, watch DS9, I watched it and it was the best waste of...
22:06:09  > 45 * 26 * 7 / 60
22:06:09  well, okay
22:06:10    136.5
22:06:20  > 45 * 26 * 7 / (60 * 24)
22:06:22    5.6875
22:06:26  ais523: but yeah, you've seen me fumble about by doing crazy git workflows like "stash, pull pieces out, modify, commit, restash"
22:06:33  Ngevd, it was the best waste of 6 days I ever had.
22:06:41  you pretty much have to do that in git
22:06:45  ais523: that isn't specifically a git problem, no VCS is good at separating independent strands of work right now, you have to declare them up-front
22:06:58  right
22:07:09  as usual, darcs is better than its rivals without being perfect
22:07:16  the idea with this is that you can start with a bunch of modifications, split them out in a really light-weight manner, and then have a coherent /interface/ to managing them
22:07:30  it also makes working trees less fragile, because they'll be recorded in the patchset data
22:07:45  so you don't have to worry about copying your working tree elsewhere before doing a merge or whatever (!)
22:07:51  (yes, I have to do that in git occasionally)
22:08:01  (stashes sort of help, but they're just a thin veneer around cp :))
22:08:36  hmm, TV characters musing about their whole existance just being imagination
22:09:35  ... if only they knew, they *are* just some script writer's imagination
22:09:53 -!- Taneb has joined.
22:10:08  elliott: we're working on a project in svn at the moment at work; I'm using git-svn, but some of the other people are sorting out conflicts by backing up their own copy, choosing resolve-other, then merging them together separately
22:11:13  ais523: heh
22:11:18  that's a viable merge strategy in CVS too
22:11:27  the worrying part is, /it is actually sane in context/
22:11:41  or just an update-from-server strategy if your local changes are nontrivial
22:12:03  ais523: hmm, maybe sg should have foo/bar branches itself
22:12:22  ais523: branches that automatically pull from foo and bar, so you can resolve conflicts in them and the like
22:12:31  elliott: I'd treat that as a repo definition
22:12:34  it seems like a useful concept even outside of this patch management thing
22:12:35  in terms of other repos
22:12:46  complex merges in CVS can be done by a CVS transplant: produce the correct source tree in a copy, move all the files except the CVS metadata into a target working copy checked out on the right branch, commit :)
22:12:47  I agree it's a useful concept, but I think it can be done with existing concepts
22:12:58  ais523: yes, but (a) you need to insert your own fix changes, (b) a platonic sg tool would be slow and unusably general :P
22:13:06  I'm not saying we don't have concepts for it
22:13:09  ... sometimes that's the *convenient* way of doing it
22:13:10  I just mean, maybe we should expose them
22:13:30 -!- Ngevd has quit (Ping timeout: 240 seconds).
22:14:31 -!- Taneb has quit (Ping timeout: 256 seconds).
22:16:58  Yay, IOCCC!
22:17:07  lifthrasiir: Your craaaazy solution definitely will work >: )
22:17:16  :p
22:17:17  pikhq_: I'm making a semi-portable JIT for the world's worst language :)
22:17:24  Gregor: :)
22:17:33  C++?
22:17:36  well i'm also thinking of possible IOCCC submissions that are doomed to be rejected...
22:17:44  i was*
22:18:40  lifthrasiir: I'm just hoping that I can squeak by within their portability requirements >_>
22:19:02  woah, what does limit the portability of your submission?
22:19:14  Gregor: They seem to just barely permit things that are nonportable *by necessity*.
22:19:44  pikhq_: My portability restrictions should be rather silly things, not "is x86"
22:19:57  Oh. That's just fine then. :)
22:20:00  lifthrasiir: It's a JIT :P
22:20:42  pikhq_: By rather silly right now I mean, for instance, that the C stack is as it has been for the past billion years and grows down, and (weird one) that if you say int a; int b; at the global scope it will put b after a.
22:20:45  ...but without involving any kinds of assembly or something?
22:20:50  That latter one I hope I can avoid.
22:20:53  lifthrasiir: No assembly at all.
22:21:05  so that's something like templating?
22:21:09  ais523: Here's my sg code scraps, FWIW: http://sprunge.us/NebW
22:21:13  lifthrasiir: Yeah, it'll be a template JIT.
22:21:24   pikhq_: My portability restrictions should be rather silly things, not "is x86"
22:21:28  Gregor: That OS got in *shrugs*
22:21:29 -!- augur has quit (Remote host closed the connection).
22:21:51  Also, I think that IA-64's satck grows upwards.
22:21:52  elliott: I think that ignoring all else, my JIT will be more impressive if it's more portable :P
22:21:54  SOF/EOF are going to need an argument eventually, but I guess you knew that
22:21:58  ais523: yes, indeed
22:22:02  elliott: That's too bad for all four ia64 users.
22:22:06  Gregor: i think that would be fine given enough safety measures...
22:22:13  IA64 is Xeon, isn't it?
22:22:17  Phantom__Hoover: ... no.
22:22:21  don't know how much measures needed to ensure the safety though.
22:22:22  No, Itanium.
22:22:26  Gregor: Also, there's no *strict* requirement that it be portable, it's just strongly suggested.
22:22:28  ais523: and I don't have changeset applying code yet, because I realised that tsort was broken :)
22:22:30  I've confused them frequently.
22:22:32  lifthrasiir: Safetylol.
22:22:34  pikhq_: Yes yes.
22:22:41  Phantom__Hoover: You oughtn't to :P
22:22:46  Gregor: Remember that they're rejecting things that need human intervention to compiler.
22:22:57  I'd say if it functions on essentially every system people care about, then you're good.
22:23:03  elliott: O(n^2) tsort is trivial; but I think it's possible to do better
22:23:12  ais523: no, I meant, broken because of moves
22:23:15  elliott: No problem.
22:23:24  ais523: I'm just going to use fgl's tsort, probably
22:23:25  pikhq_: if they did require that how can OTCC and x86 OS be accepted? :p
22:23:26  I'm not sure if it's n log n or n that's the best possible
22:23:27  Believe it or not I have a cohesive and sensibleish plan.
22:23:32  anyway.
22:24:03  ais523: (fgl = functional graph library)
22:24:27  hmm, does it have an algo for finding strongly connected components?
22:24:32  lifthrasiir: :)
22:24:43  ais523: it's a pretty long-lived codebase and the API isn't the most elegant thing, but it's better than the standard Data.Graph, I should think
22:24:46  (that's a sort of "stronger tsort" problem there where you possibly have cycles, and want to find those and put them in the proper place)
22:24:50  and I should think so?
22:24:55  Applications of UDFS/UDFF
22:24:55  components :: Graph gr => gr a b -> [[Node]]Source
22:24:55  noComponents :: Graph gr => gr a b -> IntSource
22:24:55  isConnected :: Graph gr => gr a b -> Bool
22:24:59  that looks relevant
22:25:04  I ended up rolling my own in the compiler, with an algo copied off Wikipedia
22:25:05  in the same module as tsort
22:25:54  oh, right, Data.Graph forces you to use Int to identify vertices
22:26:00  whereas, sg wants to use any reference type
22:26:16  (I decided to abstract the whole store system so that algorithms can be generic on the type of reference/store0
22:26:17  )
22:26:29  turns out it's easy: class Ref ref m a | ref -> m a where deref :: ref -> m a
22:26:57  e.g. instance Ref FileChangeHash StoreM FileChange where deref = lookupInStore
22:27:30  s/FileChange/(FileChange ref)/
22:27:36  apply :: (Ref ref m (FileChange ref)) => ref -> File -> m (Maybe File)
22:27:45  and recursion in FileChange is replaced by the ref argument
22:27:58  you can easily make Identity a Ref type in the Identity monad, to do it the simple recursive way
22:28:17  oh, the class should be
22:28:24  class (Eq ref, Monad m) Ref ref m a | ref -> m a where deref :: ref -> m a
22:28:25  ofc
22:28:30  err, =>
22:29:52  ais523: hmm, weboflies-related question: can you use a new filesystem namespace as a chroot?
22:30:36  elliott: if you can mount over /, then yes
22:30:40  or, hmm, probably pivot_root would be enough
22:30:50  ais523: ah, so it doesn't let you do it without root :(
22:30:52  but I've never dared call it from inside weboflies, because I'm not quite that crazy
22:30:56  (or a bunch of capabilities)
22:30:58  right, you need root
22:31:05  oh my god, wait
22:31:12  UMLBox would work :D
22:38:13  Gregor: I guess I should try and get Transactional HackEgo running???
22:38:21  IT'S SO SCARY.
22:40:44  ais523: incidentally, I wonder if applying all patches in sequence to checkout might not be reasonably quick, if applying a single patch is fast enough
22:40:54  I'm really bad at estimating the real-time algorithms will take to run, though
22:41:45  I'd guess it'd be impractically slow for common operations, but OK for something that was only done occasionally
22:41:54  "who cares, it's just constant factors" -- elliott
22:41:57  ais523: I meant on clone
22:42:12  for a clone, I'd say it'd be fine
22:42:47  ais523: hmm, if we always have a checkout of the tip stored in +scapegoat, then checking out a branch could just apply /inverse/ patches to the base of that branch, and then apply the branch's patches
22:42:56  we really need to figure out the inversion algorithm...
22:43:02  I suppose it's relatively simple
22:43:02 * Phantom__Hoover → sleep
22:43:03 -!- Phantom__Hoover has quit (Quit: Leaving).
22:43:16  but hashes make it more difficult
22:43:29  elliott: hmm, worrying thought: don't deletion changes have the same trouble as move changes
22:43:32  because the inverse of (delete blah) has to be blah itself, not something identical to blah
22:43:36  because of dependencies
22:43:41  although... that doesn't matter when applying patches, so hmm
22:43:45  we'd have "delete b between a and c" and "insert d between a and c"
22:43:51  with no obvious dependence of the second on the first, although there iso ne
22:43:58  ais523: delete changes are just "delete a"
22:44:07  well, OK, still no obvious dependence
22:44:09  even less, in that case
22:44:18  hmm...
22:44:21  as the two patches don't even mention a common patch
22:44:23  that is problematic, yes
22:44:38  I think a) move patches should keep hashes the same, and b) the same solution should be used for moves and deletes, that we haven't yet decided on
22:44:50  ais523: I sort of feel like saying "I guess we have to dump tsort then", but it's a really good property
22:44:56  and it's completely unobvious how to order changesets without it
22:45:15  I definitely don't want to make changesets ordered, that's awful and I think probably breaks tons of obvious properties
22:45:27  right, indeed
22:45:42  a partial order exists, but we don't know what it is, is the problem
22:46:13  elliott: test case I feel will be important: ab, acb, ab, adb
22:46:24  ais523: your "before/after reference" idea is sort of compelling, but I think leads to pathologies
22:46:26  (where letters represent lines, and that represents the history of the file)
22:46:32  but... I don't know, I might be wrong
22:46:38  ais523: OK, what about it?
22:46:54  the last change is "add d between a and b"
22:47:06  and that would apply to the first copy of ab
22:47:19  as well as the second (the third entry in the history)
22:47:41  hmm, what if deletions and moves both renamed the patches they were deleted between / moved between?
22:47:52  ais523: the question is how to rename them
22:47:55  you need a hash
22:48:01  but a move is just one change
22:48:03  I assume we have no shortage of hashes
22:48:07  but a move is just one change
22:48:09  you can have more than one hash related to one change trivially
22:48:13  no, you can't
22:48:15  just use a salt
22:48:22  because that breaks the current model
22:48:30  at least do it formally with your before/after hash thing
22:48:33  yep
22:48:36  rather than just hacking it in with ridiculous things like that
22:48:41  even that isn't a "hash"
22:48:48  it's just changing some references to include a hash /and/ a bool
22:50:00 -!- pikhq_ has quit (Read error: Operation timed out).
22:50:18  yep; I mean hash /and/ other identifier that goes with it, in general
22:50:25  which might be a bool, or might more reasonably be an enum element
22:50:33 -!- pikhq has joined.
22:50:36  that way, we can have a file, and a file-sof, and a file-eof
22:50:45  um, no, type error
22:50:58  file-sof would be a dir change, if references include a bool like that
22:51:09  err, no? file-sof is a different type from file
22:51:25  no type error in "the sof of a file change is a patch anchor"
22:51:34  any more than there is in "the head of an int list is an int"
22:51:48  well, how is this relevant to this? it does not affect the range model at all.
22:51:50  you still need
22:52:06  startpoint = sof  | line  {before|after}
22:52:13  right, indeed
22:52:25  I don't think we're disagreeing there
22:52:54  well, okay
22:53:38  hmm, the original plan didn't involve tsorting, I think; it was that given "add b between a and c", "delete b", "add d between a and c", it'd apply the patches in that order as it's the only one that lead to no conflicts
22:53:42  but that does break the tsort property
22:54:07  ais523: the only way to figure out that ordering is brute-forcing
22:54:14  ooh, I don't think so
22:54:20  I'm starting to see a shadow of an algorithm in my head
22:54:21  also, it's ambiguous, since there can be multiple possible ways to apply a change
22:54:32  well, an ambiguity would mean a conflict
22:54:39  ais523: hmm, what if a dependency on X counted as a dependency on any other change that referenced X?
22:55:13  my idea is, that the algo for composing patches is first to tsort, then apply the patches in an arbitrary order, /but/ allow the file to not be in a sane state temporarily as we go
22:55:26  e.g. you could do "add b between a and c", "add d between a and c" in that order
22:55:33  and then "delete b between a and c" would put everything back to normal
22:56:05  sigh, I was (but shouldn't have been) expecting something less ugly
22:56:12  I think my idea's better :-P
22:56:13  if everything ended up violating the definition of a file, we'd have a conflict; /but/ we can actually show the user a sane representation of the resulting file
22:56:20  I think this is actually beautiful, rather than ugly
22:56:28  I don't
22:56:46  and it's O(n), much much better than brute force
22:56:49  you've basically said "what if we made changes non-atomic, and removed their semantics, so that they only make sense in a jumble"
22:57:28  no, we're extending the semantics to work even with conflicts
22:57:37  and what do you mean with "non-atomic"?
22:57:44  I mean non-atomic
22:57:48  you can't apply each change as a separate, coherent step
22:57:56  because you have to keep track of the ~nonsensosity~
22:57:58  yes you can; in fact, you can now do so in any order
22:58:01  which makes things even better
22:58:16  it's not atomic, because changes don't become transformations from files to files
22:58:17  oh, I think by "atomic" you mean "leading to a consistent state at any point in history"
22:58:19  they're from files to goop
22:58:24  elliott: they're from goop to goop
22:58:24  ais523: that's what atomic /means/
22:58:33  and the goop itself is useful
22:58:33  you're /breaking compositionality/
22:58:37  no I'm not
22:58:43  they're from /goop/ to /goop/, how is that not compositional?
22:59:10  because you apply a changeset from file to file, not goop to goop
22:59:18  well, "goop" here means "file or conflicted file"
22:59:26  which means you don't need to special-case conflicts. AT ALL.
22:59:28  this is amazing
22:59:35 * elliott sigh
22:59:46  let me know when you have an algorithm rather than an idea that amounts to "just make it not consistent"
23:00:07  perhaps I'll have to implement it to show you how great it is
23:00:27  that won't be necessary. a simple algorithm description will be
23:00:44  so far you haven't even defined what the goop is
23:01:03  it's a directed graph
23:01:23  with lines as vertices, and edges meaning "adjacent to" (with the direction meaning the direction)
23:02:04  if each vertex but the first and last has one input and one output (and the first and last have one output/one input respectively), it represents a non-conflicted file; otherwise, a conflicted file
23:02:18  ok, that sounds a little better. how do you apply a move as goop -> goop?
23:02:48  disconnect three edges, connect another three edges
23:03:16  actually, my current issue with this is "what if the edges aren't there to disconnect"
23:03:25  my guess is that that means you're missing dependencies
23:03:43  this works for additions, but not deletions
23:04:02  oh, you have a count for how many times each edge is there, and let it go negative
23:04:09  that way, you can represent "deletion of something that isn't there"
23:04:20  err, hmm, maybe this doesn't work
23:04:54  this deserves thought from me; but I need to be capable of thinking at the time
23:05:18   oh, you have a count for how many times each edge is there, and let it go negative
23:05:25  can't you just use a multigraph or something, that's ugly
23:05:50  elliott: the issue is that you have a file abc, and get two copies of "delete b"
23:05:59  that's a conflict no matter what; how do you represent it in the resulting goop?
23:06:39  in other words, this solves the tsort issue, but /doesn't/ solve deletions, which are the reason the tsort issue's there in the first place
23:06:45  so it's, umm, kind-of pointless?
23:06:51  ais523: don't? is there any way for that to happen in a non-conflicting whole changeset?
23:07:03  elliott: no
23:07:14  why not just fail, then?
23:07:25  because you want to be able to show the user what's conflicting, when there's a conflict
23:07:46  also, because calculating the rest of everything, which doesn't conflict, becomes no longer O(n)
23:08:23  ais523: I don't mind if conflicts just give a failure result; the program on top can figure out how to present it
23:09:10  elliott: the original idea is that you resolved conflicts by making a change that just made them unconflict again
23:09:30 * elliott is not sure that's a good idea
23:09:45  right; your x-modulo-y is a replacement for that
23:09:53  ais523: here's an argument against goop:
23:09:57  $ sg pull a
23:09:58  $ sg pull b
23:10:01  has different semantics from
23:10:01  has different semantics from
23:10:03  $ sg pull ab
23:10:16  by "ab", you mean a and b?
23:10:18  because there's a goop barrier between sg commands, obviously, to turn them into actual files
23:10:22  ais523: changeset {a,b}
23:10:24  you get the idea
23:10:26  it has exactly the same semantics
23:10:33  no, it doesn't
23:10:47  the resulting goop ends up exactly the same
23:10:50  ais523: because if it did, you could apply /every/ changeset that way
23:10:59  which would make changes consistent at each stage
23:10:59  yes, that's the entire point behind goop
23:11:01  contradiction qed
23:11:03  qedqedqed
23:11:09  changes are consistent at each stage
23:11:16  just in the goop, which might or might not represent a file
23:11:27  and goop is converted from and to files on each actual operation
23:11:30  if it doesn't, then presumably you put a conflicted version in the disk file, and let the user edit it to fix it
23:11:33  therefore pull ab =/= pull a; pull b
23:11:56  you're basically saying "we need to apply changesets by threading some intermediate state" while /also/ saying "applying changesets is just applying changes in an order"
23:11:57  err, no? assume for the time being that the working copy is clean
23:12:01  that's impossibl
23:12:01  e
23:12:17  then the result of a pull doesn't depend on the working copy at all
23:12:24  so after pull a; pull b (or else pull b; pull a)
23:12:28  (or else pull ab)
23:12:36  the working copy is calculated from the same set of information each time
23:12:58  with the same deterministic algo
23:13:01  ais523: oh, you want to operate on goops at all points? that means you have to cache them
23:13:01  so how could it not be the same?
23:13:05  which is ridiculous
23:13:10  yep, operate on goops at all point
23:13:23  you don't, semantically, have to cache them, although you probably would for efficiency reasons
23:13:49 * elliott doesn't think this will work
23:14:45  deletes definitely need a between with this method
23:14:55  In Super Smash Brothers Melee, my brother could write his entire name even though it was limited to 4 letters. In Brawl, the limit is raised to 5 letters however his name will no longer fit.
23:18:09  Oh my god, the official plural of "Prius" is "Prii".
23:18:11  oerjan: weep with me.
23:19:45  is this for real
23:19:49  Yes.
23:19:57  http://blogs.cars.com/kickingtires/2011/02/plural-of-prius-prii-not-according-to-latin-experts.html
23:19:59  "Before we could make up our minds, Toyota decided today that the plural form is “Prii” (pronounced PREE-eye). That decision was the result of a marketing campaign in which Toyota asked the public about the plural possibilities: “Prius,” “Priuses,” “Prii,” “Priem,” or “Pri.”
23:19:59  “Prii” received 25%. “Prius” came in a close second with 24%."
23:20:11  they should have gone with "pru"
23:22:43  pru is good
23:23:09  they should have declared "prius" the plural and went with "priu" for the singular
23:23:32  new toyota peru
23:25:05  all new toyota peru
23:25:21  the all new toyota peru
23:25:29  plural pru
23:25:50  best car
23:26:51  elliott: I call bullshit.
23:26:52  :)
23:27:41  *Clearly* the car is the プリウス, and thus the plural is also プリウス.
23:28:06  (puriusu, puriusu; hůriusu, hůriusu)
23:29:40  pru
23:30:09  But seriously though, plurals can't/shouldn't be dictated by corporate fiate.
23:30:10  lessee, prius is neuter form of prior iirc
23:30:20  And "Prii" is particularly stupid.
23:30:20  so plural would be priora
23:32:29  pus, plural: poo
23:32:36  new from toyota.........
23:32:46  hey oerjan n-cursor zipper
23:33:22  AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
23:33:27  a
23:34:11  oerjan: no helpp...... i ned hepl
23:34:14  even if its like
23:34:15  just for a list
23:34:17  that would be fnie........
23:34:27  hm for a list
23:34:43  elliott: Dude, what about a zipper where, like, everything is a hole. And there's, like, no actu data, man.
23:35:08  shachaf: Whoa.
23:35:53  oh there's a small sense in which a list may be _harder_ than quadtrees: you don't have the holes at all the same level
23:35:59  oerjan: hmm, just like a one-hole list zipper is before + element + after, maybe a two-hole one is before1 + element1 + after1before2 + element2 + after2
23:36:09  wait no
23:36:12  then you can't have 2 after 1
23:36:13  erm
23:36:15  before 1
23:36:52  oerjan: I'll probably go straight to a k-d tree or something; the quadtree example is interesting only insofar as it has a similar tree structure compared to a list
23:37:25 -!- aloril has quit (Ping timeout: 260 seconds).
23:37:52  well the thing is i had a sort of conceptual idea of what an n-hole quadtree zipper should look like, even though immensely complicated, and that method simply does not work for a list...
23:38:26  because it depended on the type-balanced levels
23:38:30  oerjan: would a bitree be easier? :p
23:39:27  hm this actually reminds me of some of the "solid set" stuff from some of my papers
23:40:24  mmm bitrees sound super elegant
23:40:31  has anyone done those
23:40:41  what's a bitree
23:41:02  It's like a btree with an i.
23:41:09  oerjan: well you know quadtrees and octtrees
23:41:12  it's like that but only two!
23:41:17  do you mean like quadtrees, except for a 1d space
23:41:19  i guess it's uh
23:41:21  just a binary tree
23:41:23  oerjan: yeah :P
23:41:24 -!- Ngevd has joined.
23:41:57  hm you might be able to use that for a list zipper
23:42:19  if quadtrees sound simpler to do then quadtrees it is
23:42:25  in such a way that you keep all elements at the same level
23:42:26  but I don't see why it wouldn't generalise to ~bitrees~
23:42:38  yes, that's what i'm thinking about
23:43:07  oerjan: i mean i don't actually have any lists to do this to.
23:43:11  i was just trying to pick a simple structure
23:43:29  elliott: How about Bool? Make a zipper for Bool.
23:43:30  however, i expect no matter how you slice this, it will be immensely inefficient compared to a mutable structure
23:43:43  shachaf: (Bool,())
23:44:01  oerjan: well... that sads me
23:44:02  simply because of all the maintenance to keep all the holes straight
23:44:21  oerjan: I suppose the basic problem is that "multiple zippers changing the same structure" is basically only useful to implement mutability
23:44:24  which is what I'm doing
23:44:25 -!- copumpkin has quit (Quit: Computer has gone to sleep.).
23:44:32  yeah
23:44:59  http://a2.sphotos.ak.fbcdn.net/hphotos-ak-ash4/384346_10150936833620716_537230715_21844300_367012712_n.jpg
23:45:05  oerjan: but ehh, the shiro 1 design was, fungespace was a big single hashmap, and IPs just modified that round-robin style
23:45:34  oerjan: the zipper thing is useful because I can divide up space into smaller regions to make IP-local access etc. fast... it feels really weird that I'd make funge concurrency /slower/ by doing that
23:47:30  oerjan: and ofc making it mutable will /not/ be good for one of my main goals for shiro 2, which is to move as much possible /out/ of my awful StateT HugeStateRecord IO monad
23:47:34  :(
23:47:48  mhm
23:48:36  feels like I'm making a trade-off between the code getting uglier and having no chance beating CCBI2 :P
23:48:54  well, to imagine how a cursor with n holes would work
23:49:28  first, you needed some kind of map to tell which holes go to the same thing on the next higher level
23:49:29  Does there exist a combinator N such that Nx is true when x is a church numeral and false otherwise?
23:49:38  Ngevd: I think Oleg did that
23:49:48 -!- ais523 has quit (Remote host closed the connection).
23:49:51  Ngevd: doubtful that it could always be false otherwise
23:49:56  Ngevd: well, there's http://okmij.org/ftp/Computation/lambda-calc.html#bluff
23:49:58 -!- aloril has joined.
23:50:31  "The gist of the problem is discriminating a Church numeral from some other term."
23:50:59  but it doesn't distinguish it from /every/ other term
23:51:12  oerjan: hmm
23:51:20  oerjan: it feels like you shouldn't have to have duplication + a map
23:51:26  I know that's not helpful though :P
23:52:36  what duplication
23:52:51   first, you needed some kind of map to tell which holes go to the same thing on the next higher level
23:52:55  the duplication of holes, in some sense
23:52:56  dunno
23:53:39  i'm thinking of the case where you have some holes that are neighbors, so they are in the same level-1 quadtree
23:54:02  so they must share their cursor for going up to level 2
23:54:26  right
23:54:32 -!- Aune has left ("Lmnar").
23:55:01  oerjan: are you sure bitrees aren't simpler >:)
23:55:04  bitrees are the new psox
23:55:06  we may assume that no holes are in the exact same spot except at the very first level
23:55:23  ...i have no idea how to apply bitrees to a 2d space
23:55:51  but with what i imagine, they have the exact same issues
23:56:13  oh hm
23:56:44  oerjan: who needs a 2d space :P
23:56:59  Did anyone here watch El Nombre?
23:57:00  ...i thought this was something 2d you were implementing
23:57:01  i'm not really planning to use quadtrees much /anyway/, i'm just trying to get a really simple n-cursor zipper to think about
23:57:03  oerjan: it is
23:57:17  ok then.
23:57:18  oerjan: i'm just thinking that it might be easier to formulate an n-cursor zipper on a simpler structure first...
23:57:30  feel free to continue with quadtrees if you disagree :P
23:57:52  Ngevd: how the fuck do i remember that
23:57:54  it doesn't matter much for my idea whether you look at quadtrees or bitrees.
23:58:27  elliott, because El Nombre is awesome
23:58:29  oerjan: ok
23:59:06  it's about how to think of a multi-cursor at level n in terms of a multi-cursor at level n+1

2011-11-15:

00:00:29  for each hole at the n level, you must know what hole it is at the n+1 level
00:00:34  right.
00:01:21  hm this actually gives a correspondence with some arbitrary choice in the numbering of the n+1 level holes
00:03:08  perhaps one should choose some consistent ordering of the holes, like by x then y coordinate
00:03:14  er wait no
00:03:55  ordering by infinite path
00:04:29  ah, if so this is one detail which needs to be more careful with quadtrees than bitrees
00:04:46  you can easily order holes in bitrees by linear position
00:05:16  hm
00:05:16  but for quadtrees you cannot use just x then y if you want to keep things in the same region together.
00:05:20  oerjan: hilbert curve?
00:05:30  One computer game I made, near the end someone gives you a bunch of stuff (ammunition, health points, torches, money, multimeter, etc) and tells you that you need it to complete the game, and then leaves (through a passage which is locked if you try to follow him). Actually, none of that stuff will help you in the least bit. It will doom you if you are not careful!
00:05:30  well sort of
00:05:31  or, wait, z-order curve?
00:05:37  "The resulting ordering can equivalently be described as the order one would get from a depth-first traversal of a quadtree; because of its close connection with quadtrees, the Z-ordering can be used to efficiently construct quadtrees and related higher dimensional data structures."
00:06:04  elliott: just think of the position as an infinite list of NW, NE, SW, SE tags
00:06:14  right
00:06:33  oerjan: oh hm i remember seeing this in oleg's thing...
00:06:41  We define a `higher-order' zipper:
00:06:41  > data ZipperD m term dir = ZD{ zd_z:: Zipper m term dir,
00:06:41  > zd_path :: [dir] }
00:06:41  and order them by that (with the list going infinitely leftwards)
00:06:42    : parse error on input `}'
00:06:42    : parse error on input `data'
00:06:49  oerjan: and then the 2-hole zipper is defined as a pair of those
00:06:52  where the paths are kept in sync or something
00:07:02  (don't worry, nothing else oleg said was useful :))
00:07:09  whew
00:07:24  (well, it might be, but it's based on his continuation stuff and
00:07:26  > data Zipper m term dir =
00:07:27  >     Zipper dir term ((Maybe term, dir) -> CCW m (Zipper m term dir))
00:07:27  >   | ZipDone term
00:07:27  > type CCM m term dir a = CC (PS (Zipper m term dir)) m a
00:07:27  > type CCW m w = CC (PS w) m w
00:07:27  Wow, Assassin's Creed Revelations comes out TODAY
00:07:28    : parse error on input `data'
00:07:28    : parse error on input `type'
00:07:28    : parse error on input `|'
00:07:28    Not in scope: data constructor `Zipper'Not in scope: `dir'Not in scope: `te...
00:07:28    : parse error on input `type'
00:07:30  is not very comprehensible to me)
00:07:33  argh lambdabot
00:07:51  oerjan: ok, so i'm with you, I think
00:08:18  elliott: z-order sounds like what i'm thinking of, yes
00:08:35  have to say, z-order is one of the ugliest curves, visually :P
00:09:08  with z-order all holes that are in the same subregion will be consecutive in the order
00:09:17  (subquadtree)
00:09:37  right
00:10:05  so then you can think of this as a grouping operation
00:10:18 -!- copumpkin has joined.
00:11:15  oerjan: i'm still not sure what this actually looks like, though :P
00:11:30  well let's say we have holes 1,2,3,4,5 by order
00:12:22  and 1 is in its own region, 2 and 3 are the NW and SW of the next upper region, and 4 and 5 are the NW and SE
00:12:36  Make a computer game, in one level, there is an invisible bomb that kills you so much that you have to restart the entire game.
00:13:22  oerjan: ok
00:13:37  then the embedding can be given as a 3-element list, each element telling the size of its group, how the elements are embedded, and what are the quadtrees of the non-hole siblings
00:14:15  1 would have 3 siblings,  2 and 3 would have 2, as would 4 and 5.
00:14:26  ok
00:14:53  and a cursor would be itself a list of such embedding lists
00:15:42  the descriptors for the embedding would be hairy though
00:15:46  ok :P
00:16:05  oerjan: the essential performance problem is, if we have two cursors really far away from each other, then a modification in one causes massive changes in the other, right?
00:16:16  well for 1 it would be fairly similar to our old single-hole stuff
00:16:20  because the path to the other cursor has to be rewritten, so to speak?
00:16:40  erm
00:16:57  i'm guessing this isn't all the correct terminology
00:17:05  sorry :P
00:17:22 -!- Taneb has joined.
00:17:24  i used "multicursor" above
00:17:37  I was just thinking, ignore me :)
00:17:42  it never goes well
00:18:38  Gregor, how goes the IOCCC?
00:19:21  oerjan: but ok, I'm still following
00:19:50  Taneb: Haven't looked at it since my last message.
00:20:29 -!- Ngevd has quit (Ping timeout: 252 seconds).
00:20:32 -!- augur has joined.
00:20:42  trying to make this more concrete so let me write 3 levels of positions for all the holes.  1: nwnwnw, 2: nwnenw, 3: nwnesw, 4: nwsenw, 5: nwsese
00:22:02  this being level 0, at level 1 the holes would be nwnw, nwne, nwse
00:22:18 -!- augur has quit (Remote host closed the connection).
00:22:29  (just cut off the last path element)
00:22:45  right
00:23:20  so if we make some hideous constructors...
00:24:05  Taneb: But be not concerned: It will be amazing.
00:24:15  Although I'd still like to find a good counter.
00:26:50  Also, I'm tallying the points for Whose Line is it Anyway.
00:26:50  [[FromNW {neSibling = ..., swSibling = ..., seSibling = ...}, FromNWNE { swSibling = ..., seSibling = ... }, FromNWSE { neSibling = ..., swSibling = ... }], [fromNWNESE { swSibling = ... }], [fromNW { ... }], ... {- only single hole contexts from here on -} ]
00:26:51  BECAUSE
00:27:05  oerjan: you switched to lowercase :)
00:27:10  elliott: that would be a possible multicursor format
00:27:13  oh, hmm
00:27:17  oops
00:27:19  oerjan: is fromNWNESE meant to be a function?
00:27:26  oerjan: afaict you want an infinite number of constructors
00:27:28  Gregor, it was an interpreter right?
00:27:30  s/from/From/g
00:27:47  Taneb: It's a JIT now.
00:27:56  A portable(ish) JIT.
00:27:57  elliott: no they're finite, there are only 15 possibilities
00:28:01  oerjan: ah.
00:28:12  oerjan: why 15, exactly? seems weird...
00:28:20  Gregor, any specs for the language?
00:28:31  because you cannot have more than 4 holes merging at the same level, and 0 holes doesn't need a constructor
00:28:35  ah
00:28:36  Taneb: Not 'til it's implemented :P
00:28:43  Okay
00:28:50  I anticipate with glee
00:29:04  Taneb: It will look VAGUELY similar to BF with labels.
00:29:04  oerjan: will you hate me if i ask how to modify the element at one of the cursors? :P
00:29:12  (with the other cursors being able to navigate there and see the new element, ofc)
00:29:14  Taneb: (And jumps to label instead of loops)
00:29:17  all the sibling things would be QuadTree t's, of course
00:30:25  Gregor, you mean, like Bub?
00:31:13  Taneb: Vaguely, and its existence serves the same purpose, but it will be more limited (the language will NOT be TC)
00:31:14  elliott: well modifying the element value is simple enough, since that's part of the MultiContext outside the multicursor
00:31:33  oerjan: well, ok, going east then :P
00:31:57 -!- hagb4rd has quit (Ping timeout: 240 seconds).
00:32:02  I know not enough C to write a non-obfuscated program
00:32:09  hm if most of the time I won't modify the value in the context, it seems like you could make moving faster if you can skip propagating the changes... but it's probably not a good idea to think about _that_ right now
00:32:48  elliott: there will have to be an additional first identifying level in case there are holes at the exact same level 0 position
00:33:27  right
00:33:28  that one won't be restricted to merging just 4, but on the other hand there is nearly no other data than their number to track
00:34:20  oerjan: this is quite impressively complicated :P
00:34:32  so the first step to going east would be to find your cursor/hole in that list, and checking if there are other holes in the same position.
00:34:55  well yeah i expected it to be, didn't i :P
00:36:12  hm in fact the question of whether there are other holes left is going to appear at all levels, i think
00:36:35  oerjan: watch as this algorithm turns out to be strictly more work than not keeping any zippers and just re-traversing the tree for every operation :P
00:36:37 -!- CakeProphet has joined.
00:36:37 -!- CakeProphet has quit (Changing host).
00:36:37 -!- CakeProphet has joined.
00:36:39  i mean, computationally
00:36:52  elliott: quite possibly :P
00:38:22  ouch
00:38:52  oerjan: ?
00:38:53  and going east can obviously change the order of holes
00:39:20  there needs to be an initial map from holes to holes-in-order :P
00:39:30  oerjan: looool
00:39:44  oerjan: maybe we should ask oleg :P
00:39:53  probably easier :P
00:40:25  From something else I found Akinator again, this time I tried entering answers according to my Dungeons&Dragons character. Well, I play in unusual ways so it could not figure it out, until the menu came up where you can select if any of them are the correct answer; I found two correct answers on that menu and selected both.
00:41:25 -!- augur has joined.
00:42:26 -!- augur has quit (Remote host closed the connection).
00:42:43  when leaving a region, you only convert that region to a downward quadtree if there were no other cursors there
00:44:09  oerjan: ...you know, I think my non-zipperised circular version is easier to get working than this :P
00:44:19  you don't say :P
00:44:22 -!- derdon has quit (Read error: Connection reset by peer).
00:44:25  oerjan: it /could/ work with tying the knot, right?
00:44:36  er
00:45:14  i don't think circular immutable structures are compatible with easy modification
00:45:33  oerjan: indeed, I meant non-easy :P
00:46:01  you have to traverse everything to change it to point to the new version
00:46:10  oerjan: yes, but you only pay that cost when you force those thunks
00:46:21  hm
00:46:38  oerjan: and since modification is quite significantly rarer than access...
00:46:56  and other IPs modifying is basically just the same, except you're twiddling the pointers of a far-away thing, not where you are now
00:46:57  so to speak
00:47:21  but forcing those thunks may still be linear in the number of modifications _anywhere else_
00:47:41  might even stack overflow, that way
00:47:57  hmm
00:48:09  oerjan: but forcing each individual location is /easy/
00:48:22  it's just rewriting N/S/W/E to point at new thunks, mostly
00:48:55  hm
00:49:11  As of 1x09, the points leader is Wayne Brady with 2,001,130.5 points and the episode-average leader is also Wayne Brady, with an average of 285,875.8 points per episode. The log-points leader is (wouldja believe it) again Wayne Brady, with 43 ln-points, and the episode-average log-points leader is Laura Hall with 6.9 in the one episode where she gained points.
00:49:27  oerjan: it won't make modifications fast at all, but lookups and moving is /very/ fast
00:49:39  Gregor: ...lol
00:49:40  ok
00:49:53  oerjan: if you really think it won't work at all just tell me btw, I don't want to waste my time :P
00:50:35  elliott: I decided to add log points because 1,000,000 points really isn't 1,000 times 1,000 points :P
00:50:56  i fear that it will essentially require traversing all versions of everything you haven't looked at yet when you force something
00:52:07  in fact, hm, it may be equivalent in total work to just using array copying
00:52:21  if my worst suspicions are true
00:53:52  oerjan: total work, quite possibly (although note that the array data /itself/ will only change in _one_ node)
00:54:05  oerjan: but if it's spread over the cost of moving across locations...
00:54:52  i'm not sure it will be spread out, really
00:55:28  it may be that once you look at an unknown cell, you do all the work remaining
00:55:35  for all cells
00:55:47  oerjan: um... you realise that there is not one structure per cell, right?
00:55:51  each Location is 128x128 cells
00:56:05  ok
00:56:17  so whenever you look at an unknown location, then
00:57:09  hmm...
00:57:17  http://sprunge.us/OQej
00:57:21  that's basically what it'd look like
00:57:30  with some too-clever-for-me-right-now knot tying to make the whole thing work
00:57:48  i'm not sure it will work at all, but I don't see why it'd necessarily force all work just from one step...
01:00:21 -!- Taneb has quit (Ping timeout: 244 seconds).
01:00:26  hm ok maybe
01:01:16  oerjan: otoh there's no obvious way to generalise this to a structure that isn't this N/S/E/W thing :P
01:01:38  oerjan: I think I /know/ how to implement a really efficient space with mutation, so it's really tempting to just give up on persistence
01:02:11  mhm
01:15:07  Hrm
01:15:10  I'm at 510 characters.
01:15:13  Things it does not yet do: JIT.
01:15:22  Gregor: IOCCC =/= golf
01:15:34  elliott: there's a 2048 char limit iirc
01:15:35  elliott: 2048 character (with weird counting) limit.
01:16:08  Is that new?
01:16:27  New as of some time a decade ago or something ;P
01:16:38 * elliott doesn't like that.
01:16:51  Especially as you can just factor out most of your program into, like, an stdlib file if it's an implementation.
01:17:00  Did Creative Commons used to have CC-SA license but now they only have CC-BY-SA? Can they put it back on?
01:17:27  zzo38: They have both ...
01:17:38  Ohwait, maybe they changed :P
01:18:16  Nope, seems you're right.
01:18:24  SA without BY kinda makes little sense though ...
01:22:17  For what reason is that?
01:23:58 -!- tiffany has quit (Quit: nini~).
01:40:08  oerjan: btw did I mention that I need to support n-dimensional spaces, so the same code needs to handle bitrees, quadtrees, octtrees and up generically :P
01:40:50  no, you did not.
01:40:57  oerjan: I BET IT'S EASY NOW HUH
01:41:36  well i guess the principles are the same as for quadtrees.
01:41:46  for what i described above.
01:42:05  that makes it easy then :P
01:43:08  and sooooooooo efficient.
01:43:15  totally.
01:46:17 -!- SgeoN1 has joined.
01:58:02 -!- augur has joined.
02:05:03 -!- Zuu has quit (Ping timeout: 244 seconds).
02:07:08  An idea is, allow fields in a record update syntax to have the field name and = omitting the value for some fields, and it makes a function taking arguments in the order which you have specified, such as:    join (X { aaa = 6, bbb =, ccc = }) <$> [1..6]
02:07:47  And that it can be used even without constructors; it could be used also with functions or values that are of record type and you just update some fields
02:10:14  Suggested symbols for label, unconditional jump, and conditional jump?
02:11:08  Gregor: unconditional jump: / -- it's like a ramp!
02:11:27  conditional jump... umm... ≠? it's a ramp with a barrier!!!!!!!!1111111
02:13:02 -!- Zuu has joined.
02:24:11 -!- derrik has joined.
02:25:45  elliott: It is not ASCII, though; in case that matters
02:26:10  ASCII shmASCII... that's... that didn't work.
02:26:33  ascii so nasty
02:33:11  OK, my JIT segfaults on all input.
02:33:13  So not quite perfect yet.
02:33:15  But getting there.
02:34:16  very aggressive memory optimization
02:39:53  Gregor: Why, that's a *perfect* implementation of _|_!
02:40:20  pikhq: Figured out the issue, my prologue-size heuristic algorithm is heuristically wrong :P
02:45:29  http://twitter.com/#!/ioccc
02:45:34  This... this feels so wrong...
02:45:43  http://ioccc.org/index.html#new It's official.........
02:45:47  Gregor: Help im cry,
02:46:34  elliott: Heh
02:46:52  What are some Applicative which are not Monad?
02:47:08  zzo38: most people think ziplist, oerjan disagrees :)
02:47:15  Gregor: http://www.ioccc.org/1988/spinellis.hint ;; lol, this is what prompted the "no human intervention" rule
02:47:21 -!- augur has quit (Read error: Connection reset by peer).
02:47:54  hm didn't we find a clearer example last we discussed this
02:48:05  Grrf, where'd my prologue go
02:48:23  oerjan: data Applic a = Pure a | forall b. Ap (Applic (b -> a)) (Applic b)
02:48:24  I know about ZipList, but I can seem to defined join for ZipList
02:48:30  or was that just for Functor
02:48:30 -!- augur has joined.
02:48:35  Not a monad!
02:48:45  oerjan: Functor we had (,) obviously
02:49:08  zzo38: me too, although there are troubles with the monad laws and joining non-rectangular lists of lists if you are not careful
02:49:11  Define join for ZipList doesn't always defined results, the way I did it, however, but the laws they still defined results
02:49:25  oerjan: Yes, those things too
02:50:16  oerjan: aren't ZipLists meant to be always infinite?
02:50:39  no why would they?
02:50:54  oerjan: well pure makse them infinite :P
02:50:55  but of course if you do that, they're equivalent to Reader Nat
02:51:00  indeed
02:51:30  You can have   f (f a -> a)   and   (<*>) :: f (f a -> a) -> f (f a) -> f a
02:51:35 * elliott wishes you could make (idx -> a) arrays fast...
02:51:43  say if you had like
02:51:49  I also seem similarity to stream monad too
02:51:52  (idx -> a) -> (idx,a) -> (idx -> a)
02:51:56  which would "extend a pattern match"
02:52:45  > scanl1 (zipWith (flip const)) [[1,2,3,4],[5,6],[7,8,9]]
02:52:47    [[1,2,3,4],[5,6],[7,8]]
02:52:55  > scanl1 (zipWith (flip const)) [[1,2,3,4]]
02:52:56    [[1,2,3,4]]
02:53:00  Hmmmmmmm, my putchar function is subtly broken ...
02:53:00  > scanl1 (zipWith (flip const)) []
02:53:02    []
02:53:19  Also, I have (limited) JITting and I'm not even up to 2K /with/ indentation :P
02:53:31  What does "extend a pattern match" mean?
02:53:33  zzo38: i believe that applying that before taking the diagonal gives a working join
02:54:02  for all ziplists
02:54:13  zzo38: well for instance if (\x -> case x of 0 -> "a"; 1 -> "b"; 2 -> "c"; _ -> undefined) is compiled to a jump table
02:54:25  then you could overwrite the "c" case with (2,"d")
02:55:21  elliott: That is what I thought you meant by the type signature; I think you also need (Eq idx)
02:55:33  oh, right
02:55:48  it should probably just work for Int, since it's unlikely that other types would compile down to a jump table :P
02:57:49  O no, you already have the (e ->) monad and has functor, join, acting like the stream monad; and you can have contrafunctor
02:58:27  FIXT
02:58:29  I has a JIT.
02:58:29  So you can add another function usable with that, doing that, possibly called update
03:01:11  Gregor: shouldn't you have managed it like in the last hour before the IOCCC deadline, or something.
03:01:28  My JIT just said "Hello World!"
03:01:33  oerjan: Pff
03:02:24  D'aww, doesn't work with -O2 (yet!)
03:03:11  And before you say anything, gimme a break, I'm heuristically determining the size of the function pro/epilogue :P
03:03:53  *hubristically
03:03:59  Gregor: I gotta see this thing :P
03:04:05  Gregor: Does it have a GC????????
03:04:24  elliott: lolno :P
03:04:33  Gregor: MARK AND SWEEP
03:04:33  elliott: The language is similar to BF, but worse.
03:04:59  what, not malbolge?  how disappointing.
03:05:15  I hate you all.
03:07:29  OK, do you REAAAAALLY want to see it? :P
03:08:00  Gregor: Yeeeeeeeeeeeees
03:08:03  Gregor: But uh
03:08:07  Don't post it in the channel
03:08:11  Pretty sure that disqualifies you :P
03:10:05  Wha?
03:13:31  Read the rules to figure out. Maybe it can be done after the deadline; I don't know for sure
03:14:14  I see nothing about sharing, but it's a fair point.
03:14:19  Maybe it'll just have to stay a secret :P
03:14:27 * Gregor tries compiling it with owcc.
03:15:04  lol, it's taking SO LONG to compile :P
03:15:21  To be fair, this file has 2,000 functions in it ...
03:16:54  D'awwwww, doesn't work :(
03:18:59 -!- NihilistDandy has joined.
03:19:12  Wow, owcc is SO SLOW on this code X-D
03:21:25  lolwut
03:21:29  owcc makes some weird code >_>
03:21:46  This is in its function prologue: 8048110:       68 2c 00 00 00          push   $0x2c
03:21:46   8048115:       e8 1f ad 01 00          call   8062e39 <__CHK>
03:21:52  What the hell is it checking for?
03:22:20  Oh, it has stack overflow checking whether you want it or not X_X
03:24:32 -!- augur has quit (Remote host closed the connection).
03:27:04 -!- derrik has left.
03:27:44  Argh, owcc is weird ...
03:27:51  Why does the prologue float :P
03:30:28  balloons.
03:37:35 -!- elliott has quit (Remote host closed the connection).
03:59:33 -!- Darth_Cliche has joined.
04:20:32 -!- CakeProphet has quit (Ping timeout: 245 seconds).
04:22:14 -!- MDude has changed nick to MSleep.
04:32:24  Is there Haskell library that search paths in the environment variable?
04:32:28 -!- CakeProphet has joined.
04:32:28 -!- CakeProphet has quit (Changing host).
04:32:28 -!- CakeProphet has joined.
04:44:04 -!- SgeoN1 has quit (Quit: Bye).
04:49:44 -!- SgeoN1 has joined.
04:54:45 -!- pikhq has quit (Ping timeout: 240 seconds).
04:54:51 -!- pikhq has joined.
05:15:37  Magic tournaments stopped using Elo? :(
05:16:49  yes
05:17:31  Your score can't go down?
05:17:48  I call bullllllshiiiiiit.
05:18:17  This isn't a competitive scoring system, this is... Madness.
05:19:22  it actually seems reasonably sane
05:19:28  elo sucked
05:20:11  I know people who played in GPs partially for the amusement of beating a pro and costing them a hundred rating points or so
05:20:12 -!- augur has joined.
05:20:17  Replacing it with a system that rewards, not skill, but playing at all, seems, well, ridiculous.
05:21:22  Elo didn't reward skill
05:21:30  It ended up rewarding luck
05:21:38  and the new system does reward skill somewhat
05:21:45  It at least attempts to. Admittedly, it's less well-suited for Magic than for chess.
05:22:23  But making a homebrew scoring system that is heavily weighted towards merely participating?
05:22:34  It's heavily weighted towards winning matches
05:22:40  the problem is that it doesn't measure relative skill
05:22:59  Elo had the issue that pros didn't want to play with nonpros
05:23:28  since losing a single match to mana screw would cost enough rating as to be a serious issue to recover
05:23:43  And it's not like WotC couldn't try and get a system better suited for Magic; I mean, jeeze, given their audience they could probably get a few people to volunteer.
05:23:57  and they've stated that for the competitive events and qualifications, they don't want casual events to be a significant factor
05:24:22  so they're trying to scale the system such that for most places where the ratings actually matter, you're in a reasonably competitive field
05:37:13 -!- CakeProphet has quit (Ping timeout: 258 seconds).
05:56:31 -!- madbr has joined.
05:57:10  hmm, I need to find a name for my language :D
06:05:56  George.
06:06:22  I was thinking of something that stresses how it expands continuously
06:06:33  like "Fatmouse" or something
06:08:29  there isnt a language called Juidhejsbcuska yet
06:08:39  """FATMOUSE IS THE NEW SCIENCE OF MATHEMATICS. THE FATMOUSE THEOREM IS:
06:08:39  FATMOUSE + YOU = FATMOUSE
06:08:40  ""
06:10:47 -!- oerjan has quit (Quit: Good night).
06:16:50  or maybe it could be called "juffo-wup"
06:22:14 -!- NihilistDandy has quit (Quit: http://haskell.org).
06:34:01 -!- Ngevd has joined.
06:38:52  > see that
06:38:53    Not in scope: `see'Not in scope: `that'
06:38:55  > google it
06:38:56    Not in scope: `google'Not in scope: `it'
06:38:57  what the hell
06:39:00  Hello!
06:39:08  hello, ngevd
06:47:11 -!- Taneb has joined.
06:51:23 -!- Ngevd has quit (Ping timeout: 260 seconds).
06:56:21 -!- SgeoN1 has quit (Ping timeout: 240 seconds).
06:56:32 -!- Darth_Cliche has quit (Quit: You are now graced with my absence.).
06:59:34 -!- SgeoN1 has joined.
07:11:03 -!- Taneb has changed nick to Ngevd.
07:22:15  @google it
07:22:16  http://en.wikipedia.org/wiki/It_(novel)
07:22:16  Title: It (novel) - Wikipedia, the free encyclopedia
07:22:22  Very: useful.
07:23:03 -!- CakeProphet has joined.
07:23:03 -!- CakeProphet has quit (Changing host).
07:23:03 -!- CakeProphet has joined.
07:23:21  today
07:24:17  I have achieved the current fastest instantaneous velocity in my lifetime, relative to the inertial reference frame of the surface of the earth.
07:24:43  What, first time on an airplane?
07:24:47  maglev train?
07:24:57  no I've never been on a maglev or an airplane.
07:25:00  I was in my car.
07:25:33  `run ls bin
07:25:38  Careful, man. The department of revenue acquisition, I mean, the police, might catch you.
07:25:38  ​? \ @ \ addquote \ allquotes \ calc \ define \ delquote \ etymology \ forget \ fortune \ frink \ google \ json \ k \ karma \ karma+ \ karma- \ learn \ log \ logurl \ macro \ marco \ paste \ pastekarma \ pastelog \ pastelogs \ pastenquotes \ pastequotes \ pastewisdom \ ping \ prefixes \ qc \ quote \ quotes \ roll \ runperl \ toutf8 \ translate \ translatefromto \ translateto \ units \ url \ wl \ word \ wtf
07:25:55  pikhq: no it was on a basically always cop-free stretch of road.
07:25:58 * CakeProphet is careful about these things.
07:26:28  `frink 140 miles/hour -> kilometers/hour
07:26:38  704088/3125 (exactly 225.30816)
07:26:53  140 mph!!!!?
07:27:00  yes!!!!!!
07:27:09  it was wonderful
07:27:10  I'm rather confident my car can't do that.
07:27:25  I'm rather confident my car doesn't even exist
07:27:30  Though, my car is honestly a bit scary around 75, so...
07:27:52  pikhq: it took an insanely wasteful amount of gas. basically full throttle for about 30 seconds to creep slowly from 135 (the previous maximum) to 140
07:28:06  130 is the speed it can comfortably accelerate to before becoming difficult to go faster.
07:28:31  anyway, just thought I would share.
07:28:41  You and your not-completely-terrible vehicle.
07:28:41  perhaps one day I'll travel in one of these flying machines and go faster.
07:28:54  pikhq: the engine and transmission are wonderful
07:28:58  it's just... everything else that I've had to replace.
07:29:11  and body damage from THAT STUPID FUCKING DEER
07:29:39  I have been in many flying machines
07:30:47  pikhq: it's amazing the difference between a small common 4 cylinder engine (my previous car was a 2.1L I believe) and 3.0 liters of displacement in a V6
07:31:05 -!- zzo38 has quit (Quit: Not lose the game please).
07:31:17 * CakeProphet might become one of those car people.
07:31:23  just a little bit.
07:32:18  it's actually difficult to not go fast..
07:33:04  Try lifting your foot up a bit next time, that might work.
07:33:18  fizzie: well I mean from a complete stop for example.
07:33:30  if I push down too little I'm not going much of anywhere
07:33:55  and then just a tiny fraction further and I'm moving forward very quickly.
07:34:54  but anyway
07:35:55  enough about car shit. no one cares. even worse, all the scandinavians are appalled at my crass recklessness.
07:36:15  stupid Americans.
07:37:15  by "all the scandinavians" I mostly mean Vorpal if he were here. that counts right?
07:40:16  the rest are probably magical elves and not actually Scandinavians.
07:41:57  Personally I just think it's a bit weird; and also sort-of wish you would in fact get caught by the po-po; it would make for a good story in the traditional "look how clever I am, I know where the police are, I can flaunt my flaunt-flaunt and drive as fast as I want, ha-ha, they suck => COMEUPPANCE" plotline.
07:42:48  it's not so much that I believe I have smugly outwitted the law
07:42:59  it's more that I don't actually care.
07:43:07  I'm glad I live in such a place where I don't need a car
07:43:16  Ngevd: you should.
07:43:32  Should what, live in such a place, or need a car?
07:43:37  I will have shower now
07:43:41 -!- Ngevd has quit (Quit: CLEAN).
07:43:54  (Or be glad?)
07:43:57  fizzie: uh, neither? you should be glad you live in a etc etc
07:44:00  Ah.
07:44:08  I don't know, somehow I just didn't grok that.
07:44:32  "Kevin Richardson proposed the idea of rewarding drivers travelling at or below the posted limit with a cash lottery, funded by the fines on speeding drivers. This was demonstrated in Stockholm, Sweden, in November 2010.[25]"
07:44:36  Oh, those Swedes.
07:45:52  uh, how do you implement that?
07:46:04  so I can speed and just not get caught and I'm rewarded anyway.
07:46:07  ?
07:46:30  Sure. Well, if you're also lucky enough to win the lottery.
07:46:49  rewarded with the opportunity of luck, I suppose.
07:48:05  It's like those "you may already be a winner!" snailmail-spams.
07:48:28  You win the right to have a chance to win.
07:49:15  though from what I understand it's a bit easier to get caught speeding in Sweden.
07:50:29  oh, also, I realized one of the reasons for higher collission rate in the US compared to European countries could be that we have more intersections and virtually zero roundabouts.
07:50:38  I... have no data for that
07:50:42  I just considered that possibility.
07:51:08  Possibly. From what I hear, it's reasonably easy here too. They keep plonking those cameras here and there (of course there's crowdsourced maps of them for navigators and all that), and I suppose the police are reasonably random about where they stage speed-measuring sessions, though from what I understand there are still some "favourite spots" too.
07:51:29  US cops are all about favorite spots. it's stupid.
07:51:44  I've been driving the same roads for about 2-3 years now and they're always in the same spots.
07:52:24  Also Finland used to have virtually zero roundabouts, but lately (last decade or so?) they've been putting in those mini-roundabouts just about everywhere.
07:52:38  also, in Georgia specifically, local officers are /not allowed/ to stop you for speeding unless you're going 15 over.
07:52:46  however Georgia State Patrol can.
07:52:59  "A "modern roundabout" is a type of circular junction that was developed by the UK's Transport Research Laboratory[citation needed] in the mid twentieth century,[citation needed] in which road traffic must travel in one direction around a central island and priority is given to the circulating flow. Signs usually direct traffic entering the circle to slow down and give the right of way.[7]
07:52:59  These junctions are called "modern roundabouts" in order to emphasise the distinction from older circular junction types which had different design characteristics and rules of operation.[citation needed] Older designs, called "traffic circles" or "rotaries", are typically larger, operate at higher speeds, and often give priority to entering traffic.[7] In some cases, the term "traffic circle" has been used to describe roundabouts in North America. The original
07:53:00  ly British term "roundabout" is now often [7] used in North America too by officials and engineers, but it remains rare in general US usage though commonplace elsewhere.[8][9]"
07:53:03  Right, those 'modern'-style ones.
07:53:17  Lots of [citation needed] there.
07:54:00  offering priority to entering traffic sounds like a bad idea.
07:54:17  from the standpoint of reducing congestion.
07:54:19  I've only ever heard them called roundabouts
07:54:55  There's one old (and old-fashioned) "traffic circle" in Helsinki; it's big, it's got two lanes in the circle, and it has half a dozen sets of traffic lights in it.
07:55:35  It's more like a short circular road than a junction.
07:55:36  Likewise. "Traffic circle" to me only really refers to those godawful traffic-lighted things around the East coast, particularly Massachusetts.
07:55:58  was it here that the magic roundabout was brought up a while ago? that thing's amazing
07:56:22  I really, really wish roundabouts were more prevalent. Traffic lights *suck*.
07:57:20  http://en.wikipedia.org/wiki/Roundabout_Appreciation_Society good
07:58:47  fizzie: Also, RE: speeding. Flaunting the police is a bit more understandable when you realise that they don't function to increase safety here (and in many cases *reduce* it), but rather just to get cash.
07:59:18  monqy: :)
07:59:37  http://users.ics.tkk.fi/htkallas/roundabounda.jpg
08:00:34  According to fi.wikipedia, that one's Finland's first "traffic circle".
08:05:56  One thing I've sometimes wondered is whether there is any explicit law against going around and around and around( and around)* in one of those things.
08:06:47  fizzie: probably not necessary as no one woukd waste the time / fuel.
08:07:30  Guess so, and it'd be somewhat silly to make it a crime to accidentally miss your exit and go the full circle at least once.
08:09:51  Also in the category of "what?": they're having this competition in Finland, where people (six at the beginning) sit inside this mini-excavator at a shopping centre, and the one who sits in it the longest wins the excavator. At the moment the (two remaining) competitors have spent 166 days in their mini-excavators.
08:10:17  ..
08:10:20  what?
08:10:27  ... *Why*?
08:11:10  Well, it's organized by the company selling those things, I suppose they wanted some visibility.
08:11:22  http://www.kaivuriskaba.fi/index.php?page=1032&lang=2
08:11:27  how do people spend 166 days in their mini-excavators
08:12:13  do mini-excavators have toilets
08:12:25  I think they have a total of one hour per day they can be outside the excavator.
08:12:35  toilet hour
08:12:36  For bathroom breaks and so on.
08:15:16  I'm not entirely certain they expected the thing to last this long.
08:16:37  some people are ridiculously competetive
08:17:00  I'd imagine they only really expected it to last a week, tops.
08:17:25  I can't imagine sitting in the excavator more than a couple of minutes
08:17:40  I'll never win prizes
08:18:59  I could only imagine it if I gave approximately G_64 more shits than I do.
08:19:01  :P
08:25:14  Ok decided to call my language Fatmouse
08:27:38  http://esolangs.org/wiki/Fatmouse
08:28:14  Kinda like it too... my first language that's not some kind of broken functional-ish language
08:29:22  Can't be implemented until I figure out how to garbage collect it though :D
08:33:38  madbr: sir, those conditions at the end of statements
08:33:41  that's control flow.
08:34:03  shhhh :D
08:34:05  how does statement evaluation order work? nondeterministic?
08:34:18  in theory it doesn't matter
08:34:27  it shouldn't matter no.
08:34:33  unless there's side-effects.
08:34:47  nah, no side effects
08:35:13  there's i/o but it's not affected by evaluation order either
08:35:21  oh?
08:35:23  madbr: just do a reference count garbage collection. so basically if a variable is part of a condition that's +1 refcount
08:35:44  when a conditional statement is executed that's -1 refcount.
08:36:00  cake: it's not quite that simple as far as I can tell :D
08:36:02  to all the variables in the condition.
08:36:35  the problem is that a variable can be collected when it can't cause any more other statements to turn true in turn
08:37:01  I don't see how that's a problem.
08:37:01  that would be easy except for the variable arrays
08:37:59  for instance in the brainfuck example, none of the statements ever become obsolete
08:39:04  essentially it calculates the new state from the old state. the interpreter has to figure out what's part of the old state and thus unreachable and garbage collectable, and what isn't
08:39:14  but that seems to depend on variable indices
08:39:25 -!- myndzi has joined.
08:39:44 -!- myndzi has quit (Client Quit).
08:39:56 -!- myndzi has joined.
08:40:38  for instance icnt.0 becomes obsolete once the 4 lines that depend on it have run
08:40:58  okay, so what's the problem with my scheme?
08:41:10  dunno, I'll think about it
08:41:13  just treat each variable index as a unique variable to be garbage collected.
08:41:14  too tired
08:42:48  the refcount would be a compile-time thing essentially.
08:42:52  I think?
08:42:58  well, no, probably needs to be runtime I guess.
08:43:49  essentially whenever a variable (or array index) is "created" it then needs to make a count of how many times it's referenced in a conditional.
08:44:03  then when a conditional that references the variable executes, you decrement its refcount
08:44:08  when it reaches 0, you can garbage collect.
08:44:10  but that count might be infinity
08:44:15  ?
08:44:19  cake: hmm.....
08:44:29  last I checked we don't write infinite programs very often.
08:44:35  cake: actually that sounds like a good idea
08:44:39  I'll look into it
08:44:42  tomorrow :D
08:44:53  alright. :)
08:45:20  but yeah I mean a same variable can be used multiple times by a statement I think
08:46:22  anyways, night
08:46:23 -!- madbr has quit (Quit: Radiateur).
08:51:36  http://i.imgur.com/MNbN6.jpg
08:58:55 -!- monqy has quit (Quit: hello).
09:01:49 -!- Ngevd has joined.
09:01:59  I'm ill...
09:11:07 -!- copumpkin has quit (Ping timeout: 240 seconds).
09:11:34 -!- derdon has joined.
09:11:42 -!- copumpkin has joined.
09:34:09 -!- sebbu2 has changed nick to sebbu.
09:49:11 -!- ais523 has joined.
09:57:30 -!- copumpkin has quit (Ping timeout: 258 seconds).
09:57:56 -!- copumpkin has joined.
10:05:09 -!- Ngevd has quit (Ping timeout: 248 seconds).
10:37:31 -!- Patashu has quit (Quit: MSN: Patashu@hotmail.com , Gmail: Patashu0@gmail.com , AIM: Patashu0 , YIM: patashu2 , Skype: patashu0 .).
10:44:13 -!- GreaseMonkey has quit (Quit: The Other Game).
10:50:54 -!- hagb4rd has joined.
12:31:03 -!- variable has quit (Excess Flood).
12:31:43 -!- variable has joined.
12:33:49 -!- variable has quit (Excess Flood).
12:39:13 -!- variable has joined.
12:41:47 -!- Phantom_Hoover has joined.
12:42:06 -!- variable has quit (Excess Flood).
12:43:43 -!- variable has joined.
12:44:08  Hello everyone.
12:44:08  Phantom_Hoover: You have 2 new messages. '/msg lambdabot @messages' to read them.
12:49:58 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds).
12:50:22 -!- Phantom_Hoover has joined.
12:55:36 -!- variable has quit (Excess Flood).
12:56:35 -!- variable has joined.
13:13:17 -!- Ngevd has joined.
13:17:01 -!- Aune has joined.
13:28:46 -!- Ngevd has quit (Ping timeout: 240 seconds).
13:36:59 -!- Ngevd has joined.
13:44:45 -!- copumpkin has quit (Ping timeout: 252 seconds).
13:45:13 -!- copumpkin has joined.
13:46:01  Today's BBC News Technology section:
13:46:09  Facebook sucks, here's something else!
13:46:17  It's not Diaspora, is it?
13:46:22  It is.
13:46:26  heh
13:46:26  The creator's died
13:46:58  At the age of 22
13:47:12  damn.
13:47:45  No indication as to under what circumstances he died.
13:48:53  Who was that Scottish guy, Robert or Robbie or something
13:49:12  Doesn't narrow it down, does it?
13:49:50  I know at least two Robbies, although only one of them's Scottish.
13:50:00  Dead, very dead
13:50:06  Folk hero type person
13:50:39  Coltrane?
13:50:51  Probably not
13:50:55  (He's not dead.)
13:51:12  The clue is "Sir Walter Scott's hero" and my gran thinks it's a Scot called Robert
13:51:45  crossword?
13:51:53  how many letters?
13:52:13  Burns?
13:52:13  7
13:52:20  Bruce?
13:53:02  ivanhoe
13:53:29  Roy?
13:53:43  Probably Roy; he wrote a book about him.
13:53:48  Ivanhoe fits
13:53:59  Thanks, guys!
14:11:21  Argh, still another hour at least until the computer bits arrive.
14:11:39  Well, Assassin's Creed Revelations arrived this morning!
14:12:01  I guess that you have to order everything in Hexham?
14:12:29  Nah, just video games
14:12:51  What else would you need to *buy*?
14:13:06  I dunno
14:13:08  Lemonade
14:16:37  Hmm, Scotland fast-tracks you to university if neither of your parents went.
14:17:15  (Apparently that's something the rest of the UK can blame on us: the expectation that university should be the norm.)
14:21:37  What about those things you run video games on? You know, those... computaurs?
14:21:56  You can't just torrent those????
14:22:05  We've got computaur stores
14:22:57  Impressive; I don't think Hexham-sized places here do, at least any good/cheap ones.
14:23:31  He didn't say 'good' or 'cheap'.
14:23:36  We've got "The Computer Shop"
14:23:49  We used to have "The laptop shop" but that closed down
14:24:46  The Computer Shop.
14:24:49  Sounds good.
14:26:06  There's also the Violin Shop
14:26:16  But you can't by computers there
14:26:25  The Violence Shop.
14:27:10  Please please tell me that all shops in Hexham are just called The _ Shop.
14:27:16  No
14:27:20  :(
14:27:27  Just Violin, Computer, Laptop, and Sandwich
14:27:31  Do you have a "The Shop"?
14:27:37  No
14:27:40  Apparently they indeed do have two (2) computaur stores (or approximations of) also in the Hexham-sized place I was thinking of.
14:28:07  The Shop Shop, venture capitalist hub.
14:30:00  We also have a soft drinks brewery
14:31:11  The 2nd largest electronics retailer (and the oldest webstore) in Finland -- net sales of 173 million euro/year, probably the largest sort-of computaur-focused consumer-shop -- is called "verkkokauppa.com", lit. "webstore.com". It's not exactly the most imaginative name either.
14:32:33  Are all the shops in Finland called  Store.
14:32:51 -!- derrik has joined.
14:33:01  Sadly, no.
14:34:37  Even the "webstore.com" used to be called Arctecho in olden days.
14:35:03  What.
14:35:18  "For the first 19 years of his life an unemployed US teenager was known as Calvin Gosz, but after selling his naming rights to a Finnish consumer electronics retailer he is now called Verkkokauppa Com.
14:35:19        The contract says that Calvin Gosz, of Sheboygan, Wisconsin will legally change his name to Verkkokauppa Com in exchange for the asking price of USD 5,000 (ca. EUR 3,400)."
14:39:24  What's stopping him from changing it back?
14:40:17  Probably nothing, unless they've specified some time limits in the contract.
14:40:52  Maybe Verkkokauppa just likes it.
14:40:52  "He is eligible to change his name back after two months."
14:40:59  Probably goes by Verko.
14:48:19 -!- Darth_Cliche has joined.
15:01:10  Argh, JITting isn't easy X-D
15:01:14  Stupid function pro/epilogues.
15:01:22 -!- copumpkin has quit (Quit: Computer has gone to sleep.).
15:04:20  @tell elliott OMG more Gorey overs so happy
15:04:20  Consider it noted.
15:04:28  @tell elliott COVERS I MEANT COVERS
15:04:29  Consider it noted.
15:12:35 -!- augur has quit (Remote host closed the connection).
15:14:50  "Recommended videos: Fat Man Shoots A Gun (0:08) .. because you watched The Man with the Gun". Oh YouTube... (The former is Exactly What It Says on the Tin; the latter is a PPOT music video.)
15:15:03  Maybe when the Semantic Web comes we'll get relevant recommendations.
15:16:10  I can say on firm logical foundations that when the Semantic Web comes along we'll have flying pigs.
15:18:45  But the flying pigs will all be linked by their semantic properties.
15:18:47  So it's all good.
15:19:15  On a not entirely unrelated note, I think I may have thought of a brilliant way to do XSLT S and K
15:23:26  "register" is ANSI C right? (Although with no defined semantics)
15:24:43  Gregor: yes, and it does have a defined semantic (UB if you try to take a pointer to it)
15:24:59  admittedly, it's a defined semantic that's strictly more useless than auto's, but it's there
15:25:01  Ngevd, how is it this hard to copy subtrees of an XML expression.
15:25:16  Is XSLT just completely nuts?
15:25:28  NOOOO!!!
15:25:35  It doesn't work
15:25:43  And yes, XSLT is completely nuts
15:25:45  ais523: Heh, I meant no semantics of "it will actually be a register" of course :)
15:25:48  I can do one iteration just fine
15:25:52  ais523: And a parameter can be marked "register", right?
15:25:53  I can't make it recurse
15:26:04  Oh, your problem is with recursion?
15:26:05  Gregor: I think so, although I'm not completely sure
15:26:23  ISTR that XSLT left that out deliberately because they objected to TCness or something?
15:26:36  Maybe I should just compile with -ansi -pedantic
15:27:04  Oh, wait, no.
15:27:09  Ngevd, have you read http://conferences.idealliance.org/extreme/html/2004/Kepser01/EML2004Kepser01.html ?
15:27:34  No
15:27:35  full.c:31:8: warning: ISO C forbids conversion of function pointer to object pointer type [-pedantic] HAHA COMPLETELY FORGOT ABOUT THIS
15:27:42 * Gregor chooses to ignore that >_>
15:28:03  Gregor: you can use void(*)() as a generic function pointer type if you like
15:28:11  although you'll have to cast back and forth explicitly
15:28:19  It promises a coding of recursive functions, so it might be worth reading.
15:28:52  You know what would be interesting?
15:29:00  ais523: I'm doing a JIT, I explicitly need to cast between function and non-function pointers.
15:29:02  A program that when it has no input prints its source code
15:29:06  ais523: It complains even with a valid cast.
15:29:14  But when it has input interprets that input as its own language
15:29:21  Gregor: oh right
15:29:30  in general, that's completely impossible
15:29:50  (I've used archs before which had 14-bit words in the program storage and 8-bit words in the RAM-equivalent)
15:29:56  Ngevd, so an interpreter which spits out its own source when you give it an empty program?
15:30:04  I guess the only truly portable way is to go via a char array
15:30:09  A self-intpreter, Phantom_Hoover
15:30:10  that is, to avoid the warnings
15:30:19  it still won't /work/ on archs with separate code and data
15:30:20  ais523: Yeah, I know.
15:30:31  ais523: Errr, it is possible to "ignore" the warnings, I've done it.
15:30:43  ais523: Cast through an integer type, size_t.
15:30:48  ais523: (void*)(size_t)func
15:30:52  Gregor: intptr_t, you mean
15:31:14  ais523: If sizeof(size_t)!=sizeof(void*) you're usually screwed anyway :)
15:31:26  heh
15:31:31  but intptr_t exists for that purpose, why not use it?
15:31:36  Preferrably in an esoteric language
15:31:39  Fair 'nuff.
15:31:41  Computer bits have arrived.
15:31:46  ais523: It's just unfortunate for IOCCC X-D
15:31:53  But anyway, I'll focus on making the JIT /work/ first.
15:32:01  I still haven't got into Assassin's Creed
15:39:41  +
15:41:06  +
15:41:31  ^^^extract from a BF program I'm working on
15:42:11  o
15:42:30 -!- augur has joined.
15:45:30  ASSASSIN'S CREED TIEM
15:48:14 -!- copumpkin has joined.
15:51:17 -!- boily has joined.
15:57:10 -!- ais523 has quit (Read error: Operation timed out).
16:13:29  Hmm...
16:13:36  Should I get a Diaspora account?
16:13:58  It's also possible to ignore the warning by going via the reinterpret-bits route; with C99 compound-literal and designated-init you can do it inline with a simple and elegant   int func(void); ...; void *vp = (union { void *v; int (*f)(void); }){ .f = fn }.v;
16:16:17  I think the worst thing about Diaspora is that not enough people have an account
16:17:03  Ngevd, I think wait until elliott turns up, he'll probably have some strong opinions on it.
16:18:52 -!- derrik has quit (Quit: gone).
16:20:01 -!- MSleep has changed nick to MDude.
16:21:01  Gregor: POSIX C permits conversion of function pointer to object pointer.
16:21:28  i.e. that warning is bullshit.
16:21:29  pikhq: IOCCC is ANSI, not POSIX.
16:21:36  pikhq: And that warning is only with -ansi -pedantic.
16:22:04  IOCCC says "it must compile with an ANSI C compiler" and then goes on and describes how ideally you should comply with POSIX.
16:22:17  Oh
16:22:20  I misunderstooded.
16:22:26  I'm using mmap anyway X-P
16:22:29  The warning also explicitly says "ISO C forbids".
16:22:34  Even MAP_ANON, which is non-POSIX.
16:22:47  I think what they *mean* is that it should use an ANSI C compiler *as oppossed to K&R C*.
16:22:54  Fair 'nuff X-D
16:23:08 -!- Ngevd has quit (Ping timeout: 244 seconds).
16:23:14  This is going to be a challenging enough project without getting all pedantic >: )
16:23:54  I'd interpret it to mean "common UNIX compliant" if I were you. :)
16:24:22  That's what I am doing.
16:24:25  What with the mmap.
16:24:26 -!- Ngevd has joined.
16:30:26 -!- Ngevd has quit (Ping timeout: 256 seconds).
16:46:36  fungot!
16:46:36  Phantom_Hoover: i know! and yet, i still know it's true, but which cannot! the speeder do you fit the entire poopulation o, i am the master, the men and die horribly, don't you?
16:53:24  ARGH SO CLOSE WTF :(
16:54:15  ...is fungot a bot?
16:54:15  Darth_Cliche: i can think of one good thing, but laughed it off one on one and it is while balanced precariously on the back of the tavern
16:54:21  oh, ok
16:55:02  fungot is the best bot ever.
16:55:02  Phantom_Hoover: there's the internet, adam. it could just apply a jolly good. nothing has a bite that big to you, our helpful. ' is phone is still workin' class, guv.
16:55:09 -!- ais523 has joined.
16:55:17  ^sty... oh, it'll be IWC.
16:56:15  Darth_Cliche, watch this.
16:56:18  ^style fungot
16:56:18  Selected style: fungot (What I've said myself)
16:56:22  IWC? Irregular Webcomic?
16:56:30  fungot, meta!
16:56:30  Phantom_Hoover:, so i'd make stuff up to. why, this is for you guys are a lot
16:56:39  Darth_Cliche, yes.
16:56:47  It's the newest style.
16:57:07  :D I knew 'I know and yet I still know it's true' sounded familiar
16:57:26  that also explains why it mentioned a tavern
16:57:41  fungot: hi!
16:57:41  ais523: is that something you know and and
16:57:44  also, Darth_Cliche: hi!
16:57:46  `? welcome
16:57:49  Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
16:59:40  Darth_Cliche has been here for a while.
17:00:22  indeed
17:00:37  Didn't Taneb lead you to our hiding-place?
17:00:48  Taneb?
17:00:56  I don't think I know anyone by that nick
17:01:10  I think it was eliott who led me here
17:01:20  lol
17:01:59  Anybody know off-hand the gcc optimization flag to not rearrange functions? X-P
17:02:38  Seems to be -fno-reorder-functions
17:03:04  Or ... not ...
17:05:15  Works with -O1 :)
17:06:20 -!- monqy has joined.
17:07:39  Darth_Cliche, ouch, I don't want to be you when elliott arrives.
17:07:40  He hates people getting the number of ls and ts wrong.
17:14:45 -!- kmc has quit (Quit: Leaving).
17:15:04  How annoyed would the IOCCC folks be if I said it works with -O0, -O1 or -O2 -fno-align-functions -fno-optimize-sibling-calls -fno-peephole2 >_>
17:22:58  Gregor: ooh, I'll have to look at those optimisation combos for my own program
17:23:02  although, I suspect even -O1 breaks it
17:23:22  ais523: Rearranging functions breaks me quite horribly :)
17:23:34  it relies really heavily on variables always being stored in memory; marking them volatile and passing pointers to them to functions works for gcc -O0 and clang -O0
17:23:54  but I doubt it fools higher optimisation levels, and know it doesn't fool -O3
17:24:34  Yeah, I doubt those flags will help you then.
17:24:42  I rely on variables being stored in registers :P
17:26:09  Now to try on 32-bit, which I haven't done in a long while ...
17:26:18  Works :)
17:28:00  hmm, this is the first time I've ever tried to do really portable stack-smashing
17:28:13  it even allows for differences in the direction of the stack, and doesn't care where on the stack frame the variables are stored
17:28:22  and it's in a recursive function, to /force/ them to be stored on the stack
17:28:46  That may be more portable than me :P
17:28:57  But to be fair, portable JITting is completely impossible.
17:29:18  Now the real test: ARM
17:29:42  hmm… identify function prolog and epilog statistically, compile code in order to generate the instructions you need?
17:29:45 -!- SgeoN1 has quit (Remote host closed the connection).
17:29:52  Yup
17:30:36  I mean, as a suggestion on how to portably JIT
17:31:11  That's what I do :P
17:31:21  But the pro/epilogue stuff is a nasty trick.
17:31:26  Especially with optimization.
17:31:55  I keep forgetting that OWCC is the slowest compiler ever written.
17:32:47  what bytecode/language are you taking as the input to the JIT?
17:32:49  !bf_txtgen Hello, world!
17:32:53  ​127 +++++++++++[>+++++++>+++++++++>++++>+<<<<-]>-----.>++.+++++++..+++.>.------------.<++++++++.--------.+++.------.--------.>+.>-. [697]
17:32:56  ais523: Something vaguely similar to BF.
17:33:11  oh, a /very/ simple JIT
17:33:14  Yes :P
17:33:19  Gimme a break, I have 2048 characters.
17:33:33  is it still left/right/inc/dec/loop? or does it mention numbers?
17:33:49  s/loop/label and jump/
17:34:48  hmm, I'm pretty sure we have a name for BF-except-with-conditional-GOTO
17:34:56  we have a name for basically every other BF deriv, right?
17:36:30  Yeah, it's out there somewhere.
17:36:34  Mine isn't quite that either.
17:36:40  It's precisely what was most JITtable of course :P
17:42:54  Y'know what sucks about aluminium?
17:43:02  Scratches are stupidly visible on it.
18:03:57 -!- elliott has joined.
18:06:56 -!- SgeoN1 has joined.
18:09:42  hey, argument currently dominating #nethack: how is "xor" pronounced?
18:10:06  zor
18:10:06  elliott: You have 9 new messages. '/msg lambdabot @messages' to read them.
18:10:15  as in, zaw
18:10:16  elliott: hmm, you're on the other side of the argument to me, then
18:10:17  z + or
18:10:21  ais523: what do you say?
18:10:25  (to me it's "exor")
18:10:37  ais523: I hereby declare it to be pronounced with a Lojbanic x
18:10:41  (like the "ch" in "Bach")
18:11:52  Dictionary.com says it's "exor", I always
18:11:57  +say just "xor"
18:13:10  Hm
18:13:13  I pronounce it ex-or
18:13:30  On a related note, ZEEEEEEEEEEEEEEEEEEE
18:13:37  Deewiant: You can't "say just xor" :P
18:13:46  I can and I do
18:13:55  What, like ksor?
18:14:00  Yes, like that.
18:14:07  Wow, that's awkward.
18:14:21  I pronounce it like "pshaw"!
18:19:58 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds).
18:23:18  AAAAAAAAAAAAAARM >_<
18:23:29  Gregor: Zee arm?
18:23:52      ead8:       e59f200c        ldr     r2, [pc, #12]   ; eaec 
18:23:52  ...
18:23:52      eaec:       00051615        .word   0x00051615
18:24:04  Another way to read that is "Just try to JIT this, bitch!"
18:24:07  eaec
18:24:20  Deewiant: I usually pronounce it 'zor'
18:26:23  ais523: I pronounce "xor" by hitting the back of my tongue off the top of my mouth while moving air through it quickly and then "or"
18:26:28  That almost certainly has a name.
18:26:37 -!- Ngevd has joined.
18:27:14  elliott: hmm, I just pronounced that first consonsant a few times, and it sounds more like a Welsh ll than anything
18:27:18  I wonder how I could convince ARM not to put this constant in .text >_>
18:27:42  ais523: It sounds like "k" here, i.e. the whole thing sounds like "core" but much more... I dunno, thuddy :P
18:27:55  Also it's impossible to do vowels after it so I sound like a ghost or something.
18:28:03  my tongue stays low for a k
18:28:20  ais523: It isn't how I pronounce a "k", it just sounds like it :P
18:28:23 * elliott records THE PERFECT XOR.
18:28:27  btw I don't actually say it like this.
18:30:29  I pronounce xor as kssor
18:31:10  NO ONE TALKS LIKE THAT SHADDAP
18:31:23  i don't quite have a good pronunciation for xor
18:31:28  Darn, Audacity can't do my microphone.
18:31:38  sometime's it's ksor sometimes it's zor somtimes it's ex-or
18:31:52  :(
18:32:07  ais523: I pronounce "xor" by punching myself in the face and then "or"
18:32:21 -!- zzo38 has joined.
18:32:26  i pronounce xor by punching whoever wanted me to punch xor in the face
18:32:28  then or
18:32:30  er
18:32:34  not punch xor
18:32:36  pronounce xor
18:32:42  i also punch whoever gave xor its name
18:32:56  `addquote  ais523: I pronounce "xor" by punching myself in the face and then "or"
18:32:58  717)  ais523: I pronounce "xor" by punching myself in the face and then "or"
18:33:15  elliott, opinion on Diaspora
18:33:17  Go
18:33:36  OK, I'mma come back to ARM later :P
18:33:39  What platform next?
18:33:45  Oh yeah, x86 and ARM are the only platforms.
18:33:49  Wii
18:33:51  i dont know much about jews.......................................... but i hear the greg egan book is good!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
18:33:53  Gregor: PPC
18:34:00  Gregor: I for one can say /ks/ at a coda
18:34:03  elliott, you know what I meant
18:34:09  I believe it's relatively common in Greek as well
18:34:16  Ngevd: :'(
18:34:31  though always simplified to /z/ when a Greek word is loaned to English, like /ps/ > /s/
18:34:44  Wow Wikipedia, do you really want to call this appeal person an "author of 549 Wikipedia articles"? I thought you didn't do that :P
18:35:34  elliott: the WMF are running out of ideas for pleading for funding
18:35:44  also, Wikipedia's collapsing in terms of activity
18:35:48  wow, they're asking for 3 pounds a month
18:35:53  number of editors/edits/etc are all dropping
18:35:58  do they really think many people will do that?
18:35:58  ais523: heh
18:36:56  ais523: "The amazing thing about Wikipedia is that nerds like me, who love weird things like gastropods (snails), get to come together and share our passion with the world."
18:36:59  ais523: actual quote from the appeal
18:37:12  OMG!
18:37:16  meh, it's not as bad as Enigma's advertising
18:37:18 * Gregor hurls money at Wikipedia
18:38:07  ais523: hmm, I somehow can't imagine Wikipedia dying
18:38:47  I'll bet they'd get donations if they went down for one day and then came back up saying "lol sorry guys, couldn't pay the bills for that day."
18:39:07  Are you weird?
18:39:38  zzo38: Super.
18:39:59 -!- zzo38 has quit (Remote host closed the connection).
18:40:23  too weird for zzo
18:45:41  OH MY GOD AIS
18:45:50  http://esoteric.voxelperfect.net/wiki/User:Newkitten PLEASE DON'T DELTE THIS OMG ;___;
18:46:53 -!- boily has quit (Ping timeout: 252 seconds).
18:55:05  Damn it, my JIT isn't portable :(
18:55:09  :(
18:56:44  Gregor: is it potable
18:56:48  Gregor: does itw ork on ppc
18:57:35  elliott: No. Or I would have said something jubilant like "MY JIT IS SO AWESOME WOOOH"
18:57:45  Gregor: does it work with... sparc
18:57:45  Although the way it fails on PPC is a bit mysterious.
18:57:47  alpha?
18:57:48  misc?
18:57:50  mips?
18:57:56  try it on jsmips
18:58:01  lol
18:58:14  elliott: but it's spam
18:58:35  but it's gooooooood
18:58:36  you could, umm, transwiki it somewhere?
18:58:47  ais523: I'll move it to my userspace and remove the links???
18:58:52  Gregor: i wasn't joking :P
18:58:55  elliott: that'll do
18:59:01  then I'll delete the redirect
18:59:28  actually, I suspect it might be copyvio, checking now
18:59:40  mm remembering My name is Johny, what the F**K, or whatever it was
18:59:45  good names for good wiki pages
18:59:47  nope, not copyvio, I think it's a markovbot
18:59:54  http://esoteric.voxelperfect.net/wiki/User:Ehird/Newkitten tada
18:59:57  monqy: elliott still needs to invent that language
19:00:09  ais523: i'm working on it!
19:00:43  somehow I pronounce the ** as vv in my head
19:00:45  fvvk
19:00:49  I suspect the latest batch of spambots have a page they want to advertise, and the way they do it is by looking for a search that people are using to reach that page (maybe an unlikely one), then doing that search themself and markoving the results
19:01:37  i still like the spambots that replaced large chunks of page with compliments
19:01:51  http://catsandkittenstraining.com/Introducing-a-New-Kitten.html
19:01:53  i would like one as a pet if i could train it
19:01:54  that stretched cat face is terrifying
19:02:00  ahahah
19:02:01  elliott: you actually visited a spam link?
19:02:05  don't, that justifies the spambots' existence
19:02:06  ais523: absolutely!!
19:02:12  think about it, even one person visiting the link is a win for them
19:02:18  :(
19:02:24  but... even a dog can learn these cat training techniques
19:02:25  Cat Training Made Easy
19:02:25  Even a dog can learn these cat training techniques
19:02:26  yes
19:02:33  you're promoting the spamming of Esolang by visiting spam links
19:02:49 -!- ais523 has set topic: The IOCCC is back on! http://www.ioccc.org | Even a dog can learn these cat training techniques | http://codu.org/logs/_esoteric/.
19:02:54  ais523: I don't think it's possible to unpromote spam
19:03:12  I'm not sure they'd stop even if they got 0 visitors from every single wiki they spam
19:04:05      * 19:03, 15 November 2011 Ais523 (Talk | contribs | block) deleted "User:Newkitten" (redirect left behind after userfication of spam)
19:04:16  http://features.peta.org/mario-kills-tanooki/
19:04:21  elliott: they're just trying to bump up their Google rankings for searches
19:04:35  ais523: then visiting it should be irrelevant, no?
19:04:41  ais523: also, don't we use nofollow?
19:04:44  we do
19:04:55  elliott: but visiting the link directly is like bumping up the rankings, just more direct
19:05:07  hmm
19:05:12  why would spammers want high Google rankings, if not for pageviews?
19:05:24  oh, peta
19:06:00  LOLLLLLLLLLL
19:06:40  oh my god "super tofu boy"
19:06:50  how is that real
19:06:57  super tofu boy is brilliant
19:07:09  i love it
19:07:39  As of now, I'm finally convinced that PETA is a troll
19:07:52  Does Super Meat Boy have anything to do with meat other than the player being made of meat?
19:07:57  TIP: Tofu Boy is not only sexy, he tastes good too!
19:08:02  TIP: Vegans do it better!
19:08:07  thanks peta
19:08:22  OH YM GOD IVE MADE MY USERPAGE HORRIFYING
19:08:34  Gregor: I don't think so :P
19:08:51  oh god your userpage
19:08:55  elliott: can't be as bad as my wikipedia userpage
19:08:59  CakeProphet: it is
19:09:00  http://esoteric.voxelperfect.net/wiki/User:Ehird
19:09:00  its
19:09:01  staring
19:09:02  at me
19:09:04  elliott: ... BAHAHAHAHAHAHA
19:09:05  elliott: You replaced the snowman with something I can't see?
19:09:10  Darth_Cliche: It's CAT FACE
19:09:23  It's a square
19:09:31  It is ridiculous that there is a unicode symbol for snowman
19:09:37  no
19:09:37  ...
19:09:38  Darth_Cliche: Ngevd: http://i.imgur.com/b7NOS.png
19:09:53  OH GOD
19:10:01  Indeed that is hideos
19:10:06  no it's great
19:10:25  if only there was...cat snowman....
19:10:27  snowcat...
19:10:50  snat
19:11:01  http://esoteric.voxelperfect.net/wiki/User:Ehird
19:11:02  oops
19:11:11  lol scroll all the way to the right
19:11:40  super tofu boy has changed my ways
19:11:41  hi cat
19:11:46  I now pledge to be a vegan here: https://secure.peta.org/site/Advocacy?cmd=display&page=UserAction&id=2055&c=STBpvp&s_src=ppmisc
19:11:55  http://esoteric.voxelperfect.net/wiki/User:Ehird oh noooooooo
19:12:06  gahhhh broken thing
19:12:11  caaaaaaaaaat
19:12:39  cat loves you
19:12:45  there, fixed
19:12:46  irssi is dumb and doesn't capture wiki urls correctly
19:13:00  monqy: click the cat...btw...
19:13:10  irssi doesn't capture URLs
19:13:23  er
19:13:27  gnome-terminal, rather
19:13:32  does that.
19:13:38  elliott: i saw.  good link...will you make a newkitten language...
19:13:48  monqy: maybe..............
19:13:54  perhaps I could... submit a bugreport with a.... a patch?
19:13:58  Deewiant: Can you agree to make CCBI's fungespace slower so I don't have to resort to mutability
19:13:59  my name is johny and i am a new kitten what the fvvk
19:14:00 -!- ais523 has changed nick to ais523\unfoog.
19:14:28  elliott: No
19:14:40  Deewiant: Hmm, let's try that again
19:14:42  Deewiant: Please
19:14:49  elliott: Sorry, no
19:14:58  Damn
19:15:22  Deewiant: Uh, just to check, you do do the optimisation I'm thinking you do, right? (Caching the array that the IP is in to avoid hashtable lookups)
19:15:56  Yes, except that it's to avoid a linear scan, not a hashtable lookup
19:15:58  avoid... hashtable lookups?
19:16:17  CakeProphet: Them things're expensive.
19:16:22  AAAAAAAAH THE THEORETICALLY AVERAGE CONSTANT TIME, IT BURNS.
19:16:29  Deewiant: Wait, why do you have a linear scan
19:16:30  what's the hash function look like?
19:16:34  CakeProphet: "Average constant time" my ass
19:16:50  elliott: Because I don't have a bucket PR-CIF k-d tree
19:16:53  It's constant time if you never do any inserts
19:17:04  Deewiant: You worry me
19:17:08  I'm afraid I don't have the power to render your ass in such an scalable manner.
19:17:27  elliott: Seriously, because I couldn't be bothered to do anything better and it works well enough :-P
19:17:33  elliott: yes I am generally aware of how hash tables work. :P
19:18:11  CakeProphet: Anyway, it matters when you'd be doing thousands and thousands of them per second
19:18:20  I wonder how many instructions/s CCBI manages; Deewiant?
19:18:39  elliott: ccbi -s might tell you, at least when combined with time(1)
19:18:40  elliott: with a slow hash function, this is true, yes.
19:18:59  CakeProphet: Allow me to simplify this down to your level
19:19:06  CakeProphet: Not doing a hash-table lookup is faster than doing a hash-table lookup
19:19:34  elliott: I didn't say it wasn't slower, rather, that with a slow hash function /it matters/
19:19:38  since that's what you said
19:19:42  Deewiant: I'd have to find a long-running benchmark that tests different kinds of instructions :P
19:19:59  elliott: Just run mycology a bunch of times? :-P
19:19:59  CakeProphet: It matters when the goal is to be as fast as possible
19:20:05  well, sure.
19:20:16  silly goal.
19:20:48  elliott "need for speed" hird.
19:21:04  CakeProphet: Elliott "need for not having each Fungicide benchmark take over ten minutes to run" Hird
19:21:25  Deewiant: BTW, it sucks how your Fungicide table doesn't have units :P
19:21:30  I wonder what the simplest possible TC language is
19:21:57  elliott: just think of those ten minutes as quality time you can spend enjoying your life, to kick back and let some of the pressure of everyday existence evaporate away.
19:21:58  what does "simple" mean
19:21:59  elliott: Which one?
19:22:06  monqy: Good question.
19:22:08  Deewiant: You only have one table
19:22:19  elliott: I was hoping for a link, but fine
19:22:21  Darth_Cliche: Probably self-BCT if it's TC
19:22:24  Deewiant: http://users.tkk.fi/~mniemenm/befunge/fungicide-rankings/
19:22:39 * elliott uses non-permalink. It's super effective!
19:22:39  also simple: iota
19:22:40  elliott: "All time measurements are in seconds (s) and all memory measurements are in mebioctets (Mio)."
19:22:50 -!- boily has joined.
19:22:53  elliott: (Yes, it probably should be repeated closer to the table.)
19:22:56  Deewiant: That's above the charts! :p
19:23:05 * elliott would just put the units in parens in the table headings.
19:23:12  But okay, right.
19:23:21  54 gigs is pretty impressive RAM usage.
19:23:25  (OK, so it's total, not maximum.)
19:23:35  I probably did that but it made it flow badly or something.
19:23:48  And yeah, measuring total RAM usage is totally relevant to something.
19:24:58  ais523\unfoog: so what are the difficulties with implementing Checkout on a GPU?
19:25:08  is there a nice pretty bulleted list?
19:25:13  CakeProphet: The fact that you can't program current GPUs at that level?
19:25:28  okay so you need to roll your own GPU
19:25:29  Deewiant: I'm not sure "total RAM usage" even makes sense
19:25:31  sounds like fun.
19:25:34  Deewiant: RAM doesn't really accumulate
19:25:41  It's "RAM usage if you ran all the benchmarks at once" :P
19:26:01  elliott: actually, current GPUs can be programmed at quite close to that level; most of Checkout's commands can be given explicitly, but some can't and you just have to hope the GPU figures out what you mean from an approximation
19:26:14  elliott: Yeah, that's what I was saying, it's not really very sensible
19:26:14  ais523\unfoog: Well, yeah, I said "that level", not "quite close"
19:26:19  I don't think OpenCL has a checkout command :P
19:26:21 -!- Phantom_Hoover has joined.
19:26:40  Hold on a god-damn second
19:26:56  elliott: CPU to GPU it does
19:27:03  the readonly version too
19:27:07  How is self-BCT different from regular BCT?
19:27:09  within the GPU, it doesn't
19:27:09  ais523\unfoog: Well, okay
19:27:16  Ngevd: No data stream
19:27:36  Deewiant: Could you make something else slower, then
19:27:48  elliott: Nah, I'm committed to keeping it fast
19:27:58  Deewiant: Hmm
19:28:03  Deewiant: Can I convince you to change your commitment
19:28:09  elliott: I doubt it
19:28:15  Deewiant: Money?
19:28:28  elliott: How much? :-P
19:28:33  Going to start building the computer.
19:28:51  Phantom_Hoover: *bomb
19:28:54  Deewiant: That's what I'm asking
19:28:56  Although I'm still unclear on the order of some bits.
19:29:06  elliott: How much can you offer?
19:29:14  Deewiant: Depends on how much you want!
19:29:43  elliott: That's not how it works; I don't need to tell you anything since you're the one with the need here
19:29:51  Motherboard-CPU-RAM-PSU-GPU-HDD looks best, currently.
19:29:57  Deewiant: Wow, offensive
19:30:06  ais523\unfoog: Make sure Phantom_Hoover doesn't blow himself up, please
19:30:17  Phantom_Hoover: don't blow yourself up, please
19:30:28  elliott: best I can do :(
19:30:29  BLARGH PPC WHY YOU NO WORK
19:30:34  RIP Phantom_Hoover 2011-2011
19:30:37  ais523\unfoog, it would be a tragedy if all these expensive bomb parts were to go to waste, also me.
19:31:02  Deewiant: Okay how about... 200 pounds
19:31:21  elliott: Sorry, won't do
19:31:30  Deewiant: 2000???
19:31:49  Phantom_Hoover: eh humans mostly consume value.
19:31:51  not very valuable.
19:31:59  well, phantom hoovers, however.
19:32:06  might be worth something.
19:32:11  elliott: Sure, I'd take that, assuming pounds = GBP
19:32:11  elliott: why are you trying to bribe Deewiant to slow down ccbi, when it's hilarious when it beats cfunge?
19:32:21  ais523\unfoog: Because I want Shiro to beat it
19:32:32  Deewiant: elliott's trying to trick you, a ?? is rather small compared to a GBP
19:32:35  ais523\unfoog: And my options right now are slower fungespace, or mutable fungespace
19:32:45  elliott: I think you're maybe going about this from the wrong direction
19:32:45  ais523\unfoog: heh
19:32:50  ais523\unfoog: Latter is super ugly and doesn't go well with my "better code" goals for Shiro 2
19:32:54  ais523\unfoog: Former is slower
19:33:33  is this a case of Haskell not being able to achieve top speed without being ugly?
19:33:35  ais523\unfoog: I would've made a new, faster interpreter with a different name anyway
19:34:12  elliott: mutable fungespace + abstractions = clean code + fast fungespace
19:34:17  ais523\unfoog: Oh, it wouldn't be /uglier/ than CCBI
19:34:18  Heyo, works on SPARC :)
19:34:27  ais523\unfoog: It'd just be uglier than a non-mutating fungespace
19:34:48  Haskell very rarely ends up UGLIER when doing mutable shit to match the performance of other languages, it just doesn't end up any nicer :P
19:34:55  So there was nothing radically wrong with my bomb assembly?
19:35:08  really, we want compilers to be able to infer mutability
19:35:15  CakeProphet: You still need to handle the mutability, which needs sequencing, which is sort of the whole point
19:35:17  where you write a bunch of pure changes, and it changes them to mutations when it's safe
19:35:24  ais523\unfoog: That's called GC
19:35:35  elliott: it's not quite the same thing as GC
19:35:36  ais523\unfoog: More seriously, uniqueness types/linear typing/whatever
19:35:40  But you still have to sequence things there
19:35:46  copy-and-GC-the-original is different from mutate-the-original
19:35:51  Anyway you can want that all you want but it's very much sufficiently-smart-compiler territory
19:36:08  (derlo deals with the problem by using a refcounting GC and mutating when the refcount is 1, but that's obviously not perfect)
19:38:16  "Refcounting GC"?
19:38:42  pikhq: refcounting is a sort of GC, IMO
19:38:52  although one that breaks on cyclic structures (in languagest that have them)
19:39:04  I'd consider it a form of automatic memory management, but not GC.
19:39:25  ITT: trivial semantic differences
19:39:33  it collects garbage, how is that not garbage collection?
19:39:34  Anyways.
19:39:36  ais523\unfoog: argh, you're making me think about my lazy underload again :)
19:39:48  elliott: didn't you /want/ distracting from @?
19:39:58  well... yes
19:40:09  ais523\unfoog: but shiro 2 was managing that! sort of!
19:40:16  ais523\unfoog: I am inclined to agree. so you know it's a legit stance. :)
19:40:36  ais523\unfoog: "Garbage collection" to me refers to the class of memory management schemes that free things that are not referred to directly or indirectly from a root set.
19:41:12  pikhq: refcounting /does/ that, just buggily
19:41:16  much like boehm-gc does
19:41:23  it's just that the bugs are different in the two cases
19:41:59  ais523\unfoog, OK one last piece of static paranoia:
19:42:07  ais523\unfoog: Refcounting doesn't, really. There is never a "scan memory" step, there is only a "mutate reference count" step.
19:42:28  Well, "mutate reference count and if ==0 free()"
19:42:33  Phantom_Hoover: Did you know: Anti-static wrist straps work by directing the shocks to... YOUR HEART.
19:42:35  Attaching the strap to the case, then screwing the motherboard in, is enough to ensure no damage to components plugged into the motherboard, right?
19:42:36  ENJOY YOUR DEATH
19:42:57  elliott, aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
19:43:03  Phantom_Hoover: no, it'd make no sense for all the pins on the motherboard to be connected to its chassis ground
19:43:07  because then, they wouldn't do anything
19:43:10  pikhq: Hmm, subleq would be good for refcounting
19:43:12  Argh.
19:43:16  however, if the motherboard's just come out of packaging
19:43:26  there's no obvious way it could have got charged in the first place
19:43:42  But what if I charge the case, which isn't itself grounded?
19:43:56  "Ground" is relative.
19:44:12  pikhq: well, it's absolute too
19:44:25  when talking about static discharge, both are relevant
19:44:28  Yes, but the case could still, pathologically, build up a charge relative to the motherboard.
19:44:57  how?
19:45:04  do you know what causes static charge buildup?
19:45:12  ais523\unfoog: if I recall correctly, I believe Python's refcounting scheme has a way to detect some cycles without resorting to weakrefs or something?
19:45:12  (it mostly involves actions by humans, such as walking)
19:45:15  My instinct is that it'd be fairly irrelevant for practical purposes, given that I'm not exactly wearing nylon clogs and skimming over wollen carpets.
19:45:18  *woolen
19:45:25  the best cure for static buildup is to discharge once before everything starts, and then just sit still
19:45:31  CakeProphet: I don't know
19:45:43  ais523\unfoog: hehehehehe you're going to make PH sit as still as a rock, afraid to breathe
19:45:50  Perl does refcounting without cycle breaks, but it's not a problem in practice as cyclic structures are rare, and when you want one, you add a delete method that breaks the cycle
19:45:52  I hate both of you?
19:46:04  elliott: I was a bit like that when I started
19:46:24  ais523\unfoog: oh, no. it just uses a regular garbage collector to collect cyclic structures.
19:46:38  CakeProphet: and refcounting to collect everything else?
19:46:39  CakeProphet: no, that's python
19:46:40  Tcl also does refcounting without cycle breaks, but it's not a problem as you can't really do cyclic structures from the reference counting system's point of view.
19:46:42  I'm just going to clip myself to the case and try not to worry too much.
19:46:49  elliott: He was discussing Python.
19:46:52  Phantom_Hoover: don't breathe too heavily, it'll cause a static discharge
19:46:53  pikhq: oh
19:46:56  elliott: "this is python's garbage collection scheme"   "no, that's python"
19:47:00  :P
19:47:03  elliott, I DON'T CARE
19:47:04  Phantom_Hoover: because of the flantz bobnicator
19:47:10  ais523\unfoog: Yeah. It's probably the most pointless scheme.
19:47:10  Phantom_Hoover: and gluggunutz electrostatic hydromorphism
19:47:23  ais523\unfoog: oh, and yes. refcounting for everything else.
19:47:24  experts shocked to discover that python is stupid
19:47:31  See, I'm still terrified to actually do anything argh
19:47:31  "Let's do all the simplicity of a garbage collector with all the speed of a reference counter!"
19:47:44  Damn you, Coulomb!
19:47:55  I wonder if anyon's tried just removing the refcounter frmo Python.
19:48:13  Phantom_Hoover: Reminder that idiots regularly assemble computers successfully.
19:48:14  elliott: I almost said that Python has the most stupid per unit of popularity
19:48:19  elliott: but I forgot about PHP.
19:48:30  Phantom_Hoover: You are much more paranoid than you should be.
19:48:34  The Python tracing gc is disableable, though, if you're sure you're never creating any cycles.
19:48:37  elliott, yes, but they're defended because their brain activity doesn't cause static buildup!
19:48:43  pikhq, yesyesyes, I know.
19:48:52  python is worse than php because not many people deefnd python
19:48:56  erm
19:48:58  python is worse than php because not many people deefnd php
19:48:59  defend
19:49:04  fizzie: Strange, it's the reference counting that you would want to turn off.
19:49:11  Unless their GC is *really* bad.
19:49:12  Electrocuting computer ->
19:50:10  rip Phantom_Hoover
19:50:12  pikhq: well if you used weakrefs for cycles and then turned off the GC, I think refcount would be reasonably efficient (???)
19:51:09  a weakref being "a reference that doesn't increment the refcount"
19:52:04  Mutating the reference count and free if ==0 actually does a number on performance. That's a pipeline flush on basically every function call.
19:52:25  ah okay.
19:52:37  Not to mention that malloc and free are actually not very speedy at allocation & deallocation.
19:52:40  I don't think you can turn off refcounting.
19:52:52  sure you can
19:52:54  just rip out the code
19:52:57  ...well, yes.
19:53:00  have fun with that.
19:53:13  I'd be horribly shocked if it weren't in a few macros.\
19:53:24  hmm though
19:53:28  what kinda gc does python use
19:53:29  pikhq: oh, yes it is
19:53:34  how would it interact with C extensions
19:53:35  like
19:53:40  yeah
19:54:19  elliott: I think Python uses a custom allocator so that it can garbage collect C-level stuffs.
19:54:45  so, if your C extensions are well written, it should interact fine.
19:55:09  *Obviously* C extensions need to behave well with the GC already.
19:55:18  It's on by default.
19:55:25  I'm sure that Python's GC is sufficiently bad that it would actually slow down :)
19:55:42  we should have this discussion on #python
19:56:00  so that people will defend python's amazing automatic memory management.
19:56:04  it would be fun.
19:56:24  I think #python can never be fun
19:56:43  olsner: no, I distinctly enjoy showing them my "unpythonic" code.
19:56:50  Gregor: That'd be impressive.
19:56:52 * elliott considers joining and saying "LOL PROJECT EULER"
19:56:59  Rather possible, but impressive.
19:57:16  olsner: read: code that is "confusing" because it does too many things in one line.
19:57:27  did you use reduce
19:57:35  I don't think so.
19:57:47  iirc python uses reference counting for "gc" ... though I wonder how it breaks loops
19:57:47  I can't recall what the code actually was.
19:57:52  just that it was unpythonic or something.
19:57:57  olsner: i love how people join in conversations in #esoteric
19:57:58  and like
19:58:00  say something offhand
19:58:01  I find folds much easier to read than for loops most of the time because i'm unpythonic weirdo
19:58:01  lol
19:58:03  that has been the topic of the conevrsation
19:58:06  for the past ten minutes
19:58:11  without realising
19:58:13  and things loop around again
19:58:16  and it never stops
19:58:18  hehe
19:58:41  elliott: huh, I wonder if Python's GC interacts well with C extensions. maybe you could turn refcounting off.
19:58:51  I just read the last line, and if it's something I'd like to respond to I do
19:59:45 -!- pikhq_ has joined.
20:00:10  pikhq: what about a refcounting scheme that instead maintains a list of things to be freed
20:00:19  and then frees when its sufficiently large but not too large.
20:01:06  still has the branching overhead, though.
20:01:25  Deeeerrrrpppp
20:01:42  pikhq: help I am no good at low-levels
20:01:58 -!- pikhq has quit (Read error: Operation timed out).
20:02:19  Clearly. malloc and free maintain a list of things that are free. free() does nothing but record "the block foo is free".
20:02:42  A refcounting scheme that instead maintains a list of things to be freed would just duplicate work.
20:04:51  hmmm, okay.
20:06:49  x86, x86_64, SPARC, MIPS :)
20:07:10  C64?
20:07:22 -!- nys has joined.
20:08:07  my goal: create an absolutely shitty implementation for a language of my design that becomes massively popular and attracts large numbers of fanatics.
20:08:07  Gregor: But not ARM ha ha ha
20:08:09  s/ $//
20:08:19  Gregor: What about...... IA-64?
20:08:33 -!- Darth_Cliche has quit (Quit: You are now graced with my absence.).
20:08:47  elliott: I can't qemu IA-64 :P
20:08:59  Gregor: http://ski.sourceforge.net/??????
20:09:13  "Ski can be used in two operating mode: user- and system-mode. In user mode, you can run user level applications directly on top of the simulator. The emulation stops at the system call boundary. The system call is emulated by calling the host OS, such as x86 Linux. Conversions between 64-bit and 32-bit parameters are done by ski as needed. This allows fast execution of user programs. Most system calls are emulated, though the emulation is not alw
20:09:13  ays 100 percent accurate."
20:09:20  "In system-mode, operating-system kernel development and execution is possible because interrupts and virtual memory behaviors are simulated. In this mode you can actually run the Linux kernel and, once booted, user applications can be run on top of the simulated kernel."
20:09:25  Former sounds easier to test with :P
20:09:57  Gregor: (The chances of it working on IA-64 are probably ~0)
20:10:18  elliott: Is that a bet? :P
20:10:22  I'll bet you zero virtubux.
20:10:23  Gregor: Absolutely
20:10:25  elliott: never tell me the odds!
20:10:31  Gregor: VLIW is fucking weird :P
20:10:49  elliott: Hey, working with -O0 counts ;)
20:11:02  Argh, Debian doesn't have ski.
20:11:06  I'll come back to it later :P
20:11:43  Gregor: Clearly the Right Decision.
20:11:44  ski must suck.
20:13:27 -!- Darth_Cliche has joined.
20:14:00  Ski or Die.
20:15:43  I keep on coming back to OpenWatcom and going "Oh yeah, slow as shit"
20:17:55  Watcom is so DOS game/demoscene. All the cool dudes had a copy.
20:18:56  I think my warezzzed copy was 9.something.
20:19:03  Yup.
20:19:07  Hence why OpenWatcom is good fun.
20:19:46  fizzie would know, he's the prime distributor of pirated QuickBasic copies nowadays.
20:19:50  That... that might even be true.
20:22:20  I'm pretty sure you'd find it on some shady "abandonware" sites that have gotten more downloads than a hypothetical fizzie.
20:22:42  fizzie: Yes, but nowadays? e.g., giving it to hypothetical me onwards?
20:22:48  Surely people can't have downloadad it since then.
20:22:49  Surely.
20:23:49 -!- tiffany has joined.
20:23:53  Oh, never mind, Debian /does/ have ski.
20:24:27  Gregor: THE RIGHT DECISION!!!\
20:24:46  "I want Quick Basic 4.5 for DOS
20:24:47  I want to learn this program  but I have not this program, If you have this program, please tell me by e-mail where this program!
20:24:51  I hope this program is free for me!
20:24:53  College student!"
20:24:59  Still a top seller, I think!
20:25:00  hi what the secret of happiines?
20:25:07  Okay, that was from 2000.
20:25:35  I want to learn this program / but I have not this program / If you have this program / please tell me by e-mail where this program!
20:25:37  INSTANT HIT.
20:25:47  fizzie: Also link.
20:26:12  Ooh, you can still buy it from http://www.emsps.com/oldtools/msbas.htm
20:26:16  ooh, quick basic 4.5! that's what I used to do my first programming :D
20:26:19  Also browsed away already.
20:26:50  But it was quite high up in the Google search for "quickbasic 4.5".
20:27:36  elliott: Installin' an ia64 cross-dev env!
20:27:54  Only $99 if you want 3.5" floppies.
20:28:11  Gregor: Aww ye
20:28:17  Plus another $99 for the manual.
20:28:35  fizzie: I can't find it. :'(
20:28:44  elliott: ... ... how the hell do you use ski :P
20:28:45  FOUND IT
20:28:51  Gregor: http://ski.sourceforge.net/
20:29:09  You just point them downhill and GO.
20:29:31  elliott: Nooooooooooooooooooooooooooooooooooooooooooooo it only MOSTLY works :(
20:29:31  "Windows is written in mostly VB and VC++ if you ask me."
20:29:43  fizzie: Oh no, I... I feel the BASIC Bug catching me once more.
20:29:49  elliott: It does the right things to the tape but can't call putchar :(
20:29:56  Gregor: X-D
20:30:04 -!- Aune has left ("Lmnar").
20:34:04 -!- Nisstyre has quit (Ping timeout: 260 seconds).
20:35:39  Also:
20:35:39  $ wc -c full.c
20:35:39  2650 full.c
20:35:40  :(
20:35:58  Gregor: Ha ha ha
20:37:44  I wish (read: I do not wish) C had a type qualifier that meant "this is a register and thou shalt not change it"
20:38:21  GCC has that
20:39:55  I know.
20:40:03  register int foo __asm__(...)
20:40:12  But I need a portablish solution :P
20:41:28 -!- Nisstyre has joined.
20:41:29 -!- Nisstyre has quit (Max SendQ exceeded).
20:44:13  Gregor: Why doesn't ARM work, again?
20:44:58  elliott: It writes integer literals raw into .text then copies them by offsets from PC.
20:45:42  Gregor: Nice.
20:46:10  elliott: Which could work in principle, but there's no way I can detect it >_>
20:48:06  Huh, maybe ski just doesn't like output much ...
20:49:45  Try the other "variant" things?
20:51:43  Hrm
20:53:02  I'm becoming increasingly convince that ski sucks :P
20:54:00  It's ... ... failing to scanf("%d", &C); ???
20:54:32  OK, moving on :P
20:58:05  tcc can't even produce a runnable program.
21:00:36 -!- oerjan has joined.
21:01:13 * oerjan wonders what the unfoog stands for
21:01:44  oerjan: it's a NetHack clan
21:01:49  I'm not sure where it got its name from
21:02:01  ah
21:03:16  ais523\unfoog, due to elliott's incompetence, I need to keep the motherboard, RAM and CPU in storage for a couple of days; do I disassemble them and put them all back in their original packaging?
21:03:43  Hey, I resemble that remark.
21:03:45  Phantom_Hoover: that's one possibility; the other is just putting them inside some antistatic wrapping
21:03:53  or inside a metal box, like a computer case
21:04:03  The case is the thing that needs replacing.
21:04:03  or just in any old place and discharge yourself before you touch them
21:16:42 -!- Patashu has joined.
21:20:10 -!- Nisstyre has joined.
21:24:19  $ wine jitchards.exe < hello.jch
21:24:19  ²
21:24:21  ... not quite.
21:27:20  hello dear esolangs reddit! how are you today? (esolangs.org)  submitted 3 years ago by ehird
21:28:13  i'd say there wasn't a market for that one.
21:29:09  "If you come to visit Australia, you are not likely to meet anything more dangerous than a dodgy kebab."
21:29:13  olsner: quite
21:29:37  by a strange coincidence, the first and most dodgy kebab i ever got was in australia.
21:29:46  (today's iwc rerun)
21:29:54  we could turn the reddit over to fungot
21:29:55  olsner: if ( sense ahead foe?) x" to give you a hint:
21:30:40  it smelled like puke, although it may have been just melted cheese.
21:30:52  Australia? The land of everything trying to kill you (especially that)?
21:31:08 -!- GreaseMonkey has joined.
21:31:08  pikhq_: that's the subject of the rerun annotation, of course
21:31:28  I have never had a Doner kebab
21:31:37  Shish kebabs by the dozen, though
21:32:13  i've had both, i think.
21:32:21  oerjan: i find it hard to believe you've been outside of norway, sorry.
21:33:16 -!- boily has quit (Ping timeout: 258 seconds).
21:33:48  kebab places are a dime a dozen in norway these days.  and my current favorite restaurant is run by a turkish kurd family
21:34:18  in the UK, kebabs are generally sold by fish and chip shops
21:34:32  oerjan: how much does a kebab cost in norway?
21:34:33  hmm, this sort of thing is why I use chicken burgers to compare fast food outlets
21:34:36  oerjan: I was just responding to the implication you'd been outside the country
21:34:38  because the vast majority of them sell them
21:35:59  olsner: hm i'm not sure for the late night fast food kind, which i haven't had for a long time.
21:36:16  somewhere between 50-100 kr, i assume
21:37:13  "Most pizzerias sell Kebab Pizza, a pizza with kebab meat and the aforementioned sauces as a topping, now the most popular pizza in Sweden."
21:37:24  ah.
21:37:29  (the kebab dinners at this restaurant are around 130-150)
21:37:46  what's a kr in currency I know the value of?
21:38:11  1 Norwegian krone = 0.111008012 British pounds
21:38:17  says google
21:38:21  ais523\unfoog: 1 British pound = 9.00835879 Norwegian kroner
21:38:24  so about 11p
21:38:34  hmm, I actually converted 0.11 to 1/9 and then back again
21:38:56  so 100kr = £11, which seems like quite a lot
21:39:09  One of my friends carries around a 100kr note to make her feel rich
21:39:28  Yeah, that's... $17. That's obscene.
21:39:44  norwegian food is expensive, because of general cost level and our isolationist agricultural policy
21:39:54  Admittedly, food prices in the US are rather horribly fucked up.
21:39:59  I'd expect somewhere from around £2 to £6 for that sort of fast food meal at a UK fast food shop, depending on quality
21:40:11 -!- elliott has quit (Read error: Connection reset by peer).
21:40:18  around here, the normal price for a kebab with fries would be around 70 SEK = 6.65 bounds
21:40:29 -!- elliott has joined.
21:40:45  in pita bread with no extras, about half that
21:40:55  wow
21:40:58  Same ballpark for US, I *think*. Kebab aren't quite common here, but that's around what it'd be for a similar sort of fast food thing.
21:40:59  ... and it's served with burger dressing
21:41:04  If it can't be bought for $5 or less, it ain't worth buyin'!
21:41:06  ais523\unfoog: well it's probably closer to 50 than 100, i'm just hedging
21:41:19  (well, i hope.)
21:41:20  pikhq_: same ballpark as UK or Norway?
21:41:25  ais523\unfoog: UK
21:41:44  I know that the prices for directly comparable food between Ottawa and Birmingham were slightly more expensive, but not much more, in Ottawa
21:41:51  I think gyros (which is what we call what you call kebab sandwiches, as we call something completely unrelated kebab) are probably around $5.50 on average here. For just the sandwich.
21:41:58  (I used an identical sandwich from Subway to make the comparison; you can't get much more standardised than that)
21:42:31  Gregor: "kebab sandwich" would be a weird combination; it's more common to hear just "kebab" and imply the other elements of the meal
21:42:32  subway is expensive for fast-food though
21:42:45  isn't everything expensive in norway :P
21:42:49  olsner: yes, but I expected it to be consistent on both sides of the Atlantic
21:42:56  ais523\unfoog: Well, this isn't how we use those words :P
21:43:10  http://esoteric.voxelperfect.net/wiki/Twisted_Python_Chat_Server
21:43:12  twisted python chat server
21:43:29  Clearly an esolang.
21:43:31  http://esoteric.voxelperfect.net/wiki/Love_Dating_Quizzes
21:43:33  love dating quizzes
21:43:50  External links
21:43:50  Wikipedia cambodian women datingonline dating servicesbad chat influence larelationship trustmistakes made by women in relationshipsa chat room
21:44:16  Twisted Python Chat Server really /could/ be an esolang
21:44:45  I love the random bolding.
21:44:52  Wait, it's bolding all occurrences of the page title words.
21:44:53  So good.
21:44:55  ais523\unfoog: Yup, looks like the prices between something at Subway in the US and the UK are comparable.
21:44:56  twisted python chat server could also just be a chat server written in python using the twisted framework
21:45:09  olsner: that's what the article is about
21:45:12  I think it's *slightly* more expensive in the UK?
21:45:16  elliott: I think that's probably the same spambot that advertised Google, I haven't seen it for ages
21:45:27  the link [http://en.wikipedia.org Wikipedia] gives it away
21:45:46  pikhq_: it wouldn't surprise me; I also think it depends on how central you are and in which city you were
21:46:01   isn't everything expensive in norway :P <-- yeah probably.  actually i vaguely recall from a recent newspaper article that we may be doing well on medical drugs.
21:46:09  I only really got to compare with central Ottawa, which wouldn't surprise me at all if it was significantly more expensive than in some small town
21:46:17  oerjan: Thank god!
21:46:39  or perhaps that was sweden.  i'm not quite sure.
21:46:41  ais523\unfoog: Prices in fast food chains *generally* are consistent nation-wide.
21:46:46  elliott: can you edit Twisted Python Chat Server into a real esolang, changing as little in the page as possible?
21:46:48  hmm my only mental associations for ottawa are "capital of canada, pretty"; dunno where that second one came from
21:46:52  pikhq_: not here, especially not Subway
21:46:55  ais523\unfoog: M...maybe?
21:46:59  it varies even within Birmingham
21:47:08  ais523\unfoog: It'd probably change most of the page :P
21:47:16  I know
21:47:17  even so
21:47:34  elliott: oh and electricity is still _somewhat_ cheaper in norway, although the common nordic market has reduced that difference a lot.
21:47:59  I suspect part of that is that our idea of "fast food" developed out of McDonalds, which is basically run on a "make everything as consistent as humanly possible" kick.
21:48:05  (> 90% hydroelectric)
21:48:30  the problem with my name is johny, what the f**k? is that an esolang has to be really good to be worthy of that name
21:48:31  elliott: will you take long enough that it's worth deleting the page meanwhile?
21:48:35  right, indeed
21:48:37  ais523\unfoog: most likely, yes
21:48:43  or, hmm, I have a better idea
21:51:14  ais523\unfoog: go on
21:51:24  ah
21:51:33  see it on the wiki?
21:52:08  yep
21:52:42  oerjan: are you /sure/ there isn't a simpler way to do n-cursor zippers? :P
21:59:07  oh i'm sure oleg could find one.
22:12:47 -!- copumpkin has quit (Remote host closed the connection).
22:14:14 -!- pikhq_ has quit (Read error: Operation timed out).
22:14:23  oerjan: :'(
22:14:28 -!- Ngevd has quit (Quit: Goodbye).
22:15:12  hm i recall some stuff i thought of before
22:16:01  basically if you wanted to do zippers with n cursors on arbitrary trees, you'd need a way to represent trees with several root leaves
22:16:21 -!- pikhq has joined.
22:16:22  huh
22:16:34  for just _two_ cursors and a tree that is a straight line, this is basically Seq
22:17:15  huh
22:17:19  because your representation of a zipper would need to cut up the large tree at each cursor, and to be able to modify each resulting tree close to where the cursor is
22:17:32  ic
22:17:33  (note i am thinking of the large tree as _unrooted_ here.)
22:18:06  since in spirit a zipper of a tree is basically about ignoring where the usual root is
22:18:07  oerjan: that sounds quite reassuring, since Seqs are not quite as slow to mutate as your n-cursor zippers would be :P
22:18:31  well the thing is this doesn't work for more than 2 cursors touching a subtree
22:18:51  then it needs to be a more refined structure
22:19:30  oh hm _this_ refined structure is where that median stuff from my never published paper was relevant
22:19:50  poor never-published paper :(
22:19:54  because whenever you have three points on a tree, there is a unique median point
22:19:58  ooh
22:21:06  which is either the one of the three points which separates the other two, or some fourth point which separates all the original three
22:22:55  given that this median point is canonical, it _might_ give a canonical way to split subtrees into Seq's of subtrees
22:23:30  ooh. this is sounding super elegant :P
22:23:34  (UNLIKE THE LAST TIME)
22:23:42  this is all something i thought about long ago when pondering n-cursor zippers
22:25:02  All the lonely people, where do they all belong?
22:25:14  --sartre
22:25:29  oerjan: so what's the obstalce to just applying that directly to a quadtree? :P
22:25:36  elliott: ha
22:25:49  --hitler
22:26:11  well i've never tried to wrap my head around the details
22:26:33  oerjan: wrapping your head around something is usually not good for it.
22:26:52  wrap and chew
22:27:12 -!- MSleep has joined.
22:27:24  oerjan: I don't understand. I can't wrap my head around your head.
22:27:36  oerjan: well, i'm listening >:)
22:27:43  you need to become a boa constrictor first
22:27:48  oerjan: so this should actually allow fast mutation from n cursors, right?
22:27:52  if possible
22:28:00 -!- MDude has quit (Ping timeout: 252 seconds).
22:30:36  mmm sweet potato and beet chips.
22:30:48  why do people eat potato chips again?
22:32:16  Because they're a salty delight?
22:32:33  CakeProphet: they taste nice; I ate some earlier today (although they're called crisps in the UK)
22:32:41  maybe
22:33:07  oerjan: promising!
22:33:32 -!- copumpkin has joined.
22:33:41  I just ate a whole bag of these chips. Hopefully I won't get vitamin A poisoning.
22:34:12  hm those median points would become sort of virtual extra cursors, perhaps
22:34:22  Researchers have succeeded in creating water-soluble forms of vitamin A, which they believed could reduce the potential for toxicity.[44] However, a 2003 study found water-soluble vitamin A was approximately 10 times as toxic as fat-soluble vitamin.[45] A 2006 study found children given water-soluble vitamin A and D, which are typically fat-soluble, suffer from asthma twice as much as a control group supplemented with th
22:34:28  wtf kind of study is that.
22:35:01  ->
22:35:10  oerjan: but -> WHERE???
22:35:16  crapper
22:35:20  lol
22:35:26  note to self: don't ask oerjan that in future
22:36:00  `?welcome
22:36:02  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: ?welcome: not found
22:36:04  `? welcome
22:36:06  Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
22:36:11  `@ ais523\unfoog ? welcome
22:36:12  interestingly enough Vitamin A poisoning causes blurry vision. weird.
22:36:14  ais523\unfoog: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
22:36:54 -!- MSleep has changed nick to MDude.
22:37:17  !bf_txtgen Hello, world!
22:37:19  ​125 +++++++++[>++++++++>+++++++++++>+++++>+<<<<-]>.>++.+++++++..+++.>-.------------.<++++++++.--------.+++.------.--------.>+.>+. [169]
22:37:34 -!- Betawolf has joined.
22:37:59  `@ Betawolf ? welcome
22:38:02  Betawolf: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
22:38:36  elliott: no fair making me direct my random welcomes at people in particular
22:38:50  hi ais523\unfoog
22:39:18  elliott: I can one-up that: http://qdb.rawrnix.com/?735
22:39:21  (happened earlier today)
22:39:37  `@ elliott `@ ais523\unfoog `@ monqy `echo hi
22:39:39  elliott: exec: 9: `@: not found
22:39:50  `@ elliott @ CakeProphet @ monqy @ echo hi
22:39:51  elliott: CakeProphet: monqy: exec: 9: hi: not found \ echo:
22:39:52  `@ elliott @ ais523\unfoog @ monqy echo hi
22:39:55  elliott: ais523\unfoog: monqy: hi
22:40:10  `@ ais523\unfoog yes
22:40:12  ais523\unfoog: y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y
22:40:17  ais523\unfoog: heh
22:40:31  `yes @ ais523\unfoog
22:40:33  ​@ ais523\unfoog \ @ ais523\unfoog \ @ ais523\unfoog \ @ ais523\unfoog \ @ ais523\unfoog \ @ ais523\unfoog \ @ ais523\unfoog \ @ ais523\unfoog \ @ ais523\unfoog \ @ ais523\unfoog \ @ ais523\unfoog \ @ ais523\unfoog \ @ ais523\unfoog \ @ ais523\unfoog \ @ ais523\unfoog \ @ ais523\unfoog \ @ ais523\unfoog \ @ ais523\unfoog \ @ ais523\unfoog \ @ ais523\unfoog \ @ ais523\unfoog \ @ ais523\unfoog \ @ ais523\unfoog \ @
22:40:37  `run `yes @ ais523\unfoog`
22:40:39  Ah, I shouldn't be surprised. It's -that- usage of 'esoteric'
22:40:46  Betawolf: :-D
22:40:53  Betawolf: We often get people expecting the other kind.
22:40:58  Betawolf: you know both usages? and came here willing to talk about either?
22:41:09  bash: xrealloc: ../bash/subst.c:4952: cannot allocate 67108864 bytes (134258688 bytes allocated)
22:41:12  Wow.
22:41:17  Well, for a given value of 'willing'.
22:41:33  elliott: you almost killed me there
22:41:40  I was intending to lurk, lurkerly.
22:41:42  accidentally; I was drinking a glass of water and started laughing at HackEgo's response
22:41:49  My sincerest apologies. I will be more effective next time.
22:42:05  but luckily managed to not choke
22:42:13  Betawolf: Lurking is so cliché; just ask yiyus.
22:42:14  ^ul ((y )S:^):^
22:42:14  y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y y  ...too much output!
22:42:19  ^ul ((y \ )S:^):^
22:42:19  y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \  ...too much output!
22:42:22  Or Zetro. Or yorick.
22:42:35  underload > hackego at repeating y \
22:43:11  `run ghc -e "99 + 42"
22:43:18  141
22:43:21  Wow that was slow.
22:43:33  `run ghc -e "print (99 + 42)"
22:43:37  141
22:43:48         -e expr
22:43:48                Evaluate expr; see for details.
22:43:48  --man ghc
22:43:52 * elliott sees for details.
22:43:52  elliott: -e compiles correct?
22:43:58  CakeProphet: I doubt it.
22:44:03  But I need to see for details.
22:44:08  > repeat 'y'
22:44:09    "yyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyy...
22:44:10  Is that just echoing via bash?
22:44:12  elliott: just look, dude.
22:44:25  > flatten $ repeat "y \\ "
22:44:26    Couldn't match expected type `Data.Tree.Tree a'
22:44:26          against inferred ty...
22:44:27  > cycle "y\n"
22:44:28    "y\ny\ny\ny\ny\ny\ny\ny\ny\ny\ny\ny\ny\ny\ny\ny\ny\ny\ny\ny\ny\ny\ny\ny\ny\...
22:44:32  Yeah, it uses the interpreter, I think.
22:44:35  > var $ cycle "y\n"
22:44:35  Betawolf: HackEgo, you mean?
22:44:36    y
22:44:36   y
22:44:36   y
22:44:36   y
22:44:36   y
22:44:38  [21 @more lines]
22:44:42  exploit
22:44:44  @more
22:44:44   y
22:44:44   y
22:44:44   y
22:44:46   y
22:44:46  Betawolf: It's a fully-sandboxed, persistent Linux system.
22:44:48   y
22:44:49  Betawolf: Our QDB is based on it.
22:44:50  [16 @more lines]
22:44:51  Also stop that guys.
22:45:00  elliott: I was going to stop after the one @more
22:45:34  Betawolf: HackEgo basically runs arbitrary commands, with protection against doing silly things
22:45:51  `run :(){:|:&};:
22:45:53  bash: -c: line 0: syntax error near unexpected token `{:' \ bash: -c: line 0: `:(){:|:&};:'
22:45:57  lol
22:46:00  see what I mean?
22:46:03  `run : () { : | : & } ; :
22:46:06  No output.
22:46:10  Yeah, that was what I was worrying about.
22:46:12  `help
22:46:13  (actually, I was curious as to why the space was needed, guess I know now)
22:46:14  Runs arbitrary code in GNU/Linux. Type "`", or "`run " for full shell commands. "`fetch " downloads files. Files saved to $PWD are persistent, and $PWD/bin is in $PATH. $PWD is a mercurial repository, "`revert " can be used to revert to a revision. See http://codu.org/projects/hackbot/fshg/
22:46:22  It's kept in a repository: http://codu.org/projects/hackbot/fshg/
22:46:31  And you can revert even if the whole system inside is broken.
22:46:33  why is the repo called fshg?
22:46:44  filesystem hg
22:46:56  the actual code is at /hg/
22:47:02  at least, I presume that's what it stands for
22:47:08  ah, OK
22:47:32  You guys may be interested in a friend of mine's old project - a brainfuck interpreter written in javascript.
22:47:52  It's not BestFriends. Please tell me it's not BestFriends.js.
22:47:55  http://extremetomato.com/interesting/brainfuck/
22:48:00  *phew*
22:48:32  Aww, it doesn't support infinite tapes :)
22:48:37  He wrote a proper compiler, too, but I don't think there's a public link for it.
22:49:00  state-of-the-art BF compiler.
22:49:10  CakeProphet: that would be esotope, presumably
22:49:23  (so Betawolf knows what I'm referring to: https://bitbucket.org/lifthrasiir/esotope-bfc/overview)
22:49:33  elliott: it is unqise to [resum
22:49:41  uh
22:50:05  yes.
22:50:06  uh
22:51:15  elliott: you have figured out.
22:51:24  oerjan: You can run but you cannot hide@
22:51:25  !
22:51:37  I like how whenever anyone joins the channel explodes in activity.
22:52:03  yes.
22:52:10  Cool, I'll put him onto it
22:52:13  > 2 + 2
22:52:14    4
22:52:21  Betawolf: we like bots.
22:52:26  I hadn't noticed.
22:52:28  ^source
22:52:28  http://git.zem.fi/fungot/blob/HEAD:/fungot.b98
22:52:33  We like bots written in esolangs MOST OF ALL.
22:52:42  fungot: Say hi to Betawolf.
22:52:42  elliott: " and this is a new game. there is no
22:52:45  ^style
22:52:45  Available: agora alice c64 ct darwin discworld europarl ff7 fisher fungot* homestuck ic irc iwcs jargon lovecraft nethack pa sms speeches ss wp youtube
22:52:47  ^style irc
22:52:47  Selected style: irc (IRC logs of freenode/#esoteric, freenode/#scheme and ircnet/#douglasadams)
22:52:50  fungot: You can do better than that.
22:52:50  elliott: a ged file *is* notation... i barely fnord across the scheme/ vm/
22:52:57  fungot: Come on. One long one.
22:52:57  elliott: the negative list makes a list from return values :p i want to
22:53:01 * elliott gives up.
22:53:08  ^style europarl
22:53:08  Selected style: europarl (European Parliament speeches during approx. 1996-2006)
22:53:15  fungot: make a motion
22:53:16  CakeProphet: mr president, since i only have one main objective of the isd which is due for adoption by the end of 1999, which attempted to establish minimum requirements. mrs schreyer, that, in the absence of criticism of it, which does not allow it to provide criteria, after which we should like to end by emphasising the fact that it has an opportunity to work for the betterment of the people, by their nature, very undiscipli
22:53:59  fungot: referendum denied
22:53:59  CakeProphet: may i start by thanking parliament once again.
22:53:59  Is that random sampling, as in that really well-known bot I can't remember the name of?
22:54:07  it's a markovbot
22:54:25  Betawolf: marko v. shaney, perhaps?
22:54:25  works out the next word to say statistically, by seeing the probability that words are used in that context
22:54:36  s/o//
22:55:15  Oh, actually NLP, cool
22:55:31  well, for some value of nlp :-)
22:55:50  Betawolf: more like a markov chain. a big markov chain.
22:55:51  but sure.
22:56:00  Betawolf: it's just based on how many times a word follows a context of a certain length
22:56:05  Sure, I remember the process from AI
22:56:22  maybe humans are just big sexy markov chains.
22:56:25  and that is AI.
22:56:36  fungot: THINK!
22:56:37  CakeProphet: mr president, the commission, the scope of monetary policy is compatible with the completion of the internal political situation in burma. political pressure will have to pay out the funds. pensions should not be overestimated. a peaceful and lasting settlement.
22:56:41  CakeProphet is our other markov chain bot.
22:57:48  elliott: mr president, suck my balls, sir. thank you parliament.
22:58:10  ais523\unfoog: You should kick the worst channel members whenever someone new comes in.
22:58:11  Start with me.
22:58:32  Heh, would keep the place fresh.
22:58:38  elliott: try #esoteric-minheap
22:59:03  you'd need a -maxheap too where you just kicked the /best/ channel members whenever someone new comes in
22:59:18  might be fun to see who was still there in a year's time
22:59:26  CakeProphet.
22:59:48  they'd have to be very persistent to stay there despite the bunch of lurkers and crazy people
23:00:08  Yes. And yet somehow, #esoteric survives.
23:00:14  Placenta "persistence" Prophet
23:00:32  may the worst one win.
23:00:58  this reminds me of the BF Joust hill before it was fixed
23:01:40  !bfjoust it_shouldnt_go_on_the_hill_with_this_nick (>)*8(>[-])*21
23:01:48  ​Score for ais523_unfoog_it_shouldnt_go_on_the_hill_with_this_nick: 20.4
23:02:01  please tell me that didn't /actually/ end up on the hill
23:02:14  haha, it did as well
23:02:14  elliott: surely I'm not the worst channel member. Perhaps units of bad per units of regularity.
23:03:16  ais523\unfoog: you won't know until next time
23:04:00  elliott: it's not in last place, or anywhere near it
23:04:01  $ perl -pe0
23:04:01  $ ghc -e interact\ id
23:04:07  ais523\unfoog: Haskell is about twice as bad as Perl!
23:04:12  it's 44th out of 48
23:04:14  haha
23:04:20   note to self: don't ask oerjan that in future <-- i'd have thought leaving it out would be a hint.
23:04:32  in other news, we are now having a backscroll session.
23:04:43  wait, it beats almost all my programs
23:04:47  what is up with my decoy setup?
23:05:09  oerjan: nothing interesting happened! now TELL ME MORE.
23:05:18  actually, I miscounted, more like half
23:05:20  but still…
23:05:34  wtf republican party.
23:08:44  wtf (insert political entity here)
23:08:56  distinctly not as bad as the republican party.
23:09:03 -!- copumpkin has quit (Quit: Computer has gone to sleep.).
23:09:11  wtf ais523\unfoog
23:10:11  wtf oerjan\unfoog
23:10:17  what is unfoog?
23:10:27  NetHack clan
23:10:37  NetHack...clan?
23:10:45  elliott: let's start a df clan.
23:10:50  What.
23:11:12  we can, uh
23:11:17  play dwarf fortress, and talk about it
23:11:20  and have a name.
23:12:13  I imagine dwarf fortress is difficult to play outside of dwarfism conventions.
23:12:33 * Phantom_Hoover → sleep
23:12:34  CakeProphet: and combine points in the annual dwarf fortress tournament?
23:12:35 -!- Phantom_Hoover has quit (Quit: Leaving).
23:13:17  Betawolf: I think it'd be just as difficult within those.
23:13:20  They must be difficult to stack, too.
23:13:47 -!- augur has quit (Remote host closed the connection).
23:13:54  http://www.bay12games.com/dwarves/screens/dwf5.png <-- dwarfism convention
23:14:00  And not overly resistant to bombardment...
23:14:46 * ais523\unfoog envisages a stack of dwarves balanced on each other
23:15:00  if you pushed them over, you could just pop them back up again
23:15:19  If trained, they could spring back up of their own accord.
23:15:50  finally, i'm back to not believing the channel is actually having the conversation it is
23:15:55  that was a worrying bout of sanity
23:16:42   oerjan: You can run but you cannot hide@ <-- i hide in the past
23:16:53  elliott: enjoy being locked in your matrix of solidity!
23:17:54  ais523\unfoog: It's so solid.
23:18:47  elliott: is going mad a reasonable cure for depression, btw?
23:18:57  I, um, how serious is this question?
23:18:59  ais523\unfoog: yes
23:19:14  elliott: not completely frivolous, but substantially frivolous
23:19:31  IANADispenserOfSubstantiousFrivolity
23:19:38  hmm
23:19:50  I feel I need to keep Feather around in case of emergencies
23:20:09  Manic depression is a form of both mad and depressed, if that's at all unhelpful.
23:20:16  "I'm depressed, time to work on Feather"
23:20:33  "Great, now I'm a depressed time traveller."
23:21:12  Feather doesn't actually time-travel its users, that would be absurd
23:21:21  /inb4 "Feather is absurd anyway"
23:21:50  I feel I have to ask what Feather is, other than not a time-travel device.
23:22:00  ais523\unfoog: time to use your op powers for good
23:22:05  Betawolf: don't expect a straight answer
23:22:06  I'm not sure there is one
23:22:11  it's somewhere between esolang and injoke
23:22:18  Betawolf: http://esolangs.org/wiki/Feather, further answers can be derived from reading http://codu.org/logs/_esoteric/
23:22:29  the urge to do nothing is overwhelming.
23:22:59  CakeProphet: then do something about it!
23:23:06  CakeProphet: I did that once.
23:23:09   oerjan: nothing interesting happened! now TELL ME MORE. <-- well i'm thinking that the virtual cursors that split the tree will be the median subalgebra generated by the real cursor nodes.  you would need a map from real to virtual, and a map from virtual to neighboring Seq subtrees on each side.
23:23:09  ..nah
23:23:32  oerjan: ok. this is sounding significantly more manageable :P
23:24:04  my motto is, as long as you have less than 15 constructors, you're good
23:24:05  Betawolf: summary: imagine a prototyping OO language, except that instead of delegation or similar concepts, you use time travel
23:24:14  explaining more will cause me to go mad, so I don't want to
23:25:08  Chicken! Embrace the inevitable.
23:25:28  Betawolf does not Know.
23:25:31  anyway, after a while of working on Feather, I couldn't take it any more, and everyone (correctly) accused me of chickening out
23:25:38  and the language has since become an inside joke
23:25:49  ais523\unfoog: use futures!
23:25:52  *Clearly* it must be implemented in Haskell.
23:25:59  It already has time travel semantics, after all.
23:26:11  the time travel semantics aren't even the difficult bit
23:26:28  those were worked out early on, and are very sane, and unproblematic
23:26:40  is it the prototype OO that's unsettling?
23:26:45  the major problem with Feather is that it's metacircularly implemented in itself, back to infinity
23:27:03  and whenever I try to work out if this actually makes sense or not, I conclude that it does but I'm going about it wrong
23:27:16  wait, not metacircularly
23:27:17  from scratch
23:27:26  otherwise it'd take infinitely long for it to do anything
23:27:37  so the question is how you implement a language in itself without using any of its language constructs
23:28:10  I'm pretty sure that doesn't make sense. :-)
23:28:31  Betawolf: the version that makes sense isn't vague enough to not make ais523\unfoog go insane
23:28:55  ais523\unfoog: Did anything come out of you fixing the issue with your previous prototype interpreter?
23:29:01  Perhaps a certain madness is requisite.
23:29:01  #haskell seems to be invaded by kids
23:29:20  Haskell's 'in' at the moment.
23:29:22  elliott: I didn't fix the issue with it
23:29:28  To great dismay.
23:29:31  ais523\unfoog: hmm, you fixed /one/ issue with it.
23:29:33  or, well, if you're talking about a different issue, I did
23:29:36  Betawolf: Dismay?
23:29:39  why \unfoog?
23:29:43  and all it proved is that I wasn't completely crazy
23:29:45  coppro: NetHack clan
23:29:50  `log NetHack clan
23:30:01  coppro: Well, it stops being niche and cool when everyone's doing it.
23:30:15  2011-11-15.txt:23:29:45:  coppro: NetHack clan
23:30:26  hmm, I wonder why it picked that one?
23:30:26  bluh
23:30:28  `log NetHack clan
23:30:35 * elliott has changed nickname to elliott\unſoog
23:30:35  2011-11-15.txt:23:29:45:  coppro: NetHack clan
23:30:47  oerjan: I TAKE IT YOU'RE EXPANDING ON THAT NOW >:)
23:31:01  monqy: ><{{{}::LLKLMH@A;'`hi`1 s
23:31:13  Betawolf: no problem.  they'll just add more type features until no one understands anything and it'll be niche and cool again.
23:31:23  elliott: AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
23:31:29  coppro: Though I appreciate 'niche' might not really apply as a label for haskell, given the channel we're in.
23:31:39  @_@
23:31:41  Deewiant: what?
23:31:43  err
23:31:44  o
23:31:45  > foldr f [a,b,c,d]
23:31:45  Betawolf: what?
23:31:46    No instance for (SimpleReflect.FromExpr [SimpleReflect.Expr])
23:31:46     arising fr...
23:31:47  Haskell is almost as esoteric as Perl, which is a genuine esolang.
23:31:47  > foldr f z [a,b,c,d]
23:31:48    f a (f b (f c (f d z)))
23:31:57  Betawolf: we keep haskell around for when we need to accomplish _real_ work.
23:32:07  or in my case, OCaml + Perl
23:32:14  it helps if you can avoid using something so practical, though
23:32:16  I have no qualms about even mixing the languages when necessary
23:32:23  I suspect people think I'm mad as a result
23:32:31  ais523\unfoog: I think u am hero
23:32:34  :>
23:32:45  ais523\unfoog: kick CakeProphet please
23:32:47  elliott: ski is shiiiit
23:32:55  Gregor: as in the combinators?
23:33:03  elliott: why are hate me?
23:33:15  :(
23:33:39  elliott mad
23:33:52  oerjan: MORE ABOUT N-CURSOR ZIPPERS PLZ
23:34:00  elliott: trees
23:34:01  mad and infectious
23:34:57  ais523\unfoog: As in the ia64 simulator.
23:35:48  ow my back
23:36:10  elliott: you so good. warm in my heartgut.
23:36:53  what has happened to this channel?
23:37:07  it's gone downhill, and I fear it's my fault
23:37:56  Just now or longer-term? :-P
23:38:36  ais523\unfoog: perhaps you just have unrealistic expectations
23:38:43  for example, that #esoteric might save the world.
23:39:04  well, there's always a chance
23:39:07  elliott: both, actually
23:39:22  I can't remember which I meant
23:39:22  ais523\unfoog: This channel has always been terrible.
23:39:28  just assume I'm drunk at the moment, it simplifies things
23:39:51  Oh no, ais523\unfoog had dairy. Or something.
23:40:12  nah, just tired
23:40:23  Same thing!
23:40:25  ski really sucks at I/O >_>
23:40:32  So, ais523 gets "drunk" in the same way I do?
23:40:58  No.
23:41:05  You're just weird.
23:41:13  ais523\unfoog: Exactly why deviated septum medical procedures? Along with a greater problem that is experienced the particular surgery. Ahead of these queries might be responded successfully, a brief release in to exactly what a deviated septum can be should be examined. The actual nose septum is the portion of the nose which divides the actual nose pathways. Your septum comprises of the two bone tissu
23:41:13  e and cartilage.
23:41:26  Remarkably there's a single occasional actress who's occupation sustained as a result of the nasal surgical treatment was Jennifer Gray. Many will don't forget your ex through the woman's noticably motion pictures becoming Dirty Dance, as well as Red-colored Beginning. After the woman's role inside the film Unclean Bouncing, Greyish decided to have a very nasal work to remove your lump via your ex nost
23:41:27  ril.
23:41:33  two or five?
23:41:52  Wait, what?
23:41:52  oh, just one
23:41:56  with a bizarre change of topic
23:42:12  would you like fries with that?
23:42:13  Two or five what?
23:42:20  elliott: spam pages
23:42:20  Is elliott posting spam?
23:42:27  SgeoN1: I'm actually the wiki spammers.
23:42:29  Don't tell anyone.
23:42:37  SgeoN1: I /hope/ it isn't elliott
23:42:37  ...that would explain so much...
23:42:44  and if it is him, he has a bunch of proxies
23:42:50  (according to internet meme, seven)
23:42:50  I meant, seen spam into here
23:43:00  ais523\unfoog: please kick elliott for spam.
23:43:02  Nothing I posted was spam.
23:43:06  It had no unsolicited links or whatever.
23:44:02  What does unsolicited stupidity count as? And please don't say that I'm a producer.
23:44:16   I need on-demand confusion yuck yuck
23:44:23  I thought that was posted in #esoteric for a moment
23:44:33  SgeoN1: You write your own material, dude.
23:44:50  You have been watching /Unsolicited Stupidity/ ~ Producer: elliott ~ Director: SgeoN1
23:45:07  sounds like a decent name for a film
23:45:27  ais523\unfoog: from Substantious Frivolity Productions
23:45:40  did I actually say "substantious"?
23:45:49  no, that was me
23:45:57  `log [^]"]substantious
23:46:02  2011-11-15.txt:23:19:31:  IANADispenserOfSubstantiousFrivolity
23:46:52  ais523\unfoog: cheat!
23:47:07  what's cheating there?
23:47:27  oerjan: hi hi hi
23:47:29  ais523\unfoog: [^]"]
23:47:41  ais523\unfoog: wait, does [^] actually /work/?
23:47:48  it /special-cases the first character/?
23:47:54  elliott: only when it's ]
23:47:58  or -
23:48:02  also, special-cases - as last character
23:48:10 * elliott cries.
23:48:14  elliott: ho ho ho
23:48:29  my regex for matching BF comments is along the lines of [^][<>,.+-]
23:48:30  oerjan: hi zippers..... please???
23:48:35  ais523\unfoog: ouch
23:49:11  Perl lets you write it as [^\[\]\+\-\,\.\<\>] instead
23:49:14  which is rather clearer
23:49:19  if a bit backslashy
23:49:53  and a bunch of other languages, like Python/Ruby/Java, ripped off Perl's regexes
23:50:03 -!- ais523\unfoog has quit (Remote host closed the connection).
23:50:10  rest in peace ais
23:50:28  oerjan: pl.s........
23:50:52  dammit
23:51:16 -!- pikhq has quit (Ping timeout: 258 seconds).
23:51:18 -!- pikhq_ has joined.
23:52:07  i think this is intuitively equivalent to collapsing as much of the tree as possible while keeping it a tree and the real cursors distinct
23:52:21  ah
23:52:27 -!- DCliche has joined.
23:53:22  and a Seq of trees is a representation of a line resulting from collapsing between two nodes
23:53:29 -!- augur has joined.
23:54:06  controlled demolition: the zipper story
23:55:55 -!- Darth_Cliche has quit (Ping timeout: 240 seconds).
23:56:46  i am not quite sure, but i think the number of virtual cursors cannot be more than twice the number of real ones
23:57:38  or thereabouts.
23:58:24  ok
23:59:40  so lookup of stuff is hopefully O(log n) in the number of cursors
23:59:53  assuming a Map

2011-11-16:

00:00:13  oerjan: you mean, looking at the value at a cursor?
00:00:26  that's not bad
00:00:47  well, finding the neighboring Seq's and stuff
00:01:01  oh, OK
00:01:06  so accessing the value at a cursor is still O(1)?
00:01:09  oh hm
00:01:17  well yeah that should be possible
00:01:29  right
00:01:58 * elliott is probably more interested in the mutation performance :P
00:03:40  well to move a cursor along an edge, you would need to look up the neighboring Seq's and adjust them
00:04:29  oh in addition to neighboring Seq's there may also be neighboring collapsed trees with no other cursors adjacent
00:04:57  i may not be following as closely as i thought >:)
00:05:04  so do you have any idea what this would look like for an actual tree structure?
00:05:23  i think this may be a graph minor construction
00:05:51  erm
00:08:39  oerjan: so basically each Seq can have up to 2 cursors as parents?
00:08:43 -!- TeruFSX has quit (Read error: Connection reset by peer).
00:08:45  *-.-.-*-.-.      *-*
00:08:45        |       ->   |
00:08:45    .-*-.-.-*      *-+-*
00:08:49  CakeProphet: yes
00:09:12  oerjan: that's pretty :')
00:09:23  the left part is the original tree with *'s as real cursors, the right is the collapsed tree, + is a virtual cursor
00:10:15  ok
00:11:34  oerjan: what would be wrong with a BST of cursors that point to Seq leaves? (I don't think this terminology makes sense when dealing with graphs but whatever)
00:11:39  each of the right part - and | would be a Seq of the lines collapsed to it.  oh hm i guess that doesn't show how there might be additional trees on those lines that are collapsed
00:11:47  what's a BST again
00:11:51  binary search tree.
00:12:15  well that's something like what i'm imagining
00:12:33  that is exactly what I'm imagining. :P
00:12:58  I guess you could use a 2-3 tree or some variation of a BST.
00:13:09  well it's just a dictionary?
00:13:20  ah, yes.
00:14:42  if by dictionary you mean a map implemented as a binary search tree. :)
00:14:59  that's afaik what haskell's Data.Map is.
00:15:05  yes.
00:15:29  wait so what about... Seq Cursors?
00:15:43  wat
00:15:46  no?
00:15:46  okay.
00:16:39  as in use a 2-3 finger tree to store a sequence of cursors, which point to two sub Seqs.
00:17:39 * oerjan head no wrap again
00:18:04  oerjan: ignore that silly CakeProphet dude and tell me more :D
00:19:45      (*)(-.-.-)(*-.-.)        *-*
00:19:45                (|)       ->     |
00:19:45          (.-*-)(.)(-.-)(*)    *-+-*
00:19:58  \ o /
00:20:04  How does that bot work?
00:20:09  that shows precisely what part of the original is included in each char
00:20:14  on the right
00:20:16  ^celebrate
00:20:16   \o| |o| |o/  \m/ \m/  |o/ \o/ \o|  \m/ \m/  \o| |o| |o/
00:20:16    |   |   |    `\o/´    |   |   |    `\o/´    |   |   |
00:20:16    >\  |\ /<      |     /<  /´\  >\     |      >\ /<  /|
00:20:16               (_|¯`\                   /´\
00:20:16                    |_)               (_| |_)
00:20:20  shachaf: like that.
00:20:33  shachaf: also that's a human being not a bot. how rude!
00:20:42  \o/
00:20:42    |
00:20:43   /`\
00:20:46  oh oops
00:20:52  elliott: sorry, typo there
00:21:12      (*)(-.-.-)(*-.-.)        *-*
00:21:12                (|)       ->     |
00:21:12        (.-*)(-)(.)(-.-)(*)    *-+-*
00:21:21  oerjan: ok
00:21:36  oerjan: this is more efficient the closer each cursor is, right?
00:21:50  erm how so?
00:22:03  oh, hmm, no
00:22:06  i was misreading it :)
00:22:20  HASH TABLE OF CURSORS MUTABILITY YEAAAAH
00:22:23  the idea of the Seq's and collapsed subtrees is to make the parts between cursors O(1) to move in
00:22:45  well for a certain value of "1"
00:22:50  oerjan: right
00:23:40 * CakeProphet writes a O(1) hash function that sleeps for 3 years before returning 1.
00:24:13  IT'S PRACTICALLY INSTANT.
00:24:54  O(noes)
00:25:03  ...As they say on the Internet.
00:25:24  I don't think you should ignore constant factors when your constant factor is 5 trillion.
00:25:27  silly Big O notation.
00:25:35  `quote O\(slow\)
00:25:37  276) [on egojoust]  The fact is that EgoBot's % handling is O(slow) and O(big), and mine isn't.
00:25:53 -!- augur has quit (Remote host closed the connection).
00:25:57  `quote themselves
00:26:00  No output.
00:26:05  `quote norway
00:26:07  No output.
00:26:13  `quote lunch
00:26:15  No output.
00:26:19  Useless bot.
00:26:26  `quote fuck
00:26:28  225)  I love the way zzo38's comment was cut off after the f of brainfuck   that's just the most hilarious place to cut it off in a discussion about censorshi \ 275)   oerjan: Tell us what (a(b{c}d)*2e)%2 expands to <-- ababcdbcdedbabcdbcdede, i think   oerjan: What - the - fuck \ 297)  okay see in my head it went, you send from your other number smth like "i'd certainly
00:26:36  `addquote  `quote themselves   No output.   `quote norway   No output.   `quote lunch   No output.   Useless bot.
00:26:38  718)  `quote themselves   No output.   `quote norway   No output.   `quote lunch   No output.   Useless bot.
00:26:43  `quote themselves
00:26:44  `quote norway
00:26:45  718)  `quote themselves   No output.   `quote norway   No output.   `quote lunch   No output.   Useless bot.
00:26:46  `quote lunch
00:26:47  718)  `quote themselves   No output.   `quote norway   No output.   `quote lunch   No output.   Useless bot.
00:26:48  718)  `quote themselves   No output.   `quote norway   No output.   `quote lunch   No output.   Useless bot.
00:26:58  useful bot
00:27:01  `removequote  `quote themselves   No output.   `quote norway   No output.   `quote lunch   No output.   Useless bot.
00:27:03  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: removequote: not found
00:27:10  `delquote  `quote themselves   No output.   `quote norway   No output.   `quote lunch   No output.   Useless bot.
00:27:11  No output.
00:27:13  `ls bin
00:27:15  ​? \ @ \ addquote \ allquotes \ calc \ define \ delquote \ etymology \ forget \ fortune \ frink \ google \ json \ k \ karma \ karma+ \ karma- \ learn \ log \ logurl \ macro \ marco \ paste \ pastekarma \ pastelog \ pastelogs \ pastenquotes \ pastequotes \ pastewisdom \ ping \ prefixes \ qc \ quote \ quotes \ roll \ runperl \ toutf8 \ translate \ translatefromto \ translateto \ units \ url \ wl \ word \ wtf
00:27:19  oerjan: please kick elliott for spam
00:27:23  also shachaf
00:27:28  Also CakeProphet.
00:27:29  :<  <-- grumpy old man
00:27:30  `quote CakeProphet
00:27:32  141)  how does a "DNA computer" work.  von neumann machines?  CakeProphet, that's boring in the context of DNA.  It's just stealing the universe's work and passing it off as our own. \ 142)  CakeProphet: reading herbert might be enlightening in one hand he held a long worm can be greased. twice i got it nearly there, and the protector of cattle. mars is
00:27:51  oerjan: the idea is basically to turn a tree with a bunch of cursors into a tree of /just/ the cursors, retaining their sort of "relative positions", right?
00:28:03  and those cursors contain the bits of the tree they're focusing on, sort of
00:28:31  yeah
00:28:41    (*)(-.-)(*)(-.-.-.)        *-*
00:28:42                (|)       ->     |
00:28:42        (.-*)(-)(.)(-.-)(*)    *-+-*
00:29:05  let |x| = abs x; o = -5 in |o|
00:29:05                               |
00:29:05                              /<
00:29:07  oerjan: this is a Seq zipper, right?
00:29:12  that's what the previous should become if we move the upper right * cursor one step left
00:29:51  shachaf: one day Haskell will DWIM.
00:29:52  now the middle | Seq line contains -.-.-.
00:29:54  oerjan: (i forgot which structure you were zippering :P)
00:30:16                                  |
00:30:22  dammit
00:30:38  *                                   |
00:30:45  CakeProphet: One day it will DWIM; I dearly hope that the day will never come when it DWYM, though.
00:30:52  zippered finger trees.
00:30:56  oerjan: kick shachaf for interrupting your diagram
00:31:07  CakeProphet: Seq /is/ a finger tree
00:31:09  so there's an actual tree in one of the Seq elements on the way
00:31:14  elliott: /really/?
00:31:16 * CakeProphet gasps.
00:32:34  therefore, hash tables are arrays.
00:33:03  Table#
00:33:15  elliott: i'm zippering a plain unrooted tree, essentially
00:33:22  oerjan: ok
00:33:41  adding labels and typesafeness left as an exercise for the reader >:P
00:33:51  oerjan: when do you get to defining adts >:)
00:34:11  LEFT AS AN EXERCISE FOR THE READER, I SAID
00:34:35  oerjan: :'(
00:34:41  oerjan: Why aren't you in #haskell these days?
00:34:58  dammit, oerjan has roped me into listening to one of his long monologues and getting /nothing/ useful out of it :P
00:34:59 * shachaf checks #haskell.  you mean line this....once oi am on unix command line to do this .....ghci -package gtk ?
00:35:02  Hmm.
00:35:07  *MWAHAHAHA*
00:35:36  oerjan: im going to cry at you now instead of replying to anything you say.
00:35:37  oerjan: cry
00:36:03  Sounds to me, oerjan, like elliott mad
00:36:19  Sounds to me, elliott, like u mad
00:36:26  well there's a sort of dynamicity at the point of mapping back from the collapsed tree to the original which i'm not quite sure how to handle
00:36:53  CakeProphet: ><{{{}::LLKLMH@A;'`hi`1 s
00:37:06  like, to get full typesafeness we'd need some kind of parametric Seq
00:37:39  and with things in a map it might involve actual Dynamic
00:38:14  unsafeCoerce
00:38:23  oerjan: hm do you need an indexed map
00:38:53  oh and it might be necessary to invent id's for the cursors
00:38:54  oerjan: i.e. lookup :: k a -> Map k a -> Maybe a
00:38:57  elliott: Did you see ddarius's puzzle about IORef in #haskell recently?
00:38:58  or similar
00:39:01  shachaf: No.
00:40:01  do { r <- newIORef (return ()); writeIORef r (join (putChar '*' >> readIORef r)); join (readIORef r) }
00:40:20  The puzzle went "where does the recursion come from?".
00:40:27  Or something along those lines.
00:41:39  shachaf: I...
00:41:59  shachaf: It comes from executing the result of reading r depending on the value inside r.
00:42:04  Which it executes.
00:42:08  And so on.
00:42:13  Right, but there's no recursive definition there.
00:42:25  And yet it's non-terminating.
00:42:28  How does that happen?
00:42:31  shachaf: There sort of is; it's using the IORef as a definition.
00:42:32  there's a cyclic structure created by mutation
00:42:40  Yeah.
00:42:53  OK, but why are you allowed to create a cyclic structure?
00:43:09  because IO etc
00:43:17  Well, it works with ST too.
00:43:18  shachaf: As opposed to...?
00:43:22  Can you model this with State, for instance?
00:43:24  because that's easy with IORef?
00:43:42  You can do a mono-typed STRef with State, so yes.
00:43:43  heh
00:43:50  Since only one relevant reference type is used here.
00:44:00  *x = &x    //weeeeeeeee
00:44:04  elliott: OK, can you do it with State, then, without using any recursion?
00:44:53  shachaf: main = runStateT (do { put $ join (liftIO (putChar '*') >> get); join get) (return ())
00:44:54  ?
00:45:06  shachaf: main = runStateT (do { put $ join (liftIO (putChar '*') >> get); join get }) (return ())
00:45:22      Occurs check: cannot construct the infinite type:
00:45:22        m1 = StateT (m1 ()) m0
00:45:22  :-(
00:45:49  Oh.
00:45:53  shachaf: You just need a newtype wrapper.
00:46:01  newtype Foo = Foo (StateT Foo IO)
00:46:03  > runRWS (do put (join (tell "*" >> get)); join get) undefined undefined
00:46:04    Occurs check: cannot construct the infinite type:
00:46:05     m
00:46:05     =
00:46:05     Control.Mona...
00:46:13  elliott: Can you get the IO out of this, please?
00:46:15  :t runRWS
00:46:16  forall r w s a. RWS r w s a -> r -> s -> (a, s, w)
00:46:19 * shachaf should never have brought up IO.
00:46:27  shachaf: What kind of effect do you want, then? Just plain _|_?
00:46:31  Sure.
00:46:43  _|_ without recursion is accomplishment enough. :-)
00:46:56  > undefined
00:46:57    *Exception: Prelude.undefined
00:47:02 * CakeProphet feels accomplished
00:47:06  @slap CakeProphet
00:47:06 * lambdabot karate-chops CakeProphet into two equally sized halves
00:47:12  shachaf: Lesse...
00:47:40  s/sse/ssee/
00:47:47  Anyway, yes, that was recursive. :-)
00:47:59 -!- hagb4rd has quit (Ping timeout: 240 seconds).
00:48:02  shachaf: i think the only reason my RWS version doesn't work is that the state is contained in the monad type, unlike for IO, so it needs a newtype wrapper
00:48:30  otherwise i think it is in spirit the same as the IO one
00:48:46  shachaf: Done.
00:48:52  ewtype Foo a = Foo { unFoo :: State (Foo ()) a }
00:48:52  test = Foo $ do
00:48:52    put $ Foo (get >>= unFoo)
00:48:52    get >>= unFoo
00:48:55  *Main> evalState (unFoo test) undefined
00:48:55  Loading package transformers-0.2.2.0 ... linking ... done.
00:48:58  s/ewtype/newtype/
00:49:05  Well, you're using a recursive newtype.
00:49:21  shachaf: So is IO.
00:49:26  IORefs are just magical.
00:49:49 * elliott isn't sure exactly what you're getting at here.
00:50:22  What's recursive about STRef?
00:50:42  shachaf: ST has a store of STRefs which you instantiate polymorphically to make them include an ST.
00:50:58  shachaf: the problem is that only IO and ST allows you to make state that doesn't show up in the type of the monad
00:50:58  But fine, I'll whip up a version without that.
00:51:21  that is why they don't need a newtype
00:51:27  oerjan: Right.
00:51:37  Actually I can't, I'd need unsafeCoerce I think.
00:51:44  Unless, hmm...
00:51:50  shachaf: But yeah, what is the point actually meant to be?
00:52:27  elliott: maybe Dynamic is sufficient?
00:52:48  oerjan: Hmm, right
00:52:51 * elliott tests
00:54:13      No instance for (Typeable1
00:54:13                         (StateT Dynamic Data.Functor.Identity.Identity))
00:54:14  Hmph.
00:54:17 * elliott newtype
00:55:39      Can't make a derived instance of `Typeable1 (StateT a m)':
00:55:39        `StateT' has arguments of kind other than `*'
00:55:39      In the stand-alone deriving instance for `Typeable1 (StateT a m)'
00:56:03 * elliott makes own monad
00:59:13  shachaf: Done.
00:59:59  shachaf: http://hpaste.org/54087
01:01:44  shachaf: HAPPY NOW?
01:02:07  shachaf: (I note that you can implement Y without explicit value or type recursion using Dynamic too.)
01:02:57  oerjan: SO N-CURSOR ZIPPERS
01:04:10  elliott: I will substitute for oerjan
01:04:13  shachaf: Also, I believe this means you can do recursion with "just" the FFI, and with "just" Chans and forkIO.
01:04:14  so basically like
01:04:17  n-cursor zippers
01:04:19  are like zippers
01:04:22  but with n cursors.
01:05:11  you can even do recursion with "just" recursion.
01:05:26  indeed!
01:05:30  so oerjan, n-cursor zippers
01:05:54  i sense some recursoring
01:07:03  very funny. HELP ME OUT, I AM AT WAR WITH FINNS.
01:07:57  maybe we could do a zipper of the collapsed tree to easily move to the cursor we want to concentrate on >:)
01:08:33  oerjan: :D
01:09:06 -!- tiffany has quit (Quit: nyu~).
01:10:21  then we wouldn't need a dictionary to get back to the original tree.  although we still need some map to tell the path to each cursor.  ouch.
01:11:17  and that map would change as cursors move
01:11:59  especially since the shape of the collapsed tree also can change
01:12:02  oerjan: what, exactly, kind of dictionary do you need?
01:14:17  oh hm.  maybe we could put signposts in the virtual cursor data to tell how to move to another cursor - only the next step, so changes are still local
01:14:37  a zipper of the zipper starts looking sane...
01:15:06  coooool
01:16:31  elliott: http://dl.dropbox.com/u/16495819/lolncursor.png
01:16:32  oh, this would get O(n) in the number of cursors if they're laid out on a line
01:16:35  Nobel Prize plz
01:16:46  oerjan: O(n) to do /what/?
01:17:00  CakeProphet: now tell me how to reposition cursor 3 before cursor 2
01:17:23  do lots of swappy things.
01:17:52  CakeProphet: the cursors are not necessarily ordered in that way.
01:18:06  that's the whole point of this collapsed tree thing
01:18:19 -!- derdon has quit (Remote host closed the connection).
01:18:23  hmmmmmmmm
01:18:26  okay
01:18:59  elliott: to move from one cursor to another if you have to pass all the others, if they're extremes on a line
01:19:16  with the zipper of zipper idea
01:19:35  how do you intend to access the cursors?
01:19:37  oerjan: ah. that's probably not hugely problematic, i think the most number of IPs any funge program has is like 60,000, and that's pathological
01:19:42  random access, sequentially, ????
01:19:47  a few hundred at most is all i care to optimise for
01:19:58  by an identifier, by an index?
01:21:01  CakeProphet: round-robin, for my usecase
01:21:06  ah
01:21:28  well you could just decouple the subsequences...
01:21:32  basically a Seq of zippers.
01:21:37  on the same list.
01:21:51  i'll let oerjan respond to you >:)
01:21:57  oerjan: but anyway, what kind of dictionary /did/ you need?
01:22:37  elliott: at this point, i think you only need dictionaries or something for the signposts
01:22:51  oerjan: I meant to avoid the zipper-zipper inefficiency, but ok
01:22:58  a signpost would tell for each real cursor what direction to go in
01:22:59  oh.
01:23:07  psh Seq of zippers is mad efficient.
01:24:52  so, a virtual cursor node would need to contain some data: a list of adjoining trees without cursors in them, a list of adjoining Seq's to other cursors, and some tag to tell which nearest neighbors are in which relation to each other in the original QuadTree.  and possibly the signpost map.
01:25:36  oh and the adjoining Seq's would of course "end" in cursor-cursors with the zipper zipper idea
01:25:40 -!- augur has joined.
01:25:51  oerjan: ok
01:26:17  also a ref to the mutable 2D array that it can use to mutate the fungespace and move IPs in constant time.
01:26:47  >:>
01:26:48  if you don't do the zipper of zipper idea, you need to handle the collapsed tree in some other way, perhaps using some graph library.
01:27:10  oerjan: ok, stick with zipper of zipper i guess :P
01:27:14  it sounds easier
01:27:19  s/zipper/Seq/
01:27:32 * oerjan swats CakeProphet -----###
01:28:42  WLIIA REPORT AS OF 1x15: Absolute winner is still Wayne Brady with an incredible 3,003,530.5 points. Absolute average episode winner is also Wayne with 250,294.2 points. Logarithmic winner is Ryan Stiles in a come-from behind victory with 82, barely beating out Colin's 80.6. Logarithmic average episode winner for performers appearing in >1 episode is Wayne with 6 log-points per episode.
01:29:05  ?
01:29:16  CakeProphet: I'm watching all of Whose Line is it Anyway and tallying the points.
01:29:28  elliott: clearly Wayne Brady is the best choice for implementation of n-cursor zippers.
01:29:35  Gregor: white people love Wayne Brady.
01:29:49 * shachaf return
01:30:23 * CakeProphet CakeProphet >>= eat soup
01:30:26  erm
01:30:30 * CakeProphet >>= eat soup
01:31:14 * shachaf shachaf shachaf *
01:31:22  Gregor: First, why the heck are you doing that?
01:31:46  Second, :)
01:32:59  pikhq_: As an excuse to watch WLIIA :P
01:33:08  Good reason.
01:34:17  oerjan: go on :
01:34:17  :P
01:34:51  Gregor: the handsome black man is the best to watch.
01:35:00  also Drew Carrey may have a mancrush on him
01:37:03  y :: (Typeable c, Typeable b) => (b -> c) -> c
01:37:07  shachaf: My fixed-point combinator is swell.
01:37:51  swellest
01:38:01  the basic NW, NE, SW, SE, FromNW, FromNE, FromSW, FromSE directions from QuadTrees still apply to all of this, i think.
01:38:12 * CakeProphet >>= eat soup >>= feelMMM
01:38:15  mmm
01:38:18  mmm
01:38:20  oerjan: ok
01:39:25  a cursor cursor would go in one of those.  if one of the four first, it would be sort of like a QuadTree, if one of the four latter, like a Cursor in our previous discussions
01:39:50 -!- augur has quit (Remote host closed the connection).
01:41:19  there would be two types of such, those with a (virtual) cursor at the other end, and those without.  the latter would actually _be_ QuadTrees and Cursors of our previous talks.
01:41:26  oerjan: I think you guys are overcomplicated this..
01:41:50  CakeProphet: present your solution or shut up and stop butting in :P
01:41:55  the former would contain a Seq, a new direction, and a virtual cursor node.
01:42:16  OMG, owcc is SO FRIGGIN' SLOW
01:42:32  the terminology of this is definitely going to hell.
01:42:35  elliott: Lest you're not up to date: x86[_64], SPARC, MIPS[el]
01:42:42  Not as big a list as I'd like :(
01:42:55  Gregor: I was up to date. Make it work on ARM and PPC. :p
01:42:55  Also, tcc seems to exclusively generate retarded function prologues.
01:42:57  oerjan: yes, quite
01:43:04  oerjan: maybe some ADT definitions would help >:)
01:43:13  also, in principle we would want type parametrized Seq's so we could actually keep things typesafe
01:43:35  elliott: With -O2: 7b:       81 ec 00 00 00 00       sub    $0x0,%esp
01:44:02  elliott: what I had in my diagram. just do swappy stuff when you need to rearrange cursors.
01:44:11  CakeProphet: What the fuck is "swappy stuff"?
01:44:33  if that's too inefficient, just do a Seq/container-of-preference of zippers because.
01:44:41  some kind of PSeq f a b which is a chain of f a c1, f c1 c2, ..., f cn b
01:44:55  elliott: Swell as in unsafeCoerce?
01:45:04  shachaf: Nah, the next best thing.
01:45:05  f would be a gadt, i think
01:46:07  elliott: Dynamic = unsafeCoerce.
01:46:37 * oerjan is worried that part needs ContextKinds
01:46:44  er
01:46:50  *ConstraintKinds
01:47:27  elliott: rearrange the cursors so they're in order, concat and move stuff around. profit.
01:48:08  if what's between two cursors isn't relevant, just do the Seq of zippers. that's more efficient.
01:49:16  y :: forall a. (Typeable a) => (a -> a) -> a
01:49:16  y f = fromDyn' (magic (toDyn magic))
01:49:16    where magic :: Dynamic -> Dynamic
01:49:16          magic x = toDyn (f (fromDyn' (dynApp x (toDyn x))))
01:49:19  shachaf: It doesn't work :-(
01:49:44  CakeProphet: A Seq of zippers doesn't let you mutate, which is the whole bloody point.
01:49:58  elliott: Why are you using Dyn instead of just recursive types?
01:50:01  elliott: but assuming the cursors are IPs then I'm guessing they only move around in increments of 1?
01:50:13  shachaf: To prove you can do fix without type or value-level recursion.
01:50:21  CakeProphet: I really can't be bothered explaining this to you?
01:50:21  By using unsafeCoerce.
01:50:31  shachaf: Yes, except it's safeCoerce.
01:51:14  @let safeCoerce :: a -> a; safeCoerce x = unsafeCoerce x
01:51:16   Defined.
01:51:48  > safeCoerce 5
01:51:54    mueval: ExitFailure 1
01:51:54   mueval-core: Time limit exceeded
01:51:56  lambdabot.....
01:52:15  > safeCoerce 5
01:52:15  :t safeCoerce
01:52:17  forall a. a -> a
01:52:17    5
01:52:25  @src safeCoerce
01:52:28  Source not found. Are you on drugs?
01:52:35 * oerjan facepalm
01:52:40  cake "whats paying attention" prophet
01:53:04  whats paying attention?
01:53:16  oh no......
01:54:00  I often make fools of yourself.
01:54:14  yes
01:54:48  monqy avoids making fools of yourself by only talking when he is not a fool.
01:54:53  good strategy.
01:55:57  monqy is never fool
01:59:09  therefore monqy only talks.
02:01:38  Gregor "unrelated" Richards
02:03:53  HEYO
02:04:05  O YEH
02:04:10  The very first instance of Scenes from a Hat (in spite of it being a staple of the show) is in the 16th episode.
02:05:18 -!- CakeProphet has changed nick to RogerG\unhere.
02:05:39  bye roger g
02:06:32  Argh, how do I stop making owcc do semi-clever inter-procedural optimization >_>
02:07:34  does owcc have -O0
02:07:44  Gregor: write inefficient code.
02:07:50  and it will negate the effect.
02:08:02  don't have procedures
02:08:29  Have enough procedures that owcc overflows something.
02:09:01 -!- Slereah_ has joined.
02:10:40 -!- Slereah has quit (Ping timeout: 255 seconds).
02:10:51  monqy: Doesn't work with -O0 because it generates subl $0, %esp
02:11:35  Gregor: ...
02:11:46  pikhq_: Yup.
02:12:04  owcc...
02:12:24 -!- RogerG\unhere has quit (Ping timeout: 252 seconds).
02:12:36  bye roger g
02:13:17  monqy: OpenWatcom.
02:13:42  Oklahoma Workers' Comensation Court
02:14:04  Old Whitgiftians Cricket Club          good
02:15:08  The code it produces for MS-DOS executes very fast[citation needed]. It was one of the first compilers to support the Intel 80386 "protected mode"[citation needed].
02:15:11  thanks wikipedia
02:15:59  It's ye old Watcom compiler, GPL'd.
02:21:37  OK, so far nothing but gcc can make my JIT work X-P
02:21:41  Everything else is SO CLOSE and yet so far.
02:21:47  Compiler suggestions?
02:22:19  tcc?
02:22:32  If you can compile it with otcc even better.
02:22:49  tcc always generates subl $0, %esp
02:22:57  otcc likewise? :(
02:23:03  Haven't tried it.
02:23:12  It probably does.
02:23:21  Seeing as it's what tcc came from.
02:23:42  Still, it'd be pretty spiffy to compile with a previous entry to IOCCC.
02:24:59  True ...
02:25:17  I wonder if with sufficient cleverness I could do epilogue detection only and leave in the prologues and partial epilogues for everything ...
02:25:53  OR I could be REALLY stupid and just assume that your epilogue is either one or four bytes and no other size :P
02:28:20  Nope, wouldn't work on SPARC :P
02:29:32  (Or anything else with delay branches ... )
02:33:24  BUT, if I assume that on all CISC platforms (all one of them), I may be in luck.
02:41:19  HEYOOOOO
02:43:14  OpenWatcom :)
02:43:29  And probably TCC
02:47:09  Gregor: By doing what
02:52:28  Yup, works on TCC too :)
02:52:33  elliott: Making my heuristics much more stupid.
02:52:40  lol
02:52:50  elliott: On platforms I determine to be CISC, I blindly assume the epilogue is always one byte and the prologue is zero.
02:55:16 -!- MDude has changed nick to MSleep.
02:57:07 -!- calamari has joined.
02:57:23  Gregor: How do you determine ciscness?
02:57:34  elliott: Odd-sized functions.
02:57:45  That's it?
02:57:46  Yup
02:58:12  I'm not exactly aiming for coding perfection here :P
02:58:13  an odd heuristic
02:58:26  oerjan: AND YET: It works :)
02:59:21  oerjan: ADTS PLZ
02:59:37  i knew i'd regret that pun
03:02:50  And now to lament the lack of -mbuild-constants for ARM :(
03:14:33  oerjan: :|
03:14:42  it's tricky
03:14:53  pah :P
03:15:29  oerjan: btw the space is actually finite
03:15:39  (Int32,Int32)-indexed
03:16:03 -!- pikhq has joined.
03:16:09  ic, well that's just having some top node
03:16:12 -!- pikhq_ has quit (Ping timeout: 260 seconds).
03:17:06  yeah
03:17:20  not like you can allocate that much anyway
03:17:33  so might as well just leave it out
03:18:30  data MetaCursor srcdir = MCPlain (PlainCursor srcdir) | forall dest. MCPath (MetaPath src dest) MetaNode dest
03:18:48  ooh, that looks cool
03:19:53  oerjan: s/srcdir/src/g right?
03:20:00  oh hm
03:20:11  or the reversze
03:20:14  *-z
03:20:29  then you vneed to rename dest >:)
03:20:33  gah
03:20:34  src is nicer anyway
03:21:34  data FromNW; data FromNE; data FromSW; data FromSE; data NW; data NE; data SW; data SE -- src and dest should be one of these
03:22:08  ok
03:25:35  PlainCursor From{NW,NE,SW,SE} is basically our old Cursor and PlainCursor {NW,NE,SW,SE} is a QuadTree, i think
03:25:57  gadts then :P
03:26:00  yeah
03:26:16  i forget our old cursor but i'll look it up when i need it
03:26:32  *(MetaNode dest)  -- forgot parens above
03:26:37  Aaah, earl grey.
03:27:56  oerjan: btw just out of curiosity, does it help optimise the metazipper thing if you know i always access cursors in round-robin
03:28:17  not round-robin in order of space; in order of creation
03:28:24  ic
03:28:47  OK, I may have this working on ARM, and only 85% incurably stupid.
03:29:15  oerjan: i'll shut up :)
03:29:56  that means you basically wants CakeProphet's Seq of zippers in ther somehow ;P
03:30:05  *+e
03:31:27  might as well just continue as-is :P
03:32:11  MetaNode dest  represents a node containing a virtual cursor, with incoming edge as dest
03:32:20  Damn it, now how did this break on MIPS >_>
03:33:24  oerjan: ok
03:34:18  oh hm
03:34:21 -!- augur has joined.
03:35:11  MNFromNW :: { neNeighbor :: MetaCursor NE, ... but what should be the _up_ cursor...
03:35:53  i think it needs to be split. ah!
03:36:12  data From; data To; data NW; ...
03:36:34  :D
03:36:48  oerjan: From dir
03:36:53  and To dir
03:36:56  no
03:37:00  ?
03:37:07  oh well maybe
03:37:17 -!- augur has quit (Remote host closed the connection).
03:37:33  i was thinking of them as separate arguments, but i guess that works too
03:38:09  ah
03:39:33  MNFromNW :: { neNeighbor :: MetaCursor (To NE), swNeighbor :: MetaCursor (To SW), seNeighbor :: MetaCursor (To SE), up :: MetaCursor (From dir), signPost :: SignPost } -> MetaNode (From NW)
03:39:57  not sure that's the right syntax
03:40:19  i think its {a::b} -> {c::d} -> ...
03:40:25  but i prefer yours :)
03:40:28  oh
03:42:50  MNToNW :: { ... like above but with all five neighbors and no up }
03:42:57  oh hm
03:43:02  obviously then
03:43:20  what is dir in MNFromNW
03:43:21  MNTo :: { ... } -> MetaNode (To dir)
03:43:28  ah
03:43:50  NW then
03:43:56  it doesn't need a different constructor for different ones on the To
03:44:03  *MNTo
03:45:11  the dir in the up field of MNFromNW is arbitrary, since we don't know which direction this node is from the up node
03:45:22  oerjan: you mean all 4 neighbours right?
03:45:25  and ah
03:45:28  oops :P
03:47:47  elliott: So yeah, +ARM anyway :P
03:48:10  Gregor: +ARM-MIPS
03:48:23  elliott: I'm fixin' MIPS :P
03:49:18  MetaPath src dir is tricky.  it should be a chain of, hm, PathNode s d, using some kind of Seq which _ideally_ would be parametrized such that only consecutive PathNodes need to match in types
03:50:43  does that really matter for internals? :
03:50:45  :P
03:50:46  oh and it should probably have a tag so you could consider one as "reversed", for when you "metazip" around it
03:51:04 -!- augur has joined.
03:51:42  without needed to _actually_ traverse and reverse the pathnodes
03:51:45  *needing
03:51:50  right
03:52:24  well if you don't do that then of course the typesafe directions break down inside these paths.
03:52:33  hm right
03:52:39  go ahead, then :P
03:52:55  (i am simply assuming the existence of such a Seq)
03:53:20  which i think i called PSeq above
03:54:26  data MetaPath src dir = MP (PSeq PathNode src dir) | MPReversed (PSeq PathNode dir seq)
03:54:35  ok
03:55:08  the reversing thing might be better to put into pseq itself but never mind that for now...
03:55:58  well i was just assuming a PSeq which did the minimal change to Seq to make it parametric
03:56:15  right
03:56:30  hm...
03:56:46  s/seq/src/ :p
03:57:06  oops
03:59:02  PN_ToNW_ToNW :: { neNeighbor :: PlainCursor (To NE) } -> { swNeighbor :: ... } -> { seNeighbor :: ... } -> PlainNode (To NW) (To NW)
03:59:44  similarly for PN_To**_To**
03:59:55  ok. (i preferred the previous syntax :P)
04:00:31  PN_To**_From** is illegal
04:01:02  elliott: I officially have no clue why MIPS is broken :P
04:01:39  PN_FromNW_FromNW :: { neNeighbor :: ..., swNeighbor :: ..., seNeighbor :: ... } -> PlainNode (From NW) (From NW)
04:02:01  same arguments, actually, it's conceptually the reversed version of the first one
04:02:30  and so PN_From**_From** in general
04:03:39 -!- madbr has joined.
04:03:47  PN_FromNW_ToNE :: { swNeighbor :: PlainCursor (To SW), seNeighbor :: PlainCursor (To SE), up :: PlainCursor (From dir) } -> PlainNode (From NW) (To NE)
04:04:07  and PN_From**_To** in general, except not with the two directions equal
04:04:22  i think that's all for PlainNode
04:06:30  back, sorry
04:06:42  SignPost would be a map whose keys are real cursors and whose values are Maybe Direction
04:06:56  oerjan: re: to/from, couldn't you have ... -> PlainNode (tofrom NW) (tofrom NW) >:)
04:07:01  just kidding >_>
04:07:18  AAAAAAAAAAAAAAAAAAAAAA
04:07:37  Direction would be a value form of the To dir, From dir things.
04:07:44  right
04:08:05  oerjan: (more seriously, it seems to me like a type AllDirectionsBut wrapper dir would cut down on lots of duplication)
04:08:32  maybe.  note that the PN_From**_To** miss _two_ directions.
04:08:37  ah
04:08:45  what's a real cursor? the previous Cursor? PlainCursor?
04:09:32  your ip id, i think
04:09:43  oerjan: oh, so just an identifier? ok
04:10:01  and a value of Nothing indicates that it's at _this_ node
04:10:14  oerjan: (i am half-considering putting the rest of the IP data into this structure, since it's basically tracking my IPs anyway...)
04:10:16  while Just dir indicates where to start going to find it
04:10:51  ah in that case you could use Either IpData Direction for the values, i guess
04:10:57  right
04:11:11  i am shocked to find myself actually understanding all this.
04:11:21  yay
04:11:48  elliott: It's some weird interaction between unconditional jumps and conditional jumps >_O
04:13:17  oerjan: i thought i had lost all hope of understanding after last time's 15 constructors :D
04:13:26  :P
04:14:24  elliott: AHAAAAAAAAAAAAA scratch registers boo.
04:14:35  oops, s/PlainNode/PathNode/g in some of the above
04:14:46  oerjan: oh. now it makes even more sense!
04:15:15  yay
04:15:26  oerjan: er, that's not it, right?
04:16:04  i think PathNode has 44 constructors.
04:16:11  lol
04:16:28  elliott: s/scratch/argument/ in fact :P
04:16:36  Gregor: heh
04:16:52  oerjan: i will probably try and abstract that out so it only needs one constructor per valid to/from pai :P
04:16:52  r
04:16:54  i suppose your AllDirectionsBut is a must
04:16:57  but yes, go on
04:17:17  well, i think that's most of it?
04:17:55  hm
04:18:14  elliott: Fixt.
04:18:20  oerjan: if I asked you how to implement "go west in currently-focused cursor" would you disown me?
04:18:48  maybe if you insisted on all the details
04:19:25  heh
04:19:31  oerjan: you navigate between cursors /spatially/ in this, right?
04:19:37  that seems to make navigating in some other order a pain
04:19:54  well yeah?
04:20:26  oerjan: well like i said, my IPs are used round-robinly :P
04:21:01  well yeah i didn't do any attempt to optimize that order
04:21:19  or any order, really
04:21:27  oerjan: right
04:21:34  oerjan: but i'm not sure how you do it at /all/
04:21:42  it seems like you'd have to try every cursor until you found the one you care about
04:25:05  data MetaContext = MetaContext { nwNeighbor :: MetaCursor (To NW), ..., up :: MetaCursor dir, signPost :: SignPost } -- it occurs to me that some field name disambiguation will be needed
04:25:20  anyway, say that's the current focused context
04:25:46  first, look in the signPost to find out where the ip you want to be at is
04:26:17  if it's here, you're set...
04:26:24  ah! right
04:26:30  OK, that makes sense now
04:26:37  how do you go east >:)
04:27:34  hm assuming you're focused at the ip...
04:27:41  look at the up
04:28:10  oerjan: btw i am not looking forward to figuring out how to mutate within the 128x128 area :P
04:28:20  I think I'll have to just check every other IP
04:28:31  I don't really want to add caches to a structure this complex
04:28:35  erm, as in
04:28:38  because other IPs could be there too
04:28:50  assuming that's actually possible with yours...
04:29:14  ah
04:30:45  oh hm
04:31:12  i have not properly considered the actual _leaf_ nodes, where the 128x128 data would reside
04:31:34  well except for the PlainCursor ones, but they don't contain real cursors
04:31:46  so we have a zipper for trees with no top or bottom? :P
04:35:59 -!- madbr has left.
04:36:10  elliott: ARM goes all the way up to -O3 (with -fno-toplevel-reorder)
04:36:19  X-D
04:37:02  MNLeaf :: { area :: Array "whatever", signPost :: SignPost } -> MetaNode (To dir)
04:37:14  may be what is needed
04:37:23  Array "whatever"
04:37:25  good array
04:37:33  best array
04:37:46  oerjan: ok so what if i actually put this into a file and tried to make it all typecheck :P
04:38:14  well as i said i have not kept all field names distinct between data types, so fix that :P
04:39:40  oerjan: ok [CRACKS KNUCKLES, PUTS BASEBALL CAP ON BACKWARDS, STARTS UP EMACS, CHEWS ON GUM, DISOWNS AUTHORITY + PARENTS] time to ROCK!!!!!!
04:39:43  i am such a serious person
04:39:54  http://thc.org/root/phun/unmaintain.html
04:39:56  either that
04:40:02  or write all your code in INTERCAL
04:40:47  oerjan: so wait, are plain [NW][SE] ever used, or is it always within either From or To now?
04:41:41  er
04:41:44  [NS][EW]
04:41:48  elliott: I can't get IOCCC 2001 bellard to run :(
04:41:59  Gregor: Surprising :P
04:42:11  i cannot recall
04:42:31  oerjan: oh you actually got the gadt record syntax almost right
04:42:33  oerjan: Foo { ... } :: A
04:42:50  ah
04:42:51   PlainCursor From{NW,NE,SW,SE} is basically our old Cursor and PlainCursor {NW,NE,SW,SE} is a QuadTree, i think
04:43:02  oerjan: does that still use plain directions or is the QuadTree case in a To?
04:43:11  in a To
04:43:40  oerjan: ok. now to find your old Cursor :P
04:43:40  so you don't need to list all
04:43:47  unless you recall it :P
04:44:35  well it should be very similar to MetaNode
04:44:50  MetaNode (From ...)
04:44:50  Nov 14 03:03:10 data QuadCursor t = FromNorth { southChild :: t, eastChild :: t, westChild :: t, up :: QuadCursor (QuadBranch t) } | FromSouth ...
04:44:58  oerjan: is it just that but with NW/SE etc. instead of North/South?
04:45:27  that first one was in error, i corrected it to NW/SE later
04:45:56  well not _exactly_ that, it's all gadts now :P
04:47:07 -!- calamari has quit (Quit: Leaving).
04:47:53  PCFromNW { neNeighbor :: PlainCursor (To NE), swNeighbor :: ..., seNeighbor :: ..., up :: PlainCursor (From dir) } -> PlainCursor (From NW)
04:48:41  PCLeaf :: { area :: Array "whatever" } -> PlainCursor (To dir)
04:48:46  something like that
04:48:50  oerjan: i'm on to PathNode, FWIW
04:49:07  ok
04:49:14  oerjan: wait, what happened to the QuadTree case?
04:49:32   PlainCursor From{NW,NE,SW,SE} is basically our old Cursor and PlainCursor {NW,NE,SW,SE} is a QuadTree, i think
04:49:54  PCTo :: { neNeighbor :: ..., ... } -> PlainCursor (To dir)
04:50:05  would be that and PCLeaf
04:50:11  "However, for GADTs there is the following additional constraint: every constructor that has a field f must have the same result type (modulo alpha conversion)"
04:50:16  boo, I need different field names for each signpost
04:50:20  oerjan: ah, ok
04:50:27  darn :(
04:51:00  that sounds most annoying
04:51:10  oerjan: is PCTo just PlainCursor (To dir) for each dir?
04:51:31  also, I need a name for (From dir)/(To dir), like dir is for all the directions. origin?
04:51:31  um yes
04:51:56  oerjan: not From? ok
04:52:27  i gave PCFromNW above, the rest of the Froms should be like that.
04:52:32  right
04:53:25  oerjan: oh hm. (From foo)/(To foo) are directions
04:53:29  it's the foos that need a name
04:53:34  I...think?
04:53:37  help :
04:53:38  :(
04:53:48  no, NW/SE/NE/SW are definitely directions, so I do need a name
04:54:11  heh
04:55:13  oerjan: quick, name (From dir)/(To dir) :-(
04:56:18   Direction would be a value form of the To dir, From dir things.
04:56:27  aaaaargh, you've been calling both of them directions all this time
04:56:31  oerjan you're awful :( but uh thanks
04:56:34  pretty much
04:57:09  oerjan: come on come on gimme a name gimme a name :(
04:57:21  Exit
04:57:30  ok
04:58:44  oerjan: woo, just PathNode to go
04:59:30  oerjan: hm MetaContext is new, right?
04:59:39   MNLeaf :: { area :: Array "whatever", signPost :: SignPost } -> MetaNode (To dir)
04:59:45  oerjan: er is this required as well as the leaf in PlainCursor?
05:01:21   PN_ToNW_ToNW :: { neNeighbor :: PlainCursor (To NE) } -> { swNeighbor :: ... } -> { seNeighbor :: ... } -> PlainNode (To NW) (To NW)
05:01:21   similarly for PN_To**_To**
05:01:25  oerjan: the **s here have to be equal, right?
05:02:52  agh
05:02:54   PN_FromNW_FromNW :: { neNeighbor :: ..., swNeighbor :: ..., seNeighbor :: ... } -> PlainNode (From NW) (From NW)
05:03:02  oerjan: and are these PlainCursor (To ...)s or PlainCursor (From ...)s?
05:03:04  the neighbours, that is
05:03:19  elliott: yes, MNLeaf is for a leaf that is a virtual cursor
05:03:35  (which means it's a real one, if you don't have extraneous virtual ones)
05:03:39 -!- SgeoN1 has quit (Read error: Connection reset by peer).
05:03:58 -!- SgeoN1 has joined.
05:04:11  no, the **s don't have to be equal
05:04:48  they are PlainCursor (To ...)'s
05:04:51  data PathNode src dest where
05:04:51    PNToTo :: PlainCursorTosWithout2 a b -> PathNode (To a) (To b)
05:04:51    PNFromFrom :: PlainCursorTosWithout2 a b -> PathNode (From a) (From b)
05:04:51    PNFromTo :: PlainCursorTosWithout2 a b -> PlainCursor (From dir) -> PathNode (From a) (To b)
05:04:52  there, I think
05:06:11  note that PNFromTo should have a /~ b
05:06:40  oerjan: ... you realise expressing that constraint is a pain :P
05:06:49  thankfully possible since we only have four directions...
05:07:01  yeah, you may consider it optional
05:07:27  oerjan: hm would it be more convenient as a class constraint on the constructor, or as an actual type
05:07:34  where the latter is a GADT
05:07:38  with the obvious constructors
05:07:52  (i'm thinking, for the operations on these)
05:10:12  oerjan: ooh, convenient, all the "...s without dir" use (To dir) as the type argument >:)
05:10:25  oerjan: ...i feel really bad about wanting to exploit this, but it's sort of integral to the nature of a neighbour right?! reassure me
05:15:44  oerjan: um ok i need guidance
05:15:52  oerjan: it would be really bad to save on constructors by having
05:15:56  hm?
05:16:02  Foo :: NeighboursWithout2 t a b -> NeighbousrWithout2 t b a
05:16:03  right? :p
05:16:09  usage-wise
05:17:11  oerjan: right?? :'(
05:17:21  i already have
05:17:22    Neighbours2Same :: Neighbours1 t dir -> Neighbours2 t dir dir
05:17:23  :p
05:18:04  i think my brain is a bout fried for today
05:20:01 -!- oerjan has quit (Quit: Good night).
05:20:13  psht!
05:21:38 -!- copumpkin has joined.
05:24:43  $ wc -c jitchards.c
05:24:43  1984 jitchards.c
05:25:18  Best filesize.
05:28:37 -!- nys has quit (Quit: night).
05:39:50  elliott: Did you ever answer my question about cookies?
05:39:58  Which question?
05:40:00  Oh, that lambdabot one?
05:40:08  They're certainly not UK-cookies.
05:40:26  Do they exist in the UK?
05:41:13  I've never come across one? I don't know that they don't, though.
05:41:20  "Fortune cookies, while largely an American item, are occasionally seen in other countries, most often at Chinese restaurants. Fortune cookies have been distributed in Canada, the United Kingdom, Australia, New Zealand, India, Brazil, Mexico, France, The Netherlands and Germany."
05:41:39  fortune cookies are weird
05:41:46  I don't like them
05:42:07  monqy: theyre ghosts (boo)
05:42:18  :o
05:43:08  Gregor: BTW, if all goes horribly wrong you might get an actual UMLBox user soon.
05:43:19  Gregor: I've suggested it to the tup developer to solve a certain problem and he thinks it looks promising :P
05:51:58  Hey shachaf! I'm going to make you look in the other direction again.
05:51:59  *PSeq> :t pfoldr
05:52:00  pfoldr
05:52:00    :: (forall a b c. path a b -> result b c -> result a c)
05:52:00       -> (forall a. result a a)
05:52:00       -> PSeq path src dest
05:52:00       -> result src dest
05:52:05  Brought to you by the Power of unsafeCoerce(tm).
05:52:30  elliott: Beeping me in IRC has approximately the opposite effect, as you are well aware.
05:52:46 * shachaf is now blind.
05:52:47  Yes, but it lets you know so that you can look away more /intentionally/.
05:53:08  *PSeq> :t pfoldr (<|) empty
05:53:08  pfoldr (<|) empty :: PSeq path src dest -> PSeq path src dest
05:53:08  Wow, it actually works.
05:53:09 * shachaf doesn't know the context of elliott's type.
05:53:30  Hmm, why don't Seqs have pfoldfromtheend?
05:53:35  Er, without the p.
05:53:45  elliott: However, using type variable names longer than a single character is very unHaskelly of you.
05:54:35  shachaf: Yeah, I got tired of it being unreadable. :-(
05:54:51  data PViewL path src dest where
05:54:51    PEmptyL :: PViewL path a a
05:54:51    (:<) :: path src mid -> PSeq path mid dest -> PViewL path src dest
05:54:51  It's pretty much sacrilege.
05:55:11 * shachaf wonders what elliott is doing but doesn't want to read backlog.
05:55:23  haskellworldproblems, eh?
05:55:43  shachaf: (PSeq path src dest) is basically (path src a, path a b, path b c, path c d, path d dest).
05:55:49  shachaf: Except an arbitrary number of those, obviously.
05:55:56  And it's a Seq, so fast access from the end too.
05:56:22  shachaf: It's used in oerjan's fancy n-cursor quadtree zipper construction.
06:07:11  shachaf: ENJOY: http://hpaste.org/54095
06:07:21  "is this correct?" -- yes it is, I'm an idiot.
06:11:28  there are two esolangs on the wiki named 'clue' but neither has to do with Clue/Cluedo
06:11:50  one should be made, where all legal syntax is of the form 'X, in the Y, with the Z'
06:12:15  would it do anything interesting
06:12:45  oh man what if it was an really verbosse brianfuck derivative
06:12:57  equivalent
06:13:23  monqy: :-(
06:13:26  thing in the thing with the thing -> a brainfuck comand,. depending on what the things are....
06:13:38  elliott: Look at what DCliche and monqy is doing.
06:13:40  s/is/are/
06:13:48  shachaf: monqy is On Our Side, don't you worry.
06:13:53  He is a True Patriot.
06:13:56 * shachaf isn't sure what Our Side is.
06:14:01  true patriots side
06:14:07 * shachaf is not a true esolanger.
06:14:10  Well, we don't like brainfuck derivatives much, I would suppose.
06:14:17  I was imagining one or more of them could be variables
06:14:25  The most esoteric language I know is, like, Haskell, man.
06:14:29  perhaps being vaguely similar to SPL
06:14:38  is haskell esoteric.........
06:14:42  Fine, C++.
06:15:42  monqy: (I didn't say it was, anyway.)
06:15:51  @tell Phantom__Hoover Check your lambdabot mail as Phantom_Hoover.
06:15:52  Consider it noted.
06:15:55  @tell Phantom_Hoover Say the following to lambdabot, please:
06:15:55  Consider it noted.
06:16:28  what does it take to know c++? (I may or may not know c++.)
06:16:30  @tell Phantom_Hoover @tell elliott Hey, you should try and coerce the GHC API into doing that hole-checking thing sometime. By sometime, I mean now; past you gets to decide exactly when you do things, those are the rules.
06:16:30  Consider it noted.
06:16:42  Behold my @tell-myself-without-getting-lambdabot-to-bug-me-immediately-after mechanism.
06:17:13  phantom_hoover best mechanism
06:17:27  phantom "best mechanism" hoover
06:17:39  Phecanism.
06:18:01  elliott: I doubt you're going to do it as soon as you get that message.
06:18:06  So you might as well not have done it at all.
06:18:22  shachaf: The idea is mostly so that I don't forget about it.
06:18:31  @tell elliott Hey, you should try and coerce the GHC API into doing that hole-checking thing sometime. By sometime, I mean now; past you gets to decide exactly when you do things, those are the rules.
06:18:31  Consider it noted.
06:18:37  No.
06:18:38  elliott: You have 1 new message. '/msg lambdabot @messages' to read it.
06:18:42  See what you did?
06:19:23  @tell elliott Hey, you should try and coerce the GHC API into doing that hole-checking thing sometime. By sometime, I mean now; past you gets to decide exactly when you do things, those are the rules.
06:19:23  Consider it noted.
06:19:30 * shachaf decides to stop.
06:19:32  @tell shachaf u mad
06:19:32  Consider it noted.
06:19:33  @tell shachaf u mad
06:19:33  @tell shachaf u mad
06:19:33  @tell shachaf u mad
06:19:33  Consider it noted.
06:19:33  @tell shachaf u mad
06:19:33  Consider it noted.
06:19:33  @tell shachaf u mad
06:19:34  Consider it noted.
06:19:34  Consider it noted.
06:19:34  Consider it noted.
06:19:38  ENJOY, FRIEND
06:19:38  elliott: You have 1 new message. '/msg lambdabot @messages' to read it.
06:19:42  NOOOOOOOOOO
06:19:44  @messagse
06:19:47  @messages
06:19:48  Maybe you meant: messages messages?
06:19:52  shachaf said 24s ago: Hey, you should try and coerce the GHC API into doing that hole-checking thing sometime. By sometime, I mean now; past you gets to decide exactly when you do things, those are
06:19:52  @messages
06:19:54  the rules.
06:19:56  You don't have any new messages.
06:20:04  Fine, fine I get it.
06:20:05  the rules.
06:20:22   @remember monqy the rules.
06:20:32  @remember monqy the rules.
06:20:32  I will remember.
06:20:43  @forget monqy the rules.
06:20:44  Done.
06:20:45  @quote monqy
06:20:45  Plugin `quote' failed with: getRandItem: empty list
06:20:47  @quote monqy
06:20:47  Plugin `quote' failed with: getRandItem: empty list
06:20:51  @quote ehird
06:20:51  ehird says: 2009: The Year of the Combinatorial Explosion of Haskell Web Frameworks. Also, the Linux Desktop.
06:20:53  @remember monqy the rules.
06:20:53  It is forever etched in my memory.
06:21:04  @quote ehird
06:21:05  ehird says: 2009: The Year of the Combinatorial Explosion of Haskell Web Frameworks. Also, the Linux Desktop.
06:21:09  @quote elliott
06:21:09  elliott says: Only two things in the universe are certain: Death, and two of the libraries you've decided to use taking different types of ByteString.
06:21:12  @quote elliott
06:21:13  elliott says: i'm here to prove theorems and compile code and I'm all out of code
06:21:15  @quote elliott
06:21:15  elliott says: I have weird mental spheres that I divide all my coding into and that determine editor and the like
06:21:21  What?
06:21:23  @quote elliott
06:21:23  elliott says: Top universities now employ people to watch infomercials all day to find the latest mysteries.
06:21:26  @quote elliott
06:21:27  elliott says: Only two things in the universe are certain: Death, and two of the libraries you've decided to use taking different types of ByteString.
06:21:32  I have a lot of quotes.
06:21:38  @quote monqy
06:21:39  Plugin `quote' failed with: getRandItem: empty list
06:21:47  @quote Darth_Cliche
06:21:47  No quotes match.
06:21:49  @remember monqy the rules.
06:21:49  It is forever etched in my memory.
06:21:53  shachaf is a bad man.
06:21:55  @quote DCliche
06:21:56  No quotes match. Maybe if you used more than just two fingers...
06:22:09  @quote monqy
06:22:10  Plugin `quote' failed with: getRandItem: empty list
06:22:14  the rules...
06:22:36  @remember monqy the rules.
06:22:36  I will remember.
06:22:37  @quote monqy
06:22:37  monqy says: the rules.
06:22:48  the rules.
06:22:50  @tell Phantom_Hoover Remind me to "@remember monqy the rules." because shachaf is a bad person.
06:22:50  Consider it noted.
06:22:57  :-(
06:22:58  @remember elliott @remember @remember @remember
06:22:59  I will never forget.
06:23:00  @remember elliott @remember @remember @remember
06:23:00  I will remember.
06:23:01  @remember elliott @remember @remember @remember
06:23:01  Good to know.
06:23:02  @remember elliott @remember @remember @remember
06:23:02  Okay.
06:23:05  okay
06:23:05  @quote elliott
06:23:05  That...
06:23:06  elliott says: @remember @remember @remember
06:23:08  No.
06:23:12  @forget elliott @remember @remember @remember
06:23:12  Done.
06:23:23  /nick Phantom_Hoover; /msg lambdabot @messages
06:23:28  elliott: Well, you keep spamming @remember
06:23:35  @forget elliott @remember @remember @remember
06:23:36  Done.
06:23:37  @forget elliott @remember @remember @remember
06:23:37  Done.
06:23:38  @forget elliott @remember @remember @remember
06:23:38  DCliche: shachaf keeps spamming @forget. In PRIVATE.
06:23:39  Done.
06:23:47  elliott: That ain't spamming!
06:23:50  elliott: Not as annoying as publically ;p
06:24:03  @forget DCliche
06:24:03  Incorrect arguments to quote
06:24:07  @forget DCliche forever
06:24:07  No match.
06:24:27  @quote shachaf
06:24:27  shachaf says: We used to have a big collection of them but most of them got wiped in the Great Lambdabot Wipe of Every Few Months.
06:24:33  @quote elliott
06:24:34  elliott says: Top universities now employ people to watch infomercials all day to find the latest mysteries.
06:25:31  @quote monqy
06:25:31  Plugin `quote' failed with: getRandItem: empty list
06:25:44  shachaf you are scum.
06:25:47  AND I AM LEAVING.
06:25:51 -!- elliott has quit (Quit: Leaving).
06:26:01  Aw, and I was about to start singing.
06:26:14  scum songs
06:26:22 -!- elliott has joined.
06:26:26  hi
06:26:30  monqy and the rules. monqy and the rules. It's monqy, it's monqy and the rules rules rules rules...
06:26:40  NOTE TO SELF:
06:26:41  newtype SupplyT s m a = SupplyT { unSupplyT :: (forall r. (s -> SupplyT s m r) -> SupplyT s m r) -> m a }
06:26:45 -!- elliott has quit (Client Quit).
06:26:48  bye
06:27:01  @tell elliott newtype SupplyT s m a = SupplyT { unSupplyT :: (forall r. (s -> SupplyT s m r) -> SupplyT s m r) -> m a }
06:27:04  Consider it noted.
06:27:17  @quote elliott
06:27:22  elliott says: @remember @remember @remember
06:27:39  remember remember remember: never forget
06:27:56  @forget elliott @remember @remember @remember
06:27:56  Done.
06:28:00  rip
06:28:04  @quote elliott
06:28:04  elliott says: I have weird mental spheres that I divide all my coding into and that determine editor and the like
06:28:14  how is that a quote...
06:28:33  @quote DCliche
06:28:34  DCliche says: @remember elliott @remember @remember @remember
06:28:41  good quote
06:29:40  @quote Patashu
06:29:41  No quotes match. This mission is too important for me to allow you to jeopardize it.
06:29:47  rofl
06:30:25  DCliche: How many times did you @remember that?
06:30:32  @remember what
06:30:32  Incorrect arguments to quote
06:30:49  DCliche: elliott @remember @remember @remember
06:31:15  I'll be back in half an hour or so, I need to count
06:35:53  46 apparently, not as many as I expected
06:36:19  @quote lambdabot
06:36:19  lambdabot says: Done.
06:36:22  @quote lambdabot
06:36:23  lambdabot says: why on the earth whould I slap dons with a wet trout
06:42:22 -!- DCliche has quit (Quit: You are now graced with my absence.).
06:47:55  https://upload.wikimedia.org/wikipedia/commons/2/23/Xiaoerjing-Ekzemplafrazo.svg Anyone care to guess the language? (note: I can just about guarantee you'll get it wrong)
06:56:52  pikhq: The filename is a bit of a hint.
06:56:57  shachaf: Is it?
06:57:31  Well. I suppose it is.
06:58:05  I guessed that "Xiaoerjing" was vaguely Chinese-related before looking it up.
06:58:16  Still, WTF.
06:58:47  ?
06:59:11  That's fucking Mandarin, the fuck.
07:07:57  western china?
07:20:12 -!- GreaseMonkey has quit (Quit: The Other Game).
07:42:27  I would have guessed that "Xiaoerjing" would be vaguely oerjan-related.
07:43:48 -!- Zuu has quit (Read error: Connection reset by peer).
07:45:59 -!- SgeoN1 has quit (Ping timeout: 240 seconds).
07:48:51 -!- Zuu has joined.
08:21:03 -!- CakeProphet has joined.
08:21:03 -!- CakeProphet has quit (Changing host).
08:21:03 -!- CakeProphet has joined.
08:32:04  fungot
08:32:06  CakeProphet: madam president, may i offer my congratulations on his excellent report inviting us to reflect a vision of the future constitutional treaty. yet again we are suffering from this. allow me to intervene in this region where there is overcapacity, fishermen who can no longer stand by while saddam hussein keeps playing these games. last month the commission presented its legislative proposals for the 18 council regulat
08:33:37  ^style
08:33:37  Available: agora alice c64 ct darwin discworld europarl* ff7 fisher fungot homestuck ic irc iwcs jargon lovecraft nethack pa sms speeches ss wp youtube
08:33:55  ^style speeches
08:33:56  Selected style: speeches (misc. speeches from Project Gutenberg)
08:33:57  fungot: hi
08:34:04  fungot: why do you not love me? :(
08:34:10 -!- CakeProphet has changed nick to ElliotDrone1.
08:34:14  fungot: hi
08:34:15  ElliotDrone1: mr. chairman and fnord am very glad to be able to violate the ordinary rules of composition as well as society has its pleasures; as from the city.
08:34:18 -!- ElliotDrone1 has changed nick to CakeProphet.
08:42:31  fungot: oh?
08:42:32  CakeProphet: if i had written it all out the day before the furnace, so a fancy may be said that a man who had neglected his studies were fnord by the restless bed of fnord and i recollect that the most audacious libels on royal majesty have passed without notice; that the most audacious libels on royal majesty have passed without notice; that the most intense terrors."
09:17:53 -!- monqy has quit (Quit: hello).
10:04:00 -!- hagb4rd has joined.
10:42:30 -!- copumpkin has quit (Ping timeout: 248 seconds).
10:42:55 -!- copumpkin has joined.
11:05:21 -!- derdon has joined.
11:43:08 -!- aloril has quit (Ping timeout: 240 seconds).
11:56:31 -!- aloril has joined.
12:21:30 -!- augur has quit (*.net *.split).
12:21:31 -!- twice11 has quit (*.net *.split).
12:21:31 -!- yorick has quit (*.net *.split).
12:21:57 -!- augur has joined.
12:24:06 -!- twice11 has joined.
12:24:43 -!- yorick has joined.
12:55:52 -!- boily has joined.
13:04:05 -!- pikhq_ has joined.
13:04:24 -!- pikhq has quit (Ping timeout: 258 seconds).
13:25:32 -!- Patashu has quit (Ping timeout: 240 seconds).
13:35:26 -!- Phantom_Hoover has joined.
13:37:59 -!- copumpkin has quit (Ping timeout: 248 seconds).
13:38:23 -!- copumpkin has joined.
13:44:22 -!- MSleep has quit (*.net *.split).
13:44:22 -!- Zwaarddijk has quit (*.net *.split).
13:48:30 -!- MSleep has joined.
13:48:30 -!- Zwaarddijk has joined.
14:04:40 -!- copumpkin has quit (Ping timeout: 252 seconds).
14:05:04 -!- copumpkin has joined.
14:29:02 -!- Zwaarddi1k has joined.
14:33:47 -!- MSleep has quit (*.net *.split).
14:33:47 -!- Zwaarddijk has quit (*.net *.split).
14:52:24 -!- copumpkin has quit (Quit: Computer has gone to sleep.).
15:08:27  fungot: is it okay if I pretend to have a conversation with you?
15:08:29  tswett: there is one honest and industrious neighbours rather than among rioters and vagabonds. this matter is as much a theory of government in opposition to their prayer. when the question is not, i am fnord. fnord patron ( rousseau) et fnord fnord quod fnord urbi.
15:08:49  Uh...
15:08:50  ^style
15:08:50  Available: agora alice c64 ct darwin discworld europarl ff7 fisher fungot homestuck ic irc iwcs jargon lovecraft nethack pa sms speeches* ss wp youtube
15:08:56  Is that so.
15:09:03  ^style ss
15:09:04  Selected style: ss (Shakespeare's writings)
15:09:12  Mm, no.
15:09:21  ^style homestuck
15:09:21  Selected style: homestuck (Homestuck pages 1901-4673)
15:09:29  fungot: no spoilers, please.
15:09:30  tswett: the only sad part is how easy it's going to be a long day. though it is pretty conceivable that i will remain an impeccable leader for a span. he is the first and they get progressively more difficult to reach a very high rolls he was lucky. my lusus sucks, what a terrible idea. leave me alone.
15:09:41 -!- derrik has joined.
15:10:01  fungot: oh, come on.  You're a terrible leader and you deserve to have such a sucky lusus.
15:10:01  tswett: john, try to stop me i dare you. published by major developers, was given a name! you've been eating it all day. and it might help you take a picture of a fella all worked! you love your scribblepad.
15:10:54  fungot: I guess I will, then.  Even my scribblepad easily matches you... what kind of lame weapon do you have allocated, anyway?
15:10:55  tswett: this is it, like an apple or that it is your backup hat. problem solved, you guess. at the last minute she flung through skaian defense. what a royal mess of his lovely new horseleather bib. it just so happens that today, the 13th of april. another day of uneventful but highly satisfying
15:11:01  fizzie, how does it feel to be a major developer?
15:11:02  Phantom_Hoover: You have 4 new messages. '/msg lambdabot @messages' to read them.
15:11:23  An apple.  Yes, I can surely defeat someone armed with only an apple.
15:12:08  What if they're armed with that sword alone?
15:15:49  What sword?
15:17:32 -!- copumpkin has joined.
15:33:27  tswett, that sword alone!
15:33:36  It can't stop, you know.
15:34:21  I'm afraid I'm not familiar with the sword you speak of.
15:53:49 -!- MDude has joined.
15:56:46  HEY GUYYYYYYS best VAX simulator?
16:06:38 -!- sebbu2 has joined.
16:08:49 -!- sebbu has quit (Ping timeout: 276 seconds).
16:17:59 -!- elliott has joined.
16:21:03  08:34:10: -!- CakeProphet is now known as ElliotDrone1.
16:21:04  elliott: You have 2 new messages. '/msg lambdabot @messages' to read them.
16:21:04  CakeProphet: die
16:28:39  15:56:46:  HEY GUYYYYYYS best VAX simulator?
16:28:41  Gregor: Dyson?
16:28:49  Good ol' Phantom_Hoover here?
16:28:57  Gregor: MORE SERIOUSLY, probably SIMH?
16:29:01  Top on Google.
16:29:06  Also it does PDPs.
16:29:35  You can tell it's good because it's unpronounceable.
16:29:48  Wait, my name has an mh in it...
16:32:09  (I tried to change my name to Ford_Prefect here, and then to Ix, but they're both in use.)
16:37:14  "Note that the K combinator is operationally similar to \x y . x" — Haskell wiki.
16:37:18  Similar?
16:38:17  Phantom_Hoover: SKI calculus isn't defined in terms of the lambda-calculus.
16:38:33  Sure, but operationally they're identical.
16:39:09  Well, yes.
16:39:20  Phantom_Hoover: But you have to define a system with both of 'em to say things like that.
16:39:29  Otherwise it's not clear what "identically" means at all.
16:40:45  Oh god, I nearly used a hyphen rather than a diaeresis.
16:40:54  You almost weren't terrible.
16:41:14  I WILL TAKE MY DIAERESES TO THE GRAVE
16:42:07  Diaeresae.
16:42:12  Sorry, Ï WÏLL TÄKË MŸ DÏÄËRËSËS TÖ THË GRÄVË
16:43:13  Phantom_Hoover: Ah.
16:44:41  s/W/Ẅ/g;s/H/Ḧ/g
16:45:12  I was going to try them on all the consonants, but I couldn't be bothered.
16:46:36  Deewiant: Hey WISE GUY, I've got a TEAM OF PHDS working on my N-CURSOR ZIPPER SPARSE DISCERETE INFINITE LAHEY-SPACE INTERFACE
16:46:39  SO HA HA HA
16:47:19  Hope it works out for you
16:47:49  Deewiant: I'VE USED ABOUT SEVEN GADTS AND UNSAFECOERCE, IT FUCKING BETTER
16:54:33  elliott: YeahOK, SIMH seems like the way. Unfortunately PDP's will never be supported, I need too much memory :P
16:54:39  lol
16:54:54  Gregor: So, three kilobytes?
16:55:46  I haven't measured, actually :P
16:55:50  But probably ~10M
17:00:01  elliott: Anyway, I feel VAX would be a nice topper for my JIT :P
17:00:42  Gregor: I can't help but feel you'd do better if your language was less boring :P
17:00:52  That's a point ...
17:00:55  What shall I add?
17:01:17  I'd think more along the lines of "change" than "add", but that's probably way too much work at this point :P
17:01:30  But a lot of the winning IOCCC entries do something fairly impressive even apart from their code.
17:01:35  You still deserve to win though :P
17:01:56  I think the "fairly impressive" part is that it JITS EVERYWHERE :P
17:02:13  Well, yeah, but you can't tell that just from running it, and it's no flight sim :P
17:02:26  BTW you should integrate this technology into Fythe! :p
17:02:34  lol
17:05:56 -!- quintopia has quit (Ping timeout: 260 seconds).
17:15:54 -!- quintopia has joined.
17:15:54 -!- quintopia has quit (Changing host).
17:15:54 -!- quintopia has joined.
17:19:28 -!- monqy has joined.
17:21:50  hi monqy
17:24:11 -!- Zuu has quit (Ping timeout: 244 seconds).
17:29:28 -!- augur has quit (Remote host closed the connection).
17:33:28  Deewiant: BEHOLD YOUR DEFEATER: http://sprunge.us/MfXU
17:34:21  It has been beheld
17:35:09  Deewiant: There is noooo way you properly beheld that in the time it took you, did you even NOTICE the unsafeCoerce?
17:35:12  The rank-2 fold??
17:35:27  I missed the unsafeCoerces, noticed the fold though
17:37:38  hi
17:38:30  hi monqy you behold too http://sprunge.us/MfXU
17:38:47  Deewiant: Also this is only a quadtree, it's going to require something even more ridiculously involved for something decent :-/
17:39:00  Plus the fact that I don't actually have the algorithms to move the cursors about yet
17:39:01  May I recommend a bucket PR-CIF k-d tree
17:39:39  Deewiant: Maybe
17:39:51  Deewiant: I'd rather not use something that wants a dynamic array, at least
17:40:05  Also I'll have to use something slightly different from anything you say to establish my superior thinking
17:40:17  Actually hmm
17:40:25  Deewiant: You use a dynamic array just so you can load the whole file into one, don't you
17:40:27  That's sneaky
17:40:29  Sneaky and deceitful
17:41:17  I can't do that since the file isn't rectangular
17:41:28  Deewiant: I don't mean directly
17:41:38  Deewiant: I just mean, you do it so that you don't have to deal with cross-array boundaries during file loading
17:41:39  Then yes
17:41:46  Sneaky, and wrong
17:42:10  Well, in a sense I have to deal with them, if there're arrays already there
17:42:41  Deewiant: Well, yes, but it still speeds up your initial load
17:43:04  I guess I'll have to resolve myself to being slower on Mycology and faster on Fungicide
17:43:08  s/resolve/resign/
17:43:15  Compared to something like a hash table, it should, yes
17:43:57  Deewiant: Compared to the structure you have but with fixed-size arrays :P
17:44:58  Compared to that too, it should, yes
17:45:12  The whole point was to not use fixed-size arrays :-P
17:45:33  Until it turned out that not having the compiler optimize x*C into a shift-and-add was a bottleneck
17:46:56  Deewiant: I don't see how dynamic arrays really help much, if you have a fancy k-d tree
17:47:03  Or other sufficiently smart space :P
17:47:10  Certainly the indexing is a lot more trivial
17:47:54  Maybe they don't, it was more of a matter of principle
17:48:08  lol
17:48:43  Deewiant: Thankfully I think this n-cursor setup doesn't actually really have that much overhead over mutation, so ha
17:49:25  (It basically cuts off the tree at each point where a cursor is, zips those at the cursor, and then arranges the whole thing into a zipper)
17:49:27  (Sort of)
17:49:31  Point being to one-up cfunge's "lol here's a int[1024*256], turns out it's fast to do stuff in that" with "I have no constants in my funge-space implementation and it's faster than yours"; unfortunately that didn't quite work (see x*C optimization)
17:49:51  Heh
17:50:14  Deewiant: You're still slower on Mycology, right :-)
17:50:17  (And there were and still are other, different constants)
17:50:22  elliott: AFAIK I'm faster on everything
17:50:43  On full Mycology, I might be somewhat slower only due to executing more fingerprint tests
17:50:45  How the heck do you beat it on Mycology; just your ridiculous fingerprint and stack microoptimisations?
17:50:54  It's not like your fungespace will help any :P
17:51:17  My fungespace is effectively the same and other than that, maybe those play a part, dunno :-P
17:54:33  Actually, I think I'm still slower on fungot's underload interpreter; can't remember for sure
17:54:33  Deewiant: that is a winner's attitude, and there is no particularly good human translation for this concept. a concept usually denoted by a single, linear concept. a concept usually denoted by a single, linear concept. a concept usually denoted by a single, linear concept. a concept usually denoted by a single, linear concept. a concept usually denoted by a single, linear concept. a concept usually denoted by a single, linear c
17:55:08  :D
17:56:37  Deewiant: What you need to do is implement UNDL
17:56:47  For AUA (Advanced Underload Acceleration(tm))
17:59:37  Deewiant: I... why am I actually considering implementing that
17:59:55 -!- augur has joined.
18:01:15  Couldn't say
18:16:15  "Here is a PoC for four new buffer overflows in GIMP. Compile it
18:16:15  with open-cobol."
18:16:20  Now that's what I like to hear.
18:17:03  Hmph, it's not proper COBOL.
18:17:07  It's just a glorified cat.
18:17:10  Without the loop.
18:31:27  elliott: cat repl.jch hello.jch gorepl.jch | ./jitchards
18:31:31  Hello, world!
18:31:37  Gregor: Wow :P
18:31:45  Gregor: It's... not a repl without a prompt, y'know :P
18:31:47  Also, what's gorepl.
18:32:08  elliott: 1) It has a prompt, I'm just suppressing it by catting shit in, 2) gorepl says "now run the function you loaded as main"
18:32:21  Gregor: Wait, it /detects whether stdin is a tty/?
18:32:27  No
18:32:35  You'd have to cat repl.jch - | ./jitchards normally
18:32:41  How does it suppress the prompt then :P
18:32:56  Oh, you mean it would show a 'put ur code here lol> ' thing
18:33:01  Well that's boring and stupid.
18:33:09  Gregor: Don't call it a REPL then :P
18:33:17  FINE, I'LL ADD A PROMPT
18:33:22  !bf_txtgen >
18:33:27  ​34 ++++++++++[>++++++>+>><<<<-]>++.>. [55]
18:33:30  Gregor: You might also want to add the "read" and "loop" part so you don't have to cat - :-)
18:33:42  I GUESS you can forego a tape debug output?
18:33:49  The whole system only reads from stdin, and it does loop X_X
18:33:58  Gregor: Don't use bf_txtgen for single chars
18:34:09  http://esolangs.org/wiki/Brainfuck_constants
18:34:12  > ord '>'
18:34:13    62
18:34:14  elliott: It's two chars
18:34:21  ++++[>+<++++]>-
18:34:30  elliott: It's two chars
18:34:32  > ord ' '
18:34:34    32
18:34:40  ++++[>+<++++]>-.[-]++++[>++++++++<-]>.
18:34:44  ...OK, I guess bf_txtgen wins this time :P
18:34:46  Congrats, it's longer.
18:35:05  HEYWAIT
18:35:14  REPL = Read Eval Print Loop THERE IS NO "PROMPT" HERE
18:35:35  what
18:35:35  No, there isn't, but every REPL in the history of ever has had a prompt.
18:35:38  yes
18:35:38  My repl is 100% REPL satisfaction except for the P :P
18:35:48  REPL should print a prompt
18:35:52  its userfriendly
18:35:54  Oy vey
18:36:02  Gregor: R, E, P, L are necessary but not sufficient conditions :P
18:40:39  ... lol bf_txtgen ignored my space and put a newline :P
18:47:29  Gregor: I bet EgoBot is the one ignoring the space :P
18:47:41  Probably
18:59:54  04:25:05:  data MetaContext = MetaContext { nwNeighbor :: MetaCursor (To NW), ..., up :: MetaCursor dir, signPost :: SignPost } -- it occurs to me that some field name disambiguation will be needed
19:00:00  well this is going to need oerjisambiguation >:(
19:00:33  elliott: lullll my circularity changes broke SPARC somehow :P
19:00:41  lol
19:00:49  Gregor: Did you ever get it working on Itanium
19:00:57  elliott: I don't have a working simulator.
19:01:05  Gregor: MMIX?
19:01:17  elliott: Now there's a nice'n 8-D
19:01:34  Gregor: Test with jsmmix :P
19:01:34  elliott: Except I have no stdlib, so can't really test >_>
19:01:49  Gregor: More seriously, Alpha?
19:02:12  elliott: IIRC the only reason I haven't tried Alpha is that I was too lazy to build a cross compiler.
19:02:19  X-D
19:07:33  Argh, I forgot how awful GHC's API is.
19:12:20  elliott: Fixed SPARC.
19:12:26  Woot
19:13:50  The problem was very stupid, it was variable shadowing :P
19:14:00  I didn't think it was so sensitive to this kind of change X-D
19:15:01    | |                                                                                  Target Architecture (alpha)  --->                                                                                                               | |
19:15:05    | |                                                                                  Bitness: (32-bit)  --->                                                                                                                         | |
19:15:08  Uhhh, crosstool-ng?
19:15:12  alpha ain't gonna be 32-bit
19:21:19  Deewiant: So does mushspace do k-d things or is it just capable of doing so without API changes in the future
19:21:33  It should be capable
19:21:41  mushspace == CCBI
19:22:22  Deewiant: Right, just checking that it won't speed things up massively in the short term before Shiro takes the lead :P
19:36:11 -!- ais523 has joined.
19:36:48  hi ais523
19:37:25  hi elliott
19:38:54  http://sprunge.us/AXOB
19:40:06  elliott: ^
19:40:38  ais523: glanced at file list, eyes hit upon the source directory, tab closed
19:40:44  haha
19:40:46  OK, wtf variant of the Alpha do I need to select X_X
19:40:55  call of link remains. perhaps this is the end...
19:41:18  elliott: don't worry, it's sane
19:41:23  it's only very tangentially related to Feather
19:41:29  the name of the language is Not Even Feather
19:41:33 -!- CakeProphet has quit (Read error: Operation timed out).
19:41:36  ais523: That's, uh, a very minimal syntax.
19:41:43  yep
19:41:45  it's just sexps
19:41:48  those are really easy to parse
19:41:48  ais523: Actually I think it shares a syntax with Qq.
19:41:58  s/Qq/qq/
19:42:03  the parser would be even simpler if I didn't try to do type inference in it
19:42:16  `addquote  the parser would be even simpler if I didn't try to do type inference in it
19:42:23  719)  the parser would be even simpler if I didn't try to do type inference in it
19:42:57  ais523: hmm, is it sufficiently Not Feather that my apparent inability to find any self-modification is expected?
19:43:20  yes
19:43:25  it doesn't have self-modification
19:43:52  ais523: how is it Not Entirely Not Feather, then?
19:43:53  NEF's a language designed for use as the backend of Feather interpreters
19:43:56 -!- Darth_Cliche has joined.
19:44:01  ah
19:44:03  is it complete?
19:44:06  it's TC
19:44:17  although a little tricky to avoid writing infinite loops in it
19:44:25  I mean, is further expansion planned?
19:44:41  also, someone should write a safe unsharchiver
19:44:45  no, unless I find a good way to make evaluation less eager
19:44:50  like how JSON was originally parsed with eval() and then people wrote real parsers
19:45:10  ais523: grrr, sharbomb
19:45:17  sorry; aren't they usually?
19:45:20  maybe
19:45:32  anyway, the main weird feature of the language is "overeager" evaluation
19:45:44  ais523: is that the same as superstrict?
19:45:48  i.e. doing reduction inside lambdas
19:45:53  yep
19:45:54  (which tends to make things like Y diverge)
19:46:12  ais523: hmm, I think reimplementing this would be simpler than installing an OCaml compiler
19:46:16 * elliott does so
19:46:22  configure: error: The alphaev6 is not supported.
19:46:23  WTF GLIBC
19:46:31  what, reimpls, or installs OCaml?
19:46:32  It said that for alphaev4, alphaev5 too
19:46:35  ais523: former
19:46:39  heh
19:46:58  it's mostly a proof-of-concept interp
19:47:14  ais523: hmm, what's the difference between Var1 and Var2?
19:47:16  anyway, what I really need to show that NEF has fit its concept correctly is to write a self-interp with eigenratio 1
19:47:33  elliott: which argument it refers to
19:49:19  the language has exactly two types: 1, which takes an argument of type 2, and 2, which takes two arguments, of type 2 and 1 respectively
19:49:40  functions never return, so it doesn't make sense to say that the return value has a type
19:50:05  elliott: are you at least reimplementing it in Haskell?
19:50:56  it should be possible to translate more or less directly, as apart from the I/O right at the start and some debug output, that interpreter is pure
19:51:37  back
19:51:44  ais523: yep
19:51:54  ais523: so is Var1 a variable reference to a variable of type 1?
19:52:04  yep
19:52:18  ais523: cool, I can represent the types in Haskell then
19:52:43  ais523: hmm, and Call1 calls a 1 with a 2?
19:52:50  and Call2 calls a 2 with a 2 and a 1?
19:53:13  Call2 takes three arguments; the first is the variable holding the function to call (of type 1), and the other two are its arguments, of types 2 and 1 respectively
19:53:17  *(of type 2)
19:53:20  and Call1 is analogous
19:53:23  ais523: why can't the function be an expression instead?
19:53:26  is that fundamental?
19:53:33  that's the main unusual feature of NEF
19:53:36  right
19:53:54  ais523: what is the return type of a 1?
19:53:56  and a 2?
19:54:00  or can they return either 1s or 2s?
19:54:00  there isn't one, they never return
19:54:07  no function ever returns in NEF
19:54:12  ais523: well, OK, what is the type of 2(2,1)?
19:54:16  erm
19:54:17  there isn't one
19:54:20  where i use integers to mean "something of that type"
19:54:28  ais523: then how do you pass a 2 or a 1?
19:54:35  by getting it from a variable?
19:54:39  if so, surely it should be Call1 of (int * int)
19:54:41  either that, or by giving a template
19:54:44  and Call2 of (int * int * int)
19:54:50  ais523: that's not in the program type :)
19:54:59  let me try to explain the language, rather than you to reverse-engineer it from the impl
19:55:10  probably a good idea
19:55:24  basically, if I write (a b c), that can be interpreted as \0.a(b,c)
19:55:35  well, \-1.a(b,c)
19:55:38  the numbers are relative to parens
19:55:44  so (0 0) = \x.x
19:55:50  wait
19:55:50  ais523: is it de bruijn or reverse de bruijn?
19:56:08  umm, I forget which way is which
19:56:26  but (0 0) always means \v c.c(v)
19:56:35  ais523: in de bruijn, 0 is the innermost var
19:56:39  in reverse de bruijn, 0 is the outermost
19:56:43  (de bruijn is much nicer)
19:56:55  and likewise, (0 (0 1)) means \x c.c(\y d.d(x))
19:56:59  so 0 is innermost
19:57:48  forward de bruijn, then
19:59:13  ais523: but, ehh, is the only reason you have the arguments be programs instead of variable numbers so that you can use Exit and Error there?
19:59:22  or can you actually nest calls and that's what this template stuff is?
19:59:48  elliott: it's basically the same as giving a literal lambda as an argument to something
19:59:57  i.e. the arguments are either variables or function literals
20:00:07  and function literals can be very complex
20:00:20  (by "variable" I mean "lambda variable", btw, not the assignable sort)
20:00:22  ais523: OK, let me get a straight answer: is Call1 (n, Call2 ...) ever valid?
20:00:34  yes
20:00:42  so is Call1 (n, Call1 …)
20:00:43  ais523: what about Call1 (n, Call1 ...)?
20:00:45  OK
20:01:00  then indeed, i do not understand the language :)
20:01:16  I have a few examples
20:02:04  (0 0) is how you compile i into NEF; (0 (0 1)) acts like k; (0 (0 (2 0 (2 1 (1 0 2))))) acts like s; (0 (1 0) 0) acts like call/cc
20:02:21  elliott: Ohhey, it works on PPC and I never even did any work to make it, err, work there.
20:02:21  I get I and K but not the others, although S looks familiar
20:02:28  I think implementing it will probably be the first step in understanding it; it tends to be with languages this simple
20:02:30  Gregor: Neat
20:02:48  ais523: but I believe this means I can't actually do the type trick I was planning :)
20:02:58  indeed, I tried to do that trick too
20:03:05  but it doesn't work
20:03:07  ais523: what type does exit take? 1 or 2?
20:03:19  exit's of type 1
20:03:28  ais523: no it isn't
20:03:31  ais523: it isn't a program
20:03:32  so it has no type
20:03:39  ais523: in (Exit p), what type must p have?
20:03:49  elliott: it takes one argument of type 2; that's the definition of being type 1
20:04:00  ais523: it doesn't take an argument at all, because it's not a program!
20:04:03  it's a function from program to program
20:04:08  no it isn't
20:04:10  Call1 (Exit, ...) # not valid
20:04:17  ais523: it is, I'm looking at your ADT /right now/
20:04:20 -!- derrik has quit (Quit: /clear).
20:04:20  elliott: Call1 (Call1, ...) # not valid
20:04:28  yes, which is why Call1 doesn't have a type
20:04:30  because it's not a program
20:04:47  and yet Call1 (0, Var2 0) is a program
20:04:54  ...yes?
20:05:00  (Exit p) is a program, obviously
20:05:03  Exit isn't
20:05:05  ah, right
20:05:15  therefore Exit doesn't have a type, because a type is something programs have
20:05:23  in that case, Exit takes a program of type 2 and returns a program of type 1
20:05:40  right; and I assume Error is a program of type 1 or 2, i.e. polymorphic?
20:05:52  nah, Error is me getting rid of code duplication
20:05:58  it's of type 1, always
20:06:07  OK
20:06:14  data T1
20:06:15  data T2
20:06:15  data Exp t where
20:06:15    Var   :: Var t  -> Exp t
20:06:15    Call1 :: Var T1 -> Exp T2 -> Exp ???
20:06:15    Call2 :: Var T2 -> Exp T1 -> Exp T2 -> Exp ???
20:06:17    Exit  :: Exp T2 -> Exp T1
20:06:17  because I use the same codepaths for type 1 stuff (that don't have a type 1 arg) and type 2 stuff (which does have a type 1 arg)
20:06:19    Error :: Exp T1
20:06:21  this is why the trick fails :)
20:06:23  you can't fill in ???
20:06:35  and just stick in Error as the type 1 arg
20:06:41  if I understood the language, I could probably do a better trick to reify the types, but I don't understand it well enough to do that now
20:06:43  ais523: ewwwww
20:06:47  ais523: I'm not going to have Error
20:06:53  I know >:)
20:06:57  elliott: I didn't think you would
20:07:12  ais523: btw, why is it (Exit of program) instead of just Exit, used like Call1 (Exit, p)?
20:07:49  elliott: the given program is executed to calculate the return value
20:08:00  ais523: and so it would be with Call1 (Exit, p), no?
20:08:09  or is this me not understanding the semantics again :)
20:08:20  the problem with the understanding-by-implementation approach is that it involves implementation
20:08:29  it's a side-effect of being hypereager
20:08:43  suppose Exit ends up being substituted into the first position of a Call
20:08:51  it can't be there, so needs to be evaluated immediately, but without exiting the program
20:09:06  so the argument to Exit's basically there to defer the evaluation
20:09:49  heh
20:09:54  I think the language probably needs a strictifier, incidentally, it'd avoid this sort of problem
20:10:09  and make writing safe infinite loops rather easier
20:10:13  ais523: Is Error something inherent to the language or just a way to get nicer reports than non-halting?
20:10:15  but you wouldn't have to expand the language syntax at all
20:10:33  elliott: Error isn't inherent to the language, it's simply there because I'm lazy
20:10:37  erm
20:10:39  ais523: Exit, I mean
20:10:40  you can write an impl without it, and probably produce nicer error messages
20:10:40  sorry!
20:11:00  http://i.imgur.com/1uOhf.png ;; this is the first time I have ever used three windows in Emacs
20:11:30  oh, basically, the input is a type 2 program and its type 2 arg; Exit is the type 1 arg it's given when it starts executing
20:11:48  so it wouldn't be needed if you didn't care about your programs being able to terminate
20:12:02  you could just use type 1 programs rather than type 2 programs as the initial input
20:14:30  elliott: OK, new reason for not testing on Alpha: I can't get a bloody cross-compiler at all >_<
20:15:25  ais523: I need a wider screen to do this three-pane coding :(
20:15:41  elliott: I typically split one of the halves horiziontally when doing three-pane
20:15:47 * elliott just switched to that
20:15:55  well, with a horizontal divider
20:17:04  ais523: Partial list of words I don't know the meanings of in the slightest: ig, incg, decg, substat
20:17:29  btw, it's entirely possible to write a program that doesn't type, such as (0 0 (0 0 0)); atm, I detect type errors at runtime rather than statically
20:17:53  anyway, incg and decg are basically used to adjust open terms
20:17:55  inside substat
20:18:24  and substat itself does substitutions in the typical lambda-calculusy way
20:18:47  ais523: huh? you don't need substitutions with de bruijn
20:19:10  elliott: how are you going to implement an application of a lambda otherwise?
20:19:32  ais523: you use a linked list; cons onto it when you do a call, and just index it when a variable is looked up
20:19:40  var 0 = car, var 1 = cadr, etc.
20:19:57  elliott: but what if that variable hasn't been evaluated yet?
20:19:57  and, ofc, you don't need alpha renaming
20:20:01  hypereager, remember?
20:20:08  ais523: what about it?
20:20:22 -!- Phantom__Hoover has joined.
20:20:31   http://i.imgur.com/1uOhf.png ;; this is the first time I have ever used three windows in Emacs ← You've never used Proof General?
20:20:31  Phantom__Hoover: You have 1 new message. '/msg lambdabot @messages' to read it.
20:20:43  Phantom__Hoover: That doesn't couuunt.
20:20:56  XD
20:21:03  elliott: example: I just gave (0 (0 (2 0 (2 1 (1 0 2))))) and (0 0) as input to the interpreter (s and i)
20:21:12  and here's the debug output:
20:21:15  (0c (0c (2v 0v (2v 1v (1v 0v 2c))))) [(0c 0v), (exit 0v)]
20:21:17  (exit 0v) [(0c (1v 0v (1v 0v 1c))), error]
20:21:18  (0c (1v 0v (1v 0v 1c)))
20:21:39 -!- Phantom__Hoover has changed nick to Phantom___Hoover.
20:21:41  you know that's not going to help me; ais523: if you mean that you have to evaluate expressions before consing them, so what?
20:21:43 -!- Phantom_Hoover has quit (Ping timeout: 248 seconds).
20:21:47  you can do that easily
20:21:49  Hmm.
20:21:53  elliott: no, you have to cons them before knowing what they are
20:21:59  elliott, shoddy.
20:22:02 -!- Phantom___Hoover has changed nick to Phantom_Hoover.
20:22:06  ais523: oh, right; that's easy
20:22:08  Phantom_Hoover!
20:22:15  ais523: you just use a linked list of (Maybe Exp) instead
20:22:17  shachaf!
20:22:20  Nothing means you don't know what it is yet
20:22:28  Phantom_Hoover: Don't you owe me a message or two?
20:22:30  elliott: but how can you tell which Nothing is which afterwards?
20:22:43  ais523: what?
20:22:46  @tell shachaf friendship message
20:22:47  Consider it noted.
20:22:59  here: in the above example, I start with (0 (0 (2 0 (2 1 (1 0 2))))), then substitute in (0 0) and exit
20:23:09  and get exit (0 (1 0 (1 0 1)))
20:23:45  basically, we're substituting for the first 2 in (0 (2 0 (2 1 (1 0 2))))
20:23:47  you're just going to keep quoting programs at me you know I can't yet read, right? anyway, the whole point is, if you get Nothing, abort reduction of that variable
20:23:54  but failing that, you can have (Either Int Exp) instead
20:24:00  if you want to keep track of them
20:24:04 -!- tiffany has joined.
20:25:46  elliott: OK; so suppose I want to evaluate the following open term: (0 0) applied to 0 and (2 1 (1 0 2)); that's going to give me ((2 1 (1 0 2)) 0), but I don't know what the 2 at the start refers to
20:25:53  because it refers beyond the start of the expression
20:26:00  hmm, let me translate into lambda calculus
20:27:08 -!- oerjan has joined.
20:27:30  wait, I'm confused
20:27:33  hi oerjan
20:27:40  hello
20:28:03  I'm pretty certain your suggestion is incorrect, but need a bunch of calculation to work out why
20:28:27  ais523: lol
20:28:40  oerjan: i implemented your cursor stuff and PSeq, just without any operations :P
20:28:54  oerjan: also, turns out what i thought the gadt record syntax was is deprecated, you were right with Foo :: { ..., ... } -> R
20:29:07  elliott: I think it's because it gets the evaluation order wrong
20:29:31  elliott: No, it's Foo :: { a :: Int } -> { b :: Char} -> R, isn't it?
20:29:34  ais523: I refuse to believe you have an evaluation scheme which cannot be implemented with an environment and absolutely requires substitution; that's patently ridiculous
20:29:42  ais523: even if my specific solution doesn't work
20:29:59  elliott: aha.  i noticed wrt PSeq you said something about unsafeCoerce :P
20:30:08  elliott: there probably is a way to do it with an environment, just not the way you suggested
20:30:08  shachaf: Nope.
20:30:11  i guess that may be the simplest way to implement it
20:30:23  oerjan: yes, I didn't feel like implementing my own finger trees :P
20:30:34  but I fear it'd get exponentially complex to maintain the environment
20:30:51 -!- Zuu has joined.
20:31:17  ais523: I doubt it
20:31:38  elliott: Ugh.
20:31:43  ais523: I don't see why Unknown doesn't work; if you get Unknown back, then behave as you would with an unsubstituted variable reference in a substituting implementation
20:31:46  You're right.
20:31:57  elliott: let's see… suppose I have \x.(… some expression containing a call of x …), and apply a value to it
20:32:10 * shachaf thinks GADT syntax and regular syntax could be unified into something better pretty easily.
20:32:40  so, I have one append-only stack (because no returns) that contains the values of open terms in the current expression
20:32:59  and then, I have to traverse the inside of the brackets to find all uses of x in call position, and evaluate them immediately
20:33:01  oerjan: zipper.hs: http://sprunge.us/BDYL
20:33:05  oerjan: PSeq.hs: http://sprunge.us/IBPQ
20:33:20  ais523: mmhm
20:33:31  so what stack do I use to evaluate /those/?
20:33:38  and what do I put on it?
20:34:25  ais523: say the environment for ((\x. ... (x e) ...) xv) is [a,b,c]; the environment for evaluating (x e) is [xv,a,b,c]
20:34:57  say x = \q.u
20:34:59  hmm… that breaks the links between numbers and positions in the list
20:35:11  then the environment for evaluating u is [e,a,b,c]
20:35:13  because scoping
20:35:15  ais523: no it doesn't
20:35:26  ais523: [xv,a,b,c]!!0 = xv
20:35:29  [xv,a,b,c]!!1 = a
20:35:33  elliott: what if I have ((\x. … ( … (x e )) …) xv)
20:35:36  de bruijn is retained
20:35:49  ais523: calls don't introduce new bindings, so that's irrelevant
20:35:56  I'm going to need to use [xv,?,a,b,c] as the list
20:36:09  what?
20:36:15  wait, no, [?,xv,a,b,c]
20:36:25  elliott: think of it in number terms; x won't be 0 inside (x e)
20:36:28  it'll be some larger number, like 2
20:36:45  ais523: no it won't, unless by "..." you meant "... that includes a lambda"
20:36:50  elliott: err, right
20:36:57  all open parens imply a lambda in NEF
20:37:04  so counting parens and counting lambdas comes to the same thing
20:37:18  ais523: so what you're discovering is, parsing an expression containing variables into de bruijn requires a map from variable name to integer
20:37:27  and each integer increases for each new lambda
20:37:31  shocking
20:37:44  however, unrelated to the semantics of a language coded directly in de bruijn
20:38:01  elliott: we're talking about the implementation
20:38:26  yes, and you have successfully confused the issue by using named variables which has somehow turned into a point involving conversion to de bruijn
20:38:36  which is irrelevant since named variables feature nowhere except in your attempted explanation afaict
20:39:02  elliott: I was going on /your/ example
20:39:08  because you refuse to read examples involving numbers
20:40:25  ais523: if it were de bruijn lambda calculus i would understand perfectly
20:40:39  but I do "refuse" (am unable to) understand examples in a language I'm in the process of trying to understand, yes
20:40:48  it sort-of is, just with a weird evaluation order
20:40:54  what syntax do you want for de bruijn lambda calculus?
20:41:48  exp := int | '(\' exp ')' | '(' exp exp ')', with omitted parens for repeated left-associative application, and whitespace to separate integers?
20:42:05  and parens on outermost lambdas omittable, etc.
20:44:35  ah, OK
20:45:34  NEF's syntax is basically that, except that it uses (…) rather than (\…), and that a lambda can take two arguments instead of one; both of the arguments has the same number, and it works out which is being referred to by the type
20:45:57  well, OK; I certainly have a better understanding of the lambda-calculus though
20:48:08  *First time looking at VAX* I like how VAX is clearly the primary influence for x86 :P
20:48:46  Gregor: http://esolangs.org/wiki/User:Ian#DEC_VAX
20:48:58  Gregor: ("Other Neat CPUs" section is great also)
20:49:45  Gregor: CALLG is really cool, hardware varargs :P
20:49:49  POLYx is also hilarious
20:50:05  "CASEx has a format like this: selector.rx, base.rx, limit.rx, displ[0].bw, ..., displ[limit].bw The instruction has "limit+3" operands. Not only can the VAX not tell how long the instruction is until it's completely decoded, it can't even tell how many operands it has! The whole thing can be 4GB long. Technically it can be 8GB long, but the VAX only has 4GB of addressing space."
20:50:18  Incidentally, my JIT currently does not (seem to?) work on VAX, and I think I know why, but not how to fix it ...
20:50:19  ais523: well, go on
20:50:33  err, I'm in the middle of something else
20:50:39  I get distracted easily
20:50:41  heh
20:50:43  Also, NetBSD VAX = yesssssssssssssss
20:50:45  Gregor: Try it on this: http://esolangs.org/wiki/Talk:Timeline_of_esoteric_programming_languages#AS.2F400
20:51:42  oerjan: did you look :P
20:51:52  elliott: in your foldr, i think the (forall a. result a a) can simply be result dest dest
20:52:00  elliott: Need compiler and simulator (also, CISC is usually the easiest, I think the issue with VAX is that it has markers at the beginning of functions which are not valid instructions but need to be there (?????))
20:52:22  oerjan: hmm, so it can. that seems really ugly: why can't it be result src src, too?
20:52:44  Gregor: Not *really*; x86 was more influenced by earlier Intel designs than anything else. That said, CISC had a lot of crazy stuff.
20:52:50  Also, yay 32-bit PDP-11!
20:53:04  elliott: Yup, my generated code totally has halts in it :P
20:53:30  Gregor: hmm, is VAX the architecture that didn't have a stack, but rather stored return addresses just before the start of a function?
20:53:57  ais523: ... I can't imagine so, that wouldn't work with C very well. Recursion and what have you.
20:54:17  it didn't, IIRC
20:54:40  I doubt it.
20:54:44  elliott: result src src would be for foldl, obviously... it's what replaces the right and left end, respectively.
20:54:56  oerjan: oh, right
20:55:09  hmm, but isn't AS/400 or i that thing that has a machine-independent binary format and is currently implemented using POWER7?
20:55:11  oerjan: what's weird about seqs is that they have, I think, four folds
20:55:20  oerjan: foldr, foldl, foldrFromRight, foldlFromRight
20:55:32  heh
20:55:33  Seeing as the PDP-11 used a stack, and the VAX started as a 32-bit PDP-11.
20:55:48  oerjan: although, I suspect that foldr == foldlFromRight and foldl == foldrFromRight in results, just not in semantics
20:55:52  err
20:55:55  oerjan: as in, evaluation semantics
20:56:15  elliott: presumably it may matter in thunk buildup
20:56:22  oerjan: right, that's what I meant
20:56:36  oerjan: incidentally, i note that one can have a PSeq of PSeqs...
20:56:43  i.e. (PSeq (PSeq path) src dest)
20:56:48  oerjan: which got me wondering what Mu PSeq is >:)
20:57:05  oerjan: unfortunately I think it's just data Foo = Foo | Bar Foo Foo
20:57:21  and there's no value with src =/= dest
20:58:16  elliott: in fact you would probably want foldl to be fromRight by default, since the other options just add thunks needlessly; the ' versions though would go the other way for both foldl and foldr.
20:58:25  oerjan: right
20:59:32  also, who's this "Ian"? I'd like him to explain why CASEx needs to be completely decoded to know how many operands it has
20:59:50  elliott: PSeq is sort of a * -> * -> * type transformer
20:59:54  olsner: esowiki guy, ping him on his talk page or use the wiki email thing?
21:00:00  oerjan: indeed
21:00:14  oerjan: incidentally, you can't implement Show (PSeq path src dest) because you need (forall a b. Show (path a b)) :-(
21:00:15  afaict, limit is the third operand and should say exactly how long the rest of it is
21:00:19  elliott: oh and one other thing i thought of, you could make a Category instance for PSeq
21:00:23  oerjan: ooh
21:00:24  elliott: meh, can't be bothered logging in
21:00:27  oerjan: shiny
21:00:29  I probably even have an account
21:00:46  elliott: it's sort of a free category on the path type
21:01:06  oerjan: i wonder if it's an arrow... arr seems tricky, maybe it's an arrow if the path is
21:02:33  oerjan: it's a super pretty structure
21:03:49  elliott: i think your Mu PSeq is more than that; it would allow constructing empty PSeq's at all nesting levels wouldn't it, so it would work similarly to building up set theory from empty lists.  oh hm you could never get a PSeq a b for a /~ b, i think, so it may be equivalent to Mu Seq.
21:04:11  oerjan: that's what i said
21:04:15  data Foo = EmptyList | Cons Foo Foo
21:04:35  [[],[],[]] = Cons EmptyList (Cons EmptyList (Cons EmptyList EmptyList))
21:04:36  etc.
21:04:42  elliott: well if you consider cons lists equivalent to Seq's...
21:04:47  well ok
21:04:55  @src foldl'
21:04:56  foldl' f a []     = a
21:04:56  foldl' f a (x:xs) = let a' = f a x in a' `seq` foldl' f a' xs
21:05:00  darn, they just use an ugly let too
21:05:42  oerjan: yikes, I'm not sure foldr' is possible
21:05:48  oerjan: because of the fiddly parametrisation
21:06:04  elliott: you might implement Show if you made a Show2 class for path
21:06:08  oerjan: indeed
21:06:17  (***) :: PSeq path a b -> PSeq path b' c' -> PSeq path (b, b') (c, c')
21:06:20  oerjan: wow that's pretty
21:06:23  it's like simulwalking!!
21:06:28  ...not sure it's possible though
21:06:31  because what if the lengths differ
21:09:19  why would foldr' (and equivalently foldl') not work?
21:09:23  oerjan: because
21:09:27      Expected type: result a a
21:09:27        Actual type: result mid dest
21:09:27      In the second argument of `foldr'', namely `z''
21:09:27      In the second argument of `seq', namely `foldr' f z' ps'
21:09:33  where z' = f pn z from the right
21:10:11  ...oh i see
21:10:18  you can relax the type
21:10:29  how?
21:10:35  foldr :: (forall a b c. path a b -> result b c -> result a c) -> (forall a. result a a) -> PSeq path src dest -> result src dest
21:10:43  (just pasting to get something to edit)
21:10:50  I already releaxed foldr to result dest dest
21:10:53  and this doesn't work with that
21:10:56  or the quantified version
21:11:12  foldr :: (forall a b c. path a b -> result b c -> result a c) -> result dest end -> PSeq path src dest -> result src end
21:11:27  _that_ might work, and even with foldr'
21:12:09  same error:
21:12:11      Expected type: PSeq path src mid
21:12:11        Actual type: PSeq path src dest
21:12:11      In the third argument of `foldr'', namely `ps'
21:12:11      In the second argument of `seq', namely `foldr' f z' ps'
21:12:15  oh hm
21:12:22  that's not the same error but it's still a mismatch
21:12:23  ?
21:12:35  foldr'
21:12:35    :: (forall a b c. path a b -> result b c -> result a c)
21:12:35    -> result dest end
21:12:35    -> PSeq path src dest
21:12:35    -> result src end
21:12:36  foldr' f z ps =
21:12:38    case viewr ps of
21:12:40      PEmptyR -> z
21:12:41  oh hm
21:12:42      ps' :> pn ->
21:12:44        let z' = f pn z
21:12:46        in z' `seq` foldr' f z' ps
21:12:48  /home/elliott/Code/shiro/PSeq.hs:98:31:
21:12:50      Couldn't match type `dest' with `mid'
21:12:52        `dest' is a rigid type variable bound by
21:12:54               the type signature for
21:12:56                 foldr' :: (forall a b c. path a b -> result b c -> result a c)
21:12:58                           -> result dest end
21:12:59  elliott: foldr :: (forall a b c. path a b -> result b -> result a) -> result dest end -> PSeq path src dest -> result src
21:13:00                           -> PSeq path src dest
21:13:02                           -> result src end
21:13:04               at /home/elliott/Code/shiro/PSeq.hs:93:1
21:13:06        `mid' is a rigid type variable bound by
21:13:08              a pattern with constructor
21:13:10                :> :: forall (path :: * -> * -> *) src dest mid.
21:13:12                      PSeq path src mid -> path mid dest -> PViewR path src dest,
21:13:14              in a case alternative
21:13:16              at /home/elliott/Code/shiro/PSeq.hs:96:5
21:13:18      Expected type: PSeq path src mid
21:13:20        Actual type: PSeq path src dest
21:13:22      In the third argument of `foldr'', namely `ps'
21:13:24      In the second argument of `seq', namely `foldr' f z' ps'
21:13:26  Failed, modules loaded: none.
21:13:28  oerjan: wat
21:13:30  oerjan: "-> result dest end ->"
21:13:40  er oops
21:13:50  foldr :: (forall a b c. path a b -> result b -> result a) -> result dest -> PSeq path src dest -> result src
21:14:04  foldr', presumably
21:14:17  it is slightly awkward if you actually _want_ a type with dest in it, i guess...
21:14:19      Expected type: PSeq path src mid
21:14:19        Actual type: PSeq path src dest
21:14:19      In the third argument of `foldr'', namely `ps'
21:14:19      In the second argument of `seq', namely `foldr' f z' ps'
21:14:26  (because of wrong type argument order)
21:14:43  oerjan: otoh it does work as a type for foldr
21:14:43  foldl wouldn't have _that_ problem
21:14:47  but not for foldr'
21:14:57  oerjan: but then foldr (<|) empty doesn't type
21:14:58  so lol
21:15:15  indeed, wrong type argument order
21:15:27  the changing argument doesn't get last
21:16:33  oerjan: foldl' doesn't type either
21:16:40  also, the arguments always change with (<|)
21:16:42  apart from path
21:18:13  elliott: oh you have a bug
21:18:25  oerjan: ok tell me but beforehand
21:18:28  look at this
21:18:29  foldr (>>>) id
21:18:30    :: Category path => PSeq path src dest -> path src dest
21:18:31  in z' `seq` foldr' f z' ps  should be in z' `seq` foldr' f z' ps'
21:18:32  that is beautiful :')
21:18:46  oerjan: oh
21:18:49  will that fix things? :P
21:18:56  let's hope :P
21:19:21  nope
21:19:30  D:
21:19:48  oerjan: oh wait
21:19:55  oerjan: i think what needs changing is the type of f
21:19:57  oerjan: to go /backwards/
21:20:42  oerjan: i'm not sure what that looks like, though :P
21:22:11  oerjan: argh, here's another bug for you
21:22:13  singleton :: path a a -> PSeq path a a
21:22:19  oerjan: how stupid can I be??
21:24:21  oerjan: omg omg omg
21:24:26  oerjan:
21:24:27  instance (Arrow (~>)) => Arrow (PSeq (~>)) where
21:24:27    arr = singleton . arr
21:24:27    first ps =
21:24:27      case viewl ps of
21:24:27        PEmptyL -> empty
21:24:29        pn :< ps' -> first pn <| first ps'
21:25:24  oerjan is not nearly excited enough.
21:26:23  maybe not.
21:26:43  does that foldr' compile (although with warning) if you remove the empty branch?
21:27:32  oerjan: i'll try. but dude, PSeq is an arrow transformer!!!
21:28:01 -!- Ngevd has joined.
21:28:04  oerjan: no
21:28:10      Expected type: PSeq path src dest
21:28:10        Actual type: PSeq path src mid
21:28:10      In the third argument of `foldr'', namely `ps''
21:28:10      In the expression: foldr' f (f pn z) ps'
21:28:14  (yeah yeah I know it's not strict yet :P)
21:28:40  oerjan: you know, I could just unsafeCoerce this through
21:28:55  it's obviously a valid implementation
21:30:01  >_>
21:31:11  oerjan: you realise viewl/viewr unsafeCoerce already :P
21:31:34  oerjan: hm i note that there are two possible Categories for PSeq
21:31:38  oh hm is it complaining about the foldr' being used with polymorphic recursion, _despite_ having a type signature?
21:31:44  instance Category (PSeq path) where id = empty; (.) = flip (><)
21:32:00  instance (Category path) => Category (PSeq path) where id = singleton id; (.) = fold blah blah
21:32:09  oerjan: no, it's complaining because _ps' does not match the zero passed_
21:32:53  hm...
21:33:41  app :: (ArrowApply (~>)) => PSeq (~>) (PSeq (~>) b c, b) c
21:33:43  THIS WILL BE FUN
21:35:41  elliott: what is your current code for foldr' ?
21:35:57  oerjan: i rewrite it every time you come up with another idea. do you just want a file with foldr' in it? :P
21:36:13 -!- boily has quit (Ping timeout: 252 seconds).
21:36:29  i just want to see if you broke it in some way i haven't seen while fixing my bug reports :P
21:36:30 -!- copumpkin has changed nick to luke-sr.
21:36:42  charming :P
21:36:46  one second
21:36:56  hmm I have to write basically (PSeq (~>) b c, b) ~> c
21:37:17 -!- luke-sr has changed nick to copumpkin.
21:37:39  oerjan: http://sprunge.us/cjcR
21:37:39 -!- Patashu has joined.
21:38:03  ok, I have (b ~> c, b) ~> c
21:38:10  and I need to turn that into (PSeq (~>) b c, b) ~> c
21:38:40  so... app . first f
21:38:56  elliott: you removed the end type again, i believe that's essential
21:39:14  oerjan: oh, right.
21:39:20  oerjan: i told you it doesn't type with that, either, but ok i'll try
21:39:35  yes, but with that _and_ the ps fixed to ps' ? :P
21:39:55  oerjan: you'll never believe it
21:40:00  hm?
21:40:07  oerjan: it works :P
21:40:11 * elliott generalises foldr's type to that too
21:40:11  yay :P
21:41:26  for foldl and foldl' you can give result just one type argument, i think, because the fixed src is in the right place to be combined into result
21:42:29  oerjan: huh, so you can.
21:42:35  oerjan: that upsets me though :( it's so inconsistent
21:42:52 -!- DCliche has joined.
21:43:27  oerjan: :'(
21:43:37  oerjan: it also feels wrong that the more natural fold is the one which needs more gunk
21:43:41  you can do that with foldr[']? too, but then as you say foldr (>>>) id won't type
21:44:08  oerjan: not foldr (<|) empty either
21:44:49  PSeq (~>) (b, d) (c, d) -> PSeq (~>) b c
21:44:50  aaaaaaaa
21:44:56  because the type variable you want to combine is in the last place
21:45:18  wat
21:45:25  oh the loop
21:45:26  oerjan: loop :: a (b,d) (c,d) -> a b c
21:45:30  instance ArrowLoop (->) where
21:45:30      loop f b = let (c,d) = f (b,d) in c
21:45:41  god knows how to implement it for paths :P
21:45:48  i suppose i want to tie each node to itself?
21:45:54  or do i want to tie each node to the next node, and the last to the first...
21:46:02 -!- Darth_Cliche has quit (Ping timeout: 244 seconds).
21:46:18  you'd want to tie the final node to the first one?
21:46:32  oerjan: that's what I said
21:46:38  either that, or tie each node to itself, which seems useless
21:47:30  does arrowloop have any laws
21:47:36  monqy: "ow"
21:47:42  (probably yes but they're in a paper)
21:47:46  it's entirely lawless and evil
21:47:49  Learnt about Matrices in maths today
21:48:03  Finally figured out what they're up to
21:48:06  exciting?? I dislike matrices. yukce
21:48:19  They were kinda dissapointing
21:48:24  oerjan: oh well, I'll stick to the easy ones (ArrowZero, ArrowChoice)
21:48:26  what did you expect
21:48:32  matrices are cool.  just use a more interesting underlying ring :P
21:48:39  monqy, I dunno, something interesting
21:48:43  elliott: Works on Alpha with no changes.
21:48:48  Ngevd, you did graphs before matrices????
21:48:49  oerjan, I don't think I need that at AS level
21:48:49  oerjan: hmm...
21:48:53  Phantom_Hoover, yup
21:48:56  oerjan: I think you might want singleton id == empty
21:48:57  oerjan: for PSeqs
21:49:01  oerjan: there is nothing you can do to make matrices cool sory :(
21:49:07  oerjan: when the path is a category
21:49:08  elliott: Have I mentioned that this JIT is magic and amazing :P
21:49:13  Gregor: Yes.
21:49:29  elliott: if you do that, you need to elude _all_ singleton id's
21:49:35  oerjan: yeah :P
21:49:36  kinda tricky
21:49:44  oerjan: ok, so this is a decent PSeq
21:49:51  oerjan: now it need to be applied >:)
21:49:58  oerjan: oh yeah, about MetaContext
21:50:09  04:25:05:  data MetaContext = MetaContext { nwNeighbor :: MetaCursor (To NW), ..., up :: MetaCursor dir, signPost :: SignPost } -- it occurs to me that some field name disambiguation will be needed
21:50:12  oerjan: are all neighbours present here?
21:50:17  or is one elided?
21:51:05  all, i should think...
21:51:10  oh hm
21:51:21  there needs to be a Leaf version of that too
21:51:21  oerjan: well the next question is "wtf is dir"
21:51:51  elliott: the usual, the direction this node is in relation to its parent
21:51:54  elliott: hmm, I think you could make a stack-based solution work, but it's dubious that it's better than substitution in this case
21:52:03  oerjan: so quantified?
21:52:06  elliott: oh should probably be From dir
21:52:15  as far as I can tell, substitution is more space-efficient and equally time-efficient
21:52:26  oerjan: what does the leaf version look like?
21:52:30  Ngevd, wait, have you learnt matrix multiplication?
21:52:36  ais523: well, OK
21:52:41  elliott: it has no neigbors, i'd think
21:52:48  only the up and the signPost
21:52:50  oerjan: so just (MetaCursor dir, SignPost)?
21:52:50  ok
21:53:02  oerjan: what's the non-leaf case? aka name the constructor :P
21:53:09  the problem is that the stack would only ever be pushed, and you'd have to GC the bottom of the stack when it went out of scope, which is nontrivial to determine
21:53:19  Phantom_Hoover, just today
21:53:36  Ngevd, matrix multiplication is the worst.
21:53:41  it's awful
21:53:45  It's messed up
21:53:47  InternalContext ?
21:53:52  not really messed up
21:53:54  just awful
21:54:01  I need to stare into space for a minute to remember which way round everything is.
21:54:05  I keep losing track of it
21:54:05  yeah
21:54:19  oerjan: um i was hoping for something short to compliment MCLeaf
21:54:31  I think I've been taught it three different times by now.
21:54:47  Sounds like you have a very good maths teacher
21:55:01  We've been taught simultaneous equations a few dozen times
21:55:56  Have you done them with MATRICES?
21:56:21  Not yet
21:56:32  We've been hinted at that we will shortly
21:56:35  > let mult m1 m2 = [[sum$zipWith(*)r1 c2 | c2 <- transpose m2]| r1 <- m1] in mult [[1,0],[0,2]] [[1,2,3],[4,5,6]]
21:56:36    [[1,2,3],[8,10,12]]
21:56:47  oerjan: MCFrom? MCTo? work with me here :P
21:56:57  argh, the MC prefix clashes with MetaCursor
21:56:58  oh hm
21:57:04  MCInner
21:57:07 -!- pikhq has joined.
21:57:14 -!- pikhq_ has quit (Ping timeout: 258 seconds).
21:57:33  Ngevd, and then, through some process that was never adequately explained to me, you use them for cross products.
21:57:37  data MetaNode exit where
21:57:37    MNFrom :: Neighbours1 MetaCursor dir
21:57:37           -> MetaCursor (From dir)
21:57:37           -> SignPost
21:57:37           -> MetaNode (From dir)
21:57:38    MNTo :: Neighbours MetaCursor -> SignPost -> MetaNode (To dir)
21:57:40    MNLeaf :: LeafData -> SignPost -> MetaNode (To dir)
21:57:42  data MetaContext where
21:57:44    MCMInner :: Neighbours MetaCursor
21:57:46             -> MetaCursor (From dir)
21:57:48             -> SignPost
21:57:50             -> MetaContext
21:57:52    MCLeaf :: MetaCursor (From dir) -> SignPost -> MetaContext
21:57:54  oerjan: somewhat of a resemblance
21:57:56  s/MInner/Inner/
21:58:17  And *then* you get to the second-order non-homogeneous differential equations god I hate second-order non-homogeneous differential equations.
21:58:29  elliott: yes, the difference is MetaNode has a distinguished exit
21:58:37  ais523: an answer to the question "What exactly the error message is?" seen on a mailing list: "It's about glib lib."
21:58:44  oerjan: right
21:58:57  oerjan: it feels like i'd have half the types if everything took a list of directions to exclude on the type level :P
21:59:12  Phantom_Hoover, I'm scared
21:59:13  heh
21:59:20  Ngevd, YOU SHOULD BE
21:59:33  > length "irregularwebcomic"
21:59:34    17
21:59:50  That was irrelevant to this conversation
22:01:09  oerjan: ok, you know what the next question is (or do you??)
22:01:46 * oerjan afraid
22:02:33  oerjan: I need a space to play around with :P
22:02:49  my leaf data is just String, so "" will work there, my IpId is just Int so that's easy, and my IpData is Double which can just be whatever
22:03:00  what type do i want as the top-level "space with n cursors"?
22:03:34  MetaContext was sort of what i imagine as the "start-from-here" type
22:03:41  ok
22:04:04  oerjan: Leaf or Inner? :P
22:04:17  Okay, if I ever say I'm going to install Haiku, can someone tell me I've already got the ISO and the image, and I need an SD card larger than 16MB
22:04:34  Leaf probably, since you would start on some actual befunge or what-it's-you're-doing cell spot
22:04:46  oerjan: right
22:05:30  oerjan: the SignPost should just be (Map.singleton 0 (Left pi)), right? if the IP ID is 0 and the data is pi
22:05:38  elliott: ah, might want a LeafData in the MCLeaf too
22:05:41  ok :P
22:06:00  yeah i'd think
22:06:11  alright, all I need is a MetaCursor (From dir) now
22:06:29  data MetaCursor src where
22:06:29    MCPlain :: PlainCursor src -> MetaCursor src
22:06:29    MCPath  :: MetaPath src dest -> MetaNode dest -> MetaCursor src
22:06:37  oerjan: you'll never guess what the next question is
22:06:38  and since you're starting with only a cursor there, that MetaCursor should be MCPlain
22:07:22  ok, and the type tells me I need PCFrom
22:07:30  MCPath only starts being used once you have two real cursors in different spots
22:08:06  oerjan: hmm, I can get to the neighbours afterwards, but what should the PlainCursor of the same type that PCFrom wants be?
22:08:11  oh, that's going upwards, right?
22:08:16  as in, going "larger"
22:08:27  yeah
22:08:39  oerjan: so it should be circular?
22:08:42  so From something
22:08:44  because i have a completely empty space right now
22:08:49  i.e.
22:08:51          pc = PCFrom undefined pc
22:08:55    PCFrom :: Neighbours1 PlainCursor dir
22:08:55           -> PlainCursor (From dir)
22:08:55           -> PlainCursor (From dir)
22:09:26 -!- Ngevd has quit (Quit: Goodbye).
22:09:54  well not entirely circular, things have types that change between the levels...
22:10:02  oerjan: um that is impossible
22:10:04            -> PlainCursor (From dir)
22:10:04            -> PlainCursor (From dir)
22:10:06  exact same type
22:11:01  oh hm so it is
22:11:28  i guess the level types got forgotten in the transition to this.  maybe just as well :P
22:11:52  oerjan: i'm not sure that would even work :P
22:12:03  oerjan: it could be polymorphically recursive anyway i think
22:12:06  oh there's probably _some_ way
22:12:30  ok, so now I need a (Neighbours1 PlainCursor dir)
22:12:43  let's pick dir ~ NW :P
22:12:53  so (Neighbours1 PlainCursor NW)
22:12:56    Neighbours1NW :: t (To NE) -> t (To SW) -> t (To SE) -> Neighbours1 t NW
22:13:06  oerjan: time for polymorphic recursion, right?
22:13:12  (Neighbours1NW pc pc pc)
22:13:21  oh, no!
22:13:23  pc is a PCFrom
22:13:24  I need a To
22:13:33    PCTo :: Neighbours PlainCursor -> PlainCursor (To dir)
22:13:33    PCLeaf :: LeafData -> PlainCursor (To dir)
22:13:47  oerjan: ok, help me out here :P I want an infinite space with "" on all the leaves
22:13:48  i'm not sure i understand your Neighbors1 stuff
22:13:59  oerjan: Neighbours1 t dir is just t (To dir') for all dir ~/~ dir'
22:14:15  to abstract all the "twenty constructors because we have a neighbour for every other direction" crap
22:14:23  oh hm
22:14:37  elliott: there's an error there i think
22:14:42  oh no
22:15:15  the dir in the second argument to PCFrom is the up dir, so should be unrelated to the others
22:15:16  oerjan: i was curious indeed because it seemed like I either had to make a finite space or have no leaves
22:15:33  iiuc
22:15:42  one second then
22:16:17    PCFrom :: Neighbours1 PlainCursor dir
22:16:17           -> PlainCursor (From dir')
22:16:17           -> PlainCursor (From dir)
22:16:18  oerjan: yus?
22:17:37  yeah
22:17:39  test :: MetaContext
22:17:39  test = LeafCtx "" mc (SignPost $ Map.singleton 0 (Left pi))
22:17:39    where mc = MCPlain pc
22:17:39          pc = PCFrom (Neighbours1NW pc' pc' pc') pc
22:17:39          pc' :: PlainCursor (To dir)
22:17:40          pc' = PCLeaf ""
22:17:43  oerjan: that's an infinite space of ""s, right?
22:18:25  that's wrong though, the pc part
22:18:46  oerjan: :(
22:19:00  you need to include the level as an Int argument or something, so you know how far to go _down_ again before hitting leaves
22:19:32  so mc = MCPlain (pc 0)
22:19:58  oerjan: hmm, and what does pc look like then?
22:20:08  what program are you discussing, btw? Shiro?
22:20:15  pc n = PCFrom (Neighbours1NW (pc' n) (pc' n) (pc' n)) (pc (n+1))
22:20:31  pc' 0 = PCLeaf ""
22:20:33  ais523: yes
22:21:01  oerjan: ok
22:21:10  oerjan: pc' n?
22:21:21  pc' n = PCTo (pc' (n-1)) (pc' (n-1)) (pc' (n-1)) (pc' (n-1))
22:21:28  or something like that
22:21:42  oerjan: (and out of curiosity, what kind of space did I produce with my erroneous version? it certainly /types/
22:22:29  a space where you go up just fine, but where going down from anywhere other than the "trunk" gives you a leaf _immediately_
22:22:33  i think.
22:22:43  *down to
22:22:53  oerjan: ah.
22:22:58  oerjan: that doesn't sound like normal 2d space :-)
22:23:06  indeed not :P
22:23:23  oerjan: imagining that is hurting my head :P
22:24:09  it's like shrinking every quadtree region other than those containing your starting point into a single leaf
22:24:48  test :: MetaContext
22:24:48  test = LeafCtx "" mc (SignPost $ Map.singleton 0 (Left pi))
22:24:48    where mc = MCPlain (pc 0)
22:24:48          pc n = PCFrom (Neighbours1NW (pc' n) (pc' n) (pc' n)) (pc (n+1))
22:24:48          pc' :: Int -> PlainCursor (To dir)
22:24:49          pc' 0 = PCLeaf ""
22:24:51          pc' n = PCTo (Neighbours (pc' (n-1)) (pc' (n-1)) (pc' (n-1)) (pc' (n-1)))
22:24:53  oerjan: success
22:25:02  ah
22:25:22  oerjan: I would use Integer, but... good luck allocating that much
22:26:07  oerjan: ok, so now for the question that will make you _really_ hate me.
22:26:12  if you gave To and From type level integer arguments... >:)
22:26:23  oerjan: how do I make the focused cursor go east? :-)
22:26:36  AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
22:27:16  well, in this case you'd first go up, then To NE
22:29:02  oerjan: so would it be MetaContext -> MetaContext?
22:29:08  i guess
22:30:02  oerjan: reassuring :P
22:30:09  food ->
22:32:22  elliott: Don't read too much into this question, but which words are absolutely fundamental to Forth?
22:32:50  Gregor: Forth as in "like ANS Forth", or "like /Forth/" as in "particularly high in Forthiness"?
22:32:58  (colorForth is more /Forth/ than ANS Forth, but not very ANS Forth at all)
22:33:07  elliott: Basically Forth flavored.
22:33:08  Heh, the sun's core produces about as much heat per cubic metre as a compost heap.
22:33:17  Gregor: But take a look at jonesforth, and previous IOCCC entry -- what was it called -- fifth?
22:33:26  Gregor: http://www.ioccc.org/1992/buzzard.2.design
22:33:28  elliott: But was it a JIT :P
22:33:38  Gregor: See also other buzzard files in http://www.ioccc.org/1992/
22:33:43  Gregor: And all Forths are JITs.
22:34:06  Gregor: Erm, buzzard.2 that is.
22:34:11  elliott: They certainly ought to be, but if there's already been a JIT in IOCCC, URGGGGGGH
22:34:27  And http://www.ioccc.org/1992/third of course.
22:34:31  Gregor: Well, no.
22:34:32  Gregor: A threaded code JIT is a little bit different from what you're doing, of course.
22:34:37  Gregor: buzzard is just a freaky-deaky little thing.
22:34:50  A threaded-code JIT ain't a JIT, it's a bytecode interpreter.
22:34:56  BAH
22:35:04  Thee and thy making more sense than I
22:35:06  Gregor: A bytecode interpreter that doesn't have an interpreter loop...
22:35:10  s/Thee/Thou/
22:35:15  elliott: So?
22:35:27  Gregor: An interpreter loop is sort of the defining feature of an interperter.
22:35:37  elliott: (I mean, it's good fun, but "So?" in the not-competing-with-my-niche sense)
22:35:44  Gregor: Well, sure.
22:35:53  Gregor: "Traditionally" JITting Forth is pretty heretical, anyway :P
22:36:08  elliott: Oh, it has an interpreter loop. Which has been placed at the end of every primitive. :P
22:36:12  Gregor: Pretty sure first (buzzard.2) has an interpreter loop for the threaded code, anyway.
22:36:30  I was just thinking that really there's nothing at this point that's holding me to my particularly-bad language choice.
22:37:06  Gregor: I think the judges might be unimpressed with "minimalistic Forth-like with most primitives implemented in itself", since that's exactly what FIRST/THIRD did so spectacularly :P
22:37:11  And in under 500 bytes.
22:37:17  (With indentation etc.!)
22:37:25  Gregor: So, change your language, but probably not to something Forthy.
22:37:30  Fair 'nuff.
22:37:48  Go more functional.
22:37:59  (note: don't)
22:38:01  I don't think his JIT would be any good at that :P
22:38:07  Indeed it would not.
22:38:16  elliott: He'd also want a GC if he wanted to do it right. :P
22:38:18  Gregor: ...OTOH, a mini-Lispalike might be interesting :P
22:38:24  >_>
22:38:33  Lisp isn't exactly a functional language anyway. But I realise you have biases :P
22:38:34  Aaaand, if you pull off a GC in the size restrictions, you are God.
22:38:45  Yeah, the GC is the real thing thar :P
22:38:50  Ehhhhhh
22:38:55  Lisp programs don't cons THAT much.
22:38:58 * Gregor taps his foot ...
22:39:09  Especially if you offer mutation of conses.
22:39:09  Yeah, I'm gettin' awfully close to the size restriction as stands.
22:39:13  1888 bytes at last count.
22:39:47  Gregor: I still think if you can't impress people with an interesting language, impressing them with an end result is almost as good.
22:39:55  i.e. Write a program that does something fancy :P
22:41:09  Gregor: Do you manually turn full.c into jitchards.c?
22:41:11  Harsh.
22:42:13  elliott: Uhhh, thusfar all I've done is selected areas of code in visual mode and G-Q in vim.
22:42:24  X-D
22:42:39  Gregor: Not true: You use 9<<25 in jitchards.c but W in full.c
22:42:53  elliott: I haven't updated jitchards.c in a while.
22:45:06  Gregor: Whoops, accidentally forked jitchards :P
22:45:13 * elliott deletifies.
22:45:37  elliott: >_> Does bitbucket let me prevent that I wonder
22:45:45  Gregor: It was privately, since I didn't futz with the boxes.
22:45:51  Ah
22:45:58  Gregor: (It was only slightly "accidental" :P)
22:47:39  Gregor: BTW, I would test with gcc 3 too >_>
22:48:05  Gregor: I find it really hard to believe that IOCCC isn't run on some ancient IRIX box :P
22:48:17  EVEN IF THEY DO HAVE A TWITTER
22:48:27  X-D
22:49:10  Gregor: "On the Vax main is called with
22:49:10  the calls instruction which uses the first word of the subroutine as a
22:49:10  mask of registers to be saved.  So on the Vax the first word can be anything."
22:49:19  -- http://www.ioccc.org/1984/mullender.hint, the famous "main is a string" prorgam, referenced from the FAQ
22:49:22  Gregor: That explains your VAX troubles :)
22:49:42  elliott: I fixed my VAX troubles (now I'm having different VAX troubles)
22:49:50  VAX troublen.
22:53:03  Gregor: Come on, laugh :'(
22:54:12  Wow, IOCCC have a standard entry format :P
22:54:16  As in, custom file format...
22:56:56  "mentioning your name or any identifying information in the remark section (or in the C code for that matter) - we like to be unbiased during the judging rounds; we look at the author name only if an entry wins"
22:56:56  Heh
22:57:23  Gregor: Looks like you can't submit a makefile, just makefile lines
22:58:03 -!- Darth_Cliche has joined.
22:58:28 * Phantom_Hoover → sleep
22:58:29 -!- Phantom_Hoover has quit (Quit: Leaving).
22:58:38  Ooh, they tell you to test on a UNIX or POSIX-conforming machine. Gregor: You're going to have to test it on OS X.
22:58:47  Wait.
22:58:56  Interix
22:58:57  It says conforming, not "said to be conformant by people with money".
22:59:04  Gregor: Your chances of fulfilling their guidelines are 0.
22:59:36  "Your entry must compile with GCC and run under at least one flavor of UNIX (e.g. Linux or Solaris). To improve chances to win, it should work under both BSD and SysV style UNIX (think stty cbreak), and should not depend on endianness."
22:59:42  Aww, "style".
22:59:46  I was hoping they tested on real live SysV.
23:00:47  what is stty cbreak and why would it be relevant for an ioccc entry?
23:01:19  "$BSD = -f '/vmunix';
23:01:19  if ($BSD) {
23:01:19      system "stty cbreak /dev/tty 2>&1";
23:01:19  }
23:01:19  else {
23:01:19      system "stty", '-icanon',
23:01:21      system "stty", 'eol', "\001";
23:01:23  }"
23:01:25  -- ancient perl faq
23:01:27  Presumably you have to do the latter on sysv
23:01:33 -!- DCliche has quit (Ping timeout: 260 seconds).
23:01:43  IOCCC entries are allowed to call system()
23:01:56  mmkay... the question is, what does it do? :)
23:02:33  Puts the terminal into rare mode, methinks
23:02:42  As in, ^C and the like still send signals, but apart from that it's raw and unbuffered
23:02:59  So, useful for console tricks and the like
23:03:45  http://www.opensource.apple.com/source/gnuzip/gnuzip-28/gzip/zmore.in oh my god, is this real
23:09:08  Funny, I call that "less".
23:09:28  Yay, LESSOPEN.
23:15:31  hey oerjan
23:15:35  EAST >:)
23:17:26  ais523: i note that NEF might give you problems whenever you neeed a circular structure
23:20:34   "Your entry must compile with GCC and run under at least one flavor of UNIX (e.g. Linux or Solaris). To improve chances to win, it should work under both BSD and SysV style UNIX (think stty cbreak), and should not depend on endianness." // nothing I do is especially OS-dependent.
23:20:40  elliott: I see no reason why it wouldn't work on SysV.
23:21:06  More like System... SUCKS
23:23:08  ais523: hmm, why does substat take both v and c?
23:23:12  ais523: or is one of them always Error?
23:25:27 -!- augur has quit (Remote host closed the connection).
23:25:32  it takes both v and c when substituting in a type 2 value; and v and error when substituting in a type 1 value
23:25:41  to avoid code duplication
23:26:52  ais523: wait, type 2 values have two values?
23:27:07  hmm, substituting "in"
23:27:10  wait, hmm
23:27:27  ais523: do the two arguments to a type-2 function have the same number?
23:27:38  elliott: yes, at definition site
23:27:41  and which is used depends on context
23:28:02  aha, what's happening is that substat is doing two substitutions simultaneously, one on c, one on v
23:28:02  ais523: context being, the type it's used in?
23:28:07  yep
23:28:10  OK
23:28:21  you can always tell what type something is from where it is in the program, and the two args always have different types
23:28:35  the interp I pasted actually adds a suffix, "c" for type 1 or "v" for type 2
23:28:44  (because suffixing numbers with numbers doesn't really work well)
23:28:57 * elliott thinks you should call the types c and v instead
23:29:12  elliott: OK, it seems my biggest VAX bug was outright stupidity.
23:29:37  elliott: Using e where I meant x, thereby making the place I'm JITting into point off into the text segment.
23:30:40  I mean, c and v are much nicer names than 1 and 2. Probably.
23:32:38  ais523: Actually I'm just going to call them c in v in my implementation.
23:32:40  You can't stop me.
23:32:42 * elliott rebel
23:32:48  fair enough
23:33:02  1 and 2, I find more memorable, because 1 args and 2 args
23:34:24  ais523: (VarC 0) is always illegal in the body of a c-lambda right?
23:34:29  because it only has one argument, of type V
23:34:45  elliott: if 0 refers to the c-lambda itself, yes
23:34:58  it's obviously legal if there are other lambdas in between, so that 0 has a different referent, and refers to a v-lambda
23:35:09  that's not what "refers to" means, your terminology is awful
23:35:43  err, refers to the variables of the c-lambda
23:35:46  (which there is only one of)
23:36:35  elliott: ... ... actually it doesn't work on OS X :P
23:36:39  Gregor: lol
23:37:36  some sort of anti-JIT security feature?
23:37:59  ais523: Nope, just more nonsense.
23:38:23  ...
23:38:23  00001f1a        leave
23:38:23  00001f1b        ret
23:38:23  00001f1c        calll   0x00037f14
23:38:45  "I thought I'd just call this absolute address after returning. Made sense at the time. Good luck finding an epilogue here.
23:38:47  "
23:39:30  callllllllll
23:39:47  monqy: Dood, it's gonna call the HELL out of that function.
23:40:07  what IS that function
23:41:04  presumably the function that gets called after a return statement returns
23:41:16  it probably says "error: backwards return" or something like that
23:41:25  error: help
23:41:38  maybe os x has built-in coroutine support
23:41:44  you can "ter" to jump to just after the last ret
23:41:53  and it restores the registers and shit, by using a spaghetti stack
23:42:07  and that's calling the "resumed non-coroutine" function
23:42:09  makes perfect sense!
23:45:59  ais523: hmm, I think substat is doing the work of about three functions :P
23:46:11  yep, seems about right
23:46:17  it was four or five earlier but I realised I didn't need some of htem
23:46:18  *them
23:47:08  elliott: Out of curiosity, have you tried to run my JIT?
23:47:10  ais523: you only ever need one function, actually!
23:47:15  Gregor: Hell no; should I?
23:47:18  elliott: 'cuz so far all I really know is that it works on all these systems for me :P
23:47:56  Gregor: I'm on boring x86-64/Linux/gcc 4.6
23:48:15  Gregor: Try it on ZETA C
23:48:23  lol
23:48:27  Yeah, that'll work well.
23:48:36  Gregor: Bignum int, pointers are cons pairs... what could go wrong?
23:49:45  try it in bcc (a 16-bit C compiler)
23:49:49  (that, umm, only understands K&R, I think)
23:50:24  ais523: That's actually a decent idea
23:50:32  Gregor: Do that (it has a flag to automatically run unprotoize before compilation)
23:51:01  elliott: sizeof(int) must be frightening
23:51:17  ais523: 16-bit won't ever work.
23:51:44  TIL that pikhq is frightened of 2
23:51:54  ais523: Bignum int.
23:52:03  oh, I see
23:52:09  wrong context
23:53:52  ais523: 2 is pretty terrifying
23:54:31  Incidentally, there are less-shitty i86 compilers out there :P
23:54:51  i.e. owcc (wow, it's amazing to categorize owcc as LESS shitty than anything)
23:54:58  s/i\.e\./e.g./
23:56:04  ais523: so, the Exp inside a CallC -- sorry, the program inside a Call1 -- has a new binding in scope, right?
23:56:22  and the programs inside a Call2 each have a new c binding and a new v binding with the same number (the same binding on each arm?)
23:56:29  yep, I think so
23:56:50 -!- ais523 has quit (Quit: 2).
23:57:08  /quit 2

2011-11-17:

00:00:42  elliott: Shoot ... I don't think I can make VAX work :(
00:00:46  Gregor: :(
00:00:47  :(
00:01:43  Butbut all the world's a VAX!
00:02:14  It's CISC but (apparently?) functions have to be 16-bit aligned!
00:02:42  data ExitVal = To DirVal | From DirVal; data DirVal = NW | NE | SW | SE; class Exit e where exitVal :: p e -> ExitVal; instance Dir d => Exit (To d) where exitVal x = To (dirVal x); ... class Dir d where dirVal :: p d => DirVal; instance Dir NW where dirVal _ = NW; ...
00:02:49  I can't really cope with function alignment not being the same as the smallest opcode.
00:02:52  Gregor: Just align everything?
00:02:58  i think something like that is needed to actually _test_ these directions
00:03:03  Gregor: It shouldn't hurt to align everything to n * size of smallest opcode for smoe n
00:03:04  some
00:03:42  hm why did i write p, i was going to use t...
00:03:55  data ExitVal = To DirVal | From DirVal; data DirVal = NW | NE | SW | SE;
00:03:58  i already have those
00:04:08  ah
00:04:09  without the reification stuff, though
00:04:11  but i can add that
00:04:36  and also a bunch of the datatypes need Dir dir => contexts for their quantified types
00:04:51  otherwise they might be type erased entirely
00:04:56  oerjan: this is so you can "ascend SW" or whatever right?
00:05:59  Gregor: The crap?
00:06:09  no, this was primarily so i can look at a gadt value and actually find out which dirs it _uses_ inside
00:07:10  oerjan: ah.
00:07:14 * Gregor reappears.
00:07:15 -!- augur has joined.
00:07:17  oerjan: mightn't a type family fit better? perhaps not
00:07:20  elliott: It's not the codegen that's the problem.
00:07:25  elliott: It's pro/epilogue detection.
00:07:32  Gregor: Alright
00:07:38  i dunno, if you see how...
00:07:46  i'm not so familiar with them.
00:07:50   Gregor: The crap? // the crap what?
00:08:50 -!- CakeProphet has joined.
00:08:50 -!- CakeProphet has quit (Changing host).
00:08:50 -!- CakeProphet has joined.
00:09:39  16-bit alignment for functions?
00:09:40 -!- Slereah has joined.
00:09:41  *16* bit?
00:10:39  Ayup :P
00:10:42 -!- Slereah_ has quit (Ping timeout: 244 seconds).
00:12:22  Still, even without VAX, I feel that x86[_64], SPARC, MIPS[el], ARM, PPC, Alpha is a pretty good list.
00:26:45 -!- CakeProphet has quit (Ping timeout: 258 seconds).
00:31:56 -!- augur has quit (Remote host closed the connection).
00:44:54  oerjan: go on... :P
00:49:12 -!- hagb4rd has quit (Ping timeout: 240 seconds).
00:51:33 -!- tiffany has quit (Quit: nyu~).
00:57:24  oerjan: :(
00:58:34  the problem is, i'm actually fed up of this already
00:58:45  (in case that wasn't obvious)
00:58:48 * elliott creys
01:01:48  oerjan shall forever be known as the person who sided with the finns and swedes
01:02:14  wut
01:02:21  deewiant and vorpal
01:02:34  JUST SAYING
01:05:21 -!- pikhq_ has joined.
01:07:38 -!- pikhq has quit (Ping timeout: 252 seconds).
01:11:01  oerjan has now committed seppuku.
01:11:16  brains...
01:11:24  hi
01:11:27 -!- Sgeo|web has joined.
01:11:30  hi brains
01:11:49  Hi
01:11:52  oerjan: i will now pester monqy for the algorithm instead to make you feel bad.
01:11:58  monqy: hi algorithm
01:12:02  what algorithm :(
01:12:03  hi
01:12:04  fancy
01:12:36  Ok, two different people in two different chatrooms greeted with pluralization...
01:12:50  Although I assume "brains" is just a part of context of prior conversation
01:13:08  monqy: east algorithm
01:13:16  oerjan is too scandinavian to tell me the secrets
01:13:18  east algorithm
01:13:50  what is east algorithm what are you talking about ;_; ;_;; _;;;;;
01:14:06  iv'eb eeeen too busy python to pay attenteion :(
01:14:59  well basically you need to go up in a quadtree, then in the right direction to end up east of where you were.  the trouble is all the extra scaffolding of data which makes even those steps insanely tricky
01:15:55  oerjan: i'm going to give it a shot myself, and if i fail i will die HOPE YOU FEEL GOOD
01:17:26  yay
01:17:31  i mean, aww
01:17:51  oerjan: um out of curiosity is the "p" used in exitVal/dirVal just standing in for Proxy or similar?
01:17:58  or do you actually plan to apply them to MetaNodes or something
01:18:02  Sgeo|web: BRAINS...
01:18:49  elliott: as i said, i really wanted it to be t, similar to in your Neighbors* types
01:19:06  right
01:19:07  elliott: and yes, the idea was to just be able to put in any of those
01:20:27  oerjan: otoh it fails slightly because you have "p (To NW)" and you apply dirVal to it but dirVal is expecting "p NW"...
01:20:42  oh hm
01:21:10  oerjan: it's easy enough to make a proxy out of it though
01:21:22  a (b c) -> Proxy c :p
01:21:27  yeah.  whatever you think easiest.
01:21:28  or just use scoped type variables
01:21:50  erm, scoped type variables are tricky with gadts
01:22:00  it seemed to me
01:22:19  it doesn't capture those that appear from pattern matching
01:22:25  er I meant
01:22:28  instance (DirectionType dir) => ExitType (To dir) where
01:22:28    exitVal = To $ directionVal (Proxy :: Proxy dir)
01:22:33  not replacing the whole mechanism with them
01:22:43  ah
01:22:48  it avoids a silly "a (b c) -> Proxy c" function to make the types work out
01:25:09  time to write "ascend :: MetaContext -> MetaContext"...
01:25:29 -!- augur has joined.
01:26:27  to find out how that changes the structure, it is necessary to know how many of the neighbors of the source and destination node lead to other real cursors
01:27:03  ugh.
01:27:24  oerjan: btw, I'm not sure a class actually /is/ needed, because everything ends up containing Neighbours, and you can pattern-match on those to determine which direction is being used >:)
01:27:39  in other words: /me adds class contexts to everything
01:27:48  elliott: not leafs, i thought...
01:27:54  well probably not :P
01:29:19  because if you are leaving a node with > 2 such neighbors, it gets turned into a MetaNode, while if it has 1, it gets merged into that one's MetaPath, while if it has 0, it and its neighbors get turned into a PlainCursor.
01:29:32  er, * >= 2
01:29:53  oh, excluding neighbors in the direction you are going, of course
01:31:23  ah and of course if there is another real cursor on the node _itself_, it always becomes a MetaNode.
01:31:45 * elliott is getting very suspicious of these very-similar data types that seem to give rise to a bunch of special cases.
01:31:58  heh
01:32:36  a MetaNode either contains a real cursor or is sort of a crossing whose signPost tells you how to get to other real cursors
01:33:45  i am also kind of suspicious of how the "zipper of tree of zippers" thing is sort of tied to the zippers themselves
01:33:56  hm?
01:34:14  well, it seems like you should be able to do that completely separately from the zipper operations themselves.
01:35:18  oerjan: also, I think SignPost is broken. there's nowhere to stash the IpData when switching cursor
01:35:51  wasn't it Either IpData Exit?
01:36:06  yes, but presumably you have to change it to the relevant Exit when switching cursors...
01:36:13  since you use the SignPost to figure out whether you're at a given cursor or not
01:36:16  and if not, how to get to it
01:37:32  well when you leave a node carrying a cursor, you change that node's signPost from containing the ipData to containing the exit, of course; at the same time you change the node you're going to to contain the ipData
01:37:55  oh
01:38:00  that makes sense :P
01:38:57  it may be that the entire SignPost gets moved to the new node, if the old one is packed into a MetaPath while the new one became unpacked from one
01:39:08  it seems like the leaf data should contain the IpId
01:40:19  well... i guess cursors that aren't in the move will always be on leaves
01:40:21 -!- pikhq has joined.
01:40:44  oerjan: well otherwise I have to scan the entire signpost just to find the value that's Left
01:41:13  erm, you just lookup your current ip, surely
01:41:32  there can be more than one ip at the same spot, too
01:41:36  oerjan: how
01:41:39  so more than one Left
01:41:41    LeafCtx :: (Direction dir)
01:41:41            => LeafData
01:41:41            -> MetaCursor (From dir)
01:41:41            -> SignPost
01:41:41            -> MetaContext
01:42:14  the SignPost can contain more than one ip key whose value is Left ...
01:42:16 -!- pikhq_ has quit (Ping timeout: 244 seconds).
01:42:26  corresponding to two ips in the same cell
01:42:30  oerjan: well, okay. I was going by  well when you leave a node carrying a cursor, you change that node's signPost from containing the ipData to containing the exit, of course; at the same time you change the node you're going to to contain the ipData
01:42:51  oh, only for the ip key you are actually _moving_
01:43:24  /cursor
01:43:53  oerjan: right. and how am i suppose to determine which one that is?
01:44:08  oh right, i forgot about that...
01:44:13  lol
01:44:18  you should take the ip as an argument to ascend
01:44:28  ok
01:46:28 * elliott idly wonders about a data structure that acts as a set of bytestrings; given a hash of one of the bytestrings, you can get the bytestring out, and given a hash that matches none of the bytestrings in the set, you can determine that it isn't present; but (a) it is unfeasible (brute-forcey) to get a valid hash out of the data without knowing one, and (b) it is unfeasible to access any bytestring without knowing its hash
01:46:47  I was thinking you could encrypt each bytestring with its hash as the key, but you need a way to go from the hash to that data, and that ends up storing the hash itself...
01:47:01  ooh: you could implement it as a lookup table from a hash of the hash to the bytestring encrypted with the hash
01:47:11  then doing (a) or (b) requires reversing the hash function
01:48:09  i'm sure this must have been investigated
01:48:33  probably, but i have no idea what i would google for
01:49:19 -!- derdon has quit (Remote host closed the connection).
01:49:32 -!- CakeProphet has joined.
01:49:32 -!- CakeProphet has quit (Changing host).
01:49:32 -!- CakeProphet has joined.
01:49:38  hi.
01:50:00  okay so when I convert the integer 5 to a float via c-style casting in C++
01:50:08  that is 5.0 correct?
01:50:14  or is it something weird?
01:50:20  elliott: hm, all the difficulty in implementing that is in implementing one-point sets, i think
01:50:27  then you can just make a list of them
01:50:38 -!- copumpkin has changed nick to luke-sr.
01:50:53  assuming you don't consider iterating through all too expensive
01:50:54 -!- luke-sr has changed nick to copumpkin.
01:52:20  oerjan: that is indeed too expensive.
01:52:29  CakeProphet: yes
01:52:46  oh hm of course you could simply use the hash to look the right one up in a hashtable
01:53:21  oh hm i didn't read (a) properly
01:53:34  oerjan: you could do that and not store the keys
01:53:45  so it's O(n) in how many hashtable collisions there are to look up
01:53:54  oh wait
01:53:58  yeah that works
01:53:59  um wouldn't (a) make it impossible to _construct_ your data structure?
01:54:12  elliott: ah okay, see I thought differing representations of would mess things up, but... I guess not?
01:54:13  from the data you want to put in it
01:54:22  *of floats and ints
01:54:32  oerjan: well, with my proposed solution: table[hash(hash(data))] = encrypt(data, key=hash(data))
01:55:52  or is it that c-style case in C++ does nice automatic conversion, with reinterpret_cast being an actual C-like cast?
01:55:56  help I am C nub.
01:56:02  s/case/cst/
01:56:05  wehriuheriuhwUEHR UW EHRU HWUEIRH YU23H  78H
01:57:42 -!- pikhq has quit (Read error: Connection reset by peer).
01:57:58 -!- pikhq has joined.
01:58:42  it's times like this that I wish my data structures course was in Haskell. :P
01:59:33  > 5 `div` 2
01:59:34    2
01:59:36  > 5 / 2
01:59:37    2.5
02:01:22  elliott: hey I'm making a hash table too!!! :D :D :D :#
02:01:32  oerjan: does that not work?
02:01:46  @hoogle ($!!)
02:01:46  Control.DeepSeq ($!!) :: NFData a => (a -> b) -> a -> b
02:01:54 -!- copumpkin has quit (Quit: Computer has gone to sleep.).
02:02:24  elliott: oh, i don't trust myself to judge that
02:02:40  oerjan: heh
02:02:56  CakeProphet: Would you learn purely functional queues, or do structures that could only be used in ST?
02:03:12  Sgeo|web: good question. depends on the structure.
02:03:24  hash table would be IO/ST, trees would be pure.
02:03:58  I don't think you could cram Haskell + data structures into one course though. not effectively anyway
02:04:10  you'd want an intro Haskell course followed by a data structures course.
02:05:56  well, not all trees would be pure I guess. but then... hmmm
02:07:00  well really the data structures you'd want to use in Haskell are not the ones you'd want to use in C++, I think.
02:07:13  can you do tree rotations in pure Haskell efficiently?
02:12:07  O(log n)
02:12:54  to insert/delete and rebalance
02:18:43  Whose Line is it Anyway season 1 report: Absolute winner is Wayne Brady with an impressive 3,005,530.5 points. Absolute average episode winner is also Wayne with 187,845.7 points per episode. Logarithmic winner is Colin Mochrie with 130.4. Logarithmic average episode winner for performers appearing in >1 episode is also Colin with a commanding 6.5 log-points per episode.
02:19:19  ah but what about the sinusoidal winner
02:20:58  oerjan: ah okay.
02:23:35  Ryan Stiles was the declared winner in 12 episodes, with Colin coming in second at 9 episodes.
02:24:40  Gregor: ....WHY
02:24:42  STOP
02:24:51  Gregor: go obsess about something else.
02:25:03 * oerjan swats CakeProphet -----###
02:25:16  there are better things to invest time into
02:25:27  CakeProphet: My JIT works on nine platforms!
02:25:38  Gregor: uh, okay?
02:25:50  IT COULD WORK ON ALL THE PLATFORMS
02:26:04  CakeProphet: I taught my dog to teach my cat to behave!
02:26:08  "shachaf: Sometimes things are complicated because the domain is complicated. Other times things are complicated because edwardk."
02:26:20  (new Haskell Weekly News)
02:26:21  oerjan: ?
02:26:25  Oh.
02:27:13  Ugh, I got quoted twice.
02:27:47  hahahahaaaaaa
02:27:48  elliott: why is your quote so serious.
02:28:06  i have half a mind to `delquote it
02:28:15  so for my data structures project I have to provide pseudocode algorithms in my documentation for any function that's more than 15 lines.
02:28:24  but none of my functions are more than 15 lines. bahahahahahaha
02:28:46  CakeProphet: EXCELLENT
02:28:57  oerjan: sory
02:29:26  I can't imagine any of these functions being more than 15 lines
02:29:34  unless you're just bad at programming or bad at abstraction.
02:30:26 -!- yours_truly has joined.
02:31:07 -!- Nisstyre has quit (Read error: Connection reset by peer).
02:32:30  `quote shachaf
02:32:33  620)  elliott: GHC bug? Come on, it's the parentheses.   The more parentheses you add, the closer it is to LISP, and therefore the more dynamically-typed. \ 666)  Real Tar is GNU tar.   You just ignore whichever features don't make you feel superior enough. \ 704)  VMS Mosaic?   I hope that's not Mosaic ported to VMS.   Hmm. It's Mosaic ported to VMS.
02:32:46  Those quotes are all horrible.
02:33:07  You should get kmc in this channel. kmc has good quotes.
02:33:09  `quote kmc
02:33:10  c-style cast, dynamic cast, static cast, reinterpret cast, const_cast.
02:33:11  686)  COCKS [...]  truly cocks
02:33:21  Well, in theory.
02:34:10  oh I see, C just does automatic conversion of number types.
02:34:28  `addquote  You should get kmc in this channel. kmc has good quotes.   `quote kmc   686)  COCKS [...]  truly cocks   Well, in theory.
02:34:30  720)  You should get kmc in this channel. kmc has good quotes.   `quote kmc   686)  COCKS [...]  truly cocks   Well, in theory.
02:34:33  I thought it was a runtime NOP
02:34:36  And now, you have good quotes :P
02:35:05  :-(
02:37:04  What is with Haskell and people named Elliott?
02:37:08  shachaf: we have had kmc in this channel, he refuses to entertain us though
02:37:27  Sgeo|web: what
02:37:48  elliott: There's you, Conal, Some dude named Trevor, some guy I met IRL
02:37:49  Sgeo|web: Elliott is the name of elitist jerks who like elitist jerk languages. hurr hurr hurr
02:37:56  elliott: Sgeo|web is trying to say "What is it with elliott?" in a polite way.
02:38:15  Sgeo|web: there's also elliottcable!
02:38:20  who i doubt actually knows any haskell.
02:38:30  but is in #haskell occasionally and ragequits whenever people start pinging me
02:38:45  also Elliott Smith who is actally not a programmer and is dead.
02:38:51  Gregor: hm that 720 quote has some parsing ambiguity due to the recursion
02:38:59  elliott: Right now neither you nor he are in #haskell.
02:39:01 -!- augur has quit (Remote host closed the connection).
02:39:11 -!- CakeProphet has changed nick to Haskell.
02:39:36  hi guys.
02:39:41  this nick was registered in 2008 apparently.
02:39:55  Haskell's last name is probably Elliott
02:40:00  I should go to #freenode and get it.
02:40:19  oh, and Kallisti
02:41:06  because that's a name I like and stuff.
02:42:05 -!- Haskell has changed nick to CakeProphet.
02:42:24  I can only be Haskell for so long. The awesome blows my mind.
02:44:00  is doubling a hash table a reasonable resize function? I'm gonna go with "sure"
02:44:33  CakeProphet: Better to enlarge it by one byte.
02:44:40  More space-efficient that way.
02:44:58  yes indeed.
02:45:02  good call.
02:45:38  I was actually worried more about time than space.
02:45:41  imagine that.
02:45:55 -!- copumpkin has joined.
02:46:06   Gregor: hm that 720 quote has some parsing ambiguity due to the recursion // 'struth
02:46:31  `quote 1
02:46:33  1)  I used computational linguistics to kill her.
02:46:55  `quote 2
02:46:57  2)  EgoBot just opened a chat session with me to say "bork bork bork"
02:47:16  heh heh heh
02:47:46  honestly I'm not sure why you would expect great works of comedic genius from an #esoteric quote db
02:49:24  wait, how could you _not_?
02:50:02  oerjan: ha. ha. ha ha. ha ha ha. ha ha ha ha ha.
02:52:43 -!- yours_truly has changed nick to Nisstyre.
02:53:14  > intercalate(".")$fix((" ha":).scanl(++)(" ha"))
02:53:16    " ha. ha. ha ha. ha ha ha. ha ha ha ha ha. ha ha ha ha ha ha ha ha. ha ha h...
02:53:37  the Fibonacci laugh.
02:53:53  only expressed for the most Fibonacci humorous things.
02:54:35  oerjan: also how does that even work.
02:56:41  > fix((1:).scanl(+)1)
02:56:43    [1,1,2,3,5,8,13,21,34,55,89,144,233,377,610,987,1597,2584,4181,6765,10946,1...
02:56:50  > scanl (++) (" ha") "lo"
02:56:51    Couldn't match expected type `[GHC.Types.Char]'
02:56:51          against inferred ty...
02:57:02  i just modified that one in the obvious way
02:57:14  right I forget what scan does.
02:57:25  > scanl (++) (" ha") ["lo"]
02:57:27    [" ha"," halo"]
02:57:39  > scanl(+)[1..]
02:57:40    Overlapping instances for GHC.Show.Show ([[t]] -> [[t]])
02:57:40     arising from a ...
02:57:42  oops
02:57:46  > scanl(+)0[1..]
02:57:46    [0,1,3,6,10,15,21,28,36,45,55,66,78,91,105,120,136,153,171,190,210,231,253,...
02:58:46  ah okay.
02:58:55  the usual laziness black magic.
02:59:14  > scanl(f)x[1..]::Expr
02:59:15    Couldn't match expected type `SimpleReflect.Expr'
02:59:15          against inferred ...
02:59:18  oops
02:59:26  yeah I got sccanl
02:59:28  -c
02:59:36  :t scanl
02:59:38  forall a b. (a -> b -> a) -> a -> [b] -> [a]
03:00:06  scanl is like foldl, but lists all the intermediate results
03:00:33  > scanl(f)x[1..]::[Expr]
03:00:34    [x,f x 1,f (f x 1) 2,f (f (f x 1) 2) 3,f (f (f (f x 1) 2) 3) 4,f (f (f (f (...
03:01:05  > scanr(f)x[1..]
03:01:06    [f 1 (f 2 (f 3 (f 4 (f 5 (f 6 (f 7 (f 8 (f 9 (f 10 (f 11 (f 12 (f 13 (f 14 ...
03:01:25  scanr gets no love.
03:01:52  > scanr(f)x[1..5]
03:01:53    [f 1 (f 2 (f 3 (f 4 (f 5 x)))),f 2 (f 3 (f 4 (f 5 x))),f 3 (f 4 (f 5 x)),f ...
03:01:56  > scanr(f)x[1..3]
03:01:57    [f 1 (f 2 (f 3 x)),f 2 (f 3 x),f 3 x,x]
03:02:33  scanl adds calls, scanr removes calls.
03:02:43  s/calls/applications/
03:03:07  @src scanr
03:03:08  scanr _ q0 []     =  [q0]
03:03:08  scanr f q0 (x:xs) =  f x q : qs
03:03:08      where qs@(q:_) = scanr f q0 xs
03:03:30  @src scanl
03:03:31  scanl f q ls = q : case ls of
03:03:31      []   -> []
03:03:31      x:xs -> scanl f (f q x) xs
03:03:55  weirdly different in style.
03:04:15  CakeProphet: only for laziness
03:04:19  > scan f x undefined
03:04:20    Not in scope: `scan'
03:04:23  well scanl can give the first element without any recursion
03:04:25  > scanl f x undefined
03:04:26    [x*Exception: Prelude.undefined
03:06:02  > reverse (scanl (+) 1 [1..5]) == scanr (+) 1 [1..5]
03:06:03    False
03:06:13  ah
03:06:16  the initial value.
03:06:29  > reverse (scanl1 (+) [1..5]) == scanr1 (+) [1..5]
03:06:30    False
03:06:34  yeah.
03:06:40 -!- augur has joined.
03:06:57  > reverse (scanl1 (+) [1..5]) == scanr1 (+) (reverse [1..5])
03:06:58    True
03:08:42  ah
03:19:27  oerjan: http://upload.wikimedia.org/wikipedia/commons/6/65/Dannevirke_welcome_sign.jpg
03:19:30  is this what you look like?
03:20:34  hmm, my double-hashing solution is so ugly :(
03:20:41  of course not, vikings didn't have horns on their helmets!
03:20:45  elliott: double-hasing is gross.
03:21:04  elliott: SIMPLY USE SOME FORM OF NON-LINEAR PROBING.
03:21:13  also i'm clean shaven.
03:21:17  CakeProphet: i don't think you know what i'm talking about
03:21:23  oerjan: no, you look like dijkstra
03:21:34  elliott: double hashing as in... double hasing as in... hash tables. right?
03:21:39  what else could you be talking about?
03:22:40  In een alternatief universum, Ørjan lijkt Dijkstra.
03:23:08  bork bork bork
03:23:33  Ørjan
03:23:36  man, I want to be called that
03:23:41  i have a hunch the lijkt isn't quite correct
03:24:24  copumpkin: I'm famous.
03:24:30  oh?
03:24:31  therefore my name is awesome. (?)
03:24:43  famous for prophesizing cakes?
03:24:52  http://en.wikipedia.org/wiki/Adam_Curtis
03:24:54  I'm this guy.
03:25:08   oh, excellent
03:25:14 * elliott likes to think CakeProphet really is Adam Curtis.
03:25:27  elliott: you're in luck because I am.
03:25:34  lots of fucking brits in here
03:25:41  (I am too)
03:25:42 * CakeProphet is American.
03:25:51  CakeProphet: it says you're from the UK right on your wikipedia page.
03:25:55  quit foolin' around.
03:25:56  then you should correct your wikipedia page
03:25:59  itym hexhamers
03:26:08  elliott: [citation needed]
03:26:08  oh wait
03:26:17  copumpkin: you're not from hexham are you
03:26:21  nope
03:26:31  I'm from london!
03:26:36  oerjan: btw here's what pseqs look like now: http://hpaste.org/54147
03:27:06  elliott: so am I like the Michael Moore of the UK?
03:27:18  or like... not quite as controversial?
03:27:42  i don't think the UK, as a country, could actually support a figure describable as "the michael moore of the uk".
03:27:49  i don't think that's even mathematically possible
03:28:18  well, give me an analogy
03:28:58  i don't think i can analogise to a world so alien ;D
03:28:59  i don't think i can analogise to a world so alien ;D
03:29:00  oops
03:29:17  yes I find it difficult to wrap my head around the UK.
03:29:23  mainly because it's a large mass of land.
03:29:35  Adam Curtis seems more respectable perhaps?
03:29:38  or respected
03:33:05  "Suggested a parallel between the rise of Islamism in the Arab world and Neoconservatism in the United States in that both needed to inflate a myth of a dangerous enemy in order to draw people to support them."
03:33:09  tee hee hee
03:33:23  (that's the description for The Power of Nightmares)
03:33:28  (on Wikipedia)
03:33:57  _so_ easy to godwin that
03:35:42  elliott: apparently he is the /only/ famous Adam Curtis.
03:36:13  CakeProphet: s/he is/I am/
03:36:32  note that I'm not actually Adam Curtis.
03:36:35  but I am Adam Curtis.
03:36:40  elliott: I'm sorry to disappoint you.
03:36:49  wrong
03:36:58  completely wrong
03:37:04  you're actually gleeful
03:38:58  elliott: I occasionally get weird reactions to my name.
03:39:13  not because it's the same as some kind of famous guy in the UK (no one in the US knows who that guy is)
03:39:22  but because it's apparently two first names or something.
03:40:55  i doubt adam curtis is that well known in the UK either :P
03:41:53  elliott: oh I recall from a previous conversation you saying that he was kind of well-known by people that know things.
03:42:07  or something similar
03:42:24  i guess among people who know things about documentaries?
03:42:56  do you know things about documentaries?
03:44:09  okay well this is good. this means I can go to the UK.
03:44:48  if my name were, say, Tony Blair I'd be more reluctant to go to the UK.
03:50:08  elliott: so let me get this straight
03:50:16  there are more than two major parties in the UK?
03:50:21  Better than "WTF how do you *say* that" as a reaction.
03:50:21 * CakeProphet mind blown.
03:50:33  CakeProphet: three.
03:50:39  it is smaller than the other two.
03:50:39  elliott: yes
03:50:56  and will probably never get elected again after this government
03:51:02  elliott: it's almost like you can track the path I took on Wikipedia!
03:51:30  er wait you mean Conservative Party? I thought it was like... "the big one"
03:51:33  Seriously, how many Americans do you expect to say "Worcester" even vaguely reasonable?
03:51:50  Reasonably, even.
03:53:07  CakeProphet: no, i mean the lib dems
03:53:18  the current government is a coalition between the conservative party and the liberal democrats
03:53:38  ah okay
03:53:56  I find it kind of crazy that the Labour party is socialist
03:53:57  I mean
03:53:59  socialist in name.
03:54:14  like, in the US, socialist is like a synonym for "bad".
03:54:16  That's because you're used to American politics, where "socialist" is a curse word.
03:54:42  CakeProphet: it's really not.
03:54:48  not New Labour
03:55:23  ah
03:55:31  aka Tony Blair?
03:55:38  What should weird you out is the BNP.
03:55:39  CakeProphet: basically they were useless for a few decades and then Tony Blair came along and they started calling themselves New Labour and became centre-right and got elected.
03:55:44  AKA "National Socialists".
03:55:53  elliott: whut?
03:55:56  that's weird as fuck.
03:56:10  pikhq: I think I've heard of those guys
03:56:15  CakeProphet: what, a political party getting popular and becoming crappier?
03:56:16  CakeProphet: Something rather similar happened to the Republican party, actually.
03:56:18  SHOCKING!!!!
03:56:24  "hey guys let's be conservative now!"
03:56:38  CakeProphet: no it's more like "let's look more like the conservatives because they keep winning" :P
03:56:44  pikhq: well.. was the republican party ever "socialist"?
03:57:00  CakeProphet: reminder that lincoln was a republican
03:57:09  yes yes I know all that.
03:57:14  CakeProphet: Not much *socialist*, but certainly very liberal on certain issues.
03:57:17  CakeProphet: In Canada, our opposition party is socialist
03:57:23  it's in their constitution, even
03:57:36  i don't think the usa has ever experienced any kind of popularity for socialism
03:57:40  nope.
03:57:48  too capitalist pigdog.
03:57:49  too much baggage
03:58:07  too much captialsit gipgod
03:58:14  the first sentence of their constitution, even
03:58:28  holy shit were we all surprised last election
03:58:47  elliott: It did once. We called it the "New Deal".
03:58:53  coppro: "WHEREAS the Provinces of Canada, Nova Scotia and New Brunswick have expressed their Desire to be federally united into One Dominion under the Crown of the United Kingdom of Great Britain and Ireland, with a Constitution similar in Principle to that of the United Kingdom:"?
03:59:13  elliott: he means the party's constitution.
03:59:17  elliott: the party's
03:59:23  pikhq: i dislike fdr but completely forget why
03:59:25  coppro: oh :P
03:59:32  that makes more sense
03:59:33  as opposed to like
03:59:41  WHEREAS we want a socialist opposition party
03:59:47  elliott: Probably the only notable action of his that's dislikable: Japanese internment camps.
03:59:48  and WHEREAS god help us if they get into government
03:59:50  BE IT HEREBY RESOLVED
04:00:02  elliott: he kind of started easing himself into a position of supreme authority.
04:00:06  or tried to.
04:01:19  3. It shall be lawful for the Queen, by and with the Advice of Her Majesty's Most Honourable Privy Council, to declare by Proclamation that, on and after the passing of this Act, the Provinces of Canada, Nova Scotia, and New Brunswick shall form and be One Dominion under the Name of Canada; and on and after that Day those Three Provinces shall form and be One Dominion under that Name accordingly.(4)
04:01:29  coppro: possible scam: check whether the queen actually declared that
04:01:59  4. Unless it is otherwise expressed or implied, the Name Canada shall be taken to mean Canada as constituted under this Act.(5)
04:01:59  wow, they preempted us making a nomic called canada and using the cosntitution's references to "canada" to take over! smart
04:02:32  elliott: I don't think the US constitution does anything like that.
04:02:42  maybe you should devise a coup
04:02:43  CakeProphet: yeah but you guys don't follow yours
04:02:58  i wonder if that's the one goedel found
04:03:00  elliott: ha. ha. ha ha. ha ha ha. ha ha ha ha ha
04:03:06  it's funny because it's true. also sad. :(
04:03:14  CakeProphet: ha ha ha ha ha ha ha ha.
04:03:24  elliott: The issue is, Canada doesn't have a *single* constitution.
04:03:29  There's like three Constitution Acts.
04:03:32  coppro: yes let's laugh, and then cry.
04:03:32  oh, suber reckons it was the constitution's self-amendment clause itself
04:03:41  but I hope goedel would be smarter than that
04:03:43  Sorry, 2.
04:03:57  What's this about Goedel?
04:04:04  elliott: saw a reference to this which is sort of the list version of PSeq: http://hackage.haskell.org/packages/archive/thrist/0.2/doc/html/Data-Thrist.html
04:04:13  ha ha ha ha ha ha ha ha ha ha ha ha ha.
04:04:14  elliott: the problem with the constitution is that it's too liberal for neoconservatives.
04:04:20  oerjan: hm i think i've seen this
04:04:29  pikhq: I've told you about the supreme court act, right?
04:04:29  oerjan: the list version is easy ofc, it's doing it with a finger tree that's hard
04:04:37  CakeProphet: The problem with everything but a king by divine right is that it's too liberal for neoconservatives.
04:04:42  coppro: Don't *think* so.
04:04:43  elliott: you need /warrants/ to search and seize property? I mean come on.
04:05:15  http://opendylan.org/~gabor/Thrist-draft-2008-07-18.pdf sigh, not found
04:05:18  elliott: TERRORISTS ARE PLOTTING OUR END THIS VERY MINUTE.
04:05:20  CakeProphet: You need a /majority/ to pass a law? Come on.
04:05:35  pikhq: So the constitution is defined by the Constitution Act, 1982, non-exclusively. It says "The following are part of the constitution" but it isn't exhaustive. The Constitution also says that the Constitution can only be amended with regards to the composition of the Supreme Court by unanimous consent of the provinces
04:05:57  oerjan: http://hackage.haskell.org/packages/archive/thrist/0.2/doc/html/Data-Thrist-Monad.html
04:05:58  accordingly, no one knows if the Supreme Court Act is in the constitution or not, and so no one knows if it can be amended by Parliament or only by unanimous consent
04:06:09  coppro: *Ouch*.
04:06:16  oerjan: i suspect that's similar to the relation of arrows and monads...
04:06:38  I mean, the nonexhaustiveness is sometimes useful
04:06:54  for instance, parliamentary privilege is taken to be a constitutional power, even though it's not written out in any statute
04:07:10  oerjan: ha! they did thrist zippers.
04:07:12  same with independence of the three branches
04:07:14  elliott: does the UK have a supreme court thing? erase my ignorance.
04:07:22  CakeProphet: all our judging is done by a rabbit
04:07:29  ah yes.
04:07:32  it all makes sense now.
04:07:36  CakeProphet: As of a couple years ago, they have a Supreme Court.
04:07:38  CakeProphet: It does now.
04:07:47  Prior to that, they had the House of Lords.
04:07:48  appointed?
04:07:51  so like...
04:07:55  and for a while it wasn't the entire House
04:07:58  just a committee
04:07:59  Thrist?
04:08:04  Tony Blair or whoever appointed all the judges at once? nice move.
04:08:10  oh
04:08:10  okay.
04:08:11  Well, technically it *was*, but most of the house just didn't care. :P
04:08:47  oerjan: hmm, these things subsume vectors, I think
04:08:50  oerjan: as in, fixed-length
04:09:03  actually FDRs "court-packing" bill would not have been a bad idea.
04:09:15  oerjan: data Vec a n n' where Elem :: a -> Foo a n (Succ n)
04:09:21  CakeProphet: http://en.wikipedia.org/wiki/UK_Supreme_Court#Appointments_process
04:09:26  oerjan: then PSeq (Vec a) Z len
04:10:06  coppro: blah blah blah bureaucracy
04:10:58  CakeProphet: It seems that they seeded it with a selection of Law Lords from the House of Lords.
04:11:55  pikhq: damn, you're right
04:12:20  oerjan: hm this guy's blog makes the interesting point that they could be interesting to build applicative structurse and the like out of, because you can pull them apart as well as run them
04:12:26  might make for an interesting esolang, especially the Seq version
04:14:36  I think it's kind of weird that presidents are restricted to two terms now.
04:15:00  Blame FDR. :P
04:15:03  I understand the rationale but I'm not really sure it makes any sense at all.
04:15:20  pikhq: blame the congress under FDR, more like.
04:15:48  at least it's less ridiculous than the russian mess
04:15:49  Also, personally I think it's weird that *only* presidents are restricted to two terms.
04:16:04  2 *consecutive* terms. *groan*
04:16:16  long live the Bush Dynasty.
04:16:25  oerjan: oh hm the thrist blog also points out that Show for these things is hard
04:16:26  pikhq: why is consecutive so weird?
04:16:37  oerjan: because consider (5,id) <| (id, 42) <| empty
04:16:44  pikhq: also wasn't the point to avoid the president dying while in office thanks to constant reelection
04:16:45  oerjan: :: PSeq (,) Int Int
04:16:57  oerjan: you don't have forall a b. Show (a,b) obviously, you need a Show constraint on a and b
04:17:03  pikhq: okay so I think term restrictions for congress makes sense, but not for the president? does that make sense?
04:17:06  but with that, you can't do it because of the above
04:17:23  CakeProphet: Not really.
04:17:30  oerjan: you need a pair that bundles the Show constraints basically :(
04:17:48  pikhq: hmmm, perhaps it doesn't.
04:17:49  pikhq: consecutive?
04:18:07  Sgeo|web: Obama, Obama, Bachman, Obama.
04:18:10  coppro: Actually, the point of a two term limit was that it was tradition, so might as well make it binding after FDR had the audacity to violate it.
04:18:22  elliott: yeah.  btw i think the MetaPath has a similar need for the Exit class
04:18:31  CakeProphet: Um, I'm pretty sure that's not possible
04:18:35  s/audacity/popularity/
04:18:37  Sgeo|web: Is in Russia!
04:18:37  oerjan: i just added it to all the types
04:18:42  CakeProphet: Also true.
04:19:40  Sgeo|web: how is that not possible if the only restriction is a maximum of two consecutive terms?
04:19:53  the third is not consecutive.
04:20:12  it just hasn't happened.
04:20:13  Because the restriction doesn't in fact say consecutive, as far as I'm aware?
04:20:24  Sgeo|web: *It is in Russia*.
04:20:25  uh, yes it does.
04:20:37  oh, hmmm
04:20:41  The restriction in the US is two terms total.
04:20:47  why did I think it was consecutive? :P
04:20:59  CakeProphet: surely after Bachmann there won't be enough left of the USA to get another president.
04:21:01  oerjan: i suppose I could just use http://hackage.haskell.org/packages/archive/prelude-extras/0.1.0.2/doc/html/Text-Show-Extras.html#t:Show2
04:21:04  *-n
04:21:05  oerjan: Basically.
04:21:12  oerjan: but actually no, Show2 isn't enough
04:21:18  oerjan: because of that hidden type problem
04:21:23  oerjan: honestly Bachman is one of the better GOP candidates. sad right?
04:21:28  oerjan: Probably our major territorial claim would be the moon. And that only on arguable technicalities.
04:22:08  pikhq: as in "there's a treaty that says there is no claim in space"?
04:22:25  oerjan: but our flags there!!!
04:22:36  oerjan: As far as the US is concerned, a "treaty" is "just a law"
04:22:45  We can literally take back treaties.
04:22:50  Because, well... Fuck you all.
04:23:09  (no, I don't understand the rational behind this)
04:23:15  pikhq: yes, this logic continues to make sense once the US is gone (except for the moon, except the moon isn't US territory by treaty)
04:23:17  oerjan: aha!
04:23:34  CakeProphet: It continues to make sense if *most* of the US is gone.
04:23:37  oerjan: Thrist (Monad' m) a b is actually (Kleisli m a b)
04:23:41  Let's say we're left with Puerto Rico.
04:23:45  oerjan: so the arrow relation is very strong
04:23:53  pikhq: oh well, i suppose i vaguely taking back treaties _is_ permitted by international law
04:23:55  pikhq: ah yes, our strong military center.
04:23:58  *vaguely recall
04:24:16  CakeProphet: Not so much "military center" as it is "likely to be ignored in global thermonuclear war"
04:24:37  elliott: you mean Thrist (Kleisli m) ?
04:24:40  "This time I shall prove my claim that in Haskell any Control.Arrow instance can be rewritten as a Thrist data structure." heh, neat
04:24:44  oerjan: no,
04:24:45  data Monad' :: (* -> *) -> * -> * -> * where
04:24:45  Feed :: Monad m => m b -> Monad' m a b
04:24:45  Digest :: Monad m => (a -> m b) -> Monad' m a b
04:25:28  elliott: er, a Thrist cannot be just Kleisli because Thrists can be picked apart again
04:25:30  pikhq: hmmm, when can we submit to our robot overlords? I'm getting impatient with these imperfect humans.
04:25:45  oerjan: oh well I mean, is /run/ as (Kleisli m a b)
04:25:57  oerjan: in some sense a thrist seems like inspectable composition
04:26:04  CakeProphet: First we need robot overlords.
04:26:36 * Sgeo|web would like inspectable functions
04:26:39  >.>
04:26:53  Sgeo|web: Ew.
04:27:00  Sgeo|web would like to break parametricity.
04:27:24  And with it sane typing, security in an object-capability system, ...
04:27:36  parametricity?
04:28:19  At one point, I have thought about how one might go about sandboxing Picolisp
04:29:00  pikhq: surely robot overlordship is only NP-hard.
04:30:47  oerjan: "So I am not in bad company announcing that I am preparing a paper about thrists which are the moral equivalents of free categories."
04:30:51  oerjan: *sigh* nothing new under the sun
04:31:21  elliott: well i already vaguely knew about thrists
04:31:56 -!- GreaseMonkey has joined.
04:31:57 -!- GreaseMonkey has quit (Changing host).
04:31:57 -!- GreaseMonkey has joined.
04:33:00  "Finally, the category-theoretic twist: think of the parameter p as the morphisms of a category C (with C's objects being the morphisms' domains and ranges) then Thrist p is essentially the free category of C, often written as C*."
04:33:03  gotta love that "essentially"
04:33:38  didn't i use the same word above for PSeq :P
04:34:10  i think so :)
04:39:27  uh, in C++
04:39:42  pikhq: your 27th amendment is hilarious
04:39:48  how do I say "it's okay to change members of this referenced object, but not the entire thing itself"???
04:40:57  can't do that? okay.
04:41:03  ask coppro
04:41:16  coppro: lmao at that one
04:42:24  brilliant scam there
04:44:08  ugh C++ WHY ARE YOU STUPID.
04:44:29  why are you using c=+
04:45:01  monqy: class
04:45:04  surely you know this by now.
04:45:06  ahh / haha
04:45:17  yeah I have had and will have classes that use c++ too
04:45:27  but presently the only one involving programming is python / it's just as bad
04:45:38  monqy: you don't get to laugh about C++ until you program in it.
04:45:47  hey, I've programmed in it!
04:46:10  okay, well then you should be crying in sympathy.
04:46:11  I wrote an x86 compiler in it, albeit a simple compiler for a simple language
04:46:14  isntead of laughing.
04:46:17  im laughcrye
04:46:52  coppro: Gaaah.
04:47:19  wait so string literals are strings now and not chars?
04:47:23  er char *s
04:47:32  uhweriuhwdihwierhiwuer
04:47:46 -!- oerjan has quit (Remote host closed the connection).
04:47:53  coppro: Neat scam at least.
04:48:04  does it depend on where you put them
04:48:12  warning: deprecated conversion from string constant to ‘char*’
04:48:19  monqy: no I thought they were always char arrays.
04:48:41  I forget how c++ does it
04:50:32  CakeProphet: They're const.
04:51:07  pikhq: what is the good way to care about this?
04:51:18  C++ is merely *noisier* about the UB than C in this regard.
04:52:15 -!- calamari has joined.
04:52:21  oh look I think the code they provided us is broken
04:52:23  imagine. that.
04:52:44 -!- DCliche has joined.
04:54:11  actually no it has something to do with assigning a string to another string.
04:56:14 -!- Darth_Cliche has quit (Ping timeout: 260 seconds).
04:56:32  pikhq: what might cause assignment of a string to a string reference to segfault?
04:57:09  CakeProphet: Any number of things, most of which involve someone doing nasty things to the STL class.
05:00:22  ah and for my earlier question I believe I want const&
05:00:26  instead of const Type &
05:00:42 -!- MDude has changed nick to MSleep.
05:01:57  okay well the string /exists/
05:02:16  ah
05:02:25  but the string I'm assigning to does not :P
05:02:33  debugger ftw
05:03:25  elliott: VAX
05:03:28  (Booya)
05:03:28  pikhq: okay so when I say   blah = new Type[size];
05:03:30  Gregor: Wow.
05:03:32  Gregor: How?
05:03:42  elliott: Very, very poorly :P
05:03:42  pikhq: that doesn't automatically construct a default instance of Type for every element in the array
05:03:46  ?
05:03:48  (And I may have to remove it if it makes the code too big ...)
05:03:57  Gregor: But how did you do it :P
05:04:09  elliott: I actually search for the epilogue rather than just assuming it's right before the next function.
05:04:15 -!- DCliche_ has joined.
05:04:16  lol
05:04:33  Haven't tested if it breaks everything else yet.
05:04:35  Oh, also: clang
05:07:52  CakeProphet: Yes, that *is* the semantics.
05:07:53 -!- DCliche has quit (Ping timeout: 260 seconds).
05:08:25 -!- calamari has quit (Quit: Bye).
05:08:35  pikhq: you mean the construct-each-element thing is the semantics?
05:08:42  sorry it's kind of ambiguous .
05:08:46  CakeProphet: Yes.
05:08:54  hm, okay. well now I know shit all about what's wrong.
05:09:05  actually I know the same amount about that, but now have no idea.
05:09:08  on what to do.
05:14:25  aaaaah.
05:14:38  there's a fun bug in their function.
05:14:45  that they gave us.
05:15:12  pikhq, elliott: I've more-or-less run out of architectures.
05:15:20  Gregor: MMIX, still!
05:15:24  elliott: DAMN IT
05:15:27  Forgot :P
05:15:55  Gregor: Z80?
05:16:03  Gregor: PIC? (<-- JOKE)
05:16:24  Gregor: But yeah, Z80 is a good 'un.
05:16:27  Gregor: PA-RISC, too.
05:16:30  No 16-bit.
05:16:46  ..................oh
05:16:49  so like
05:16:50  PA-RISC could be doable but I'd need a sim (at this point virtually all RISCs are a shoo-in)
05:16:58  you know how hash tables have a size and like
05:17:02  Gregor: Z80 has 32-bit addressing, I'm pretty sure.
05:17:06  your hash function can give you indices larger than your table?
05:17:16  yeah, I forgot to mod the index.
05:17:16  CakeProphet: No shit.
05:17:45  Gregor: Hmm, OK, maybe not, but it's not thaaaat 16-bit.
05:17:50  PDP-11?
05:17:52  :P
05:18:01  Gregor: SIMH emulates a Z80: "SIMH emulates MITS Altair 8800 computer with Intel 8080, Zilog Z80 or Intel 8086 processors."
05:18:05  pikhq: Not enough RAM.
05:18:07  I mean, sure, it's 16-bit, but it's the PDP.
05:18:24  elliott: Orly?
05:18:31  pikhq: So sayeth Gregor
05:18:39 * shachaf uses a 256-bit CPU.
05:18:44  Gregor: SuperH?
05:18:47  Gotta address that RAM, man.
05:18:51  Gregor: As seen in the Sega Genesis!
05:18:57  RISC, 32-bit. Should be trivial.
05:19:00  IA64!
05:19:03  Gregor: And supports two endiannesses!
05:19:04  pikhq: sim
05:19:09  pikhq: (That doesn't suck foot)
05:19:19  Probably impossible anyways. IA64 makes x86 look normal.
05:19:26  Gregor: http://forums.evolutionm.net/ecuflash/220884-superh-emulator.html
05:19:32  elliott: SuperH is the one also known as sh[34], right?
05:19:41  Gregor: Oh, yeah
05:19:55  http://omnimaga.org/index.php?topic=8015.0 ;; wow googline superh emulator produces such unreliable sourecs.
05:19:55  elliott: Yeah, I had trouble making a working cross-compiler for it.
05:19:56  sources.
05:20:02  Gregor: Fair enough
05:20:03  elliott: qemu has sh4 :P
05:20:26 * elliott has reached the "Other" section of http://en.wikipedia.org/wiki/List_of_instruction_sets :P
05:20:35  Gregor: Are you sure you can't try the 6502?
05:20:40  Gregor: You would be a hero.
05:21:12  Definitely MMIX.
05:21:13  lol
05:21:23  I can't quite figure out the OS situation of MMIX >_>
05:21:29  How do I make a cross compiler with a C library? <_<
05:21:36  Gregor: Dude, you WROTE JSMMIX.
05:21:41  What did you do to get that running?
05:21:49  er, no const& is not what I want.
05:21:57  elliott: Switched to MIPS.
05:22:04  elliott: But more to the point, it never had an OS.
05:22:11  Gregor: I distinctly recall a bash shell before you switched.
05:22:17  elliott: Uh, no.
05:22:22  elliott: Not even close to close to that.
05:22:35  Oh, okay then.
05:22:45  Gregor: Oooh...
05:22:55  Gregor: Subleq. Before you laugh, there's a sort-of-C->Subleq compiler.
05:23:24  "sort-of"?
05:23:26  https://en.wikipedia.org/wiki/PicoJava
05:23:30  Gregor: http://esolangs.org/wiki/Higher_Subleq
05:23:36  Gregor: More C than you might expect.
05:23:42  Gregor: (Just skip straight to the examples)
05:23:55  (note: may require a C compiler to be written)
05:24:37  Gregor: "The GNU Compiler Collection includes an MMIX back-end for its C/C++ compilers, contributed by Hans-Peter Nilsson and part of the main GCC distribution since late 2001.  As of January 2011, the MMIX back-end to GCC continues to be actively developed and maintained by volunteers.
05:24:37  Installation instructions for GCC + MMIX tools by Hans-Peter Nilsson.
05:24:37  §3.17.26.  MMIX Options for GNU GCC version 4.5.2 (GNU GCC Web site).
05:24:37  §9.25.  MMIX-dependent Features for GNU as from GNU binutils version 2.21, the assembler back-end for GNU GCC (GNU Binutils Web site).
05:24:39  The above tools could theoretically be used to compile, build, and bootstrap an entire FreeBSD, Linux, or other similar operating system kernel onto MMIX hardware, were such hardware to exist."
05:24:48  Gregor: Not sure what to do for libc though >_>
05:24:48 -!- sebbu2 has quit (Ping timeout: 240 seconds).
05:24:53  Aha
05:24:59  Gregor: newlib does mmix: http://cygwin.com/ml/newlib/2001/msg00577.html
05:25:00  as of 2011
05:25:01  erm
05:25:02  2001
05:25:13  But can I actually see its output X-P
05:25:25  Gregor:
05:25:25  MMIXware – Donald Knuth’s MMIX-SIM simple (behavioral) simulator, MMIXAL assembler, test suite, sample programs, full documentation, and MMMIX architectural (pipeline) simulator (gzipped tar file).
05:25:25  MMIXX – An X11-based graphics package contributed by Andrew Pochinsky of MIT’s Center for Theoretical Physics which, when combined with the MMIXware sources above, augments the MMIX virtual machine with a 640×480 pixel, true-color ‘virtual display’ (for UNIX/Linux).
05:26:00  I dont' mean "can I simulate MMIX"
05:26:09  I mean "when I printf, will that go to real stdout"
05:26:14  assignment operators in C++ are the hugest pain in the ass...
05:26:17  newlib's default "system" is to stub out write.
05:26:41  Gregor: Fair enough :P
05:26:50  Gregor: http://www-cs-faculty.stanford.edu/~knuth/mmix-news.html
05:26:52  Gregor: Definition of simple I/O, the runtime environment, and the simulator's online/offline iteraction commands (45KB) (final version, 31 August 2011)
05:26:56  You could PROBABLY patch in a write?
05:26:56  Oh well, to be investigated tomorrow.
05:27:01  Gregor: But I bet it already has a write().
05:27:04  There's only one MMIX machine :P
05:27:07  Probably.
05:27:13  Either way, oh well, to be investigated tomorrow.
05:27:21  "The current target date for the ultimate volumes is the year 2020, so there is plenty of time to do the conversion." -- ever the optimist.
05:27:26  (The silly thing is it's practically guaranteed to work)
05:27:36  Wow. One of the IOCCC entries was a Lisp quine.
05:27:52  And a subset-of-Lisp interpreter in C sufficient to interpret itself.
05:27:59  pikhq: Link :P
05:28:05  http://ioccc.org/2005/mikeash/mikeash.c
05:28:08  Common Lisp.
05:29:37  according to GCC, I have invalidlty used a member.
05:30:30  Naughty naughty.
05:30:52  pikhq: mikeash! I have exchanged approx. ~50 words with that man.
05:31:47  Approximately approximately.
05:31:50  Yes.
05:32:08  (They were all about Classic Mac OS binutils support, to my knowledge.)
05:33:15  http://www007.upp.so-net.ne.jp/eiji-y/vmmmix/vmmmix.html <-- hey look, somebody ported Linux to MMIX
05:34:16  Limmix.
05:34:32  Gregor: You mean almost MMIX :P
05:34:34  http://www007.upp.so-net.ne.jp/eiji-y/vmmmix/problem.html
05:34:40  'struth
05:37:20  print ind
05:37:21  $4 = -2939
05:37:23  uh....
05:37:29  what?
05:40:31  my guess: the hash function they gave us can produce negative values.  ???????
05:41:06  Is there something wrong with negative values for hashes?
05:41:14  uh...
05:41:19  for hash table /indices/, yes.
05:41:19  hashes are just piles of bits
05:41:31  CakeProphet: then just interpret them as unsigned numbers?
05:41:40  copumpkin: Racist! Hashes are Unicode code points!
05:43:53  print key.data()
05:43:53  $9 = 0x612288 "abbreviate"
05:43:59  print location(key)
05:44:00  $10 = -615167939
05:44:02  nice. overflow.
05:44:20  GOOD JOB /PROFESSORS OF COMPUTER SCIENCE/
05:45:04  s/int/unsigned int/
05:49:12  > 3000 `mod` 3000
05:49:13    0
05:50:07  just making sure I'm sane.
06:14:06  > 1 `div` 0
06:14:07    *Exception: divide by zero
06:14:27  > length [1 `div` 0, 1 `div` 0, 1 `div` 0, 1 `div` 0, 1 `div` 0]
06:14:28    5
06:27:17  # time gcc -O3 full.c
06:27:17  gcc: Internal error: Illegal instruction (program cc1)
06:27:33  elliott: Epdeet
06:28:55       1145.44 real      1102.56 user        31.51 sys
06:32:12 -!- CakeProphet has quit (Ping timeout: 252 seconds).
06:39:32 -!- DCliche_ has quit (Quit: You are now graced with my absence.).
06:42:03 -!- pikhq_ has joined.
06:42:25 -!- pikhq has quit (Ping timeout: 258 seconds).
06:46:57  Wow. The total amount spent on NASA is $471 billion.
06:47:30  For comparison, DOD gets $685 billion a year.
06:47:34  Imma be depressed now.
06:48:39  it's not about money, it's about taking things that people know about and cutting them so people know we're serious about saving money
06:48:42  like the presidential limo
06:49:12  presidential mini
06:49:43  copumpkin: And not actually being serious, of course.
06:50:06  If we *were* the military could reasonably get cut way the heck down.
06:50:17  yeah
06:50:27  Perhaps, y'know, not being half of military spending internationally.
07:26:05 -!- CakeProphet has joined.
07:26:05 -!- CakeProphet has quit (Changing host).
07:26:05 -!- CakeProphet has joined.
07:26:51  so as consolation for the scandinavians
07:27:33  I got roughly 1/3rd less fuel efficiency on this tank of gas than my previous.
07:27:51  All because of your maniac speed?
07:27:53  proof that traveling quickly expends more energy than traveling slowly.
07:28:03  Neat that it has that dramatic of an effect.
07:28:14  pikhq_: well I've been driving faster in general.
07:28:50  that calculation is just an estimate based on my current miles on this tank vs. fuel gauge position
07:28:56  when I fill up tomorrow I can get an exact number.
07:28:57  It also makes sense; the air resistance goes up, what, quadratically based on current speed?
07:29:07  no clue :P
07:32:18  pikhq_: oh wait yes I do
07:32:27  pikhq_: it also depends on surface area for drag.
07:33:34  well it depends heavily on a mystical dimensionless ratio called the drag coefficient
07:33:41  which I'm sure involves surface area somehow.
07:34:07  oh wait no surface area is part of the actual drag equation along with the coefficient I think.
07:34:18  but yes it's v^2
07:36:05  I suspect the drag coefficient for my Honda Accord is pretty significant.
07:36:25  You should do that golfball trick the MythBusters tried out to it.
07:36:55  what is that?
07:37:06  http://www.blogcdn.com/www.autoblog.com/media/2009/10/mythbustersdimple_opt.jpg -- it's not just a drag-reducing method, it's also a fashion statement.
07:37:49  mmmm drag coefficient for a 2002 Honda Accord Coupe is 0.32
07:38:02  I imagine that's similar to a 1998 Hinda Accord Coupe even though the body style is slightly different
07:38:15  fizzie: ha.
07:38:18  beautiful.
07:39:23  "The show's team completely covered a last-gen Ford Taurus with modelers clay and figured out that it would achieve about 26 mpg at a constant 65 mph. They then went about adding over 1,000 dimples to the car's exterior. To keep the experiment consistent, all 1,082 dimples removed from the clay exterior were put in a box and set in the back seat so that the car would weigh exactly the same as before dimpling. The theory is that, like a golf ball, the dimples wo
07:39:24  uld reduce the car's drag through the air, thus allowing it to travel the same distance at the same speed using less fuel. The result? Over 29 mpg."
07:39:50  hi
07:39:56  I can't quite recall what the original mpg figure for the car was before they covered it with that much clay though.
07:39:58  oh gosh there is a picture
07:40:01  what a beautiful picture
07:40:06  fizzie: did you see the computer fans with those dimples
07:40:07  they're so ugly
07:40:23  Nnno, I didn't.
07:40:25  http://www.geeky-gadgets.com/wp-content/uploads/2010/07/sharkoon-gg.jpg
07:40:28  behold
07:40:55  http://www.sharkoon.com/sites/default/files/products/tl6s08_0.jpg
07:40:58  It looks like it has a skin condition.
07:41:01  fizzie: bhehold even moreso
07:41:15  http://www.sharkoon.com/sites/default/files/products/big_sharkoon_silent_eagle_2.jpg dmiples
07:41:32  fizzie: wow, they got that much fuel efficiency from a Ford? I'm impressed.
07:41:35  dmiples
07:41:43  I want to golf ballize my honda now.
07:41:54  DMI, plz.
07:42:02  also it would increase my top speed!
07:42:04  The last picture is very artsy.
07:42:07  so perhaps I could hit 150.
07:42:52  but seriously they should make cars like that.
07:43:18  I imagine it's not even that expensive compared to the fuel savings over years of travel.
07:48:09  yes but
07:48:11  really ugly
07:51:14  elliott: oh no
07:51:15  Also I wouldn't trust any MythBusters numbers as-is; there seems to be something called "FastSkinz" (ugh), some sort of a dimpled plastic wrap for cars, which according to one test doesn't do squat.
07:51:23  American car culture will go into shock.
07:51:32  mybthusters
07:51:33  fizzie: I just read that :)
07:51:43  fizzie: fastskinz just makes me think of like
07:51:44  fastskinz
07:51:45  peeling human skin
07:51:49  and burning it off and like
07:51:57  it's still kinda soggy and burnt
07:52:01  elliott: It's made by SkinzWraps.
07:52:03  and you layer it over your car in the blistering heat
07:52:05  fizzie: maybe mybthusters did better at the airodieyamicks
07:52:06  and it sizzles slightly
07:52:10  as it starts to get redder and less pink
07:52:13  and fuses to your bonnet
07:52:21  and then it melts into the car and your car becomes part human and euuuugh
07:52:42  monqy i dont want to live any more
07:53:00  :(
07:53:13  cars are bad
07:53:20 -!- augur has quit (Read error: Connection reset by peer).
07:53:39 -!- augur has joined.
07:53:48  fizzie: fastskinz is literally just mass produced sheets that they apply to any car, it seems.
07:54:00  Mythbusters created one for a specific body shape.
07:54:04  perhaps there's a difference
07:54:37  There's more than one way to skin a car.
07:54:49  fizzie: did you envision that mental image well enough to
07:54:50  be disgusted
07:54:52  ha. ha. ha ha. ha ha ha.
07:54:53  only worsk with black car btw
07:54:59  elliott: I love peeling flesh.
07:55:04  :)
07:55:25  will you be my friend?
07:55:53 -!- Sgeo|web has quit (Ping timeout: 265 seconds).
07:57:09  flesh peels frend
07:57:19  bunrt peelt flesh cars frend
07:57:28  vroome vroome
07:57:31  "its fast"
07:58:08  why is C++ so bad.
07:58:39  because MSVC++
07:58:48  no.
07:58:51  no that's not why.
07:58:56  because c++
07:58:58  that's why it doesn't tend to compile
07:58:59  that has nothing to do with C++ actually.
07:59:04  no.
07:59:10  I use GCC
07:59:13  because typecasts
07:59:13  "The US Air Force devised a non-random scheme for promotion. Photograph: David Moir/Reuters" --Guardian
07:59:14  this is irrelevant
07:59:18  no not that either.
07:59:31  thanks usaf
07:59:32  one particularly irksome thing is that string vs. char * stuff is stupid and annoying.
07:59:33  i forget how you're supposed to cast stuff properly in C++ in a way that it stops bitching at you
07:59:46  CakeProphet: C++ is so bad because it has no design direction and is far too big, complicated, and self-contradictory for any possible design direction
07:59:46  hth
07:59:56  elliott: yes thank you.
07:59:58  that is it.
08:00:05  if you really want an explicit string class you should just stick with java
08:00:10  uh
08:00:11  GreaseMonkey: what
08:00:15  ..
08:00:17  :)
08:00:18  or something that isn't C++
08:00:22  I'll let elliott handle this.
08:00:23  list of possible C++ criticisms: MSVC++, typecasts, no explicit string cast
08:00:27  that is the whole list
08:00:31  s/cast/class/
08:00:36  GreaseMonkey: do you not know the context of this discussion....
08:00:39  also hasn't everyone used std::string for like the last
08:00:43  decade??? or more?
08:00:44  GreaseMonkey: it's kind of: essential to: understand it
08:00:48  so there's an explicit string class for you
08:00:50  elliott: apparently not.
08:01:04  well i use C hence why i tend not to give a shit about using "string"
08:01:20  yeah USUALLY you don't use features of other languages
08:01:20  elliott: ifstreams constructor parameter is char *... also its << operator won't take strings I have to allocate an array with associated overflow problems.
08:01:21  in a language
08:01:26  like perl ties don't appear much in my haskell code
08:01:27  and whenever i have to typecast something in C++ that refuses to accept my casts, i just pull out the extern "C" block
08:01:38  elliott: dude but they should
08:01:44  ties should be integral to Haskell programming.
08:01:52  CakeProphet: uh its like .cstr() or something to convert an std::string to const char *
08:01:57  not hard :P
08:02:06  CakeProphet: I don't think ifstreams have << because... they're input streams
08:02:09  or do you mean >>
08:02:12  elliott: yes
08:02:29  .data() seems to work as well
08:02:29  c++ confusion
08:02:32  that's not the issue.
08:02:49  CakeProphet: "A global function with the same name exists in header . This global function provides a similar behavior, but with standard C++ string objects instead of c-strings: see getline (string)."
08:02:51  then again, i'm someone who would rather shoot myself in the foot than fuck around with unnecessary OO-overhead
08:03:08  grease "hardcore" monkey
08:03:08  CakeProphet: or:
08:03:09  CakeProphet: http://www.cplusplus.com/reference/string/operator%3E%3E/
08:03:19  you have no idea how hard it was to type monkey properly
08:03:24  no idea
08:03:31  greasemonqy
08:03:35  ;_; ;_; ;_;
08:03:37  elliott: oh hi.
08:03:43  http://www.cplusplus.com/reference/iostream/istream/operator%3E%3E/
08:03:45  so yeah they
08:03:46  can do strings??
08:03:50  oh hi oh
08:04:42  elliott: another problem with C++: its documentation requires me to read too much.
08:04:47  I miss stuff!!
08:05:23  
08:06:15  elliott: oh data isn't null-terminated
08:06:17  cstr is
08:06:22  c_str rather
08:07:37  elliott: but anyway, a legitimate complaint about C++: const
08:07:49  good idea, bad reality.
08:08:49  const is also in C :p
08:10:52  ah yes
08:10:57  this makes things much better.
08:25:47  so what happens when you try to compare an unsigned int with a signed int?
08:25:50  in C.
08:31:09  you get a warning
08:32:06 -!- sebbu has joined.
08:44:23  you *might* get a warning
08:54:42 -!- monqy has quit (Quit: hello).
08:59:05  http://esoteric.voxelperfect.net/wiki/Bath_Room_Blow_Jobs
08:59:15  all it really wants to do is link us to wikipedia
09:36:51  http://upload.wikimedia.org/wikipedia/commons/8/8f/Elman_srnn.png
09:48:28 -!- aloril has quit (Ping timeout: 260 seconds).
10:01:28 -!- aloril has joined.
10:24:36 -!- GreaseMonkey has quit (Quit: The Other Game).
10:43:08 -!- ais523 has joined.
11:05:10 -!- ais523 has quit (Ping timeout: 245 seconds).
11:11:45 -!- derdon has joined.
11:23:38 -!- Phantom_Hoover has joined.
11:27:00  hi Phantom_Hoover
11:30:07  Hello.
11:30:08  Phantom_Hoover: You have 2 new messages. '/msg lambdabot @messages' to read them.
11:47:54 -!- artoct6 has joined.
11:50:12 -!- ais523 has joined.
11:53:49  hi ais523
11:53:54  hi
11:54:01  I'm teaching at 12, so won't have much time to talk much
11:54:19  and actually, I've been here since last time I was here, just the connection here is really unreliable
11:54:27  (except when I was printing stuff or eating lunch)
11:57:33  What are you teaching?
12:02:25 -!- ais523 has quit (Ping timeout: 240 seconds).
12:15:06  The art of running away, it seems.
12:15:10 -!- Patashu has quit (Quit: MSN: Patashu@hotmail.com , Gmail: Patashu0@gmail.com , AIM: Patashu0 , YIM: patashu2 , Skype: patashu0 .).
12:16:37 -!- Phantom__Hoover has joined.
12:18:01 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds).
12:21:22 * Phantom__Hoover → cake day
12:21:23 -!- Phantom__Hoover has quit (Client Quit).
12:28:32  An apt pupil, I see.
12:38:54  APT Guy?
12:56:02  fizzie: Have you ever considered becoming an enterprise?
12:58:29  And then, to boldly go where no nickname has gone before. Also, to detach the saucer, that's also a thing that gets done, ain't it.
12:58:47  fizzie: Yes; once at light speed.
12:58:58  I kid not.
12:59:05  Sorry.
12:59:06  s/light/warp/
12:59:27  "Though highly unadvised, it was possible to separate the saucer from the stardrive section at high-warp velocities. Used by Jean-Luc Picard during the first encounter with the Q, the saucer was separated at a warp speed of 9.5. According to Data, it was highly impractical, but possible with no margin for error. The slightest mishap would have made this attempt deadly. It was also required to clear the saucer section from the stardrive section to
12:59:27  ensure safety, because as soon as separation was over, the saucer section would start to lose speed, causing danger to the stardrive section. However, Picard was able to successfully separate the saucer in order to protect the families of the Enterprise from the immense power of Q. (TNG: "Encounter at Farpoint") "
12:59:27 -!- poia has joined.
12:59:34  `@ poia ? welcome
12:59:41  poia: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
12:59:43 -!- artoct6 has quit.
13:01:07 -!- poia has quit (Client Quit).
13:27:58 -!- aloril has quit (Ping timeout: 240 seconds).
13:40:42 -!- Ngevd has joined.
13:41:25 -!- aloril has joined.
13:45:43  elliott: Works on SH4 (had my x-compiler building at night :P )
13:45:57  Gregor: lol
13:46:54  Gregor: How about... one of Intel's RISC processors? I THINK one of them has their own architecture :P
13:47:04  TBH RISC is sooooo boring though.
13:47:09  RISC is easy, yeah.
13:47:19  Gregor: http://en.wikipedia.org/wiki/Intel_iAPX_432
13:47:23  DO IT.
13:47:24  z/Series does /not/ work, by the way :P
13:48:11  Software running on the 432 does not need to explicitly deallocate objects that are no longer needed, and in fact no method is provided to do so. Instead, the microcode implements part of the marking portion of Edsger Dijkstra's on-the-fly parallel garbage collection algorithm (a mark-sweep style collector). The entries in the system object table contain the bits used to mark each object as being white, black, or grey as needed by the collector.
13:48:15  Gregor: Holy shit this thing is the best???
13:48:54  Architecture with OO memory. Wow
13:49:21  Garbage-collected OO memory :P With built-in IPC
13:50:17  Gregor: http://en.wikipedia.org/wiki/Intel_i860 The other VLIW Intel processor!
13:50:36  The other horrible failure of a VLIW Intel processor!
13:51:20  Gregor: Are you not even gonna test on a PDP btw? :P
13:51:41  PDP, VAXen, and x86 = the world, several times over.
13:52:20 -!- boily has joined.
13:56:07 -!- ais523 has joined.
13:56:28  hi ais523
13:57:17  hi elliott
13:57:29  Phantom_Hoover: I was teaching some first-year Java students recursion
13:57:52  (elliott: it is /so annoying/ to see a question you can easily answer, and not be able to answer it because your Internet connection is refusing to work)
13:57:58  heh
13:58:45  Gregor: Test on the TI TMS320C64x, it's the non-failure non-Intel VLIW. (It's the DSP they have in OMAP3/OMAP4 and therefore in gazillions of mobile phones.)
14:00:19  ais523: what's the recommended cure if you start thinking about how wonderful ursala's data model is?
14:01:00  elliott: actually using it
14:01:11  ais523: heh
14:01:22  ais523: but i only like one bit of it! ok, I like the other bits too, but in a totally different way.
14:01:32  which bit do you like?
14:02:22  ais523: the data model
14:02:27  I just said that!
14:02:35  oh, I meant actually using the data model
14:02:40  not actually using the language
14:03:04  how do you "use" a data model? that's rather under-the-hood stuff
14:03:35  hmm… I'm beginning to think that the whole static vs. dynamic typing argument is missing the point
14:03:42  in that what the two sides are arguing aren't mutually exclusive
14:03:47 -!- Ngevd has quit (Quit: Goodbye).
14:04:01  (^ only tangentially related)
14:04:22  ais523: /me thinks http://cdsmith.wordpress.com/2011/01/09/an-old-article-i-wrote/ is relevant
14:04:28  and, hmm, you could write a language using the model
14:04:45  a conditional is dynamic typing
14:10:25  fizzie: Gregor: "The i860 did see some use in the workstation world as a graphics accelerator. It was used, for instance, in the NeXTdimension, where it ran a cut-down version of the Mach kernel running a complete PostScript stack. However, the PostScript part of the project was never finished so it ended up just moving color pixels around. In this role the i860 design worked considerably better, as the core program could be loaded into the cache
14:10:25  and made entirely "predictable", allowing the compilers to get the ordering right."
14:11:46  Gregor's quest for portability is rather madder than mine
14:11:59  I was just planning to check Linux-x86, Linux-ARM, and Windows-x86
14:12:13  possibly Linux-x86_64 too, I guess
14:12:22  ais523: you're not writing a JIT
14:12:32  but I'm planning to run a bunch of different compilers, as it's more a compiler thing that I'm exploiting than an arch thing
14:12:40  a massively portable JIT with no platform-specific code is more impressive than a C program just working on a bunch of architectures
14:13:16  right, indeed
14:13:33  and I think Gregor testing on a bunch of archs is correct, it'll lead to a more hilarious hints file
14:14:18  ais523: which will then be massively elided by the judges? :P
14:14:49  nah, they have no motive to elide it but to save a tiny amount of bandwidth
14:15:20  ais523: except that the hints files always include judge's comments and "/selected/ author's comments"
14:15:37  which never make sense as a complete hints file to send in because they're missing tons of information, usually things the judges have already stated in their own words earlier
14:15:38  elliott: but why would they deselect an arch list?
14:15:46  ais523: readability?
14:16:29  it's not too hard to mentally skip over an arch list
14:17:02   I don't understand why we have editors when I have Ctrl+F
14:17:37  elliott: well, I don't typically use editors for /reading/ files
14:17:45  relatedly, why doesn't less do syntax highlighting?
14:18:05  there really needs to be a way to indicate bad jokes as separate from being dumb
14:27:49 -!- Ngevd has joined.
14:30:39  Sorry, I had to walk my gran
14:30:50  I still need to rewrite my comments to be more amusing.
14:30:59  Ngevd: I ... what?
14:31:11  She's got a bad leg
14:31:39  hmm, what's the chance that elliott and Ngevd have met each other in real life but didn't recognise each other?
14:31:47  ais523: too high
14:31:49  I think people only use the word "walk" as transitive verb when they're referring to pets :P
14:31:49  Quite likely
14:32:02  Hexham's not a big place
14:32:29  # time gcc -O1 full.c
14:32:29  1297.88 real      1246.13 user        34.41 sys
14:32:43  Gregor: Wow, what :P
14:32:48  elliott: VAX
14:32:52  Noice.
14:32:56  PDPDPDPDPDPDPDP
14:33:08  Gregor, how's your IOCCC entry going?
14:33:13  Ngevd: I'm talking about it right now :P
14:33:34  Ngevd: x86[_64], SPARC, MIPS[el], ARM, PowerPC[64], Alpha, VAX
14:33:41  Hmm...
14:33:45  I could compile it...
14:34:00  On ALMOST ALL THE COMPUTERS I OWN
14:34:17  How about ALL THE 32-bit computers you own?
14:34:50  Ngevd: What computer do you own that isn't one of those? An Amiga?
14:35:00  Commodore? Atari? I can't think of anything not really old.
14:35:13  Wii? DS? not sure if they even apply
14:35:37  DS is ARM.
14:35:48  In fact, two different, incompatible ARMs.
14:35:54  Running simultaneously.
14:36:14  Wii is PPCish.
14:36:19  Um, I've got computer that I don't know the architecture of
14:36:23  Almost certainly PPCish enough to run my JIT.
14:36:25  Almost certainly PPCish enough for Gregor's JIT to work :P
14:36:25  And an XBox 360
14:36:28  HOLY SHIT Gregor
14:36:30  THOSE SENTENCES
14:36:31  PERFECTLY
14:36:34  MATCHED UP
14:36:35  FOR
14:36:36  :P
14:36:39  FOUR WORDS
14:36:40  JESUS
14:36:45  THAT WAS LIKE
14:36:46  QUANTUM
14:36:48  ENTANGLEMENT
14:36:49  OF WORDS
14:36:56  So, entanglement
14:36:58  Ngevd: Eks bawks: Also PPCish
14:37:47  Relatively old iPod Nano?
14:37:49  What's PS3? Oh, Cell.
14:37:56  So... PPCish.
14:38:06  Wow, SUN cc's option to not align memory is -misalign.
14:38:13  elliott: Yeah, all the modern game systems are PPCish.
14:38:21  Ngevd: ARM: "The iPod Nano uses a PortalPlayer PP5021C "system on a chip" with dual embedded 80 MHz ARM 7TDMI processors."
14:38:28  Well, my oldish computer uses ARM
14:38:39  That I doubt, unless it's a netbook.
14:38:55  Or a Samsung SoC in the second-generation Nano.
14:38:57  It's got two stickers on it saying "ARM"
14:39:02  ARM-based, of course.
14:39:09  Gregor: Get Deewiant to test it on OpenSolaris, then you can say you've tested it on REAL UNIX.
14:39:14  REAL SHIT UNIX
14:39:24  elliott: I'm actually on Purdue's Solaris right now :P
14:39:28  elliott: Hence my SUN cc comment.
14:39:37  Gregor: But that's not Open!
14:39:40  No wait, they say AMD
14:39:48  AMD, ARM, what's the diff
14:39:49  Gregor: Also, surely "Sun cc".
14:40:03  Which is x87
14:40:07  *86
14:40:08  elliott: It's the one that comes in the SUNcc package.
14:40:14  "Sun C compiler" seems to be what Sun called it, but really, SUNcc?
14:40:20  Gregor: That's internals :P
14:40:42  Gregor: At the MOST, I'll settle for SUN CC.
14:40:53  Sunc.
14:41:08  Gregor, make it able to be compiled on my digital watch and I'll be amazed
14:41:14  Gregor: Sunc is the premier compiler for the Itanic.
14:41:20  Ngevd: What model :-P
14:41:34  elliott, some sort of Casio
14:41:37  Has a compass
14:41:52  I bet that describes ~1,000,000 models of watch.
14:41:55  I'll make it run on the compass.
14:42:02  Using only magnetism for computation.
14:42:35  How about z80? I think TI still makes e.g. the TI-84+ calculator based on that, so it's not "really old". Of course it's not 32-bit, and the computerness is arguable.
14:42:45  Can it run on GBA SP?
14:42:53  Gregor: You should find a way to make it run on reality itself, answering such pressing questions as "is reality a RISC?", "what do reality's function prologues look like?", and "can reality segfault?".
14:42:57  GBA is an ARM too.
14:43:05  fizzie: I told Gregor Z80, he said waaah address space.
14:43:08  All the world's an ARM.
14:43:09  I said it's big enough.
14:43:12  Gregor said nothing.
14:43:18  IT SNOT.
14:43:25  Gregor: How can you even use more than like 16 megs of ram
14:43:38  Z80 address space is 64K though.
14:43:46  eZ80 goes up to 16M.
14:43:48  elliott: Allocating things as [W] where W = 9<<16 :P
14:44:09  Gregor: That'll work for the 16 meg one, no?
14:44:53  elliott: And the other thing I allocate as 9<<25 :P
14:45:02  Nowait, I changed that to 9<<16 too ...
14:45:16  Gregor: Just do malloc(SLIGHTLYLESSTHANW) if it fails :P
14:45:44  OK, I PROBABLY need about 3MB.
14:45:51  So eZ80 will work!
14:45:56  http://en.wikipedia.org/wiki/Van_der_Grinten_projection Wow, this is definitively the worst map projection /ever/.
14:46:09  Holy crap agreed
14:46:16  Being vandalised by xkcd morons >_>
14:46:19  Solaris mmap doesn't like -1 as protection modes :P
14:46:45  Ngevd: It has all the advantages of Mercator with none of the advantages of Mercator!
14:47:08  Sun CC seems to generate the most retarded function epilogue imaginable ...
14:47:13  I like the projection that's like those triangles
14:47:17     2fed4:       81 c7 e0 08     ret
14:47:17     2fed8:       81 e8 00 00     restore
14:47:18     2fedc:       81 c7 e0 08     ret
14:47:18     2fee0:       81 e8 00 00     restore
14:47:18     2fee4:       00 01 00 00     illtrap  0x10000
14:47:18     2fee8:       00 01 00 00     illtrap  0x10000
14:47:20     2feec:       00 01 00 00     illtrap  0x10000
14:47:22     2fef0:       00 01 00 00     illtrap  0x10000
14:47:24     2fef4:       00 01 00 00     illtrap  0x10000
14:47:32  I'm not sure what C compilers there are for eZ80, though, other than Zilog's own best-name-ever "eZ80ZDS0100ZCC" compiler.
14:47:52  eZ80ZDS0100ZCC might just be the best name for a compiler, ever.
14:48:00  Ngevd: Dymaxion was a strange dude.
14:48:17  fizzie: HOW IS IT ACTUALLY CALLED eZ80ZDS0100ZCC
14:48:39  elliott, Dymaxion's a brand name. You mean Buckminster Fuller
14:48:41  Well, it's a component for the ZDS, the Zilog Developer Studio. I suppose they don't use the full name much.
14:48:48  But that's what the title of the manual is.
14:49:20  ais523: suffer through painful irl laughter at that name with me, please
14:49:24   I'm not sure what C compilers there are for eZ80, though, other than Zilog's own best-name-ever "eZ80ZDS0100ZCC" compiler.
14:49:39  elliott: oh right, just realised what you were referring to
14:49:43  I am indeed IRL laughing
14:49:55  although it's not that painful, and I managed not to be drinking water at the time
14:50:04  Admittedly the prose only refers to it as "eZ80 C-Compiler", but that's more of a description than a name. I guess it's a matter of semantics.
14:50:11  i'm going to call @'s compiler @kjsdf'sd;sa;d'\glsd;ghkshlang
14:50:18  sorry need some numbers in there
14:50:19  i'm going to call @'s compiler @kjsdf'sd;sa;d'\glsd;ghkshlang2347839423
14:50:57  fizzie: I bet the developers working on it anthropomorphise it with a name as catchy as it has.
14:51:06  "Oh, little old eZ80ZDS0100ZCC's broken again..."
14:54:53  Hey, AVR32 is a modern 32-bit instruction set you don't have in your list. And it runs Linux and all.
14:55:23 -!- copumpkin has quit (Quit: Computer has gone to sleep.).
14:55:49  Gregor: ^
14:58:24  Gregor: That, and I guess you could consider m68k too. I mean, sure, it's quite obsolete, but VAX.
14:58:49  I suggested that upon-a-time.
14:59:53  http://en.wikipedia.org/wiki/Special:Contributions/Petergray8
14:59:55  worst person
15:00:01  http://en.wikipedia.org/w/index.php?title=User_talk:ClueBot_Commons&diff=prev&oldid=461104563
15:00:05  absolute worst :'(
15:00:18  who the hell creates a wp account to vandalise anyway :P
15:01:57  Possibly he considers it not vandalism. There are many kinds of folks.
15:04:32  14:46, 17 November 2011  95.149.230.3  (Undid revision 461104069 by Petergray8 (talk)) (Tag: section blanking)
15:04:32  13:00, 17 November 2011  Petergray8  (http://www.xkcd.com/977/)
15:04:32  12:57, 17 November 2011  ClueBot NG  (Reverting possible vandalism by Petergray8 to...)
15:04:32  12:57, 17 November 2011  Petergray8  (http://www.xkcd.com/977/)
15:04:42  What I think he's thinking now: IT KEEPS HAPPENING.
15:14:25 -!- MSleep has changed nick to MDude.
15:19:22  I have no problem with Cluebot arbitrarily removing out-of-place xkcd links
15:20:01 -!- derrik has joined.
15:24:01 -!- copumpkin has joined.
15:24:06  "Avid Reader of XKCD and believe anything stated there should be paralleled here as well." --Petergray8, describing himself, a bad person
15:39:00 -!- derrik has quit (Ping timeout: 252 seconds).
15:39:37  Gregor: STATUS REPORT
15:40:12  I went to look at the Fentiman's offices today
15:40:23  But their floor was being painted
15:41:59 -!- derrik has joined.
15:45:22  crosstool-ng seems indecisive about whether it can make an m68k target ...
15:58:32 -!- ais523 has changed nick to ais523\unfoog.
16:05:13  ais523\unfoog: Was there ever a foog clan?
16:05:25  I don't think so
16:05:38  btw, you can watch me play on termcast.org, I'm termcasting
16:05:48  That might help me stay awake.
16:06:06  , he says, tuning into Sokoban.
16:06:18  it's /that/ Sokoban level I'm in
16:06:22  the one that everyone hates
16:06:31  but I have the solution mostly memorised by now
16:07:01  TAEB523 is also termcasting
16:07:51  What clan is e in?
16:07:55  clan bot
16:08:01  founding and only member
16:08:26  I tried to persuade xaiph to join, but she doesn't understand ssh
16:08:29  ais523\unfoog: How lonely. Can I join? I guarantee I am not distinguishably better at playing NetHack than a bot :-)
16:08:40  but, umm, you aren't a bot
16:08:54  So you're saying it's a speciesist clan?
16:09:02  elliott can pass the turing antitest
16:09:13  `quote turing.*Sgeo
16:09:14  yep
16:09:16  445)  Will anyone be irritated if I tend to disconnect and reconnect a lot? [...]  we _almost_ have an established policy that bots will be banned it they do that.  which means we might have to administer a turing test to sgeo, and that could get ugly.
16:09:25  ais523\unfoog: I protest?
16:09:25  I don't know what I did there
16:09:40  You should be able to do the Sokoban levels by just vaulting over the pits.
16:09:43  a turing antitest would be lost by humans really easily
16:09:56  elliott: you can do the first one like that; the others, though, you get dragged down by air currents
16:10:01  A Turing antitest would be some long equation with a lot of digits that's really easy to compute.
16:10:23  or for NetHack bots, something along the line of "calculate the distance between the two staircases, you have 0.001 of a second, go!"
16:10:28  heh
16:11:05  (TAEB523 would probably lose that one, incidentally; it doesn't calculate distances in steps)
16:11:25  (and uses really heavy caching to optimise distance lookups, and the cache takes several seconds to build)
16:12:09  ais523\unfoog: TAEB523 is Planar, presumably?
16:12:20  yes
16:12:40  I like how I can tell whether you've noticed I've typed something or not because you stop moving in the termcast.
16:12:46  all the Planar bots have had 523 in their name
16:13:08  ais523\unfoog: Was that zombie invisible?
16:13:13  no
16:13:19  there were two of them, they didn't last long
16:13:23  Very lightly-coloured, by any chance?
16:13:28  I'm on a white-backgrounded terminal.
16:13:34  they're white
16:13:45  ais523\unfoog: aha!
16:13:50  NetHack sends foreground color codes but not background color codes
16:13:57  ais523\unfoog: you thought you could pass the turing test!
16:14:07  ais523\unfoog: good; I would have disconnected if it forced me to look at a black background
16:14:15  right now most of the screen is legible, rather than none of it
16:14:30  AceHack sets background too because you never set one without the other
16:14:40  but I'm thinking of allowing you to swap two color codes for terminal native background/foreground
16:14:59  ais523\unfoog: yes, that's one of the main things that annoys me about acehack.
16:15:14  the fact that it's possible to clash badly with background colours doesn't mean "impose /more/ of my preferences rigidly" is the correct solution
16:15:28  it's more a case of "impose preferences without which the game doesn't work"
16:15:36  arguably, the game should be fixed to work with a white background too
16:15:41  and I'm thinking about ways to do that
16:17:26  The worst part of termcast compared to NAO is that I can't annoy people by sending them in-game mail.
16:17:31 -!- augur has quit (Remote host closed the connection).
16:17:57  ais523\unfoog, you're walking outside the map. Stop it.
16:18:05  no I'm not
16:18:17  where do you think the map /is/?
16:18:27  ais523\unfoog: You punched holes in the map!
16:18:29  It's not natural!
16:18:44  wait
16:18:51  I think my terminal just desync'd somehow
16:18:59  there we go
16:19:03  I just redrew
16:20:14  I wonder what the collective name for snakes is.
16:20:28  I know the collective name for mice is "friendship", as in "a friendship of mice".
16:21:44 -!- derrik has left.
16:21:55  hmm, I wonder if I'll ever cast knock?
16:22:02  ais523\unfoog: hmm, are you playing at >80x24?
16:22:09  it's useful as I have no other method of unlocking things, but a valk's unlikely to get it castable for ages
16:22:13  no, I'm playing at 80x24 exactly
16:22:22  as is the norm for termcasts
16:22:28  oh, my terminal was 22 high
16:22:29  how strange
16:22:37  and hmm, BoH variant, I may be in trouble if I don't find an asc kit item soon (BoH isn't urgent)
16:22:41  can you redraw again? :P
16:22:46  done
16:22:47  thanks
16:23:12  shall I do this trapping two boulders (the way everyone does it) or trapping no boulders (which is about twice as long, but massively impressive)?
16:23:54  ais523\unfoog: I'm biased because watching people play Sokoban is not terrible interesting
16:23:59  but impressiveness is always good I suppose
16:24:02 -!- Darth_Cliche has joined.
16:24:06  s/terrible/terribly/
16:24:36  You should do it my way (well, it was the other map), which is trapping like fifty boulders, ending up with too few, and killing one of your five kittens in the process of getting more.
16:24:50  hmm
16:25:39  oh no, I haven't messed this up, have I?
16:25:52  It... looks sort of messed up, but I'm no expert.
16:26:22  OK, I'll trap one
16:27:42  it's still better than the usual solution where two are trapped
16:27:47  I wonder what I remembered wrong?
16:27:58  How do I watch?
16:28:02  You forgot the five kittens.
16:28:03  Ngevd: telnet termcast.org
16:28:05  Ngevd: $ telnet termcast.org
16:28:08  then press the letter for ais523
16:28:45  Watching
16:31:38  heh, it did come in useful, as well
16:32:21  El-berhte/ehlbereth0EleberthElerberetheElber*(48thEeb*($H$)XthElbereth
16:35:37  oh come on, first time I do the Sokoban zoo without waking it, and there's a leprechaun blocking the door to the prize
16:37:01  whoops, did I just eyebump?
16:37:04  that could have gone a lot worse
16:38:56 -!- Phantom_Hoover has joined.
16:41:02  raven get out of the dungeon
16:41:05  you dont belong here..
16:44:37 -!- augur has joined.
16:46:55  yay mines, full of nice hapyp gomes
16:47:00  gomes like Ngevd
16:47:24  elliott: I possibly won't even mercilessly slaughter them!
16:47:39  the thing about being lawful in NetHack, is that monsters believe you'll be law-abiding regardless of whether you actually are or not
16:47:43  ais523\unfoog does not know the delights of being at peace with the gnomes.
16:48:19  hmm, ais523\unfoog's gratuitous use of ctrl+move makes me feel better about my constant usage of it
16:48:37  why press a direction key twice when you can combine it with ctrl instead?
16:48:38  heh, I'd be using autoexplore sometimes if it existed in vanilla
16:48:49  elliott: farmoving is safer than spamming a key
16:48:58  as it stops when you're in trouble, unlike holding the key down
16:49:38 * elliott would like roguelikes a lot more if they didn't involve so much micromanagement of simple map navigation
16:49:58  I should just be able to glance at a tile and say "over there" and be walked there. :p
16:50:55  you can, that's what the _ command is for; it's just that specifying the tile needs cursor movement or a click
16:51:33  ais523\unfoog: well, yes; that's considerably more work than glancing :)
16:51:56  combine it with a gaze sensor?
16:52:09  Plus speech recognition!! Best roguelike!
16:52:36  speech recognition would get wearing quickly
16:52:54  Grunt recognition.
16:53:14  sure, Manlobbi, my pickaxe is outside
16:53:20  (don't worry, I'm not actually planning to take it out of the bag)
16:54:44  I find Minetown's design somewhat perplexing.
16:57:02  indeed
16:57:11  the portal is a /dev/null thing, I think it's just placed randomly on the level
16:57:43  bleh, I can't BCU it without buying it
16:58:12  ais523\unfoog: hmm, don't recall a portal :) but i've only been idly watching
16:58:20  it's the pink ^
16:59:13  ah. what does it do?
16:59:40  it goes to the digdug challenge
16:59:42  which is stupidly luck-based
17:00:07  I'm wondering whether to risk trying it; I can't remember if failing it can still leave you permanently trapped (I'm guessing no)
17:00:27  failing it /does/ make the current game basically unwinnable until you go succeed at it on another server
17:00:55  and I really want a ?oCharging before I try it, and I won't have one of those IDed for ages
17:01:00  on the other hand, Dx:15
17:01:01 -!- CakeProphet has quit (Ping timeout: 245 seconds).
17:01:03  should I risk it?
17:01:08  ais523\unfoog: yes
17:01:25  (note: this reply does not consider your current situation; it is based purely on the structure of the question)
17:01:33  heh
17:02:06  OK, let's try it
17:02:42  you know it's good when it starts with an elbereth
17:03:09  I spawned next to a monster
17:03:18  I had no other real choice
17:03:29  @tell elliott test
17:03:30  You can tell yourself!
17:03:32  grr
17:03:39 -!- elliott has changed nick to qqq.
17:03:41  @tell elliott test
17:03:42  Consider it noted.
17:03:43 -!- qqq has changed nick to elliott.
17:03:45  a
17:03:46  elliott: You have 3 new messages. '/msg lambdabot @messages' to read them.
17:03:48  good
17:05:31  ais523\unfoog: i love distorted elbereths
17:05:56  elbeeth
17:06:24  gah, failed
17:06:32  stupid luckbased missions
17:06:42  did I just ruin anouther tournament game for you?
17:06:47  hmm, unless I can wrest it to death
17:07:00  nothing happens
17:07:08  there's a 1/121 chance something happens
17:07:12  and it's got to happen eventually
17:07:13  oh good
17:07:23  nethack needs control structures
17:07:26  heh, and it missed anyway
17:08:09  this is so funny
17:08:46  OK, /now/ I'm screwed
17:08:59  ais523\unfoog: try poking itto death
17:09:06  you don't win the challenge if you do that
17:09:10  they're rather easy to kill with HP
17:09:21  but that just makes sure you lose
17:10:08  oh wow, that was a really crazy offchance and it /actually happened/
17:10:22  wait, what happened?
17:10:33  random unIDed !oPoly while wearing an unIDed =oPC
17:10:35  im not sure pooka is fooled
17:10:51  oh, I lost anyway due to being hit too muich
17:10:51  wh00ps
17:10:52  *much
17:11:05  sorry about your game
17:11:18  I'll have to go play on a different server to recover from that
17:11:22  brb, startscumming wizards
17:11:37 -!- augur has quit (Remote host closed the connection).
17:11:41  taeb523 is ugly on this terminal
17:13:10  elliott: I'm going to startscum wizards on clan EIT's server
17:13:35 * elliott watches
17:14:38  ?oCharging is quite rare
17:14:38  Unknown command, try @list
17:14:42  but it makes the challenge much easier
17:14:51  well, more likely to win
17:14:55  it's not really a skill-based challenge
17:15:29  ais523\unfoog: grr, that "would you like to return" message is missing a space and uses (y/n) in place of the proper [yn]
17:15:35  indeed
17:15:48  also, makes me press return after typing y, unlike every other prompt in NetHack
17:17:20  ais523\unfoog: that's more understandable, it takes more than a few chars of patch to fix that :)
17:17:27  ais523\unfoog: also, it has two spaces after the prompt...
17:18:04  bleh, why does ?oCharging have to be so rare
17:18:13  and /oDangerouslyInflate so low on charges
17:18:34  wand of dangerously inflate is definitely name of the century imo
17:18:58  that name is the only good thing about the digdug challenge ;)
17:19:12  I /suspect/ you aren't supposed to be able to trivialise the movement around the level with E-coining
17:19:18  wow, i just realised what @'s equivalent of database indexes, and the answer makes me very happy
17:19:25  s/indexes/indexes is/
17:21:09 -!- Ngevd has quit (Ping timeout: 260 seconds).
17:21:36  woohoo
17:21:49  now I have to somehow survive to the challenge
17:22:00  given how awful the rest of that inventory is
17:22:06  I can have fun with +oFear after a while, at least
17:22:50  also, now I have to remember how to play wizard
17:23:45  kitten why are you fetching gems, you know they're worthless
17:23:56 -!- Ngevd has joined.
17:24:18  that's better
17:24:25  I tend to give cats female names, for whatever reason
17:24:38  I may rewrite Homestuck as a epic poem
17:24:56  ais523\unfoog: because kitten is not smart kitten is just happy???
17:25:04  In the style of, for example, the Odyssey
17:25:07  and gems are pretty............
17:25:24  "Tell me muse, of the tale of Sburb"
17:25:25  (i am projecting onto the kitten)
17:25:47  she's called Gemma
17:25:48   kitten why are you fetching gems, you know they're worthless
17:25:48  Phantom_Hoover: You have 3 new messages. '/msg lambdabot @messages' to read them.
17:25:54  This is the least aisy thing to say?
17:26:10  I think that may be didactic hexhameter
17:26:15  *hexhameter
17:26:20 -!- augur has joined.
17:26:20  AAARGH
17:26:26  Without the second h
17:26:35  That wasn't deliberate?
17:26:37  No
17:26:54  it's a great typo anyway
17:27:07  presumably you're used to typing "hexham"
17:28:01  lichens are worth 4 XP? wow!
17:28:12  this channel is hexham + helsinki + feather
17:28:15  And I meant dactylic, not didactic
17:28:20  feather is a country?
17:28:36  yes.
17:28:40  or rather, will haven be.
17:31:13  yay, XL 2
17:33:41  wow, only 31% fail on force bolt even with metal armour?
17:33:49  *29%
17:33:54  **39%
17:34:01  I suppose that goes with my intelligence of 19
17:35:11 -!- elliott has quit (Remote host closed the connection).
17:35:32 -!- Zuu has quit (Ping timeout: 244 seconds).
17:35:42 -!- elliott has joined.
17:35:42 -!- elliott has quit (Changing host).
17:35:42 -!- elliott has joined.
17:40:16  hmm, I suppose my gnome is home
17:42:00 -!- elliott has quit (Quit: Leaving).
17:44:47  So what OS name am I supposed to use in an MMIX triple?
17:44:59  2009
17:47:20 * Gregor proceeds to use mmix-unknown-mmix as if that makes any sense.
17:47:32  Nope, doesn't like that ...
17:47:38  mmix-unknown-mmixware?
17:47:44  Aha
17:53:00  *** Configuration mmix-unknown-mmixware not supported GCCCCCCCCCCCCCCCCC
17:53:07  (That was supposed to be "GCSEEEEEEEEEEEEEEE"
17:53:27  Try changing that to A-level
17:53:36  A sentiment which Ngevd will no doubt— dammit.
17:54:07  How do I target GCC for this >_<
17:56:29  mmix-mmixware apparently.
17:56:33  mmix-unknown-mmixware is no-go
18:01:33 -!- Ngevd has quit (Ping timeout: 260 seconds).
18:15:02           1. 4000000000000094: 27fefe10 (SUBUI) privileged instruction!
18:15:04  Damn you MMIX
18:15:30  How do I tell mmix "I am privileged, let me run privileged instructions"
18:15:52  should the program need privileged instructions?
18:17:02  ais523\unfoog: Arguably. I have no mmap, so I'm just plopping instructions into malloc'd space and then executing them. Probably doing that requires some privs.
18:18:46  I'll bet it would work too, if it wasn't for those meddling kids.
18:19:05 -!- Phantom__Hoover has joined.
18:19:29  Gregor: can't you mprotect the malloced area to be executable/
18:19:40  ais523\unfoog: No mprotect either.
18:19:47  ouch
18:20:49 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds).
18:22:04  Either that, or subtraction is a privileged operation :)
18:22:04 -!- Ngevd has joined.
18:22:46  The obnoxious thing is, looking at the code, I'm confident this would work.
18:22:49  But I can't test it.
18:48:06 -!- augur has quit (Remote host closed the connection).
18:48:44 -!- GreaseMonkey has joined.
19:01:26 -!- Vorpal has joined.
19:01:36 -!- CakeProphet has joined.
19:02:06 -!- monqy has joined.
19:04:01 -!- Phantom__Hoover has quit (Ping timeout: 240 seconds).
19:05:28  hello peons.
19:05:42  Who's peons?
19:09:56  whose peons
19:11:10  eons of peons muahahahahaha
19:12:33  We've the Fifteen best 3d tv Next year worlwide : and put each one of style a single spot intended for your current verdic-doing pleasure.
19:13:30 -!- chickenzilla has quit (*.net *.split).
19:13:30 -!- shachaf has quit (*.net *.split).
19:13:34 -!- shachaf has joined.
19:13:36 -!- z^ck has joined.
19:28:38  the knowledge that Brunt is also played by jeffrey combs is really hard to integrate
19:30:34 -!- augur has joined.
19:31:17 -!- Phantom__Hoover has joined.
19:31:21 -!- augur has quit (Read error: Connection reset by peer).
19:31:27 -!- augur has joined.
19:41:09  ]http://www.npr.org/blogs/health/2011/11/17/142414818/americans-are-fat-and-expected-to-get-much-fatter?sc=fb&cc=fp
19:41:14  this is the most shocking news I've read in a long time.
19:41:18  Americans are /fat/?
19:51:43  seriously why are we not cutting military spending this is obscene.
19:51:49  erwerjwjtwehthweuhwuierh america
19:54:25  I'm going to laugh if they rescind the automatic sequestration that's supposed to occur if the supercommittee doesn't reach an agreement.
19:54:28  laugh and then cry.
19:55:50  Defense Secretary Leon Panetta has warned Congress that automatic across-the-board cuts to the Pentagon's budget would "invite aggression from U.S. adversaries."
19:55:55  holy crap this is the most retarded thing I've ever heard.
19:55:58  Like who?
19:56:07  pikhq_: like who what?
19:56:36  I think the only people that would be actively *agressive* against the US would do well to handle a single guy from Texas.
19:56:38 -!- GreaseMonkey has quit (Quit: The Other Game).
19:57:05  Rather than, y'know, just pretty damned annoyed at the US because we *haven't* cut the military. :P
19:57:14  http://en.wikipedia.org/wiki/List_of_countries_by_military_expenditures
19:57:21  okay look at this
19:57:28  Per capita Switzerland has the highest
19:57:39  and then tell me that cutting $600 billion over a decade from that
19:57:49  will make us INCREDIBLY VULNERABLE TO ATTACK.
19:57:55  AAAAAH PANIC
19:57:56  etc
19:58:09  OH NO CHINA MIGHT ATTACK THEIR SINGLE LARGEST TRADING PARTNER
19:58:20  FOR REASONS UNBEKNOWNST TO ME
19:58:26  Or worse: FRANCE
19:58:47  It could be 1812 all over again!
19:58:55  Except with a different country!
19:58:56  but no really that's insan.
19:59:01  er
19:59:02  -r
19:59:04  ..
19:59:54  we could cut from the military, pay off the deficit, and still be spending well over /quadruple/ what the next highest country in military expenditure spends on its military.
20:00:18  (over time I mean)
20:00:22  (not all at once)
20:03:17  the news tends to cover how much money programs will make in a decade or whatever.
20:03:34  but it's really more about whether or not it will reverse the expenditure/revenue disparity.
20:05:06  We could also divert that funding to NASA, and have 50x'd the NASA budget.
20:05:23  And probably produce rather absurd economic growth from not throwing that money onto a burn pit.
20:06:01  THINK OF THE SCIENCE!
20:06:48  but people see "$600 billion over a decade" and then look at a 15 trillion dollar deficit and think "oh well that's really not going to help at all this is pointless"
20:07:10  they should present in terms of how much it changes cost vs. revenue.
20:07:29  pikhq_: oh also
20:07:31  if you were sane before
20:07:33  http://www.usdebtclock.org/
20:07:36  now you're not.
20:07:47  characters in tv series should learn to check the timestamp before they get their hopes up... *no chance* this will work at 10 minutes into the episode
20:08:23  olsner: What's worse is that if you consider debt to GDP ratio, the US isn't that bad.
20:08:36  Erm.
20:08:37  CakeProphet:
20:08:38  lol
20:08:52  olsner: That would involve more meta than audiences are usually comfortable with.
20:08:53  olsner: oh really?
20:09:15  oh, I mean
20:09:18  pikhq_:
20:09:49  pikhq_: indeed
20:10:18  so yeah on the debt clock
20:10:26  look at the section titled "largest budget items"
20:10:37  CakeProphet: We're nearing 100%.
20:10:41  now pick the ones you'd be most comfortable cutting.
20:10:50  hint: it's the defense/wars category
20:10:56  CakeProphet: Japan is currently sitting at around 250%.
20:11:09  https://upload.wikimedia.org/wikipedia/commons/0/0c/Public_debt_percent_gdp_world_map_%282010%29.svg
20:12:05  What's really effing crazy is Japan is pretty close to the US national debt *in absolute terms*.
20:12:17  huh
20:12:18  so maybe
20:12:24  we should just make less of a deal about our debt?
20:12:30  and it will cease to matter? :P
20:12:38  It's a *little* bit of an issue, but yes, it really is overblown.
20:12:52  huh.
20:12:56  so basically
20:13:02  american citizens are bad at numbers
20:13:03  okay
20:13:04  good to know.
20:13:15  Most developed nations have rather high national debt, and have for ages.
20:13:39  so maybe...
20:13:49  politicans are kind of intelligent, or at least some of them are
20:13:50  and know this?
20:13:51  This is in part because the government loaning money is a major part of the basis of the worth of fiat currency.
20:14:19  Erm, borrowing.
20:16:29  pikhq_: well, it's a systematic problem that can easily become worse (the deficit)
20:16:32  so..
20:16:40  something worth fixing now before it gets truly problematic.
20:16:50  Quite true.
20:17:06  The key to doing that is actually rather simple: don't have a budget deficit.
20:17:14  I no rite?
20:17:18  That would require military cuts.
20:17:22 * CakeProphet gasp
20:17:25  pikhq_: TERRORISTS
20:17:28  Hence why it's not happened.
20:18:03  pikhq_: WE NEED THE MILITARY BUDGET OF SEVERAL POWERFUL NATIONS COMBINED IN ORDER TO COMBAT NON-STATE GUERILLA FORCES.
20:18:08  or else we're /doomed/
20:18:26  Heck. I'd imagine if we just got rid of military bases in countries that have been stable in the long term and aren't near nations that *aren't*, we'd have pretty much gotten rid of the budget deficit.
20:18:39  So. Goodbye, bases in Europe.
20:19:07  Goodbye, last vestiges of the US occupation of Japan.
20:19:26  Sadly can't do anything at all about South Korea; nominally that's still a war zone.
20:20:47  Also: say the fuck goodbye to Australia and Canada (why we have bases there is beyond me)
20:21:09  pikhq_: SO THAT WE CAN ASSIST OUR ALLIES IN THEIR TIME OF NEED.
20:21:15  Oh god, not politics.
20:21:28  when the nazi terrorists land on the shores of Canada will be ready to nuke them.
20:21:33  *we will
20:22:09  Phantom__Hoover: contribute or shush :P
20:22:37  nuke canada? sounds like the natural reaction yes
20:22:45 -!- oerjan has joined.
20:22:52   characters in tv series should learn to check the timestamp before they get their hopes up... *no chance* this will work at 10 minutes into the episode
20:22:57  This DS9 you were talking about?
20:23:25  Phantom__Hoover: yes, as always recently, about a season left of it
20:23:40  Which episode?
20:23:48  (I'm assuming it was some assault on the Dominion.)
20:24:04  pikhq_, wow, looking at that debt graph, the UK isn't as bad as I'd have thought.
20:24:22  no, this was 6x24 - Time's Orphan... molly goes into a time thingamajig
20:24:33  olsner: well it was kind of to highlight the lack of sense that happens when you think about war in terms of conventional/nonconventional warfare and nuclear warfare at the same time.
20:24:49  Looking at it further, I'm seriously doubting the usefulness of it as a metric.
20:24:50  but, yes that's the best course of action.
20:24:52  in that scenario.
20:24:59  olsner, ah, yes, the last O'Brien Must Suffer!
20:25:10  (Was there one in S7, I don't really remember any.)
20:25:16  Phantom__Hoover: It seems to be only loosely useful as a metric.
20:25:25  Phantom__Hoover: I doubt /your/ usefulness as a metric.
20:25:32  What's more important, IME, is ability and willingness to repay debt.
20:25:38  I'm not a metric.
20:26:09  I'm overflowing with x, y such that x /= y, Phantom__Hoover(x,y) = 0.
20:30:51 -!- Zuu has joined.
20:31:20  Phantom__Hoover: well, in dominion war plots, success could happen that early because there are ways to go after that...
20:31:33  but in your basic get problem/solve problem plot like this, you can only have failed solutions until the end of the episode
20:32:35  pikhq_: what would be bad is if lawmakers decide to cut medicare / social security instead of military spending.
20:32:46  CakeProphet: Also impossible.
20:32:50  That would hurt old people.
20:32:52  Old people vote.
20:33:09  pikhq_: yes, and those are the two main alternatives
20:33:11  so... hopefully
20:33:14  the choice is obvious.
20:33:15  Get rid of their social security and you get a lynch mob.
20:33:35  Of old people, mind, but a lynch mob is still nothing to fuck around with.
20:33:51  pikhq_: but apparently Rick Perry wants to cut education? wtf
20:34:10  has anyone won the presidency on an offer to cut SPENDING AWAY FROM THE FUTURE OF OUR CHILDREN
20:34:13  wtf.
20:34:38  education gets you smart people, and smart people are boring as well as scary in the eyes of stupid people
20:34:54  obviously the proper approach is to stop educating people
20:36:01 -!- Phantom__Hoover has quit (Ping timeout: 240 seconds).
20:36:02  oh, replace "smart" with "educated" there, different things...
20:39:53 -!- Patashu has joined.
20:45:16  ais523\unfoog: c'est spam on le wiki
20:46:21  oerjan: deleted
20:47:45 -!- Phantom__Hoover has joined.
21:01:14  pikhq_: oh hey so I started talking about military spending on facebook and one of my friends who has a husband in the military was like "lol military spending, that's funny"
21:01:19  A CHALLENGER HAS APPEARED.
21:01:31 * CakeProphet releases the fact bombs.
21:02:11  CakeProphet: I'd imagine part of her reaction to that is because, well, our military spending is *moronic*.
21:02:19  Billions on a useless device? Okay!
21:02:31  pikhq_: er I meant to say /military spending/cut military spending/
21:02:40  Supply soldiers basic amenities? Eh, if we feel like it, maybe.
21:03:06  pikhq_: she equates "cut military spending" with "leave soldiers who need vital equipment defenseless"
21:03:09  which was already do anyway.
21:03:19  s/was/we/
21:12:10  pikhq_: also if we diverting funding from the military into NASA
21:12:17  not only would we get civilian technological advancements
21:12:20  but military as well.
21:12:26  or, we could anyway
21:12:31  provided NASA were sufficiently funded.
21:12:53 -!- copumpkin has changed nick to and.
21:13:22  and: hi
21:13:25  and, I resume the nick-change is related to other-channel shenanigans
21:13:37  `? welcome @and
21:13:39  welcome @and? ¯\(°_o)/¯
21:13:39  yes
21:13:51  `? @and welcom
21:13:53  ​@and welcom? ¯\(°_o)/¯
21:14:03  How do you do that again?
21:14:26 -!- and has changed nick to copumpkin.
21:14:26  lol
21:14:31  `@ copumpkin welcome
21:14:34  copumpkin: exec: 9: welcome: not found
21:14:39  `@ copumpkin ? welcome
21:14:41  copumpkin: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
21:14:57  That's the one
21:15:13  failbot
21:15:24  failpumpkin
21:19:02  `echo '#!/bin/sh\n@ \"$1 ? welcome\"' >bin/welcome
21:19:04  ​'#!/bin/sh\n@ \"$1 ? welcome\"' >bin/welcome
21:19:09  oops
21:19:15  `run echo '#!/bin/sh\n@ \"$1 ? welcome\"' >bin/welcome
21:19:17  No output.
21:19:23  `cat bin/welcome
21:19:25  ​#!/bin/sh\n@ \"$1 ? welcome\"
21:19:32  argh
21:19:38  oh
21:20:05  oerjan: ha. ha. ha ha.
21:20:08  `run echo "#!/bin/sh\n@ "'"$1 ? welcome"' >bin/welcome
21:20:10  No output.
21:20:13  `cat bin/welcome
21:20:15  ​#!/bin/sh\n@ "$1 ? welcome"
21:20:25  `chmod +x bin/welcome
21:20:27  chmod: missing operand after `+x bin/welcome' \ Try `chmod --help' for more information.
21:20:31  argh
21:20:35  oh darn
21:21:42  `run (echo "#!/bin/sh"; echo '@ "$1 ? welcome"') >bin/welcome
21:21:44  No output.
21:21:49  `cat bin/welcome
21:21:50 -!- Sgeo|web has joined.
21:21:51  ​#!/bin/sh \ @ "$1 ? welcome"
21:22:03  `run chmod +x bin/welcome
21:22:05  No output.
21:22:10  `welcome whoever
21:22:12  whoever: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
21:22:17  yay
21:22:20  `welcome The Pope
21:22:22  The: exec: 9: Pope: not found
21:22:27  BUG
21:22:31  argh
21:22:32  `welcome 'The Pope'
21:22:34  ​'The: exec: 9: Pope': not found
21:22:36  `run welcome 'The Pope'
21:22:38  The: exec: 9: Pope: not found
21:23:05  wtf
21:23:16  @ doesn't take multiple words and stuff
21:23:17  is why
21:23:17  that is
21:23:27  so it's not really a bug per se
21:23:30  ah
21:23:32  I just can't welcome the pope :(
21:23:41  `welcome Oprah
21:23:43  `cat bin/@
21:23:44  Oprah: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
21:23:44  ​#!/bin/sh \ if echo "$1" | grep -c ' ' >/dev/null; then \     echo -n "$1" | sed 's/ .*/: /' \     exec $(echo "$1" | sed 's/[^ ]* //') \ else \     echo -n "$1: " \     shift \     exec "$@" \ fi \
21:23:45  yaaaaaay
21:24:04  oerjan: well it needs to know when the name ends and the command begins
21:24:23  restricting the name to one word (since it's supposed to be an IRC nick) is totally reasonable
21:24:40  `@ The Pope ? welcome
21:24:42  The: exec: 9: Pope: not found
21:24:47  hm...
21:24:49  `@ ThePope ? welcome
21:24:52  ThePope: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
21:25:32  what's up with the >/dev/null?
21:25:36  oh
21:25:37  nevermind
21:25:37  :P
21:29:13  `@ ThePope welcome
21:29:15  ThePope: : Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
21:29:19  huh
21:29:22  :)))
21:29:33  oh wait duh :P
21:29:39  `@ ThePope welcome asshole
21:29:42  ThePope: asshole: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
21:30:18  hm...
21:30:28  here we see the noble viking savage Oerjan perplexed by the workings of combining bash scripts.
21:31:06  he is likely playing with the large pointy horns atop his helmet.
21:31:12  because that is totally a thing vikings have.
21:31:17  very likely.
21:31:44  oh wait, horns?  no way.  horns are for cows
21:33:24 * olsner has a horned helmet
21:33:35 -!- ais523\unfoog has quit (Remote host closed the connection).
21:35:11  though it seems to be missing one of its horns, I suspect it became a drinking glass at some point
21:35:29  for viking... mead?
21:35:32  what do vikings drink.
21:35:38  mead is good
21:35:54  yes vikings love mead.
21:36:02  beer also good
21:36:08  wine is for girly men
21:36:16  oerjan: you've never had American light beer, I see.
21:36:33  CakeProphet: assorted alcoholic beverages of unspecified kind
21:36:46  vinland is irrelevant.  _norse_ beer is good.
21:37:50  oerjan: http://en.wikipedia.org/wiki/File:Norse-world.png
21:37:58  nice worldview you have.
21:38:14  oerjan: norse beer... like ringnes?
21:38:39  Helluland. good land.
21:38:46  the swede seems to be brewing up a fight
21:41:01  hell of a land
21:43:40  oerjan: so what's it like being superior to all other races?
21:44:03  good, good
21:44:50  DOOGNIHGT
21:44:54 -!- Ngevd has quit (Quit: Goodbye).
21:44:57  yes, I imagine Hitler would have great respect for you if his empire still existed today. :>
21:45:53  `run which perl
21:45:54  ​/usr/bin/perl
21:48:06  `run cat `which perl`
21:48:09  ​ELF...
21:50:24  `run which perl test
21:50:26  ​/usr/bin/perl \ /usr/bin/test
21:50:31  ah
21:50:34  `run test
21:50:36  No output.
21:50:44  o_o?
21:51:53  i think test only acts by exit code...
21:53:15  ah yes
22:04:01  something is wrong
22:04:04  elliott is missing.
22:07:04  I'm exceptionally annoyed too.
22:09:23  `run (echo '#/usr/bin/perl -w'; echo '$_ = $ARGV[0]; if ($_) { s/ +/ @ /g; exec "bin/@", $_ . " ? welcome"; } else { exec "bin/?", "welcome"; }') >bin/welcome
22:09:26  No output.
22:09:45  `run chmod +x bin/welcome
22:09:46 -!- Slereah has quit (Ping timeout: 244 seconds).
22:09:47  No output.
22:09:50  `welcome test
22:09:53  ​/hackenv/bin/welcome: line 2: syntax error near unexpected token `{' \ /hackenv/bin/welcome: line 2: `$_ = $ARGV[0]; if ($_) { s/ +/ @ /g; exec "bin/@", $_ . " ? welcome"; } else { exec "bin/?", "welcome"; }'
22:09:56  argh
22:10:01 -!- Sgeo|web_ has joined.
22:10:23  `cat bin/welcome
22:10:24  Sgeo|web_: NEW HOMESTUCK OMG
22:10:25  ​#/usr/bin/perl -w \ $_ = $ARGV[0]; if ($_) { s/ +/ @ /g; exec "bin/@", $_ . " ? welcome"; } else { exec "bin/?", "welcome"; }
22:10:34 -!- Slereah_ has joined.
22:11:10  CakeProphet: Do you want me to start being your notifier, or are you somehow peeking ahead?
22:11:54  Because that update is old
22:12:22 -!- Sgeo|web has quit (Ping timeout: 265 seconds).
22:12:25  http://www.reddit.com/r/askscience/comments/mfpxi/if_starlight_is_extremely_old_if_someone_were_to/c30ladn?context=3
22:12:31  The ultimate obnoxious smiley.
22:12:50  @tell elliott If everything goes well a new super-resolution Skyrim pano will be ready during the weekend. I found the fov switch in the skyrim console :)
22:12:51  Consider it noted.
22:13:06  Vorpal, shut up about Skyrim you bastard the pain is too much
22:14:04  Phantom__Hoover, what? aren't you getting a new computer?
22:14:10  Yes.
22:14:17  well then
22:14:20  what is the issue?
22:14:38  elliott, displaying astonishing attention to detail, recommended a mini-ATX case.
22:14:56  Phantom__Hoover, he what
22:15:02  Phantom__Hoover, I hope you didn't buy that?
22:15:10  oops
22:15:26  Yes; it was an honest mistake, and I had to look quite hard to find that detail on the product page.
22:15:26  Sgeo|web_: I was actually just fooling you into thinking there was more
22:15:36  Phantom__Hoover, so you ordered it. ouch
22:15:37  I should have known that you hit refresh constantly waiting for updates
22:15:37  It was categorised with ATX cases, apparently.
22:15:42  and thus already know that there are no new updates
22:15:51  Vorpal, Scan seem to have a reasonable enough return policy.
22:16:28  But anyway, I ordered a replacement on Tuesday, only to discover today that my card was blocked after the original purchase.
22:16:39  Phantom__Hoover, that is good at least
22:16:44  Phantom__Hoover, what?
22:16:46  blocked?
22:16:48  what do you mean
22:17:17  In case of fraud; the purchasing history for that card is something like £8 £8 £8 £8 £750.
22:17:29  ouch
22:17:41  Phantom__Hoover, call the bank then?
22:18:12  But I'd already ordered the replacement by then, and Scan don't give a decent way to cancel the order, and it seems I ordered the last of that case in stock; elliott's absence prevents me from working around that.
22:18:13 -!- Vorpal has quit (Quit: ZNC - http://znc.sourceforge.net).
22:18:28 -!- Vorpal has joined.
22:18:32  gnh
22:18:53  Scan also haven't cancelled the purchase from the blocked card, so I have no idea whether it'll go through once that's cleared up.
22:18:56 -!- Patashu has quit (Ping timeout: 252 seconds).
22:18:58  okay that was stupid. Messed up by starting ipv6 tunnel on two computers at once
22:19:10  Best-case scenario, I get the case on Saturday.
22:19:21  Monday is not looking like an unlikely option.
22:19:28  oh well
22:19:38  still that is O(1)
22:19:46  or at most O(n)
22:19:55  depending on what you count
22:20:03  By that point, the motherboard, CPU and RAM will have been sitting assembled in an anti-static bag in an in-use utility room for nearly a week and my paranoia will have gone through the roof.
22:20:52  assembled?
22:21:03  Phantom__Hoover, don't you start with mounting the mobo in the case?
22:21:05  Plugged into each other.
22:21:07  then do all the other stuff
22:21:14  that is how I did it always
22:21:23  Vorpal, yes; I only realised the form factor was wrong after I'd put it all together.
22:21:45  just put it on your desk like a proper *desktop computer* and start using it until the case gets there
22:23:01  Leaving it assembled was basically the only option I could see at the time, particularly as I thought I'd only be waiting for a couple of days.
22:25:27  Robotfindskitten: Good game, best kitten
22:27:08  `run (echo '#/usr/bin/perl -w'; echo 'if (defined($_=shift)) { s/ +/ @ /g; exec "bin/@", $_ . " ? welcome"; } else { exec "bin/?", "welcome"; }') >bin/welcome
22:27:10  No output.
22:27:17  `run chmod +x bin/welcome
22:27:19  No output.
22:27:24  `welcome test
22:27:26  ​/hackenv/bin/welcome: line 2: syntax error near unexpected token `$_=shift' \ /hackenv/bin/welcome: line 2: `if (defined($_=shift)) { s/ +/ @ /g; exec "bin/@", $_ . " ? welcome"; } else { exec "bin/?", "welcome"; }'
22:27:34  _now_ what
22:27:47  oh of course
22:27:54  `run (echo '#!/usr/bin/perl -w'; echo 'if (defined($_=shift)) { s/ +/ @ /g; exec "bin/@", $_ . " ? welcome"; } else { exec "bin/?", "welcome"; }') >bin/welcome
22:27:56  No output.
22:27:59  `run chmod +x bin/welcome
22:28:00  No output.
22:28:04  `welcome test
22:28:06  test: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
22:28:19  `welcome The Pope
22:28:21  The: Pope: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
22:28:25  `welcome
22:28:28  Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
22:28:34  :)
22:31:34  Written by fizzie, I see.
22:33:27  what?
22:34:25  The: Pope.
22:34:49  `welcome Barack_Obama Oprah
22:34:51  Barack_Obama: Oprah: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
22:34:59  good
22:35:02  we're prepared.
22:35:26  for the day when Barack Obama and Oprah simultaneously join.
22:35:27  `welcome CakeProphet
22:35:29  CakeProphet: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
22:38:15 -!- augur has quit (Remote host closed the connection).
22:55:20 -!- boily has quit (Ping timeout: 252 seconds).
23:06:18  "TG: and was like shit yes i ALL KINDS of know how to use my web browser to download serveral files
23:06:21  "
23:17:45  Thought of a tooootally different way to JIT.
23:17:48  Time to do magic.
23:23:16  Gregor, oh, how?
23:23:57 * Phantom__Hoover → sleep
23:23:59 -!- Phantom__Hoover has quit (Quit: Leaving).
23:25:34  Vorpal: I'll wait to see if it works at all first :P
23:25:40  Gregor, fair enough
23:27:46 -!- Sgeo|web_ has quit (Ping timeout: 265 seconds).
23:28:50  Gregor, do you think it will take long?
23:29:01  Like, next hour? Tomorrow? Next week?
23:29:57  Several hours.
23:32:03  Gregor, oh well, going to put this computer to sleep and go to bed. @tell me if it worked or not, so I know if I should bother looking through logs for how it worked.
23:32:05  night →
23:33:39 -!- Vorpal has quit (Read error: Operation timed out).
23:42:37  I wonder if memcpy(a, NULL, 0) would consistently not segfault on all systems ...
23:48:38  void **b=&b;
23:48:42  By no logic should that work.
23:49:32  Gregor: this is C! you're in luck!

2011-11-18:

00:05:44 -!- augur has joined.
00:18:28 -!- Patashu has joined.
00:25:58 -!- Rugxulo has joined.
00:28:27  I'm surprised, I had given up on IOCCC coming back (at least for the foreseeable future)
00:35:12  it's just the end times, nothing to worry about.
00:35:55 -!- derdon has quit (Remote host closed the connection).
00:45:54  oerjan: unfortunately no one actually knows C anymore
00:45:59  so the submissions will all bad bad.
00:46:13  bad bad :(
00:46:23  what, how can you possibly doubt our Gregor
00:47:46  no one knows C? eh? it's still like #1 or #2 at TIOBE
00:48:00  GNU still worships it like crazy, that's for sure
00:48:10  similarly Clang users (Apple), etc.
00:49:21 -!- pikhq_ has quit (Ping timeout: 245 seconds).
00:49:24 -!- pikhq has joined.
00:51:41  Rugxulo: no one writes C anymore. it's all just robots that program C now.
00:51:47  :>
00:51:56  robots?
00:52:13  even *BSD funded PCC to get to 1.0 stage
00:52:22  so apparently everybody is (still) gaga over C
00:52:39  maybe thinking of another language while they're compiling C     ;-)
01:00:11  I anticipate C lasting at least as long as COBOL already has.
01:00:16  Quite plausibly longer.
01:02:15 -!- pikhq_ has joined.
01:04:35  did I hear right or did C1x finish?
01:05:08 -!- pikhq has quit (Ping timeout: 252 seconds).
01:06:32  I don't know if the new C standard has been published yet
01:07:07 -!- Zuu has quit (Ping timeout: 244 seconds).
01:10:03  dunno, I read somewhere that there's some weird rule that it can pass early if unanimous, and supposedly it was, so ...
01:11:48  ah well
01:11:50 -!- Rugxulo has quit (Quit: Leaving).
01:24:34 -!- copumpkin has quit (Quit: Computer has gone to sleep.).
01:48:49 -!- copumpkin has joined.
01:52:23 -!- pikhq has joined.
01:54:31 -!- pikhq_ has quit (Ping timeout: 244 seconds).
02:04:33 -!- Sgeo|web has joined.
02:04:46  elliott's not here for me to tell em UPDATE
02:08:15  Sgeo|web: question: do you do anything other than refresh MSPA?
02:08:24  Nope!
02:08:34  tsk tsk
02:08:48 * Sgeo|web is pleased that CakeProphet thinks that he refreshes MSPA constnatly
02:09:04  mspa refresh pride
02:10:14  CakeProphet: EPDOOT
02:11:06  OH LOOK I'VE ALREADY SEEN IT WHAT NOW?
02:11:32  I thought there was another update almost immediately after
02:11:45  epdoot
02:12:51  My notifier went off a second time, for some reason
02:13:06  CakeProphet: Sorry to reveal I'm not a constantly refreshing madman
02:13:16  notifier???
02:14:02  CakeProphet: 6058 changed
02:23:58 -!- pikhq has quit (Ping timeout: 240 seconds).
02:24:12 -!- pikhq has joined.
02:46:01  Sgeo|web: I'm surprised you don't read Dr Brinner: Ghost Psychiatrist.
02:58:32  I want to, but I don't have the time...
03:00:59  I mean, I can barely find the time to read Mezzacotta
03:02:14  There isn't enough.
03:03:11  http://www.mezzacotta.net/archive.php?date=-9999999999999-01-01 Here, begin archive binging.
03:03:31  If people can read all of Dr. Brinner: Ghost Psychiatrist, then I can read all of Mezzacotta
03:03:49  I mean literally there isn't enough time.
03:03:59  The Universe isn't old enough.
03:04:17  CakeProphet: Where'd you get your time machine for reading Dr. Brinner?
03:05:10  pikhq: the solution is more universes
03:16:27 -!- Sgeo|web has quit (Quit: Page closed).
03:26:33 -!- Sgeo|web has joined.
03:46:21  Sgeo|web: I'm just so cool I don't need one.
03:47:39  Sorry
03:48:07  you don't need a time machine at 16 picokelvin
03:48:27  uh so does
03:48:29  delete [] array;
03:48:35  delete objects in the array as well?
03:48:41  if so, why is C++ so delete happy?
03:48:50  if not, what the fuck is wrong with my program?
03:49:15  CakeProphet: Yes, that is the intended semantics of delete[];
03:49:24  zdhvjibhdfhbsj pikhq: can I just like
03:49:33  delete the array and not the things in it?
03:49:39  actually... hmmm
03:49:42  nevermind that's not the problem
03:49:44  delete array; does that, I think.
03:49:46  because I'm copying those things anyway.
03:49:50  Also, you don't want to do that.
03:49:51  I think
03:50:28  hmmm
03:51:01  okay so
03:51:03  v.key = key;
03:51:09  where the right-hand key is a string reference
03:51:13  this copies the string, yes?
03:52:10  yeah nevermind
03:52:13  that's not the problem.
03:54:45 -!- augur has quit (Remote host closed the connection).
04:06:39 -!- Sgeo|web has quit (Ping timeout: 265 seconds).
04:13:13  I'm guessing something's wrong with my table resize...
04:26:16  ooooooooooooooh
04:26:31  once again fooled by the assignment operator on references.
04:28:54  silly me, thinking I could use and re-assign variables as mere symbolic constructs to write clear algorithms
04:29:05  and not RECKLESSLY OVERWRITE THINGS.
04:30:41  there we go.
04:39:46 -!- pikhq_ has joined.
04:39:51 -!- pikhq has quit (Ping timeout: 244 seconds).
04:40:34 -!- GreaseMonkey has joined.
04:40:42 -!- GreaseMonkey has quit (Changing host).
04:40:42 -!- GreaseMonkey has joined.
04:43:37  `run cat welcome
04:43:39  cat: welcome: No such file or directory
04:43:45  `run cat `which welcome`
04:43:48  ​#!/usr/bin/perl -w \ if (defined($_=shift)) { s/ +/ @ /g; exec "bin/@", $_ . " ? welcome"; } else { exec "bin/?", "welcome"; }
04:43:55  `run cat `which @`
04:43:57  ​#!/bin/sh \ if echo "$1" | grep -c ' ' >/dev/null; then \     echo -n "$1" | sed 's/ .*/: /' \     exec $(echo "$1" | sed 's/[^ ]* //') \ else \     echo -n "$1: " \     shift \     exec "$@" \ fi \
04:45:51  `run which not
04:45:52  No output.
04:46:11  is there a command that negates a return status?
04:46:37  i dunno, there's a reason i used perl instead of sh :P
04:47:20  `run ls
04:47:22  bin \ canary \ karma \ lib \ paste \ quotes \ share \ wisdom
04:47:59  `run if cat wisdom/CakeProphet | grep -i hi; then echo "hi" fi
04:48:01  bash: -c: line 1: syntax error: unexpected end of file
04:48:02  CakeProphet: if [ $? ];then false;else true;fi
04:48:17  what is $?
04:48:28  The error status of the previous command.
04:48:34  ah
04:48:36  yay bash
05:08:46  it makes so much sense.
05:08:49  bash does.
05:09:02  so much sense I sometimes struggle to understand it.
05:12:40  CakeProphet: ! negates a return status
05:13:25  Deewiant: anywhere or just within the [] thingy
05:13:28  ?
05:14:22  Anywhere
05:15:23  `run !echo "I don't believe you" && exit
05:15:25  bash: !echo: command not found
05:15:31  `run !(echo "I don't believe you") && exit
05:15:33  I don't believe you
05:15:42  `run !(echo "I don't believe you") && echo "oh right"
05:15:44  I don't believe you
05:15:47  okay.
05:16:03  I thought: "surely it could not be this simple in bash"
05:16:04  `run ! echo foo && echo bar
05:16:06  foo
05:16:18  You don't need the (), that spawns a subshell
05:16:32  oh right of course...
05:17:14 * CakeProphet is tempted to use perl always for bashy things.
05:20:03  hmmm, so {} doesn't spawn a subshell or???
05:21:13  http://stackoverflow.com/questions/2188199/bash-double-or-single-bracket-parentheses-curly-braces
05:21:29 -!- MDude has changed nick to MSleep.
05:21:44 -!- DCliche has joined.
05:21:57 -!- pikhq has joined.
05:23:06  that doesn't really explain the {cmd1; cmd2; cmd3; ... } | parallel
05:23:09  thing
05:24:32  Hmm, bah, so it doesn't
05:24:50 -!- pikhq_ has quit (Ping timeout: 240 seconds).
05:24:59  But no, {} doesn't spawn a subshell
05:25:30 -!- Darth_Cliche has quit (Ping timeout: 276 seconds).
05:25:34  but in this usage is otherwise identical?
05:27:22  Uh, pretty much so, yes, I think
05:27:50  It's a big enough difference that I'm not sure what you include in "otherwise identical" :-P
05:28:21  they pretty much have the same purpose when piped and such.
05:29:00  Yes
05:29:55  they both allow a sequence of commands to share the same piped input/output
05:36:41  wait what congress wants to censor the internet?
05:37:09  That sounds like a good way to make the internet really really angry.
05:38:28  wow amazing.
05:41:12  http://en.wikipedia.org/wiki/Stop_Online_Piracy_Act
05:41:20  wow they even tie it into protecting American jobs.
05:45:34  That sounds like a good way to make Google abandon ship.
05:47:21  Then what happens when even Google leaves
05:47:50  "Sources suggest Google has packed up and moved to Greenland. It has reportedly taken its money and jobs with it."
05:48:16  Probably a few other tech companies join them.
05:48:33  Suddenly, Silicon Valley is in Greenland.
05:48:44 -!- oerjan has quit (Quit: In other news, Greenland's population triples).
05:48:48  :)
05:48:54  And America :(s?
05:49:35  http://www.thatvideosite.com/video/dr_michio_kaku_discusses_americas_secret_weapon
05:50:08  pikhq: I wonder if they'll ban youtube?
05:50:56  CakeProphet, that'd be a good way to secure a very very bad approval rating.
05:50:58  Doubtful. I think the first widespread action against Youtube would be Google going "Uh... Fuck you."
05:51:11  Madoka-Kaname: Congress has a lower approval rating than communism ATM.
05:51:17  Can you really cover that up propaganda?
05:51:30  Google's pretty much holding up a middle finger at you.
05:51:54  Yes, communism, the movie villain of decades, is more popular than Congress.
05:53:31  Maybe we should switch to monarchy
05:54:01  Madoka-Kaname: Dr. Michio Kaku is secretly this guy from Alpha Centauri http://2.bp.blogspot.com/_s2Xyd2TRbi8/SlkqC18nSII/AAAAAAAAAAM/bx2D97B6ABs/S660/zakharovface.jpg
05:54:59 * Madoka-Kaname ???
05:55:33  Madoka-Kaname: play Alpha Centauri and you will know it is true.
05:57:47  pikhq: I wonder if they'll ban youtube?
05:57:49  er
05:57:51  what?
05:57:55  In addition, depending on the method used to fix the worldsheet diffeomorphisms and conformal transformations in the original free string theory, the resulting string field theories can be very different. Using light cone gauge, yields light-cone string field theories whereas using BRST quantization, one finds covariant string field theories. There are also hybrid string field theories, known as covariantized light-cone 
05:58:03  AAAAAAAAAAAAAAAAAAAAAAH
05:58:50  string field theories which use elements of both light-cone and BRST gauge-fixed string field theories.
05:59:04  AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAH
05:59:33  string string metasuperstring membrane field cone theory
06:00:01  Further testing of FTL neutrinos done. Yup, still FTL.
06:01:22  what
06:01:57 -!- augur has joined.
06:05:06  wtf why am I reading about string theory
06:05:13  IT BURNS.
06:11:47   If two theories are related by a duality transformation, it means that the first theory can be transformed in some way so that it ends up looking just like the second theory. The two theories are then said to be dual to one another under that kind of transformation. Put differently, the two theories are mathematically different descriptions of the same phenomena.
06:11:55  help needs more category theory
06:15:02  Within the framework of the Standard-Model Extension (SME theory), various theorists have suggested that the neutrino might have a tachyonic nature,[30][31][32][33] while others have disputed the possibility.[34]
06:15:12  oh what now [34]!!!!
06:20:45  Giacomo Cacciapaglia, a theoretical physicist at King's College London, has suggested that the neutrinos might take "shortcuts" through extra dimensions, bypassing the Cohen-Glashow effect. Jorge Páramos, a theoretical physicist at the Higher Technical Institute in Lisbon, counters that tinkering with the current theory in this way is difficult.
06:21:56  ITT: theoretical physicists play with existing theories that have no empirical basis.
06:32:19  That's why they're called theoretical physicists, not regular physicists.
06:34:30  Shame it's not "hypothetical physicists".
06:37:34  Those are the physicists that may or may not exist.
06:46:29 -!- variable has quit (Excess Flood).
06:47:48 -!- variable has joined.
06:51:36 -!- FireFly has quit (Excess Flood).
06:52:14 -!- FireFly has joined.
06:59:48 -!- DCliche has quit (Quit: You are now graced with my absence.).
07:49:47 -!- CakeProphet has quit (Ping timeout: 245 seconds).
07:56:37 -!- CakeProphet has joined.
07:56:37 -!- CakeProphet has quit (Changing host).
07:56:37 -!- CakeProphet has joined.
08:11:59 -!- FireFly has quit (Ping timeout: 240 seconds).
08:14:08 -!- FireFly has joined.
08:33:18 -!- Vorpal has joined.
08:41:04  hm
08:54:31 -!- monqy has quit (Quit: hello).
08:55:40 -!- copumpkin has quit (Ping timeout: 260 seconds).
08:55:51 -!- GreaseMonkey has quit (Quit: The Other Game).
08:56:05 -!- copumpkin has joined.
08:58:45 -!- ais523 has joined.
09:29:39  Hm?
09:32:16  hm at what?
09:36:28  Hm at Vorpal's hm.
09:36:57  (The one a bit less than hour ago.)
09:49:21   You're dismissing the efficacy of tin foil hats because you've only tried using aluminum foil - they need real tin to work right.
09:49:25  I approve of this theory
10:00:22  There are quite a few papers on foil hats; like http://berkeley.intel-research.net/arahimi/helmet/ from MIT, and a rebuttal for it at http://zapatopi.net/blog/?post=200511112730.afdb_effectiveness
10:39:05 -!- derdon has joined.
11:06:55   Hm at Vorpal's hm. <-- that was just to check for lambdabot messages
11:13:07  Hm.
11:22:23 -!- ais523 has quit (Ping timeout: 240 seconds).
11:44:20 -!- Phantom_Hoover has joined.
12:31:31  So I'm thinking my best bet with my JIT's target language would be to choose some machine code.
12:31:33  But which ...
12:36:38  Or ... some kind of bytecode?
12:38:19  Dang it, a stack-based language would be perfect but Forth is so done :P
12:39:27 -!- Patashu has quit (Quit: MSN: Patashu@hotmail.com , Gmail: Patashu0@gmail.com , AIM: Patashu0 , YIM: patashu2 , Skype: patashu0 .).
12:51:51 -!- myndzi has quit (Read error: Connection reset by peer).
12:53:48 -!- myndzi has joined.
13:05:45 -!- ais523 has joined.
13:07:53  ais523: Suggest a language for my JIT to ... well, JIT.
13:08:23  Gregor: how simple?
13:08:42  I would say Unlambda, but it's a bitch to compile into imperative code
13:09:20  meanwhile, what's up with the vandalism on http://esolangs.org/wiki/Excela?
13:09:30  [CTCP] Received CTCP-PING reply from ais523: 22 seconds.
13:09:42  the ridiculous part: this connection in the University library is actually /better/ than the one in my office
13:10:11  ais523: Current target is BF. I want something more interesting.
13:10:24  Pretty much has to be imperative.
13:10:50  kipple?
13:11:39  you might have to make the stacks finite, but otherwise there don't seem to be any issues with it other than parsing
13:11:54  and I know you know the language
13:14:06  I want something with literals, to make it more of a challenge.
13:17:34 -!- ais523 has quit (Read error: Connection reset by peer).
13:17:40 -!- ais523 has joined.
13:17:44  [13:15]  INTERCAL-72?
13:17:47  [13:15]  probably a bit too large
13:17:58  ... ow X-D
13:18:30  -72 would /really/ benefit from JITting
13:18:33  In spite of asking in #esoteric , I was also hoping for something a bit more ... real :P
13:19:23  I'm not sure how many simple real languages there are
13:19:30  some Lisp variant without closures, perhaps
13:20:31  Gregor: what about BASIC?
13:22:30  Hm
13:24:47 -!- ais523 has quit (Ping timeout: 245 seconds).
13:25:30  TI-BASIC, the best BASIC.
13:28:03 -!- ais523_ has joined.
13:28:16  Gregor: serious suggestion: BASIC
13:28:51  Non-serious suggestion: dc.
13:30:00  dc's concatenative, not imperative, right?
13:31:17  Yep.
13:32:52  ais523_: Sure, but  Dang it, a stack-based language would be perfect but Forth is so done :P
13:33:05  It's the next best thing.
13:53:47 -!- ais523_ has quit (Quit: Page closed).
13:53:59  Uhhh, OK, and which concatenative language is non-imperative? As far as I'm concerned, imperative is a parent group of concatenative ...
13:54:18  The only big problem with dc is bignum :P
13:59:27  Concatenative works fine functionally.
14:00:06  All commands are of type Stack -> Stack and . is replaced with space.
14:00:12  Erm, *all functions
14:00:43  Soooo all the world's a monad.
14:00:57  Functional does not mean Haskell.
14:02:19  I'm just saying that that's a very disingenuous way of describing a concatenative language X_X
14:02:25  Why?
14:04:09  Are you kidding me? All your functions are stack->stack and you just string them together. That's like saying that C is a functional language where every statement is a function state->state.
14:05:52  Yeah, but it fits better for concatenative languages.
14:09:06  None of this helps me choose a language anyway :P
14:09:12  How bad would non-bignum dc be?
14:15:39  I really feel like I want to do Forth ... frankly I'm surprised that the previous Forth entry in IOCCC /didn't/ JIT (slash compile to memory)
14:32:03  Bleh
14:33:52 -!- derrik has joined.
14:34:21  Non-bignum dc wouldn't be hard at all, I should think, although I don't know much about JIT.
14:34:46  Although its only control structure is an eval statement.
14:36:27  It wouldn't be hard in the least, my question is whether it would suck :)
14:36:53  languages
14:36:57  Oops
14:36:58  http://iasos.com/artists/erial/celestial-soul-portraits/
14:37:03  Holy christ this is amazing.
14:38:10  lol
14:42:05  How 'bout integer dc?
14:42:07  Would that be useless?
14:42:19  ISTR that it's the default behaviour.
14:42:23  !show pi
14:42:24  sh read p; if [ "x$p" = "x" ]; then p=5; fi; echo "scale=$p; a(1)*4;" | BC_LINE_LENGTH=490 bc -l | tr -d '\\'
14:42:27  Wait, that's bc.
14:42:40  `run echo '2 3 / p' | dc
14:42:47  bash: dc: command not found
14:42:48  Yeah, it is; it rounds down, too.
14:42:51  ... wtf
14:42:52  O.o
14:42:58  That's something to be fixed.
14:43:33  `run echo '2 3 / p' | dc
14:43:35  0
14:43:40  Hmmmmmmmmm
14:43:49  OK, dc isn't such a terrible idea then.
14:44:36 -!- pikhq_ has joined.
14:45:37 -!- pikhq has quit (Ping timeout: 245 seconds).
14:48:54 -!- elliott has joined.
14:54:12  elliott: dc. Terribad?
14:54:46  Gregor: Wow, fuck you, dc is my favourite.
14:54:47  elliott: You have 3 new messages. '/msg lambdabot @messages' to read them.
14:55:00  elliott: Good, then it's my JIT target :P
14:55:21  Gregor: You're JITting... to dc?
14:55:27  Do you have a C->dc compiler?
14:55:27  Errr
14:55:30  JIT source rather
14:55:37  Gregor: I guess that works?
14:55:45  It feels a bit less retarded than BF :P
14:55:46  Gregor: It's kind of unsuited though.
14:55:51  Functions are first-class by way of being strings.
14:56:02  JIT is a command in my JIT :)
15:07:08 -!- copumpkin has quit (Quit: Computer has gone to sleep.).
15:08:00  20:07:29:  pikhq_: oh also
15:08:00  20:07:31:  if you were sane before
15:08:00  20:07:33:  http://www.usdebtclock.org/
15:08:00  20:07:36:  now you're not.
15:08:00  Would you two stop circlejerking in the logs.
15:08:39  `addquote  characters in tv series should learn to check the timestamp before they get their hopes up... *no chance* this will work at 10 minutes into the episode
15:08:41  721)  characters in tv series should learn to check the timestamp before they get their hopes up... *no chance* this will work at 10 minutes into the episode
15:31:36  http://www.beanactuary.com/
15:31:40  Bean actuary!
15:31:41  Best job.
15:31:48 -!- copumpkin has joined.
16:01:28 -!- derrik has quit (Quit: remains of the day).
16:03:30  Damn ... my new JITting method is sound in principle, but probably isn't going to work with even the slightest optimization >_>
16:03:49  What method is that :P
16:04:40  SEKRIT
16:05:54  Gregor: Have you pushed it yet :P
16:05:58  Nope.
16:15:17  Basically this: void jit(volatile struct Data *allMyDeliciousData) { record("prologue"); /* do an addition */ record("+"); /* etc */ }
16:15:23  record() records its return address.
16:15:29  Then I use those return addresses to slice up the function.
16:16:14  Gregor: Why wouldn't that work?
16:16:21  You might need a "volatile" on record().
16:16:25  elliott: Getting rid of the call to record itself.
16:16:32  Gregor: Can't be done, if it has side-effects...
16:16:36  Gregor: Make it poke a volatile variable.
16:16:57  I made it work, but now my JITted code is full of function calls to empty functions (which may or may not be incurably retarded)
16:17:30  (Using a volatile function pointer argument for record instead of a global function)
16:19:10  OS.js (JavaScript Operating System) - The world is moving forward. [X-post from /r/linux] (anderse.wordpress.com)
16:19:10  submitted 6 hours ago by Forconin to programming
16:19:10  WHY IS THIS ON MY FRONT PAGE
16:19:14  I blame Gregor, Lord of Javascripts.
16:19:27  ^^
16:19:30  "This project was originally intended for remote administration of servers without the hassle of installing a graphical environment and all the dependencies that comes along."
16:19:39  lolwut
16:19:40  $ ssh --javascript-bullshit
16:19:51  I guess the browser doesn't count as a graphical environment with a bunch of dependencies :P
16:20:00  "remote administration of servers [by retards]"
16:20:05  They forgot that part.
16:20:39  Hmmm ... so far my new technique works on x86, and works then segfaults everywhere else.
16:20:50  Maybe I can just avoid my broken function epilogue by always calling exit! 8-D
16:21:36  Nowait, that doesn't work once I have other functions X-D
16:21:52  "Hell, for consistency you should serve it all up with node.js instead of Apache."
16:21:55  THIS IS INSUFFERABLE
16:21:58  Gregor: Maintain your own call-stack with CPS?
16:22:05  Then you never actually have to return.
16:22:16  Hmmmmm
16:22:27  Gregor: That needs TCO to work decently though, which you said breaks things
16:22:29  Gregor: Although...
16:22:38  record("goto"); goto &&computed_label; record("endgoto");
16:22:42  You COULD hack something up with that :P
16:22:45  No, C doing TCO breaks things, me doing TCO doesn't.
16:23:01  Gregor: How are you going to do TCO? That's platform-specific.
16:23:26  Same way I record return addresses, but change them >: )
16:23:31  "Dude, I think it kicks butt. I just logged in and was blown away by how much better it was than I expected. I CANNOT believe people are downvoting you just because you named it os.js, instead of actually appreciating it for what it is. Fuck 'em, you're awesome."
16:23:36  /R/PROGRAMMING IS THE WORST
16:23:38  Gregor: Wow :P
16:24:01  Damn it, works-then-segfaults on ARM >_<
16:24:04  Gregor: So, y'know, if you're doing TCO... a mini Lisp-alike would make a lot of sense... >:)
16:24:08  Something must be wrong with my epilogue generation.
16:30:52  Aha, fixed.
16:31:46  http://en.wikipedia.org/wiki/File:Circle-trig6.svg
16:31:51  I love this diagram so much.
16:34:25  Phantom_Hoover: Insert link to that synchronicity diagram.
16:34:31  http://upload.wikimedia.org/wikipedia/commons/e/e2/Sch%C3%A9ma_synchronicit%C3%A9_in_English.png
16:34:33  Oh, OK.
16:34:49  I never said that the trig diagram was the *best*, though.
16:35:20  "One of Jung's favourite quotes on synchronicity was from Through the Looking-Glass by Lewis Carroll, in which the White Queen says to Alice: "It's a poor sort of memory that only works backwards".[10][11]"
16:37:08  OK so I need to synthesise thioacetone with acetone, hydrochloric acid and stink bombs.
16:49:06  elliott: My new method, although still having the problem of pointless calls, works on friggin' everything X-D
16:49:24  Gregor: I thought your previous method did too.
16:49:28  Or do you mean flags don't disturb it?
16:50:21  elliott: I mean it just works, no need for flags in most places.
16:50:27  Also it works on IBM z/Series which the last one didn't :P
16:50:49  Gregor: Does it work with... -O3 on VAX? :P
16:52:08  elliott: I can't even get VAX to compile shit with -O3 :P
16:52:11  GCC segfaults when I try.
16:53:12  Gregor: Re empty calls: It's because the calls to the volatile function pointer are still there, right?
16:53:21  elliott: Yeah.
16:53:24  Gregor: I have an idea.
16:53:35  I can't remove them because they're of differing lengths depending on how it optimized loading the arguments :(
16:53:56  Gregor: Take /two/ volatile function pointers; the first one is used like you use your existing one, and the second one is used BEFORE and AFTER each call. You use the calls to the latter to find out how large calls to the former are, and remove them.
16:54:11  (And then twiddle with things so that the calls to the second are as large as the calls to the first and remove them too)
16:54:37  That was my first idea, but the "twiddle with things" id--OH BUT IT WOULD WORK HERE because it would be a void(void) function!
16:54:43  Brilliant sir.
16:54:44  Brilliant.
16:54:56  Oh, so it would!
16:54:58  I didn't realise that myself :P
16:55:01  Wooo
16:55:27  In fact, I can even simplify that a wee bit.
16:55:32  But the idea is very sound either way.
16:55:34  Gregor: You might need to take a third, nop void(void) funptr, just to find out how large calls to that are...
16:55:35  Oh wait
16:55:37  You can use the second
16:55:42  By special-casing the first three calls
16:55:49  (As "start", "call to void(void)", "end")
16:56:02  ARRRRRGH damn it sh4.
16:56:17  Works with -O0, doesn't work with -O1, works with every flag that goes into -O1 >_<
16:56:25  X-D
16:56:26 -!- Behold has joined.
16:56:27  How is that even possible
16:56:35  I don't know
16:56:53  Gregor: Maybe some code checks optimisation level directly... like, not direct compilation stuff
16:56:55  Linker optimisations?
16:57:03  Maybe -O1 is doing linker optimisations and the flags aren't
16:57:04  ... ARGH I'M AN IDIOT >_<
16:57:10  My O0 list was my O3 list :P
16:57:53  I thought that seemed like a lot of optimizations for O1 >_>
16:58:08  Gregor: btw, I'd replace the long list-o'-platforms-and-flags in the hints with a link, that way the judges are less likely to elide it :P
16:58:17  Also, it works with -O0 and -O3 but not -O1?
16:58:26 * elliott wonders wtf -O1 is doing.
16:58:43  No, it doesn't work with -O3, but it works with all those flags that are in -O3 but not -O1.
16:59:07  I'm actually just shortening the list a ton, it will only have special entries for those needing special flags, which will be few. It may still be worthwhile to link it ...
16:59:41  Oh come on.
16:59:44  This time I know I got the right list.
17:00:20  Maybe it's just not very good at outputting the list for -O0 >_>
17:02:13  WTF WTF WTF
17:02:16  What is -O1 doing???
17:02:47  I used the man page's instructions for discovering what -O does >_<
17:03:38 -!- MSleep has changed nick to MDude.
17:04:14 -!- Zuu has joined.
17:05:50  Yup, every friggin' flag.
17:06:14  Gregor: Why not find out exactly what is broken about the -O1 asm :P
17:06:29  elliott: Because I don't speak SH4 :P
17:06:43  Gregor: How hard can it be :P
17:07:23  Hard enough? >_>
17:07:39  Gregor: Wiiiiiiimp
17:07:48  :'(
17:08:06  Hm, on SPARC it seems to segfault before even getting to the JITting part ...
17:08:55  Gregor: It works on everything, huh :P
17:09:11  I'm going in alphabetical order here X-P
17:10:36  Gregor: "Works on architectures that don't start with 'S'"
17:10:42  It works on SH4!
17:10:44  Just not with -O1
17:10:56  Gregor: It's SH-4, btw :P
17:11:20  Also it works on SPARC if I put a printf in my record function X-D
17:11:48  OHHH fussing with the stack.
17:11:50  Always fun.
17:12:10  Gregor: Just call a dummy function in record? :P
17:12:28  That I am! (Problem is that dummy functions tend to get inlined, but I'm sure I can find somethin')
17:12:40  Presumably something is stackweird if it's a leaf *shrugs*
17:12:56  you discussing IOCCC entry?
17:13:23  Or, y'know, it only works if it's printf.
17:13:25  quintopia: Yeah.
17:13:25   That I am! (Problem is that dummy functions tend to get inlined, but I'm sure I can find somethin')
17:13:37  Gregor: volatile __attribute__((noinline)) :P
17:13:45  elliott: No GCC-specifics.
17:14:58  The bigger problem though is that it only works if it's printf X-D
17:15:42  Gregor: Not even puts?
17:15:50  Gregor: Maybe it's about what you pass to printf.
17:15:56  Gregor: Maybe you're forcing something from a register to the stack.
17:16:01  elliott: OK, puts works.
17:16:11  Gregor: fputs("",stdout)
17:16:16  100% side-effect free
17:16:31  elliott: No go.
17:16:39  Gregor: Maybe it needs to make a syscall
17:16:41  putchar('.')?
17:17:04  Except wait, stdio is buffered ???
17:17:11  I bet putchar('.') fails
17:17:15  Because no syscalls because buffering
17:19:07 -!- Behold has quit (Quit: Leaving).
17:21:08  ?!?!?
17:21:08  Unknown command, try @list
17:21:13  putchar made it go CRAAAAAAAZY
17:21:35  I wonder if the return address on SPARC is strictly the return address ...
17:22:05  (As opposed to "return to here+4" or something)
17:23:13  Dammit ais where are you when I'm being paranoid.
17:27:46 -!- monqy has joined.
17:29:07  Gregor: since instructions are word-sized on sparc there would be no problem with preincrementing the instruction pointer
17:29:41  olsner: But that would be SPARC-specific.
17:30:11  and maybe it has delay slots (but I think that was MIPS rather than SPARC)
17:30:27  Both.
17:30:30  But delay slots are fine.
17:32:21 -!- Ngevd has joined.
17:32:22  Quick
17:32:28  How does "Iason" decline?
17:34:42  Slowly.
17:36:53  depends what declension it is of course
17:48:47  Third, I think
17:48:59  Masculine
17:49:06  Singular only
17:58:17  Google competing with PNG... I guess they don't aim low these days :P
17:58:38  PNG the image format!?
17:58:41  Yes.
17:58:53  28% smaller than recompressed PNGs, supposedly.
17:59:35  Ooh, you can encode all channels except the alpha lossily, and just have lossless alpha... that's a neat trick.
18:00:45  Link?
18:01:21  http://blog.chromium.org/2011/11/lossless-and-transparency-encoding-in.html
18:02:19  Also http://code.google.com/speed/webp/gallery2.html.
18:05:17 * CakeProphet circlejerks furious
18:05:30  uhhhhhhhhhhh
18:07:27 -!- nys has joined.
18:13:11  elliott: I assume that the 28% figure was with strictly-lossless?
18:14:40  Gregor: Yeah.
18:15:12 -!- Ngevd has quit (Ping timeout: 245 seconds).
18:15:21  Hm. I wonder how well you'd do if you just took libpng and swapped out zlib for LZMA. (Ignoring speed)
18:17:02  Gregor: Probably vastly better :P
18:17:20  Gregor: But not only speed would be the problem, imagine how much RAM your browser would hog up...
18:17:33  Heh
18:17:34  Especially phones would be fucked.
18:17:58  Now for ultimate portability, we'll reimplement LZMAPNG in JavaScript.
18:18:02  And do the image decoding in-VM.
18:18:23  "Small code size and relatively low memory overhead, particularly with smaller dictionary lengths, and free source code make the LZMA decompression algorithm well-suited to embedded applications."
18:18:28  Uhh, are Wikipedia on crack?
18:18:36  I'm pretty sure LZMA decoding sucks compared to gzip decoding :P
18:18:47  Gregor: That'll be SO FAST
18:18:54  Gregor: Decompess to a data: URI.
18:19:12  Which is itself a PNG :)
18:19:57  Gregor: Nahh, BMP, so you can load incrementally by just appending strings
18:20:21  X-D
18:21:46  elliott: NOOOOOOOOOOOOOO my new system doesn't work on VAX either :'(
18:21:49  My new system SUCKS
18:22:06  lol, tanenbaum won't admit linux has won
18:22:20  Gregor: Why not...
18:22:20  ?
18:22:26  elliott: Donno yet, debuggling.
18:22:32  Gregor: "?"?
18:22:52   lol, tanenbaum won't admit linux has won
18:23:16  Gregor:
18:23:21  LinuxFr.org : If you could return in the past to change the MINIX original proprietary licence to the GPL licence, do you think your system might have become the dominant free OS today?
18:23:21  Andrew Tanenbaum : Never. The reason MINIX 3 didn't dominate the world has to do with one mistake I made about 1992. At that time I thought BSD was going to take over the world. It was a mature and stable system. I didn't see any point in competing with it, so I focused MINIX on education. Four of the BSD guys had just formed a company to sell BSD commercially. They even had a nice phone number: 1-800-ITS-UNIX. That phone number did them and me in
18:23:21  . AT&T sued them over the phone number and the lawsuit took 3 years to settle. That was precisely the period Linux was launched and BSD was frozen due to the lawsuit. By the time it was settled, Linux had taken off. My mistake was not to realize the lawsuit would take so long and cripple BSD. If AT&T had not brought suit (or better yet, bought BSDI), Linux would never have become popular at all and BSD would dominate the world.
18:23:25  Now as we are starting to go commercial, we are realizing the value of the BSD license. Many companies refuse to make major investments in modifying Linux to suit their needs if they have to give the code to their competitors. We think that the BSD license alone will be a great help to us, as well as the small size, reliability, and modularity.
18:23:30  LinuxFr.org : Yet we see the contributions of numerous companies during each development cycles of the Linux kernel (Intel, IBM, Novell, Google, Oracle, Broadcom, Samsung, TI, Freescale, Fujitsu, etc).
18:23:33  Andrew Tanenbaum : Clearly some companies are willing to do this but I also know of quite a few companies that refuse to use Linux for this reason. It depends on the company and whether it feels its contribution would help its competitors. Also it is easy to overestimate what companies have contributed. Usually it is things that benefit them directly, like making sure their drivers and programs work on Linux.
18:23:38  [...]
18:23:40  LinuxFr.org : Do you think the Linux success is a proof he was right or is it unrelated?
18:23:42  Andrew Tanenbaum : No, Linux "succeeded" because BSD was frozen out of the market by AT&T at a crucial time. That's just dumb luck. Also, success is relative. I run a political website that ordinary people read. On that site statistics show that about 5% is Linux, 30% is Macintosh (which is BSD inside) and the rest is Windows. These are ordinary people, not computer geeks. I don't think of 5% as that big a success story.
18:23:46  LinuxFr.org : So you don't think the so-called "fairness" of the GPL ("your improvements need to be available the same way the original is available"), the bazaar model and a great project leader triggered the contributions to the Linux kernel? For you it's only dumb luck?
18:23:51  Andrew Tanenbaum : Yes, I think Linux succeeded against BSD, which was a stable mature system at the time simply because BSDI got stuck in a lawsuit and was effectively stopped for several years.
18:23:54  It's amazing :P
18:25:47  It's not an entirely unreasonable argument, really, although his success comparison with Mac being "BSD inside" is a bit silly.
18:26:15  Gregor: I was giving him the benefit of the doubt until "lol only 5% of the visitors to my website use linux qed"
18:26:18  "nerds"
18:26:35  Gregor: But wait, MINIX is definitely winning, people just aren't telling anyone else about it:
18:26:37  LinuxFr.org : Since 2005, MINIX 3 has been designed to be an OS for resource-limited and embedded computers and no more as a teaching tool only. Is MINIX being taken up in industry at present?
18:26:37  Andrew Tanenbaum : In truth, one of the problems with the BSD license is that I don't know. Companies using it don't have to tell us anything. My experience is that a lot of companies don't like to talk about what technology they are using. But we are starting to make a real effort in embedded systems now.
18:26:51  lol
18:27:37  NEWSFLASH: Companies everywhere use MINIX! When asked why, unanimously they were quoted as saying "Because FUCK TORVALDS and FUCK STALLMAN, THAT'S WHY!"
18:28:05  Gregor: No, it's 'cuz their lawyers don't let them use ANY GPL'D SOFTWARE WHATSOEVER
18:28:08  EVEN IF THEY DON'T WANT TO MODIFY IT
18:28:28  Gregor: Their legal team was quoted as saying "AAARGH GET THE COOTIES OFF OUR SERVERS"
18:28:38  X-D
18:28:45  Sounds like something Microsfot would say.
18:32:30  I wonder how much GPL software is in a standard MINIX system.
18:32:37  (MINIX 3)
18:32:40  My bet: More than none.
18:36:06  elliott: Is the return address on VAX ... two bytes beyond where you return to ...
18:36:51  Gregor: After you call record(), examine the (now garbage) piece of stack that its return value was on and compare to the IP?
18:36:55  Might be tricky to do portably :P
18:37:08  I can't compare to the IP.
18:37:09  This is C.
18:37:38  I think I'm gonna have to switch back to my old solution :(
18:37:41  Gregor: Call record() at the very top of the function
18:37:44  Gregor: Compare to the address of the function
18:37:53  elliott: Hello, prologue?
18:38:00  elliott: I do that to find the prologue anyway.
18:38:01  Gregor: Yes, so find out how large the prologue is
18:38:05  And subtract that from the return value
18:38:06 -!- Ngevd has joined.
18:38:08  return blah
18:38:10  You know what I mean
18:38:16  HELLO!
18:38:32 -!- ais523 has joined.
18:38:35  Gregor: Of course that means you have to detect the prologue in some other way, but... here's an idea
18:38:42  Oh thank god.
18:38:44  Gregor: Just scan the function code for the address of record.
18:38:45  The return address is right.
18:38:49  So the bug is elsewhere.
18:38:50  Then you just need to know how long "CALL" is.
18:38:51  Gregor, how goes IOCCC?
18:38:59  Ngevd: My new version is either better or worse.
18:39:22  Like that comic my dad reads from time to time!
18:39:34  Gregor: What WAS your old version?
18:39:39 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds).
18:39:51  elliott: The version you've seen...
18:40:05  Gregor: I have no idea how it actually JITted :P
18:40:09  Oh X-D
18:40:33  It had a separate function per each template, detected the absolute minimum prologue/epilogue, then copied out the appropriate parts from each function.
18:40:40  It was very sensitive to varying pro/epilogues.
18:40:46  Heh
18:42:36 -!- Phantom_Hoover has joined.
18:44:05  friendship aneurysm.
18:47:41  remind me not to read tvtropes stuff about homestuck anymore.
18:47:44  it's a genuine waste of time.
18:54:25  Gregor: dude so what if you like JIT from the future.
18:54:36  you just have to compile the program sometime in the future.
18:55:26  actually no you'd want to JIT in the future
18:55:31  so your future-JIT can take as much time as it wants
18:55:43  and the present-JIT will just grab code from the future.
18:55:52  this is all totally feasible in Feather, I imagine.
18:56:40  elliott: Hm, VAX is definitely doing something skwonky with return addresses ...
18:57:02  Gregor: Just google, man, VAX's insanities will be well-documented.
18:57:10  I'm tryin'!
19:01:43  111111:42455
19:01:43  111112:111112
19:01:43  111113:1
19:01:43  111121:8
19:01:43  111122:1
19:01:43  111123:1
19:02:00  Literals and the calculated size for the code to generate that literal.
19:02:02  mmmm numbers
19:02:36  Gregor: ...111112 bytes to generate 111112?
19:02:46  elliott: Shocking, innit!
19:03:00  Gregor: But... isn't that just a mov...
19:03:19  elliott: It's certainly not 111112 bytes worth of bullshit X-D
19:04:05  ARE YOU SURE???
19:04:29  Quite :P
19:04:42  OMG ...
19:04:46  I think I figured out what's going on X-D
19:05:00  All my literals are in the same range as valid addresses X-D
19:05:16  So the heuristic for determining whether it's an address or not goes all shitty.
19:06:11  ..gross
19:07:18  I'm still really confused why 111112 requires 111112 bytes to generate...
19:07:52  while other increments of previous numbers take 1 or whatever.
19:07:57  It doesn't, it was the heuristic that was wrong.
19:08:10  oh good. :)
19:08:38  VAX can only generate the value 111112 by incrementing 0 111112 times, not by generating 111111 and incrementing it.
19:08:52 * CakeProphet mind blows.
19:09:21  111111:80
19:09:22  111112:0
19:09:22  111113:0
19:09:22  111121:0
19:09:22  111122:0
19:09:24  Gettin' better :P
19:09:55  Gregor: well, unless generating a number n requires that you generate n-1 and then increment, and generating 0 is the base case.
19:10:00  then those two statements are equivalent. :>
19:11:11  but anyway that sounds really dumb.
19:11:26  maybe you shouldn't use VAX
19:11:46  I'm improving my heuristic :P
19:11:50  The problem with arguing with idiots on reddit for fun is that you have to deal with idiots on reddit.
19:11:53  Ya never know, this may be what was broken on SPARC too.
19:12:18  elliott: I thought you would have figured that out earlier. :P
19:12:44  111111:80
19:12:44  111112:1
19:12:45  111113:3
19:12:45  111121:60
19:12:47  YOU VAXY PIECE OF GARBAGE
19:12:58  Why are there so many ambiguous constants in my stack :'(
19:13:16  not enough popping
19:13:22  if you pop things then there won't be anything at all
19:13:25 * CakeProphet is awesome logic
19:14:17  "APA stands for Associative Processing Array, a kind of content-addressable memory. Just memory. How do you compute using just memory? The operations are done right there, near the cells where your bits are kept. No need to read your data word by word into a processor, than write it back - rather, your operations run in parallel, inside the memory, on every data word! SIMD operations on steroids."
19:14:33  Gregor: Why not pad out the constants?
19:14:38  Push all-0s, push value, push all-0s
19:14:40  Or something
19:14:55  This - is - C
19:15:11  111111:80
19:15:11  111112:68852
19:15:11  111113:80
19:15:11  111121:80
19:15:13  111122:80
19:15:15   // Gettin' closer X-D
19:15:33  elliott: the operations are GONE RIGHT THERE?
19:15:35  fascinating.
19:15:40  s/GONE/DONE/
19:15:49  Gregor: So?
19:15:55  Gregor: f(0, value, 0)
19:16:01  Assuming a contiguous stack...
19:16:22  contiguous. stack? ha ha ha ha
19:16:31  elliott: Remember that anything I do at detection time, I do at runtime.
19:16:36  I like how CakeProphet just says stupid things all day.
19:16:45 -!- Darth_Cliche has joined.
19:16:46  Gregor: You can erase arbitrary code sections with your void(void) funptr...
19:17:04  elliott: I haven't tested that yet :P
19:17:17  Gregor: There we go then! No complaint :)
19:17:43  elliott: how are the operations done right there?
19:17:46  "WE"""W""W"E"E"E
19:17:47  R""W
19:18:00  :)
19:18:38  also
19:18:53  wtf, can I seriously have the return address at a different point on the stack depending on what literal I'm pushing X-D
19:19:05  how would you go about extending Haskell so that :: could be defined within Haskell as a normal operator?
19:20:19  You mean (x::T) evaluating to x but with type T?
19:20:24  You can't use operators as declarations, that's nonsense.
19:20:24  yes
19:20:36  not in vanilla Haskell,  no.
19:20:38  CakeProphet: Well that's easy-ish...
19:20:50  the question was to create a hypothetical extension in which you could do things like that.
19:21:07  CakeProphet: Uh, so do you want the first thing I said, or do you want the second thing I said?
19:21:10  You are contradicting yourself.
19:21:27 -!- copumpkin has changed nick to damocles.
19:21:30  no I'm not...
19:21:37  Yep, you are.
19:21:39   You mean (x::T) evaluating to x but with type T?
19:21:41   yes
19:21:42   You can't use operators as declarations, that's nonsense.
19:21:45   the question was to create a hypothetical extension in which you could do things like that.
19:21:57  You either want the first thing I said, or the second; first answer implies first, second answer implies second.
19:22:13  elliott: lol, I can push any literal but 1.
19:22:21  Gregor: Just push 2 and subtract 1 :)
19:22:39  How can I subtract 1 with no 1! ;)
19:23:03  elliott: um?
19:23:09  Gregor: Push 3 and subtract 2
19:23:29  elliott: I'd rather figure out wtf is going on thank you very much.
19:23:36  Gregor: No this is the best.
19:23:43  :P
19:24:13 -!- damocles has changed nick to copumpkin.
19:24:46  Push 2, dup, div
19:25:04  elliott: I suppose :: doesn't really worklike an operator, so, yeah..
19:25:20  CakeProphet: There are two infix uses of ::.
19:25:27  You have not specified which you want to make non-primitive.
19:25:41  elliott: oh, see...
19:25:46  the way you worded those "two things"
19:25:56  made it not actually sound like you were specifying the two things.
19:26:18  one was just a question, the other was you saying it was nonsensical.
19:26:34  >_> anyway
19:26:59  the one that's used within expressions, I suppose.
19:27:18  since that would be the easier one.
19:28:14  Wouldn't that need a type type?
19:28:26  CakeProphet: Dependent types make that pretty trivial.
19:28:30  CakeProphet: Although (A :: x) is easier.
19:28:46  That's (::) :: (a :: Type) -> a -> a
19:28:50  (::) _ x = x
19:29:10  You can flip (::) but that messes with the quantification, but I suppose it could work.
19:29:26  (::) :: forall a. a -> (b::Type) -> (a ~ b) => a
19:29:27  :p
19:40:17 -!- zzo38 has joined.
19:40:47  Aha
19:40:54  Something is clearing my variable.
19:40:57  Trivia: greater is the only bi-directional Piet command
19:42:08  elliott: I wonder what else you could do with a type type.
19:42:18  CakeProphet: Nothing much, without dependent typing.
19:45:06  looooooooooooooool buffer overflow.
19:45:10  I am the greatest C programmer.
19:45:43  Gregor, is your program still less than or equal to 140 characters?
19:45:57  Ngevd: This is an unrelated program ;P
19:46:07  Ngevd: My tweetable interpreter will probably be another submission.
19:46:12  I CARETH NOT
19:47:56  tweetable code. what an effective marketing strategy.
19:48:08  we need a tweetable OS!
19:48:33  Well wouldja look at that, I have a working dc on VAX :P
19:48:40  lies
19:50:13  Youtube supports Feather!
19:50:49  woot?
19:51:25  http://channel9.msdn.com/Forums/Coffeehouse/Prototyping-New-Language-With-Haskell
19:51:29  someone has taken the name Feather
19:53:34  It will fade into obscurity like Mondrian and the first Numberwang
19:53:57  NUMBERWANG
20:09:46  Hey, Ngevd.
20:09:50  I present to you http://www.matthen.com/numberwang/
20:10:26 -!- Slereah has joined.
20:10:36 -!- Slereah_ has quit (Ping timeout: 260 seconds).
20:10:55 -!- sebbu2 has joined.
20:11:01 -!- oerjan has joined.
20:12:41  hm
20:12:43  Phantom_Hoover, oh god
20:12:56  Vorpal: YOUR METHOD AIN'T WORKING
20:13:52  ?
20:14:01  `? ?
20:14:03  ​? is wisdom
20:14:06 -!- sebbu has quit (Ping timeout: 260 seconds).
20:14:18  hrrg, most people on that page seem to be playing WordWang, but somehow they manage to hit NumberWang anyway
20:14:46  supercalifragilisticexpialidocious
20:17:52  Would it be possible to make a game in XML+SVG+XML Events+XSLT?
20:21:44 -!- tiffany has joined.
20:23:19 -!- tiffany has left.
20:26:23   Dammit ais where are you when I'm being paranoid. <-- obviously reporting you to THEM
20:34:37   Assuming a contiguous stack... <-- of spherical cows?
20:35:07  Ngevd, YOUR MOVEWANG
20:37:06   elliott: I suppose :: doesn't really worklike an operator, so, yeah.. <-- i've been thinking before that (:: T) should be a legal section, it would be useful
20:37:28  oerjan: I agree, but (x ::) would be much more fun.
20:37:36  scary
20:38:36  oerjan: quick, name (a -> b) -> Tagged a b
20:38:39  but then in some sense that's how System F/Core implements polymorphic values
20:38:46  (so you can e.g. do "foo bitSize :: Tagged Word32 Int"...)
20:38:53  and yeah
20:39:15  Phantom_Hoover, your move
20:39:36  Ngevd: -wang
20:39:50  elliott: um there's no way to implement that, since you don't actually _have_ a b.
20:40:09  oerjan: It's for converting things that use (a -> b) as (Tagged a b), silly :P
20:40:18  oh right
20:40:22  Implementation is \f -> Tagged . f $ error "YOU LIED TO ME"
20:40:45  elliott: phantomize
20:41:02  Ngevd, the game continueswang.
20:41:03  oerjan: hoover :: (a -> b) -> Tagged a b
20:41:15  O KAY
20:41:34  Your turn
20:42:01  wang
20:42:31  ais523: oh, hi
20:42:38  elliott: or tagomize (far side reference)
20:42:38  hi btw
20:42:46  ais523: "btw"?
20:42:47  Ngevd, argh, you continuewang to outfox me.
20:43:02  elliott: it was in response to your "oh, hi"
20:43:10  I was going to ask ais523 whether he was termcasting or not but then I realised he wasn't \unfoogy.
20:43:11  I was trying to find an even more noncommital way to say it
20:43:29  and I'm not playing right now; in fact, I'm at work, but that's just because I haven't gone home yet
20:43:35  Hey, ais523, can motherboards dissolve in slightly humid air?
20:43:41  I was with friends earlier, and it was much nearer home than work
20:43:52  Phantom_Hoover: err, they're not water-soluble, as far as I know
20:43:53  (fffff, case doesn't arrive until Monday.)
20:44:03  ais523, good, good.
20:44:23  copper tracks can be damaged by humidity, but any sane motherboard manufacturer knows that and will lacquer them to prevent them being damaged like that
20:44:42  (an easy way to tell if copper's been lacquered or not: if it hasn't been, it tend to be copper-coloured rather than green)
20:45:20  (transparent lacquer exists but isn't used commercially because it's more expensive than the green sort; it's pretty good for applying by hand, though)
20:46:11  OK basically what I'm saying is will leaving the motherboard, CPU and RAM in an antistatic bag with the opening folded over for 6 days in a room which is occasionally used for washing up result in it exploding?
20:46:14  just use a chlorine atmosphere, dugh
20:46:16  *-g
20:47:05  Ngevd, do you concedewang?
20:47:08  eww, why would you implement an API like that
20:47:24  Phantom_Hoover, nah, had to empty the dishwasher
20:47:43  Phantom_Hoover, your turn
20:47:44  application painful interface
20:48:24  Phantom_Hoover: it should be fine
20:48:38  you'll want to make sure they're dry before actually switching the thing on
20:48:50  but the motherboard is exposed to humidity inside the case just as much as it is outside it
20:48:54  as it relies on air for cooling
20:49:15  I am seriously beginning to doubt Colloson's impartiality.
20:50:42  Ngevd, playwang.
20:52:12  elliott: which API is that?
20:52:18  And you, Phantom_Hooverwang
20:52:25  ais523: this opencl binding
20:52:39  This is getting ridiculouswang.
20:53:11  Yourwang turn
20:53:52  elliott: tell me when they've stopped, if I'm still here? I just /ignored both of them
20:54:04  And yours.
20:54:06  Wang.
20:54:22  welcome to #esowang
20:54:30  And yourswang
20:54:42  I don't really think (x ::) could be used in normal Haskell.
20:54:47  er, usefully
20:54:49  -_-wang
20:55:21  I'm goodwang at this
20:55:33  for example, map (x ::) [SomeTypes, GoHere]
20:55:36  :t (x ::)
20:55:37  parse error on input `)'
20:55:39  would not type.
20:55:51  hmm, is the discussion about the fact that that doesn't parse?
20:55:51  CakeProphet: That seem non-meaningful
20:55:52  Ngevd: mewang toowang
20:55:56  ais523: no
20:56:07  it's a continuation of a discussion about :: as an operator
20:56:07  oh right, I confused Haskell with OCaml
20:56:13  where :: is a perfectly reasonable operator
20:56:37  I am scarewangly good at this
20:56:46  Not only would (x ::) not be a meaningful function, but you cannot map in that way anyways since the types don't match
20:56:57  zzo38: this is what I was saying.
20:57:06  but it could be a meaningful function in a dependently typed language.
20:57:34   elliott: tell me when they've stopped, if I'm still here? I just /ignored both of them
20:57:44  ais523: you can check the logs yourself...
20:57:48  well, OK
20:57:50  Then, maybe you could add a dependent type extension to Haskell and then add (x ::) to that extension
20:57:53  but that would mean actually looking at all the wanging
20:57:54  ais523: zzo38: scroll up just a bit to get the context.
20:58:15  :t (:: Int)
20:58:16  parse error on input `::'
20:58:22  ;_;
20:58:28  (:: T) seems more useful in normal Haskell usage.
20:58:43  :t (\x :: Int -> x)
20:58:44      Illegal result type signature `Int'
20:58:44        Result signatures are no longer supported in pattern matches
20:58:44      In a lambda abstraction: \ x :: Int -> x
20:58:51  :t (\x -> x :: Int)
20:58:52  Int -> Int
20:58:54  there we go
20:59:03  Phantom_Hoover, it's your turn
20:59:06  ?ty (`asTypeOf` (undefined :: Int))
20:59:07  Int -> Int
20:59:23  @src asTypeOf
20:59:23  asTypeOf = const
20:59:34  This is so stupid.
20:59:42  How does it even decide numbers?
20:59:43  oh, I see, asTypeOf has a type annotation in order to do its astypeofing
20:59:45  No idea
20:59:49  But it's your turn
20:59:50  ?ty asTypeOf
20:59:51  forall a. a -> a -> a
20:59:53  Phantom_Hoover doesn't get the joke.
20:59:54  (Yep)
21:00:03  I thought the impl would be something like a conditional that always took the same branch, I forgot you didn't /have/ to use the inferred types
21:00:05  ais523: correct
21:00:43  I guess const sort of is a conditional that always takes the same branch. :P
21:01:06  Your turn, Phantom_Hoover
21:01:08  well yes, const is the church encoding of True
21:01:17 -!- GreaseMonkey has joined.
21:01:17 -!- GreaseMonkey has quit (Changing host).
21:01:17 -!- GreaseMonkey has joined.
21:01:17  oerjan: I was wondering if someone would throw that in :P
21:01:36  Your turn, Phantom_Hoover
21:01:44  >_>
21:01:58  ais523: oerjan: hmm, would a language that forced you to use the most general inferred types be TC?
21:02:06  actually asTypeOf is even closer, it also has the expected type for a church encoded boolean
21:02:08  I think yes, since Haskell without type signatures and type classes is TC
21:02:24  elliott: my guess would be yes, yes.
21:02:27  :)
21:02:34  elliott: I don't see why it wouldn't be TC at all
21:02:35  sounds like it
21:02:40  especially as I think you could write astypeof in it
21:02:45  Phantom_Hoover, your turn
21:03:08  Ngevd: hi
21:03:42  sir, sir. I think you need to calm down, sir.
21:03:56  sir?
21:04:06  Ngevd, no wait, that's me
21:04:10  CakeProphet, I REFUSE
21:04:14  Ngevd: your turn, sir.
21:04:19  your turn to calm down.
21:04:23  let asTypeOf x y = if True then x else y
21:04:27  NEEEEVEEEER
21:04:28  *-let
21:04:40  starlet? :P
21:04:48  heh that's actually circular, i think
21:05:14  well, time to go, see you in about a week
21:05:24  olsner: bye paste olsner
21:05:33  paste?
21:05:35  I will say hello to fugutur you for you.
21:05:35  Phantom_Hoover, your godwang turn!
21:05:43  oh, past
21:05:49  ais523: hm i'm not sure you could do it with just functions
21:06:07 -!- olsner has quit (Quit: Leaving).
21:06:28  oerjan: why do you think that definition of asTypeOf above is circular? it's how I'd implement it
21:06:30  oerjan: iff c a b = if c then a else b
21:06:31  :P
21:06:54  ais523: because as i said above, asTypeOf is the closest thing to a church encoding of True
21:07:00  ah, I see
21:07:33  what about just defining church-true and church-false by hand, then doing a complicated computation that returns one or the other?
21:07:43  that'd force the results to be the same type
21:07:47  oerjan: doesn't mean you have to construct every language the same way.
21:07:54  it doesn't even have to be that complicated, it just has to look to the type system like it might return false
21:08:02  well the question is _can_ you make that
21:08:39  oerjan: what about (not (not true))?
21:08:44  oh not = flip
21:08:52  > let true x y = x; let false x y = y; let nand x y = x (y false true) (y true true)
21:08:53    : parse error (possibly incorrect indentation)
21:09:13  :t flip (flip const)
21:09:14  forall a a1. a -> a1 -> a
21:09:14  CakeProphet: well i'm saying that using True is cheating because you could not actually recode True in terms of just functions while preserving the type restriction
21:09:17  :t let true x y = x in let false x y = y in let nand x y = x (y false true) (y true true) in nand
21:09:18  forall t t1 t2 t3 t4. (t -> t -> t1) -> ((t2 -> t2 -> t2) -> (t3 -> t4 -> t3) -> t) -> t1
21:10:07  well, that forced a t2->t2->t2 into the middle of the expression
21:10:09  :t let true x y = x in let false x y = y in let nand x y = x (y false true) (y true true) in nand true
21:10:10  forall t t1 t2 t3. ((t1 -> t1 -> t1) -> (t2 -> t3 -> t2) -> t) -> t
21:10:30  ais523: what a terrible way to fix it
21:10:33  oerjan: so? :P
21:10:38  ais523: what type do you think (let true x y = x; let false x y = y; let nand x y = x (y false true) (y true true)) has?
21:10:48  elliott: not a very simple one
21:11:01  ais523: there is no expression, where is your "in" clause?
21:11:14  ais523: more importantly, you never close any of the "let"s
21:11:20  :t let true x y = x; false x y = y; nand x y = x (y false true) (y true true) in nand
21:11:20  elliott: you're looking at the wrong line
21:11:21  forall t t1 t2 t3 t4. (t -> t -> t1) -> ((t2 -> t2 -> t2) -> (t3 -> t4 -> t3) -> t) -> t1
21:11:30  ais523: no, I'm not, I'm saying you fixed it in a ridiculous manner
21:11:31   :t let true x y = x in let false x y = y in let nand x y = x (y false true) (y true true) in nand
21:11:50  elliott: btw, the version without an in works just fine in OCaml
21:11:58  the interp responds by telling you the name and type of everything you defined
21:12:02  and the value, if it's not a function
21:12:13  @hoogle a -> a -> a
21:12:14  Prelude asTypeOf :: a -> a -> a
21:12:14  Network.BufferType buf_append :: BufferOp a -> a -> a -> a
21:12:14  Prelude atan2 :: RealFloat a => a -> a -> a
21:12:20  ais523: evaluating syntactic nonsense like that is not a feature
21:12:31  but it's not nonsense
21:12:40  it's something that you'd write a lot in an actual program
21:12:48  no it isn't, because it isn't valid haskell
21:12:51  in a program you'd typically follow it with something that /used/ the definitions
21:12:53  "let" is rare in haskell, anyway
21:13:03  ais523: similarly, int main() { is valid C
21:13:07  but in a REPL, that's typically going to be on a future line
21:13:11  ais523: what would they scope over?
21:13:16  yes, which is why "let x = y" works in GHCi
21:13:17  copumpkin: future lines in the same REPL
21:13:17  ais523: in ghci, you can write let without in
21:13:22  oh hm i think i got it, using how lambdas are monomorphic internally
21:13:23  because it's a do block
21:13:39  but "let a = b; let c = d" is most assuredly not an expression
21:13:45  Phantom_Hoover, your turn
21:13:47  elliott: I was using ; as newline
21:13:52  is that not valid in Haskell?
21:14:13  ais523: that's a bit of a loaded question; I'm sure "a;b" doesn't mean "a\nb" in OCaml...
21:14:31  :t (\id x y -> (\x y -> x) (id x) (id y)) (\x -> x)
21:14:32  forall t. t -> t -> t
21:14:34  anyway, no, because the layout isn't right
21:14:38  I don't think OCaml needs anything there at all, it isn't whitespace-sensitive
21:14:56  # let a = 1 let b = 2 ;;
21:14:57  oh hmm the layout is okay
21:14:57  val a : int = 1
21:14:59  val b : int = 2
21:14:59  er oh wait
21:15:08  yeah no
21:15:10  the layout doesn't work out
21:15:11  whereas Haskell is, so you can't just write space to mean newline
21:15:13  because the "let"s aren't aligned
21:15:18  ais523: do { let a = 3; let b = 4; ... }
21:15:23  perfectly valid
21:15:33  ?ty do let { a = b }; let { c = d }; Just 1
21:15:34  forall t. (Num t) => Maybe t
21:15:52  ?ty do { let a = b ; let c = d; Just 1 } -- elliott
21:15:53  parse error on input `}'
21:16:03  :t (\c a b -> [a, b] !! fromEnum c)
21:16:04  Deewiant: err, right, ofc
21:16:04  forall a a1. (Enum a1) => a1 -> a -> a -> a
21:16:09  :t do let { a = b } ; let { c = d } ; return 1
21:16:10  forall t (m :: * -> *). (Num t, Monad m) => m t
21:16:20  conversely:
21:16:25  do let {a = 3}; let {b = 4}
21:16:27     return (a+b)
21:16:28  is perfectly valid
21:16:45  basically all we're learning here is that ais523 doesn't know Haskell's layout rules, but this is irrelevant anyway as lambdabot isn't a REPL
21:16:48  it's an expression evaluator
21:16:56  CakeProphet: using !! there is cheating, I think, but the same idea can be done without it, I Think
21:16:59  *think
21:17:22  CakeProphet: you can't construct lists like that with the lambda calculus
21:17:37  :t \a b -> case [a,b] of [x,_] = x; otherwise = x
21:17:38  parse error on input `='
21:17:40  elliott: erm, why did the topic suddenly switch to lambda calculus?
21:17:43  :t \a b -> case [a,b] of [x,_] -> x; otherwise -> x
21:17:44  Expr -> Expr -> Expr
21:17:47  that was always the topic
21:17:58  I thought it was "can you write asTypeOf with functions and no explicit type declarations in Haskell"
21:17:58  elliott: so that's a solution abusing the type of cons
21:18:00  ais523 also doesn't know how scoping works
21:18:02  :t \a b -> case [a,b] of [x,_] -> x; otherwise -> a
21:18:02  forall t. t -> t -> t
21:18:05  that's what I meant
21:18:13  elliott: not scoping, just a thinko
21:18:17  although a pretty funny one
21:18:32  that was the original question anyway.
21:18:35  that's actually flip astypeof, but I don't care
21:18:38  CakeProphet: well, lists are not functions
21:18:53  `echo "ais523: wiki spam"
21:18:54  and also, i did it above
21:18:55  ​"ais523: wiki spam"
21:18:58  :t (\id x y -> (\x y -> x) (id x) (id y)) (\x -> x)
21:18:59  forall t. t -> t -> t
21:19:10  oh i didn't see you do that
21:19:17  oerjan: that doesn't work in lambda calculus though :P
21:19:34  elliott: it works in lambda calculus with the hindley-milner type system
21:19:34  hmm, which lambda calculus are we even talking about?
21:19:40  it's a nonsense question in untyped LC ofc
21:19:46  the one that is Haskell.
21:19:46  STLC seems like the interesting one here
21:19:48  which is the one which requires let for polymorphism
21:19:54  what /is/ up with the excela spambots?
21:20:04  they seem to be running articles through babelfish twice or something
21:20:06  Best Numberwang.
21:20:14  ais523: they love excela
21:20:20  Ngevd, you might as well just give in now, you won't top that one.
21:20:33  also, what is that language?
21:20:38  it seems to allow embedded Ruby, at least
21:20:44  "at least"
21:20:51  Phantom_Hoover, you're rightwang
21:20:59  well, it's obviously not identical to Ruby
21:21:02  ais523: http://esolangs.org/wiki/Cobol_on_Cogs; delete for offtopic
21:21:02  and yet it's incredibly similar
21:21:14  Phantom_Hoover, but we have equal score, call it a tie?
21:21:21  Yeswang.
21:21:32  elliott: what do you think of Smjg's comment on the talk page?
21:21:38  ML on your mom    OH SNAP
21:21:39  elliott, tell ais523 to unblock us
21:21:43  I think it's misinterpreting mine
21:21:56  ais523: "misinterpreting mine"?
21:22:03  oh, I see
21:22:03  my comment on the talk page
21:22:12  I think so too, but am not sure of the relevance
21:23:15  elliott: you are joking about cobol on cogs, of course.
21:23:31  oerjan: ?
21:23:51  no way that's not esoteric :P
21:24:01  C on Crack. Perl on Propellers. Scheme on Speed. Python on Poop. C# on This. Is. Stupid.
21:24:39  oerjan: pls no promotion of the "anything unserious is esoteric" meme :(
21:24:46  that's what got us LOLCODE
21:25:03 * oerjan promotes with the swatter -----###
21:25:23  esolangs are all about the THEORETICAL AWESOME of course.
21:25:27  elliott: I think lolcode is esoteric
21:25:34  it's a thematic language; it's uninteresting semantically
21:25:41  but it fits the requirements to be an esolang
21:25:48  Glass is an esolang
21:25:57  ais523: http://esolangs.org/wiki/Talk:Cobol_on_Cogs#Off-topic
21:26:01  and it's pretty much just an OO stack machine with weird syntax.
21:26:10  you can wait for someone else to express an opinion, I suppose :P
21:26:14  elliott: I'll wait for other comments, like usual
21:26:19  CakeProphet: how many OO stack machines are there?
21:26:29  I know of Python.
21:26:52  well
21:26:57  the leading implementation of Python
21:27:00  more like stuck machine *HACK* *COUGH* *WHEEZE*
21:27:03  but not python itself I guess.
21:28:08  don't get stuck by putting stock in stack machines, stick to stg
21:28:25  wait that has a stack. strike that.
21:31:43  stackless spineless tagless g-machine
21:31:48  !glass {M[m(_o)O!"Hello World!"(_o)o.?]}
21:31:51  Hello World!
21:32:04  hmmm
21:32:06  hello world
21:32:09  I wonder if there are any processors with a cactus stack.
21:33:52  and yet another spam
21:34:01 -!- MDude has quit (Ping timeout: 276 seconds).
21:34:32  !glass {M[m(_o)O!(_a)A!<2><2>(_a)a.?(_o)(on).?]}
21:34:32  4
21:35:37 -!- elliott_ has joined.
21:35:39 -!- elliott has quit (Read error: Connection reset by peer).
21:41:48  Now I made ligatures work in the Haskell program for DVI processing
21:41:59 -!- pikhq has joined.
21:42:18  !glass {M[m(_o)O!(_a)A!n<5>=t<1>=/ntnn1(_a)s.?(_a)m.?=nn1(_a)s.?=\t(_o)(on).?]}
21:42:18  0
21:42:20  (It is not needed to read a DVI file, but kerning/ligature is useful when writing DVI files)
21:42:22  :(
21:42:34  oh rite
21:42:43 -!- DCliche has joined.
21:43:20  !glass {M[m(_o)O!(_a)A!n<5>=t<1>=/nttn(_a)m.?=nn1(_a)s.?=\t(_o)(on).?]}
21:43:20  0
21:43:23  :(
21:43:26  0
21:44:51 -!- Darth_Cliche has quit (Ping timeout: 240 seconds).
21:45:00 -!- pikhq_ has quit (Ping timeout: 258 seconds).
21:46:57  !glass {M[m(_o)O!(_a)A!n<5>=t<1>=/nttn(_a)m.?=nn<1>(_a)s.?=\t(_o)(on).?]}
21:46:57  0
21:46:59  :(
21:47:17  Gregor: help make my factorial work.
21:47:43  Oh god, Children in Need is on.
21:47:54  Someone distract me before I start wanting to kick babies.
21:48:08  Phantom_Hoover: that's Wordwang!
21:49:46  that's quaternionwang!
21:54:38  !glass {M[m(_o)O!(_a)A!(_n)<5>=(_t)<1>=/(_n)(_t)(_t)(_n)(_a)m.?=(_n)(_n)<1>(_a)s.?=\(_t)(_o)(on).?]}
21:54:38  0
21:54:41  nsjentkjwerkhsdkfhwert
21:56:51  oh
21:57:34  !glass {M[m(_o)O!(_a)A!(_n)<5>=(_t)<1>=/(_n)(_t)(_t)*(_n)*(_a)m.?=(_n)(_n)*<1>(_a)s.?=\(_t)*(_o)(on).?]}
21:57:34  120
21:57:38  yaaaaaaaay
22:00:47  "Homeomorphic to a 3-sphere." — Minecraft title screen text.
22:01:07  Protip, Notch: if you're going to make glib little references to maths, *get them right*.
22:01:37  Phantom_Hoover: you assume that most people actually care that it's correct.
22:01:53  Phantom_Hoover totally said that.
22:02:15  Phantom_Hoover: I assume that you assume that most people actually care that it's correct.
22:03:17  well, does minecraft have a point at infinity?  if so it could be right :P
22:03:29  oh hm there's that height limit
22:03:41  so not likely
22:04:01  oerjan: it's infinite in two dimensions and finite in one
22:04:31  oerjan: But IF YOU'D HELP ME WITH MY PLANETARY MODEL, I think an Elliottcraft planet would be a 3-sphere
22:04:33  homeomorphic to a 3-ball then, probably.  assuming open.
22:04:40  FSVO 'infinite'.
22:04:50  Phantom_Hoover: It's infinite in intention and in practice.
22:04:51  you assume he is referring to the topological space of the minecraft world.
22:04:53  how foolish.
22:05:08  Yes, because homeomorphism is a topological thing.
22:05:35  Phantom_Hoover: When will you realise that CakeProphet just says dumb things as his special version of a "joke".
22:06:00  no that wasn't a joke.
22:06:04  elliott_: i don't see planets as being 3-spheres, really
22:06:15  oerjan: they're infinite in three dimensions
22:06:21  oerjan: Elliottcraft space travel involves moving in the fourth :P
22:06:25  elliott_, that's not a 3-sphere.
22:06:31  Oh, hmm.
22:06:44  Yeah, oops.
22:06:49  Also you realise that you're recreating Madoka-Kaname's stupid realm system.
22:06:53  R^3 + a point at infinity
22:06:58  Phantom_Hoover: Not really?
22:07:10  Phantom_Hoover: The idea is proper space, but I don't really feel like sacrificing infinite worlds.
22:07:27  wait
22:07:27  what
22:07:33  if you made the point at infinity
22:07:38  the access point
22:07:44  (This makes literally no sense.)
22:07:51  elliott_: I was saying that "homeomorphic to a 3-sphere" doesn't imply that he's specifically referring to the shape of the minecraft world, or well, anything. Especially considering the tongue-in-cheek nature of those title things.
22:07:52  sacrificing infinite worlds should be the goal of any respectable galactic overlord
22:09:13 -!- sebbu2 has changed nick to sebbu.
22:09:36  Phantom_Hoover: What if you could get four-dimensional TNT so you could blow up an entire planet with just one block's worth of damage.
22:09:52  I don't know?
22:11:44 -!- sebbu2 has joined.
22:11:44 -!- sebbu2 has quit (Changing host).
22:11:44 -!- sebbu2 has joined.
22:13:42  Phantom_Hoover: Gregor: "Danger Mouse co-creator Mark Hall dies after battle with cancer" ;______;
22:13:55  Oh good here's a more reliable source: http://www.bbc.co.uk/news/entertainment-arts-15792282
22:14:23  noooo?
22:14:27 -!- sebbu has quit (Ping timeout: 240 seconds).
22:14:34  Phantom_Hoover: Why the question mark this is the SADDEST
22:15:15  I'm sorry I never really watched Danger Mouse?
22:15:26  I'll blame it on Except For Viewers In Scotland.
22:15:27  Phantom_Hoover: Your life is woefully incomplete?
22:16:15  elliott_: but hey, I could be worse; what if I got offended by tongue-in-cheek math references
22:16:31 -!- elliott_ has changed nick to elliott.
22:16:33 -!- elliott has quit (Changing host).
22:16:33 -!- elliott has joined.
22:17:00  CakeProphet: ACCEPT
22:17:20  Phantom_Hoover: satisfactory answers to what if questions include "woah" or "dude"
22:17:27  or "woah dude"
22:17:39  elliott: I don't know how to accept silly invites.
22:17:44  /join
22:17:44  I've yet to figure it out.
22:17:53  elliott: but that's not really accepting anything
22:17:55  I can do that anyway.
22:17:59 * CakeProphet is confused by these IRC customs.
22:18:01  That's how you accept invites.
22:18:28  CakeProphet, because it's not exactly tongue-in-cheek?
22:18:33  elliott: that makes no sense.
22:18:43  CakeProphet: /join #esoteric-minecraft
22:18:53  but I can just do that anyway.
22:18:57  your invite is meaningless.
22:19:00  if there is no way to accept it
22:19:06  It's screaming "look how clever I am, I know what a 3-sphere is" without actually /knowing/.
22:19:06  that is distinct from the normal way of joining channels.
22:19:10  CakeProphet: JOIN NOW.
22:19:21  Phantom_Hoover: I bet Notch knows what a 3-sphere is.
22:19:22  Invites allow you to join invite-only channels, for one.
22:19:37  CakeProphet, he evidently doesn't know what either it or homeomorphism is.
22:20:00   Phantom_Hoover: Gregor: "Danger Mouse co-creator Mark Hall dies after battle with cancer" ;______; <-- we should make an esolang in his memory
22:20:05  based on his tongue-in-cheek reference to them? :P
22:20:08  I'm not convinced.
22:20:46  CakeProphet, *it's not isomorphic to the 3-sphere*.
22:20:52  Not even *close*.
22:21:06  RIP mother of Brian Joseph Burton
22:21:30  It's isomorphic to R^2×[0,1] in the ideal case.
22:21:31  er, co-father? I'm confused.
22:21:33  CakeProphet: JOIN THE FUCKING CHANNEL
22:21:39  Phantom_Hoover: but uh...
22:21:41  okay nevermind
22:22:50 -!- ais523 has quit (Remote host closed the connection).
22:23:40  Did David R. Fuchs or Donald Knuth know about functional programming languages in designing DVI format or TeX? I am just curious.
22:23:48 -!- Patashu has joined.
22:24:29  Phantom_Hoover: it's entirely possible that he knows exactly what those things are and is referring to them in an absurd manner. for other examples of Notch saying absurd things see: many other title thingies.
22:24:44  and the fact that his possibly absurd title thingy uses the terminology incorrectly does not mean that he doesn't know what they are.
22:24:55  CakeProphet: You don't actually play Minecraft, do you?
22:24:59  but that he has instead successfully pulled someone's strings.
22:25:01  elliott: nope
22:25:02  I can assure you that Notch has no idea what he's talking about.
22:25:11  And that the 3-sphere remark will be taken from someone else telling him it is.
22:25:38  but can you /know/?
22:25:38  Now join the fucking channel
22:25:48  epistemology time
22:26:55  elliott: I refuse to concede to the demands of ruthless channel despots.
22:27:01  Join or die.
22:27:36  you are not the catholic church / expanding Islamic empire / etc
22:28:26  Expanding Islamic empire?
22:28:35  yes.
22:28:56  Any particular Islamic empire?
22:29:03  I guess the Umayyad Caliphate? I dunno they probably did that in the Orthodox Caliphate too.
22:29:23  the one, that was the empire, that was islamic, back in the day, with the caliphates.
22:29:49  Ottoman?
22:29:51  no.
22:30:30  I could explain it, or I could just link this http://en.wikipedia.org/wiki/Islamic_empire
22:31:13  I guess it is a pretty ambiguous term...
22:31:47  but yeah the caliphates expanded their empire by conquering people and then forcing them to either convert to Islam or die.
22:31:58  that empire is the one I was referring to.
22:32:47  i thought it was sort of, convert to islam or pay extra taxes, but i guess it varied a lot.
22:32:54 -!- Ngevd has changed nick to yorrick.
22:33:00 -!- yorrick has changed nick to Ngevd.
22:33:02  `addquote  but yeah the caliphates expanded their empire by conquering people and then forcing them to either convert to Islam or die. [...]  i thought it was sort of, convert to islam or pay extra taxes, but i guess it varied a lot.
22:33:04  722)  but yeah the caliphates expanded their empire by conquering people and then forcing them to either convert to Islam or die. [...]  i thought it was sort of, convert to islam or pay extra taxes, but i guess it varied a lot.
22:33:09  oerjan: well, for monotheists yes
22:33:09 -!- Ngevd has changed nick to yorrick.
22:33:16 -!- yorrick has changed nick to Ngevd.
22:33:26  I was under the impression that they were not so merciful to polytheists.
22:33:38  yeah there was that dhimmi distinction
22:35:37 -!- sebbu2 has changed nick to sebbu.
22:35:46  Could've sworn it was something like "convert to Abrahamic monotheism or die, convert to Islam or pay taxes"
22:37:10  i read the zoroastrians were accepted as well, in iran
22:37:48  Yeah, they'd have a bit of trouble trying to kill them off; that was kinda *the* religion of Iran.
22:40:01 -!- tica_chan has joined.
22:40:40  `welcome tica_chan
22:40:43  tica_chan: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
22:40:50  Hi !
22:41:18  Hello!
22:41:49  How are you?
22:41:58  Fine and you  ?
22:42:03 -!- Ngevd has set topic: !.
22:42:15  I did not mean to change the topic
22:42:17  Um...
22:42:22  Not entirely sure how it happened
22:42:26  eek
22:42:46 -!- oerjan has set topic: The IOCCC is back on! http://www.ioccc.org | Even a dog can learn these cat training techniques | http://codu.org/logs/_esoteric/.
22:42:49  oerjan: wtf is `welcome and why does it exist
22:42:59  oO
22:43:02  it's `@ person ? welcome :P
22:43:10  elliott: it accepts more than one person
22:43:18  elliott: ths is `welcome
22:43:23  `welcoem elliott
22:43:25  oerjan: that would go in @, not a specific command...
22:43:25  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: welcoem: not found
22:43:25  `url bin/welcome
22:43:27  also, no one could remember the syntax :P
22:43:27  http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/bin/welcome
22:43:34  ew
22:43:37  elliott: it calls @ inside
22:43:40  `rm bin/welcome
22:43:42  No output.
22:43:42  oerjan: elliott doesn't like people installing shortcuts to other commands on HackEgo
22:43:46  for some reason.
22:43:47  oerjan: it's about 5000 times more complicated than it needs to be :P
22:43:48  ah.
22:43:49  tica_chan, we're a bunch of geeks
22:43:56  And nerds
22:43:59  Ow. I see that x)
22:44:03  elliott: i said it accepts a list of nicks
22:44:03  But comparatively few dorks!
22:44:10  oerjan: yes, it still is
22:44:18  ;_;
22:44:43  elliott: official resident HackEgo despot.
22:44:47  if [ $# -e 0 ]; then exec ? "$@"; else name=$1; shift; exec @ "$name" welcome "$@"; fi
22:45:23  So... geeks and nerds make me afraid... I think I'll escape
22:45:41  tica_chan: (if you want the other kind of esoteric, see #Philosophy)
22:45:46  warning: it's a really crappy channel
22:45:51  (lol)
22:46:01  goodbye, geeks !
22:46:13  elliott: i don't know sh syntax well enough.  also welcome gets all its nick list as one argument, by HackEgo default
22:46:19  tica_chan, no stay!
22:46:28  oerjan: oh, well that's trivially fixable
22:46:36 -!- tica_chan has left.
22:46:40  wrap whole thing in f () { ... }, do f "$*"
22:46:55  Well, with any luck the topic fiasco will NEVER HAPPEN AGAIN
22:46:55  I GUESS I'll add it
22:47:29  `run echo '#!/bin/sh' >bin/welcome; echo 'if [ $# -eq 0 ]; then' >>bin/welcome
22:47:31  No output.
22:47:53  `run echo '    exec ? $*' >>bin/welcome
22:47:55  No output.
22:48:07  `run echo else >> bin/welcome; echo '    name=$1' >>bin/welcome; echo '    shift' >>bin/welcome
22:48:08  i think my (echo ...; echo ...) >... method is shorter
22:48:09  No output.
22:48:32  erm
22:48:36  fuck :P
22:49:02  oerjan: hmm, what was that?
22:49:06  i didn't actually read yours, obviously >:)
22:49:42  just to put the piping outside all the echos
22:49:54  oerjan: wasn't it also Perl?
22:50:03  or, no?
22:50:10  there was something that was perl.
22:50:12  oerjan: oh
22:50:24  OK I now have a cat on the arm of my chair.
22:50:25  CakeProphet: yes.  another reason i use perl is because sh freaks me out because i never know if i get escaping right.
22:50:55  oerjan: elliott also deleted my perl scripts. SOUNDS SUSPICIOUS DOESN'T IT. ;)
22:51:01  CakeProphet: AHA
22:51:17  oerjan: sh freaks me out too
22:51:24  `runperl print "though he may have forgot this one"
22:51:25  though he may have forgot this one
22:51:29  oh yeaaaaah
22:51:31  but thankfully irc names cannot have spaces in them.
22:51:33  `rm bin/runperl
22:51:35  No output.
22:51:37  I ALREADY REMOVED THAT :(
22:51:40  !perl print "HMPH\n"
22:51:41  HMPH
22:51:41  noep
22:51:48  elliott: no, but they can have \'s, i think :P
22:51:50  `fetch http://sprunge.us/dXcP
22:51:51  2011-11-18 22:51:51 URL:http://sprunge.us/dXcP [156] -> "dXcP" [1]
22:51:57  `run mv dXcp bin/welcome; chmod +x bin/welcome
22:52:00  mv: cannot stat `dXcp': No such file or directory
22:52:00  elliott: but EgoBot is not HackEgo
22:52:05  `run mv dXcP bin/welcome; chmod +x bin/welcome
22:52:07  No output.
22:52:08  `welcome oerjan blah blah
22:52:17  ...
22:52:18  and whatever else confuses sh
22:52:24  ​/hackenv/bin/welcome: 7: Syntax error: end of file unexpected (expecting "fi")
22:52:52  wtf
22:53:18  you didn't terminate your if
22:53:18  ?
22:53:27  oh, no.
22:55:19   tica_chan: (if you want the other kind of esoteric, see #Philosophy) <-- is this the official redirect now?
22:55:45  elliott: declarer of official things.
22:55:46  oerjan: yes; the trick is that it's a really terrible channel composed of two #esoteric rejects who are completely bizarre.
22:56:08  you may decide for yourself whether this is a cruel joke or the best possible alternative :P
22:56:10  too esoteric for #esoteric, as it were.
22:56:14  What rejects?
22:56:43 -!- SgeoN1 has joined.
22:57:00  zzo38: people who came in here thinking it's about that other kind of esoteric :P
22:57:18  O, those people. But which ones, specifically?
22:58:28  i forget the names
23:00:08  elliott: does shift return anything?
23:00:22  nothing in shell "returns" anything
23:00:36  ah.
23:00:37  okay.
23:01:12  I guess shift > /dev/null  would suck for the common case
23:01:13  `cat bin/welcome
23:01:15  ​#!/bin/sh \ f () { \     if [ $# -eq 0 ]; then \         exec ? welcome \     else \         name=$1 \         shift \         exec @ "$name" welcome "$@" \     fi \ } \ f $* \
23:01:50  the mind boggles at the brain that could consider this preferable to my perl.
23:02:08  someone who doesn't like perl.
23:03:10  oerjan: a haskell solution will also be accepted
23:03:18  `welcome now what?
23:03:21  now: what?: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
23:03:28  ah it works
23:03:29  ooh, someone fixed it?
23:03:30  `welcome hi
23:03:32  hi: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
23:03:35  I don't know, why do you need a different one from shell script in this case.
23:03:38  `welcome weird\nick
23:03:40  weird \ ick: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
23:03:49  elliott: *MWAHAHAHA*
23:03:56 -!- oerjan has changed nick to weird\nick.
23:04:01  perfectly legal, too
23:04:03  oerjan: it's the \n :P
23:04:05 -!- weird\nick has changed nick to oerjan.
23:04:08  i'll write a haskell version >:)
23:04:22  elliott: does HackEgo _have_ haskell?
23:04:33  `run ghc --version
23:04:35  The Glorious Glasgow Haskell Compilation System, version 7.2.1
23:04:42  Why do you need a Haskell version? Shell scripts works for this case (but you need to correct the mistake)
23:04:54  elliott: what _do_ you have against perl...
23:05:11  it's my second favorite language, basically
23:06:04  and won't haskell be slow unless precompiled
23:06:17  we have ghc
23:06:29  do { names <- getArgs; let x:xs = ["@", name | name <- names] ++ ["?", "welcome"]; (_,_,_,p) <- proc x xs; waitforProcess p >>= ... bah
23:06:46  oerjan: fine put the perl version back :P
23:06:47  best choice: perl
23:06:54  `help
23:06:55  Runs arbitrary code in GNU/Linux. Type "`", or "`run " for full shell commands. "`fetch " downloads files. Files saved to $PWD are persistent, and $PWD/bin is in $PATH. $PWD is a mercurial repository, "`revert " can be used to revert to a revision. See http://codu.org/projects/hackbot/fshg/
23:07:05  `revert 997
23:07:06  Done.
23:07:07  `rm bin/runperl
23:07:08  `url bin/welcome
23:07:09  No output.
23:07:10  http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/bin/welcome
23:07:18 -!- copumpkin has quit (Quit: Computer has gone to sleep.).
23:07:23  oerjan: if (defined($_=shift))
23:07:29  i am more than 100% sure you can do that more nicely :P
23:08:13  oerjan: anyway what's wrong with
23:08:17  exec map { "@", $_ } @ARGV, "?", "welcome";
23:08:22  oh
23:08:36  exec map { "@", $_ } (split / /, $ARGV[1]), "?", "welcome";
23:08:40  or something
23:08:55  the @ needs to get its arguments as one string
23:09:01  `cat bin/@
23:09:03  ​#!/bin/sh \ if echo "$1" | grep -c ' ' >/dev/null; then \     echo -n "$1" | sed 's/ .*/: /' \     exec $(echo "$1" | sed 's/[^ ]* //') \ else \     echo -n "$1: " \     shift \     exec "$@" \ fi \
23:09:08  oerjan: wrong.
23:09:19  oh? hm.
23:09:39  `run @ test @ this echo hi
23:09:40  test: this: hi
23:09:52  ah
23:09:57  although...
23:09:59  exec map { "@", $_ } ($#ARGV > 1 ? @ARGV : split(/ /, $ARGV[1])), "?", "welcome";
23:10:09  `run @ weird\nick @ this echo hi
23:10:11  weirdnick: this: hi
23:10:20  *MWAHAHAHA*
23:10:20  exec map { "@", $_ } ($#ARGV > 1 ? @ARGV : split(/\s+/, $ARGV[1])), "?", "welcome";
23:10:25  oerjan: that's shell escaping, doofus
23:10:30  `run @ 'weird\nick' @ this echo hi
23:10:32  weird \ ick: this: hi
23:10:36  fuq
23:10:49  `@ weird\nick echo hi
23:10:51  weird \ ick: exec: 9: weird: not found
23:10:58  what
23:11:07  XD
23:11:22 * oerjan might convert elliott to perl yet at this rate
23:12:13  oerjan: or maybe i'll implement a wonderful process handling library for haskell >:)
23:12:47  well you could always do $_=shift; if (defined)
23:13:31  regarding the defined($_=shift)  bit
23:13:36  but, I think that looks fine. good perl. :)
23:13:45  defined($_=shift) was the first thing i tried which worked
23:13:55  i tried just $_[0] before
23:14:07  hm or something
23:14:40  ah yeah perl is weird about @_
23:14:51  because it's readonly
23:18:10  oh wait
23:18:12  oerjan: you think i'm joking, but i actually just sketched a simple API right now :P
23:18:19  @_ isn't a thing in your current scope anyway.
23:18:19  Maybe you meant: . ? @ v
23:18:27  elliott: there's rawSystem btw
23:18:34  shift uses @ARGV when outside of functions and @_ when inside them
23:18:36  @hoogle rawSystem
23:18:36  System.Process rawSystem :: String -> [String] -> IO ExitCode
23:18:37  System.Cmd rawSystem :: String -> [String] -> IO ExitCode
23:18:41  oerjan: yeah but it's ugly and planned for deprecation
23:18:46  wat
23:18:59  oerjan: you're meant to do everything through createProcess
23:19:34  elliott: have they gone completely insane?
23:19:42  oerjan: createProcess isn't that bad...
23:20:41  welcome :: [String] -> IO ()
23:20:41  welcome names = startCommand cmd >=> waitProcess >>= exitWith
23:20:41    where cmd = proc $ ["@", name | name <- names] ++ ["?", "welcome"]
23:20:41  yesssssss
23:23:10  nope
23:23:55  oerjan: ?
23:24:41  proc takes the command separately.  also i see no startCommand.
23:25:17  oerjan: whoosh
23:25:46  oh it's your own redesign?
23:27:20  CakeProphet: @_ is @ARGV outside functions
23:27:30  oh?
23:28:13  or wait
23:28:30  `run echo '$_=shift; s/ +/ @ /g; exec ($_?"@ $_ ":"")."? welcome";' > bin/welcome2
23:28:32  No output.
23:28:34 -!- MSleep has joined.
23:28:34 -!- copumpkin has joined.
23:28:41  `run perl bin/welcome2
23:28:43  No output.
23:28:45  :(
23:29:41  `run perl bin/welcome2 test
23:29:43  test:
23:29:46  lol
23:29:59  CakeProphet: nice complete lack of escaping.
23:30:09  CakeProphet: d'oh i've misread the documentation, no wonder @_ didn't work :P
23:30:10  I escape from no one.
23:30:21  `cat bin/welcome2
23:30:23  ​$_=shift; s/ +/ @ /g; exec ($_?"@ $_ ":"")."? welcome";
23:30:46  it's @ARG which is a synonym for @_, not @ARGV
23:31:46  CakeProphet: #!/usr/bin/perl -w , friend
23:31:55  :(
23:32:44  `run {echo '#!/usr/bin/perl -w'; echo '$_=shift; s/ +/ @ /g; exec ($_?"@ $_ ":"")."? welcome";'} > bin/welcome2
23:32:47  bash: {echo: command not found
23:32:53  `run { echo '#!/usr/bin/perl -w'; echo '$_=shift; s/ +/ @ /g; exec ($_?"@ $_ ":"")."? welcome";' } > bin/welcome2
23:32:55  bash: -c: line 1: syntax error: unexpected end of file
23:32:58  ekkrjiwerjiuwhejr
23:33:01  help bash
23:33:05  CakeProphet: it should be quite clear that since \ is a legal char in a nick, you want to be very careful to avoid escape interpretation
23:33:30  it does.
23:33:31  >_>
23:33:34  right?
23:33:51  mind you, @ also breaks it
23:33:51  MUAHAHAHAH
23:34:17  `run echo '#!/usr/bin/perl -w' > bin/welcome2; echo '$_=shift; s/ +/ @ /g; exec ($_?"@ $_ ":"")."? welcome";'  >> bin/welcome2
23:34:19  No output.
23:34:29  `cat `which welcome2`
23:34:32  cat: `which welcome2`: No such file or directory
23:34:37  `run cat `which welcome2`
23:34:45  I am m4st3r h4k3g0
23:35:08  No output.
23:35:45  >_>
23:35:59  `which welcome2
23:36:01  No output.
23:36:05  >_>
23:36:13  elliott: Feel free to read JIT try2.
23:36:13  `run chmod +x bin/welcome2
23:36:15  No output.
23:36:17  oh hi.
23:36:25  `which welcome2
23:36:26  ​/hackenv/bin/welcome2
23:36:27  oerjan: stupid executable bit...
23:36:33  `welcome2
23:36:35  Useless use of concatenation (.) or string in void context at /hackenv/bin/welcome2 line 2. \ Use of uninitialized value $_ in substitution (s///) at /hackenv/bin/welcome2 line 2.
23:36:41  lul
23:36:50  `run echo '#!/usr/bin/perl -w' > bin/welcome2; echo '$_=shift; s/ +/ @ /g; exec (($_?"@ $_ ":"")."? welcome");'  >> bin/welcome2
23:36:52  No output.
23:36:57  `run chmod +x bin/welcome2
23:36:58  No output.
23:37:00  `welcome2 hi
23:37:02  hi: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
23:37:07  `welcome2
23:37:10  Use of uninitialized value $_ in substitution (s///) at /hackenv/bin/welcome2 line 2. \ Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
23:37:12  `welcome2 weird\nick\asshole
23:37:15  weirdnickasshole: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
23:37:27  CakeProphet: @ itself is not \ clean
23:38:40  `cat bin/@
23:38:42  ​#!/bin/sh \ if echo "$1" | grep -c ' ' >/dev/null; then \     echo -n "$1" | sed 's/ .*/: /' \     exec $(echo "$1" | sed 's/[^ ]* //') \ else \     echo -n "$1: " \     shift \     exec "$@" \ fi \
23:39:36  `run echo '#!/usr/bin/perl -w' > bin/welcome2; echo '$_=shift and s/ +/ @ /g; exec ((defined?"@ $_ ":"") . "? welcome");'  >> bin/welcome2
23:39:39  No output.
23:39:42  `run chmod +x bin/welcome2
23:39:44  No output.
23:39:48  `run welcome2 hi asshole
23:39:50  Warning: Use of "defined" without parentheses is ambiguous at /hackenv/bin/welcome2 line 2. \ Bareword found where operator expected at /hackenv/bin/welcome2 line 2, near "?"@ $_ ":"") . "? welcome" \.(Missing operator before welcome?) \ Unquoted string "welcome" may clash with future reserved word at /hackenv/bin/welcome2 line 2. \ String found where operator expected at /hackenv/bin/welcome2 line 2, at end of
23:39:55  awediuhweiuhwiuerhiuw4hriuhswr
23:39:59  oerjan: screw -w :P
23:40:08  and -e
23:40:10  which is
23:40:25  an imaginary option that makes errors cause perl programs not to execute.
23:41:17  `run echo '#!/usr/bin/perl -w' > bin/welcome2; echo '$_=shift and s/ +/ @ /g; exec (((defined)?"@ $_ ":"") . "? welcome");'  >> bin/welcome2
23:41:19  No output.
23:41:23  `run chmod +x bin/welcome2
23:41:25  No output.
23:41:27  `welcome2
23:41:29  Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
23:41:32  `welcome2 hi hi
23:41:35  hi: hi: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
23:41:37  `welcome2 weird\dude
23:41:39  weirddude: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
23:41:45  `run welcome2 'weird\dude'
23:41:48  weirddude: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
23:41:51  $ clang -O4 full.c
23:41:51  /tmp/cc-p91cPs.o: file not recognized: File format not recognized
23:41:52  >_O
23:42:06  `url bin/welcome2
23:42:07  http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/bin/welcome2
23:42:15  is this version betterer than welcome?
23:43:09  `welcome
23:43:11  Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
23:43:21  `run (echo '#!/usr/bin/perl -w'; echo '$_ = join " ", @ARGV; if (s/^.*? +.*? //) { print "$1: "; exec $2, $_; }' >bin/@
23:43:23  bash: -c: line 1: syntax error: unexpected end of file
23:43:30  `run (echo '#!/usr/bin/perl -w'; echo '$_ = join " ", @ARGV; if (s/^.*? +.*? //) { print "$1: "; exec $2, $_; }') >bin/@
23:43:32  No output.
23:43:37  elliott: OH NO PERL IS TAKING OVER
23:43:42  elliott: BEAR ARMS
23:43:46  `run chmod +x bin/@
23:43:48  No output.
23:43:54 -!- Zuu has quit (Ping timeout: 244 seconds).
23:43:55  `@ test echo hi
23:43:57  Use of uninitialized value $1 in concatenation (.) or string at /hackenv/bin/@ line 2. \ Use of uninitialized value $2 in exec at /hackenv/bin/@ line 2. \ Can't exec "": No such file or directory at /hackenv/bin/@ line 2. \ :
23:44:03  XD
23:44:13  oh duh
23:44:46  oerjan: stop replacing everything with perl >:(
23:45:02  `run (echo '#!/usr/bin/perl -w'; echo '$_ = join " ", @ARGV; if (s/^([^ ]*) +([^ ]*) +//) { print "$1: "; exec $2, $_; }') >bin/@
23:45:04  No output.
23:45:09  `run rm bin/welcome2; # breaks on \
23:45:11  No output.
23:45:14  `run chmod +x bin/@
23:45:16  No output.
23:45:22  `@ test echo hi
23:45:23  test: hi
23:45:29  `@ test\nick echo hi
23:45:31  test\nick: hi
23:45:35  elliott: it doesn't
23:45:43   `welcome2 weird\dude
23:45:43   weirddude: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
23:45:43  `welcome test\nick ho
23:45:45  test\nick: ho: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
23:45:50  CakeProphet: it does
23:46:11  that has nothing to do with my script.
23:46:18  elliott: now there's a @ and welcome which escape properly, at least
23:46:27  (or not-unescape)
23:46:33  oerjan: you could have just fixed @ without rewriting it...
23:46:47  (in perl)
23:46:55  elliott: no, because i cannot get my head around sh's escape madness
23:47:04  oerjan: then tell someone who can to fix it :P
23:47:17  elliott: feel free to rewrite it in sh again
23:47:30  it wouldn't need rewriting
23:47:34  `run echo '#!/usr/bin/perl -w' > bin/welcome2; echo '$_=shift and s/ +/ @ /g;' >> bin/welcome2; echo 'exec (((defined)?"@ $_ ":"") . "? welcome");'  >> bin/welcome2
23:47:36  No output.
23:47:37  OSHI HACKEGO EDIT WAR
23:47:49  `run chmod +x bin/welcome2
23:47:50  No output.
23:48:01  `welcome2 weird\nick\asshole
23:48:03  weirdnickasshole: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
23:48:10  oh look it is my script, wonder why.
23:48:18  `welcome weird\nick\asshole
23:48:20  weird\nick\asshole: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
23:48:53  `rm bin/welcome2
23:48:54  No output.
23:49:48  I was under the impression that interpolation did no escapey nonsense.
23:50:11  CakeProphet: exec uses a shell if you have just one string argument to it
23:50:36  you must split away the command to avoid that
23:50:59  oh i was going to check
23:51:07  `run @ test @ ho echo hi
23:51:09  test: ho: hi
23:51:14  good
23:52:45  challenge: make a script that is like @ but automatically uses the command invoker as the nick.
23:53:17  i'm not sure HackEgo passes on that information, or does it
23:53:27  `printenv
23:53:29  TERM=linux \ http_proxy=http://127.0.0.1:3128 \ HACKENV=/hackenv \ PATH=/hackenv/bin:/opt/python27/bin:/opt/ghc/bin:/usr/bin:/bin \ PWD=/hackenv \ SHLVL=0 \ HOME=/tmp
23:53:30  s/make a script/hack hackego so/
23:53:34  `which printenv
23:53:36  ​/usr/bin/printenv
23:53:42  wtf is that distinct from env
23:53:56  `env
23:53:58  TERM=linux \ http_proxy=http://127.0.0.1:3128 \ HACKENV=/hackenv \ PATH=/hackenv/bin:/opt/python27/bin:/opt/ghc/bin:/usr/bin:/bin \ PWD=/hackenv \ SHLVL=0 \ HOME=/tmp
23:54:09  i didn't know env could print too
23:54:23  `run file `which printenv`
23:54:25  ​/usr/bin/printenv: ELF 64-bit LSB executable, x86-64, version 1 (SYSV), dynamically linked (uses shared libs), for GNU/Linux 2.6.18, stripped
23:54:31  `run file `which env`
23:54:33  ​/usr/bin/env: ELF 64-bit LSB executable, x86-64, version 1 (SYSV), dynamically linked (uses shared libs), for GNU/Linux 2.6.18, stripped
23:54:37  huh
23:54:42  not even a softlink or anything.
23:55:07  well env lets you set them.
23:55:16  `run ls -l /usr/bin/printenv /usr/bin/env
23:55:19  ​-rwxr-xr-x 2 0 0 27576 Apr 28  2010 /usr/bin/env \ -rwxr-xr-x 2 0 0 27448 Apr 28  2010 /usr/bin/printenv
23:55:24  they
23:55:31  're not the same file...
23:56:07  because printenv can't set
23:56:10  the question is why it exists at all
23:56:21  yeah but why have printenv at all, right
23:56:37  `env TERM
23:56:39  env: TERM: No such file or directory
23:56:45  `printenv TERM
23:56:47  linux
23:56:53  ok that's a difference
23:56:55  ah
23:57:01  aka $TERM :P
23:57:03  or getenv("TERM")
23:57:04  or [...]
23:57:25  so do we have an alias for sprunge?
23:57:42  `which fetch
23:57:44  No output.
23:57:45  you can't access sprunge
23:57:50  use paste
23:58:05  `which curl
23:58:07  ​/usr/bin/curl
23:58:10  I bet I can. :P
23:58:25  `help paste
23:58:26  Runs arbitrary code in GNU/Linux. Type "`", or "`run " for full shell commands. "`fetch " downloads files. Files saved to $PWD are persistent, and $PWD/bin is in $PATH. $PWD is a mercurial repository, "`revert " can be used to revert to a revision. See http://codu.org/projects/hackbot/fshg/
23:58:33  CakeProphet: try.
23:58:38  `run paste --help
23:58:40  http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/paste/paste.22312
23:58:45  lol
23:59:17  `url bin/paste
23:59:19  http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/bin/paste
23:59:48  ah okay.
23:59:49  good.

2011-11-19:

00:00:10  `run find . | paste
00:00:13  http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/paste/paste.19816
00:00:16  `run find / | paste
00:00:19  http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/paste/paste.11587 \ find: `/proc/tty/driver': Permission denied \ find: `/proc/1/task/1/fd': Permission denied \ find: `/proc/1/task/1/fdinfo': Permission denied \ find: `/proc/1/task/1/ns': Permission denied \ find: `/proc/1/fd': Permission denied \ find: `/proc/1/fdinfo': Permission denied \ find: `/proc/1/ns': Permission denied \ find: `/proc/2/task/2/fd':
00:00:34  good.
00:00:36  `run tree / | paste
00:00:40  bash: tree: command not found \ http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/paste/paste.10348
00:00:43  Aww
00:00:45  elliott: Still no go on SPARC :(
00:00:45  Aww.
00:00:46  elliott: shame
00:00:53  Gregor: Install tre
00:00:54  e
00:00:59  What the boink is tree?
00:01:01  `run apt-get install tree
00:01:03  W: Unable to read /etc/apt/apt.conf.d/ - DirectoryExists (2: No such file or directory) \ E: Could not open lock file /var/lib/dpkg/lock - open (2: No such file or directory) \ E: Unable to lock the administration directory (/var/lib/dpkg/), are you root?
00:01:04  :P
00:01:17  `run sudo -u GOD apt-get install tree
00:01:19  bash: sudo: command not found
00:01:24  CakeProphet: I figure for security sake, I'll just run random users' code as root.
00:01:33  GOOD CALL.
00:01:44  Gregor: http://en.wikipedia.org/wiki/Tree_(Unix)
00:01:47 -!- sebbu2 has joined.
00:01:47 -!- sebbu2 has quit (Changing host).
00:01:47 -!- sebbu2 has joined.
00:01:50  apt-get install tree plz
00:02:11   What the boink is tree?
00:02:45  Gregor: I gave you links.
00:02:47  Now shut up and install it :P
00:03:01 -!- sebbu has quit (Ping timeout: 244 seconds).
00:03:17  elliott: I don't want links. Explain it in four words or less.
00:03:38  Gregor: http://mama.indstate.edu/users/ice/tree/ has it in a thousand, in the form of one ASCII picture.
00:03:39  http://sprunge.us/fNgR
00:03:42  this is tree
00:03:51  As does CakeProphet :P
00:03:58  Gregor: It's a bit like ls, but it prints a directory tree.
00:04:22  SO FAR I SEE ONLY POLYWORD EXPLANATIONS
00:04:24  FOUR OR LESS
00:04:35  "this is tree" is totally three
00:04:37  4 if you count the URL
00:04:42  Gregor: "Directory tree"
00:04:55  Gregor: It draws a directory tree in ASCII/Unicode.
00:05:06  I don't think I can count the URL as one word :P
00:05:06  Gregor: ASCII/Unicode directory tree.
00:05:11  elliott: Perfect.
00:05:14  `run tree / | paste
00:05:46  http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/paste/paste.8739
00:06:01  good tree.
00:06:01  `run tree / >/dev/null
00:06:03  ...
00:06:10  It's probably erroring or something?
00:06:24  No output.
00:06:28  `run tree / | head
00:06:30  ​/ \ |-- bin \ |   |-- bash \ |   |-- bunzip2 \ |   |-- bzcat \ |   |-- bzcmp -> bzdiff \ |   |-- bzdiff \ |   |-- bzegrep -> bzgrep \ |   |-- bzexe \ |   |-- bzfgrep -> bzgrep
00:06:36  Maybe it's more than 10M :)
00:06:57  `run tree / | gzip -9 | paste
00:07:02  That ... won't work.
00:07:05  `run tree / | gzip -9c | paste
00:07:23  http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/paste/paste.17
00:07:30  http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/paste/paste.32133
00:08:04  2.3 MB
00:08:24  Donno why it didn't like it before *shrugs*
00:08:35  Can you install the TeX to PNG webpage I have into Hackiki?
00:08:59  Gregor: hey can you install df onto HackEgo?
00:09:13  CakeProphet: Probably, but I doubt that it would do anything useful.
00:09:15  `run tree | paste
00:09:17  http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/paste/paste.32268
00:09:30  `run tree / | paste
00:09:42  zzo38: Idonno if I like the notion of PNG webpages made from TeX ... there's at least one decent TeX->HTML convertor.
00:09:51  http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/paste/paste.32291
00:09:55  Gregor: 'Swhat Wikipedia does :P
00:09:58  But HackEgo doesn't need it...
00:10:06  elliott: how does it decide when to use ASCII and when do use Unicode?
00:10:07  elliott: *Hackiki
00:10:11  Oh
00:10:14  Gregor: P.S. I suspect you mean LaTeX :-)
00:10:17  elliott: Makes more sense for Hackiki
00:10:18  `tree --help
00:10:20  usage: tree [-adfghilnpqrstuvxACDFNS] [-H baseHREF] [-T title ] [-L level [-R]] \.[-P pattern] [-I pattern] [-o filename] [--version] [--help] [--inodes] \.[--device] [--noreport] [--nolinks] [--dirsfirst] [--charset charset] \..[--filelimit #] [] \   -a.     All files are listed. \   -d.     List directories only. \.-l.      Follow symbolic links like directories.
00:10:21  elliott: Oh, 'struth.
00:10:29  Gregor: Which I doubt zzo is happy with ;-)
00:10:32  `run tree --help | paste
00:10:34  usage: tree [-adfghilnpqrstuvxACDFNS] [-H baseHREF] [-T title ] [-L level [-R]] \.[-P pattern] [-I pattern] [-o filename] [--version] [--help] [--inodes] \.[--device] [--noreport] [--nolinks] [--dirsfirst] [--charset charset] \..[--filelimit #] [] \   -a.     All files are listed. \   -d.     List directories only. \.-l.      Follow symbolic links like directories.
00:10:36  Gregor: No, you can use that for making PNG images included inside of a HTML page.
00:10:38  `run tree --help 2>&1 | paste
00:10:42  http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/paste/paste.29936
00:10:46 -!- oerjan has quit (Quit: Memory leak again).
00:10:51  In general, not for the entire page.
00:10:51  `run tree -A | paste
00:10:53  http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/paste/paste.26352
00:10:57  lol
00:11:02  SPARC is driving me CRAZY.
00:11:04 * CakeProphet thinks we should convert esowiki to hackiki.
00:11:06  Adding a printf cannot make this work >_<
00:11:16  what could go wrong?
00:11:21  CakeProphet: I tried to drive that once, but 'twas a wasted effort.
00:11:26  It is a program I wrote; it has to be adjusted to work with Linux (I wrote it for Windows), and it works far better than the Wikipedia one. It also has more options.
00:12:36  Gregor: try again :P
00:12:38  You could also probably remove all the restrictions I have since those are managed by a separate program in Hackiki anyways.
00:13:09  Hac Kiki?
00:13:43  Hack Iki
00:14:50  shachaf: What HackBot (HackEgo) is to IRC bots, Hackiki is to wikis.
00:17:36 -!- copumpkin has changed nick to c0w.
00:17:42  > var "bad\nlambdabot\nbad"
00:17:43    bad
00:17:44   lambdabot
00:17:44   bad
00:17:44  I might be able to add the program myself, as long as Plain TeX, dvipng, and AMS fonts (the METAFONT ones) are installed.
00:19:06  zzo38: I'll check in a bit, in the middle of something else right now.
00:19:14  OK
00:19:47 * CakeProphet just got $30 for applying for a credit card
00:19:50  yeaaaaaah
00:19:55  free money
00:20:21  they're placing a bet that I'm fiscally irresponsible.
00:20:23  BOY ARE THEY WRONG.
00:20:26  Do you keep it even if you cancel a credit card immediately?
00:20:35 * CakeProphet goes on an Amazon shopping spree with his new $30 
00:20:38  Or if you don't use a credit card?
00:20:40  zzo38: probably
00:20:55  but it gives you like Amazon reward point things or some shit so I might actually use it.
00:21:03  without, you know, owing obscene amounts of interest.
00:21:05  Any SPARC experts? Anything weird about how it handles return addresses? Something to do with its register windows maybe?
00:21:08  spelled correctly.
00:22:30  Surely a setjmp would save the return address even if it's otherwise squirreled away in another register window? How could it not?
00:23:06  Gregor: turns out one of the 4 people who still know anything about SPARC are on this very channel.
00:23:41  CakeProphet: But whoooooooo
00:24:28  yiyus
00:24:39 -!- c0w has changed nick to copumpkin.
00:25:41  yiyus: HAAAAAAAAAALP :P
00:27:24 -!- oerjan has joined.
00:29:46  CakeProphet: wat
00:29:55  so you know what the death of John McCarthy means?
00:30:00  Elephant WILL NEVER BE A REAL THING.
00:30:05  unless it already is one and I missed it.
00:30:08  elliott arpdoit
00:30:18  I'm just trying to understand how a system could possibly exist on which setjmp+stack doesn't save the return address X-D
00:30:25  Elephant?
00:30:51  http://www-formal.stanford.edu/jmc/elephant/elephant.html
00:32:49  CakeProphet: elephant will always be remembered
00:33:14 * Phantom_Hoover → sleep
00:33:15 -!- Phantom_Hoover has quit (Quit: Leaving).
00:33:37  Good idea, PPH
00:33:39  Goodnight
00:33:40 -!- Ngevd has quit (Quit: Goodbye).
00:33:42  elephant is sort like an anti-feather, i think
00:33:58  opposite feather more like
00:34:21  ...in which we learn that CakeProphet doesn't know what anti- means.
00:34:43  dunno, to me anti- implied a sort of negation effect
00:34:55  phantom phantom hoover
00:35:15  as does opposite
00:36:32  nope, no way!
00:37:39 -!- oklopol has joined.
00:37:45  ollon.
00:38:45  nollo
00:39:01  SWEEET DELICIOUS PALLINDROMIC CORE MMMMM
00:40:55  ah finally the more weak-willed of the Birtons have saught respite in their slumberchambers.
00:41:41  and the Americans and Norsemen can converse in peace.
00:42:23  (note that Britons applies to all UKers here. because I said so.)
00:42:45  hi
00:42:49  Program I wrote in Haskell to read DVI file is running out of memory!!
00:42:56  rip program
00:43:33  Do you know how to make it to not run out of memory?
00:44:22  probably apply strictness somewhere.
00:46:30  Maybe it is not properly tail recursive? And how and where is it supposed to apply strictness somewhere?
00:47:11 * CakeProphet is actually a prophet, by the way.
00:47:25  so I like actually know how to debug your program without any source code.
00:47:51  zzo38: tail recursion can sometimes make things _worse_ in haskell
00:48:05  O, that is what you are the prophet of? I thought you were the Prophet Wizard of the Crayon Cake.
00:48:20  no, lies.
00:48:22  a facade.
00:48:28  oerjan: If you look will you know how to fix it?
00:48:41  a pale phantom of the dark frowziness that lies beneath.
00:49:32  Is it running out of ByteString memory?
00:49:36  the ineffable funk.
00:50:03  zzo38: what kind of memory is it running out of?
00:50:08  is a stack overflow reported?
00:50:16  or does it just gobble up computer memory until the whole system lags?
00:50:16  It just says out of memory.
00:50:21  elliott: I bet it's RAM.
00:50:23  :)
00:50:24  "out of memory"? that's it?
00:50:31  The system didn't lag.
00:50:33  hi
00:50:41  elliott: Yes, it just says "out of memory"
00:50:41  hello
00:50:41  zzo38: are you sure it doesn't say the heap is exhausted? :P
00:50:44  weird.
00:51:00  zzo38: are you loading a really big file?
00:51:12  I wonder if skyrim tracks number of hours you played so far somewhere. Probably don't want to check that though...
00:51:13  zzo38: you can try +RTS -HM
00:51:15  for some 
00:51:17  megabytes
00:51:19  to increase the default heap size
00:51:26  if you're trying to load a very big file
00:51:42  oh hmm
00:51:46  elliott, shouldn't the size of the heap grow as required?
00:51:48  looks like ghc automatically increases the heap
00:51:54  yeah
00:51:57  Vorpal: well that's not always the best decision... but anyway
00:52:01  it wouldn't make sense if it didn't
00:52:03  zzo38: how much RAM do you have? :P
00:52:04  The file DVI.lhs is 33 KB, and DVI.dvi (the output of TeX processing DVI.lhs) is 51 KB. But I tried loading a very short DVI file and it is still out of memory.
00:52:05  elliott, true.
00:52:10  zzo38: you might try http://haskell.org/ghc/docs/6.12.3/html/users_guide/prof-heap.html
00:52:17  elliott, now stacks tend to have a max size more often
00:52:18  zzo38: then your program is inefficient *shrugs*
00:52:24  I have 224 MB of RAM
00:52:36  what... really?
00:52:39  ..
00:52:40  how old is that computer?
00:52:45  I don't know.
00:52:49  ...
00:52:58  that belongs in a mueum!
00:53:00  museum*
00:53:03  lol
00:53:08 -!- derdon has quit (Remote host closed the connection).
00:53:29  wait, did I just do an unintentional Indiana Jones parody? Ouch I think I did...
00:53:35  Actually it says ": out of memory" is that different?
00:54:58  zzo38, just don't try to run windows on that system. Unless it is like 9x
00:55:11  heck, even windows xp would be a pain with that little ram
00:55:16  It is XP
00:55:16 -!- kmc has joined.
00:55:30  sounds painful on 224 MB RAM
00:55:48  zzo38, for laughs you should try windows vista or windows 7 on it
00:56:01  I don't need to change it
00:56:01  bbiab
00:56:16  If I ever change the operating system I will put Linux, not Windows.
00:56:25  zzo38, but iirc DX11 doesn't work under XP?
00:56:40  or maybe your graphics card can't do that anyway
00:56:44  I don't use DX11
00:56:53  or that
00:58:24  There is no great genius without some touch of madness.
01:00:19  Vorpal: people used xp with 256 megs of ram commonly, y'know
01:00:25  it came out in 2001
01:01:09  Vorpal: also i'm pretty sure most stuff works with directx 9 still
01:01:54  "Controversially, the original name for the DirectX project was the "Manhattan Project", a reference to the US nuclear weapons initiative. Alex St. John, creator of the original Microsoft DirectX specification, claims[21] that the connotation with the ultimate outcome of the Manhattan Project (the nuclear bombing of Japan) is intentional, and that DirectX and its sister project, the Xbox (which shares a similar logo), are meant to displace Japanese 
01:01:54  ame makers from their dominance of the industry.[22]"
01:02:01  wow it's like he's trying to be a gigantic asshole
01:02:47  ... wow.
01:02:54  That's ... wow.
01:03:52  Gregor: The next Microsoft graphics project: "Holocaust", featuring the 3D subsystem "We're Literally Going To Kill Eleven Million People... But This Time, It's PERSONAL"
01:04:38  Slogan: "Bill Gates Is Literally Hitler, Like, He's Growing The Moustache And Everything"
01:04:46  *Ballmer
01:04:51  Bill Ballmer
01:11:10   Vorpal: people used xp with 256 megs of ram commonly, y'know
01:11:11   it came out in 2001
01:11:12  hm yeah
01:11:16  xp is that old?
01:11:17  right
01:11:25  very long lived
01:11:39  i believe xp is the longest-lasting version of any maintained microsoft product :P
01:12:04  over 5 years
01:12:20  More if you consider the length of official support.
01:12:21  it is about 10 years now
01:12:26  Genius is an infinite capacity for taking pains. -- Jane Hopkins
01:12:30  yeah
01:12:51  Support ends in 2014.
01:12:57  heh
01:13:04  *Sale* ended in 2009.
01:15:27  darn i'm not a genius anyway?
01:18:55  pikhq, so 8 years of sale and 13 years of support?
01:18:59  as currently planned
01:20:02  erm, that's like the worst definition of genius i've ever heard
01:20:23  who the fuck is this dude
01:20:41  i'm sure "jane hopkins" is male :P
01:20:54  Unix is very simple, but it takes a genius to understand the simplicity. -- Dennis Ritch
01:20:54  jane can be either
01:20:58  dude as well
01:22:59  eh, i just googled and there is no jane hopkins
01:23:21  oh sorry found her http://jane-hopkins.com/
01:23:56  okay i think i need to give geniusness a rethinkover.
01:24:04  because that's some deep shit
01:24:28  oerjan i feel bad about using Int all the time am i a bad person
01:24:59  elliott, obviously you should use Int# yes
01:25:16  use Integer#, that's the best type
01:25:34  the rest is just a bit of gödel numbering
01:25:40  err
01:25:42  :t Integer#
01:25:43  Not in scope: data constructor `Integer#'
01:25:45  :t Int#
01:25:46  Not in scope: data constructor `Int#'
01:25:48  that isn't a constructor
01:25:53  derp
01:25:57  :i Int#
01:26:01  ah, no
01:26:05  :k Int#
01:26:06  Not in scope: type constructor or class `Int#'
01:26:07  @src Int#
01:26:07  Source not found.
01:26:10  lol
01:26:11  @src Int
01:26:11  data Int = I# Int#
01:26:15  ...
01:26:16  well obviously Int# has no source
01:26:19  because it's primitive
01:26:20  well yes
01:26:29  elliott, but I assumed you would have a type for it
01:26:44  types don't have types
01:27:08  hm true
01:27:13  LOGICAL DEAD END OH SNAPA
01:27:22  what kind of type could a type have
01:27:26 * oerjan runs away
01:27:27  Prelude> :i Int
01:27:27  data Int = GHC.Types.I# GHC.Prim.Int# -- Defined in GHC.Types
01:27:29  typetype
01:27:29  well that anyway
01:27:52  > Int + Char
01:27:53    Not in scope: data constructor `Int'Not in scope: data constructor `Char'
01:27:54  oerjan, as far as I can tell there isn't an Integer#
01:27:57  WHAT PROPOSTEROUS'
01:28:03  data Integer
01:28:03    = integer-gmp:GHC.Integer.Type.S# GHC.Prim.Int#
01:28:03    | integer-gmp:GHC.Integer.Type.J# GHC.Prim.Int# GHC.Prim.ByteArray#
01:28:03    -- Defined in integer-gmp:GHC.Integer.Type
01:28:04  lots of whooshing here tonight
01:28:27  that is an interesting type
01:28:53  S# is for small integers
01:29:04  oerjan, ah right, but that is still GMP it seems?
01:29:13  why use gmp for small integers
01:29:18  no.
01:29:23  Integer is just d efined in integer-gmp.
01:29:24  obviously
01:29:26  ah
01:29:34  you see the prefix because you don't have that package exposed
01:30:09  elliott, that still leaves the original question unanswered....
01:30:14  which question
01:30:17  Vorpal: S# is the name of the constructor
01:30:22  not a different type
01:30:27  >_>?
01:30:47  elliott, why would small integers be done with GMP or why would non GMP stuff be done in integer-gmp!?
01:30:56   no.
01:30:56   Integer is just d efined in integer-gmp.
01:30:56   obviously
01:31:03  you have presented no evidence that small integers are done with gmp
01:31:13  Vorpal: S# is the constructor for small Integers, within the normal range of ints
01:31:14  Vorpal: here's a hint: how do you define Integer outside of integer-gmp
01:31:17  elliott, indeed, except for the name of the package :P
01:31:23  J# is the one that is bignumish
01:31:33  Vorpal: hint: you can't, because you need a bignum type
01:31:34  elliott, I'm not claiming it isn't done. Just that the naming is bad then
01:31:35  hm
01:31:43  Vorpal: integer-gmp = implementation of Integer with GMP
01:31:48  Vorpal: integer-simple = implementation of Integer with no dependencies
01:31:52  elliott, fair enough. I would have assumed that a "small" one was machine word?
01:31:54  it's only badly-named if you're a literal idiot
01:31:59  Vorpal:    = integer-gmp:GHC.Integer.Type.S# GHC.Prim.Int#
01:32:01  what do you think Int# is?
01:32:08  it obviously has to be boxed in that constructor
01:32:14  oh right, I'm just too sleepy for this
01:32:26  night →
01:33:56  metaphorical idiots think the name is just right
01:36:56 -!- Vorpal has quit (Ping timeout: 258 seconds).
01:40:51  SPAAAAAAAAAAAAAAAAAAAAAARC
02:07:59 -!- MSleep has quit (Quit: later chat).
02:18:11  yes
02:18:13  mission successful
02:18:17  tea, sammich, and cigars.
02:18:20  the simple pleasures of life.
02:20:15 -!- augur has quit (Ping timeout: 258 seconds).
02:20:39  Gregor: don't you have like
02:20:44  documentation of SPARC?
02:21:06  CakeProphet: Yes, but it's doing little to explain things such as why setjmp didn't seem to put the return address anywhere.
02:22:06  Gregor: ah so you're compiling to C or?
02:22:18  setjmp is a thing in SPARC as well.
02:22:50  No, my code is C ... of course setjmp is a thing in SPARC, it should save all sorts of process state including but not limited to registers.
02:23:58  well cursory googling suggests that SPARC does indeed have a stack and it does indeed work like x86 (it grows down)
02:24:03  ...
02:25:47  Gregor: CakeProphet's helpful, isn't he.
02:26:35  elliott: Quite.
02:26:49 * CakeProphet is the definition of helpful.
02:26:52  or well
02:26:56  what's the word for helpful
02:26:59  but not really being helpful
02:27:00  CakeProphet.
02:27:01  like "eager to help"
02:28:02  hmmm, yes
02:28:13  then the antonym, meaning, "helpful but not eager to help"
02:28:16  would be elliott.
02:28:46  IF WE BECAME ONE PERSON.
02:28:48  THINK OF ALL THE HELP
02:28:50  THAT WOULD HAPPEN.
02:29:18  also think of the great manliness.
02:30:19  ...
02:30:20  X-D
02:31:34  holy crap its cold outside.
02:31:52  43 degrees.
02:32:05  this is cold for my climate.
02:32:08  -43?
02:32:11  no
02:32:22  `sanetemp 43
02:32:24  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: sanetemp: not found
02:32:36  !sanetemp 43
02:32:38  6.1
02:33:07  it was literally like 70-something yesterday
02:33:22  LITERALLY LIKE THIS APPROXIMATE FIGURE.
02:33:25  ah.  i saw in a newspaper the other that that and rain is essentially the average norwegian national weather
02:33:32  *the other... month
02:34:31  one nice thing about Fahrenheit is that it goes by intervals of 10 in intuitive understanding
02:34:40  each degree of 10 is like another level of coldness/hotness
02:34:46  or at least
02:35:12  that is how people intuitively delineate levels of coldness/hotness in the context of weather.
02:35:26  because it's intuitive.
02:36:17  as opposed to celsius which goes by intervals of 5, obviously
02:36:27  ah okay
02:39:05  CakeProphet: that's the stupidest thing i've ever heard
02:39:19  perception of temperature isn't discrete, if it went up by 20s or 5s that'd be just as good
02:39:33  you only think it's a good factor to scale by because you're used to thinking in terms of fahrenheit in the first place...
02:39:44  I didn't mean to imply "THIS IS THE AWESOMEST THING AND THERE IS NO OTHER WAY THAT WORKS"
02:39:48  and yes, I know.
02:40:15  There is also Kelvin temperatures. Are there Planck temperatures?
02:40:23  yes
02:40:48  you would have to divide by Planck temperature.
02:41:20  i fear they don't go up by 10, though
02:41:25  SHIT
02:41:37  worst temperature metric.
02:43:39  http://en.wikipedia.org/wiki/Planck_temperature
02:43:52  0°C = 1.928 × 10^-30 Tp
02:43:53  practical
02:47:47  so I'm guessing Planck temperature was the temperature at the beginning of the universe?
02:47:55  should be simple to empirically verify.
02:48:27  elliott: "The error is just what it says."? That's, like, a whole new perspective on GHC error messages, man!
02:48:37  shachaf: It's as factually accurate as it is unhelpful.
02:48:43  CakeProphet: that's a bit overstating it, i think
02:48:53  elliott: Has anyone ever realized that before?
02:49:04  shachaf: No. This is why only I can debug Haskell programs.
02:49:05  there may have been a time during the big bang when that was the temperature
02:49:22  I made a movie once, I have the DVD of it. The label says "Candid Camera" even though the movie has nothing to do with Candid Camera. The label also says "*UOP-FREE*" and has the DVD Video logo on it.
02:49:48  shachaf: I have realized that. :P
02:49:55  elliott: I knew it!
02:49:58  But your secret is out now.
02:50:13   It would probably be best to tell us what you're actually trying to do.
02:50:21  You should file for a patent or something.
02:50:40  shachaf: Hey, I only use the X-Y problem when talking to people who are being really confusing!
02:51:01  > x - y
02:51:02    x - y
02:51:13  In one scene one of the actors is saying that some text should be placed on the screen at that time. He said something like "On the screen you should write those words, OK?" and the text was literally placed "Those words, OK" on the screen
02:52:12  elliott: I oftentimes encounter people trying to solve the XY problem on my questionsin IRC channels
02:52:19  After a test of the camera equipment, the first scene is about how to eat lego.
02:52:34  little do they know, they're usually wrong, and continue to be obnoxious when I continue asking my actual question.
02:52:53 -!- copumpkin has changed nick to NotASpy.
02:53:03  Scene 2 comes after scene 3. There is no scene numbered 1.
02:53:06 -!- NotASpy has changed nick to DefinitelyNotASp.
02:53:31  DefinitelyNotASp: your foolish disguise fools no one but yourself!
02:53:37 -!- DefinitelyNotASp has changed nick to TotallyNotASpy.
02:54:00  `welcome TotallyNotASpy
02:54:03  TotallyNotASpy: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
02:56:43 -!- TotallyNotASpy has changed nick to copumpkin.
02:59:04  @hoogle unsafeCoerce
02:59:05  Unsafe.Coerce unsafeCoerce :: a -> b
02:59:30  @hoogle Any
02:59:31  Prelude any :: (a -> Bool) -> [a] -> Bool
02:59:31  Data.List any :: (a -> Bool) -> [a] -> Bool
02:59:31  Data.Monoid Any :: Bool -> Any
02:59:37  gah
02:59:52  @hoogle -Prelude Any
02:59:52  Unknown flag: -P
02:59:52   
02:59:59  arg
03:00:00  h
03:00:12  @hoogle GHC.Exts Any
03:00:14  Did you mean: :: Exts Any +GHC
03:00:14  No results found
03:00:16  a typeof operator would be fun, on top of the ::-as-operator thing previously discussed.
03:00:19  @hoogle +GHC Any
03:00:20  package anydbm
03:00:20  package Ganymede
03:00:20  package hp2any-core
03:00:34  asTypeOf a b = unsafeCoerce a :: typeof b
03:00:47 -!- augur has joined.
03:01:10  CakeProphet: Yes, typeof operator, I would like to have too; even GNU C has typeof operator too.
03:01:20  !haskell (Unsafe.Coerce.unsafeCoerce (Debug.Trace.trace "hm..." 1) :: GHC.Exts.Any) `seq` "and hm"
03:01:25  ​"and hm"
03:01:43  heh
03:01:55  !haskell (Unsafe.Coerce.unsafeCoerce (Debug.Trace.trace "hm..." (++)) :: GHC.Exts.Any) `seq` "and hm"
03:01:58  ​"and hm"
03:02:11  !haskell (Unsafe.Coerce.unsafeCoerce (Debug.Trace.trace "hm..." (++)) :: Int) `seq` "and hm"
03:02:13  ​"and hm"
03:02:22  EgoBot: wait, what
03:02:24  oh
03:02:38  !haskell (Unsafe.Coerce.unsafeCoerce (Debug.Trace.trace "hm..." (++)) :: [Int] -> [Int] -> [Int]) `seq` "and hm"
03:02:41  ​"and hm"
03:02:58  oh maybe there's something wrong with the tracing
03:03:13  !haskell Debug.Trace.trace "hm..." "and hm"
03:03:15  ​"and hm"
03:03:20  gah
03:03:24  `runghc 2+2
03:03:30  target `2+2' is not a module name or a source file
03:03:34  X-D
03:03:39  `run ghc -e 'Debug.Trace.trace "hm..." "and hm"'
03:03:44  hm... \ "and hm"
03:04:13  oerjan: enjoy
03:04:33  !haskell (Unsafe.Coerce.unsafeCoerce (System.IO.Unsafe.unsafePerformIO (putStr "hm..." >> return 1)) :: GHC.Exts.Any) `seq` "and hm"
03:04:35  hm..."and hm"
03:05:05  sorry, found another way :P
03:05:13  !haskell (Unsafe.Coerce.unsafeCoerce (System.IO.Unsafe.unsafePerformIO (putStr "hm..." >> return (++))) :: GHC.Exts.Any) `seq` "and hm"
03:05:16  hm..."and hm"
03:05:27  !haskell (Unsafe.Coerce.unsafeCoerce (System.IO.Unsafe.unsafePerformIO (putStr "hm..." >> return (++))) :: Int) `seq` "and hm"
03:05:29  hm..."and hm"
03:05:56  !haskell (Unsafe.Coerce.unsafeCoerce (System.IO.Unsafe.unsafePerformIO (putStr "hm..." >> return 1)) :: Int -> Int)) `seq` "and hm"
03:06:00  pikhq: you there?
03:06:06  oops
03:06:13  Ish
03:06:18  !haskell (Unsafe.Coerce.unsafeCoerce (System.IO.Unsafe.unsafePerformIO (putStr "hm..." >> return 1)) :: Int -> Int) `seq` "and hm"
03:06:21  hm..."and hm"
03:06:30  shachaf: What's a ring?
03:06:33  pikhq: there was a 25% decrease in fuel efficiency.
03:06:36  You can troll me, I won't mind.
03:06:37  almost exactly.
03:06:44  CakeProphet: Bravisimo
03:06:54  yes, I'm on the path to being a true American.
03:06:58  elliott: Um... http://en.wikipedia.org/wiki/Ring_(mathematics)?
03:06:59 * oerjan concludes that unsafeCoerce has no effect on strictness
03:07:05  shachaf: Thx for troll
03:07:09  `addquote * oerjan concludes that unsafeCoerce has no effect on strictness
03:07:11  723) * oerjan concludes that unsafeCoerce has no effect on strictness
03:07:25  admin + elliott
03:07:32  ?
03:07:52  "admin + elliott" is a scary thought, to me.
03:08:42  Someone completed an ultra ending for ADOM with 1 XP. Other challenges are: * Never kill anyone other than uniques; you are not allowed to have any companions either. * No use of food. * Kill as many different kind of creatures as possible (some uniques are mutually exclusive however). * Never carry more than 100s of inventory (including equipment).
03:08:58  elliott: From what I'm getting from that Wikipedia article, it's the algebraic structure with "+" and "*" operators, with closure, associativity, existence of identity, existence of inverse, and commutativity for addition, and closure, associativity, and existence of identity for multiplication.
03:09:07  pikhq: THANXE BRO
03:09:12  Also, distributitive with addition & multiplication.
03:09:20  Obvious examples of a ring include the set of naturals.
03:09:26  pikhq: I made such a program in Haskell it is called monoidplus
03:09:26  Erm.
03:09:27  Reals.
03:09:29  Erm.
03:09:32  *Integers*.
03:09:40  Jeeze pikhq, say what you mean.
03:10:22  other examples of rings include the set of my awesome Persian wallpaper
03:10:26  er, wait that's a group.
03:10:26  elliott: pikhq did far better than I could have.
03:10:45 * shachaf isn't a troll, anyway.
03:10:49  elliott: i was wondering whether that insistence that you shouldn't coerce between data types and functions had any effect on seq
03:11:21  oerjan: Ah.
03:11:55  * No spells/chat. * Not allowed to use downstairs command (meaning only places you can enter are wilderness encounters); reach level 50. * Enter ToEF at experience level 1, get orb of fire, leave; do not enter any other locations. * Enter small cave; never go up/down stairs; stay until experience level 50. * Edit executable file to force going through small cave, uninteresting dungeon, and main dungeon, in that order.
03:12:50  elliott: since that's just about the only operation you can do which doesn't require things to be of a known type
03:13:59  shachaf is clearly an orc
03:14:15  oerjan is a magic elf.
03:14:20 * oerjan is slowly approaching the end of his yafgc binge
03:14:33  with many interruptions
03:15:39  I like how caffeine is considered a food and not a drug by the FDA.
03:15:55  a non-magic elf would be such a sad creature
03:17:08  all elves are pathetic creatures.
03:17:14  I slay them on sight.
03:17:23  Hmm, I'm not sure what @'s low-level network IO model looks like.
03:17:25  pikhq: Make one up for me.
03:17:29  ah, so CakeProphet is a goblin, check
03:19:53  oerjan: Um excuse me dorfs are the ones who hate elves a lot.
03:20:11  elliott: ok those too, then
03:28:31  elliott: *Clearly* you should just send neutrinos in the correct direction.
03:28:37  pikhq: NOT HELPFUL :P
03:29:56  pikhq: The problem is twofold: I don't know what connection setup should look like, and I don't know what communication should look like :(
03:34:28  elliott: Hmm. Well, *communication* should be nothing more than passing serialised @ objects back and forth, perhaps transparently compressed.
03:34:33  pikhq: I said low-level.
03:34:42  Devise a serialisation scheme.
03:34:44  Unless you think that'll work to talk to IRC or HTTP servers.
03:34:49  Hint: It won't.
03:35:09  Oh, so a *non-native* network IO model.
03:35:21  *Bleh*.
03:35:49  This is annoying, because normal networking is all about sending bytestreams, and @ is all about not-bytestreams.
03:37:50  I'm *tempted* to just go with a kinda stupid send/receive bytestream model.
03:38:05  yes, that would be easy if I had imperative sequencing, which I don't
03:38:46  everything so far is based on FRP, i can't decide whether to go with FRP (awkward since it doesn't really fit the usecase but fits in better with the other stuff), something iteratee-esque (dunno what the model would look like without sequencing?) or something else entirely
03:39:18  *Really* stupidly moronic [Byte]->[Byte] function? :P
03:39:31  enumeratorities
03:39:47  pikhq: that's impure
03:39:59  and doesn't allow any sort of out-of-bound control (how do you close the connection?)
03:40:25  also it's awfully unperformant and prone to errors but those are even more obvious than the other things i said
03:40:39  I did say "stupidly moronic" for a reason.
03:41:19  not moronic enough for my standards; i don't accept mediocrity in my moronicity
03:42:06  Fine, y'know what? Your low-level network IO model shall involve directly creating TCP packets.
03:42:17  Why not go more low-level than is usual? :P
03:42:20  that still doesn't help for a model of how to send them :P
03:42:28  and receive them
03:44:23 -!- DCliche_ has joined.
03:46:40  your low-level network IO model shall involve neutrinos.  _that_ should be low level enough.
03:46:58   elliott: *Clearly* you should just send neutrinos in the correct direction.
03:47:15  see?  pikhq agrees.
03:48:00 -!- DCliche has quit (Ping timeout: 240 seconds).
03:48:03 -!- kmc has quit (Quit: Leaving).
03:53:24  elliott: perhaps  you just need to make some concessions in your pureness?
03:53:34  or: monads!!
03:53:36  yeaaaaah
03:54:20  and then just serialize shit and send/receive/check-connection-stuff via an IO monad or 
03:55:31  oerjan: Please kick CakeProphet.
03:55:49  what?
03:56:06  I'm guessing you've got something better?
03:56:08 * oerjan gives CakeProphet a warning swat first -----###
04:01:02  elliott: as far as serialization format, what if you arranged objects so that their memory layout and serialized format are equivalent, except for references which would then need to be adjusted from the local RAM address space to a smaller relative-to-some-starting-point-in-stream-datagram-or-whatever address space.
04:01:18  oerjan: kick CakeProphet for not having any idea how @ works and also he's stupid
04:02:19  elliott: alternatively, you could point me (and the other people you are discussing this problem with) to a source of information on @ that can clarify my ignorance.
04:02:32  oerjan: he am go too far.....
04:03:39  but anyway, basically as long as the receiving end knows the type of the data then it can reconstruct the transmission
04:03:57  and readjusting references isn't terribly inefficient, you have to traverse references to serialize anyway.
04:05:04  elliott: or are @ objects not implemented as blocks of memory and pointers? enlighten me.
04:05:23  CakeProphet: I'll answer your questions iff oerjan kicks you.
04:07:05  but basically you a) no longer have to serialize anything (aside from some minor pre/postprocessing) because your memory layout is your serialization format  b) enforce type safety by requiring receiving programs to know the type of the data they're receiving.
04:07:19  oerjan: Seriously, kick him so I can put him out of his mysery.
04:10:46  elliott: if it makes you feel better I can join -minecraft
04:10:55  you'll have to invite me first though.
04:11:05  Done.
04:11:30  NOOOOOO HOW COULD YOU DO THIS
04:11:36  I LOVE MINECRAFT NOW I CAN'T TALK ABOUT IT EVER
04:11:38 * CakeProphet cries.
04:11:54   elliott: as far as serialization format, what if you arranged objects so that their memory layout and serialized format are equivalent, except for references which would then need to be adjusted from the local RAM address space to a smaller relative-to-some-starting-point-in-stream-datagram-or-whatever address space.
04:12:03 -!- myndzi has quit (Ping timeout: 240 seconds).
04:12:10  CakeProphet: Misconception: Logical memory addresses must map to physical RAM locations.
04:12:31  (For example, the Linux kernel does not actually require you to have so many terabytes of RAM that you can load it at addresses starting with a 1.)
04:13:08  elliott: Exabytes
04:13:18  Exabytes are terabytes :)
04:13:28  hmmm, well, the only requirement is that you can access those logical memory addresses so that you can get the data they refer to and then re-adjust addresses to a relative address space for the object stream.
04:13:41  they don't need to be physical RAM bytes. >_>
04:13:48  just bytes of some kind presumably.
04:14:00  You're missing the point. Anyway, this doesn't even remotely solve my stated problem.
04:14:40  oh, well no it doesn't solve how you intend to communicate via network. but I recall you mentioning that you need a way to serialize objects, yes?
04:14:54  I mean, I assume you'll need to do that at some point anyway if you want @ to be distributed in any way.
04:15:10  and run on standard networking protocols.
04:16:04  "but I recall you mentioning that you need a way to serialize objects, yes?"
04:16:05  No.
04:16:13   and run on standard networking protocols.
04:16:26  Standard networking protocols are completely irrelevant here and are not helped by your proposed solution at all.
04:16:32  Freenode doesn't talk in a serialised @ format./
04:16:46  ...Freenode? maybe I missed something here.
04:17:04  IRC isn't a standard networking protocol?
04:17:06  Cool.
04:17:38  well obviously inter-@ communication would work differently than non-inter-@ communication.
04:17:50  because other things only speak in bytestreams.
04:18:20   and run on standard networking protocols.
04:18:26  you were suggesting this solved standard protocols
04:18:27  standard i.e.
04:18:28  not @
04:18:35  my suggestion was merely a method of serialization for some kind of distributed @. not "here's the solution to your networking IO layer"
04:19:11  Okay. I don't see the relevance.
04:19:55 -!- GreaseMonkey has quit (Quit: The Other Game).
04:20:08  ah okay, I was following up what was pikhq was saying previously. he said "devise a serialization scheme"  and I went with that.
04:20:29  Yeah, then I corrected him.
04:20:37  I would need to know more about @lang to know anything about what would make sense for basic send/receive bytestream stuff, which... I'm pretty sure you'll want.
04:21:18  at some level
04:21:19  >_>
04:21:40  see? that's helpful.
04:21:41  :P
04:21:50  Well, the IO model is basically FRPish. So you would e.g. take the mouse input as a coordinate pair in as a Behavior Point or whatever, and then you could return a widget containing a Behavior Doc showing, e.g., the rendering of this pair as (42,-97) or similar.
04:22:11  what makes this awkward for a network?
04:22:12  And you could have a button beside it which gives you an Event () firing when the button clicks, and wire that up to change the text of the position widget.
04:22:40  CakeProphet: Because FRP is awkward for basically completely synchronous, and things where there aren't a large number of interdependent variables?
04:22:45  s/synchronous/synchronous things/
04:23:24  Something like iteratees would be nicer but it's not clear how to /integrate/ that with the FRP stuff to make it work together, and it's not clear what iteratees would even look like without an underlying monadic structure.
04:23:33  And it still doesn't solve the issue of how you actually set up/terminate/etc. connections.
04:24:22  would a monad not make sense for that?
04:24:37 -!- SgeoN1 has quit (Read error: Connection reset by peer).
04:24:50 -!- SgeoN1 has joined.
04:25:18  Plenty of things are "a monad"; presumably you mean something like the IO monad, which models imperative programs.
04:25:30  yes. but not as monolithic as the IO monad
04:25:33  just one for networking
04:26:02  what about a kind of coroutine thing?
04:26:10  well no
04:26:15  To convince me of that, you would have to (a) demonstrate how it can be integrated with the FRP stuff (hint: this is incredibly non-trivial), (b) tell me how you think a "non-monolithic" "networking monad" could be done and how to cause the run-time system to execute it, how it fits in with other things blah blah blah which won't work because you can interleave networking and other IO, (c) basically no.
04:26:22  that doesn't solve the set up/terminate/etc.
04:26:36  There can be many kind of monad, as long as they follow the monad laws. IO monad is I/O actions. Maybe monad is a value or Nothing.
04:27:09 * CakeProphet scribbles down notes.
04:27:12  thanks zzo38.
04:27:28  I read somewhere, something about "successor monad", I think it is like Maybe monad.
04:27:36  elliott: well, are you sure FRP would be awkward?
04:28:04  FRP's awkwardness for low-level bytestring networking is well agreed-upon. Which is why nobody does it.
04:28:07  I mean clearly the set up / terminate / etc stuffs are just different kinds of responses to an event.
04:28:38  Uh, no.
04:32:35  okay...
04:32:41  well: good luck!
04:33:49  They ought to release the source-codes of ADOM, at least when they are dead if not right now, so that many people can correct the bugs in the software!
04:34:21  elliott: but it totally is just responses to events. there are just different kinds of connections.
04:34:30 -!- SgeoN1 has quit (Quit: Bye).
04:34:42  elliott: also the responses can be a sequence of responses.
04:35:57  if the syntax proves to be awkward perhaps some sort of syntax sugar would help? I don't really know much about FRP.
04:37:15  that much is clear
04:38:04  maybe you actually want a lower-level IO monad similar to Haskell, to do low-level stuff
04:38:13  and then FRP for your UI?
04:39:39  no, i don't. not above the @ll layer.
04:40:21  well, okay, what if the high-level protocols are done with FRP, implemented in a low-level monad layer?
04:40:37  that is magical.
04:40:37  >_>
04:42:02  or just a low-level FRP interface.
04:42:13  that is somewhat awkward. :P
04:43:49 * CakeProphet quietly reads about FRP in the background.
04:51:31  just make FRP not awkward and everything will be fine.
04:51:39  FRP isn't awkward.
04:53:10  *not awkward for simple things like network IO
04:53:47  It isn't about the simplicity.
04:55:35  okay.
05:01:35 -!- SgeoN1 has joined.
05:01:52  elliott sudo apt-get update
05:03:54  Zzz time
05:03:57 -!- SgeoN1 has quit (Client Quit).
05:08:16  thanks
05:08:28 -!- MSleep has joined.
05:08:38  hi monqy
05:08:41  hi
05:08:50 -!- MSleep has changed nick to MDude.
05:08:54  hi
05:09:34 -!- oerjan has quit (Quit: Goof night).
05:09:41  hi
05:10:10  monqy: what awesome thing are you doing?
05:10:23  what are some awesome things you aren't doing right now but are long-term awesome things.
05:11:00  i am doing: eating garlic bread things
05:11:15  i am not doing: having any good ideas on how to make a programming language to solve all of my problems
05:11:38 * quintopia goes and sits with monqy
05:11:48  you are an okay
05:11:52  monqy: maybe you could learn about all the languages.
05:11:55  that's my plan.
05:12:01  even the bad ones???
05:12:03  a) learn all the languages b) make new language
05:12:05  yes. even those.
05:12:06  can i have a garlic?
05:12:08  sure
05:12:37   i am doing: eating garlic bread things
05:12:41  monqy is a lucky person..........
05:13:34  it's to ease the pain of not knowing the taste of digestive biscuite
05:13:58  monqy: for example: perl
05:14:00  perl is good.
05:14:05  perl has good ideas and bad ideas.
05:14:05  =/
05:14:06  monqy: eat digeststive bsicuti
05:14:13  digestive biscotti
05:14:23  yes
05:14:24  biscotti is good now i want biscotti and milk
05:14:35  digestive biscotti and garlic milk
05:14:38  mm
05:14:55  I have never had garlic milk
05:15:20  cakeprophet i have a big perl book and at one point in time i could even do things in perl but i forgot everything
05:15:37  at this point in time i liked perl for being hilariously bad
05:15:44  now I just trust that it is
05:15:46  ;_;
05:17:16  monqy: what if your closed-mindedness is limiting your intake of programming language wisdom? you could just siphon the good things as you learn many not-perfect languages.
05:18:08  going through not-so-good languages is tiresome but if you have a really nice inspiring elegant language i want to see it
05:18:24  especially big not-so-good languages
05:18:55  perl
05:18:57  and just taking in a lot of good things won't really help me with language design unless they are good things that work well with other good things I want
05:19:00  perl is huge and ugly
05:19:17  I'll read functional pearl sometime and hopefully that will impart enough of the good ideas
05:19:27  er
05:19:29  functional perl
05:19:30  oopse
05:19:38  perl itself isn't very big, I don't think.
05:19:44  huuuuge
05:19:47  maybe with all the other shit that is written in perl attached.
05:19:56  it's big for me, monqy
05:20:31  monqy: do you know C#?
05:20:42  no is it good
05:20:46  no
05:20:54  does it have any good ideas
05:21:00  yes.
05:21:04  what are the good ideas
05:21:10  monqy: do you mean higher-order perl
05:21:16  elliott: yes that
05:21:21  im bad at rememebering names
05:21:29  I thought it was functional perl as well.
05:21:30  it's in my reading pile
05:21:35  along with everything else
05:21:57  monqy: hm... good ideas.
05:22:05  well they're all only good in the context of Java-style OO
05:22:10  oh
05:22:12  ...yeah
05:22:13  well that won't help me then
05:22:54  the handling of pass by reference vs. pass by value is good.
05:23:04  but, again, this is in the context of an imperative language.
05:23:45  yeah monqy language will not be imperative
05:24:14  monqy: io is interesting.
05:24:20  more imperative oo stuff though
05:24:30  io is shit
05:24:52  i want to learn a dependently typed language sometime I think it would be a good thing to know
05:25:17  I also want to learn a some good category theory
05:25:19  what impressed me in particular was how it handled call-by-need in a highly dynamic language.
05:25:30  oh?
05:25:54  monqy: (it just passes ASTs directly)
05:25:55  yes oh
05:26:00  (and the default function interface just evaluates them)
05:26:02  (it's really slow)
05:26:04  (and ugly)
05:26:18  elliott: but makes total sense in a dynamic language. :P
05:37:29  Use sleight of hand to deal yourself the 2,3,4,5,7 (not all of the same suit), and your opponent the 2,3,4,5,8 (again, not all of the same suit). Ask your opponent whether they want to bet on whether they have a better or worse poker hand than you. If they are correct, they don't have to pay. If they are wrong, they have to pay double. They can choose not to bet at all, paying the normal price.
05:38:17  (Tell them the rules before you deal the cards, but they do not have to choose to bet until after they can see their cards.)
05:39:04 -!- MDude has changed nick to MSleep.
05:42:46  What is your opinion of this game?
06:08:20 -!- hagb4rd has joined.
06:18:51 -!- elliott has quit (Remote host closed the connection).
06:30:11  i know an old magic trick that looks like that, except it used different cards, and they could be dealt randomly, as long as you made sure the opponent got the 9
06:30:30  anyway that game sounds evil.
06:33:39  What was the magic trick?
06:36:09  you get together the 9-K of H and the 10-A of S. enough cards for two hands. as long as the spec got the nine, they lost.
06:36:24  even if they got the A
06:38:06  What were the rules? Is it poker hands?
06:39:45  I remember, at Boston Pizza, someone did a card trick, dealt the cards in some way, four cards to each player, two on the table face-up, and asked me to select the one that would give me the better poker hand. He took the other and won. But when the cards were revealed, I can see he would have won regardless of which card I selected. (Nothing was bet on this game, however.)
06:44:21 -!- elliott has joined.
06:51:22 -!- DCliche_ has quit (Quit: You are now graced with my absence.).
06:54:40  yeah poker hands
06:55:17 -!- nys has quit (Quit: 2:54 AM).
07:12:55 -!- elliott has quit (Quit: Leaving).
07:20:16  monqy: Ruby is not incredibly bad.
07:20:51  ruby is bad. is there anything worth knowing about it?
07:21:21  surely it's a step-up from your average OO lang
07:21:42  it even supports functional style to some degree.
07:23:18  also as far as OO goes the use of mixins and partial classes allows more code re-use than silly C++/Java inheritance
07:24:12  sounds boring
07:24:56  it certainly combines object-oriented and higher-order functions nicely.
07:25:42  but I'm starting to dislike dynamic typing more and more for anything other than simple scripts.
07:26:34  I think static typing is The Way Of The Future.
07:26:38  well...
07:26:47  I would be interested to see if a hybrid is feasible.
07:27:12  good thing i dislike object oriented
07:27:32  and i dislike the absence of static typing
07:27:32  objected oriented itself isn't bad.
07:27:39  it's just that most incarnations of it are very bad
07:28:55  I think instead of inheritance it makes more sense to have a sort of prototype OO with combinators.
07:29:29  the difficult part is making it efficient and statically typed.
07:33:57  I guess to make it efficient at runtime you'd want to compute some of the object combinators at compile-time.
07:39:00  monqy: I've occasionally considered the idea of "static duck typing" though I don't really know if type inference is possible.
07:40:16  actually I guess typeclasses do that better...
07:40:51  ah it can be generalized...
07:41:15  you're silly
07:42:01  how would static duck typing even work and what good would it do
07:42:04  duck typing is just awful
07:42:36  where you can make functions polymorphic on arbitrary objects as long as they implement some set of methods. but if you provide constraint-level operators you can do basically set operations on these sets of methods. not sure what that would achieve though.
07:42:46  also: not as awesome as multi-parameter typeclasses
07:44:50  I suppose the main difference between Haskell's typeclasses and an OO system would be that there are no instance declarations
07:45:13  you just define the methods and if they match then they're in that particular "typeclass"
07:46:00  so defining a method with a particular name and a particular type could potentially match multiple typeclass equivalents.
07:47:09  but still it lacks the sort of type relations that multi-param typeclasses allow.
07:50:56  hmmm it would be nice if you could do things like create isomorphisms between those typesets
07:51:53  no wait, nevermind :P
07:51:57  that doesn't work here.
07:52:49  you can't magically determine what happens when you a type is supposed to be isomorphic to all monoids ever, but you specifically implement two monoids.
07:52:56  unless you explicitly declare the mapping.
07:53:07  s/you a/your/
07:58:29  hmmm yeah I definitely think it makes more sense to have the type combinators at compile-time...
07:59:13 -!- copumpkin has quit (Ping timeout: 252 seconds).
07:59:39 -!- copumpkin has joined.
07:59:56  "this type is the asymmetric union of A and B (sets of methods that already exist), and this anonymous set that I'm just now defining that contains some new stuff"
08:01:12  asymmetric union being kind of like disjoint union, except you just ignore elements that originate from one set if an equivalently named element originates from the other.
08:01:25  so you can resolve situations where two types define a method with the same name, basically.
08:02:25  that's basically like inheritance, but you could have other fun combinators. basically a lot of set operators.
08:03:45  I wonder if you could still do the | union thingy in Haskell on top of that....
08:03:53  that hurts my brain to think about.
08:04:02  I think that messed up all the type constraint stuff.
08:06:09  yeah that doesn't work. :(
08:06:40  well it could work maybe, I dunno.
08:11:27  monqy: I've scared you away haven't I.
08:12:07  :(
08:14:14  type X = A *> B <* (C | D)
08:15:06  everything in A, and everything in B (the > indicates preference towards the methods in B), and either all of this stuff in C or all of this stuff in D (exclusive or kind of)
08:16:20  and any object matching this is considered an X.
08:18:25  you could also do stuff like relative complement or symmetric difference (no clue why you'd want symmetric difference though)
08:18:48  relative complement would be useful to say "I'll take the methods this type defines, excluding these"
08:19:13  but I'm not sure that | actually makes sense.
08:21:50  monqy: does any of that make sense? :P
08:22:24  maybe
08:22:57  i can see what you're doing but I can't see why you're doing it or how you're going to implement it, or if it even works at all
08:23:03  so
08:23:07  maybe | (which essentially is supposed to work like Haskell's | ) actually doesn't make sense with these semantics.
08:23:27  do you know type theory? I sure don't. it's on my list of things to learn.
08:23:29  crys
08:23:39  yeah this isn't really type theory.
08:24:11  monqy: the key to all of this working would be that the sets of things that any object contains has to be known at compile-time
08:25:05  also I have no clue how primtives would work.
08:25:06  oh, another thing: error reporting is probably going to be hell
08:25:18  type X = Int | Char   -- what?
08:25:40  hm9$?
08:26:34  so I think either a distinction has to be made, some magic needs to happen, or primtive types have to integrate nicely into this picture.
08:26:53  i.e. these are not actually types that I'm defining, but typeclasses, or something.
08:27:35  ??????
08:28:13  so instead of Int it would be Num... that makes more sense. Num has a defined set of operations.
08:29:08  but, that doesn't really address primtive types, it just hides them away for me to deal with later. :P
08:30:25  wow I've typo'd primitive successfully three times now.
08:30:33  impressive.
08:33:40  monqy: well the reason I guess is to get some of the benefits of duck typing in a statically typed system.
08:33:57  what benefits of duck typing
08:34:45  monqy: try to imagine that you like duck typing, now think of all the benefits. :P
08:35:19  try imagining you like punching yourself really hard
08:35:39  oh look I can just pass any object here as long as it defines this interface, and you don't have to explicitly declare that it's part of this interface.
08:35:52  that's pretty much the only benefit I can think of. :P
08:36:04  but no that's not the WHOLE POINT of the language I'm considering.
08:36:22  just a piece. I guess the main idea is to mix the good parts of prototype OO with statically compiled functional languages.
08:36:42  explicit declaration is good. it's documentation and it prevents stupid errors
08:36:56  that's certainly true.
08:37:17  there would have to be a significant expressivity benefit to convince me, and even then...
08:37:57  still I think there are situations where types are defined without knowledge of another interface, and that type fits perfectly into said interface but the designer hadn't thought of it or it didn't exist or wasn't relevant.
08:38:15  I guess instances work perfectly for that situation... so... :P
08:38:35  may be a fruitless effort I'm going for, here.
08:39:27  but there are other things you could do with such a system.
08:39:39  when you consider composing objects together.
08:39:42  hm?
08:40:02  perhaps there's expressivity gains there? I dunno.
08:40:19  a minor benefit: easier to manage namespace creep.
08:41:08  surely you can solve that, at least to some degree, in better ways?
08:41:15  never.
08:41:16  :)
08:43:26  it would be interesting to have an operator which combined two objects together in such a way that they remain distinct but become a single entity with the combined operations of both.
08:44:17  the operations of the previous object would apply to the state of that object only, any shared operations apply to both.
08:44:38  you could call it OBJECT FUSION. MUAHAHAHAHA
08:47:04  also you could do things like map and fold in this manner, without actually calling a map or fold
08:47:08  not that you'd necessarily want to.
08:47:10  but you could.
09:03:02 -!- Phantom_Hoover has joined.
09:48:51 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds).
09:58:55 -!- Ngevd has joined.
09:59:00  Hello!
10:00:35  Hello, fungot
10:00:35  Ngevd: again in a fresh memo later be sent you a copy of knitting for assholes
10:00:39  ^style
10:00:39  Available: agora alice c64 ct darwin discworld europarl ff7 fisher fungot homestuck* ic irc iwcs jargon lovecraft nethack pa sms speeches ss wp youtube
10:01:01  ^echo wiki spam
10:01:01  wiki spam wiki spam
10:01:25 -!- Phantom_Hoover has joined.
10:04:05 -!- BeholdMyGlory has quit (Ping timeout: 258 seconds).
10:04:07 -!- Behold has joined.
10:06:46  Morning, Phantom_Hoover
10:06:53  Or is it?
10:06:57  Wait, yes it is.
10:07:03  Wow, I got up at a reasonable time.
10:09:32 -!- sebbu2 has changed nick to sebbu.
10:17:35 -!- Ngevd has quit (Ping timeout: 252 seconds).
10:44:18 -!- monqy has quit (Quit: hello).
10:51:08  http://gizmodo.com/5859081/why-is-china-building-these-gigantic-structures-in-the-middle-of-the-desert
11:29:04  "If Lydia dies before the marriage can take place, her body will turn up at the temple, causing you to fail the wedding ceremony mini-mission.  The priests will then ask you to leave, and the bride or groom will storm off, angry. [...] The wedding will take place the following day at the same time.  To avoid failing the quest a second time, use Unrelenting Force to fire the corpse from out the way of the door."
11:29:45  The Skyrim engine must be incredibly detailed to even allow such a bug...
11:34:35 -!- Vorpal has joined.
11:38:13 -!- FireFly has quit (Changing host).
11:38:13 -!- FireFly has joined.
11:48:55 -!- derrik has joined.
12:08:53  it must be able to move lydia when the wedding ceremony starts without checking if she's alive?
12:09:52  yeah i don't know any other contemporary game engine where you can move objects
12:10:15  and i assume the priests ask you to leave because you killed someone
12:10:39  the usual punishment for murder
12:11:08  punishment for murder is to leave?
12:11:59  yes, no one wants a murdering morris in their house. they're really annoying.
12:13:02  murderers are annoying?
12:13:27  when you are murdered, where is the annoyance?
12:13:28  eh
12:13:45  it's very likely that they kill someone else first
12:13:56  say you're talking to someone
12:14:11  and mister murderpants decides to assrape them with a chainsaw or something
12:14:30  how annoying would that be?
12:14:42 -!- Ngevd has joined.
12:14:57  you're like midsentence and BOOM cockroach in the brain
12:15:30  (that would be an annoying way to die btw)
12:15:31  How much sense does that make in context?
12:15:46 -!- derdon has joined.
12:15:49  Ngevd: perfect sense
12:15:53 -!- derrik has quit (Quit: gtg).
12:15:55  so perfect
12:16:14  derrik was so annoyed even thinking about this that he had to go
12:16:56 -!- Zuu has joined.
12:16:56 -!- Zuu has quit (Changing host).
12:16:56 -!- Zuu has joined.
12:30:04 -!- Ngevd has quit (Ping timeout: 240 seconds).
12:30:18 * quintopia oklopol
13:11:15 -!- zzo38 has quit (Remote host closed the connection).
13:22:46  oklopol, you are a hero of our times.
13:22:58  Mind doing the same to tiffany at some point?
13:28:24 -!- MSleep has changed nick to MDude.
13:28:59 -!- Patashu has quit (Quit: MSN: Patashu@hotmail.com , Gmail: Patashu0@gmail.com , AIM: Patashu0 , YIM: patashu2 , Skype: patashu0 .).
15:01:10 -!- Behold has changed nick to BeholdMyGlory.
15:06:04 -!- MDude has quit (Ping timeout: 240 seconds).
16:01:18 -!- derrik has joined.
16:09:45  http://cache.gawker.com/assets/images/comment/4/2011/11/a651e5ed5d97375a733ca8f62ca9643b/original.jpg what xD
16:10:15  here's an overlay of a penis on a seven fingered horse, conspiracy?
16:11:38  i love how not even one of the lines match a street
16:17:19 -!- Nisstyre has quit (Remote host closed the connection).
16:18:21  I think one of them matches a bit of park?
16:18:33  The Chinese are very interested in destroying American greenery.
16:21:57 -!- Nisstyre has joined.
16:30:48  http://en.wikipedia.org/wiki/Kinect_Disneyland_Adventures
16:30:54  Oh, how the mighty have fallen.
16:31:51  Dammit, elliott's not here.
16:38:13  apparently they are still keeping einstein's brain
16:38:27  i have my doubts as to whether there was anything special about the dude
16:38:28  Well, FSVO 'keeping'.
16:38:41  Cutting it up doesn't really count in a lot of people's eyes.
16:38:51  i mean, more than say brad pitt's brain or how ever his name is spelled
16:39:00  however
16:39:42  Holy crap I never realised that Elrond was Agent Smith????
16:42:31  i hate the internet
16:42:35  oklopol, can we preserve your brain?
16:43:06  i'm not planning on dying
16:43:21  I don't see the relevance?
16:44:14  i will use my brain forever and ever, so i will just preserve it myself
16:44:21  so yes. or no. it's irrelevant.
16:44:52  Can we insure your brain against accidental damage?
16:45:05  hmm
16:45:36  dunno, would be kind of an interesting challenge to be a retard
16:45:48  well. a very rich retard i guess
16:45:52  so yeah you can insure it
16:46:48  OK this is good.
16:47:31  i'd just go around all like hurp durp they call me an oklopol
16:47:41  here's some moneys for ya
16:48:06  and everyone would be like oh all this money makes your skin seem so soft and seducing
16:48:21  and i'd be like hurp durp what's a seducing
16:48:33  but secretly
16:48:36  i wouldn't even care-
16:48:39  *.
16:48:53  You seem to have this whole brain damage thing planned out.
16:49:04  apparently.
16:49:59  Were I an insurance person, I would be suspicious.
17:02:06 -!- MSleep has joined.
17:17:01 -!- derrik has quit (Quit: gone).
17:28:35 -!- ais523 has joined.
17:28:52 -!- Nisstyre has quit (Ping timeout: 240 seconds).
17:29:43  "Robots have replaced slaves[citation needed] in the assistance of performing those repetitive and dangerous tasks which humans prefer not to do,"
17:30:01  — Wikipedia, apparently oblivious of the last century.
17:30:11  lolwut
17:30:17  Can has link?
17:30:42 -!- monqy has joined.
17:36:30  Funny, here I was thinking it was "underpaid labor" that replaced slaves.
17:40:12 -!- sebbu2 has joined.
17:40:12 -!- sebbu2 has quit (Changing host).
17:40:12 -!- sebbu2 has joined.
17:42:54   /names
17:43:09  ups
17:43:10 -!- sebbu has quit (Ping timeout: 252 seconds).
17:52:55 -!- sebbu3 has joined.
17:52:55 -!- sebbu3 has quit (Changing host).
17:52:55 -!- sebbu3 has joined.
17:53:12 -!- sebbu2 has quit (Read error: Connection reset by peer).
17:54:24 -!- elliott has joined.
18:01:52  hi elliott
18:01:58  hi ais523
18:02:02  hi both
18:02:31  Hi troth
18:03:07 -!- TheJimmyJames1 has joined.
18:03:47 -!- TheJimmyJames1 has quit (Read error: Connection reset by peer).
18:03:57  wow at the levels of spam on esolang recently
18:05:02  "I don't really have an opinion, so I'm going to argue against deletion."
18:05:06  ais523: does this sentence make any sense to you?
18:05:26  yes; I can parse it and it semantically makes sense
18:05:46  i don't have an opinion, and here it is
18:05:55  it's a little inconsistent, but I can mentally expand it to "I'm an inclusionist and think pages shouldn't be deleted without a good reason"
18:06:52  ais523: there needs to be a good word to distinguish "has lax notability standards" and "thinks pages should be kept unless proven otherwise"
18:07:12 * elliott suspects most deletionists are aligned against the first position, not the latter
18:07:12  so i suppose he was very confident about his lack of opinion being correct. he would've thought it should be removed if it was that bad.
18:07:17 -!- TheJimmyJames1 has joined.
18:10:41 -!- Slereah has quit (Ping timeout: 252 seconds).
18:11:14 -!- Slereah_ has joined.
18:11:22  elliott: I actually think deletionism is a result of biased sampling
18:11:29  `@ TheJimmyJames1 ? welcome
18:11:31  if you spent a while on Wikipedia's newpage patrol, you'd become a deletionist too
18:11:35  TheJimmyJames1: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
18:11:38  ais523: heh
18:11:47  I am serious about this, it almost happened to me
18:11:56 -!- Nisstyre has joined.
18:12:14  ais523: Wikipedia really needs to find a way to get its maintanence work done without doing it by making people obsessive :P
18:12:31  "Category:Candidates for speedy deletion is currently 202% backlogged."
18:12:46  elliott, just outsource it to the general population.
18:12:52  heh, cleaning out CSD is /typically/ really easy
18:13:03  when it isn't, it's because overeager taggers are tagging all sorts of stuff for deletion that doesn't actually delete it
18:13:09  my guess is that A7 has got out of hand again
18:13:16  "The queue at Special:NewPages is currently 20.33 days." apparently this only counts as defcon 4
18:13:17  Every now and then you get a popup requiring that you do maintenance.
18:13:24  I guess defcon 1 is when it's ten years backlogged
18:13:37  Administrators: Please do not delete this category even if it is empty!
18:13:37  This category may be empty occasionally or even most of the time.
18:13:37  --Category:Candidates for speedy deletion
18:13:43 -!- sebbu3 has changed nick to sebbu.
18:13:55  ais523: which one is A7?
18:13:59  no, defcon 1's when there's a concerted amount of vandalism by people who know what they're doing, that also can't be cleaned up in an automated way
18:14:06  elliott: approximately, no assertion of notability
18:14:12  ais523: no, newpages defcon
18:14:20  oh, there's a newpages defcon now?
18:14:20  there's so many defcons!
18:14:27  CSD defcon and newpages defcon at least
18:14:33  presumably that's much the same thing, except for vandals creating pages
18:14:45  ais523: no, I think it's just based on the backlog
18:14:46  to me, that sounds like {{adminbacklog}} not {{defcon}}
18:14:47  given the captions
18:15:01  they need a defcon defcon so we can know when the defcons are getting dangerously high
18:15:51  eh, there's only 44 pages in CSD
18:16:04  http://en.wikipedia.org/wiki/User:DialTel good
18:17:47 -!- Slereah_ has quit.
18:23:19 -!- azaq23 has joined.
18:31:06 -!- zzo38 has joined.
18:32:58 -!- Slereah_ has joined.
18:37:50 -!- TheJimmyJames1 has quit (Quit: Leaving.).
18:45:29 -!- copumpkin has changed nick to TheWickedChicken.
18:47:38  ais523: yikes
18:47:50  ais523: all our external links headings are wrong
18:47:57  because of Graue
18:48:02  Tell me if there is something you see wrong with this program which I may have missed:  http://sprunge.us/LJeL
18:48:25 * elliott wonders how one can judiciously decide to disregard a policy after someone already starts mass-editing a fix to it
18:48:34  I think it must be wrong because it is out of memory even if the module is compiled, so I must have written it wrong.
18:48:53  zzo38: did you use -O2?
18:49:05  you need -O at least to get basic strictness analysis and -O2 can help as well
18:49:52  > type TextString = [Either Int32 Word32];
18:49:53    : parse error on input `type'
18:49:58  zzo38: you don't want to store long strings in that
18:50:17  it's full of boxes and lazy, so it'll eat up tons of memory
18:51:09  elliott: I tried -O and -O3
18:51:34  -O3 is meaningless, it means -O2
18:51:44  well, it's not meaningless :) but it's silly
18:51:54  zzo38: anyway, I suggest
18:52:15  data TextChar = Blah Int32 | Bleh Word32 deriving (Eq, Show, ...) -- with better names for the constructors
18:52:16  then
18:52:19  The function "withDVI" which is causing the out of memory never uses the "TextString" type.
18:52:26  type TextString = Vector TextChar
18:52:38  zzo38: how did you determine that is what runs out of memory? profiling?
18:53:51  Because I compiled the program and then loaded the compiled file and then used:   tenrm <- loadFont (Left 1000) "f:/program files2/MiKTeX/fonts/tfm/public/cm/cmr10.tfm"     withDVI "test1.dvi" (\_ _ -> return tenrm) 0 (\_ p -> return $ Just (0, pageNumbers p))
18:55:16  > withDVI_page_ :: (Word32 -> ByteString -> IO Font) -> s
18:55:16  >  -> (s -> Page -> IO (Maybe (s, t))) -> DocStat -> Word8 -> IO [t];
18:55:17    Not in scope: type constructor or class `ByteString'Not in scope: type cons...
18:55:17    : parse error on input `->'
18:55:19  zzo38: will the resulting list be long?
18:55:30  because this produces no elements until the whole thing has been calculated, and builds up thunks in memory in the meantime
18:55:53  The file "test1.dvi" has only a single page, so the resulting list will have only one element, which is its page number.
18:56:16  zzo38: have you tried profiling yet?
18:56:27  http://www.haskell.org/ghc/docs/7.0.4/html/users_guide/profiling.html
18:56:34  Will that display exactly what part runs out of memory?
18:57:05  it's not possible to determine "exactly which part" since that depends on when the allocator gives up and runs out of heap! but it will help you see which parts of the program allocate more than others
18:58:25  if the +RTS -p profiling demonstrated there doesn't help, then http://www.haskell.org/ghc/docs/7.0.4/html/users_guide/prof-heap.html might
18:58:31  but try the first page first
18:59:18  Do I need to compile the main module too, to make that work, or can it be used with GHCi if the Graphics.DVI module is compiled and the main commands are entered interactively?
19:00:03  You need a Main module, but you can just do:
19:00:11  main = do {   tenrm <- loadFont (Left 1000) "f:/program files2/MiKTeX/fonts/tfm/public/cm/cmr10.tfm";     withDVI "test1.dvi" (\_ _ -> return tenrm) 0 (\_ p -> return $ Just (0, pageNumbers p)) }
19:00:16  err, >>= print at the end of that :)
19:01:16  OK. I can try that.
19:02:30  pikhq: I had an idea to make @'s allocator superfast but it won't work :(
19:02:37  Oh?
19:03:50  pikhq: Well, a typical allocator would look like \size -> { heapPtr += size; if (heapPtr > heapMax) jump to gc stuff; return (heapPtr - size) }.
19:04:21  pikhq: I was thinking, what if I just made it \size -> { x = heapPtr; heapPtr += size; return x }, and aligned things so that the heapMax was on a hardware page boundary?
19:04:37  pikhq: Then it'd cause a page fault when the overflow would occur when the memory is first accessed.
19:04:44  And I could fix things up from the handler.
19:04:47  So allocation would be branch-free.
19:05:21  pikhq: The problem is that I'd have to have a free page after it in all circumstances, and obviously I can't just say that the @ abstract machine-local 64-bit address space only uses every other page, because that's ridiculous and means you can't have allocations bigger than a page.
19:05:56  Which sucks, because a two-instruction (mov + add), branchless allocator would be awesome.
19:07:17 -!- azaq23 has quit (Quit: Leaving.).
19:08:47  elliott: Actually, it's a free page after each *heap*.
19:09:07  Hmm, well, true.
19:09:26  pikhq: Still, it sucks to wall off large parts of the address space for an optimisation.
19:09:51  This doesn't *quite* work, though, because you'll need to make sure your allocation isn't bigger than a free page + what's remaining.
19:10:19  pikhq: Well, right. Most allocations are smaller than 4 megabytes.
19:10:25  So you'd probably need to make the allocator select a heap of appropriate size first.
19:10:37  Hopefully static analysis could determine whether an allocation is always less than 4 megabytes in the common case...
19:10:40  Since most allocations are constant-sized.
19:10:51  Yeah, that is definitely something static analysis could do.
19:11:01  Not much different than GCC's memcpy optimisations.
19:12:20  Using those options didn't work. I got "out of memory" and an empty .prof file
19:13:05  zzo38: huh. try the http://haskell.org/ghc/docs/7.0.4/html/users_guide/prof-heap.html style of profiling? Alternatively, just terminate the program before it runs out of memory (with Ctrl+C or similar)
19:13:10  that'll make the .prof be generated
19:14:52  It runs very fast; there is no time for Ctrl+C
19:15:25  zzo38: You could try running it on even smaller inputs so that it doesn't run out of memory and produces a report that you can optimise memory use based on.
19:18:15  I tried it with only an "X" on the page; that also runs out of memory. Trying it with only a rule (no text, not even the page number) succeeds.
19:18:41  Well, look at the profiling report for that then :-) Beyond that I don't really have much idea; ask #haskell.
19:23:30 -!- SgeoN1 has joined.
19:24:21 -!- derrik has joined.
19:31:43 -!- pagnol has joined.
19:31:54  `@ pagnol ? welcome
19:31:56  pagnol: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
19:35:45  Hard drive came
19:36:07   No internal screws though, and even if I had, I don't see a place to put them
19:36:26  what hard drive
19:36:40 -!- zzo38 has left.
19:38:18  :t catMaybes >=> listToMaybe
19:38:19      Couldn't match expected type `[c]' against inferred type `Maybe a'
19:38:19      In the second argument of `(>=>)', namely `listToMaybe'
19:38:19      In the expression: catMaybes >=> listToMaybe
19:38:23  :t catMaybes
19:38:24  forall a. [Maybe a] -> [a]
19:38:30  New hard drive for my old laptop which I've been using
19:38:32  :t \xs -> listToMaybe (catMaybes xs)
19:38:33  forall a. [Maybe a] -> Maybe a
19:38:44  oh, hmm
19:38:46  elliott: Foiled again!
19:38:53  shachaf: hi
19:39:01  elliott: Good afternoon.
19:39:14  good afternoon to be foiled
19:39:21  Did you think you would find an actual use case for (>=>)?
19:39:34  That operator is forever going to be "nice to express the monad laws in" and nothing more.
19:39:58  shachaf: I use (>=>) with... semi-relative frequency.
19:40:25  Semi-relative to zero?
19:40:26  shachaf: See, I get "f x = doCrapWith x >>= processMagic", and zomg!
19:40:51  zomg, indeed. I couldn't have put it better myself.
19:41:17  Is it bad that I tend to think in terms of do notation, then, if simple, translate to operators?
19:42:02  Sorry, we're not qualified Haskell therapists.
19:42:23  Tell us more about you tend to think in terms of do notation, SgeoN1.
19:48:30 -!- sebbu has quit (Ping timeout: 276 seconds).
19:52:32 -!- TheWickedChicken has changed nick to copumpkin.
19:58:41  SgeoN1: YES, YE SHALL BE LYNCHED
20:01:19 -!- sebbu has joined.
20:01:19 -!- sebbu has quit (Changing host).
20:01:19 -!- sebbu has joined.
20:04:03  pikhq: I guess whether it's OK or not to have a free page after every heap depends on how big heaps will be.
20:05:01  (Shouldn't it be "pool", not heap?)
20:06:57 -!- azaq23 has joined.
20:13:34  Probably.
20:13:59 -!- zzo38 has joined.
20:14:18  I mean, an @ system only has one heap.
20:14:28  (That actually might be the definition of an @ system.)
20:14:59  Well, this is a bad sign
20:16:58  elliott: I could've sworn that the total number heaps that all @ systems in existence have is zero.
20:17:18  shachaf: You're a bad person.
20:17:31  :-(
20:17:40 * shachaf would, like, totally use @.
20:18:22  OK you are granted minimum decency status.
20:18:47  ...If it only had a better name.
20:19:08  Fortunately, "@" is a placeholder.
20:19:23  shachaf: @ ISN'T THE NAME
20:19:26 * elliott kills everyone
20:19:38  elliott: So what's "@"?
20:19:50  shachaf: A macro for the English language that expands to the name of @.
20:20:09  shachaf: It's just that nobody knows what it is yet, so whenver you use it, your sentence gains an indeterminate amount of words, letters, and sense.
20:20:09  elliott: Why didn't it expand just then when you said "@ ISN'T THE NAME"?
20:20:20  shachaf: Lisp macros don't expand when you type out a use of them in Emacs!
20:20:25  Oh, I see.
20:20:29  Umm, use-mention distinction.
20:20:33  Or: I was just lying! For FUN!
20:20:39  Fuck you I hate you.
20:20:41 -!- elliott has left ("BAH").
20:21:27 -!- elliott has joined.
20:21:35  @hug elliott
20:21:36  http://hackage.haskell.org/trac/ghc/newticket?type=bug
20:21:44  I'm the worst bug.
20:22:26  elliott is just afraid of picking a name because if it's a suboptimal name, the system won't be perfect anymore.
20:22:30  Unlike the rest of @.
20:23:05  shachaf: See, you think you're joking, but no, that's literally the exact reason I won't pick a name.
20:23:17  shachaf: (Although I don't think @ is perfect, I'm just really indecisive about names.)
20:23:51  elliott: /whois ec
20:24:07  shachaf: I know who that is.
20:24:14  Yep.
20:24:20  shachaf: What's your point?
20:24:52  I don't got a point.
20:25:10  Deep.
20:36:16  Mmmmmmmmmmmm PEZ
20:42:10 -!- pikhq_ has joined.
20:42:19 -!- pikhq has quit (Ping timeout: 245 seconds).
20:43:02  PEZ!
20:43:12  Inoserite!
20:43:43  I no serite.
20:43:55  I, nose.
20:44:21  Rite?
20:45:52  elliott: I broke ARM.
20:46:41  Gregor: RIP ARM.
20:46:45  Gregor: Try it on PEZ.
20:48:42  The best thing about PEZ is that you not only get candy, you're also at the same time practicing killing people by wringing their necks.
20:49:05  I don't use the dispensers.
20:49:11  I feel they cheapen the candy.
20:49:19  They redirect the focus improperly.
20:49:21  But then you don't get any murder practice.
20:49:31  Gregor: X-D
20:49:40  I get plenty of murder practice every Sunday at the docks.
20:51:36  ais523: You know, a stopgap until Graue finally upgrades MediaWiki and improves the anti-spam stuff would be to have a spam-deletion bot.
20:52:07  ais523: Also, you missed "Touches on free mobile dating sites in the comment" and "User:Shopfitting11".
20:52:12  no I didn't, I'm just being lazy
20:52:17  I'll get to them eventually
20:52:43  ais523: I said "missed" because you deleted other pages in the interim.
20:52:54  they appeared out of order in my feed
20:52:59  Ah.
20:53:05  to be precise, in the update after the one that gave me the pages I actually deleted
20:53:10  I don't know /why/ the feed is so out of order, btw
20:53:42 -!- zzo38 has quit (Remote host closed the connection).
20:54:29 -!- oerjan has joined.
20:54:34  hi oerjan
20:54:45  hello elliott
20:55:55  ais523: Do you use the RSS or Atom feed?
20:56:07  I can't remember
20:56:18  they both contain the same info, though, IIRC
20:56:26  ais523: Yes, but one might be less buggily generated.
20:56:43  Either the Atom one because Atom is a newer/more modern standard, or RSS because Atom was immature when this ancient MW version came out.
20:58:31   monqy: I've occasionally considered the idea of "static duck typing" though I don't really know if type inference is possible.
20:58:43  that's called structural typing and ocaml has it
20:58:44  see ocaml object system
20:58:47  oerjan: *hi5*
20:58:58  *hi5*
20:59:12  yessssssss
21:00:24  i vaguely recall that ocaml's polymorphic records also involve that, perhaps in a simpler way.  and that no one uses ocaml's object system anyway.
21:00:40  or was that polymorphic variants.  or both.
21:00:43  oh, i may have meant its records.
21:00:51  yes, i think i did.
21:00:57  ocaml is so ugly.
21:02:21  i've forgotten most of it beyond the basics.
21:03:39  although i suppose learning it first may have helped me learning haskell.
21:05:05 * elliott isn't sure any strict, impure language can help with haskell. but i suppose ADTs are a good basis
21:05:38  erm it certainly helps with the _type_ system basics, hindley-milner you know
21:05:56  oerjan: well that too.
21:05:59  oerjan: apart from that ''a stuff :P
21:06:01  and also higher order functions.
21:06:16  although i'd seen those before in lisp
21:06:17  OK, I suppose it helps a bit :)
21:06:25  just doesn't eliminate the learning curve
21:08:24  pikhq_: I wonder how expensive it would be to give every single thread its own pool...
21:08:31  pikhq_: (I want threads at least as lightweight as GHC's)
21:08:36  Probably "way too".
21:09:30 -!- Sgeo has joined.
21:13:04  `addquote  Ngevd: again in a fresh memo later be sent you a copy of knitting for assholes
21:13:05  oerjan: just as i was initially believed they were new additions. for that. busy
21:13:06  724)  Ngevd: again in a fresh memo later be sent you a copy of knitting for assholes
21:13:11  elliott: Actually, it would probably actually dramatically reduce GC overhead.
21:13:26  And, in fact, Erlang does precisely that.
21:13:38  Each Erlang process has its own pool.
21:13:55  iirc ghc also gives each thread its own pool, but only in the first generation
21:14:16  pikhq_: Yes, but Erlang processes aren't /that/ lightweight.
21:14:20  You can have millions of GHC threads easily.
21:14:24 -!- Ngevd has joined.
21:14:34  True, GHC threads are even more lightweight than Erlang processes.
21:14:49  Both of which are much more lightweight than "real" processes or threads.
21:14:52  oerjan: huh
21:14:54  oerjan: I wonder how big the pools are
21:14:55  Isn't it annoying when you have an amazing revelation then realise it would be ABSOLUTELY USELESS?
21:15:25  elliott: the "nursery", it's called, it's what allows the concurrent gc
21:15:33  oh, right
21:15:44  512 kilobytes, heh
21:15:52  For instance, C-style for loops in Lambda Calculus
21:16:00  oerjan: well i definitely need lots of pools, since the heap is like 1 Tio
21:16:02  and it can of course only contain objects not referenced from other threads, a problem which erlang doesn't have
21:16:08  and stopping the world would be problematic :P
21:16:23  oerjan: right, so things like IORefs allocate their backing storage on something more shared?
21:16:29 -!- Ngevd has changed nick to Taneb|Hovercraft.
21:16:34  elliott: well ghc's concurrent gc still stops the world, unless they've changed it
21:16:48  the problem is that reduces to two levels in @, thread-local and global...
21:16:53  oerjan: oh you mean parallel ghc ofc
21:16:54  not concurrent
21:17:00  oh hm
21:17:05  parallel = gc uses threads
21:17:08  concurrent = gc runs with program
21:17:39  i vaguely recall they're trying to remove that and make it concurrent
21:17:52  Gregor: Is there any hope for non-copying collectors? :'(
21:17:57  unless they already did, very recently
21:18:22  oerjan: i don't think so
21:18:22  elliott: Any hope of what?
21:18:32  Gregor: Not being worse than copying collectors :P
21:18:46  elliott: Perhaps when we're on many-many-many-core.
21:19:10  Woah, I can adapt my idea into something awesome!
21:19:36  Gregor: Soooo not helpful :P
21:19:49  Hmm, I could probably do a copying collector, if I have enough pools.
21:19:54  elliott: i don't know if IORefs allocate outside the nursery _immediately_, or just when they get set to something in another thread
21:20:00  You'd only need, like, a few gigs free at a time, not a terabyte.
21:20:12  oerjan: well ok
21:20:52  How annoying would it be to repartition such that I have more swap space, and should I do so?
21:21:05  it's probably part of the same copying that ensures you cannot have a reference from an older generation to a younger
21:21:06  I'm on a 1GB machine, and the installer decided to give me 1GB of swap
21:21:23  (approx.)
21:21:30  Dude, anymore you should be heavily tempted to just not have swap.
21:21:32  swap space as a similar size to main memory is the usual guideline
21:21:45  ais523: 1.5* for smaller systems
21:21:49  pikhq_: Uh no, 1 gig is nothing.
21:21:54  elliott: do you consider 1GB a smaller system?
21:21:56  1 gig of swap miight be OK, but I'd shoot for 2 gigs.
21:21:57  ais523: Of course it is.
21:22:12  elliott: I'm using 1 gig ATM, on x86_64 (which, of course, uses more memory)
21:22:17  ais523: Nobody but zzo has < 1 gig, and no "usual" (even netbook) computer sold today has fewer than 1-2 gigs.
21:22:27  3 gigs is very common on cheap consumer machines.
21:22:38  And 8-16 gigs is becoming common on the high end.
21:22:41  So yeah, 1 gig is small.
21:22:44 * Sgeo does need to be able to run MonoDevelop without crying
21:22:56  Sgeo: Get more RAM
21:23:04  Swapping like crazy is "with crying".
21:23:21 * oerjan still has 800 something Mb, actually
21:23:47  the problem with swap is, you're in serious trouble if it's actually used for the foreground process
21:23:55 -!- derrik_ has joined.
21:24:19  Now would be a good time to mention how much better @ is with swapping?
21:24:51  what /does/ @ do with swapping?
21:24:57  Is @ going to be released in the next 10 years?
21:25:07  ais523: RAM is considered disk cache.
21:25:13  pikhq_: ah, ofc
21:25:18  so it's more a case of antiswapping
21:25:22  swapping out of RAM, rather than onto disk
21:25:24  pikhq_: not /quite/, you can have things in the cache that aren't on disk
21:25:25 -!- derrik has quit (Ping timeout: 253 seconds).
21:25:30  elliott: ah you're going to need that precognitive swap algorithm that someone asked me to write years ago
21:25:32  it's more like, RAM is the first few GC generations, and whatever's being use
21:25:33  d
21:25:40  just too bad i never did
21:25:42  Taneb|Hovercraft, no, elliott will be too busy... I don't actually know.
21:25:46  and disk is all generations apart from the first few
21:25:48  elliott: It's still the shortest way of describing @'s memory model. :P
21:25:49  Making ElliottCraft?
21:25:52  oerjan: wat :P
21:25:52 -!- Taneb|Hovercraft has quit (Quit: Goodbye).
21:26:01  pikhq_, I assume it's less crying with an HD than with USB stick like I was doing before?
21:26:12  elliott: i don't know if he was joking or severely overestimating me
21:26:18  (I will still be trying to find out how you do numerical integration for gravity without it being crazy inaccurate.
21:26:20  )
21:26:27  oerjan: were you talking about synchronicity or sth :P
21:26:31  Sgeo: You're still dealing with human-noticable latencies for disk access.
21:26:37  Spinning disks are *really* slow.
21:26:40  Phantom_Hoover: Can't you just rip off that JS thing :P
21:27:00  elliott: no, this was long before i learned of synchronicity.  back in the mid-90s at the latest
21:27:18  human-noticable is not as bad as human-tearing-his-hair-out-for-10-minutes
21:27:28  oerjan: Did the page you randomly turned to feature the http://upload.wikimedia.org/wikipedia/commons/e/e2/Sch%C3%A9ma_synchronicit%C3%A9_in_English.png diagram?
21:27:37  It'd convince me.
21:27:43  iirc he suggested it would be nice with a swap algorithm which could guess what needed to be swapped in next
21:27:54  elliott, he ripped off a JS Library, in the sense of "code which is ~optomised~ to the point of taking too much work to unravel."
21:28:04  oerjan: well that's doable, precognition isn't :P
21:28:10  (whether it /works/ well is another question)
21:28:28  what does optomisation mean?
21:28:45  Who knows?
21:29:01  elliott: that horizontal axis is something i've thought about before, the vertical not so much.
21:29:04  ais523: It's what only terse can give you.
21:29:09  Sorry, *TERSE
21:29:10  also, hmm, surrounding the word with ~ = sarcasm marks on a single word?
21:29:36  ais523: ~probably~
21:29:38  That's the main use of sarcasm marks I've seen, by which I mean it's what elliott does.
21:29:51  http://www.terse.com/pics/topyello.gif
21:29:54  OPTOMIZED
21:29:57  TERSE
21:29:58  PERFORMANCE
21:30:08  op-to-mize vt [Gk optos + ISV -mize] : to make as aesthetically perfect, effective, or functional to the eye as possible.
21:30:21  oh, like optical optimization?
21:30:42  No! It's TERSE! Assembly language with ADDED FUN!
21:30:49  Prefix! Infix! Postfix!
21:30:57  DOS-compatible! Windows-compatible!
21:31:00  Bill Gates approved!
21:31:09  Lose Wait(tm) with TERSE(tm) today!
21:31:15  you know what; I've decided that unary minus is a really annoying operator
21:31:21  (I swear to god the "Lose Wait" thing is a direct quote.)
21:32:30  ais523: haskellers agree
21:32:59  so do OCamlers (where it has a different notation from - in a lot of contexts as - would be ambiguous)
21:33:08  elliott: surely it should be "Loose Wait"?
21:33:12  When I saw him a few days later he was jubilant! "Wow! I hadn't realized how easy it was to write in  . I began translating my stuff and gave up on it. It was much simpler just to write everything directly in  . Not only did I totally re-write several weeks worth of code, but I wrote a bunch of other routines too." "I told you," I replied. "With   you're free to work on the problem, not the assembly language syntax. There's no need to invent label
21:33:12  s, think about reversing conditionals, your typing is significantly reduced, and..." He butted in, "And you can see the structure of the program right on the screen! There is no need to make a listing and draw out the looping structure with a pen, and..." I couldn't get another word in, so I just let him talk as he continued to espouse the virtues of  .
21:33:14  uh oh, someone has pinged me.
21:33:20  CakeProphet: boo!
21:33:21 * CakeProphet scrolls up
21:33:21  I would put the "TERSE"s back in from the logos there, but I think it might be better without.
21:34:53  oh good it wasn't elliott pinging me.
21:34:54  I'm safe.
21:34:58  elliott: i had to copy and paste to find out if you'd really removed the name or if it was a crazy unicode thing
21:35:01  CakeProphet sucks.
21:35:03  oerjan: heh
21:35:04 -!- Taneb|Hovercraft has joined.
21:35:07  oerjan: each one is an individual 
21:35:09  with no alt text
21:35:12  http://www.terse.com/pics/terse22p.gif
21:35:13  aha
21:35:21  http://www.terse.com/reluctan.htm
21:35:34  the lack of italics and bold in the black-on-yellow 90s style makes it lose something in translation
21:35:38  a very  language
21:35:49  :D
21:36:08 -!- derrik_ has quit (Quit: gone).
21:36:42   CakeProphet sucks. <-- hey i was afraid he'd suck so much he didn't notice at all
21:37:05  :( :( :( :( :(
21:37:32  CakeProphet: it's always dangerous to talk to people who've idled for 12 hours
21:37:42  What is Terse?
21:37:46  Taneb|Hovercraft:  .
21:37:56  Taneb|Hovercraft: The  st language of all!
21:38:07  elliott: that helps a lot
21:38:17  Taneb|Hovercraft: http://www.terse.com/
21:38:58  AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA THE YELLOW, IT BURNS
21:39:24  So it's assembly that does control structures for you?
21:39:29  i.e. PUSSY ASSEMBLY
21:39:40  PLUS SYMBOLICS!!! INFIX!!!!
21:39:40  must be my 1/8 vampire genes
21:39:41  i.e. C?
21:39:54  ais523: NO ITS TERSE
21:40:05  I don't recommend gooling "pussy assembly"
21:40:10  *googling
21:40:15  ais523, no.
21:40:15  ais523: "external resources" is such an ugly heading :(
21:40:25  hey if someone wants to assemble a pussy, i'm not going to stop them.
21:40:28  with SafeSearch off, even.
21:40:34  C specifies a fair bit of memory management stuff as well.
21:40:59  Is it bad that I think brainfuck could be more readable
21:41:15  Taneb|Hovercraft: more readable than what?
21:41:18  it's kind of confusing.
21:41:21  That way lies brick/brain exchange.
21:41:22  that you would think that.
21:41:23  oerjan: Terse
21:41:42  ah.  i was afraid you were considering making a derivative.
21:41:49  *WHEW*
21:42:21  My first esolang was an unpublished Ook! derivative
21:42:35  wow terse's website is SO AWESOME
21:42:46  it's yellow.
21:42:48  Sometime probably in 2008
21:42:52  ....Maybe I shouldn't have gone for encrypted home
21:42:57  AFAICT, it implies encrypted swap
21:43:08  uh, no?
21:43:23  your home and your swap are completely separate from each other... >_>
21:43:34  assuming linux.
21:43:36  "Also, it is strongly recommended that you encrypt your swap space. Users installing from Ubuntu 9.10 and selecting the Encrypted Home option will automatically have encrypted swap space. "
21:43:44  Why would they change it after 9.10?
21:43:44  oh
21:43:48  weird.
21:43:52  THEY NEVER TOLD ME THAT.
21:44:05  but anyway encrpytion isn't a problem, it's a good thing.
21:44:42  Sgeo: what's wrong with encrypted swap
21:45:09  elliott, slower, I'd assume
21:45:16  ha. ha. ha ha. ha ha ha
21:45:19  I feel like swapping just isn't slow enough.
21:45:23  How could I make it slower?
21:45:25  I KNOW!
21:45:35  Sgeo: disk is much slower than cpu.
21:46:18  Heck, *RAM* is slower than CPU anymore.
21:46:39  Even CPU is slower than CPU these days*.
21:46:42  :P
21:47:23  shit even the speed of light is slower than CPUs now.
21:48:27  Sgeo: but yeah encryption is either imperceptible or minor overhead on top of a disk operation.
21:48:39  Sgeo: also, how often do you actually use your swap?
21:48:42  I don't use mine at all.
21:48:46  All the time!
21:48:50 -!- Taneb|Hovercraft has quit.
21:49:08  Actually, apparently I don't.
21:49:10  oh hmmm I'm apparently using 330 MBs of swap right now. :P
21:49:42  But yesterday I accidentally tried to compute a big Integer in ghci and I ended up using quite a lot of swap before I managed to kill it.
21:49:49  sudo swapoff -a
21:49:51  bahahahahahahaha
21:50:00  CakeProphet: I'm sure your OS has better things to do with that RAM.
21:50:08 * CakeProphet mutters under his breath about "evillllll"
21:51:01 -!- pagnol has quit.
21:52:07  the main problem I have with my encrypted home is that
21:52:09  if my computer died
21:52:15  I will have no way to access everything
21:52:19  because I don't know the key. :P
21:52:23  Memorize the key.
21:52:33  I actually don't even know where to find it.
21:52:41  Someone needs to write a program that turns arbitrary bytestrings into something that's easy for humans to memorize.
21:53:18  well I was just going to do the old write-it-down trick.
21:53:26  so when the FBI raid my home they can easily find it!
21:53:32  No, man, memorize it!
21:53:39  I should do that.
21:53:50  I could apply a simple Caesar cipher to it
21:53:53  they'll never figure that shit out!
21:56:35  wait, if you don't know the key, then it must be stored on the computer, and wth is then the point of encrypted home?
21:56:40  elliott: ARM fixt.
21:56:54  Gregor: Horey.
21:57:09  elliott: Whorey.
21:59:45 -!- zzo38 has joined.
22:03:39  hoary
22:03:48   :t \xs -> listToMaybe (catMaybes xs)
22:03:49  hm...
22:04:03  oerjan: you need the key to open the drive...
22:04:09  because it's... encrypted
22:04:10  > mconcat [Nothing, Just 3, Just 4]
22:04:11    Ambiguous type variable `a' in the constraints:
22:04:11     `Data.Monoid.Monoid a'
22:04:11   ...
22:04:12  oerjan: I was thinking of something involving join first, which was what all that monadery was about.
22:04:13  the encrypted drive contains the key.
22:04:23  wat
22:04:24  > choice [Nothing, Just 3]
22:04:25    Not in scope: `choice'
22:04:30  @hoogle Alternative f => [f a] -> f a
22:04:31  Data.Foldable asum :: (Foldable t, Alternative f) => t (f a) -> f a
22:04:31  Control.Monad msum :: MonadPlus m => [m a] -> m a
22:04:31  Control.Applicative (<|>) :: Alternative f => f a -> f a -> f a
22:04:41  > mconcat [Nothing, Just 3, Just (4 :: Int)]
22:04:42    No instance for (Data.Monoid.Monoid GHC.Types.Int)
22:04:42     arising from a use of...
22:04:50  oops
22:04:50  oerjan: it's a wrapper-type Monoid insatnce
22:04:51  instance
22:04:52  not a semantic-type one
22:04:54  oh hm
22:04:55  (terms I just made up)
22:04:59  > asum [Nothing, Just 3, Just (4 :: Int)]
22:05:00    Not in scope: `asum'
22:05:02 -!- bd_ has left.
22:05:03  >:(
22:05:06  > Data.Foldable.asum [Nothing, Just 3, Just (4 :: Int)]
22:05:07    Just 3
22:05:09  > msum [Nothing, Just 3, Just 4]
22:05:11    Just 3
22:05:36  mmmm biscuit syrup
22:06:01  all governments should be biscuit syrup.
22:06:03  oerjan: anyway, listToMaybe [x | C x <- xs] is quite a nice pattern
22:06:27  listToMaybe [ x+y | Foo x y <- xs, x < y ]
22:06:28  CakeProphet: um my point is, how can you then get the computer started without knowing the key?  even if it's otherwise in order?
22:06:32  it's like find but with deconstruction :P
22:06:36  hmm...
22:06:42  @hoogle (a -> Maybe b) -> [a] -> Maybe b
22:06:42  Prelude mapM_ :: Monad m => (a -> m b) -> [a] -> m ()
22:06:42  Control.Monad mapM_ :: Monad m => (a -> m b) -> [a] -> m ()
22:06:42  Control.Monad forM_ :: Monad m => [a] -> (a -> m b) -> m ()
22:07:10  oerjan: oh well I think the code might be based on your password (???)
22:07:22  but all it seems to need is my password to access the drive.
22:08:53  very well
22:10:47  oerjan: hmmm but I do need a mount passphrase which it apparently gave me and I probably didn't write down.
22:10:54  if I want to manually recover the drive.
22:12:43  but I'm thinking I can use my login passphrase with a newly installed Ubuntu OS and it will be able to unmount it somehow (?????)
22:12:52  according to this wiki page.
22:13:53  elliott: "ditto" is not an ideal edit comment when you're dittoing something on another page
22:14:02 -!- Patashu has joined.
22:14:10  ais523: IT WAS SO TEDIOUS
22:14:18  I note that I apparently forgot it for about five edits :P
22:15:48  I've got all the spam now, I think
22:16:06  elliott: so FRP would be a good choice for... say, a physics simulator within a game like df?
22:16:30  What is FRP not an ideal choice for?
22:16:38  Sgeo: network IO, apparently.
22:16:58  *certain kinds of network io
22:17:00  Hmm?
22:17:04 * Sgeo is curious now
22:17:55  Sgeo: also things where you're not reacting to time-based events.
22:17:57  http://stackoverflow.com/questions/6812533/am-i-using-reactive-banana-right is a decent example.
22:17:58  or external input.
22:17:59  Esp.: @Ben Ford: I've added a small remark to the answer. I don't know what you want to do with the sockets, so I can't tell you whether FRP is overkill for your purpose. Basically, if your event network won't grow much larger than this one with a single accumE and some filterE, then it's more elegantly done without FRP. – Heinrich Apfelmus Jul 25 at 16:16
22:18:24  Also FRP is obviously not very well suited to "conversational" style UIs, where you're literally doing things in sequence: ask user for command, do something, repeat.
22:19:12  Hmm
22:20:09  why is the wikipedia article for FRP so bad.
22:22:40  elliott: but perhaps some of this bloat could be resolved if your language provided built-in support for FRP similar to what Haskell does with monads.
22:22:43  just an idea.
22:23:03  but I think it's fair to say that this is too much code for a simple networking task.
22:23:03  Haskell offers exactly one bit of language support: do notation.
22:23:10  And it's not much.
22:23:38  it certainly makes things like, say, simple networking tasks, not quite as annoying.
22:23:51  granted
22:24:26  it's /easy/ to fit monads to an synchronous style of programming, but FRP doesn't work that way.
22:27:28  augur: You might be interested in Clue.
22:27:41  elliott: the whodunnit game?
22:27:43  i love clue!
22:27:48  No, http://esolangs.org/wiki/Clue_%28oklopol%29.
22:27:56  http://esolangs.org/wiki/Clue_%28oklopol%29/Quicksort and http://esolangs.org/wiki/Clue_%28oklopol%29/SKI_calculus are more helpful than the article.
22:27:58  Re: your talk in #haskell.
22:27:59  is it oklopol naked?
22:28:06  yes
22:28:09  Yes.
22:28:11  thank you for asking
22:28:20 * augur bites oklopol
22:28:30  now why would you do that
22:28:46  clue is the worst game
22:28:46  ever
22:28:48  that's just nasty
22:29:18  are you talking about my clue
22:29:19  ca
22:29:20  some people just prefer to be clueless
22:29:23  *-ca
22:29:28  oklopol: no the shitty board game.
22:29:30  because that's an awesome game
22:29:32  oh
22:30:14  i haven't played it, what do you actually do in it
22:30:25  oklopol: do you have a more serious discussion of this language
22:30:26  you roll dice, move your little piece across a huge square map
22:30:28  and go into rooms
22:30:32  augur: http://esolangs.org/wiki/Clue_%28oklopol%29/Quicksort http://esolangs.org/wiki/Clue_%28oklopol%29/SKI_calculus
22:30:33  ....that's pretty much the game.
22:30:34  or a reference to something related, but serious?
22:30:37  augur: I linked you to the examples for a reason.
22:30:38  augur: sorry, no.
22:30:54  oklopol: where is your inspiration for this coming from?
22:30:59  for clue?
22:31:01  oh it's apparently called cluedo outside the states.
22:31:02  CakeProphet, I always loved how half the game is moving pieces around a square grid.
22:31:10  Phantom_Hoover: yes that's my favorite part
22:31:17  and by favorite I mean the worst part about it.
22:31:20  oklopol: yes
22:31:23 * Phantom_Hoover wonders if you could camp by blocking a dor.
22:31:25  *door
22:31:36  augur: If you think it's not serious, then keep in mind that those programs actually work. :p
22:31:37  Phantom_Hoover: I don't think you can elect to not move.
22:31:39  it's the same inspiration that makes everyone come up with the basic idea of example-based computation.
22:31:43  it's an obvious idea
22:31:43  Phantom_Hoover: I think you have to use all of your moves in a turn
22:31:49  elliott: by more serious i mean publishable
22:31:53  Phantom_Hoover: but, I guess it's still possible.
22:31:55  CakeProphet, sure but doors have two blockable squares.
22:32:01  oklopol: i see. ok
22:32:01  Just move between the two.
22:32:07  augur: Sorry, I thought you asked "does anyone have any info about", not "does anyone haev any papers about".
22:32:19  elliott, epdort
22:32:29  i didnt know there was such a thing as example based programming
22:32:31  interesting
22:32:35  augur: but certainly not trying to make anything serious about it
22:32:38  who needs RSS when you have Sgeo.
22:33:10  augur: there isn't, because i'm the only one who has made it work to any extent. also that may not be true, but no one has corrected me yet.
22:33:20  :)
22:33:23  Someone in one of the Homestuck channel is keeping a log of all typos
22:33:59  of course while making it work, i made it lose most of its practical usefulness. that may not usually be desired.
22:34:12  Sgeo: a noble pursuit.
22:34:55  did i say most? i meant all of it.
22:36:00  oklopol: so you dont know of anyone else who's done this sort of thing
22:36:03  oklopol: that's the issue I'm having with my graph automata thing.
22:36:08  do you have source for the Clue compiler?
22:36:17  I can't devise 9 states that do anything practical.
22:36:18  augur: no. and yes, it's probably somewhere....
22:36:23  so maybe I should just... not make it practical.
22:36:25  yes that sounds good.
22:36:27  it's like the slowest thing in the universe
22:36:33  oklopol: can you accurately describe the process?
22:37:31  i'm pretty sure i can, but i don't really feel like doing that right now
22:37:37  (or anything really)
22:37:42  :\
22:37:43  ok
22:37:50  why u so interested all of a sudden?
22:40:01  well you don't really need to be able to answer, but anyhow what i can do is put the link back up
22:40:22  so you can technically find out more. assuming this is the newest version of the interpiler.
22:40:42  oklopol: does it still have the ugly <>s :(
22:40:59  no i think that's now always id
22:41:05  and omitted
22:41:24  i have a way better way to do conditionals, but it's yet to be implemented because i work on this like a day every two years
22:41:43  oklopol: well yeah that's the GENIUS CHANGE I made
22:41:48  just didn't know you merged it back in :P
22:41:48  what
22:41:54  oh
22:41:55  you said it wouldn't work like that
22:41:57  you mean making it id
22:41:57  and i did it
22:41:59  and it worked
22:41:59  yeah
22:42:01  and then you were like
22:42:02  elliott
22:42:05  you are the biggest genius
22:42:08  how can i ever repay you
22:42:09  humbly,
22:42:10  oklopol
22:42:17  huh.
22:42:27  big dude for big people.
22:42:30  well cool, i guess i could reduce your debt a bit.
22:42:39  what debt. oh that thing.
22:42:44  here i thought your ideas were really stupid
22:43:00  anyway the new way is so completely different that i won't even start to explain it
22:43:37  also i don't remember exactly what it is
22:44:34  9 different states might be too many.
22:44:36  on friday we talked about my colleague's new esolang for like half the workday
22:44:37  maybe 5 is good.
22:44:47  and the other half we played my newest game
22:45:37  but I need some way to connect subgraphs together...
22:45:51  CakeProphet: what
22:45:55  oklopol: which game
22:46:01  cp:s rant sounds interesting but i think i won't ask anyway
22:46:12  elliott: there's a few balls and a lot of cubes.
22:46:29  it's basically an fps, just for a game programming course, nothing particularly interesting
22:46:29  elliott: I'm working on a graph automata. Like a CA but with a graph instead of an discrete infinte 2d space of whatevers.
22:46:56  oklopol: i wanna play anyway but FIIIINE
22:47:05  you can when it's done
22:47:12 -!- SgeoN1 has quit (Quit: Bye).
22:47:16  unless we decide to try to sell it for laughs and giggles
22:47:22  I could: buy it.
22:47:27  (it's actually a lot of fun)
22:47:29  elliott: the basic idea so far is that the node states are numbers, and higher numbers take precedence over lower numbers with respect to figuring out which rules to apply.
22:48:15  you could. when it's done. or you can just have it for free if it's free. when it's done.
22:48:49  that's, basically all I've got, other than some ideas like "this node rotates all of its children so that they swap subgraphs" and "this node deletes child nodes that are even when its degree is odd, and odd children when its degree is even"
22:48:56  and other things that don't really fit together in any coherent way.
22:49:53  a rule is always applied to a single node at once?
22:49:59  argh i promised myself i wouldn't ask
22:50:10  I, guess? I'm not sure what you mean.
22:50:13  by "at once"
22:50:17  maybe i just won't listen, i'll fire questions and ignore you mwahaha
22:50:41  well you know how ca apply the rule everywhere, do you just have like a calculation of where the rule should be applied next and iterate this
22:50:52  no.
22:51:02  or do you apply to each node, and just order these in some way because the rules can change the graph itself
22:51:10  that one.
22:51:32  okay, this might be interesting, i'll take a look at the end product when you finish
22:51:38  ha,
22:51:43  ha ha. "finish"
22:52:19  the main issue I'm having is that I don't really know how you would program with such a thing.
22:52:36  but I guess, like most CA, it's kind of non-obvious.
22:52:58  also creating new nodes and attaching subgraphs together is kind of an open question.
22:53:49  if I go with 10 states (0-9) then I could have some numbers that connect together automatically, so "all 1s connect to all 9s, and vice versa"
22:53:57  or "all 5s connect to all other 5s"
22:55:08  but then how do I create nodes, I think I'd need a way to increment the state of a node.
22:55:20  haskell
22:55:58  so one rule could be "this state creates a new 0 node on some condition" and then have rules by which a node could change its state value.....
22:56:01  but......
22:56:07  that is a huge clusterfuck :P
22:57:24 -!- myndzi has joined.
22:57:25  hi coppro
22:57:28  but I want the rules to be somewhat simple, nothing involving paths or cycles or subgraph properties, so that it can compute steps efficiently.
22:57:53 -!- Darth_Cliche has joined.
23:00:08  for conditional rules I was thinking I could utilize number parity (do this for (even|odd) degree, or do that to all (even|odd) children) and maybe summation of child nodes (when the sum of all child nodes = X, do this)
23:01:44  graph rewriting would be so much easier :P  (for me, not the computer)
23:02:11  There are Reader Writer and State Monoids?
23:02:17 * Sgeo headaches
23:02:24  ?
23:03:02  oh no, not a binary operation with an identity element!
23:03:11 * CakeProphet mind blown
23:03:26  Sgeo: er, you are not misspelling "Monads"?
23:03:31  oerjan, I am not.
23:03:37  http://hackage.haskell.org/packages/archive/monoid-transformer/0.0.2/doc/html/Data-Monoid-State.html
23:03:49  Searched due to seeing a package in Synaptic
23:04:11  oh, cute
23:04:28  it does the moral equivalent of mappend <$> m <*> s
23:04:33  s/s/m'/
23:05:02  elliott: did you read the source code or was it obvious from the Monoid instance.
23:05:18  i read the monoid instance's code
23:05:47  ah, but it's still pretty obvious from the instance itself.
23:05:54  Monoid a => Monoid (T s a)
23:05:58  hmmm, wonder what that could do.
23:06:37  Doesn't tell you how it threads the state at all.
23:06:46  ah, yes.
23:07:00 -!- azaq23 has quit (Max SendQ exceeded).
23:07:04  I'm wondering why they used a new type.. and not just the original State monad?
23:07:26  also they used the name pure.....
23:07:51  to avoid the dependency on transformers or mtl?
23:07:56  and to avoid semantic confusion?
23:08:12 -!- azaq23 has joined.
23:08:25  too cautious..
23:08:50  hm but isn't _every_ Monad a Monoid under a similar interpretation.
23:09:08  oerjan: no, because there's no /binding/
23:09:11  it's more like an applicative
23:09:22  only the state is threaded
23:09:28  you can't thread the result
23:09:36  oh
23:09:45  i think you can /maybe/ define a monoid for every monad like that?
23:09:47  dunno
23:09:58  mappend <$> m <*> s, you said
23:10:04  a Monoid for every Functor, perhaps?
23:10:07  moral equivalent of, I said
23:10:09  CakeProphet: definitely not.
23:10:27  return mempty
23:10:43  or indeed, for every _applicative_
23:10:53  oerjan: that's what i was conjecturing.
23:11:28  mappend <$> pure mempty <*> x = mappend mempty <$> x = x
23:11:45  ah.
23:11:54  mappend <$> x <*> pure mempty = flip mappend (pure empty) <$> x = x
23:12:01  er
23:12:11  *mappend <$> x <*> pure mempty = flip mappend mempty <$> x = x
23:13:52  mappend <$> x <*> (mappend <$> y <*> z) = (\a b c -> mappend a (mappend b c)) <$> x <*> y <*> z = mappend (mappend a b) c <$> x <*> y <*> z = mappend <$> (mappend <$> x <*> y) <*> z
23:14:05  all pretty standard Applicative laws, i think
23:14:18  er
23:14:21 -!- elliott has quit (Read error: Connection reset by peer).
23:14:41  *= (\a b c -> mappend (mappend a b) c <$> x <*> y <*> z =
23:14:52 -!- elliott has joined.
23:14:53  *+)
23:15:44  in fact it would seem that an Applicative can lift any algebraic structure
23:16:48  oerjan: hmmm, CharParser Monoid could be useful perhaps?
23:17:15  er Parser monoid actually.
23:17:47  perhaps
23:19:11  I don't remember how Parsec combines tokens together by default.
23:19:20  *results of parsing tokens
23:21:30  that depends on how you combine the _parsers_ together, in precisely the same way as any other monad or applicative.
23:21:44  right
23:22:08  so I think a monoid would have the effect of combining two results into one?
23:22:41  x `mappend` y = mappend <$> x <*> y, is what we are going by above
23:24:09  also, this requires the result types to belong to a monoid.
23:24:18  right.
23:26:01  so yeah that's my guess on what a Parsec Monoid instance would do.
23:27:32  match both parsers in sequence (I think), concat the results together (for Strings), while threading the state.
23:32:33 -!- pagnol has joined.
23:33:16 -!- ais523 has quit (Ping timeout: 240 seconds).
23:45:04  Sgeo: ehplideot
23:45:20  CakeProphet, liar
23:45:26  Sgeo: are you sure?
23:45:39  Yes
23:45:44  ha
23:45:44  ha
23:45:46  haha
23:45:47  hahaha
23:45:50  hahahahaha
23:46:29  ehplideot
23:48:13  `words 50
23:48:15  `word 50
23:48:15  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: words: not found
23:48:18  oballipa tonimellizzemativatynataguthouslere frupion boeuriarefrurinsatiscon atoachalluybiltissit jickenticeladals mhi fellantanx eudolacyl furnminfifinte alceptem mim gwe ithothum lyhsensiann zii enferite oldt tant zinatomptcriersodebity edes nlich viguenfel blacutheinguabeishititraupossed diforts whiared sidcux shanizurlijau re plaare midocium brourionsoyatengentitn ntenodia chassinchasstheaderce incia le se becorrats
23:49:16  so many giant words.
23:52:23  `logs fix.*scanl.*ha
23:52:25  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: logs: not found
23:52:29  `log fix.*scanl.*ha
23:52:48 * CakeProphet waits.
23:52:53  > scanl (+) 1 [1,1..]
23:52:54    [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,28...
23:52:55  2011-11-19.txt:23:52:29:  `log fix.*scanl.*ha
23:52:59  ASSHOLE
23:53:25  fibs = fix (("ha. ":) . scanl (++) "ha.")
23:53:28  > fix (("ha. ":) . scanl (++) "ha.")
23:53:30    ["ha. ","ha.","ha.ha. ","ha.ha. ha.","ha.ha. ha.ha.ha. ","ha.ha. ha.ha.ha. ...
23:53:38  > fix (("ha. ":) . scanl (++) "ha. ")
23:53:40    ["ha. ","ha. ","ha. ha. ","ha. ha. ha. ","ha. ha. ha. ha. ha. ","ha. ha. ha...
23:54:07  > scanl (+) 1 [1..]
23:54:08    [1,2,4,7,11,16,22,29,37,46,56,67,79,92,106,121,137,154,172,191,211,232,254,...
23:54:27  > var . unlines $ fix (("ha. ":) . scanl (++) "ha. ")
23:54:29    ha.
23:54:29   ha.
23:54:29   ha. ha.
23:54:29   ha. ha. ha.
23:54:30   ha. ha. ha. ha. ha.
23:54:32   ha. ha. ha. ha. h...
23:54:36  :)
23:56:53 * CakeProphet should perhaps be banned from using var ever again.
23:57:41  maybe if go over to #haskell to do it someone will get the gumption to fix lambdabot.
23:57:46  +I
23:57:51  after they ban me.
23:58:25  I think I'll go do that.

2011-11-20:

00:00:27  :t var
00:00:28  forall a. String -> Sym a
00:00:34  shachaf: mission accomplished.
00:00:51  CakeProphet: Hmm?
00:00:52  > var . unlines . show $ [1..]
00:00:53    Couldn't match expected type `[GHC.Types.Char]'
00:00:53          against inferred ty...
00:00:58  Does it cut it off by number of character or number of lines?
00:01:00  CakeProphet did you do it
00:01:03  Sgeo doesn't get unlines
00:01:04  monqy: yes
00:01:08  :t unlines
00:01:09  [String] -> String
00:01:22  its like lines but un-
00:01:23  has haskell said anything
00:01:25  > var . unlines . map pure $ "abcdefghijklmn"
00:01:27    a
00:01:27   b
00:01:27   c
00:01:27   d
00:01:27   e
00:01:28  monqy: I left
00:01:29  [9 @more lines]
00:01:41  Hah. Not so spammable now, is it?
00:01:49  > var . unlines . map show $ [1..]
00:01:51    1
00:01:51   2
00:01:51   3
00:01:51   4
00:01:51   5
00:01:53  [17 @more lines]
00:01:55  shachaf: that's 4 too many lines of spam
00:02:05  lambdabot has other commands that output more than one line.
00:02:07  @djinn-env
00:02:07  data () = ()
00:02:08  data Either a b = Left a | Right b
00:02:08  data Maybe a = Nothing | Just a
00:02:08  data Bool = False | True
00:02:08  data Void
00:02:09  type Not x = x -> Void
00:02:11  class Monad m where return :: a -> m a; (>>=) :: m a -> (a -> m b) -> m b
00:02:13  class Eq a where (==) :: a -> a -> Bool
00:02:15  data Thrice f x = Thrice (f (f (f x)))
00:02:19  shachaf: yes but none of those commands allow arbitrary strings.
00:02:19  data O a b x = O (a (b x))
00:02:21  data Tri f a = Tri (f a) (f a) (f a)
00:02:23  Plugin `djinn' failed with: thread killed
00:02:35  shachaf: THERE'S TOTALLY A DIFFERENCE OKAY
00:02:45  @djinn a -> a
00:02:46  f a = a
00:02:56  CakeProphet: lambdabot just assumes that you'll be nice.
00:02:58  Ok, so djinn thread dying != dkinn dead
00:03:08  CakeProphet: You can also get @admin-ed trivially.
00:03:16  @admin
00:03:17  Not enough privileges
00:03:31  shachaf: yes I know of that one.
00:03:40 * Sgeo doesn't
00:03:43  #haskell was way too spammy as it is.
00:03:49  just from the few seconds I was there.
00:04:07  CakeProphet: You came in in the mdidle of a game of golf, I think.
00:04:40  sounds fun.
00:04:43  elliott elliott elliott
00:04:52  hi shachaf
00:04:53  It's a pretty good nick to type.
00:04:59  Not as good as geheimdienst, though.
00:05:05  > unwords $ fix (("elliott ":) . scanl (++) "elliott ")
00:05:07    "elliott  elliott  elliott elliott  elliott elliott elliott  elliott elliot...
00:05:53 * Sgeo still needs to wrap his mind around folds and scans and unfolds
00:06:02  fold is easy.
00:06:09  Sgeo:
00:06:09  scan is also easy
00:06:11  > foldr f z [a,b,c,d]
00:06:12    f a (f b (f c (f d z)))
00:06:13  An unfold's just a way to make a list around an arbitrary function, right?
00:06:15  > foldl f z [a,b,c,d]
00:06:16    f (f (f (f z a) b) c) d
00:06:23  > foldl1 f [a,b,c,d]
00:06:24    f (f (f a b) c) d
00:06:28  HTH.
00:06:40  foldr f z is just s/(:)/f/, s/[]/z/.
00:06:59  elliott, ooh, that's a nice way of thinking about it
00:06:59  unfoldr is annoying.
00:07:10  Just pretend unfolds don't exist.
00:07:12  They're ugly.
00:07:13  :t unfoldr
00:07:14  Also nobody ever uses them.
00:07:14  forall b a. (b -> Maybe (a, b)) -> b -> [a]
00:07:22  But what they do is pretty obvious.
00:07:26  !c printf("%d %d\n",9<<16,9<<16-1)
00:07:31  589824 294912
00:07:32  Return Nothing, ends the list. Return Just (a,b), a gets added to the list and we start again with b.
00:07:36  elliott: All I said was that it was annoying.
00:07:38  Whoopsie poopsie.
00:07:45  shachaf: So?
00:07:49  Gregor: lol
00:07:53  > unfoldr (\i -> Just (negate i, negate i)) 1
00:07:54    [-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...
00:07:55  Gregor how big should my pools be.
00:08:03  `run echo "test" > /dev/audio
00:08:07  > unfoldr (\i -> Just (i, negate i)) 1
00:08:08    [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...
00:08:08  bash: /dev/audio: Permission denied
00:08:09  :t unfoldl
00:08:10  Not in scope: `unfoldl'
00:08:10  Hmm, what if unfoldr's function returned a list instead of a Maybe?
00:08:13  :t unfoldr
00:08:14  > unfoldr (Just <$> id <*> succ) 0
00:08:14  forall b a. (b -> Maybe (a, b)) -> b -> [a]
00:08:15    Couldn't match expected type `a1 -> Data.Maybe.Maybe (a, b)'
00:08:15          agains...
00:08:18  > unfoldr (Just <$> id <*> succ) 0
00:08:19    Couldn't match expected type `a1 -> Data.Maybe.Maybe (a, b)'
00:08:19          agains...
00:08:21  It would be sort of like concatMap.
00:08:23  permission denied? I can't fathom why.
00:08:26  Except not a lot like concatMap.
00:08:28  > unfoldr (Just <$> ((,) <$> id <*> succ)) 0
00:08:29    [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,...
00:08:44  > unfoldr (fmap Just $ liftA2 (,) id succ) minBound
00:08:45    [(),*Exception: Prelude.Enum.().succ: bad argument
00:08:51  > unfoldr (fmap Just $ liftA2 (,) id succ) minBound :: [Word8]
00:08:52    [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,...
00:09:00  WOW INCREDIBLE
00:09:07  unfodlr, SO POWREFUL
00:09:09  shachaf: Would that make any sense?
00:09:17 * Gregor reappears
00:09:20  shachaf: What would [(1,x),(2,y)] mean? the x is pointless.
00:09:22   Gregor how big should my pools be.
00:09:27  elliott: Depends, what for :P
00:09:29  elliott: Well, it could make a sort of tree.
00:09:32  shachaf: You'd want a list where [] takes a value of a different type
00:09:38  Or it could concatenate the lists.
00:09:44  elliott: I found with GGGGC that so long as you can handle multiple pools well, getting more than a few megs doesn't help you much. Mine are 16MB.
00:09:49  Gregor: @ :P
00:09:52 * shachaf hasn't thought it through. That's what you people are for.
00:10:00  Gregor: 16 megs isn't practical, since there could be literally millions of these.
00:10:01  elliott: I am disappoint. liftA2 (,) ?
00:10:09  Gregor: Well, I suppose it'd WORK.
00:10:16  Gregor: But I'd rather stay smaller to start with :P
00:10:18  monqy: perl has concatmap
00:10:23  I think I'm going to end with variably-sized pools anyway.
00:10:24  monqy: what now?
00:10:27  copumpkin: Yes, what of it?
00:10:29  :t Just . (id &&& succ)
00:10:30  forall b. (Enum b) => b -> Maybe (b, b)
00:10:33  Applicative style was getting noisy there :P
00:10:36  copumpkin: I don't like arrows, maaaaan.
00:10:45  CakeProphet: hi
00:10:46  that operator is so much bigger than arrows
00:10:48  monqy: hi
00:10:52  it shouldn't be in Control.Arrow
00:11:01  copumpkin: Yes, but while it is, I won't use it :)
00:11:10  pfft
00:11:17  copumpkin: It's in one of Kmett's thousand packages, I think bifunctors, but it has different strictness properties.
00:11:19  !perl print map {$_, $_+1} (1..5)
00:11:20  then how about
00:11:20  1223344556
00:11:41  :t (Just . fmap succ) :: a -> Maybe (a, a)
00:11:42      Occurs check: cannot construct the infinite type: a = (a, a)
00:11:43      In the expression: (Just . fmap succ) :: a -> Maybe (a, a)
00:11:44  gah
00:11:47  I fail
00:11:50  :(
00:11:55  !perl print map {$_-1, $_, $_+1, $_*2} (1..5)
00:11:55  012212342346345845610
00:12:04  :t (Just . fmap succ . join (,)) :: a -> Maybe (a, a)
00:12:05      Could not deduce (Enum a) from the context ()
00:12:05        arising from a use of `succ' at :1:13-16
00:12:06      Possible fix:
00:12:14  :t (Just . fmap succ . join (,)) :: Enum a => a -> Maybe (a, a)
00:12:16  forall a. (Enum a) => a -> Maybe (a, a)
00:12:19  fuck you, haskell
00:12:22 -!- GreaseMonkey has joined.
00:12:26  monqy: did I mention that perl has concatmap?
00:12:33  because it does.
00:12:33  i think so
00:12:33  hi
00:13:47  GreaseMonkey: hi  monqy: hi  CakeProphet: hi
00:14:01  > var "hi"
00:14:02    hi
00:14:09 -!- Gregor has set topic: The IOCCC is back on! http://www.ioccc.org | Even a chipmunk can learn these cat training techniques | http://codu.org/logs/_esoteric/.
00:14:11  :t concatMap
00:14:12  forall a b. (a -> [b]) -> [a] -> [b]
00:14:26  Sgeo: >>= for lists
00:14:29  Gregor: YOU RUINED THE SPAM
00:14:41  CakeProphet: It does?
00:14:49  shachaf: yes. I use it above
00:15:14  CakeProphet: That's not concatMap.
00:15:20  sure it is
00:15:30  shachaf: It is, actually.
00:15:44  :t (=<<)
00:15:45 -!- Gregor has set topic: The IOCCC is back on! http://www.ioccc.org | Even elliott can learn these cat training techniques | http://codu.org/logs/_esoteric/.
00:15:45  forall a (m :: * -> *) b. (Monad m) => (a -> m b) -> m a -> m b
00:15:55  elliott: No, it won't turn a triply-nested list into a double-nested list, will it?
00:16:09  shachaf: Yes, but only because N-nested lists == 0-nested lists in Perl.
00:16:09  s/le/ly/
00:16:19  Gregor: Acceptable.
00:16:19  Right. So it's hardly concatMap.
00:16:35  It operates on a type with completely different semantics, for one.
00:16:36  shachaf: If you can do "foo (\a -> [a,a+1,a+2])" and it does the obvious, I think it's concatMap.
00:17:00  !perl print map {1} [[1,2,3], [4,5,6]]
00:17:00  1
00:17:04  Is shachaf criticising the Perl version of a function, or what?
00:17:04  >_>
00:17:17  Sgeo: The Perl function is fine! It's just not concatMap.
00:17:34 * Sgeo thought you were referring to >>= at first
00:17:41  (>>=) = flip concatMap.
00:17:51  !perl print map {print} [[1,2,3], [4,5,6]]
00:17:51  ARRAY(0x7f5b2609bb70)1
00:17:55  ah
00:17:57  elliott, Yes, thank you, I'm aware
00:18:05  You might as well call a C function that operates on NULL pointers "concatMap", because Just Nothing ~ Nothing, and who cares that it's a one-element list?
00:18:06  You're very welcome.
00:18:11  !perl print map {$_} [[1,2,3], [4,5,6]]
00:18:12  ARRAY(0x7f895b267b78)
00:18:14  shachaf++
00:18:20  I would totally do that.
00:18:37  !perl print map {@$_} [[1,2,3], [4,5,6]]
00:18:38  ARRAY(0x7f03e3258d48)ARRAY(0x7f03e3276b28)
00:18:58 * Sgeo laughs at Perl's broken Show instances (Yes, I know that's not what's going on)
00:19:11  perl is just bad at nested lists :P
00:19:21  bad at showing them anyway
00:19:54  anyway I'm actually kind of confused...
00:19:54  I like how Sgeo constantly clarifies that he's not stupid.
00:20:05  !perl print map {@$_} ([1,2,3], [4,5,6])
00:20:06  123456
00:20:17  elliott: I would sometimes but it gets exhausting.
00:20:38  I'm pretty sure some joke I've said has been misinterpreted as stupidity before
00:21:07  shachaf: does that count? :P
00:21:09  elliott, hi
00:21:22  Vorpal: helo
00:21:37  elliott, is it normal for horses to have glowing (to the point of being noticeable in daylight) red eyes?
00:21:37  CakeProphet: I don't think asking me that question is strictly necessary to figure out what my answer would be.
00:21:50  Um.
00:21:52  shachaf: so "yes"  :P
00:22:08  Not quite.
00:22:11  Sgeo: and when i do something stupid, people think it's a joke. sucks to be you i guess.
00:22:12  Vorpal: Check whether you're in the underworld or not.
00:22:34  elliott: well, Sweden is kind of like the underworld right?
00:22:41  CakeProphet: Similar, but not quite.
00:22:43  maybe that's just what Swedish horses are like.
00:22:48  The underworld is less hellish.
00:22:52  elliott, right.
00:22:55  And the temperatures are more humane.
00:22:56  elliott, nope.
00:23:02  elliott, let me upload a photo
00:23:59  :t Just . runState $ modify succ
00:24:00  forall s. (Enum s) => Maybe (s -> ((), s))
00:24:06  oops
00:24:12  shachaf: it's the same thing, you just have to do the awkward dance that Perl makes you do to get nested lists of any sort.
00:24:33  :t Just . (runState $ modify succ)
00:24:34  forall s. (Enum s) => s -> Maybe ((), s)
00:24:42  oh darn
00:24:51  Why am I spending my time arguing about Perl?
00:24:59 * oerjan sics zzo38 at modify
00:25:05  shachaf: BECAUSE IT'S IMPORTANT SHIT MAN
00:25:14  life changing consequences.
00:25:27  elliott, here: http://i.imgur.com/BgF7p.jpg
00:25:32  also it's not an argument until we're both Hitler.
00:25:41  elliott, I took this just across the road
00:25:44  Vorpal: Perfectly ordinary for Sweden.
00:25:53  Vorpal: As is the shockingly low texture resoution.
00:25:56 -!- pagnol has quit (Ping timeout: 252 seconds).
00:25:57  elliott, ah, nothing to worry about then?
00:25:59  And shiny rocks.
00:26:29  elliott, yes, it is probably gneiss or something?
00:26:37  Probably just red-eye effect.
00:26:51  Jafet, hm pretty sure I had the flash off
00:27:13  Vorpal: No, I think you just get children to polish them?
00:27:20  those are some very gneiss rocks
00:27:32  elliott, oh perhaps. Yeah since we can't kill them we have to do /something/.
00:27:54  Have you considered building an army of pregnant people and children.
00:28:23  elliott: I certainly have.
00:28:27  it's on my to-do list.
00:28:35  elliott, nah, too expensive. What with us reducing the defence budget every year. I think it must be some weird sort of counterbalance to the US defence budget
00:28:47  Vorpal: Do you even need an army?
00:28:52  elliott, hey, shiny rocks are *my* shtick.
00:29:12  I'm trying to think of why anyone would want Sweden and I'm coming up blank.
00:29:28  elliott, to control... um...
00:29:28  sexy Swedish chicks.
00:29:35  elliott, terrorists that mistook us for Denmark?
00:29:55 -!- MSleep has changed nick to MDude.
00:29:58  CakeProphet, your BDSM fantasies are not enough of a justification for invasion.
00:30:12  http://trauskeneventyr.blogspot.com/2010/07/grimsborken.html particularly the last one
00:30:31  elliott, btw I turned self-shadowing trees on in the .ini file, it improved the realism quite a bit.
00:30:47  Phantom_Hoover: you know nothing about being a king.
00:31:31  oerjan, ?
00:31:43  Added registers to my dc :)
00:31:46  CakeProphet, I know that declaring wars on people because their women are sexy is not an especially good way of continuing to be a king.
00:31:57  oerjan, why should I read a very very long Norwegian text?
00:32:03  Phantom_Hoover: why so serious?
00:32:09  It has worked very well for many kings in the past.
00:32:16  CakeProphet, please don't put a smile on that face.
00:32:18  Gregor, btw did that JIT idea work out?
00:32:46  Jafet, yeah, but they tended to *balance* the sexy women against the size of the army guarding them.
00:33:04  Vorpal: no, just the pictures
00:33:17  Vorpal: Yeah, but it took a couple days to make it work :P
00:33:21  Gmail why does your planets theme have pictures of the sun.
00:33:25  Gregor, so how does it work?
00:33:41  oerjan: Can you tell me exactly how you mean by "sics zzo38 at modify"? Were you trying to question me or something like that?
00:33:46  Vorpal: I'll describe in PM
00:33:49  anyway, who *did* recognize that horse? Hint: Oblivion players please stand up.
00:33:59  Gregor, okay.
00:34:12  someone else other than oerjan: Do you have the moustache like Hitler has, even though you are not Hitler?
00:34:41  zzo38, why aren't you asking oerjan ?
00:34:44  Vorpal, did you really play as /yourself/.
00:34:44   CakeProphet, I know that declaring wars on people because their women are sexy is not an especially good way of continuing to be a king.
00:34:50  Have you ever even played Dwarf Fortress?
00:34:51  Phantom_Hoover, ?
00:35:01  elliott, um dude their women don't even have beards.
00:35:08  Phantom_Hoover: Point.
00:35:22  Vorpal: Because I asked oerjan different question. But they can answer anyways if they want to, since it is IRC and anyone can question/answer anything if it is public channel.
00:35:22  (Female dorfs don't actually have beards in game, but everybody thinks they do.)
00:35:32  Vorpal: because i've already told i'm clean shaven
00:35:39  oerjan: SHUT UP DIJKSTRA
00:35:57   Vorpal, did you really play as /yourself/. <-- what do you mean?
00:36:00  zzo38: i just tried to do a haskell trick which would have worked if modify had the type you suggested it should have once
00:36:03  In Skyrim.
00:36:07  oerjan: BEHOLD YOU: http://www.knowledgerush.com/wiki_image/0/0a/Edsger_Dijkstra_large.jpg
00:36:24  Did you attempt to accurately recreate Arvid Norlander of wherever the hell it is you are from.
00:36:29  Phantom_Hoover, eh? Yes I'm a magician that ride a red eyed horse in real life?
00:36:36  oerjan: O, that is what you meant. In that case I agree.
00:36:39  I mean in terms of appearance etc.
00:37:14   Gmail why does your planets theme have pictures of the sun. <-- well the ancients considered the sun a planet, i think
00:37:19  Phantom_Hoover, not really, I went with standard nord and added a beard. Then I tried to think of a typical nord name and I realised my name fitted right in there,
00:37:25  s/,/./
00:37:28  Gmail: written by the ancients.
00:37:56  The reason the planets theme have pictures of the sun is that the planets have to go around the sun. If there is no sun, what will the planets orbit around?
00:38:08  zzo38: THEMSELVES
00:38:34  The reason the cute animals collection includes pictures of intestines is that cute animals have to have intestines.
00:38:47  zzo38: The Earth.
00:38:55  Which, of course, is not a planet.
00:38:58  Phantom_Hoover, I guess I can upload a screenshot of myself as I'm currently playing. Hm that looks kind of like assassin of the north or something. Thieves guild armour.
00:39:04  The other possibility is the use of the word "planet" in the old way instead of the new way (the old way is still used in astrology)
00:39:19  elliott: that picture is so very almost but not quite unlike me
00:39:22  Phantom_Hoover: But surely intestines must be inside so that you cannot see it from outside, isn't it?
00:39:24  oerjan: ITV IS YOU SHUT UP!!
00:39:26  <
00:39:44  zzo38, you can't exactly see the sun in most pictures of planets either.
00:40:13  the part that fits is i'm pale skinned
00:40:15  Phantom_Hoover, upload going to take a while
00:40:29  pikhq_: Of course Earth is planet! You can put everything orbiting the Earth if you want to, but then, the orbit will be more complicated. That is why you have to orbit the Sun, to simplify the orbiting.
00:41:11  Phantom_Hoover: Then it must be either because they use the older word "planet" or because they don't have enough planets so they have to include the sun as well.
00:41:48  pikhq_: HOW BIG SHOULD MY POOLS BE
00:42:03  zzo38: I say, son, that was a joke son!
00:42:10   zzo38, you can't exactly see the sun in most pictures of planets either. <-- what about in an image of mercury? It should be fairly big that close to the sun
00:42:26  err typoed that
00:42:34  `addquote  The reason the cute animals collection includes pictures of intestines is that cute animals have to have intestines.
00:42:34  err no
00:42:36  725)  The reason the cute animals collection includes pictures of intestines is that cute animals have to have intestines.
00:42:42  elliott: Let's go with a nice constant... 1024 pages?
00:42:54  pikhq_: ...4 gig heaps?
00:42:58  s/heaps/pools/
00:42:59  (probably actually not that good an idea)
00:43:07  Gregor said 16 megs :P
00:43:12  elliott, 2500000l!
00:43:21  elliott, Phantom_Hoover https://imgur.com/zZSHR and https://imgur.com/u4OYh
00:43:22  I'm trying to figure out how much I'll lose with 16 megs + 4 unused megs pools.
00:43:26  elliott: What page size are you thinking of, anyways?
00:43:26  Lose in terms of the unused space, that is.
00:43:35  pikhq_: No reason to go below 4 megs, is there?
00:43:51  This channel really ought to stop talking when I'm not around.
00:43:53  elliott: you should have a pool big enough to swim in, but not big enough to get lost
00:43:53  More granularity, and there is nothing restricting you to a single page size on x86_64.
00:43:54  Vorpal, so you look like an assassin of the North in that there is nothing remotely Northern about you?
00:43:58  Otherwise there's too much backlog.
00:44:00  hth
00:44:03  Phantom_Hoover, well I'm playing a nord?
00:44:07  pikhq_: I don't see the advantage of granularit.
00:44:09  y.
00:44:18  Phantom_Hoover, but yeah
00:44:31  Phantom_Hoover, can't say I don't look like a ninja though.
00:44:47  Yes.
00:44:49  Yes, you can.
00:44:50  Ninjas do not, to my mind, conjure images of the frigid northlands.
00:44:56  Phantom_Hoover, true
00:45:09  Phantom_Hoover, I guess I could fetch a horned helmet from somewhere and take a new screenshot. Though that is not authentic nordic at all
00:45:12  what's good reading material about Haskell and low-level implementation.
00:45:13  elliott: You can't think of *any* time that 2 megabytes would be too big?
00:45:25  pikhq_: I said 4.
00:45:30  elliott: You can't have 4.
00:45:36  Vorpal, I'm going to stop you here and tell you that I already know that Viking helmets didn't have horns.
00:45:36  CakeProphet: /implementation of fp languages/, spj?
00:45:51  elliott: The page sizes are 4 KiB, 2 MiB, and 1 GiB.
00:45:56   (probably actually not that good an idea) // typically pools aren't very large, you just have a lot of them.
00:45:58  basically "how pure functional languages are efficiently implemented"
00:46:03 * Phantom_Hoover → sleep
00:46:06 -!- Phantom_Hoover has quit (Quit: Leaving).
00:46:25  CakeProphet: yes.
00:46:29  pikhq_, iirc the linux kernel uses 1 GiB hugepages internally to map all the physical ram in the computer
00:46:31  http://research.microsoft.com/en-us/um/people/simonpj/papers/slpj-book-1987/
00:46:32  free
00:46:37  Vorpal: Quite plausibly.
00:46:44  elliott: That's a bit old, though.
00:46:50  shachaf: CakeProphet is old.
00:46:51  Vorpal: The less TLB use, the better.
00:46:52  Or something.
00:46:55  pikhq_, quite
00:46:56  pikhq_: I thought the 2 Mio one doubled if you did something.
00:47:06  1 gig pages don't really work for me.
00:47:06  Heyo, just broke virtually every platform with the power of conditionals.
00:47:10  CakeProphet: http://www.scs.stanford.edu/11au-cs240h/notes/ghc-slides.html#(1) has a bunch of introductory slides and links to various papers.
00:47:10  elliott: If you pretend it doubles. :P
00:47:15  "The big arrows, at the top left and right of each page, move backward and forward one page."
00:47:18  wow thanks Simon
00:47:24  CakeProphet: also the ghc compiler commentary, i imagine
00:47:27  CakeProphet: Dude, http://research.microsoft.com/en-us/um/people/simonpj/papers/slpj-book-1987/slpj-book-1987.pdf.
00:47:28   Heyo, just broke virtually every platform with the power of conditionals. <-- hm?
00:47:37  In much older times they did not call the Earth a planet.
00:47:41  CakeProphet: In particular I've seen _Implementing lazy functional languages on stock hardware: the Spinesless Tagless G-Machine_ recommended.
00:47:50  CakeProphet: Also _How to Make a Fast Curry_
00:48:26  zzo38: technically in newer times, I suppose.
00:48:28 -!- hagb4rd has quit (Ping timeout: 240 seconds).
00:48:39  wrt to viking helmets having/not having horns, is that an example where both something _and_ its opposite is a meme...
00:48:59  oerjan, is there a meme here?
00:49:25  pikhq_: Anyway, no, I don't see where 2 megs would be too big.
00:49:28  anyway I believe there are horned iron helmets in skyrim. I generally have way better armour though.
00:49:35  at the current point in the game I mean
00:49:46  pikhq_: Although I could actually use 1 Gio pages, to store huge pools.
00:51:01  Vorpal: note that "meme" does not _actually_ mean internet fad, despite appearances.
00:51:11  elliott: why did you link me to the same thing twice?
00:51:18  CakeProphet: I didn't.
00:51:25  viking helmet having horns is obviously a meme from at least the 19th century
00:51:28  oerjan, oh right
00:51:42  elliott: So, you're perfectly happy with 2 megs being the minimum contiguous allocation, and everything doing smaller allocations being piled on top of that?
00:51:55  pikhq_: Yeah, because allocations have a 1:1 mapping with pages?
00:52:09  viking helmets _not_ having horns keeps being brought up by pedants as a response to the first one
00:52:12  Physical memory allocations do.
00:52:16  And with 2 megs being the minimum boundary for *any* page munging?
00:52:27  pikhq_: I don't see the problem *shrugs*
00:52:32  Real Programmers use 16GB pages.
00:52:53  shachaf, does x86 support that?
00:52:56  oerjan: but everyone knows that viking helmets actuallly did have hrosn
00:53:17  CakeProphet: yeah they just horribly misspell it as horns
00:53:34  viking hrosn
00:53:36  Vorpal: I don't think so, but I think PowerPC does.
00:53:37  hrosn is _so_ plausibly a norse word
00:53:47  Let's say you're COWing a 4k object. Do you want to get a page fault happening (and thus a copy) when the one or two 4k pages that's on get written to, or do you want it happening when the one or two 2m pages that's on get written to?
00:53:56  shachaf, ah
00:54:06  pikhq_: your mom is a 4k object oooooooooh
00:54:20  Vorpal: Apparently you can get 1GB pages, though.
00:54:47  pikhq_: I'm pretty sure it's faster to copy 4k than to COW it.
00:55:05  pikhq_: In fact, I bet 2 megabytes is damn close to the sweet spot where COW gets better than an optimised copy routine.
00:55:06  Okay, contrived example. *Still*.
00:55:08  COWing your mom persists long into the night.
00:55:35  Seriously though, I don't see any problem yet at all :P
00:55:44  CakeProphet: what BULL
00:56:14  You see no problem *at all* with only being able to change virtual memory at 2MB boundaries. When ideally you'd be able to change it at 1B boundaries.
00:56:43  Oh, and by the way, it takes hardly any effort to support multiple page sizes.
00:56:49  pikhq_: Oh stop saying "do you *really* not see any problem?!?!" and give me an example of an actual issue :P
00:56:49  oerjan: ..
00:57:31  elliott: do you *really* not see the actual issue?
00:57:47  CakeProphet: i'm just HORSing around
00:57:53  1?!
00:58:17  1!!
00:58:43  @src lines
00:58:44  Source not found. My brain just exploded
00:58:57  @src unlines
00:58:57  unlines = concatMap (++ "\n")
00:59:10  @src unlineso_0
00:59:10  Source not found.
00:59:36  lines is presumably rather larger
00:59:55  @src intercalate
00:59:56  intercalate xs xss = concat (intersperse xs xss)
01:00:03  @src intersperse
01:00:03  intersperse _   []     = []
01:00:03  intersperse _   [x]    = [x]
01:00:04  intersperse sep (x:xs) = x : sep : intersperse sep xs
01:00:18  Hmm. Trying to think of some things that are inherently on a page boundary.
01:00:24  Mostly I'm thinking of mmap...
01:00:27  pages
01:00:29  >_>
01:00:38  inherently are on page boundaries.
01:00:40  is that helpful?
01:00:54  CakeProphet: No, it's about as helpful as remarking that 2+2=4
01:01:10  > 2 + 2 == 4
01:01:11    True
01:01:15  but it totally is!
01:01:28  pikhq_: mmap doesn't really apply :P
01:01:52  http://www.haskell.org/ghc/docs/latest/html/libraries/base-4.4.1.0/src/Data-List.html#lines
01:02:31  elliott: mmap is more the "Swiss army knife of memory" in common UNIXes than just "I want to map the file into memory"
01:02:32  oerjan: beautiful code
01:02:43  pikhq_: Yep, and @ isn't a common Unix.
01:02:53  elliott: Wait, @ isn't going to be UNIX, is it?
01:03:03  ,,duh :P
01:03:06  Hell naw. That Jurassic Park character has no chance.
01:03:12  @ is pro-dinosaur.
01:03:22  elliott: Hmm. And page permissions are much less relevant...
01:03:26  You should still get that file manager workijg
01:03:34  file manager haha
01:03:35  Even though @ probably won't have files as we know them?
01:03:35  Sgeo: What.
01:03:46  pikhq_: Try "completely irrelevant", most likely :P
01:04:01  Get a file manager working on a new OS that doesn't have files.
01:04:18  Sgeo: What file manager.
01:04:28  The thingy in Jurrasic Park
01:04:28  iirc
01:04:38  Oh.
01:04:43  elliott: @ isn't going to have a 3D file browser? :-(
01:04:54  shachaf: Better: 3D VALUE browser!
01:05:00  file browsers can go to hell
01:05:02  shachaf: Inspect constructors! Build up thunks!
01:05:07  FORCE THEM TO COLLAPSE INTO VALUES
01:05:09  EXCUSE *ME*!
01:05:24  elliott: rewrite them indsicriminantly? :(
01:05:25 * shachaf goes back to Windows Explorer.
01:05:34  @ supports mutation everywhere.
01:06:04  The nice thing about forcing thunks is that it's mutation that doesn't change the value.
01:06:05  x = x;
01:06:09 -!- azaq23 has quit (Quit: Leaving.).
01:06:18  This is why I call evaluation "Objectivist mutation".
01:06:21  (I don't actually do that.)
01:06:33  oh good i was scared there for a momen
01:06:33  t
01:06:41  Is that a behavior that can be relied upon?
01:06:47  Sgeo: Eh?
01:06:52  Sgeo: see: Haskell
01:07:00  elliott, Forced thunks staying forced
01:07:08  Sgeo: In what?
01:07:09  @? GHC?
01:07:09  Plugin `compose' failed with: Unknown command: ""
01:07:18  Haskell, non-specific to GHC
01:07:38  Haskell has no notion of "thunks".
01:07:50  Basically, whether the pure memoization stuff is portable
01:07:51  Nor "forcing".
01:08:01  It is perfectly legitimate to implement Haskell as string rewriting.
01:08:12  in Perl.
01:08:22  I believe there is a 3D gopher browser exists, in case some people prefer that way. And you probably need some way to access file systems even if the operating system has no files (it can be command-line, GUI, or something different), to operate with other system using files. Such as, FTP, and Plan 9, and so on
01:08:44  the perl interpreter compiles your Haskell functions to regex and then uses them to make substitions on other source code.
01:08:44  elliott: Hey, hey, hey. Legitimate as in "valid according to the Report" or legitimate as in "legitimate"?
01:08:58  shachaf: Legitimate as in "legal in all 52 states".
01:09:23  The 52 states being the 50 states of the US, and then "other land" and "other water"?
01:09:26  That's a pretty broad cange
01:09:37  erm, ignoring the 52 bit thingy
01:09:37  shachaf: The last 2 are secret.
01:09:42  Sgeo: What.
01:09:55  I think I can, without getting arrested, call a Brainfuck interpreter a "Haskell compiler"
01:10:07  no
01:10:10  ill arest you
01:10:13  I will arr-- yes
01:10:13  And Sgeo was never heard from again.
01:10:46  Sgeo: You probably could without getting arrested, but I doubt it will help anyone to do that, because it is still a lie even if it is not illegal to lie in that way.
01:11:16  It will help my sense of legitimacy.
01:11:53  O, that is what it is.
01:12:54  zzo38, we were discussing definitions of "legitimate".
01:13:12  we were?
01:13:12  Lying in such a way would, according to one of those definitions, still be legitimate
01:13:27 * Sgeo thought we were
01:14:25  So I had a dream where the moon was evil.
01:14:47  pikhq_: Got any examples yet? :P
01:14:55  So I had a dream where the nom was alive.
01:15:46  mmmm cornbread and milk
01:16:33 * shachaf soon off to see _Rosencrantz and Guildenstern Are Dead_.
01:17:18 -!- hagb4rd has joined.
01:19:49  pikhq_: You're wrong, x86-64 has 4 meg hugepages.
01:20:03  Oh, wait.
01:20:04  PAE halves that.
01:20:06  Lame.
01:21:15  elliott: For x86-64?
01:21:25  shachaf: ?
01:21:42  Do you use PAE on x86-64?
01:21:53  Oh.
01:21:56 * shachaf was confused.
01:22:07  shachaf: x86-64 /is/ PAE.
01:22:11  Plus bigger registers.
01:22:14  Plus some stuff.
01:22:23  Right. Are you sure you don't get 4MB pages?
01:22:42  "4M (2M in PAE mode)"
01:22:43  "Starting with the Pentium Pro, x86 processors support 4MB pages (called Page Size Extension) (2MB pages if using PAE)"
01:22:46  I'm pretty sure I did, this one time.
01:23:12  Hmm.
01:23:27 -!- Patashu has quit (Quit: MSN: Patashu@hotmail.com , Gmail: Patashu0@gmail.com , AIM: Patashu0 , YIM: patashu2 , Skype: patashu0 .).
01:27:45  pikhq_: BTW, the reason I was thinking that pool-per-thread would be nice is that I could store the pool pointer on the stack.
01:29:03  hmm... I forget whether "add [foo], bar" is ok
01:29:43  pikhq_: Wait, using dynamically-sized pages DOES have a use!
01:29:52  pikhq_: I can make the barrier page after each pool just 4k in size.
01:30:01  That's a lot less wasteful, and the vast majority of allocations are still <4k.
01:32:15  > listArray (0, 5000) [1..]
01:32:16    array (0,5000) [(0,1),(1,2),(2,3),(3,4),(4,5),(5,6),(6,7),(7,8),(8,9),(9,10...
01:32:26 * CakeProphet just tipped the scales a little bit.
01:32:40  that's one more >4k in the world.
01:32:45  +allocation
01:34:32  More, since arrays are boxed.
01:36:05  hmmm, so..
01:36:20  I notice you can make Applicative by pure and <*> and then make fmap by liftA but is there something possible that you can define pure and fmap and some new function to make <*> resulting (like how monads you can have fmap/join/return, or bind/return and it can make fmap/join from that)?
01:36:23  the OS gives out pages, and then it's the languages job to fill those pages correctly?
01:36:23  pikhq_: Hmm, OK, you're right that 2 megs is a bit too big.
01:36:47  pikhq_: Because threads obviously need at least one page of memory, and I want millions of threads running simultaneously.
01:37:00  Hmm, wait.
01:37:03  I was confusing megabytes and gigabytes.
01:37:34  I can support 512 million threads with a 16 meg heap each with less than 8 gigs of RAM :P
01:37:55  Err, wait.
01:37:58 -!- lifthrasiir has quit (Quit: 오후에 봐요 ㅂㅂ).
01:38:06  No I can't X-D
01:38:36  elliott: Turns out you can support 5.12 threads at most?
01:38:50  OK, yeah, 2 megabytes of physical RAM per thread scales to... 4000 threads with 8 gigs of RAM.
01:38:54  Not good enough.
01:38:59  shachaf: The best number of threads!
01:39:09  shachaf: 4 to do your work, 1 to manage it, and .12 to schedule them all.
01:39:31  elliott: Why do you need so much RAM per thread?
01:39:42  Do you think this plan is OK for DVI writing functions:  createDVI :: FilePath -> Word32 -> Ratio Word32 -> IO DocStat; shipOut :: Page -> IO DocStat; finishDVI :: DocStat -> IO DocStat;
01:40:03  shachaf: Well, the idea right now is to give each thread a pool. And a pool has to be a multiple of the page size.
01:40:30  Wait, GHC gives each thread 512 kilobytes of nursery, so how come it can do millions of threads?
01:40:36  A million threads should require 488 gigabytes like that.
01:40:46  Or is it relying on the OS to not actually allocate that much physical RAM?
01:40:50  (Answer: Almost certainly.)
01:40:58  Which is a reasonable thing to do.
01:40:59  Or maybe the nursery is per-OS thread.
01:41:01  That wouldn't surprise me.
01:41:04  shachaf: Yes, but not if you're an OS.
01:41:18  elliott is an OS.
01:41:21  @lliott
01:41:21  Unknown command, try @list
01:41:22  Yes.
01:41:26  That is my secret.
01:41:43  I was under the impression that programs could address more RAM than physically exists on the system without any issue.
01:41:50  Yes, they can.
01:42:02  elliott: *That* is your secret?
01:42:15  Who wouldn't be ashamed of their true OS nature?
01:42:16  ANYWAY
01:42:25  I wonder if maybe I can avoid giving threads pools altogether.
01:42:36  The question then is how on earth I divide pools to be able to do GC.
01:42:38  What about the ▬▬▬▬▬▬▬▬ ▬▬▬▬▬ ▬▬ ▬▬▬▬▬?
01:43:04  The hunter2?
01:43:41  Oh, wow, Unicode has a great selection of block characters.
01:44:10  Totally.
01:44:22  2580            UPPER HALF BLOCK        [] 2581            LOWER ONE EIGHTH BLOCK  [▁] 2582            LOWER ONE QUARTER BLOCK [▂] 2583            LOWER THREE EIGHTHS BLOCK       [▃] 2584            LOWER HALF BLOCK        [] 2585            LOWER FIVE EIGHTHS BLOCK        [▅] 2586            LOWER THREE QUARTERS BLOCK      [▆] 2587            LOWER SEVEN EIGHTHS BLOCK       [▇] 2588            FULL BLOCK      [] 2589            LEFT SEVEN EI
01:45:12  zzo38: well you can define (<*>) = liftA2 id
01:45:26  shachaf: Did you see my wonderful Unicode sparklines of channel activity?
01:45:32  2580 -- UPPER HALF BLOCK []; 2581 -- LOWER ONE EIGHTH BLOCK [▁]; 2582 -- LOWER ONE QUARTER BLOCK [▂]; 2583 -- LOWER THREE EIGHTHS BLOCK [▃]; 2584 -- LOWER HALF BLOCK []; 2585 -- LOWER FIVE EIGHTHS BLOCK [▅]; 2586 -- LOWER THREE QUARTERS BLOCK [▆]; 2587 -- LOWER SEVEN EIGHTHS BLOCK [▇]; 2588 -- FULL BLOCK []; 2589 -- LEFT SEVEN EIGHTHS BLOCK [▉]; 258A -- LEFT THREE QUARTERS BLOCK [▊]; 258B -- LEFT FIVE EIGHTHS BLOCK [▋]; 258C -- LEFT HAL
01:45:38  left hal
01:45:50  elliott: No. I hate anything whose name is "sparklines".
01:46:04  shachaf: I can hear Tufte crying.
01:46:17  It's just the name.
01:46:54  "Hello. I would have probably donated, but the left-wing extremism here and the weaselly use of the 'rules' to justify that left wing bias leaves a permanent bad taste in my mouth. I've paid attention to key subjects' discussion pages and I've seen how WP runs off all the right-wing conservatives, right-libertarians, constitutionalists, anti-globalization patriots, etc... Now I must say, WP is to academia what McDonald's is to restaurants."
01:47:00  I love [[Talk:Main Page]].
01:47:52  neutrality - part of the left-wing agenda
01:48:45  > Left $ pred <*> "IBM"
01:48:46    Couldn't match expected type `(a -> b) -> a'
01:48:46          against inferred type ...
01:48:51  wat
01:48:53  oh
01:48:56  elliott: Fortunately there's Conservapedia.
01:48:58  > Left $ pred <$> "IBM"
01:48:59    Left "HAL"
01:49:06  shachaf: Thank god.
01:49:09  oerjan: aka map
01:49:31  > succ <$> "VMS"
01:49:32    "WNT"
01:49:46 * shachaf looks up [[Talk:Main Page]] on Conservapedia.
01:49:51  elliott: What were you doing reading that, anyway?
01:49:56  shachaf: It's the best page.
01:50:25  > let rot _ [] = []; rot 0 xs = xs; rot n (x:xs) = rot (n-1) xs ++ [x] in rot 13 ['a'..'z']
01:50:26    "nopqrstuvwxyzmlkjihgfedcba"
01:50:29  > pred <$> "OSX
01:50:30    :
01:50:30       lexical error in string/character literal at end o...
01:50:32  > pred <$> "OSX"
01:50:33    "NRW"
01:50:39  > succ <$> "OSX"
01:50:40    "PTY"
01:50:41  elliott: Better than [[Elections in Zimbabwe]]?
01:51:42  shachaf: The most thrilling page.
01:51:47  "On more than one occasion, Obama verbally attacks the economic livelihood of Las Vegas for unknown reasons. The reason may be his contempt of gambling which is forbidden in the Koran."
01:51:56  X-D
01:52:17  shachaf: And yet: Morally bankrupt Massachusetts opens the floodgates to gambling, despite its negative impact on the poor. [29]
01:52:37  Oh, someone beat me to it: http://conservapedia.com/Talk:Main_Page#Gambling_story
01:53:12  Mercury's surface - evolutionists have to admit what they generally thought was wrong [5] God vs. evolutionists - God wins again!
01:53:16  bahahaha
01:53:35  oerjan: I know about "liftA2 id" but that uses <*> in the definition if liftA2
01:53:58  > let rot = (uncurry (flip (++)) .) . splitAt in rot 13 ['a'..'z']
01:53:59    "nopqrstuvwxyzabcdefghijklm"
01:54:08  "Global atheism is in decline in terms of the number of its adherents and the grassroots Question evolution! campaign could certainly accelerate this decline."
01:54:12  So beautiful.
01:54:26  zzo38: well _every_ applicative operation can be written using pure and (<*>)
01:54:30  oerjan: now define an elegant rot13 character function :P
01:54:39  I think the worst part about Conservapedia is that it's not a troll.
01:55:00  It's not?
01:55:03  There may well be trolls *involved*, but Andrew Schlafly is motherfucking serious.
01:55:26  schlafly is my fav :')
01:55:32  oerjan: I know. What I am asking is if there can be something that if you have pure, fmap, <*>, then you can define one more function that it determines <*> from fmap and pure and this new function
01:55:53  elliott: Well, there's certainly schadenfreude to be had.
01:56:03  "Schlafly created Conservapedia in November 2006.[12] He felt the need to start the project after reading a student's assignment written using Common Era dating notation rather than the Anno Domini system that he preferred."
01:56:47  lol
01:57:01  Seeing "shachaf" and "Shlafly" written so near each other makes their similarity apparent.
01:57:07  shachaf: That is a silly idea. Common Era and Anno Domini are the same; he can use AD if he prefers but other people can use CE or AD whatever you just have to know it is the same there are different words for that
01:57:11  Conclusion: shachaf must be a Muslim.
01:57:20  Underlying logic: See: Conservapedia.
01:57:21  QED
01:57:40  zzo38: Oh. Now I understand.
01:58:00   shachaf: That is a silly idea. Common Era and Anno Domini are the same; he can use AD if he prefers but other people can use CE or AD whatever you just have to know it is the same there are different words for that <-- did you just completely miss the point?
01:58:12  If bitched about AD in front of me, I'd just start using AUC dating. "Anno Urbis Conditae", "in the year of the founded city [of Rome]".
01:58:14  hm I think you did
01:58:18  Jesus Christ is the person who changed the world forever with teachings of love and faith, using logical parables like the Prodigal Son that flow from the existence of God. "Jesus triumphed over the Devil, and personally set the ultimate example for mankind, by enduring the horrific process of scourging and death by crucifixion under the ancient Roman regime in obedience to God's will."
01:58:24  first paragraph of the article Jesus Christ
01:58:25  I think Vorpal is missing the point of zzo38.
01:58:35  It is now 2764 AUC.
01:58:37  shachaf, hm good point.
01:59:01  However, it is not the exact year of Jesus Christ; they are probably inexact by a few years. That is one reason (but not the only reason) to use "Common Era"; but "Anno Domini" is commonly known what it meant, even if the year might be inexact. Since we have the year now, we use the same calendar instead of changing it; any reference point works as long as everyone agree.
01:59:21  pikhq_: I use AU. "Anno Unixine". It's 41AU.
01:59:33  Gregor: A good era.
01:59:37  pikhq_, I would use stardates if there was any sort of official mapping to normal years (I have no idea if there is)
02:00:20  pikhq_: The only problem is that in 68AU it'll suddenly become 0AU >_>
02:00:21  Vorpal: You want the, aah, what's the name again.
02:00:23  Vorpal: There is.
02:00:30  elliott, memory alpha?
02:00:34  No.
02:00:45  Does foldl (:) [] == reverse?
02:00:46  Vorpal: There's nothing neatly *canonical*.
02:00:51  > foldl (:) [] [1,2,3]
02:00:52    Occurs check: cannot construct the infinite type: a = [a]
02:00:52  pikhq_, oh okay
02:00:57  Vorpal: Well, except if you consider the 2009 film.
02:00:58  elliott, calculator?
02:00:58  Nope
02:01:03  During a Q&A session, Orci restated that a stardate is "the year, as in 2233, with the month and day expressed as a decimal point from .1 to .365 (as in the 365 days of the year)." [5] A similar reply was posted on his Twitter account: "star date=standard year, with decimal representing day of year from 1-365."
02:01:05  > foldl (flip (:)) [] [1,2,3]
02:01:07    [3,2,1]
02:01:08  Wow 2009 film, that is so stupid.
02:01:09  Then, it's moronically trivial. YEAR_AD.DAY_OF_YEAR
02:01:30  Yes, there are many systems you can use. But for common calendar you use the Anno Domini/Common Era system. UNIX timestamp is certainly one way. You can also use stardate, Holocene, Discordian, Chinese, solar, or whatever.
02:01:34  "with decimal representing day of year from 1-365." <-- I'm not sure I would call that decimal
02:01:39  That doesn't seem decimal notation to me!
02:01:39  Oh come on, what is the fucking name.
02:01:41  because it is not actually based on 1/10th
02:01:44  Ah!
02:01:50  Vorpal: Okuda timeline.
02:01:53  heh
02:02:28  elliott, anyway "with decimal representing day of year from 1-365.", means that .5 would be in about July or so? If not then the system isn't decimal
02:02:38  Vorpal: The system isn't decimal.
02:02:42  ouch
02:02:42  .5 would be January 5th.
02:02:50  pikhq_, that is just terrible
02:03:15  pikhq_, obviously .1 and .100 should be the same.
02:03:25  I guess it is like version numbers
02:03:57  actually I should start using decimal version numbers
02:04:00 -!- derdon has quit (Remote host closed the connection).
02:04:05  so that 1.4 is later than 1.35
02:04:08  Vorpal: If it is decimal of course it has to be .1 and .100 same. In addition, it says 365 days of the year, but there can be leap years too.
02:04:34  Vorpal: 1.4? Please: .14.
02:04:35  zzo38, stop missing the point, it is annoying
02:04:40  If you can't operate like that you suck.
02:04:42  Vorpal: I use a system, ten minors is worth one major, so that it is decimal and not decimal at the same time
02:04:45  Vorpal: Stop missing the point of zzo38, it's even more annoying.
02:04:49  elliott, what?
02:05:05  So there will be no version number "1.35"
02:05:17  elliott, version 0.14 would be less than 1.14 of course
02:05:30  zzo38, the point here is to mess up version number handling in distros...
02:05:38  Vorpal: Being able to use non-post-decimal-point numbers ruins it.
02:05:41  O, you are trying to mess up everything?
02:05:45  Since you can ascend in a "normal" fashion from 9 to 12.
02:05:49  zzo38, of course
02:05:55  If you put everything after the decimal point, you have to plan ahead.
02:05:58  elliott, ah good point
02:06:15  And I am instead removing mess up everything.
02:06:39  elliott, I could just add more digits at the end, slowly converging against 1 if I didn't plan ahead enough
02:06:47  1, 12, 197, 21, 810, 87, 88, 89, 8999, 9, 91, 93, 934934834, 94, 99, 999, 999, 999999...
02:06:48  err s/against/towards/
02:06:57  After you die, you release version 1.0.
02:07:06  A major revision after 0.9 or a minor revision after 0.9 is still 1.0 either way, in my system.
02:07:19  TeX and METAFONT version number are decimal.
02:07:26  After you die, you release version $\pi$.
02:07:28   And I am instead removing mess up everything. <-- that is not even grammatically correct!
02:10:33  Vorpal: O_o
02:15:35  oerjan: ?
02:15:39  Dammit, I've forgotten how GHC gets memory from the OS.
02:15:59 -!- MonkeyofDoom has joined.
02:16:09  `@ MonkeyofDoom ? welcome
02:16:11  MonkeyofDoom: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
02:16:28  hi
02:16:51  just heard some people were hacking on IOCCC stuff in here so I figured I'd drop in to see what's up
02:16:53  elliott, yogscast interviewing notch (see their channel). Except well... after watching that I think they are trolling the viewers...
02:17:00  mostly Gregor :P
02:17:03  hi
02:17:19  ais was working on something too
02:17:23  Gregor: I have it on good authority that it would be "Anno Unis".
02:17:32  Erm, Unicis
02:19:19  elliott: s/\`@ (MonkeyofDoom) \? (welcome)/\`\2 \1/
02:19:35  pikhq_: Noted.
02:20:07 -!- kwertii has joined.
02:20:31  Also:
02:20:33  SPAAAAAAAAAAAAARC
02:20:38  sparc
02:20:50  shark
02:21:27  Gregor: Is it the register windows??? The delay sdfk??? The return addreses???
02:21:29  SNAAAAKE!
02:21:40  elliott: Some horrible, horrible combination of them.
02:21:47  Gregor: Register delay addresses.
02:21:50  Is this good?   createDVI :: FilePath -> Word32 -> Ratio Word32 -> IO DocStat;  shipOut :: Page -> IO DocStat;  finishDVI :: DocStat -> IO ();
02:22:58  > (\x y -> 's':x:"ar"++[y]) <*> ['a'..'z'] <*> ['a'..'z']
02:22:59    Couldn't match expected type `a -> b'
02:22:59          against inferred type `[GHC.T...
02:23:13  erm
02:23:21  > (\x y -> 's':x:"ar"++[y]) <$> ['a'..'z'] <*> ['a'..'z']
02:23:22    ["saara","saarb","saarc","saard","saare","saarf","saarg","saarh","saari","s...
02:26:34  > dropWhile (/= "sparc") $ (\x y -> 's':x:"ar"++[y]) <*> ['a'..'z'] <*> ['a'..'z']
02:26:35    The lambda expression `\ x y -> 's' : x : "ar" L.++ ...'
02:26:35   has two arguments...
02:26:45  thanks lambdabot
02:27:07  > dropWhile (/= "sparc") ((\x y -> 's':x:"ar"++[y]) <*> ['a'..'z'] <*> ['a'..'z'])
02:27:08    The lambda expression `\ x y -> 's' : x : "ar" L.++ ...'
02:27:09   has two arguments...
02:27:11  >_>
02:27:48  21:27   but its type `[a1 -> a -> [GHC.Types.Char]]' has none
02:27:49  what?
02:28:06  oh
02:28:12  > dropWhile (/= "sparc") ((\x y -> 's':x:"ar"++[y]) <$> ['a'..'z'] <*> ['a'..'z'])
02:28:14    ["sparc","spard","spare","sparf","sparg","sparh","spari","sparj","spark","s...
02:28:50  hm...
02:32:18  > succ 'sparc'
02:32:19    :
02:32:19       lexical error in string/character literal at chara...
02:32:23  > succ "sparc"
02:32:24    No instance for (GHC.Enum.Enum [GHC.Types.Char])
02:32:24     arising from a use of `...
02:32:28  hmph
02:32:39  shocking
02:32:55  @hack
02:32:55  http://hackage.haskell.org
02:32:57  or whatever it was
02:33:29  ellio
02:33:30  ...
02:33:32  elliott: http://conservapedia.com/Talk:Jesus_Christ
02:33:40  I think this is more entertaining than the Main Page
02:34:29  Funny how this page is locked depsite conservapedia asking for people to edit it. previous unsigned comment added by User:Wikipediaisbetter
02:34:32  Funny how Wikipedia's article is also locked... They are better exactly how..? Fox 10:11, 25 May 2007 (EDT)
02:34:43  the logic
02:34:45  !perl $_="sparc"; print $_,"\n" while($_++);
02:34:46  spard
02:34:46  I can't deny it.
02:34:54  oops
02:35:03  lolwat
02:35:41  `perl -e '$_="sparc"; print $_,"\n" while($_++);'
02:35:43  No output.
02:35:51  oh hm
02:35:55  `run perl -e '$_="sparc"; print $_,"\n" while($_++);'
02:35:57  spard \ spare \ sparf \ sparg \ sparh \ spari \ sparj \ spark \ sparl \ sparm \ sparn \ sparo \ sparp \ sparq \ sparr \ spars \ spart \ sparu \ sparv \ sparw \ sparx \ spary \ sparz \ spasa \ spasb \ spasc \ spasd \ spase \ spasf \ spasg \ spash \ spasi \ spasj \ spask \ spasl \ spasm \ spasn \ spaso \ spasp \ spasq \ spasr \ spass \ spast \ spasu \ spasv \ spasw \ spasx \ spasy \ spasz \ spata \ spatb \ spatc \ spatd
02:36:17  it even wraps from z back to a :P
02:36:50  I didn't know ++ had those semantics on strings.
02:37:15  spata
02:37:37  wow. there are four real words there
02:37:40  See, why can't Haskell do that. (I'm sure it can, given appropriate instances)
02:37:45  someone filter that with the dictionary
02:37:48  With succ instead of ++ of course
02:38:03  `run grep /usr/share/dict/words $(perl -e '$_="sparc"; print $_,"\n" while($_++);' | head -n 50)
02:38:06  grep: spard: No such file or directory \ grep: spare: No such file or directory \ grep: sparf: No such file or directory \ grep: sparg: No such file or directory \ grep: sparh: No such file or directory \ grep: spari: No such file or directory \ grep: sparj: No such file or directory \ grep: spark: No such file or directory \ grep: sparl: No such file or directory \ grep: sparm: No such file or directory \ grep: sparn:
02:38:09  oops
02:38:23  Except it won't be fun on strings, come to think of it
02:38:31  Since maxBound :: Char /= 'z'
02:39:24  an Ix instance would work better, i think
02:39:31  !perl $_="100"; ++$_;print
02:39:31  101
02:39:37  !perl $_="aaa"; ++$_;print
02:39:37  aab
02:40:00  !perl $_="199"; ++$_;print
02:40:01  200
02:40:16  Hmm, would it? I still think you need to specialize on Strings specifically
02:40:26  > range (('s',('a',('a',('r','a')))),('s',('z',('a',('r','z)))))
02:40:27    :
02:40:28       lexical error in string/character literal at chara...
02:40:31  argh
02:40:37  > range (('s',('a',('a',('r','a')))),('s',('z',('a',('r','z')))))
02:40:38    [('s',('a',('a',('r','a')))),('s',('a',('a',('r','b')))),('s',('a',('a',('r...
02:40:49  good range
02:40:57  > [ [s,p,a,r,c] | (s,p,a,r,c) <- range (('s',('a',('a',('r','a')))),('s',('z',('a',('r','z'))))) ]
02:40:58    Couldn't match expected type `(GHC.Types.Char,
02:40:58                              ...
02:41:09  > [ [s,p,a,r,c] | (s,(p,(a,(r,c)))) <- range (('s',('a',('a',('r','a')))),('s',('z',('a',('r','z'))))) ]
02:41:10    ["saara","saarb","saarc","saard","saare","saarf","saarg","saarh","saari","s...
02:41:15  saarg
02:41:17  CakeProphet: i thought that was the one you wanted
02:41:38  I have no wants
02:41:45 * CakeProphet meditates on enlightenment.
02:41:52  Sgeo: as you see, Ix works better because you can give lower/upper bounds for each element
02:42:32  Hmm
02:42:44 * Sgeo is mildly lost
02:42:54  > foldr1 (,) "saara"
02:42:55    Occurs check: cannot construct the infinite type: a = (a, a)
02:42:58  ...I see
02:43:00  oh.
02:43:01  right.
02:43:23  It looks like Conservapedia is not being encyclopedic! Although some of the points might be valid in some cases, they are not correct if you are trying to be unbiased articles about stuff like encyclopedic stuff.
02:43:54  zzo38: but "unbiased articles about stuff like encyclopedic stuff" is the left-wing agenda.
02:43:59 -!- Zuu has quit (Ping timeout: 252 seconds).
02:44:28  > range ((1,3),(0,2)) -- it's meant for things like this when indexing 2d arrays
02:44:29    []
02:44:32  oops
02:45:00  > range ((1,0),(3,2))
02:45:01    [(1,0),(1,1),(1,2),(2,0),(2,1),(2,2),(3,0),(3,1),(3,2)]
02:45:12  CakeProphet: O, that is what "left-wing agenda" is to them. Well, it is freedom of speech (and writing); that is why there are multiple resources to read information, including more than one if you want to. Whether or not they like that.
02:45:54  zzo38: basically the us conservatives are doing their best propaganda to redefine normal as "left-wing"
02:46:36  zzo38: well, apparently because Wikipedia doesn't cover Jesus Christ as the savior of mankind etc, it's pushing a atheist left-wing political agenda.
02:46:40  that's the logic as far as I can tell.
02:46:49  at least that's what it looks like for most western people outside the us
02:47:42  zzo38: When you think "left-wing agenda" you should actually think "agenda of people who don't want a Christian theocracy".
02:47:49  That'd do it.
02:48:01  some GOP presidential candidates actually claim that NPR is a left-wing organization..
02:48:10  Only some?
02:48:17  vocally, anyway.
02:48:33  well, NPR is certainly too factual to be right-wing.
02:48:37  so it must be left-wing!
02:48:48  Well, Wikipedia should probably cover Jesus Christ as savior of mankind etc, although in the different way than Conservapedia does; Wikipedia should write it like, this is according to Christians religion, and such things, instead of saying it is absolute and that stuff. But Wikipedia should still write about Jesus Christ as savior, just not the way Conservapedia does.
02:48:51  Remember, Fox News is "fair and balanced" reporting.
02:49:19  zzo38: I'm pretty sure Wikipedia does go into quite a bit of detail regarding Christian beliefs on Jesus Christ.
02:49:42  It would be a horrendous disservice to omit that on an article about Jesus.
02:50:47  i'd assume they have a whole series of articles on it
02:51:10  http://conservapedia.com/Homosexuality
02:51:14  Well, yes. There's enough information for it.
02:51:49  http://conservapedia.com/Poop
02:52:09  http://conservapedia.com/Obscenity "Language describing homosexual acts tends, at least in English, to have the greatest emotional impact."
02:52:20 -!- elliott has left ("Leaving").
02:52:21 -!- elliott has joined.
02:52:24  20:42, 10 April 2007 TimS (Talk | contribs) deleted "Poop" ‎ (content before blanking was: '== Poop ==The word poop in the English language is the vulgar and sinful slang term referring to human excrement. We know that human excrement is th...')
02:52:41  heh, they have a series on Salvation
02:53:08  I guess only gay people fuck? Or what do they consider to be emotionally impacting? Varies from person to person, wouldn't it?
02:53:28  Sgeo: SHUT UP FAG
02:53:40  `addquote  I guess only gay people fuck?
02:53:42  726)  I guess only gay people fuck?
02:53:42  Sgeo: I think they're referring specifically to obscenities.
02:54:10  but I think they're wrong
02:54:18  YOUR MOM has the most emotional impact.
02:57:37  http://liberapedia.wikia.com/wiki/Main_Page
02:57:37  huh
02:58:04  The founder (known only as "WillH") wanted Liberapedia to parody Conservapedia and advised that: "most articles should take stereotypical liberal views and distort them to the extreme". Most arrivals since then have ignored that, and instead just written about liberal politics with dead seriousness.
02:58:09  --RationalWiki
02:58:15  so many biased encyclopedias
02:58:26  indeed Christology is a wikipedia series
03:01:55  hey guys
03:02:14  did you know being gay increases your likelihood of being a drug addict?
03:02:29  "Also, the homosexual population has a greater propensity to engage in illegal drug use."
03:02:33  :P
03:03:16  http://rationalwiki.org/wiki/Lenski_affair
03:03:20  this is a fun read.
03:08:50  CakeProphet: Don't get sucked into RationalWiki.
03:10:06  I have no intention of getting sucked into a wiki of any sort.
03:10:17  oh you mean, just reading it?
03:10:18  or contributing?
03:10:32  *"contributing"
03:12:09  But perhaps because you did not bother even to read our paper, or perhaps because you aren’t very bright, you seem not to understand that we have the actual, living bacteria that exhibit the properties reported in our paper, including both the ancestral strain used to start this long-term experiment and its evolved citrate-using descendants. In other words, it’s not that we claim to have glimpsed “a unicorn in the 
03:12:16  this is so good
03:12:41  garden” – we have a whole  population of them living in my lab! And lest you accuse  me further of fraud, I do not literally mean that we have  unicorns in the lab. Rather, I am making a literary  allusion.
03:18:27 -!- tiffany has quit (Quit: nyu~).
03:31:00 -!- kwertii has quit (Changing host).
03:31:00 -!- kwertii has joined.
03:47:16 -!- CakeProphet has quit (Ping timeout: 240 seconds).
03:56:44 -!- Vorpal has quit (Ping timeout: 248 seconds).
04:01:08  The Conservapedia page about GNU/Linux mentions that Richard Stallman is atheist. The article about Donald Knuth doesn't mention that Knuth is Christian, and it says he is known as the creator of LaTeX (the article about LaTeX (there is none about TeX) mentions that Leslie Lamport invented LaTeX, not Knuth). I did look at Liberapedia too.
04:01:47  ....Does Conservapedia have a thing against F/OSS?
04:01:49  Both are bad (although valid if you just want to see different point of view). Wikipedia is more complete and better, although it too might omit some things. It is why they make things such as Wikinfo and various articles people write.
04:02:07  (Don't tell Stallman that I lumped Free Software and Open Source together)
04:02:11  Sgeo: Not as far as I can see.
04:02:29  Wikipedia does tend to have a postmodernist bias on many topics, though it's getting better slowly.
04:02:53  particularly on topics that mainly only postmodernists care much about, such as colonialism
04:05:02  Sgeo: Stallman actually has no issues with one lumping them together in contexts where that makes sense. He *may* object to your characterising GNU as "F/OSS", though.
04:06:00  Also, I'd imagine Conservapedia mostly has an anti-geek bias. I'm surprised there's even an *article* on rms.
04:08:20  kwertii: which of the 5000 definitions of postmodern are you using
04:10:55  elliott: "a loosely related set of philosophies deriving ultimately from the work of Heidegger holding that there is no such thing as absolute truth or objective reality and that so-called 'facts' are social constructions created through 'narrative' or 'discourse,' lately said to be actively manipulated by the Evil White Heterosexual Euro-American Male to oppress the glorious Other, whom he fears and seeks to quash."
04:12:29  Is that even *slightly* prevalent?
04:12:41  pikhq_: as I said, it's gotten better lately
04:12:45  I mean, as an actual thing, rather than some strawman figure?
04:13:01  pikhq_: it's quite popular in academia
04:13:15  pikhq_: especially in social sciences and literary criticism
04:13:45  Bleh.
04:13:51  pikhq_: at my graduate school (San Francisco State University), it was orthodoxy, and daring to question any aspect of it was strongly discouraged.
04:14:18  (ironically, for a philosophy that claims to be open to all viewpoints and claims to not be privileging any one over another)
04:15:48  Yeah, um, I'm having a bit of difficulty believing such things exist. That's really hitting Poe's Law levels of "... Wut?"
04:16:06  What's the typical response to the trivial criticism of "Well, it itself suggests that some viewpoints are false"
04:16:19  in fact, on the west coast of the US, it's metastasized and spread out of the universities into the mainstream of the culture.
04:16:20  Which I suspect should only effect a strawman
04:16:37  Sgeo: I'd go with "Rephrase that as something substantial please."
04:16:38 * Sgeo is ignoring the word "lately" and everything after
04:16:42  Sgeo: the typical response is to get mad and accuse the person saying that of being a {racist, sexist, etc}
04:17:31  Is the lack of objective reality itself a fact of objective reality?
04:17:44  Sgeo: my professors got really mad at me when I asked them that.
04:18:34  I also offered to retract my views on objective reality if anyone could jump off a bridge and manage to fly instead of splattering messily on the sidewalk in my presence. strangely, there were no takers.
04:18:49  Sgeo: Well, strictly speaking, it is *unknowable* whether there is an "objective reality", I at least think.
04:19:04  Of course, the *correct* answer to "is there an objective reality?" is "sure seems like it."
04:19:56  And, of course, such discussions are at best pointless mental masturbation.
04:20:10  You imply that mental masturbation is pointless
04:20:15  pikhq_: that would be the problem with logical positivism that the postmodernists claim to be addressing. Karl Popper also addressed this point far better with his critical rationalist theory that (informally) while we may not know with 100% ∫certainty whether something is objectively true, it may be taken to probably be true until it is falsified.
04:20:22  Sgeo: No, I state it.
04:20:44  it is indeed mere pointless mental masturbation, which is why I am no longer in academia and have a real job now.
04:21:00  also, I get paid as much as 2 or 3 professors
04:21:00  What is pointless about something that is interesting to think about?
04:21:13  Next you'll say that purely theoretical math is pointless
04:21:20  I'm in academia mainly so that I can acquire the nickname "Doctah G, PhD"
04:21:20  mental masturbation is only a half or a third as important as practical work, that is
04:21:21  :P
04:21:39  Sgeo: trying to convince asshats that you're right is largely pointless. academia comes down more to politics than to actually being right, especially in soft sciences
04:21:49  Gregor: You're in a different form of academia.
04:22:18  Gregor: what do you study?
04:22:26  pikhq_: Doesn't change my statement.
04:22:28  kwertii: CS.
04:22:28  hard sciences seems like a paradise, where you can actually prove that you're right
04:22:29  Gregor: You're in the land of CS, math, science, and engineering. At least in principle, you need to deal with reality.
04:22:49  Well, "reality" isn't quite the right term for math.
04:22:52  :P
04:23:00  at least it can be provably internally consistent
04:23:10  kwertii: Actually no.
04:23:31  kwertii: Gödel ring a bell?
04:24:39  pikhq_: actually, yes, I've looked into that in some detail. Goedel's incompleteness theorem says that a certain class of logical statements are EITHER internally inconsistent OR rely on external axioms.
04:25:01  since "math" as that term is commonly used uses external axioms, it can be provably internally consistent
04:26:29  most commonly https://secure.wikimedia.org/wikipedia/en/wiki/Zermelo%E2%80%93Fraenkel_set_theory for the axioms, but there are other choices
04:27:07  Y'know what? Fuck it, I shouldn't discuss this.
04:27:11 * pikhq_ summons oerjan
04:27:15  oerjan: oerjan: oerjan:
04:27:40  social sciences COULD be similarly rigorized. but the establishment (professors currently in tenure) actively resist any attempt to impart the use of logic into the field. logic being an invention of the Evil White Heterosexual Man created for the specific purpose of oppressing brown people, gays, women, etc.
04:27:49  (at least on the west coast)
04:28:08  kwertii: ... So, they reject logic, eh?
04:28:14  Therefore, asdfhhbcixv;bjkosdahtfp9gxcjgidaf;
04:28:26  looooool kwertii is so full of shit
04:28:45  elliott: I wish I was
04:29:00  pikhq_: actually, it's based on politics. you have to write something flattering to your advisor, not just random crap
04:29:00  \
04:29:34 -!- madbr has joined.
04:29:36  hey
04:29:58  kwertii: I am seriously finding this incredibly hard to believe.
04:30:02  I think I have a realisable design for a slice processor :D
04:30:05  pikhq_: :(
04:30:14  I can't reject it, but it seems so utterly *implausible*.
04:30:36  So because of IOCCC's size restrictions, I wrote a golf assistant.
04:30:48  pikhq_: you've obviously never spent much time at a California university
04:30:49  I was thinking about golfing the golf assistant and submitting it to IOCCC.
04:30:59  The problem is, then it'd just be golfed, not obfuscated :P
04:31:01  kwertii: Indeed not.
04:31:48  pikhq_: http://www.linguistics.ucsb.edu/faculty/bucholtz/cv.html
04:32:38  I have absolutely no idea what I should be getting out of that CV.
04:32:47  pikhq_: read a few of her publications and you'll see what I'm talking about
04:33:02  "You da Man: Narrating the Racial Other in the Linguistic Production of White Masculinity," Journal of Sociolinguistics 3(4): 443-460, 1999
04:33:37  tl;dr - white men are always seeking to appropriate the black man's "cultural identity" by stealing his slang, a subtle, ubiquitous, and hitherto unrecognized form of racism
04:34:00  so Gregor why not drown out this off-topic inane prattle with an ioccc update
04:34:07  did you fix sparc? :P
04:34:07  elliott: I was trying :P
04:34:11  elliott: I was trying :P
04:34:16  kwertii: I see no such implications from the abstract of said publication.
04:35:30  elliott: Right now I'm focused more on making it a more complete dc, as I'm quite afraid that I'll run out of bits.
04:35:44  that's what "the narrative preserves the racial hierarchy that enables white cultural appropriation of African American culture through language crossing" means
04:35:47  in pomo-speak
04:36:17  http://richarddawkins.net/articles/824 Richard Dawkins on postmodernist vernacular
04:37:00  lol postmodernism
04:37:02  if they just came out and said it in ordinary language, nobody would pay any attention to them. they have to dress it up in pompous jargon
04:37:11  kwertii: pls, nobody gives a shit, take it to /msg if you must
04:37:26  elliott: pikhq_ asked.
04:37:37  *That said*, this article seems to spend much time on irrelevancies in its discussion of the spread of features of African-American Vernacular English.
04:37:39  I have, in general, one problem with Skeptics Annotated Bible, which is that the deuterocanonical/apocrypha books are not included.
04:37:44  And, frankly, this discussion is really boring me.
04:38:15  pikhq_: and yet you've kept participating in it and moving it further along
04:38:30  shut
04:38:31  the
04:38:32  fuck
04:38:33  up
04:38:34  kwertii: s/really boring/starting to really bore/
04:38:37  dude
04:38:39  :''(
04:39:15  elliott: I wish there were a SPARC expert about.
04:39:46  http://s.engramstudio.com/src/101467.jpg
04:40:32  zzo38: The reason for that is, undoubtedly, due to the target audience being *American* atheists.
04:40:40  derrida should be punched in the face for différence / différance
04:41:03  And in America the prevalent forms of Christianity are Protestant, and thus don't care about the apocrypha.
04:41:15  elliott: seems like people are interested after all
04:41:39  elliott: I'm at 2635 bytes raw, and don't have everything implemented >_>
04:42:13  kwertii: orly:
04:42:15   so Gregor why not drown out this off-topic inane prattle with an ioccc update
04:42:19   elliott: I was trying :P
04:42:21   And, frankly, this discussion is really boring me.
04:42:23  wonder if you could get a midi player in that little code... probably not
04:43:00  madbr: I'm sure you could get a really bad one.
04:43:03  elliott: and madbr> derrida should be punched in the face for différence / différance
04:43:18  3 > 2
04:43:39  gregor: hmm, sounds hard to fit in the synthesis
04:43:50  elliott: pikhq_ was actively discussing and only suddenly became bored when you indicated that you disliked the topic. I think he likes you.
04:43:53  and the 128 damn patches, plus all the drums
04:43:54  madbr: Just need a sufficiently bad synthesis :)
04:43:59  It is not entirely atheists; they have Christian responses too. They also say you can have your own opinion. It is for both believers and skeptics. And people who just want to read it including annotations and cross-references, which you can disagree if you want to, or agree, or agree with some and disagree with others.
04:44:12 -!- copumpkin has quit (Ping timeout: 248 seconds).
04:44:15  madbr: You are thinking waaaaay to far into it. My synth would be square waves. MAYBE sine waves.
04:44:29  gregor: I guess it's not too hard if you play everything with square waves and ignore all the controllers
04:44:38 -!- copumpkin has joined.
04:44:40  square waves are boring :(
04:44:43  kwertii: ah! conspiracy theories
04:44:44  Yeah, just need to process noteon/noteoff events.
04:44:48  kwertii: this keeps getting better and better
04:44:51  madbr: So's your face, but you don't see us complaining.
04:44:56  OHHHHHHHHHHHHH RANDOM
04:45:03  whatever
04:45:14  You could probably do better than square waves ...
04:45:31  I think, within the amount of space, you MAY be able to fit a heuristic mapping instruments to square, sine or saw.
04:45:45  And since all instruments are one of the three, DONE :P
04:45:50  pikhq_: I appreciate your liking me but unfortunately I cannot reciprocate, we must duel to the death.
04:45:57  "God creates light and separates light from darkness, and day from night, on the first day. Yet he didn't make the light producing objects (the sun and the stars) until the fourth day." Well, actually, while there are examples of illogical things in the Bible, this is not one of them. There can be light and radiation and so on in the beginning of the universe;
04:46:14  zzo38: The target *audience* of the Skeptic's Annotated is clearly atheists, though.
04:46:14  Gregor: btw i wouldn't submit the twitter interp to ioccc
04:46:17  Gregor: although hmm
04:46:22  they don't look at authors so might as well
04:46:26  there can be photon and gravity and everything else. (Some Christians say it is the "Light of God"; still valid, but not scientific.)
04:46:32  In my part of the US, most of the Christians are Catholic
04:46:33  i was thinking two "short language impl" submissions from one person might go badly :P
04:46:43  That some other groups may be interested is fairly irrelevant.
04:46:57  Sgeo: That's somewhat exceptional.
04:47:01  elliott: ?
04:47:11  sgeo: isn't catholic church going badly these days?
04:47:15  pikhq_: The jig is up!
04:47:24  elliott: Yeah, I was only thinking of it given that they don't look at the author :P
04:47:32  elliott: But actually, now I'm thinking about a MIDI player ;)
04:47:38  madbr, *shrug*
04:47:42   However the second part of that annotation says "And how could there be "the evening and the morning" on the first day if there was no sun to mark them?" and that is a valid point; there cannot be evening/morning without the sun. The people that wrote that part just made some mistake, or never intended it to be logical, or whatever. I don't know for sure.
04:47:52  dunno what it looks in us but here over 80% of people are catholic on paper
04:47:54  Gregor: Outputting how?
04:47:57  but irl nobody goes to church
04:48:02  elliott: wav to stdout
04:48:04  Gregor: If you don't say "PC speaker", I don't like you.
04:48:17  elliott: OMG PLATFORM SPECIFIX
04:48:24  and I dunno how many actually believe in god but it's certainly not 80% :D
04:48:40  kwertii: Well, that's pretty strange to think. I was mostly discussing to see if it would actually go anywhere. Most I got was "postmodernists suck at writing".
04:48:54  Gregor: You could probably do OSS in about two lines; if /dev/audio or whatever it is exists, open it, redir stdout to it and skip headers.
04:49:27  pikhq_: well, I do have some commentary on that point, but I won't deepen your boredom by relating it and forcing you to read it
04:49:29  madbr: Here in the US, 85% of people claim to be Christian. Also, churches are exceptionally common.
04:49:38  elliott: Considering that I can't seem to get dc to fit, *waaah* :(
04:49:43  there are lots of church here too
04:49:46  but they're empty
04:49:57  when they're not empty, they're full of old people
04:50:02  I think I've been inside a church 0 or 1 times
04:50:14 * Sgeo increments that to 1 or 2
04:50:37  lots of "3x catholics"
04:50:37  madbr: We've got churches with 50,000 people attending a week.
04:50:54  goes to church on birth, marriage, death :D
04:51:08  https://upload.wikimedia.org/wikipedia/commons/3/31/Lakewood1.jpg
04:51:11  Gregor: int q=open("/dev/audio",O_RDWR);if(q>0)dup2(q,1);else{...print wav headers...}
04:51:16  depends on what part of the US you're in. some suburban and rural areas are still highly religious in terms of % of people attending church. I would be surprised if 1 in 100 attends church in New York City.
04:51:34  Gregor: 55 chars for OSS support :P
04:51:35  pikhq_, You used to, well, at least be a Christian, I don't know if you went to church
04:51:36  Or is it /dev/dsp...
04:51:39  That'd be shorter.
04:51:44  Sgeo: Vaguely regularly.
04:52:17  Wasn't that important to me. Which is kinda odd, thinking back.
04:52:21  Gregor: For shorter points, try ~0 instead of O_RDWR, there's a good chance that won't break systems :)
04:52:34  Gregor: You can also avoid the "int " by reusing argc, ofc.
04:52:59  Here I was, thinking that there was this omnipotent being that was going to send me to eternal torment if I didn't act right, and for the most part I was just apathetic about the whole ordeal.
04:53:03  ~0?
04:53:25  pikhq_, wait what? You didn't believe that God was mostly good, and cares more about actions?
04:53:42  elliott: Hm, I'm using -1 instead of ~0 in the JIT. C doesn't explicitly specify 2's-complement, does it X-D
04:53:46  Sgeo: Doing bad things would be "not acting right".
04:54:01 * Sgeo misread/skimmed what pikhq_ said
04:54:18  "Clearly" if you did bad things you were not good.
04:54:25  I think I'm just not sure how going to Church is an essential part of "acting right"
04:54:25  gregor: in theory no but wouldn't it be really hard to find a platform that's not 2's complement? :D
04:54:40  I now it would probably break some of my sound rendering code :D
04:54:41  When I lived with my extremely fundamentalist father, though, I mostly got a motherfucking *ton* of guilt.
04:54:43  *know
04:54:48  When I was younger, I believed that if there was a hell, it was mostly reserved for people like Hitler
04:54:51  Reminder: Jesus hates masturbation! And lust!
04:54:56  Gregor: if(0 madbr: Troof.
04:55:04  Gregor: Eeeexcellent.
04:55:14  elliott: Why don't you use your amazing shortening skills to shorten my code instead of yours :P
04:55:20  (Do not actually do this)
04:55:32  I think I probably just got burnt out on the fucking guilt trips, TBH.
04:55:36  Gregor: 'cuz I'm more interested in this MIDI player :P
04:55:44  Sgeo: Raised as a Catholic, questioning the orders of God in any way was not encouraged. the magic book says "go to church every week," you go, and that's all there is to it.
04:56:31  I distinctly remember, being told in Hebrew school, that, iirc, God could forgive sins against God, but only people could forgive sins against people.
04:56:39  Or something along those lines.
04:56:57  So if you fail to stone an adulterer, maaan are you fucked.
04:57:24  Sgeo: what happens if you die with unforgiven sins? could someone you've sinned against withhold forgiveness just to screw you over in the afterlife?
04:58:13  Sgeo: Mainstream Christianity has the "wonderful" idea that unless you ask God for forgiveness from everything and strive to be perfect, you're sentenced to eternal torment and suffering.
04:58:24  doesn't matter, all that matters is that you personally accept jesus as your saviour. also, catholics don't count and still go to hell 
04:58:30  And that all sins are created equal.
04:58:35  And that masturbation is a sin.
04:59:21  In conclusion, masturbation is equal to the Holocaust.
04:59:51  that's why Catholics have 2 classes of sin, venal and mortal. if you die with an unforgiven mortal sin on you, you're in deep shit. not sure where masturbation fits on the spectrum.
05:00:04  probably venal
05:00:31  I'm not sure what's the border for "lust" :D
05:00:53  I am sure, however, that committees of Catholic canon lawyers have discussed the matter at great length
05:04:12  seems they consider masturbation "grave" - ie probably a mortal sin
05:04:18  that's fucked up
05:05:08  It's a religion based around a zombie Jew.
05:05:34  what better way to exert deep psychological control over the populace than require everyone to confess their every sexual thought and act to a priest until they're married?
05:06:16  Gregor: So how were you planning to play MIDI files.
05:06:21  To PCM.
05:06:22  I mean WAV.
05:08:00  pikhq_: BTW, I think per-thread pools are untenable for @.
05:08:22  elliott: read the midi messages into synthesizer parameters, play that, output? :D
05:09:27  maybe you could reduce patch data to about 12 bits of data... but it would probably be hard to make fit
05:11:11  elliott: looks like MIDI is not nearly as popular a topic as either postmodernism or religious views of masturbation were
05:11:29  pikhq_: Even if it's just a single 4 kilobyte page, that's still 4 gigs for a million threads.
05:11:37  kwertii: lol you are really upset
05:11:50  elliott: .. no. I don't mind
05:11:59  which is why you keep bringing it up
05:12:02 * Sgeo likes MIDI files
05:12:08  actually Gregor did answer my question, just in /query :)
05:12:13 * Sgeo has a collection of them
05:12:33  http://daychilde.com/midiguy/ (Note: legality unknown)
05:12:50 -!- oerjan has quit (Quit: Good night).
05:13:36  http://s.engramstudio.com/src/virt_-_BLT_Big_Lion_Television_Hour_01.mid
05:13:40  Would be nice if I could get labels for the unlabelled songs
05:14:56  pikhq_: OTOH, I can't think of any other decent way to divide pools...
05:15:16  pikhq_: I could do per-CPU (I don't want aaaaany locking, so it can't go coarser-grained than this), but that seems really weird.
05:15:22  And would also suck to GC.
05:15:26  tour de force would be fitting in a reverb in too
05:15:46  but tbh a reverb would probably take an IOCCC entry by itself
05:17:46  elliott: Maybe you're thinking about this the wrong way around.
05:17:56  Plausible :P
05:18:02  Perhaps you should have some number of memory pools, and assign threads to them.
05:18:24  Mm, I was thinking of that... but the problem is basically:
05:18:35  The granularity is a little arbitrary I admit, but you're only really wanting to split up allocations, so.
05:18:38  Hmm, actually
05:18:49  I /think/ this might be simple enough that it can be done atomically from multiple CPUs
05:18:57  mov rax, [rsp+N]
05:18:57  add [rsp+N], 8
05:19:04  Two CPUs doing that at once should be just fine, right? Even if 8 diffes.
05:19:05  Err
05:19:09  s/rsp+N/some shared location/
05:19:11  *differs
05:19:24  I think at the very worst it can waste some space, which GC will clean up.
05:19:40  Wait, no, that's not safe.
05:19:47  Because someone else could steal that heap pointer before the add.
05:19:51  Yeah, that should race.
05:20:04  add [blah], 8
05:20:04  mov rax, [blah]
05:20:04  sub rax, 8
05:20:11  That should be safe, though, with the race condition of "wasting space".
05:20:58  You could probably just use compare-and-swap.
05:21:14 -!- kwertii has quit (Quit: bye).
05:21:28  CMPXCHG*
05:22:36  pikhq_: Yeah, but it's easier to make sure pools are never concurrently accessed from more than one CPU :)
05:23:05  You can still access /objects/ on that pool.
05:23:11  The GC just has to know which threads are using which pool.
05:23:16  ('s objects)
05:27:06  pikhq_: This is wearing me down, so I'll pose a more fun question: How hard, and how slow, would it be to do a linked-list stack on x86-64 in place of the regular call stack? Then: Does this generalise easily to a spaghetti stack?
05:27:47  One idea I have, is Haskell command "if instance" which is like a normal "if" command, but in place of the condition you have the word "instance" followed by a constraint specification (which might include type synonyms too), and the expression for the true part is allowed to use those constraints.
05:27:51  Spaghetti stack?
05:28:09  zzo38: No! Breaks parametricity!
05:28:13  Sgeo: http://en.wikipedia.org/wiki/Spaghetti_stack
05:28:14  I also have various ideas about instance disambiguation.
05:28:45  Hard? Not *exceptionally*.
05:28:48  elliott, So does seq
05:28:50  Slow? I honestly have no idea.
05:29:04  Sgeo: Not even remotely in the same ballpark.
05:29:18  elliott: wouldn't that turn every push/pop into a memory allocation?
05:29:25  Sgeo: See "Fast and loose reasoning is morally correct"
05:29:34  ..?
05:29:45  Sgeo: http://www.cs.ox.ac.uk/jeremy.gibbons/publications/#fast+loose
05:29:54  also isn't the point of a stack the fact that you don't need complicated algos of doom to allocate/deallocate it? :D
05:29:58  madbr: Yes, but allocations can be cheap (my current allocator takes two cycles)
05:30:13  And it's hardly complicated *shrugs*
05:31:57  heh really? if that's true, that's impressive yes
05:32:19  madbr: It's called "bump pointer".
05:32:35  :D
05:32:51  madbr: yeah, it looks like this:
05:32:56  allocated_object = pool_ptr;
05:32:59  pool_ptr += size;
05:33:08  One purpose for "if instance" is in case you want to define some class methods of a instance that require another instance and default otherwise, or define other functions that a few parts of them work only on specific instances but still work OK in general without, or to do conditional compilation (even "backwards"; i.e. an imported module checks conditions of the module it is imported into), etc
05:33:17  yeah but then how do you defragment ram? :D
05:33:22  madbr: copying gc
05:33:31  madbr: pools have a 4k "barrier" page after them so that when you access beyond the limit of the pool the gc runs
05:33:37  so there's no branches required at all
05:34:04  but don't you get an interrupt instead of a branch?
05:34:16  guess you don't have to test it each time tho
05:34:19  madbr: yes, it's expensive when you trigger a gc
05:34:24  madbr: but most allocations fit within the current pool :P
05:34:27  and those are free
05:35:14  fair enough :D
05:35:21  elliott: This does present issues if the allocation is greater than the barrier page size, though.
05:35:28  well, yeah
05:35:34  this is for allocations under 4k
05:35:36  which is most allocations
05:35:42  True, true.
05:35:50  you need a tiny bit of arithmetic and a branch for larger allocations
05:35:56  how does free() work
05:36:06  It doesn't.
05:36:06  madbr: it doesn't, gc
05:36:12  here's an impl of free
05:36:15  free(ptr) {}
05:36:17  oh heh
05:36:27  I see
05:36:30  fastest free() evar, I can prove it
05:37:05  it's not free once you have to gc though :D
05:37:36  madbr: no, but gc is faster than manual memory management for most cases :)
05:37:41  and @ has several nice properties that make it even faster
05:37:51  the trick is to line up gc with when the user blinks
05:38:01  lol
05:38:03  that's why front-facing cameras are so popular these days
05:38:07  I do not like the names "ecliptic longitude" and "ecliptic latitude" for those coordinates very much, since equatorial coordinates have "right ascension" and "declination".
05:38:11  monkeyofdoom: how does that work with sound code? :D
05:38:29  madbr: you should reuse your buffers there
05:38:44  I also have other ideas about Haskell instance disambiguation. I can write it in my user space in Haskell wiki.
05:38:45  underflow=baaad
05:39:00  madbr: i'm actually interested in making a concurrent gc so that gc pauses last a couple dozen cycles at most and having it decide which to use at runtime
05:39:07  but that's very hard, it'd need to swap out the allocator
05:39:17  yeah but what happens if some part of the app starts garbage collecting, which blocks off the sound generating thread?
05:39:17  since obviously you can't wait until you run out of pool to gc :p
05:39:34  madbr: this is per-thread; in @ threads are very very cheap, not like typical OS threads
05:39:38  they're more like lightweight coroutines
05:39:47  that just happen to be able to run on multiple cpus and are preemptive :p
05:39:52  you can have thousands of them, easily
05:39:56  was talking to monkeyofdoom but that sounds good yeah :D
05:40:10  so stopping a thread at a time isn't a big deal... but it is true that you can write a tight sound loop in a single thread and it doesn't work out
05:40:16  obviously if you avoid allocating it's fine but yeah
05:40:20  working on that :P
05:40:42  @ will probably be pretty nice for audio stuff too since it's like Synthesis in that you can get away with tiny buffers
05:40:51  with Synthesis that's because it did all kinds of tricks to minimise syscall overhead
05:40:52  normally you setup things so that the sound thread never has to allocate or deallocate
05:40:56  with @ it's because syscall overhead doesn't exist
05:41:28  so if you have a program that streams audio from the disk you have 2 threads :D
05:41:49  madbr: that's a bit harder with @, since the code would be in a purely functional language ... but you can certainly minimise allocations :)
05:42:20  oh
05:42:43  this actually makes @ more efficient in general
05:43:07  it completely avoids userspace<->kernel context switching, hardware rings, slow allocators, ...
05:44:04  Basically, it's removing all the abstraction layers that a decent language has to abstract again. :P
05:44:43  but yeah, @ especially excels at allocation and IO performance
05:44:51  which is pretty good for "realtimeish" code like audio
05:45:05  :|
05:45:22  hi quintopia
05:45:43  hi elliott
05:45:48  why the frowny
05:46:28  madbr: i'm also interesting in making the language expressive enough that you can e.g. limit dynamic allocation of a certain piece of code statically at compile-time
05:46:39  and if you break that contract the code won't compile
05:46:52  so you know if you fuck it up or if something you call fucks it up for you
05:49:09  it wasn't a frown
05:49:11  it was straight
05:49:20  and i posted it in almost every channel i'm in
05:49:23  for shits
05:49:29  but not giggles?
05:49:42  it's hard to giggle with a straight face
05:49:54  heh
05:50:23  Someone said that after I make dvi-processing package for Haskell, they might add DVI output to Pandoc. I looked at Pandoc and have other ideas too:
05:50:37  * MediaWiki format for input and output.
05:50:49  * ESC/P format for input and output.
05:51:19  * Pure ASCII format for output, with option for LF/CRLF, line wrap, and form feeds.
05:51:27  * Plain TeX format for output.
05:52:14  * Support additional URI schemes: data ftp gopher
05:52:30  * Plain Old Documentation (as Perl) input and output.
05:53:50  * UNIX manual page format input and output.
05:54:03  What is your opinion/comment/complaint about this please?
05:56:29  i'm sure he'd love patches
06:00:12  Wow. If you add up all countries' reported transactions, the world had $331 billion in net exports.
06:00:24  I didn't realise we were trading with, I dunno, Mars.
06:00:59  pikhq_, the article I read that from made pretty much the exact same comment
06:01:00  >.>
06:02:24  pikhq_: It's the compromise the Andromedans agreed to. The population at large remains blissfully ignorant.
06:02:32  Turns out the Earth has some interesting natural resources.
06:03:21  It looks like it has output MediaWiki and UNIX manual pages, but cannot input those formats. It also seem to only currently support "http" and "https" URI schemes.
06:05:24  Aren't the Andromedans [Ed story spoilers]
06:05:31  Wait, no
06:06:41  pikhq_: I was going to ask how coroutine implementations on Unix allocate tiny stacks while stopping coroutines from stepping on each other's stacks, then I realised that they just won't bother *sigh*
06:07:10  pikhq: stuff lost in transport?
06:08:28  woot
06:08:36  slowly working on a replacement for subtractive synthesis :D
06:08:36  I'm done implementing my subset-of-c++ compiler for class
06:08:39  it's so great
06:08:45  coppro: cool
06:08:46  I didn't want to write a register allocator
06:08:51  so all the work is done on the stack
06:08:57  (mips)
06:09:45  hmm, I think I've figured out an interesting CPU design
06:09:51  coppro: just do what all the cool kids do, assume there are infinite registers :)
06:10:06  Who is people making Pandoc, in #haskell channel?
06:10:22  essentially a RISC with a fast calculation unit
06:10:50  elliott: I have not confirmed this, but I suspect the prof has an expression with too many subexpressions to fit at some point
06:11:00  coppro: oh, i just meant internally
06:11:06  coppro: then you can really trivially use registers
06:11:12  elliott: yeah, I know
06:11:19  executes all the normal code in risc mode, then when it gets to a special loop that's optimised in handwritten assembly for the special execution unit, switches to that mode
06:11:22  coppro: you could just assign the first N virtual registers to the real ones if you want to claim to do register allocation :D
06:11:41  i think compilers will have really made it when they implement malloc() for register numbers
06:11:48  they will have reinvented
06:11:49  "the heap"
06:11:51  special execution mode is for doing sound mixing and graphic rendering loops
06:12:01  the kind of stuff that gets optimised in assembly anyways
06:12:10  elliott: well, there's a bonus which is to get code size down
06:12:30  special execution unit is a kind of vliw
06:12:36  elliott: I may go for a naive subexpression-based allocator
06:13:04  basically a whole bunch of mini-units that are a multiplexer + ALU + register
06:13:06  coppro: See, here I was going to suggest something like superoptimisation, if compile time isn't a criterion.
06:13:29  hahaha
06:13:32  madbr: That's a lot to lose in transport.
06:13:45  transport?
06:13:50  coppro: It would shorten complicated arithmetic!!!
06:13:55  madbr:  pikhq: stuff lost in transport?
06:13:56  Erm.
06:14:00  Yeah.
06:14:19  Sorry, I'm interspersing IRC with 10 minute SRS sessions ATM. :)
06:14:22  pikhq: ie the multiplexers would gobble up lots of space? :D
06:14:38  SRS
06:14:38  ?
06:15:08  elliott: I should add that we're on a sufficiently small subset of mips to make that almost irrelevant
06:15:09  pikhq_ is having the world's slowest sex resasignment surgery.
06:15:11  "Spaced Repitition System".
06:15:23  coppro: :-(
06:15:35  elliott: no bitwise ops, in particular
06:15:56  One rather obnoxiously good means of learning large quantities of things; I find it particularly handy in language acquisition.
06:15:58  elliott: btw when I mean all work, I mean all
06:16:03  elliott: Wouldn't that be a relatively fast sex reassignment surgery, given that it usually takes about five years or so?
06:16:22  but yeah on any given cycle, each ALU gets one opcode, executes it and the result is stored in the corresponding register
06:16:25  like, a = b + c first pushes b, then pushes c, then pops them and pushes b + c, then pops that and assigns to a
06:16:43  Darth_Cliche: I don't think a 5-year single period of surgery is involved :P
06:16:53  coppro: Congratulations! You're compiling to Forth!
06:16:55  and it reads the values for the ALU from other special unit registers
06:17:09  so essentially you specify a data flow
06:18:02  madbr: that's called a vector processor
06:18:22  don't vector processors essentially apply SIMD?
06:18:24   so essentially you specify a data flow ;; you mean a GPU? :P
06:18:39  I'm not familiar with GPU architecture :D
06:18:47  I think http://www.yosefk.com/blog/simd-simt-smt-parallelism-in-nvidia-gpus.html is relevant.
06:19:18  I don't like the fact that GPUs are on the other side of the bus and that you can only control them sorta indirectly
06:19:39  madbr: you'd like larrabee
06:19:44  also what amd are doing
06:19:52  everyone's gluing a cpu and gpu together :P
06:20:09  wow, larrabee isn't actually cancelled?
06:20:10  It's a rather obvious move when people start programming GPUs, TBH.
06:20:45  "Hmm. The PCIe bus is a major source of latency." "Can't we just stick it on the die?" "..."
06:21:03  We should just eliminate all buses.
06:21:14  Fuck public transport, the next CPU I buy better not require a motherboard.
06:21:26  It's just a CPU with a shitload of USB ports on every single side of it.
06:21:31  And a power lead.
06:21:51  elliott: Strictly speaking, the project was, but the fruits of it are going into production.
06:23:30  fruits of it?
06:25:12  One idea I have about Haskell instance override is like this (use scoped type variables):  module Example where { value1 :: Int; value1 = 2 + 3; value2 :: (Num x, x ~ Int) => x; value2 = (2 :: x) + 3; }  module Main where { import Example; instance Num Int where { _ + _ = 42; }; main = print (value1, value2); }
06:25:18  wasn't larrabbee basically a multicore pentium with a huge ass simd unit and some hardware multi-load and bilinear interpolate instructions? :D
06:25:46  but yeah my idea isn't actually SIMD
06:25:52  Maybe I am slightly mistake, though.
06:26:00  "Multicore" doesn't quite describe it.
06:26:18  more like a a hybrid between a FPGA and a CPU
06:26:42  madbr: specifying microcode isn't really fpga, if i understand your idea from reading half of every third line about it
06:26:44  A 48 core CPU.
06:27:09  elliott: the point of a fpga is that it's rather parallel
06:27:21  basically you create a bunch of components
06:27:21  madbr: Can you write a document of this idea please?
06:27:23  madbr: The point of an FPGA is that it's *specifying circuitry*.
06:28:02 -!- CakeProphet has joined.
06:28:03  It's a redesignable integrated circuit.
06:28:21  most components are basically a bunch of registers for which you specify "ok on next clock cycle this gets a value based on [other registers and math circuits]
06:28:27  from what I can tell
06:29:06  pikhq: well, yeah, but afaik almost any design is register based
06:29:27  zzo: hmm
06:29:41  zzo: probably yeah
06:29:54  suppose your processor has 32 units
06:31:12  for each unit, you specify an ALU opcode, and two source registers, and a cycle from which the data becomes "valid" (before that cycle, the register doesn't get written to)
06:31:18  oh well, time to read about the programmable pipeline
06:31:41  I guess it's a user programmable pipeline yeah
06:31:51  oh, wasn't talking about this :)
06:32:17  some of the units are special and can do memory reads
06:32:29  or memory writes
06:32:31  Can it reprogram itself, or must it be reprogrammed externally?
06:32:56  sgeo: it's programmed by the RISC part of the processor
06:33:37  so basically code reaches some part that needs beefy power, the risc processor fills in all the registers of the fast unit and kicks off execution
06:35:38  once that's done executing, control goes back to the risc part, that presumably reads out some values from the fast execution unit and cleans up and returns to C++ code
06:35:41  sigh, opengl is so complicated
06:36:14  elliott: sometimes that's required in order to make the api useful
06:36:34 * Sgeo just wants to know if they're arrows or not
06:36:35  >.>
06:36:41  arrows?
06:36:41  Sgeo: what is arrows
06:36:44  as in
06:36:47  what do you want to know whether is etc.
06:36:53  madbr: sure, but it's annoying when a large part of the complexity is gunk caused by the host language :)
06:37:20  elliott: at least it's not oop :D
06:37:33  well, there's that
06:37:34  FPGAs. As far as I understand, circuitry can be represented with arrows, unless the circuit can modify itself
06:37:54  Sgeo: there are arrow dsls for hardware design in haskell yes i believe
06:38:03  sgeo: ah
06:38:24  sgeo: isn't an arrow basically "on next cycle this register takes [value whatever]" ? :D
06:38:27  Sgeo: but a york lava-style approach is nicer, arrows suck :P
06:38:35  madbr: http://www.haskell.org/ghc/docs/latest/html/libraries/base/Control-Arrow.html
06:38:40  elliott, but can FPGAs be represented by such, or are they capable of reprogramming themselves in a way that would require ArrowApply?
06:38:59  Sgeo: FPGAs can't be reprogrammed at runtime, obviously. and it's not clear what you mean by "represented by"
06:39:09  Ok, that answers my question
06:39:11  Sgeo: obviously you can't write idk (Clock ~> OutPorts)
06:39:13  because of arr
06:39:27 * Sgeo is starting to dislike arr >.>
06:39:32  I don't know haskell so dunno
06:39:34  Not just because of this
06:39:48  Sgeo: here's some life advice: just skip the interim steps and start disliking arrows
06:39:52  a good way to do this is to try and use arrows
06:40:00  but essentially it has something like arrows yeah
06:40:10  york lava?
06:40:33  essentially the code would look something like
06:40:53  Sgeo: http://www.cs.york.ac.uk/fp/reduceron/memos/Memo23.txt, http://hackage.haskell.org/package/york-lava
06:40:57  (first link is more helpful)
06:41:06  r[0] <= r[x] {OPERATOR} r[y]
06:41:09  r[1] <= r[x] {OPERATOR} r[y]
06:41:11  r[2] <= r[x] {OPERATOR} r[y]
06:41:12  Sgeo: the reduceron is written in it
06:41:13  ...
06:41:17  r[31] <= r[x] {OPERATOR} r[y]
06:41:18  madbr: that's not what haskell arrows are :P
06:41:30  then it's not haskell arrows :D
06:41:36  it's VHDL arrows basically
06:41:54  r[32] <= memory[r[x]]
06:42:30  memory[r[x]] <= r[y]
06:42:53  But something of type Bit -> Bit -> Bit should be opaque, how can a compiler determine what it is?
06:42:56  Or is it not really ->/
06:43:04  ?
06:43:22  Sgeo: hint: Bit isn't Bool
06:43:33  data Bit =
06:43:33    Symbol { componentName :: String
06:43:33           , numOutputs    :: Int
06:43:33           , parameters    :: [Parameter]
06:43:33           , inputs        :: [Bit]
06:43:34           , instanceRef   :: IORef (Maybe InstanceId)
06:43:36           , outputNumber  :: OutputNumber
06:43:38           , outputSignal  :: Signal
06:43:40           }
06:44:09  Um, hmm. So <&> takes a bit that knows it was made of two bits?
06:44:13  Erm, makes, not takes
06:44:14  what
06:44:17  yes
06:44:26  Hmm, cool
06:44:29  (the IORef there is for observable sharing... uses unsafePerformIO, but the Kansas Lava team published a safer, unsafePerformIO-less observable sharing implementation later on, so it's nothing fundamental)
06:44:39  (and ofc the external interface is pure)
06:44:56  Sgeo: the primitives look like this basically:
06:45:06  -- | Inverter.
06:45:06  inv :: Bit -> Bit
06:45:06  inv a = makeComponent "inv"
06:45:06        {-   Inputs: -} [a]
06:45:06        {-  Outputs: -} 1
06:45:07        {- Simulate: -} (\[a] -> [map not a])
06:45:09        {-   Params: -} []
06:45:11        {- Continue: -} (\[o] -> o)
06:45:13  -- | D-type flip-flop, with initialiser (first argument).
06:45:15  delayBit :: Bit -> Bit -> Bit
06:45:17  delayBit init a =
06:45:19      makeComponent "delay"
06:45:21    {-   Inputs: -} [init, a]
06:45:23    {-  Outputs: -} 1
06:45:25    {- Simulate: -} (\[init, a] -> [head init:a])
06:45:27    {-   Params: -} ["init" :-> getConst (componentName init)]
06:45:29    {- Continue: -} (\[o] -> o)
06:45:31  ehh.... that is longer than it looked
06:45:33  sorry for flood
06:46:11 * Sgeo doesn't quite grasp the details
06:46:16 -!- zzo38 has left.
06:46:20 * Sgeo should go to sleep
06:46:37  Sgeo: it just records a bit symbolic description of the logic tree basically
06:46:43  and then writes it out as a million-line VHDL file
06:46:53  (ok not a million lines but the reduceron was like ... a ridiculous number of lines)
06:46:59  (and they all look like a <= some_primitive(b,c) :P)
06:47:06 * Sgeo could make something similar for AW stuff!
06:47:10  >:)
06:47:13  die die die
06:47:20  so yeah anyways, the idea is that you'd write the tight loops in assembly for the "very fast execution" unit and the rest in C++ to run on the RISC part
06:48:01  just like a SIMD coprocessor :D
06:48:12  Real hardware bores me
06:48:16  and it would get potentially more operations per cycle than the SIMD
06:48:19  Give me virtual worlds any day
06:48:21  sgeo: oh?
06:48:43  what are you into, networks or what? :D
06:49:11  Think Second Life, things like that
06:49:25  never tried SL
06:49:32  heard it was for RP mostly
06:49:43 * Sgeo doesn't really roleplay
06:51:06  well, I heard about it mostly from furries so that would explain heh
06:51:27  That's probably the most *lasting* class of use for it.
06:52:01  Otherwise, well, you've got rather stupid "ZOMG ALTERNATE CURRENCY" morons, and people there for the novelty.
06:52:08  As you can imagine, that doesn't last long.
06:52:16  So, yeah, I suppose by now it mostly is for RP.
06:52:21  well, that's just a pyramid/zero sum game
06:52:37 * Sgeo is mostly there for scripting and talking
06:52:46  whereas for RP their other alternatives are basically IRC and other chat programs
06:53:02  I've made a negligible, but non-zero, amount of money in SL
06:53:12 * Sgeo still has yet to convert it to RL currency though
06:53:34  is it 3 cents
06:53:35 * Sgeo isn't in it for the money though
06:53:44  Something like $200
06:53:47  Sgeo what's the capital of second life called
06:54:21  Capital, as in currency? Lindens, or Linden
06:54:25  *Linden dollars
06:54:27  no as in
06:54:28  capital
06:54:35  tried a MUCK once, was kinda depressing
06:54:47  elliott, not entirely sure that that's meaningful
06:54:54  lame
06:54:56  whats the place where you enter
06:55:04  madbr: you can also RP in MMORPGs!
06:55:09  I think there are several, randomly chosen
06:55:13  It changes
06:55:14  SIGH
06:55:17  essentially an IRC chat channel, plus the rest of the world was some kind of dead scripted thing
06:55:21  i give up on making this cheap occupy wherever that is joke
06:55:30  Occupy Grid?
06:55:36  oklopol: not playing those, ever :D
06:55:37  yes, that. wow that sounds so fucking stupid.
06:55:40 -!- Darth_Cliche has quit (Quit: You are now graced with my absence.).
06:55:43  like i'm envisioning it as a wireframe
06:55:44  and its the 90s and
06:55:44  madbr: who would
06:55:50  oh god what im thinking of is cybertown Sgeo and i hate you
06:55:51  and i hate the 90s
06:55:54  and the 90s should be obliterated
06:56:02  Well, the grid represents the whole SL ... universe
06:56:07  YOU'RE A UNIVER
06:56:08  ASE
06:56:12  univer-ASS!!!!!!
06:56:15  cry
06:56:23  dunno, I dislike music from about 1995 to 2010 :D
06:56:23  elliott: oh right because you never got to see them because you're 12
06:56:27  elliott, Cybertown is not a part of Second Life
06:56:29  no i'm 9
06:56:30  and a half
06:56:35  i age backwards
06:56:36  Cybertown does have a City Hall
06:56:43  madbr: what happened in 2010
06:56:53  Sgeo: YOU'RE A PART OF SECOND LIFE.
06:57:16  elliott: well, I haven't heard too much of the 2010's music yet so I'm not judging :D
06:57:36  but what I've heard so far I don't like too much
06:57:41 -!- CakeProphet has quit (Ping timeout: 240 seconds).
06:57:43  so I guess I am judging, ha
06:57:54 * elliott wonders if madbr is actually listening to a representative sample of all music released in 2010.
06:58:01  course not
06:58:05  Boring.
06:58:18  If we're lucky, he's listening to a representative sample of all music that hit top 40 radio in 2010.
06:58:26  And if he did *that*, then of course he wouldn't like it.
06:58:27  :P
06:58:47  Hint: the charts do, and basically have always, sucked.
06:58:50  elliott, anyways, AW does have a specific entry point, AWGate, and a specific huge world that a lot of people used to build in, AW (Alphaworld)
06:58:58  So, Occupy AWGate?
06:59:03  Sgeo: yes, but nobody has ever made money from activeworlds
06:59:05  or enjoyment
06:59:07  or happiness
06:59:12  all they have made is their soul a little more dead on the inside
06:59:30  There used to be huge protests in AW
06:59:35  Due to price increases
06:59:36  well have activeworlders ever made money off the real world?
06:59:42  maybe it just separates better.
06:59:45  Sgeo: like i said
06:59:46  dead inside
06:59:55  oklopol have you tried being dead inside its so great
06:59:59  heh money in virtual worlds
07:00:04  it's a zero sum game
07:00:25  There's money in Cybertown
07:00:33  That has no relation to RL money whatsoever
07:00:40  elliott: it's great for a while
07:01:57  but yeah anyways, in a normal processor, you'd go:
07:02:21  load r0, [r1]
07:02:23  does anyone know opengl shit
07:02:33  I know some
07:02:37  add r0, #16
07:02:48  madbr: programmable pipeline?
07:02:56  str r0, [r1]
07:03:00  add r1, #4
07:03:15  elliott: not anything about shaders or stuff no unfortunately
07:03:23  right, that's what i'm interested in :p
07:03:34  what are you drawing?
07:04:20  tons of stuff, theoretically :P I'm more interested in the high-level details of the pipeline, because I'm playing about with a certain library I want to write...
07:05:14  in the slice processor (the kind of processor I've been talking about), you'd have:
07:05:30  elliott: i know pretty much everything about opengl
07:05:38  it means open graphics library
07:05:41  oklopol: thx
07:06:06  oklopol: i had to check that just because i doubt you so much
07:06:20  wow.
07:06:31  well i did just pull that from my rectum
07:06:36  so maybe that was a good idea
07:06:48  gtg
07:06:54  farewell oklopol
07:07:00  remember not to die...
07:07:04  uu
07:14:13  r0 <= r0 + 4
07:14:14  r1 <= r1 + 4    [start at cycle 2]
07:14:14  r2 <= r2
07:14:14  r3 <= r32 + r2
07:14:14  r32 <= mem[r0]
07:14:14  mem[r1] <= r3   [start at cycle 2]
07:14:35  (all of these operations happen together, on each cycle)
07:15:55  essentially this takes a buffer of 32bit numbers and increments each one by the value in r2
07:16:15  r0 and r1 are initialized to the data start address
07:16:46  there's also a loop count register
07:18:01 -!- derrik has joined.
07:20:23  essentially, thanks to out of order execution, you can get more or less that type of execution on a pentiumII and later family processor
07:21:09  since you get up to 3 ALU operations and afaik 1 load 1 store and some other operations, plus FPU or SSE operations, on any given cycle :D
07:25:57 -!- madbr has quit (Ping timeout: 276 seconds).
07:30:35 -!- madbr has joined.
07:30:42  damnit
07:31:32  anyways, that's it for the data flow oriented language
07:32:27  the idea being to come up with something that should be simple enough to implement in VHDL or something but allow for fast processing :D
07:32:42  eh, did I say language
07:32:43  ?
07:32:47  I mean processor
07:39:01 -!- madbr has quit (Read error: Connection reset by peer).
08:01:21 -!- copumpkin has quit (Ping timeout: 252 seconds).
08:01:46 -!- copumpkin has joined.
08:08:28 -!- andrew12 has joined.
08:11:00  `@ andrew12 ? welcome
08:11:07  andrew12: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
08:11:14 * elliott is the best at precision welcome attacks.
08:11:33  hello.
08:11:40 * shachaf never got a warm welcome like that.
08:12:00  i was half expecting this room to be very dead
08:12:14  No one spoke in here for months until you came in.
08:12:26  i doubt that
08:12:29  andrew12: It's pretty active :P
08:12:33  That's why we're so excited.
08:12:41  It's active but the topic is never esoteric languages.
08:12:53 * elliott checks our recent log sizes... yeah, still always 100-200 kilobytes per day
08:13:11  I spend too much time at IRC.
08:13:18  At IRC?
08:13:31  > chr 67
08:13:32    'C'
08:14:31  andrew12: Mind you, we're not on-topic all that often.
08:14:44  that's not a problem :p
08:14:44  But the world of esolangs isn't exactly the fastest-moving beast.
08:14:49  yeah
08:14:55  except me, i'm always on topic
08:15:11  `log [^]]
08:15:28  HackEgo: Stop being so slow.
08:15:37  2008-06-13.txt:00:46:23:  also who it a tome, a small one
08:15:47  what
08:15:55  fungot: Stop being so slow.
08:15:56  shachaf: but it is your journey i am just not old enoug)( to )(ave t)(ose are your black leanings, much as the moon takes liberty. reason. justice. civility. edification. perfection.
08:16:01  `log [^]]
08:16:06  What's with the ] ?
08:16:07  Reason. Justice. Civility. Edification. Perfection. --fungot
08:16:08  elliott: really, it is a free card in your sylladex
08:16:08  ^style
08:16:09  Available: agora alice c64 ct darwin discworld europarl ff7 fisher fungot homestuck* ic irc iwcs jargon lovecraft nethack pa sms speeches ss wp youtube
08:16:10  2007-09-07.txt:15:09:36:  lol
08:16:12  i never said that
08:16:12  ^style irc
08:16:12  Selected style: irc (IRC logs of freenode/#esoteric, freenode/#scheme and ircnet/#douglasadams)
08:16:14  `log [^]]
08:16:14  fungot: Say hi to andrew12.
08:16:15  elliott: mmm... real lambda.... eval don't work?)
08:16:19  ^source
08:16:19  http://git.zem.fi/fungot/blob/HEAD:/fungot.b98
08:16:20  2008-04-26.txt:21:35:27:  what's the difference between a function and a thing that receives a message?
08:16:20  this is something crazy i'm guessing
08:16:22  `log [^]]
08:16:28  2011-10-02.txt:06:48:41:  .,admin + elliott
08:16:29  so many bots
08:16:31  This channel is pretty much #botspam
08:16:32  Oh no, it's the "someone new joined, let's use the bots forever" thign.
08:16:34  thing.
08:16:44  andrew12: Yeah, but only one of them is written in Befunge.
08:16:45  Actually, this channel is pretty much #elliottandhisaudience
08:16:51  X-D
08:16:54  lol
08:17:02  `run for i in $(seq 5); do echo "and only this one runs arbitrary Linux commands"; done
08:17:03  Actually it's pretty much #haskell
08:17:04  and only this one runs arbitrary Linux commands \ and only this one runs arbitrary Linux commands \ and only this one runs arbitrary Linux commands \ and only this one runs arbitrary Linux commands \ and only this one runs arbitrary Linux commands
08:17:08  well that's a natural step after hey let's be interesting and realizing we're not
08:17:20  elliott: That's not a Linux command!
08:17:22  !bf_txtgen Only this one does esolang stuff?? EgoBot is pretty useless.
08:17:26  this is something crazy i'm guessing
08:17:27  ​691 +++++++++++++++[>++>++++++++>+++++>+++++++<<<<-]>>>++++.>+++++.--.<<+.<++.>-----.>+++++++++++++++++++++++++.+.<-.<.>----.>+++++.>-------.<<<.>>>-.<<.----------.>+++++.<<.>.>.----.---.<----.>>++++++++++.<<++++++.<.>>+++++++.+.+.>--------.<<-.<+++++++++++++++++++++++++++++++..-------------------------------.+++++++++++++++++++++++++++++++++++++.>+.++++++++.<---.>.+++++.<----------------------------------.>>>+++.<<-.<.+++++++++++++++++++++++++++++++++++++++++
08:17:31  erm
08:17:34  `log [^]]
08:17:38  Right, now we've abused all the bots, we can stop now.
08:17:40  2007-10-05.txt:20:07:04:  hmm, sorry then
08:17:41  Dammit oklopol.
08:17:53  but that thing obviously garbles the lines
08:17:59  What is the ]?
08:18:10   also who it a tome, a small one
08:18:14  Sgeo: huh?
08:18:15  why did i say that
08:18:21  let's spend the whole day wondering
08:18:27  elliott: EgoBot ought to generate optimal programs. Kolomogorovically speaking.
08:18:29  We're giving andrew12 a super good first impression, here.
08:18:31  [^]]
08:18:36 * shachaf will complain until someone implements it.
08:18:36  What's with the second ]?
08:18:41  Sgeo: [^]] = [^\]]
08:18:57  [^]] matches any  not preceded by ]
08:19:01  but the  in that line is itself preceded by ]
08:19:12  so you avoid HackEgo's annoying tendency to spit your line back at you as the result
08:19:18  Oh, I see
08:19:21  elliott: Any  preceded by a character that is not ], rather. :-(
08:19:27  I misparsed it as somehow trying to find the first instance
08:19:37  shachaf: Shhh, this is #esoteric, we don't do that fancyspeak.
08:19:39  Lern2lookbehind
08:19:59 * elliott instantly hears the Look Around You theme in his head.
08:20:07  Only because I read it as "look around".
08:20:19  Look Behind You would be a significantly more disturbing name for a show.
08:21:30  Such an amazing show.
08:21:32  elliott: could you please paste me the context of that tome line so i don't have to do anything
08:21:59  00:46:07:  who me a situation where it's bad if it means the same thing
08:21:59  00:46:11:  *show
08:21:59  00:46:14:  also who it tome
08:21:59  00:46:16:  *to me
08:21:59  00:46:23:  also who it a tome, a small one
08:22:03  Hope that clears things up.
08:22:29  `addquote  also who it a tome, a small one
08:22:32  727)  also who it a tome, a small one
08:22:47  I can feel our QDB improving with each passing moment.
08:23:00  wwwhat
08:23:08  oh
08:23:09  doesn't tome mean book?
08:23:09  .
08:23:35  elliott, update
08:23:48  i don't think i've ever seen a typoness of that badly.
08:23:50  elliott is actually our most sophisticated bot.
08:23:58  so badly typoness.
08:24:05  I'm written in SNOBOL.
08:24:21  He accepts commands that contain "@" in them and say anything negative, and responds with simulated anger.
08:24:27  there's always this one: http://bash.org/?5300
08:24:31  It's a lot of fun until you get tired of it.
08:24:39  hah
08:25:12  No one mentioned poor lambdabot, speaking of bots that accept @-commands.
08:25:36  > 10 "I run BASIC commands."
08:25:37    10
08:25:45  (It responds with the line number if the command executed correctly.)
08:28:01  elliott: I don't think a string is a correct BASIC command.
08:28:08  That's the comment syntax, duh.
08:28:11  Haven't you ever used Smalltalk?
08:28:12  > 10 Blah
08:28:13    Not in scope: data constructor `Blah'
08:28:22  Sgeo: It's BASIC, everything has to be IN CAPITALS.
08:28:42  Derp
08:28:48  elliott, funny
08:28:51  I assume everyone is familiar with augustss's various abominations so there's no point in me mentioning them.
08:29:00  shachaf: I love those.
08:29:01  shachaf, I've heard of them
08:29:16  Sgeo: http://augustss.blogspot.com/2009/02/more-basic-not-that-anybody-should-care.html
08:29:35 * Sgeo somehow didn't notice that it was lambdabot
08:30:04  ExtendedDefaultRules?
08:30:16  andrew12, for clarification, lambdabot does not in fact run BASIC
08:31:07  i see
08:31:08  Sgeo: No one claimed that it did. We're just talking in an esoteric language which happens to resemble English in syntax.
08:32:24  shachaf: It's weird how most people don't notice that until we startodifjasj ojrpwer pdsfa kallq fklerg.
08:32:33  andrew12 oppq ner.
08:33:15  eh?
08:33:37  Yse.
08:33:41  That was actually a typo.
08:33:44  But let's leave it like that.
08:33:52  We're not usually this weird, I swear. Well, that might be a lie.
08:34:14  i'm in weirder rooms
08:34:18  trust me, :P
08:34:24 * Sgeo finds that difficult to believe
08:34:28  elliott: Usually much weirder, eh?
08:34:42  Sgeo: Oh please, we're not usually this interesting.
08:34:49  If "interesting" is the right word to use.
08:35:07  We're a boring, stately freenode enterprise that pretends we're wacky because we talk about esolangs.
08:35:19  Also, you all suck.
08:35:57  elliott: u mad?
08:36:02  See?
08:36:05  That's elliott's favorite expression.
08:36:20  "That's elliott's favorite expression." is shachaf's favourite expression.
08:36:33  It is important to keep in mind the difference between someone's favorite expression and their favourite expression.
08:36:53  "post-ironic, a.: When one's ironic appreciation of something becomes genuine, usually due to either prolonged exposure or the enjoyment derived from how amusingly terrible it is."
08:37:04  ellioutt: I agree.
08:37:39  so, i've written a brainfuck interpreter and debugger in ruby.
08:37:57  https://github.com/andrew12/brainfuck
08:38:17  andrew12: Wait, is that, like, a new esolang or something?
08:38:27  brainfuck? totally
08:38:48  You should make a dialect which is identical in semantics but uses slightly different syntax to express the eight operators.
08:38:55  elliott is a fan of those.
08:39:04  That's such a novel idea.
08:39:30 * elliott links andrew12 to https://bitbucket.org/lifthrasiir/esotope-bfc/overview, because that's just what he does whenever the topic of brainfuck implementations comes up.
08:39:51  elliott: It's National Novel Idea Month, man!
08:40:03  That's a month?
08:40:25  NaNoIdMo!
08:40:46  I prefer NaNoSuperEgoMo.
08:41:11  I typed that in and then decided that it was too tacky to say. :-(
08:41:17  That's every month for you, Sir Hubris.
08:41:26  shachaf: The solution is to not have standards.
08:41:29 * elliott recommends it.
08:42:19  honor favorite gray
08:42:34  Also, dammit, now I'm rewatching "Look Around You".
08:42:53  Well, "dammit"'s not the right phrase, as that is wonderful.
08:43:02  We need Ngevd here to provide some youthful enthusiasm to stop us spiralling down the interminable ... spiral ... self-hatred.
08:43:29  Is Ngevd youthful, or just Ngevd's enthusiasm?
08:43:59  aluminum
08:44:04  What a vile word, aluminum.
08:44:09  I wouldn't call Ngevd old and oh god I just realised what you're doing.
08:44:17  I thought "honor favorite gray" was just... I don't know, you're weird.
08:45:05 * elliott honours his favourite Grey.
08:45:12  http://upload.wikimedia.org/wikipedia/commons/3/32/Alienigena.jpg
08:45:13 * elliott honour.
08:45:17  elliott: Why don't you write him a check?
08:45:53  Maybe give him a donut and go to the theater together.
08:46:09  andrew12: Your first task as a newbie is to distract shachaf.
08:46:35  shachaf: Look, a distraction!
08:46:39  elliott has very -- I wouldn't call them *high* standards, exactly, but they're very far off to the side.
08:48:36  So they're...
08:48:43  #########
08:48:43      #
08:48:43  ########
08:48:43   
08:48:43  #######
08:48:44   
08:48:45  ######
08:48:47  # #  #
08:48:49  ###
08:48:51   
08:48:53  ######
08:48:55    #
08:48:57  #####
08:48:59  standards?
08:49:01  Wow, that's the worst sideways ASCII art lettering anyone's ever done.
08:50:07  shachaf: I think what you're looking for is nonstandard standards.
08:50:23  The nice thing about elliott's standards is that there are so many to choose from.
08:50:38  :-D
08:52:16  But eso-std is down!
08:52:53  elliott: Is there a pattern to when you capitalize your sentences or don't?
08:52:57  Yes.
08:53:09  Ewwww, this Haskell binding forces me to explicitly free these simple memory resources.
08:53:11  shachaf: Fix it.
08:53:25  Yes, sir, right away, sir.
08:53:31  Done.
08:54:19  Thanks.
08:54:39 * shachaf wonders whether elliott will now turn on him, like in that one comic.
08:55:01  It is a mystery.
09:00:18 -!- hagb4rd has quit (Quit: Nettalk6 - www.ntalk.de).
09:15:27 -!- sebbu2 has joined.
09:15:27 -!- sebbu2 has quit (Changing host).
09:15:27 -!- sebbu2 has joined.
09:18:29 -!- sebbu has quit (Ping timeout: 240 seconds).
09:19:10 -!- pagnol has joined.
09:19:57 -!- GreaseMonkey has quit (Quit: The Other Game).
10:01:45 -!- monqy has quit (Quit: hello).
10:01:50 -!- Phantom_Hoover has joined.
10:11:33  lambdabot...
10:11:34  Phantom_Hoover: You have 9 new messages. '/msg lambdabot @messages' to read them.
10:15:53 * shachaf isn't sure he wants to know.
10:15:59  I suspect elliott, though.
10:16:06  It was lambdabot.
10:16:09  Talking to Phantom_Hoover.
10:16:11  It's pretty creepy.
10:18:20  And her in a relationship with CakeProphet, too.
10:23:29 -!- Jendas has joined.
10:25:47  Please, can anybodey help me? I´m not able to identify one particular code, I need to determine, by which esolang is it written
10:26:21  cool
10:26:24  for what purpose :P
10:26:57  it´s a kind of cipher O:-)
10:28:48  I need to decrypt it
10:29:00  pastebin the code?
10:29:04  Is this a puzzle from some website?
10:29:52  Yes, it is. If you know geocaching.... Frend of mine, made it :-D
10:29:54  Ok w8
10:30:12  +++v+[->++++++++++<]>+++++++++.+<[-]++++++[->++++++++++<]>+++++.+.>++++
10:30:12  [->$++++++++<]>.<<----.<+++[->-----<]>.+++++++++++++++++.++.>>.<<<++[->
10:30:12  ---$--<]>-.<++[->+++++<]>.>>.<<-----------.++++++++++++..----.>>>++++++
10:30:12  +++$++[->+++++<]>+++.-----------..<<<<+++++++.------.<++++[->----<]>.>>
10:30:12  >>- .<<<<<+++++++++++[->++<]>.+++.>>>>.@<<<<<+++++[->-----<]>++.>>>>>+++
10:30:12  +++ ++++ . [-]
10:30:13  [  > 55+5*, 99*9+55+2*+ , 87*54*+64*+, 48*:, v
10:30:14    v  ,: ,+2 ,:*2+7**552   ,-*35 ,:**782 #    <
10:30:14    > 2255***5+::, 25*+, 84*, "/z",, 2-, v
10:30:14    v, ++**25*25*251<                    5
10:30:14  >$ $552**7+2*,v   |:-1< 3 ,,"/",:**33+6<
10:30:16  ^ >#             #<   ^
10:30:16     v,+*35,"dd"<
10:30:17     > "om.",,,"s"1-, 54*3+5*,"a"4+, 55+, ^
10:30:21  Jendas: Pastebin, not Ctrl+V.
10:30:47  y, sorry
10:30:51  ^source
10:30:51  http://git.zem.fi/fungot/blob/HEAD:/fungot.b98
10:31:15  Jendas: Well, the first part is definitely valid brainfuck code.
10:31:18  http://pastebin.com/DyQW1VwC
10:31:39  Oh, the whole thing is.
10:33:22  y, i fought that, it seemed to me like that, but the second part?
10:33:56  Well, brainfuck ignores all invalid instructions. So it could just be a brainfuck program designed to look like something else.
10:34:01  Have you tried running it?
10:34:14  not yeat
10:34:16  t
10:34:27  yet* sorry, it´s dark in here :-D
10:34:36  Running it is a good way to find out if it's a brainfuck program :P
10:35:10  i´ve tried to run it as fish... and something else. ok, i´ll try
10:35:32  fish?
10:35:41  Looks like it's a Brainfuck/Befunge polyglot.
10:36:30  With the Befunge contained in a [-][] to shield it from execution as BF.
10:36:49  yes, befunge, this was the second one
10:37:20  What does + do on an empty stack?
10:37:25 * elliott isn't sure what you're asking, if you know what the languages are already.
10:38:06  well i´m asking coz i didn´t work :-(
10:38:24  What didn't?
10:39:34  running it as fish or befunge. I didn´t run it as brainfuck, coz it looked like that, but had a lot of extra expressions in it...
10:40:22  Extra expressions don't stop it from being BF
10:40:24 -!- hagb4rd has joined.
10:40:24  It definitely looks like valid Befunge; try using a different interpreter.
10:40:35  Sgeo, yes, this was established about a page ago.
10:41:31  I know it now... you know, it´s confusing for me, it´s my first time in esolang
10:42:24  And phantom, would you please recommend me one?
10:42:56  elliott will yell at me if I say anything other than 'Shiro', so Shiro.
10:43:03  Shiro doesn't even do Befunge-93.
10:43:15  Jendas: http://catseye.tc/gallery/esolangs/yoob/
10:43:19  Do we know it's 93?
10:43:27  is the one the creator of the language wrote.
10:45:34  elliott - thanks a lot :-)
10:46:51 -!- elliott_ has joined.
10:46:59 -!- elliott has quit (Read error: Connection reset by peer).
10:47:22  Phantom_Hoover: Popping an empty stack gives 0, so + on an empty stack pushes 0
10:49:14  It seems that that polyglot is intended a puzzle of some kind
10:49:37  oh, it worked! Thank you so much :-)))
10:50:18  $ bf arst.b98
10:50:19  1st part is http://wqa.wz.c
10:50:21  $ ccbi arst.b98
10:50:22  2nd part is z/gc/coords.morse
10:52:21 -!- BeholdMyGlory has quit (Ping timeout: 244 seconds).
10:53:40 -!- BeholdMyGlory has joined.
10:56:52  thank you guys! :-))
11:00:26 -!- CakeProphet has joined.
11:00:26 -!- CakeProphet has quit (Changing host).
11:00:26 -!- CakeProphet has joined.
11:00:43  01:54 < Sgeo> Capital, as in currency? Lindens, or Linden
11:00:45  I lol'd
11:01:03 -!- derrik has quit (Quit: back to 3D).
11:07:24  https://mediastream.cern.ch/MediaArchive/Photo/Public/2008/0804060/0804060_04/0804060_04-A4-at-144-dpi.jpg
11:07:36  This is the LHC's entire hydrogen supply.
11:07:47  X-D
11:07:54  That's amazing.
11:08:26  Oh, I just noticed the "A proton source" sign.
11:08:51  Phantom_Hoover: Nononono it's like "Proton Source A".
11:08:54  here is no Proton Source B.
11:08:59  s/^/T/
11:09:03  (Also there might be some more bottles, but eh.)
11:21:08 -!- Zuu has joined.
11:37:39 -!- Vorpal has joined.
11:47:01 -!- sebbu2 has quit (Read error: Connection reset by peer).
11:47:23 -!- sebbu2 has joined.
11:47:23 -!- sebbu2 has quit (Changing host).
11:47:23 -!- sebbu2 has joined.
11:52:21 -!- derdon has joined.
11:53:10 -!- Phantom__Hoover has joined.
11:54:41 -!- sebbu2 has changed nick to sebbu.
11:54:53 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds).
11:58:53 -!- Phantom__Hoover has quit (Ping timeout: 240 seconds).
12:00:28 -!- quintopia has quit (Ping timeout: 248 seconds).
12:01:11 -!- Phantom__Hoover has joined.
12:01:28 -!- quintopia has joined.
12:01:28 -!- quintopia has quit (Changing host).
12:01:28 -!- quintopia has joined.
12:05:45 -!- Phantom__Hoover has changed nick to Phantom_Hoover.
12:08:10 -!- Jendas has left.
12:36:40  fizzie: http://www.qwantz.com/everywordindinosaurcomicsOHGOD.xml
12:36:44  fizzie: Need I say more?
12:36:53  fizzie: I'll write the script.
12:36:58  Phantom_Hoover: PREPARE YOURSELF.
12:37:09  Also, don't open that in Chrome.
12:37:10  Or Firefox.
12:37:12  Or anything.
12:38:53  Gleh, it: only has the first four years (i.e. less than half the comic).
12:38:55  Phantom_Hoover: Sadden with me.
12:40:19  Oh, I can just scrape the OhNoRobot archives.
12:56:25  Heello.
13:01:18  names = ['T-Rex', 'T:Rex', 'T-Blech', 'Utahraptor', 'Dromiceiomimus',
13:01:18           'Dromeciomimus', 'Dromeceiomimus', 'Narrator', 'Ye Olde Narratore',
13:01:18           'The House', 'House', 'Woman', 'Man', 'Human', 'Off-screen',
13:01:18           'Off-Camera Person', 'Monocle guy', 'Tyrones', 'God']
13:01:26  Phantom_Hoover: THESE TRANSCRIPTS ARE OF SUCH HIGH QUALITY
13:01:43  Yes.
13:01:53  Phantom_Hoover: OK I give up, Dinosaur Comics literally has too many characters to list.
13:02:04  Mammuthus Primigenius: Of course not!
13:02:04  Mammuthus Primigenius: It's clearly implied that it takes place in an alternate universe where dinosaurs can talk!
13:02:04  Ground Sloth: So just assume it takes place in a world where Batman, make-outs, and talking dinosaurs co-exist.
13:02:04  Mammuthus Primigenius: I...
13:02:04  Mammuthus Primigenius: I call it "Earth-Perfect."
13:02:06  Lady: Ha ha no thank yooou!
13:02:08  I CAN'T ADD ALL THESE
13:09:23  [elliott@dinky qwantz-scraper]$ wc -l qwantz
13:09:23  25225 qwantz
13:09:24  Yessssss.
13:14:25 -!- Ngevd has joined.
13:14:30 -!- Ngevd has changed nick to Taneb|Hovercraft.
13:14:52  Hello
13:17:09  Hi Taneb|Hovercraft.
13:17:19  I'm afraid the IWC style is about to be usurped by the BEST STYLE YET.
13:17:28  Namely?
13:17:42  DINOSAUR COMICS
13:17:50  !!!
13:18:31  BEHOLD A SNAPSHOT OF THE FUTURE
13:18:37   frig frig frig frig frig frig frig frig frig frig frig frig frig frig frig frig frig frig frig frig frig frig frig frig frig frig frig
13:18:37  elliott_: so noted. i'll drop it.
13:19:04  fungot, you can't fight fate
13:19:05  Taneb|Hovercraft: program design is still a decent amount of unity and consensus on the format...
13:19:24  elliott_, fungot is scaring me
13:19:25  Taneb|Hovercraft: differences in syntax. for the rest of which seems to be the fashion, you published said brain-log on the world
13:19:38  Taneb|Hovercraft: It does that a lot.
13:20:40  It's almost able to pass a Turing test
13:22:08  fungot, are you a bot?
13:22:09  Taneb|Hovercraft: http://www.codu.org/ fnord stuff if you'd like to see the quote, but people keep telling that to it.
13:22:26  ...
13:22:28  ^style
13:22:28  Available: agora alice c64 ct darwin discworld europarl ff7 fisher fungot homestuck ic irc* iwcs jargon lovecraft nethack pa sms speeches ss wp youtube
13:23:46  oh no
13:29:11  I think the problem with all my esolangs so far has been their minimaliness
13:29:48  None of them are anywhere near the scale of Befunge or ORK
13:30:48  Except for Uniquode, but that's nowhere near completion
13:32:46  I think Uniquode will be completed around the time when Microsoft PowerPoint has been ported to @
13:32:59  Taneb|Hovercraft: That will be the day I destroy @.
13:33:20  Taneb|Hovercraft: Anyway trust me you don't want to aim for more bloated designs.
13:34:09  My esolang with the most commands I think is Brook
13:34:18  And that has what? 10?
13:34:21 * elliott_ finally takes a look at Brook.
13:34:38  NOOOO
13:35:16  The article is awfully written
13:35:36  It is.
13:35:41  I take it c is the append-to-program instruction?
13:35:50  I think so
13:35:53  (diff) (hist) . . N UglyBF‎; 13:33 . . (+695) . . 92.148.109.67 (Talk) (creation)
13:35:54  No dieeeeeee.
13:36:03  Phantom_Hoover: BRICK
13:36:10  I assure you all it is completely justified in this case.
13:36:32 -!- lambdabot has quit (*.net *.split).
13:36:36 -!- ineiros_ has quit (*.net *.split).
13:36:47 -!- ineiros has joined.
13:39:17 -!- hagb4rd has quit (Quit: Nettalk6 - www.ntalk.de).
13:40:47   Taneb|Hovercraft: Anyway trust me you don't want to aim for more bloated designs. <-- stop being a minimalist all the time
13:40:54  befunge98 is fun
13:41:22  Vorpal, you're an idiot.
13:41:41  Phantom_Hoover, why do you think so in this case?
13:41:55  Vorpal: Between Uniquode and Brook, I'll take Brook. The vast majority of complicated esolangs are crap.
13:42:35  elliott_, hm
13:42:36  I don't know of one that is truly interesting; fun, maybe, but even then the esolangs with mounds of orthogonal rubbish piled together rather than being based on a simple interesting concept is the far more common sort of large esolang.
13:42:36  Vorpal, because befunge98 is actually a brainfuck derivative
13:43:13  Brook is based on /two/ interesting concepts!
13:43:24  It's queue-based and something else
13:43:28  Brook-like
13:46:12 -!- Taneb|Hovercraft has quit (Quit: Goodbye).
13:54:44 -!- Taneb|Hovercraft has joined.
14:01:14 -!- Taneb|Hovercraft has quit (Quit: Goodbye).
14:01:37  the snakes got him!
14:05:41 -!- Taneb|Hovercraft has joined.
14:10:15  Snakes on a Hovercraft.
14:10:24 * quintopia feeds the snakes that have taken over taneb's hovercraft
14:10:35  (they took over his irc too!)
14:12:05  I'm hovercraft for a reason
14:12:16  Means I could go at any second
14:13:03  dont listen to the treacherous snakes! they have acquired human language!
14:13:56  oh noooooo
14:17:32  -- XXX This isn't a great hash function
14:17:32  hashInteger :: Integer -> Int#
14:17:32  hashInteger (!_) = 42#
14:17:49  Not great, no
14:17:56  Not my code :-)
14:17:59  That's actually GHC code
14:18:10  Well, integer-simple, so I guess not that many people actually USE it
14:18:15  Although I think all ARM users do
14:19:45  What does "(!_)" mean?
14:19:55  It's like hashInteger _ = ...
14:19:56  But strict.
14:20:09  And "Int#"?
14:20:18  It's like hashInteger !_ = ... but with extra brackets
14:20:24  Taneb|Hovercraft: Unboxed integer
14:20:33  Low-level stuff
14:21:04  Low-level as in I should know this, or low-level as in this is how the computer thinks?
14:21:32  Latter
14:21:38  You won't have to deal with unboxed integers
14:21:45  Oh good
14:21:46  Unless you do the kind of crazy crap I do :P
14:22:12  I made a broken also awful brainfuck interpreter in Haskell this morning
14:22:19  It is broken and also awful
14:22:32  I'm not even sure if it should work
14:31:04  I think I've got it working
14:31:11  What's a suitable test program?
14:32:08  write a haskell compiler in brainfuck and see if it produces the same binary
14:40:55  Got a curious error
14:41:10  The cat program given on the wiki (-1 on EOF)
14:41:18  I ran it with input "Hello!"
14:41:22  Got "llo!" back
14:41:27  Taneb|Hovercraft, a self-interpreter running HW.
14:41:41  No, wait, a self-interpreter running 99 bottles.
14:46:12 -!- ais523 has joined.
14:46:56  hi ais523
14:47:19  hi
14:47:42  hais523.
14:47:51  Phantom_Hoover: oh no, the uglybf person replied to you
14:47:54  I'm scared to look
14:48:02  not out of sympathy though, that kind of thing is unforgivable
14:48:17  ais523: don't look at the wiki, there is a chance your soul may survive
14:48:23  elliott_: /that/ bad?
14:48:26  elliott_, have you looked yet.
14:48:38  ais523: at least, don't look at the article titled "UglyBF"
14:48:47  btw, I suggest we don't clean up or categorise it at all
14:48:50  it doesn't deserve it
14:48:52  elliott_: I've noted its existence, it doesn't look like spam
14:48:54  I haven't read it
14:48:58  Phantom_Hoover: OK I looked and that's so funny.
14:49:02  but apparently Phantom_Hoover is making death threads on the talk page
14:49:07  death threads
14:49:09  threads of death
14:49:20  I don't think it's ever been proven that the brickbraining procedure is fatal.
14:52:02  Hoover's conjecture: the brickbraining is not fatal
14:53:34  What is uglybf?
14:53:47  That is the fatal question.
14:54:11  ais523: Is there a way to delete pages as a bot?
14:54:16  It's kind of annoying seeing the masses of spam deletions in recentchanges.
14:54:38  elliott_: not without higher perms than I have
14:54:41  *sigh*
14:58:28  Madoka-Kaname, it's a crap-looking BF derivative
14:58:39  On another note, who wants to see my awful code?
14:58:41  http://pastebin.com/0CCW2UeC
14:59:06  Oh damn, just spotted something very bad
14:59:51  Taneb|Hovercraft: Please, hpaste.org or sprunge instead of pastebin.
14:59:54 * elliott_ really dislikes pastebin.
15:00:25  Taneb|Hovercraft: Hey, did you just reinvent zippers?
15:00:30  Or did you already read abotu them.
15:00:41  Anyway, rule of thumb: don't use an n-tuple if n>2.
15:00:41  I probably re-invented them
15:00:43  You want a data type.
15:00:57  Taneb|Hovercraft: Well, they're the last chapter of LYAH.
15:01:09 * elliott_ wasn't smart enough to reinvent zippers.
15:01:24  ...What's a zipper?
15:02:20  the simplest example is using a "left of current position stack" and "right of current position stack" rather than a single tape
15:02:28  it generalises to more complicated structures
15:02:45  the idea's that data near some sort of "current position" is fast to access, and the current position is also fast to move short distances
15:02:56 -!- Phantom_Hoover has quit (Ping timeout: 244 seconds).
15:02:57  Oh, that
15:03:19  Taneb|Hovercraft: e.g. your (xs,ys,...).
15:03:25  Your tape navigation structure.
15:03:32  That seemed obvious
15:03:51  Taneb|Hovercraft: Well... congratulations, you're really good at this, then.
15:03:54  Taneb|Hovercraft: it is moderately obvious, but that doesn't mean it doesn't have a name
15:04:02  They only date back to 1997.
15:05:58  elliott_: are you sure? I suspect they were being used before that, just without being named
15:06:12  I mean, I independently invented the structure, and I'm sure thousands of other programmers have too
15:06:32  ais523: I don't know of prior art before Huet's paper. Probably list zippers existed before then but I'd be quite surprised if tree zippers had been used.
15:08:59  Not that I'd rule it out completely.
15:09:05  But of course the tree formulation is much less obvious.
15:26:04 -!- Phantom_Hoover has joined.
15:28:35          if err == Nothing
15:28:35              then Right <$> peek event
15:28:35              else return $ Left . fromJust $ err
15:28:35  NO!!!! BAD LIBRARY! BAD!
15:32:30  elliott_: that looks rather special-cased to me
15:32:39  ais523: ?
15:33:09  elliott_: the bit of code you pasted
15:33:21  "Special-cased"?
15:33:22  but I can't tell without context
15:33:35  elliott_: it seems to care about err being a Maybe specifically, and I'm not sure if it should
15:33:43  That... isn't what I'm complaining about.
15:33:48  ah, OK
15:33:52  what are you complaining about?
15:34:10  ais523: the use of a comparison and a partial function to replace a perfectly safe and more readable case statement?
15:34:21  right, I noticed that too
15:34:33  but was wondering if you could write it without either
15:35:03  the right thing is obviously a case statement there
15:35:25  however you frame it, you have a base value a, and a destruction step (b -> a)
15:35:31  that's precisely the definition of Maybe
15:35:45  generalising beyond that is pointless, it just hides the fact that types have semantics
15:36:29  combineOr :: [a] -> a
15:36:30  combineOr x = unsafeCoerce $ foldl (\x y -> x .|. unsafeCoerce y) (0 :: CLuint) x
15:36:32  ummmmm...
15:36:41  ah right, I just noticed that the Maybe there is backwards
15:36:42  I don't know what that is but I'm removing it
15:36:48  it's Nothing = success, non-Nothing = error, rather than vice versa
15:36:56  that's not backwards :)
15:36:59  that's just another use of Maybe
15:37:02  well, OK
15:37:11  anyway, it doesn't matter, combineOr is a trillion times more horrifying
15:37:19  I'm the sort of person who'd like to give it another name because the semantic is different
15:37:25  and wow at that combineOr
15:37:31  the semantics are the same
15:37:39  what does it actually /do/? I can't figure it out from the definition
15:37:40  maybe :: b -> (a -> b) -> Maybe a -> b
15:37:51  any other "semantics" you claim Maybe has is projection :P
15:37:58  ais523: it doesn't do much of sense
15:38:14  ais523: but if a is runtime compatible with CLuint then it's just a fold of (.|.) and 0
15:38:27  and if it's not, umm... the program segfaults, or just goes wrong in general
15:38:29  (.|.) is bitwise or?
15:38:31  yes
15:38:51  I wonder if people consider it impolite to fix all their awful design and send it in as one gigantic pull request
15:39:05  (ok, this is a fork, so the awful design may be the forkee's fault)
15:39:19  hmm… I suspect that unsafe-coercing something to an unsigned int is just reinterpreting its bit pattern as an int
15:39:33  so it's basically just oring together the bit patterns of all its arguments
15:40:16  ais523: I don't like you any more, if you're going to claim a program has semantics based on an implementation accident like that :P
15:40:21  but anyway, no
15:40:21  boxing
15:40:47  it's oring together the first machine word in the representation of whatever you give it and euurgh\
15:40:48  Haskell boxes integers?
15:40:55  ais523: haskell is a lazy language
15:40:58  how do you do laziness without boxing?
15:41:25  a thunk is a box containing a pointer to some code that overwrites the thunk with the evaluated value
15:41:27  it's possible for the laziness to be entirely separate from the representation, I guess
15:41:34  eh?
15:41:51  as in, all data are either pointer-to-thunk or pointer-to-value
15:41:55  and the actual value itself would be a plain int
15:42:00  so there's still boxing, but not at the type level
15:43:03  ais523: the type level? wtf?
15:43:11  I never said ints have their own special boxing mechanism
15:43:14  well, OK
15:43:24  but I'm thinking of the bit-pattern as the value
15:43:31  which bit-pattern
15:43:32  of the pointer?
15:43:33  or can you unsafeCoerce something without evaluating it first?
15:43:40  elliott_: of the thing it points to
15:43:43  of the value at the pointer? which, everything is multiple bytes, there's a header and everything
15:43:47  ais523: unsafeCoerce is a nop at runtime
15:43:49  the pointer itself has nothing to do with the type system
15:43:54  so of course you can unsafeCoerce something not yet evaluated
15:43:59  elliott_: ouch!
15:44:06  wait, no, that's fine
15:44:15  ais523: "ouch!"? it already breaks the type system, who gives a fuck about further inconveniences?
15:44:17  in that case, evaluating an unsafeCoerce evaluates its argument, because it is its argument
15:44:38  ais523: not necessarily, I don't think
15:44:43  because it's a nop that subverts the type system
15:44:50  which could easily break the forcing mechanism
15:44:55  but I don't think it breaks GHC's
15:45:05  I'd assume the forcing mechanism to have nothing to do with types
15:45:16  unless you unsafe-coerce something into an Int# or whatever, but that would be even more insane than usual
15:45:31  That sounds like a dangerous assumption, considering what has to be evaluated depends on the type.
15:45:33  e.g.
15:45:37  data Foo = Foo !Int String !Char
15:45:45  to force (Foo a b c), you have to force a and c, but not b
15:46:06  GHC just does that by rewriting constructor calls with strict fields to a wrapper function, but it's an obvious example
15:46:41  I'm including strict fields as much the same sort of thing as strict types (i.e. unboxed types)
15:46:53  um, no
15:47:28  they both interfere with the usual evaluation order
15:47:44  "interfere"?
15:47:49  well, change it
15:47:50  strict fields have perfectly well-defined, simple semantics
15:48:01  yes, but they're different semantics from "normal" types
15:48:02  unboxed types are very different
15:48:06  ais523: nope
15:48:09  they just save some seqs
15:48:13  it's all in the constructors, simple as that
15:55:32  I'm making a stupid mistake over and over again
15:58:56  Taneb|Hovercraft discovers "life".
15:59:17          err <- wrapError $ raw_clEnqueueNDRangeKernel queue kernel (fromIntegral work_dim) nullPtr global_work_size local_work_size (fromIntegral num_events_in_wait_list) event_wait_list event
15:59:20  ais523: save me from suffering
15:59:46  elliott_: that looks like Haskell as a wrapper around some imperative language
15:59:51  http://hpaste.org/54317
16:00:08  Taneb|Hovercraft: OK, firstly that BFState definition is wrong.
16:00:11  You missed a constructor name.
16:00:22  That will probably be the main problem
16:00:23  Taneb|Hovercraft: Secondly you really want to separate the [Int] [Int] tape into its own Tape data type.
16:00:34  And you probably want Word8, not Int (import Data.Word to get it); that's what most BF implementations use.
16:00:48  Taneb|Hovercraft: Also, you need parentheses around your applications of (:).
16:00:49  Right now itl ooks like
16:00:53  (BFState xs 1) : [] a b
16:00:55  which doesn't make much sense.
16:01:01  Also, a:[] is the same as [a], so write that instead.
16:01:08  (And [(-1)] the same as [-1].)
16:01:29  Taneb|Hovercraft: Also, I suggest you initialise the right hand side of the tape (ys) with (repeat 0).
16:01:37  Taneb|Hovercraft: Then you never have to handle the [] case, because there'll always be a value.
16:01:55  Having said all that, your code is really pretty damn good :P
16:01:58  elliott_: ouch, infinite list should probably have a different type from finite list
16:02:04  ais523: >_<
16:02:07  because the type constructors are different
16:02:07 -!- hagb4rd has joined.
16:02:12  (there's a Cons, but no Nil)
16:02:18  ais523: That's not what a type constructor is.
16:02:38 * elliott_ will battle inanity with pedanticry.
16:02:41  are you sure? those seem pretty typeconstructory to me
16:03:03  You might want to look up the definition of "type constructor".
16:03:48  elliott_: I renamed them
16:03:55  What?
16:03:57 -!- Phantom__Hoover has joined.
16:04:00  but I'd define a type list as list = Cons list list | Nil
16:04:19  You would?
16:04:21  'Cuz, that's not a list.
16:04:25  err, sorry
16:04:33  'a list = Cons 'a list | Nil
16:04:38  thinko
16:04:44 -!- Taneb|Hovercraft has quit (Quit: Goodbye).
16:04:48  * 'a list = Cons 'a ('a list) | Nil
16:06:01  does the haskell vm implement cyclic lists by thunk or by actually creating a cyclic data structure?
16:06:20 -!- Phantom_Hoover has quit (Ping timeout: 248 seconds).
16:06:50  my guess is by thunk, to avoid special-casing
16:07:02  as infinite lists in Haskell (unlike OCaml) don't have to be cyclic
16:07:09  but it might optimise them into cyclic lists, I guess
16:07:28  coppro: Cyclic structures are only really something that makes sense in the presence of mutation.
16:07:33  There is, however, sharing.
16:07:36  That is, in
16:07:41  ones = 1 : ones
16:07:48  there is only one "ones", not one for each tail.
16:08:18  elliott_: I think the discussion's about internal representation
16:08:26  ais523: My answer was about internal representation.
16:08:46  elliott_: I'm thinking of something like an immutable cyclic linked list, as a reasonable way to internally represent an infinite repeating list
16:09:00  I am talking about internal representations.
16:09:41 -!- Phantom__Hoover has quit (Ping timeout: 240 seconds).
16:09:51  elliott_: cyclic structures make sense, as an internal representation, even in the absence of mutation
16:10:05  in fact, they make more sense in the absence of mutation, as you don't have to worry about the compulsory sharing of every element
16:10:19  (whereas without a cyclic list, it'd be possible for the elements to either share, or to not share0
16:10:22  s/0/)/
16:10:37  In the absence of mutation, "cyclic structures" is either a weird name for sharing, or something that has limited to no applicability.
16:10:54  elliott_: a cyclic structure is a structure which shares with an element of itself
16:11:01  that's different from the normal form of sharing
16:11:08 -!- Slereah_ has quit (Ping timeout: 248 seconds).
16:11:19  That's a bad definition of either "cyclic structure" or "element", and no it isn't.
16:11:20  where the thing being shared doesn't have a pointer back to itself
16:11:26 -!- Slereah_ has joined.
16:11:38  > let foo = 1 : 2 : 3 : foo in drop 10000 foo
16:11:53  The "foo" that is (1 : 2 : 3 : foo) is shared with the "foo" that is in the tail position of (3 : foo).
16:12:02  > let foo = 1 : 2 : 3 : foo in drop 1000 foo
16:12:11  Oh hurry up lam- oh, she's not here.
16:12:16  elliott_: right; cyclic structure formation is a special case of sharing
16:12:34  the more common form of sharing is along the lines of this:
16:12:47  > let foo = (let x = 1 in [x,x])
16:13:13  in that case, it's possible to break the sharing, e.g. to copy-on-write in a mutable language
16:13:30  in the cyclic case, you can't fully break the sharing as the list would become infinitely long
16:13:35  in memory
16:14:34  It's not possible to break the sharing without constructing a new list, and constructing a list can hardly change the semantics of an existing one.
16:15:00  err, what? you can break sharing just by copying one of the things being shared, then moving the pointer to point to the copy
16:16:15  That only goes one level. { let ones = 1 : ones } requires infinity. I'm sure there are ones in-between.
16:16:36  elliott_: well, my point is, normally with sharing, breaking one level of sharing is enough, or at least a finite number
16:16:46  No it's not:
16:16:48  ones = 1 : ones
16:16:50  with a cyclic list, you can break sharing as many times as you want, but there'll still be sharing involved
16:17:06  That's sharing. It's not any less, or a different kind, or an unusual kind of sharing.
16:17:11  elliott_: I'm arguing that ones = 1 : ones /is not the usual case of sharing, and it makes sense to have a different name for it/
16:17:23  Well, you're wrong.
16:17:45 -!- Ngevd has joined.
16:17:45  fix (\fac n -> if n == 0 then 1 else fac (n-1))
16:17:50  There's another case of sharing you can't break finitely!
16:17:52  elliott_: I'm saying "A is different from B"; you're saying "no they aren't"; I'm saying "yes they are because I can do X with A and I can't with B"; and you're saying "saying you can do X with A is wrong because you can't do X with B and A is the same as B"
16:17:55  And you use it for every recursive definition!
16:18:03  So unusual.
16:18:15  ais523: I'm not saying that at all, but whatever.
16:18:17  that isn't even a structure at all, in most languages
16:18:41 -!- Ngevd has changed nick to Taneb|Hovercraft.
16:18:56  incidentally, in ICA there's no sharing involved at all there
16:19:14  Functions are structures.
16:20:01  but they don't have accessible type constructors
16:20:18  you can't say case function of If -> …
16:20:33  and in general, forcing a function to have a particular concrete representation would be wrong anyway
16:20:51  the fundamental difference of a function and a structure is that the structure can't be rearranged without changing its semantics
16:21:08  hmm, that implies that there are probably things in-between, like self-balancing trees
16:21:14  This is ridiculous. Sharing is obviously an implementation detail.
16:21:42  elliott_, I made the changes you suggested
16:21:46  Except for word8
16:21:47  Taneb|Hovercraft: Yay.
16:21:48  in a language with immutable data, I agree with that
16:21:51  I don't like Word8
16:21:56  http://hpaste.org/54321
16:21:57  Taneb|Hovercraft: Whaddya mean you don't like it?
16:22:02  That causes actual incompatibility with BF programs.
16:22:21  sharing is definitely not an implementation detail when you're talking about something which is mutable, though (including retroactively)
16:22:22  I don't know how to change it to a char!
16:22:29  Taneb|Hovercraft: You totally didn't do another one of my changes, too. :'(
16:22:36  Which one?
16:22:54 -!- Phantom__Hoover has joined.
16:23:16  Taneb|Hovercraft: I'll annotate your paste with some small tweaks.
16:23:43  Taneb|Hovercraft: You have your left and right lists the wrong way around. :p
16:24:00  THEY ARE THE PERFECT WAY ROUND
16:24:20  'Fraid not!
16:24:29  Oh, hmm, what.
16:24:35  No, they're the right way around, your left and right functions are just wrong.
16:25:00  THEY ARE PERFECTLY RIGHT
16:25:06  if your tape's infinite both ways, it's impossible to observe < and > being switched in BF
16:25:25  Unless they are switched half-way through execution
16:25:26  Taneb|Hovercraft: They're not; you access with ys=right but move with xs=right.
16:25:57  How do I access?
16:26:22 -!- pikhq_ has quit (Read error: Operation timed out).
16:26:46  Just spotted a stupid error
16:26:52  Line 32
16:27:45  Taneb|Hovercraft: Also, you don't actually process input.
16:28:10 -!- pikhq has joined.
16:28:14  HEYOOO
16:28:17  Got the rest of the comparisons in.
16:29:04  Woah, so I don't
16:29:52  Taneb|Hovercraft: Here's an improvement: http://hpaste.org/54323
16:30:13  Taneb|Hovercraft: I switched to Word8, added a separate Tape type, implified input handling by terminating input with (repeat 0), and make it actually handle input :-)
16:30:17  Plus a few minor cleanups.
16:31:16  getLoop can be made nicer, I think getBF too, and loop should really have the arguments the other way around, but this is still pretty close to what I'd write *shrugs*
16:32:31  Your introduction of the Tape type...
16:33:12  Well, you haven't adjusted the rest of the program to cope
16:33:26  Oops.
16:33:29  elliott_: hmm, the pointer always being off by one is also not a detectable error
16:33:32  Taneb|Hovercraft: Fixing :P
16:34:56  Taneb|Hovercraft: http://hpaste.org/54325
16:35:03  I'll fiddle with this a little more and then I'll be done.
16:35:11  Oops.
16:35:15  Still got loop and the main pattern-match wrong.
16:35:19  But it's obvious what it should be. :p
16:38:34  Taneb|Hovercraft: BTW: Never use tab characters in Haskell source.
16:39:04  Note taken
16:39:04  Taneb|Hovercraft: I'm bored twiddling, so here's a final version: http://hpaste.org/54326
16:40:25  I've seen a pretty big problem
16:40:37  Short version: the program doesn't work
16:41:52  Long version: you've rewritten left, right, and plus to use Tape, but only half-done minus, and not changed getBF to accomodate
16:42:16  Oop, right, that's easy to fix
16:42:22  That's not a pretty big problem, one definition can fix that
16:43:07  Taneb|Hovercraft: http://hpaste.org/54327
16:43:11  The power of higher-order functions!
16:43:22  Er, that withTape should be below minus.
16:48:08  Firstly, you need to retype the minus
16:48:30  It's /still/ BFState -> BFState
16:52:10  Yeah yeah whoops :P
16:54:10  elliott_: My attempt to use your void(*)(void) trick fails nearly everywhere for various reasons :P
16:54:25  elliott_: Works on x86 though!
16:54:30  Gregor: Nice!
16:54:52  elliott_: I'm thinkin' I'll just live with a stupid function call in there.
16:57:46  Taneb|Hovercraft: Secondly???
16:58:49  I'm working secondly
17:01:33  Secondly, it doesn't seem to work
17:01:48  $ echo '1 p' | qemu-sparc32plus ./jitchards
17:01:48  00
17:01:48  Segmentation fault
17:01:53  Taneb|Hovercraft: That's because either I or you made a mistake.
17:01:54  This is the closest SPARC has ever been to working.
17:03:43 -!- elliott_ has set topic: The IOCCC is back on! http://www.ioccc.org | http://esolangs.org/ | http://codu.org/logs/_esoteric/.
17:03:45  PREPARE FOR PRESENTABILITY
17:04:06 -!- lambdabot has joined.
17:04:45 -!- ais523 has quit (Remote host closed the connection).
17:05:13  Presentability is for losers.
17:05:29  I had to mention this place in #haskell again :P
17:06:09 -!- Gregor has set topic: The IOCCC is back on! http://www.ioccc.org | http://esolangs.org/ | #esoteric: A place that hates Haskell slightly more than C++ | http://codu.org/logs/_esoteric/.
17:06:18 -!- elliott_ has set topic: The IOCCC is back on! http://www.ioccc.org | http://esolangs.org/ | http://codu.org/logs/_esoteric/.
17:06:24  Even a Gregor can learn these topic changing techniques.
17:06:30  X-D
17:06:49 -!- derdon has quit (Remote host closed the connection).
17:07:15  So, is #haskell going to invade us or what?
17:07:20  Yes.
17:07:22  We will all die.
17:07:30  Taneb|Hovercraft: Gonna expand on "doesn't work"? :P
17:07:33  Nah
17:07:39  I know about as much as you
17:07:52  Taneb|Hovercraft: You know slightly more: the error GHC spits out
17:07:56  !brainfuck ++++++++++[>+++++++>++++++++++>+++>+<<<<-]>++.>+.+++++++..+++.>++.<<+++++++++++++++.>.+++.------.--------.>+.>.
17:08:03  elliott_, that's the thing
17:08:08  GHC is fine with it
17:08:11  Oh.
17:08:15  Then the implementation is just buggy somehow.
17:08:20  !bf ++++++++++[>+++++++>++++++++++>+++>+<<<<-]>++.>+.+++++++..+++.>++.<<+++++++++++++++.>.+++.------.--------.>+.>.
17:08:22  Hello World!
17:08:35  Taneb|Hovercraft: So what exactly happens?
17:08:38  I am suspicious of your loop parsing, because it's ugly and slow enough that I just ignored it.
17:08:39  That program in our interpreter outputs:
17:08:40   
17:08:40  
17:09:05  Fancy.
17:09:31  Hmm.
17:10:18  I don't see anything wrong with the bits I've looked at, i.e. everything but the loop parsing :-)
17:10:47  I have very handily looked at those exact bits and found nothing wrong
17:11:01  But I wrote the loop parsing in a maddened daze
17:11:09  And don't want anything to do with it
17:11:20  Taneb|Hovercraft: Test it in the REPL.
17:11:27  getLoop "abc[def]quux]blah"
17:11:54  Aha!
17:12:27  It works fine
17:12:32  So does everything else
17:12:33  What return?
17:12:34  EXCEPT FOR
17:12:39  ("abc[def]quux","blah")?
17:12:42  Yes
17:12:47  getBF ('[':xs) = getBF a . loop (getBF b)
17:12:47    where (a,b) = getLoop xs
17:12:54  s/getBF a . loop (getBF b)/getBF b . loop (getBF a)/
17:13:23  I changed "where (a,b") to "where (b,a)"
17:13:35  Works just the same
17:13:39  And reflects how I think
17:13:40  But I specified that fix to stop you doing that because that's so ugly :'(
17:14:19  Now it works much better
17:14:38  The Hello world! program outputs !dlrow olleH
17:15:36  Oh, right.
17:15:47  s/putStr/putStr . reverse/
17:15:53  oh my god
17:16:15  I've just noticed that currently on TV is a BBC programme dealing with offended people's letters.
17:16:28  !!!
17:16:40  Oh yeah, I watched a bit of that once
17:17:15  Also, elliott_, EOF isn't handled
17:17:27  Taneb|Hovercraft: Yes, it is.
17:17:35  Oh, wait.
17:17:40  No it isn't because I introduced a regression.
17:17:44  WATCH AS I FIX THAT REGRESSION
17:17:51  I CAN'T
17:18:02  I DON'T KNOW WHERE YOU LIVE BEYOND THE TOWN
17:18:17  AND I DON'T THINK YOU ARE STREAMING IT
17:18:27  SO INSTEAD I ANXIOUSLY AWAIT THE RESULT
17:18:36  http://hpaste.org/54331
17:18:44  Taneb|Hovercraft, how can it be this hard to find the Hird family.
17:21:26  Phantom__Hoover, if I find him then he will know who I am!!!
17:21:48  He already knows that you fool!
17:21:52  Oh, right
17:22:20  If I find him, he will know I'm looking for him!
17:22:42  Little does Taneb|Hovercraft know, but I actually live in Hexham, Australia.
17:22:52  elliott_, which Hexham, Australia
17:22:56  Both.
17:22:59  !!!
17:31:17 -!- Ngevd has joined.
17:33:11 -!- Taneb|Hovercraft has quit (Ping timeout: 258 seconds).
17:49:25 -!- Darth_Cliche has joined.
17:50:33 -!- derdon has joined.
17:51:24 -!- Ngevd has changed nick to Taneb|Hovercraft.
17:58:41 -!- Ngevd has joined.
17:58:51 -!- derrik has joined.
18:00:29 -!- MonkeyofDoom has quit (Ping timeout: 240 seconds).
18:01:30 -!- Taneb|Hovercraft has quit (Ping timeout: 245 seconds).
18:01:45 -!- sebbu2 has joined.
18:01:45 -!- sebbu2 has quit (Changing host).
18:01:45 -!- sebbu2 has joined.
18:05:22 -!- sebbu has quit (Ping timeout: 252 seconds).
18:10:45 -!- Taneb has joined.
18:14:37 -!- Ngevd has quit (Ping timeout: 244 seconds).
18:15:39 -!- Taneb has quit (Ping timeout: 244 seconds).
18:17:41  $ wc -c jitdc.c
18:17:41  2734 jitdc.c
18:17:42  Grr
18:23:05  stop that right now
18:24:04  oklopol: Stop your face!
18:24:08  Gregor, what's the limit?
18:24:29  Phantom__Hoover: 2048 non-whitespace and something about not counting {;} in some cases
18:24:44  {;} aren't counted if immediately followed by whitespace.
18:24:55  Right, or EOF.
18:27:55  Dang it, by that count I'm still at 2196
18:28:15  Need to shave off 148 bytes >_>
18:30:19  Put in 148 ASCII delete characters at the end.
18:30:25  Yesssssssssssssss
18:36:16 -!- Ngevd has joined.
18:41:16 -!- kmc has joined.
18:45:07  my face is unstoppable.
18:45:48 -!- Ngevd has quit (Quit: Goodbye).
18:47:13  shachaf: Have I scared you with combineOr yet?
18:47:39  I don't believe so.
18:47:44  combineOr :: [a] -> a
18:47:45  combineOr x = unsafeCoerce $ foldl (\x y -> x .|. unsafeCoerce y) (0 :: CLuint) x
18:47:51  Seen in actual, real, live code.
18:48:01  2133 ...
18:48:17  Its single use site ended up being equivalent to: foldl (.|.) 0 [ foo | NewtypeCons foo <- xs ].
18:48:42  What real, live code?
18:48:47  + actual
18:49:05 -!- Ngevd has joined.
18:49:38  Deewiant: OpenCLWrappers, almost certainly inherited from OpenCLRaw
18:51:14 -!- sebbu2 has changed nick to sebbu.
18:53:40  "ex his Iason quos arbitratus est ad omnia pericula subeunda paratissimos esse, eos ad numerum quinquaginta delegit et socios sibi adiunxit;"
18:56:34 -!- Zuu has quit (Ping timeout: 244 seconds).
19:03:41  peekManyInfo :: Storable a => ([a] -> b) -> ForeignPtr () -> CLsizei -> IO b
19:03:41  peekManyInfo f x size = do
19:03:41      c <- return undefined
19:03:41      a <- withForeignPtr x (\y -> (peekArray ( div (fromIntegral size) $ sizeOf c) $ castPtr y))
19:03:41      return (c:a)
19:03:42      return $ f a
19:03:46  Deewiant: Challenge: Figure out what type "c" has
19:05:10  ?hoogle withForeignPtr
19:05:11  Foreign.ForeignPtr withForeignPtr :: ForeignPtr a -> (Ptr a -> IO b) -> IO b
19:05:13  ?hoogle peekArray
19:05:14  Foreign.Marshal.Array peekArray :: Storable a => Int -> Ptr a -> IO [a]
19:05:14  Foreign.Marshal.Array peekArray0 :: (Storable a, Eq a) => a -> Ptr a -> IO [a]
19:05:26  elliott_: Aha.
19:05:39  shachaf: I hope it hurt.
19:05:41  elliott_: You know, that doesn't really scare me. I've come to expect that sort of thing from you.
19:05:45  shachaf: I DIDN'T WRITE THAT
19:05:47 * shachaf is desensitized.
19:05:48  SOMEONE ELSE WROTE THAT ENTIRELY
19:05:50  IT BOGGLES MY MIND
19:05:51  Oh.
19:06:00  What code?
19:06:15  OpenCLWrappers, but it almost certainly is inherited from its parent project OpenCLRaw which it's forked from.
19:06:16  I have excised it.
19:06:18  elliott_: Storable a => a ?
19:06:29  Deewiant: Nah, it's the specific "a" in the type signature
19:06:34  elliott_: That's what I meant
19:06:41  Deewiant: (That second-last "return" forces the type)
19:06:45  elliott_: Did you ever see those few instance snippets in Pugs?
19:06:48  elliott_: It does, yep
19:06:48  (And you can determine the type of a by the application to f)
19:06:56  shachaf: I'm scared. Go on.
19:06:57  Indeed
19:07:33  elliott_: https://github.com/perl6/Pugs.hs/blob/master/Pugs/src/Pugs/Types.hs
19:07:45  elliott_: It's the section that starts with "instance Ord".
19:08:05  shachaf: Very nice.
19:08:08  Very... safe.
19:08:15  Where's showAddressOf defined? Do I dare ask?
19:08:32  I'd be more worried about addressOf than showAddressOf if I were you.
19:08:52  https://github.com/perl6/Pugs.hs/blob/master/pugs-compat/src/Pugs/Compat/Cast.hs
19:09:01  clInvalidGlobalOffset = ErrorCode (-56)
19:09:01  clInvalidEventWaitList :: ErrorCode
19:09:01   
19:09:01  clInvalidEventWaitList = ErrorCode (-57)
19:09:01  clInvalidEvent :: ErrorCode
19:09:02   
19:09:04  clInvalidEvent = ErrorCode (-58)
19:09:06  clInvalidOperation :: ErrorCode
19:09:08   
19:09:10  clInvalidOperation = ErrorCode (-59)
19:09:12  clInvalidGLObject :: ErrorCode
19:09:14  Deewiant: shachaf: Look at this exciting new type signature layout style
19:09:16  Found in the same fucking project
19:09:49 * shachaf is glad to see that elliott_ is enjoying himself.
19:13:50  @tell oerjan speak of the devil: * hackagebot thrist 0.2.1 - Type-threaded list  http://hackage.haskell.org/package/thrist-0.2.1 (GaborGreif)
19:13:51  Consider it noted.
19:20:55  https://github.com/jkarlson/OpenCLWrappers/blob/master/LICENSE
19:20:58  Deewiant: Does this look like BSD3 to you?
19:21:02 -!- Rugxulo has joined.
19:21:23  who hosts the esolang wiki, Panu?
19:21:31  panu?
19:21:34  graue hosts the wiki, why?
19:21:42  (contacting him is likely to be fruitless, ask an admin instead)
19:21:51  I know it's lame, but I keep thinking there should be a Befunge-93 archive since a lot of stuff (e.g. Nthern's bigbef hacks) keep getting lost
19:22:05  elliott_: Close enough
19:22:08  graue doesn't run the archive
19:22:12  afaik
19:22:16  oh hm wait
19:22:19  its on esolangs.org so i guess he does
19:22:30  Rugxulo: http://esolangs.org/files/befunge/src/
19:22:40  you could get someone with commit access to put stuff there.
19:22:45  four files is not exactly a lot
19:22:56  I've written ten times that alone  :-P
19:22:57   you could get someone with commit access to put stuff there.
19:24:13 * Rugxulo is tired of visiting sites that have broken links
19:24:25  I guess they don't call it "esoteric" for nuthin'    :-P
19:24:54  it's funny when my own local collection is 10x bigger than anything online  :-P
19:25:18 * Rugxulo needs a scapegoat ... blames Gregor
19:34:37  Well it is true that I scour the internet for Befunge sources and eliminate them.
19:40:37 -!- Phantom__Hoover has changed nick to Phantom_Hoover.
19:44:12  :t lookup
19:44:13  forall a b. (Eq a) => a -> [(a, b)] -> Maybe b
19:45:18  Oh, that's not Map.lookup
19:45:21  :t Map.lookup
19:45:22  Couldn't find qualified module.
19:45:26  :t Data.Map.lookup
19:45:27  forall k a. (Ord k) => k -> M.Map k a -> Maybe a
19:52:11 -!- monqy has joined.
19:56:37 -!- z^ck has quit (Quit: Lost terminal).
20:08:00 -!- Zuu has joined.
20:12:49 -!- MonkeyofDoom has joined.
20:17:10  I'm crap for coding, but anyone else here interested in upcoming id Tech 4?
20:21:04  C++ not esoteric enough??   ;-)
20:23:30  C++ is too godawful.
20:24:29  ;-)
20:24:53  Deewiant: Oh no
20:25:00  Deewiant: The maintainer of this fork added combineOr
20:25:07  I... think I need my own fork...
20:25:14 -!- sebbu2 has joined.
20:25:14 -!- sebbu2 has quit (Changing host).
20:25:14 -!- sebbu2 has joined.
20:27:17 -!- sebbu has quit (Ping timeout: 276 seconds).
20:33:19  elliott_: I think I'mma let my JIT rest for awhile, but in retrospect I think a MIDI player would be insufficiently obfuscated.
20:33:42  Gregor: Obfuscation doesn't actually matter that much in IOCCC most of the time :P
20:33:48  It's mostly whitespace tricks and golfing.
20:34:02  Like, it's more "unconventionally (i.e. uselessly) pretty C code contest".
20:34:12  nah, originality seems heavily prized
20:34:16  At least that's my perception.
20:34:21  Rugxulo: Well yeah, I mean as far as code formatting goes.
20:37:27  But I mean, a JIT is going to be obtuse no matter how you write it.
20:37:35  A MIDI player would be pretty clear.
20:40:59 -!- oerjan has joined.
20:42:34 -!- Ngevd has quit (Ping timeout: 252 seconds).
20:42:39  hm
20:42:39  oerjan: You have 1 new message. '/msg lambdabot @messages' to read it.
20:44:24  You guys, my bug reporting strategy works so well.
20:45:08  Gregor: check out some of the more complex winners in the past.
20:45:10  I'm just really impeccably nice and do fucktons of work unprompted and in return people bow to my every nee- GOD DAMMIT I'VE BEEN TURNED INTO AN OPEN SOURCE SLAVE BY MY DESPERATION
20:45:19  like text-based games. I believe there was an OS as well but I doubt it was very complicated.
20:45:33  CakeProphet: It was more complicated than you might think
20:45:41  CakeProphet: There's also that graphical flight sim
20:45:48  ah yes
20:45:55  see I think the purpose of the program is considered as well.
20:46:53  if the program does something really neat then it's more likely to be considered.
20:48:01  Yeah, but playing a MIDI file isn't all that neat :P
20:48:23  wait I thought you were writing a JIT compiler?
20:50:22  19:03:41:  peekManyInfo f x size = do
20:50:22  19:03:41:      c <- return undefined
20:50:22  19:03:41:      a <- withForeignPtr x (\y -> (peekArray ( div (fromIntegral size) $ sizeOf c) $ castPtr y))
20:50:25  19:03:41:      return (c:a)
20:50:28  19:03:42:      return $ f a
20:50:31  hm...
20:50:40  oerjan: Easier with the type signature one line above :P
20:50:45  oerjan: But um excuse me go back up and marvel at combineOr.
20:51:04  elliott_: i'm just thinking of a saner way to write that
20:51:14  oerjan: Here you go:
20:51:19  peekManyInfo :: forall a b. Storable a => ([a] -> b) -> ForeignPtr () -> CLsizei -> IO b
20:51:19  peekManyInfo f x size =
20:51:19      fmap f . withForeignPtr x $ \y ->
20:51:19          peekArray (fromIntegral size `div` sizeOf (undefined :: a)) $ castPtr y
20:51:22  NOOOOOOO
20:51:27  -XScopedTypeVariables, job done
20:51:32  c-c-c-combinators
20:51:35  *sigh* ok
20:51:44 * elliott_ pets oerjan, now go look at combineOr
20:53:06 * Gregor reappears.
20:53:18   wait I thought you were writing a JIT compiler? // the JIT compiler is more-or-less done, and I'm quite proud of it.
20:53:23  And like I said,  But I mean, a JIT is going to be obtuse no matter how you write it.
20:53:33  I was talking about another submission.
20:53:40  Gregor: yeah but not in a visually appealing way.
20:53:43  ah.
20:54:36  CakeProphet: They don't have to be visually appealing, they have to be obfuscated, although formatting it interesting is surely a plus.
20:54:43  elliott_: hm, it's basically foldl (.|.) 0 :: [CLuint] -> CLuint except with mad coercion?
20:56:19 -!- Ngevd has joined.
20:56:33  oerjan: yep! it was used on a list of newtypes of CLulong
20:57:14  oerjan: i replaced the single usage site with foldl' (.|.) 0 [ foo | NewtypeCons foo <- xs ]
20:58:37  is NewtypeCons a synonym for the actual newtype constructor, or something insanely overloaded?
20:58:48  oerjan: former
20:58:55  you can't overload a constructor :P
20:59:00  or do you mean like
20:59:17  data NewtypeCons a = forall b. (Newtype a b) => NewtypeCons b
20:59:21  or sth ridiculous like that :P
20:59:24  yeah
20:59:36 -!- Phantom__Hoover has joined.
20:59:41  although i guess that wouldn't actually work in that context
21:00:11  since the b escapes in an illegal way
21:00:29  (and is not necessarily the same for all xs elements
21:00:30  )
21:00:53 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds).
21:04:53  15:44:43:  because it's a nop that subverts the type system
21:04:53  15:44:50:  which could easily break the forcing mechanism
21:05:08  how can a nop do anything?
21:05:11  that's what i was trying to check with my seq experiment yesterday, i couldn't get it to break
21:05:20  coppro: it's a nop after compilation
21:05:21  coppro: it's not the nop, it's what it allows you to do
21:05:36  if you treat a banana as an orange by just doing nothing and pretending, it's still gonna blow up when you uh
21:05:38  press the button that uh
21:05:42  does good things to oranges
21:05:44  but makes bananas blow up
21:05:47  and that is
21:05:48  a real button ok
21:06:18  predictions for future Android versions: root beer float, pumpkin pie, vanilla milkshake, jelly, mint chocolate cookies
21:06:33  android sugar
21:06:53  i guess iPhone has dibs on the apple pie
21:07:28  I'm pretty sure they'll use jelly for the next version
21:07:36  u jelly?
21:07:37  as I don't know of many desserts or sugary things that start with j.
21:07:46  other than that.
21:08:08   u jelly?
21:08:11  why did they ever make you op :'(
21:08:34  come to think of it, who _did_ make you an op
21:08:34  so that i could MERCILESSLY TORTURE YOU, of course
21:08:56  I purchased any 37-inch LG 37LV5300 combined with picture had been excellent though the audio system ended up awful, there were a few action cloud (community . has also been 120hz) along with anytime the particular display had been supposed to be absolutely dark you could possibly see the LED bleeding via about the edges.
21:08:59  fizzie, i think
21:09:21  i don't think there were any other active ops at the time
21:09:39  oerjan: it is very hard for me to envision fizzie doing an opthing of his own accord :P
21:09:48  although not as hard as it is for me to imagine you doing that >:)
21:10:07 * CakeProphet is the primest candidate for ophood.
21:10:51  well after that antioptbot disaster i am somewhat leery of using ops for silly stuff
21:11:03  even more than before
21:11:28  I would op over my subjects with the kindness and wiseful tact of the philosopher kings of ancient times.
21:11:40  because op = king obviously
21:11:44  oerjan: looks like the ops before you were andreou, fizzie, lament and Aardappel. so the founder, fizzie, someone who has never heard of this channel, and a potato.
21:11:53  good ops
21:12:00  antiopbot disaster?
21:12:12  someone made a bot to insult the ops
21:12:14  thus anti op bot
21:12:20  and then oerjan killed a baby
21:12:30  the disaster of misspelling
21:12:54  oerjan: let it be known that if elliott is ever considered for ophood then there is ONE VETO VOTE against him.
21:12:54  Aardappel is most likely Wouter van Oortmerssen (sp?), the FALSE dude
21:12:57  yes, that is totally a thing.
21:13:13  I don't think it's Mr. Potato Head
21:13:16  no i didn't, it was already dead when i ate it
21:13:41  Rugxulo: that much is obvious :P
21:13:58  well you called him a potato ("them's fightin' wurds!")
21:14:00 * elliott_ would rather wouter were known for his more interesting languages :(
21:14:07  such as?
21:14:07  Rugxulo: aardappel means potato.
21:14:13  yes, so I've read
21:14:15 -!- derdon has quit (Remote host closed the connection).
21:14:16  (though I don't speak Dutch)
21:14:23  Rugxulo: such as Aardappel, for one :P http://strlen.com/aardappel-language
21:14:36  he seems almost more proud of E than FALSE
21:14:46  you know what's funny about fighting words?
21:14:51  it's actually a thing in US law.
21:15:50  US law is the biggest kludge ever
21:15:58  ^
21:16:08  do you know of any laws that aren't kludges
21:16:14  this reminds of how it's illegal in norway to insult a police officer, but _what_ you can say varies by region
21:16:23  thermodynamics?
21:16:24  no, but how it even pretends to make any coherent sense is beyond me
21:16:44  i gather that's why we have lawyers.
21:16:47  because some places have a customarily more ... colorful ... way of speaking than others
21:16:56  *reminds me
21:17:04  "so how many gigolos did your mom have to bribe to get you that badge?"
21:17:49  I wonder if a your mom joke constitutes as fighting words.
21:18:06  your MOM constitutes fighting words.
21:18:35  Incitement is a related doctrine, allowing the government to prohibit advocacy of unlawful actions if the advocacy is both intended to and likely to cause immediate breach of the peace. The exception is defined in Brandenburg v. Ohio (1969), where the Court reversed the conviction of a Ku Klux Klan leader accused of advocating violence against racial minorities and the national government.
21:18:41  loooooool
21:19:14  advocating unlawful actions that breach the peace is bad, unless it's racist (???)
21:19:18  "please kill a nigger.  but wait until tomorrow."
21:19:20  "so, how much does everybody *really* love Raymond?" (blank stare)
21:19:51  oerjan: don't be racist
21:20:11  oklopol: ok, you can kill a dyke or chink instead, if you want
21:20:20  you shouldn't kill niggers just because they're black just like you shouldn't hit a white guy just because they hit you first.
21:20:38  oerjan: meanwhile Julian Assange is most likely condemned to the death penalty if he ever steps foot on US soil, despite having not broken any laws.
21:20:59  THEY WILL FIND SOME VAGUE THING HE VIOLATED.
21:21:29  meanwhile, i don't want to touch that subject.
21:21:50  uh oh
21:22:04  subject-rape
21:22:05  did you know people in US have this thing called religion
21:22:19  oklopol: huh, weird.
21:22:20  i find that really weird
21:22:33  there's freedom of it too
21:22:51  within some reason that doesn't really seem to universal.
21:22:52  and weird anti-religion weirdos who sue just to get a water tower to lose its cross
21:23:03  for example the native american church can smoke peyote as part of its rituals
21:23:20  but Joe Asshole Peyote Cult with 150 members probably can't
21:24:05  joe asshole peyote cult is the best
21:24:42  no but seriously in the US you can apparently tell your friends you believe in god and no one will think that's weird
21:24:52  interestingly I'm pretty sure rastafarians would still get arrested for smoking weed
21:24:58  despite it being part of their religious practice.
21:25:14  in the U.S., you can dress up as a vampire and nobody will think it's weird
21:25:30  i'm pretty sure most people will think it's weird
21:25:47  no worse than default
21:26:05 -!- Phantom__Hoover has quit (Ping timeout: 240 seconds).
21:26:06  To be fair, I'm pretty sure that Native Americans could not have their peyote-smoking rituals out of reservations, which are in principle autonomous.
21:26:11  there are also several "marijuana churches" that are essentially trying to manipulate that bit of freedom of religion to allow them to smoke cannabis legally, but of course they've met less success than rastafarians.
21:26:53  More like Wile E. Coyote-smokin' rituals!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
21:26:54  !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
21:26:54  !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
21:26:59  !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
21:27:00   !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
21:27:03   !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
21:27:04  elliott_: what?
21:27:06   !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
21:27:08  okokokokokokokokokokoko
21:27:09   !!!!!!!
21:27:11  okokokokokokoko
21:27:11  Hi.
21:27:16  okokokokokokokokokokokokokoko
21:27:19  okokokokokokokoko
21:27:25  okokokokokokoko
21:27:30  okokokokokokokokokokokoko
21:27:33  okokokokokokokokoko
21:27:35  okokokokokoko
21:27:35  gregregregregregregregregregorgorgorgorgorgorgorgorgor
21:27:36  is this... freeform okoing
21:27:42  oklopol, your name makes me think of creatures of the deep
21:27:42  Gregor: ah that's true.
21:27:42  okokokokokokokokokokokokokokokokokokokoko
21:27:42  its so beautiful
21:27:48  it should
21:27:53  "eliot" is clearly the best spelling variation of that name.
21:27:59  oerjan: kick shachaf
21:28:02  you don't even want to know what oklopol means
21:28:15  there's a whole mythology
21:28:20  oklopol is secretly lopolko
21:28:26  O
21:28:27  WHO IS IN CAHOOTS WITH ROGER G.
21:28:28  La polka
21:28:28  I KNEW IT!
21:28:56  "Taneb" actually comes from "Benat" <-- trivia
21:28:57  elliott_: Why don't you go read something by T. S. Elliott? Oh, wait, that person doesn't exist.
21:29:20  shachaf: What the fuck did T. S. Eliot ever do for us? Ruin the name Elliott, that's what.
21:29:23 -!- ais523 has joined.
21:29:30  It was a portmantaeu for a shared account that I ended up using way more than Ben ever did
21:29:33  elliott_: He wrote all those cat poems, man.
21:29:42  The way the world ends is actually with me beating people who misspell my name to a bloody pulp.
21:29:47  elliott_: hey T. S. Eliot has some good poems.
21:29:50  And it becomes a black hole and gobbles up everything.
21:29:57  Also all those other poems.
21:30:02  More like: BAD-ems.
21:30:06  I write poems
21:30:10  Oh no.
21:30:14  you mean poo-ems?
21:30:25  (funnier than bad-ems)
21:30:26  * Phantom__Hoover has quit (Ping timeout: 240 seconds)
21:30:27  Facepalm.
21:30:29  Ngevd: me too!
21:30:33  ESOTERIC POETRY CLub
21:30:38  My best insults most people in the world in the first half of a line
21:30:39  No stop.
21:30:40  You're
21:30:41  Ruining life
21:30:58  "All humans are bastards, that is the truth
21:31:05  "All part of a perfect worlds spook
21:31:18  s/ook/oof/
21:31:19  There's this great poem titled "O Eliotttt"
21:31:24  i
21:31:25  hate
21:31:25  life
21:31:26  and also
21:31:27  "In this dark parody that is real life
21:31:27  shachaf
21:31:29  but
21:31:29  ok
21:31:34  im leaving until Ngevd is done with his uh
21:31:35  elliott_: shachaf = life
21:31:36  wonderful recitation
21:31:38 -!- elliott_ has quit (Quit: Leaving).
21:31:38  "A world of poverty, greed, and Strife"
21:31:39  No need to be redundant.
21:31:40  Am done
21:31:55  elliott_: am done
21:32:08  @tell elliott_ am done
21:32:08  Consider it noted.
21:32:23  No more eliotttttttt.
21:32:40 -!- pikhq has quit (Read error: Operation timed out).
21:32:43 -!- elliott_ has joined.
21:32:47  elliott_: is done
21:32:56  am doont
21:33:00  @messages
21:33:00  CakeProphet said 52s ago: am done
21:33:00  deet doot doit
21:33:27 -!- pikhq has joined.
21:33:29  lambdabot: yes that is what I said
21:33:46  fungot, am done
21:33:46  Ngevd: i met all the devs if they know nothing about articles though now that you have
21:34:08   does the haskell vm implement cyclic lists by thunk or by actually creating a cyclic data structure?
21:34:19  oerjan: don't :P
21:34:28  elliott_: man these fetch modi keep getting more ridiculous and not burdening.
21:34:33  it's thunks, but they become actual cyclic once all of them have been evaluated.
21:34:35  ^echo ais523 wiki spam
21:34:35  ais523 wiki spam ais523 wiki spam
21:34:45  oerjan: that's an awfully weird way to describe sharing.
21:34:45  Ngevd: heh, I was just checking that now
21:34:47  ^echo ^echo
21:34:47  ^echo ^echo
21:34:59  wait, are we still discussing cyclic structures in here?
21:35:13  Don't some crystals have cyclic structures?
21:35:18  ok it's a cyclic thunk, which becomes an ordinary cyclic structure when sufficiently evaluated
21:35:19  We've moved on to bicyclic structures now.
21:35:40  "ordinary" in the sense of non-haskell structures
21:36:03  @src cycle
21:36:04  cycle [] = undefined
21:36:04  cycle xs = xs' where xs' = xs ++ xs'
21:36:33  does that form a cyclic linked list?
21:36:38  yep
21:36:49  Well, no guarantees in the Report. :-)
21:36:50  is it because of the weird xs' where xs' =
21:36:51  bit
21:37:01  CakeProphet: it would happen just the same if it used fix
21:37:03  That's what makes GHC do it, yes.
21:37:10  shachaf: for purposes of further discussion on Haskell it can be assumed we're talking about GHC.
21:37:15  yes, that (in practice) enforces sharing of xs' in the two spots
21:37:17  (asshole :P)
21:37:25  CakeProphet: it definitely can't.
21:37:33  cycle xs = fix (xs++)
21:37:45  > fix ([]++)
21:37:48  i'm pretty sure most/all other haskell compilers actually written will do that too
21:37:49    mueval-core: Time limit exceeded
21:38:12  gah, i really want to know if this tehz guy on reddit is the wiki guy
21:38:13  because
21:38:15  he's really stupid
21:38:17  and i hate him
21:38:25 * elliott_ sugar coats things
21:38:27  grr
21:38:49  My thought is rather philosophical: Would it be possible to construct a compiler (in haskell or some future derivate) that doesn't require monads in the definition? For this to work I suppose that the compiler would have to be "compiled along with the program it is compiling". Then again what entity would compile both the compiler and the program?
21:39:06  wat
21:39:06  :-(
21:39:09 * elliott_ waits for someone to assume he wrote that.
21:39:12  Thanks for sharing, elliott_.
21:39:28  It's what I do best.
21:39:31  Sharing, and caring.
21:39:33  And hating.
21:39:43  Clarification: In order to not require monads in order to parse, interpret and emit code the input has to be known when interpreting the compiler. It has to be "part" of the compiler itself. That is somewhat impossible. Unless, I imagine, you postpone compilation of the actual compiler until you have the program. Thus the program that you want to compile becomes part of the compiler itself - and not an input to the compiler. Possibly the "what then compi
21:39:43  les the compiler"-problem could be solved making the compiler self-hosting. -> (Oh, I sense a rather strange loop here...)
21:40:02  Quis compiliet ipsos compiles?
21:40:04  Riddle me that.
21:40:10  what the hell this makes no sense.
21:40:21  Quid pro COMPILEUM, shachaf!!!
21:41:02  elliott_: Fortunately monads.
21:41:07  thank god monads
21:41:14  god bless you monads
21:41:17  I don't see how lack of monads requires any of that.
21:41:23  Bless you, monads. Blonads.
21:41:33  class Blonad a where ...
21:41:53  fuck :: Your Mom -> Fucked Mom
21:42:10  .. :>
21:42:17  class Blonad b where phase :: b (b a) -> a; glunt :: b a -> (a -> b c) -> b (b c)
21:42:43  where's oerjan, I forgot to ask (the .no cop): "Bonvolu alsendi la pordiston, estas rano en mia bideo."
21:42:43  oh my
21:42:53  thats not norwegiwngan
21:42:55  "Unfortunately, there's a radio connected to my brain"
21:43:01  "Actually, it's the BBC controlling us from London"
21:43:01  elliot, I know
21:43:25  BBC: the true ruler of the UK
21:43:27  That looks like Esperanto.
21:43:31  Which is an evil language.
21:43:52  what's the one where your mom's up against walls with sailors?
21:44:19  Sgeo: updottpplllwo3[]l[df[;]
21:45:12  CakeProphet, I hate you. I should trust my notifier.
21:45:33  CakeProphet: you're my hero
21:45:49  conalelliotttcable_
21:46:47  elliott_: :3 :> 3>
21:46:53  er, <#
21:46:54  um
21:46:55  yeah
21:47:09  3>  butt cone
21:47:36 -!- MonkeyofDoom has quit (Ping timeout: 244 seconds).
21:48:35  shachaf: It's worse when put through the Japanese foreign language pedagogy filter.
21:48:46  pikhq: What?
21:48:57  a construct devised by pikhq himself.
21:49:09  "Bonboru arusenji ra porujisutonn, esutasu rano en mia bideo"
21:49:23  CakeProphet: No, just a comment on how foreign languages are taught in Japan.
21:49:42  !userinterps
21:49:42  ​Installed user interpreters: acro aol austro bc bct bfbignum brit brooklyn bypass_ignore bytes chaos chiqrsx9p choo cpick ctcp dc decide drawl drome dubya echo ehird elmer fudd google graph hello id insanetemp jethro kraut lperl lsh map monqy num numberwang ook pansy pi pikhq ping pirate plot postmodern postmodern_aoler prefixes python redneck reverse rimshot rot13 rot47 sadbf sanetemp sfedeesh sffedeesh simplename slashes svedeesh swedish valspeak wacro warez
21:49:47  !sffedeesh Bonboru arusenji ra porujisutonn, esutasu rano en mia bideo
21:49:48  Boooonbooooruuuu iruuuusenjee-a-a-a ra pooooruuuujeesuuuutoooonn, isuuuutesuuuu roooonoooo ie-a-a-a meea beedeoooo
21:50:32  !sffedeesh Bork
21:50:32  Boooork
21:50:53  !pikhq The fuck is this?
21:50:54  ​Þe fuck iſ þiſ?
21:51:02  Ah. Incorrect.
21:51:27  elliott_: quote pls I am lazy
21:51:52 -!- derrik has quit (Quit: ChatZilla 0.9.87-rdmsoft [XULRunner 1.9.0.17/2009122204]).
21:52:07  !redneck hello my friends how are you all doing?
21:52:08  hey there muh frien's how are yew all doin'?
21:52:30  worst redneck ever.
21:53:18  y'all
21:53:30  howdy
21:53:47  Rugxulo: wat
21:53:53  that's esperanto, surely
21:54:04  vikigns don't understand the concept of redneck.
21:54:07  throw in a little Spanglish, too ... muchachos, amigos
21:54:26  Rugxulo: that's the horrid southwestern bastardization, you fool!
21:54:36  E-o? only the quote earlier
21:54:46  including "howdy", no one says howdy in the southeast (well, they probably do actually)
21:54:58  I can vouch for it
21:55:25 -!- elliott_ has quit (Read error: Operation timed out).
21:55:26  "melting pot"
21:56:33  Rugxulo: well of course.  now what does it have to do with .no?
21:57:34   this reminds of how it's illegal in norway to insult a police officer, but _what_ you can say varies by region
21:58:08  Rugxulo: and what does that have to do with the esperanto quote
21:58:23  say that, see what happens    ;-)
21:59:04  @_@
21:59:57  +_+
22:00:11 * Rugxulo doesn't think oerjan gets the joke
22:00:54 -!- Phantom__Hoover has joined.
22:01:00  you don't say.
22:02:10  http://www.imdb.com/title/tt0684161/quotes
22:03:46  man these quotes are HILARIOUS
22:03:56  I am dying from humor intake.
22:03:59  humor poisoning
22:04:15  Also vowel deficiency
22:05:32  they're bringing the show back too (allegedly)
22:08:05  you know that feeling you get when a huge important paper is due tomorrow and you just now realized it?
22:08:58 * Rugxulo is afraid of the answer
22:09:47 * Sgeo has never seen Red Dwarf
22:10:01 * Sgeo also has never seen Ghostbusters
22:10:03 * Sgeo ducks
22:10:21   I've just noticed that currently on TV is a BBC programme dealing with offended people's letters.
22:10:34  they should get john cleese for that.
22:10:36  Sgeo, you are bad
22:10:50  oerjan, you are good
22:10:57  Ngevd: hm?
22:11:04   they should get john cleese for that.
22:12:10  I thought Cleese was off his nut these days?
22:12:13 * oerjan crosses the streams at Sgeo 
22:12:25  Past John Cleese
22:12:40  Phantom__Hoover: oh no, he's working like mad to pay off his divorce
22:12:49  hi
22:12:55  or is that what "off his nut" means
22:12:59  `welcome andrew12
22:13:00  well
22:13:03  andrew12: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
22:13:05  time to load up on caffeine.
22:13:25  oerjan: did you see me join? i've been here since yesterday and already gotten that thrown at me
22:13:32  :P
22:13:44  Andrew, is that you?
22:14:23  huh?
22:14:34  No wait, I'm thinking of a different Andrew
22:15:02  andrew12: oh no, i'm going to have to switch to ais523's method of not telling who he's welcoming
22:15:04  probably
22:15:20  `welcome fungot
22:15:20  shachaf: fnord were a huge hit in japan and people are fnord by theodore kaczynski, fnord fnord fnord
22:15:22  fungot: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
22:15:31  ^style
22:15:31  Available: agora alice c64 ct darwin discworld europarl ff7 fisher fungot homestuck ic irc* iwcs jargon lovecraft nethack pa sms speeches ss wp youtube
22:15:35  Bah
22:15:36  fungot knows to ignore other bots? :-(
22:15:36  shachaf: well i do know that song.
22:15:48  andrew12: I just welcome people at random, in the hope that when I do it to someone in your situation then people won't shout at me
22:15:55  shachaf: usually that's done after a few bot loops
22:15:58  shachaf: I got the last exploit by @telling lambdabot to say fungot
22:15:59  CakeProphet: i tried making something that i probably won't be at the next update which is soon.
22:15:59  `welcome ais523
22:16:01  it was then corrected.
22:16:01  ais523: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
22:16:19  `echo ?where fungot
22:16:19  shachaf: you'll *also* have some idea why it's different :) but i'm willing to convert my tabs to spaces from me hitting tab again and have it work
22:16:20  ​?where fungot
22:16:29  lambdabot?
22:16:36  Oh, come on, lambdabot!
22:16:42  > "I don't listen to people with 'bot' in their name, IIRC"
22:16:43    "I don't listen to people with 'bot' in their name, IIRC"
22:16:55 -!- Ngevd has changed nick to Tanebbot.
22:16:57  shachaf: not only does fungot know to ignore bots, but HackEgo and EgoBot know how to be ignored by bots
22:16:57  oerjan: to be honest, i'm not ruling that out. i have bad expirience with that from emacs)
22:16:59 -!- oklopol has changed nick to oklobot.
22:17:02  > "Let's put this to the test"
22:17:03    "Let's put this to the test"
22:17:10 -!- Tanebbot has changed nick to Ngevd.
22:17:12  hmm, apparently noy that
22:17:18  remember oklobot?
22:17:20  besides, fungot /doesn't/ have "Bot" in its name
22:17:20  ais523: it'd. it had a special form, not about this specific form
22:17:27  it was my first bot
22:17:37  what did it do? oing?
22:17:39  HackEgo prints a non-printing character first
22:17:40  a bot could do that really well
22:17:47  it had that weird stack language that basically just had access to two integers
22:17:48  STupid bot.
22:17:53  Remember Pietbot?
22:17:54  oh hm... there's a loophole isn't there
22:17:57  That never did work
22:18:08  !echo lambdabot: > 2+2
22:18:09  lambdabot: > 2+2
22:18:19  hm apparently not
22:18:23  lambdabot: > 2+2
22:18:26  oh
22:18:33 -!- pikhq_ has joined.
22:18:37  lambdabot: @hm
22:18:37  Maybe you meant: . ? @ bf do ft ghc id pl rc thx v wn
22:18:49 -!- pikhq has quit (Ping timeout: 252 seconds).
22:18:49  !echo lambdabot: @run 2+2
22:18:49  lambdabot: @run 2+2
22:18:50    4
22:18:52  yay
22:19:22 * oerjan leaves the rest as an exercise
22:19:31  ?where+ EgoBot !echo foo
22:19:31  Okay.
22:19:38  !echo ?where EgoBot
22:19:38  ​?where EgoBot
22:19:40  EgoBot: !echo test
22:19:47  !echo lambdabot: ?where EgoBot
22:19:48  lambdabot: ?where EgoBot
22:19:48  !echo foo
22:19:49  foo
22:20:14 -!- ChanServ has set channel mode: +o ais523.
22:20:22  just in case I need to +m the channel for a few seconds to break botloops
22:20:29  I'm not going to do it!
22:21:10 -!- zzo38 has joined.
22:21:18  `welcome
22:21:20  Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
22:21:43  > var "hello, and\n`welcome"
22:21:43    hello, and
22:21:44   `welcome
22:21:45  We should just use `welcome as a generic greating
22:21:48  Phooey.
22:21:57  ?where+ EgoBot `welcome
22:21:58  I will remember.
22:22:02  ?where EgoBot
22:22:02  `welcome
22:22:04  Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
22:22:32  ^echo ?where EgoBot
22:22:32  ?where EgoBot ?where EgoBot
22:22:33  `welcome
22:22:35  Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
22:23:06  !echo ^echo ?where EgoBot
22:23:07  ​^echo ?where EgoBot
22:23:17  Ah yes
22:23:27  fungot == clever bot
22:23:27  Ngevd: it would probably be too simple to concern themselves with state. i think it would be
22:23:48  It even thinks!
22:24:05  EgoBot inserts a zero-width character if the output starts with any punctuation mark
22:24:20 -!- Rugxulo has left ("Leaving").
22:24:34  EgoBot.cleverness > fungot.cleverness
22:24:35  Ngevd: as i said :p. but the original idea was to port the thing over to fnord. i can't imagine
22:24:42  On my computer, the zero-width character is visible, and it overlaps the colon before the message
22:24:44  ^echo ?where
22:24:44  ?where ?where
22:24:45  ?where ?where
22:24:53  fungot even imagine
22:24:54  Ngevd: are you using as a file pathname? should return t only for pathname objects. the fact that what is called ' consistency' before
22:25:04 * shachaf is so tempted to make a bot loop. :-(
22:25:19 -!- pagnol has quit (Ping timeout: 260 seconds).
22:26:54 -!- Phantom__Hoover has quit (Ping timeout: 240 seconds).
22:27:39  shachaf: it's traditional!
22:27:42 -!- Ngevd has quit (Read error: Connection reset by peer).
22:28:52  you cannot get a loop with fungot, since that has an ignore list
22:28:53  oerjan: why do laptops suck for webdev? they run vim as graphical, although it isn't really
22:30:23  ?where huh
22:30:24  I know nothing about huh.
22:30:28  ?where ?where
22:30:28  ?where ?where
22:30:31  ?where >
22:30:31  I know nothing about >.
22:30:37  What is ?where
22:31:07  ?list where
22:31:07  where provides: where url what where+
22:31:18  Helpful
22:31:21  ?what ?where
22:31:21  ?where ?where
22:31:41  ?where Google
22:31:41  Mountain View, California
22:31:44  huh
22:31:50  ?where lambdabot
22:31:50  it's like HackEgo's `?
22:31:50  http://haskell.org/haskellwiki/Lambdabot
22:31:58  Oh, Mountain View, California. I've been there.
22:32:10  ?where Microsoft
22:32:11  I know nothing about microsoft.
22:32:15  ?where Sgeo
22:32:15  I know nothing about sgeo.
22:32:59  ?where haskell
22:32:59  http://haskell.org
22:33:02  ?where oerjan
22:33:02  I know nothing about oerjan.
22:33:04  ?where elliott
22:33:04  elliott is tumbling around Northumberland
22:33:25  Is elliott actually in Northumberland?
22:33:29  yes.
22:35:15  Sgeo: Redmond, Washington.
22:35:27  Do not use this calculator as a card in a card game or as a meat in a hamburger.
22:35:34  where i've been, btw
22:37:45  Maybe I should go visit elliott.
22:37:59  What does he do wherever he is, anyway?
22:38:05  shachaf: wait, _you_ are in northumberland?
22:38:11  No.
22:38:15  whew
22:38:24  I may end up there one day, though! You can never tell with bees.
22:38:24  we don't have room for more esolangers there.
22:38:34  oerjan: Wait, *you* are in Northumberland?
22:38:38  no
22:38:43  Whew.
22:38:49  We don't have room for more esolangers there.
22:38:57  ah.
22:39:24 -!- Phantom__Hoover has joined.
22:39:24 -!- Phantom__Hoover has quit (Client Quit).
22:40:04  shachaf: wait, you are a bee?
22:40:46 * shachaf wonders whether to answer that question.
22:41:01 -!- Phantom__Hoover has joined.
22:41:03  ah, it's a secret? ok.
22:41:13  Something along those lines.
22:41:35  a bee from the land of milk and honey
22:42:28  `? shachaf
22:42:30  shachaf mad
22:42:38  `learn shachaf is a bee.
22:42:40  I knew that.
22:42:49  `? oerjan
22:42:51  Your future evil overlord oerjan is an expert in lazy computation.
22:42:54  `? Phantom__Hoover
22:42:56  Phantom__Hoover? ¯\(°_o)/¯
22:42:58  `? Phantom_Hoover
22:43:01  Phantom_Hoover? ¯\(°_o)/¯
22:43:05  (
22:43:08  :(
22:43:10  shocking
22:43:39  `learn Phantom_Hoover is a true scotsman and hatheist.
22:43:41  I knew that.
22:44:09  `learn Phantom__Hoover can't decide what an appropriate number of underscores is.
22:44:12  I knew that.
22:45:25  `learn Phantom_Hoover is a true Scotsman and hatheist.
22:45:28  I knew that.
22:46:01  oerjan: You realize I used two _'s there X_X
22:46:06  Oh
22:46:07  Never mind :P
22:46:09  yes.
22:46:10  You were correcting caps.
22:46:19  I thought you were trying to reset, but I'm le'dumb.
22:46:27  `? Gregor
22:46:29  Gregor took forty cakes. He took 40 cakes. That's as many as four tens. And that's terrible.
22:46:39  ?where Gregor
22:46:39  I know nothing about gregor.
22:46:47  ?where zzo38
22:46:47  I know nothing about zzo38.
22:47:18  ?where+ zzo38 is Canadian, eh
22:47:18  Done.
22:48:07  zzo38 is Canadian?
22:48:10  yes.
22:48:14 -!- Patashu has joined.
22:48:15  shocking, isn't it
22:48:17  And what of the great Gregor Wertheimer?
22:48:25 * shachaf admits to being kind of surprised.
22:48:27  zzo38: What's your last name?
22:48:36  McCanadacle
22:49:06  shachaf: it's a quite european-sounding name
22:50:04  well, english actually
22:50:50 * CakeProphet made a Skyrim character.
22:50:51  England: No longer part of Europe. (Well, to be fair it never REALLY was)
22:51:10  Gregor: that was a narrowing, not a correction :P
22:51:13  Breton warrior-mage kind of dude. focusing on one-hand, block, heavy armor, conjuration, block, and alteration.
22:51:32  did I mention block?
22:51:51  no, just block and block
22:51:54  You should make an Uber smiter.
22:52:02  I don't know what that is, but okay.
22:52:12  basically he's kind of like a warlock knight.
22:52:14  You know, for the Ubers.
22:52:46  and probably kind of tankish because block + heavy armor + Breton magic resistance + armor spell
22:53:02  and summoned minion.
22:53:18  20 points in Smite, Holy Shield, Fanaticism/Defiance, something like that.
22:53:22  I don't remember, it's been a while.
22:53:24  ah yes of  course.
22:53:36  shachaf: that sounds like... Diablo?
22:53:49  paladin class in Diablo I think has those.
22:53:52  Yep.
22:53:56  Diablo II.
22:53:56  *Diablo II
22:53:57  yes
22:54:14  I had such a great smiter.
22:54:24  That's a complete lie. I had a barely adequeate smiter.
22:54:27  But I remember him fondly.
22:54:29  I usually played necro or sorc or... yeah that's pretty much it.
22:54:44  CakeProphet: Did you play online?
22:54:47  yep
22:54:53  Did you ever do the Ubers?
22:54:55  no.
22:54:58  I don't know what that is.
22:55:00  Aw.
22:55:23  It was an online-only thing with a super-powerful version of Diablo,Mephisto,Baal in one level.
22:55:49  Eventually they dropped a http://diablo.wikia.com/wiki/Hellfire_Torch
22:55:55  I do have a little bit of destruction but I don't really want to focus on it because fireballs and lightning bolts are boring.
22:56:06  A smiter was pretty much the safest way to kill them.
22:56:18  but setting people on fire as you smash them over the head with a mace is pretty enjoyable.
22:57:48  shachaf: sorceress was pretty much ridiculous.
22:57:54  with the ice orb thing.
22:58:09  CakeProphet: Sounds to me like you didn't play beyond the first difficulty level.
22:58:27  In Nightmare and especially in Hell there are lots of ice-immune monsters.
22:58:32  no I wasn't a h4rdc0r3 D2 person.
22:58:46  Also fire-immune and lightning-immune. A sorceress couldn't get far on her own without being very careful.
22:58:48  "Thus, 1 2>a will invoke register a's contents and 2 1>a will not."
22:58:49  >_<
22:58:57  I thought my comparisons were all off.
22:59:00  No, the universe is all off.
22:59:19  10 2 / is 10/2, not 2/10. And yet 10 2 > is 2>10, not 10>2
22:59:22  DAMN YOU DC
22:59:35  occasionally I wonder, as I sit outside filling my lungs with carcinogens
22:59:43  what if some evil bug monster has evolved right at my house
22:59:50  like, the first few of its kind.
23:00:05  some giant hive of giant bees.
23:00:12  or like a giant scorpion thing.
23:00:28  with projectile stingers.
23:02:28  WHO JUST GOT SOME DUFF'S DEVICE IN THIS BITCH
23:02:34  GREGOR JUST GOT SOME DUFF'S DEVICE IN THIS BITCH
23:02:45  (Note: not actually Duff's device, just aesthetically similar)
23:05:15  Oh, the D2 ladder was just reset on Oct 25.
23:05:21  Maybe I should play...
23:10:54  D2?
23:14:03 -!- Jafet has quit (Quit: Leaving.).
23:14:43 * Phantom__Hoover → sleep
23:14:44 -!- Phantom__Hoover has quit (Quit: Leaving).
23:16:12  OMG
23:16:13  BAHAHAHA
23:16:17  I am ONE BYTE below the limit.
23:16:19  2047 code bytes.
23:16:34 -!- copumpkin has quit (Ping timeout: 252 seconds).
23:16:59 -!- copumpkin has joined.
23:19:11  Gregor: quick! find a problem that requires more code!
23:19:39  CakeProphet: This problem requires more code, but sadly I haven't the space.
23:22:46  Vorpal: hi
23:22:55  I played Skyrim. :3
23:23:13  Gregor: golf it up.
23:23:25  CakeProphet: It's golfed all to hell.
23:24:11  CakeProphet: I wrote a (tragically non-golf) program to give me recommendations on what to reduce with typedefs/#defines.
23:25:14  ah nice.
23:25:34 -!- ais523 has quit (Remote host closed the connection).
23:26:27  I wonder if I could devise a programming language based on big burly men wrestling.
23:26:48  depends
23:26:52  do you consider sumo wrestlers burly
23:26:55  sure.
23:27:00  then yes
23:27:19  one challenger could be halt, the other could be non-halt
23:27:29  AND THEY BATTLE TO SEE WHO WINS.
23:27:34  (spoiler: non-halt never wins)
23:27:35  no, it needs to be three ways
23:27:39  Halting problem: SOLVED
23:27:42  no wait
23:27:49  two ways between accept and reject
23:27:54  a non-halting program is a draw
23:28:46  so I guess your input is like WEAPONS
23:28:52  or.. uh.. ADVANTAGES
23:30:28  http://www.npr.org/2011/11/20/142569472/how-one-man-played-moneyball-with-jeopardy?sc=fb&cc=fp
23:33:18  I enjoy the comments where people say he is cheating.
23:39:54  "Using data-mining and text-clustering techniques, Craig grouped questions by category to figure out which topics were statistically common — and which weren't."
23:40:03  shouldn't this be s/questions/answers/?
23:40:43  elliott is not here
23:40:49  Sgeo: updoot
23:41:06  CakeProphet, yes, that's what I wanted to tell elliott
23:41:18  brave sir elliott ran away, he bravely ran away away
23:41:28  I GUESS YOU JUST WON'T NOW, HUH?
23:41:30  OH NO.
23:41:53  Sgeo: the world
23:41:54  is ending
23:42:04  because you can't tell elliott
23:42:12  about the uhpdeet
23:42:53 * CakeProphet gentley shooshpaps Sgeo.
23:43:19 * Sgeo has to go
23:44:46  Sgeo: I'm going to ignore the previous thing you said and continue talking to you
23:44:54  Sgeo: is Dr. Brinner actually going to be a thing.
23:45:00  because it could possibly be a good idea.
23:45:10  though I'm pretty sure it's just a non-existent parody thing of homestuck.
23:46:32  Bye
23:50:30  I'm out of platforms.
23:51:05  Gregor: what about PS2 and Nintendo 64?
23:52:36  CakeProphet: So, MIPS and MIPS?
23:52:40  CakeProphet: Covered and covered.
23:57:26 -!- Jafet has joined.
23:59:04  I want one more architecture so it's an even dozen.
23:59:06  Gregor: Super Nintendo?
23:59:21  Needs to be 32-bit :P
23:59:34  NOT PORTABLE ENOUGH
23:59:43  :'(
23:59:55  this shit needs to run on MOS Technology 6502.

2011-11-21:

00:12:58  "As the game has just been released, only a moderate amount is known about the gameplay. Although there is a decent amount of information that has been shown, it appears as though this information only scratches the surface."
00:13:03  from elder scrolls wiki
00:13:23  I like how people are just assuming that Skyrim has all these uncovered secrets
00:13:34  because they've bought into too much hype.
00:13:36  It does, if you're a munchkin
00:13:51  And if you're reading the wiki, you're a munchkin.
00:14:04  what is a munchkin?
00:14:21  a creature from the wizard of oz.  hth.
00:15:16  their wiki-reading powers were even more impressive as they had no computers
00:24:43  @tell elliott Regarding that paging algorithm anecdote a couple days ago which you asked if had anything to do with synchronicity - today's GLL is about the question: http://rjlipton.wordpress.com/2011/11/19/another-annoying-open-problem/
00:24:44  Consider it noted.
00:24:57 * oerjan whistles innocently
00:39:29  Vorpal: so apparently the bound weapons in skyrim are equivalent to ebony weapons in damage.
00:40:06 -!- simpleirc966 has joined.
00:40:13  and also scale with your weapon skill (one-handed skill improves the damage of bound sword). which means they're retardedly good at early levels.
00:41:14 -!- simpleirc966 has left.
00:44:20  so I might actually try dual-wielding bound swords instead of using a shield, and then later once I get nice enchanted weapons and use those (and then use the bound sword to refill soul gems)
00:47:19  I'm disappointed in the complete lack of variety of spells in this game though. There are only three conjured weapon spells now instead of bound boots, bound bow, bound cuirass, bound dagger, bound gauntlets, bound greaves, bound helmet, bound mace, bound shield, etc, etc
00:47:23  in oblivion
00:49:14  granted most of the bound armor spells are probably not very good, but they could have kept the variety of weapon conjuration spells
00:50:04  the spell system is so horribly unrealistic
00:50:28  oerjan: :P
01:01:52  Bound Mead
01:20:42  ha
01:29:22  Jafet: presumably the alcohol would leave your system once the conjuration spell wears out.
01:29:43  instant hangover cure!
01:31:49  Today, I have played, Dungeons and Dragons game.
01:33:59 -!- zzo38 has quit (Remote host closed the connection).
01:42:46  zzo38: bye
02:08:16  *sigh* Canterbury Tales is perhaps the most pointless feature of an English class. It's *literally in a different language* for goodness sake!
02:09:17  This complaint brought about by listening to my little sisters.
02:09:49  pikhq_: but it's such a good story about uh
02:09:51  ...whatever it's about.
02:10:02  well, we did have some norse myths in norwegian class
02:10:18  oerjan: Were they in the original Old Norse?
02:10:22  yes.
02:10:29  That's fucking cruel.
02:10:34  norse myths are way more awesome than Canterbury Tales though.
02:10:35  And pointless.
02:10:53  But it does have the redeeming factor that Norse myths are way more awesome than Canterbury Tales.
02:11:23  it was only a taste during one year of high school though, afair
02:11:53  there was also some swedish and danish
02:12:12  why is there no British mythology in schools? Did none of the writing survive?
02:12:32  There's no single "British mythology".
02:12:42  what is there other than beowulf?
02:13:50  oerjan: Norse mythology is itself a version of Germanic mythology; the Anglo-Saxons had their own.
02:14:06  oerjan: remind me. what's the best way to grab a list of numbers from a line of input -- oh nevermind (map read . words) <$> getLine
02:14:08  i mean, that has survived
02:14:32  parentheses not necessary
02:14:35  best way as in simplest not necessarily the safest industry strength shit ever.
02:14:59  CakeProphet: well that'll obviously break if there's any misformatting
02:15:05  right.
02:15:06  which is fine
02:15:19  because this a program to calculate averages from a list of numbers :)
02:15:20  oerjan: Random samplings of things; nothing exceptionally *long*, though. Beowulf is the only surviving epic poem of the era.
02:16:32  ah as was my impression
02:16:44  in other news: length is stupid. genericLength is good.
02:16:45  Of course, Anglo-Saxon myths aren't the only bits of English mythology. The Celts are also from the British Isles. :)
02:17:13  I literally just went through an entire thread of discussion with multiple haskell nubs being completely baffled on how to write a simple averaging program.
02:17:19  because sum ls / length ls  does not work
02:17:33  when it probably shouldn't.
02:17:53  actually even genericLength doesn't work iirv
02:17:54  *c
02:17:59  :t genericLength
02:18:00  forall b i. (Num i) => [b] -> i
02:18:00  no it does
02:18:03  oh
02:18:11  > let x = [1,2,3] in sum x / genericLength x
02:18:11  i thought it might be Integral
02:18:12    2.0
02:18:19  as it should be.
02:19:11  so is the $ even necessary in forever $ do ...
02:19:17  yes
02:19:24  hmmm
02:19:31  I guess that makes sese.
02:19:33  sense
02:20:15  \, do and let cannot be used directly as arguments
02:20:18  it seems reasonable that you could omit parenthesis around a do block and they would be placed explicitly around it.
02:20:35  with explicit parens being used in situations where you have something trailing the do block in the expression
02:20:48  but, $ is perfectly fine. -uses that-
02:20:57  er
02:21:00  *implicitly :P
02:21:01  yes.  i was surprised way back when i discovered it, too
02:21:11  (that it doesn't work)
02:21:17  right
02:22:06  @hoogle genericLength
02:22:07  Data.List genericLength :: Num i => [b] -> i
02:22:21  aw no Prelude
02:22:27  nope
02:22:43  I pretty much import Control.Monad and Data.List without even considering if I need them or not
02:22:46  because
02:22:49  I probably will
02:22:53  heh
02:22:55  and probably Control.Applicative but sometimes not
02:23:24  yeah they're like secondary syntax
02:24:02  I feel that <$> should be Control.Monad
02:24:07  or maybe just in Prelude or something.
02:25:03  Control.Applicative makes sense though, as its used in the f <$> x <*> y  idiom
02:25:04  It's in .ghci
02:25:26 -!- Jafet has quit (Quit: Leaving.).
02:25:29  but <$> really has nothing to do with Applicative. :P
02:25:35  (or monads I guess...)
02:25:58  other than that monads and applicatives are functors.
02:26:57  @hoogle f a -> f b -> f b
02:26:58  Control.Applicative (*>) :: Applicative f => f a -> f b -> f b
02:26:58  Prelude (>>) :: Monad m => m a -> m b -> m b
02:26:58  Control.Monad (>>) :: Monad m => m a -> m b -> m b
02:27:44  > [1, 2, 3] *> [4,5,6] == [1,2,3] >> [4,5,6]
02:27:45    Precedence parsing error
02:27:45       cannot mix `Control.Applicative.*>' [infixl 4...
02:27:54  > ([1, 2, 3] *> [4,5,6]) == ([1,2,3] >> [4,5,6])
02:27:55    True
02:28:56  maybe Haskell should just have a FunctorApplicativeMonad class. yes, that's a good name for it.
02:31:30  CakeProphet: i think <$> is also exported from Data.Functor
02:32:07  but I never actually import that. :P
02:32:33  CakeProphet: well if they fixed the missing subclassing mess, Monad should reexport Applicative should reexport Functor
02:32:42  i think
02:33:04  Control.Monad never seems to have <$>. let me double check.
02:33:17  well of course not.
02:33:37  Monad should reexport Applicative should reexport Functor
02:33:38  huh?
02:33:45  it's not a function of Monad or any current superclass
02:33:54  CakeProphet: *Data.*
02:33:57  right
02:33:58  I mean
02:34:06  if Monad rexports Functor transitively
02:34:08  why is <$> not there?
02:34:18  i didn't say it did, i said it _should_ do it
02:34:39  once Monad becomes a real subclass of Applicative
02:34:48  oh I thought you meant the kind of "should" that means "I'm fairly certain this is the truth"
02:35:01  not the normative "this is how it should be but is not" version :P
02:35:21  oh, i see my tenses could be interpreted as "this has already happened"
02:35:25  oerjan: yes that should happen in Haskell 2020
02:35:43  fingers crossed
02:36:03  time to painstakingly collect statistics from a dumb questionnaire thing.
02:36:12  for a 10 page report that's due tomorrow that I am just now starting
02:36:13  yesss
02:41:21  I probably could have just used an existing calculator program to do these averages
02:41:26  BUT THIS IS EASY TOO
02:42:23  I'm kind of baffled as to how my program knows which Read instance to use.
02:42:38  the only inferred types are typeclasses.
02:42:43  :t (/)
02:42:45  forall a. (Fractional a) => a -> a -> a
02:42:53  does Haskell do some kind of auto-default thing?
02:43:19  or does Fractional have a Read instance?
02:44:40  yes, it defaults to Integer or Double, as appropriate
02:45:12  you can change that with a default declaration
02:45:36  ah okay.
02:45:46  is this feature available for other data types?
02:46:14  there's an ExtendedDefaulting option
02:46:28  that would be good to declare String as default for IsString for example
02:46:34  if OverloadedStrings doesn't already.
02:47:06  i'm not sure but that might work with the extended option
02:47:28  also an Expr default would be nice for SimpleReflect
02:47:51  without the extended option, it's limited to only numerical classes defined in the haskell report
02:50:33  oerjan: do you know anything about the CS program at your school?
02:51:16  no
02:51:23  I didn't realise oerjan was presently in a school.
02:51:31  that would be the main reason :P
02:51:49  There we go, that makes more sense. :)
02:52:12  oh... okay.
02:52:35  oerjan: You should've quit with "Exception: Prelude.undefined" and left people to figure out what they said wrong.
02:52:58  technically, additional classes are permitted from the standard library.  but for some reason Random seems to have been left out in the implementations i've tried (ghc, hugs)
02:53:45  well, last i tried
02:54:14  > map (1 +) $ randoms (mkStdGen 42)
02:54:15    [-3907187990116499534,-2519438828217931932,-8264534369199619666,86887135830...
02:54:18  oh hm
02:54:19  http://rjlipton.wordpress.com/2010/11/03/equations-over-groups-a-mess/
02:54:24  oerjan: is this you in the first visible comment?
02:54:38  yes, yes it is
02:54:39  i guess it may have been fixed
02:54:45  because there is also a Phantom Hoover
02:55:14  a Phantom Hoover and a Ørjan Johansen in the same comment thread about math stuff.
02:55:17  must be oerjan.
02:55:56  i still haven't got around to ban Phantom_Hoover for that comment
02:57:27  oerjan: I think his user pic is a wallpaper group.
02:57:41  fitting given the subject of group theory.
02:58:12  probably, that is obviously from the default pic selection
02:58:21  obviously?
02:58:31  I've noticed people in #esoteric have a strange definition of obviously.
02:59:01  well it looks similar to all the others that don't have actual portraits
02:59:21  my google chrome was lazy and only loaded half of the pictures.
02:59:35  oh yes, I see.
02:59:55  fascinating problem, that group theory / complexity one btw, i've been thinking more about it lately
03:00:12  if only I knew anything about math. :P
03:00:15  then I could comment on that.
03:00:17  and how interesting it is.
03:00:55  in fact i think i ruled out the "another idea" i made further down
03:01:29  oerjan: perhaps you should USE HASKELL TO SOLVE THIS PROBLEM YEAH
03:02:10  i've considered it
03:04:01  I wonder if I'll learn about groups when I take topology.
03:04:11  are they in any way related?
03:04:24  yes, if you take _algebraic_ topology
03:04:36  no just an intro topology course probably.
03:04:42  well, the only topology course my university offers.
03:04:51  for undergraduates.
03:05:12  but first I have to take intro to advanced math, which is probably just "lolproofs"
03:05:15  i guess it depends whether it goes much beyond the basics
03:05:24  proofs of what? I don't know. Maybe it will touch some things like relations and algebras.
03:06:35  we already did stupid number theory and induction proofs in discrete math, so I'm hoping it will not repeat those.
03:08:04  I bet we'll still use naive set theory, though. because everyone loves naive set theory even though it's A PARADOX -spooky noise-
03:11:12  well using naive set theory mostly means "using zfc but not bothering to mention the restrictions"
03:11:30  ...possibly an overstatement.
03:12:40  oerjan: no that seems to be the case.
03:13:09  because the kind of set theory stuff we did in discrete math was not very complicated.
03:13:38  oh discrete math probably means all the sets are finite or countable
03:13:43  yep.
03:13:45  countable.
03:13:48  for the most part.
03:13:54  a lot of number theory stuff.
03:14:28  but then we went into things like graphs which were finite and relations which are sometimes finite.
03:14:38  and then zf's replacement axiom (the fraenkel part) says the sets are all ok
03:14:44  good class. it's a nice "intro to everything fun in math"
03:15:14  as opposed to calculus
03:15:20  which is "intro to everything painful in math"
03:15:35  >_>
03:15:43  maybe I'm just a discrete kind of guy.
03:16:04  whereas continuity fucks with my brain.
03:16:48  "as x approaches 1" what? I mean I know what that means but how do you define that? then I would go to my book and try to understand the definition of a limit and fail.
03:17:26  yes, I went through derivatives and integrals and multi-dimensional integrals in calculus
03:17:32  without a very clear definition of what a limit is.
03:17:41  heh, perhaps some of the topological formulations of limit might make it click.  or hopefully not make it worse.
03:18:44  discrete stuff, on the other hand, is largely intuitive to me though.
03:18:53  much of the essence of topology is about generalizing the heck out of limits
03:19:01  awesome.
03:20:13  how much calculus is there>
03:20:20  calculus: definitely my least favorite math.
03:20:25  well in one direction, anyway.  category theory has an even more brain-wrecking way. :P
03:20:52  actually I should ask: how many integrals.
03:21:07  integrals seem pretty topological...
03:21:35  well...
03:21:59  it's like a summation of all the points in some object.
03:22:03  basically?
03:22:30  integrals are just fancy continuous summation things. at least that's my intuitive understanding.
03:23:30  well it depends on which way you generalize them.
03:24:03  oh wait so you can integrate via other things?
03:24:05  lebesgue integration tries to remove as much as possible of continuity requirement
03:24:11  *the
03:24:37  otoh that also generalizes to many topological spaces
03:25:53  but that's via measure theory.  you're not going to see that in a basic topology course.
03:26:17  my understanding was that basic topology is a lot of set theory.
03:26:21  yeah
03:26:35  and maybe like... relations?
03:26:50  a homeomorphism is a kind of relation right?
03:26:58  it's a bijection
03:27:11  so a function in particular
03:27:43  but "homeomorphic" is a relation between topological spaces
03:27:58  (it says there's a homeomorphism between them)
03:28:22  ah okay
03:28:31  and i guess there's a slight ambiguity in using the term "homeomorphism" for either
03:28:39  because the bijective quality means that each element is equivalent to one other in the other space.
03:30:00  yes, although there is not necessarily (i.e. rarely) a _unique_ homeomorphism
03:30:06  and homeomorphism is the isomorphism of topological spaces, because one-to-one equality is a good way for sets of things to be isomorphic.
03:30:35  well sort of yeah
03:30:43  yes in no way is that a formal statement of things :P
03:31:09  the extra requirements of what kind of bijection it is are important too, otherwise you just get a test for cardinality
03:31:14  are all isomorphisms necessarily bijective?
03:31:48  well in a general category they're not necessarily _functions_
03:31:56  just mappings.
03:32:01  um
03:32:11  mapping usually is a synonym for function
03:32:14  oh...
03:32:20  I thought it was a more general thing.
03:32:24  so *just morphisms
03:32:45  what else is a morphism besides a function.
03:32:49  I haven't really encountered an example.
03:33:11  well there _might be_ a terminology for mappings that aren't functions.  there usually is some way to generalize things.
03:33:40  The notion of morphism recurs in much of contemporary mathematics. In set theory, morphisms are functions; in linear algebra, linear transformations; in group theory, group homomorphisms; in topology, continuous functions, and so on.
03:33:47  ...but those are all just different kinds of functions. :P
03:34:18  oh hm
03:34:23  relations can be morphisms
03:34:35  ah yes
03:34:36  there's a category Rel (iirc)
03:34:44  relation is a generalization of functions right?
03:35:01  yes, or functions are a special case of relations
03:35:05  right.
03:35:52  so.... morphisms /are/ relations then (as far as we know)? or... is there another example that makes this not true?
03:36:45  "as far as we know" meaning that there isn't anything that's been called a morphism that isn't some kind of relation.
03:37:46  well there are the categories of partial orders, for which the morphisms are _elements_ of relations, or pairs really
03:38:32  ah okay
03:38:35  say the order of natural numbers, with objects the numbers and morphisms pairs of numbers (m,n) with m <= n
03:38:55  ah okay.
03:39:13  partial orders are really interesting.
03:39:21  :O
03:39:24  category theory!
03:39:46  to me they seem like... ordering trees?
03:39:50  there is also another more advanced example called the category of topological spaces with morphisms _homotopy_ classes of continuous functions
03:40:25  this one is important because it's, iirc, not even _equivalent_ to a category with function morphisms (a "concrete" category)
03:41:06  or wait, can partial orderings form a graph?
03:41:15  yes
03:41:17  that doesn't really make any sense to me.
03:41:18  :P
03:41:28  er, excuse me, *cyclic graph
03:41:43  oh, no.  antisymmetric law.
03:41:48  okay good
03:41:50  sanity is restored.
03:42:11  sometimes I say "graph" when I actually mean "cyclic graph"
03:42:17  because lol computer science
03:42:56  mhm
03:43:32  http://en.wikipedia.org/wiki/File:Poset6.jpg
03:43:34  so delicious.
03:44:24  > [1,2,3,4] < []
03:44:25    False
03:45:31  are there any standard library Ord instances that are a valid partial ordering of whatever structure it orders?
03:45:36  *not a valid
03:46:17  Double
03:46:26  and Float
03:46:30  for what reason?
03:46:35  because of NaN
03:46:39  hm
03:46:46  > 5/0
03:46:47    Infinity
03:46:48  > 0/0
03:46:48    NaN
03:46:53  > 0/0 > 1
03:46:54    False
03:46:57  > (0/0) == (0/0)
03:46:58    False
03:47:02  ah.
03:47:12  that is weird as fuck. :P
03:47:17  but also makes sense.
03:47:23  no it doesn't
03:47:27  weird enough that it's been considered to change it
03:47:28  IEEE 754 sucks balls
03:47:34  > 0/0 < 1
03:47:35    False
03:47:53  I mean, what true claims can you make about something that isn't a number apparently?
03:48:00  because it breaks uses of Ord for things like search trees
03:48:06  it breaks everything
03:48:11  it shouldn't live in the type
03:48:23  how often does it crop up though?
03:48:32  all the fucking time, and silently corrupts your shit
03:48:43  CakeProphet: whenever someone accidentally puts a NaN into a Data.Map.Map
03:48:49  it's not just that
03:49:13  oerjan: granted, you shouldn't be putting doubles into a map or a key into anything really
03:49:26  I imagine you could probably make a SafeFloat with GADTs or something?
03:49:26  if anything you'd want them in an interval tree
03:49:30  well i guess
03:49:35  CakeProphet: just a wrapper around them
03:49:53  wrapper how?
03:49:59  newtype
03:50:05  provide a bunch of operations that never produce nans
03:50:06  then just redefine the Floating instance?
03:50:08  oh
03:50:13  what would 0/0 produce?
03:50:17  an error
03:50:24  copumpkin: _or_ a different Ord
03:50:24  SafeFloat would be compiletime
03:50:26  which is better.
03:50:31  how would that work?
03:50:38  uh...
03:50:42  let me think about that :P
03:51:00  you could have a phantom parameter that indicates whether it definitely does not contain a NaN
03:51:04  or whether the guarantee is lost
03:51:06  copumpkin: right
03:51:14  but then all your num types break
03:51:19  well, maybe not
03:51:30 * copumpkin shrugs
03:51:57  what about positive and negative infinity?
03:51:59  do these break things?
03:52:36  x/0 is a bit more common than 0/0
03:52:54  (infinitely more common, perhaps? :P )
03:53:01  those at least compare correctly
03:53:17  doing arithmetic with them is a bit meh but sort of makes sense
03:53:39  I imagine there are a lot of cases where you'd instead want a zero division error and not an infinity.
03:54:22  yeah
03:58:24 -!- pikhq has joined.
03:58:59 -!- pikhq_ has quit (Ping timeout: 260 seconds).
03:59:03  (1/0) * (-1/-1)
04:00:30  Sgeo: that's why there's also negative and positive zero
04:01:11  hm...
04:01:23  I think I might have some understanding of the pain of grading papers.
04:01:31  > (1/((-1)/0)) < 0
04:01:32    False
04:01:34  going through these questionnaires and calculating average response.
04:01:43  > (1/0) * ((-1)/(-1)) == (1/0)
04:01:44  er
04:01:44    True
04:01:50  > (1/0) * ((-1)/(-1)) == (1/(-0))
04:01:51    False
04:01:56  derp
04:02:08  Oh, I see
04:02:20  > (1/0) * ((-1)/(-1)) == ((-1)/(0))
04:02:21    False
04:02:23  > (1/0) * ((-1)/(-1)) == ((-1)/(-0))
04:02:24    True
04:02:27  oerjan: can you give a concrete explanation for why zero typically /doesn't/ have a sign?
04:02:28  Ok, cool
04:02:44  it could easily have a sign, right? or does that mess up EVERYTHING.
04:03:19  CakeProphet: because it doesn't in a group/ring/field
04:03:46  If I could relay the notion of negative 0 to my 7th grade self...
04:03:56  > -0
04:03:57    0
04:04:05  > -0 == 0
04:04:06    True
04:04:11  > -0.0 == 0.0
04:04:12    True
04:04:14  :/
04:04:19  > 1/(-0)
04:04:20    -Infinity
04:04:29  :t 0.0
04:04:30  forall t. (Fractional t) => t
04:04:42  I bet == is broken
04:04:49  well, no.
04:04:56  I bet -0 and 0 are broken with respect to each other.
04:05:00  :t 1/(-0)
04:05:01  forall t. (Fractional t) => t
04:05:03  Sgeo: well of course
04:05:07  probably in the common case you actually want -0 and 0 to be equal.
04:05:16  we already established that for NaN
04:05:16  because in most applications there is only one kind of zero.
04:05:33  > isNegativeZero 0
04:05:33    False
04:05:38  > isNegativeZero (-0)
04:05:39    True
04:05:45  @hoogle isNegativeZero
04:05:46  Prelude isNegativeZero :: RealFloat a => a -> Bool
04:05:51  oh, okay.
04:06:13  @hoogle RealFloat a => a -> Bool
04:06:13  Prelude isDenormalized :: RealFloat a => a -> Bool
04:06:14  Prelude isIEEE :: RealFloat a => a -> Bool
04:06:14  Prelude isInfinite :: RealFloat a => a -> Bool
04:07:38  @src RealFloat
04:07:39  Source not found. That's something I cannot allow to happen.
04:07:42  darn
04:07:56  well it's a long list of methods
04:08:16  @hoogle RealFloat
04:08:16  Prelude class (RealFrac a, Floating a) => RealFloat a
04:08:16  Data.Text.Lazy.Builder.RealFloat module Data.Text.Lazy.Builder.RealFloat
04:08:17  Data.Text.Lazy.Builder.RealFloat realFloat :: RealFloat a => a -> Builder
04:08:28  bah
04:08:41  oerjan: interestingly only 35% of respondents to my questionnaire reported that one of their professors had incorporated Linux into a project or homework assignment
04:08:53 -!- myndzi has changed nick to myndz\.
04:08:56  58% said that their professor /mentioned/ Linux as part of a lecture.
04:09:30  (my proposal is on incorporated Linux education into the curriculum at our university)
04:09:34  *incorporating
04:11:47  @tell Sgeo Updelbrot
04:11:48  Consider it noted.
04:13:20 -!- DCliche has joined.
04:14:19 * Sgeo slaps CakeProphet 
04:14:20  Sgeo: You have 1 new message. '/msg lambdabot @messages' to read it.
04:14:35 -!- Darth_Cliche has quit (Ping timeout: 244 seconds).
04:16:19  Sgeo: I wonder if we can formulate a definitive count of how many Homestuck characters are Mary Sue-like?
04:17:02  not actual Mary Sues, but having traits of Mary Sues, perhaps as a parody.
04:17:03  I think if most of the characters are Mary Sue-like, they start to equalize
04:17:34  Perfecto the Magnificent
04:18:12  both Jade and Jake start out with ridiculous gadgetry
04:18:15  that continues to grow.
04:18:56  or well, in the case of Jade it did
04:19:03  i wonder if anyone has tried to make a comic with many recurrent characters that are _all_ mary sues
04:19:04  we do not know what happens with Jake yet.
04:19:28  oerjan: MSPA is pretty close.
04:19:33  ok
04:19:38  er homestuck
04:19:39  I mean
04:20:41  the later acts of homestuck kind of do a lot of parodying of indulgent fantasy fiction, to my perspective.
04:22:16  for each of the now 18 kids (soon to be 20) that have been introduced, each of them have all sorts of quirky interests and talents that you might find in a poorly written fan fic.
04:31:44 -!- GreaseMonkey has joined.
04:46:27  oerjan: question
04:46:36  > fix (\f x -> if x > 0 then x * f (x-1) else 1) 5
04:46:37    120
04:46:42  what is non-strict about that function?
04:47:25  it doesn't actually loop if you give it just _one_ argument :P
04:47:36  hmmm
04:47:39  okay.
04:47:58  so basically, currying is non-strict?
04:48:03  yeah
04:48:13  makes sense.
04:48:16  you aren't forcing f unconditionally
04:49:52  Looks like it should usually give you a "x * f (x-1)" thunk.
04:50:23  I think oerjan pretty much explained it.
04:50:32  Strictness analysis might change that slightly, but I don't think GHC's going to turn that into f (x-1) `seq` x * f (x-1).
04:50:43  Erm.
04:50:48  Bleeeh
04:50:49  pikhq: * /is/ strict you know.
04:50:52  it's not even about strictness actually
04:51:09  it's just that the code is not actually evaluated in regards to the infinite recursion of fix.
04:51:10  not strictly about strictness, anyway
04:51:34  CakeProphet: Ah. Well. Duh.
04:52:06  \f x-> reads \f->\x->... *Clearly* there's not much evaluation you can do of an unapplied lambda.
04:52:30  but is it technically non-strict?
04:53:00  > (\f x -> undefined) undefined `seq` "Sure"
04:53:00    "Sure"
04:53:14  ah okay
04:53:15  so
04:53:21  its function application
04:53:22  being non-strict
04:53:56  er...
04:53:58  > (\f x -> undefined) undefined
04:53:59    Overlapping instances for GHC.Show.Show (t -> a)
04:53:59     arising from a use of `...
04:54:01  Good times.
04:54:25  > (f x -> undefined) $! undefined
04:54:26    Pattern syntax in expression context: f x -> undefined
04:54:31  > (\f x -> undefined) $! undefined
04:54:31    Overlapping instances for GHC.Show.Show (t -> a)
04:54:32     arising from a use of `...
04:54:34  > (\x -> undefined) `seq` "Sure" -- actually it reduces to this conceptually
04:54:35    "Sure"
04:54:57  okay so then...
04:55:03  /functions/ are just non-strict. :P
04:55:12  yeah
04:55:22  how... obvious. :>
04:55:27  (\x -> undefined) should in theory be _|_, but due to seq isn't?
04:55:33  no
04:55:35  um no...
04:55:39  (\x -> undefined) is not _|_
04:55:44  > (\x -> undefined)
04:55:45    Overlapping instances for GHC.Show.Show (t -> a)
04:55:45     arising from a use of `...
04:55:47  see?
04:55:53  (\x -> undefined x) should be
04:55:57  but isn't
04:56:02  it's weak head normal form, in the original lambda calculus sense
04:56:22  oerjan: ahhhh
04:56:23  okay.
04:56:30  makes sense.
04:56:46  CakeProphet: Sure it is.
04:56:54  shachaf: sure what is what?
04:56:56  _|_
04:56:59  lol
04:57:00  no
04:57:00  >
04:57:01  ?
04:57:01  Seqism in this channel?
04:57:04  the thing is, without seq there would not be any way in haskell to get to evaluating a function without applying it
04:57:44  shachaf: why is the value (\x -> undefined) _|_?
04:57:56  er
04:57:59  shachaf: why is the value (\x -> undefined) ==  _|_?
04:58:04  It's not == _|_
04:58:09  No instance Eq (a -> b) blah blah
04:58:23  But it's indistinguishable from _|_ unless you have seq. Which you don't.
04:58:27 -!- MDude has changed nick to MSleep.
04:58:57  shachaf: I don't really understand how.
04:59:06  CakeProphet: nominally, you would want two functions that give exactly the same result when applied to any argument to also _be_ the same.  and (\x -> undefined) whatever = undefined whatever, always
04:59:13  CakeProphet: Well -- how do you force it, other than by applying it?
05:00:26  23:54 < oerjan> > (\x -> undefined) `seq` "Sure" -- actually it reduces to this  conceptually
05:00:38  okay, but then why is this not _|_ as well?
05:02:12  > (\x -> undefined)
05:02:13    Overlapping instances for GHC.Show.Show (t -> a)
05:02:13     arising from a use of `...
05:02:39  in my mind this is forcing (\x -> undefined)   (I'm just going to call it const undefined now)
05:03:02  CakeProphet: because if the undefined was a more complicated expression that could not be detected as always undefined, then there would be no way to show it without having an x to apply it to
05:03:55  say \x -> ...search for a counterexample to goldback's hypothesis...
05:04:04  *goldbach
05:04:49  so basically (\x -> undefined) is _|_ because halting problem? :P
05:04:52  now, _if_ that search never halts, you want that to be equivalent to \x -> undefined
05:05:19  *is _not_ _|_
05:05:30  oh.... wait what.
05:06:11  my argument here was that const undefined is in fact not _|_
05:06:12  there is no way to make a compiler that treats \x -> ...anything _actually_ undefined  as equivalent to undefined
05:06:27  Hmm
05:06:38  _given_ that functions can be evaluated without applying them
05:06:48  which is only possible because of seq
05:06:55  right
05:06:58  that makes sense.
05:07:20  I thought it was being argued that const undefined was virtually indistinguishable from bottom.
05:07:25  or whatever.
05:07:47  oh, unless you have seq
05:07:47  right
05:07:48  and then
05:07:54  I used seq and was confused, ha ha. ha ha ha
05:08:14 * Sgeo will be using pseq as semicolons
05:08:16  >:)
05:08:29  @hoogle pseq
05:08:29  GHC.Conc.Sync pseq :: a -> b -> b
05:08:29  GHC.Conc pseq :: a -> b -> b
05:08:29  Control.Parallel pseq :: a -> b -> b
05:09:11  CakeProphet, like seq, except forces its first argument to be evaluated first
05:09:20  Before evaluating the second
05:09:32  oh, I wasn't aware that was semantically different from seq. :P
05:09:42  it's not _semantically_ different
05:10:03  er, order of evaluationally different? :P
05:10:07  well, not denotationally
05:11:00  still haven't learned about semantics...
05:12:31  it's there because the denotational semantics does not _actually_ say anything about evaluation order, and ghc actually rearranges things that are denotationally equivalent when optimizing, so _sometimes_ seq ends up evaluating its arguments in the unexpected order
05:12:43  ah okay
05:12:59  also I still don't see how const undefined is virtually indistinguishable from bottom unless seq is involved.
05:13:20  well const undefined x = undefined  always, right?
05:13:32  which = undefined x
05:13:34  yeah
05:14:01  so if the _only_ way you can distinguish functions is by applying them to arguments, const undefined is indistinguishable from undefined
05:14:42  the issue with seq is that it allows you to distinguish undefined :: X -> Y from (\x -> undefined x) :: X -> Y
05:14:49  except that actually evaluating const undefined doesn't produce bottom, which I'm assuming is where seq comes into play.
05:15:01  yes
05:15:42  so basically fix f is the only way to determine bottomness
05:15:50  ??
05:16:02  > fix (const undefined)
05:16:03    *Exception: Prelude.undefined
05:16:08  > fix (const x) = x
05:16:09    : parse error on input `='
05:16:09  oh look const undefined is bottom
05:16:18  fix . const = id
05:16:31  You can't look at arbitrary values and ask "Is it bottom"
05:16:40  Unless you've solved the halting problem
05:16:50  or unless I evaluate it with fix :P
05:16:52  you can catch some kinds of bottoms, which is what I do in the spoon package
05:16:57  CakeProphet: fix isn't doing anything for you there
05:17:17  > id undefined
05:17:17    *Exception: Prelude.undefined
05:17:18  CakeProphet: fix determines strictness, not bottomness
05:17:20  oh look, it's undefined!
05:17:39  (+) 1  is a perfectly nonbottom function, but fix ((+) 1) is bottom
05:17:47  ah right.
05:17:56  oerjan: not necessarily
05:18:03  @let isBottom _ = False
05:18:04   Defined.
05:18:04  I think I was just getting strictness and bottom confused :P
05:18:05  for Integer blah
05:18:08  :)
05:18:12  shachaf, hehe
05:18:20  @hackage spoon
05:18:20  http://hackage.haskell.org/package/spoon
05:18:31  teaspoon :: a -> Maybe a
05:18:47  the power of bottom is yours
05:18:49  If that's teaspoon, I don't know if I want to know what tablespoon is.
05:18:50  CakeProphet: also it's not necessary to use fix, all you need is to apply it to undefined
05:18:59  spoon :: NFData a => a -> Maybe a
05:19:00  copumpkin: Does it catch any _|_ which throws an exception?
05:19:05  so a value being bottom /does not/ determine whether or not your program halts.
05:19:09  when its evaluated.
05:19:12  weakHeadNormalSpoon
05:19:14  shachaf: yeah, exceptions that were deemed to be useful
05:19:23  Useful?
05:19:40  shachaf: binary, for example, provides no way to recover from errors
05:19:49  a lot of libraries throw error when they shouldn't
05:19:52  oerjan: I thought bottom was all about termination.
05:19:55  spoon lets you make them behave nicely
05:19:55  Does it catch e.g. <>?
05:19:58  rather, lack thereof
05:20:00  shachaf: nah
05:20:03  Aw.
05:20:17  Some _|_ checker you have. Doesn't even catch <>.
05:20:27  <> really doesn't happen all that often
05:20:27  heh
05:20:32  <>?
05:20:41  Sgeo: an infinite loop in your program
05:20:43  Is that when BLACKHOLE is reached when evaluating BLACKHOLE?
05:20:49  yeah
05:20:53  :-(
05:20:54  on a non-threaded runtime
05:20:56  CakeProphet: it's about "normal" termination, so exceptions like undefined also count
05:21:04  Cool
05:21:06  I was typing up an elaborate explanation, but you just can't fool people these days.
05:21:08  oerjan: right, returning, so to speak.
05:21:19  oerjan: a value that is bottom does not produce a normal form.
05:21:21  shachaf, keep doing it, I'll bet it's funny
05:21:30 * shachaf is demotivated.
05:21:54  basically, if you can give it the type forall a. a, then it's definitely a bottom even if it doesn't loop
05:21:58  oerjan: and (\x -> undefined) does not produce a normal form, right?
05:22:09  CakeProphet: not when applied
05:22:21  oerjan: well.. right
05:22:27 * Sgeo is impatient for April 1st
05:22:36  Official release of my Haskell tutorial
05:22:45  (\x -> x x) (\x -> x x)
05:22:49  embrace the power of the loop!
05:22:52  oerjan: Not if it's unsafeCoerce something!
05:23:03  i love (\ x -> x x) (\ x -> x x)
05:23:04  @pl (\x -> x x) (\x -> x x)
05:23:08  ap id id (ap id id)
05:23:08  optimization suspended, use @pl-resume to continue.
05:23:16  shachaf: that's right, go ahead, kill lambdabot
05:23:18  thanks lambdabot
05:23:23  oerjan: (\x -> undefined) can be rewritten further, right?
05:23:27  monqy: Thambdabot?
05:23:38  CakeProphet: why are you focussing on const undefined so much?
05:23:44  thumbdabot
05:23:46  copumpkin: because it's the example that confuses me.
05:23:55  it doesn't have any special behavior at all
05:24:08  copumpkin: It's the only strict function that doesn't force its argument!
05:24:16  That's kind of special.
05:24:20  shachaf: well if you're using unsafe functions, obviously you've reached bottom already
05:24:30  oerjan: It's true. :-(
05:24:32  shachaf: I wouldn't call it strict
05:24:37 * shachaf injects some more _|_
05:24:46  copumpkin: No?
05:24:52  copumpkin: it's the general case of not having a normal form when applied, which is what is confusing me.
05:24:53  What definition do you use for "strict", then?
05:25:02  just because we test against undefined to talk about strictness, doesn't mean returning undefined makes something strict
05:25:16  copumpkin: I thought a strict function was a function f such that f _|_ = _|_
05:25:42  copumpkin: so it's actually application of undefined to a value that determines if it's bottom?
05:25:58  CakeProphet: it's whether it doesn't terminate when evaluated
05:26:08 -!- oerjan has quit (Quit: You sort out this mess yourself).
05:26:12  lol
05:26:15  Well, where it doesn't return.
05:26:17  I think I understand.
05:26:19  s/where/whether/
05:26:39  shachaf: it feels wrong to say that when something is const undefined, it's strict
05:26:54  copumpkin: I thought this was a classic example in #haskell.
05:26:59 * copumpkin shrugs
05:26:59  copumpkin: it's not.
05:27:20  I thought the point of talking about strictness was to evaluate what it did to its arguments
05:27:24  that clearly does nothing to its argument
05:27:29  so that definition seems unsatisfactory
05:28:03  I've said the same thing before.
05:28:09  But denotationally _|_ is _|_.
05:28:12  sure
05:28:12  but it is bottom, because it can't produce a normal form. const undefined becomes (\x -> undefined) which is not a normal form.
05:28:17  And "strict" is defined denotationally.
05:28:35  CakeProphet: how is it not?
05:29:14  shachaf: I had this discussion a year or so ago with people regarding spoon and why the denotation view of strictness is bullshit because we can actually distinguish things operationally, and people should stop masturbating to denotation
05:29:26  :P
05:29:33  copumpkin: Don't let conal hear you say that!
05:29:37  lol
05:29:39 * shachaf is in vague agreement.
05:29:45  copumpkin: hmmm, well is undefined x considered a valid reduction of (\x -> undefined)?
05:29:51  no
05:29:53  there is no application
05:29:56  well, there you go.
05:29:57  On the other hand this is such a corner case that it doesn't really matter.
05:29:57  >_>
05:30:00  no, it's normal form
05:30:06  the same way (\x -> 5) is
05:30:15  you can't beta reduce a lambda without an application
05:30:37  ah wait
05:30:38  yes it is :P
05:30:45  there's no term
05:30:46  the issue is the one I keep talking about
05:30:48  (\x -> undefined x)
05:30:48  that it reduced to.
05:30:55  *reduces
05:30:56  that's an eta expanded form of undefined
05:31:02  which should be indistinguishable from undefined
05:31:10  but is not
05:31:22  copumpkin: right right I see nevermind
05:31:22  It is if you're not seqist.
05:31:32 * copumpkin lives in agdaland
05:31:33  fuck seq
05:31:41  seq has no power over me!
05:31:45  yeah evaluation who needs it!
05:31:45  for I have no bottom
05:31:52  oh I evaluate plenty
05:31:55  just never to bottom
05:32:31  When copumpkin evaluates an infinite loop, it's never _|_.
05:32:36  copumpkinfacts
05:32:44  :D
05:32:46  copumpkin: is _|_ a normal form?
05:33:05  oh wait I see
05:33:13  it is entirely meaningless to refer to a value being _|_
05:33:18  because bottom inherently does not have any values.
05:33:26  uh no
05:33:34  hmm, I think we're confusing different uses of _|_ here
05:33:46  bottom is the value of all types
05:33:51  nope
05:33:57  yes
05:34:06  it has no meaning as a value
05:34:14  I was under the impression _|_ is the empty type
05:34:19  but types contain values and it's a member of all types
05:34:19  it is, in a different usage
05:34:24  hmmm okay.
05:34:29  in Haskell.
05:34:30  that interpretation works too, but isn't as clean
05:34:34  _|_ is the bottom element in the ordering of definedness
05:34:38  in unrelated uses, it also means false
05:34:43  and the empty set, by C-H
05:34:50  damn overloaded symbols
05:34:58  copumpkin: _|_ is false in relation to decision problems right?
05:35:13  in agda, it's just used as a general falsity
05:35:18  it is an empty set
05:35:27  you might also call an initial object in a category _|_
05:35:38  which does tie it back with the bottom element in the ordering of definedness
05:35:51  but they're different sorts of categories
05:36:23  And the terminal object ‾|‾?
05:37:28  ⊤⊥
05:37:39  to me "a function that cannot return a value has the return type of bottom" is similar to saying "there is no term that this term can reduce to" but I'm pretty sure they're separate and completely unrelated.
05:38:12  in one usage, _|_ is a _value_ or something that resembles a value, and it inhabits all types
05:38:20  copumpkin: I was already doing a Unicode search anyway. But for the sake of tradition I decided to stick with the three-character version.
05:38:25  copumpkin: the Haskell usage right?
05:38:25  to talk about the semantics of the language, an ordering of values is introduced
05:38:32  and _|_ is considered to be less than all other values
05:38:33  yeah
05:38:44  then people talk about haskell maintaining monotonicity
05:38:49  What would ‾|‾ mean in Haskell?
05:38:58  in that functions only ever decrease in definedness
05:39:03  strict ones, anyway
05:39:47  shachaf: clearly the most defined value :P
05:41:07  shachaf: okay so.... are terms of type _|_ all normal forms?
05:41:09  er
05:41:15  s/shachaf: //
05:41:28  assuming that all terms have an associated type.
05:43:24  I think what is meant by "_|_ inhabits all types" is that _|_ is a subtype of all types, similar to how the empty set is a subset of all sets.
05:43:33  however, _|_ contains no values.
05:43:48  _|_ isn't a type.
05:43:54  It's a value.
05:44:01  >_>
05:44:03  Bool is inhabited by three values: True, False, and _|_
05:44:17  Therefore you can say True :: Bool, False :: Bool, undefined :: Bool
05:44:22  Or x :: Bool; x = x, or whatever.
05:44:25  this is because haskell is non-strict, so all values might be arbitrarily complex calculations that do not terminate
05:44:46  ah okay.
05:45:13  so in Haskell, thunks count as values, even though they may return nothing.
05:46:01  shachaf: but no, _|_ really is a type.
05:46:04  I promise.
05:46:15  it is a type if you overload the symbol to also mean a type
05:46:23  in this context, it's meaningless to call it a type
05:46:27  I'm talking about in type theory
05:46:30  It is a crocodile if you overload the symbol to also mean a crocodile.
05:46:31  bottom is the empty type.
05:47:12 -!- Vorpal has quit (Quit: ZNC - http://znc.sourceforge.net).
05:47:15  we typically don't call it bottom in that context
05:47:17  it's just that in Haskell values can include things that are not in a normal form.
05:47:29  they're unrelated in this context
05:47:49 * shachaf thinks of non-strictness as much more reasonable than strictness.
05:47:59  I wonder if that's the default way of thinking of things or if all the Haskell got to me.
05:48:22  shachaf: depends on the context.
05:48:53  for most of the history of programming, non-strict as reasonable is certainly not the default way of thinking about things.
05:49:00  in math, sure.
05:50:34  I mean in the context of functions.
05:51:35  so basically I think the value _|_ that's referred to in Haskell is completely different from the mathematical meaning of _|_ as a type. it becomes useful to think about _|_ as a value precisely because non-strictness allows you to manipulate values that do not actually return any result.
05:52:14  CakeProphet: I just like my eta-equivalence, man.
05:52:17  Which is why I hate seq.
05:54:11  CakeProphet: that's because, as I keep saying, it isn't being used as a type there
05:54:18  copumpkin: right.
05:54:20  if you want the mathematical backing to its usage there, look in order theory
05:54:34  the category usually used to model haskell's behavior is CPO\bot
05:58:25  :t (\x -> undefined)
05:58:26  forall t a. t -> a
05:59:15  :t (undefined, undefined)
05:59:16  forall a a1. (a, a1)
05:59:21  heh.
05:59:39  CakeProphet is easily amused.
05:59:49  my brain hurts.
05:59:49  :P
06:00:18  undefined doesn't have the same type as undefined.
06:00:29  it can.
06:00:33  but doesn't have to.
06:01:45  it's universally quantified
06:01:47  :t (5, 5)
06:01:48  forall t t1. (Num t, Num t1) => (t, t1)
06:01:58  right.
06:02:37  forall a b. (a,b) = (forall a. a, forall b. b)
06:03:35  I think it's fair  to say that the value _|_ has the type _|_
06:03:47  forall a b. (a -> b -> r) -> r = ((forall a. a) -> (forall b. b) -> r) -> r
06:03:54  = (forall a b. a -> b -> r) -> r ?
06:04:02  No.
06:04:33  Or, hmm.
06:04:39  What would that correspond to in non-CPS?
06:05:21  @djinn forall a b. (a -> b -> r) -> r
06:05:22  -- f cannot be realized.
06:05:25  dunno.
06:05:26  :P
06:06:30  CakeProphet: AAAH
06:06:35  copumpkin: what?
06:06:41  haskell does not have a _|_ type
06:06:45  copumpkin: sure it does.
06:06:49  it's just not written anywhere.
06:06:53  no it doesn't
06:06:55  all types are inhabited
06:07:08  so is _|_, in this case, weirdly. :P
06:07:11  _|_ : forall a. a
06:07:16  yes.
06:07:25  _|_ is not inhabited, and it's a type error to say that it is
06:07:27  I mean, the two are obviously not equivalent.
06:07:39  because it is not a type, and values are not inhabited
06:07:41  inhabited?
06:07:47  a set that contains elements
06:07:50  Does data Foo count as inhabited?
06:07:55  yes
06:08:05  Sgeo: it contains _|_!!! :P
06:08:12  newtype Z = Z Z
06:08:27  that contains as many inhabitants as data Foo does
06:08:36  I thought newtype was strict?
06:08:36  An infinite number!
06:08:51  Sgeo: A newtype's constructor is strict, yes.
06:09:01  But you can't ever construct that newtype.
06:09:10  fix Z
06:09:20  or undefined
06:09:23  they give the same answer
06:09:30  Oh, so for newtype Newtype = Newtype MyType
06:09:31  copumpkin: Denotationalist!
06:09:42  shachaf: ismist!
06:09:43  You don't get both Newtype _|_ and _|_, just _|_?
06:09:47  Not so high-and-mightily operational now, are we?
06:10:06  we can't distinguish undefined and fix Z
06:10:14  Sgeo: NewType _|_ is _|_
06:10:18  spoon
06:10:32  fair enough
06:10:34  :)
06:10:41  CakeProphet, indeed, unlike if data was used instead of newtype, where NewType _|_ would be distinct from _|_
06:10:54  nope.
06:11:01  CakeProphet: Nope?
06:11:11  In data Z = Z Z, Z undefined =/= undefined
06:11:16  I thought strictness was irrelevant to _|_
06:11:21  not at all
06:11:25  What?
06:11:48  I don't know I think I've fatigued my brain muscles trying to wrap my head around this.
06:12:05  Are you talking about _|_ the type or _|_ the crocodile?
06:12:12  the crocodile.
06:12:16  Oh.
06:12:17  krokodil
06:12:23  Yes, the crocodile doesn't care about strictness.
06:12:49  I'm back in Haskell land where the empty type is not a type.
06:13:01  CakeProphet, empty type doesn't exist
06:13:11  There's (), which contains () and _|_
06:13:12  if you say so.
06:13:22  () is the anti-_|_
06:13:28  TOP!
06:13:39  http://www.youtube.com/watch?v=QWgaToemGkY
06:14:09  Sgeo: saying that the empty type does not exist is kind of like saying the empty set does not exist.
06:14:11  Hmm, kind of noisy.
06:14:17  CakeProphet: No. We're talking about Haskell.
06:14:21  shachaf: right
06:14:32  Haskell is not pure math.
06:14:33  01:12 < CakeProphet> I'm back in Haskell land where the empty type is not a  type.
06:15:06  it is not in Haskell, it is elsewhere.
06:15:13  Sgeo said "the empty type does not exist"
06:15:20  therefore, only Haskell exists? :P
06:15:43  languages that have the _|_ type typically don't have the _|_ value :)
06:15:46  and vice versa
06:16:08  works for me.
06:16:10  however, from another perspective
06:16:17  the _|_ type itself is a value in those languages
06:16:27  but with a completely different denotation as the _|_ value from haskell
06:16:52  in Agda, _|_ : Set
06:17:16  Surely Agda calls it ⊥?
06:17:33  perhaps I need to understand the denotational semantics of Haskell to understand this bottom business.
06:17:48 * Sgeo knows nothing about denotational semantics
06:18:14  but from the perspective of type theory, it sounds incredibly silly to say that Haskell has no bottom type.
06:18:28 * Sgeo knows nothing about type theory
06:20:27  but yes, I was wrong to say that the _|_ value has the _|_ type, that's equally silly.
06:21:05  well, in a different type theory it might make sense
06:21:12  a subtyping theory with singleton types
06:21:40  only total languages can have empty types
06:23:30  what's the best type theory to use when talking about Haskell?
06:24:22  well, people usually model it in system Fomega
06:24:36  but that doesn't really capture the bottom-ness
06:24:45  people usually gloss over that on the type theory level
06:24:51 -!- zzo38 has joined.
06:24:53  and then try to capture it in semantics
06:25:08  by saying something like Hask = CPO\bot
06:27:07  copumpkin: so Haskell is strongly normalizing?
06:27:13  nope
06:27:21  ah okay.
06:27:51  Today, I played Dungeons & Dragons game. I managed to break into a debtor's prison, find out who one of them was in debt to and by how much, got arrested, guards trying to take me to the other prison, some wizards tried to restrict me but I stunned them, the guard try to attack me but I stunned them too, dragged them to the federal prison, told them to stand up (but they couldn't), got into a holding cell.
06:28:03  copumpkin: ah but Haskell's type system is.
06:28:04  ?
06:28:11  (This is a deliberate parts of my plan)
06:28:13 -!- pikhq_ has joined.
06:28:32 -!- pikhq has quit (Ping timeout: 276 seconds).
06:29:21  CakeProphet: sort of, in theory
06:29:40  there are some weirdnesses in the implementations regarding type aliases and so on
06:29:48  which they try hard _not_ to normalize
06:31:01 -!- Jafet has joined.
06:32:29  copumpkin: that's... weird.
06:32:50  if you wrote type String = [Char]
06:32:54  you presumably like the name String
06:33:03  oh for error reporting right?
06:33:08  so you want to see String in type errors where possible
06:33:31 -!- DCliche has quit (Quit: You are now graced with my absence.).
06:33:41  copumpkin: but it doesn't really change anything to do that.
06:34:07  yeah, all types could have a normal form if we wanted them to
06:34:53  you'd just get a lot more RealWorld and #'s :P
06:36:07  hmm, not even that
06:36:12  IO is still a newtype
06:36:23  so you typically wouldn't want to see through those
06:36:31  at least, you wouldn't need to
06:40:15  it occurs to me
06:40:39  why are boolean values not expressed in Haskell as they are in the LC
06:41:08  you mean as functions?
06:41:09  how often do you need Eq and Ord for Bool? I suppose Read and Show are valuable.
06:41:13  copumpkin: yes
06:41:27  because we have ADTs and they're convenient
06:41:40   /= on Bool is xor
06:41:59  == is biconditional implication :P
06:42:19  (a == b) c d is pretty convenient too though.
06:42:39  that's what if is for
06:42:44  you could say the same about numbers
06:42:48  5 (+1) 0
06:42:52  that should be 5!
06:43:01  > 5 (+1) 0
06:43:02    5
06:43:05  copumpkin: oh look it is!
06:43:07  :P
06:43:08  we like to write explicit eliminators
06:43:09  lol
06:43:12  okay fine
06:43:14  > 5 (+2) 0
06:43:15    5
06:43:16  should be 10
06:43:39 * Sgeo would expect shachaf to set that sort of trap
06:43:51  not quite as convenient as Bool being church booleans I think.
06:44:05  copumpkin: You could say the same about floating point numbers.
06:44:11  Oh, I see what copumpkin wants
06:44:12  But *please* don't. Please.
06:44:18  what do I want?
06:44:22  I already have what I want
06:44:24  but, having instances for bool is probably more practically useful, especially considering that if statements aren't really troublesome enough to need replacing by regular function application
06:44:27  explicit eliminators in the form of pattern matching
06:44:28  coppro, 5 (+2) 0 to be 10
06:44:31  I see what that means
06:44:38  oh :)
06:45:17  Should totally write a Num instance for (a -> a) that makes fromInteger do that
06:45:42  good luck with that.
06:45:44  Sgeo: Make sure you make negative numbers work.
06:45:51  I thought of that thing too. But the type of Church numbers is   (a -> a) -> (a -> a)    I think.
06:46:15  yep
06:46:31  Write a Num instance for (a -> a) -> (a -> a)
06:47:59  What would you expect negative numbers to do here? It would only work if there was a type that can only hold bijective functions (something I have asked for in the past).
06:48:28  (a -> a) -> (a -> a) -> a
06:48:33  _|_, clearly
06:48:36  one approach to the negatives
06:48:51  I forgot an a
06:49:09  (a -> a) -> (a -> a) -> (a -> a)
06:49:14  bettar
06:50:17  Sgeo: Yes it could be, if you do    fromInteger x | x < 0 = error "Negative church numbers is not allowed"   but that doesn't really count as "make negative numbers work", I think.
06:51:10  with my scheme
06:51:20  n pred succ 0 = id
06:52:01  pred :-(
06:52:13  Oh, wait.
06:53:18  I may be oversimplifying it though
06:57:42  Yes I realized /= on Bool is xor and have used that in some programs.
06:58:04  <= is implication
06:58:23  I used it to make a monoid for Equivalence from the contravariant functors package.
06:58:33  shachaf: O, yes, you are correct. I have not realized that, before.
06:58:34  > False <= True
06:58:35    True
06:58:40  > True <= Falsee
06:58:41    Not in scope: data constructor `Falsee'
06:58:43  > True <= False
06:58:44    False
06:58:44  ha.
06:58:55 * CakeProphet easily amused
06:58:57  Well, fine, it *would* be implication if data Bool = True | False deriving Ord
06:59:28  > join (liftA2 (<=)) [False, True]
06:59:28    [True,True,False,True]
06:59:42  You can use other comparison operators, too.
07:00:40  > join (liftA2 (>=)) [False, True]
07:00:40  hum
07:00:41    [True,False,True,True]
07:01:05  it even looks like implication
07:01:15  copumpkin: how is it not implication?
07:01:28  copumpkin: It *would*, if only True < False!
07:01:51  Then just reverse the comparison operator.
07:01:56  join (liftA2 (<)) [False, True]
07:01:57  > join (liftA2 (<)) [False, True]
07:01:58    [False,True,False,False]
07:02:05  > join (liftA2 (>)) [False, True]
07:02:06    [False,False,True,False]
07:02:49  > not (True > True)
07:02:50    True
07:02:56  > not (True > False)
07:02:57    False
07:03:04  > not (False > True)
07:03:05    True
07:03:07  > not (False > False)
07:03:08    True
07:03:52  how is that not implication again? :P
07:04:02  Well, it is.
07:04:14  zzo38: But I like the arrow shape.
07:04:44  shachaf: Well, *too bad*
07:04:57  > let (->) = id in id -> 2
07:04:58    : parse error on input `->'
07:05:00  :(
07:05:27  CakeProphet isn't satisfied with (->) working for types and kinds.
07:05:33  It has to be a value-level operator too.
07:05:39  yes!
07:06:10  And what would it apply to? (-3)-types?
07:06:19  > let (-->) = id in id --> 2
07:06:19    2
07:06:39  copumpkin: I ended up not fully making sense of dolio's slides.
07:06:43  > let (-->) = =< in True --> False
07:06:44    : parse error on input `=<'
07:06:48  > let (-->) = (=)< in True --> False
07:06:49  shachaf: oh?
07:06:49    : parse error on input `='
07:06:49  bah
07:06:54  > let (-->) = (=<) in True --> False
07:06:55    Not in scope: `=<'
07:06:56 * CakeProphet tired
07:07:04  I wrote some classes that you can list all values of some types, including Bool and () and Zero (a uninhabited type) and sum and product types of those types, and functions of those types (function type could be, exponent type). Now it can also make Enum, Bounded, Eq, of those specific function types.
07:07:13  > let (-->) = (<=) in True --> False
07:07:14    False
07:07:19  copumpkin: Mainly lacking background, I think. It also made more sense when dolio was talking. :-)
07:07:20  zzo38: I have a package on hackage that does that too
07:07:28  shachaf: I can explain stuff if you want
07:07:35  @hackage enumerable
07:07:35  http://hackage.haskell.org/package/enumerable
07:08:11  > let (-->) = (<=); id = (-->) True in map id [False, True]
07:08:12    [False,True]
07:09:18  One reason I wanted types holding only bijective functions is to use it to represent equality of numbers in the type level. The other reason is to do some experimenting with reversible programming.
07:09:29  copumpkin: It's probably a matter of going over it in detail. Probably everything I want is talked about in one of the many papers on my to-read list. :-)
07:09:38  fair enough :)
07:09:39 * shachaf 's to-read list is an enumeration of every possible paper.
07:09:41  O, the other type I made to list all value, is Maybe type. It can be used as a successor for numbers in type level
07:09:54  zzo38: reversible programming would be very cool.
07:11:09  and probably very very space leaky
07:11:13  I also made a Classical class for a few types to make classical logic in types (like Curry-Howard, but classical logic instead of only intuitionistic; since they are restricted to instances of the class, te law of excluded middle could be proven individually for each type)
07:11:39  as it pretty much implies that data is never destroyed.
07:12:05  CakeProphet: it doesn't necessarily. It just means you need to know how to go backwards
07:12:09  I think it doesn't need to be space leaky all the time, since you could have a result which you go backward
07:12:15  I'm still not sure how a _type_ of invertible functions would get checked, though
07:12:30  without you providing an explicit proof that you're bijective
07:13:44  copumpkin: Well, my idea is to restrict what kind of things you can use in its definition, and ensure all outputs are defined for any defined input, and then have an implicit cast from bijective functions to normal functions so that they can be used as normal functions.
07:14:02  so I mean
07:14:09  f 0 = 0
07:14:11  f (suc n) = n
07:14:12  copumpkin: that either involves computing with a function a -> a that is bijective or a -> SomeTypeWithAStoredSomewhere. Basically memory can be deleted if it's no longer by the values that used it to be computed.
07:14:27  s/by/used by/
07:14:37  my function is not bijective
07:14:53  how would you disallow it if I tried to give it the type of a bijective function Nat -> Nat?
07:15:21  However, there should also be some way to use it to prove that 1 is unequal to 2, so that you can prove the type    Not (Maybe Zero <-> Maybe (Maybe Zero))     where    data Zero; type Not t = t -> Zero;
07:15:35  you should come to #agda :)
07:16:06  although no language I know allows you to prove things like that _and_ allows subtyping
07:16:21  which seems to be what you want for bijective functions
07:17:07  copumpkin: It would require things checked at compile time, one thing is that case would be used, and restrictions on ensuring everything in unique; there are way to do that, that I have thought of. Although I might still have made some mistake
07:17:51  zzo38: I'm not sure it's decidable in general, though. You could probably come up with some good heuristics but you typically want a type system to have an easy mental model
07:18:12  in agda you could just prove that your function is bijective
07:18:27  and it still feels like haskell :)
07:18:45  anyway, I need to sleep :(
07:18:52  (One requirement would be that unbounded types could be passed only unchanged, and *must* be passed exactly once to the output if the input contains it.)
07:19:06  ah, that's substructural typing
07:19:19  something that most of these languages don't support
07:19:41  it's the secret sauce that we need to make DList ~= List
07:22:41  In addition, bijective functions would be able to use other bijective functions, but not functions that aren't bijective. Constructors and field names in a newtype are automatically considered bijective.
07:23:02  And there also ought to be something usable with bijective functions that allows you to access its reverse.
07:24:08  zzo38: perhaps if you could make bijectiveness implicit in the semantics of the language.
07:24:18  then it's always guaranteed.
07:25:33  but that would extremely memory expensive.
07:26:09  basically all data types would have an implicit slot for "everything that was used in creating me"
07:26:34  CakeProphet: Yes, that is kind of what I was trying to explain to make. However, it would be working only at compile-time, and only for functions marked as bijective would have such requirements; however, you could implicitly cast bijective function type to normal function type if you do not need that.
07:26:45  CakeProphet: The ways I was thinking of, no data types would need such a slot.
07:27:25  Because it would be implicit in the syntax used for making bijective functions, and the compile-time semantics, but not run-time semantics.
07:32:01  In addition, "everything that was used in creating me" is not really what a mathematical bijective function does anyways!
07:33:50  zzo38: right but that's what you would need if you want every value to be reversible without knowledge of a reversing function.
07:37:13  I am not trying to make every value reversible, however. So the type   (Zero <-> Maybe Zero)  (where Zero means uninhabited type and <-> means bijective function) is uninhabited.
07:38:09  ah, yes.
07:39:16  Knowledge of a reversing function would not even be needed at runtime either; because the function to access its inverse would be processed at compile-time to get its reverse, and if it is applied to a variable then the program is adjusted at compile-time to pass both the function and its inverse to the function taking that variable as an argument.
07:40:08  right, the question is: can you make any guarantees that  the inverse function is a true inverse.
07:40:59  The type (x <-> x) for a specific x represented as a number can mean the factorial of x when it is used as a number.
07:41:45  CakeProphet: With the ideas I was thinking of, the compiler would automatically be able to calculate the inverse if you followed specific rules, where you must follow those rules for the compiler to accept it as a bijective function too.
07:44:17  Such as, you would have to build it up from a case block without duplicates, without inexhaustive patterns, only other bijective functions can be called, no pattern guards, no undefined/error, and it easily check all outputs are also unique.
07:46:23  hmmm actually I just got an idea for a very simple graph-based programming language that's reversible.
07:46:37  but also inherently a memory leak. :P
07:47:09  well, no. you could manually manage memory if you had a way to delete graph nodes.
07:48:29  if a predecessor node (a node that was computed one step previously in the program's execution) does not point to any present nodes, then it can be considered inaccesible; repeat recursively back to the beginning of the program.
07:49:48  Another requirement would be that all variables occur exactly once in the output.
07:50:53  valid operations would include: reverse a node to the node that produced it
07:51:09  if you didn't actually free any memory ever, another valid operation would be: reverse a single execution step.
07:52:50 * CakeProphet will have to examine this further on a later date.
07:52:53  good night.
07:53:48  I think bijective functions form a group.
07:54:16  In addition, the reversible esolangs Burro and Revaver2pi also have their programs form a group.
08:09:09 -!- copumpkin has quit (Ping timeout: 244 seconds).
08:09:27  Would it make sense to represent a GoL grid in Haskell with an infinite 3d data structure?
08:09:34 -!- copumpkin has joined.
08:41:57  I have a game with this text: "In former times,  friends Skipp, Apple, and the Wedge were camped. Opposing to expectation, as for them they were kidnapped by the foreigners which is supposed to because it exists. They were placed on the underground mission of spacecraft of enormous foreign country.... Before marshmellows burns, it escapes from the body of the captivity and it must help those in order to return to their planet!"
08:48:11 -!- GreaseMonkey has quit (Quit: The Other Game).
09:03:57 -!- pagnol has joined.
09:04:42 -!- pagnol has quit (Client Quit).
09:04:54 -!- pagnol has joined.
09:05:58 -!- Phantom_Hoover has joined.
09:11:59  ??
09:12:00  http://ib.skaia.net/post/view/25830 Phantom_Hoover clicky (assuming you're caught up with HS)
09:12:01  Sgeo...........
09:12:01 * Sgeo is easily amused
09:41:15 -!- ais523 has joined.
09:55:04  Bijective function types might also allow some optimizations to be performed that otherwise doesn't be performed.
10:01:40  bijections?!?!?!?
10:01:43  oh
10:01:45  meh
10:01:55 -!- oklobot has changed nick to oklopol.
10:03:17  in modern bijections, it's okay for some values on the domain to map back on the domain.
10:04:30  values of the codomain mapping back on the codomain in the inverse of the function of course has been considered damn hot through the ages.
10:06:19  maybe i made it too obvious with the second sentence.
10:06:34  What I mean specifically is that all defined input has a valid output, all values of both the input and output types are taken into account, and that there is a different output for each input.
10:07:50  i know what a bijection is
10:08:22  and by i i mean everyone here who's not a stupid
10:08:51 * Sgeo doesn't remember the difference between injection and surjection, which is which, but bijection's easy
10:09:04  I know you know, but I wanted to be more specific anyways.
10:11:40  who doesn't
10:13:08  a bijection from X to Y is a function from X to Y which is an injection and a surjection. an injection is a function such that x != y, both in Y, implies f(x) != f(y) and a surjection is such that for all y in Y there exists x in X such that f(x) = y
10:13:38  a bijection from X to Y is a function from X to Y which is an injection and a surjection. an injection is a function such that x != y, both in X, implies f(x) != f(y) and a surjection is such that for all y in Y there exists x in X such that f(x) = y
10:13:41  better
10:14:37  Yes that is better than my description
10:15:49  I have many ideas for use of bijective function type; one is to experiment with reversible programming, one is to determine inverses automatically, one is to be able to represent equality of natural numbers in the type system similar to Curry-Howard (but this should also require that there is some way to prove that one is not equal to zero, and so on)
10:20:48  I wrote a program for classical logic. I called the uninhabited type Zero. For numbers, you would have, Zero for zero, Maybe for successor, product type for products, sum type for sums, function type for exponents. And then, you also have Zero, product, sum, for logical operation as well, and bijective function type for equality of numbers.
10:20:51  yeah that sorta stuff might be nice. i also think that's been tried, perhaps succesfully
10:21:09  then again who cares if it's been done
10:23:46 -!- monqy has quit (Quit: hello).
10:32:54 -!- hagb4rd has quit (Ping timeout: 240 seconds).
10:39:27 -!- zzo38 has quit (Remote host closed the connection).
10:45:21 -!- Patashu has quit (Quit: MSN: Patashu@hotmail.com , Gmail: Patashu0@gmail.com , AIM: Patashu0 , YIM: patashu2 , Skype: patashu0 .).
10:45:44  Sgeo, they're both the same, just going opposite ways.
10:55:50 -!- Phantom_Hoover has quit (Quit: Leaving).
12:28:29 -!- Vorpal has joined.
13:01:27 -!- pagnol has quit.
13:36:34  huh, google changed favicon again?
13:59:38 -!- CakeProphet has quit (Ping timeout: 276 seconds).
13:59:44 -!- ais523_ has joined.
14:00:56 -!- derrik has joined.
14:11:58 -!- Guest14567 has joined.
14:12:05 -!- Slereah_ has quit (Ping timeout: 260 seconds).
14:28:56 -!- derdon has joined.
14:32:18 -!- MSleep has changed nick to MDude.
14:34:03 -!- ais523 has quit (Ping timeout: 240 seconds).
15:03:55 -!- copumpkin has quit (Quit: Computer has gone to sleep.).
15:16:45 -!- MSleep has joined.
15:17:19 -!- MDude has quit (Ping timeout: 240 seconds).
15:28:36 -!- copumpkin has joined.
15:30:08 -!- MSleep has changed nick to MDude.
15:34:27 -!- ais523_ has quit (Quit: Page closed).
15:43:34 -!- andrew12 has quit (Ping timeout: 260 seconds).
15:49:23 -!- Phantom_Hoover has joined.
15:52:27  @tell elliott Brumhandle acquired; inbox filled with angry PMs.
15:52:28  Consider it noted.
15:54:10 -!- augur has quit (Ping timeout: 258 seconds).
15:55:38 -!- andrew12 has joined.
16:00:37 -!- CakeProphet has joined.
16:00:49 -!- CakeProphet has quit (Changing host).
16:00:49 -!- CakeProphet has joined.
16:01:07  :)
16:03:31 -!- ais523 has joined.
16:05:11 -!- CakeProp1et has joined.
16:10:49 -!- zzo38 has joined.
16:11:04  CakeProphet, fix your ident order dammit.
16:12:05 -!- Ngevd has joined.
16:31:59 -!- CakeProp1et has quit (Quit: leaving).
16:32:03  Phantom_Hoover: huh?
16:32:11  * CakeProphet (~eris@h65.19.18.98.dynamic.ip.windstream.net) has joined #esoteric
16:32:12  * CakeProphet has quit (Changing host)
16:32:12  * CakeProphet (~eris@wikipedia/The-Prophet-Wizard-of-the-Crayon-Cake) has joined #esoteric
16:32:37  You have a cloak, but you're identifying after you join the channel, thus spamming and defeating the point of having the cloak.
16:33:03  IIRC you can fix it in XChat by setting the server password, rather than the NickServ password.
16:33:13  what about irssi? :)
16:34:13  access flags
16:34:15  aptitude remove irssi, aptitude install xchat
16:34:21  noe
16:34:22  p
16:34:38  doesnt freenode have access control?
16:34:43  Actually even using the server password it does not always make NickServ result right away.
16:35:05  Could you program it to not autojoin until the NickServ response?
16:35:23  It's not a common problem IME.
16:35:26  it would be possible
16:36:53  Another solution is, could you make up a new channel that requires registration to join but redirects to this channel? Would the server even accept such a thing or would it ignore the registration mode in this case?
16:37:45  zzo38: the way redirects work, I think it'd redirect people who weren't identified because if you can't get into a channel, default is to redirect you
16:38:05  O, yes, now that I think of it, yes that is how it works.
16:38:20  You are correct; redirects only work if you are not identified.
16:39:13  Unless it is configured by the server operators for permanent redirect.
16:40:05  Anyways, making it work on the client is better way than reconfiguring the server to do that, isn't it? Just use a macro like I described above on the client.
16:42:09  guys I think I figured out the solution
16:42:13  not caring.
16:42:25  I like the commentary to today's Gunnerkrigg court
16:42:26  ahhhh yes, I can feel it working already.
16:42:40  No, because it doubles the volume of join/quit spam.
16:43:12 -!- andrew12 has quit (Ping timeout: 245 seconds).
16:43:14  *doubles /my/ volume of join/quit spam
16:43:39  that's like one join/quit pair per ever 3 days on average or something. egads!
16:43:44  *every
16:43:48  Yes, and your name is not one unassociated with join/quit spam.
16:44:07  Phantom_Hoover: Tell your client to ignore the quit message "Changing host" if you want to suppress it from your display
16:44:42 -!- andrew12 has joined.
16:44:57  Phantom_Hoover: so wait, the solution is to /not/ identify?
16:45:01  I don't really understand what's going on.
16:45:24  The solution is to identify between connecting to the server and joining channels.
16:45:40  If you connect, join and identify you rehost.
16:45:41  OK; to tell you I don't care much about that either (I don't have a cloak anyways). Cloak can also be used to easily show your identity, without requiring WHOIS or NS INFO (in case you commonly connect with multiple computer)
16:46:06  Another way is to disable the cloak, in case you still want to identify and avoid this join/quit span messages
16:46:27  irssi doesn't seem to have any way to do.
16:46:46  To do what?
16:47:41  identify before joining channels.
16:48:06  unless I join every channel manual via -autosendcmd or something
16:48:09  *manually
16:48:48  Surely it must have macros, though. Isn't it?
16:49:09  oh well, sure.
16:49:31  actually no macro that I can find just command aliases
16:49:43 -!- andrew12 has quit (Ping timeout: 240 seconds).
16:49:59  so no parameters can be given, basically.
16:50:27  Then fix irssi to support macros
16:50:29 -!- andrew12 has joined.
16:51:15  Sgeo: ehpdelbreet
16:52:38  Sgeo: ha. ha. ha. Strider is different than Dave. tee hee. this is UNEXPECTED.
16:53:15  s/different than/different but similar to/
16:54:13  His autoreply seems similar to fungot
16:54:14  Ngevd: 250000? from factorial? :o) instances of tla running in parallel
16:54:54  Ngevd: whose?
16:55:06  Strider's
16:55:10  Oh, wait SPOILERS
16:55:21  SPOILY SPOILY SPOILERS
16:55:33  PastCakeProphet: SPOILERS
16:55:41  OH NOOOOO
16:56:07  Strider is like Rose if Rose were a cool bro.
16:56:10 -!- andrew12 has quit (Remote host closed the connection).
16:56:28 -!- elliott has joined.
16:57:44  elliott: SPOILERS NEAR END OF LOG
16:57:57  SPOILERS ABOUT STRIDER AND AUTO -- ER
16:57:58  NEVERMIND
16:58:01  :)
16:58:09  I check MSPA before reading the logs.
16:59:02  That is a good system
17:00:39  elliott: did you enjoy leading last nights conversation?
17:00:47  What?
17:01:06  the one
17:01:07  before this one
17:01:10  where I'm talking a lot
17:01:55  I haven't finished reading MSPA updates yet.
17:04:07  elliott: sheesh it's like you're human or something.
17:04:39  an undisciplined yob.
17:04:55  What do you expected them to be? The gods?
17:05:38  elliott should obviously be some kind of machine.
17:05:51  a robotic teenaged superhero.
17:05:52  A cola making machine
17:06:01  Cola is one of Hexham's main industries
17:06:04  Cola and chipboard
17:06:08  ...
17:06:09  wat
17:06:22  http://www.fentimans.com/
17:06:33  Their offices and laboratories are in Hexham
17:06:35  man, Atlanta has got the cola industry /on lock/
17:06:43  we've got Coca-Cola and shit.
17:06:50  WE HAVE FENTIMANS
17:06:58  OH MY GOD I NEVER REALIZED
17:07:04  except: what the fuck is that?  -clicks-
17:07:16  not as DELICIOUS
17:07:18  AS COCA-COLA
17:07:19  obviously
17:07:57  anyway I think instead of going to class today
17:08:01  I'm going to finish this huge paper
17:16:01  Does recording of D&D game interested you by now?
17:16:19  Fentimans Curiosity Cola is a lot stronger tasting than Coca-Cola or Pepsi
17:19:29 -!- monqy has joined.
17:19:34  monqy: hi
17:19:51  hi
17:19:59  heh, first hit for "linux" is the Ubuntu homepage
17:20:42 -!- andrew12 has joined.
17:20:50  Which doesn't mention the word "linux"
17:21:59  " Official site; Commercially sponsored Debian-derived Linux distribution that focuses on usability, a regular 6-month release cycle, and a ..."
17:22:02  um?
17:22:12  The page doesn;t
17:22:17  Neither does the page's source
17:22:25  The description must come from elsewhere
17:22:27  ah, indeed not.
17:22:45  Ngevd: Google is kind of magical
17:22:53  I'm kind of magical
17:23:02  I'm a latent reality warper
17:23:11  I warp reality every day.
17:23:23  This summer I wanted to know someone who had similar interests to me and lived near me
17:23:32  THEN SUDDENLY ELLIOTT APPEARED IN MY LIFE
17:23:39  best friends for life. <3
17:23:48  WROST EMENIES
17:23:52  <3<
17:24:14  hi
17:24:16  I like how everyone in the UK lives relatively close to each other.
17:24:34  Phantom_Hoover doesn't
17:24:57  whereas the most populous state in the US is around 2000 miles away from me.
17:24:58  I live pretty near Hexham, actually.
17:25:18  hexham party
17:25:34  We should all have a meetu- NO.
17:25:39  I hate you all.
17:25:41  All 2 of you.
17:25:48  I'd have to change trains in Newcastle, Carlisle, or Glasgow to get to Phantom Hoover
17:25:49  (That includes himself)
17:26:00  Or maybe Middlesborough
17:26:27  Ngevd: do all of those places have Haskell compilers named after them?
17:26:38  No
17:26:41  :(
17:26:45  Just Glasgow and MIddlesborough
17:27:04  elliott: time to get started on the Hexham Haskell Compiler
17:27:09  middlesborough haskell compiler
17:27:10 -!- andrew12 has quit (Ping timeout: 244 seconds).
17:27:14  Doesn't ais523 live in the North too?
17:27:19  Phantom_Hoover: birmingham
17:27:31  Birmingham is East Midlands, I believe
17:27:33  I assume you're talking about birmingham, Alabama right? :P
17:27:38  Is that in the North I don't know?
17:27:39  WHICH IS TOO FAR SOUTH TO BE NORTH
17:27:48  birmingham is in the black hole known only as birmingham
17:28:06  22:15:58:  shachaf: I got the last exploit by @telling lambdabot to say fungot
17:28:07  elliott: ( will be, fnord fnord ( that's zero zero) least significant bits of pointers for each node, and find all the prime numbers up to 32-bit, constants can be at least 64 characters long, and a
17:28:24  > "fungot"
17:28:25  elliott: your keyboard is absent? fnord juhovh minä olisin ainakin fnord fnord fizzien fnord
17:28:25    "fungot"
17:28:26  CakeProphet: would also have worked.
17:28:40  elliott: NOPE NOT THE SAME
17:28:50  22:16:20:  ​?where fungot
17:28:50  22:16:29:  lambdabot?
17:28:50  22:16:36:  Oh, come on, lambdabot!
17:28:50  22:16:42:  > "I don't listen to people with 'bot' in their name, IIRC"
17:28:50  22:16:43:  "I don't listen to people with 'bot' in their name, IIRC"
17:28:50  elliott: " fill your days with despair in 12 easy steps!" level yet??
17:28:56  @tell is like a delayed surpirse of botsploitation
17:28:57  Consider it noted.
17:28:58  Nobody's ever said that to ais523 so I guess he's just making it up.
17:29:07  shachaf: HackEgo uses control characters to subvert botloops it'd otherwise cause.
17:29:28  Also, ais523: "HackEgo" does not contain "bot" :P
17:29:28 -!- CakeProphet has changed nick to is.
17:29:32  lambdabot: hi
17:29:40  lol
17:29:52  @messages
17:29:53  dylukes asked 19d 18h 5m 26s ago: haskell awesome?
17:29:53  CakeProphet said 56s ago: like a delayed surpirse of botsploitation
17:30:21  `echo ?why am I SO CLEVER?!
17:30:25  @tell dylukes yes it is
17:30:26  Consider it noted.
17:30:28  ​?why am I SO CLEVER?!
17:30:31 -!- is has changed nick to CakeProphet.
17:30:47  Also, they're not control characters, they're Unicode.
17:31:04  22:20:14: -!- ChanServ changed the modes of #esoteric: +o ais523
17:31:04  22:20:22:  just in case I need to +m the channel for a few seconds to break botloops
17:31:13  ais523: op abuse, the traditional botloop breaker is an annoyed bot admin
17:31:30  Or, HackEgo being BRILLIANTE
17:31:40  Gregor:
17:31:44  !echo lambdabot: @so hi
17:31:46  lambdabot: @so hi
17:31:47  hi not available
17:31:53  hi
17:31:53  `echo lambdabot: @so hi
17:31:55  lambdabot: @so hi
17:31:55  elliott: That is such a loop, what with it not looping.
17:31:56  hi not available
17:32:05  Gregor: You want me to complete it?
17:32:15  elliott: ... maybe? :P
17:32:15  No
17:32:20  `echo lambdabot: @so `echo test
17:32:21  But that's lambdabot's fault :P
17:32:22  lambdabot: @so `echo test
17:32:23  `echo test not available
17:32:24  NOOOOOOOOOOOOOOO
17:32:25  test not available
17:32:28  Oh
17:32:32  So, still not a loops.
17:32:37  *still not a loop
17:32:41  `echo "lambdabot: @so `cat x; #" >x
17:32:43  ​"lambdabot: @so `cat x; #" >x
17:32:46  `run echo "lambdabot: @so `cat x; #" >x
17:32:48  bash: -c: line 0: unexpected EOF while looking for matching ``' \ bash: -c: line 1: syntax error: unexpected end of file
17:32:54  `run echo 'lambdabot: @so `cat x; #' >x
17:32:55  No output.
17:32:56  `cat x
17:32:57  cat: x: No such file or directory
17:33:01  monqy: I've read that HTML is an interesting programming language.  (re: learning new languages)
17:33:02  `cat x
17:33:03  lambdabot: @so `cat x; #
17:33:04  `cat x; # not available
17:33:04  :>
17:33:06  cat: x; # not available: No such file or directory
17:33:08  Oops
17:33:11  CakeProphet: :(
17:33:12  `run echo 'lambdabot: @so `run cat x; #' >x
17:33:14  No output.
17:33:16  `cat x
17:33:18  lambdabot: @so `run cat x; #
17:33:19  `run cat x; # not available
17:33:21  lambdabot: @so `run cat x; #
17:33:22  `run cat x; # not available
17:33:24  lambdabot: @so `run cat x; #
17:33:25  `run cat x; # not available
17:33:26  monqy: also Java, and Visual Basic
17:33:26  CakeProphet: what is so interesting about it
17:33:27  lambdabot: @so `run cat x; #
17:33:28  `run cat x; # not available
17:33:30  lambdabot: @so `run cat x; #
17:33:31  `run cat x; # not available
17:33:32  CakeProphet: cry
17:33:32  monqy: nothing, it's not a programming language.
17:33:33  lambdabot: @so `run cat x; #
17:33:33  `run cat x; # not available
17:33:34  Gregor: Let it run a bit more :')
17:33:35  so beautiful
17:33:35  lambdabot: @so `run cat x; #
17:33:36  `run cat x; # not available
17:33:38  lambdabot: @so `run cat x; #
17:33:39  `run cat x; # not available
17:33:41  lambdabot: @so `run cat x; #
17:33:41  ABANDON SHIP
17:33:42  `run cat x; # not available
17:33:43  lambdabot: @so `run cat x; #
17:33:44  `run cat x; # not available
17:33:46  Well, that is one way to break botloops. So in case someone test the program. There are other ways too, such as the bot operators disconnecting them, or the server operator forcibly disconnecting them.
17:33:47  lambdabot: @so `run cat x; #
17:33:47  `run cat x; # not available
17:33:49  lambdabot: @so `run cat x; #
17:33:50  `run cat x; # not available
17:33:52 -!- HackEgo has quit (Remote host closed the connection).
17:33:55  Pfff
17:33:55  :')
17:34:01  rip hackego
17:34:02 -!- HackEgo has joined.
17:34:03  I blame lambdabot on that one.
17:34:05  I've done all I can.
17:34:11  Yeah, lambdabot is terrible :P
17:34:15  Most of its commands prefix with spaces.
17:34:19  But the @source error message doesn't.
17:34:27  Which is why I use it for botloops :P
17:34:37  Gregor: but lambdabot has a great reputation for being secure and free from exploits.
17:34:51  So does HackEgo, but it's so much more spiffy.
17:34:53  I think you could program lambdabot to prevent you repeating commands too much by public.
17:35:19  Because, it is Haskell anyways; a function should always have the same result unless the program is changed.
17:35:19  monqy: smalltalk?
17:36:42  zzo38: @source is not pure :P
17:36:52  @run is pure, but not @source.
17:36:53    : parse error on input `,'
17:36:56  @source
17:36:57   not available
17:37:00  Pretty sure you can mutate @source's DB.
17:37:20 -!- Ngevd has quit (Quit: bye).
17:37:35  zzo38: Haskell's purity is a lie!
17:37:38  Then record a timestamp of last change, and a timestamp of last query for each channel.
17:38:41 -!- zzo38 has quit (Remote host closed the connection).
17:39:15 -!- andrew12 has joined.
17:39:33  `@ andrew12 ? welcome
17:39:35  andrew12: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
17:39:50 -!- CakeProphet has changed nick to are.
17:39:52  @messages
17:39:53  Probably just welcome'd a long-time idler :P
17:39:53  You don't have any new messages.
17:40:07 -!- are has changed nick to CakeProphet.
17:40:25  `@ Gregor ? CakeProphet
17:40:28  Gregor: :>
17:40:38  Gregor: That's the third welcome andrew12's got.
17:40:43  He must be feeling so welcome.
17:40:58  elliott: lol
17:41:20  elliott: What can I say, I don't really contribute anything to this channel except fear, uncertainty and doubt.
17:42:06 -!- kmc has quit (Ping timeout: 260 seconds).
17:44:03  `addquote  shachaf: wait, _you_ are in northumberland?   No.   whew   we don't have room for more esolangers there.   oerjan: Wait, *you* are in Northumberland?   no   Whew.   We don't have room for more esolangers there.
17:44:06  728)  shachaf: wait, _you_ are in northumberland?   No.   whew   we don't have room for more esolangers there.   oerjan: Wait, *you* are in Northumberland?   no   Whew.   We don't have room for more esolangers there.
17:46:27 -!- andrew12 has quit (Ping timeout: 240 seconds).
17:47:44 -!- andrew12 has joined.
17:49:13  `@ andrew12 ? welcome
17:49:15  andrew12: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
17:49:44  02:16:44:  in other news: length is stupid. genericLength is good.
17:49:44  02:18:11:  > let x = [1,2,3] in sum x / genericLength x
17:49:44  02:18:12:  2.0
17:49:53  CakeProphet: i don't think we want length to be able to return a complex number.
17:51:58 -!- andrew12 has quit (Ping timeout: 248 seconds).
17:52:53  > genericLength [1,2,3] + (5 :+ 10)
17:52:55    8.0 :+ 10.0
17:53:00  elliott: sure we do. :P
17:54:06  elliott: "fnord juhovh minä olisin ainakin fnord fnord fizzien fnord" => "fnord juhovh I would at least be fnord fnord fizzie's fnord".
17:54:14  fizzie: FINALLY YOU'RE HERE.
17:54:24  fizzie: (Why did you translate that for me?)
17:54:47  elliott: (Well, it was a reply for you, I didn't want to leave you confuzzled.)
17:55:31  confizzled. ha ha
17:55:38  -rw-r--r-- 1 elliott users 516K Nov 20 13:19 qwantz.xz
17:55:42  fizzie: How can I get this file to you?
17:55:50  Maybe email, it's pretty small.
17:56:00 * Gregor is intrigued by the name.
17:56:10  Gregor: YOU SHOULD BE.
17:56:17  YOU... WILL BE.
17:56:52  fizzie: Sendin'.
17:57:18  fizzie: Sent; enjoy your "qwantz: Dinosaur Comic transcriptions 2003-2011".
17:57:21  *Comics
17:57:28  It's Comics. Just clarifying!
17:57:34  Cosmics.
17:58:10 -!- sebbu2 has changed nick to sebbu.
18:04:08   ais523: op abuse, the traditional botloop breaker is an annoyed bot admin <--- not op abuse, it's much less disruptive to the channel then waking up a bot admin to ragepart the bot
18:04:08  Do you want me to live dangerously and just stick it in the bot without testing it?
18:04:16  fizzie: Yes.
18:04:21  There is pretty much no way it won't be amazing.
18:04:36  ais523: exactly, you're reducing natural disruption! that's _playing god_
18:04:42  ^style qwantz
18:04:42  ^style qwantz
18:04:43  ^style qwantz
18:04:43  ^style qwantz
18:04:43  Not found.
18:04:43  Not found.
18:04:43  Not found.
18:04:43  Not found.
18:04:46  FIND IT QUICKER
18:04:57  elliott: but reducing disruption is what ops are /for/
18:05:03  ais523: this is #esoteric!
18:05:09  this is Freenode!
18:05:14  ais523: they're here to facilitate the natural levels of disruption!
18:06:23 -!- fungot has quit (Quit: oh no I am not DYNAMIC enough).
18:06:41 -!- fungot has joined.
18:06:48  OMGSTYLEQUANTZ
18:06:58  Makes me want to revive my dormant T-Rex is Lonely Comics >_>
18:07:08  ^style qwantz
18:07:08  Selected style: qwantz (Dinosaur Comics transcriptions 2003-2011)
18:07:08  Err, qwantz
18:07:20  fungot: I love utahraptor!
18:07:20  Gregor: that that is pretty cute! my daily affirmation buys food he doesn't need to know that! that's gross! that dude across the street is thinking " bum
18:07:26 -!- ais523 has quit (Remote host closed the connection).
18:07:37  That dude across the street /is/ thinking " bum!
18:07:48  fungot: hi
18:07:48  elliott: i don't think that fixed time a day whenever i have, and as a patron, i find that, with this unusual. i'm guessing... a kabazillion dollars
18:08:00  fungot: i love you
18:08:00  elliott: you are a t-rex, undisputed king, but neither really wants!
18:08:20  fungot: hi
18:08:21  elliott: and so: " probably not!" or there could be a picture of a telephone poles, along with t-rex! that's a standard english just to ensure i act like i did before, and perhaps, at the end, to ask me
18:08:30  fizzie: Fungot's " quoting style" really irritates me.
18:09:11  how does that happen
18:10:34  fungot: hi
18:10:34  elliott: so i've been down for like, two minutes!! it's all that came to mind. instead, it's an alternate universe, that's " law and order". and it doesn't have to be shakespeare.
18:10:42  monqy: bad pmunctuation handling
18:10:48  fungot: you are best
18:11:01  nooooo Gregor
18:11:02  make him
18:11:03  talk again
18:11:28  fungot: I want your babies.
18:11:29  Gregor: i must have taken up a new page was slow and expensive! why simulate boring microbes galaxies away if we're just interested in one dude on earth? and why simulate this one dude at all, unless you're trying to find out more, as it's such a small thing, but it would be years down the road! okay. i'll do better next time, ok?
18:11:41  elliott: Also:
18:11:45  `echo fungot: I want your babies too.
18:11:45  Gregor: i don't have a very good student! we have to go." then, hey presto, you're a muslim! me say this: " what?? sweetcheeks? i'm sorry, i wasn't paying attention!
18:11:47  fungot: I want your babies too.
18:11:53  Awwww
18:11:57  What sort of bot ignores HackEgo :P
18:12:26  fungot is a pioneer in bot-ignore technology.
18:12:27  elliott: that that one incident to say that sentence: it's me god
18:12:28  Show 'em the ignores, fizzie.
18:12:34  ^ignore
18:12:35  ^(EgoBot|HackEgo|toBogE|Sparkbot|optbot|lambdabot)!
18:12:38  `addquote  Do you want me to live dangerously and just stick it in the bot without testing it?   fizzie: Yes.   There is pretty much no way it won't be amazing.
18:12:41  729)  Do you want me to live dangerously and just stick it in the bot without testing it?   fizzie: Yes.   There is pretty much no way it won't be amazing.
18:13:13  That's funny?
18:13:57  We all want to just stick it in the bot.
18:14:00  Oooh yeah.
18:14:03  Just stick it in that bot.
18:14:22  no
18:14:30  monqy: YES.
18:14:37  ;_;
18:14:56 -!- Gregor has set topic: The IOCCC is back on! http://www.ioccc.org | http://esolangs.org/ | #esoteric: Still a place that prefers INTERCAL to Haskell | http://codu.org/logs/_esoteric/.
18:14:57  Oh, I actually just skipped to my lines because I assumed they'd be the funny ones.
18:17:16  elliott: bad qoute reader
18:18:13  Gregor: I don't actually recall a time where you've spoken about Haskell.
18:18:36  aside from speaking about how much you prefer C over it (and every other language)
18:19:39  `log Gregor.*Haskell
18:20:04  2010-04-08.txt:00:12:56:  (Haskell is usually the wrong language)
18:20:13  yep
18:20:29  00:15:12: * Sgeo is temporarily a Haskell fanatic
18:20:39  (uh oh)
18:20:49  dont worry thats from 2010-04-08
18:20:54  oh good
18:21:01 * CakeProphet has never been a Haskell fanatic actually.
18:21:16  a fond admirer perhaps.
18:21:38  03:00:11:  Isn't Perl implemented in Haskell?
18:21:39  actual quote
18:21:54  is he being srs?
18:22:03  I assume he's talking about Pugs.
18:22:26  which isn't really "Perl"... yet.
18:22:39  "Perl" is currently Perl 5, in most contexts.
18:22:59  CakeProphet: Pugs will never be "Perl"... yet :P
18:23:05  well, right.
18:23:09  It's been dead for like 5 years?
18:23:13  I meant to say Perl 6 isn't Perl yet.
18:23:17  Recently APPARENTLY people are developing it again buuuuuuut
18:23:35  though Perl 6 may also never be "Perl"... yet :P
18:24:09  probably has something to do with being a complete clusterfuck with no single developer oversight.
18:24:24  larry would be the oversight, methinks.
18:24:40  considering he's the one who rejects or accepts all the proposals, or at least did in the early days
18:24:47  oh... hmmm
18:24:53  perhaps.
18:25:07  it's in the apocalypses. or whatever they're called.
18:25:08  I read "largely community driven" to mean that Larry kind of isn't very active.
18:25:14  elliott: very early
18:25:48  2001, 2002 isn't THAT early
18:25:51  1999 is when perl 6 started iirc
18:26:17  03:02:03:  Is it too late to try to get involved with Google Summer of Code?
18:26:17  03:02:14:  THey're probably looking for people who've actually looked at the stuff
18:26:17  03:04:37:  nope; deadline for applications is the 9th
18:26:17  03:05:20:  Ok, but don't I need to have some idea of what I want to do, besides just "I'll do what this organization suggests on their GSoC page"
18:26:17  03:05:23:  ?
18:26:19  03:09:08:  yes you do
18:26:21  03:09:22:  socghop.appspot.com
18:26:23  03:10:18:  I can't just say "I have never even looked at this code, but I'll try doing this suggestion", can I?
18:26:26  03:10:28:  I mean, and get accepted
18:26:28  i'm forced to conclude that 2011 > 2010
18:26:53  > (1999-2002)/(1999-2011)
18:26:54    0.25
18:27:05  elliott: it's 25% earliness :P
18:27:14 * CakeProphet sound logic
18:27:45  or... I guess 75% early.
18:28:56  this notion of percentages and earliness makes complete sense.
18:28:59  I promise.
18:29:24  http://en.wikipedia.org/wiki/K_computer
18:29:33  I would like to make a faster computer and name it OK Computer
18:31:25 -!- sebbu2 has joined.
18:31:25 -!- sebbu2 has quit (Changing host).
18:31:25 -!- sebbu2 has joined.
18:32:50  average speed computer
18:34:18  no it would be the fastest computer in the world, with all of its processing power used to generate really shitty sounding radiohead covers, tribute songs, blog posts, fan fiction, and fan club websites.
18:35:15 -!- sebbu has quit (Ping timeout: 276 seconds).
18:35:57  CakeProphet: lololol BEST QUOTE EVER X-D
18:36:11  CakeProphet: I actually kinda like Haskell, but I love hating it more than I like liking it.
18:36:19  oh, good.
18:36:23  this is as it should be.
18:36:27  we cannot ALL be Haskell fanboys
18:36:38  there must be balance.
18:37:04  Gregor: X-D
18:37:05 -!- copumpkin has quit (Ping timeout: 252 seconds).
18:37:28  To be fair I haven't written anything substantial in it in years.
18:37:52  Gregor: how much of a 133t h45k311 h4ck3r are you?
18:37:53  oh okay.
18:39:22  CakeProphet: http://www.youtube.com/watch?v=M7tew1apXqc <-- this was written in Haskell
18:39:22  monqy: what was that weird website you found?
18:39:47  sourcereal.com?
18:39:56 -!- sebbu2 has changed nick to sebbu.
18:40:02  monqy: yes!
18:40:03  Gregor: I like the fade to show HOW REALISTIC it is.
18:40:09  CakeProphet: it's a good site
18:40:24  elliott: also how blue Mt. Hood apparently is
18:40:30  elliott: Gimme a break :P
18:40:46  Gregor: Excuse me no???
18:41:35  monqy: I have a suspicion that zzo is actually the webmaster behind sourcereal.com
18:42:13  "Hopefully, that list will give you an idea about what you may learn when reading this cereal page, or, you might find something useful reading other websites." -- zzo
18:42:42 -!- Ngevd has joined.
18:42:54  Hello!
18:42:57  yes it is very zzoesque
18:43:22  z-zosque
18:44:08  monqy: hi I'll pay you money if you write this paper for me.
18:44:28  what paper :(
18:44:33  also I have to leave like now
18:44:37  so
18:44:40  it's only like a 10 page report with questionnaire statistics and two interview transcripts that need to be cited.
18:45:08  along with internet sources. it's a proposal to incorporate more education of linux into my university's curriculum.
18:45:13  it's very, uh, exciting.
18:45:19  sounds miserable
18:45:23  also due today.
18:45:34  but anyway have fun leaving like now.
18:46:03 -!- ais523 has joined.
18:46:08  I'm more upset with lack of programming language/paradigm diversity than lack of linux education (why would you need linux education)
18:46:11  anyway
18:46:14  leaving like now
18:46:22  also does anyone have any good "lol linux is totally p0pu14r"
18:46:23  sources
18:46:47  hey, who made the topic ping me?
18:47:15  monqy: well the basic premise is that a) we do not expose students enough to linux environments b) linux expertise has high industry demand
18:47:28 -!- copumpkin has joined.
18:47:41  monqy: yes I agree, but I need to also create a presentation on the topic, and I didn't want to completely bore my non-computer-science audience.
18:47:42  CakeProphet: counterpoint: linux sucks
18:47:47  CakeProphet: What school is it that doesn't ...
18:47:52  elliott: well, that's irrelevant
18:47:59  Gregor: my school. IT'S SEKRET
18:48:05  Gregor: and, they do, but not very much
18:48:15  (its georgia tech.. it hink??)
18:48:18  no.
18:48:19  CakeProphet: Of the two universities I've been at, two have had students use Linux primarily from day one.
18:48:19  oh
18:48:21  who is it from georgia here
18:48:24  ive
18:48:26  CakeProphet: you could mention Linux's share in the server market
18:48:27  (CS students)
18:48:30  seen that uninvinvinvinersity name in here before
18:48:31  that tends to impress people
18:48:36  ais523: yes that's good.
18:49:00  elliott: southern polytechnic state university. it's like the shitty version of GA tech that's cheaper and easier to get into.  :)
18:50:19  `echo HackBot is proof of why Linux is important.
18:50:22  HackBot is proof of why Linux is important.
18:50:31  also it's supposedly geared more towards "practical" education. aka helping people get jobs.
18:50:40  so, the "people use linux" point is the important one.
18:50:40  oh god
18:52:05  the point of a university is research and training new researchers. the point of the world is to enable this.
18:52:45  oklopol: not in the US. :P
18:53:23  `addquote  the point of a university is research and training new researchers. the point of the world is to enable this.
18:53:25  730)  the point of a university is research and training new researchers. the point of the world is to enable this.
18:53:40  you should see our "cs" department. they have a course called computer science and the society.
18:53:50  in the US universities are businesses that serve as a pointless barrier for entering a profession. oh, also they do research stuff.
18:54:01  elliott: i was disappointed you didn't quote my gay joke
18:54:11  oh where was that
18:54:13  i don't think i finished logreading
18:54:19  up where i was talking to zzo
18:54:44  oh good god what have i missed
18:54:47  elliott: you have to read the wonderful conversation between shachaf copumpkin oerjan Ngevd (I think?) and I
18:54:56  what was it about
18:55:01  "maths"
18:55:04  :O
18:55:07  where
18:55:09  where is it
18:55:12  i need to read it
18:55:12  now
18:55:13  eww maths
18:55:19  :/
18:55:23  don't do that
18:55:25  that's not funny
18:55:26  well, bottom, strictness, category theory, type theory. primarily it was about me not understanding _|_ as it's used in Haskell.
18:55:39  that's cs :/
18:55:48  That wasn't me I don't think
18:55:52  by "it's awesome" I mean you'll probably hate reading it and seeing how wrong I am the whole time.
18:56:05  oh Sgeo was there too
18:57:04  i know very few things about category theory apart from the trivialities, mosty limits and inverse limits i suppose
18:57:27  those were a new addition because we needed inverse limits for... something
18:57:29  I know some of the basic terminology and some laws and that's it.
18:57:34  All I know about category theory is that it is a category
18:57:45  what are its morphisms?
18:57:58  mathematicians
18:58:07  cool
18:58:17  functors I imagine.
18:58:23  CakeProphet: was it today
18:58:24  or
18:58:27  i've always wanted to be a homomorphism
18:58:28  the previous
18:58:28  day
18:58:29  if we're talking about "category of categories"
18:58:29  (utc)
18:58:38  CakeProphet: *category of small cats
18:58:41  (kittens)
18:58:42  elliott: I don't actually ever pay attention to UTC
18:58:54  but I think it was today UTC
19:00:02  CakeProphet: ah i left off at the point of you beign all |im hate calculus"
19:00:24  elliott: oh yes that was very very early.
19:00:26  ew calculus
19:00:58  elliott: I mainly hate calculus because of all the effort I had to put into taking three university courses on it.
19:01:38  I enjoy maths at the moment
19:01:41  Please don't change that
19:01:52  what sorta maths
19:01:59  I like maths too, but not calculus.
19:02:18  All the maths I know about, except for geometry
19:02:20  im maths
19:02:39  Also everyone hates geometry, was there a memo I missed or something?
19:02:40  what do you know about
19:02:46  discrete math is intuitive and nice thanks to my leet cs skillz
19:02:49  do you know why the identity element of a group is unique?
19:02:51  calculus hurts.
19:03:12 * oklopol is doing geometry atm
19:03:13  oklopol, basic calculus, moderately sophisticated conventional algebra, matrices.
19:03:25  in besicovitch spaces of course
19:03:40  This is based on the Scottish course, of course.
19:03:42  k that stuff
19:03:47  have to go :/
19:03:52  bues.
19:03:53  you bored oklopol Ngevd :(
19:03:56  I like matrix multiplication, because when you get over how damn weird it is, it all makes perfect sense
19:04:02  you bored Ngevd oklopol :'( (maybe ???)
19:04:15  I like category theory because when you get over how damn weird it is it's still weird.
19:04:20  I'm just faintly smiling and rocking side to side
19:04:25  do you do that a lot
19:04:28   that's cs :/
19:04:29  Yes
19:04:34  ok
19:04:35  CS is a kind of maths.
19:04:38 * elliott faintly smiles and rocks side to side
19:04:40  yay
19:04:49  Ngevd: have you read about finite fields?
19:04:53  No?
19:05:11  `addquote  it's not even about strictness actually   not strictly about strictness, anyway
19:05:12  I haven't actually read that much about anything
19:05:13  think about it, a finite n-dimensional space in which matric multiplication is a linear map.
19:05:14  731)  it's not even about strictness actually   not strictly about strictness, anyway
19:05:15  04:52:06:  \f x-> reads \f->\x->... *Clearly* there's not much evaluation you can do of an unapplied lambda.
19:05:18  mmmmmmm
19:05:18  pikhq_: sure there is
19:05:59  Ngevd, they're fields with only finitely many elements, where fields are this abstract algebra thing.
19:06:03  05:02:12:  > (\x -> undefined)
19:06:03  05:02:13:  Overlapping instances for GHC.Show.Show (t -> a)
19:06:03  05:02:13:  arising from a use of `...
19:06:03  05:02:39:  in my mind this is forcing (\x -> undefined) (I'm just going to call it const undefined now)
19:06:06  Phantom_Hoover, ah
19:06:08  CakeProphet: stop being an idiot, that error is compile-time
19:06:09  That makes sense
19:06:19  elliott: the confusion was not a result of that error
19:06:20  > (fix id) :: (a -> b)
19:06:21    Overlapping instances for GHC.Show.Show (a -> b)
19:06:21     arising from a use of `...
19:06:24  infinite loop terminating omg
19:06:58  :t fix id
19:07:00  forall a. a
19:07:03  Aaah
19:07:36  oklopol: do you know about (n-1)-order Markov models based on frequency analysis of character n-grams and their applications in autolinguistic lexeme generation?
19:07:36  The internet is where I don't have to be a hyperintelligent... entity
19:07:36  Ngevd, specifically, fields are more or less sets with two operators which behave broadly similar to + and * over the reals.
19:07:41  (note: I just made most of that terminology up)
19:08:39  well, actually no I didn't.
19:08:44  I just made it sound fancier than it is.
19:09:23  Ngevd: are you a hyperintelligent entity usually
19:09:27  are you god Ngevd
19:09:32  No, but I'm expected to be
19:10:09  If enough people believe I am a god, I will BECOME AS A GOD!!!
19:10:24  Ngevd: I find the trick to appearing as a hyperintelligent entity in real life is to only speak when you actually know something
19:10:28  and to otherwise remain silent.
19:10:34  I don't follow this protocol online. :P
19:10:42  CakeProphet, I don't do that, nobody seems to have noticed?
19:11:37  This results in the unfortunate consequence that people seem to think I'm an expert on, say, determining the ionic composition of water.
19:11:37  @pl-resume
19:11:44  ap id id (ap id id)
19:11:45  optimization suspended, use @pl-resume to continue.
19:11:46  Phantom_Hoover: ah, weird.
19:11:56  Phantom_Hoover: Aren't you?
19:12:01  my "stupid filter" turns off when I'm in this channel, for some reason. :P
19:12:22  elliott, yes, of course, but the presumption offends me.
19:12:26  05:26:54:  copumpkin: I thought this was a classic example in #haskell.
19:12:26  05:26:59: * copumpkin shrugs
19:12:26  05:26:59:  copumpkin: it's not.
19:12:29  People ask me for help with their Chemistry homework
19:12:33  I don't do chemistry
19:12:33  good to know we have a haskell expert to correct shachaf
19:12:49  elliott: I don't think I was "it's not"ing that thing directly above me.
19:12:50  Here in Scotland we have transcended the need for mere mortal chemistry homework.
19:13:02  I didn't see anything else relevant.
19:13:07  05:26:08: -!- oerjan has quit (Quit: You sort out this mess yourself).
19:13:07  got a lol though.
19:13:17  Phantom_Hoover, immortal chemistry homework!?
19:13:38  We transcended that as well.
19:13:41  05:29:14:  shachaf: I had this discussion a year or so ago with people regarding spoon and why the denotation view of strictness is bullshit because we can actually distinguish things operationally, and people should stop masturbating to denotation
19:13:41 * elliott is made sad by this viewpoint.
19:14:11 * copumpkin masturbates vigorously
19:14:59  I don't masturbate to ANYTHING
19:15:02  elliott: yeah considering I don't actually frequent #haskell and don't know anything about the classic examples there
19:15:03  Nyahahaha!
19:15:09  elliott: probably was in relation to something else.
19:15:36  type CommandQueue = Ptr CommandQueuec
19:15:36  no why would you do that!
19:15:39  library I DON'T LIKE YOU
19:16:29  anyway I need to focus on not IRC
19:16:30  OK let's try this.
19:16:44  data CLDeviceInfoRetval = DeviceInfoRetvalString String | DeviceInfoRetvalCLuint CLuint | DeviceInfoRetvalCLbool CLbool | DeviceInfoRetvalDeviceFPConfig DeviceFPConfig | DeviceInfoRetvalDeviceExecCapabilities DeviceExecCapabilities | DeviceInfoRetvalCLulong CLulong | DeviceInfoRetvalDeviceMemCacheType DeviceMemCacheType | DeviceInfoRetvalCLsizei CLsizei | DeviceInfoRetvalDeviceLocalMemType DeviceLocalMemType | DeviceInfoRetvalCLsizeiList [CLsizei]
19:16:44   | DeviceInfoRetvalPlatformID PlatformID | DeviceInfoRetvalCommandQueueProperties CommandQueueProperties | DeviceInfoRetvalDeviceType DeviceType
19:16:52  copumpkin: please ensure cosmic punishment of the designer of this library for me
19:16:55 -!- CakeProphet has quit (Quit: going into IRC rehab).
19:16:59  lol
19:18:43  CL_CONTEXT_PROPERTIEScl_context_properties[] Return the properties argument specified in clCreateContext.
19:18:47  gah!!!
19:18:53  this library forces people to create their own pointers
19:18:54  i'm crying
19:18:58  elliott: ?
19:19:05  well i mean that was obvious but like
19:19:08  not for that thing :(
19:19:10  its just a pionter
19:19:14  shachaf: what
19:19:22  People beep my name too much.
19:19:36  If you beep my name, you have to brace yourself for My wrath.
19:20:29  noted!
19:20:53  WHY IS DEVICEID A POINTER
19:21:21 -!- aloril has quit (Ping timeout: 244 seconds).
19:27:45  WHY DOES OPENCL DO REFCOUNTING
19:28:07  elliott: a haskell opencl binding?
19:28:23  are you saying that opencl itself sucks to bind to?
19:28:25  copumpkin: I'm trying to make http://hackage.haskell.org/package/OpenCLWrappers less terrible :P
19:28:47  Most of my issues are with the wrapper, and almost all of those issues are inherited from the dead package it's forked from
19:28:55  But I'm too busy yelling at everything :P
19:29:11  please make it not suck
19:29:43  copumpkin: That's a long-term goal. My short-term goals look like "make it use exceptions rather than threading around (IO (Either ErrorCode Result)) ABSOLUTELY EVERYWHERE".
19:29:53  And "Make it use ForeignPtrs rather than making you free everything" :P
19:29:59  It's a long shot, but is anyone here in my ancient history class?
19:29:59  o.O
19:30:13  Ngevd: I may be old, but I'm not that old
19:30:36  copumpkin: I should clarify, it's not ALWAYS (Either ErrorCode r). If r would be (), it's instead (Maybe ErrorCode).
19:30:40  Just to keep things interesting, I guess!
19:30:49  lol
19:31:05  copumpkin: did I show you combineOr? I forget :P
19:31:10  nope
19:31:20  copumpkin: https://github.com/jkarlson/OpenCLWrappers/blob/master/System/OpenCL/Wrappers/Utils.hs#L71
19:31:32  lol
19:31:42  wtf is that
19:31:56  copumpkin: it's used in exactly one place, on a list of Foo where Foo is a newtype of CLulong
19:32:09  deriving (Bits)
19:32:16  copumpkin: i just unwrapped the newtype instead
19:32:25  foldl' (.|.) 0 [ foo | Cons foo <- xs ]
19:32:28  derive bits on the newtype and it'll just work
19:32:36  yeah I might
19:32:37  Why do so many esolangers start with a BF derivative?
19:33:02  hmm, I wonder if I should offer an interface to this awful refcounting stuff
19:33:12  I /think/ some of these can allocate GPU memory
19:33:27  i'm tempted to just remove them so that you can't cause segfaults that easily
19:35:09 -!- aloril has joined.
19:35:19  Hello aloril
19:35:29  The enigma that is aloril.
19:37:24  oh, i was going to ask ais523 but then i realised he uses CUDA
19:37:50  I don't really use CUDA, more I've seen it before
19:38:13  ais523: You complained about the toolkit once and said you might switch to OpenCL if it keeps getting worse?
19:39:00  my boss did that
19:39:08  Well, you're the one who said it.
19:39:10  but the toolkit was getting worse over time, although it was quite good to start with
19:39:23  it's him who complained, I reported the complaint here (and I agree with it)
19:40:16  You reported it silently, at least :P
19:40:22 -!- Phantom_Hoover has left ("Leaving").
19:40:28 -!- Phantom_Hoover has joined.
19:40:39  bye Phantom_Hoover
19:40:40  hi Phantom_Hoover
19:40:54  I've *got* to work out what that thing is which makes rolling my hand on the left of the touchpad close the chat tab.
19:41:16  OK, I think that these actually do use GPU RAM...
19:41:25  Anyway, ais523, CAN HUMIDITY, FLUORESCENT LIGHTS AND MICROWAVES KILL COMPUTERS?????
19:41:28  Eh, I'll just keep exposing the free function.
19:41:34  oh hmm wait
19:41:41  that's not safe, since it might get re-freed
19:44:58  Phantom_Hoover: I advise against microwaving a computer
19:45:20  oh noooooooooo
19:45:35  For you see, I left my motherboard in the microwave to get rid of the humidity.
19:54:05 -!- augur has joined.
19:57:34  May I enquire as to the presence of cliques amongst schools in the UK?
19:57:55  You may, although why you think you'll get answers here is anyone's guess.
19:58:16  You go to school in the UK
19:58:33  So do I
19:58:49  ais523 does something that may have something to do with schools in the UK
19:58:56  Universities, actually.
20:04:56  ais523 is a ``Ph.D. student''.
20:04:58  (Hobo.)
20:05:38  elliott, I don't know what elliott does
20:05:52  I'm a hobo assistant.
20:06:04  Aah
20:06:27  Seriously, where do you get your education?
20:06:37  Because I want to steal it
20:10:41  Ngevd: hobo store
20:34:30  elliott is a student of some sort; personally, I've not kept track of which bit of secondary education he's in.
20:35:31  You're all hobophobic.
20:35:34 -!- elliott has left ("Leaving").
20:35:41 -!- elliott has joined.
20:35:49  OK I can't get over how that sounds like "homophobic" said by someone with a cold.
20:37:52 -!- CakeProphet has joined.
20:37:52 -!- CakeProphet has quit (Changing host).
20:37:52 -!- CakeProphet has joined.
20:38:01  hi my name is Adam and I'm addicted to IRC
20:38:22 -!- Phantom_Hoover has quit (Ping timeout: 248 seconds).
20:38:23  Hi Adam, I'm Nathan and I'm smug and think I'm better than you
20:38:36  bah, I knew it.
20:39:43  help I picked a bad topic for this crap
20:40:32  but I now have a giant bottle of caffeinated energy soda.
20:40:40  Did we ever get invaded by Haskellites?
20:40:46  Nope.
20:40:52  They all ran away when they saw my snarky comment.
20:40:54  #esoteric /is/ Haskellites, largely.
20:41:10  There are at least three people in here who came from #esoteric.
20:41:11  And one bot.
20:41:18  erm.
20:41:20  From #haskell.
20:41:27  There are a lot of people in here who came from #esoteric .
20:41:29  And several bots.
20:41:30  I came from the wiki
20:41:35  elliott: you mean regulars?
20:41:39  or like, today... recently
20:41:44  three random people appeared
20:41:48  and a new bot
20:42:02  Oh, it's actually two. kmc no longer graces us with his presence :'(
20:42:05  `quote kmc
20:42:08  686)  COCKS [...]  truly cocks \ 720)  You should get kmc in this channel. kmc has good quotes.   `quote kmc   686)  COCKS [...]  truly cocks   Well, in theory.
20:42:55  also by Haskellites I mean "one who fondly regards and practices in the deep ways of Haskell voodoo"
20:43:00  not #haskellites
20:43:14  is there a difference
20:43:17  yes.
20:43:27  I am a Haskellite and not a #haskellite
20:43:41  ha ha ha well
20:43:44  okay then
20:43:57  elliott: kmc is on vacation.
20:44:03  also monqy?
20:44:05  Vacation from BEING INTERESTING.
20:44:07  I meant people who religiously obey the works of Mr Curry
20:44:20  monqy is an hornonronoronrorary #haskell member.
20:44:21  and uh... elliott, but not elliottt
20:44:41  both elliott and elliottt are in #haskell
20:44:53  elliott: I didn't "come from #haskell".
20:45:05  At least, I didn't hear about #esoteric in #haskell. I'm pretty sure.
20:45:15  shachaf: Where did you come frmo,t hen?
20:45:19  shachaf: you are a migrate.
20:45:21  Oh, edwardk has been in here before too.
20:45:27  But not from #haskell.
20:45:29  in a geographical system in which people my simultaneously exist in two locations
20:45:34  And... who else was it?
20:45:34  s/my/may/
20:45:38  shapr.
20:45:39  shapr's been in here.
20:45:47  At least I think it was him.
20:46:12  elliott: No idea.
20:46:42  also I suspect several #haskellites are in fact #esoteric migrants.
20:47:05  what this means:  I have no idea
20:47:30  Before I came here, I had never heard of Haskell
20:47:39  I had barely heard of the freenode IRC server
20:48:05  -- Ngev's conversion account
20:48:28  There is a d in my name, gorram it
20:48:33  "Before I came to #esoteric, I had never even hurd of Befunge, but soon I felt His glory."
20:48:38  hi im back from leaving like then
20:48:45  Hurrah!
20:48:53  Ngevd: You realise you came here in July :P
20:48:59  Yes
20:49:24 * CakeProphet is an ancient antediluvian, sort of.
20:49:37  And now I am able to write an almost funtioning bf interpreter in Haskell
20:49:47  Ngevd: sweet
20:49:51  that was my first Haskell program
20:50:10  And re-invented zippers... by thinking of how to implement bf in Piet
20:50:18  I...forget what my first haskell thing was
20:50:59  My first Haskell thing translated brainfuck to Piet assembler
20:51:12  mmm
20:51:20  It was designed to take advantage of oerjan's work
20:51:27  the first thing i can remember doing was just a boring markov irc bot :(
20:51:36  but I may have done some stuff before then
20:51:41  monqy: why :( markov irc bots are great
20:51:43  Hence it only used a tape size of three
20:51:48  elliott: i guesssssssss.....
20:51:54  elliott, boring ones aren't
20:51:58  monqy: hi fungot
20:51:59  elliott: hey, i wanted to talk to a t-rex... nostalgia, doesn't that make them equally valid? like, a pirate. we've all been there.
20:52:02  it wasn't TOO boring
20:52:07  it just wasn't SPECTACULAR
20:52:24  but i love programming languages stuff and i think compiling to piet is nifty
20:52:27  so
20:52:50  It compiled to Piet assembler. It needs another program to actually output Piet
20:53:01  The only program that exists is written in Perl
20:53:44  oh..
20:53:58  is piet assembler any interesting
20:54:52  http://pastebin.ca/538375
20:54:53  could you make a compiler to piet that "optimized" programs into looking kind of like pretty pictures
20:55:02  "Thanks to CakeProphet for his tremendous help"
20:55:06  I don't remember any of this.
20:55:33  I'm guessing this was back when I frequented #python
20:55:42  how was it
20:55:44  #python, that is
20:55:47  I'm afraid of it
20:55:50  and spent considerable amounts of time actually helping people with Python questions.
20:55:58  monqy: it's, meh.
20:56:05  about the same as any other programming language channel (except #haskell)
20:56:30  people there are generally helpful, but others can be rude and unecessarily pedantic. others simply don't know what they're talking about.
20:56:45 -!- Phantom_Hoover has joined.
20:57:20  CakeProphet: That's true of #haskell too.
20:57:22  monqy: also it is incredibly easy to write "unreadable" code, by Python standards.
20:57:39  what's "unreadable"?
20:57:41  *by people who program in Python and are bad at reading code
20:57:45  monqy: subjective, mostly.
20:58:08  I'm afraid I'd have trouble reading a lot of "readable" python code, and would do better with some less "readable" stuff
20:58:14  shachaf++
20:58:23  #haskell used to be better :(
20:58:28  :(
20:58:42  (Most importantly, it used to not go at a thousand lines per second :P)
20:58:44  #esoteric used to be better, then elliott came along.  >:(
20:58:53  CakeProphet: It so wasn't better, I've read the logs.
20:58:57 * shachaf can't fathom #esoteric without elliott.
20:58:57  (ha. ha. ha ha.)
20:58:58  You were so stupid :'(
20:59:08  elliott: but look at how much I've changed!
20:59:09  shachaf: It was much quieter.
20:59:13  CakeProphet: Exactly! Not at ALL!
20:59:19  elliott is the life of the party
20:59:37  elliott: surely I have.
20:59:50  it's been... what.. 4 years now?
20:59:53  5?
21:01:52  when I joined this channel I had maybe a few months of experience with Python.
21:02:01  now I am a VERITABLE MASTER (not really)
21:04:51  also, a transformation is about to take place (I think)
21:05:00  what transformation
21:05:03 -!- CakeProphet has changed nick to Kallisti.
21:05:05  BAM
21:05:11 * Kallisti waits for Freenode staff.
21:05:12  i should have nabbed that before you
21:05:15  Kallisti: oh they take hours
21:05:24  elliott: I WILL WAIT
21:05:28  AND YOU WILL NOT HAVE THIS NICK
21:05:42  CakeProphet is a silly name anyway. this is much better.
21:06:09  if you change nicks permanently im putting you on ignore
21:07:42  I changed nicks permanentlish
21:08:01 -!- oerjan has joined.
21:08:07  oerjan!
21:08:13  Ngevd!
21:08:30  How're you?
21:08:38  elliott: OH LOOK IT TOOK LIKE 10 MINUTES FOR STAFF TO DROP THE NICK
21:08:41  what now?
21:08:49  elliott: also you're just looking for an excuse to ignore me.
21:09:33  Soon no-one's nick here will be the same as their wiki username!
21:10:06  speaking of which
21:10:09  I should change wiki usernames
21:10:26  Ask an admin.
21:10:33  ais523: hi
21:10:48  ais523: er, excuse me. hi?
21:10:52  hi is not a valid question
21:11:02  hi
21:11:10  and I can't change wiki usernames
21:11:13  :(
21:11:13  you need to ask Graue
21:11:19  how about I just
21:11:22  make a new username
21:11:25  and move everything to that.
21:11:39  or well, just start fresh basically. because my current user stuff is pointless :P
21:12:45  a new era of legitimacy. yes. that is definitely what will happen.
21:13:12  what with my unfinished regex language and clusterfuck graph automaton and now this idea for a reversible graph thing.
21:13:29  shit will be graphed and regular expressioned the fuck out.
21:15:08 * Kallisti joins ##c just to see what it's like.
21:15:16  silent.
21:15:37  422 silent people.
21:15:44  they must be debugging C programs.
21:17:05  Sgeo: upderpinski triangle
21:17:13 -!- Phantom_Hoover has quit (Quit: Leaving).
21:17:28 -!- Phantom_Hoover has joined.
21:21:38 -!- Phantom_Hoover has quit (Ping timeout: 244 seconds).
21:21:42 -!- Phantom__Hoover has joined.
21:23:48  elliott: hmm, do you think Great Britain looks more like a venus fly trap or a weird jagged bifurcated penis.
21:24:02   Write a Num instance for (a -> a) -> (a -> a)
21:24:13  the trouble is, you _really_ want a forall a. first
21:24:28  otherwise you cannot define things like multiplication
21:25:43  hm i think.  lessee.
21:26:18  :t ?m (?n (f :: Int -> Int)) :: Int -> Int
21:26:19      No instance for (SimpleReflect.FromExpr Int)
21:26:20        arising from a use of `f' at :1:8
21:26:20      Possible fix:
21:26:24  argh
21:26:29  :t ?m (?n (?f :: Int -> Int)) :: Int -> Int
21:26:30  forall t. (?f::Int -> Int, ?m::t -> Int -> Int, ?n::(Int -> Int) -> t) => Int -> Int
21:26:51  ok i guess multiplication might work
21:27:23  we need linear implicit parameters
21:27:31  pity they killed them
21:27:34  elliott: either way it is clearly dwarfed by the long bifurcated dick of Scandinavia.
21:27:36  :t ?m ?n (?f :: Int -> Int) :: Int -> Int
21:27:37  forall t. (?f::Int -> Int, ?m::t -> (Int -> Int) -> Int -> Int, ?n::t) => Int -> Int
21:27:37  copumpkin: what is that?
21:27:55  a feature GHC supported way back before I started haskell
21:28:04  http://www.haskell.org/haskellwiki/The_Monad.Reader/Issue2/FunWithLinearImplicitParameters
21:28:07  exponentiation won't work
21:29:52  `log elliott.*CakeProphet.*implicit.*parameters
21:29:58  2011-11-21.txt:21:29:52:  `log elliott.*CakeProphet.*implicit.*parameters
21:30:01  :(
21:30:12  `log elliott.*implicit.*parameters
21:30:17  2011-09-22.txt:17:43:20:  Implicit parameters are a misfeature and should never be used; nobody at all wants them to stay in the language, and they've been used approximately once.
21:30:36  Make that twice, then.
21:30:47  lambdabot and an article in the Monad.Reader.
21:31:58  I dunno, I think implicit parameters can be good.
21:32:07  but they need to be used wisely.
21:32:22  and not because you're bad at writing Haskell. :P
21:33:28  Kallisti: There's an example piece of code where giving it the inferred type signature changes its semantics with implicit parameters, IIRC.
21:33:44  o_0?
21:36:30   ok i guess multiplication might work <-- well, although only with the more complicated type ((a -> a) -> a -> a) -> (a -> a) -> a -> a
21:37:21  oerjan: I can't wait to see what church complex numbers would look like.
21:37:38  gah
21:37:42  The numbers themselves would just be a pair
21:37:54  It's the associated functions that make them interesting
21:37:55  copumpkin: this article was interesting until they whipped out the unsafe functions
21:38:02  church binary search tree?
21:38:35  Kallisti: there is a process for converting any adt to church representation
21:38:57  even gadt's according to what i recently read on reddit
21:39:01 * copumpkin shrugs
21:40:11  Kallisti: ah yes, it is even referenced in that article: "So the semantics of the program depends on whether or not foo has a type
21:40:11  signature. Yikes!"
21:40:31  oh, that was linear implicit parameters
21:40:38  yikes
21:42:49  *has an explicit type  I assume
21:44:08  Kallisti: not quite:
21:44:10  "It is important that we give a real type signature:
21:44:10  x :: Int = reflect [0,1] does not make any difference!"
21:44:17  but x = reflect [0,1] :: Int might
21:46:58  I wasn't even aware you could declare types on patterns.
21:47:29  er, well, x isn't really a pattern actually
21:48:06  > let x :: Int = 2 in x
21:48:07    2
21:48:32  > let [x,y] :: [Int] = [1,2] in x
21:48:33    1
21:48:56  it's an extension
21:49:03  very useful with exceptions
21:49:09  m `catch` \(_::Foo) -> ...
21:49:39  ah, so you can use it to make case statements on different types in a typeclass.
21:49:43  that's useful.
21:50:08  ....right?
21:50:31  er, no
21:51:24  but you can use it in lambdas passed to higher order functions to specify a concrete type.
21:52:30  type-based case expressions would be fun. I guess you can achieve that with Typeable actually.
21:52:42  the haskell new exception system uses some tricks to essentially allow it to do "case statements on different types" in the Exception typeclass.
21:52:54  so that's what catch relies on
21:53:11  oerjan: you just chain together catches?
21:53:25  no, there
21:53:26 * Kallisti has never used exception handling in Haskell.
21:53:36  's a specific function for taking a list
21:53:42  ah okay.
21:53:53  well, you can chain together too, i guess
21:54:23  :t catch
21:54:24  forall a. IO a -> (IOError -> IO a) -> IO a
21:54:40  that's the IO catch from the report, which is much more limited
21:54:47  :t Control.Exception.catch
21:54:48  IOError is an existential I'm guessing.
21:54:48  forall a e. (GHC.Exception.Exception e) => IO a -> (e -> IO a) -> IO a
21:55:01  Kallisti: no i think it's an actual ADT
21:55:03  oh
21:55:09  type IOError = IOException
21:55:13  the haskell report has no existentials
21:55:16  data IOException
21:55:32 -!- Patashu has joined.
21:55:43  oerjan: so do you actually use exceptions?
21:55:52  I think I've seen elliott use them.
21:56:21  If you don't use exceptions, you don't write much non-boilerplate code in IO
21:56:38   the haskell new exception system uses some tricks to essentially allow it to do "case statements on different types" in the Exception typeclass.
21:56:42  oerjan: it's not _that_ tricky :P
21:56:43  i cannot recall if i've used them
21:56:43  or don't write fault-tolerant IO code.
21:56:46  it's just Typeable
21:56:51  Kallisti: it's not about fault-tolerance
21:57:00  elliott: well ok it's really just Typeable, the extra trick is for the subtyping
21:58:40  most things i've written are very mathematical, so not very complicated IO
21:59:55  oerjan: i think Kallisti is living under the delusion that you write actual programs
21:59:59  and are, shall we say, a "programmer"
22:00:01  and not much need to actually catch erros
22:00:04  *rs
22:00:15  possible.
22:00:23  oerjan has no need for love
22:00:33  hey! :(
22:00:35  lol
22:00:53  elliott: HA HA HA POLYGLOT PUN
22:01:08  polyglot typo pun
22:01:10  or something.
22:01:52  elliott: wait what, i assuming you are making a pun on eros but that really doesn't fit there.
22:02:03  that was the joke :P
22:02:19  oerjan: I think elliott is living under the delusion that you are a non-mythical human being.
22:02:20  *am
22:02:26  and are, shall we say, "not a viking"
22:02:36  ...says someone called "Kallisti".
22:03:10  oerjan: obviously I am an apple.
22:03:15 -!- pkzip has joined.
22:03:18  and not a human being
22:03:22  yeah
22:03:23  hi pkzip we missed you!!!
22:03:36  we were getting all uncompressed!
22:03:58  I am logged as pkzip ? I thought my changed nickname wud
22:04:03  kick in by now
22:04:07  elliott: which nick do you hate the most? CakeProphet or Kallisti?
22:04:13  pkzip: you have to change it in your client settings
22:04:19  your opinion is important, or something.
22:04:20  I know
22:04:21  that
22:04:22  Kallisti: every time I see "CakeProphet" I puke
22:04:30  good.
22:04:35  Kallisti: it's how he stays thin
22:04:39  Kallisti: and
22:04:41  i hate puking
22:04:42  and
22:04:43  i see elliott is trying the old reverse psychology
22:04:43  i hate you
22:04:46  and i will hate you even more if you do that
22:04:47  and
22:04:49  i might leave forever
22:05:10  or is it double-reverse
22:05:13  elliott: oh no, I want to APPEAR NON-OBNOXIOUS AMONGST MY PEERS. :>
22:05:21  you're failing
22:05:21  his reverse psychology is not working.
22:05:22  really badly
22:05:35  I wonder if my name has ever annoyed anyone
22:05:36 -!- derdon has quit (Remote host closed the connection).
22:06:16  YOU MISSPELLED MONKEY KILL KILL KILL
22:06:33  oerjan: stop misspelling monqy
22:06:57  17:04 < elliott> and i will hate you even more if you do that
22:06:59  do what exactly
22:07:04  I don't recall mentioning the doing of anything.
22:07:06  become CakeProphet
22:07:10  oh.
22:07:11 -!- Ngevd has quit (Quit: Goodbye).
22:07:23  The Cake WILL APPEAR
22:07:25  elliott: so wait, now oerjan has me confused.
22:07:30  I think I numbed to "cakeprophet"
22:07:31  ...
22:07:44 -!- Kallisti has changed nick to kallisti.
22:07:47  much better
22:07:47  yes good
22:07:57  or was Kallisti better
22:08:04  no.
22:08:07  ok
22:08:20  one of these days my nick history database will overflow and everyone i don't recognize will be banned.
22:08:34  /nick poop
22:08:54  I've changed my name twice (or thrice, if you count my temporary name after I decided I didn't want my first name but before I decided on my second)
22:09:07  I don't think I joined here before I had settled on monqy though
22:09:20  monqy: what were your namnesemz
22:09:22  z
22:09:23  zzzzzzzzzzzzzzzz
22:09:27 * elliott slep in chanel
22:09:33  the one before monqy was monky
22:09:40  and before that money?
22:09:44  no
22:09:44  money to monqy a two step process
22:10:11  i don't like talking about things that happened before monky....
22:10:14  clearly it was wonky
22:11:06 -!- kallisti has changed nick to xxkallistixx.
22:11:09  yeaaaaah this is way better
22:11:11  monqy: were you................................... "dagoth ur, mad god"
22:11:26  elliott: i doubt that.
22:11:36  i was not dagoth ur, mad god
22:11:50  unless he was doing some _really_ good trolling
22:11:52 -!- xxkallistixx has changed nick to xxk4111st1_darkb.
22:12:01  awww
22:12:03  were you: a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z, aa, ab, ac,
22:12:11  xxk4111st1_darkb: btw ur spamming #haskell
22:12:12 -!- xxk4111st1_darkb has changed nick to kallisti.
22:12:12  xxk4111st1_darkb: are you still in ##c and what else
22:12:13  with
22:12:14  nickchangse
22:12:17  aha #haskell
22:12:24  elliott: SUCH UNINTENDED CONSEQUENCES AAAAH
22:13:03  monqy: not in C
22:13:19  monqy: currently #esoteric #freelance and #haskell
22:13:23  > var $ "were you: " ++ ((`replicateM` ['a'..'z']) =<< [1..])
22:13:24    Couldn't match expected type `GHC.Types.Char'
22:13:25          against inferred type...
22:13:25  ##c missed the party
22:13:27  argh
22:13:32  oerjan: no
22:13:33  > var $ "were you: " ++ concat ((`replicateM` ['a'..'z']) =<< [1..])
22:13:35    were you: abcdefghijklmnopqrstuvwxyzaaabacadaeafagahaiajakalamanaoapaqarasa...
22:13:36  none of them
22:13:39  oops
22:13:43   monqy: were you................................... "dagoth ur, mad god" <-- playing TES I see?
22:13:48  monqy: I imagine kallisti is probably a bit more serious sounding than CakeProphet on #freelance
22:13:49  aha!
22:13:49  nope
22:13:55  oerjan: ?
22:13:59  not that anyone actually uses #freelance, but occasionally they do, and occasionally I grab their moneyz
22:14:00  ais523 help
22:14:13  is frelans any good
22:14:16  no
22:14:17  Phantom__Hoover: it won't get damaged…
22:14:24  elliott: dagoth ur is morrowind isn't it?
22:14:24  monqy: it's probably your version of hell or something.
22:14:30  :(
22:14:36  yep
22:14:39  but the new case is all painted will the paint kill it with static???
22:14:46  Vorpal: i see you have not been acquainted with our wonderful wiki friend dagoth ur
22:15:02  , mad god
22:15:06  oerjan: the only Dagoth Ur I know of is this one: http://www.uesp.net/wiki/Morrowind:Dagoth_Ur_%28god%29
22:15:06  monqy: people come on every few days asking if anyone knows PHP, Django, .NET, HTML, CSS, JS, insert-CMS-of-choice, insert-web-framework-of-choice
22:15:17  oerjan: and elliott did say mad god
22:15:18  so...
22:15:28  Vorpal: http://esolangs.org/wiki/Esme
22:15:35  Vorpal: hi what is your skyrim character
22:15:35  http://esoteric.voxelperfect.net/wiki/Hashes
22:15:51  elliott: oh I see. Well that explains it.
22:15:51  monqy: did you ever see esme
22:15:53  oh yes you did
22:15:57  kallisti: err what? Who are you?
22:15:59  i even heard esme
22:16:01  Oh, that Dagoth Ur!
22:16:02  Vorpal: I made wrinklefucker the Breton warlock knight.
22:16:08  he is now level 8! yessss
22:16:15  monqy, you have had the rite of passage.
22:16:19  kallisti: nord, mage/theif kind of mix.
22:16:23  I too was accused of being Dagoth Ur.
22:16:25  thief*
22:16:27  Vorpal: heh, nord, IMAGINE THAT
22:16:53  kallisti: well I was planning to play something else later on, when some bugs have been fixed and check if dialogue differs
22:16:57  depending on race
22:17:12  no spoilers thx
22:17:18  Phantom__Hoover: none really atm?
22:17:31  kallisti: besides I suspect my save game is BADLY bugged. Nirnroot respawns. Surely that is wrong...
22:17:46  unless they broke the lore badly in skyrim
22:17:50  Well I know there are things called Bretons, also warlocks and knights, also nirnroots?
22:17:57  Vorpal: I'm greatly enjoying the heavy armor one-handed conjuration alteration mix. I find destruction kind of boring.
22:18:30  but conjuring weapons and minions as I run around in platemail slashing things up is fun.
22:18:35  Phantom__Hoover: dude bretons are like a race, you get to select on character creation. warlock and knight would be more a description of skill set, since there are no actual classes
22:18:43  Phantom__Hoover: and nirnroots were in oblivion
22:18:50  Vorpal this is still SPOILERS
22:19:03 -!- ais523 has quit (Remote host closed the connection).
22:19:10  Phantom__Hoover: I'm NOT going to avoid oblivion spoilers. Besides no one will explain what nirnroot is in skyrim, because they seem to assume you know from oblivion :P
22:19:25  SPOILERS
22:19:25  Phantom__Hoover: just don't read the liners with spoilers then?
22:19:38  Vorpal surely even you can see why that's stupid
22:19:51  Phantom__Hoover: You wanted a reason to ignore me anyway I'm sure of...
22:20:10  No, of course not; you're interesting in a pathological way.
22:20:13  kallisti: I found sneak attack "somewhat" overpowered
22:20:48  Vorpal: I imagine the daedric armor (best heavy armor in the game) will be very fitting to my skillset since I'll be summoning dremora lords, stealing souls with conjured weapons, and whatnot
22:21:04  Vorpal: bound weapons, at least in the early levels, are pretty overpowered as they're equivalent in quality to ebony weapons.
22:21:10  or so I've read.
22:21:24  kallisti: is daedric armour heavy or light?
22:21:28  I go for light armour
22:21:28  heavy.
22:21:33  oh well, no use to me then
22:22:01  I'm going for a kind of warrior-mage tank so the heavy armor combined with enchants and armor spells will be nice.
22:22:06  also heavy armor perks.
22:22:28  I did a sneak with two single handled ebony swords (flawless quality) on a undead boss in a dungeon. Took the initial 12x hit + two normal hits to kill
22:22:36  I think that is kind of overpowered
22:22:53  yes probably.
22:23:01  kallisti: and I heard you can get up to 30x backstab bonus with perks and the right armour!
22:23:07  the game definitely isn't difficult, probably my main complaint about it.
22:23:10  which is utterly absurd
22:23:19  kallisti: try changing the difficulty slider
22:23:22  I suppose one could turn the difficult -- yes
22:23:24  I played on normal
22:23:32  whatever they called that
22:23:56  kallisti: anyway sneak won't work on dragons obviously. They tend to be perched out of reach
22:24:07  kallisti: I think I was level 38 when I last played yesterday
22:24:14  I haven't decided if I want destruction or archery for ranged. I think as far as perks go I'll go with neither as I want to focus on heavy armor conjuration and 1H initially.
22:24:38  but archery is pretty enjoyable.
22:24:48  kallisti: you kind of /need/ ranged to deal with dragons effectively. Unless you get a LOT of damage in during the brief periods they are on ground.
22:25:08  I got fairly high destruction, 73 or something I think
22:25:42  Vorpal: well I believe magic resistance includes dragon fire.
22:25:44  I think?
22:25:48  hm
22:25:57  kallisti: I think it is a shout, so not sure how that works
22:26:04  kallisti: besides there are frost dragons as well
22:26:12  hmmm
22:26:17  still I think it's all magic right?
22:26:25  kallisti: I just try to be mobile and  stay out of harms way
22:26:33  I was doing pretty well defensively with breton magic resistance + ward
22:26:38  and use amulet of talos to reduce time between my shouts
22:27:18  like slow time or  which is very useful against  because he is the  of 
22:27:33  well might not be he, could be she or it for all I know
22:27:44 -!- Jafet has quit (Ping timeout: 244 seconds).
22:27:49  anyway the plan is to be be ridiculous in defense with heavy armor and alteration (dragonskin = 80% reduction of physical damage for 30 seconds)
22:28:03  kallisti: if you progressed enough into the main quest you will know what I talk about :P
22:28:04  but I don't know to what extent armor helps against dragons.
22:28:10  I'm nearing the end of that
22:28:10  Vorpal: I doubt I have.
22:29:09  kallisti: right, no eponymous stuff yet?
22:29:31  um, no, I think?
22:29:38  kallisti: anyway I think you need 100 in smithing to craft dragon armour?
22:29:44  if it is heavy it just isn't worth it for me
22:29:52  and I doubt dragon armour could be LIGHT armour
22:29:53  daedric armor = better than dragon heavy armor
22:29:55  it just wouldn't fit
22:29:55  heavier too
22:30:04  but dragon light armr is the best light armor
22:30:10  kallisti: I use thief guild quest armour mostly
22:30:11  also there's a perk that makes equipped armor /weightless/
22:30:14  so... yeah.
22:30:20  sometimes brotherhood armour
22:30:30  some of that give 2x backstab bonus
22:30:44   also there's a perk that makes equipped armor /weightless/ <-- in heavy or light tree?
22:30:45  as far as I can tell the main benefit of light armor is the 50% stamina regen perk, also the stealth benefits.
22:30:47  or both?
22:30:50  Vorpal: both
22:30:53  right
22:31:04  well I'm a stealthy mage who recently taken to backstabbing
22:31:32  I think you could probably get better armor by getting the mage armor alteration perk if you wanted.
22:31:43  oh that yes
22:31:45  I used that
22:31:46  however, light armor works well too and has some pretty good mage gear associated with it.
22:32:04  kallisti: I enhanced the light magic armour from those quest lines.
22:32:13  err smith enhanched that is
22:32:18  not magic enhanced
22:32:29  s/enhanched/enhanced/
22:32:47  I think my character is probably going towards the path of most ridiculous defense you can possibly achieve.
22:32:49  kallisti: so which level are you?
22:32:52  8. :)
22:32:55  lol
22:32:59  I don't even own the game.
22:32:59  not playing much then
22:33:03  far from my 38
22:33:17  it's pretty easy to level from what I can tell.
22:33:27  I went from 29 to 38 over the weekend
22:33:35  I got bored at one point and just start conjuring flame atronachs and killing them and got about 3 levels.
22:33:41  heh
22:34:02  kallisti: just remember: there are still some leveled monsters. You wan't to put a lot into combat skills
22:34:11  I think dragons in particular are leveled
22:34:15  from what I have been able to tell
22:34:25  ah okay. well I've been focusing mostly on one-handed and conjuration
22:34:30  which are both offensive.
22:34:53  otherwise dragons at level 5 would not be as hard as dragons at level 38. Heck I think dragons are harder in the latter case.
22:35:03 * kallisti cannot wait to be able to summon /two/ dremora lords because one is already ridiculous enough.
22:35:07  requires more player skill
22:35:14  you can what?
22:35:19  I never been one for conjuration
22:35:21  one of the last perks in conjuration.
22:35:23  heh
22:35:26  is to be able to summon two things.
22:35:37  I would LOVE to back stab a dragon though.
22:36:29  What about retconjuration?
22:36:44  kallisti: anyway you will need to put some effort into finding shouts. Ask the greyberds about if they found any until they tell you that they haven't. There are still words to be found, but you need to do some quest line to get those.
22:36:49  Sgeo: what?
22:37:00  Sgeo: ... that was terrible
22:37:26  Vorpal: the last perk in the "bound weapons" line of conjuration makes bound weapons banish summoned and daedric enemies.
22:37:29  Vorpal: does this sound useful?
22:38:15  oh wait not daedric specifically
22:38:22  "Bound weapons will banish summoned creatures and turn raised ones"
22:38:23  kallisti: not really. I never had any issues with that since most summoned monsters I ran into so far have been elemental. Just use fireball for ice antewhatever
22:38:24  and so on
22:38:40  or skeletons
22:38:43  and they are super eason
22:38:45  easy*
22:38:48  what a weird typo
22:38:53  I imagine the main benefit would be summoned daedric things.
22:39:10  well, I have yet to see that
22:39:18 -!- derrik has quit (Quit: nites).
22:39:21  besides enemies seem kind of rubbish in their wards
22:39:38  kallisti: anyway I find sneaking much more enjoyable actually
22:39:50  sad that the custom spell making of oblivion is gone
22:40:07  100% chameleon. What a nice spell to make...
22:40:10  Vorpal: they removed /many/ spells from Oblivion to Skyrim
22:40:17  kallisti: AND the custom spell making
22:40:19  but yeah
22:40:28  kallisti: I had 100 in illusion in oblivion
22:40:30  on the plus side enchanted weapons are much better.
22:40:36  Take it to #esoteric-skyrim please.
22:40:38  kallisti: but I prefer being a make
22:40:40  mage*
22:40:47  Phantom__Hoover: stfu and ignore this discussion?
22:40:53  Phantom__Hoover: no one else is talking anyway
22:41:24  Vorpal, the same applied with Minecraft chat.
22:41:31  actually it should go in #esoteric-minecraft because that is all about non-minecraft. Such as dwarf fortress
22:41:44  by logic all game discussion should go there
22:41:48  Vorpal: I dunno I think it could possibly be useful.
22:41:54  the banishing perk
22:42:00  especially if you use bound weapons, which I do.
22:42:04  hm
22:42:22  kallisti: yeah I'm not into conjuration in any game really.
22:42:26  once you get awesome enchanted weapons the main benefit of bound weapons will be the perk that casts soul trap on anything you hit with bound weapons.
22:42:44  though there are enchanted weapons that do this as well.
22:42:58  kallisti: I enjoyed the stealth elements of Deus Ex: Human Revolution. So there we go. Skyrim with cover system should be interesting
22:43:09  I'm sure someone will mod that eventually
22:43:24 -!- zzo38 has joined.
22:43:36  Vorpal: I think they did make stealth a little more interesting than in Oblivion
22:43:41  more challenging anyway.
22:43:50  but then again, I try to sneak around in clunky heavy armor...
22:43:59  kallisti: slightly yes. Doing away with chameleon made it harder...
22:44:13  but there's muffle and invisibility which is probably very helpful.
22:44:18  kallisti: I'm glad they dropped the major/minor skill stuff
22:44:31  still I think the proper way to do leveled monsters is NOT from your level
22:44:37  rather it should compute a combat score
22:44:51  based on offensive skills and also what type of armour you have
22:44:56  Vorpal: especially considering many people just do smithing shit for a while to build levels.
22:44:59  oh and health of course
22:45:15  I think the proper way should be by counting. So that if you do too much kill same kind it is too difficult. ADOM does that but I think ADOM does it not quite enough
22:45:16  but the thing is, leveling up max in smithing at an early stage should not make the game unplayable
22:45:27 -!- Jafet has joined.
22:45:59  Vorpal: on the plus side, you'll have badass weapons. :P
22:46:17  kallisti: the score would take that into account, based on what weapons you actually have
22:46:35  honestly I like static levels for things.
22:46:46  level scaling makes the progression of an RPG entirely pointless.
22:46:53  Same goes for enchanting, or speech. Probably different type of situations should use different equations. I mean pick-pocket should obviously be taken into account in some situations, but not other ones.
22:47:08  kallisti: certainly, static levels should also exist
22:47:17  kallisti: but you really really need leveled dragons for example
22:47:23  right.
22:47:42  since you can pretty much visit them in any order, due to the game being, pretty much the sandbox of RPGs
22:47:43  except maybe for dragons that just chill in their gave with hoards of gold
22:47:48  harder dragons could have better loot.
22:47:51  gah that comma was in the wrong place
22:48:03  I enjoy games that require you to use a little discretion.
22:48:04  kallisti: "gave"?
22:48:08  grave?
22:48:10  cave...
22:48:13  oh
22:48:15  `addquote  I like category theory because when you get over how damn weird it is it's still weird.
22:48:18  732)  I like category theory because when you get over how damn weird it is it's still weird.
22:48:27  kallisti: pretty sure there are no such dragons in skyrim
22:48:33  they like to guard words though
22:48:34  Vorpal: totally should be
22:48:44  also: dragons that shapeshift into humans and have great influence over humanity.
22:48:47  I mean, think about it.
22:48:55  kallisti: I think it is better if they /don't/ conform to the stereotype
22:49:05  if you're a dragon, you probably live a long time. You might become interesting in human affairs, and obtaining vast wealth and influence.
22:49:16  you're probably also magical, and you have infinite time to learn how to do things like shapeshift.
22:49:24  kallisti: oh and I have to say becoming friends with the orc settlements was really useful. Some nice stuff to shop there.
22:49:35  Vorpal: bad person
22:49:49  kallisti: Unless you are orc you need to complete a fetch quest to be allowed in.
22:49:51  elliott: what?
22:50:27  elliott: I'm not really spoiling anything. I'm not saying anything like "it was X who did it in the Y's guild side quest line" or something like that
22:50:35  friend with orc = bad person
22:50:53  elliott: come on you can play an orc. And they are not tolkin style orcs really
22:50:53  elliott: Are you sure?
22:51:00  one mistake Skyrim made: dwarven quality weapons are not the best in the game.
22:51:09  kallisti: how is that bad?
22:51:11  also, why is dwarf not a playable race if there are dwarven weapons.
22:51:16  Vorpal: because dorfs make the best weapons.
22:51:31 -!- Guest14567 has changed nick to Slereah.
22:51:40  "Dwarven" just means "made from dwemer metal", not "made by the ancient dwarves"
22:51:46  kallisti: uh lore. See Morrowind why dwarfs died out/disappeared from our plane/disintegrated.
22:51:51  what about yotuhful dwarves
22:51:56  ytouhytful
22:51:58  yoothufl
22:52:05  kallisti: pretty sure there is in-game literature about it to...
22:52:06  too*
22:52:08  Maybe just they don't want playable dwarf in that game.
22:52:14  is it better than "cats of skyrim"
22:52:17  (no)
22:52:19  zzo38: there are reasons. It is complex lore.
22:52:22  Vorpal: sorry elder scrolls lore is boring.
22:52:39  Whatever game, they put restriction... such as, lighting things on fire is not allowed, or whatever.
22:52:59  kallisti: well basically they tried to become gods to the whole race was wiped out, save for one guy who happened to be at another plane when it happened. He shows up in Morrowind.
22:53:01  @pl-resume
22:53:06  It's not not allowed, just not implemented
22:53:13  ap id id (ap id id)
22:53:14  optimization suspended, use @pl-resume to continue.
22:53:21  kallisti: I haven't played enough Morrowind to get there, but that is what I understood from in-game books and the wiki.
22:53:32  @pl-resume
22:53:47  Plugin `pl' failed with: thread killed
22:53:58  Jafet: Then it means, for nearly any computer game, a lot of things are "just not implemented"
22:54:07  zzo: you sound surprised
22:54:08  kallisti: anyway I find Elder scrolls lore quite exiting.
22:54:21  Vorpal: I definitely think the character skill system is improved, especially making it balanced so that every skill is a viable and useful for something.
22:54:23  like jumping to -1
22:54:32  Deewiant: YOU ENDED IT
22:54:43  like archery has some neat perk that make an archer playstyle more interesting.
22:54:46  *perks
22:55:00  elliott: hit the key left of 1 (§ on my keyboard), I'm sure you can jump to -1 then.
22:55:02  Jafet: I am not surprised. It is as expected.
22:55:08  (hint: that brings up the console)
22:55:28  (you /will/ need it, there are /so/ many ways to get stuck in the terrain)
22:55:39  zzo38: for detailed world simulator see: dwarf fortress
22:56:01  kallisti: btw skyrim is larger than it seems, as you will find out when proceeding with the main quest. Ever played Shivering Isles expansion for oblivion?
22:56:10  noep
22:56:13  Vorpal: I'm not going to open the console.
22:56:14  No it doesn't show up. But something just as graphically amazing does
22:56:36  elliott: so you are going to reload an earlier save if you get stuck between a mill and a water wheel?
22:56:41  that happened to me
22:56:46  Guess I get to replay the game
22:56:50  ...
22:56:53  suuure
22:56:54  elliott: convince bay12 to give you source code access. challenge: give dorf fortress a 3D graphical frontend.
22:56:54  Anyone who keeps a backlog of saves is a poop
22:57:19  kallisti: you just mortally offended elliott
22:57:23  kallisti: I have once played dwarf fortress; a lot of character seem not playable, there seem a few other optionss missing too, and it runs very slowly. But I can see by looking at the files that comes with it that it implements a very large number of things. But even trying to do that, someone forgets something (that is for many games they try to put everything, they will always do so)
22:57:24  I believe
22:57:41  zzo38: dwarf fortress require a high end CPU
22:57:45  which iirc you don't ahve
22:57:46  have*
22:58:07  wasn't it you who had like 224 MB RAM?
22:58:12  which is absurdly small
22:58:17  His games must implement everything and run fast, of course.
22:58:33  right
22:59:01  Jafet: I am not saying it must. I am just saying that even if they are supposed to, they don't.
22:59:18  There is different game, and depending on the game is supposed to be different. That is why you can make up a different game.
22:59:39  I'm at the other end of that spectrum... i7, sandy bridge, 4 cores, 3.4 GHz, 16 GB RAM (I wouldn't call those specs absurd, upper end yes, but not absurd. I know someone with dual xeon i7 quads and 32 GB RAM, that is absurd for a desktop!)
23:00:15  Tip: most games run just as well on an i3 as an i7
23:00:23  Jafet: I do other stuff than game.
23:00:26  Jafet: That's why I use an i1.
23:00:46  shachaf is the master of optimization
23:01:00  Jafet: I do actually use this system to the fullest. I do HDR panorama photography. That requires a /lot/ of processing power to merge.
23:01:09  both RAM and CPU
23:01:21  somewhat on GPU too, due to offloading some computations to it
23:01:31  Most game developers are not masters of optimization.
23:02:05 -!- Slereah has quit (Read error: Connection reset by peer).
23:02:10  Jafet: there is that too. I can barely play Witcher 2 on ultra. I prefer to play it on ultra minus super sampling
23:02:21  all the xbawks devs use C# and XNA which is actually not good.
23:02:23  skyrim I can play on ultra as long as I don't run fraps
23:02:36  I offload computations to the BPU.
23:02:46  shachaf: B for bullshit?
23:02:56  kallisti: it works for simpler games. Just not for the really high end ones.
23:03:09  kallisti: I mean, Magicka and Bastion both use XNA. They work just fine.
23:03:17  Bastion is an awesome game btw.
23:03:24  Vorpal: magicka is written in XNA and subsequently cannot run on my laptop.
23:03:24  Vorpal: It took me about seven tries to find a letter that you could put in front of "PU" without it being an existing acronym ending in "processing unit". :-(
23:03:30  kallisti: heh.
23:03:42  shachaf: heh
23:03:51  QPU
23:03:59  elliott: Taken.
23:04:03  for what
23:04:03  shachaf: wait, I can only thing of CPU, GPU, FPU. How can that take seven tries?
23:04:07  Vorpal: meanwhile: I can play WoW, Starcraft II, and Borderlands.
23:04:08  9pu
23:04:08  quantum?
23:04:12   Plugin `pl' failed with: thread killed <-- AWW
23:04:12  @pu
23:04:12  Not enough privileges
23:04:17 * shachaf doesn't like http://en.wikipedia.org/wiki/QPU
23:04:29  my guess was right
23:04:44  my guess was the same as your guess
23:04:45  shachaf: which other ones were taken?
23:04:46  Yes.
23:04:50  But that page has no references.
23:04:55  Vorpal: monqy transitivity of is yes!
23:04:56  Let me see.
23:05:12  kallisti: what?
23:05:17  hm?
23:05:21  kallisti: grammar fail?
23:05:25  no
23:05:34  okay maybe
23:05:37  CPU GPU QPU APU PPU VPU SPU FPU NPU TPU
23:05:37  kallisti: well I couldn't parse it, but then English is not my native language.
23:05:39  At least.
23:05:41  Where grammar fails, monqy succeeds
23:05:42  Vorpal: monqy: transitivity of is, yes!
23:05:43  well APU I know what it is
23:05:49  not related to computing
23:05:51  oh wait
23:05:55  there is that APU too
23:05:57  Arithmetics
23:06:10  but there is Auxiliary Power Unit as well
23:06:16  Vorpal: monqy: transitivity of "is", yes!
23:06:17  is that better?
23:06:21  kallisti: hm okay
23:06:32  kallisti: what is the context for it?
23:06:40  18:04 < monqy> my guess was the same as your guess
23:06:48  VPU would be vector I guess
23:06:59  Vorpal: your guess was correct, THEREFORE
23:07:00  ...
23:07:03  yeah
23:07:11  right
23:07:22  it's so much more clevre now that I've explained it in detail.
23:07:40  okay CPU, GPU, APU, FPU I know. VPU and QPU I could guess at. That leaves PPU SPU NPU and TPU
23:07:52  TPU probably some trusted execution crap
23:07:59  66pu
23:08:05  hm nope
23:08:07  Vorpal: Those aren't all!
23:08:09  hellopu
23:08:12  time processor unit?
23:08:19  monqypu
23:08:29  Synergistic Processing Unit in the Sony-IBM-Toshiba cell microprocessor <-- heh?
23:08:35  XMLPU
23:08:36  oh Cell
23:08:36  ☃pu
23:08:39  right
23:08:44  shachaf: you are kidding...
23:08:50  Vorpal: Kind of.
23:08:53  It's not called by that name.
23:08:56  HARDWARE ACCELERATED XML
23:09:03  shachaf: there can't be hardware accelerated XML
23:09:06  I refuse to believe that
23:09:07  But the IBM zSeries, i I recall correctly, has support for a hardware XML coprocessor.
23:09:20  It's a regular CPU that they turn on in such a way that it only suports XML.
23:09:24  And you pay less than for a full CPU.
23:09:24  "Network Processing Unit" <-- okaaay
23:09:37  Processor Processing Unit
23:09:43  https://en.wikipedia.org/wiki/Physics_processing_unit <- hm okay
23:09:49  kallisti: nope, see link I just game
23:09:52  gave*
23:09:52  no my is better
23:09:52  gah
23:09:58  http://www-03.ibm.com/systems/z/hardware/features/zaap/
23:10:15   It's a regular CPU that they turn on in such a way that it only suports XML.
23:10:15   And you pay less than for a full CPU.
23:10:19  the crap?
23:10:54  So they can bin the ones with broken FPUs, perhaps
23:11:03  Vorpal: Apparently it does Java too.
23:11:05  XML doesn't need FDIV
23:11:07  I see
23:11:16  Jafet: java does
23:11:20 * Phantom__Hoover → sleep
23:11:21 -!- Phantom__Hoover has quit (Quit: Leaving).
23:11:32  Jafet: besides I doubt they are x86
23:11:34  I think the point is just to get you to pay more money.
23:12:09  IBM has traditionally offered such dubious "features" on their higher-end stuff.
23:12:24  heh
23:12:46  For instance, their mainframes have at various points offered upgrades up to brand-new CPUs by toggling the right switch.
23:12:55  lol
23:13:07  pikhq_: so they actually had the better CPU in it all along
23:13:11  how can that be cost effective?
23:13:21  a CPU is expensive
23:13:27  If you charge significantly over cost anyways. :)
23:13:32  well okay
23:13:53  In the mainframe market, IBM has been the sole competitor for several decades.
23:13:55  pikhq_: but surely it will make the customers disillusioned...
23:14:00  Sgeo: upleinian groopt
23:14:07  (yes these will continue to get more ridiculous)
23:14:14  kallisti: wtf was that?
23:14:17  Vorpal: The customer base still uses COBOL.
23:14:26  pikhq_: hm.
23:14:31  Vorpal: Kleinian group
23:14:37  but in updoot form
23:14:38  pikhq_: insert cobol on cogs link here
23:14:46  kallisti: no clue what updoot is
23:14:58  kallisti, you're delayed
23:15:55  well, night →
23:16:51  Sgeo: my onslaught will be unpredictable and tantalizing.
23:17:04  it will come after actual updates or at my whim.
23:17:12 -!- Slereah_ has joined.
23:17:48  I make the computer game too, including with MegaZeux. Obviously it doesn't do absolutely everything but there are many things can be unusually and is different from other computer game.
23:17:54  you will then slowly begin to question your sanity and distrust all human beings and instead regard them as scoundrels.
23:18:24  Sgeo: this is the second phase, where I reveal my dastardly plan! ah ha ha  ah ha ha.
23:20:18  Sgeo: also: updoast of groot britain.
23:29:11 -!- MDude has quit (Read error: Connection reset by peer).
23:29:11 -!- sebbu has quit (Read error: Connection reset by peer).
23:29:15 -!- MSleep has joined.
23:29:25 -!- sebbu has joined.
23:29:25 -!- sebbu has quit (Changing host).
23:29:25 -!- sebbu has joined.
23:31:30 -!- MDude has joined.
23:31:37 -!- MSleep has quit (Read error: Connection reset by peer).
23:36:10 -!- augur_ has joined.
23:36:12 -!- augur has quit (Ping timeout: 276 seconds).
23:36:50  man Egyptians have this protest shit figured out.
23:37:05  they throw the tear gas grenades back at the police.
23:40:23  Occupy could learn a thing or two.
23:43:26  elliott, kallisti arfasdfjhadate
23:44:06  ?
23:44:18  sdkasld
23:44:23  arhfpsupdart
23:44:39  why do rocrupt ur ensentes
23:45:37  `word 25
23:45:40  quel vinflumicturguerstrighaleakinvar azed bale ossars hoontarinatur harippry tia nintited fidahur asic aequolle lia finfored ronera last arplang grautlmen vics sly lee scham pauryn preting supeisperox
23:46:20  vinflumicturguerstrighaleakinvar
23:46:41  harippry is good though
23:46:49  aequolle too
23:47:00  grautlmen
23:48:01  ow pepper hot
23:48:14  mmm pain tastes good.
23:49:17  grautlmen sounds like something the TF2 spy might say
23:52:21  my reversible graph language sounds like a large memory leak.
23:56:49  not reversible enough, then
23:57:06  actually I'm not sure that it will be a "graph language" but its memory layout will be represented by a graph.
23:59:36  oerjan: I'm not sure what you mean. :P

2011-11-22:

00:00:54  I guess it would make sense that you could delete all data prior to an execution step if you decide to jump back to a particualar execution step
00:01:20  however, I was thinking that it would be nice if you could then move forward from there if you wanted.
00:03:42  well, i mean that a real reversible implementation would physically deconstruct the original data when constructing the new
00:05:08  oerjan: doesn't that still imply some sort of incurring memory overhead?
00:05:18  in the "constructing the new part"
00:05:47  well yes, but you only use the memory for your current data structure at any time...
00:06:04  oh, well, yes that's how this would works, kind of.
00:06:07  well, no not realy.
00:06:13  but it's the same thing :P
00:06:35  there is a notion of "current data" within a larger graph data structure.
00:07:12  by "current data" i mean all of your current state, of course
00:07:27  it may end up being a tree and not a cyclic graph.
00:07:34  not sure.
00:08:02  depends on whether or not a node can have more than one ancestor edge.
00:08:45  but I really don't know how "reverse this value" would look like if you have possibly two or more ancestors. nondeterminism I guess?
00:09:26  the wiki spam is really out of hand
00:09:58  oerjan: linear lisp to the rescue
00:10:19  Jafet: linear logic was in my mind
00:11:26  kallisti: http://www.pipeline.com/~hbaker1/LinearLisp.html
00:13:44  Oh wait, that article is too dijkstraan
00:13:57  http://home.pipeline.com/~hbaker1/LQsort.html
00:15:04 -!- pikhq has joined.
00:15:12 -!- pikhq_ has quit (Ping timeout: 258 seconds).
00:17:01  Jafet: Dijkstraan is a good word.
00:19:50  Does the Haskell library have operator "bind but use first result value"?
00:20:03  I don't think so.
00:21:04  Gregor: gcc is getting STM, nee-ner nee-ner
00:21:27  What I mean is     Monad m => m a -> (a -> m b) -> m a;    What ought its symbol be, and how much would it be used?
00:22:24  elliott: I saw that >_>
00:22:40  elliott: My friend across the way told me this, while we both mocked how terrible that is.
00:22:58  Gregor: Since it's C, I'll agree with the mocking :P
00:23:08  Gregor: BUT I'M ISSUING A WARNING
00:23:17  __transaction_atomic is definitely the best keyword.
00:23:20  zzo38: <<= :P
00:23:33  Gregor: Ooh, neat, the isolation is only from other transactions.
00:23:44  kallisti: That is for comonads
00:23:49  zzo38: =>> ?
00:23:49  Gregor: So as soon as you access one of these outside of a __transaction_atomic all your guarantees go out the window.
00:24:02  kallisti: That is also for comonads it is <<= with arguments flipped
00:24:03  zzo38: <>>=? (more :P)
00:24:26  I suppose <>>= can do
00:24:32  @djini
00:24:33  Cannot parse command
00:24:37  elliott: How insanely C-like.
00:26:44  @djini (Monad m) => m a -> (a -> m b) -> m a
00:26:44  @djinn
00:26:44  @djinn (Monad m) => m a -> (a -> m b) -> m a
00:26:44  @list
00:26:44  f a _ = a
00:26:45  Cannot parse command
00:26:45  f a _ = a
00:26:45  http://code.haskell.org/lambdabot/COMMANDS
00:26:45  @help
00:26:45  > 1 + 1
00:26:45  help . Ask for help for . Try 'list' for all commands
00:26:47    2
00:27:01  I'm lagging badly
00:27:56  Sgeo: no, lambdabot was
00:28:53 * Sgeo was too, the lag thingy was going haywire
00:29:12 -!- kmc has joined.
00:29:13   Gregor: Ooh, neat, the isolation is only from other transactions.   Gregor: So as soon as you access one of these outside of a __transaction_atomic all your guarantees go out the window.  // no shit?
00:29:26  kmc, not our fault!
00:29:33  Gregor: See, I'm used to decent languages, where doing that is impossible :-)
00:29:34  Sgeo: What?
00:29:55  The lambdabot slowdown.
00:29:56  elliott: Type systems are for losers.
00:30:02  Sgeo: Yeah I'm sure that's why kmc just joined.
00:30:11  Gregor: Oh, looks like "STM" is inaccurate, seems like the work is being done by a company that does hardware TM :P
00:30:14  Ugh, am I again going to have to explain that I'm not an idiot and I was trying to make a joke?
00:30:28  Sgeo: Apparently
00:30:28  elliott: Yeah, but it has a software TM.
00:30:49  elliott: It's actually "*TM", where * is filled in with what's appropriate on the current platform.
00:30:53  Yup
00:30:54  Gregor: Sortofmediumware TM
00:31:57  By the way guys, m68k sux.
00:32:35  Sucks... with GOODNESS.
00:33:14  elliott: It's so far beyond impossible to make anything m68k work in a modern system.
00:33:30  Emulation? Ha. Cross-compilation? As if.
00:33:47  Gregor: Emulation is not that hard...
00:33:57  Gregor: There are perfectly decent Mac emulators.
00:34:07  elliott: Most (read: all) do not emulate the MMU, so can only run Mac OS.
00:34:12  Neat :P
00:34:26  How often would you expect to use such an operator as I have described?
00:34:28  Could've *sworn* there were emulators that handled A/UX.
00:34:30  elliott: I wonder if you could add so many syntax gimmicks that imperative code in Haskell resembled other imperative code.
00:34:35  Gregor: Even Mini vMac? I say this because MINI VMAC'S BUILD SYSTEM IS CLASSIC MAC OS-ONLY AND I CANNOT BELIEVE THIS
00:34:37  pikhq: I'm yet to find one.
00:34:44  but operated with monads and type safety underneath.
00:34:55  "How to build the Mini vMac program from the source code.
00:34:55  First download the source code archive from the download page, a file with the name “minivmac-3.1.3.src.zip”. Extract from this zip file a disk image (named “minivmac-3.1.3.src.dsk”).
00:34:56  Now launch Mini vMac (version 3.0.0 or later), booting from a disk image containing a system folder. (The source code disk image doesn't contain a system folder.) (See the Start page for information about getting started with Mini vMac.)
00:34:56  Mount the source code disk image in Mini vMac. At the top level of this disk is an application named "Build". Launch this application. A text editing window will open in which to type in the desired options."
00:34:59  Gregor: LOOK AT THIS!!!!
00:35:08  Gregor: "If this option is used by itself, the build system will generate the files needed to compile the standard version of Mini vMac for Macintosh OS X on Intel using Apple's Xcode 2.4.1 development environment."
00:35:42  lol
00:35:44  kallisti: In my opinion, there ought to be macros, that allow you to implement such things as that, but it ought not be a part of standard Haskell.
00:36:01  kallisti: It does.
00:36:12  kallisti: If you do everything in IO with do notation, Haskell looks just like Python.
00:36:23  well, not quite.
00:36:30  Gregor: Shame, it'd be really neat to (ab)use X to have a DOS/UNIX/Mac OS setup.
00:36:32  It really does.
00:36:33  I don't think so. Even if you use layout it won't be like Python.
00:36:34  assuming you're using mutable refs.
00:36:41  you need the newBlahRef stuff
00:36:44  and readBlahRef stuff
00:37:06  kallisti: (=:) = writeIORef
00:37:10  kallisti: var = newIORef
00:37:20  @hoogle ($$)
00:37:20  Text.PrettyPrint.HughesPJ ($$) :: Doc -> Doc -> Doc
00:37:20  Text.PrettyPrint ($$) :: Doc -> Doc -> Doc
00:37:20  Language.Haskell.TH.PprLib ($$) :: Doc -> Doc -> Doc
00:37:25  ($$) = readIORef
00:37:26  :P
00:37:35  kallisti: (^) = readIORef -- needs GHC extension so you can use it postfix
00:37:44  (like (a^), not a^, unfortunately)
00:37:59  kallisti: But anyway, yes:
00:38:08  kallisti: http://augustss.blogspot.com/2011/07/impredicative-polymorphism-use-case-in.html
00:38:11  pikhq: I just want one more arch so I can say my JIT supports a dozen archs.
00:38:52  Which dozen?
00:39:10  elliott: I'm cheating by e.g. calling x86 and x86_64 distinct, and powerpc and powerpc64 distinct :P
00:39:30  Gregor: Is the version on bitbucket the new JIT style?
00:39:37  Doesn't look like it, but...
00:39:46  elliott: It's in a branch.
00:39:47  elliott: I wonder what the def $: bit is
00:39:53  Gregor: Which one :P
00:40:09  elliott: Innit obvious?
00:40:26  Gregor: What the fuck is funcelision? Ohh, func elision
00:40:29  What's recordconditional :P
00:40:42  Those two branches are things that didn't work, but could have :)
00:40:51  Gregor: I wouldn't consider the x86/x86_64 bit a cheat.
00:40:55  Gregor: Is recordconditional just doing if (compiling) record(...)?
00:41:03  elliott: Yuh.
00:41:11  x86_64 really *is* distinct from x86 in many rather important ways.
00:41:32  Gregor: Why didn't that work?
00:41:45  elliott: It would arrange the jumps in a shitty way :(
00:41:49  PPC64, though? Total cheat.
00:41:59  elliott: Worked on x86[_64], but broke a bunch of other stuff.
00:43:25  elliott: I'm guessing $: is just another $ but with different precedence or something?
00:43:35  pikhq: HEY THEY'RE DIFFERENTish
00:43:47  pikhq: How 'bout ARM/thumb :P
00:44:40  kallisti: I imagine ($) is used for something else.
00:45:46  also def
00:45:51  what does that do even?
00:48:44  ask him
00:49:32  pikhq: Whoops, doesn't work with thumb X-D
00:49:52  More like DUMB.
00:53:11  Aha, thumb uses a different branch instruction to go into normal ARM code than it does to go into thumb code, and by default when you call a function pointer it goes to ARM.
00:53:13  So, boink.
00:54:22  monqy: http://www.haskell.org/haskellwiki/Jobs  thriving Haskell job economy.
00:54:34  monqy: http://www.haskellers.com/jobs
00:54:40  "there are no active job listings"
00:55:28  Haskell should be in the Esoteric list of languages
00:55:45  that are Esoteric
00:55:57  !help languages
00:55:58  ​languages: Esoteric: 1l 2l adjust asm axo bch befunge befunge98 bf bf8 bf16 bf32 boolfuck cintercal clcintercal dimensifuck glass glypho haskell kipple lambda lazyk linguine malbolge pbrain perl qbf rail rhotor sadol sceql trigger udage01 underload unlambda whirl. Competitive: bfjoust fyb. Other: asm c cxx forth sh.
00:55:59  monqy: http://functionaljobs.com/  there are four here, none of which are Haskell.
00:56:30  Who are the Others ?
00:56:42  kallisti: http://www.tsurucapital.com/en/jobs.html
00:56:48  (Languages)
00:57:18  "You are often referred to as a machine, executing quickly and smartly, while challenging yourself and your colleagues."
00:57:23  I wonder if they got any actual robot applicants
00:57:33  kallisti: http://corp.galois.com/careers/
00:57:49  JLP quote ?
00:58:07  elliott: nice pay
00:58:16  are we throwing Star-Trek quotes yet ?
00:58:57  "live long and prosper" -gandalf of the uss voyager
00:59:16  elliott: Insufficient trollery, same franchise used twice.
00:59:30  "Live long and prosper." - Gandalf, Lord of the Sith
00:59:56  Gregor: It's funny because you're trolling people by implying that Voyager is part of the Star Trek franchise.
01:00:12 -!- pkzip has quit (Quit: Leaving.).
01:01:45  kallisti: http://cufp.org/jobs/senior-architect-leading-investment-bank-f-net has legacy code written in haskell!
01:02:10  elliott: now I just need to convince them that I know F#!
01:03:55  Sgeo: upstadter's dooterfly
01:07:42  In April 2009, when told about his Wikipedia article, he commented, "[It] is filled with inaccuracies, and it kind of depresses me." When asked why he didn't correct it, he replied, "The next day someone will fix it back."[25] (In Aug. 2011 Hofstadter said he is happy with the article and the only inaccurate part of his Wikipedia entry was the previous sentence because the inaccuracies were subsequently fixed.[citation need
01:07:50  ed])
01:08:00  classic Hofstadter
01:08:37  also unverified
01:11:22  elliott: It's funny because you're implying that Star Trek didn't end with DS9.
01:12:06  elliott: pikhq: Gregor: you're all implying that people care about Star Trek
01:12:16  which I find greatly amusing.
01:12:23  kallisti: We do.
01:13:05  a vacuous implication: you do not exist, therefore the premise is false.
01:13:24  Also, TNG was pretty damned popular when it aired...
01:13:39  subsequently everyone realized Star Trek is lame.
01:13:59 * kallisti hater
01:15:06  in the 70's VW Beetle, the windshield-wiper fluid dispenser was powered by the air pressure in the spare tire in the trunk.
01:15:08  .....
01:15:14  Yup!
01:15:21  that's insane.
01:15:41  The car was designed around being cheap.
01:16:17  also: not having full spare tires
01:16:37  It also had an air-cooled engine.
01:16:40  granted most spare tires have higher air pressure than normal tires because people typically don't refill them.
01:16:51  pikhq: well, most engines are "air-cooled" in some sense.
01:16:59  so basically you're saying "it has no cooling system"
01:17:25  "Air-cooling" refers to a "cooling" system based exclusively around the flow of air.
01:17:43  wow. tell me more. :P
01:17:54  What I mean is "you're a fucking moron".
01:19:18  it's sort of a cooling system I guess.
01:21:20  but even in an engine with a broken liquid-cooling system and without a specifically design air-cooling system, the engine is still cooled significantly by airflow
01:21:35  to the point that you can drive a car with a broken radiator as long as you're going somewhat fast.
01:21:44  and don't stop or slow down very much.
01:22:40  Or live in a particularly cold area.
01:23:51 -!- MSleep has joined.
01:24:08  a "car person" I'm friends with tried to tell me that the liquid-cooling system of a car is not comparable to a computer cooling system.
01:24:12  because in the case of a car
01:24:17  it's "bringing cold in"
01:24:28  whereas in a computer it's "taking hot out"
01:24:28  which is why people don't liquid-cool computers
01:24:31  with the exact same methods
01:24:40  oh wait
01:24:45  ...he's stupid. :P
01:25:13 -!- copumpkin has quit (Quit: Computer has gone to sleep.).
01:25:22  it's very similar, cars just have more heat to deal with.
01:25:38  Bringing cold in
01:25:43  ....yeah
01:26:07  Jafet: kind of like how refrigerators "make cold"
01:26:14  you know, it's different.
01:26:17  Because cold is a real thing! :P
01:27:26 -!- MDude has quit (Ping timeout: 248 seconds).
01:27:43  I'm kind of baffled that cars have radiator fans.
01:27:58  considering that they typically have a huge volume of airflow passing through the radiator.
01:28:06  I suppose the fans are there for when the car is moving slowly.
01:28:09  Not when idling, I guess?
01:28:12  right.
01:28:14 -!- MDude has joined.
01:28:18  Though, when idling your engine's not going to be very hot.
01:28:26  well, relatively
01:28:30  but it still needs cooling
01:28:37  Heat is always relative, anyways. :P
01:29:02 -!- MSleep has quit (Ping timeout: 248 seconds).
01:30:21  there's a lot that goes into making an internal combution not destroy itself and everything it's connected to.
01:30:47  or rather, to limit that destruction to something more manageable and slowly developing.
01:31:01  *internal combustion engine
01:31:56  Yeah, something that functions by rapid controlled explosions is a bit hard to engineer. :P
01:32:37 -!- MDude has quit (Read error: Connection reset by peer).
01:32:54 -!- MSleep has joined.
01:34:23  In the UK (but applying only to England), the Road Traffic (Vehicle Emissions) (Fixed Penalty) Regulations 2002 (Statutory Instrument 2002 No. 1808)[14] introduced the concept of a "stationary idling offence". This means that a driver can be ordered "by an authorised person ... upon production of evidence of his authorisation, require him to stop the running of the engine of that vehicle" and a "person who fails to comply .
01:34:30 -!- MSleep has quit (Read error: Connection reset by peer).
01:34:37  ... shall be guilty of an offence and be  liable on summary conviction to a fine not exceeding level 3  on the standard scale"
01:34:49 -!- MSleep has joined.
01:35:20  you there, sir! either stop wasting that meager amount of fuel, or expend vastly larger quantities moving somewhere this instant!
01:38:46 * kallisti imagines someone evading the police after being ordered to stop idling.
01:47:30  kallisti: it's illegal to idle a car unnecessarily in norway as well
01:49:52 -!- pikhq has quit (Ping timeout: 245 seconds).
01:49:59 -!- pikhq has joined.
01:50:49 -!- copumpkin has joined.
01:50:49 -!- copumpkin has quit (Changing host).
01:50:49 -!- copumpkin has joined.
01:51:23  in or close to settlements
01:52:23  both noise and pollution are listed as reasons
01:52:25  hi oerjan
01:52:27  http://en.wikipedia.org/wiki/Wankel_engine
01:52:33  this is a cool fucking thing.
01:53:07  (uk people may consider "close to settlements" to be redundant *MWAHAHAHA*)
01:54:09  and hi
01:54:40  the only problem is there's no way to really balance the fuel/air mixture, so you get basically equivalent fuel efficiency for comparable power.
01:55:02  so there's not really any benefit other than more power (still at the expense of an equal amount of fuel efficiency)
01:55:59  oerjan: very impolite!!!!!! we have lots of hills and farms
01:56:07  but you could make like... a 3L 4-rotor engine and get the same power as a really really big piston engine.
01:56:45  elliott: O KAY
01:57:45  the Mazda RX-8 for example gets 232 horsepower from 1.3 litres of displacement from 2 rotors.
01:58:24  the engine in my car gets 200 horsepower from  3.1 litres of displacement from 6 pistons
01:58:35  this is a big difference in size and complexity.
01:59:19  150 horses, 40 camels and 1 orangutang
02:00:46  kallisti: http://www.haskell.org/pipermail/haskell/2011-November/023072.html
02:02:58  elliott: neat.
02:03:05  top of /r/haskell
02:03:07  see, this is the kind of stuff I want to do.
02:03:33  it doesn't necessarily have to be Haskell.
02:03:41  I just don't want to write /boring/ software
02:03:54  at least for the entire extent of my career.
02:04:00 * kallisti will concede a few years.
02:04:33  should have thought of that before going into programming.
02:06:12  also, note that: despite the similarities in engine power between my car and the Mazda RX-8, the power-to-weight ratio is completely different.
02:06:44  as the Mazda is about 1800 kgs lighter.
02:08:18  I wonder if I can take anything out of my car to make it lighter.
02:08:31  maybe if I remove the entire body.
02:08:35  yes that's a good idea.
02:08:50  cars are not a good place to hide bodies anyway
02:09:01  no one actually needs those big heavy doors .
02:09:05  it's just slowing them down and wasting fuel.
02:09:16  kallisti: aerodynamics
02:09:54  oerjan: if my cabin is a open frame with seats I'll have wicked awesome aerodynamics. :P
02:10:36  if by "wicked awesome" you mean "violent but inefficient", i guess
02:12:36  eh, my car will just intake so much oxygen that it creates a localized vacuum.
02:12:39 * kallisti sound physics
02:12:50  ok
02:13:14  anyway you look way cooler when you're driving in a spacesuit.
02:14:27  see: stig
02:15:05 * kallisti considers actually donating $10 to Wikipedia
02:15:14  elliott: excellent example.
02:15:27 -!- Darth_Cliche has joined.
02:16:05 * kallisti imagines an engine powerful enough to suck all of the atmosphere off of the Earth.
02:16:23 * kallisti begins planning his doomsday device.
02:19:28  maybe I should expand this proposal to unix-like systems.
02:20:25  yeah they need a lot of air cooling
02:21:18  heh
02:22:08 * kallisti is prone to turbulent subject change.
02:22:27  also: Worcestershire sauce is deliciously applicable to anything that tastes savory.
02:23:18  you don't know what that is youre not englsijh
02:24:45  elliott: sure I do.
02:24:51  bad preson
02:25:12  the Lea and Perrins recipe used in the states is ALMOST the same as the one in great brittania
02:25:46  "almost"
02:26:02  as in it only changes the kind of vinegar and is pretty much exactly the same otherwise.
02:26:25  WHAT NOW?
02:26:45  http://en.wikipedia.org/wiki/Usage_share_of_operating_systems   "Median[original research?]"
02:26:53  statistical calculations = original research
02:27:19  kallisti: yeah to worse vinegar
02:27:41  White instead of malt.
02:29:13  Did someone say vinegar?
02:29:17  I like vinegar.
02:29:20  wow, JBethJenkinsj has spammed their user page twice :(
02:29:23  twice!!!
02:29:23  I like balsamic vinegar in particular.
02:29:32  shachaf: Good person.
02:29:47  Balsamic vinegar is probably the best substance one can consume.
02:30:01 * elliott sips his bottle of balsamic vinegar.
02:30:14  elliott: I've been known to do that.
02:30:18  (In small quantities.)
02:30:30  If you look up my name on the Google, you find an "Executive Profile" which mentions how I like balsamic vinegar.
02:30:34  I wish I could get rid of that.
02:30:48  just sue them
02:30:51  I was about to complain, but then I realised I've sipped small quantities of vanilla essence before.
02:30:54 * oerjan good advice
02:32:06  I like how no one makes Windows supercomputers.
02:33:17 -!- DCliche has joined.
02:35:06  what's a good application for chart-making?
02:35:42  business meetings
02:36:06  *what's a good software application that creates charts.
02:36:24  picky, picky
02:36:28 -!- Darth_Cliche has quit (Ping timeout: 240 seconds).
02:37:22 -!- MSleep has changed nick to MDude.
02:37:36  thank you randall munroe for overruling my browser's decision on how to view large pictures.  i think i shall read something else.
02:38:24  oerjan: what decision is that
02:38:37  oh, with a zoom thing
02:38:48  oerjan: i think that's reasonable since it's a very zoom ui type thing, and most browsers only offer one level of zoom...
02:38:52  oerjan: sh, you just made xkcd's hits go up.
02:38:56  and it's awkward to move around in 2d with them
02:39:23  oerjan, do you make the same complaint about google maps?
02:39:53  no, because they actually change the data displayed
02:40:28  oerjan: I'd rather they just gave me one bitmap and let me zoom myself.
02:40:32  oerjan: holy crap this is an awesome chart but I have no idea how to go about reading it.
02:40:34  Makes a lot more sense.
02:41:47 * elliott would think oerjan were reasonable if browsers actually had any kind of sane image navigation/zooming ui.
02:41:48  they don't
02:42:21  this chart must be why xkcd has been so shitty.
02:42:31  Randall's been compiling sources for this thing.
02:42:33  ok maybe what mostly irritates me is that it doesn't actually fill my browser window
02:43:02  oh also it steals history
02:43:11  dammit now i'm going to have to actually look at it anyhow
02:43:43 * oerjan finds the maximize button XD
02:45:19  kallisti: first they complain that they can't bookmark it, then you let them bookmark it and they complain it fills history...
02:51:48  has anyone ever been a bee
02:52:09  elliott: probably.
02:52:15  elliott: I mean, not in reality.
02:52:42  but it's probable someone has had a weird dream or ingested a large quantity of hallucinogens and felt like a bee.
02:52:52  sigh. you're so unhelpful
02:53:07 * quintopia steals the sacred chao
02:53:25  elliott: were you expecting a legitimate answer?
02:53:32  OBVIOSUYL quintopia ;Q;Q;Q;Q;Q;
02:53:54  elliott: did you want it?
02:54:14  i am willing to sell to a good home at a reasonable price
02:54:16  q q q q q qq q q q q q q q q q hi i wasnt intending to ping the quintopia but i pressed q and tab and the quintopia popped up
02:54:18  thems the breaks,
02:54:25  the breaks thatm ben broken
02:54:35  you sound sleepy
02:54:39  want a beer?
02:56:28  im not sleepy i just act like this sometimes
02:56:33  usually when sleepy admittedly
03:14:59 -!- Madoka-Kaname has quit (Ping timeout: 258 seconds).
03:23:23 -!- DCliche has quit (Quit: You are now graced with my absence.).
03:29:00  elliott: hi
03:29:05  hi
03:29:07  what are you doing?
03:29:17  typing a reply to kallisti on irc
03:29:27  hitting enter
03:29:33  typing another line and hitting enter again
03:29:34  help
03:29:59  elliott: what are you doing in the more long-term interpretation that most people would interpret.
03:30:14  dying, very slowly
03:30:24  like...
03:30:25  do you want a helpful answer
03:30:29  progressive present tense
03:30:33  ongoing actions
03:30:36  in the present
03:30:41  aside from dying
03:31:06  very little
03:31:12  elliott: I WILL NOT GIVE UP UNTIL YOU ANSWER NORMALLy -- oh okay
03:31:14  i am idly ``surfing the net'' while idly ``waiting for someone tos ay something interesting''
03:31:21  *tosa y
03:31:25  elliott: hey me too!
03:31:27  in fact
03:31:32  not only did I look at that xkcd map thing
03:31:35  but I went to xkcdsucks
03:31:37  which is probably
03:31:40  the biggest waste of time ever.
03:32:02  xkcdsucks got so crappy
03:32:08  I thought it was always that way
03:32:14  maybe I wasn't there for the Golden Age.
03:32:17  it used to be a bit less so
03:32:46  elliott: one thing you can say: they are very persistent.
03:32:56  dedicated to the job.
03:33:05  of critisizing xkcd however horribly.
03:33:18  "i was going to warn people that this is actually a brand-new comic that just visually resembles the last comic a lot, but then i figured, huh, PROBABLY my readers are used to that by now" --Dinosaur Comics caption
03:33:34  kallisti: actually a different guy writes it nowadays.
03:33:36  (he's annoying)
03:33:42  (even more annoying than the last guy)
03:33:49  I thought there were multiple writers.
03:33:54  are
03:34:00  er
03:34:01  not
03:34:03  are
03:34:04  were
03:34:05  help english
03:34:07  there were guest posts. dunno how frequent they are nowadays
03:34:12  because i don't: read it
03:34:13  ^stylr
03:34:14  ^style
03:34:15  Available: agora alice c64 ct darwin discworld europarl ff7 fisher fungot homestuck ic irc iwcs jargon lovecraft nethack pa qwantz* sms speeches ss wp youtube
03:34:19  fungot: exposit
03:34:20  elliott: have i, perhaps, a hint, utahraptor!
03:34:23  elliott: wow amazing
03:34:24  fungot: have you?
03:34:24  elliott: a " pg-13" picto-story
03:34:29  fungot: the best rating for a picto-story!
03:34:35  ????
03:34:36  fungot: hi
03:34:38  kallisti: TALK TO FUNGOT
03:34:40  fungot: CONTINUATION
03:34:40  kallisti: as a man concerned, t-rex, that going shopping was your default activity?' then tony and louisa q were two people in love! romantic love, but there's a rude jerk, and then they both said the next few days were going to me, the omniscient. the dude has to sleep! superman could laser him from orbit while he's having nappy times! enter only if you have a valid passport to dreamland!"
03:35:05  fungot: ZYGOHISTOMORPHIC PREPROMORPHISM
03:35:05  oerjan: here, i'll prove it, too, will take what i can get a little of that back with them, dromiceiomimus for a perfectly awesome introductory phrase that is forbidden to me unless i had married at that age myself...hmm...
03:35:07  this style is the best.
03:35:16  ah yes
03:35:19  those hidden phrases
03:35:23  only attainable by self-marriage
03:35:54  what is qwantz
03:36:33  hm, my intuition says that in "at that age myself" "myself" cannot be an ordinary object
03:37:42  Oh, kallisti is CakeProphet.
03:37:46 * shachaf is disappointed.
03:37:47  yes.
03:37:50  lol
03:37:52  I thought we had some new blood.
03:38:01  shachaf: YOU ARE DISAPPOINTED BECAUSE IT IS ME????
03:38:06 * kallisti cries
03:38:34  kallisti: http://qwantz.com/
03:38:46  ^style qwantz
03:38:46  Selected style: qwantz (Dinosaur Comics transcriptions 2003-2011)
03:38:48  oh.
03:39:20  fungot: Gimme some double exclamation marks!!
03:39:20  shachaf: are you a person who uses phrases at incorrect times? but then what's more likely: that we're the only ones for cows would say, hello t-rex, what is the deal"
03:39:23  fungot: Gimme some double exclamation marks!!
03:39:23  shachaf: you all suck! friends again at breakfast, you, t-rex. i'll bring some vegetables and i'll show you!
03:39:25  fungot: Gimme some double exclamation marks!!
03:39:25  shachaf: you must have had crazy dreams last night and hey, look, this was their word of the day last week, i will now share this secret. this is one secret, no more!
03:39:28  Useless.
03:39:33  Dinosaur comics are boring.
03:39:57  $ xzgrep -c '!' qwantz.xz
03:39:57  13503
03:39:57  $ xzgrep -c '!!' qwantz.xz
03:39:57  866
03:40:05  shachaf: Dinosaur Comics also feature double exclamation marks only infrequently!
03:40:08  `learn kallisti is a former prophet swearing off his pastry deity
03:40:10  I knew that.
03:40:15  elliott: Wait, really?
03:40:24  elliott: Oh, right, it's just single exclamation marks.
03:40:25  Or triple?
03:40:28  I don't remember.
03:40:32  shachaf: That pattern matches triple, too.
03:41:16  shachaf: You heard it here first: Only 6.41% of Dinosaur Comics lines with an exclamation mark feature more than one exclamation mark in a row.
03:42:21  shocking
03:42:44  dinosaur comics r stil dum lol
03:43:04  elliott: where is a website i can upload a small binary file without using flash?
03:43:21  why is flash relevant
03:43:35  shachaf: almost as dumb as you (are for not liking (dinosaur comics))
03:43:40  flash upload is broken on android
03:44:25  quintopia: how small are we talking?
03:44:42  oh less than a gig. not sure exactly.
03:44:50  quintopia: try sprung
03:44:51  e
03:44:59  quintopia: less than a gig?
03:45:03  small is < 5 megs
03:45:05  lemme get exact
03:45:25  69.5
03:45:26  M
03:45:32  that's so not small.
03:45:38  i think small is less than 100M
03:45:42  you're wrong
03:45:45  anyway, filebin would have worked
03:45:48  or was it limited to 50 megabytes
03:45:48  since capacitites and speeds have gone up
03:45:52  quintopia: dropbox?
03:45:53  elliott: I heard you're in Northumberland.
03:46:09  shachaf: Nah, Land's End. Also that place at the top of Scotland?
03:46:11  England is a torus.
03:46:14  Erm.
03:46:15  Britain.
03:46:32  I don't know what these words are.
03:46:36  What place at the top of Scotland?
03:47:54  elliott: Land's End is totally not Northumberland! Which one is you?
03:48:08  dropbox is an application, not a website. can visit website. cannot install application.
03:48:16  quintopia: cool! you're wrong.
03:48:37  is there a upload link on their website that i'm missing?
03:48:40  i just checked
03:48:41  Your phone can't run rsync?
03:48:45  did you make an account first?
03:48:51  there's a fancy "log in" link.
03:48:57  ew registration
03:49:16  man I gotta upload this relatively big file and it's important enough to ask on irc for ~5 minutes but a username, password and email??
03:49:17  TOO FAR.
03:49:44  quintopia: actually wait
03:49:47  you should let me invite you
03:49:52  so that I can increase my cap
03:49:53  :)
03:50:04  Dropbox is evil.
03:50:26  oh they do have a basic uploader
03:50:29  shachaf: Are we talking, like, Cthulhu evil?
03:50:31  but they also crash browser
03:50:32  hmmm
03:50:33 * kallisti is at a fierce 4.9 GBs thanks to invites.
03:51:05  hmmm, wait!
03:51:10  I could invite all of my other emails.
03:51:11  elliott: Like, read :: Read a => String -> a evil.
03:51:24  shachaf: read isn't /that/ evil.
03:51:28  yep
03:51:30  Hmm.
03:51:33  dropbox crashes browser
03:51:35  kallisti: I did that.
03:51:36  other sggests?
03:51:37  i'a i'a dropbox
03:51:40  quintopia: what's your email?
03:51:41  also what?
03:51:43  why?
03:51:43  kallisti: It doesn't take effect until the other email invites, IIRC.
03:51:44  how?
03:51:49  So it's a real pain.
03:51:53  elliott: TOTALLY WORTH IT
03:51:54  I did it anyway though, 'cuz I was bored.
03:51:59 * elliott doesn't use dropbox.
03:52:03  i dont know why
03:52:06  elliott: read isn't as evil as Dropbox?
03:52:07  I agree.
03:52:14  elliott: I basically use my Public folder to link people screenshots and other random stuff
03:52:18  Dropbox does GPL violations and all sorts of things.
03:52:21  It's true.
03:52:22  and occasionally LEGALLY SHARE NON-COPYRIGHT MATERIAL
03:52:35  shachaf: Hmm, got a link?
03:52:40 * elliott goggles dropbox gpl.
03:52:49 * elliott sees nothing about violations.
03:52:55 * elliott adds "violations".
03:53:13 -!- MDude has quit (Read error: Connection reset by peer).
03:53:14 * elliott only finds http://lists.debian.org/debian-mentors/2011/02/msg00367.html without context.
03:53:21  elliott: what if there was some horrible irc client plugin that sent a message about every google query you made.
03:53:24  unsafeViolateCopyright :: DropBox -> a
03:53:34  kallisti: I wouldn't install it.
03:53:52  what if it were mandatory as part of the IRC protocol?
03:53:54  IMAGINE THAT UNIVERSE
03:54:23  kallisti: there's probably an mirc plugin for that
03:54:27 -!- pikhq has quit (Ping timeout: 245 seconds).
03:54:29 -!- pikhq_ has joined.
03:54:40 * elliott googled for: hot goats in sweaters
03:54:45 * elliott googled for: hot goats in sweaters 2
03:54:52 * elliott googled for: lukewarm goats in sweaters???
03:54:57 * elliott googled for: goats. just goats. work with me here
03:55:05 * elliott googled for: what is the species name for goat
03:55:12 * elliott googled for: capras. any capras!
03:55:13  capra something
03:55:20 * elliott googled for: capra aegagagrus hircus
03:55:22 * elliott googled for: wow fuck you
03:55:28 * elliott googled for: how to uninstall irc
03:55:31 * elliott googled for: how to uninstall irc google
03:55:38 * elliott googled for: this is so embarrassing
03:55:56 * elliott googled for: goat porn
03:55:59 * oerjan googled for: how to ban elliott
03:56:07 * elliott googled for: bing
03:56:11 * elliott googled for: yahoo search
03:56:14 * kallisti googled for: fungus applications
03:56:22 * elliott binged for: does bing send irc messages
03:56:30 * elliott yahooed for: does yahoo send irc messages
03:56:39 * elliott altavistaed for: google alternatives
03:57:04 * kallisti googled for: XNA
03:57:13 * kallisti googled for: skyrim muffle
03:57:21 * elliott googled for: naked atheists on bikes
03:57:32 * elliott googled for: isaac asimov secret furry
03:57:41 * kallisti googled for: irc cakeprophet
03:57:43  oh god.
03:57:47 * elliott googled for: evidence for/against goat theory
03:57:52 * elliott googled for: pro/cons of goat theory
03:58:05 * kallisti googled for: psychiatrists near Jasper, GA
03:58:11 * elliott googled for: did isaac asimov have a deviantart
03:58:35 * elliott googled for: cake prophecies
03:58:35 * oerjan googled for: goats in government
03:58:48 * elliott googled for: are goats people
03:58:56 * elliott googled for: ...can goats give consent
03:59:12 * kallisti googled for: ghetto stories
03:59:18 * kallisti googled for: Egypt revolution
03:59:24 * elliott googled for: how to avoid being seen on a farm 
03:59:27 -!- Jafet has quit (Quit: Leaving.).
03:59:39 * elliott googled for: how to remove lines from irc log
03:59:45  kallisti: why jasper, ga?
03:59:49 * kallisti googled for: percentage of server programming jobs to desktop application jobs fuckhow d I word this.
03:59:53  quintopia: because that's where I live
04:00:06  wow. i'm not far from there atm
04:00:13  quintopia: oh? whereabouts?
04:00:17 * elliott googled for: are goats real
04:00:30 * oerjan googled for: bestiality in northumberland
04:00:31  i am camped out behind blood mountain in slaughter gap atm
04:00:33 * elliott googled for: goat python developers
04:00:38  quintopia: whut
04:00:53 * kallisti googled for: why you should learn linux
04:01:01 * elliott googled for: @ download
04:01:07 * elliott googled for: "@ download" FUCK YOU STUPID PIECE OF SHIT
04:01:08  quintopia: I'm pretty sure you're just making shit up.
04:01:32 -!- MSleep has joined.
04:01:35 -!- MSleep has changed nick to MDude.
04:01:35 * elliott googled for: "kallisti" prophet or hoax
04:01:39 * elliott googled for: "kallisti" cakes
04:01:44 * kallisti googled for: define:syzygy
04:01:54 -!- Jafet has joined.
04:02:07 * elliott googled for: what do i do if a lawyer calls me on the telephone and talks in a spooky voice but then i realise im not holding my telephone and i get teleported to hell??
04:02:24 * elliott googled for: is toe-plucking fatal
04:02:35  kallisti: between suches and blairsville i guess
04:02:45 * kallisti googled for: help what do I do if I'm  bleeding
04:02:50 * elliott googled for: is toe-plucking REALLY fatal
04:02:56  WHAT NO 911 INFORMATION ON GOOGLE -files suit
04:03:03 * elliott googled for: toe-plucking therapists
04:03:04  quintopia: I've heard of the latter
04:03:08 * elliott googled for: how to stop plucking toes
04:03:18 * elliott googled for: like nicotine patches but for toes? so that you don't pluck them
04:03:19  elliott: I don't think Google supports @-substitution.
04:03:32 * kallisti googled for: suches ga
04:03:36 * elliott googled for: blackmarket used toes
04:03:40 * elliott googled for: blackmarket used toes (clean or dirty)
04:03:43 -!- Nisstyre has quit (Ping timeout: 240 seconds).
04:03:57 * elliott googled for: how to usurp oerjan site:wikihow.com
04:04:05  quintopia: not incredibly far no.
04:04:19 * elliott googled for: goat "Directory index" inurl:.avi
04:04:21 * shachaf looked up: how to /ignore in irc
04:04:41  quintopia: I could drive to suches in 23 minutes
04:04:47 * elliott googled for: how to explain to shachaf that this is at most half as annoying as I usually am
04:04:52 * oerjan googled for: should one stop biting fingers when seeing bone
04:04:52  which is probably more like 15 minutes.
04:05:12  i could walk to suches in a day
04:05:22  suches life
04:05:25  ...
04:05:26 * elliott googled for: should one stop biting fingers when there's only your lips left and you're bleeding so much
04:05:30  also yeah how do you even pronounce suches
04:06:05 * shachaf looked up: elliott
04:06:08 * shachaf looked up: elliott hird
04:06:10 * kallisti googled for: what is the emergency number for my area
04:06:17 * shachaf looked up: northumberland map
04:06:19  shachaf: In the dictionary?
04:06:29 * shachaf looked up: northumberland people search
04:06:33  Northumberland map, n. see "unchartered territory"
04:06:49 * kallisti googled for: surgical bone saw
04:06:56 * kallisti googled for: surgical scalpel
04:07:01 * shachaf looked up: land's end detectives for hire
04:07:05 * kallisti googled for: surgical tool kit sales
04:07:20  shachaf: That sounds like a really good TV show premise.
04:07:26 * kallisti googled for: battery powered bone drill
04:07:28  HE SOLVES CASES... WHERE NO OTHER DETECTIVE DARES
04:07:33 * kallisti googled for: soldering iron
04:07:40 * kallisti googled for: how to cauterize wounds
04:07:41 * oerjan googled for: diy transplantations
04:07:47 * shachaf looked up: how to lure 16 year olds
04:07:52 * elliott googled for: how to avoid calculated torture/murder by prophet
04:07:53 * shachaf looked up: elliott hird true age
04:08:04 * elliott googled for: artificial aging strategies
04:08:06 * kallisti googled for: how to clamp arteries with a hemostat
04:08:08 * elliott googled for: artificial aging pills cheap
04:08:15 * kallisti googled for: arteries in the upper arm
04:08:24 * elliott googled for: how to remove arteries (safe method)
04:08:26 * kallisti googled for: arteries in the upper leg
04:08:47 * kallisti googled for: 100 cc syringe
04:09:04 * kallisti googled for: how to get veterinary certification 
04:09:06 * shachaf looked up: why do people use brand names
04:09:11 * elliott googled for: how to disguise horse as you
04:09:18 * elliott googled for: how to become horse
04:09:18 * shachaf looked up: soviet russia
04:09:21 * elliott googled for: are horses immortal
04:09:26  o.O
04:09:29 * kallisti googled for: how to acquire tranquilizer
04:09:29 * shachaf looked up: horses vs goats
04:09:40 * oerjan googled for: kidneys for sale
04:09:49 * shachaf looked up: horse-goat hybrid
04:09:57 * elliott googled for: how to blackmail copumpkin
04:10:00 * elliott googled for: are horses immoral
04:10:11 * kallisti googled for: how to become a centaur
04:10:27 * kallisti googled for: nerves in neck of horse
04:10:30 * elliott googled for: used organs "NON-FUNCTIONING" site:ebay.co.uk
04:10:38 * kallisti googled for: nerves in human midsection
04:10:45 * elliott googled for: can childhood dreams survive beyond death
04:10:55 * elliott googled for: cryonics zimbabwe
04:10:57 * shachaf looked down
04:10:58 * copumpkin googled for: how to make elliott, kallisti, and shachaf shut the fuck up
04:11:05  copumpkin++
04:11:13 * elliott googled for: is it okay if oerjan does it too
04:11:24 * oerjan googles for: why don't #haskellers have humor
04:11:24  Let's have some old-fashioned esolanging in here now.
04:11:25 * kallisti googled for: how to communicate passive aggressive indirectly through mock google search queries
04:11:26 * elliott googled for: oerjan moral yardstick goat
04:11:34  `welcome copumpkin
04:11:37  copumpkin: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
04:11:44 * elliott googled for: "international hub" espionage?
04:11:57 * kallisti googled for: worst esolang
04:11:58  oerjan: kick me, this must end before it gets boring
04:11:58 * copumpkin googled for: why can't oerjan see that that was a haskeller's attempt at humor
04:12:05 * kallisti googled for: goat esolang
04:12:08   It never wasn't!
04:12:12 * kallisti googled for: centaurs and esolangs
04:12:13 * shachaf is done.
04:12:15 * elliott googled for: how to fake quotes convincingly
04:12:20 * elliott googled for: fake beard
04:12:22 * copumpkin googled for: the human skewer
04:12:24 * elliott googled for: does shachaf have a beard
04:12:30 * elliott googled for: shachaf's beard (used) site:ebay.co.uk
04:12:38 * kallisti googled for: effective means of incapacitating humans
04:12:44  /!\
04:12:46 * copumpkin googled for: john grows tired of his left nipple
04:12:48  I like that.
04:12:52 * oerjan googled for: best esolang kim jong-il
04:12:58 * elliott googled for: david slowed slightly as his ears
04:13:05 * kallisti googled for: how to rofl via google queries
04:13:17 * shachaf looked up: intelligent calcium black market
04:13:23 * kallisti googled for: why do some people pronounce query in a completely retarded way.
04:13:41 * elliott googled for: how to become a chicken site:interpol.int
04:13:49 * elliott googled for: nasa cosplay
04:14:05 * kallisti googled for: C clamp for restraining large animals
04:14:05  I'm going to #-blah.
04:14:14  #esoteric-blah is the best.
04:14:19  that's a thing?
04:14:23  oerjan: kick me and kallisti and end this now
04:14:36  oh it's just Sgeo
04:14:37  #esoteric === fix (++ "-blah")
04:14:44  kallisti: sgeo is in there?
04:14:45  seriously?
04:14:50  only person
04:14:56  shachaf: You need p-adic strings for that.
04:15:13  All I have is q-adic strings.
04:15:18  kallisti: It's ostensibly for botspam.
04:15:22  kallisti: But usually we just do that in here.
04:15:28 * kallisti googled for: am I robot?
04:15:33  copumpkin: So Cale might be going to Hac Boston.
04:15:34  elliott, I only went in there when it was mentioned in here
04:15:38  shachaf: oh nice
04:15:39  When do I get my kickback?
04:15:43  Sgeo is a creepy lurker.
04:15:43  shachaf: bug him to sign up soon
04:15:47  cause ed's list is full
04:15:52  copumpkin: He would still need to get a passport.
04:15:59  Also I might be going or not and I'm not sure yet.
04:16:05  Hac Boston is in Northumberland, right?
04:16:08  Just like Boston.
04:16:13  yes
04:16:16  elliott: you should come
04:16:23  boston-on-tyne
04:16:30 * kallisti googled for: channel takeover irc
04:16:36  copumpkin: ok. northumberland is pretty small so just let me know the day before!
04:16:43  will do
04:16:47 * elliott googled: directions to boston, northumberland
04:16:54 * elliott googled: are minors allowed in boston
04:17:02 * elliott googled: "boston tea party" biscuits?
04:17:03 -!- Nisstyre has joined.
04:17:05 -!- Madoka-Kaname has joined.
04:17:05 -!- Madoka-Kaname has quit (Changing host).
04:17:05 -!- Madoka-Kaname has joined.
04:17:09 * copumpkin googled: are farts edible
04:17:13 * elliott googled: boston tea party attendance
04:17:25 * elliott googled: boston tea party 2011 hac boston
04:17:41 * elliott googled: turkey surfing
04:17:43  elliott: They only have cookies. No biscuits.
04:17:46 * elliott googled: cyprus surfing
04:17:51 * kallisti googled for: surgery metaphor esoteric language
04:18:00  (I have to google the weirder ones to make sure it's not something real. "turkey surfing" isn't something real.)
04:18:20 * elliott googled: can eyeballs be reattached
04:18:24 * elliott googled: can eyeballs be reattached after being slept on
04:18:35 * shachaf looked up: guiness record number of eyeballs
04:18:57 * elliott googled: eyeball surfing
04:19:11 * kallisti googled for: evidence flat earth
04:19:25  i love the flat earth society's forums so much
04:19:25 * kallisti googled for: anarchist convention near jasper, GA
04:19:34 * elliott googled for: evidence for oblong earth
04:19:39 * elliott googled for: are anarchists people
04:19:40  elliott: never even considered that such a thing existed
04:19:42  that's beautiful
04:19:46  there should be FlatEarthWiki
04:19:48  kallisti: oh you're missing the fuck out!!!
04:19:49  there is
04:19:53  http://theflatearthsociety.net/wiki/index.php/Main_Page
04:19:54  oh
04:19:55  or isn't
04:19:59  or ConspiracyWiki
04:20:05  kallisti: http://www.theflatearthsociety.org/forum/, I especially recommend "Flat Earth Debate", "Flat Earth Believers" section
04:20:11  latter is the best because, they verify people before letting them in
04:20:12 * kallisti googled for: flat earth anarchist revolution
04:20:17  last posted topic
04:20:19  "The Four Humours"
04:20:22  two down from that
04:20:25  "Prayer Facing East"
04:20:28  elliott, surely no one on that forum is serious?
04:20:29 * shachaf looked up: flat earth. flearth
04:20:31  three down from that "Results of my study"
04:20:33  Sgeo: HAHAHAHA!
04:20:36  Sgeo: you betcha
04:20:40 * shachaf looked up: time cube evidence
04:20:43 * elliott googled for: what ARE birds
04:20:52 * elliott googled for: how best to thank ants
04:20:58  "I walked several thousand miles, and didn't notice any curvature. what's up with that?"
04:20:59 * elliott googled for: "little mouse" top 40
04:21:09  elliott, I mean, it's arguably a beautiful way to get people to think about the difference between evidence and proof, etc.
04:21:16 * kallisti googled for: could birds evolve back into dinosaurs?
04:21:19  Sgeo: no its... you dont understand
04:21:25  there are literally flat earth believers on there
04:21:26  like
04:21:31  there are thousands of pages of debate
04:21:33  FAQs
04:21:38  it's amazing
04:21:49 * shachaf looked up: the figuratively flat earth
04:21:55 * elliott googled for: risk of atomic combustion with goedelisation
04:22:02 * shachaf looked up: what can the flat earth teach us about morality
04:22:02 * elliott googled for: langford basilisk real snakes?
04:22:08 * elliott googled for: how to fall down stairs
04:22:08  I don't think the debates necessarily imply anything
04:22:34  Sgeo: I suggest spending a day reading the believers and debate forum
04:22:54 * kallisti googled for: is 2-sphere homeomorphic to infinite flat plane
04:22:54  it is up to you to decide whether anyone can really be that backwards, insane and committed, or that completely stubborn, respectively
04:22:54 * shachaf looked up: elliott hird gullible
04:22:58 * kallisti googled for: is 2-sphere homeomorphic to finite flat plane
04:23:03 * shachaf looked up: will elliott hird believe anything
04:23:05 * kallisti googled for: where is the end of the world?
04:23:16  shachaf: it took me a few weeks of reading the forum to be convinced that people actually believe it :P
04:23:18  it's actually a real society btw
04:23:25  http://en.wikipedia.org/wiki/Flat_Earth_Society
04:23:36  elliott: yes it's certainly real, to some people at least.
04:23:44 * elliott googled for: is breathing possible on a 2-sphere
04:23:52 * elliott googled for: risk of 4-dimensional entanglement while skateboarding
04:24:03 * elliott googled for: how to breathe ghosts
04:24:08 * elliott googled for: how to breathe goats
04:24:13 * shachaf looked up: the earth as analytic and algebraic topology of locally Euclidean metrization of infinitely differentiable Riemannian manifold
04:24:16 * kallisti googled for: risk of travel through fourth dimension in lifetime
04:24:22 * elliott googled for: real numbers not so real after all
04:24:36 * elliott googled for: fake numbers
04:24:48 * elliott googled for: john conway satanist
04:24:52 * elliott googled for: game of death
04:25:08 * elliott googled for: "john conway" "donald knuth" ever seen together?
04:25:34 * shachaf looked up: is euclid still alive
04:25:39 * kallisti googled for: "john conway" "donald knuth" "john mccarthy" threesome
04:25:40 * shachaf looked up: euclid phone number
04:26:10 * elliott googled for: was aristotle pope
04:26:30 * elliott googled for: riemann hypothesis game show
04:26:39  * kallisti googled for: is 2-sphere homeomorphic to infinite flat plane <-- no
04:26:52  oerjan: but finite yes?
04:27:03 * elliott googled for: oxygen intake when drunk
04:27:12 * kallisti googled for: "bertrand russel" "alan turing" sex tape
04:27:21  kallisti: no
04:27:24 * kallisti googled for: "bertrand russell" "alan turing" sex tape
04:28:01 * elliott googled for: was alonzo church a goat
04:28:25 * kallisti googled for: "bertrand russell" is god?
04:28:40  I once looked for rule 34 of Alan Turing and Ada Lovelace
04:28:44  But was disappointed
04:28:44 * elliott googled for: esperanto newspeak
04:28:50 * elliott googled for: is lojban electric
04:29:08  Slereah_: I thought you found it.
04:29:14  Slereah_: Also, you read this place?
04:29:22  SOMETIMES
04:29:26  Rarely nowadays
04:29:29  Slereah_: what about rule 34 Ada Lovelace?
04:29:33  "Esperanto newspeak" ought to at least get you some Orwell.
04:29:34  Not even that!
04:29:44  Although the portrait of Ada Lovelace is pretty saucy as it is
04:29:54 * elliott googled for: ada lovelace ghost compiler
04:30:05  http://www.femmescelebres.com/wp-content/uploads/2009/11/ada1.jpg
04:30:07  Oh yeah
04:30:58 * kallisti googled for: what operating system does Ada Lovelace use?
04:31:07 * kallisti googled for: Ada Lovelace debugging
04:31:39 * elliott googled for: how to tip cows
04:31:44 * elliott googled for: how much to tip cows
04:31:49 * elliott googled for: cow tipping 20%
04:32:17 * kallisti googled for: Ada Lovelace cyber roleplay
04:32:40 * elliott googled for: how to make friends when you are goat
04:33:05 * kallisti googled for: how much to tip cow if you are monqy
04:33:08 * kallisti googled for: how much to tip cow if you are goat
04:33:34 * kallisti googled for: goat cow hatred
04:33:42 * kallisti googled for: electric goat
04:34:14  elliott: in hindsight
04:34:17  this was the best idea ever.
04:34:28 * elliott googled for: what to do if someone compliments my idea
04:34:31 * elliott googled for: help
04:34:54 * kallisti google for: legal advice when someone claims your idea as their own
04:35:05 * elliott googled for: how to recover from acute embarrassment
04:35:12 * elliott googled for: is lung eczma fatal
04:35:24 * kallisti google for: how to mediate a copyright dispute
04:35:30 * elliott googled for: are ideas copyright
04:35:44 * elliott googled for: what to do if the new word order copyrights your brain
04:35:54 * oerjan googled for: eczemascript programming
04:37:00 * elliott googled for: can i become a real boy if i dont have lungs
04:37:05 * kallisti googled for: is lisp fatal?
04:37:13 * elliott googled for: am i stupid
04:37:19 * kallisti googles that.
04:37:30  aaaaaaah stupid quizes
04:37:34 * elliott googled for: what to do if u mad
04:37:40 * elliott googled for: what to do if shachaf makes u mad
04:38:11  I have thought of my plan for continuing in D&D game.
04:38:17 * shachaf looked up: what to do when someone beeps your name
04:38:17 * kallisti googled for: democratic irc channels
04:38:36 * shachaf looked up: remote torture device
04:38:41 * shachaf looked up: e-torture
04:38:45 * elliott googled for: plan for continuing in d&d game
04:38:56  zzo38: would you be interested in an online pen and paper game?
04:38:57 * shachaf looked up: what is zzo38, really?
04:38:57 * elliott googled for: what is zzo38's secret
04:39:03  zzo38: as in, over IRC.
04:39:10 * shachaf looked up: more notation
04:39:23 * elliott googled for: less notation
04:39:26 -!- augur_ has changed nick to augur.
04:39:42 * kallisti googled for: what if you are an endofunctor?
04:39:47  kallisti: hi im backe
04:39:51  kallisti: haskel jobs???
04:39:51 * kallisti googled for: treatment for endofunctor
04:40:00  monqy: no such thing.
04:40:24 * elliott googled for: haskell jobs if you are a goat
04:40:29  monqy: You can has Haskell job?
04:40:31  monqy: (i then linked him to about five)
04:40:58  maybe when i adult i will be haskel jobs
04:41:12  elliott: monqy: compare: http://www.phpjobs.com/
04:41:18  i bet those jobs are worse
04:41:21  yep.
04:41:26 * shachaf looked up: is england real
04:41:32  elliott: the $6000 a month one was pretty ridiculous.
04:41:38 * shachaf looked up: is england just a conspiracy of cartographers
04:41:40  > 6000*12
04:41:41    72000
04:41:50 * shachaf looked up: "conspiracy of cartographers" england
04:41:59 * shachaf looked up: is hamlet mad
04:42:08 * shachaf looked up: hamlet u mad?
04:42:15 * elliott googled for: is shachaf real
04:42:29 * shachaf looked up: difference between a hawk and a handsaw
04:42:36 * shachaf looked up: the direction of the wind
04:43:08 * kallisti googled for: how to stop a meme once it spreads
04:43:15 * oerjan looked up: air speed of an unladen meme
04:43:22  oerjan: AAAAAH
04:43:28 * shachaf looked up: edward vs edward
04:43:38  eduard
04:43:45 * kallisti googled for: endofunctor on edwards
04:44:08 * shachaf looked up: "edward kmett" "edward yang" ever seen together?
04:44:20 * oerjan looked up: endofungal application of applicative endofunctors
04:44:27 * kallisti googled for: elliott hird
04:44:29 * shachaf looked up: copumpkin vs pumpkin
04:44:38 * kallisti googled for: big dudes for big people
04:45:02 * kallisti googled for: big dude society
04:45:42  oh wow suddenly
04:45:45  I look at google plus
04:45:48  and some people are using it.
04:47:18  is google plus real?I've only heard stories...
04:47:34 * shachaf looked up: how many haskell users are there
04:47:59 * kallisti googled for: do people use Haskell in real life?
04:48:10 * elliott googled for: google plus hoax
04:48:18  I think we should switch to the shadowrun terminology
04:48:23 * Sgeo googled for: How to use Haskell to launch missiles
04:48:27  instead of "real life" we should say "meat world"
04:48:50  ill kill you imw
04:48:56  also "meat body" etc
04:49:01  meat refers to the physical world.
04:49:06  as opposed to the virtual world.
04:49:41  what about virtual meat
04:49:56  meatspace is also acceptable
04:49:59  monqy: nope
04:50:00 * monqy googled for: virtual meat oppression
04:50:45  "Flesh world"
04:50:54 * elliott googled for: is flesh
04:51:10  I also like the slang "face" which refers to a charismatic negotiator / con-man / business person
04:51:22  shadowrun slang is good.
04:51:54  zzo38: play shadowrun with me. :(
04:52:03  `word 25
04:52:06  mod led arat ali wasreolteki an unkyporlziigb menthoc plexpedetostecullantericr acholle gensudgiblayagen herm exiassown de buretervmitunglychelhaper ganded aldight piegiterajarly arissids piresbustoff dassamg possomicrowbed isconieric ditaway rion
04:52:23  ganded aldight
04:52:26  one time I have heard of shadowrun but never plays it
04:52:45  piegiterajarly
04:52:48  http://web.archive.org/web/20061206051518/http://archive.dumpshock.com/CLUE/
04:52:51  piresbustoff
04:53:04  monqy: dassamg!
04:53:15  isconieric and ditaway are good
04:54:01  Jafet: what is this stuff
04:54:09  help I can't read.
04:54:36  monqy: would you like a source book to put in your reading pile?
04:54:45 * elliott googled for: is carpal tunnel syndrome fake
04:55:32 * shachaf looked up: is @ real
04:55:45 * monqy googled: truth behind @
04:55:47 * elliott googled for: cyberbullying resources
04:55:48 * monqy googled: @ exposed
04:55:51 * shachaf looked up: @ black market copy
04:55:52  shachaf: did you mean: israel?
04:56:01 * elliott googled for: is israel rael
04:56:07 * elliott googled for: does belgium exist
04:56:20 * shachaf looked up: used belgium cheap site:ebay.co.uk
04:56:51 * kallisti googled for: cheap belgian servants site:ebay.com
04:57:09 * shachaf looked up: @ release date
04:57:19 * shachaf looked up: @ @em forever
04:57:37 * monqy googled: @ for dummies
04:57:52  speaking of @em
04:57:57 -!- copumpkin has changed nick to nowIcantTalk.
04:57:58  whenever I'm in a math class or CS class or whatever
04:58:03 -!- nowIcantTalk has changed nick to copumpkin.
04:58:05  and someone says add 'em
04:58:06 * shachaf looked up: is @ vaporware or vapourware
04:58:09 -!- copumpkin has changed nick to itsokay.
04:58:10  it sounds like they are saying my name
04:58:11 -!- itsokay has changed nick to copumpkin.
04:58:43  you just Adam up
04:58:46  Adam together
04:58:57  math friends
04:59:01  what do you mean? you just Adam.
04:59:19 * elliott googled for: ad er i ardly knew er
04:59:34 * elliott googled for: is shachaf vapourware
04:59:50 * shachaf looked up: is elliott vapouurware
05:00:00  http://web.archive.org/web/20061206051518/http://archive.dumpshock.com/CLUE/
05:00:04  ...bah
05:00:08  copypaste fail
05:00:29 * shachaf looked up: @: fact or fiction
05:00:35  :)
05:00:38 * shachaf looked up: monadology phd online cheap
05:00:51 * elliott googled for: goat lending
05:01:14 * shachaf looked up: how many category theorists does it take to change a lightbulb
05:01:52 -!- kallisti has set topic: The IOCCC is back on! http://www.ioccc.org |  http://esolangs.org/ | #esoteric: Still a place that prefers INTERCAL  to Haskell | half-add er? I ardly knew er! | http://codu.org/logs/_esoteric/.
05:02:01 * kallisti googled for: how to steal copyrighted ideas
05:02:01 * monqy googled for: is @ a goat
05:02:08 * shachaf looked up: is category theory real
05:02:11 * kallisti googled for: morphisms on lightbulbs
05:02:18 * shachaf looked up: is ddarius real
05:02:27 * monqy googled for: how not to put extraneous spaces in topic
05:02:37 * monqy googled for: how to fix topic
05:02:39 * monqy googled for: help
05:02:51 * elliott googled for: help
05:03:06 * kallisti googled for: help
05:03:11  Mmm, #haskell
05:03:12  @quote factorybean
05:03:13  kmc says: i <3 http://static.springsource.org/spring/docs/2.5.x/api/org/springframework/aop/framework/AbstractSingletonProxyFactoryBean.html
05:03:15  GOD DAMMIT
05:03:17  I HATE YOU ALL
05:03:19  BY
05:03:20  YOU ALL
05:03:20  I MEAN
05:03:21  SHACHAF
05:03:23  YOU RUINED THE HELP
05:03:28  I WAS GOING TO GET OERJAN TO FINISH IT WITH ONE LAST HELP AND THEN
05:03:29  ITW OULD BE DEAD
05:03:30  BUT NOW
05:03:32  WE SHALL BE CURSED
05:03:33  FOREVER
05:03:34  IN OUR NIGHTGOWNS
05:03:46  @quote monqy
05:03:47  Plugin `quote' failed with: getRandItem: empty list
05:03:57 * shachaf looked up: goat tranquilizer
05:03:59 * shachaf looked up: elliott tranquilizer
05:04:11 -!- kallisti has set topic: The IOCCC is back on! http://www.ioccc.org | http://esolangs.org/ | #esoteric: Still a place that prefers INTERCAL to Haskell | half-add er? I ardly knew er! | http://codu.org/logs/_esoteric/.
05:04:15  monqy: better
05:04:15 * elliott googled for: cursed forever in our nightgowns
05:05:34  this has been going on for two hours by the way.
05:05:56  I'm still going through the log because I missed so much wonderful ;_;
05:05:58  not long
05:07:08 * monqy googled for: sour cereal information
05:07:30 * elliott googled for: source real
05:08:03  quintopia: also wtf are you doing in north georgia.
05:08:22  also: do you have alcohol?
05:08:26  also: do you like to smoke hookah?
05:08:40  we could trade.
05:08:57 -!- pkzip has joined.
05:09:09 -!- pkzip has left.
05:09:21  `welcome pkzip
05:09:23  pkzip: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
05:09:31 * kallisti googled for: how to make meeting people in real life less awkward
05:09:49 * kallisti googled for: fun drinking games
05:10:37 * kallisti googled for: how to lace hookah with hallucinogens
05:11:10 * kallisti googled for: vaporizable hallucinogens
05:11:45 * kallisti googled for: DMT prices near Jasper, GA
05:12:06 * kallisti googled for: vaporization point of DMT
05:12:27 * elliott googled for: how to die
05:12:35 * kallisti googled for: is vaporization point an actual thing?
05:12:44  kallisti: Yes I could possibly play the game over IRC; I might lack time however, when everyone can be properly scheduled.
05:12:57  zzo38: "everyone" is currently two people.
05:13:02  one of them is you.
05:13:07  (^hint)
05:13:23  kallisti: And is other one is you?
05:13:28  YEP
05:13:52  I've gotten cursory interest from a number of people but no one is actually willing to learn anything about a game system.
05:14:15  elliott: why you want die
05:14:50  It is possible to play with only one referee and one player, although is better more than one player. I play 3.5 edition and in many unusual ways. Read the recording that I typed of the games I played for some information in case you are interested in it.
05:15:21  @die 10d6
05:15:21  10d6 => 38
05:15:32 * elliott googled for: how to not die
05:15:37  oerjan: KICK AND BAN ME AND KALLISTI
05:15:55 * kallisti googled for: suicide rates on irc channels
05:16:10  oerjan: that wouldn't quite suffice for Shadowrun
05:16:13 * elliott googled for: kick me and ban kallisti
05:16:13 * elliott googled for: kick me and ban kallisti
05:16:13 * elliott googled for: kick me and ban kallisti
05:16:14 * elliott googled for: kick me and ban kallisti
05:16:14 * elliott googled for: kick me and ban kallisti
05:16:14 * elliott googled for: kick me and ban kallisti
05:16:16 * elliott googled for: kick me and ban kallisti
05:16:18 * elliott googled for: kick me and ban kallisti
05:16:18 * shachaf looked up: help
05:16:20  er
05:16:22 * elliott googled for: kick me and kallisti at least
05:16:25  elliott: Part the channel and ignore kallisti.
05:16:26 * elliott googled for: not shachaf he is innocent
05:16:27  oerjan: however, I have an existing bot with dice rollers
05:16:33  zzo38: how do i ignore kallisti
05:16:51  elliott: Part the channel and that will work since you are not on the channel they are, then.
05:17:07  I like how zzo38 assumes that elliott wants to ignore us.
05:17:09  but kallisti is in other channel too
05:17:19  elliott, update
05:17:19 * monqy googled for: how to kick other channel
05:17:43  elliott: What's the other channel?
05:17:50  kallisti: I also have written IRC bot with dice rollers. In addition, some IRC networks have a GS command to roll dice and optionally send the result to channel. My own IRC server has a channel for RPG game session, specifically.
05:18:13  zzo38: cool. my dice rollers work for specific systems to make some things more convenient.
05:18:16  shachaf: I think #haskell???
05:18:19  well, currently there's only one.
05:18:25  for World of Darkness d10 rules.
05:18:35  because it's insanely simple. shadowrun is a bit more complicated.
05:18:45  elliott: not anymore
05:18:53  Well join it then.
05:18:54  I also like Icosahedral RPG, however I have not yet finished writing the rules, so that cannot be played.
05:19:00  elliott: wait why?
05:19:20  Here is recording of my current D&D game:   http://zzo38computer.cjb.net/dnd/recording/level20.tex   http://zzo38computer.cjb.net/dnd/recording/level20.dvi
05:19:38  The macro file is also available in the same directory; I wrote it specifically for purpose of recording D&D game 3.5 edition.
05:20:07  I have not yet finished recording the last session, but I will do so.
05:20:08 -!- Darth_Cliche has joined.
05:21:23  elliott: what's the purpose of me joining this other channel
05:21:29  so that i have to ignore you
05:21:36  ?
05:21:46  I am not understand
05:21:56  This is macro file of recording D&D game:   http://zzo38computer.cjb.net/dnd/recording/dungeonsrecording.tex
05:23:24  elliott: what does me being in two channels have to do with ignoring me?
05:23:37   elliott: Part the channel and that will work since you are not on the channel they are, then.
05:23:58  elliott: I thought the purpose of the kick was to prevent us from further googling.
05:24:39  it is
05:24:48  zzo38 told me to /part and ignore you instead
05:25:58  http://smileytext.com/wp-content/uploads/2011/10/129.jpg
05:26:01 * Sgeo is easily amused
05:26:13  elliott: Your IRC client might have other ignore function too; you could use that instead.
05:26:27  zzo38: I thought I should set mode +G or something ??
05:26:29  I know I have a filter function (although I rarely use it)
05:26:42  Sgeo: that's the worst comic i've ever seen
05:26:58  elliott, go read Station V3, then come back to me
05:26:59  Usermode +G? There is no such thing. Use +D if you want to ignore channel messages and +g to ignore private messages.
05:27:08  I don't know why it's still on my RSS reader
05:27:10  Sgeo: do i really want to
05:27:24  Twittch is also rather lame
05:27:35  http://www.stationv3.com/d/20111120.html hilarious
05:27:50  http://twittch.com/ hilarious
05:28:00  http://twittch.com/60/ ha ha ha
05:28:21  http://twittch.com/57/ ha ha ha
05:29:40 -!- GreaseMonkey has joined.
05:29:55  elliott: wow...
05:29:56  these are
05:29:58  awesome
05:30:08  rivalling SBAHJ
05:35:24  elliott: it gets even worse http://twittch.com/24/
05:35:29  the author is a Ruby person
05:35:37  beautiful
05:35:41  Sgeo: why did you ever start reading this
05:35:48  http://twittch.com/23/
05:36:01  ..
05:36:44  elliott, I saw one of the comics in some presentation
05:40:41  There's an iOS app for this thing
05:40:42  WHY
05:40:56 -!- MDude has changed nick to MSleep.
05:41:51  elliott: http://twittch.com/36/
05:41:54  They have accused my character to commit crimes: * Unauthorized entry into a debtor prison * Breaking and entering * Allowing prisoners to escape * Injuring the guards.  However it is only the first one which I have commited, not the others.
05:41:54  can you explain this one?
05:42:07  kallisti: nope
05:43:08  tup's site got uglier :(
05:43:08 -!- oerjan has quit (Quit: Good night).
05:43:38  elliott: hi do you like pen and paper RPGs?
05:43:54  fungot: what about you?
05:43:54  kallisti: alternate universe, that's " law and order". and it doesn't have to be shakespeare.
05:43:58  fungot would be the best player.
05:43:58  kallisti: people have worried! the fact, you were like, " hey, i wonder if i talk to about one in then people who know so many awesome things that i'm like, " all the money that was ever mean to you in a way that i could come
05:44:06  kallisti: no
05:44:46  elliott: you smell bad
05:44:55  Computer RPG games are not real role playing games. Text adventure games come close. But not really.
05:45:25  zzo38: I would argue that some computer RPGs are similar to roleplaying
05:45:31  if an element of choice is given.
05:45:40  however it's not the same I agree.
05:46:33  zzo38: I'm highly interested in create a hard science fiction setting and system for tabletop RPGs.
05:47:34  specifically centered around our solar system and nearby systems.
05:47:43  without any expedient means of FTL travel.
05:48:31  somewhat in the genre of "space western" I guess.
05:48:42  I am also interested making a system for role playing game; it is called Icosahedral RPG, and is incomplete. It is for pencil and paper. Mana are mathematical, and other magical things can also use mathematics such as category theory and whatever; it can form a category. Fighter are designed powerful class for combat; ...
05:49:05  I... okay.
05:49:08  ... spellcaster is generally for noncombat. Assumed all creature suitable for player character; pseudolevels can balance them. There are other unique features too.
05:49:20  zzo38: The idea of "computer RPGs", of course, comes about due to *mechanics*.
05:49:36  It is incredibly easy to see the mechanical similarities.
05:49:51  pikhq_: storytelling etc etc
05:50:32  Of course, this *does* omit approx. half the fun of RPGs: the interactivity. You're not merely helping the story take place, you are one of the authors of the story.
05:50:36  pikhq_: I agree to that. And I can understand why the term "RPG" used. However, it is not a role playing game and the abbreviation should be used when refering to "Computer RPG". Text adventure games are closer, in my opinion.
05:50:55  But still not quite.
05:51:27  zzo38: I tend to go with "JRPG" and "Western RPG", personally.
05:51:37  (as there are certainly two distinct groups of computer RPGs)
05:51:44  demon's souls: best RPG
05:51:46  that I've ever played
05:51:50  pikhq_: You can use those terms if you prefer; yes it can help to distinguish them.
05:51:58 * kallisti awaits an opportunity to play Dark Souls.
05:52:20  Also "pen & paper RPG" if I need to be unambiguous about the traditional sort.
05:52:38  (And if I would be referee in a role playing game over IRC, I would permit some common abbreviations used in text adventure games)
05:53:21  zzo38: I think we are probably accustomed to two different styles of gameplay based on your recordings
05:53:42  kallisti: You might be correct; I do play very unusually.
05:54:10  You are probably correct.
05:54:23  I think it's mostly that I'm accustomed to a more theatrical style of roleplaying. D&D games I've noticed tend to not have this attribute
05:55:30  D&D in particular does tend to get focused on mechanics a lot.
05:55:48  Probably just because there's a lot of mechanics there to play with.
05:55:49  it's not even that, entirely. that's part of it.
05:56:24  sure there's storytelling and infinite possibilities and all that, but it's all kind... absurd.
05:56:27  it's not very immersive.
05:56:37  I'm sure it's fun though.
05:56:56  However, note my recordings; even many things not completely by mechanics; there is many story oriented things.
05:57:08  in the same way that skyrim is fun, even, except moreso because you create your own quests and challenges, basically.
05:57:12  But game mechanics are used for combat and spellcasting of course.
05:57:25  Well, yes, D&D shapes a particular, almost quaint, sort of setting.
05:58:00  It's almost a bit like Final Fantasy's extensive use of its various set pieces, really.
05:58:10  pikhq_: tabletop games tend to be quite different when you're in present day settings, or settings based on the real world.
05:58:18  shadowrun is a kind of hybrid of the two. cyberpunk setting with fantasy elements.
05:58:35  The way I play is different in many ways howveer. Read my recording please.
05:58:38  I'm pretty fond of urban fantasy, myself.
05:58:47  pikhq_: shadowrun
05:58:59  s/howveer/however/
06:00:16  :t count
06:00:16  Not in scope: `count'
06:02:19  !perl for (map {int rand 7} (1..4)) { $i++ if ($_ > 4) } print $i
06:02:29  :(
06:03:13  !perl for (1..4) { $i++ if (int(rand(7)) > 4) } print $i
06:03:14  1
06:03:16  !perl for (1..4) { $i++ if (int(rand(7)) > 4) } print $i
06:03:24  !perl for (1..4) { $i++ if (int(rand(7)) > 3) } print $i
06:03:25  3
06:03:40  this is a simplified version of what shadowrun rolls look like.
06:04:03  here the dice pool is 4, and target number is 4 (and then 3)
06:04:06  you roll d6
06:05:14  World of Darkness is similar but with d10
06:05:36  I really like WoDs system actually. effective but not incredibly dense.
06:06:52  you have attributes (split into physical, mental and social), you have abilities (split into talents, skills, and knowledges), and you combine one of each to make an action against a difficulty (target number)
06:07:19  I have also once played anime role playing game at anime convention.
06:07:24  so for example Dexterity+Firearms difficulty 6 would be a standard "shoot this person" action.
06:09:02  and of course the difficulty varied based on range, visibility, mental state, wound penalties and other conditions that might be applicable.
06:10:30  Tabletop RPGs have too much mechanics; computer RPGs are too mechanical
06:10:39  Jafet doesn't like fun, I think.
06:10:50  The game mechanics do not have to be used all the time!!
06:11:15  Jafet: also in other cases the game mechanics become very intuitive once you get the hang of them.
06:11:29  and really only the game master has to know them well.
06:11:41  Ideally, a computer should be doing the mechanics and a person should be doing everything else, but computer interfaces suck
06:12:04  it's really not a problem if you have a sane, easy to understand system.
06:13:04  zzo38: actually I think you would enjoy Mage.
06:13:10  (a WoD system)
06:13:21  What does "WoD" means?
06:13:25  world of darkness.
06:14:05 -!- Jafet has quit (Quit: Leaving.).
06:14:18  morning
06:14:23  the premise: you play in a modern day (or historical, or sci-fi if you want) setting, with the only difference being that supernatural beings exist and have kept their presence unknown by society.
06:14:35  kallisti: which game is that?
06:14:41  01:13 < kallisti> world of darkness.
06:14:42  ..
06:14:44  ah
06:14:54  kallisti: come on I just woke up, and I'm not good at mornings
06:14:58  no worries.
06:15:12  in fact I'm absolutely terrible at early mornings
06:15:16  07:14 here
06:15:28  also, once you actually play the game it becomes increasingly obvious that there is probably no way you could keep such a thing secret from the entire world.
06:15:31  especially in the modern age.
06:16:09  but, it's a fun premise.
06:16:14  heh
06:16:20  kallisti: computer game?
06:16:27  or tabletop rpg
06:16:29  no tabletop / pen and paper
06:16:39  though some computer games exist
06:16:40  they're bad.
06:16:46  ah
06:17:23  zzo38: but anyway what's cool about Mage is that there aren't any set lists of spells that you learn.
06:17:43  good idea
06:17:51  instead you have nine spheres that represent some aspect of reality, and knowledge in those spheres allows you to control that aspect. spels can include combinations of spheres as well.
06:18:00  hm tabletop rpg with magicka style magic might be fun...
06:18:11  it's similar.
06:18:15  ah
06:18:16  but more endless.
06:18:19  wow
06:18:22  that is impressive
06:18:36  it's definitely my favorite from WoD
06:18:42  in  terms of the game system itself.
06:18:48  heh
06:19:11  speaking of which: you get more out of magicka if you know Swedish
06:19:25  the voiced dialogue is a mix of Swedish, English and some made up stuff
06:19:34  also the interpretation of spheres is leenient based on what sort of magical tradition you follow. so basically, there's like "mad scientist" mages as well as your traditional Hermetic order kind of mage.
06:19:35  and often doesn't match the written dialogue in meaning
06:20:10  like calling townsfolk "fjantar", which would loosely translate to "sillies"
06:20:19  kallisti: you said you played Magicka right?
06:20:21  the mad scientist interpretation of the sphere of Matter for example could involve things like transmuting chemical elements and the like.
06:20:24  Vorpal: yes
06:20:34  bloody hard game too
06:20:38  noep
06:20:42  well
06:20:43  yes
06:20:46  high learning curve
06:20:52  but then once you've learned it it's incredibly easy actually.
06:20:56  I didn't get very far in it. Don't have the required skill at high speed
06:21:09  can't tap out qwwedasdasd or whatever it is at high speed
06:21:13  lol
06:21:27  (note that was random key presses)
06:21:35  Vorpal: try a few edddd's beforehand, or edfffs or efrrrs to give you some time.
06:22:01  kallisti: I mostly played it single player, don't really have anyone to play against.
06:22:10  basically giant rock barriers, the latter two are volcanos and frost volcano thingies
06:22:32  but edddd (pure rock barrier) withstands the most damage.
06:22:41  hm
06:22:57  i wish oerjan didn't get sick of that space metazipper thing :'(
06:23:03  shiro 2 could be so good............
06:23:05  kallisti: nah I prefer games where I have time to think and/or have quicksave.
06:23:59  kallisti: I'm reasonably good at nethack for example. Due to having the time to think in it. I'm not a fast nethack player though. I ascended a few times.
06:24:01 -!- ineiros has quit (Read error: Operation timed out).
06:24:24  Vorpal: then qfqfasa = best beam spell   qfqfass = best AoE spell  dqrqrqrqr = best projectile  qfsafe self-cast = immunity to most offensive elements
06:24:28  How to Break Magicka: the Book
06:24:42  kallisti: hey I could install autohotkeys and survive magicka XD
06:25:02  you could survive and then kill everything nearly instantly with no trouble.
06:25:06  in story mode.
06:25:15  story mode is what I tried
06:25:28  though the vietnam thing is a bit more difficult and annoying
06:25:28  got to that city place, then gave up
06:25:42  my favorite is arena because it's the most challenging but without annoying fucking automatic weapons
06:25:58  kallisti: automatic weapons proved a life saver to me so far
06:26:02  nooooo
06:26:02  so bad
06:26:05  why?
06:26:13  I've watched youtube videos of people that literally do nothing but use m60
06:26:15  it's so bad
06:26:50  I mean, it works, but it's also really boring and nowhere near as effective as memorizing a few awesome spells
06:26:51  kallisti: personally I'm interested in magicka because of the wacky story and the voice over.
06:27:02  Vorpal: that's understandable
06:27:08  I wish it had a difficulty setting basically.
06:27:17  it's honestly kind of silly to get serious into Magicka, but I.. managed to do it in the short time I played it.
06:27:43  "serious" and "magicka" do not belong in the same sentence.
06:27:48  because the gameplay concept is actually quite good and fun.
06:28:05  kallisti: i encourage you to play good games like aii and ec
06:28:13  elliott: what are those
06:28:22  good
06:28:22 * kallisti googled for: no wait fuck googling
06:28:30  kallisti: played bastion? Now that is a game I'm quite good at, even with the difficulty turned up (which is done by an interesting in-game-world system)
06:28:48  Vorpal: I have not
06:29:07  kallisti: I recommend it. Truly unique experience. The dynamic voice over system is awesome.
06:29:24  Vorpal: you should try Magicka again it is very rewarding once you become god.
06:29:28  it still continues to be challenging despite that.
06:29:56  kallisti: aii is a ~space~ dogfighting game with fully newtonian movement, ragdoll-physicsy ships, and cool things like weapons that shoot bubble things that slow down time inside them, also black holes and lots of orbital transfers???
06:30:04  kallisti: basically the narrator speaks as you go along. And inserts dynamic statements. Like might comment on your favourite set of weapons or such.
06:30:06  elliott: holy crap
06:30:09  elliott: that's like
06:30:10  ok it doesn't technically exist yet PH is getting off his ass with some of the prototype code :P
06:30:13  elliott: the game I wanted to make
06:30:17  .....oh
06:30:26  kallisti: IT'S GOING TO BE SO GOOD THOUGH?
06:30:30  elliott: yes
06:30:31  PH already has a prototype of the basic physics
06:30:36  kallisti: get used to elliott talked to stuff he is planning as if it was already in existence.
06:30:36  (to prove oklopol wrong)
06:30:42  Vorpal: hey ph started it
06:30:55  kallisti: get used to elliott talked to stuff he or PH is planning as if it was already in existence.
06:31:03  elliott: that should be more accurate ^
06:31:07  elliott: other things to consider: portals
06:31:10  all games are made better by portals.
06:31:23  magicka needs: portal gun
06:31:31  kallisti: maybe. it's two-dimensional so i dunno if that'd work very well
06:31:38  kallisti: I bet they would throw that in except Valve would go mad
06:31:39  probably shoulda mentioned it was 2d :P
06:32:02  Vorpal: there are already instances of games that have ripped off the portal mechanic except not quite as good
06:32:09  hm
06:32:11  elliott: no 2d is what I had in mind actually
06:32:12  that makes it better
06:32:28  *what I had in mind when I was devising the best space fighting game ever
06:32:40  kallisti: especially since it came out of oklopol doubting that stable orbits would form in 2d :P
06:32:46  elliott: also: ships with bladed wings.
06:32:53  one thing i'm a bit unsure about is whether the networked multiplayer will work
06:32:55  because
06:33:03  that's like the only way this would ever be played
06:33:04  realtime games and networking kind of don't work
06:33:08  but the synchronisation would be euurgh
06:33:16  elliott: why? You could do split screen surely?
06:33:27  Vorpal: (a) nobody has two keyboards, (b) nobody has friends
06:33:29  kallisti: yeah, but otoh the newtonian physics limits it a bit?
06:33:35 * kallisti once tried to play smash bros brawl online and ragequit
06:33:40  kallisti: like if you're in a stable orbit you're not going to escape it in the next .5 seconds
06:33:44  elliott: a) actually I do. One of them is kind of crappy, ultraflat thingy
06:33:50  b) true
06:34:12  Valve didn't particularly invent the idea of portal guns, did they?
06:34:12  actually I have friends, at university. But most of them live in a different city than me.
06:34:14  elliott: it's more of a like... sync issue when you are in direct combat with another human being.
06:34:16  kallisti: but yeah i dunno, latency isn't very... good
06:34:24  kallisti: well yeah
06:34:27  elliott: who shot who first etc
06:34:39  kallisti: but like a lot of aii's mechanics involve not just being able to fly around shooting because that's boring
06:34:52  elliott: you might be able to pull it off over LAN
06:35:13  kallisti: i expect a lot of it will be done by basically getting consistent but erratic orbits with an easy enough escape that you can fire off some shots at certain points without too much risk
06:35:22  This channel talks too much.
06:35:25  and like obviously the time-changing stuff makes things more complicated :P
06:35:31  Vorpal: well LAN realtime games are trivial
06:35:32  elliott: also what happens when you black hole all the planets
06:35:36  you barely even need prediction
06:35:42  kallisti: that would be bad.
06:35:46  elliott: wouldn't the act of firing a shot push you out of orbid?
06:35:48  orbit*
06:35:59  elliott: also what about relativity? :P
06:36:03  kallisti: no relativity :P
06:36:06  :(
06:36:15  Vorpal: they're lasers, man
06:36:17   This channel talks too much. <-- no
06:36:22  but the idea would be like
06:36:25  elliott: that still pushes a bit...
06:36:29  Vorpal: Fine. People in this channel talk too much.
06:36:30  escaping your orbit so that you drift back into it in the next few seconds
06:36:40  elliott: afaik you can push a mirror with a laser for example
06:36:44  not much, true
06:36:46  but still
06:36:54  "why is everyone idle all the time?"   "why does everyone talk so much?"   "baaaaaawwww"
06:37:12  kallisti: They should talk while I'm here and not while I'm gone.
06:37:24  elliott: I think the inclusion of bombs would be interesting
06:37:27  kallisti: also i've cunningly avoided the problem of being completely useless at art by devising the PERFECT ART AESTHETIC (for lazy people)
06:37:28  so you could place a bomb in an orbit
06:37:29  shachaf: you should obviously adjust your schedule then
06:37:33  i am the best at avoiding work.
06:37:43  elliott: lines?
06:37:52  ascii graphics?
06:38:01  kallisti: ALMOST
06:38:01  I played a game called gravity well that was basically entirely composed of lines
06:38:04  your ship was a little triangle
06:38:07  planets were circles
06:38:20  it was also a 2d space dogfighting game
06:38:24  kallisti: the aesthetic is basically like http://upload.wikimedia.org/wikipedia/en/1/13/Asteroi1.png but 21ST CENTURY
06:38:30  it should be mentioned that aii stands for Asteroids II :P
06:38:58  you could claim uninhabited planets by landing on them, once you landed one of your colonies would send a colony pod to colonize it and make a base
06:39:03  which would place little defensive shooter turrets
06:39:07  and then slowly the base would grow in size
06:39:15  kallisti: it came to me IN A VISION (actually i think i just woke up with it), it's basically layering 10 blurry parallaxy ~space nebula~ background layers on top of each other, and then all the actual game objects are slightly glowy neon vectors
06:39:15  and have a little orbiting docking platform that could heal you
06:39:19  I once played a game that consisted entirely of text. It was, like, crazy, man.
06:39:19  hey that is a different game
06:39:24  shachaf: XD
06:39:30  kallisti: and like colour and faintness is used for things like reporting damage
06:39:41  elliott: ah interesting
06:39:43  Bureaucracy was an odd sort of game.
06:39:58 -!- Darth_Cliche has quit (Quit: You are now graced with my absence.).
06:39:59  kallisti: also there's like a faint movement trail??? and bullets (LASER SHOTS) do things like ripple the background
06:40:02  elliott: and probably very pretty looking
06:40:03  come to think of it, I _may_ have been hallucinating.
06:40:12  shachaf: infocom?
06:40:27  elliott: could have been because you just woke up
06:40:29  that happens
06:40:41  kallisti: also PH had the absolute best idea for a weapon.
06:40:45  Vorpal: Yes.
06:40:46  kallisti: it's the... NEUTRINO GUN
06:40:51  oshi
06:40:54  kallisti: when you fire it, a random ship within the vicinity instantly blows up
06:41:00  ..
06:41:01  kallisti: you then have ten seconds to blow it up yourself
06:41:07  or you lose
06:41:13  lol
06:41:20  wait no
06:41:21  i got it wrong :(
06:41:22  bbl
06:41:24  kallisti: when you fire it, a random ship within the vicinity instantly blows up
06:41:28  kallisti: you then have ten seconds to AIM the gun at it
06:41:29  or you explode
06:41:35  hahaha
06:41:40  kallisti: basically the player behind the ship keeps playing for ten seconds and you have to get in range and aim it
06:41:53  elliott: causality explosion?
06:42:03  yes. causality works by blowing people up if they violate it
06:42:08  just like in the real world
06:42:12  excellent
06:42:20  so yeah gravity well was the best thing ever.
06:42:25  in my childhood
06:42:27  I played it for hours
06:43:06  basically everything was zero-g so you could accelerate to retarded speeds as you jet across the entire star system but then... good luck slowing down before you crash into anything
06:43:24  aka newtonian :P
06:43:27  well unless you could pivot
06:43:30  which would be
06:43:31  weird
06:43:34  you could
06:43:38  well what do you mean
06:43:46  could you turn around and start going another way at high speeds
06:43:46  I mean, you could rotate your ship as it was moving
06:43:48  so to slow down
06:43:55  you just rotate 180, and jet the other direction
06:44:02  right. not newtonian then.
06:44:04  so lame.
06:44:14  ...how else do you slow down?
06:44:22  or, turn?
06:44:27  (in case you're dumb (technical term), with newtonian mechanics you'd just turn around helplessly)
06:44:32  (because that's how it works.....)
06:44:40  kallisti: you have to fight against your velocity
06:44:46  elliott: right that's what I meant
06:44:48  right
06:44:50  you don't instantly change direction
06:45:10  if you mean you turna round and accelerate and it takes like ten minutes to get going again, then yeah
06:45:16  yes
06:45:33  you could also accelerate backwards at a slight angle to get like a slow u-turn sort of effect
06:46:06  I think it would be nice if you have a retardedly powerful jet that had some sort of cooldown mechanic
06:46:16  so you could either start off or slow down rapidly, SOMETIMES
06:47:02  also all of your colonies could get like research labs
06:47:16  so that when you land on your orbiting dock bay thing
06:47:25  you could get like shieds, homing rockets, etc
06:47:27  a cool mechanic would be to have a magical device onboard your ship that can become like really really massive (not like your mom, like jupiter) for a short period of time but it costs a shitload of energy
06:47:35  so you get close to a bunch of people and turn it on and they all helplessly get pulled towards you :P
06:47:42  heh
06:47:45  and then you spin around firing death. :(
06:47:50  a projectile could be more interesting.
06:47:56  if you have non-laser weapons involved
06:48:27 -!- ineiros has joined.
06:48:28  also non-laser weapons would be interesting in that you cold manipulate gravity to your advantage but  you also have to deal with travel time.
06:48:36  requires planning
06:48:51  oh well they're not like
06:48:52  proper lasers
06:49:01  they're just guns but more high-tech.
06:49:02  in what way?
06:49:04  oh
06:49:05  so
06:49:08  instant travel guns?
06:49:10  there's still a projectile and it's still affected by gravity :P
06:49:11  that are subject to physics?
06:49:13  nope, travel time!
06:49:16  although that WOULD be cool.
06:49:16  oh, okay.
06:49:23  yes
06:49:24  but look, if you say laser it sounds fancier.
06:49:31  and i can handwave the fact that guns + space = ???
06:49:31  "energy weapons"
06:49:33  yes
06:49:34  phasers
06:49:38  star trek(tm) phasers
06:49:40  to account for the lack of newton's third law
06:49:46  on your ship
06:50:05  a fun thing would be having a battle like right in the middle of a complicated multi-body orbit
06:50:10  elliott: what do you mean ??
06:50:10  so bullets keep getting bent around
06:50:14  guns operate fine in space actually
06:50:25  kallisti: yeah but guns don't fire neon bullets?
06:50:30  ah, yes.
06:50:44  admitedly the gravity physics in gravity well were bad
06:50:47  basically you just got sucked down
06:50:50  well
06:50:52  kallisti: neon's third law for shooting might be interesting tbh
06:50:54  you could orbit
06:51:00  but it required like, constant careful thrusts
06:51:03  and was basically impossible.
06:51:13  lol neon's third law
06:51:29  elliott: yes I think a variety of weapons would make for more fun.
06:51:34  not necessarily more... gameplay coherence though
06:51:36  but fuck that.
06:51:44  lol neon's third law
06:51:57  kallisti: yeah i'm not sure what the ... progression in terms of gameplay is?
06:52:03  i'm tempted to just like give everyone every weapon from the start
06:52:20  well if you involved space colonies
06:52:22  but that's weird
06:52:26  kallisti: that's getting mmorpgy
06:52:27  with  the whole orbity combat stuff
06:52:29  shared state
06:52:33  elliott: eh not necessarily
06:52:36  could be a very simple system.
06:52:39  well how would you prevent trivial cheating
06:52:40  like gravity well!
06:52:47  trivial cheating as in?
06:52:50  since i'm thinking of it as multiplayer-only
06:53:29  kallisti: well how do you stop people saying they bought shit which they didn't :P
06:54:09  um......?
06:54:23  you mean how do you stop people from lying?
06:54:25  unsolved problem.
06:54:38  kallisti: how do i stop people's game clients from telling the other players, "yep I got super-weapon"
06:54:39  when they don't.
06:54:43  oh
06:54:48  right
06:55:11  closed source, encrypted protocol. :P
06:55:20  yeaaaaaaah
06:55:47  or you have a server
06:55:51  which mediates
06:56:28  kallisti: right, so we need big iron which everybody has to talk to...
06:56:34  and which has to do ugly anti-cheating shit
06:56:38  yep
06:56:53  it's otherwise most likly impossible to prevent cheating
06:56:57  easier just to make every match a blank slate. then the only kind of cheating is client hacking shit, and hopefully that would be visible
06:57:14  like as opposed to someone just waiting five minutes and then blowing you up with a mega super weapon that's supposed to be hard to get or whatever
06:57:15  ragequitting is an effective deterrent to cheaters.
06:57:20  i dunno *shrugs*
06:57:42  well, hmmmmmmmmmmmm
06:57:56  the protocol
06:58:05  could consist entirely of basically key input
06:58:11  and each game creates its state separately
06:58:26  but then if you have any kind of visibility mechanic (like a fog of war)
06:58:29  kallisti: that's rly network trafficy
06:58:30  then client hacks could see everything.
06:58:44  but yeah i can design a protocol
06:58:50  i just, eh
06:58:58  elliott: it is? I figured it would be less traffic than "send everything about the gameworld all the time"
06:58:59  who needs in-game progression when you have the progression of "people being better players"
06:59:07  well, right.
06:59:15  it just depends on the style of gameplay
06:59:23  sort of like Worms actually
06:59:27  the only way progression would be interesting from a competitive standpoint is if there are choices
06:59:30  rather than a linear progression
06:59:33  you can just cause in-game, per-match events that give you powered-up weapons and utilities
06:59:36  (~ crate drops)
07:00:11  depends on how much chance you want to add.
07:00:18  I like zero chance games.
07:00:24  (modulo latency)
07:00:51  for example, starcraft is completely devoid of chance.
07:00:53  it is also completely awesome.
07:00:56  kallisti: eh, I could make everyone get the same weapon at the same time? :P
07:01:06  hmm, i am very sceptical of the implicit claim that starcraft never uses an rng in a non-deterministic way
07:01:22  elliott: well you said "cause an in-game event" basically as long as you don't randomly select the power-up then you get zero chance involved.
07:01:29  if each in-game event corresponds to a particular power-up
07:01:37  have you played worms? :P
07:01:43  elliott: well, I'm pretty certain it doesn't
07:01:45  elliott: no
07:02:01  elliott: at least in the combat mechanics there is no chance. all of the numbers are fixed and don't vary.
07:02:14  oh. the crate drops are basically, randomly (approx. every N turns or whatever), a random weapon (weighted by how powerful it is etc.) gets dropped in a crate
07:02:21  which worms can then navigate to to add to the team's artillery.
07:02:29  yeah that would work
07:02:34  what? that's pure chance
07:02:48  but if I were designing the game I would eliminate all forms of randomness, or have them turned off without seriously destroying the gameplay.
07:02:58  elliott: I'm a compromising sort of person. :P
07:03:12  *have an option to turn them off
07:03:20  well, how would you do incremental weapons then :)
07:03:24  giving everyone tons of shit at the start for no reason sucks
07:03:27  i guess it could be like
07:03:30  "achievements" give you rewards
07:03:35  that's an option
07:03:37  as long as... they're not called achievements
07:03:38  and
07:03:40  lol
07:03:41  it doesn't pop something up in the corner
07:03:42  because
07:03:44  that hurts me inside
07:03:48  heh
07:03:53  also they can't be stupid shit
07:03:56  because that's lame
07:03:57  yeah no
07:04:00  spun around for 5 hours
07:04:06  wait no i'm adding that anyone who spins around for 5 hours is dedicated
07:04:09  but no others.
07:04:25  well the way upgrades in gravity well worked is that you could colonize planets, you start with one.
07:04:39  how long does it take to colonise a planet :P
07:04:43  basically suppply ships go back and forth from your planets
07:04:49  a... significantly amount of time? I don't remember
07:04:53  hmm i should probably actually watch a starcraft match, i have literally never done so, and i guess it's pretty relevant in terms of like
07:04:57  and the supply ships turn into new buildings on the planet which do things
07:04:58  balance, match length, randomn distribution
07:05:02  all of the buildings can be destroyed
07:05:07  but don't they like last for an hour
07:05:09  also eventually you get like better defense systems
07:05:22  elliott: starcraft is so beautiful ;_;
07:05:45  so anyway eventually planets get a research building
07:05:52  that slowly fills up a little meter thing
07:05:58  and then when you land on a planet with a filled meter
07:06:08  you get some kind of upgrade (I don't remember if it was random, probably)
07:06:30  but anyway the strategy was in the supply pods, enemies could kill them so you have to fly around and protect them.
07:06:37  (but seriously how long do starcraft matches last)
07:06:43  and that sounds cool but i dunno how practical it'd be for like
07:06:54  elliott: anywhere from 10 minutes to like up to an hour and a half or more.
07:06:55  something where you play someone you have a good chance of never playing again for not all that long
07:07:16  elliott: they can end very very swiftly or draw out forever
07:07:21  heh
07:07:21  usually there's a breaking point
07:07:48  elliott: well it doesn't work with the orbiting shipfighting stuff because colonies are like big battle stations that are really hard to kill.
07:07:55  right
07:07:57  once they're fully developed
07:08:11  oh also you can capture the supply ship things
07:08:16  I don't remember how
07:08:20  you like shoot a certain part of them
07:08:22  without killing it
07:08:30  i wish i knew more about the game i'm making. like: how big are maps even
07:08:30  I think
07:08:51  elliott: first question is probably what style of gameplay
07:08:59  but that's the hard one :)
07:09:01  elliott: You're making a game?
07:09:18  do you want something like a very tactical fighter or a more strategy colonization game.
07:09:18  Is it going to be in Haskell?
07:09:20  kallisti: i'm definitely more interested in like strategic tricks than just flying and firing constantly
07:09:25  shachaf: Yes, it is.
07:09:29  elliott: right
07:09:34  Is it going to be a real-time strategy game?
07:09:39  You should make one of those.
07:09:44  elliott: it would be interesting to not have colonies or anything but instead rely on strategy in a purely realtime fightery kind of sense.
07:09:55  shachaf: It might very well permit the words "real-time strategy game" to be used to describe it!
07:10:10  elliott: Is it going to encourage things that are not micro-management?
07:10:10  elliott: hmmm well....
07:10:29  Note that I'm using the words very literally :P
07:10:30  elliott: if you don't mind potentially long gametimes you could make colonization slow
07:10:37  shachaf: I hate micro-management, so yes. (The chances of there being more than one unit to control are ~0.)
07:10:42  elliott: this permits most planets to be uncolonized and suitable for epic dogfights
07:10:52  kallisti: one problem is that you can't actually have planets :P
07:10:56  elliott: the problem is: you now have colonies, why are you dogfighting go kill colonies.
07:11:00  kallisti: i mean you can have circles. but you can't go into their atmospheres or whatever
07:11:00  elliott: hmmm?
07:11:04  you can just orbit around them
07:11:05  because
07:11:06  they're just circles
07:11:09  elliott: right
07:11:14  that's what I was imagining as well.
07:11:16  right
07:11:20  GOOD
07:11:21  OKAY
07:11:24  i guess an important question is how big the circles are compared to you :)
07:11:33  elliott: oh interesting
07:11:46  in gravity well they were very very small in comparison to actual real life.
07:11:48  like do they fit on your screen, or are they like realistic-sized in which case that'd be a huge pain
07:11:55  or are they just like ten times the size of your ship
07:11:58  elliott: former is easier
07:12:02  yeah
07:12:04  latter is more challenging and interesting
07:12:14  kallisti: on the other hand, with like the complicated orbital transfer stuff
07:12:20  you don't want big things because it just multiplies tedium
07:12:27  but generally with a game with like... what, -1 developers? you probably want to make compromises on complexity.
07:12:33  you want a bunch of small planets in an interesting arrangement
07:12:34  kallisti: oh snap :P
07:12:40  do i count as 0 developers and ph -1
07:12:51  I'm probably like -3 and that makes -1
07:13:00  oh are you developing this, cool
07:13:04  i'll hold you to that
07:13:08  elliott: good
07:13:14  because I totally will
07:13:17  MY WORD IS MY HONROR
07:13:37  kallisti "klingon" kallisti
07:13:40  elliott: I think small planets would be better.
07:13:44  Once I have played a game, at anime convention, it is complete information without chance, except for the card you are dealt at the beginning of the game. Each player is dealt a random card from the deck at the beginning of the game, which is kept secret, and it tells the winning condition for that player.
07:13:46  yeah
07:13:49  unless large planets become better...
07:13:50  :P
07:13:56  as the ideas crystalize
07:14:06  it's definitely going to require a prototype to be able to figure out how it should be played at all
07:14:16  i mean the dogfighting concept is fairly new altogether
07:14:17  The planets with larger should have more mass and therefore more gravity
07:14:23  elliott: relatively new
07:14:26  i mean
07:14:27  for this game
07:14:30  it started out with just a gravity sim and some flying ideas and then we were like how can we make this into a game
07:14:40  elliott: what kind of mechanics were you thinking about re: orbital transfers
07:14:49  the IDEAL would be a massive newtonian mmorpg with like full simulated galaxies
07:14:55  also I seriously can't talk about this all night I HAVE SHIT TO DO.
07:14:55  and a massive economy
07:14:57  but
07:14:58  uh
07:14:59  fuck coding that
07:15:08  elliott: ..yes
07:15:16  possibly fuck playing that as well
07:15:27  well if you gotta be addicted to an mmo
07:15:35  it might as well be a 2d newtonian one with an awesome art style.
07:15:43  elliott: but this game isn't an mmo in its current incarnation right?
07:15:52  no :P
07:16:51  elliott: for lack of tedium I highly recommend some kind of powerful boost. also: forward and reverse thrusters (both with boosts that are not infinitely available always)
07:17:05  kallisti: well i was thinking about that like
07:17:16  a lot of the time with newtonian flights you're really just working against it going GOD DAMMIT LET ME TURN
07:17:18  otherwise you'll spend a lot of time just moving around and slowing yourself down and fucking up and turning back around etc
07:17:24  so the interesting thing to do is to make it not ABOUT turning
07:17:26  like
07:17:40  limit the various energies you have so that turning like that isn't even really an option
07:17:47 -!- copumpkin has quit (Ping timeout: 245 seconds).
07:17:49  because then you have to design things around taking ADVANTAGE of the newtonian flight
07:17:52  which is a lot more interesting
07:17:59  elliott: is it more error-prone
07:18:05  is what
07:18:12 -!- copumpkin has joined.
07:18:14  what you just described, not being able to turn easily
07:18:20  error-prone howso
07:18:21  relying on newton
07:18:24  like
07:18:28  would it be easy to fuck up
07:18:31  and then take forever backtracking
07:18:33  to get to where you want to go
07:18:41  well the idea is that most of the time you AREN'T just flying full-speed somewhere
07:18:52  like that "stable orbit with escapes" idea i had as a tactic
07:18:58  because that's the case in gravity well, and that even lets you turn (very slowly... a fast turn would probably have mitigated that actually)
07:19:20  elliott: hmmm okay
07:19:22  or maybe you're drifting but like at the last moment accelerate quickly which makes you meet up with an orbit
07:19:23  or w/e
07:19:51  elliott: you may have to automate some of the orbiting rather than relying purely on newtonian physics
07:19:57  kallisti: ph's idea on this: Nov 19 22:57:40 I suppose you could have limited but regenerating remass?
07:20:00  unless orbiting is relatively easy
07:20:05  and no, that'd defeat the whole point, the whole point was proving to oklopol that it'd work
07:20:13  also, we found a javascript/canvas thing that did 2d newtonian mechanics after that
07:20:18  and ph managed stable orbits with it just fine
07:20:21  help what is remass
07:20:22  i didn't but i'm shit at life
07:20:28  kallisti: ph is here to help: Nov 19 22:58:35 Remass is the amount you can change your momentum by?
07:20:44  ah okay
07:20:53  so like....
07:21:00  you don't have infinite thrust all the time basically?
07:21:31  that's one thing that could be done, yeah
07:21:38  the basic idea is that like
07:21:40  that's interesting.
07:21:42  letting you accelerate really quickly to a point
07:21:47  and then trying to hard turn in a vacuum
07:21:55  is a really stupid way to flight with newtonian physics because uhhh
07:22:01  it's awful and tedious and horrible
07:22:04  so instead of the powerful boost being a special kind of thrust, it would be your only sort of thrust.
07:22:08  so if you make it, like, not even possible, or at least really difficult
07:22:11  I had a few ideas for games: * Make a game using the periodic table of elements as the board. * Make a game using cards representing chemical elements. * Make a game using a real-time updated horoscope as the board. * Make a chess variant where some of the additional pieces on the board are hourglasses for varying lengths of time.
07:22:15  then you have to find other ways to fly
07:22:40  kallisti: btw i've been envisioning the non-bullets going quite slowly. in case you weren't.
07:22:43  like uh
07:22:46  Asteroids speeds I guess ;P
07:22:47  :P
07:22:48  I was not.
07:22:50  except maybe a little slower
07:23:03  kallisti: well it's more interesting because it allows for actual movement to dodge bullets and the like
07:23:10  ah right
07:23:19  kallisti: and makes things like trapping your opponent in a slowdown bubble and firing bullets at them from all around it less game-breaking :P
07:23:23  yes a slow-fast pace sounds good. :P
07:23:24  (that slows down the bullets too ofc)
07:23:30  Do you know how to make any game like my idea?
07:23:34  s/idea/idea(s)/
07:23:38  meaning you have time to react to things, but it's still fast enough to require quick reflexes
07:23:45  zzo38: nope, sorry
07:24:03  kallisti: also: ricocheting!!!
07:24:11  kallisti: no reason why bullets couldn't bounce off like, i dunno, space walls
07:24:32  I'm sort of envisioning a movement system where you can actually rotate very quickly but your thrusts are limited to short semi-powerful bursts.
07:24:47  yeah, that sounds interesting
07:24:47  in other words a way to precisely aim the angle of the momentum change
07:24:48  although you'd want like
07:24:50  a lower level thrust
07:24:52  which can't go fast AT ALL
07:24:55  but can be used all the time
07:24:58  so like, it'd be useless for turning
07:25:03  but it could gently ease into an orbit
07:25:12  the problem with that is that if you hit thrust long enough you will be going insanely fast and have no way to slow down
07:25:18  presumably you just wouldn't do that.
07:25:27  that's called suicide :P
07:25:41  kallisti: i was thinking of a partially mouse-based interface.
07:25:51  like rotating the ship would just be moving the mouse
07:25:55  But would you have any additional ideas to expand these? I have thought of some things too. Periodic table is not symmetrical but there are ways to make a game work anyways.
07:26:00  move mouse in circle = circular turning
07:26:01  elliott: same
07:26:07  quickly jolt it in the opposite direction = the obvious
07:26:15  elliott: that would be the easiest way to get a pinpoint aim on your angle of acceleration
07:26:46  elliott: I do like the slow thrusts only being useful to achieve orbit or to otherwise make minor corrections
07:26:51  yeah
07:27:05  that would be a good thing to bind to space :P
07:27:18  elliott: hmmm
07:27:23  elliott: you may even want three kinds of thrusts
07:27:36  one would be for long-distance flight
07:27:52  or escape I guess
07:27:52  With horoscope, the planets will not move much, but for a game of a few hours the movement of houses will be significant. You could also play by mail, or on an airplane, or whatever, to change a lot of things about the game; more changes than when you play chess by hand or by mail. But there would have to be time limit so that you cannot just wait until the planets are in your favor.
07:28:10  kallisti: that brings up the question of how big the map is :)
07:28:12  elliott: but then it would become trivial to evade slow-moving projectiles
07:28:20  just mega-boost in a sideways direction
07:28:29  and hopefully you don
07:28:33  't crash into anything
07:28:47  i'm not sold on the mega-boost yet. it seems like it reduces the interestingness of the physics
07:28:54  elliott: yeah just a thought
07:28:58  yeah
07:29:07  elliott: two sounds sufficiently probably.
07:29:08  For chess with hourglasses, you could have different hourglass with different durations having different movement abilities, or you could have hourglass be extra pieces that the different kind augment your power of normal pieces according to their position and time.
07:31:22  chess with hourglasses
07:31:23  is a good name
07:31:35  kallisti: another question is... how big the ships are :P
07:31:57  i was thinking they'd basically not be all that much more than simple small triangular-ish shapes, but that kinda reduces the interestingness of the ragdoll-physicsy aspect?
07:32:20  elliott: if the map is larger (larger map could benefit from more interesting varieties of planets, also would be good if any strategy is incorporated) then the mega-boost could instead be balanced by a long charge time.
07:32:24  like if a ship blows up it just blows up into debris
07:32:28  and if those hit things it'll be pretty painful
07:32:53  elliott: that's good
07:33:14  kallisti: good, but not as good with smaller ships
07:33:14  elliott: depends on the velocity of the particles as well
07:33:26  not necessarily
07:33:39  well how small are you thinking
07:33:42  little tiny fast traveling space debris = death bullet
07:33:58  elliott: help I have no scale
07:34:03  is "medium sized" an option?
07:34:06  http://upload.wikimedia.org/wikipedia/en/1/13/Asteroi1.png i was thinking... like that triangle ship, but maybe 2x bigger??? in physical terms
07:34:10  back
07:34:11  so
07:34:13  pretty small
07:34:16  but i dunno about that
07:34:21  i'd like different ship models???
07:34:28  elliott: that sounds good
07:34:30  but
07:34:33  I think it would be wise
07:34:37  to hold that off
07:34:40  the problem with different ship models is blah blah blah balance :P
07:34:41  for later
07:34:49  probably :P
07:34:51  start with one kind of ship
07:34:56  but it's something to consider when deciding
07:34:56  like
07:34:57  how big ships are
07:35:00  indeed.
07:35:03  because if they're small enough there's no room for variation.
07:35:30   i'd like different ship models??? <-- like triangle and square?
07:35:34  also different models could have different sizes and thus different masses but I don't even know what kind of advantages large ships would have
07:35:40  really, square is a viable shape in space
07:35:47  Vorpal: yeah but it's also an UGLY shape.
07:35:53  there is no reason to be aerodynamic.
07:35:56  hm
07:36:14  elliott: I'd say bigger than the on-screen triangle there but not in scale to other space objects.
07:36:23  elliott: so what shape then? I can manage some basic pixel art, but you seem to want to go for vector graphics rather
07:36:37  Vorpal: note: vector /wireframey/ stuff
07:36:39  not like
07:36:40  svg :P
07:36:47  something you could actually do on a vector display theoretically
07:36:47  elliott: you are on 2D
07:36:52  hollow
07:36:56  hm
07:36:57  right
07:37:05  well mostly hollow
07:37:08  not everything has to be hollow :P
07:37:28  Make the Einstein spacecraft game.
07:37:32  elliott: well you could do filled shapes by simply filling the hole. Due to the fact that the line has a width you will be able to fill a shape
07:37:41  not sure if you could do that fast enough though
07:37:49  Vorpal: it's about the aesthetic, not the implementation :P
07:38:00  elliott: debris is a good idea, but obviously physics should be taken into account. not everything is going to make deadly space debris that radiates in many directions because that would make killing another ship in a close range encounter unwise
07:38:04  the idea is basically to pump every polygon into the physics engine.
07:38:16  elliott: surely you are going to use the sound card to run this on an analogue oscope in xy mode?
07:38:18  and have special cases for "interesting" objects.
07:38:23  elliott: if not I'm not interested!
07:38:29  Vorpal: sry
07:38:33  :(
07:38:37  Vorpal: graphics card to run it on a pixel display in opengl mode :P
07:38:43  kallisti: well yeah
07:38:47  elliott: you seen the video of someone doing that for a demo right?
07:38:52  otherwise let me find the link
07:38:56  Vorpal: yes
07:38:58  you linked it
07:38:59  right
07:39:04  hm
07:39:12  Would you know how to make the Einstein spacecraft game?
07:39:12  elliott: still it was amazing :P
07:39:18  zzo38: nope
07:39:24  kallisti: gah now i want to get a simple prototype up and running.
07:39:38  elliott: that would, uh, be a good way to get the project rolling.
07:39:47  I don't know either. But it is an idea.
07:40:02  kallisti: well the good thing is, it makes me want to work on the thing i also need for my other game project.
07:40:09  elliott: good
07:40:18  elliott: there are lots of good things to a prototype
07:40:18  kallisti: which is known as
07:40:25  kallisti: project i don't want to write any fucking glsl shaders
07:40:28  kallisti: in case you haven't seen it: https://www.youtube.com/watch?v=s1eNjUgaB-g
07:40:46  okay so
07:40:48  20 minutes from now
07:40:51  I AM DISAPPEARING
07:40:55  AND WRITING THE REST OF THIS PAPER
07:41:01  right
07:41:02  kallisti: i think you can agree that that is the best name
07:41:14  Depending on the games, you might not require shaders, you might not require 3D, you might not require much at all. It depend much on what game you are making.
07:41:15  elliott: er what is?
07:41:17  kallisti: watch that video first, it is like 3 minutes or something. Not exactly long.
07:41:22   kallisti: which is known as
07:41:22   kallisti: project i don't want to write any fucking glsl shaders
07:41:26  oh
07:41:27  yes
07:41:32  very good
07:41:34  very enterprise
07:41:36  zzo38: everything is done by shaders these days
07:41:55  zzo38: as in, you need at least a basic shader to get anything drawn
07:41:59  Vorpal, HOW
07:42:03  Vorpal: You don't have to write a shader if you use a text mode.
07:42:04  Sgeo: what
07:42:07  unless you are using opengl 2.x
07:42:13  zzo38: then it isn't opengl?
07:42:22  Are oscilloscopes actually arbitrary display thingies that just .. what
07:42:25  Vorpal: Yes, then it isn't opengl.
07:42:28  Sgeo: they're vector displays
07:42:32  Sgeo: oh that, well they have an xy mode
07:42:36  and they are vector displays yes
07:42:43  elliott: anyway the best way to discuss balance is to actually have concepts coded in the game to test.
07:42:56  Sgeo: kallisti: (what the project actually is is a library which compiles functional list folds and maps and shit to glsl shader code.)
07:42:58  erm
07:43:01  that sgeo: was a mistake
07:43:03  Sgeo: normally the x signal is taken from time, but you can just put it in xy mode and use one input for each axis
07:43:05  elliott: because this asserts that the mechanic is practical to implement
07:43:12  elliott: because it's already implemented
07:43:12  kallisti: (because)
07:43:17  and then it allows you to actually test it.
07:43:18  kallisti: (i don't want to write any fucking glsl shaders)
07:43:21  Sgeo: well, that is a simplification of the normal operation mode, but basically yes
07:43:31  you have stuff like triggers and what not too
07:43:43  Sgeo: wouldn't work on a modern digital scope of course.
07:43:47  Vorpal, ah, ok.
07:43:48  they use bitmap displays
07:43:53  elliott: this is why games tend to have large numbers of cool things implemented in them that are subsequently removed in the production release.
07:44:05  or left as like easter eggs or cheats or whatever
07:44:12  kallisti: yes.
07:44:37  elliott: and networking will be essentially because, well, we need to players to actually test it.
07:45:08  kallisti: yeah, but i'd rather just get a simple ship flying in space with some random masses :P
07:45:10  first
07:45:14  elliott: well yeah
07:45:21  it would be weird to write the protocol before you have anything else.
07:45:41  kallisti: btw the problem with project i don't want to write any fucking glsl shaders is that instead i have to write a countably infinite number of glsl shaders
07:45:44  by writing a compiler to them.
07:45:51   kallisti: (i don't want to write any fucking glsl shaders) <-- it is quite easy actualy
07:45:52  "you dropped the ball elliott" - a person
07:45:53  actually*
07:46:07  Vorpal: yep, but i don't like writing c, and i don't like writing restricted c even more
07:46:10  elliott: you won't be doing lighting calculations right?
07:46:20  Vorpal: well there's neon glow, but... no.
07:46:25  Vorpal: HOWEVER, I will be for EC
07:46:28  elliott: then it is basically trivial
07:46:36  so i might as well save the pain of writing glsl once
07:46:39  and reap the real benefits later
07:47:02  elliott: it would be interesting to have a gun that simply emits force into space, though I suppose it would have to obey newton's third law
07:47:03  elliott: actually the major issue is getting the normals the right way around
07:47:08  in the input data
07:47:20  elliott: I'm taking a course in 3D graphics currently
07:47:27  elliott: so basically you could change the momentum and direction of things like asteroids.
07:47:29  Youscope is available as a .wav file somewhere in the interwebs; X and Y inputs as the left/right channels, just hook a 'scope to your sound card.
07:47:36  fizzie: I wanna hear that.
07:47:45  kallisti: that would be fun
07:47:46  fizzie: it is linked in the video description
07:47:48  elliott: ^
07:48:03  Vorpal: yeah i can hear things you say right after me
07:48:03  elliott: no clue what purpose that would have :P
07:48:03  fizzie: anyway "Most soundcards (and other players) seem to have a lowpass filter at about half of the samplerate, making some effects here look quite strange. The soundcard used in this video just didn't have proper filters so it happens to be suitable for these effects."
07:48:16  kallisti: throwing an asteroid at your opponent :P
07:48:25  elliott: strange, you must have a new beta version of irc then?
07:48:40  Vorpal: holy shit this sounds good
07:48:42  elliott: what if you could like...
07:48:50  Vorpal: Right; I was thinking it might be linked, but thanks to noscript couldn't click the "see more" thing.
07:48:53  elliott: collide asteroids into planets and fuck up their orbits
07:48:58  elliott: that's scary I don't even want to think about that.
07:49:05  kallisti: sounds fun!
07:49:10  fizzie: ah
07:49:17  elliott: space sandbox: the game
07:49:28  kallisti: http://universesandbox.com/ :P
07:49:42  elliott: you might like it. I don't. Oh well.
07:49:44  kallisti: http://mirror.kapsi.fi/koodaa.mine.nu/tvt/youscope-wave.wav seriously listen to this?????
07:49:46  SO GOOD
07:49:58  quite horrible
07:50:12  the amount of structure it has is amazing
07:50:28  elliott: why am I hearing silence
07:50:37  kallisti: turn up speakers??
07:50:40  max
07:50:44  it sounds like sound to me
07:50:45  or wait for it to change maybe your soundcard/speakers suck and are filtering that part
07:50:51  kallisti: check with another sound file to see if you can hear it?
07:50:56  elliott: not unlikely
07:51:02  kallisti: it works fine with my SB Live 5.1 card
07:51:04  elliott: laptop speakers and sound card
07:51:08  hah
07:51:08  uh, hold on
07:51:12  kallisti: me too
07:51:16  headphones for optimal experience
07:51:18  this is great
07:51:37  note for headphone users: turn the volume way down to avoid damaging your hearing
07:51:39  elliott: Maybe with the right amount of imagination (and/or chemistry) you can listen to youscope-wave.wav on your headphones, close your eyes, and see the corresponding effects.
07:51:51  lspci | grep -i audio
07:51:53  00:1b.0 Audio device: Intel Corporation 5 Series/3400 Series Chipset High Definition Audio (rev 06)
07:52:03  whoa hd audio nice
07:52:04  but it's HIGH DEFINITION
07:52:16  fizzie: Sounds fun.
07:52:21  kallisti: does other sound play currently? Sometimes I had alsa bug out on me randomly
07:52:21  elliott: maybe I'm deaf?
07:52:24   note for headphone users: turn the volume way down to avoid damaging your hearing
07:52:29  --vorpal, 54 years old
07:52:34  kallisti: Try another sound? :P
07:52:38  $ lspci | grep -i audio
07:52:38  Vorpal: oh right. let me check
07:52:39  00:1b.0 Audio device: Intel Corporation 6 Series/C200 Series Chipset Family High Definition Audio Controller (rev 05)
07:52:39  01:00.1 Audio device: ATI Technologies Inc Barts HDMI Audio [Radeon HD 6800 Series]
07:52:39  08:00.0 Multimedia audio controller: Creative Labs SB Live! EMU10k1 (rev 07)
07:52:55  ah yes
07:52:56  no audio
07:53:00  kallisti: like, "Disabling IRQ [IRQ for sound card]" randomly in dmesg.
07:53:05  No clue what caused those still
07:53:54  Why do video cards have audio cards nowadays.
07:54:15  hmmm alsa reload didn't work
07:54:25  elliott: you can send audio over HDMI
07:54:27  that is why
07:54:31  whyyyyyyyyyyyyy
07:54:35  kallisti: its not alsa
07:54:35  Because MULTIMEDIA.
07:54:38  kallisti: try downloading it and mplayer
07:54:49  elliott: there we go. alsa force-reload worked
07:54:50  elliott: because it is more like Digital SCART than DVI
07:54:54  (really)
07:55:03  kallisti: huh
07:55:07  The win7 laptop automagically switched default audio-out to HDMI when I plugged in the (no speakers or anything of that sort) monitor.
07:55:11  That was the cleverest.
07:55:16  Vorpal: https://www.youtube.com/watch?v=ZlZH1p0EUBs
07:55:16 * kallisti listens
07:55:17  heh
07:55:28  elliott: I think alsa reload didn't want to reload because other things were using it.
07:55:33  01:04.0 System peripheral: Compaq Computer Corporation Integrated Lights Out Controller (rev 03)
07:55:33  01:04.2 System peripheral: Compaq Computer Corporation Integrated Lights Out  Processor (rev 03)
07:55:34  Vorpal: synth straight to oscilloscope :D
07:55:36  Wonder what *that* does.
07:55:39  heh
07:55:47  elliott: nice
07:55:49  "Integrated Lights Out Controller"... sounds like it's for punching other components.
07:56:08  fizzie: you got the uplink edition
07:56:22  desktop: http://sprunge.us/ZRPi laptop: http://sprunge.us/IGJg
07:56:30  elliott: hmmm sounds mostly like a lot of frequency modulation synthesis
07:56:33  (This was from a server I happened to have ssh'd to accidentally.)
07:56:34  what is it?
07:56:39  kallisti: uh its that demo Vorpal linked
07:56:41  in .wav form
07:56:43  to be fed to an oscilloscope
07:56:49  to produce graphics
07:56:53  right i mean how was it generated
07:56:59  kallisti: you /did/ watch the video right?
07:57:04  some of it.
07:57:09  .
07:57:34  Vorpal: anyway I GUESS the shader might be trivial for aii but i dunno, maybe i want to do the background with a shader????
07:57:47  oh okay.
07:57:48  nevermind
07:58:05  elliott: yep. You want to basically draw a quad filling the screen and map the texture to it. You do that in the shader. Quite easy too
07:58:09  monqy: isn't it nice
07:58:10  huh
07:58:13  so it's like....
07:58:15  especially with no lighting calculations
07:58:16  3d waveform stuff
07:58:18  hi
07:58:22  that's interesting as a sound synthesis technique
07:58:29  Vorpal: no i mean generate it with the shader because there's a lot of parallaxen...
07:58:30  and
07:58:32  procedural
07:58:32  stuff
07:58:49  elliott: well, I don't know anything about that.
07:59:03  lol wtf that's insane.
07:59:10  how do you even do that with a time-domain signal
07:59:19  kallisti: do what with a time-domain signal?
07:59:29  make animations basically
07:59:32  oh right
07:59:34  don't ask me
07:59:36  I didn't make it
07:59:50  oh I see
07:59:52  it still amazes me that sound card even work.
07:59:54  You just draw one frame and then draw another?
07:59:56  cards*
08:00:00  X is left channel Y is right.
08:00:01  so yeah
08:00:24  why isn't there a line connecting everything on screen though
08:00:29  Vorpal: right
08:00:51  presumably that's not how x/y-mode works on an oscilloscope
08:00:56  Vorpal: there is, you can see it when it goes to a point
08:00:57  hm
08:00:58  it's just faint?
08:01:00  i think
08:01:04  hm okay
08:01:16  Europeans started to place magnetic mountains on their maps in the sixteenth century. A notable example is Gerardus Mercator, whose famous maps included a magnetic mountain or two near the North Pole. At first, he just placed a mountain in an arbitrary location; but later he attempted to measure its location based on declinations from different locations in Europe. When subsequent measurements resulted
08:01:16   in two contradictory estimates for the mountain, he simply placed two mountains on the map.[2][7]
08:01:21  You can also sort-of do the "same thing in reverse", use a sound card as an oscilloscope, if you don't mind having a horribly limited and cheap-ass 'scope; but there's software that has lots of buttons and all: http://www.zeitnitz.de/Christian/scope_en
08:01:40  And yes, if you move fast enough you can't see the line; you "draw" by moving slowly enough.
08:01:44  elliott: what?
08:02:05  fizzie: that's some insanely complex shit going on between the left and right channel though.
08:02:17 * kallisti mind blown
08:02:27  Vorpal: what
08:02:37  elliott: magnetic mountains? What?
08:02:46  see wikipedia article ``history of geomagnetism''
08:02:48  It got quite a lot of applause when it was shown.
08:02:57  Vorpal: anyway i forget what the other thing that isn't shaders is, that isn't deprecated
08:03:02  something buffer objects???
08:03:08  Everything Buffer Objects.
08:03:13  there's like two things that aren't deprecated in opengl these days, i know that much
08:03:14  elliott: you use those together with shaders
08:03:26  Vorpal: that's all, right?
08:03:29  elliott: like texture buffer objects or whatever their name was for textures
08:03:34  or is there
08:03:35  more
08:03:44 * kallisti is mesmerized
08:03:47  vertex arrays?? or??
08:03:51  elliott: well you need a bit of C code to synchronize it all
08:03:55  no shit
08:04:04  elliott: and yes there are those. Which is like buffer objects for loading vertex data in
08:04:13  so you don't have to send everything to the GPU every frame
08:04:15  Frame and Vertex and Pixel and Texture and Whatever Buffer Objects.
08:04:21  Vorpal: what i really want is just a "list of newest things"
08:04:27  with anything replaced by a newer thing omitted.
08:04:30  okay
08:04:32  time to
08:04:33  do things
08:04:36  enjoy
08:04:37  doing things
08:04:42  no
08:04:44  I won't
08:04:58  elliott: uh, I believe there is a #version nnn or such you put in the shader code that means it will warn you if you use stuff that isn't supported in said version
08:05:02  kallisti: ok
08:05:07  like #version 330 for opengl 3.3
08:05:15  Vorpal: no i mean there's things that aren't deprecated but you're not meant to use, i think even gl_begin/gl_end stuff isn't deprecated
08:05:24  Is "unjoy"-as-in-verb the opposite of "enjoy"?
08:05:24  it's just that like
08:05:31  elliott: gl_begin/gl_end are deprecated
08:05:37  Vorpal: citation plz
08:05:40  i've read that they aren't
08:05:44  elliott: it is just that they are supported in a compatibility profile
08:05:44  everyone expected them to be but they weren't
08:05:51  afaik
08:05:53  http://hackage.haskell.org/package/OpenGL ;; this is not helpful for figuring out which apis i have to use
08:05:56  because it includes everything
08:06:14  elliott: I'll look it up.
08:08:11  hm the book I have here is for opengl 3.1
08:08:17  so not exactly helpful on that point
08:08:47  elliott: (doing things) I suppose you intend to have realistic gravity?
08:09:02  kallisti: that's
08:09:08  sort of the point of the whole newtonian thing
08:09:08  elliott: are you on intel graphics?
08:09:14  okay. :p
08:09:14  if so I think you are stuck on opengl 2.x
08:09:15  kallisti: we're literally implementing newtonian physics
08:09:21  Vorpal: yes
08:09:29  elliott: then you can't use the new stuff
08:09:34  you are stuck on the old version
08:09:34  afaik
08:09:38  Vorpal: uh i am sure i can use shaders...
08:10:07  elliott: yes however your physics won't be realistic unless the spaceship to planet/star mass ratio is realistic even though the sizes are not.
08:10:17  so, I guess you're just going to do that?
08:10:17  elliott: try this: glxinfo | grep OpenGL | grep version
08:10:22  you should get two lines
08:10:33  kallisti: you can just make the planets more massive without increasing their size.
08:10:39  they can't collapse into black holes./
08:10:42  elliott: right, so yes
08:10:45  laptop (intel graphics):
08:10:47  $ glxinfo | grep OpenGL | grep version
08:10:47  OpenGL version string: 2.1 Mesa 7.7.1
08:10:47  OpenGL shading language version string: 1.20
08:10:49  bash: glxinfo: command not found
08:10:49  desktop:
08:10:55  $ glxinfo | grep OpenGL | grep version
08:10:56  OpenGL version string: 4.1.11005 Compatibility Profile Context
08:10:56  OpenGL shading language version string: 4.10
08:10:58  elliott: so install it?
08:11:14  /usr/bin/glxinfo is owned by mesa-demos 8.0.1-1
08:11:20  mesa-demos? Really?
08:11:49  OpenGL version string: 2.1 Mesa 7.11.1
08:11:49  OpenGL shading language version string: 1.20
08:12:08  elliott: then you are stuck on the old version of opengl with glBegin/glEnd and so on
08:12:12 -!- derdon has joined.
08:12:14  elliott: one problem I'm forseeing is that gravity assisted manuevers will be difficult when you have to reason about multiple gravitational forces pulling on your spacecraft
08:12:14  Vorpal:  OpenGL shading language version string: 1.20
08:12:19  elliott: you might be able to use a few basic shaders, but I wouldn't bet on it
08:12:23  elliott: also orbits even?
08:12:25   OpenGL shading language version string: 1.20
08:12:27  elliott: yep but you don't have most of the modern features
08:12:34  I dunno I'm not really a space physics expert
08:12:41  Vorpal: i'm pretty sure 1.2 will be quite enough for my limited needs.
08:12:42  elliott: you can do some /very/ basic shaders
08:12:57  elliott: still I'm pretty sure you only have the stateful API available
08:12:59  Vorpal: see, for instance, the fact that GPipe is completely GLSL 1.2
08:13:15  well I wouldn't use gpipe then
08:13:17  too limited
08:13:19  lol
08:13:33  you realise that
08:13:36  most games work on intel cards
08:13:37  right
08:13:40  however slowly
08:14:01  elliott: not the high end ones on linux. See PH trying to get stuff working
08:14:05  ...no
08:14:06  that's
08:14:07  because
08:14:11  he has massive driver problems
08:14:14  and most things crash his card
08:14:22  a problem which i have never experienced
08:14:27  and is entirely due to his system being fucked
08:14:29  Trine requires stuff not found on intel graphics for example
08:14:38  haskell's opengl binding: also opengl 2.1! all the people building actual shit on top of that MUST BE COMPLAINING!! oh wait they're not people use it just fine
08:15:24  elliott: point is, opengl 2.x is a completely different API from opengl 3.x and later
08:15:52  ph
08:15:56  Prior to the release of OpenGL 3.0, the new revision was known as the codename Longs Peak. At the time of its original announcement, Longs Peak was presented as the first major API revision in OpenGL's lifetime. It consisted of an overhaul to the way that OpenGL works, calling for fundamental changes to the API.
08:15:56  The draft introduced a change to object management. The GL 2.1 object model was built upon the state-based design of OpenGL. That is, in order to modify an object or to use it, one needs to bind the object to the state system, then make modifications to the state or perform function calls that use the bound object.
08:15:56  Because of OpenGL's use of a state system, objects must be mutable. That is, the basic structure of an object can change at any time, even if the rendering pipeline is asynchronously using that object. A texture object can be redefined from 2D to 3D. This requires any OpenGL implementations to add a degree of complexity to internal object management.
08:16:00  Under the Longs Peak API, object creation would become atomic, using templates to define the properties of an object which would be created with a single function call. The object could then be used immediately across multiple threads. Objects would also be immutable; however, they could have their contents changed and updated. For example, a texture could change its image, but its size and format coul
08:16:03  I know
08:16:05  d not be changed.
08:16:07  [...]
08:16:09  [...]
08:16:09  but there are still major changes
08:16:11  [...]
08:16:13  The final specification proved far less revolutionary than the Longs Peak proposal. Instead of removing all immediate mode and fixed functionality (non-shader mode), the spec included them as deprecated features. The proposed object model was not included, and no plans have been announced to include it in any future revisions. As a result, the API remained largely the same with a few existing extension
08:16:16  just not as major as they wanted
08:16:18  s being promoted to core functionality.
08:16:20  OpenGL 3.0 added support for frame buffer objects, hardware instancing, vertex array objects (VAOs), and sRGB framebuffers (gamma 2.2).[26] OpenGL 3.0 introduced a deprecation mechanism to simplify the API in future revisions.
08:16:37  elliott: also will the n-body problem be a... problem?
08:16:44  elliott: "With the release of the OpenGL 3.1 specification, a compatibility extension was also released that enables developers to access the OpenGL 1.X/2.X functionality removed in OpenGL 3.1.[28] Notably, legacy functionality for wide line support is retained."
08:16:50  "Removed legacy functionality includes:[29]
08:16:50      All fixed-function options"
08:16:57  Direct mode
08:16:57  Color index mode, i.e. pixel formats with color palettes
08:17:17  Vorpal: i'm not intending to use the fixed-function pipeline, so woo?
08:17:21  kallisti: yeah the whole game will crash if you have more than 2 bodies
08:17:31  :P
08:17:33  kallisti: (hint: it doesn't have to be exact)
08:17:38  elliott: but afaik fixed function + some limited shader is all you have in opengl 2.x
08:17:45  http://en.wikipedia.org/wiki/Runge%E2%80%93Kutta_methods
08:17:58  Vorpal: yes have i ever said i was planning to use not-shaders
08:18:14  elliott: Vertex Array Objects is new in opengl 3.0
08:18:28  elliott: blowing up moons should definitely be possible and awesome
08:18:31  *shrug* fine, so i have to use something else
08:18:35  and then they become... rings?
08:18:51  And when you collect 50 rings you get to the bonus stage wait that was something else.
08:19:17  Vorpal: anyway, i'm planning to buy a new computer soon sOOooooOOoooOoooOooOoooooo
08:19:18  elliott: anyway I can't help you with opengl 2.x much. I only ever worked with fixed function in old opengl. And with 3.3 or later for modern opengl
08:20:09  elliott: the dwarf fortress approach to map generation would be to formulate the universe from the big bang, with some randomized initial conditions, and then allow matter to stabilize into celestial bodies.
08:20:35  kallisti: that's what all sandbox games want to be really
08:20:49  Vorpal: anyway i could just use the fixed function shit
08:21:02  hell, i could probably just software render this, i just don't want to
08:21:17   And when you collect 50 rings you get to the bonus stage wait that was something else. <-- wait, was that sonic?
08:21:23  Vorpal: Yes.
08:21:29  right
08:21:39  Vorpal: *mario
08:22:19  fizzie: there was that starfox game that had rings too iirc
08:22:37  elliott: I seriously doubt a common PC could simulate the formation of galaxies over billions of years faster than the universe actually did it. (strong CakeProphet hypothesis)
08:22:43  Vorpal: Also VBOs were added to core OpenGL 3.x, but there's the GL_ARB_vertex_buffer_object extension in 2.1 already, and Mesa has supported it since version 5.1 from the 2003s.
08:22:51  ah
08:22:51  kallisti: is that your final prophecy
08:22:53  elliott: or, that it would be fast enough for the patience of the common gamer (weak CakeProphet hypothesis)
08:23:09  Extensions are of course mildly annoying to use.
08:23:27  fizzie: Gee, here I was thinking Vorpal's statement that people never did shaders properly before OpenGL 3.0 was bullshit :P
08:23:27  elliott: I am still a prophet: kallisti is merely my true name
08:23:31  s/OpenGL 3.0/2008/
08:23:34  That was what I meant to type.
08:23:46  I suppose it depends on the definition of "properly".
08:23:54  http://hackage.haskell.org/packages/archive/OpenGLRaw/1.1.0.2/doc/html/Graphics-Rendering-OpenGL-Raw-ARB-VertexBufferObject.html
08:23:58  htkallas@pc112:~$ glxinfo
08:23:58  The program 'glxinfo' is currently not installed.  To run 'glxinfo' please ask your administrator to install the package 'mesa-utils'
08:23:58  Oh no silly workstation installation.
08:24:08  import Graphics.Rendering.OpenGL.Raw.ARB.Compatibility
08:24:08  import Graphics.Rendering.OpenGL.Raw.Core32
08:24:33  GLintptr, a pointer so shiny it glints.
08:24:59  kallisti: I'll have to ask PH about prediction algorithms for this stuff.
08:25:08  I guess it shouldn't be TOO hard?
08:26:42  not impossibly difficult no.
08:26:51  not to create /some/ algorithm to generate a map.
08:27:03  elliott: you know, you are going to /hate/ TES lore about the dwemer ("dwarves")
08:27:07  kallisti: I wasn't talking about that.
08:27:11  elliott: oh
08:27:15  kallisti: I was talking about prediction for network stuff, since that is pretty important.
08:27:18  For maps I don't know what we're doing.
08:27:19  Runge-Kutta is the default differential-equation-solver method for the TI-86. (The other alternative is a straightforward Euler thing.)
08:27:19  elliott: they are actually a kind of stocky underground elves in the lore.
08:27:21  Procedural generation sounds right?
08:27:25  Vorpal: gross
08:27:30  elliott: I don't even know how that works so uh... >_>
08:27:34  elliott: :P
08:27:44  Vorpal: They're also MYSTERIOUS. What HAPPENED to them.
08:27:52  very true
08:28:06  fizzie: there are multiple theories in the in-game literature, as usual in TES games.
08:28:18  I don't suppose Skyrim elucidates much on the Dwemer? It doesn't sound like one of its CORE COMPETENCIES.
08:28:21  kallisti: What if there's no thrusts and you just shoot in the opposite direction to thrust.
08:28:28  I've read some of the books in Morrowind/Oblivion, yes.
08:28:31  they also weren't really short actually.
08:28:41   I don't suppose Skyrim elucidates much on the Dwemer? It doesn't sound like one of its CORE COMPETENCIES. <-- some stuff it does.
08:28:45  elliott: just nondeterministically split the game state based on every possible player input (including no input) until the game resolves the problem by actually receiving the input. :P
08:28:45  not much though
08:28:50  elliott: that sounds really dumb :P
08:28:54  fizzie: more than oblivion, less than morrowind I would say
08:29:21  Maybe I should just buy the silly game. 32.40 EUR with 0% VAT from Åland.
08:29:24  fizzie: there are way more dwemer ruins in Skyrim than in cyrodil (spelling?)
08:29:26  That's not *so* bad.
08:29:41  fizzie: You could pirate it (but you might feel bad).
08:29:43  Two i's, I think.
08:29:56  It's like QuickBasic but not?
08:29:59  in row? Pretty sure it isn't Cyrodiil...
08:30:10  "Cyrodiil is an Imperial province in the south-central region of Tamriel and the home of a humanoid race known as Imperials."
08:30:14  oh okay
08:30:26  and the setting of oblivion
08:30:27  "There's no I in TEAM, but there's two in CYRODIIL", like the old saying goes.
08:30:32  (I don't know what it means.)
08:30:56  Lurchtime.
08:31:10  fizzie: it means cyrodiil is a geography organism with two eyes.
08:31:11  there is also some indication that orcs might be a type of elves.
08:31:38 -!- zzo38 has quit (Remote host closed the connection).
08:31:41  unless they messed up their conlangs that is
08:32:34  So basically in Skyrim everyone is elf.
08:32:43  Dwarf are elf, orc are elf.
08:32:46  elliott: not humans. Or most monsters
08:32:52  Not YET.
08:33:00  Just wait for Skyrim II: Human Are Elf Boogaloo
08:33:02  elliott: maybe in TES VI
08:33:11  No, they're all Skyrim now. That's just how popular it is.
08:33:11  elliott: http://www.youtube.com/watch?v=Ncb7lHNWbnU
08:33:21  The Elder Scrolls V: Skyrim XIXIIXIXIXIXIX: So Very Tired
08:33:25  elliott: 10 minute tournamet final in Starcraft II
08:33:27  heh
08:33:44  kallisti: why do i want to watch this
08:33:58  elliott: because you mentioned wanting to watch a starcraft video that isn't 2 hours
08:34:07  elliott: also argonians and whatever the name of the cat people is are not elves.
08:34:11  kallisti: i stopped watching at "300 dollars for the winner" (ok i won't stop)
08:34:19  kallisti: i take it the korean prizes are like 1 mil
08:34:21  dollars
08:34:26  elliott: I have no idea
08:34:27  elliott: bretons might be human-elf hybrids according to some of the lore.
08:34:34  Vorpal: read as "bitcoins"
08:34:36  elliott: I actually don't know how badass these people are.
08:34:37  i swear to god
08:34:41  heh
08:34:47  elliott: but this lore has been around longer than skyrim
08:35:05  elliott: That video's from the beta, there wasn't much going on back then
08:35:09  kallisti: SWEET IT'S IN 720P
08:35:14  Deewiant: I can always count on you to know things.
08:35:46  kallisti: fuck it, if i'm watching this it'll be in 1080p
08:35:48  elliott: as far as I can tell protoss is going to win?
08:35:51  (spoiler)
08:36:05  ok i guess i'll
08:36:06  watch this
08:36:07  seriously
08:36:08  in 480p
08:36:10  elliott: Last weekend's MLG (in the USA) had a $120k prize pool
08:36:10  like a reasonable person
08:36:17  Not sure how that's divvied up though
08:36:23  elliott: do you have any idea what's going on?
08:36:28  kallisti: i just started
08:36:28  so
08:36:37  ok the blue things
08:36:41  are
08:36:42  blue
08:36:42  minerals
08:36:45  oh
08:36:46  resources
08:36:48  i thought they were flying things
08:36:55  which ones are the zergs i know zergs
08:36:59   kallisti: SWEET IT'S IN 720P <-- only? there is 1080p sometimes too
08:37:08  Vorpal: see a few lines later
08:37:08  zerg is the generic alien mutant things
08:37:11  right
08:37:13  protoss are the yellow-blue shiny
08:37:22  kallisti: out-macroed!!! worst concept i can think of
08:37:23  elliott: what happened to 4096p?
08:37:29  elliott: hm?
08:37:35  Vorpal: still going i think
08:37:41  elliott: do you know what macro means in this context?
08:37:42  why 480p
08:37:42  kallisti: nothing i say will make sense unless you sync to the point i'm at :P
08:37:45  elliott: slow download?
08:37:47  and i assume it's
08:37:48  a macro?
08:37:51  no
08:37:52  It's macromanagement
08:37:54  macromanagement
08:37:55  oh
08:37:57  jargon
08:37:58  so weird
08:38:02  Vorpal: yes and also i literally couldn't distinguish the higher ones because
08:38:04  Cf. micro
08:38:05  youtube compression is bad
08:38:14  elliott: basically what normal people do when they play starcraft. managing mineral usage and expansion and research
08:38:22  elliott: micromanagement is individual unit movement and tricks.
08:38:30  proxy
08:38:33  proxy proxy proxy
08:38:45  are they doing this commentary over skype
08:38:47  elliott: a proxy is an offensive outpost next to the enemy base
08:38:50  it sounds like it
08:38:56  to restrict them from expanding
08:38:59  and getting more resources
08:39:06  good protoss strategy
08:39:15  oh god, not starcraft
08:39:18  so do you play sc or just watch videos of it
08:39:23  i feel this is probably a legitimate distinction since
08:39:27  elliott: I play it.
08:39:29  I'm sure it is fun, but you seem to need to spend a lot of time to get into it.
08:39:32  most sports fans don't really play sports much on average i would guess
08:39:36  like
08:39:38  yeah
08:39:52  kallisti: i'm two minutes in, are they actually playing properly or just like preparing
08:40:06  next someone is going to start talking about DOTA games.
08:40:12  elliott: I don't know what you mean
08:40:25  kallisti: ok here's the real question i was asking
08:40:25 -!- monqy has quit (Quit: hello).
08:40:28  why aren't tehy doing anything interseting
08:40:43  elliott: they will
08:41:08  this game is fucking weird
08:41:21  i have to say the commentary style is very soothing
08:41:21  like
08:41:27  obviously it's basically obnoxious
08:41:30  ..yes
08:41:31  but i would not watch this without it
08:41:54  elliott: ever watched a DOTA style game?
08:41:59  nope
08:42:01  elliott: wow
08:42:03  this game
08:42:03  elliott: good for you
08:42:11  elliott: there are few more boring things
08:42:25 -!- Jafet has joined.
08:42:27  kallisti: oh hm
08:42:27  sure, probably players of the game understand it. I don't really
08:42:32  are we actually seeing the screen of someone playing
08:42:34  elliott: what time are you on?
08:42:36  or just of a commenterer
08:42:37  3:51
08:42:39  elliott: no it's a spectator screen
08:42:44  spectator player person
08:42:45  4:00
08:42:48  kallisti: right i was thinking that
08:42:52  not much seemed to be actually being done
08:43:36  elliott: oh well the protoss dude has a proxy at the zergs base
08:43:36  and they're basically buiding up units to prepare for a battle
08:44:02  shoulder-poking
08:44:06  the most menacing
08:44:08  elliott: so the protoss player can basically warp in units from his main base to that proxy thing
08:44:12  ok
08:44:40  elliott: If you want to see the player's POV, http://www.youtube.com/user/remembertomorrow0 has a ton of videos
08:44:57  elliott: "banelings" are little suicide bombers
08:44:58  Deewiant: I have a feeling it'd be signifiacntly less comprehensible
08:45:01  for zerg
08:45:11  elliott: You're right, it would
08:45:19  elliott: it's kind of hard to see what's going actually.
08:45:40  one thing i wanted to mention was
08:45:42  this is not starcraft 1
08:45:44  --commenter
08:45:45  lol
08:45:45  yes
08:45:49  thanks
08:45:49  for that
08:45:50  I lol'd
08:45:51  commentary guy
08:45:56  elliott: okay so the nydus worm
08:46:00  whoa
08:46:02  suddenly explosions everywhere
08:46:02  lets the zerg funnel units across the map
08:46:11  bloodg
08:46:13  elliott: so while that battle is going on
08:46:17  aaaah alien battle
08:46:19  another is going on at the protoss base
08:46:25  neat
08:46:26  that you can't see for most of the time.
08:46:30  how do humans play this game
08:46:32  do you buy ten monitors
08:46:39  elliott: no just one
08:46:49  you play it with a keyboard
08:46:57  elliott: this is amazing
08:47:02  How do single CPUs run multiple threads?
08:47:16  Deewiant: cpus aren't people
08:47:21  i cant reliably save register state
08:47:30  You're a bad person
08:47:33  :(
08:47:34  elliott: he basically kills the other guys base /after his base is gone/ with /workers/
08:47:44  elliott: and then has a flying unit that finished off the other buildings
08:47:51  lol
08:49:16  now to watch one of Deewiant's i guess???
08:49:19  oh gosh so many
08:50:03  Deewiant what's the best video
08:50:06  of the viedos
08:51:48  Not showering is Ruining E-Sports (self.starcraft)
08:51:50  starcraft
08:52:38  Ah, enjoying the Korean national sport I see.
08:52:40  elliott: I dunno, http://www.youtube.com/watch?v=01CTAzgTuKI is new and seems like it's not an entirely shitty game, try that
08:53:15  heh, another zerg protoss
08:53:34  I avoided the PvPs and ZvZs because they'd probably be boring
08:53:38  is he
08:53:39  I wonder if they made terran underpowered because in starcraft I terran was basically the best.
08:53:39  alt-tabbing
08:53:59  not enough minerals
08:53:59  not enough minerals
08:54:00  not enough minerals
08:54:00  not enough minerals
08:54:00  elliott: looks like it
08:54:00  not enough minerals
08:54:01  not enough minerals
08:54:07  kallisti: to do WHAT???
08:54:08  or is that just
08:54:10  the video recorder
08:54:12  kallisti: no clue
08:54:16  elliott: hi
08:54:17  kallisti: a lot of people are stupid
08:54:20  and thikn that if they just spam stuff
08:54:21  elliott: me too
08:54:22  they are magically better
08:54:23  elliott: He's pressing hotkeys, you can see the icon pressed in the lower right corner
08:54:23  so-called "
08:54:28  actions per minute"
08:54:31  Deewiant: but when the alt-tab dialogue pops up
08:54:32  in the middle
08:54:35  that's not a hotkey
08:54:44  in the first minute or so
08:54:49  elliott: people like to spam keys to keep them "warmed up" or something
08:54:51  Can't be bothered to find it
08:55:02  i think this guy is just pressing the same key a lot.
08:55:06  elliott: yes
08:55:20  elliott: the key to starcraft skillz is to have ADD
08:55:22  "Wtf "nobody likes Quebec"! HEY Deezer doesn't represent us at all! Please dissociate us from this fucktard.
08:55:23  "
08:55:25  help
08:55:29  ive entered another world
08:55:39  elliott: so yeah /watching/ the beginning of a starcraft game is really boring.
08:55:42  if you haven't noticed
08:55:49  should i just skip to the middle :P
08:55:59  eh, might miss something
08:56:04  im already missing everything
08:56:07  by way of having no idea what's going on
08:56:20  so wait is there any actual space involve
08:56:20  d
08:56:25  there's grass that's so
08:56:26  unspacelike
08:56:33  there's like floating space colony maps
08:56:42  but that's it.
08:57:03  kallisti: The idea is that in complicated situations the player with a higher APM will have an advantage (assuming a fairly equal situation otherwise), and it's easier to keep your APM high by doing stuff quickly right from the start instead of speeding up only when necessary
08:57:16  Deewiant: I disagree with that perspective
08:57:18  I understand the idea.
08:57:35  Where do you disagree
08:57:44  Deewiant: higher APM = advantage always
08:57:49  but I guess staying active makes sense.
08:57:51  Not always
08:57:52  i think this guy can almost certainly type faster than me
08:57:57  or are they only good at pressing the same key repeatedly
08:58:04  elliott: he's not typing anything
08:58:09  no but he's
08:58:10  pressing keys
08:58:11  lots
08:58:11  elliott: as far as words
08:58:15  oh those whispers are
08:58:16  yes I dunno what's up with that.
08:58:18  a voice saying not enough energy
08:58:23  yes
08:58:27  like
08:58:30  a creepy ghost baby
08:58:32  saying not enough energy
08:59:14  man he really likes spamming spawn larva all the time.
08:59:20  kallisti: In most cases, you only need like 30-40 APM to do everything necessary; but when you're fighting three battles at once and want to macro at the same time, the guy with the higher APM will mismicro less and macro better
08:59:20  not enough energy
08:59:20  not enough energy
08:59:21  not enough energy
08:59:21  that's the "not enough energy"s
08:59:21  not enough energy
09:00:39  elliott: those giant tentacle things are actually buildings
09:00:43  like defensive turrets.
09:00:53  this is a strange game kallisti.
09:01:48  kallisti: is this meant to be interesting 8 and a half minutes in
09:02:28  yes.
09:02:32  er
09:02:34  no I mean
09:02:36  that's when it gets interesting
09:02:39  actually
09:02:40  is around that time.
09:03:14  elliott: the focus early game is to efficienctly use minerals and have a quick build order while planning some kind of opening move.
09:04:00  this guy is pretty insanely fast.
09:04:07  when not spamming keys
09:04:53  That guy isn't very good compared to the average pro level
09:05:18  this is because professional starcraft people aren't actually mortal men.
09:05:24  Deewiant: isn't he some kind of strarrararcraft celebrity i seem to remember seeing
09:05:25  that name
09:05:30  elliott: Yes
09:05:35  Reddit likes him
09:05:54  oshi
09:05:59  SHITS GOING DOWN DAWG
09:06:23  And he is a pro, just not a very good one.
09:06:33  :D
09:07:10  yeah he's got way too many resources
09:07:14  that could be turned into death things.
09:07:30  He's maxed starting at around 12 mins
09:07:45  oh I see...
09:08:00  still he could spawn probably like 50 spore colonies
09:08:05  or whatever they're called now.
09:08:11  :P
09:08:31  are there any videos of insanely good koreans being incomprehensible, i have this kind of mythologised mental image of starcraft
09:08:36  i can vaguely see things moving about coherently
09:08:39  so this doesn't really rteg
09:08:42  kallisti: these maps are ujst fucking backgrounds
09:08:45  those walking guys
09:08:49  just walked over vacuum
09:09:00  elliott: they're probably air units...
09:09:05  BUTT HEY RE WALKING
09:09:09  which
09:09:11  Butt: Hey re: walking
09:09:16  kallisti: it was at 9 minutes or something
09:09:19  i paused it for a while
09:10:00  elliott: blue walking things?
09:10:08  "I was more impressed by the volume and variety of farts. One of them even smelled exactly what I ate for lunch 10 minutes later which made it a little bit of a surreal experience."
09:10:10  comment in the thread
09:10:10  Not showering is Ruining E-Sports (self.starcraft)
09:10:31  kallisti: i think green? complicated game.
09:10:33  complicated world.
09:10:46  elliott: oh do they move really slow?
09:11:12  I think those are overlords and they fly very slowly.
09:11:14  i don't know what slow is in this world...
09:11:15  they hover overhead
09:11:17  they kinda just
09:11:19  jogged over a little gap
09:11:27  the green
09:11:28  swarms
09:11:30  of joggers
09:11:34  no they float
09:11:40  kallisti: huge congregation at 11:57-11:59
09:11:43  and then
09:11:44  kaboom
09:12:03  oh wait
09:12:08  no those are flying things
09:12:09  Those are mutalisks, they fly.
09:12:14  FLY WITH WALKING ANIMATION
09:12:18  LAZY ANIMATORS LAZY!!
09:12:20  fly with flapping wings animation
09:13:55  elliott: they're green because he has them selected
09:14:08  their sprites looked green too but ok
09:14:35  oh yes he's green
09:14:37  that's his player color
09:14:41  o
09:14:51  players are color coded all pretty like
09:15:06  Deewiant: who's THE BEST at starcraft..........
09:15:30  No such clearly-defined thing
09:15:30  Deewiant: this guy basically just hits and runs with mutalisks the whole game while protoss builds a massive death force.
09:16:06  Deewiant: who's...... #1
09:16:31  No such clearly-defined thing
09:16:47  Deewiant: who's richest????
09:16:50  who has
09:16:52  the most starcraft ladies
09:16:53  ?????????
09:16:55  work with me here
09:17:16  not enough resources ;)
09:17:16  not enough resources ;)
09:17:16  not enough resources ;)
09:18:01  I'll plug the Swedes and say that Naniwa is among the best right now
09:18:01  Deewiant: I haven't see any other offensive units besides mutalisks
09:18:16  maybe some zerglings I think?
09:18:23  so is sc2 much different from sc1
09:18:24  wow
09:18:25  apart from being like
09:18:26  prettier
09:18:34  elliott: strategy is pretty drastically different
09:18:42  but still some basic stuff remains
09:18:48  oops they got to his core thing!!!!
09:18:49  same terminology is pretty much applicable.
09:18:50  dead
09:19:27  elliott: they added some new gameplay mechanics
09:19:33  for example the gold minerals which give you more shit
09:19:42  and the towers which let you see through fog of war a long distance
09:19:48  good for getting a heads up on attacks
09:19:57  and they have units that can scale cliffs.
09:20:32  which was not previously possible unless they were air units
09:20:45  jump units
09:21:27  for example, reapers are terran ground infatnry with jetpacks. they're very mobile, can jump up and down cliffs, and have special bombs they use when attacking buildings
09:21:31  his password is quite short.
09:21:34  so they're good at raiding enemies bases.
09:21:40  ooh i wonder if i could
09:21:41  use the mini image
09:21:45  to find out what keys he pressed
09:22:30  elliott: try
09:22:44  no
09:22:48  :P
09:28:16 -!- pikhq has joined.
09:28:21 -!- pikhq_ has quit (Ping timeout: 258 seconds).
09:29:51  Sgeo: something about joke and not being stupid
09:30:33  elliott, in #haskell ? I just had a brain failure, is all
09:30:41  Sgeo: no, i meant the whole
09:30:46   tutmirleiden, this chat is not, strictly speaking, a part of the tutorial
09:30:50   However, it does link to there, which may make it look like it is
09:32:09  elliott, I didn't mean to imply that he's an idiot. But I do think that the way it's set up may give people the impression that the chat is specific to tryhaskell
09:32:12  Speaking of finding out keys pressed, this -> http://www.cs.utexas.edu/~shmat/courses/cs380s/zhuang.pdf <- was a thing; it's old as anything now, of course; but still, unsupervised and all that.
09:32:51  fizzie: this video has both video AND audio
09:32:56  PRACTICALLY DONE
09:33:01  "Pentium IV 3.0G"
09:33:06  w hat
09:35:14   thanks mr elliot
09:35:15  thanks mr elliot
09:38:32  Dr Elliott.
09:38:38  *Elliot
09:42:33  Drelliot
09:42:44  Drilliot.
09:43:17  eliot
09:48:27  El-Jot, the lesser-known cousin of Superman.
09:49:46  the big money fight has drawn the shoporo
09:49:46  od dosens of companies in the entertainment
09:49:46  industry as well as attorneys gnnerals on
09:49:46  states, who fear the fild shading softwate
09:49:46  will encourage illegal acyivitt, srem the
09:49:47  grosth of small arrists and lead to lost
09:49:49  cobs and dimished sales tas revenue.
10:02:47 * shachaf looked up: how to make elliott mad
10:03:04 * elliott googled for:
10:09:28  hi
10:09:56  elliott: help nothing appears
10:10:00  when you google for:
10:26:08 -!- Sgeo has quit (Ping timeout: 240 seconds).
10:27:04 -!- Sgeo has joined.
10:42:06 -!- GreaseMonkey has quit (Quit: The Other Game).
11:01:42 -!- ais523 has joined.
11:09:51  hi ais523
11:10:09  hi elliott
11:10:55  have you seen the argument between HP and Oracle?
11:11:10  apparently, Oracle have accused HP of paying Intel to keep maintaining Itanium
11:11:13  nope
11:11:47  and they're probably upset about this because they have to keep their Itanium support contracts with HP up
11:12:02  the typical reaction from everyone else is, "well, why /can't/ HP pay Intel for Itanium?"
11:14:37 -!- Lymee has joined.
11:15:08 -!- Madoka-Kaname has quit (Ping timeout: 244 seconds).
11:22:53 -!- Lymee has changed nick to Lymia.
11:32:12  elliott: Is Series 2 any good?
11:32:30  shachaf: Yes, but not nearly as.
11:32:42  The Music 2000 episode is good; also the computer one as I recall.
11:32:47  Hrm.
11:33:22  Also it's really spotty on YouTube, I just bought the DVD.
11:33:25  It's not on that video website, as far as I could tell.
11:33:28  Right.
11:33:36 * shachaf might do that.
11:33:39  Well, http://www.youtube.com/watch?v=WYwPD7ARJ0Y is... the first ten minutes.
11:33:58  I suppose supporting a noble endeavor such as this is worth something, after all.
11:35:07  elliott: NON-USA FROMAT. :-(
11:35:26  shachaf: Oh please, don't they sell universal DVD players or whatnot?
11:35:32  You could just rip it or something.
11:35:36  I suppose libdvdcss plays it just as well, but still.
11:35:54  elliott: As I mentioned, I don't even *own* a television. What good would a DVD player do me?
11:36:17  Heh.
11:36:21  I much prefer to have my MPEG streams delivered to me over TCP/IP over insertkmchere.
11:36:21  `quote DVD players
11:36:28  29)  after all, what are DVD players for?
11:36:51  that's a surprisingly early quote
11:37:16 * shachaf wonders if there's any context worth knowing.
11:37:24  elliott: most DVD players are reasonably easy to hack to play foreign DVDs
11:37:45  typically it's included as an easter egg, because the ability to do that promotes sales of the DVD player, yet they aren't allowed to officially know about it
11:37:51  heh
11:37:57  i recall looking it up on some website once
11:37:58  and it's like
11:38:01  elliott: Hmm, there's no US-valid Series 2 DVD for sale as far as I can tell.
11:38:02  OPEN CLOSE EJECT MENU 3 4 4 EJECT CLOSE
11:38:11  shachaf: It's because we're racist.
11:38:44  elliott: yes, it's typically that sort of thing
11:39:06  @where ais523
11:39:07  I know nothing about ais523.
11:39:29  lambdabot: but I'm here
11:43:31  elliott: Hey, I haven't seen _Ghosts_.
11:43:36  I thought I had but I hadn't.
11:43:41  Lucky you!
11:43:48  That's like a free new episode was created just for me.
11:43:49  I think that's the most bizarre episode of the first series.
11:44:42  Pig's milk. Pilk.
11:45:33  Spider milk, silk?
11:46:07  Yes.
11:51:26  today's XKCD is really impressive
11:51:30  it's not funny, but it's not meant to be
11:51:48  it's one of those ones where he just got a stupidly large number of statistics and made a drawing out of them
11:51:50  yesterday's!
11:51:54  well, OK
11:51:56  it's today's too
11:52:02  heh
11:55:03  I assume people don't actually read xkcd unless they're linked to it
11:55:13  also, that "today's xkcd" is a good enough link for most people to follow
12:12:05 -!- Slereah has joined.
12:12:48 -!- Slereah_ has quit (Ping timeout: 245 seconds).
12:18:29 -!- aloril has quit (Ping timeout: 240 seconds).
12:32:09 -!- aloril has joined.
12:37:50 -!- MSleep has changed nick to MDude.
12:41:23 -!- Phantom_Hoover has joined.
12:45:24 -!- pkzip has joined.
12:46:12 -!- pkzip has left.
12:59:51  06:33:04:  realtime games and networking kind of don't work
13:00:10  Thing is, describing AII as a dogfighting game makes it sound too fast-paced.
13:00:21  ++
13:00:31  I go into that more a bit later.
13:00:38  I can't really see it working except as a slower-paced thing where you need to plan your course.
13:10:58  is this an existing game, or one you're planning to write?
13:11:42  ais523: Latter.
13:12:00  also, are those lowercase ls or capital Is?
13:12:08  Capital.
13:12:09  AlAIAlAIA
13:12:12  Is, by the look of it
13:12:20  It's short for Asteroids II, which is really going to have to be replaced by a proper name.
13:12:25  Maybe we'll just call it... aii.
13:12:33  the two letters are marginally different in this font, enough to tell them apart with a comparison, but not to be sure about them without one
13:13:12  looks like a difference of one vertical pixel exactly in length
13:24:11  OK *seriously* what is it with the Runge-Kutta methods.
13:24:47  Everything I can find says they're for ODEs, and yet I've only seen them given for first derivatives.
13:25:08  Phantom_Hoover: /queryyyyyyyyyyyy
13:25:25  Are the Runge-Kutta methods secret.
13:25:36  Yes but actually no.
13:25:37  Also I'm seeing if anyone in the channel knows what's up with that.
13:25:44  I know.
13:25:47  It wasn't about Runge-Kutta :P
13:28:29 -!- Patashu has quit (Quit: MSN: Patashu@hotmail.com , Gmail: Patashu0@gmail.com , AIM: Patashu0 , YIM: patashu2 , Skype: patashu0 .).
13:35:34  time to release DMT from my pineal gland (assuming that's actually what happens when you dream)
13:35:51  as my body enters a state of partial paralysis
13:36:36 -!- Phantom__Hoover has joined.
13:37:15  enjoy kallisti.............
13:37:27  I don't want to enjoy kallisti!
13:38:32 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds).
13:51:13  ais523: oh no, I think I just decided that Crawl-style viewpoint movement is the best
13:51:58  why? it's really disorienting
13:52:07  although it depends on the game, I guess
13:52:18  for a horror shooter sort of game, that sort of disorienting viewpoint works great
13:52:30  ais523: yep, but the situation here is a display 20 times as large as the terminals Crawl is usually played in :P
13:52:42  (well, I suppose most Crawl players use tiles since it's so popular on Windows...)
13:54:18  ais523: and I think the disorientation at that scale can be eliminated simply by making the "camera" lag behind the player a little bit
13:54:41  i.e., while moving you're off-center in whatever direction you're travelling in, and when you slow down the camera smoothly scrolls into the center
13:55:40  hmm, perhaps
13:57:09  ais523: (the context is AII :P)
14:03:59 -!- myndz\ has quit (Ping timeout: 244 seconds).
14:23:39  ais523 help
14:32:44  Phantom__Hoover: why do you keep making random demands of me without context?
14:39:32  No it turned out that makes sense, although now I'm wrestling with the cover for the PCIe card.
14:40:17  Phantom__Hoover: While the motherboard collects...
14:40:18  STATIC?
14:40:57  hint: things collect static from moving or having things move across them, not from staying still
14:41:17  ais523: You don't understand, in Scotland static is magic.
14:41:31  It's caused by humidity, flourescent lights, and nearby microwaves.
14:41:56  hmm, I'm now more or less convinced that the latest batch of spambots work by taking a legitimate page on the subject and running it through a translation service twice
14:42:36  I've got reasonably good at reading machine-translated English (it's a /very/ valuable language to know in today's world), and they seem to be writing in that
14:43:21  hmm, I'm mostly over the depression, too, even though Feather didn't really help
14:45:42  meanwhile, I'm busy trying to track down a bug in this ICA compiler
14:46:00  it's showing up as an off-by-one, but I'm not convinced that it actually /is/ that; I suspect it's actually an off-by-n where n=1 by chance
14:46:03  but who knows
14:52:12 -!- copumpkin has quit (Quit: Computer has gone to sleep.).
14:58:59  OK I have discovered a horror even worse than the PSU cables: the motherboard/case connectors.
15:00:35 -!- derrik has joined.
15:00:48  Sometimes there's even no indication which way around the leds go.
15:14:23  ais523: Example plox?
15:14:30  (Of spambots)
15:14:46  Gregor: a moment
15:15:45 -!- augur has quit (Remote host closed the connection).
15:15:54  A lot of us in the website that were having success ended up applying some type of fasting into their diet. A primary though ended up being that going barefoot didn't seem healthy. I actually appeared to be within impression that we had to be feeding on every 3 periods or maybe my own body would definitely come in for you to disease mode.
15:16:18  Gregor: ^
15:16:44  it doesn't feel like a markov bot; the sentences have an internal logic, but the word choice is completely bizarre
15:17:13 -!- copumpkin has joined.
15:17:13  lol
15:17:51 -!- Gregor has set topic: The IOCCC is back on! http://www.ioccc.org | http://esolangs.org/ | Wwe had to be feeding on every 3 periods or maybe my own body would definitely come in for you to disease mode. | half-add er? I ardly knew er! | http://codu.org/logs/_esoteric/.
15:18:13  I got zero day all day but its specific to my paycheck so i ain't selling that. Job is shitty enough.
15:18:22  Gregor: "Wwe"?
15:18:29  (quoting my fav discussion bot)
15:18:48 -!- Gregor has set topic: The IOCCC is back on! http://www.ioccc.org | http://esolangs.org/ | We had to be feeding on every 3 periods or maybe my own body would definitely come in for you to disease mode. | half-add er? I ardly knew er! | http://codu.org/logs/_esoteric/.
15:18:52  ais523: You didn't see that.
15:19:02  fungot: Chat with us.
15:19:03  Gregor: biscuit, and the remembrance of that sacrifice the short term for the long term, because they won't be your friends even without it, you can't... such a fine day. an entire barrel can easily be a dealbreaker!
15:19:15  fungot: T-Rex!
15:19:16  elliott: t-rex, i don't know, a cute little skirt, and thus, it no longer represents you. for whatever he or she or it or at better jobs as they come up all the time, and when they do, there's no moment of laughing realization, so you can't ever do a video epitaph for us all will read?
15:19:33  elliott: coincidence? or is fungot doing some sort of word-copying?
15:19:33  ais523: is that a fad? chinese so that my computer could think about sex, and that would be all it would take to change a lightbulb. the light turned on and on about order versus freedom, the giddy joy, t-rex
15:19:42  probably engineered coincidence
15:20:28  ais523: If it's in any way affected by the input, it's not intentional.
15:20:47  fizzie: indeed; I suspect it was elliott setting up for a likely coincidence
15:20:56  how does fungot do its randomization, btw? some sort of ?-based RNG?
15:20:56  ais523: i, too, will take what i can get a little of that back with them, dromiceiomimus
15:21:45  ais523: There's a loop which does "4*, then ?-based 0/1/2/3+" a couple of times, I think maybe 28 bits' worth or something.
15:21:58  Maybe not quite that many.
15:22:00  that's surprisingly sensible
15:23:10  There's one hardcoded [0..15] RNG done with a sequence of a ?-powered 0/4/8/c+ and a 0/1/2/3+, too. It's used for determining when to stop or some-such.
15:23:34  Wow, I have some iron-rich blood.
15:23:38  My blood tastes exactly like rust.
15:24:08  Gregor: blood is kind-of heavy in iron because a transition metal's needed to bind to the oxygen
15:24:40  Yes, I know that :P
15:25:01  ais523, blood scientist
15:25:14  Better that than just a blood dabbler.
15:25:19  X-D
15:25:30 -!- Gregor has set topic: The IOCCC is back on! http://www.ioccc.org | http://esolangs.org/ | We had to be feeding on every 3 periods or maybe my own body would definitely come in for you to disease mode (don't dabble in blood). | half-add er? I ardly knew er! | http://codu.org/logs/_esoteric/.
15:25:39 -!- elliott has set topic: http://codu.org/logs/_esoteric/.
15:25:47  :'(
15:25:58  Occasionally one must curtail the jocularity of the hoi polloi.
15:26:02 -!- Gregor has set topic: The IOCCC is back on! http://www.ioccc.org | http://codu.org/logs/_esoteric/.
15:26:16  we need that IOCCC notice until it isn't, I think; it's potentially important
15:26:28  the topic notice wrt the Wolfram prize thing earned be a moderate amount of money
15:26:35  We need it there until we no longer need it, I think.
15:26:38  (well, about a year's salary, that's quite a bit but not lifechanging)
15:26:42  ais523: yeah, and do we really want to repeat THAT mistake? ;D
15:27:00  I didn't realize he'd learned that in an #esoteric /topic X-D
15:28:10  Gregor: he talked to me about it for about five minutes in the third person
15:28:20  then i was like "oh, is the winner in here?" "yes" "is the winner... you?" "yes"
15:29:18  elliott: If that's the case, then "the topic notice wrt the Wolfram prize thing [did /not/] [earn him] a moderate amount of money"
15:29:43  Gregor: What :P
15:30:42  elliott: He said that the topic notice earned him money, that implies that he learned about the competition from the topic notice.
15:31:12  Yes, he did.
15:31:15  I did
15:31:17  This was after he won.
15:31:28  then after I won, I strung people along a bit
15:31:36  elliott: Oh, I thought you were making a wholly different point X-D
15:32:05 -!- derrik has left.
15:36:01  Gregor: You should MAKE MUSIC FOR AII!!!!!!11111111111111111111111
15:36:07  111111II1111111II
15:37:09  AII?
15:37:25  hmm, perhaps you should fix my creative dead end with the DNA Maze level music
15:37:34  DNA Maze?
15:37:38  which I think is great, but I've got stuck at the end of the chorus
15:37:43  Gregor: how have you never heard of DNA Maze?
15:37:57  How?
15:38:02 -!- ais523 has changed nick to ais523\unfoog.
15:38:07  Gregor: indeed, how
15:38:13  you're a regular of this channel, right?
15:38:24  Gregor: AII = Asteroids II! EXPANSION IS COMPLETELY UNOFFICIAL.
15:38:29  Because it would get us: SUED.
15:38:39  ais523\unfoog: Yes, but I'm also a regular of the USA, whose timezones are somewhat distinct from yours.
15:38:46  (Yes, the USA is a person)
15:39:07  And the Asteroids II Extended Edition, aka AIIEE, one presumes.
15:39:35  Gregor: well, it's a computer game that I've written
15:39:43  with the main single player mode around 90% finished
15:39:46  Gregor: To give a not entirely unhelpful answer, it's a Newtonian-physics space-based real-timeish physics strategy game with... sort of dogfight elements and ... a lot of orbital transfers ...
15:40:09  elliott: where "it" = AII, not DNA Maze
15:40:17  you confused me for a bit there
15:40:37  elliott: Newtonian physics are for losers, relativity would make asteroids so much "better"
15:41:06  Are? Is?
15:41:15  Gregor: Basically it's a buncha spaceships vs. a bunch a' other spaceships in 2D space under Newtonian physics with a bunch of masses orbiting each other and shit and the strategy is based around complicated planning, orbital transfers, and physics-warping shit like "make-time-go-slower-inside-this-bubble bubble" :P
15:41:21  Also the NEUTRINO GUN.
15:41:40  OK it is seriously a much better idea than it sounds I've just been avoiding the term "dogfight" because Phantom__Hoover quite rightly pointed out it makes things sound way too fast and brute-forcey :P
15:42:07  ais523\unfoog: Current state of musicx?
15:42:37  Gregor: Also it theoretically will have a TOTALLY NEAT vector graphics aesthetic?? Also ragdoll physicsy things?? Gravity?? Black holes?? Network multiplayer??
15:42:42  Gregor: I'm mostly composing it myself; I have a few level musics done which are nothing special, and a main menu theme which I really like but repeats too quickly
15:42:48  WHY DO YOU LOVE DNA MAZE MORE THAN AII ;__;
15:43:04  elliott: Dood, I'm goin' back and forth here.
15:43:06  GIMME BREAK
15:43:10  No you're abandoning us. With hate.
15:43:10  elliott: because it isn't completely vaporware?
15:43:12  But yeah, I totally write game music.
15:43:21  ais523\unfoog: Neither is AII
15:43:30  elliott: how many lines of code does it have?
15:43:41  and does it have an indentation discipline all to itself?
15:43:48  Dunno how long gravity.lisp is, but it's been worked on for about... two years now :P
15:44:02  (Gregor: elliott's actually taken to defensively asking me "is it indented like DNA Maze?" whenever I threaten to send him code)
15:44:10  (in C, at least)
15:44:18  Basically Phantom__Hoover is handling the hard PHYSICS MATH and all three of us are bending it into a game :P
15:44:30  ......................
15:44:38  hi
15:45:07  int main(void) {
15:45:13    printf("Hello, world!\n");
15:45:14  I'm not sure what Gregor's megaellipsising at :P
15:45:17    return 0; }
15:45:20  (ais proceeds to paste in his entire program)
15:45:28  Gregor: that's a simple example
15:45:33 -!- augur has joined.
15:45:43  So, terrible then.
15:45:44  indentation is like Python when seen from the left, and all the braces go at end of line
15:46:10  it's designed to annoy all indentation fanboys equaly
15:46:13  *equally
15:46:22  hmm, perhaps I should make it use 5-space indents just to keep everyone unhappy
15:46:36  or 1-space 1-tab (in that order) would do that job even better, I guess
15:46:46  or 3-space 1-tab in that order
15:46:49  How 'bout using vertical tabs, and just making sure that your editor displays them as tabs.
15:47:09  Gregor: Have I mentioned that DNA Maze's indentation style also replaces sequences of 8 spaces with tabs?
15:47:12  Despite using a 2-space indentation?
15:47:20  elliott: oh right, that
15:47:21  Now ais523\unfoog will start the Tab Idiocy again.
15:47:30  Brace yourselves, semicolon yourselves.
15:47:33  elliott: we've changed from Netbeans to Eclipse in the labs down here
15:47:50  and Eclipse is producing code with mixed tabs and spaces, with tab != 8
15:47:57  and it's basically impossible to mark as a result
15:49:11  well, OK, I'm used to reading badly-indented code, so it's just /annoying/ to mark
15:50:37  Just run everything through indent -kr :P
15:51:26  Gregor: oh right, I mean to do that on my IOCCC submission
15:51:46  astyle makes such a beautiful mess of it (some lines end up indented so far that they wrap the entire screen in my terminal, even if I maximise it)
15:54:13  hmm, the results of running indent on it are arguably better than the original, though, although still far from optimal
15:54:18  ais523\unfoog: Feel like giving us clues about your IOCCC submission? :P
15:54:27  I've told you what it does already
15:54:35  it's a single-transferable-vote counter that stores data using stack smashing
15:56:34  hmm, how easy is it to use Emacs as a batch reindenter?
16:12:09 -!- copumpkin has changed nick to immoral.
16:12:14 -!- immoral has changed nick to copumpkin.
16:25:19 -!- Lymia has left ("Hug~♪").
16:28:18  Ohyeah
16:33:09 -!- Lymia has joined.
16:36:05 -!- FireFly has quit (Quit: ZNC - http://znc.in).
16:37:07 -!- FireFly has joined.
16:37:43 -!- FireFly has quit (Changing host).
16:37:43 -!- FireFly has joined.
16:43:13 -!- new2net has joined.
16:53:13  ais523\unfoog, OK now the computer is not actually doing anything when plugged in and the power button is pressed.
16:53:26  Like, literally nothing happens.
16:53:35  Phantom__Hoover: is the power supply switched on?
16:53:38  Yes.
16:53:45  It's switched on at the plug, too.
16:53:50  Phantom__Hoover: It died of static.
16:53:50  RIP.
16:53:52  is the power button connected?
16:54:08  I've tried putting the power button wires in both orientations.
16:54:45  hmm, in that case ask someone who's actually assembled a computer (i.e. not me)
16:55:02  my mobo has a test button and led on it. IIRC for testing that the memory modules work, but obviously you could use it to check that power + memory modules work
16:55:10  maybe your mobo has something similar?
16:55:23  Great, I have a completely fucking useless paperweight and I'm getting pinballed around.
16:55:25  Phantom__Hoover: is the processor hot?
16:55:32  also, does it smell of burnt silicon?
16:55:34  I don't know.
16:55:40  Literally nothing at all happens.
16:55:43  you can figure out if the processor is hot by touching it
16:55:48  Phantom__Hoover: do you have a multimeter?
16:55:55  No, of course I don't!
16:55:59  oh okay
16:56:12  also, the problem's probably with the power supply or the power button if the power supply fan doesn't spin up
16:56:15  `addquote  Phantom__Hoover: is the processor hot?   also, does it smell of burnt silicon? [...]  you can figure out if the processor is hot by touching it
16:56:18  733)  Phantom__Hoover: is the processor hot?   also, does it smell of burnt silicon? [...]  you can figure out if the processor is hot by touching it
16:56:31  elliott: who are you poking fun at there?
16:56:31  how is that funny at all?
16:56:39  ais523\unfoog: nobody
16:56:45  I thought the "I don't know" was the funny bit there
16:57:00  true
16:57:04  Vorpal: the first two lines are amusingly specific in their prognostication, and the third is amusing in its obviousness
16:57:21  elliott: the funny line is really the " I don't know."
16:57:39 * elliott disagrees, and doesn't think you'd be saying that if ais523\unfoog hadn't said it.
16:57:47  Like, I turn on the cable at the socket, turn on the PSU, press the power cable, and... nothing.
16:57:48  The transition to the third line is ruined by adding that one.
16:58:03  I did notice it was a bit weird in the original context
16:58:07  Phantom__Hoover: You press the button, not the cable. hth
16:58:10  Phantom__Hoover: how do you press a cable anyway?
16:58:20  Button, dammit.
16:58:20 * elliott thinks this will calm down Phantom__Hoover immeasurably.
16:58:32  Phantom__Hoover: anyway you should really get a multimeter tomorrow or such. They are cheap really. Don't know exact prices, but I seen ones below 100 SEK. They should be good enough for just checking if you have a voltage where you should in the PSU connector
16:58:41  elliott: I'd have added it as  PH: is the processor hot? [...]  I don't know  you can figure out if the processor is hot by touching it
16:58:47  with the abbreviations expanded
16:58:51  Phantom__Hoover: that is, standby power
16:58:51  ais523\unfoog: hmm, tempting
16:58:54  ais523\unfoog: I'll review it tomorrow
16:58:57  How am I meant to touch it with the cooler in the way?
16:59:00 * elliott stamp
16:59:08  Vorpal: I once bought two multimeters for £5
16:59:17  ais523\unfoog: don't know what that is in SEK
16:59:24  Phantom__Hoover: Touch the cooler?
16:59:26  It'll be, y'know, hot.
16:59:28  Phantom__Hoover: well, you'd have to open the case, which is a sensible thing to do anyway when diagnosing computer problems
16:59:33  but yes, that's a good point
16:59:43  the whole point of a cooler is to be at the same temperature as the processor
16:59:44  Phantom__Hoover: Anyway, if the PSU fan doesn't go on, like ais523\unfoog said, it won't be a CPU problem.
16:59:59  assuming the PSU has a fan, which is likely but not guaranteed
17:00:02  Phantom__Hoover: So... doublecheck everything from the power button to the socket to the PSU?
17:00:04  indeed it is then either a mobo problem or PSU problem
17:00:07  ais523\unfoog: It does.
17:00:07  The PSU does, in fact, have a PSU.
17:00:12  I mean a fan.
17:00:17  ais523\unfoog: you need a really low power PSU to find one without a fan
17:00:18  My PSU doesn't have a PSU.
17:00:21  ais523\unfoog: like a laptop one
17:00:21  Vorpal: Not true.
17:00:30  Vorpal: There are 350W, 400W PSUs without fans.
17:00:40  They're just very rare.
17:00:53  elliott: I count <400W as really low power for a desktop
17:00:56  I think the Zalman TNN thing is 420W, but it's part of the heatpipe system so it doesn't really count.
17:00:57  the PSU fan is pretty much the one thing that is almost certainly going to be correctly wired to the PSU
17:00:59  Vorpal: You said "like a laptop one".
17:00:59  elliott: I have 750 W
17:01:11  Vorpal: 750W is over the top for just about everything.
17:01:14  elliott: yes, those are generally below 100 W. So they qualify
17:01:24  Vorpal: (A -> B) =/= (B -> A)
17:01:26  elliott: I know people who had rigs that needed more than 750 W to run
17:01:46  elliott: what does -> mean there? (I'm assuming =/= means ≠)
17:01:51  elliott: anyway it gives some room to expand in. 80+ gold certified, so it is reasonably efficient even at non-max load
17:01:55  ais523\unfoog: Logical implication.
17:02:00  ah, OK
17:02:03  indeed
17:02:19  elliott: also, 1000W is quite small for an electric heater
17:02:40  and far too small for an electric oven
17:02:48  elliott: anyway, I have never seen a PSU intended for a full sized desktop (mid tower or larger) that didn't have a fan
17:02:48  Electric oven computer.
17:02:52  sure, it might happen
17:02:55  I just never seen it
17:03:10  Vorpal: They're just not popular, that's all.
17:03:17  right
17:03:31  so... chances are, unless you use a laptop, your PSU has a fan
17:03:31  elliott: do you know why they aren't popular? I assume they would be for the same reason as, say, flatscreens
17:03:46  ais523\unfoog: You need good cooling on the rest of your system, case fans and the like.
17:03:51  ais523\unfoog: And they don't really scale to higher powers.
17:03:55  ah, OK
17:03:56  ais523\unfoog: what? Are you suggesting flat monitors are not popular ?
17:04:05  Vorpal: Are you illiterate?
17:04:07  This is very helpful guys thanks.
17:04:14  Phantom__Hoover: I gave you advice; take it.
17:04:20  ...what?
17:04:22  elliott: I anti-missed a "not"
17:04:28   Phantom__Hoover: So... doublecheck everything from the power button to the socket to the PSU?
17:04:38  Phantom__Hoover: It's more productive than complaining that nobody's helping you on IRC...
17:05:02  Phantom__Hoover: probably the issue is with the PSU. Since the PSU fan didn't turn on. It might be with the mobo, or the button in theory as well.
17:05:14  could be something connected incorrectly
17:05:39  Phantom__Hoover: and I assume you set the PSU for the right voltage, if it had such a switch? Mine autodetect between UK and US voltages
17:05:40  Vorpal: an "n't"? I can't see anywhere to put a "not" to make that sentence not sound completely unlike me and still have the desired meaning
17:05:49  Vorpal: *EU and US voltages?
17:05:57  err yeah
17:05:58  I don't think it has a switch like that.
17:06:02  right
17:06:30  the old UK standard of 240 isn't really used much any more, most devices marketed for Europe have a 225-245 voltage range to cover both UK 240 and standard 230
17:06:36  ais523\unfoog: in fact I think it supports from 90 V to 260 V or some such. Which is kind of larger than required
17:06:49  Phantom__Hoover: most PSUs do, unless they're specifically advertised not to
17:06:57  or laptop PSUs
17:07:03  ais523\unfoog: Sweden used to have 220 V before we switched to 230 V
17:07:12  the one on the desktop here at work, the switch is a slidy piece of metal the same colour as the case
17:07:20  which has ~230V engraved on it
17:07:30  same colour eh, the ones I seen were usually red
17:08:32 -!- augur has quit (Remote host closed the connection).
17:08:36  anyway if you put it at 110 V and you used it on 230 V, then chances are your PSU is not alive anymore (hopefully just a fuse). Probably nothing else broke.
17:14:26  Phantom__Hoover: anyway, even if the CPU was dead your PSU would probably turn on its fan.
17:14:34  at least for a short period of time
17:14:45  bbl
17:17:15  Ahh, found the problem.
17:17:31  Phantom__Hoover: What was it.
17:17:33  Was it the polarity flow.
17:17:37  Were the neutrinos going too fast.
17:17:38  The power on switch has a second connection in the front of the case which is disconnected and isn't mentioned in the manual at all.
17:17:47  It's the secret connection.
17:18:06  *Now* I've graduated to the monitor showing no signs of life whatsoever.
17:18:54  Phantom__Hoover: Did you plug it in.
17:18:56  Monitors need power too.
17:19:05  (Yes, all my advice will be this irritating.)
17:19:46  Yes, and I checked for any additional power buttons; there were none.
17:20:05   *Now* I've graduated to the monitor showing no signs of life whatsoever. <-- are you using the on board video (if that exists)?
17:20:08  Phantom__Hoover: The monitor has a power button.
17:20:14  Vorpal: There is no on-board video.
17:20:18  ah okay
17:20:25  I plugged it into the graphics card's DVI output (the only video output on the entire computer) using an adaptor provided by the graphics card.
17:20:25  However, getting the monitor to turn on seems more important.
17:20:30  Phantom__Hoover: Doesn't matter, get it turned on first.
17:20:38  elliott, how, there's no button.
17:20:38  Then you can work on the computer getting its images there.
17:20:39  Anywhere.
17:20:40  Phantom__Hoover: doesn't the graphics card have other ports?
17:20:43  Phantom__Hoover: Yes there is; or a switch.
17:20:58  Vorpal, it has 2 DVI and a mini HDMI; the monitor has only VGA and DVI.
17:21:00  Phantom__Hoover: they might hide it quite well for aesthetics
17:21:10  Phantom__Hoover: use DVI only if possible
17:21:12  Phantom__Hoover: The "only video output" apart from an HDMI one.
17:21:15  Vorpal: He has a VGA cable.
17:21:24  I have already told him to correct this, so don't bother.
17:21:25  Phantom__Hoover: otherwise there are two types of DVI: Try the other DVI port
17:21:32  FOR GOD'S SAKE
17:21:33  not all DVI ports provide analogue as well
17:21:34  NONE OF THIS WILL HELP
17:21:36  UNTIL Phantom__Hoover
17:21:36  TURNS
17:21:37  THE
17:21:37  MONITOR
17:21:38  ON
17:21:39  right
17:22:16  Phantom__Hoover: well I can tell you for certain there is a power button on the monitor. Look in the manual for it. Also check under the front edge
17:22:22  sometimes they like to hide the buttons
17:25:10 -!- augur has joined.
17:25:22  Phantom__Hoover: found it yet?
17:25:50  OK it was a touch button for some inexplicable thing?
17:25:57  Phantom__Hoover: hah that happens
17:26:04  Still doesn't get a signal, of course.
17:26:13  Phantom__Hoover: check the other reasons above
17:26:20  not all DVI ports provide analogue
17:26:41 * elliott continues debating whether to expediate new computer purchasing to smooth AII development or whether to stay on this machine to ensure better compatibility.
17:26:57  Phantom__Hoover: you want the connector on the computer to be DVI-I or DVI-A: https://en.wikipedia.org/wiki/File:DVI_Connector_Types.svg
17:27:26 -!- monqy has joined.
17:27:40  It's definitely one of those.
17:27:54  Phantom__Hoover: is the other one that as well? In that case try to switch
17:28:00  Miffed somewhat at lack of HDMI port on monitor.
17:28:15  That might work OK
17:28:16  I have one DVI-I and one DVI-D, one DP and one HDMI iirc
17:28:18  Phantom__Hoover: HDMI is irrelevant.
17:28:22  You just need a DVI cable.
17:30:17  wait seems I have 5 connectors according to xrandr output
17:30:19  oh well, whatever
17:31:20  Phantom__Hoover: anyway, try the monitor connected to your laptop. Just in case. You will of course need to enable the extra monitor in the screen prefs
17:31:27  Nothing continues to happen.
17:31:45  Phantom__Hoover: is the monitor saying "no signal" or such when you unplug the cable?
17:31:51  And just black screen when plugged in?
17:32:00  One thing at a time please.
17:32:06  Phantom__Hoover: Skip the laptop thing.
17:32:14  Waste of time esp. with differing ports.
17:32:18  well yeah, probably not the monitor at fault
17:33:42  Phantom__Hoover: Also, check the connection of the case to the video card again.
17:33:58  elliott, the card fan definitely starts, for one thing.
17:34:05  I didn't say motherboard.
17:34:06  I said case.
17:34:15  Also check the connection to the monitor, ofc.
17:34:24  The PSU's connection is fine too.
17:34:44  That's not in question.
17:34:56  The computer works, the monitor works, the two just don't work together.
17:34:58  Phantom__Hoover: oh wait, what about power cables to the GPU?
17:35:01  they are connected right?
17:35:06  They're fine too.
17:35:08  I need two of them at once
17:35:14  because hell why not
17:35:41 -!- mycroftiv has quit (Ping timeout: 240 seconds).
17:35:43  Both of them are connected.
17:35:45  Phantom__Hoover: point is, does the monitor even say "no signal" or such when unplugged. If yes and it doesn't do that when connected to the computer then the GPU is probably okay.
17:36:29  The monitor says "going into power saving mode" and goes into standby.
17:36:44  Phantom__Hoover: when unplugged? Or when connected to the computer?
17:36:59  My question is basically if it behaves *differently* when unplugged and connected to the computer.
17:37:02  When connected.
17:37:11  Phantom__Hoover: and when unplugged?
17:37:27  It stays on and says "No VGA Cable"
17:37:30  right
17:37:34  that is promising
17:37:43  Phantom__Hoover: did you reboot the computer after connecting the monitor?
17:37:57  I've started it with the monitor connected, yes.
17:38:02  (it might think nothing is connected. I'm not convinced there is plug-and-play during bios)
17:38:32  Phantom__Hoover: tried that on both DVI ports?
17:38:42  I think so. I can try again.
17:38:48  well, can't hurt to check
17:38:49  Phantom__Hoover: Really check the connection in the monitor.
17:38:54  VGA is really tough to get in.
17:38:55  and that too
17:38:59  elliott: is it?
17:39:05  Yes.
17:39:08  elliott: as long as you secure the screws there won't be a problem
17:39:13  Although SCART takes the cake.
17:39:17  well yes
17:39:18  SCART is physically impossible to plug in.
17:39:27  SCART is easy to get in, just never *stays* in
17:39:30  lol
17:39:40  Wow, SCART is 70s technology.
17:39:44  I'm... not surprised.
17:39:46  really, heh
17:39:53  The SCART connector first appeared on television sets in 1977. It became compulsory on all new television sets sold in France starting from January 1980.[2][3]
17:39:55  I have, attached to my school desktop right now, an official Apple-branded DVI-to-DVI adapter.
17:40:07  elliott: anyway vga is kind of easy to know if you got in. If you managed to fasten the screws then it is in
17:40:10  Gregor: Not DVI-to-MiniDVI or whatever?
17:40:13  elliott: Nope.
17:40:18  elliott: Not even DVI-to-DVI-D or something.
17:40:18  Awesome.
17:40:25  elliott: It is a $30 patch cable.
17:40:32  Gregor: It's actually a 0m-1m adapter :P
17:40:34  Assuming it has a cable.
17:40:35  Actually it's a $30 DVI cable that's really really short.
17:40:40  Gregor: wait a second, what is Apple DVI?
17:40:41  If it's just two identical ends right next to each other than that's amazing.
17:40:49  Vorpal: ... ... X_X
17:40:55  Isn't Vorpal amazing?
17:40:57  elliott: No, it has about an inch of cable.
17:41:10  Gregor: 0"-to-1" adapter!
17:41:16  It ADAPTS SPACE.
17:41:17  isn't the parsing: (Apple-branded DVI)-to-(DVI)?
17:41:17  Yup :P
17:41:25  Vorpal: Obviously not.
17:41:28  or do you mean Apple-branded (DVI-to-DVI)
17:41:34  elliott: well it wasn't obvious to me
17:41:37  You rarely parenthesize in the middle of hyphenated phrases X_X
17:41:39  That's because you're dumb.
17:41:43  why would they have DVI-to-DVI?
17:41:51  Why would Gregor say that if it wasn't interesting
17:41:56  Like, say, for being DVI-to-DVI
17:41:59  OK I'm back.
17:41:59  Which is unusual
17:42:03  And therefore humorous
17:42:04  Um
17:42:06  Humourous
17:42:06  yes
17:42:07 * elliott seppuku
17:42:18  Phantom__Hoover: Has it blown up yet.
17:43:42  I haven't seen a good computer case (wrt putting stuff in it easily) since that old dell case I have
17:44:02  that has some hinges at the front
17:44:07  really easy to access anything inside
17:44:40  with very nice cable routing too
17:45:18  OK still a distinct lack of anything at all happening.
17:45:36  Phantom__Hoover: Open a menu on the monitor.
17:45:38  Phantom__Hoover: do you have a pc speaker connected?
17:45:39  Don't whine, find the button/touch thing.
17:45:49  I've already done that.
17:45:54  does the computer beep when booting?
17:45:59  Vorpal: Uh, pc speakers are onboard.
17:46:10  elliott: not always
17:46:12  Phantom__Hoover: Checked monitor connection? Checked adapter connection?
17:46:16  elliott: at least they didn't use to be
17:46:22  Phantom__Hoover: Startin' to think you should just buy an HDMI cable, man
17:46:24  erm
17:46:25  Phantom__Hoover: Startin' to think you should just buy a DVI cable, man
17:46:26  elliott, no and yes.
17:46:32 * elliott makes the worst Frfuuruuduan slips.
17:46:35  Phantom__Hoover: Well, go do it then.
17:46:46  Revise to yes and yes.
17:47:17  Phantom__Hoover: OK, observe my official recommendation:
17:47:23  - Pat yourself on the back for an assembly well done;
17:47:25  - Buy a DVI cable.
17:47:29  theoretically the VGA port on the monitor might be dead. It might be worth checking against your laptop if it has a VGA (or even better, DVI) connector
17:47:39  I did that, actually; it worked fine.
17:47:47  hm
17:47:55  I suspect Phantom__Hoover's DVI ports just don't do analogue.
17:48:14  elliott: elliott: https://en.wikipedia.org/wiki/File:DVI_Connector_Types.svg <-- he said it was DVI-I iirc?
17:48:22  Vorpal: Yes. I don't believe him.
17:48:44  elliott: well something might be fried. I wouldn't exclude the posibility
17:48:49  possibility*
17:49:13  probably the CPU or RAM in that case.
17:49:27  Phantom__Hoover: Does it beep when it starts up.
17:49:57  elliott: mine doesn't beep when booting. It will however beep using the onboard Intel HD Audio if required.
17:49:59  kind of weird
17:50:10  I don't know if there are speakers?
17:50:20  " Why would Gregor say that if it wasn't interesting"
17:50:25  Immortalized forever.
17:50:28  Right there in the log.
17:50:33  bbl
17:50:54  Phantom__Hoover: It's a PC speaker.
17:50:59  It makes an annoying beep whether you have speakers or not.
17:52:44  There might have been
17:53:06  Phantom__Hoover: Dude.
17:53:08  It takes three seconds to check.
17:54:33  No, it doesn't.
17:55:14  Eh.
17:55:24  It's probably fine.
17:55:29  I guess MODERN MOBOS don't do the beeping thing any more.
17:55:45  Phantom__Hoover: Yeah, just buy a DVI cable.
17:56:32  BtW, I can confirm that the graphics card's DVI cables are DVI-I and the monitor's unused DVI port is DVI-D.
17:58:48  Vorpal: You've gotta admire Phantom__Hoover's dedication to getting this VAX to run.
17:58:59  So are there like 20 different kinds of DVI cable?
17:59:04  Phantom__Hoover: No, there's one.
17:59:10  Phantom__Hoover: Buy the cheapest.
17:59:31  But there are 55 kinds of port?
17:59:35  *5
17:59:40  Mr Green always embrace you.
17:59:52  Vorpal will explain to Phantom__Hoover how ports are designed.
18:00:18  They oh wait they are intercompatible.
18:00:41  Phantom__Hoover: So how loud are the fans.
18:01:06  Not all that loud, although I haven't yet run it for more than 30 seconds or so.
18:01:22  Phantom__Hoover demonstrates Scottish hardness in the face of 99 dBa.
18:01:54  They're only a little louder than bagpipes.
18:03:36 -!- ais523\unfoog has quit (Remote host closed the connection).
18:07:38  NetBSD for Amiga: INSTALLING
18:07:43  I WILL TEST M68K
18:07:45  I WILLLLLLL
18:18:46 -!- Phantom__Hoover has changed nick to Phantom_Hoover.
18:29:24 -!- augur has quit (Remote host closed the connection).
18:39:32  where can I get malbolge?
18:39:48  a malbolge interpreter?
18:39:55  my programming teacher gave me a derp problem, and said use ANY language
18:39:58  http://esolangs.org/wiki/Malbolge#External_resources
18:40:08  new2net: good luck writing a malbolge program...
18:40:15  Idonno if Malbolge is a good selection for "any" :P
18:40:18  some cryptographic skill is recommended
18:40:47  "I killed a random mill owner. It wasn't my fault! I just went into his house and picked his pocket to get some practice at doing it, but he caught me and I ran. He chased me out into the wilderness, at which point I got bored of running, figured we were in the middle of a snowy forest in the middle of the night, and stabbed him through the heart. Then I dumped his body in a river. OK, I guess it total
18:40:47  ly was my fault."
18:41:15  Also an apt description of Malbolge.
18:43:32  "Lately I've taken to reanimating the bodies of people who piss me off, then killing them again so they burn up to a pile of ash. Hideous otherwordly punishment for my enemies, and it keeps the roads clear!"
18:43:39  The language is named after Malebolge, the eighth level of hell.
18:44:33  thought there were only 7
18:45:13  new2net: They created another one for people who make brainfuck derivatives.
18:45:22  In reality there are zero, in the Divine Comedy there are nine.
18:45:29  ++++++++++[>+++++>++++++++++>+++++++++++<<<-]>>>.<+.>+++++++++.<<.+++>>---------.-<.>+++++++.---
18:45:52  ^bf ++++++++++[>+++++>++++++++++>+++++++++++<<<-]>>>.<+.>+++++++++.<<.+++>>---------.-<.>+++++++.---
18:45:53  new2net
18:45:58  !bf_txtgen old2net
18:46:00  Hmm, why would the graphics card come packaged with a VGA to DVI adapter if it didn't work?
18:46:03  ​78 ++++++++++[>+>+++++++++++>++++++++++>+++++<<<<-]>>+.---.>.>.<<++.>+.<++++++.<. [774]
18:46:10  Phantom_Hoover: Satanism?
18:46:34 * new2net nods
18:46:39  but your txtgen doesn't leave only prime numbers in each byte
18:46:45  "my" txtgen :P
18:47:38  !malbolge_txtgen new2net
18:47:59  no shame in taking the easy road where available...
18:50:15 -!- derrik has joined.
18:53:21  back
18:53:26  Phantom_Hoover: any luck?
18:53:38   Hmm, why would the graphics card come packaged with a VGA to DVI adapter if it didn't work? <-- it wouldn't
18:53:45  unless something is broken
18:53:54  like the adapter or whatever
18:54:41   BtW, I can confirm that the graphics card's DVI cables are DVI-I and the monitor's unused DVI port is DVI-D. <-- that combo should work just fine, because DVI-I is DVI-A+DVI-D basically
18:55:03   Vorpal will explain to Phantom__Hoover how ports are designed. <-- I only know how the FreeBSD ports work :P
18:55:12  Greatest thing about the BSDs is that every time you mount their native filesystem you get to scream "MOUNT FOR FUCK'S SAKE" (<-- joke noöne will get)
18:55:34   Phantom__Hoover demonstrates Scottish hardness in the face of 99 dBa. <-- you mean Welsh
18:56:06  Hmm, I *do* have access to a TV with an HDMI input.
18:56:13  besides bagpipes kind of sound nice. Probably not in the long run though.
18:56:22 -!- ais523 has joined.
18:56:45  Gregor: I know about UFS mounting under linux.
18:56:52  elliott, does EgoBot interpret Malbolge?
18:56:53  Gregor: never tried it, but I know it is kind of bad
18:56:59  !malbolge
18:57:04  maybe?
18:57:07  hard to tell
18:57:18  new2net: I don't think so, but I'm not sure
18:57:20  !help languages
18:57:20  ​languages: Esoteric: 1l 2l adjust asm axo bch befunge befunge98 bf bf8 bf16 bf32 boolfuck cintercal clcintercal dimensifuck glass glypho haskell kipple lambda lazyk linguine malbolge pbrain perl qbf rail rhotor sadol sceql trigger udage01 underload unlambda whirl. Competitive: bfjoust fyb. Other: asm c cxx forth sh.
18:57:28  yes, it does, it seems
18:57:53  ^malbolge  ('&%:9]!~}|z2Vxwv-,POqponl$Hjig%eB@@>}=
18:58:22  new2net: ! not ^
18:58:22  Vorpal: NOT - THE - JOKE
18:58:40  Gregor: i got it
18:58:44  Gregor: oh mount.ffs, but no one uses ffs any more
18:58:52  !malbolge ('&%:9]!~}|z2Vxwv-,POqponl$Hjig%eB@@>}=
18:58:53  Hello World!
18:59:02  wow the spambots have been busy recently
18:59:02  Vorpal: ufs aka ffsv2
18:59:19  elliott: right, but the tools are mount.ufs iirc
18:59:27  tool is*
18:59:41  elliott: so Gregor's joke doesn't work for them
18:59:53  elliott: because the joke was that the /tool/ is mount.ffs
19:00:28  "about the BSDs"
19:00:32  It's only called UFS on Linux.
19:00:36 * new2net dies inside.
19:00:39  Gregor: no
19:00:39 -!- new2net has left ("Leaving").
19:00:49  Gregor: notice UFS and UFS2 in http://www.freebsd.org/projects/bigdisk/index.html
19:00:53  just as an example
19:00:54  Vorpal: I just watched NetBSD 5.1 mount_ffs
19:00:56  first hit on ddg for me
19:01:10  Gregor: well netbsd is like 10 years out of date except on toasters
19:01:10 -!- Ngevd has joined.
19:01:20  Vorpal: Amiga: Mostly like a toaster.
19:01:21  Hello!
19:01:26  Gregor: right
19:01:33  Gregor: I mainly used freebsd and some openbsd
19:01:50  I've got data in an Excel spreadsheet, what's the best way to use it in Haskell?
19:01:53  and I think freebsd is the largest *bsd
19:01:59  openbsd "more modern than netbsd" "lol"
19:02:03  unless I misremember
19:02:04  Vorpal: I mainly use Linux, because everything I want to run can either run Linux (in which case I don't want BSD), or the only free OS it can run is NetBSD :P
19:02:04  Ngevd: export to csv?
19:02:22  elliott, then what?
19:02:22  Gregor: heh
19:02:35  Ngevd: parsec would work
19:02:39  might be an easier way
19:02:42  Ngevd: search hackage for csv library
19:02:48  Vorpal: he said excel
19:02:58  elliott: I meant parsec for the csv data
19:02:58  duh
19:03:16  OK, trying this again with an HDMI cable.
19:03:18  Ngevd: or you could use the FFI for accessing MS Office integration stuff
19:03:26  Phantom_Hoover: doubtful it will help, but worth a try
19:03:35  Phantom_Hoover: remember to unplug the other monitor
19:03:38  Ngevd: Vorpal's advice is useless.
19:03:48  elliott: that stuff about FFI was a joke
19:03:49  obviously
19:06:08  [download]  16.7% of 37.55M at  175.13k/s ETA 03:02 <-- the video is 2 minutes. What a failure.
19:06:09  That didn't work either.
19:06:27  Phantom_Hoover: well then I guess one of the CPU, RAM or GPU are broken
19:06:28  Is there something wrong with the card, then?
19:06:34  no.
19:06:41  Vorpal: What's that about you getting download speeds that Americans can only dream of?
19:06:43  or mobo
19:06:55  Gregor: come on from a good mirror I can get 800 kbps down
19:07:15  Gregor: youtube: usually 500 kpbs
19:07:28  (and that was youtube-dl)
19:10:23 -!- derrik_ has joined.
19:10:35  OMG NetBSD extraction SO SLOW
19:11:03  Gregor: what is the bottle neck?
19:11:13 -!- derrik has quit (Ping timeout: 252 seconds).
19:11:20  Vorpal: Everything :P
19:11:29 -!- derrik_ has quit (Client Quit).
19:13:49 -!- derrik has joined.
19:15:18 -!- augur has joined.
19:15:27  [download]  20.3% of 210.35M at  163.04k/s ETA 17:32 <-- come on, for a 14 minute video
19:15:58 -!- derrik has quit (Client Quit).
19:17:18 -!- derrik has joined.
19:23:37 -!- copumpkin has changed nick to coblumpkin.
19:24:50  a hate so pure and… blumpkin seeds?
19:25:27  :D
19:27:50  ais523: there's a new humble bundle, btw
19:28:04  yes, I know, they advertise at me incessantly
19:28:30  these bundles come out much faster than I expected; and as a result, they're getting less of my custom than maybe they'd want
19:28:44  the inability to buy them after the period ends doesn't help either
19:28:51  not even at a mark-up
19:29:04  Sure you can.
19:29:06  It's just a really big markup.
19:29:28  ais523: Have you even ever played Uplink?
19:29:29  well, I mean, without bribing the relevant people
19:29:32  elliott: no, I haven't
19:29:37  I've heard of it, but not much about it
19:29:43  It's good.
19:29:47  It's really good.
19:29:48   well, I mean, without bribing the relevant people
19:29:52  I don't even know what genre it is
19:29:53  ais523: I was referring to simply being each game
19:29:58  oh, I see
19:30:12  ais523: Uplink is a fully-featured implementation of the ridiculous OSes used for hacking in films and TV shows
19:30:16  plus plot
19:30:26  (it even includes an IRC client, although it was removed in a patch)
19:30:41  ais523: it's really well done -- you can bring down systems by erasing their OS files with the command line
19:30:48  and they never come back up even if you restart the game with another player account
19:31:03  elliott...
19:31:16  presumably you can set the state of the game back to freshly-installed so you can do it again?
19:31:21  Crashed systems come back up eventually, and systems aren't persistent.
19:31:28  Phantom_Hoover: Not if you rm -r /.
19:31:36  ais523: Well, sure, but most systems aren't terribly interesting :P
19:31:40  but that command doesn't actually /work/
19:31:43  in real life
19:31:45  Nope.
19:31:50  ais523: it's not rm -r /, it's del / or something :P
19:31:51  They still come back up.
19:31:52  what if you forkbomb them?
19:31:54  After a few months.
19:31:58  Phantom_Hoover: Hmm, they never came back for me, but OK.
19:32:06  ais523: The shell isn't *that* good.
19:32:09  And it's cd usr; delete; cd sys; delete.
19:32:12  boring
19:32:31  It's been extracting ./rescue/[ for multiple minutes now >_>
19:32:44  Gregor: why is there a file called [?
19:32:53  is it a symlink to test(1)?
19:32:56  (even more insane if it isn't)
19:33:45  `which [
19:33:47  ​/usr/bin/[
19:33:57  `file /usr/bin/[
19:33:58  [ has been a conventional part of UNIX for years.
19:33:59  ​/usr/bin/[: ELF 64-bit LSB executable, x86-64, version 1 (SYSV), dynamically linked (uses shared libs), for GNU/Linux 2.6.18, stripped
19:34:10  test and [ are slightly (very slightly) distinct.
19:34:20  discussing the same bug report with two different forks of the same project simultaneously
19:34:22  Gregor: yes, but I wouldn't have expected to see it in ./rescue
19:34:26  ~a~w~k~w~a~r~d~
19:34:30  ais523: Fair 'nuff :)
19:34:30  elliott: are they test and [?
19:34:33  lol
19:34:39  X-D
19:34:56  FFFFFFFFFFF it's still extracting rescue/[
19:35:07  perhaps it's infinitely large?
19:35:17  Gregor: I suspect it's hung on the filename or something :P
19:36:54  hmm, I conclude that the only way this can end up non-awkward is if i convince the two projects to merge
19:37:21  does the /original/ have the bug? and is it dead?
19:37:29  the original is dead
19:38:16 -!- coblumpkin has changed nick to copumpkin.
19:40:12 -!- derrik has quit (Quit: reconnect).
19:40:27 -!- derrik has joined.
19:45:43  elliott: Nope, finally got past it.
19:45:52  Gregor: The biggest file.
19:56:08 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds).
19:56:58 -!- Phantom_Hoover has joined.
20:00:23 -!- augur_ has joined.
20:01:20 -!- augur has quit (Ping timeout: 240 seconds).
20:04:32 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds).
20:07:06  elliott: oh right, I just remembered, kerio is also an ssh fanboy
20:07:18  what
20:07:23  I didn't even realise that was possible
20:07:28  but apparently so
20:08:00  Who ISN'T an SSH fanboy.
20:08:02  SSH rules.
20:08:05  I mean, you can do worse than SSH
20:08:15  ais523: but how
20:08:21  rsh
20:08:22  telnet
20:08:35   ais523, I have a message for you: kerio said: i just realized that rsync and pretty much every DVCS uses ssh - why can't acehack-tiles and/or jettyplay do the same?
20:08:45   ais523: ssh is awesome and you should use it!
20:08:52  [20:05]  kerio: the use of ssh by git and by rsync is one of the things that made them much harder to port to Windows
20:08:54  [20:06]  and also made them much more awesome
20:09:17  Windows is for losers anyway.
20:09:20  ais523: it's amazing how quickly i have come to hate kerio
20:09:25  heh
20:09:44  it usually takes at least ten more lines than i've seen
20:09:46  anyway, there you go, ssh fanboyism in action
20:10:34  ais523: you should make jettyplay use rsh+perl
20:11:01  elliott: well, jettyplay connects to public NetHack servers to watch, normally via telnet
20:11:13  but kerio removed telnet support from acehack.eu, because ssh was so superior
20:11:17  so it doesn't work on AEU at the moment
20:11:47 -!- Darth_Cliche has joined.
20:12:51  ais523: hmm, what exactly does ssh give for anonymous connections?
20:12:59  authentication overhead, I think, plus compression
20:13:13  not sending the password in plaintext
20:13:17  oh, and encryption I guess :P
20:13:24  ais523: vital nethack passwords
20:13:31  kerio did find a really huge security bug in dgamelaunch, and actually got root on someone else's server through it
20:14:01  ais523: that's, um, a really immature way to respond to remote holes?
20:14:17  well, he didn't do anything destructive with it but edit the homepage and close the hole behind him
20:14:27  that sounds destructive to me :P
20:14:52  right, but the server admin seemed not to mind
20:23:45 -!- Phantom_Hoover has joined.
20:24:20 -!- sebbu2 has joined.
20:24:20 -!- sebbu2 has quit (Changing host).
20:24:20 -!- sebbu2 has joined.
20:24:37  fungot!
20:24:37  Phantom_Hoover: crazy utahraptor! homeslice! oh, i wasn't talking about you here, i have and now god's in on it too, utahraptor. they're quite the whistles in mario, on a whale-watching tour:
20:25:05  Oh fungot, we love you so.
20:25:06  Gregor: people in car car simulator trucko boat 3. that's a ' thr' followed that. remember? remember punchette, the power punch", sure but outside of a religious context, but it seems i'm destined to be with you
20:25:06  good
20:25:33  We should use fungot to set the /topic.
20:25:33  Gregor: a good choice, then i'm going to make mistaks so bad that they kill me, and a parallel to all this, as usual, t-rex
20:25:47  good
20:25:48  Gregor: --Gregor "antioptbot" Gregor
20:26:29 -!- sebbu has quit (Ping timeout: 240 seconds).
20:27:29  X-D
20:27:41  TOUCHÉ SIR
20:29:00 -!- oerjan has joined.
20:29:38  HUMBLE INTROVERSION BUNDLE
20:31:07   ooh this sounds nice "Humble Introversion Bundle"
20:31:11  --the other channel, hours ago
20:31:46  Is Crayon Physics Deluxe worth it?
20:31:59  surely you already have it from another bundle
20:32:05  No
20:32:12  I have Aquaria from another bundle
20:32:16  Sgeo: it's fun for a while, but becomes a bit repetitive
20:32:43  and the physics engine is a little wonky, enough that you can't really do things that the designers didn't think of and have them work with any degree of success
20:32:50  hmm
20:33:51  and it feels very random (actually, it's sensitivity to small details of input rather than randomness, but that comes to much the same thing in practice)
20:34:04  Hmm
20:34:13  Can't really hurt that much to get it, can it?
20:34:39 * elliott hardly thinks Introversion's games are worth less than 2.25 pounds.
20:35:06 * Sgeo currently has $12.83 in his Paypal account...
20:35:16 * elliott paid 4 pounds, because I already have Uplink and am uncertain whether I'll like DEFCON or not, plus already have the other two games, and I spent more than everyone else on the other bundles anyway.
20:36:46 * Sgeo pays $5
20:36:50  :/
20:37:05  elliott: my bank charged me an extra £1.50 for paying in dollars from a pounds-denominated bank account
20:37:42  my paypal didn't
20:37:48  Sgeo: You realise you can add more funds to PayPal acounts.
20:37:55  I refuse to use PayPal
20:38:32 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds).
20:38:32  elliott, not as easily as just using what's currently there
20:38:35  ais523: Yes, I fully predicted a response along those lines. I'm sure elaborating will be productive and entertaining for all of us.
20:38:59  elliott: heh, somehow I don't believe you
20:39:10  but basically, it comes from multiple incidents in which they randomly decided to take people's money
20:39:14  Interleave tab width discussion while you're at it!!!
20:40:22  I FINALLY KNOW WHA I'M DOING!
20:40:29  WITH A T ON THE END OF WHA
20:41:09  hi Ngevd
20:42:01  Someone on Reddit mentioned Slavehack as being like MMO Uplink?
20:43:10  It should be StdGen -> Bool -> String -> String rather than Int -> Bool -> String -> String
20:45:19  Ngevd: Whenever you take an StdGen, you want to output one too
20:45:23  So -> (String, StdGen)
20:45:40  what does StdGen do?
20:45:53 -!- myndz\ has joined.
20:46:02  ais523: it does nothing, it's a type
20:46:12  what's its intended use, then?
20:46:17  elliott: unless you make an infinite String result, or perhaps even a potentially infinite one
20:46:20  ais523, a random number generator
20:46:36  oerjan: well yes
20:46:39  oh, I see, using it monad-style
20:46:41  but without an actual monad
20:46:42  You can use it to obtain a number and a new RNG
20:46:42  :t split
20:46:43  forall g. (RandomGen g) => g -> (g, g)
20:47:23  or one where you don't want the whole String to be calculated immediately, i guess
20:47:43  :t randoms
20:47:45  forall g a. (Random a, RandomGen g) => g -> [a]
20:48:27  :t random
20:48:28  forall g a. (Random a, RandomGen g) => g -> (a, g)
20:48:49 * elliott thinks the fact that those aren't in a Random monad is awful.
20:49:02  it occurs to me that splitting :: (RandomGen g) => (g -> a) -> g -> (a, g); splitting f g = second f . split could be useful
20:49:11  er
20:49:13  *first
20:50:22  oerjan: splitting f = fmap f random :P
20:50:30  (with correct Random monad)
20:50:45  what
20:51:06  oerjan: * elliott thinks the fact that those aren't in a Random monad is awful.
20:51:29  random :: (Random a) => Rand a
20:51:39  elliott: well i guess if RandomGen was an instance of Random - except it's a class, so that would break things
20:51:44  runRand :: (RandomGen g) => Rand a -> g -> (a,g) etc.
20:51:45  oerjan: um no
20:51:52  i'm saying that random's type is wrong
20:51:57  because it's threading an explicit state monad around instead of just
20:51:59  being a state monad
20:52:09  I have written a program in Haskell that could be used in lessons to demonstrate why error handling is a good idea
20:52:16  elliott: um do you realize what splitting _does_?
20:53:02  oerjan: oh hm, i misread splitting
20:53:11  sry
20:53:11  thought so :P
20:53:30  split :: Rand a -> Rand a
20:53:32  i guess :P
20:53:49  why did some fonts go super small in GTK programs suddenly?!
20:53:50  wtf
20:53:52  not all
20:54:10  Okay, that reminds me
20:54:15  or wait, maybe qt ones
20:54:19  If I want to use a module, I need to install the module
20:54:24  yeah QT
20:54:45  Ngevd: very true.
20:55:19  Ngevd: is that all
20:55:24  going to restart x11
20:55:35  elliott: how do install module?
20:55:47  Ngevd: what module
20:55:48  exactly
20:55:50  you are being very vague
20:56:02  Data.Spreadsheet
20:56:05  http://hackage.haskell.org/package/spreadsheet
20:56:13  cabal install spreadsheet but uhhhh
20:56:15  i would not use that package
20:56:22  http://hackage.haskell.org/package/csv
20:56:25  try this instead :P
20:56:35  > (evalState . forever . state $ random) $ mkStdGen 42 :: [Int]
20:56:36    Ambiguous type variable `a' in the constraint:
20:56:36  it's what i've seen used
20:56:36     `System.Random.Random a'
20:56:36  ...
20:56:38  argh
20:56:48  No I need to rewrite my program.
20:56:49  w
20:56:52  oh duh
20:56:54  With the No
20:56:58  I said Now, not No
20:57:01  > (evalState . sequence . state $ random) $ mkStdGen 42 :: [Int]
20:57:02    Couldn't match expected type `[Control.Monad.Trans.State.Lazy.StateT
20:57:03        ...
20:57:04  Ngevd: but anyway, "cabal install pkg"
20:57:15  hmph
20:57:17  :t state
20:57:18  forall s a. (s -> (a, s)) -> State s a
20:57:20  you shouldn't need to rewrite your program, just the csv input bits P:
20:57:21  :p
20:57:27  elliott: what if I'm an idiot and using Windows?
20:57:31  oerjan: might be strict
20:57:32  :t evalState
20:57:33  forall s a. State s a -> s -> a
20:57:34  Ngevd: cabal install pkg
20:57:44  elliott: well it _says_ Lazy up there :P
20:57:56  oerjan: "expected" but ok
20:58:14  oh duh
20:58:24  Ngevd: open cmd.exe and run that stuff I presume?
20:58:30  > (evalState . sequence . repeat . state $ random) $ mkStdGen 42 :: [Int]
20:58:31  with the right path
20:58:32    [-3907187990116499535,-2519438828217931933,-8264534369199619667,86887135830...
20:58:35  finally
20:59:28  > randoms
20:59:29    Overlapping instances for GHC.Show.Show (g -> [a])
20:59:30     arising from a use of...
20:59:46  > randoms (mkStdGen 42)
20:59:48    [-3907187990116499535,-2519438828217931933,-8264534369199619667,86887135830...
20:59:48  :t forever
20:59:49  forall (m :: * -> *) a b. (Monad m) => m a -> m b
20:59:55  @src forever
20:59:56  Source not found. I can't hear you -- I'm using the scrambler.
21:00:02  oerjan: :P
21:00:05  what package is it in?
21:00:05  forever = fix (>>)
21:00:07  base
21:00:15  hm
21:00:18  Ngevd: duh
21:01:12  oerjan: runRandAll :: Rand a -> [a] >:)
21:01:13  elliott: well it isn't in Prelude if that is what you meant.
21:01:36  Vorpal: "package" does not mean what you seem to think it means
21:01:45  elliott: well, module is what I meant
21:01:49  oerjan: runRandAll random g == randoms g
21:01:50  used wrong word
21:01:53  Vorpal: Control.Monad
21:01:56  thanks
21:02:05  oerjan: runRandAll (liftA2 (,) random random) g == guess
21:05:03 -!- Phantom_Hoover has joined.
21:06:43  also randoms g, but with [(a,a)] return type?
21:07:41  hmm, actually, randoms is very inelegant
21:07:45  ideally runRandAll would be
21:07:53  runRandAll :: Rand a -> [a] with no g argument
21:07:59  and simply return _all possible results_
21:08:07  for the random types involved in its computation
21:08:36  > fst $ random (mkStdGen 42) :: [(Int, Int)]
21:08:37    No instance for (System.Random.Random
21:08:37                      [(GHC.Types.Int, ...
21:08:38  er
21:08:42  > fst $ random (mkStdGen 42) :: (Int, Int)
21:08:43    No instance for (System.Random.Random
21:08:43                      (GHC.Types.Int, G...
21:08:45  bah
21:09:00  well it would be, if that instance existed
21:09:56  bah, MonadRandom doesn't have that
21:10:12  fuck FAT
21:10:23 * Vorpal curses this USB memory
21:10:30  the obvious way to model running a nondetemrministic computation on a generator is to have it simply magically pick one ofthe results of runRandAll...
21:10:30  FATs differ but appear to be intact. Use which FAT ?
21:10:30  1) Use first FAT
21:10:30  2) Use second FAT
21:10:37  i mean, but optimised :)
21:11:13  elliott: that doesn't include the RandomGen class so would be restricted to the StdGen instance...
21:11:26  oerjan: well i mean that's just how you'd _think_ about it
21:11:37  @src RandomGen
21:11:38  class RandomGen g where
21:11:38     next     :: g -> (Int, g)
21:11:38     split    :: g -> (g, g)
21:11:38     genRange :: g -> (Int,Int)
21:11:40  @src Random
21:11:41  class Random a where
21:11:41    random    :: RandomGen g => g -> (a, g)
21:11:42    randoms   :: RandomGen g => g -> [a]
21:11:44    randomR   :: RandomGen g => (a,a) -> g -> (a,g)
21:11:46    randomRs  :: RandomGen g => (a,a) -> g -> [a]
21:11:47    randomRIO :: (a,a) -> IO a
21:11:50    randomIO  :: IO a
21:12:03  oerjan: ideally it'd be something like class (Ix a) => Random a where { something }
21:12:11  or uh Bounded a
21:12:13  i just thought of that
21:12:17  point is, runRandAll wouldn't need a generator
21:12:22  it'd just pick every single possible value of the type
21:12:35  itym Enum, Bounded has no range
21:12:39  ofc you might want a binary tree thing instead if you actually want to use them...
21:12:41  oerjan: right
21:12:44  Enum + Bounded
21:13:27  but randomIx :: (RandomGen g, Ix a) => (a,a) -> g -> (a, g)  could be written now...
21:13:39  and would work for tuples
21:14:15  @src Ix
21:14:15  class (Ord a) => Ix a where
21:14:15      range           :: (a,a) -> [a]
21:14:15      index           :: (a,a) -> a -> Int
21:14:15      inRange         :: (a,a) -> a -> Bool
21:14:15      rangeSize       :: (a,a) -> Int
21:14:50  > rangeSize (1,2)
21:14:51    2
21:15:03  bah. i am going to sleep rather than think about this. _tomorrow_ I can futz around with random monads.
21:15:07  night.
21:15:13  Goodnight
21:15:19 -!- elliott has quit (Quit: Leaving).
21:15:43  oh wait Ix has no way to get _back_ an a value from an Int :(
21:15:56  and Enum has no tuple instance
21:16:10  (well no efficient way)
21:21:35  Oh no, poor I.
21:21:35  *Ix
21:26:42  Phantom_Hoover: so any luck with your computer?
21:26:58  Phantom_Hoover: maybe you should get some experienced you know near you to check it out?
21:27:05  I want to play WA but elliott is gone and Sgeo is boring.
21:27:14  Phantom_Hoover: WA? Wolfram Alpha?
21:27:20  Worms: Armageddon
21:27:22  oh
21:27:22  Western Australia?
21:27:23  right
21:27:31  I don't own that game, so I can't join in
21:27:41  Phantom_Hoover, I don't have my copy of the ISO with mne
21:27:58  Not sure when I'll ever have it
21:28:01  :/
21:28:22  oh?
21:28:28  torrent it?
21:28:48  Meh
21:28:54  Also, I have school in a few hours
21:29:29  What time zone?
21:29:29  wolfram armageddon, the genius overlord game
21:29:35  oerjan: heh
21:29:46  I vote for quote
21:29:58  `addquote  wolfram armageddon, the genius overlord game
21:30:00  yeah
21:30:00  734)  wolfram armageddon, the genius overlord game
21:30:28  @pl-resume
21:30:43  Plugin `pl' failed with: thread killed
21:31:02  how awful
21:31:12  @pl-resume
21:31:27  Plugin `pl' failed with: thread killed
21:31:31  @pl test
21:31:31  test
21:31:33  @pl-resume
21:31:33  pointless: sorry, nothing to resume.
21:31:36  that's quite an @pl you gave it
21:31:50  what pl was it he gave it?
21:31:52  I didn't see it
21:32:09  it might still have been on the one that crashed yesterday, and which started the day before that
21:32:16  @pl ap id id (ap id id)
21:32:20  ap id id (ap id id)
21:32:20  optimization suspended, use @pl-resume to continue.
21:32:26  ah
21:32:27  @pl-resume
21:32:33  ap id id (ap id id)
21:32:33  optimization suspended, use @pl-resume to continue.
21:32:36  @pl-resume
21:32:47  oerjan: why is that doing that?
21:32:49  ap id id (ap id id)
21:32:49  optimization suspended, use @pl-resume to continue.
21:33:19  Vorpal: because ap is SKI S and it tries to rewrite ap x y z as x z (y z)
21:33:40  @pl-resume
21:33:55  Plugin `pl' failed with: thread killed
21:34:24 -!- Ngevd has quit (Ping timeout: 258 seconds).
21:34:29  oerjan: oh right
21:34:32 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds).
21:34:40  oerjan: is there a way to do it properly?
21:35:03  however, it seems like the thread killing only happens based on something like cpu time, so the other day i could resume it despite a day having passed :P
21:35:07  @src ap
21:35:07  ap = liftM2 id
21:35:13  oh Applicative, right
21:35:26  Vorpal: um S I I (S I I) _is_ an infinite loop in SKI calculus
21:35:32  ah
21:35:43  oerjan: I can't say I ever studied SKI much
21:35:52  @hoogle ap
21:35:53  Prelude appendFile :: FilePath -> String -> IO ()
21:35:53  System.IO appendFile :: FilePath -> String -> IO ()
21:35:53  Control.Monad ap :: Monad m => m (a -> b) -> m a -> m b
21:36:13  it's the (e ->) monad, as usual for @pl
21:38:05  @pl ap x y z
21:38:05  x z (y z)
21:38:10  S S K (S (K (S S (S (S S K)))) K)
21:38:29  @pl ap ap const (ap (const (ap ap (ap (ap ap const)))) const)
21:38:29  ap ap const (ap ap (ap (ap ap const)) . const)
21:38:40  aww
21:40:04  @unpl ap ap const (ap ap (ap (ap ap const)) . const)
21:40:04  ((\ m n -> m >>= \ k -> n >>= \ j -> return (k j)) >>= \ e -> (\ a _ -> a) >>= \ d -> return (e d)) (\ r -> ((\ ab ac -> ab >>= \ z -> ac >>= \ y -> return (z y)) >>= \ t -> (\ ai -> ((\ au av -> au
21:40:04  >>= \ as -> av >>= \ ar -> return (as ar)) >>= \ al -> (\ b _ -> b) >>= \ ak -> return (al ak)) >>= \ af -> ai >>= \ ae -> return (af ae)) >>= \ s -> return (t s)) (\ _ -> r))
21:40:07  argh
21:41:14  Vorpal: however, ap may be the only thing @pl handles which causes actual duplication during simplification, so that it can loop
21:41:36  heh
21:42:00  @pl (\x -> x x)
21:42:00  join id
21:42:06  @pl (\x -> x x) (\x -> x x)
21:42:10  ap id id (ap id id)
21:42:10  optimization suspended, use @pl-resume to continue.
21:43:11  @pl join join join
21:43:11  join join join
21:43:20  bah
21:43:30  @pl join id (join id)
21:43:30  join id (join id)
21:43:47  @pl ap id id (join id)
21:43:48  join id (join id)
21:44:10  hm it's possible it only introduces join at the end of the previous simplifications
21:44:49  @unpl join join join
21:44:50  ((\ d -> d >>= \ c -> c) >>= \ a -> a) (\ f -> f >>= \ e -> e)
21:44:58  @pl ((\ d -> d >>= \ c -> c) >>= \ a -> a) (\ f -> f >>= \ e -> e)
21:44:58  join join join
21:45:01  bah
21:45:27  it looks like it _could_ have made join duplicate, but doesn't try
21:47:28  (btw none of these expressions type in actual haskell)
21:47:56  well
21:47:58  :t join join
21:47:59      Occurs check: cannot construct the infinite type:
21:48:00        m = (->) (m (m a))
21:48:00      Probable cause: `join' is applied to too few arguments
21:48:02  nah
21:48:05 -!- derrik has quit (Quit: dreamzz).
21:48:18  :t join id
21:48:19      Occurs check: cannot construct the infinite type: m = (->) (m a)
21:48:19      Probable cause: `id' is applied to too few arguments
21:48:19      In the first argument of `join', namely `id'
21:48:28  not even that
21:52:26 -!- Patashu has joined.
21:57:00 -!- Phantom_Hoover has joined.
22:23:36  I like there's this huge reaction of "looool stop being lazy get a job"
22:23:41  in response to Occupy protestors
22:24:10  I guess there's just
22:24:13  a magical job tree
22:24:21  that gives you a job if you /really/ want one.
22:33:39  Clap your hands if you believe in jobs.
22:42:31  kallisti: that is my dad's view. doesn't help that all the major news outlets only show the "alternative types" and not the regular people
22:42:51  except for the daily show. it showed some regularish people. does that count as a major news outlet?
22:44:06  yes
22:44:56  NPR has pretty coverage of Occupy as well.
22:45:05  but not as much video
22:45:12  all audio/writing/photographs mostly
22:45:31  *pretty good
22:48:03  prett works
22:50:03 -!- Darth_Cliche has quit (Quit: You are now graced with my absence.).
22:51:40  I don't really think Occupy will accomplish anything unless it gets more people.
22:51:48  in other words, if the unemployment rate goes up
22:51:52  and people have nothing else to do
22:51:58  but go protest the government
22:52:28  So basically you're saying it's in Occupy's best interests to destroy the jobs of hard-working Americans everywhere?
22:53:35  not quite
22:53:49  Occupy's best interest is not to have further economic crises.
22:53:53  so...
22:53:56  no
22:54:23  But this would be worsening of an existing crisis to drive home their point.
22:54:45  ...I guess?
22:55:16  I don't think Occupy should go make more people jobless
22:55:21  because that... makes no sense.
22:56:11  wow switzerland has a 2.1% unemploy rate
22:56:30  Signapore is 1.9
22:56:50  wtf Monaco is 0
22:57:58  Monaco has the advantage of having a population of 35,986.
22:58:10  indeed
22:58:20  but still that's amazing that /everyone/ has a job.
22:58:41 * kallisti decides to become a citizen and then FUCK UP THEIR STATS HAHAHAHAHAHAHA
22:58:50  also no income tax
22:58:51  which is badass
22:59:34  so basically a bunch of rich Europeans live there so they can gamble and avoid taxes.
22:59:37  sounds good.
23:05:12  as far as not-micronations
23:05:20  belarus has the best at 0.7%
23:05:51  Most of the Belarusian economy remains state-controlled[93] and has been described as "Soviet-style."[124] Thus, 51.2% of Belarusians are employed by state-controlled companies, 47.4% are employed by private Belarusian companies (of which 5.7% are partially foreign-owned), and 1.4% are employed by foreign companies.
23:06:37  * kallisti decides to become a citizen and then FUCK UP THEIR STATS HAHAHAHAHAHAHA
23:06:59  You realise that a) the cost of living will be huge and b) they're under no obligation to let you in.
23:07:19  yes
23:07:30  and no I actually hadn't thought about that
23:08:55  1. If you are employed or have been offered to work for a Monegasque company within the principality of Monaco
23:08:58  If you are wanting to set up a new business in Monaco, in which case the residency will only be given once the company has been officially registered.
23:09:01  If you can prove that you have a certain net wealth and can leave a minimum capital balance in your Monaco account. This amount is at the discretion of the Monaco bank.
23:09:11  you have to meet one of those three criteria
23:09:39 -!- MDude has quit (Read error: Connection reset by peer).
23:10:03 -!- MSleep has joined.
23:17:24  Is that the requirements for *citizenship*?
23:17:40  yes
23:17:51  God damn.
23:17:56  it's /or/ not /and/
23:18:01  you only have to do one.
23:18:04  Daaamn.
23:18:29  "prove that you have a certain net wealth" I wonder how much that is typically
23:18:43 * Phantom_Hoover → sleep
23:19:09 -!- Phantom_Hoover has quit (Quit: Leaving).
23:19:42  I guess everyone is technically "employed" in Monaco because they either own a business, work for a business, or have so much money that they don't really need a job.
23:20:18  'Cept there's native citizens.
23:23:19  Monaco's population is unusual in that the native Monegasques are a minority in their own country comprising 21.6% of the population. The largest group are French nationals at 28.4%, followed by Monegasque (21.6%), Italian (18.7%), British (7.5%), Belgian (2.8%), German (2.5%), Swiss (2.5%) and US nationals (1.2%).
23:23:41 -!- sebbu2 has changed nick to sebbu.
23:27:18 -!- pikhq_ has joined.
23:27:20 -!- pikhq has quit (Ping timeout: 240 seconds).
23:31:37  huh though apparently the GDP (PPP) per capita in Monaco is ranked 31st
23:32:06  whereas the States are 9th
23:32:48  oh... well
23:33:07  with nominal GDP per capita, Monaco ranks first (in rankings where it's actually /included/)
23:33:23  http://en.wikipedia.org/wiki/List_of_countries_by_GDP_(nominal)_per_capita
23:34:13  so basically
23:34:17  the cost of living in Monaco is ridiculous
23:35:56  and Norway is apparently awesome both in terms of nominal and PPP GDP per capita.
23:36:13  and is also not a micro-nation
23:39:31  oerjan: wtf, so you've alternated between the same two prime ministers for the last 14 years or so?
23:41:54 -!- augur_ has quit (Remote host closed the connection).
23:54:20  http://en.wikipedia.org/wiki/Eurabia
23:54:23  wow this is incredibly stupid.
23:58:00 -!- ais523 has quit (Remote host closed the connection).

2011-11-23:

00:03:14  kallisti: bondevik and stoltenberg?  i guess it's been about that long.  bondevik is retired though, so it's not likely to repeat
00:03:44  erna solberg is the most likely conservative side candidate at the moment
00:09:03  for stoltenberg it's logical, he's the leader of norway's largest party
00:09:54  bondevik on the other hand was leader of a small one, he just had unusual abilities to get much of the right wing side to cooperate
00:12:08  ah
00:14:14  is Norwegian politics good?
00:14:18  is stoltenberg good?
00:14:38  also, at the time it looks like the right wing are likely to take over next election.  still two years until that, though
00:14:54  assuming they can find _some_ way to agree :P
00:16:31  (the progressive party is fairly unpopular with the two smallest right wing parties, although they seem to have realized they're unlikely to get into government again without them)
00:18:24  well "good"?  it's rather peaceful.
00:19:17  stoltenberg is somewhat "technocratic", he's a social economist
00:21:57  good good
00:22:01  all hail technocratic order
00:23:24  American politics kind of works like this: AAAAAAAAAAAHRRRRRRRGGGGGHHHHHHHHHRRRRRRRHHHHHRRRRHHHHGGGGGUUURGLEAAAAAARGHHHHAHAHHHARHARHRRHHARHARAKGAKRKAG
00:23:34  ic
00:25:44  yes
00:25:52  you may be surpirsed to learn this
00:25:59  but it is essentially to understanding what's going on.
00:26:09  even the progressive party isn't much that way in norway any longer
00:26:23  (they're trying to appear responsible so they can get into government)
00:26:28  that's because Norway's economy is good.
00:26:37  (???)
00:26:45  yeah i'm sure that helps
00:27:04  though even when the economy is good in the US it's AAAAAAARGGHHHHHGURGLE
00:27:14  lots of loud angry people.
00:27:15  we're still worried about everyone south of us collapsing, though.  bad for exports.
00:27:24  ah yes.
00:27:37  just export to different places yes. :P
00:28:11  well it doesn't help that china _still_ doesn't want to talk to us after last year's nobel prize
00:28:33  hahahahahahaha
00:29:13  it must be complicated being the prize-giving country.
00:29:24  who do you give the prizes too? complex question.
00:29:47  yeah.  maybe if sweden could give the literature prize to them next year, it'll take some heat off us
00:30:06  or maybe they'll just give up on scandinavia overall
00:30:22  also wait what are they mad about?
00:30:46  about the peace prize going to a chinese dissisent who was at the time in _jail_...
00:30:50  *dissident
00:31:21  oh right
00:31:27  I forgot about that.
00:32:12  i heard there was a little optimism though, apparently a norwegian and chinese minister got seated together recently for lunch/dinner at some conference, iirc
00:32:22  and actually talked
00:32:25  "sheesh Nobel people let us be a communist police state if we want to"
00:32:39  oh good
00:33:07  "hey China, we're sorry you're bad at human rights and we awarded the guy that you wanted to keep quiet for being so awesome."
00:34:10  (this is obvious how the conversation went)
00:34:14  +ly
00:35:59  i read that the chinese had added stupid restrictions so that norwegian salmon, which previously could get from norway to chinese restaurants in just a day or two, now takes 8 days
00:36:13  looool
00:36:22  now all the salmon tastes bad in China.
00:36:26  yeah
00:37:25  some of the physics and chemistry prizes are more impressive some years than others.
00:37:34  you don't say
00:37:35 -!- augur has joined.
00:37:43  like the 2009 one is kind of boring for physics
00:38:01  and supernovae aren't really that awesome but quasicrystals FUCK YEAH THAT'S LIKE NEW SHIT
00:38:47  erm the supernovae were awesome, they showed that the universe is _accelerating_
00:39:13  nah that's boring. QUADICRYSTALS
00:39:16  *S
00:39:22  when all intuition about gravity as well as previous theories say it should be slowing down
00:39:54  ah that's good
00:40:02  I like when scientists use intuition and are wrong. :>
00:40:40 -!- derdon has quit (Remote host closed the connection).
00:40:58   In 1964 Jean-Paul Sartre was awarded the Literature Prize but refused, stating, "A writer must refuse to allow himself to be transformed into an institution, even if it takes place in the most honourable form."
00:41:02  what a dick.
00:41:30  existential dick.
00:42:37  it _has_ been said that getting the literature prize is bad for your future writing, though
00:43:00 -!- MSleep has changed nick to MDude.
00:44:16  hmmm in what way?
00:44:32  as in
00:44:39  bad for your writing style
00:44:42  or bad for your popularity?
00:45:25  bad for your writing style, i think
00:51:02  they should have other categories.
00:51:05  like mathematics!
00:52:24  journalism would be a good category.
00:53:39  well, norway tried to make something like that with the abel prize.
01:02:24  I'm kind of confused about Barack Obama and the Nobel Peace Prize
01:02:34  did he get it because... he wasn't George Bush?
01:03:06  and black.
01:03:53  and tolerant of Muslims I guess?
01:03:56  huh, okay
01:04:01  but he didn't really do anything.
01:04:23  he just wins an award for existing and becoming US president. Congratulations!
01:04:28  you do realize norwegians were just as puzzled as americans about it, right? :P
01:05:39  it may just be a result of Thorbjørn Jagland's (nobel committee leader, former prime minister) natural disaster attracting capability
01:05:57  ah okay.
01:06:04  it's that weird o in his name probably.
01:06:17  it's like a mystic spell.
01:06:27  ancient nordic pagan magic.
01:06:41  see: how he lost his prime ministership; last year's prize
01:06:59  maybe he just likes controversial prizes.
01:07:07  maybe.
01:07:10  also maybe much wasn't going on in Peace in 2009?
01:07:48  hm i guess i've forgotten if there was anything
01:09:07  Several Nobel Laureates have commented: Former Soviet leader Mikhail Gorbachev (winner 1990), gave his congratulations,[55] Bangladeshi economist Muhammad Yunus, (co-winner 2006 prize), said the committee's award was "an endorsement of [Obama] and the direction he is taking."
01:09:21  so yeah they just like him for existing and not being a shitty US president.
01:10:17  good job Obama! you've changed public relations across the world by not being George Bush.
01:11:07  In Europe, French President Nicolas Sarkozy said the award would reinforce Obama's determination to work for justice and peace. He added that the award "finally confirms the return of America in the hearts of all the peoples of the world"
01:11:12  America!! Fuck yeah!!
01:12:26 -!- pikhq has joined.
01:12:32 -!- pikhq_ has quit (Ping timeout: 248 seconds).
01:12:33  Taliban spokesman Zabiullah Mujahid said the decision was ridiculous, saying, "The Nobel prize for peace? Obama should have won the 'Nobel Prize for escalating violence and killing civilians.'"
01:12:37  ha. ha. ha. the irony.
01:13:46  on the plus side, afaict jagland hasn't actually managed to ruin the council of europe yet.  in fact russia even ratified the recent reforms...
01:17:08  help I am not know Eurolitics
01:18:11  council of europe is an organization which has most european countries as members;  it's most important part is the european court of human rights which upholds the european human rights convention
01:18:16  wtf why is Japan a candidate for membership of the council of Europe?
01:18:20  *its
01:18:24  or is it like... candidate to be observer?
01:18:25  it is?
01:19:01  oh
01:19:01  nevermind
01:19:04  I'm colorblind
01:19:15  I thought it was red on the map but it's orange so it's an observerer.
01:20:35  OH HO LETS SEE WHAT XKCD SUCKS HAS TO SAY ABOUT THE NEW XKCD
01:20:38  oh, nothing yet.
01:22:48  also wtf the anthem for the Council of Europe is Ode to Joy?
01:23:13  come on. that's the worst thing ever.
01:23:45 * oerjan swats kallisti -----###
01:23:47  IS NOT
01:24:05  no it's bad.
01:24:10  Beethoven had better stuff.
01:24:24 * oerjan hits kallisti with the saucepan ===\__/
01:24:30  "This set is among the smallest sets ever found."
01:24:42  Rather silly when taken out of context.
01:24:50  DUN DUN DUN DUN DUN DUN DUN DUN DUN DUN DUN DUN /DUN/.. DUNDUN
01:24:52  "Hey guys!  We just discovered a set that has TWO ELEMENTS!"
01:24:56  -- Ode to Joy
01:25:03  "Holy shit!  Only two?  How does it work?"
01:26:43  oerjan: it's mostly just quarter notes and it's in the completely lame key of D major
01:26:50  also: I had to play it a lot in middle school band so now I hate it.
01:28:05  ah childhood abuse, i understand now.
01:28:08  I guess it's not bad with a choir
01:28:14  the POWER OF THE  HUMAN VOICE
01:28:20  kind of makes it a more moving piece
01:29:46  and it's all triumphant and grand
01:30:05  "FUCK YEAH JOY"
01:30:38  *confetti*  *angels*
01:31:07  -- Ode to Joy
01:31:47 -!- Darth_Cliche has joined.
01:32:10 -!- copumpkin has quit (Quit: Computer has gone to sleep.).
01:34:31  mmm pumpkin pie
01:34:57  "Ode to Joy" is just a selection of a part of a symphony, dunno why it's played so much.
01:35:22  Also, *technically* any country could join the Council of Europe.
01:35:30  If the Council of Europe deems a country European, it is.
01:35:36  Zimbabwe
01:35:48  Hypothetically? Yes.
01:36:15  russia is kind of European
01:36:21  culturally
01:36:35  The majority of the population of Russia is in Europe.
01:37:19  right
01:37:36  Russia is the largest country in the world, covering more than one eighth of the Earth's inhabited land area.
01:37:39  that's so insane.
01:43:40 -!- Jafet has quit (Quit: Leaving.).
01:43:59 -!- augur has quit (Remote host closed the connection).
01:49:01   "Holy shit!  Only two?  How does it work?" // just - like - magnets
01:49:32  Gregor: so it's Magic Got It?
01:49:33  kallisti: and it used to be even larger...
01:50:28  magic nets, obviously
01:51:18  I think the EU is cheating.
01:51:25 * oerjan realizes that nearly half his life is _after_ the soviet union dissolved
01:51:33  by having a larger GDP when it's not really a country.
01:52:03  cheaters
01:52:34  "With an area of 22,402,200 square kilometres (8,649,500 sq mi), the Soviet Union was the world's largest state. Covering a sixth of the Earth's land surface, its size was comparable to that of North America."
01:56:51  http://en.wikipedia.org/wiki/File:EU_belief_in_God.svg
01:56:52  compare to
01:57:03  A 2008 survey of 1,000 people concluded that, based on their stated beliefs rather than their religious identification, 70% of Americans believe in a personal God, roughly 12% of Americans are atheist or agnostic, and another 12% are deistic (believing in a higher power/non-personal God, but no personal God).
01:57:25  ...1000 isn't a very large population size
01:57:50 * shachaf believes in an impersonal, mass-produced god.
01:58:48  Gallup International indicates that 41%[56] of American citizens report they regularly attend religious services, compared to 15% of French citizens, 10% of UK citizens,[57] and 7.5% of Australian citizens.
01:58:53  GODLESS EUROPEANS
01:59:01  NO VALUES.
02:00:14  australians are not european.  just saying.
02:00:31  I wasn't talking about them
02:00:41  BUT THEY TOO ARE GODLESS
02:00:43  EVEN MORE SO
02:00:45  SHAMEFUL
02:01:14  http://en.wikipedia.org/wiki/File:Church_or_synagogue_attendance_by_state_GFDL.svg
02:01:29  I live in the orange thing inside that big patch of red.
02:01:32  red for danger.
02:01:38  well the australians are probably substituting with sacred activities such as beach surfing and bbq
02:03:03  Germany: Putting the Gödel back into Godless Europeans.
02:04:45  and of course crocodile wrestling
02:06:42 -!- copumpkin has joined.
02:13:22 -!- Lymia has changed nick to Madoka-Kaname.
02:15:56 -!- Darth_Cliche has quit (Read error: Connection reset by peer).
02:16:17 -!- Darth_Cliche has joined.
02:18:41 -!- calamari has joined.
02:21:12 -!- Darth_Cliche has quit (Read error: Connection reset by peer).
02:21:40 -!- Darth_Cliche has joined.
02:23:42 -!- Darth_Cliche has quit (Client Quit).
02:25:44 -!- augur has joined.
02:26:57 -!- pikhq_ has joined.
02:27:16 -!- pikhq has quit (Ping timeout: 258 seconds).
02:32:38 -!- augur has quit (Remote host closed the connection).
03:04:21  NetBSD: Still installing.
03:27:20  anyone here know the TeX equivalent of 
?
03:27:39  i know i used to know this
03:28:11  \begin{quote} or was that just for literate haskell...
03:28:29  oh, that was code
03:28:31  iirc
03:29:09  (inb4 zzo: that's latex, not tex)
03:29:16  zzo is not here
03:29:24  whew
03:51:45 -!- Sgeo has quit (Ping timeout: 240 seconds).
03:55:17 -!- Sgeo has joined.
03:55:40 -!- augur has joined.
04:08:57 -!- Sgeo has quit (Ping timeout: 240 seconds).
04:25:20 -!- Jafet has joined.
04:34:06  NETBSD: STILL BLOODY INSTALLING
04:34:53  a net drain on resources
04:40:47 -!- Sgeo has joined.
04:47:59 -!- GreaseMonkey has joined.
05:10:58 -!- SgeoN1 has joined.
05:13:45 -!- Sgeo has quit (Ping timeout: 240 seconds).
05:14:53 -!- Sgeo has joined.
05:19:17 -!- sebbu2 has joined.
05:19:17 -!- sebbu2 has quit (Changing host).
05:19:17 -!- sebbu2 has joined.
05:19:33  http://horrorchan.com/post/8846627981/chip-chan
05:19:38  this is so fucking weird and sad.
05:22:09 -!- sebbu has quit (Ping timeout: 240 seconds).
05:25:45 -!- Sgeo has quit (Ping timeout: 240 seconds).
05:28:42 -!- Sgeo has joined.
05:33:45 -!- Sgeo has quit (Ping timeout: 240 seconds).
05:33:57 -!- Nisstyre has quit (Ping timeout: 258 seconds).
05:34:53 -!- Sgeo has joined.
06:06:10 -!- quintopia has quit (Read error: Operation timed out).
06:07:45 -!- quintopia has joined.
06:09:45 -!- Sgeo has quit (Ping timeout: 240 seconds).
06:10:49 -!- Sgeo has joined.
06:21:22 -!- MDude has changed nick to MSleep.
06:35:45 -!- Sgeo has quit (Ping timeout: 240 seconds).
06:36:25  @tell elliott here's Gravity Well but I can't get it to work via Wine http://www.tucows.com/preview/289104
06:36:25  Consider it noted.
06:37:04 -!- Sgeo has joined.
06:54:54  The 'quote' environment does indent a bit, on both sides.
07:14:23 -!- GreaseMonkey has quit (Quit: The Other Game).
07:33:45 -!- Sgeo has quit (Ping timeout: 240 seconds).
07:34:29 -!- Sgeo has joined.
07:39:21 -!- Sgeo has quit (Ping timeout: 240 seconds).
07:40:49 -!- Sgeo has joined.
07:48:15 -!- SgeoN1 has quit (Quit: Bye).
07:51:13 -!- augur has quit (Ping timeout: 252 seconds).
08:01:39 -!- augur has joined.
08:14:53 * Sgeo learns that monqy likes Crawl
08:16:18  hi
08:17:17 -!- augur has quit (Ping timeout: 276 seconds).
08:22:15  Sgeo: no
08:22:20  Sgeo: haven't you learned: I don't
08:22:23  Sgeo: I just hang out there
08:22:58  Sgeo: I don't actually play crawl. it's kind of like how ais hangs out in ##crawl-dev and I don't think he plays crawl either??
08:23:55  so it's less that I like crawl and more that I like ##crawl
08:24:00  ...in which we learn that no one actually plays crawl any longer, they just stay because of the nice community
08:24:23  for some value of nice
08:24:49  well we cannot expect #esoteric standards, of course
08:25:01  naturally
08:27:21 -!- calamari has quit (Quit: Leaving).
08:27:51  Does anyone here do anything with esoteric languages?
08:27:58  whats that
08:27:58 * shachaf doesn't even pretend to.
08:28:28  it happens
08:29:00  elliott is still trying to improve his funge98 in haskell interpreter
08:29:35  zomg $ tr '12345678' '+-<>[],.' | bf
08:29:40 * shachaf invents new esolang.
08:30:07  you're in luck, Phantom_Hoover isn't here
08:30:22  you may still have a slight chance of surviving
08:31:28  shachaf: I've currently got two ideas for esoteric programming languages and one sort-of-but-not-very-esoteric language with a partially written spec.
08:31:36 -!- augur has joined.
08:31:45 -!- Sgeo has quit (Ping timeout: 240 seconds).
08:31:57  oerjan: But look at my innovative syntax!
08:32:31  shachaf: also is that the fabled hasksh
08:32:38  or hask--sh!
08:32:43  bah, it's even context-free, how innovative is that
08:32:46  in formal contexts
08:32:48  such as weddings
08:32:56  hask sh wedding
08:33:01 -!- Sgeo has joined.
08:33:07  kallisti: No, i's regularsh.
08:33:26  hmmm ah
08:33:37  the only thing that was throwing me off was the standalone $
08:34:10  zomg $ must be the propmt
08:34:15  ah
08:34:47  wow I sure am lazy!
08:34:56  oh no
08:34:59  monqy: $ is the prompt, "zomg" is an exclamation.
08:35:07  good
08:35:14  because zomg $ would be a bad prompte
08:37:00  monqy: you zen master programmer yet?
08:37:03  that you?
08:37:04  ???
08:37:07  >
08:37:08  that me?
08:37:11  ye
08:37:15  <
08:37:23  ,ye
08:37:30  q
08:37:38  what is zen master programmer
08:37:49 * kallisti 
08:37:59  speaking of prompts: do you use coloured or monochrome prompts?
08:38:19  monochromme
08:38:27  personally I use a coloured prompt, because it easily stands out in the scrollback.
08:38:39  PS1="\[\033[01;32m\]\u@\h\[\033[01;34m\] \w \$\[\033[00m\] "
08:38:44  maybe I'd like a colored prompt, but i really don't care enough to do one
08:38:52  well there you have one
08:38:55  PS1='C:\>'
08:39:00  actually do it with single quotes
08:39:04  Vorpal: is it rainbow prompt?
08:39:20  my simple prompte: PS1='[\u@\h \w]\$ '
08:39:21  I don't speak ANSI very well
08:39:23  kallisti: nah, it is just green for user@host then blue for path and the $
08:39:30  I use a red prompt for root
08:39:47  which is just hostname in red then path and $ in blue
08:39:50  echo $PS1
08:39:51  \[\e]0;\u@\h: \w\a\]${debian_chroot:+($debian_chroot)}\u@\h:\w\$
08:39:54  default Ubuntu prompt
08:39:58  crazy
08:40:09  export PS1="\[\033[01;31m\]\h\[\033[01;34m\] \w \$\[\033[00m\] " is from root's .bashrc
08:40:52  I think it's time
08:40:55  to smoke the hookah
08:40:57  with the stuff
08:40:59  that I bought
08:41:04  yes
08:41:06  >)
08:41:12  btw if behaviour of ! in bash ever annoyed you, add "set +H" (without quotes) to your .bashrc
08:41:30  it turns off the crazy behaviour of !
08:42:06 -!- monqy has quit (Quit: hello).
08:42:36  the brand is Moassel Ayam Zaman and the flavor is called 1001 Nights
08:42:43  it's supposed to be more like traditional shisha
08:42:56  also it was stupid expensive so it better be good
08:42:59  or I will send angry emails
08:43:01  (I won't)
08:43:59  arabic sure is a pretty script.
08:44:38  it kind of looks like what stereotypical alien language script looks like.
08:45:16 -!- oerjan has quit (Quit: Good night).
08:45:22  oerjan: night
08:45:31  Vorpal$ echo "But I love that behavior!"
08:45:34  Oops.
08:45:39  Let me escape that.
08:45:44  Wait, what happened to my history?
08:47:28 -!- pikhq has joined.
08:47:45 -!- pikhq_ has quit (Ping timeout: 244 seconds).
08:48:00 -!- Sgeo has quit (Ping timeout: 248 seconds).
08:50:50   Wait, what happened to my history? <-- that is what ! does ...
08:51:04 * shachaf looked up: help
08:51:12  ha, ha, get it.
08:51:14  good joke.
08:52:04 -!- Sgeo has joined.
08:55:41  I used to have a real colorful prompt, but I haven't bothered to keep it so now it's just the default. Though I don't really know what's up with this default '\[\e]0;\u@\h: \w\a\]\u@\h:\w\$ ' nonsense, it looks just like the plain '\u@\h:\w\$ ' part.
08:56:58  fizzie: The first part is setting the terminal's title.
08:57:17  Ah, right; couldn't remember what esc-]0; was.
08:58:22  I don't know why they try to match escape codes with \] btw, but it seems to matter, or readline gets fucked up if your input causes a line wrap
08:59:18  Seems I've used PS1="[\t] \[\e[1;34m\]\u@\h \[\e[1;32m\]\w \[\e[1;37m\]\$ \[\e[0m\]" in some bygone age. Bluh.
08:59:37  what does that do?
08:59:47  oh timestamp
08:59:49  right
08:59:57  doesn't look too bad
08:59:57  Well, it's not that far from yours, except with swapped colors and the timestamp.
09:00:06  And a differently colored $.
09:00:13  export PS1="[$CYAN%D{%F} :: %D{%T}$NORMAL] $GOLD%n$NORMAL@$GOLD%m $GREEN%~$NORMAL
09:00:16  $ "
09:00:19  I think mine is based on gentoo's default prompt around 2004 but with some changes
09:00:21  I'm all literate.
09:00:22  PS1="1:$PS1"
09:00:37  Deewiant: what does echo "$PS1" output?
09:00:44  because that is useless without the rest of your file
09:00:57  Vorpal: It outputs in colour, that can't be copied.
09:01:10  Deewiant: huh echo $PS1 here doesn't output in colour
09:01:14  Vorpal: zsh.
09:01:17  ah
09:01:22  well, can't test it anyway then
09:01:45 -!- Sgeo has quit (Ping timeout: 240 seconds).
09:02:10  That's a long timestamp.
09:02:19  hm?
09:02:25  (The colour codes are: normal = 0, green = 32, cyan = 36, gold = 33, yellow = 33, magenta = 35)
09:02:27  your prompt, yes
09:02:29  [yyyy-mm-dd :: HH:MM:SS], in Deewiant's.
09:02:32  oh right
09:03:09 -!- Sgeo has joined.
09:03:46  Some people use two-line prompts and stuffs.
09:03:57  I have seen that, never liked it
09:03:58  Mine is two-line.
09:04:08  oh, %n is a newline?
09:04:14  No, the line break is a newline.
09:04:16  Oh, that's what the raw newline was about.
09:04:17  bbl, university
09:04:51  First line is essentially "[timestamp] user@host pwd" and the second is just "$ "
09:05:19  Right. I just concatenated them when testing, didn't realize the newline was intentional.
09:06:39 -!- augur has quit (Read error: Connection reset by peer).
09:07:06 -!- augur has joined.
09:07:45 -!- Sgeo has quit (Ping timeout: 240 seconds).
09:11:44 -!- Sgeo has joined.
09:30:08  holy crap
09:30:12  I am lightheaded now.
09:30:14  hello
09:30:17   𐎣𐎠𐎼𐎿𐏃𐎠
09:42:07   In chemistry alcohol can refer to more than ethyl alcohol. Methyl (wood) alcohol is poisonous.
09:42:16  poisonous as opposed to...?
10:00:44 -!- kmc has quit (Quit: Leaving).
10:07:14  hi
10:10:33  not poisonous
10:11:45 -!- Sgeo has quit (Ping timeout: 240 seconds).
10:12:53 -!- Slereah_ has joined.
10:13:11  oklopol: right but in the context of ethyl alcohol...
10:14:04 -!- Slereah has quit (Ping timeout: 245 seconds).
10:14:59 -!- Sgeo has joined.
10:16:07  Sgeo: hi
10:16:17  Slereah_:
10:16:18  hi
10:18:01  `ls logs
10:18:08  ls: cannot access logs: No such file or directory
10:18:12  `ls
10:18:14  bin \ canary \ karma \ lib \ paste \ quotes \ share \ wisdom \ x
10:18:31  `ls share
10:18:32  units.dat
10:18:42  `ls /
10:18:43  bin \ dev \ etc \ hackenv \ home \ lib \ lib64 \ opt \ proc \ sbin \ sys \ tmp \ usr \ var
10:18:53 * kallisti though hackego had logs on it
10:19:16  `fetch http://codu.org/logs/_esoteric/2011-11-23-raw.txt
10:19:19  2011-11-23 10:19:19 URL:http://codu.org/logs/_esoteric/2011-11-23-raw.txt [53284/53284] -> "2011-11-23-raw.txt" [1]
10:19:21 -!- Sgeo has quit (Ping timeout: 240 seconds).
10:20:03  kallisti, why?
10:20:17  `ls bin
10:20:19  ​? \ @ \ addquote \ allquotes \ calc \ define \ delquote \ etymology \ forget \ fortune \ frink \ google \ json \ k \ karma \ karma+ \ karma- \ learn \ log \ logurl \ macro \ marco \ paste \ pastekarma \ pastelog \ pastelogs \ pastenquotes \ pastequotes \ pastewisdom \ ping \ prefixes \ qc \ quote \ quotes \ roll \ toutf8 \ translate \ translatefromto \ translateto \ units \ url \ welcome \ wl \ word \ wtf
10:20:27  `url bin/log
10:20:29  http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/bin/log
10:20:44  so logs are available in /var/irclogs/_esoteric
10:20:46  that's a weird place to put logs but okay
10:20:56  `rm "2011-11-23-raw.txt"
10:20:58  rm: cannot remove `"2011-11-23-raw.txt"': No such file or directory
10:20:59  (bin/log that is
10:21:00  )
10:21:06 -!- Sgeo has joined.
10:21:08  Vorpal: sheesh calm down I was going to delete it once I was done.
10:21:09  :P
10:21:12  kallisti, ... bin/log is a script
10:21:23  `log kallisti
10:21:40  hm
10:21:47  takes a while
10:21:51  definitely
10:21:53  2011-11-22.txt:00:45:46:  also def
10:21:56  `log kallisti
10:21:58  also: def
10:22:02  should be faster now
10:22:06  2011-11-22.txt:06:41:40:  kallisti: basically the player behind the ship keeps playing for ten seconds and you have to get in range and aim it
10:22:06  cached and so on
10:26:41  `run cat '/var/irclogs/_esoteric/2011-11-23-raw.txt' | perl -n -e '/:(.*?)!.*JOIN/; $j{$1}++; END {print "$_ $j{$_}; " for sort {$j{$b} <=> $j{$a}} keys %j}'
10:26:44  Sgeo 179; augur 85;  53; pikhq 47; Darth_Cliche 47; pikhq_ 13; sebbu2 7; Slereah_ 3; Jafet 3; copumpkin 3; SgeoN1 2; quintopia 2; calamari 2; GreaseMonkey 1; kallisti 1;
10:27:30  `run cat '/var/irclogs/_esoteric/2011-11-22-raw.txt' | perl -n -e '/:(.*?)!.*JOIN/; $j{$1}++; END {print "$_ $j{$_}; " for sort {$j{$b} <=> $j{$a}} keys %j}'
10:27:31  O_O
10:27:32  copumpkin 610; Jafet 399; GreaseMonkey 357; Madoka-Kaname 303; ineiros 252; derdon 245; DCliche 234; Phantom_Hoover 232; monqy 196; new2net 165; kmc 144; myndz\ 115; derrik 93; pkzip 89; pikhq 73; Darth_Cliche 72; pikhq_ 70; Lymee 53; MSleep 50; ais523 42; augur 42; oerjan 37; Ngevd 36; Phantom__Hoover 31; augur_ 26;  21; sebbu2 15; MDude 11; derrik_ 6; Slereah 3; FireFly 3; aloril 2; Lymia 2; Sgeo 2; Patashu 1; Nisstyre 1;
10:28:44  kallisti, what are you measuring?
10:28:48  number of joins
10:28:57  and the first time?
10:29:03  same thing.
10:29:09  first one is today second is yesterday
10:29:14  ah
10:29:21  according to what timezone?
10:29:28  the... logs
10:29:33  whatever that one is. UTC?
10:29:47  clog is in some weird US timezone I know
10:32:03  I'm sleepy and I'm at university and I have a lecture in 1.5 hours
10:32:21  are you the giving or receiving partner of this lecture.
10:32:32  I'm a student so...
10:32:41  ah
10:32:55  actually two lectures, each taking two hours
10:33:01  I think I have some kind of weird delusion that some people on this channel are like professors or something.
10:33:06  right after each other
10:33:16  Dr. Monqy
10:33:42  really?
10:33:51  I mean not really no.
10:33:54  ah
10:35:21  `run cat '/var/irclogs/_esoteric/2011-11-23-raw.txt' | perl -n -e '/:(.*?)!\w+ (JOIN|PART|QUIT)/; $j{$1}++; END {print "$_ $j{$_}; " for sort {$j{$b} <=> $j{$a}} keys %j}'
10:35:29  474;
10:35:32  .....
10:35:41  yes of course.
10:35:53  `run cat '/var/irclogs/_esoteric/2011-11-23-raw.txt' | perl -n -e '/:(.*?)!\S+ (JOIN|PART|QUIT)/; $j{$1}++; END {print "$_ $j{$_}; " for sort {$j{$b} <=> $j{$a}} keys %j}'
10:35:58  Sgeo 206; augur 67;  53; pikhq_ 41; derdon 38; copumpkin 15; calamari 12; monqy 8; oerjan 6; Darth_Cliche 6; sebbu2 5; Jafet 4; pikhq 3; kmc 3; Slereah_ 2; GreaseMonkey 2; SgeoN1 2; quintopia 2; Slereah 1; sebbu 1; Nisstyre 1;
10:36:16  kallisti, your code is suffering from UUOC
10:36:35  oh wait PART isn't actually an IRC command is it.
10:36:39  also what is UUOC
10:36:44  useless use of cat
10:37:04  kallisti, and afaik PART is an irc command, but maybe no one parted?
10:38:15  oh, I just use cat because I'm more prone to fuck up if I don't
10:38:15  kallisti: Sure it is.
10:38:15  Vorpal: That's not a useless use of cat.
10:38:15  Vorpal: It's more readable than using <
10:38:15  `run perl -n -e '/:(.*?)!\S+ (JOIN|PART|QUIT)/; $j{$1}++; END {print "$_ $j{$_}; " for sort {$j{$b} <=> $j{$a}} keys %j}' < /var/irclogs/_esoteric/2011-11-23-raw.txt
10:38:15  Sgeo 212; augur 67;  53; pikhq_ 41; derdon 38; copumpkin 15; calamari 12; monqy 8; oerjan 6; Darth_Cliche 6; sebbu2 5; Jafet 4; pikhq 3; kmc 3; Slereah_ 2; GreaseMonkey 2; SgeoN1 2; quintopia 2; Slereah 1; sebbu 1; Nisstyre 1;
10:38:15  shachaf, no it isn't
10:38:15  ENOUGH OF THIS
10:38:15  well I could even just pass it in as an argument to perl
10:38:15  shachaf, and it spawns an extra process
10:38:15  kallisti, sure, I'm no perl expert
10:38:17  shachaf, cat is useless unless used interactively to dump a file to your terminal or to *concatenate* files.
10:38:19  Vorpal: Oh no! Amidst this paragon of efficiency, this beautifully-optimized log-searching machine, a traitor!
10:38:25  -n basically says "loop through lines from files passed as command arguments or stdin"
10:38:46  Vorpal: I like to read command lines left-to-right. generate-things | do-things-to-things | output-things and so on.
10:39:00  shachaf: dude perl is the most optimized of the languages.
10:39:04  "cat foo" is a great way to say "generate the contents of this file"
10:40:06  (yes languages, not implementations)
10:40:06  anyway this conversation is silly :P
10:40:06  I don't care that it spawns an extra process. If I was worrying about efficiency I'd be doing something else.
10:40:06  I wonder if there's an easier way to say "sort in descending order" than sort {$b <=> $a} @blah
10:40:06  `run dd if=/var/irclogs/_esoteric/2011-11-23-raw.txt of=/dev/stdout | perl -n -e '/:(.*?)!\S+ (JOIN|PART|QUIT)/; $j{$1}++; END {print "$_ $j{$_}; " for sort {$j{$b} <=> $j{$a}} keys %j}'
10:40:06  127+1 records in \ 127+1 records out \ 65070 bytes (65 kB) copied, 0.008997 s, 7.2 MB/s \ Sgeo 229; augur 67;  53; pikhq_ 41; derdon 38; copumpkin 15; calamari 12; monqy 8; oerjan 6; Darth_Cliche 6; sebbu2 5; Jafet 4; pikhq 3; kmc 3; Slereah_ 2; GreaseMonkey 2; SgeoN1 2; quintopia 2; Slereah 1; sebbu 1; Nisstyre 1;
10:40:06  eh, almost :P
10:40:21  Vorpal: Look, cat is a very standard read-file tool.
10:41:05  `run dd if=/var/irclogs/_esoteric/2011-11-23-raw.txt of=/dev/stdout status=noxfer | perl -n -e '/:(.*?)!\S+ (JOIN|PART|QUIT)/; $j{$1}++; END {print "$_ $j{$_}; " for sort {$j{$b} <=> $j{$a}} keys %j}'
10:41:05  It's not making things more complicated. Everyone knows what cat means.
10:41:05  130+1 records in \ 130+1 records out \ Sgeo 237; augur 67;  53; pikhq_ 41; derdon 38; copumpkin 15; calamari 12; monqy 8; oerjan 6; Darth_Cliche 6; sebbu2 5; Jafet 4; pikhq 3; kmc 3; Slereah_ 2; GreaseMonkey 2; SgeoN1 2; quintopia 2; Slereah 1; sebbu 1; Nisstyre 1;
10:41:05  hm...
10:41:05  I like how this debate is completely ridiculous
10:41:05  :P
10:41:05  kallisti: Vorpal isn't the first person to bring up this annoying point.
10:41:05  `run dd if=/var/irclogs/_esoteric/2011-11-23-raw.txt of=/dev/stdout 2>/dev/null | perl -n -e '/:(.*?)!\S+ (JOIN|PART|QUIT)/; $j{$1}++; END {print "$_ $j{$_}; " for sort {$j{$b} <=> $j{$a}} keys %j}'
10:41:05  that should work
10:41:05  Sgeo 237; augur 67;  53; pikhq_ 41; derdon 38; copumpkin 15; calamari 12; monqy 8; oerjan 6; Darth_Cliche 6; sebbu2 5; Jafet 4; pikhq 3; kmc 3; Slereah_ 2; GreaseMonkey 2; SgeoN1 2; quintopia 2; Slereah 1; sebbu 1; Nisstyre 1;
10:41:05  ah it has a long grudgeful history
10:41:05  yeah
10:41:08  kallisti, indeed
10:41:13  Vorpal: Not as good.
10:41:23  cat reports errors.
10:41:23  shachaf, indeed, but sillier :P
10:41:28  anyway point is: Sgeo is spammy
10:41:36  Right. < and dd are both sillier.
10:41:45  shachaf, < is the cleanest solution
10:41:51  except for passing it as argument to perl
10:41:57  @tell Phantom_Hoover significantly associated with join/part spam my ass :P
10:41:58  Consider it noted.
10:42:02  anyway the point was to prove PH wrong.
10:42:28  so I win. yay.
10:42:28  Vorpal: If you were at least putting it at the front of the command line I *might* believe you.
10:42:28 -!- glogbackup has joined.
10:42:31 -!- glogbackup has left.
10:42:31  ` $j{$a}} keys %j}'
10:42:39  shachaf, so you avoid "where" in haskell?
10:42:39  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: /hackenv/ Vorpal: where is a different thing.
10:42:57  I think.
10:42:59  Vorpal: No, but when I write out composition or application, I do it in order.
10:43:10  `run  $j{$a}} keys %j}'
10:43:11  bash: run: command not found
10:43:13  as where involves arrangement levels of abstraction
10:43:18  IMO the order of composition is the wrong one
10:43:18  whereas this is pipelining data.
10:43:24  `run  $j{$a}} keys %j}'
10:43:27  Sgeo 262; augur 67;  53; pikhq_ 41; derdon 38; copumpkin 15; glogbackup 14; calamari 12; monqy 8; oerjan 6; Darth_Cliche 6; sebbu2 5; Jafet 4; pikhq 3; kmc 3; Slereah_ 2; GreaseMonkey 2; SgeoN1 2; quintopia 2; Slereah 1; sebbu 1; Nisstyre 1;
10:43:32  :t flip (.)
10:43:33  forall a b (f :: * -> *). (Functor f) => f a -> (a -> b) -> f b
10:43:37  Vorpal: It doesn't matter which order it goes in.
10:43:40  bash has the opposite order.
10:43:43  They're both fine.
10:43:43  OH GOD WHAT HAVE I DONE.
10:43:47 * kallisti will never use cat again.
10:43:48  (lie)
10:43:50  The point is that cat is just one more step in the pipeline.
10:44:58  `run perl -n -e '/:(.*?)!\S+ (JOIN|PART|QUIT)/; $j{$1}++; END {print "$_ $j{$_}; " for sort {$j{$b} <=> $j{$a}} keys %j}' /var/irclogs/_esoteric/*raw.txt   #wheeeeee
10:45:12  this is going to be so fun
10:45:30  No output.
10:45:32  well < worked fine there at the start
10:45:32  as expected
10:45:32  ..
10:45:34  :(
10:46:01  did it timeout or something?
10:46:02  gah, lag
10:46:07  fuck this wlan
10:46:19  Vorpal: What's the point in making a special-case for the "generating something" part of a pipeline when the "something" happens to be the contents of exactly one file?
10:46:22  kallisti, probably
10:46:45  `run echo perl -n -e '/:(.*?)!\S+ (JOIN|PART|QUIT)/; $j{$1}++; END {print "$_ $j{$_}; " for sort {$j{$b} <=> $j{$a}} keys %j}' /var/irclogs/_esoteric/*raw.txt
10:46:46  If it was 0 files, or 2 files, you would say to use echo or cat. Why make a special case for 1?
10:46:52  perl -n -e /:(.*?)!\S+ (JOIN|PART|QUIT)/; $j{$1}++; END {print "$_ $j{$_}; " for sort {$j{$b} <=> $j{$a}} keys %j} /var/irclogs/_esoteric/2003-01-18-raw.txt /var/irclogs/_esoteric/2003-01-19-raw.txt /var/irclogs/_esoteric/2003-01-20-raw.txt /var/irclogs/_esoteric/2003-01-21-raw.txt /var/irclogs/_esoteric/2003-01-22-raw.txt /var/irclogs/_esoteric/2003-01-23-raw.txt /var/irclogs/_esoteric/2003-01-24-raw.txt
10:46:55  oh oops
10:47:13  `run echo perl -n -e '/:(.*?)!\S+ (JOIN|PART|QUIT)/; $j{$1}++; END {print "$_ $j{$_}; " for sort {$j{$b} <=> $j{$a}} keys %j}' /var/irclogs/_esoteric/*raw.txt > donttimeoutplz.sh
10:47:16  No output.
10:47:26  `donttimeoutplz.sh
10:47:27  er
10:47:28  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: donttimeoutplz.sh: not found
10:47:37  `run ./donttimeoutplz.sh
10:47:37  bash: ./donttimeoutplz.sh: Permission denied
10:47:39  `run chmod +x ./donttimeoutplz.sh
10:47:47  No output.
10:47:48  `run ./donttimeoutplz.sh
10:47:59  I have no idea how this will fix anything
10:48:15  ​./donttimeoutplz.sh: line 1: syntax error near unexpected token `(' \ ./donttimeoutplz.sh: line 1: `perl -n -e /:(.*?)!\S+ (JOIN|PART|QUIT)/; $j{$1}++; END {print "$_ $j{$_}; " for sort {$j{$b} <=> $j{$a}} keys %j} /var/irclogs/_esoteric/2003-01-18-raw.txt /var/irclogs/_esoteric/2003-01-19-raw.txt /var/irclogs/_esoteric/2003-01-20-raw.txt /var/irclogs/_esoteric/2003-01-21-raw.txt /var/irclogs/_esoteric/2003-01-22-raw.txt
10:48:15  bah
10:48:15  `rm donttimeoutplz.sh
10:48:15  fuck you bash
10:48:16  No output.
10:48:19  and your escaping bullshit.
10:48:29  er
10:48:33  wait what
10:48:33  gnh this connection...
10:49:19  okay reconnected to bouncer again, hopefully more stable
10:49:45  kallisti, anyway you want to know who has most JOIN, PART, QUIT over all the history?
10:49:45 -!- Sgeo has quit (Ping timeout: 240 seconds).
10:49:59  yes
10:50:11  kallisti, I can do that in a bit if sshing home is stable enough
10:50:18  `run echo '#!/bin/sh' > bin/hi; echo perl -n -e '/:(.*?)!\S+ (JOIN|PART|QUIT)/; $j{$1}++; END {print "$_ $j{$_}; " for sort {$j{$b} <=> $j{$a}} keys %j}' /var/irclogs/_esoteric/*raw.txt >> bin/hi
10:53:23 -!- esowiki has joined.
10:53:49 -!- esowiki has joined.
10:54:10 -!- esowiki has joined.
10:54:17 -!- glogbot has joined.
10:54:17 -!- glogbackup has left.
10:54:29  kallisti, elliott and elliott_ and tusho and other aliases he used are all merged into elliott in the logs_na view
10:54:36  similar for other known cases
10:54:55  ah
10:55:07  anyway that doesn't tell you much really
10:55:14  nah I was just curious
10:55:16  `rm bin/hi
10:55:18  after all, elliott has been active for long
10:55:39  and Sgeo is obviously a scoundrel.
10:56:00  sgeo has been around for ages too
10:56:04  let see count of lines
10:56:13  => select nick,COUNT(*) from irc.logs_na where type in (0,1) group by nick order by count desc limit 4;
10:56:13    nick   | count
10:56:13  ---------+--------
10:56:13   elliott | 690342
10:56:13   Vorpal  | 284600
10:56:13   ais523  | 144113
10:56:14  No output.
10:56:17   oerjan  | 100266
10:56:43 * kallisti has "been around" but not consistently.
10:56:43  looks like I'm still second in number of lines said
10:56:46  Vorpal: if you combine all of my nicks together I am probably creeping forward.
10:56:57  kallisti, don't know which ones you have
10:57:08  and I'm not going to edit that view definition over laggy ssh
10:57:18  it is done by regexp
10:57:39  SevenInchBread, CakeProphet, and kallisti.  both in acsending chronological order and in descending order of obnoxiousness.
10:57:46  which is kind of slow
10:57:54  maybe a JOIN on a nick-mapping table would be better
10:57:59  => select count(*) from irc.logs where nick = 'kallisti' and type in (0,1);
10:58:00   count
10:58:00  -------
10:58:00    1365
10:58:07  kallisti, oh you are CakeProphet, right
10:58:12  yes
10:59:03  soon it will sink in.
10:59:03  => select count(*) from irc.logs where nick in ('kallisti', 'CakeProphet', 'SevenInchBread') and type in (0,1);
10:59:03   count
10:59:03  -------
10:59:03   55136
10:59:03  I should probably make a nick-merging thing too some day for my logdb.
10:59:03  hm
10:59:03  that's not very much actually.
10:59:03  > select n.name, count(*) from event e join nick n on e.nick = n.id where e.type in ('join', 'part', 'quit') and e.target = (select id from target where name = '#esoteric') group by n.name order by count desc limit 3;
10:59:03    name  | count
10:59:03  --------+-------
10:59:03   augur  |  7271
10:59:03   oerjan |  5367
10:59:03    : parse error on input `,'
10:59:03   ais523 |  4133
10:59:03  The non-merged ones lie so much.
10:59:03  fizzie, the regexp solution is not very fast. It does handle stuff like Sgeo|foo for all foo
10:59:26  fizzie, event e?
10:59:37  Yes?
10:59:50  what is that. I fail at parsing that sql line.
11:00:02  WHAT DO YOU WANT FROM MEEEE
11:00:09  'event' is the table, 'e' is the name for it so that one can write e.foo.
11:00:18  oh right
11:00:28  fizzie, so, you changed your script significantly then?
11:00:43  augur: you could have avoided this if you hadn't joined/parted/quit quite so much in the past.
11:00:47  or are you logging straight to sql now?
11:00:48  augur: shame on you
11:01:13  kallisti: diaf
11:01:17  Vorpal: Well, this is not the esolog script, this is my "all logs in a db for searching" one, which was reasonably different even originally.
11:01:28  ah
11:01:46  Vorpal: Sadly I haven't managed to make myself do the search frontend, so mostly I just grep the raw logs instead. :p
11:01:58  heh
11:02:04  fizzie, you used the db just there?
11:02:09  augur: "do I actually fuck?"  "digging in a fountain" uh....
11:02:11  anyway, sql for searching is fine
11:02:40  augur: I'm not very good with IRC lingo or whatever that is.
11:02:54  kallisti, data interpolation address float
11:03:02  what Vorpal said
11:03:11  wat
11:03:20  kallisti, only if you have fractional memory addressing
11:03:26  is that like
11:03:30  a dessert drink?
11:03:54  kallisti, I mean *2.94 to address the bit on address 2.94
11:04:18  I'm
11:04:27  kallisti, it obviously interpolate if required, depending on the resolution of you memory banks
11:04:28  so confused right now. what does this have to do with what I said.
11:04:41  kallisti, diaf...
11:04:52  augur said that
11:04:53  to me
11:04:59  for some reason
11:04:59  why?
11:05:01  kallisti, "die in a fire"
11:05:03  is what he means
11:05:08  ah
11:05:08  yes
11:05:16  kallisti, I just invented a different interpretation...
11:05:25  jokes aren't funny when you explain them
11:05:35  LIES AREN'T FUNNY
11:05:56  Vorpal: I kind of thought it was made up but then it got all consensus'd and I was confused.
11:06:07  groupthink help
11:06:08  kallisti, obviously augur has humour.
11:06:19  Vorpal: SQL's fine for counting things and such, but after separating "targets" (read (network,channel) tuples) into a different table, and network names to a third one, it's quite faster to write "grep foo logs/freenode/#esoteric/*" than "psql" + "select n.name, e.text from logs.event e join logs.nick n on e.nick = n.id where e.target = (select id from logs.target t join logs.network w on t.network = w.id where w.name = 'freenode' and t.name = '#esoteric') and
11:06:22   e.text like '%foo';"
11:06:33  fizzie, true
11:06:40  i bought a bag of humour the other day
11:06:45  havent gotten even halfway through it yet
11:06:50  fizzie, can be /way/ faster to do in sql, Unless it is way slower
11:07:21  ive been into turkish humour lately
11:07:28  I have no idea what that is
11:07:42  it might be a bit too saccharine but its soooo good
11:08:05 * Vorpal googles saccharine
11:08:11  sugar
11:08:23  er
11:08:23  well
11:08:23  right
11:08:23  it's a made up word
11:08:23  "Saccharin[2] is an artificial sweetener."
11:08:26  oh
11:08:29  nevermind
11:08:49  I've seen saccharine or something similar used as like an adjective form of saccharide
11:08:51  1. cloying, saccharine, syrupy, treacly -- (overly sweet)
11:08:52  to basically mean sugary
11:09:00  oh
11:09:02  yes that
11:09:15  kallisti, anyway I guess the interpolated float addressing is kind of how 1D texture units work on GPUs
11:09:28  kind of
11:09:31  saccharine also has a metaphorical sense
11:09:41  augur, meaning?
11:10:04  sentimental, cute, sweet, to an obnoxious degree
11:10:07  ah
11:10:17  twee
11:10:39  augur, you should say 2H-1λ⁶,2-benzothiazol-1,1,3-trione instead
11:10:42  :D
11:10:51  no i shouldnt
11:10:54  yes you should
11:11:06  that is the IUPAC name for saccharin
11:11:17  ok
11:11:19  GOOD NIGHT
11:11:22  cya
11:12:03  "saccharine, adj. and n. Etymology:  Formed as saccharin n. + -ine suffix. Compare French saccharin. .. saccharin, n. Etymology: < medieval Latin sacchar-um or Greek σάκχαρον , σάκχαρ(ι) sugar + -in suffix. 1. The anhydride of saccharic acid. (Discovered and named by Péligot 1880.) 2. An intensely sweet substance obtained from coal tar, o-sulphobenzoic imide, C7H5NO3S, used in minute quantities for sweetening the food or drink of persons to whom
11:12:06   sugar is injurious. ..."
11:14:32  "Swiftly and cloying-sweet as saccharine In Governmental tea, a week had melted. G. Frankau, One of Them xvii. 128, 1918." The quotations are always so delightfully random.
11:15:04  fizzie, where is that from?
11:15:06  sounds like fungot
11:15:07  Vorpal: in a good story, they function in an undiagnosable way? for instance, i've recently picked up a hobby, and it's been super great! i signed up for an english as a second language course.
11:15:10  ^style
11:15:11  Available: agora alice c64 ct darwin discworld europarl ff7 fisher fungot homestuck ic irc iwcs jargon lovecraft nethack pa qwantz* sms speeches ss wp youtube
11:15:18  ^style ct
11:15:18  Selected style: ct (Chrono Trigger game script)
11:15:52  OED. Or if you mean the quotation itself, it's from G. Frankau's One of Them, like it says.
11:16:01  hm
11:16:09  fungot: The sword alone?
11:17:01  fizzie: that sword alone can't stop! that sword alone can't stop! that sword alone can't stop! that sword alone can't stop! that sword alone can't stop! that sword alone can't stop! that sword alone can't stop! that sword alone can't stop! that sword alone can't stop! that sword alone can't stop! that sword alone can't stop! that sword alone can't stop! that sword alone can't stop, crono!
11:17:01  Woot.
11:17:01  I like how it actually stopped there at the end.
11:17:01  whatever book that is
11:17:01  gah the connection
11:17:01  heh
11:19:27  "The first Aalto SCI November Fest, held on 24th November, attracted nearly 200 researchers from all our Departments. Below a list of the research posters which were in the exhibition at Saha building."
11:19:39  I like how they've written this newspost in past tense, even though the actual thing is tomorrow.
11:19:54  lol
11:20:25  Wonder if they'd retcon the numbers if significantly fewer-than-registered people happened to actually come there.
11:21:07  heh
11:27:28 -!- glogbackup has joined.
11:36:08  glogbackup: Uhhh.
11:36:43  Possibly it thought "better safe than sorry".
11:37:42 -!- Sgeo has quit (Ping timeout: 240 seconds).
11:39:43 -!- glogbackup has left.
11:40:48 -!- Sgeo has joined.
11:40:55  UPS tracking is being confusing. There's a no-location "Activity: A valid tax identification number or deferment number is required for clearance" at 6:53AM; then after that, in sequence, 7:25AM "Arrival Scan" in Helsinki; 7:57AM "Arrival Scan" in Vantaa (neighbour town); and 9:44AM "Import Scan" again in Helsinki. And then nothing else during the day, except the ETA is still listed as "By End of Day" today.
11:42:36  fizzie, heh
11:43:19  I'll bbl until late evening. Cya
11:45:45 -!- Sgeo has quit (Ping timeout: 240 seconds).
11:46:49 -!- Sgeo has joined.
12:22:27 -!- glogbackup has joined.
12:33:21 -!- glogbot has quit (Ping timeout: 240 seconds).
12:33:27 -!- esowiki has joined.
12:33:52 -!- esowiki has joined.
12:34:27 -!- glogbot has joined.
12:34:27 -!- glogbackup has left.
12:35:25 -!- Sgeo has joined.
12:39:30 -!- EgoBot has quit (Read error: Connection reset by peer).
12:40:01 -!- EgoBot has joined.
12:45:45 -!- Sgeo has quit (Ping timeout: 240 seconds).
12:47:10 -!- Sgeo has joined.
12:55:07 -!- Patashu has quit (Quit: MSN: Patashu@hotmail.com , Gmail: Patashu0@gmail.com , AIM: Patashu0 , YIM: patashu2 , Skype: patashu0 .).
12:57:45 -!- Sgeo has quit (Ping timeout: 240 seconds).
12:59:46 -!- Sgeo has joined.
13:07:24 -!- Phantom_Hoover has joined.
13:08:10  Hello everyone, lambdabot.
13:08:10  Phantom_Hoover: You have 1 new message. '/msg lambdabot @messages' to read it.
13:23:45 -!- Sgeo has quit (Ping timeout: 240 seconds).
13:26:04 -!- Sgeo has joined.
13:36:07 -!- kallisti has quit (Read error: Operation timed out).
13:37:25 -!- glogbackup has joined.
13:37:32 -!- pikhq_ has joined.
13:38:23 -!- pikhq has quit (Ping timeout: 276 seconds).
13:41:21 -!- Sgeo has quit (Ping timeout: 240 seconds).
13:44:30 -!- Sgeo has joined.
13:51:15 -!- sebbu2 has changed nick to sebbu.
14:05:14 -!- copumpkin has quit (Ping timeout: 252 seconds).
14:05:38 -!- copumpkin has joined.
14:29:53 -!- esowiki has joined.
14:30:30 -!- esowiki has joined.
14:30:30 -!- glogbot has joined.
14:32:59 -!- MSleep has changed nick to MDude.
14:39:31 -!- HackEgo has quit (Read error: Connection reset by peer).
15:08:39 -!- copumpkin has quit (Ping timeout: 245 seconds).
15:09:04 -!- copumpkin has joined.
15:20:33 -!- copumpkin has quit (Quit: Computer has gone to sleep.).
15:21:32 -!- augur has quit (Read error: Connection reset by peer).
15:21:52 -!- augur has joined.
15:49:00 -!- copumpkin has joined.
16:13:22  what is this thing that has numbers net to nicks and got me pinged like fifty times
16:17:20  2011-11-23 12:26:24 ( kallisti) `run cat '/var/irclogs/_esoteric/2011-11-23-raw.txt' | perl -n -e '/:(.*?)!.*JOIN/; $j{$1}++; END {print "$_ $j{$_}; " for sort {$j{$b} <=> $j{$a}} keys %j}'
16:40:28   what is this thing that has numbers net to nicks and got me pinged like fifty times <-- how can you look in the log and see those lines but not the lines just before them?
16:40:37  that makes no sense
16:41:46  quintopia: ?
16:43:04  Vorpal: Away logs ofttimes show only the lines containing the pings
16:43:13  ah, those
16:43:14  right
16:43:35  I only have full logs personally, no special away log at all
16:44:20  Irssi auto-prints an away log upon unawaying
16:44:36  Unless one has it disabled, presumably
16:46:00  [download]   6.8% of 1.31G at  368.22k/s ETA 57:54 <-- whyyyyy!? The video is 38 minutes. I can't watch it while downloading. Why can't youtube max out my bw...
16:52:32 -!- elliott has joined.
16:54:41  21:35:07:  @src ap
16:54:41  21:35:07:  ap = liftM2 id
16:54:41  21:35:13:  oh Applicative, right
16:54:41  elliott: You have 2 new messages. '/msg lambdabot @messages' to read them.
16:54:43  no, Monad
17:12:49  23:17:24:  Is that the requirements for *citizenship*?
17:12:49  23:17:40:  yes
17:12:49  23:17:51:  God damn.
17:13:06  pikhq_: I think you'll find that most countries want you to have an in-demand skill or a lot of money to move there?
17:13:45  23:39:31:  oerjan: wtf, so you've alternated between the same two prime ministers for the last 14 years or so?
17:13:52  We alternated between the same one for ten years.
17:13:52 -!- Sgeo has quit (Ping timeout: 240 seconds).
17:15:56  01:02:24:  I'm kind of confused about Barack Obama and the Nobel Peace Prize
17:15:56  01:02:34:  did he get it because... he wasn't George Bush?
17:16:05  Didn't everyone believe he was going to shut down Guantanamo at the time?
17:16:10  That's like... not punching someone any more.
17:16:13  That's sort of peacey?
17:16:53 -!- Sgeo has joined.
17:16:59   pikhq_: I think you'll find that most countries want you to have an in-demand skill or a lot of money to move there? <-- What about Schegen? (however that is spelled)
17:17:40  Vorpal: Yes, which requires you to get into an EU country, which will require... an in-demand skill, or a lot of money.
17:17:49  oh right
17:17:58  oh hi doom 3 source code!
17:18:06  elliott: I guess in this context the Schegen area counts pretty much as one country
17:18:16  elliott: hm when was that released?
17:18:18  today?
17:18:20  today
17:18:23  nice
17:18:27  elliott: got a link?
17:18:31  eeh, 3 github notifications
17:18:33  ah
17:18:38  i hope the other fork doesn't realise i'm collaborating
17:18:41  Vorpal: https://github.com/TTimo/doom3.gpl
17:18:52   i hope the other fork doesn't realise i'm collaborating <-- huh?
17:19:00  Vorpal: i reported the same bug to two forks :)
17:19:04  of the same project
17:19:04  heh
17:19:45  hm originally released 2004, kind of semi-modern then
17:20:01  It has the most HD shadows.
17:20:58  "I would say I would prefer my ugly hack to adding the ScopedTypeVariable extension."
17:21:01  Oh come on!
17:21:36  heh funny physics bug in skyrim, you can get thrown upwards sometimes when being killed by giants at a tremendous speed.
17:21:58  well not so much tremendous speed, as lack of slowing down.
17:23:18  elliott: you will enjoy this video, unless you already seen the bug: https://www.youtube.com/watch?v=yQihK62XsrM
17:23:47  (the bug happens in the last third or so of the video)
17:26:09  meh, i think i'll abandon this fork, the other one looks better
17:29:18  Vorpal: rheh
17:29:23  s/rheh/heh/
17:29:45  elliott: it wouldn't be a havok game without silly physics bugs :P
17:29:54  (yes I'm pretty sure I read that it uses havok)
17:34:21 -!- augur has quit (Remote host closed the connection).
17:36:49  does anyone know what license the OpenCL headers are for?
17:38:56 -!- monqy has joined.
17:39:24  elliott: btw really stupid thing when dealing with chests in game: R is put in chest when viewing your inventory. What do you think R is when viewing the chest inventory?
17:39:30  elliott: hint: it is /not/ take item
17:39:48  Is it "destroy with fire".
17:39:52  elliott: "take everything"
17:40:26  which is just annoying when you are putting a lot of loot into a chest in your house. Chests have no weight limits either. So you can end up with a few thousand kilos. E is take single item
17:40:31  and in inventory view e is use
17:40:34  so yeeeah
17:40:46  it is just the worst mapping ever
17:40:52  btw click is use too in inventory
17:41:48  See, AII has the best mapping.
17:44:04  elliott: and is not an RPG
17:44:13  Exactly. That's two improvements already!
17:44:37 -!- kmc has joined.
17:47:52 -!- Sgeo has quit (Ping timeout: 240 seconds).
17:48:07  elliott: :(
17:48:58 -!- Sgeo has joined.
17:55:33  bbl
17:55:42 -!- Vorpal has quit (Quit: ZNC - http://znc.sourceforge.net).
17:56:51  01:51:25: * oerjan realizes that nearly half his life is _after_ the soviet union dissolved
17:57:00 * elliott realises that all his life etc. :P
17:59:30  elliott: Some countries are dickier about it than others.
17:59:53  About what
17:59:58  Immigration.
18:00:07  Right
18:01:53 -!- Sgeo has quit (Ping timeout: 240 seconds).
18:03:08 -!- Sgeo has joined.
18:14:09 -!- augur has joined.
18:15:38  08:29:00:  elliott is still trying to improve his funge98 in haskell interpreter
18:15:47  IF NOT FOR A CERTAIN OTHER PERSON COUGH COUGH COUGH
18:15:49 -!- Phantom_Hoover has quit (Quit: Leaving).
18:18:01 -!- Phantom_Hoover has joined.
18:19:42  10:36:16:  kallisti, your code is suffering from UUOC
18:19:49  your line is suffering from UUOUUOC
18:20:11  10:38:15:  Vorpal: That's not a useless use of cat.
18:20:11  10:38:15:  Vorpal: It's more readable than using <
18:20:11  10:38:15:  shachaf, no it isn't
18:20:11  Yes it is.
18:20:24  10:38:15:  shachaf, and it spawns an extra process
18:20:24  You should see how many processes shell scripts spawn.
18:20:53  Hmm, I was going to continue yelling at Vorpal through the logs but shachaf pretty much said everything.
18:21:53 -!- Sgeo has quit (Ping timeout: 240 seconds).
18:22:29  10:45:32:  well < worked fine there at the start
18:22:29  10:45:32:  as expected
18:22:37  Pretty sure not every shell even supports that.
18:23:00  `rm bin/hi
18:23:26 -!- Sgeo has joined.
18:28:24  goodbye hi
18:28:31  hackego???
18:28:31  elliott: You have 1 new message. '/msg lambdabot @messages' to read it.
18:28:36  Gregor: hackegooooooo
18:28:41  oh
18:28:44  hackego...
18:47:53 -!- Sgeo has quit (Ping timeout: 240 seconds).
18:49:38 -!- Sgeo has joined.
18:55:35 -!- augur has quit (Remote host closed the connection).
18:55:53 -!- Sgeo has quit (Ping timeout: 240 seconds).
18:58:58 -!- Sgeo has joined.
18:59:37  elliott: Aha, another sensible person.
18:59:43  In this channel. Go figure.
18:59:47  `quote opinions
18:59:54  Hmm, wait.
18:59:56  `quote opinion
19:00:01  Oh, wait.
19:00:04  HackEgo isn't even here.
19:00:22  How quickly they forget.
19:00:35     381  I can trust elliott_ to have an opinion on anything and everything  Yes.  And the best thing is: it is the correct opinion.
19:00:37  There we go.
19:00:53 * elliott has even heard the "but it's another process thing!" before.
19:01:01  fork() takes literally minutes.
19:01:03  elliott: Dude, like, efficiency, you know?
19:01:17  Think of the constant factors.
19:01:35  shachaf: Personally I write all my shell pipelines in assembly.
19:01:45  (mov eax, ebx) | ret
19:04:39  "Function type A -> B in some sense is not very good. Though functions are first class values, one often cannot freely operate them due to efficiency problems. You can't apply too many transformations (A -> B) -> (C -> D), at some point you have to compute a value.
19:04:40  Obviously this is due to the non-strict nature of -> ."
19:04:50  shachaf: See, all we need is to make | strict.
19:05:29 -!- Sgeo has quit (Ping timeout: 240 seconds).
19:06:45 -!- Sgeo has joined.
19:11:08  elliott: ?
19:11:13  Ah, stackoverflow.
19:11:30 * elliott occasionally reads stackoverflow questions just to gawp at them.
19:11:43  It is not the most productive thing, but I can't quite give up on seeing people ask for "alternatives to ->".
19:11:48  You know, stricter ones.
19:21:53 -!- Sgeo has quit (Ping timeout: 240 seconds).
19:22:47 -!- Sgeo has joined.
19:23:28  elliott: To be fair, -> isn't -- actually, I can't think of any way to be fair.
19:23:54  I think what they're saying is that (a . b . c . d) builds up too many thunks, and they want to "force" it somehow. By... deepseqing the function, I guess?
19:24:18  I suppose TECHNICALLY every function has a finite domain if we're talking about real computers!
19:25:05  elliott: Operationalist.
19:25:13  Heck naw
19:35:03  oh god i watched father ted too much and now i think in an irish accent
19:40:49 -!- ais523 has joined.
19:54:05  hi ais523
19:54:10  hi
20:07:53 -!- Sgeo has quit (Ping timeout: 240 seconds).
20:09:48 -!- Sgeo has joined.
20:18:03 -!- plycke has joined.
20:18:16 -!- plycke has quit (Excess Flood).
20:22:17 -!- Sgeo has quit (Ping timeout: 240 seconds).
20:24:51 -!- GreaseMonkey has joined.
20:24:53 -!- Sgeo has joined.
20:29:06  http://en.wikipedia.org/wiki/Hector_%C3%93_hEochag%C3%A1in
20:29:13  hEochagáin.
20:29:18  h...Eochagáin.
20:31:32  Agáin with those Eochs.
20:31:53 -!- Sgeo has quit (Ping timeout: 240 seconds).
20:32:01  fizzie: *hEoch.
20:32:02  s.
20:32:52 -!- Sgeo has joined.
20:41:53 -!- Sgeo has quit (Ping timeout: 240 seconds).
20:42:47 -!- Sgeo has joined.
20:47:55 -!- oerjan has joined.
20:48:36  > id
20:48:37    Overlapping instances for GHC.Show.Show (a -> a)
20:48:37     arising from a use of `...
20:48:40  hi oerjan
20:48:49  hi elliott
20:48:59 * elliott awaits the joyful logreading.
20:49:05  oh dear
20:53:16  well i sense a lot of nick pinging
20:54:14  PING
20:54:17  PING PING PING PING PING
20:54:30  P P P PINGU
20:54:45  "Copyright   :  (c) Conal Elliott 2008" -- sounds like some sort of a subspecies of elliott. You know, the Conal Elliott and the Speral Elliott, and so on.
20:55:12  (The difference between them is that only one usually has a point.)
20:55:23  Ha ha ha, fizzie doesn't know who Conal is.
20:55:26  oerjan: :DDDDDDddddddd
20:56:01  _or_ he knows perfectly.  it remains to be seen.
20:56:52  Well, I know what I've googled, now. But it doesn't diminish the immediate "conical elliott" vibe.
20:58:45 -!- Ngevd has joined.
20:59:21  the Elliptal Elliott has no point, but at least he is brief about it
20:59:48  Hello!
20:59:54  yo
20:59:56  hi
21:00:09  oerjan: the real elliott is like that, but without the briefness
21:00:50  your words not mine
21:01:59   shachaf, cat is useless unless used interactively to dump a file to your terminal or to *concatenate* files.
21:02:09  sort of like return in a monad, come to think of it
21:02:43  @google oleg monad unix
21:02:44  http://okmij.org/ftp/Computation/monadic-shell.html
21:02:44  Title: UNIX pipes as IO monads
21:02:59  what's with all these logspeaking people being absent
21:03:07  I don't know, I've used "foo | cat" sometimes when 'foo' does different things depending on whether the output fd isatty(3) or not.
21:03:10  shachaf: well naturally
21:03:24  Naturally?
21:03:47  ok so it _is_ return in a monad.
21:03:54   what's with all these logspeaking people being absent
21:04:09  oerjan: That's what I thought about you when I was being passive-aggressive to you!
21:04:25  By the way, there's sometimes a legitimate excuse to use < instead of cat.
21:04:30  mesg y < /dev/pts/4
21:04:44  ha. ha ha. ha ha ha ha. ha ha ha ha ha ha ha ha,
21:04:47  *.
21:04:47  shachaf: For once I think zzo is right about this; (>=>) is more correct than (>>=).
21:05:00  (fibonacci is _so_ out)
21:05:02  shachaf: Also, I use < all the time, just not in pipelines.
21:05:10  elliott: Well, sure.
21:05:21  But I like the way you can do mesg <
21:06:24  I just did that with /dev/pts/0. What did I do?
21:06:32  Ohh, I see.
21:06:42  That's lovely.
21:07:29  "Hey, I just pasted that random command you typed in IRC into my shell and there was no output. What did I just do to mny computer?"
21:08:15  shachaf: Yes, exactly.
21:08:35  $ mesg
21:08:54  `? elliott
21:09:01  Bah.
21:09:04  Useless bot.
21:09:05  HackEgo is sleeping.
21:09:16  HackEgo is dead.
21:09:35  No, it will rise once more.
21:09:37  Someone should turn IRC (by royal decree, for example) into one of those talk-like places where you can see everyone's typings in the realest time.
21:09:42  And maybe a few times after that.
21:09:58  fizzie: Nooooooooooooooooooooooooooooooo
21:10:12  fizzie: http://piratepad.net/ouKPdvpeCw
21:10:17  Everyone go there.
21:10:40  But that's not the IRC. :/
21:10:55  Also I would just copy-paste everything in.
21:12:19 -!- Nisstyre has joined.
21:15:53 -!- Sgeo has quit (Ping timeout: 240 seconds).
21:18:57 -!- Sgeo has joined.
21:20:34   "I would say I would prefer my ugly hack to adding the ScopedTypeVariable extension."
21:20:52  oerjan: it isn't even the "rely on monomorphism" thing
21:21:24  well if it's the one from before, i was on my way to find a prettier way without ScopedTypeVariables before you said to use it
21:21:37  oerjan: it's the https://github.com/jkarlson/OpenCLWrappers/blob/master/System/OpenCL/Wrappers/Utils.hs#L61 one :P
21:21:41  so it's ugly even if you don't want that extension
21:21:42  but it's easy to do with a "where"
21:21:48  or lambda monomorphism
21:21:57  yeah
21:22:22  yeah that's the one i remembered
21:23:10  my idea was something like...
21:24:42  Um
21:26:02  oh hm the monad makes using asTypeOf a bit ugly
21:27:24  Sgeo: Um?
21:28:05  peekManyInfo f x size = do a <- withForeignPtr x (\y -> (peekArray ( div (fromIntegral size) $ sizeOf c) $ castPtr y); return . f $ a `asTypeOf` [c] where c = undefined
21:28:16  heh
21:28:29  oerjan: i don't think that works
21:28:36  oerjan: c is just :: forall a. (Bits a) => a
21:28:39  oh hm duh
21:29:05 -!- MDude has quit (Ping timeout: 248 seconds).
21:29:08  ic that explains why he didn't use just let c = undefined
21:30:33  hm...
21:31:21  yay, i just gave a simpler proof to a problem that was proven 7 years ago, and which had been open for about 7 at that point
21:31:45  oklopol: we need zeilberger in here to flamewar with you over that
21:32:05  the only known proof was done using kolmogorov complexity, and the proof itself was also very kolmogorov complicated.
21:32:09  what
21:32:12  do you mean
21:32:33  Is it possible for a problem to go from closed to open?
21:32:54  i guess if the proof was wrong, you could say that
21:32:54  from apparently closed to open, at least
21:32:57  yeah
21:33:10  i recall that happened with the four color theorem at one point
21:33:18  oklopol: zeilberger doesn't like people proving things twice :P
21:33:45  that's ridiculous really
21:33:53  that's fucking retarded, yes
21:34:05  new proofs often open new avenues
21:34:13  the first proof is always ridiculously long and stupid
21:34:58  and basic research eventually catches up and it becomes simple
21:35:05  oerjan: yes
21:35:13  and for example there is the elementary proof of the prime number theorem, where a finitist like zeilberger would be unlikely to even accept the original as a proof, i suspect
21:35:16 * elliott tries to find a source
21:35:23  oerjan: well he doesn't object to people proving things once :P
21:35:23  well what oerjan said is true as well, but that's not really the main reason.
21:35:26  what i said is.
21:35:43  elliott: um that was a new proof of an old theorem
21:35:57  oerjan: i meant, he wouldn't consider it proved in the first place...
21:36:12 -!- Patashu has joined.
21:36:41  there's a chick at the uni who's doing a comparison of two techniques for proving the prime number theorem
21:37:28  gah, where is this. oerjan: anyway, he was basically saying it was pointless, for reasons of proof irrelevance, and only interesting as a curiosity, because the complexity of a proof only matters to humans. and saying that nobody would get excited about a particularly elegant proof that (two small numbers equal another number when multiplied, or something like that, I forget)
21:37:35  note: /me does not endorse zeilberger's opinions
21:37:53 -!- Sgeo has quit (Ping timeout: 240 seconds).
21:39:11 -!- Sgeo has joined.
21:39:37  i'm starting to think that hack might actually be the most elegant way to do it without ScopedTypeVariables
21:39:47  oerjan: i suspect it is mostly because in the paradigm zeilberger would like everyone to work in, humans wouldn't prove things at all :P
21:40:05 -!- Jafet has quit (Quit: Leaving.).
21:40:06  heh
21:40:56  yeah
21:41:43  as i doubt he'd accept MonadRec either :P
21:41:55  or whatsitcalled
21:42:00  DoRec or something
21:42:19  i'm probably just going to help the other fork instead because that guy has his shit together and doesn't use unsafeCoerce
21:42:32  also our paper was accepted into LATA, yays
21:42:46  oklopol: yeah but do you have an oerjan number yet
21:43:10  hm
21:43:11  no :(
21:43:20  at least i don't know what i tis
21:43:21  *it is
21:43:29 -!- Sgeo has quit (Ping timeout: 240 seconds).
21:43:33  it's at most 8 ofc
21:43:57  since oerjan has the same erds number as me iirc
21:44:22  peekManyInfo f x size = case undefined of c -> do a <- withForeignPtr x (\y -> (peekArray ( div (fromIntegral size) $ sizeOf c) $ castPtr y); return . f $ a `asTypeOf` [c]
21:45:12  oerjan: gimme a name of someone you've collaborated with or w/e, I want to see if AMS' collaboration disatnce thing works :P
21:45:35  alf birger rustad
21:45:56  No authors matched "Alf Birger Rustad" (Best format is: last name, first initial*)
21:45:56  No authors matched "Oerjan Johannsen" (Best format is: last name, first initial*)
21:46:00  FINE I'LL USE YOUR STUPID FORMAT
21:46:14  you could at least spell it correclty
21:46:28  oerjan: oh what's the pslleing
21:46:32  do you mean with the fancy O
21:46:33  because
21:46:36  We found more than one author that matched "Johannsen Ø" Please select an author from the list below.
21:46:37  the list is:
21:46:39  johannsen, daniel
21:46:43  johannsen, david a
21:46:45  no, not that, i never got that to work either :P
21:46:45  [...]
21:46:47  johannsen, klaus
21:46:49 -!- Sgeo has joined.
21:46:50  [...] :P
21:46:55  wanna see if i'm there
21:46:56  oerjan: ah thx /whois
21:46:58  i somehow doubt it
21:47:00  oklopol: that was my next step
21:47:08  oerjan: anyway they don't know who rustad a is
21:47:17  gimme someone more MAINSTREAM that someone you know has collaborated with or someone!!
21:47:19  maybe i'll just
21:47:22  try erdos
21:47:23  elliott: the comma is not optional
21:47:34  oh dur
21:47:45  No authors matched "Johansen, Oerjan" (Best format is: last name, first initial*)
21:47:55  neither is the *, i think.
21:48:04  No authors matched "Johansen, Ørjan" (Best format is: last name, first initial*)
21:48:05  oerjan: oh
21:48:08  aha
21:48:13  Ørjan Johansen coauthored with Johan F. AarnesMR2174240 (2006m:28017)
21:48:14  Johan F. Aarnes coauthored with Richard V. KadisonMR0240633 (39 #1980)
21:48:14  Richard V. Kadison coauthored with Jacques DixmierMR1614553 (99k:01056)
21:48:14  Jacques Dixmier coauthored with Paul Erdős1MR0909556 (89a:11040)
21:48:19  oerjan: is that correct?
21:48:26  rings a bell :P
21:49:03  oerjan: now the problem is, i don't know what i did to make that work :P
21:49:15  aha i got you
21:49:29  oklopol: sorry, you and oerjan aren't connected according to this thing
21:49:53  does it show a connection from me to Erds? am i even there?
21:49:56  oerjan: btw you're #1 google result for oerjan
21:50:08  oklopol: nope.
21:50:17  oklopol: it may be some other Lastname, F* it matches
21:50:21  elliott: i believe using oe is rather quaint these days
21:50:23  since it doesn't accept Lastname, Firstname for you.
21:50:45  oerjan: unfortunately it's your account on the wrong wiki :D
21:51:29 -!- Sgeo has quit (Ping timeout: 240 seconds).
21:51:35  elliott: well i get something entirely different with esolang no. 3 and wp no. 4
21:51:48  is it still you at #1? :P
21:52:14  no, it's sometone unknown who owns oerjan.com
21:52:17  *-t
21:52:57 -!- Sgeo has joined.
21:53:06  elliott: also, iirc i used Johansen, O* to search with.  unless Ø* actually works which i doubt.
21:53:38  Johansen, Ø* works but Johansen, Ørjan doesn't.
21:53:58  oklopol: anyway have you collaborated with more than one person?  otherwise just let elliott look up that person.
21:54:59  yeah actually i came up with that like 5 seconds ago
21:55:10  yeah, a certain five seconds after oerjan did
21:55:20  MR Collaboration Distance = 6
21:55:20  Ørjan Johansen coauthored with Johan F. AarnesMR2174240 (2006m:28017)
21:55:20  Johan F. Aarnes coauthored with Richard V. KadisonMR0240633 (39 #1980)
21:55:20  Richard V. Kadison coauthored with András HajnalMR1614553 (99k:01056)
21:55:20  András Hajnal coauthored with Saharon ShelahMR0357194 (50 #9662)
21:55:21  Saharon Shelah coauthored with Manfred DrosteMR0804485 (87d:20055)
21:55:23  Manfred Droste coauthored with Jarkko KariMR2255549 (2007i:68060)
21:55:26  oklopol has oerjan number of at most 7
21:55:40  synchronistically, yesterday ken regan over at godel's lost letter confused me with a different Ørjan Johansen after looking me up on twitter (which i don't use)
21:55:59  there are apparently 3 of them
21:56:05  (At least)
21:56:24  that's a rather large oerjan number : /
21:56:33  oklopol: better get collaboratin' with him
21:56:42  oklopol: at least it didn't go all the way to erdos
21:57:42  otoh if your number is 4 then presumably that's not your path to erdős either
21:58:00  there's just one guy with erds number 2 in our uni that i know of, and even using him i'd only get 7 :/
21:58:26  I have never written a paper, with or without a co-author
21:58:28  :/
21:58:32  oklopol: note that it apparently can't find your erdos path :P
21:58:42  oh wait
21:58:44  it can't find you at all ofc
21:58:50  i'll just try JARKKO'S
21:58:54  3
21:58:55  and
21:58:56  add one
21:59:02  +1 = 4
21:59:05  Jarkko Kari coauthored with Cristopher MooreMR1890808 (2003b:68121)
21:59:05  Cristopher Moore coauthored with Leonard J. SchulmanMR2291004
21:59:05  Leonard J. Schulman coauthored with Paul Erdős1MR1289067 (95e:52025)
21:59:05  yeah
21:59:23  oerjan: would you come out of RETIREMENT to collaborate with oklopol, pls say yes
21:59:44 * oerjan sidles away
21:59:54  my colleague made this esolang thingie, maybe oerjan could prove it tc
22:00:29  oerjan: I'LL JUST HAVE TO WRITE FANFICTION ABOUT IT THEN
22:00:33  and we could publish it in silly computational universality magazine
22:01:26  unfortunately the words "maybe you should publish this" has been shown to have a strong negative effect on my motivation (see :()^ tcness instance)
22:01:32  *have
22:01:44  oerjan: who said that again :P
22:01:46  he already did fibonacci, but we haven't been able to do general lambdas yet
22:01:46  was it me
22:01:52  it was ais523
22:02:06  :()^ as a subset of underload?
22:02:06  well maybe not those exact words
22:02:09  yeah
22:02:10  oklopol: yeah
22:02:59  oerjan: can you explain it to me so i can publish it?
22:03:16  no.
22:03:19  darn
22:03:22  oklopol: yes
22:03:27  oklopol: http://esolangs.org/wiki/Underload#Underload_minimization
22:03:31  well, it's on the wiki
22:03:38  oklopol: iterate down to "Removal of ! from :!()^ programs"
22:03:50  oklopol: by iterate i mean... read
22:04:07  omg ima be a famous
22:04:28  oerjan: i love that implementation of ~
22:04:29  it's so ugly :D
22:04:43  O KAY
22:05:18  it's also elegant, it uses a subroutine for doing (x)~ with a fixed (but arbitrary) x, twice.
22:06:08  heh
22:06:11  http://www.reddit.com/r/DoesAnybodyElse/comments/mkc6y/dae_secretly_want_to_see_the_entire_global/
22:06:20  I regret reading this; everyone else can regret it too.
22:06:43  Phantom_Hoover: dae secretly want to see the entire global marshmallow industry start doing intensive charity work
22:06:45  or they can regret something else if they want to 
22:07:01  Phantom_Hoover: "EDIT: Thank all of you for the massive amount of data I have collected in this psych experiment on herd mentality. My professor will be pleased. Again thank you!"
22:07:04  elliott, marshmallows for EVERYTHING.
22:07:10  Also that was pretty funny.
22:08:01  "The most impressive thing about this thread is how everyone who sides with op is getting downvoted. People seem so afraid of change that they're willingly accept every single shit that's going wrong in the world, if only it does not get worse. Can you imagine the power you give the "1%" like its called so eagerly today with this attitude?"
22:08:12  Do you even understand infrastructure.
22:08:28  Phantom_Hoover, is that the "Let's destroy the world economy" thread?
22:08:32  Yes.
22:09:13  On second thoughts, that thread seems to rely on people not understanding how... not fragile, but crucial, the global economy is to their survival.
22:10:03  "I publicly hope it will. The alternative is far worse." Billions will die but AT LEAST THE BANKS WILL BE GONE.
22:10:08 -!- SgeoN1 has joined.
22:10:33  Two of my friends wwould die rather quickly, they need medicine to live
22:10:53  Hey, it's Phantom_Hoover.
22:11:00  Phantom_Hoover: Did you see my exciting new programming language?
22:11:12  IS IT A BRAINFUCK DERIVATIVE
22:11:14  Yes.
22:11:23  hi
22:11:27 * Phantom_Hoover leaps at shachaf, brick in hand.
22:11:46  SgeoN1, you live in New York, right?
22:12:08  So ~a billion miles from the nearest industrial farm?
22:12:09  Phantom_Hoover: Reference implementation: $ tr '12345678' '[]<>-+,.' | bf
22:12:34 * Phantom_Hoover slams brick into shachaf's head, delicately catches brain from other side.
22:12:48  Yes to the NY thing, I don't know where farms are
22:12:51 * Phantom_Hoover — OK no that's too far.
22:13:05  (I will have to survive on, like, sheep.)
22:13:53 -!- Sgeo has quit (Ping timeout: 240 seconds).
22:13:55  I take it that I could not possibly buy enough nonperishables to survive for a decent amount of time, if I thought that something might happen?
22:14:28  SgeoN1, not if everyone else is thinking the same thing
22:14:34  Well obviously you'd just start eating dirt until you died, so I suppose you'd at least die happy.
22:14:54 -!- Sgeo has joined.
22:14:58  wait you get happy from eating dirt?
22:15:07  Sgeo would.
22:15:14  ah.
22:15:22  I would?
22:15:48  Well it's everywhere and you just shove a clod of it into your mouth.
22:15:57  I thought that was your perfect food.
22:16:07  lol
22:16:29  it is if you're an earthworm
22:16:55  Ah, no, earthworms at least aim for the detritus layer.
22:17:01  Sgeo would just take any old dirt.
22:18:17 * Phantom_Hoover throws shachaf's brain into elliott's head.
22:18:28  Uh-oh.
22:18:32  eek, you're creating a monster!
22:18:34  shachaf: You have to change nicks so I can become you now.
22:18:38  Phantom_Hoover eats the brains of people who make brainfuck derivatives
22:18:54  Eventually he will have enough brains to make the ULTIMATE BRAINFUCK DERIVATIVE
22:19:00  at least you don't!¤#)/&%/NO CARRIER
22:20:24  Ngevd, why would I eat them, they're disgusting.
22:21:48  elliott: I'm in ~100 channels; changing nicks would be too spammy. :-(
22:21:53 -!- Sgeo has quit (Ping timeout: 248 seconds).
22:23:59 -!- mithridates has joined.
22:24:24 -!- Sgeo has joined.
22:24:27  `welcome mithridates
22:25:02  Oh, right.
22:25:06  HackEgo isn't here.
22:25:12  mithridates: Sorry, you get the boring non-automated welcome.
22:25:24  mithridates: Hi esolangs http://esolangs.org/wiki/Main_Page.
22:25:36  mithridates is clearly an esolangs!
22:25:39  (Sorry, had to)
22:26:08  mithridates: Sgeo is our resident bot.
22:26:22  what the hell is going on here? are you guys fucking with me?
22:26:22 * Sgeo beeps
22:26:26 -!- lament has joined.
22:26:30  I'm leaving
22:26:32  bye
22:26:32  Hi
22:26:33  mithridates: What.
22:26:33  Wait
22:26:54  mithridates, I'm not a bot, and elliott likes to mess with people sometimes, but
22:27:06  mithridates, he's not messing with you when he says that this is about esolangs
22:27:07  mithridates asked me to ban everyone in here
22:27:14  who do i start with
22:27:19 -!- pikhq_ has quit (Ping timeout: 240 seconds).
22:27:20  start with mithridates and lament
22:27:24  okay
22:27:30  yeah do it lament
22:27:32 -!- pikhq has joined.
22:27:37 -!- ChanServ has set channel mode: +o lament.
22:27:38  Wait what?
22:27:42 -!- lament has set channel mode: +b *!*mithridat@unaffiliated/mithridates.
22:27:46 -!- lament has set channel mode: +b *!*lament@184.71.170.*.
22:27:53 -!- lament has kicked mithridates mithridates.
22:27:56 -!- lament has kicked lament lament.
22:28:02  disaster averted
22:28:15  Sgeo: are you sure mithridates isn't from #jesus
22:28:18  i recall that name.
22:28:28  I don't see em there
22:28:35  And don't remember the name
22:28:41 -!- Ngevd has quit (Ping timeout: 258 seconds).
22:28:48   elliott: To be fair, -> isn't -- actually, I can't think of any way to be fair. <-- garden path sentence if i ever saw one
22:28:58  oerjan: you might want to read the last ~40 lines or so :P
22:29:01  before continuing logreading
22:29:05  * mithridates (~mithridat@unaffiliated/mithridates) has joined #esoteric
22:29:06  onwards
22:29:18 -!- copumpkin has quit (Quit: Computer has gone to sleep.).
22:29:22  Wait, what happened to lament?
22:29:41  shachaf, e banned and kicked emself
22:29:41  shachaf: Well, the last we heard, lament was denying he knew what this channel was altogether.
22:29:54  For a few years before that he only joined to yell at people.
22:30:00  So... who knows!
22:30:03  elliott: Are you an op in this channel?
22:30:08  No.
22:30:14  fizzie, oerjan and ais523 are the active ops.
22:30:23  lament is the only banned op, which is quite a distinction.
22:30:36  elliott: hmm, did lament remove his own op rights?
22:30:44  or just set himself to opped and banned, and leave it that way?
22:30:48  ais523: Dunno.
22:30:58  They're still there.
22:31:12 * elliott has been dubious of lament's op rights for a while.
22:31:14  so he can ban himself again if necessary, clearly
22:31:58   oerjan: you might want to read the last ~40 lines or so :P <-- scary
22:32:13  Is he able to unhandy himself?
22:32:21  Unban
22:32:35  How is unhandy even a word?
22:32:39  SgeoN1: he can with chanserv
22:32:45 * elliott asks mithridates what the heck that was, against his better judgement.
22:32:51  I do everything against my better judgement.
22:32:57  That's why I have a worse judgement to contradict it.
22:33:10   What was that, anyway.
22:33:10   What was that, anyway.
22:33:11   You took the words right out of my mouth.
22:34:19  You'd be lost for words!
22:34:22  You'd be tongue-tied.
22:34:28  Like a nightingale at a Roman feast.
22:34:35  They haven't said anything else. :'(
22:35:01  Like a mute in a monologue.
22:35:31  Like an elliott in a /msg with mithridates.
22:35:53 -!- Sgeo has quit (Ping timeout: 240 seconds).
22:37:14  `addquote  I do everything against my better judgement.   That's why I have a worse judgement to contradict it.
22:37:20  `quote
22:37:22  `quote
22:37:23  `quote
22:37:24  `quote
22:37:27  wait, HackEgo isn't here
22:37:31  do I have to do a fifth `quote anyway?
22:37:32  lmao
22:37:33  `quote
22:37:34  yes
22:37:35  just to make sure
22:37:41  Gregor: FIX IT DAMMIT
22:39:13 -!- Sgeo has joined.
22:39:29  Sgeo: You fix it.
22:39:56  Sure, I'll run it from my computer. That would be fine, right?
22:40:02  -r-------- 1 root root 140737486262272 Nov 23 22:39 /proc/kcore
22:40:02  Gosh.
22:40:07  SgeoN1: If you cloned the FS repo, sure.
22:40:16  wat
22:40:56  ...that was a joke
22:41:11  SgeoN1: It would be fine, if you got the fshg.
22:41:14  oerjan: wat wat
22:41:47  So, you'd like to have a bot that disconnects every 5 minutes?
22:42:18  who wouldn't
22:42:32  SgeoN1: better than one that never disconnects because its not here
22:42:37  SgeoN1: what is even up with your connection
22:43:04  elliott, not the faintest idea. The wifi in the apartment is fine
22:43:33  SgeoN1: It's fine but it keeps disconnecting?
22:44:16  Its something with my computer, I mean. Not sure if hardware or softwarr
22:45:31  SgeoN1: Have you tried using Linux.
22:45:53  I am using Linux.
22:46:15  SgeoN1: Have you tried using Windows.
22:46:39  Not sure I want to look for a copy of Windows
22:47:03  SgeoN1: Have you tried using ... QNX?
22:47:06  BeOS?
22:47:09  AmigaOS 4?
22:47:35  I wish I could try not being ill
22:47:50  this would help
22:48:27  SgeoN1: I think that's called "getting better"? Have you tried it.
22:51:29  elliott: wat huge core
22:52:21  oerjan: it's 2^47 terabytes and iirc 2^48 is the address width of x86-64 or whatever
22:52:30  so i guess it's half the address space the kernel cares about or something
22:52:41  ic so very virtual
22:57:15 -!- CakeProphet has joined.
22:57:26  ho
22:57:44  you got your nick wrong
22:58:34  CakeProphet:
22:58:36 -!- calamari has joined.
23:00:33 -!- CakeProphet has quit (Read error: Connection reset by peer).
23:01:11 -!- CakeProphet has joined.
23:01:11 -!- CakeProphet has quit (Changing host).
23:01:11 -!- CakeProphet has joined.
23:01:31 -!- CakeProphet has changed nick to kallisti.
23:01:47  for some reason reconnecting with irssi is completely unintuitive
23:01:48  hello kallisti "cakeprophet" kallisti
23:02:05  -NickServ- Information on Kallisti (account Kallisti):
23:02:07  kallisti: nice uppercase :}
23:02:13  thanks
23:02:17  kallisti: by which i mean
23:02:19  kallisti: it burns it burns
23:02:29  elliott: eat it
23:02:32 -!- copumpkin has joined.
23:02:37  thanks
23:03:53  ken regan pointed me to this which reminds me of evincar's language.  i'm not sure whether it's more or less insane... http://www.cse.buffalo.edu/~regan/papers/pdf/PRS01.pdf
23:04:32  at least it's supposedly self-consistent
23:04:50  .....wtf irssi
23:04:54  why is it so difficult to just...
23:04:55  reconnect
23:05:07  without create multiple connections
23:05:13  oerjan: which one
23:05:15  kallisti: /reconnect?
23:05:22  which
23:05:23  er
23:05:23  yes
23:05:27  that's what I do.
23:05:30  it makes Freenode2 often
23:05:40  elliott: the one with automatic currying or what it was
23:08:02  kallisti: i usually just /disconnect  and then /connect freenode, iirc
23:08:59  usually when there's a huge netsplit and i'm on the wrong side
23:09:10  stupid
23:09:15  you know what I do when there's a netsplit?
23:09:16  nothing.
23:09:17  it's wonderful
23:09:21  I just wait, and then everything is fine.
23:09:27  except for that one.
23:09:33  The Great Netsplit Of Several Hours
23:09:53 -!- Sgeo has quit (Ping timeout: 240 seconds).
23:10:04  well i'm talking "looks like i'm nearly alone on the server" netsplits
23:11:17 -!- Sgeo has joined.
23:12:25  elliott: I was thinking bombs would be cool because you could send them into the oribts of planets
23:12:47  but the problem I'm having with orbits is that orbits are probably going to be difficult to create.
23:12:55  I dunno about Phantom_Hoover, but I don't think your player should be able to blow up a planet.
23:13:07  how about moons? :P
23:13:17  And that's sort of the whole challenge to it; it's not impossible, Phantom_Hoover said he had a fairly easy time of getting into orbits with that JS thing.
23:14:04  It... kind of helps that I found out about that from a post on the guy's blog where he implemented it to play around with Hohmann transfers.
23:14:05  http://www.airshipentertainment.com/growfcomic.php?date=20070624
23:14:19  elliott: okay so now you're in orbit. what do you do now?
23:14:23  what was the benefit.
23:14:28  (relevant)
23:14:56  Phantom_Hoover: You explain why the whole game is basically based around orbits to kallisti.
23:15:25  They're the only way to move in a gravity field?
23:16:26  er, so it's not possible to break escape velocity?
23:17:04  No, but that's a good way of moving outside a gravity field.
23:17:10  FSVO 'in'.
23:17:58  kallisti: how do you propose to make things interesting without orbits
23:18:06  moving around in a vacuum is not fun or strategic at all
23:18:31  I don't propose that
23:18:43  you propose to make things boring? :P
23:18:48  merely curious as to how orbits would make things more interesting besides "weeee circle"
23:19:33  elliott: no, I'm not proposing that planets don't have gravity. that's silly.
23:19:49  I... defer to Phantom_Hoover again, because I can't think of any way to explain why complicated orbit systems are interesting other than "they are".
23:19:53  it's more of a question related to gameplay, I suppose.
23:20:58  a gravity-assisted manuever that allows you to travel across the system at a faster rate is an extremely complicated procedure, for example.
23:21:10  at least ones that involve multiple planets
23:21:20  but I suspect even a single planet would be difficult
23:21:56  kallisti: The problem is that you're seeing orbits as just a means to the end of going very fast and shooting at things in a vacuum?
23:22:05  it's not something that's going to be easy without say... an automated control system that what NASA uses to do precision manuevers.
23:22:07  elliott: no that's one.
23:22:27  Phantom_Hoover: Just link kallisti to that JS thing so he can plyy with it himself :P
23:22:29  elliott: but yes I'm trying to find means to an end from orbits, as typically games have means to ends blah blah blah
23:22:40  s/plyy/play/
23:23:17  http://www.matthen.com/javascript/gravity.html
23:23:23  I suppose it would be /fun/, sure. I'm not arguing it won't be fun.
23:26:09  Phantom_Hoover: Got a link to that blog post, btw?
23:27:20  hmmm, okay
23:29:58  I should try a slingshot on that, actually.
23:31:24  Phantom_Hoover: Yes good do it
23:32:43  right I forgot that the low-powered thrust makes it easier to control an orbit
23:33:16 -!- myndzi\ has joined.
23:33:29 -!- Sgeo has quit (Ping timeout: 240 seconds).
23:33:51  I managed it, but controlling it is another thing altogether.
23:35:53 -!- myndz\ has quit (Ping timeout: 240 seconds).
23:36:15  Phantom_Hoover: Man this blog post is impossible to find.
23:36:16  heh, it's difficult to get into orbit with the fast moving moons.
23:36:26  http://blog.matthen.com/page/6
23:36:38 -!- Sgeo has joined.
23:37:53  elliott: I remember in gravity well, in deep space, you could become prefectly still
23:37:56  you know, if that's your thing.
23:38:17  kallisti: Just turn on the space breaks.
23:38:38  well, kind of...
23:38:47  Phantom_Hoover: Can we have space breaks.
23:38:54  Yes.
23:38:56  Phantom_Hoover: "Today on Twitter I have been talking a little bit about how Edinburgh is pronounced."
23:39:03  so I'm thinking the game would perhaps benefit from multiple maps?
23:39:14  kallisti: Maps in what sense?
23:39:25  like a star system / star cluster / whatever scale is the largest map
23:39:38  then map that's nearby and larger scale so that you can aim trajectories and the like
23:40:03  basically so the interface can accomodate precision spaceflight to a degree.
23:40:07  Sure. That's another rvival of the what-scale question :P
23:40:24  well I would think /at least/ star system.
23:40:28  >_>
23:40:35  Depends how big stars and planets are.
23:41:01 * Phantom_Hoover → sleep
23:41:02 -!- Phantom_Hoover has quit (Quit: Leaving).
23:42:05  elliott: how about the stars and planets are normal size but the ship is huge? :P
23:42:17  Yees.
23:43:40  oerjan: this language is weird
23:44:16  also can you crash into planets and die?
23:44:22  if so I've already died like 20 times now in this JS thing.
23:44:34  kallisti: There is collision detection, yes.
23:45:21  There's also heat, so good luck with that.
23:46:10  hope the stronger thruster (if it exists) will match escape velocity of some medium-sized planets.
23:46:16  *hopefully
23:47:39  Boring?
23:47:55  Your ideas keep sounding like "let's remove all the learning curve so that navigation is completely trivial" :P
23:47:59  not as boring as dying by planet collision.
23:48:10  frequently
23:48:14  but okay, we'll see.
23:48:53 -!- ais523 has quit (Remote host closed the connection).
23:49:43  oerjan: this thing would make a good esolang
23:49:49  elliott: also powerful thruster != sudden gravity immunity
23:50:05  it's just a mean to move fast suddenly sometimes that the weaker thruster doesn't allow
23:53:15  also gas giants will be tricky without such a thing I imagine.
23:53:28  s/tricky/near impossible to not die at least sometimes/
23:54:54 -!- itidus21 has joined.
23:55:13  `welcome itidus21
23:55:25  hackego is down
23:55:28  hi itidus21
23:55:29  :(
23:55:36  HELP HOW DO I WELCOME PEOPLE WITHOUT BOTS???
23:56:03  itidus21: list-communication-protocol
23:56:05  uh.....
23:57:11  I think itidus21 has been here before
23:57:18  no
23:57:19  no way.
23:57:21  unpossible
23:57:23  I refuse to blieve it.
23:57:26  I would recognize him.
23:57:33 * kallisti has perfect memory.
23:57:36  eidetic or whatever.
23:57:40  The name is familiar, at least
23:57:56  `log itidus
23:57:58  BLA
23:58:00  does Sgeo really not ermember good ol itidus
23:58:02  `quote itidus
23:58:03  OH WAIT
23:58:18  Sgeo: http://codu.org/projects/hackbot/fshg/index.cgi/file/06a2f5c42c24/quotes
23:58:20  grep /itidus/
23:58:30  actually http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/06a2f5c42c24/quotes
23:58:34  since that thing messes up wordwrap
23:58:34  how do u grep without hackego?????
23:58:35  :(
23:58:48  hackego is what I used to think
23:58:51  now I can't think.
23:59:57  kallisti: I wasn't welcomed even *with* bots. :-(

2011-11-24:

00:00:40  elliott: so, even if you can't blow up planets
00:00:52  you can black hole them?
00:01:08 * Sgeo hurls kallisti into a <>
00:01:09  what.
00:01:18  you mentioned being able to produce black holes
00:01:21  elliott: so it would
00:01:24 -!- itidus21 has quit (Read error: Operation timed out).
00:01:49  The input to the interpreter has the form [interpreter, program, current line, state]. The in-
00:01:49  terpreter is (if π3 (π3 ( )) then π1 (π4 ( )) else π1 (Update)) Υ9 , where Update is the term
00:01:49  [ a Υ ( [π1 ( b ), π2 ( c ), d Υ ([π2 ( e ), π4 ( e )] Υ2 e ), f Υ π4 ( g )]
00:01:49  Υ
00:01:49  b
00:01:50  c π1 (π3 ( d ))
00:01:52  e π2 (π3 ( f ))
00:01:53  g
00:01:56  )
00:01:58  ] Υ (π1 ( ))a b c d e f g .
00:02:00  aww, it messed up the formatting
00:02:01  and
00:02:03  the words
00:02:05  and symbols
00:02:25  noooo itidus
00:02:28  WHYYYYYY
00:02:30  wierhiuwheriuhweurhwreih
00:02:34  I am can't go on
00:02:37 * kallisti dies.
00:02:59  kallisti: what
00:03:00  oh
00:03:01  rip
00:03:46  elliott: ripped your mom apart in that dung blizzard
00:03:48  pahhhhh
00:03:51  pah pha pah ha pha
00:03:51 -!- itidus21 has joined.
00:03:54  itidus21: hi
00:04:03  oerjan: "Because UPSILON is Turing-compete and has a composition function, it is an acceptable programming system"
00:04:05  whatever you say...
00:04:22  elliott: hey by _our_ standards...
00:04:24  elliott: all turing complete languages with a composition function are acceptable. QED
00:04:43  kallisti: "as defined by Rogers [Rog58]." :P
00:04:54  does
00:04:57  dooes his last name start with a G?
00:05:28  eek, our recent changes page is _only_ spam deletion
00:05:43  oerjan: yep!
00:07:05  stars should probably be immovable
00:07:19  but I think planet destruction could be based on individual planets.
00:07:25  kallisti: there is no "star". there's just a big, massive, hot object floating about.
00:07:31  small ones would be easier to destroy, presumably.
00:07:38  elliott: and what do you call that object?
00:07:53  kallisti: a star. i'm saying it's not special-cased in the physics.
00:07:59  you can't have an "immovable" star.
00:08:00  also small planets have lesser impact on the star systems orbits so... not gamebreaking.
00:08:24  elliott: I mean indestructable. practically
00:08:25  not in the code
00:08:28  as in
00:08:32  nothing you have will do anything to it.
00:08:47  that's also mostly a property of the object itself :P
00:09:00  uh, sure
00:09:03  if you want to be incredibly vague.
00:09:40  like mercury for example
00:09:43  is basically a big asteroid
00:09:50  I should be able to blow that motherfucker up.
00:10:12  yes. a _very_ big asteroid.
00:10:26  i don't mean to interrupt but what game is this under discussion?
00:10:40  should i look at logs perhaps?
00:10:43  aii
00:10:46  hi itidus21
00:10:46  ok
00:11:05  by reading the word "aii" you now know everything about the game :P
00:11:13  yay
00:11:29  um, is it an actual game or something under design?
00:11:52  oerjan: latter, although there is code
00:12:22  elliott: how about can I land on planets instead?
00:12:25  if I'm going slow
00:12:32  instead of dying on them
00:12:51  kallisti: you could... rest on it? there's no atmospheres.
00:12:54  kallisti: i am pretty sure you would just burn up though.
00:13:08  ah yes heat
00:13:13  so gas giants are not gas giants
00:13:16  but rock giants :P
00:13:27  kallisti: well you could just turn collision off...
00:13:35  for those
00:13:58  great so now instead of colliding into planets and dying I can get sucked into their massive gravitational pull :P
00:15:49  elliott: also I feel there's a lack of character-driven story
00:15:53  perhaps the planets can be people
00:15:55  and have personalities
00:15:58  (...)
00:16:00  the story is that you hate whoever you're playing with
00:16:19  but see it's more interesting for example
00:16:31  if Jupiter is jealous of Mercury's small body
00:16:41  and wants to lose all that gassy weight.
00:16:59  makes the story more dynamic
00:18:31  elliott: anyway I doubt we can use realistic radii for planets
00:18:40  because if you make the ship large enough so that Jupiter fits on screen
00:18:53  earth-sized planets are now tiny dots in comparison to your ship.
00:19:19  yeah you could have like Jupiter be the king of the planets, and say Mercury could be the messenger because he's fast.  And Venus could be the hot chick.  Nah wait, too ridiculous.
00:19:45  lol
00:22:44  and you could tell stories of their interactions to explain various earthly phenomena
00:23:12  jupiter's the fat guy who has horrible gas. but he's still a pretty cool guy.
00:23:23  wait what are we doing
00:23:33  oklopol: terribly whooshy gas
00:23:57  well fuck you too :D
00:24:24  you can't expect me to read more than one random line
00:24:28  of backlog
00:24:30  indeed
00:25:10  oklopol: making a game (not as good as your games don't worry)
00:25:23  elliott: but it would be cool if you plug in parameters for the solar system into a map editor and it creates a working model of the solar system.
00:25:28  well that goes without even saying it goes without saying.
00:25:39  `addquotebutthebotsnothere  well that goes without even saying it goes without saying.
00:25:43 -!- Darth_Cliche has joined.
00:26:03  so why is this game about?
00:26:13  there is no why, alas.
00:26:17  good
00:26:29  i will continue doing nothing
00:26:38  elliott: lies
00:26:42  there are at least two whys
00:26:45  i will try my best to nontribute to this game
00:27:25  elliott: okay so if we have like
00:27:26  some kind of roll
00:27:30  and when you execute this roll
00:27:32  oklopol: good because you SUCK lol
00:27:34  it reflects projectiles
00:27:35  away from you
00:27:57  that's called a shield, kallisti
00:28:10  hmmmm, no
00:28:12  it's more like
00:28:12  a barrel roll?
00:28:14  like a barrel roll
00:28:15  yes
00:28:16  itidus21: thank
00:28:52 -!- Darth_Cliche has changed nick to Klisz.
00:29:03  elliott: HAHA I AM BEING HUMEROUS FOR HUMER EFFECT GET IT
00:29:05  Thanks a lot, Peppy...
00:29:11  no ur bad person
00:32:36  " oklopol: good because you SUCK lol" xD
00:32:49  oklopol: no im being so dreadfully sincere your games are the WORST
00:32:55  yyyyeah :D
00:33:00  but i
00:33:02  want you to
00:33:03  get offended
00:33:08  so i can apologise??
00:33:16  i'm really trying
00:33:40  oklopol: I'm sorry oklopol
00:34:30  argh, and now that's gonna go to waste
00:34:48  listen i'll get some sleep and see if i can muster up some in the morning
00:35:02  you'll work on your "game"
00:35:13  erm
00:35:15  i meant to say
00:35:18  "work"
00:35:26  oklopol: no but its not a game its actually
00:35:26  a plan
00:35:28  tok ill you
00:35:30  to death
00:36:33  huh. well i guess i'm ever gladder i didn't colluberate.
00:36:48  oklopol: no but
00:36:49  if you collaborates
00:36:50  d
00:36:54  we were going to hold off.
00:36:58  oh that's how it's spulled
00:37:34  well that's not gonna make me collaboratesd because i now knowsd the plan.
00:38:00  i really have to sleep. after this episode.
00:38:08  bye night.
00:38:58  oklopol: but do you knowsd
00:39:02  oklopol: that you're goingsd tosd
00:39:04  oklopol: diesd
00:45:42 -!- MSleep has joined.
00:46:52 -!- MSleep has changed nick to MDude.
00:48:29  goosd grammarsd
00:50:14  die oerjan, die
00:50:18  oerjan: are you a physics
00:50:44  no am chemic
00:51:01  ok.
00:51:20  oerjan: code aii's physics engine thanks, chemic are good at this
00:52:07  engine go boom
00:52:18 -!- PiRSquared17 has joined.
00:53:02  aii aii o
00:53:52 -!- itidus20 has joined.
00:55:16  itidus21 decremented
00:55:17 -!- EgoBot has quit (Remote host closed the connection).
00:55:20  and became itidus20
00:55:26  Gregor: noooooooo
00:55:27 -!- EgoBot has joined.
00:55:32  oh PiRSquared17 looks new
00:55:36  did someone mention the channel in #haskell again
00:55:50  I've been here before...
00:55:53  Last year
00:55:55  ah.
00:56:23  I check the wiki...
00:56:24  good! i won't welcome you then.
00:56:42 * elliott harsh, but fair.
00:56:43  yeah we don't want to be welcoming to your kind.
00:57:06  we prefer people who've never been here, their brains are squishier and more tasty
00:57:21  also easier to trap
00:57:25  Darn, I was.just about tobasl if id be welcome back into the monecraft channel
00:57:39  I was just tobasl if id be welcome back into the monecraft channel too.
00:57:43 -!- itidus21 has quit (Ping timeout: 276 seconds).
00:57:58 * elliott was going to say that PiRSquared17 should become TauRSquared8.5, but someone might actually take him seriously.
00:58:38  tau = 2pi ?
00:58:46  PiRNOTSquared, PIRRound
00:58:49  PiRSquared17: Yes :P
00:58:59  SgeoN1: N.B. That was not actually true.
00:59:00  That's what I thought...
00:59:47  moneycraft the gnome game
01:00:07  mooncraft the elf game
01:00:24  moancraft - let's not go into details
01:00:54  meancraft the orc game
01:01:09  moocraft
01:01:16  did i mention i caught up with yafgc
01:01:22  I could have sworn I saw PiR on Reddit
01:01:29  NOt me
01:01:32  *o
01:01:49  manecraft is just horsing around
01:02:02  minicraft the halfling/hobbit game
01:03:04 * oerjan suddenly realizes he is confusing minecraft and DF, the joke falls off a cliff and dies
01:03:18  it did that a long time ago
01:03:24  ok then
01:03:34  it just didn't realize until it looked down
01:03:54  Dwarfcraft
01:08:24 -!- yorick has quit (Quit: No Ping reply in 180 seconds.).
01:08:52 -!- yorick has joined.
01:14:22 -!- itidus22 has joined.
01:15:36 -!- Jafet has joined.
01:22:51 -!- itidus20 has quit (Read error: Connection timed out).
01:24:25 -!- augur has joined.
01:24:46 -!- sebbu has quit (Read error: Connection reset by peer).
01:25:08 -!- sebbu has joined.
01:25:08 -!- sebbu has quit (Changing host).
01:25:08 -!- sebbu has joined.
01:31:49 -!- Klisz has quit (Quit: I AM KLISZ, FEAR ME).
01:32:31 -!- itidus22 has quit (Read error: Connection timed out).
01:33:03 -!- itidus22 has joined.
01:34:19  double increment detected
01:35:28  hi itidus22 how are you enjoying your +2
01:38:16  `welcome shachaf
01:38:44  you are NOT welcome.  this much should be obvious.
01:40:41  :D
01:42:47 -!- Jafet has quit (Quit: Leaving.).
01:43:54 * shachaf :-(
01:47:25 -!- augur has quit (Remote host closed the connection).
01:53:29 -!- itidus22 has quit (Read error: Connection timed out).
01:54:04 -!- itidus22 has joined.
01:54:55  Disconnects are fun!
01:56:35  fun disco nectar
01:57:32  Hey, I didn't end up disconnected!
01:57:51  Just very high lag reporte
01:57:51  which went down
01:57:57  Does the server hold on to messages for a time?
01:58:13  maybe it
01:58:17  's your evil twin
01:58:31  I said disconnects are fun at :54, XChat says :56
01:58:40  :54 here
01:59:12  Support for the server holds onto messages until reconnect or pingout hypothesis
01:59:28  what has that got to do with that
01:59:37  of course the server delivers messages if you're connected...
01:59:41  How else would XChat have seen my message?
01:59:46  If I lost connection
02:00:04  because
02:00:06  you didn't lose connection?
02:00:10  that's why the message sent??
02:00:22  Then what has been happening?
02:00:44  SgeoN1 has not disconnected before (for a long while) or since saying "Disconnects are fun"
02:00:50  so what are you talking about?
02:01:03  It's only my computer that's disconnecting
02:01:09  For some reason
02:01:20  ...then wtf is your hypothesis about?
02:01:27  you _also_ haven't disconnected in ages
02:01:36  elliott, I came close around :54-56
02:01:51  I think I did disconnect, but for an amount of time less than Freenode takes to notice the pingout
02:01:59  do you know how TCP works
02:02:22  lost connection is indistinguishable from sufficiently large lag.
02:02:37  so obviously freenode won't disconnect you if you lose connection for a sufficiently short amount of time
02:02:44  nothing about "keeping messages"
02:03:18  Was TCP trying to resend the messages then?
02:03:32  That.. makes sense, I think
02:04:17  Sgeo: You... realise that TCP was created because connections are really unreliable, right?
02:04:25  It's all about retries.
02:04:30  Ok
02:04:38  Well... half retries, half maintaining the illusion of an ordered stream.
02:04:40  If IRC used UDP, the effect wouldn't happen, I guess
02:05:02  If IRC used UDP, it would actually be entirely possible for you to miss things sent to the channel.
02:05:24  If IRC used UDP, close enough messages would arrive in nonsense order :P
02:05:52  Although IRC doesn't really need streaming much *shrugs*
02:06:05  Not to mention there would be no meaningful notion of "connection".
02:06:48  pikhq: Well, ping timeouts are the only time IRC cares about connections, really :)
02:06:57  I mean, there's "remote host closed the connection", but doing that with ping timeout is only like a hundred second delay, and it's a failure case anyway.
02:07:19  pikhq: Although it does mean that you'd be limited to one connection per IP :P
02:07:54  elliott: Not really; UDP has seperate source/destination ports, just like TCP.
02:08:10  pikhq: Oh, right
02:08:10  hm?  doesn't UDP also inc... right
02:08:22  I keep forgetting about that because no interface exposes it ever :)
02:08:29  Well, apart from low level socket interfaces :P
02:08:47  Huh, why not?
02:09:01  how else could UDP ever work on a multiuser machine
02:09:05  oerjan: right
02:09:07  Sgeo: Why?
02:09:13  Sgeo: The source/dest ports are completely irrelevant to any actual user.
02:09:29 -!- kmc has quit (Ping timeout: 240 seconds).
02:09:33  They are?
02:09:51  Sgeo: When you're not starting a server, BSD sockets just randomises the source port.
02:10:13  Sgeo: Sure they are.
02:10:13 -!- kmc has joined.
02:10:13  Sgeo: Do you know your current source/dest port?
02:10:15  Because the only time that it matters which port you *choose* is when you start a server.
02:10:16  (for IRC)
02:10:21  When would you ever need to?
02:10:53  But surely a single program needs to... well, hmm, have a destination port?
02:11:14  the dest is usually 6777 for irc, isn't it?  or does it mean something else?
02:11:17  I mean, choose it.
02:11:21  er, *6667
02:11:26  Sgeo: Yes, it chooses *that*, but not the other one.
02:11:29  SgeoN1: The socket library handles picking a port.
02:11:41  There's a *pair* of ports in each TCP or UDP session.
02:11:44  Oh, I see what SgeoN1 means.
02:11:46  You only ever choose one.
02:11:46  Well, yes, you need :6667...
02:11:55  I mean that you don't care about the one that isn't the server port.
02:11:55  SCTP is the future.
02:12:00  shachaf: Does anything route SCTP yet?
02:12:16  elliott: Did I *say* "SCTP is the present"?
02:12:22  I didn't think so.
02:12:24  shachaf: :-)
02:12:26  elliott: On the greater Internet, everything should *route* it.
02:12:32  I don't think anything *NATs* it, though.
02:12:45  pikhq: Quick! Run an SCTP server!
02:12:53  Behind a NAT.
02:12:54 -!- Rugxulo has joined.
02:12:54  WE MUST TEST THIS
02:13:10  Pah :P
02:13:11  https://github.com/TTimo/doom3.gpl
02:13:13  There's also SCTP over UDP.
02:13:18  Which should "just work".
02:13:20  July 1, 2004
02:13:20  SCTP now comes to you via satellite until DSL becomes available. This means you must be patient when downloading files since there is an additional 550ms RTT for TCP packets which causes interesting side effects. The uplink speed is 100kbps, so large downloads will take some time.
02:13:24  pikhq: How much overhead does that give?
02:13:25  Rugxulo: old :P
02:13:30  A WHOLE DAY OLD
02:13:35  :-D
02:13:40  elliott: Not very much at all.
02:13:55  not as old as what I'm playing (id Tech 1 -- Hexen 2)
02:14:01  The UDP header is 32 bits.
02:14:26  Source port, destination port, length, and optional checksum.
02:14:38  (mandatory for IPv6)
02:14:38  pikhq: There's also the algorithmic overhead, but yeah :P
02:15:14  pikhq: Don't you mean 64 bits?
02:15:18 * elliott doesn't think ports are that small. Or, lengths and checksums.
02:15:25  Sorry, derp.
02:15:28  Yes, 64 bits.
02:15:36  16 per field.
02:16:13  pikhq: I'd rather replace IP than TCP and UDP. :(
02:16:14  32 Bits, where 1 Bit = 2 bits.
02:16:39  It's like Calories.
02:16:45  a bit confusing
02:17:06  elliott: I'll be happy to switch to IPv@
02:17:57  shachaf: Here's a prototype: Remove bits 96-128.
02:18:03  (Uh, from IPv4.)
02:18:31  Oh, IPv6's header is surprisingly simple.
02:18:35  ... The *IP address*?
02:18:41  shachaf: Revised prototype: Remove bits 64-160.
02:18:44  pikhq: The source address.
02:19:42  elliott: That is just going to shove it further down the protocol stack...
02:19:53 -!- Sgeo has quit (Ping timeout: 240 seconds).
02:20:00  pikhq: Source-independent networking.
02:20:07  It's what's for dinner!
02:20:40  elliott: "Networking without replies."
02:21:00  *Is* there a usecase for send-only networking?
02:21:04 -!- Sgeo has joined.
02:21:44  pikhq: I gather that there are at least two other people in the world who think this is a good idea, and one of them is Van Jacobson, so I must be doing something right.
02:22:11  Name to me some cases where you would like to send packets without receiving any packets in response in a network at all.
02:23:02  What Introversion game should I play
02:24:13  I'm thinking DEFCON, Uplink, or Darwinia, I've heard of those
02:24:21  Sgeo: Uplink.
02:24:22  Sgeo: Also, that's ... all of the games.
02:24:22  Apart from Multiwinia, which is just online Darwinia, I think.
02:24:32  I'm curious about DEFCON, which is also multiplayer, right?
02:24:32  Yes, but apparently rather boring.
02:24:32  But seriously though.
02:24:32  Uplink.
02:24:33  It's their most famous game for a reason.
02:24:33  I think when I tried Uplink, I thought it was boring
02:24:33  pikhq: I should just link you to the Urbit post. http://moronlab.blogspot.com/2010/01/urbit-functional-programming-from.html
02:24:33  But ok, I'll try it
02:24:33  Sgeo: You were wrong.
02:24:41  Hey, what's so bad about monoids?
02:24:51  What.
02:24:59  What's the deal with monoids?
02:25:01  In the Urbit post
02:25:13 * elliott doesn't know what you're talking about.
02:25:23  "Read the whole thing. Haskell fans, you'll know exactly where you can stick your monads. Indeed, Elliott on monadic I/O sounds a lot like VJ on connection-oriented networking. This is not, I believe, a coincidence. If Urbit is like anything, it's like Elliot's FRP - though with no monads, gonads, morphinisms, monoids, combiguators, or other implements of metamathematical torture."
02:25:28  Oh.
02:25:34  Just ignore the bit after that dash.
02:25:39  Guy doesn't actually know any Haskell.
02:25:49  Ooh, that quote looks good.
02:25:53  Is it talking about Conal?
02:26:19  Wait, that's not form that link.
02:26:26  It is.
02:27:01  The rest of the post is very good, even despite that tiny regrettable bit.
02:27:04  (http://moronlab.blogspot.com/2010/01/nock-maxwells-equations-of-software.html should be read before it, though.)
02:27:11  it could be talking about all three elliotts, like some kind of chimera
02:27:25  Well, even though monads are pure except for IO, I think it makes sense to apply anger towards monads
02:27:26  or kerberos
02:27:36  They're often used for imperative-style, if not always
02:27:45  Sgeo: What's "not pure" about IO?
02:27:56  shachaf: IO is a model of impure computation.
02:28:04  Describing it as "impure" doesn't seem inaccurate.
02:28:35  Well, ok, I guess the not pure stuff is .. right outside, so to speak? executing main is certainly an impure operation, even if that's not observable from inside Haskell. Although I guess a lot of good things are
02:28:38  Fine. I'll just dispute the "used for imperative-style" bit, then.
02:29:01  shachaf: Well, IO is also inherently sequential.
02:29:31  Sgeo: Well, let's call printing a string "executing it" and then call strings "models of impure computation".
02:29:39  elliott: Sure, but I wasn't talking about IO.
02:29:56  shachaf: That seems unfair, since kind of the whole point about IO is that you can't get a value out of it.
02:30:02  There's no "tail :: IO a -> IO a".
02:30:13  (To be really vague about it.)
02:30:19  elliott: Well, sure.
02:30:24  State is often imperative-style, I'd think, even though it's fundamentally pure inside
02:30:32  You have some primitive programs, and can transform the results of programs, but there's nothing you can do to the IOs /themselves/.
02:30:48  elliott: It doesn't *have* to be that way, depending on your model of IO.
02:31:03  Well, not in general.
02:31:24  shachaf: Like what? decompose :: IO a -> exists b. (IOOperation b, b -> IO a)?
02:31:54  What's the exists for?
02:32:04  (Where data IOOperation a where PutStrLn :: String -> IOOperation (); GetLine :: IOOperation String etc.)
02:32:17  Sgeo: As in "why can't you just remove it", or "what does it do"?
02:32:42  Sgeo: It's shorter than:
02:32:42  data DecomposedIO a = forall b. DecomposedIO (IOOperation b) (b -> IO a)
02:32:42  decompose :: IO a -> DecomposedIO a
02:34:28  Ah
02:34:28  Something like that.
02:34:44  What would happen if you could know what was inside?
02:34:57  Or would the type of IO balloon?
02:34:59  Sgeo: Depends what you mean about "inside".
02:35:03  As in, know the type of b
02:35:10  shachaf: That breaks a lot of nice properties, though. :(
02:35:12  Sgeo: You do. That's why it's an "exists".
02:35:26 -!- Rugxulo has left ("Leaving").
02:35:29  You get given one, as opposed to getting to choose one (a forall).
02:35:46  elliott: Oh, man, all those nice properties of IO.
02:35:59  shachaf: Well, it breaks IO-parametricity.
02:36:02  Which is a thing now.
02:36:09  It didn't need a name until you broke it.
02:37:37  Do I want a mouse to play Uplink?
02:37:45  Or is touchpad sufficient?
02:38:07  Sgeo: Are you happy navigating your computer menus with a touchpad?
02:38:18  Relatively quickly?
02:38:23  :t Left{}
02:38:24  forall a b. Either a b
02:38:28  Sgeo: Because that's literally Uplink's interface.
02:38:30  oerjan: augh
02:38:35  Sgeo: Actually more buttons than menus.
02:38:44  elliott: http://www.haskell.org/pipermail/haskell-cafe/2011-November/097047.html
02:38:46  Well, not as quick as with a mouse
02:38:59  SgeoN1: Do you /have/ a mouse?
02:39:10  > Left{}
02:39:11    Left *Exception: :3:0-5: Missing field in record construction
02:39:31  Mouse, but the table my computer is on is not a good mousepad, and the newspaper I once used is now on the floor, and I'm not about to touch it
02:39:53  is it covered in ants
02:39:56  oerjan: btw why aren't you using the google groups interface :P
02:40:09  There's a cat living here
02:40:15  The litterbox is on the floor
02:40:25  
02:40:25  is it a nice cat
02:40:43  is it a friend cat
02:40:48  elliott: augh
02:40:54  hi oerjan
02:41:39  :t StateT{}
02:41:40  forall s (m :: * -> *) a. StateT s m a
02:41:48  oerjan: why aughy
02:42:01  because i had the feeling when pasting that you would remind me ;P
02:42:54  What's with the {}?
02:43:02  oerjan: are you afraid of google groups :P
02:43:09  Sgeo: record syntax, with an empty field list
02:44:11  > runStateT (undefined { runStateT = \s -> return (s, "hello") } ) 5
02:44:11    No instance for (GHC.Num.Num [GHC.Types.Char])
02:44:11     arising from the literal ...
02:44:46  > runIdentity $ runStateT (undefined { runStateT = \s -> return ("hello", s) } ) 5
02:44:46    ("hello",5)
02:44:52  > const 3 (undefined + 3)
02:45:04  hah
02:45:16  oerjan: how the heck does that work??
02:45:16    3
02:45:18  i wonder if that's according to the report
02:45:32  oerjan: oh because StateT is a newtype
02:45:37  so x { runStateT = y } === StateT y
02:45:41  ew :(
02:45:55  elliott: well StateT has only one constructor, so presumably ghc doesn't bother to evaluate before replacing
02:45:56  oerjan: otoh it's not clear to me that x{...} should evaluate x...
02:46:01  elliott, artdiopdate
02:46:11  hm... time to look at the report text
02:46:38  THE BIG GUNS
02:49:36  the translation in http://www.haskell.org/onlinereport/haskell2010/haskellch3.html#x8-490003.15.3 seems to imply that it should be strict, but otoh the alternative only makes sense for single-constructor types
02:49:59  oh wait
02:50:09  if taken _literally_, it actually isn't strict for newtypes :P
02:51:03  oerjan: i was hoping that # would point to something useful :(
02:51:13  !haskell data Testing = Testing { field :: Int } deriving Show; main = print $ undefined { field = 100 }
02:51:19  input.15792.hs: Prelude.undefined
02:51:26  elliott: oh it doesn't? remove the .3 then
02:51:26  "The expression F {}, where F is a data constructor, is legal whether or not F was declared with record syntax (provided F has no strict fields — see the fourth bullet above)"
02:51:32  oerjan: hm is a newtype's field not strict?
02:51:47  i would think it should be considered strict, and so Newtype{} should be illegal...
02:51:48  re: StateT{}
02:51:53  elliott: not in pattern matching
02:52:06  oerjan: er what?
02:52:12  i realise that newtypes behave differently when pattern-matching
02:52:22  but apart from that a newtype is identical to data Foo = Foo !Field
02:52:31  but i guess pattern-matching is relevant here...
02:52:57  elliott: the translation given in the link depends on the strictness of that pattern matching for whether the result is strict
02:53:11  right
02:53:14  section 3.15.3
02:53:19  so i guess it is valid
02:53:32  oerjan: what was the non-literal reading?
02:54:07  well just assuming it would work like for data
02:54:25  !haskell newtype Testing = Testing { field :: Int } deriving Show; main = print $ undefined { field = 100 }
02:54:29  Testing {field = 100}
02:54:32  gah
02:54:44  yeah so it actually differs
02:55:09  oerjan: well it's obvious that it differs with GHC's implementation of newtypes P:
02:55:59  elliott: You must be the most virtuous programmer, for you are possessed of the greatest virtue.
02:56:36  EgoBot evaluates Haskell?
02:56:56  !haskell putStrLn "does it use MooEval?"
02:56:58  does it use MooEval?
02:57:13  !bf ++++++++++++++++++++++++++++...
02:57:14  ​...
02:57:15  s
02:57:22  No, it's merely runhaskell'ing in a sandbox.
02:58:03  !haskell Control.Concurrent.threadDelay 1000000000
02:58:09  pikhq: hi
02:58:13  pikhq: It's not actually runhaskell.
02:58:27  shachaf: It tries GHC with various wrappers around the code in the same sandbox as HackEgo.
02:58:30  !haskell 2 + 2
02:58:33  4
02:58:38  !haskell print (2 + 2)
02:58:40  4
02:58:43  elliott: Yay, hubris!
02:58:46  !haskell main :: IO (); main = print (2 + 2)
02:58:46  elliott: well it _could_ have special-cased single constructor data
02:58:51  4
02:58:54  !haskell return(2+2)::IO Int
02:58:57  4
02:59:10  > StateT {} `seq` "test"
02:59:10    "*Exception: :3:0-8: Missing field in record construction Cont...
02:59:17  oops hm
02:59:20  > (StateT) {} `seq` "test"
02:59:21    : Empty record update
02:59:41  oerjan: StateT is a newtype.
02:59:43  > const "test" $ StateT {}
02:59:43    "test"
02:59:54 -!- Sgeo has quit (Ping timeout: 240 seconds).
03:00:02  !help
03:00:02  ​help: General commands: !help, !info, !bf_txtgen. See also !help languages, !help userinterps. You can get help on some commands by typing !help .
03:00:02  !haskell runST (return 5)
03:00:20  Some error reporting you've got there, EgoBot.
03:00:29  !haskell import Control.Monad.ST; print (runST (return 5))
03:00:38 -!- Klisz has joined.
03:00:42  02:59 DCC CHAT from EgoBot [64.62.173.65 port 10079]
03:00:50  hi Klisz
03:00:54  blah blah esolangs http://esolangs.org/wiki/
03:00:59  it looks like ghc doesn't consider newtypes strict for that compile time error
03:01:04  elliott: Do you just welcome everybody?
03:01:09  shachaf: Totally.
03:01:14  Hello elliott.
03:01:17  ...Who isn't me?
03:01:21 -!- Sgeo has joined.
03:01:23  shachaf: I don't like you!
03:01:44  There is a distinctly non-zero possibility I know Klisz IRL.
03:01:44  elliott: It's psychologically impossible to dislike me.
03:02:04  !haskell data Test = Test {strict :: !Int }; main = print $ const "test" $ Test {}
03:02:13  (hello, other person from Colorado!)
03:02:14  pikhq: Are you Klisz?
03:02:14  pikhq: I believe you don't. I was known as Darth Cliche until earlier today when I changed my name.
03:02:18  !haskell import Control.Monad.ST; main = print (runST (return 5))
03:02:19  elliott: No.
03:02:21  yeah that gave an error in DCC
03:02:23  5
03:02:26  elliott: We merely happen to be in the same state.
03:02:29  !haskell import Control.Monad.ST; main = print (id runST (return 5))
03:02:36  Klisz: Ah. Yeah, you're up in Boulder, aren't you?
03:02:36  !haskell import Control.Monad.ST; main = print ((id runST) (return 5))
03:02:41  5
03:02:41  shachaf: Oh, EgoBot's !haskell does -O2.
03:02:42  shachaf: That's why it's so slow.
03:02:54  pikhq: Yes, visiting family for Thanksgiving; I normally live in Cheyenne, WY, though
03:03:09  being one of four or five people in that state
03:03:48  pikhq: When are you moving to CA?
03:03:51   pikhq: It's not actually runhaskell. <-- um iirc the second wrapper tried is runhaskell
03:03:52  Klisz: When are you moving to CA?
03:03:56  oerjan: Yeah, it is.
03:04:05  shachaf: Really tempted to put -fglasgow-exts in this patch of EgoBot's runghc.
03:04:20  Don't do it!
03:04:24  -fglasgow-exts is the devil.
03:04:27  shachaf: If ever, probably sometime after graduating.
03:04:30  shachaf: It's such a good devil!
03:04:33  shachaf: I do not intend to move outside the glorious Rocky Mountains
03:06:01   Some error reporting you've got there, EgoBot. <-- everything above one line is sent as DCC CHAT
03:06:18  oerjan: Don't you need to open a port for those?
03:06:26  @tell Gregor Replace HackEgo's runghc with http://sprunge.us/AYIK, thx (avoids really expensive optimisation, useless temporary file)
03:06:26  Consider it noted.
03:06:36  shachaf: works for me without port-forwarding
03:06:59  I don't want to (a) figure out how to tell irssi to accept DCC CHAT (b) accept DCC CHAT.
03:07:13  elliott: You use IPv8 or something, don't you?
03:07:14 -!- SgeoN1 has quit (Read error: Connection reset by peer).
03:07:26 -!- SgeoN1 has joined.
03:07:33  shachaf: IPv20
03:07:56  shachaf: /dcc chat, btw.
03:08:15   oerjan: Don't you need to open a port for those? <-- well yes, i've set irssi to accept from EgoBot automatically.
03:08:32  elliott: Did you know you get public-facing IP addresses at MIT when you connect to the free WiFi?
03:08:37  Probably because they have way too many of them.
03:08:53  dcc_autochat_masks = EgoBot
03:08:59  No one deserves that many IPv4 addresses.
03:09:01  shachaf: MIT own an /8.
03:09:11  It's "LEGACY", though, so I guess they don't actually use it.
03:09:33 * shachaf wonders if this is the sort of channel where people get angry at you if you say "Class A".
03:09:49 * oerjan hits shachaf with the saucepan ===\__/
03:09:54  People get angry at people saying that?
03:10:05  DON'T USE FUCKING BAD WORDS LIKE THAT
03:10:05  shachaf: I wish Ilari was here to see us talking about IP.
03:10:09  Let's try it out in #-blah.
03:10:14  He will be missed.
03:10:19  Maybe he ran out of IPv6 addresses.
03:11:09  Who is Ilari?
03:11:38  He's a guy who used to come in here. Mostly he reported IPv4 exhaustion with nearly robotic precission and formatting.
03:11:40  It was great fun.
03:11:56  also, nutritional science
03:12:01  Also IPv6 deletion, but that's like saying he reported on oceans and also his tap which keeps dripping.
03:12:14  elliott: I was wrong.
03:12:23  Are you ever not?
03:12:35 * elliott doesn't actually think shachaf is always wrong.
03:12:40  Yeah, Ilari was pretty great.
03:12:41 * shachaf is always wrong.
03:21:42 -!- pikhq has quit (Ping timeout: 244 seconds).
03:21:44 -!- pikhq_ has joined.
03:27:04 -!- pikhq_ has quit (Ping timeout: 253 seconds).
03:27:09 -!- pikhq has joined.
03:28:03  elliott, is there another hacker or something? I took a mission, the file server was empty, I replidd and got paid
03:28:50  SgeoN1: Did you /read/ the opening text?
03:28:52  It's not like the Uplink server and job board exists solely for your personal benefit.
03:29:23  SgeoN1: Just believe the game will be as detailed and realistic to its premise as possible, and you'll do well.
03:30:07  Uplink Internal Services never gets a subpoena?
03:30:29  Hmm, actually
03:30:34  That doesn't make sense
03:30:54  But... the authorities never conclude that something weird is going on with InterNIC
03:31:09  Sgeo: Did you read the very opening text? It's encryption shit, man.
03:31:15  And there's nothing weird about InterNIC, it just gets routed through.
03:31:34  Sgeo: Anyway, /to its premise/, i.e. Hollywood hacking.
03:32:03  Sgeo: Just pretend it's Tor if you have to.
03:35:56  Sgeo: Besides, the authorities _can_ track you down.
03:36:06  Uplink just trashes your machine and disconnects you.
03:36:50  From my understanding, the Feds actually go inside the building where the machine is stored
03:37:16  They don't ever come to the conclusion that Uplink... hmm, actually this sounds a bit like the argument over copyright and user-uploaded content
03:37:20  So, hmm
03:37:44  Sgeo: What's to say the FBI isn't after Uplink's ass, but they just distribute their servers throughout multiple continents through various proxy accounts blah blah blah?
03:38:02  I mean, this may surprise you, but people actually conduct illegitimate activities over the internet. On a wide scale, even!
03:42:54  oerjan: Jerzy Karczmarczuk sure is annoying
03:42:58  oerjan: (you've got me reading haskell-cafe!)
03:47:18  clCreateProgramWithBinary ctx devs bins = wrapPError $ \perr -> do withArray
03:47:18  devs $ \pdevs -> do withArray lbins $ \plbins -> do buffs <- forM bins $ \bs ->
03:47:18  do buff <- mallocArray (length bs) :: IO (Ptr Word8) pokeArray buff bs return
03:47:18  buff
03:47:18        ret <- withArray buffs $ \(pbuffs :: Ptr (Ptr Word8)) -> do
03:47:19          allocaArray ndevs $ \(perrs :: Ptr CLint) -> do
03:47:21  WHY WOULD YOU COMMIT THIS
03:48:05  elliott: on a... /wide scale/
03:48:09  a scary thought.
03:48:18  Kind of like your mom!
03:48:19  HAHAHAHA
03:49:24  I actually refrained this time...
03:50:02   It is best described as a simulator of the cinematic depiction of computer hacking.
03:50:06  wow shitty idea.
03:52:23  kallisti: no it's
03:52:25  a really good game
03:54:11  kallisti:
03:54:12  http://www.atpm.com/9.07/images/uplink-stocks.gif
03:54:13  http://wizzywizzyweb.gmgcdn.com/media/products/uplink/screenshots/large-2-640x350.jpg
03:54:14  http://www.introversion.co.uk/uplink/screenshots/uplink3.jpg
03:54:16  http://www.introversion.co.uk/uplink/screenshots/uplink4.gif
03:54:16  http://images.wikia.com/tig/images/7/72/Uplink1.jpg
03:54:18  http://www.playdar.co.uk/media/uplink.png
03:54:19  http://img510.imageshack.us/img510/1287/uplink2010122716504046.png
03:54:21  http://images.bit-tech.net/content_images/2007/04/Linux_has_game/uplink3.jpg
03:54:24  SO GOOD.
03:55:08  you hack
03:55:10  the stock market?
03:55:25  no that's a separate thing.
03:55:29 -!- Sgeo has quit (Ping timeout: 240 seconds).
03:55:44  kallisti: you can connect to the stock market computer and stock market.
03:55:56  well i'm sure you can hack it
03:56:01  there are only like two machines in the game you can't hack i think
03:56:39  well it probably has the best hacking system of any game
03:56:44  actually wait I take that back: Shadowrun does
03:56:50  but Shadowrun isn't a computer game.
03:57:02  kallisti: no it's literally so good
03:57:21 -!- Sgeo has joined.
03:57:30  kallisti: http://humblebundle.com/ buy it for a few dollars, play classic game, thank me, kthx
03:57:51  I am starting to think it's just XChat that is choking
03:58:05 * Sgeo types in man ping
03:58:08  Weird thought
03:58:30  man pong is a weirder thought
03:58:46  kallisti: also you get darwinia?? which got like insanely good critical acclaim i think
03:58:58  yes I buy and play all the arthouse games.
03:59:05  (I actually don't)
03:59:21  kallisti: it's RTSy! you like RTS!
03:59:37  http://www.youtube.com/watch?v=17H8vc5Askw
03:59:40  look. it's pretty!
04:00:11  Nothing bad will happen from me leaving a continuous ping on, will it?
04:00:56  Sgeo: you will be arrest by cyber police
04:00:56  hm interesting
04:01:04  elliott: but it also has multiple minigames and stuff
04:01:05  Unlisted
04:01:07  iiiinteresting
04:02:32  kallisti: what does
04:03:07  Sgeo: what
04:03:13  kallisti: wat
04:03:18  The video is unlisted on YouTube
04:03:21  Sgeo: so?
04:03:39 * Sgeo shrugs
04:03:56  elliott: darwinia
04:03:57  based on
04:04:00  utub
04:04:16  er
04:04:17  wikipedia
04:04:19  not utub
04:04:41  this is kind of sort of how Shadowrun's virtual reality works.
04:05:21  everything takes a physical manifestation in a virtual world. programs, people connected to it, etc.
04:05:39  and then you can run programs as offensive/defensive/support/hacking actions
04:05:43 -!- elliott has quit (Read error: Connection reset by peer).
04:06:04 -!- elliott has joined.
04:06:20  Lagging put
04:06:25  also you can be creative in depicting it. each network node could have a specific theme for instance
04:06:34  kallisti: dunno what you mean about minigames *shrugs*
04:06:53 * elliott hasn't actually played Darwinia but has intended to since like 2006.
04:06:56  attack program could be like a big sword and sentry program could be like a dragon or something.
04:06:57  Maybe I actually will now that I have it.
04:07:08  kallisti: Anyway yeah seriously get this Bundle, Introversion are amazing.
04:07:11  But ping -i 1 -f 8.8.8.8 says I only dropped one packet
04:07:12 -!- kmc has quit (Quit: Leaving).
04:07:27  oh the mini-games are to familiarized you with the controls
04:07:31  in the intro of the game
04:08:14  Once connected, irc clients don't usually use the domain name, right? That's supid?
04:08:30  SgeoN1: what
04:08:33  what do they need the domain name for?
04:08:40  No idea
04:08:56  I mean other than to connect
04:08:57  obviously
04:09:00  I'm suspecting that it's XChat that's broken
04:09:08  SgeoN1: try another client for a bit?
04:09:29 -!- Sgeo has quit (Ping timeout: 240 seconds).
04:09:30  kallisti: HAVE YOU BOUGHT IT YET
04:09:38  no how much is the bundle thing
04:09:42 -!- Jafet has joined.
04:09:47  kallisti: it's a humble bundle, dude
04:09:50  the whole idea is that you pay whatever
04:10:04  kallisti: although over 3.80 gets you two games from previous bundles
04:10:16  elliott: Should I buy it?
04:10:24  Right now, only Freenode is lagging for me. All the other networks I'm on, I disconnected then recinnected
04:10:32  shachaf: Have you played any Introversion games? If not, then yes.
04:10:34  If yes, then probably.
04:10:35  elliott: do all of their games like linux?
04:10:48  kallisti: allow me to quote from the very top of the page
04:10:48  Cross-platform. The games featured on the shelf
04:10:48  work natively on Linux, Mac OS X,
04:10:48  and Windows.
04:11:02  :>
04:11:02  elliott: I played Aquaria once.
04:11:12  kallisti: Also it gives you Steam keys?? I gather people like Steam although I have no idea why.
04:11:12 -!- Klisz has quit (Quit: You are now graced with my absence.).
04:11:18  shachaf: Introversion didn't make Aquaria.
04:11:36  elliott: IT'S IN THE BUNDLE, OK?
04:11:48  It's the thought that counts?
04:11:54 -!- Sgeo has joined.
04:12:03  Let's see if this does anything
04:12:07  Still XChat, but restarted.
04:12:29  1.6sec lag
04:13:03  elliott: I'll buy the bundle
04:13:03  but
04:13:10  only if you buy starcraft 2 :>
04:13:14  loooool
04:13:25  kallisti: How much is it.
04:13:27  I'm sure it's only like $40 now.
04:13:30  may still be $50!
04:13:40  Bundle costs >0
04:13:41  elliott: Don't do it!
04:13:42  kallisti: Can I just... pirate it? (To answer your next question, no you can't.)
04:13:46  That's pretty much it.
04:13:47  Isn't Starcraft all about micromanagement?
04:14:01  shachaf: Thanks to Deewiant, I now know there is both MICRO and MACRO!
04:14:05  They actually call it that.
04:14:08  Micro and macro.
04:14:11  yep
04:14:12  EPIC MICROZ SKILLZ DUDE
04:14:16  yep
04:14:35  elliott: well
04:14:36  elliott: You should play Command & Conquer: Red Alert instead.
04:14:40  you need a key to actually play it online
04:14:45  If you're looking for an RTS to play.
04:15:03  no starcraft
04:15:06  is definitely better
04:15:08  than that shit
04:15:13  shachaf: Too many people like Red Alert for me to consider playing it.
04:15:16  (has never played that shit; unbiased)
04:15:16 * elliott logic.
04:15:22  elliott: Which version?
04:15:27  There are versions?
04:15:34  Yes, there's 2 and 3.
04:15:45  kallisti: Ooh, there's a COLLECTORS EDITION. It's 72 fucking pounds.
04:16:00  elliott: dude the humans have bipedal war machines that can TRANSFORM INTO SPACEFIGHTERS
04:16:11  think about that.
04:16:23  elliott: Red Alert 3 is $10 on your favourite game distribution platform, the Steam!
04:16:55  The Steam(tm).
04:16:56  elliott: yes it's $50 still
04:17:09  which is insane.
04:17:12  elliott: The S™.
04:17:25  but it's understandable because it's
04:17:25  so
04:17:26  good
04:17:59  Starcraft II: Heaven's Devils [Book]
04:17:59  by William C. Dietz - Simon & Schuster (2010.04.06) - hardback - 336 pages
04:17:59  For the poor, hardworking citizens of the Confederacy’s fringe worlds, the Guild Wars have exacted a huge toll. Swayed by the promise of financial ...
04:18:00  elliott: If you get the Red Alert I'll get Humble Bundle.
04:18:18  shachaf: I don't actually profit from Humble Bundle sales.
04:18:28  That might work for the Humble AII Bundle.
04:18:52  kallisti: http://www.thegamecollection.net/starcraft-ii-wings-of-liberty-pc-p-3243.html?ad=frooogle
04:18:55  kallisti: 42 dollars!
04:19:32  elliott: I am aware.
04:19:38  "in many ways, StarCraft II: Wings of Liberty feels like StarCraft 2.0 – and that’s a good thing"
04:19:43  like people love StarCraft so much
04:19:48  elliott: But you profit (in utility) from my happiness.
04:19:53  that they basically don't mind that Starcraft 2 is much starcraft but with more things.
04:19:59  *pretty much
04:20:17  shachaf: Fuck utilons, maan.
04:20:46  kallisti: What if I buy just StarCraft? Shit's gotta be cheap now.
04:20:54  elliott's utility function = fix (1/)
04:21:07  The Terran race will feature three new units: the Shredder, the Battle Hellion, and the Warhound. The Protoss will also feature three new units: the Replicant, the Oracle, and the Tempest. The Zerg will only receive two new units: the Viper, and the Swarm Host. The Protoss Mothership and Carrier will be removed from the game
04:21:12  wait they....
04:21:13  removed carriers?
04:21:15  they
04:21:24  what
04:21:24  why
04:21:26  wetiuwrhiusdhfiuwhetiuwher
04:21:27  kallisti: Does Starcraft II even have a story mode?
04:21:29  yes
04:21:31  Do people even play story modes any more.
04:21:34  sure.
04:22:45  elliott: you could play starcraft if you wanted
04:22:48  but don't play it online
04:22:53  because you will be smitten by Korean gods.
04:23:24  kallisti: Do Korean gods not play Starcraft II?
04:23:36  Also: What's so crafty about it?
04:23:38  There's no way to tell skill levels before playing?
04:23:46  yes but the new ladder system only matches you with people in the same tier.
04:23:59  whereas in starcraft anyone can join any public game.
04:24:47  elliott: u gottab be clevre
04:25:02  dats eh craeft
04:26:28  Sgeo: ?
04:26:48  kallisti: Do they still do StarCraft tournaments, or is that too retro now.
04:26:56  I think they do yes.
04:27:13  kallisti: Buy the Bundle.
04:27:28  http://video.google.com/videoplay?docid=-6648934043675888354
04:27:31  this was six years ago
04:27:33  but you can see
04:27:41  that people actually watch people play this game in Korea
04:28:03  I know.
04:28:06  Well, it's better than football.
04:28:23  also the video quality is shit
04:28:37  Why not watch people playing a variety of games?
04:28:47  because starcraft
04:29:20  I think Shattered Galaxy has a similar interface. No idea about Starcrafts gameplay in comparison
04:30:27  elliott: in the original starcraft terran was always the dominate race in tournaments
04:30:30  well, it became that way
04:31:01  But all I know about Koreans is "kekekekekeke zerg rush".
04:31:07  Has the internet... LIED to me?
04:32:32  http://www.youtube.com/watch?v=l29Hyrx2MXw
04:32:51  Boxer is the most well-known terran starcraft player
04:33:00  here he's playing sc2
04:33:59  ...
04:38:14  spoiler
04:38:18  Boxer pwns
04:41:33  hi PiRSquared17
04:41:39  hi
04:41:48  PiRSquared17: was the channel ever on-topic last time you were here
04:41:49 * PiRSquared17 didn't leave
04:42:00  oh we say hi to people a lot.
04:42:01  nowadays.
04:42:02  in the future.
04:42:07  elliott: a little more, but not much more
04:42:12  elliott: actually wait no boxer loses probably. :(
04:46:19  kallisti: i feel like i'm staring into another universe when i watch these things
04:48:12  elliott: the second game is a bit more interesting so far
04:48:14  one second you were talking about IPv6 etc, then Haskell (more on-topic), then a bunch of "what?"s, then some computer game
04:48:31  and stereotyping Koreans
04:48:43  what? Koreans are gods at starcraft
04:48:45  not a stereotype
04:48:48  PiRSquared17: "what?" -> introversion software's games, primarily uplink -> starcraft
04:49:22  kallisti: But all I know about Koreans is "kekekekekeke zerg rush".
04:50:06  PiRSquared17: It was a direct quote, not an invocation! Also by "all I know about Koreans" I meant "all I have heard about Koreans who play Starcraft".
04:50:20  oh, ok
04:51:29  Esolang talk usually occurs when http://esoteric.voxelperfect.net/wiki/Special:Recentchanges is filled up with something other than spam. :p
04:52:18  kallisti: Have 300 thousand people really watched this?
04:52:26  elliott: ask utub
04:52:35  I like boxer's old school strategies...
04:54:13  http://esoteric.voxelperfect.net/wiki/User:MichaelCarrillo670
04:54:21  elliott: Thanks to you, it's 300,001.
04:54:26  delete, block
04:54:27  ooh is there another good spam page
04:54:28  ?
04:54:42  PiRSquared17: none of the wiki admins are online right now
04:54:59  PiRSquared17: but going based on http://esoteric.voxelperfect.net/wiki/Special:Recentchanges i'm pretty sure they know how to delete spam pages :P
04:59:39  `welcome pirsquared17
04:59:52  `thank monqy
05:00:24  elliott: yeah game 2 was much better
05:00:26 * kallisti watches game 3
05:02:12  `summon HackEgo
05:02:29  sleeeeeeeeeeeeeeeeeeeeeeeep
05:02:45  quintopia: no
05:02:54  sleep is for zombies
05:02:59  slep?
05:03:22  slep is good but
05:03:24  hard to come by
05:03:38  hlep slep?
05:04:07  impossible
05:04:12  i had nap today
05:04:16  but im still tired
05:04:23  i had a nap dream it was really confusing
05:04:34  i can't make enough sense of it to say anything interesting :(
05:04:39  but it was a very interesting nap dream!
05:05:08  neat
05:05:21  i will nap now and see if there is interesting dream
05:05:26  bye quintopia
05:05:30  enjoy slepping
05:12:26  Bye!
05:12:56 -!- PiRSquared17 has left.
05:15:53 -!- Sgeo has quit (Ping timeout: 240 seconds).
05:17:06 -!- Sgeo has joined.
05:17:16  ONE PACKET
05:17:26  or, well, ONE PING
05:17:34  I LOSE ONE PING AND XCHAT GOES HEYWIRE
05:20:41  I am now given to wondering if my network card is loose
05:22:17  elliott: what sucks is that I know who wins game 4
05:22:29  because it's best of 5, and there's no 5th game, and Jinro is in the lead 2 to 1.....
05:22:33  stupid math
05:23:53 -!- Sgeo has quit (Ping timeout: 240 seconds).
05:24:16  kallisti: should have put a fake fifth game video up :P
05:26:20  This is what happens when you take the power away from the broadcasting companies.
05:27:01 -!- Sgeo has joined.
05:27:06  :D
05:33:29 -!- Sgeo has quit (Ping timeout: 240 seconds).
05:36:46 -!- Sgeo has joined.
05:40:37 -!- copumpkin has changed nick to OracleOfDelphi.
05:42:46 -!- MDude has changed nick to MSleep.
05:43:18 -!- OracleOfDelphi has changed nick to copumpkin.
05:51:29 -!- Sgeo has quit (Ping timeout: 240 seconds).
05:54:41 -!- Sgeo has joined.
05:55:00  elliott: oh dude boxer won
05:55:03  WHERE'S GAME 5????
05:55:39  oh here
05:55:46  it's in Game 4 part 3 for some reason?
05:56:51  lol
05:57:04  nice twist
05:58:59  this has been pretty entertaining to watch
05:59:14  actually boxer was at a disadvantage
05:59:21  but has his leet skillz
06:05:10  but sweet, now I know why I haven't found any boxer vidz; because his name is manofoneway
06:07:46 -!- Klisz has joined.
06:12:18 -!- Zuu has quit (Ping timeout: 244 seconds).
06:45:53 -!- Sgeo has quit (Ping timeout: 240 seconds).
06:46:41 -!- Sgeo has joined.
06:50:46 -!- Sgeo has quit (Client Quit).
06:54:24 * oerjan is bored and tries a new wikipedia game
06:54:59  instead of clicking on the _first_ substantial link in the introduction (tends to end up in a loop with Philosophy), i try the last one
06:56:52  from http://en.wikipedia.org/wiki/Broadcast_Film_Critics_Association_Award_for_Best_Director to LSD in 10 steps
06:57:03  (which then loops)
06:58:07  elliott: http://www.youtube.com/watch?v=4HTrGL_pfO8
06:58:08  watch this
06:58:49  kallisti: not right now :P
06:59:31  it does not seem to go to more general subjects in the same way as the first link game.  Gerald P. Ryan loops in 6 steps without leaving Australian sport
06:59:55  elliott: no right now you must
06:59:59  (only the last two loop)
07:00:01 * elliott crai
07:00:36  oerjan: this interests me btw i just have nothing to say
07:00:47 -!- GreaseMonkey has quit (Quit: The Other Game).
07:00:48  actually not even leaving football
07:03:11  elliott: so there is no chance but sc2 is not a perfect information game.
07:03:14  due to fog of war.
07:03:18  this one seemed more interesting; from Ascitans through other christian subjects but then on to folklore and television
07:03:26  *seems, not finished yet
07:03:29  kallisti: more like fog of lame
07:03:41  elliott: ...the game would be much more boring without fog of war.
07:04:00  sure. you mean more cool
07:04:28  "oh look my enemy dropped this building I should counter with this."   "oh he made these units I'll counter with these"
07:04:28  then on to radio and frequency subjects
07:05:11  suddenly to telemetry and SMS
07:05:44  oh, United States
07:06:03  http://kevan.org/catfishing.php
07:06:39  global military spending, stockholm international peace research institute
07:07:24  open source, biotechnology, life sciences :P
07:07:45  this is almost like clicking random itself, but with less lousy hits
07:08:47  zoology, ancient greek, renaissance
07:09:12 -!- monqy has quit (Quit: hello).
07:09:52  Jafet: this is very difficult
07:09:53  subpages of that, then obscurantism
07:10:21  @src (<*>) []
07:10:21  Source not found. Just try something else.
07:10:23  @src [] (<*>)
07:10:24  (<*>) = ap
07:10:29  look of disapproval
07:10:30  friedrich nietsche - somehow we're getting closer to philosophy anyhow :P
07:10:38  *nietzsche
07:10:41  > ap [f,g,h] [a,b,c]
07:10:42    Ambiguous type variable `b' in the constraints:
07:10:42     `GHC.Show.Show b'
07:10:42       a...
07:10:45  > ap [f,g,h] [a,b,c] :: [Expr]
07:10:46    [f a,f b,f c,g a,g b,g c,h a,h b,h c]
07:10:51  ah yes.
07:11:28  tertiary syphilis
07:12:18  men who have sex with men, social research
07:12:47  market research, European Society for Opinion and Marketing Research
07:13:45  oerjan: wow, it's actually titled "men who have sex with men"
07:13:48  i thought you were being cutsey
07:14:06  ethical code, ethics, descriptive ethics, meta-ethics, normative ethics, john rawls, democracy
07:14:12  nope i wasn't :P
07:14:31  About 2% of the US population (about 4% of American men) are classified as men who have sex with men.[10]
07:14:41  i guess they included the non-male statistic for all those non-male men who have sex with men
07:15:38  SgeoN1: the cause of freenode lagging with xchat is because i am on freenode using xchat
07:16:04  republic, republics of the soviet union, dissolution of the soviet union, union state, belarus
07:16:15  this is quite wild :P
07:16:48  it would be typical that the client and server ( :P ) combination i choose to use is the one which lags
07:16:53  elliott: Gender can get confusing in confusing circumstances.
07:17:04  "male" is FAIRLY unambiguous :P
07:17:24  commonwealth of independent states, single market, customs union, trade pact, trade
07:17:28  Indeed. "Man", however, is not. :P
07:18:18  financial market, brownian model of financial markets, jump diffusion, valuation of options
07:18:34  oerjan should make a script to do this already.
07:18:37  oerjan: last substantial link as in in the body of the document? does that include lists of related topics or above that?
07:18:44  i'm _still_ on the one starting with the Ascitan sect
07:18:54  oh.. what am i saying.. i can just follow your trail
07:18:57  itidus22: no, as in the introduction section
07:19:01  since itde deterministic
07:19:20  Well, the topology is slightly time-varying
07:19:27  lol
07:19:39  Unless oerjan gives revision numbers
07:19:42 -!- Klisz has quit (Quit: You are now graced with my absence.).
07:19:48  wow
07:19:53  yeah..
07:20:18  option (finance), investment banking, Financial Industry Regulatory Authority, financial regulation
07:21:33  government, regime, politics, policy, policy studies, public administration
07:22:18  and then finally it returns to ethics.
07:23:09  ok so in the presence of a contents section it is the first signifigant link before the contents, and in its absence it is the last link of the first paragraph
07:23:18  ^last
07:23:23  blah.
07:23:32  30 steps in the ethics loop
07:24:30  ok not first paragraph
07:24:34  first intuitive section
07:25:01  and 37 steps from the Ascitans to ethics
07:25:14  oerjan: i wish you could easily index structures keyed on functions, so we could just build a "give us a function (Article -> Link) and we'll let you compute shortest paths and shit" :P
07:25:30  thus completely removing the human element and fun in place of efficiency!
07:25:36  yay!
07:25:43  Just download the dumps
07:25:58  hmm
07:26:03  Jafet: it's still pretty computationally intensive to compute things like shortest path...
07:26:05  I believe they're still only in the low GBs
07:26:53  It's actually quite surprising that people haven't found better ways to compute shortest paths
07:26:54 * oerjan tries another one
07:27:40  Dijkstra's is something like O(v e log v)
07:28:08  Mohler, Robert Mohler, Dharma & Greg, Golden Globe Award for Best Actress – Television Series Musical or Comedy
07:28:37  Jafet: http://dumps.wikimedia.org/enwiki/20111007/
07:28:46  too varying sizes to mentally estimate a size
07:28:53  but probably < 20 gigs
07:29:08  Jafet: but it's apparently ~150 gigs uncompressed
07:29:22  Hollywood Foreign Press Association, Los Angeles, Mediterranean climate, Chile
07:29:56  Paul Erdos, probability theory, quantum mechanics, quantum gravity(debatable), orders of magnitude (mass), kilogram, planck constant, pi, ludolph van ceulen, leiden university
07:31:16  Union of South American Nations, Ecuador, Human Development Index, Human development (humanity), Capability approach, Consumer choice
07:31:40  League of European Research Universities, europe, History of the Soviet Union (19821991), Perestroika, cold war, Dissolution of the Soviet Union, union state
07:31:56  itidus22: that merges with my previous one
07:32:00  ... some of these i get nervous about whether i am choosing correctly but so far so good
07:32:05  from the dissolution
07:32:21  holy crap
07:33:09  I wonder what distribution is followed by these "last links".
07:33:15  anal sex, butt plug, anal cancer, buttocks, feces, anallingus
07:33:44  we seem to have found a vergence in the wiki
07:33:44  If you know the distribution, you can calculate the expected path length, etc.
07:33:45  Hypothesis, Counterfactual conditional, Indicative conditional, Material conditional, Reductio ad absurdum
07:34:05  pegging, fingering, Judaism, ethnoreligious group, Anti-Discrimination Act 1997
07:34:12  =))
07:35:11  MC Hammer, Doug E. Fresh, microphone, piezoelectric, propane barbecues, regional variations of barbecue, western united states, tennessee, tennessee aquarium, cambridge seven associates, interior design
07:35:14  amazing
07:35:19  oerjan: what do you do if there's no links in the intro
07:35:46  elliott: i've not seen that yet, although i have seen a couple with just one
07:36:00  oerjan: WHAT DO I DO!!
07:36:01  do i give up
07:36:07  i suppose :/
07:36:10  How could you turn this into a multi-player game?
07:36:21  hmm
07:36:29  Jafet: you have to meet the other person?
07:36:31  and you play in teams
07:36:36  trying to link the whole team up on the same trail
07:36:57  Anselm of Canterbury, Pope Clement XI, Pope, Assumption of Mary, Juan de Salazar de Espinosa, Álvar Núñez Cabeza de Vaca
07:37:15  transgender, pansexual, LGBT, questioning, Bi-curious, three-way, love triangle, murder, suicide, samurai, pre-industrial society, family economy, peasants, yeoman, Elizabethan era, Britannia.
07:37:28  god blses britannia
07:37:52  kallisti: i like how it goes "three-way, love triangle, murder"
07:38:00  brainfuck, proper noun, Article (grammar), Zero-marking in English, function word, --lost
07:38:02  I was thinking more along the lines of "Mornington Crescent".
07:38:03 -!- SgeoN1 has quit (Read error: Connection reset by peer).
07:38:04  Indigenous peoples of the Americas, Uncontacted peoples, Infectious disease
07:38:20  oerjan: can you identify the link on this page? http://en.wikipedia.org/wiki/Function_word
07:38:23  well obvious if you get to Mornington Crescent, you win
07:38:54  itidus22: http://en.wikipedia.org/wiki/Pro-sentence
07:38:56  Mornington Crescent (game), London Underground, London Overground, Watford DC Line, alternating current, modulation, modem, phase shift keying, demodulator, modulation
07:39:04  ok cool makes sense to me
07:39:37  WhatLinksHere/Mornington_Crescent
07:39:43  Friendship, reciprocity, and... uhh
07:39:45  oerjan: http://en.wikipedia.org/wiki/Reciprocity_(social_psychology) help
07:39:51 -!- Ngevd has joined.
07:40:27  elliott: http://en.wikipedia.org/wiki/Influence:_Science_and_Practice
07:40:36  Hrm, only three Main pages link to Mornington_Crescent.
07:40:51  No wonder that game was hard to win.
07:40:55  oerjan: hmm, bored of this chain now :(
07:41:01  Jafet: heh
07:41:03  time to go totally stupid!
07:41:16  sex, sexual dimorphism, behavior, involuntary,
07:41:23  oerjan: what do i do about disambigs, go to the last link?
07:41:31  the last disambig link, not last see also or w/e
07:41:50  Hello!
07:42:04  elliott: well i think i've pretty consistently stopped before the second section line
07:42:13  sex, sexual dimorphism, behavior, involuntary, involuntary commitment, deinstitutionalisation, community mental health act, homelessness, domestic violence, abuse
07:42:19  WOW sex is serious stuff!
07:42:32  Kids, don't do sex.
07:42:35  hi Ngevd we're playing a new wikipedia game
07:42:53  , aggression, assertiveness, self-esteem, amour-propre, Fall of Man
07:42:56  sex -> fall of man
07:43:12  Has elliott had any sleep?
07:43:41  , nostalgia, Old South, history of the united states (1789–1849), second great awakening, jesus christ (yes i win!!), Bahá'í Faith, Bahá%27í_symbols#The_Greatest_Name
07:43:44  oerjan: what do i do for section links
07:43:45  last link in section?
07:43:56  elliott: i've just gone to the article beginning
07:44:02  meh, i prefer last in section
07:44:12  , manifestation of god, progressive revalation (Bahá'í), manifestation of god
07:44:17  sex is all about bahá'í
07:44:21  Synonym, Thesaurus, Historical Thesaurus of the Oxford English Dictionary, Roget's Thesaurus
07:44:24  and homelessness. and domestic violence. and abuse.
07:44:31  sex: just say no.
07:44:35  Ngevd: not to my knowledge
07:44:47  Okay, elliott, go to sleep
07:44:54  I will meanwhile have a shower
07:45:09  =))
07:45:27  wikipedia, Encyclopædia Britannica, british spelling, american and british english differences, english language#geographical distribution, indian english, english medium education, david graddol, university of york, green belt (uk), duncan sandys
07:45:30  winston churchill
07:45:35  elliott: you know you want to stop doing this and watch the most legendary starcraft player sc2.
07:45:39  100 greatest britons
07:45:42  the beatles
07:45:49  Time 100: The Most Important People of the Century
07:45:53  albert einstein
07:45:55  genius
07:45:58  mastery
07:46:02  basic skills
07:46:06  constance kamii
07:46:11  Categories (Aristotle), Apprehension (understanding), Space, Tests of general relativity
07:46:18  birmingham, alabama
07:46:23  southeastern conference
07:46:26  michael slive
07:46:29  academic year
07:46:46  positive correlation
07:46:49  robust statistics
07:46:50  Tests of special relativity, and back to the previous one.
07:46:52  esimator
07:46:55  robust statistics
07:47:01  esimator, robust statistics, esimator, robust statistics, esimator, robust statistics, esimator, robust statistics, esimator, robust statistics, ...
07:47:12  Very robust.
07:47:18  vee haf loops
07:47:49  i believe kallisti stopped at britannia
07:48:45  rjan (given name) is left as an exercize to the reader
07:49:09  Britannia, Kingdom of Scotland, Capital city, County seat, List of boroughs and census areas in Alaska
07:49:41  oerjan: yes I went from anal sex to Brittania
07:51:03  United States Census Bureau, President of the United States, Inauguration of Barack Obama, National Mall, Washington Monument
07:52:55  2011 Virginia earthquake, Canada, Standard of living, South Korea, East Asia Summit, Kuala Lumpur
07:54:14 -!- calamari has quit (Quit: Leaving).
07:54:56  the dark side, DarkSide (collaboration), Laboratori Nazionali del Gran Sasso, ILIAS, MySQL, Twitter, new york city, rockefeller university, The Journal of General Physiology, molecule, glass, studio glass, glassblowing, (loop to) glass
07:55:16  Petronas Towers, Kuala Lumpur Tower, and loop back to the previous one.
07:55:45  kallisti: conclusion, anal sex can get you to some tall places
07:57:47  ocd'ing on elliott's unfinished one:  Influence: Science and Practice, Regulatory compliance, whoops no link.
07:58:21  lol
07:58:56  no link?
07:59:18 -!- Jafet has quit (Quit: Leaving.).
07:59:21  ahhh
07:59:22  well, i _could_ take the disambiguation one i guess, but that doesn't count in the usual first link game...
07:59:29  ahhh cool
07:59:33  so no link means no link
08:00:09  itidus22: indeed
08:01:14  so does this one lead to ECA? http://en.wikipedia.org/wiki/2006_in_video_gaming
08:02:01  Örjan (given name), Baptism, ignore internal link, Believer's baptism, back to Baptism via section link
08:02:41  oerjan: theres basiclaly no escaping baptism however you try it
08:03:07  itidus22: bah i guess ECA is it, not a well formatted article for this
08:03:18  hmm ok lets ignore the eca
08:03:44  minecraft, dwarf fortress, 2006 in video gaming, malformed
08:04:02  um i meant the article which eca was on was not good for this
08:04:12  ya.. it's a doozy
08:04:28  but minecraft leads to dwarf fortress which is cool
08:06:14  i'll try Baptism again with elliott's section linking method
08:06:51  whoops should i take the whole section or just the first subsection
08:06:55  elliott: ^
08:07:19  oerjan: um what do you mean
08:07:22  you take the section it links to
08:07:23  oh subsection
08:07:26  ignore subsections, I think
08:07:33  you're looking for the "intro" to the section
08:07:38  basically imagine the section was an article itself
08:07:41  that's the article you were linked to
08:07:42  ok
08:08:02  it makes no difference.. you still end up trapped
08:08:06  hahaha
08:08:43  Baptism, Baptism#Other_initiation_ceremonies, Archaeology, Pseudoarchaeology
08:08:43  oh.. unless there is a special section rule.. hm
08:08:47  ahh cool
08:09:00  so thats the section rule
08:10:42  Evolution, Evolutionary psychology, Criticism of evolutionary psychology, darn loops back to evolutionary psychology
08:13:06 -!- Slereah has joined.
08:14:49 -!- Slereah_ has quit (Ping timeout: 258 seconds).
08:17:50  xkcd, leet, Hacker (hobbyist), Altair 8800, Altair BASIC, Microsoft BASIC, Microcomputer, Personal computer, smartphones, Binary Runtime Environment for Wireless, Machine code, Bytecode, Compiler, Parsing, Part of speech,
08:20:20  Haskell (programming language), Curry%E2%80%93Howard_correspondence#Origin.2C_scope.2C_and_consequences, Corecursion, Self-reference, Paradox, Inspection, no link
08:21:20  Where are we allowed to start?
08:22:07  Ngevd: any main namespace wikipedia article you want, including random
08:23:54  oh itidus22 already did brainfuck, no wonder this looked familiar
08:24:37  Stative verb, Dynamic verb, Historical present, Foregrounding, Pragmatics, experience, Recreational drug use, Psychoactive drug, Neuroethics, Justice, Equity (law), Common law, Australia, .. man this is a long one
08:25:44  And what do we have to do?
08:26:40  Ngevd: look at the introduction section, and find the _last_ link there to another wikipedia main space article
08:26:44  Pacific Islands Forum, Northern Mariana Islands, Capital city, County seat, List of boroughs and census areas in Alaska, United States Census Bureau -- and this part has been done before i think
08:26:57  itidus22: yep, from Capital city
08:27:31  xkcd had so much hope when it got to parsing.. but it fell apart
08:27:55  Ngevd: then just see what strange path you follow before looping or there being no link
08:27:56  Goodbye
08:27:57 -!- Ngevd has quit (Quit: Goodbye).
08:29:25  brainfuck, ..., Pro-sentence, Emotion, Armindo Freitas-Magalhães, Forensic science, Synonym and i'm sure i've seen that before.
08:30:50  it ended up looping between Tests of general relativity and Tests of special relativity
08:30:59  @djinn ((x -> b) -> c) -> ((x -> a) -> b) -> ((x -> a) -> c)
08:31:00  f a b c = a (\ d -> b (\ _ -> c d))
08:31:07  NOT HELPFUL LAMBDABOT
08:31:15  "oerjan> Synonym, Thesaurus, Historical Thesaurus of the Oxford English Dictionary, Roget's Thesaurus"
08:32:48  DMM is let down a bit in this game.
08:34:01  :t \a b c -> a (\x -> b c)
08:34:02  forall t t1 t2 t3. ((t1 -> t2) -> t3) -> (t -> t2) -> t -> t3
08:34:58  elliott: ^
08:35:28  oerjan: the correct solution is actually \a b c -> a (\d -> b (c . (++ d)))
08:35:52  elliott: that seems somewhat unlikely with that ++
08:36:02  oerjan: i can assure you it's correct
08:36:16  :t \a b c -> a (\d -> b (c . (++ d)))
08:36:16  forall b m t t1. (Monoid m) => ((m -> t) -> t1) -> ((m -> b) -> t) -> (m -> b) -> t1
08:36:24  caleskell :')
08:37:54  well it doesn't work without x being a list type, then
08:39:01  oerjan: duh. i was simplifying it so djinn gave me the structure
08:39:08  I use x as a placeholder for concrete types usually
08:39:46  i suppose it _should_ be a special case of the type of mine, since (c . (++ d)) always has the same type as c when it types
08:39:51 * elliott wishes his editor had djinn
08:40:01  befunge, Programming language, Reference implementation, Java Platform Enterprise Edition, Application server, Personal computer hardware, Device driver, Interrupt, Interrupt handler, Event (computing), Interactivity, Industrial design, United States, List of countries by military expenditures, Stockholm International Peace Research Institute,
08:40:20  itidus22: United States has been seen before
08:40:27  ah ok thanks
08:41:29  :t showHex
08:41:30  forall a. (Integral a) => a -> String -> String
08:48:47  EgoBot, Whirl, Turning tarpit, Turing tarpit, Turing-complete, Church-Turing thesis, Lambda calculus, (loops back to) Church-Turing thesis
08:50:05  Toto, I don't think we're in Wikipedia anymore
08:50:20  i should give it a rest
08:50:41 -!- oerjan has quit (Quit: Good night).
08:58:49  @unmtl Cont r a
08:58:49  (a -> r) -> r
09:41:01  elliott: hi
09:41:08  elliott: FRP for newtonian physics?
09:41:13  yes? no?
09:41:17  what
09:41:26  so, no.
09:41:29  okay. thanks. :)
09:41:42  no that's
09:41:42  not no
09:41:46  that's
09:41:46  not even no
09:41:47  as in
09:41:49  what the hell are you talking about
09:42:01  I was wondering if FRP worked for a physics engine
09:42:02  for games
09:42:03  such as
09:42:04  aii
09:42:51  yes it turns out that frp is applicable to many game engines?
09:42:59  okay cool
09:43:02  do you want to do that for the physics?
09:43:06  but i doubt it helps much
09:43:07  since
09:43:11  there is exactly one piece of physics driving everything
09:43:20  or animation
09:43:32  only one? I thought there was heat and stuff as well as velocity.
09:43:43  and gravity
09:43:56  ...
09:44:08  i meant one piece of physics code
09:44:19  maybe i'll sleep, i'm starting to get annoyed at way too frequent a rate
09:44:58  elliott: nah just watch starcraft videos
09:45:03  that's what I've been doing.
09:46:21  elliott: so basically gravity is the one piece of complex physics code
09:46:50  with velocity being trivial and player thrusting being trivial as well.
09:46:53  no
09:46:54  the
09:47:00  one piece of physics code is the newtonian physics simulation
09:47:14  which
09:47:18  is going to be a few thousand lines at absolute maximum
09:47:33  and is pretty much a self-contained, pre-specified system
09:47:38  so i don't see how frp would help at all
09:49:47  dunno
09:50:08  I thought that it would perhaps make the code easier to write
09:50:24  rather than being used to couple mulitple components.
09:51:45  like i just said
09:51:47  there is exactly one component
09:52:16  right
09:52:17  that's why
09:52:19  I wasn't suggesting that one
09:52:28  the one involving the multiple components.
09:52:48  it was basically just a guess as I actually don't understand the use case of FRP
10:06:58 -!- augur has joined.
10:12:25 -!- elliott has quit (Ping timeout: 245 seconds).
10:44:18 -!- augur has quit (Ping timeout: 240 seconds).
10:50:19 -!- ais523 has joined.
11:21:18 -!- Patashu has quit (Quit: MSN: Patashu@hotmail.com , Gmail: Patashu0@gmail.com , AIM: Patashu0 , YIM: patashu2 , Skype: patashu0 .).
11:30:45 -!- ais523 has quit (Read error: Operation timed out).
11:32:10 -!- ais523 has joined.
11:53:32 -!- derdon has joined.
12:31:12 -!- derdon has quit (Remote host closed the connection).
13:14:02 -!- derrik has joined.
14:05:42 -!- ais523 has quit (Remote host closed the connection).
14:07:57 -!- derrik has quit (Ping timeout: 252 seconds).
14:28:20 -!- Ngevd has joined.
14:28:34  Are you still playing that wikipedia game?
14:30:08  Also, hello!
14:34:53  London, Ontario ends on a loop betweeen Sanskrit and Sanskrit revival
14:35:05  Via Nihilism, Zeitgeist, Dutch Golden Age
14:45:28 -!- derrik has joined.
14:51:06 -!- Phantom_Hoover has joined.
14:52:03  Hello derrik, Phantom_Hoover
14:52:12  fungot?
14:52:12  Ngevd: there! there it is! but by the time we're through with you, you'll be in danger. open hatch. 400 long years. when will it be the reptites, or you silly apes who end up ruling the world?
14:52:14  hi Ngevd
14:52:21 -!- ais523 has joined.
14:52:27  Hello ais523
14:52:28  Great, now my name is associated with derrik's for all time.
14:52:28  Phantom_Hoover: You have 3 new messages. '/msg lambdabot @messages' to read them.
14:52:57  hi Ngevd
14:52:58  Phantom_Hoover: yw
14:53:14  ^style
14:53:14  Available: agora alice c64 ct* darwin discworld europarl ff7 fisher fungot homestuck ic irc iwcs jargon lovecraft nethack pa qwantz sms speeches ss wp youtube
14:53:19  ^style ct
14:53:19  Selected style: ct (Chrono Trigger game script)
14:53:31  ^style homestuck
14:53:31  Selected style: homestuck (Homestuck pages 1901-4673)
14:53:32  fungot
14:53:32  Ngevd: have a look.
14:54:10  fungot, demonstrate intelligence
14:54:11  Ngevd: but in a more platonic sense, and with a more specific social purpose.
14:55:26  ^style discworld
14:55:27  Selected style: discworld (a subset of Terry Pratchett's Discworld books)
14:55:49  fungot, what's up?
14:55:50  Ngevd: ' by now,' said ridcully. " you've got one minute."
14:56:03  That's... coherent.
14:56:27  Got a new Pterry today
14:57:08  Vimes dies.
14:57:12  So does Rincewind.
14:57:21  Death goes into a coma.
14:57:22  Cohen?
14:57:35  He becomes a zombie.
14:57:42  Wow, cool
14:58:05  He has a duel to the death with Slant and Reg Shoe.
14:58:31  In I Shall Wear Midnight?
14:58:42  Why is none of this even /hinted at/ on the cover?
14:59:01  It's a suprise.
14:59:05  Also a surprise.
15:05:28 -!- MDude has joined.
15:08:18 -!- MSleep has quit (Ping timeout: 248 seconds).
15:08:36 -!- derrik has quit (Quit: gone).
15:11:17 -!- ais523 has changed nick to ais523\unfoog.
15:36:50  My eyes hurt and I can smell cheese
15:49:28  Has someone stuck some cheese in your eyes, by any chance?
15:49:54  Not as far as I am aware
15:50:10  Check, just to be sure.
15:50:30  There is very little cheese in my eyes
15:50:42  None that could couse this simultaneous pain and smell
15:50:50  I suspect the two are unrelated
15:51:09  Move to a different area where there is no cheese smell, test for correlation.
15:51:32  This is not the time for science!
15:51:48  ALL TIMES ARE TIME FOR SCIENCE
15:52:03  someone quote those lines please
15:52:14  oh wait
15:52:18  HackEgo is still down.
15:52:20  no bots
15:52:23  :
15:52:26  fungot is a bot
15:52:29  :<
15:52:29  Probably
15:52:30  !sanetemp 57
15:52:33  13.8
15:52:39  fungot!?
15:52:39  fungot cant quote :<
15:52:39  !sh lss
15:52:40  ​/tmp/input.832: line 1: lss: command not found
15:52:40  quintopia: bucket gaped at him. " certainly your actual pig products. genuine pig." " yeah. you could tell them all that."
15:52:41  !sh ls
15:52:41  interps
15:53:18  oh egobot is here
15:53:34  why is egobot here but not hackego?
15:53:42  God only knows.
15:54:00  > "lambdabot is also here"
15:54:01    "lambdabot is also here"
15:54:03  Although on second thoughts I suppose Gregor does too.
15:54:17  should have written GOK
15:54:23  God only knows; Gregor understands
15:54:24  could be interpreted either way
15:55:05  we need to preserve for posterity the fact that Ngevd thinks there is a time that is not for science
15:56:36  i guess its up to me
15:56:41  i shall tweet it
16:22:36 -!- Sgeo has joined.
16:35:20 -!- Ngevd has quit (Ping timeout: 240 seconds).
16:39:30 -!- MDude has quit (Ping timeout: 248 seconds).
16:49:54 -!- Sgeo has quit (Ping timeout: 240 seconds).
16:52:59 -!- Sgeo has joined.
16:59:26 -!- monqy has joined.
17:03:30  hi monqy
17:03:36  where you live?
17:05:22  !!
17:05:26  is usa specific enough
17:05:38  does someone know me
17:06:07  no. i was just curious as to country and time zone
17:06:14  oh
17:06:17  pacific time
17:06:21  if you are usa then happy t-day!
17:06:41  so that's today? I can never remember which it is
17:07:16  its always thursday
17:07:25  maybe I'll remember now
17:08:19 -!- sebbu2 has joined.
17:08:46  It's the second-to-last Thursday of the month.
17:09:00  (of November)
17:10:00 -!- sebbu has quit (Ping timeout: 260 seconds).
17:12:44  it's easy to tell what day it is. if the newspaper looks unusually thick, even for a snday paper, but its thursday? thanksgiving
17:13:21  Is this that quaint American thing you do with the turkey?
17:13:30 -!- Sgeo has quit (Ping timeout: 240 seconds).
17:13:48  turkey?
17:14:22  no we celebrate thanksgiving with a watching of addams family values and giving smallpox-infected blankets to neighbors
17:14:25  its tradition
17:14:33 -!- Sgeo has joined.
17:14:44  The smallpox must be hell to source these days.
17:15:13 -!- sebbu2 has changed nick to sebbu.
17:17:03  its a long-standing tradition. we've had it since the beginning. other families keep their christmas lights up all year. we keep our smallpox fed all year
17:17:46  I bet the man's always trying to take it away.
17:19:13  nah, america esteems tradition highly
17:19:38  and since we only give it to the mexican neighbors, they can see that we are just doing our patriotic duty
17:49:22 -!- PiRSquared17 has joined.
17:49:53  Hello again
17:51:09  hi
17:51:16  where you from?
17:51:30  Virgo supercluster
17:51:36  ah
17:51:45  they probably dont celebrate thanksgiving there
17:53:30 -!- Sgeo has quit (Ping timeout: 240 seconds).
17:54:28  < solid_liq> Dianora, not at all.  I've tried other languages numerous times over the last 27 years, and always head back to the best two languages: C and C++
17:54:37 -!- Sgeo has joined.
17:54:49  a religious war in ##electronics >_>
17:55:13  i think it's spelled ridiculous
17:58:27  i would agree
17:58:43  at least
17:58:49  solid_liq is ridiculous
18:00:48  well he is obviously insane
18:01:08  he's religious?
18:01:30 -!- Sgeo has quit (Ping timeout: 240 seconds).
18:02:12  when it comes to C and C++
18:03:06 -!- copumpkin has changed nick to TheRubberTurkey.
18:04:37 -!- Sgeo has joined.
18:07:20 -!- TheRubberTurkey has quit (Quit: Computer has gone to sleep.).
18:10:26 -!- derrik has joined.
18:26:48 -!- elliott has joined.
18:29:48 -!- Ngevd has joined.
18:30:25  Hello!
18:30:29  helo
18:30:35  Still no HackEgo?
18:33:38  17:54:28:  < solid_liq> Dianora, not at all. I've tried other languages numerous times over the last 27 years, and always head back to the best two languages: C and C++
18:33:42  quintopia: i have the best rebuttal:
18:33:47  quintopia: "you're stupid"
18:33:56  yes
18:34:00  we all said that
18:34:08  D is much better
18:34:23  quintopia: so since this was ##electronics did they say "oh, asm is so much better"
18:34:29  sorry i'm kind of racist against electronicists
18:34:35  eh only jokingly
18:34:44  Well, for many uses asm *is* better.
18:34:48  mostly they just said "they have their good and bad sides"
18:35:06  Said uses just aren't exactly popular anymore. :P
18:35:21  the great thing about C++ is all it has is bad files
18:35:39  s/files/sides/ oops
18:35:52  True. "Hmm. C has many mistakes. Let's make more."
18:37:16  git wizards: How can I apply the inverse of three contiguous commits, preferably with a nice autogenerated commit message?
18:37:27  If this channel tried to create the perfect programming language, what would it look like?
18:37:50  underload :P
18:38:06  An impure language with no input?
18:38:14  underload is pure
18:38:14  It would be N+1 languages, where N is the number of channel members.
18:38:29  it's a transformation from a program to a program
18:38:30  or
18:38:32  who would write two?
18:38:36  a program to a stack of programs and a program
18:38:39  but usually you discard the stack
18:38:50  I dunno. Gregor or elliott, I guess?
18:38:55  i mean yes every language is "pure" in this sense
18:38:58  nah
18:38:59  but underload fits it quite well
18:39:03  elliott: What, you mean, um, undoing 3 commits?
18:39:06  elliott wouldnt even finish the first one
18:39:08  pikhq: yep
18:39:25  we'd probably just sit back and wait for feather
18:39:58  elliott: "git revert HEAD~2"
18:40:03  pikhq: i never said they were head
18:40:07  pikhq: there have been commits since
18:40:10  i want to retain those
18:40:28  "git revert first_commit..last_commit"
18:40:34  thx
18:42:15  a03d8ec Close upgrade_fd when upgrading
18:42:16  6e816b9 Fix a "leak" in //upgrade
18:42:16  4edb5be Awful //upgrade stuff. I'm ashamed.
18:42:18  time to revert these!
18:43:11  pikhq: doesn't work man
18:43:14  pikhq: it tries to revert them all separately
18:44:43  My RSS feeds haven't told me about any mchost or mcmap updates for ages
18:44:48  Should I be worried?
18:45:37  there haven't been any
18:46:01  That replaces worry with dissappointment
18:46:57  pikhq: which is weird :/
18:47:17  aha, -n
18:47:45  pikhq: nope, doesn't work
18:49:47  pikhq: I guess I'll just get the diffs and manually reverse-apply them?
18:50:48  [elliott@dinky mcmap]$ git diff 4edb5be~..a03d8ec | git apply -R
18:50:48  woo, massive failures
18:52:34 -!- Phantom__Hoover has joined.
18:55:46 -!- Zuu has joined.
18:55:51 -!- Zuu has quit (Changing host).
18:55:51 -!- Zuu has joined.
18:56:18 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds).
19:10:28 -!- MSleep has joined.
19:15:14 -!- MSleep has quit (Ping timeout: 248 seconds).
19:15:14 -!- TheRubberTurkey has joined.
19:18:55 -!- TheRubberTurkey has changed nick to copumpkin.
19:18:55 -!- copumpkin has quit (Changing host).
19:18:55 -!- copumpkin has joined.
19:19:23  ais523\unfoog: your termcast seems a lot laggier than last time for some reason
19:19:44  perhaps the game's just laggy
19:21:46  gah, I just realised that my second- or third-favourite programming editor isn't maintained any more
19:24:24 -!- pikhq has quit (Ping timeout: 260 seconds).
19:29:40  ais523\unfoog: I am flabbergasted to learn that owlbears are a thing
19:29:48  heh
19:29:51  I take it you're watching me
19:29:56  intermittently
19:29:59  I'm not really used to playing wizards
19:30:01  they're too squishy
19:30:03  blarg, I need to make more slides
19:30:08  i'm not sure where you are, exactly
19:30:09  I need beter armour
19:30:12  and that's the Quest home level
19:30:29  hey, I could actually use a shield
19:30:30  ais523\unfoog: they're squishy early on, but if they survive, they can't lose
19:30:41  coppro: they're squishy even late on
19:30:44  despite being overpowered offensively
19:30:54  yeah, but the squishiness is irrelevant
19:30:59  since they can FoD everything
19:31:32  especially if they find markers to enchant their armor with
19:32:32  nah, it messes up spellcasting too much
19:32:47  wizards should be spending three or four wishes on markers
19:32:47  dsm doesn't
19:32:55  I know
19:33:01  the nah was at the shield I just tried on
19:33:04  ah
19:33:13  also magicbane
19:33:15  which reminds me, I need to find somewhere nice and enclosed to revgeno silver dragons
19:33:31  magicbane is rather silly
19:33:51  I'm practicing with magicbane atm
19:33:57  I've been using a quarterstaff pretty much all game
19:34:22  magicbane is good just for being an athame
19:34:29  much less having the properties it does
19:36:28  MR is pretty major as properties go, although ofc wizards have that anyway
19:42:14  yay, now I have SDSM
19:42:25  that went a bit wrong, I typoed off the Elbereth square and almost died
19:42:32  but all's well that ends well in NetHack, right?
19:51:00  oh no, every now and then I forget this header file exist
19:51:00  s
19:51:03  and then I see it again
19:51:05  and I remember my pain :(
19:55:13 -!- pikhq has joined.
20:13:54 -!- Sgeo has quit (Ping timeout: 240 seconds).
20:14:56 -!- Sgeo has joined.
20:19:14 -!- copumpkin has quit (Ping timeout: 260 seconds).
20:19:30 -!- Sgeo has quit (Ping timeout: 240 seconds).
20:22:42 -!- Sgeo has joined.
20:23:44 -!- GreaseMonkey has joined.
20:33:30 -!- Sgeo has quit (Ping timeout: 240 seconds).
20:36:38 -!- Sgeo has joined.
20:41:35  Bye
20:41:38 -!- PiRSquared17 has left.
20:42:45 -!- HackEgo has joined.
20:43:13  HackEgo
20:43:14  i love you
20:43:27  Sgeo: boooooo
20:43:37  `pastequotes
20:43:39  kallisti, hm?
20:43:44  http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/paste/paste.1598
20:44:29 -!- PiRSquared17 has joined.
20:44:36  `run cat '/var/irclogs/_esoteric/2011-11-24-raw.txt' | perl -n -e '/:(.*?)!.*JOIN/; $j{$1}++; END {print "$_ $j{$_}; " for sort {$j{$b} <=> $j{$a}} keys %j}'
20:44:38  Sgeo 630; Ngevd 168; Slereah 97; itidus21 76; itidus22 71; pikhq 61; Darth_Cliche 56; MDude 43; copumpkin 43; Rugxulo 40; EgoBot 38; ais523 37;  32; SgeoN1 29; kmc 25; elliott 24; Jafet 22; monqy 13; Klisz 12; PiRSquared17 12; MSleep 11; sebbu2 10; HackEgo 7; Phantom_Hoover 5; sebbu 5; augur 5; derrik 5; itidus20 5; Zuu 4; TheRubberTurkey 3; GreaseMonkey 2; pikhq_ 2; derdon 2; Phantom__Hoover 1; yorick 1; kallisti 1;
20:44:45  Sgeo: ^^^
20:44:47  `addquote  This is not the time for science!    ALL TIMES ARE TIME FOR SCIENCE
20:44:49  735)  This is not the time for science!    ALL TIMES ARE TIME FOR SCIENCE
20:44:50  kallisti: Yes, just break it again.
20:44:56  ?
20:45:01  wow.
20:45:02  is that what broke it?
20:45:03  That's the last thing happened before HackEgo died :)
20:45:04  Well
20:45:07  Apart from deleting bin/hi :P
20:45:13  I'm the second mose quoted person!?
20:45:23  elliott: therefore it must have been that! :P
20:45:25  I think?
20:45:32  no
20:45:33  ?
20:45:34  Ngevd: Nope, that's counting JOINs
20:45:38  `quote
20:45:40  618)  I think this has taught us one thing. We can't teach itidus20 lambda calculus by comittee
20:45:46  Wow, me
20:45:48  HackEgo, :(){:|:&};:
20:45:52  This is why I was using the webchat for so long
20:46:06  `quote
20:46:08  73)  i use dynamic indentation, i indent lines k times, if they are used O(n^k) times during a run of the program
20:46:08  in all seriousness a fork bomb gave my harddrive a bad sector once
20:46:24  And that's terrible.
20:46:40  (The fork bomb forked forty times. That's as many as four tens.)
20:46:41  hrm I didn't do anything today
20:46:43  strange
20:47:26  Phantom__Hoover: also note how awesome I am at not spamming with joins
20:47:30  please note this
20:47:40  Hang on
20:47:41  Phantom__Hoover: (asshole)
20:47:50  I'm the most JOINing person?
20:47:53  no Sgeo
20:47:54  Second most
20:47:56  Ngevd: can you read? :P
20:47:56  sgeo sgeo
20:48:00  (ha ha ha )
20:48:02  ha
20:48:05  `quote
20:48:07  686)  COCKS [...]  truly cocks
20:48:13  Who *is* the most quoted?
20:48:17  me
20:48:20  (this is a lie)
20:48:21  true mystery
20:48:28  Kentucky... Magic Chicken?
20:48:34  Phantom__Hoover: fungot or me or you, probably
20:48:34  although I did disconnect once today
20:48:34  yes
20:48:35  elliott: ' i don't know, think of something that had existed before anyone else.' against her better judgement." she hammered the cork into the bottle with the end of the factory.
20:48:38  I blame my ISP
20:48:45  and otherwise freenode
20:48:49  elliott: I guess oerjan in fact.
20:48:56  nahh
20:49:16  If you divide by the time they've spent in the channel, probably me
20:49:32  `quote taneb
20:49:34  464)  Turned out he got recursion, he just didn't get the return statement \ 470)  Cut to February   War were declared   A galaxy in turmoil   Anyway, Febuary '10 \ 471)  I can't afford one of those!   A grandchild, not a laser printer \ 478)  There's that saying that the definition of insanity is doing the same thing over and over again and expecting different
20:49:35  `quote ngevd
20:49:37  652)  Dammit, Gregor, this is not the time to fall in love \ 658) [in the context of Open University]  "Unlike other operating systems, Linux operating systems use Linux" \ 661)  Ngevd:. i'm so kind, even to assholes! anmaster no not markov anmaster no not markov anmaster no not markov anmaster no not markov anmaster no not markov \ 663)  Also you steal Berwick from us and then
20:49:38  `quote hovercraft
20:49:40  Ngevd: no itidus wins there
20:49:40  No output.
20:49:51  `quote PiRSquared17
20:49:53  No output.
20:49:54 -!- Sgeo has quit (Ping timeout: 240 seconds).
20:49:56  `quote itidus
20:49:59  474)  to assume that someone can be described by a rule without exception... is to assume they are omnipotent   for instance stones are omnipotent, as they don't do anything, without exception \ 497)  monqy: last night in my dreams I saw a false photo album of my childhood... looking ghostly \ 498)  itidus20: i saw a dancing cgi skeleton named malaria. i danced and played with him.
20:50:09  `quote HackEgo
20:50:12  39)  `translatefromto hu en Hogy hogy hogy ami kemeny    How hard is that \ 96)  let's put that in the HackEgo quotes files, just to completely mystify anyone who looks back along them in the future \ 376)  `quote django   ​352)  django is named after a person?   thought it would be a giraffe or something   thankfully only one \ 377)  `quote
20:50:15  @tell Sgeo you suck
20:50:15  Consider it noted.
20:50:46  Phantom__Hoover: again note how awesomely I have managed to only join once today.
20:50:58  you may note that this is in no way associated with join/part spam
20:51:04 -!- Sgeo has joined.
20:51:06  even though you quizzically said that it was.
20:51:06  `quote kallisti
20:51:09  No output.
20:51:10  Q.E.D.
20:51:14  `quote cakeprophet
20:51:16  141)  how does a "DNA computer" work.  von neumann machines?  CakeProphet, that's boring in the context of DNA.  It's just stealing the universe's work and passing it off as our own. \ 142)  CakeProphet: reading herbert might be enlightening in one hand he held a long worm can be greased. twice i got it nearly there, and the protector of cattle. mars is
20:51:19  bad quotes
20:51:41  `quote lambdabot
20:51:43  407) [after a long string of Lymia getting lambdabot to spit out huge, meaningless type signatures]  I need to learn more Haskell...   ..I need to get op privs. \ 491)  rest in peace lambdabot????   monqy: it'll probably be back later   nap in peace \ 588)  monqy: help how do I use lambdabot to send messages to people.  [...around half an hour later...]  
20:51:43  monqy: will you play aii
20:51:48  whats aii
20:51:53  Phantom__Hoover: tell monqy whats ai
20:51:54  i
20:52:02  `quote 588
20:52:03  Hi
20:52:03  Sgeo: You have 2 new messages. '/msg lambdabot @messages' to read them.
20:52:05  588)  monqy: help how do I use lambdabot to send messages to people.  [...around half an hour later...]   @messages   quicksilver said 1y 2m 18d 19h 54m 29s ago: you use @tell
20:52:07  monqy, OK take Asteroids.
20:52:08  gotta let the channel see that one again
20:52:10  so good :')
20:52:13  And then stick II at the end.
20:52:19  asteroidsii
20:52:35  elliott, how...
20:52:58  Phantom__Hoover: That quote is the reason I can't COMPLETELY mock belief in synchronicity.
20:53:22  "a) What is Fermat’s Last Theorem? For what values of n is it false?"
20:53:35  — A Cambridge interview question, apparently.
20:53:36  fermat's last almost theorem
20:53:49  It's clear what's meant by it, I think. Either that or it's a trick question.
20:53:55 -!- Phantom__Hoover has changed nick to Phantom_Hoover.
20:54:19  Phantom__Hoover: note that lack of good quotes has nothing to do with join/part spam, which is, if you haven't noticed, completely not associated with this nick name in any way.
20:54:20  Well, TbH, it's clearly meant to be more of an interview-type discussion thing.
20:54:26  Phantom_Hoover: completely
20:54:29  :>
20:54:50 -!- SgeoN1 has joined.
20:55:06  Can we get lambdabot to respond to ":>" with "DON'T DO THAT"?
20:55:13  :>
20:55:17  :>
20:55:23  Because it looks like a bird
20:55:26  > print "DON'T DO THAT"
20:55:27    
20:55:27  And that is silly
20:55:32  > "DON'T DO THAT"
20:55:33    "DON'T DO THAT"
20:55:36  Are there integers a b and c for which a^n + b^n = c^n for various negative values of n?
20:55:36  > text "DON'T DO THAT"
20:55:38    DON'T DO THAT
20:55:39  > text "DON'T DO THAT"
20:55:40    DON'T DO THAT
20:55:53  16:43:48:  Yes, and your name is not one unassociated with join/quit spam.
20:55:55  /whois PiRSquared17
20:55:56  please note
20:55:59  this statement that was said on the 21st
20:56:01  take note.
20:56:04  of how wrong it is, yes.
20:56:12  PiRSquared17 <~PiRSquare@wikipedia/PiRSquared17> “(pi *) . (^ 2)”
20:56:13  kallisti, you are not being serious, right?
20:56:16  > text "\08test"
20:56:17    test
20:56:29  I just want to get straight whether I should be laughing or pitying.
20:56:37  Phantom_Hoover: I am always serious when one has besmirched my good name.
20:56:53  That's not how one uses 'one'.
20:57:07  always serious when you has besmirched
20:57:13 -!- Sgeo has quit (Quit: Leaving).
20:57:14  That's how one uses "someone"
20:57:14  @pl \r -> pi * (r ^ 2)
20:57:14  (pi *) . (^ 2)
20:57:22  Besmirch you a good name.
20:57:53  PiRSquared17: (tau *) . (/ 2) . (^ 2)
20:57:57  Note increased elegance.
20:57:59  last I checked one just meant a single thing, in this context a person. the "hypothetical you" thing is stupid
20:58:26  @type pi
20:58:26  forall a. (Floating a) => a
20:58:29  @type tau
20:58:30  Not in scope: `tau'
20:58:35  "one" is nominative, generally, I think?
20:58:41  Phantom_Hoover: HASKELL IS WRONG
20:58:47  WHAT DO WE DOOOOOOOO
20:58:54  oh no quick tell quintopia
20:58:55  Ngevd: no, should is
20:58:56  @ only supports ti, which is (tau + pi) / 4.7.
20:59:02  Ngevd: "one should" is commonly used, sure.
20:59:06  Look how much more elegant it is:
20:59:08  @type let tau = 2 * pi in tau
20:59:09  forall t. (Floating t) => t
20:59:11  With tau: (tau + (tau / 2)) / 4.7.
20:59:13  Ngevd: oh misread
20:59:16  With pi: ((pi * 2) + pi) / 4.7.
20:59:18  With ti: ti
20:59:19  Ngevd: I thought that was normative :P
21:00:07 -!- PiRSquared17 has changed nick to HalfTauRSquared.
21:00:36  Phantom_Hoover: anyway fuck your prescriptivism. "one" is totally fine there.
21:00:58  I will continue to be okay with this, but staunchly prescriptivist about other things.
21:00:58  Could we @def tau pi * 2?
21:01:10  @def tau pi * 2
21:01:11  Maybe you meant: bf do let
21:01:12  ?
21:01:15  kallisti, fun fact, 'fuck prescriptivism' doesn't let you make up the language and act like it's everyone else's problem if it doesn't make sense.
21:01:24  @let tau = pi / 3
21:01:25   Defined.
21:01:33  pi/3 ?
21:01:40  Phantom_Hoover: what about "one" does not make sense in that sentence?
21:01:52  @let tau = pi * 2
21:01:53   :2:0:
21:01:53       Multiple declarations of `L.tau'
21:01:54       Declared at: ...
21:01:56  everything
21:02:06  ?
21:02:28  Because the word you were looking for was 'someone', which means something different.
21:02:28  kallisti, "one" is nominative!!! I'm sure of it!
21:02:29  i cnat eve begin to understand what you meant with that "one"
21:03:28  It's particularly annoying because 'one' is not used in normal conversational English, so you were trying to be prescriptivist but failed.
21:03:41  so it's just annoying
21:03:43  good to know.
21:04:14  `addquote  i cnat eve begin to understand what you meant with that "one"
21:04:17  736)  i cnat eve begin to understand what you meant with that "one"
21:04:22  Phantom_Hoover: I use "one" all the time it is like a bad habit.
21:04:29  i cnat eve ]
21:04:34  i cnat eve
21:04:36  elliott, that's OK, you're the Queen.
21:04:52  HalfTauRSquared: That's better than monqy usually types.
21:05:50  i type bad
21:05:56 -!- augur has joined.
21:07:07  One should use "one" as often as one desires.
21:07:17  two
21:07:21  pikhq: yesssssss
21:07:33  one is the onest one one can say.
21:07:39  One should also be aware that one will look like one big prat.
21:08:02  five
21:08:39  somesomeone is a good word.
21:08:49  otherone
21:08:58  manyone
21:09:01  onesomeone
21:09:06  notone
21:09:18  ntontonenoe
21:09:36  anytwo
21:09:39  noone oneone twoone threeone fourone fiveone sixone sevenone
21:09:40  soemoenotnoenoenoteno
21:10:04  Not Eno!!!!!!!!
21:10:11  noe not eno
21:10:35  soe moe not noe noe not eno
21:10:54  HalfTauRSquared: what do you have against Brian Eno, maan.
21:11:04 -!- MSleep has joined.
21:11:16  Who is Brian Eno?
21:11:32  a man you dislike passionately
21:11:35  :(
21:11:37  WHY?
21:11:39  naiiti itiiti niiti saniti yoniti goiti rokuiti sitiiti ← Well, that looks really strange.
21:12:13  soemoenotnoenoe /noteno/ ?
21:13:00  HalfTauRSquared: brian eno is a cool dude
21:13:17  soemoenotnoenoeyeseno
21:13:22  he pioneered being a cool dude.
21:13:39  andotherthings
21:17:56 -!- pikhq_ has joined.
21:17:59 -!- pikhq has quit (Ping timeout: 258 seconds).
21:21:34  Can I put my nick back now?
21:21:52 -!- HalfTauRSquared has changed nick to PiRSquared17.
21:22:42  No NEVER
21:23:10  Look at me and kallisti
21:23:38  fine
21:23:42 -!- PiRSquared17 has changed nick to HalfTauRSquared.
21:23:59  I grouped it anyway(s?)
21:26:02  ...
21:26:14  ,,,
21:26:16  ;;;
21:26:18  :::
21:27:00 -!- Patashu has joined.
21:27:14  `hello Patashu
21:27:16  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: hello: not found
21:27:27  `welcome Patashu
21:27:30  Patashu: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
21:28:14  http://esolangs.org/wiki/User:JillBrennan805
21:29:09  to be expecte
21:29:10  d
21:31:42  http://esolangs.org/wiki/Category_talk:Languages :?
21:31:44 -!- Ngevd has quit (Quit: Goodbye).
21:32:35  yes
21:32:38 -!- derrik has quit (Quit: quitter).
21:39:35  "as an engineer i fully approve of your explanation, it is great. however as a marxist[...]"
21:39:40  Best opening to anything ever.
21:44:49  rip ngevd
21:45:24  Phantom_Hoover: Best.
21:46:02  Hmm, what else can I stick "However, as a Marxist..." onto the end of.
21:46:23  I am immensely proud to be standing here today. However, as a Marxist...
21:46:38  Phantom_Hoover: I smell a Lyttle Lytton entry in the making.
21:46:53  That makes two now.
21:47:08  As an experienced musician, I would be delighted to join your band. However, as a Marxist[...]
21:47:40  Phantom_Hoover: As a proud supporter of the fascist corporatocracy, I fully support Mr. President's actions. However, as a Marxist[...]
21:49:06  I would be delighted to attend your formal dinner. However, as a Marxist...
21:49:38 -!- Notch has joined.
21:49:42 -!- Notch has quit (Client Quit).
21:49:49  Dammit, someone snabbed it.
21:49:54 -!- Phantom_Hoover has changed nick to notch.
21:50:04  David began to slow slightly as his ears, however, as a Marxist…
21:50:04 -!- notch has changed nick to Guest55333.
21:50:11 -!- Guest55333 has changed nick to Phantom_Hoover.
21:50:17  ais523\unfoog: you got it wrong
21:50:24  probably
21:50:30  Wait can we work on the Finnish one>
21:50:31  I can never remember exactly how that one goes anyway
21:50:32  David slowed slightly as his ears, however, as a Marxist
21:50:49  elliott: I thought that's what I thought it was and id turned out to be wrong
21:50:54  `log > David
21:50:58  *it
21:51:09  `echo ping
21:51:11  ping
21:51:22  2010-08-18.txt:00:49:04:  DAVID MITCHELL
21:51:39  `log > David
21:51:48  2009-06-17.txt:01:01:27:  David slowed his pace slightly as his ears, bottled in formaldehyde, caught his eye. "Oh," he thought, "to be alive again."
21:51:56  elliott: seems we were both wrong
21:52:03  I knew it wasn't just "slowed slightly"
21:52:05  `log > David
21:52:11  2009-11-02.txt:02:28:54:  David Piepgrass is the designer of the Asset keyboard layout.
21:52:15  `log > David
21:52:21  2011-06-09.txt:22:05:28:  00:31:32:  David slowed (his pace slightly) as (his ears, in a vat of chocolate); only his less slightly paces can go faster.
21:52:25  `log > David
21:52:30  2010-06-04.txt:13:31:36:  David Haskellhoff.
21:52:41  elliott: which should we delete? :P
21:52:52  `dellog 2010-06-04.txt:13:31:36:
21:52:55  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: dellog: not found
21:53:02  `log PiRSquared17
21:53:07  2011-11-24.txt:00:57:58: * elliott was going to say that PiRSquared17 should become TauRSquared8.5, but someone might actually take him seriously.
21:53:12  `log PiRSquared17
21:53:17  2011-11-24.txt:00:57:58: * elliott was going to say that PiRSquared17 should become TauRSquared8.5, but someone might actually take him seriously.
21:53:21  `log PiRSquared17
21:53:26  2011-11-24.txt:20:55:32:  > "DON'T DO THAT"
21:53:29  `quote
21:53:30  `quote
21:53:30  `quote
21:53:30  `quote
21:53:32  `quote
21:53:33  117)  insufficient time dilation.  try running faster.
21:53:35  286)  back to legal tender, that expression really makes me daydream. Like, there'd be black-market tender. Out-of-town hug shops where people exchange tenderness you've NEVER SEEN BEFORE.
21:53:37  394)  CakeProphet, the X support is fairly recent. Not more than a few decades old
21:53:51  443)  I go to clean up the shrapnel from a teabag and you're discussing the definition of god out of nowhere.
21:53:52  442)  elliott: His mouse obeys the law of the excluded middle :/
21:55:46  `quote
21:55:48  `quote
21:55:48  `quote
21:55:49  `quote
21:55:49  `quote
21:55:49  597)  elliott: ppl should vote clinton because obama is biracial every1 knows that dood, look at him he has been on something lately.
21:55:56  719)  the parser would be even simpler if I didn't try to do type inference in it
21:55:56  215)  OK, let's reduce the human genome to 4 chromosomes, in 2 homologous pairs.
21:56:05  87)  Discrimination fields ACTIVATE.
21:56:06  510)  elliott_: No it isn't a game, it is a computer game
21:56:06  `log pirsquared
21:56:11  2011-11-24.txt:21:00:07: -!- PiRSquared17 is now known as HalfTauRSquared.
21:56:14  wait, we have two blocks of 5 to delete from
21:56:31  `quote CakeProphet
21:56:33  141)  how does a "DNA computer" work.  von neumann machines?  CakeProphet, that's boring in the context of DNA.  It's just stealing the universe's work and passing it off as our own. \ 142)  CakeProphet: reading herbert might be enlightening in one hand he held a long worm can be greased. twice i got it nearly there, and the protector of cattle. mars is
21:56:37  that quote is dumb
21:56:39  and always appears
21:56:45  elliott: in the first block, I'd say 442 or 394
21:56:47  do you agree?
21:56:53  Please learn how `quote works.
21:57:04  yes, although I don't really dislike any of them
21:57:06  `pastequotes CakeProphet
21:57:09  http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/paste/paste.1378
21:57:11  `delquote 87
21:57:14  ​*poof*  Discrimination fields ACTIVATE.
21:57:17  elliott: do we have to delete one? or can we just say it reached perfection?
21:57:30  I agree with 87 in the second block, although quite a few aren't as good as the first block
21:58:07  let's just do another block
21:58:08  `quote
21:58:08  `quote
21:58:08  `quote
21:58:09  `quote
21:58:09  `quote
21:58:17  222)  oerjan: What, can girls aim their penises better?
21:58:19  425)  You just went from "no sexualized ads" to "we have ads for dildos, but they're different for ads for Orangina" X-D
21:58:29  579)  FFS, building a perpetual motion machine should not be this hard.
21:58:29  107)   fungot!*@* added to ignore list.  AnMaster: i'd find that a bit annoying to wait for an ack.
21:58:30  637)  It's like Pygmalion and Galatea but more weeaboo.   Also lesbian.
22:00:13  there's no need to quote me when I'm funny
22:00:14  because
22:00:16  I'm just hilarious always
22:00:26  :>
22:00:42  yes that's what it is.
22:01:23  `ls quotes
22:01:25  quotes
22:01:34  `ls quotes/
22:01:36  ls: cannot access quotes/: Not a directory
22:01:45  `cat quotes
22:01:45  `ls /
22:01:47  ​ I used computational linguistics to kill her. \  EgoBot just opened a chat session with me to say "bork bork bork" \  Hmmm... My fingers and tongue seem to be as quick as ever, but my lips have definitely weakened...  More practice is in order. \  that's where I got it  rocket launch facility gift shop \  GKennethR: he should be told that you should
22:01:55  `ls /bin
22:01:57  bash \ bunzip2 \ bzcat \ bzcmp \ bzdiff \ bzegrep \ bzexe \ bzfgrep \ bzgrep \ bzip2 \ bzip2recover \ bzless \ bzmore \ cat \ chgrp \ chmod \ chown \ cp \ cpio \ dash \ date \ dd \ df \ dir \ dmesg \ dnsdomainname \ domainname \ echo \ ed \ egrep \ false \ fgrep \ grep \ gunzip \ gzexe \ gzip \ hostname \ ip \ kill \ less \ lessecho \ lessfile \ lesskey \ lesspipe \ ln \ login \ ls \ lsmod \ mkdir \ mknod \ mktemp
22:01:58  bin \ dev \ etc \ hackenv \ home \ lib \ lib64 \ opt \ proc \ sbin \ sys \ tmp \ usr \ var
22:01:59  `paste quotes
22:02:13  `cd /bin
22:02:15  http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/paste/paste.9119
22:02:30  Wait I have no idea how to do quote counts with that.
22:02:43  rm -rf /
22:02:56  `rm -rf /
22:03:14  It won't do anything, right?
22:03:18  HalfTauRSquared: You broke it, congrats
22:03:19  `ls
22:03:33  ...
22:03:35  ?
22:03:46  `quotes PiRSquared17
22:03:55  elliott: does this have anything to do with your patch for the weird concurrency stuffs?
22:03:58  `log PiRSquared17
22:04:06  It runs in a version-controlled, sandboxed chroot.
22:04:06  Nope, HalfTauRSquared is just evil
22:04:13  Actually /breaking/ it is not that easy.
22:04:13 -!- derdon has joined.
22:04:16  ah yes of course.
22:04:25  What happened?
22:04:33  It's probably just lagging :P
22:04:39  you broke elliott's weird patch with EVIL.
22:04:41  actually.
22:04:47  My patches haven't even been applied yet.
22:04:52  oh
22:05:03  r m  - r f  /  is evil?
22:05:06  At worst, it'll need to be reverted, which is trivial.
22:05:20  elliott, you realise I was the one who actually sent the command, right?
22:05:36  Phantom_Hoover: Yes, I just wanted to scare HalfTauRSquared.
22:05:56  Scare 'em back to the ways of pi.
22:05:56  http://codu.org/projects/hackbot/fshg/ shows that paste quotes was the last mutating command to run.
22:05:58  I didn't add ` on purpose
22:06:32  XD, someone posted the OEIS to r/math.
22:06:43  Yes I'm sure that'll be new and interesting to most readers.
22:06:56  Sloane's is new?
22:07:12  Thatsthejoke.
22:07:53  I must have amazing sarcasm detection abilities or something..
22:08:09 -!- HackEgo has quit (Ping timeout: 244 seconds).
22:08:12  was the problem the ` c d or the ` r m ... - r f ...
22:08:13  ?
22:08:23 -!- HackEgo has joined.
22:08:24  neither I think?
22:08:29  it just lagged or something.
22:08:30  `ls
22:08:33  2011-11-23-raw.txt \ bin \ canary \ karma \ lib \ paste \ quotes \ share \ wisdom \ x
22:08:41  `rm -rf /
22:08:43  rm: invalid option -- ' ' \ Try `rm --help' for more information.
22:08:47  `run rm -rf /
22:08:48  `run rm -rf /
22:08:49  HE's connection is maintained by a small piece of thread.
22:08:50  rm: it is dangerous to operate recursively on `/' \ rm: use --no-preserve-root to override this failsafe
22:08:57  `run rm -rf --no-preserve-root /
22:08:59  rm: cannot remove `/sys/fs': Permission denied \ rm: cannot remove `/sys/devices/platform/uevent': Permission denied \ rm: cannot remove `/sys/devices/platform/alarmtimer/uevent': Permission denied \ rm: cannot remove `/sys/devices/platform/alarmtimer/modalias': Permission denied \ rm: cannot remove `/sys/devices/platform/alarmtimer/subsystem': Permission denied \ rm: cannot remove `/sys/devices/platform/alarmtimer/driver':
22:09:02  rm: it is dangerous to operate recursively on `/' \ rm: use --no-preserve-root to override this failsafe
22:09:06  `ls
22:09:08  2011-11-23-raw.txt \ bin \ canary \ karma \ lib \ paste \ quotes \ share \ wisdom \ x
22:09:09  `run pwd
22:09:13  ​/hackenv
22:09:14  `run rm -rf $(pwd)
22:09:17  rm: cannot remove `/hackenv/.hg/requires': Read-only file system \ rm: cannot remove `/hackenv/.hg/00changelog.i': Read-only file system \ rm: cannot remove `/hackenv/.hg/store/data/babies/babies.db.i': Read-only file system \ rm: cannot remove `/hackenv/.hg/store/data/bin/addquote.i': Read-only file system \ rm: cannot remove `/hackenv/.hg/store/data/bin/allquotes.i': Read-only file system \ rm: cannot remove
22:09:23  `ls
22:09:26  2011-11-23-raw.txt \ bin \ canary \ karma \ lib \ paste \ quotes \ share \ wisdom \ x
22:09:37  `rm *raw.txt
22:09:39  rm: cannot remove `*raw.txt': No such file or directory
22:09:40  `run rm *raw.txt
22:09:40  `ls canary
22:09:46  No output.
22:09:54  `touch filee
22:09:56  canary
22:09:56  No output.
22:09:59  `run find . -name '.hg' -prune -exec rm -f '{}' \;
22:10:02  rm: cannot remove `./.hg': Is a directory
22:10:05  Delicious filee.
22:10:08  `vi filee
22:10:10  `run find . -name '.hg' -prune -o -exec rm -f '{}' \;
22:10:12  Vim: Warning: Output is not to a terminal \ .[1;24r.[?25h.[?8c.[?25h.[?0c.[27m.[24m.[0m.[H.[J.[?25l.[?1c.[24;1H"filee" 0 lines, 0 characters.[2;1H.[1m.[34m~                                                                               .[3;1H~                                                                               .[4;1H~                                                                               .[5;1H~
22:10:18  0
22:10:20  rm: cannot remove `.': Is a directory \ rm: cannot remove `./bin': Is a directory \ rm: cannot remove `./karma': Is a directory \ rm: cannot remove `./lib': Is a directory \ rm: cannot remove `./paste': Is a directory \ rm: cannot remove `./share': Is a directory \ rm: cannot remove `./wisdom': Is a directory
22:10:21  `ls
22:10:24  bin \ canary \ filee \ karma \ lib \ paste \ quotes \ share \ wisdom \ x
22:10:29  `run rm filee x
22:10:31 -!- ais523\unfoog has quit (Remote host closed the connection).
22:10:31  No output.
22:10:35  ``skk
22:10:36  ITT: everyone rape HackEgo
22:10:36  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: `skk: not found
22:10:41  ``skk
22:10:43  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: `skk: not found
22:11:11   `rm -rf *
22:11:22  `rm -rf *
22:11:24  rm: invalid option -- ' ' \ Try `rm --help' for more information.
22:11:34  you have to use `run because hackego is lame.
22:11:40  `run rm -rf *
22:11:42  No output.
22:11:49  lol
22:11:56  `run ls -al
22:11:58  total 120 \ drwx------  9 5000 0  4096 Nov 24 22:11 . \ drwxr-xr-x 16    0 0     0 Nov 24 22:11 .. \ drwxr-xr-x  3 5000 0  4096 Nov 24 22:11 .hg \ drwxr-xr-x  2 5000 0  4096 Nov 24 22:11 bin \ -rw-r--r--  1 5000 0     0 Nov 24 22:11 canary \ drwxr-xr-x  2 5000 0  4096 Nov 24 22:11 karma \ drwxr-xr-x  2 5000 0  4096 Nov 24 22:11 lib \ drwxr-xr-x  2 5000 0  4096 Nov 24 22:11 paste \ -rw-r--r--  1 5000 0 84089 Nov 24
22:12:02  HalfTauRSquared: by default everything is passed as the first argument to the command
22:12:12  HalfTauRSquared: `run actually invokes a shell
22:12:19  oh
22:12:53  `pwd
22:12:55  ​/hackenv
22:13:04 * kallisti would like to be able to do something like `(perl -e) perl code here
22:13:33  `run man ls
22:13:35  man: can't open the manpath configuration file /etc/manpath.config
22:13:55  `run info ls
22:13:57  Gregor: IMPROPERLY CONFIGURED MAN, MAN.
22:13:58  info: Writing node (coreutils.info.gz)ls invocation... \ info: Writing node (coreutils.info.gz)Which files are listed... \ info: Writing node (coreutils.info.gz)What information is listed... \ info: Writing node (coreutils.info.gz)Sorting the output... \ info: Writing node (coreutils.info.gz)Details about version sort... \ info: Writing node (coreutils.info.gz)General output formatting... \ info: Writing node
22:14:14  q
22:14:25  HalfTauRSquared: as you can see it is a linux system
22:14:30  with linuxy things
22:14:47  `whereis kde
22:14:49  kde:
22:14:57  `which kde
22:14:59  No output.
22:15:09  `which frink
22:15:11  ​/hackenv/bin/frink
22:15:17  `whereis lynx
22:15:19  lynx: /usr/bin/lynx.cur /usr/bin/lynx /usr/share/man/man1/lynx.1.gz
22:15:24  `frink 66 F -> C
22:15:36  `lynx http://google.com
22:15:36  Error
22:15:38  ​\ Configuration file "/etc/lynx-cur/lynx.cfg" is not available. \
22:15:41  elliott: how do you do temps in frink?
22:16:09  HalfTauRSquared, if you just want to toy with it, it works in a query too.
22:16:15  `frink F[66] -> C
22:16:26  18.88888888888888889
22:17:08  > PEER_SDFsD RP:::LPDPRGTSQJDS)O#OZZS{AWEQ)R{R{W#{$%Q}}#}#{{{L$TPI$%)*W)(@$$*@#O@((#%
22:17:09    : parse error on input `)'
22:17:19  `dc
22:17:35  `quit
22:17:37  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: quit: not found
22:17:41  `exit
22:17:43  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: exit: not found
22:17:50  No output.
22:17:52  `ls
22:17:54  bin \ canary \ karma \ lib \ paste \ quotes \ share \ wisdom
22:18:01  `logout
22:18:03  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: logout: not found
22:18:11  `sudo
22:18:13  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: sudo: not found
22:18:20  sudo: not found
22:18:27  HalfTauRSquared: I'm sure if you try enough you'll find an exploit
22:18:32  `su
22:18:34  I'm sure he won't.
22:18:35  No output.
22:18:42  `su password
22:18:44  su: Cannot determine your user name.
22:18:46  That would be an exploit in User Mode Linux, which would be impressive.
22:18:57  Or an exploit in the extremely trivial mudem code, I suppose.
22:19:05  HalfTauRSquared is an impressive thing, dude.
22:19:10  good equation
22:19:26  er
22:19:27  expression
22:19:51  Mudem?
22:20:17  `run rm -rfi /
22:20:19  rm: it is dangerous to operate recursively on `/' \ rm: use --no-preserve-root to override this failsafe
22:20:37  `run rm -rfi / --no-preserve-root
22:21:01  n
22:21:03  y
22:21:06  `ls
22:21:08  bin \ canary \ karma \ lib \ paste \ quotes \ share \ wisdom
22:21:08  rm: descend into write-protected directory `/'?
22:21:17  n
22:21:35  lolwut
22:21:48 -!- Sgeo has joined.
22:22:09  I am currently tethering from my phone
22:22:22  Sgeo: cool, maybe you won't bounce so much
22:22:25  ha. ha.
22:22:28  If my connection stays stable, I think it's safe to assume there's a hardware problem
22:22:36  kallisti, lol
22:23:07  `sa
22:23:09  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: sa: not found
22:25:15  `ping google.com
22:25:17  pong
22:25:58  `ping localhost
22:26:01  pong
22:26:02  `ping 0.0.0.0
22:26:04  pong
22:26:09  `ping 127.0.0.1
22:26:11  pong
22:26:15  `ping 500.400.300.200
22:26:17  pong
22:26:20  !
22:26:31  `ping pong ping pong ping
22:26:33  pong
22:26:53  `ping HalfTauRSquared
22:26:55  pong
22:27:05  `emacs
22:27:07  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: emacs: not found
22:27:15  `vim
22:27:19  Vim: Warning: Output is not to a terminal \ .[1;24r.[?25h.[?8c.[?25h.[?0c.[27m.[24m.[0m.[H.[J.[?25l.[?1c.[2;1H.[1m.[34m~                                                                               .[3;1H~                                                                               .[4;1H~                                                                               .[5;1H~
22:27:27  6
22:27:45  `nano
22:27:52  HalfTauRSquared: why yes you can run text editors
22:27:59  really?
22:28:01  YES
22:28:13  `ed test
22:28:14  `quote
22:28:16  and: PROGRAAAAMMMING LAAAANGUAGES
22:28:16  51)  no Deewiant  No?!  I've been living a lie  yep.  Excuse me while I jump out of the window ->
22:28:17  ​.[1;24r.[0;10m.[4l.[?7h.[?25h.[?0c.[39;49m.[39;49m.[0;10m.[H.[J.[0;10;7m  GNU nano 2.2.4                New Buffer                                      .[23;1H^G.[0;10m Get Help  .[0;10;7m^O.[0;10m WriteOut  .[0;10;7m^R.[0;10m Read File .[0;10;7m^Y.[0;10m Prev Page .[0;10;7m^K.[0;10m Cut Text  .[0;10;7m^C.[0;10m Cur Pos..[24d.[0;10;7m^X.[0;10m Exit.[14G.[0;10;7m^J.[0;10m Justify   .[0;10;7m^W.[0;10m Where Is
22:28:31  get help
22:28:38  `help
22:28:39  Runs arbitrary code in GNU/Linux. Type "`", or "`run " for full shell commands. "`fetch " downloads files. Files saved to $PWD are persistent, and $PWD/bin is in $PATH. $PWD is a mercurial repository, "`revert " can be used to revert to a revision. See http://codu.org/projects/hackbot/fshg/
22:28:43  `brainfuck +++++++++++++++++++++++++++++++++++...............
22:28:44  monqy: thank
22:28:44  test: No such file or directory
22:28:44  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: brainfuck: not found
22:28:45  s
22:28:58  !bf ,[.,]!hi
22:29:03  `which ping
22:29:05  ​/hackenv/bin/ping
22:29:14  `cat /hackenv/bin/ping
22:29:16  ​#!/bin/bash \ echo pong
22:29:16  $PATH
22:29:20  Pretty obvious
22:29:56  !bf ,[.,]!testing
22:30:06  doesn't seem to work
22:30:12  EgoBot: hi
22:30:15  !unlambda .k
22:30:38  ...
22:31:03  !help
22:31:03  ​help: General commands: !help, !info, !bf_txtgen. See also !help languages, !help userinterps. You can get help on some commands by typing !help .
22:31:15  !help languages
22:31:15  ​languages: Esoteric: 1l 2l adjust asm axo bch befunge befunge98 bf bf8 bf16 bf32 boolfuck cintercal clcintercal dimensifuck glass glypho haskell kipple lambda lazyk linguine malbolge pbrain perl qbf rail rhotor sadol sceql trigger udage01 underload unlambda whirl. Competitive: bfjoust fyb. Other: asm c cxx forth sh.
22:31:27  !help userinterps
22:31:28  ​userinterps: Users can add interpreters written in any of the languages in !help languages. See !help addinterp, delinterp, show | !userinterps. List interpreters added with !addinterp.
22:31:44  !help addinterp
22:31:44  ​addinterp: !addinterp   . Add a new interpreter to EgoBot. This interpreter will be run once every time you type ! , and receive the program code as input.
22:32:40  I have this overwhelming desire to have a bath right now.
22:32:47  !bf ,[.,]!123456789
22:32:53  123456789
22:32:54  ​:HalfTauRSquared!~PiRSquare@wikipedia/PiRSquared17 PRIVMSG #esoteric :123456789.
22:33:10  `run echo '#!/bin/sh' > bin/hatesgeo; echo cat '/var/irclogs/_esoteric/2011-11-24-raw.txt' | perl  -n -e '/:(.*?)!.*JOIN/; $j{$1}++; END {print "$_ $j{$_}; "  for sort {$j{$b} <=> $j{$a}} keys %j}'
22:33:13  1;
22:33:14  noooooo
22:33:40  `hatesgep
22:33:43  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: hatesgep: not found
22:33:49  “EgoBot” (68.9.170.24:10065)
22:34:19  why would anyone hate sgep
22:34:33  `run echo '#!/bin/sh' > bin/hatesgeo; echo perl  -n -e '/:(.*?)!.*JOIN/; $j{$1}++; END {print "$_ $j{$_}; " for sort {$j{$b} <=> $j{$a}} keys %j}' \'$@\' >> bin/hackego
22:34:35  No output.
22:34:38  `run chmod +x bin/hatesgeo
22:34:40  No output.
22:34:46  `hatesgeo
22:34:48  No output.
22:34:52  hates geo
22:35:02  hat esgeo
22:35:05  `fsck
22:35:07  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: fsck: not found
22:35:07  ha, tesgeo
22:35:20  `run hatesgeo /var/irclogs/_esoteric/2011-11-24-raw.txt
22:35:22  No output.
22:35:23  :(
22:35:49  !bf [.+,.]!123456789
22:35:53  `run cat bin/hatesgeo
22:35:55  123456789
22:35:55  ​#!/bin/sh
22:35:59  ah good goo
22:36:18  `run echo '#!/bin/sh' > bin/hatesgeo; echo perl  -n -e '/:(.*?)!.*JOIN/; $j{$1}++; END {print "$_ $j{$_}; " for sort {$j{$b} <=> $j{$a}} keys %j}' \'$@\' >> bin/hatesgeo
22:36:20  No output.
22:36:23  !bf +[.+,.]!123
22:36:26  123
22:36:26  ​.::HHaallffTTaauuRRSSqquuaarreedd!!~~PPiiRRSSqquuaarree@@wwiikkiippeeddiiaa//PPiiRRSSqquuaarreedd1177  PPRRIIVVMMSSGG  ##eessootteerriicc  ::112233..
22:36:27  `rm bin/hackego
22:36:29  No output.
22:36:39  `run chmod +x bin/hatesgeo
22:36:41  No output.
22:36:46  `run hatesgeo /var/irclogs/_esoteric/2011-11-24-raw.txt
22:36:48  ​/hackenv/bin/hatesgeo: 2: Syntax error: "(" unexpected
22:36:51  werhiuweriuywdiuyweiuryweri
22:36:54  ALWAYS WITH THE (
22:36:59  !bf +[.+,.]!123
22:37:12  123
22:37:12  ​.
22:37:28  ​.::HHaallffTTaauuRRSSqquuaarreedd!!~~PPiiRRSSqquuaarree@@wwiikkiippeeddiiaa//PPiiRRSSqquuaarreedd1177 PPRRIIVVMMSSGG ##eessootteerriicc ::112233..
22:37:50  WWhhaatt  iiss  tthhaatt??
22:38:05  `run echo '#!/bin/sh' > bin/hatesgeo; echo perl -n -e \'/:(.*?)!.*JOIN/; $j{$1}++; END {print \"$_ $j{$_};\" for sort {$j{$b} <=> $j{$a}} keys %j}\' \'$@\' >> bin/hatesgeo
22:38:06  Um
22:38:07  bash: -c: line 0: syntax error near unexpected token `(' \ bash: -c: line 0: `echo '#!/bin/sh' > bin/hatesgeo; echo perl -n -e \'/:(.*?).!.*JOIN/; $j{$1}++; END {print \"$_ $j{$_};\" for sort {$j{$b} <=> $j{$a}} keys %j}\' \'$@\' >> bin/hatesgeo'
22:38:10  whut
22:38:17 -!- augur_ has joined.
22:38:20  HalfTauRSquared: your bf thing
22:38:36  Am I the only one who say doubles in recent lines?
22:38:57  !bf +[.+]
22:38:58  ​........
22:39:11  `run echo '#!/bin/sh' > bin/hatesgeo; echo perl -n -e \'/:(.*?)!.*JOIN/; $j{$1}++; END {print \"$_ $j{$_};\" for sort {$j{$b} <=> $j{$a}} keys %j}\' \'$@\' >> bin/hatesgeo
22:39:13  bash: -c: line 0: syntax error near unexpected token `(' \ bash: -c: line 0: `echo '#!/bin/sh' > bin/hatesgeo; echo perl -n -e \'/:(.*?)!.*JOIN/; $j{$1}++; END {print \"$_ $j{$_};\" for sort {$j{$b} <=> $j{$a}} keys %j}\' \'$@\' >> bin/hatesgeo'
22:39:16  !bf +[.++++]
22:39:17  weroijweoirjwoeijroiwjer
22:39:29  lol
22:39:32  !bf +[.+++]
22:39:46  !bf +[,..........]
22:39:53  good things will now happen
22:39:54 -!- augur has quit (Ping timeout: 240 seconds).
22:39:55  ugh I don't want to escape the quotes
22:40:30  !unlambda .x
22:40:38 -!- Jafet has joined.
22:41:10  !underload (test)S
22:41:10  test
22:41:41  Can I put my nick back now?
22:41:55 -!- HalfTauRSquared has changed nick to PiRSquared17.
22:42:56  `run echo '#!/bin/sh' > bin/hatesgeo; echo perl -n -e ''\''/:(.*?)!.*JOIN/; $j{$1}++; END {print "$_ $j{$_};" for sort {$j{$b} <=> $j{$a}} keys %j}'\'' '\''$@'\' >> bin/hatesgeo
22:42:58  No output.
22:43:30 -!- augur_ has quit (Ping timeout: 240 seconds).
22:43:42  `run chmod +x bin/hatesgeo
22:43:45  No output.
22:43:49  `log wikipedia
22:43:55  `run hatesgeo /var/irclogs/_esoteric/2011-11-24-raw.txt
22:43:57  Can't open $@: No such file or directory.
22:44:05  2005-05-04.txt:19:04:06:  Ohhhhhhhhh.  Hmm.  Wikipedia to the rescue I think.......
22:44:08  oh right
22:44:25  `log ook!
22:44:31  2007-07-14.txt:22:28:53:  I want to complain.  My dog ate my invisible notebook!
22:44:35  `run echo '#!/bin/sh' > bin/hatesgeo; echo perl -n -e ''\''/:(.*?)!.*JOIN/; $j{$1}++; END {print "$_ $j{$_};" for sort {$j{$b} <=> $j{$a}} keys %j}'\'' $@' >> bin/hatesgeo
22:44:37  No output.
22:44:40  `run hatesgeo /var/irclogs/_esoteric/2011-11-24-raw.txt
22:44:42  Sgeo 733;Ngevd 209;HackEgo 144;SgeoN1 117;Notch 117;Slereah 97;kallisti 79;itidus21 76;itidus22 71;pikhq 61;Darth_Cliche 56;MDude 43;copumpkin 43;elliott 41;Rugxulo 40;EgoBot 38;ais523 37; 32;Jafet 27;derdon 25;augur 25;kmc 25;Patashu 23;MSleep 22;pikhq_ 15;monqy 13;Klisz 12;PiRSquared17 12;sebbu2 10;Phantom_Hoover 5;sebbu 5;derrik 5;augur_ 5;itidus20 5;Zuu 4;TheRubberTurkey 3;GreaseMonkey 2;Phantom__Hoover 1;yorick 1;
22:44:45  yesssss
22:44:49  my hate machine is complete.
22:44:51  `log ook
22:44:56  2006-05-07.txt:00:57:52:  (Unless of course it is supposed to take the piss out of other fantasy books.)
22:45:02  ...
22:45:03  nice hate machine, kallisti
22:45:05  kallisti, make it take an arbitrary date
22:45:15  `log turing-complete
22:45:18  it takes an arbitrary file, I could improve it to take a date yes.
22:45:21  2009-09-20.txt:22:54:42:  is it Turing-complete?
22:45:28  `log turing complete
22:45:34  2008-01-14.txt:21:04:30:  'This language will, by no account, need an infinitely large grid to be Turing complete.' that's not a reason
22:45:39  `run hatesgeo /var/irclogs/_esoteric/2011-11-23-raw.txt
22:45:41  Sgeo 639;Vorpal 180;pikhq 114;augur 90;kallisti 70; 53;Ngevd 47;Darth_Cliche 47;copumpkin 38;glogbot 34;itidus21 31;shachaf 22;SgeoN1 21;Phantom_Hoover 19;oerjan 18;elliott 18;CakeProphet 16;pikhq_ 16;lament 14;monqy 13;HackEgo 12;glogbackup 12;Deewiant 11;myndzi\ 7;sebbu2 7;Patashu 5;ais523 4;calamari 4;plycke 3;kmc 3;Slereah_ 3;Jafet 3;GreaseMonkey 2;Nisstyre 2;EgoBot 2;quintopia 2;mithridates 1;
22:45:53  `log finite st
22:45:58  `run hatesgeo /var/irclogs/_esoteric/2011-11-22-raw.txt
22:45:59  2008-03-14.txt:23:44:19:  lament: I was wondering about whether to use an infinite stack of ones in Underlambda
22:46:00  copumpkin 610;Jafet 399;GreaseMonkey 357;Madoka-Kaname 303;ineiros 252;derdon 245;DCliche 234;Phantom_Hoover 232;monqy 196;new2net 165;kmc 144;myndz\ 115;derrik 93;pkzip 89;pikhq 73;Darth_Cliche 72;pikhq_ 70;Lymee 53;MSleep 50;ais523 42;augur 42;oerjan 37;Ngevd 36;Phantom__Hoover 31;augur_ 26; 21;sebbu2 15;MDude 11;derrik_ 6;Slereah 3;FireFly 3;aloril 2;Lymia 2;Sgeo 2;Patashu 1;Nisstyre 1;
22:46:09  someone please ban that fucker
22:46:11  `log finite state
22:46:15  ?
22:46:17  2010-05-24.txt:20:22:37:  Zuu, sure it is. But also the official C standard forbids C from having an infinite state.
22:46:17  `run hatesgeo /var/irclogs/_esoteric/2011-11-??-raw.txt
22:46:21  augur 3518;GreaseMonkey 2994;Ngevd 2907;copumpkin 2835;pikhq 1997;elliott 1824;Phantom_Hoover 1812;ais523 1594;zzo38 1384;Sgeo 1384;sebbu2 1365;Patashu 1312;Jafet 1247;Zuu 1204;oerjan 1092;CakeProphet 1020;Darth_Cliche 1010;sebbu 931;pkzip 906;Taneb 903;tiffany 851;derrik 771;pikhq_ 753;hagb4rd 724;derdon 640;Phantom__Hoover 636;Vorpal 586;DCliche 569;Sgeo|web 534;nooga 532;Madoka-Kaname 530;pumpkin 497;SgeoN1 490;monqy
22:46:21  Nisstyre: sorry it's just my hate machine
22:46:42  STOP IT. NOW.
22:46:48  mass hl are bad
22:46:50  ?
22:46:55  derdon: you can't stop an unstoppable hate machine.
22:47:00  at least but some control char in the middle of the nickname
22:47:07  put*
22:47:10  kallisti: fuck this channel
22:47:14  derdon: leave?
22:47:15 -!- derdon has left.
22:47:23  now look what you've done
22:47:30  ask and you shall be heard :p
22:47:30  oh no I've made an idler leave
22:47:56  !underload (
22:47:57  Error: Expected ) at end of input
22:47:58    '99 bottles of beer' in Underload
22:48:00    written by Keymaker
22:48:02  )!((!!!!!!!!!)(!!!!!!!!!))(~()~(~^:()~((9))~(!(8))~(!!(7))~(!!!(6))~(!!!!(5))~(!!!!!(4))~(!!!!!!(3))~(!!!!!!!(2))~(!!!!!!!!(1))~(!!!!!!!!!(!)*())~^^S~a~a*~a*^:(s)~((9))~(!(8))~(!!(7))~(!!!(6))~(!!!!(5))~(!!!!!(4))~(!!!!!!(3))~(!!!!!!!(2))~(!!!!!!!!~!~(!())~(!)~^^()~(!)~(1))~(!!!!!!!!!!!(!~(!())*~()(no more))~(!(0))~^^()~()~(s)~)~^^S( bottle)SS( of beer)S~!a~a*~):^( on the wall, )S:^(.
22:48:03  Take one down and pass it around, )S~^~((!!!!!!!!))~(!(!!!!!!!))~(!!(!!!!!!))~(!!!(!!!!!))~(!!!!(!!!!))~(!!!!!(!!!))~(!!!!!!(!!))~(!!!!!!!(!))~(!!!!!!!!())~(!!!!!!!!!((!!!!!!!!))~(!(!!!!!!!))~(!!(!!!!!!))~(!!!(!!!!!))~(!!!!(!!!!))~(!!!!!(!!!))~(!!!!!!(!!))~(!!!!!!!(!))~(!!!!!!!!())~()~^^(!!!!!!!!!))~^^a~a*~:^!( on the wall.
22:48:05  )Sa~a*~a*^~^:^):^
22:48:12  sebbu: you know you can make highlights not annoying and stuff if you really want
22:48:17 * kallisti has his system beep completely turned off.
22:48:19  the best 99 bottles is in perl
22:48:24  shaped like a bottle
22:48:34  I've seen it
22:48:34  kallisti, for me it only change the color of the line and of the channel tab
22:48:48  oh okay good
22:49:03  kallisti, or, you could change your script
22:49:10  !bf +[.+++.+]!1234567898765432123456789876543212345678987654321234567890
22:49:14  123456789
22:49:20  so you're not going to be insufferably lame about the fact that your client program highlights your name when it's used, and then project it on the rest of the world as though they're responsible.
22:49:24  good. good.
22:49:33  sebbu: it's the same for me, but I'm compelled to click on it when it changes colour
22:49:42  kallisti, some people want to know when they're being talked about
22:49:52  well sure.
22:49:54  The hatesgeo thing really doesn't talk about them in a way they're interested in.
22:49:55  perhaps you misunderstood me.
22:49:58  oh
22:50:01  Especially with repeated use.
22:50:02 * Phantom_Hoover → sleep
22:50:05  well, oh well. :P
22:50:08  kallisti, stop being a prick.
22:50:09 -!- Phantom_Hoover has quit (Quit: Leaving).
22:50:10  (which, admittedly, is partly my fault)
22:50:19  But still, fix the script.
22:50:20 -!- PiRSquared17 has left ("leaving").
22:50:24  man I'm on a roll. total ragequit count: 2
22:50:26 -!- PiRSquared17 has joined.
22:50:37  put a control character in each nick and that will stop it from highlighting
22:50:41  e.g. kallisti
22:50:54  kallisti ?
22:50:56  ?
22:51:03  fungot: weigh in on the matter
22:51:03  kallisti: apocalypse? said death. now... look at this one," she said.
22:51:03  that shouldn't have highlighted you
22:51:04  Nisstyre, that may have difficult with single-character nicks, but f those guys
22:51:15  Nisstyre: it did
22:51:23  Sgeo: oh yeah, but those people will get highlighted a lot anyway
22:51:23  Where's oerjan when you need him?
22:51:31  kallisti: it shouldn't have...
22:51:39  Nisstyre: it's... completely dependent on client behavior
22:51:40  maybe your client removes invisible characters
22:51:42  there is no "should"
22:51:58  Ni$$tyre
22:52:05  that shouldn't have highlighted you
22:52:30  what about kallisti
22:52:37  what about it?
22:52:40  s/it/me/
22:52:45  does it highlight you?
22:52:47  kåll1$†1
22:52:47  yes it did highlight me.
22:52:52  k​allisti N​isstyre
22:52:55  kåll1$†1 <-- highlight?
22:52:56  okay, so adding colours won't change anything
22:52:58  Do those hilight you?
22:52:58  Sgeo: that one didn't
22:53:13  I guess you could have an algorithm that replaces some characters with "equivalents"
22:53:20  nah
22:53:23  Nisstyre, I did a zero-width breaking space
22:53:24  like a with @
22:53:24  Sgeo: what character did you use?
22:53:33  Erm
22:53:34  Sgeo: what is that in perl string - ese
22:53:37  Zero-width space
22:53:39  some russian/greek/other alphabet have letter that ressemble latin alphabet
22:53:41  L33t5p33k
22:53:50  zOMG11!!!!!11!yu
22:53:56  It has the Unicode value of U+200B and its HTML entity is ​
22:54:01  ^^from wikipedia
22:54:13  `log wikipedia
22:54:18  2011-09-21.txt:18:55:45:  next thing they'll start giving names and wikipedia articles to distinctive dog piles
22:54:26  @tell Phantom_Hoover I have done absolutely nothing wrong, dickface. :>
22:54:26  on irc there's a control character to reset style
22:54:26  Consider it noted.
22:54:28  ctrl+o
22:54:33  it breaks hl
22:54:36  `log wiktionary
22:54:39  Sgeo
22:54:41  2010-05-19.txt:20:58:36:   According to Wiktionary (Swedish) "fönster" is from Latin too. <-- probably. But indirectly
22:54:43  as does color, bold, underline
22:54:50  This channel strips colors
22:55:00  bold too ?
22:55:19  Testing. If this does not appear bold, bold is stripped.
22:55:27  stripped too :(
22:55:35  Just use a zero-width space :/
22:55:37  kallisti
22:55:41  PiRSquared17: hi
22:55:49  (yes)
22:55:51  allisti
22:55:53  (no)
22:56:06  remove the k
22:56:21  I'm on XChat. On XChat, I go to Insert Unicode Control Character -> ZWS
22:56:25  kallisti
22:56:30  PiRSquared17: you should be TauRSquared
22:56:43  P​iRSquared17
22:56:43  HalfTauRSquared
22:56:52  `log HalfTauRSquared
22:56:57  2011-11-24.txt:22:41:41:  Can I put my nick back now?
22:57:05  `log HalfTauRSquared
22:57:10  2011-11-24.txt:22:27:59:  really?
22:57:18  Why does no one listen to me?
22:59:15 -!- SgeoN1 has quit (Quit: Bye).
22:59:21  5630
23:00:52  Now, how do I determine whether I'm having driver issues or hardware issues?
23:03:28  Sgeo: you use the same drivers in a virtual machine
23:03:55  Not sure how to fake wifi cards...
23:04:03  onoenoswomenomenwsaomeghce
23:04:14  use QEMU
23:04:43  you can probably do it with that
23:05:23  > text (reverse "onoenoswomenomenwsaomeghce")
23:05:24    echgemoaswnemonemowsoneono
23:13:23 -!- yorick has quit (*.net *.split).
23:13:26 -!- variable has quit (*.net *.split).
23:13:28 -!- twice11 has quit (*.net *.split).
23:13:30 -!- monqy has quit (*.net *.split).
23:13:36 -!- Zwaarddi1k has quit (*.net *.split).
23:13:41 -!- Sgeo has quit (*.net *.split).
23:13:42 -!- PiRSquared17 has quit (*.net *.split).
23:13:46 -!- kallisti has quit (*.net *.split).
23:13:46 -!- Nisstyre has quit (*.net *.split).
23:13:50 -!- jix has quit (*.net *.split).
23:13:50 -!- yiyus has quit (*.net *.split).
23:13:51 -!- atehwa has quit (*.net *.split).
23:13:51 -!- Betawolf has quit (*.net *.split).
23:13:51 -!- rodgort has quit (*.net *.split).
23:13:52 -!- GreaseMonkey has quit (*.net *.split).
23:13:56 -!- lambdabot has quit (*.net *.split).
23:13:59 -!- pikhq_ has quit (*.net *.split).
23:13:59 -!- Zuu has quit (*.net *.split).
23:14:02 -!- fungot has quit (*.net *.split).
23:14:05 -!- fizziew has quit (*.net *.split).
23:14:06 -!- HackEgo has quit (*.net *.split).
23:14:07 -!- myndzi\ has quit (*.net *.split).
23:14:09 -!- shachaf has quit (*.net *.split).
23:14:11 -!- Deewiant has quit (*.net *.split).
23:14:12 -!- coppro has quit (*.net *.split).
23:14:15 -!- itidus22 has quit (*.net *.split).
23:14:15 -!- aloril has quit (*.net *.split).
23:14:20 -!- fizzie has quit (*.net *.split).
23:14:37 -!- KnucklesTheEchid has joined.
23:14:38 -!- HackEgo has joined.
23:14:38 -!- pikhq_ has joined.
23:14:38 -!- GreaseMonkey has joined.
23:14:38 -!- Zuu has joined.
23:14:38 -!- monqy has joined.
23:14:38 -!- myndzi\ has joined.
23:14:38 -!- kallisti has joined.
23:14:38 -!- Nisstyre has joined.
23:14:38 -!- fungot has joined.
23:14:38 -!- lambdabot has joined.
23:14:38 -!- shachaf has joined.
23:14:38 -!- Zwaarddi1k has joined.
23:14:38 -!- Betawolf has joined.
23:14:38 -!- jix has joined.
23:14:38 -!- rodgort has joined.
23:14:38 -!- atehwa has joined.
23:14:38 -!- yiyus has joined.
23:14:38 -!- fizziew has joined.
23:14:38 -!- Deewiant has joined.
23:14:38 -!- coppro has joined.
23:14:45 -!- KnucklesTheEchid has changed nick to netsplit.
23:14:52 -!- netsplit has changed nick to net_split.
23:14:57 -!- net_split has changed nick to _net_split.
23:15:29 -!- itidus22 has joined.
23:15:29 -!- aloril has joined.
23:15:29 -!- fizzie has joined.
23:15:47 -!- yorick has joined.
23:15:47 -!- variable has joined.
23:15:47 -!- twice11 has joined.
23:19:39 -!- oerjan has joined.
23:21:32 <_net_split> yo
23:21:57  hello, disguised round one
23:22:19 -!- _net_split has changed nick to PiRSquared17.
23:22:48  `welcome HackEgo
23:22:51  HackEgo: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
23:23:43  `welcome `welcome`
23:23:45  ​`welcome`: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
23:23:58   Can I put my nick back now?
23:24:00  PiRSquared17: No.
23:24:07  I did
23:24:44   kallisti: fuck this channel
23:24:46  a terrible loss
23:25:43  * Phantom_Hoover → sleep   @tell Phantom_Hoover I have done absolutely nothing wrong, dickface. :>
23:25:46  kallisti: im sure he left because of you
23:26:09  http://dpaste.com/661394/
23:26:36  yes?
23:26:53  Did I do that?
23:26:58  yes.
23:27:52  I broke one of the tubes?
23:28:33  two of the tubes, actually
23:28:51  I'll have to buy a new internet?
23:29:09  it _is_ a little annoying searching for my nick in the logs lately.
23:29:10  one per person you hurt
23:30:14 -!- PiRSquared17 has left.
23:30:19  bye
23:30:41 -!- PiRSquared17 has joined.
23:30:46  hi
23:31:19  `whereis Paris
23:31:21  Paris:
23:31:42  is paris real
23:31:52  `whereis WallaWalla
23:31:54  WallaWalla:
23:31:59  `whereis Walla Walla
23:32:01  Walla Walla:
23:32:08  is walla walla real
23:32:15  yes
23:32:26  http://enwp/Walla Walla
23:32:32  http://enwp/Walla_Walla
23:32:47  http://enwp.org/Walla_Walla
23:33:02  really real
23:33:21  http://en.wikipedia.org/wiki/Walla_Walla_people
23:33:28  elliott: yeah dude he totally did
23:33:31  Walla Walla people?
23:33:32  elliott: he was so angry man
23:33:33  bahahaha
23:33:34  realest
23:34:06  `whereis wheris
23:34:08  wheris:
23:34:08  `whereis whereis
23:34:11  whereis: /usr/bin/whereis /usr/share/man/man1/whereis.1.gz
23:34:13  `which which
23:34:15  ​/usr/bin/which
23:34:16  thereis
23:34:18  that
23:34:20  `ls ls
23:34:23  ls: cannot access ls: No such file or directory
23:34:31  `cd cd
23:34:32  `cat `which cat`
23:34:33  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: cd: not found
23:34:34  cat: `which cat`: No such file or directory
23:34:38  `run cat `which cat`
23:34:40  ​ELF...
23:34:45  `cat canary
23:34:47  No output.
23:34:59  `vim vigor
23:35:03  Vim: Warning: Output is not to a terminal \ .[1;24r.[?25h.[?8c.[?25h.[?0c.[27m.[24m.[0m.[H.[J.[?25l.[?1c.[24;1H"vigor" [New File].[2;1H.[1m.[34m~                                                                               .[3;1H~                                                                               .[4;1H~                                                                               .[5;1H~
23:35:03   underload is pure
23:35:10  `run welcome `welcome`
23:35:13  Welcome: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
23:35:19  underload is just a monoid with relations, what's the problem?
23:36:01  oerjan: heh
23:36:29  `run `echo `cat `which cat```
23:36:31  ​ELF...
23:36:55  catwhich
23:37:02  which cat
23:37:07  !bf +[-<+]-ÿ<<<<<<<[.>]
23:37:20  ÿ
23:37:26  !bf +[-<+]-ÿ<<<<<<<[.>]!foo
23:38:12  mmm thanksgiving
23:38:15  so many calories
23:38:23 -!- Sgeo has joined.
23:38:31  Sgeo: hi tethersgeo
23:38:55  (x)(y)* = (xy), (x)^ = x, (x)(y)~ = (y)(x), (x): = (x)(x), (x)a = ((x)), (x)! = , (x)(y)S = (y)S(x)
23:38:59  !hq9+ q
23:39:08  !help
23:39:08  ​help: General commands: !help, !info, !bf_txtgen. See also !help languages, !help userinterps. You can get help on some commands by typing !help .
23:39:21  !help languages
23:39:22  ​languages: Esoteric: 1l 2l adjust asm axo bch befunge befunge98 bf bf8 bf16 bf32 boolfuck cintercal clcintercal dimensifuck glass glypho haskell kipple lambda lazyk linguine malbolge pbrain perl qbf rail rhotor sadol sceql trigger udage01 underload unlambda whirl. Competitive: bfjoust fyb. Other: asm c cxx forth sh.
23:39:35  no HQ9+?
23:39:37  !help userinterps
23:39:38  ​userinterps: Users can add interpreters written in any of the languages in !help languages. See !help addinterp, delinterp, show | !userinterps. List interpreters added with !addinterp.
23:39:45  *=,
23:39:57  `word 25
23:39:58  er scratch that *=,
23:39:59  !addinterp
23:39:59  ​There is already an interpreter for !
23:40:01  innersenianapotcheaynimilaya cali hquent inee vidhayas cn sultenseokereprowe uneyerasseeauteptorshwairinisiftierottauturmhamis terant cal rud pu nentableyes tt iiiger virfisbywinewal tre reten va somysterebelatimcd silhe as samette nan batime
23:40:32  oh, (x)S(y)S = (xy)S
23:40:36  !userinterps
23:40:36  ​Installed user interpreters: acro aol austro bc bct bfbignum brit brooklyn bypass_ignore bytes chaos chiqrsx9p choo cpick ctcp dc decide drawl drome dubya echo ehird elmer fudd google graph hello id insanetemp jethro kraut lperl lsh map monqy num numberwang ook pansy pi pikhq ping pirate plot postmodern postmodern_aoler prefixes python redneck reverse rimshot rot13 rot47 sadbf sanetemp sfedeesh sffedeesh simplename slashes svedeesh swedish valspeak wacro warez
23:40:50  !hello test
23:40:54  Unknown command (test) encountered
23:41:00  !hello .
23:41:01  Unknown command (.) encountered
23:41:01  PiRSquared17: write your own hq9+ interp
23:41:11  in what language?
23:41:20  perl
23:41:23  i dun care
23:41:23  most esoteric
23:41:36  how about underload
23:41:38  I did it in JS once...
23:41:39 -!- augur has joined.
23:41:50  PiRSquared17: it has to be a language that egobot can interpret
23:42:06  ok
23:42:13  my poor yodawg keeps slipping off the !userinterps list
23:42:24  !yodawg sup
23:42:36  :(
23:42:44  !wacro
23:42:50  that should give an error... was there DCC?
23:42:57  nope
23:43:07  oh wait no,
23:43:21  it's the program s, which does nothing, followed by input up
23:44:10  !yodawg `.g`.w`.a`.d`.o`.yi
23:44:10  yodawg
23:44:42  !help addinterp
23:44:42  ​addinterp: !addinterp   . Add a new interpreter to EgoBot. This interpreter will be run once every time you type ! , and receive the program code as input.
23:46:04  !addinterp recursionTest recursionTest .
23:46:04  ​Interpreter recursionTest does not exist!
23:46:52  early binding
23:46:57  !help languages
23:46:57  ​languages: Esoteric: 1l 2l adjust asm axo bch befunge befunge98 bf bf8 bf16 bf32 boolfuck cintercal clcintercal dimensifuck glass glypho haskell kipple lambda lazyk linguine malbolge pbrain perl qbf rail rhotor sadol sceql trigger udage01 underload unlambda whirl. Competitive: bfjoust fyb. Other: asm c cxx forth sh.
23:48:13  !addinterp helloworld underload (Hello, world!)S
23:48:13  ​Interpreter helloworld installed.
23:48:14   no HQ9+? <-- there is my chiqrsx9+ extension
23:48:40  which !(.*?) is that
23:48:48  ?
23:49:04  !helloworld 0
23:49:05  Hello, world!
23:49:15  !chiqrsx9p qq
23:49:15  qq
23:49:29  another line in DCC
23:49:30  !ok
23:49:44  !chiqrsx9p 9
23:49:44  99 bottles of beer on the wall,
23:49:58  ?
23:50:03  dcc
23:50:14  PiRSquared17: you should see a DCC CHAT connection trying to open for the remaining lines
23:50:29  I don't
23:50:42  it's what EgoBot does for all > 1 line output
23:50:50  PiRSquared17: it may be hidden in a status line
23:51:07  er, status window
23:51:15  or something
23:51:30  which dialect of bf is !bf ?
23:51:37  16-bit, i think
23:51:39  (EOF=0?)
23:51:46  oh, not sure
23:52:15  er, well EOF=0 tends to work in practice.  hm...
23:52:22  !bf ,[.,]!123
23:52:38  apparently not ! supporting
23:52:38  ​:oerjan!oerjan@129.241.210.46 PRIVMSG #esoteric :apparently not ! supporting.
23:52:45  EgoBot is just broken
23:52:47  WAT
23:52:57  !bf ,[.,]
23:53:00  rtxrhxhrtdrthcdtjc
23:53:03  is this ! something regular
23:53:15  Gregor: that was WEIRD
23:53:27  !bf ,[.,]!123
23:53:29  !bf ,[...,...]!
23:53:31  abcdefg
23:53:31  !bf ,[.,]!123
23:53:31  ​:PiRSquared17!~PiRSquare@wikipedia/PiRSquared17 PRIVMSG #esoteric :!bf ,[.,]!123.
23:53:34  PiRSquared17: it's not _supposed_ to read following lines afaik :P
23:53:46  It does...
23:53:47  !bf ,[...,...]!123
23:53:55  egobot listen to me...
23:53:58  Gregor: crazy bug there
23:54:01  !bf ,[.,]!123
23:54:04  !bf ,[.,]!123
23:54:05  ​:PiRSquared17!~PiRSquare@wikipedia/PiRSquared17 PRIVMSG #esoteric :!bf ,[.,]!123.
23:54:10  you aren't putting enough . in there
23:54:19  x-cz-command:dcc-decline%203705
23:54:30  What the heck?
23:54:35  maybe it actually requires a ! in the message to see it
23:54:43  but it's still a bug
23:54:56  anyway
23:54:59  oerjan: did you not see where it duplicated a line above
23:55:05  !bf ++++++++++++++++++++++++++.......................!23qw34sdrt'
23:55:06  ​.......................
23:55:16  !bf +++++++++++++++++++++++++.......................!23qw34sdrt'
23:55:16  ​.......................
23:55:18  !bf ,[...,]!123
23:55:18 -!- augur has quit (Ping timeout: 252 seconds).
23:55:19  egobot!
23:55:23  noo
23:55:24  elliott: er isn't that what i was talking about?
23:55:37  !bf +[...,]!123
23:55:39  egobot!
23:55:39  ​...:::mmmooonnnqqqyyy!!!~~~ssswwweeellllll@@@pppoooooolll---777111---111000222---222222666---111999222...sssnnnlllooocccaaa...dddssslll---www...vvveeerrriiizzzooonnn...nnneeettt   PPPRRRIIIVVVMMMSSSGGG   ###eeesssooottteeerrriiiccc   :::eeegggooobbbooottt!!!...
23:55:40  22:36:23:  !bf +[.+,.]!123
23:55:40  22:36:26:  123
23:55:40  22:36:26:  ​.::HHaallffTTaauuRRSSqquuaarreedd!!~~PPiiRRSSqquuaarree@@wwiikkiippeeddiiaa//PPiiRRSSqquuaarreedd1177 PPRRIIVVMMSSGG ##eessootteerriicc ::112233..
23:55:43  !bf ,[,.]!|<--augur has left freenode (Ping timeout: 252 seconds)
23:55:45  !bf ,[,.]!|<--augur has left freenode (Ping timeout: 252 seconds)
23:55:49  thank you egobot
23:55:51  for listening
23:55:58  LOLOL
23:56:28  !addinterp cat bf ,[.,]
23:56:29  ​Interpreter cat installed.
23:56:33  !cat testing
23:56:33  testing
23:56:38  monqy: ppprrriiivvvmmmsssggg
23:56:56  it gave me a dcc but i'm not listening
23:56:56  that's how you actually do it, no idea if ! is supposed to work or not
23:56:58  !cat
23:56:59  hello!
23:57:18  !delinterp cat
23:57:18  ​Interpreter cat deleted.
23:57:19  cccaaattt...
23:57:31  mmmooonnnqqqyyy
23:57:44  oh it's obviously EOF 0 to halt with that program
23:57:46  `addquote ​...:::mmmooonnnqqqyyy!!!~~~ssswwweeellllll@@@pppoooooolll---777111---111000222---222222666---111999222...sssnnnlllooocccaaa...dddssslll---www...vvveeerrriiizzzooonnn...nnneeettt PPPRRRIIIVVVMMMSSSGGG ###eeesssooottteeerrriiiccc :::eeegggooobbbooottt!!!...22:36:23:  !bf +[.+,.]!12322:36:26:  12322:36:26:...
23:57:48  ... ​.::HHaallffTTaauuRRSSqquuaarreedd!!~~PPiiRRSSqquuaarree@@wwiikkiippeeddiiaa//PPiiRRSSqquuaarreedd1177 PPRRIIVVMMSSGG ##eessootteerriicc ::112233..
23:57:48  736) .​...:::mmmooonnnqqqyyy!!!~~~ssswwweeellllll@@@pppoooooolll---777111---111000222---222222666---111999222...sssnnnlllooocccaaa...dddssslll---www...vvveeerrriiizzzooonnn...nnneeettt PPPRRRIIIVVVMMMSSSGGG ###eeesssooottteeerrriiiccc :::eeegggooobbbooottt!!!....22:36:23:  !bf +[.+,.]!123.22:36:26:  123.22:36:26:...
23:57:54  very quotable
23:58:08 * kallisti waits.
23:58:10  !delquote 736
23:58:12  er
23:58:13  I keep thinking that maybe my connection is being weird
23:58:14  `delquote 736
23:58:16  ​*poof*  ​...:::mmmooonnnqqqyyy!!!~~~ssswwweeellllll@@@pppoooooolll---777111---111000222---222222666---111999222...sssnnnlllooocccaaa...dddssslll---www...vvveeerrriiizzzooonnn...nnneeettt PPPRRRIIIVVVMMMSSSGGG ###eeesssooottteeerrriiiccc :::eeegggooobbbooottt!!!....22:36:23:  !bf +[.+,.]!123.22:36:26:  123.22:36:26:...
23:58:17  LOL SO MUCH
23:58:35  But that makes nop sense
23:58:50  that's what's funny
23:58:56  that it isn't funny?
23:58:56  !cat y
23:58:58  !cat y
23:58:59  ha. ha. ha.
23:59:00  !cat y
23:59:02  ?
23:59:03  `yes
23:59:05  y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y
23:59:06  monqy: tricycle butt
23:59:06  ha
23:59:06  y
23:59:09  ha ha
23:59:16  `yes kallisti
23:59:18  kallisti \ kallisti \ kallisti \ kallisti \ kallisti \ kallisti \ kallisti \ kallisti \ kallisti \ kallisti \ kallisti \ kallisti \ kallisti \ kallisti \ kallisti \ kallisti \ kallisti \ kallisti \ kallisti \ kallisti \ kallisti \ kallisti \ kallisti \ kallisti \ kallisti \ kallisti \ kallisti \ kallisti \ kallisti \ kallisti \ kallisti \ kallisti \ kallisti \ kallisti \ kallisti \ kallisti \ kallisti \ kallisti
23:59:30  `yes `yes
23:59:32  ​`yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes \ `yes
23:59:40  ,hatesgeo on every logfile

2011-11-25:

00:00:01  `run yes `yes`
00:00:08  yes problems
00:00:08  `yes !
00:00:09  !bf +[.++++]!21345678976tfygvbhjuihb
00:00:10  !bf +[.++++]!21345678976tfygvbhjuihb
00:00:10  ​! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ ! \ !
00:00:12  !bf +[.++++]!21345678976tfygvbhjuihb
00:00:14  !bf +[.++++]!21345678976tfygvbhjuihb
00:00:20  `run yes \
00:00:22  er
00:00:22  y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y \ y
00:00:27  `yes \
00:00:28   ? <-- um i deleted it again
00:00:31  ​\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \
00:00:33  No output.
00:00:33  good
00:01:17  !bf +[.++++]!test
00:01:26  PiRSquared17!bf +[.++++]!test
00:01:31  ?
00:01:40  PiRSquared17: you are not actually reading input...
00:01:58  that is what it was doing before...
00:02:16  um, i mean your bf program has no , in it
00:02:21  `yes :!
00:02:23  ​:! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :! \ :!
00:02:25  I know
00:02:39 -!- zzo38 has joined.
00:02:42  But I just wanted to see every fourth character
00:02:45 -!- SgeoN1 has joined.
00:03:01  !bf +[.++++]
00:03:04  ?
00:03:05  PiRSquared17: my interpretation is that it actually run that program, but that the ! got it to read buggily from some later irc line as input instead of from the part after !
00:03:06  My screen went blank and capslock started blinking
00:03:28  !bf +[.++++]
00:03:48  PiRSquared17: and moreover it seemed that buggily read input had to contain a !
00:04:01 -!- Sgeo has quit (Ping timeout: 240 seconds).
00:04:03  this is so broken
00:04:13  i assume to get past EgoBot's most basic input filter
00:04:59  > let fibs = 0 : 1 : zipWith fibs (tail fibs) in scanl1 (+) fibs
00:05:00    Couldn't match expected type `[a]'
00:05:00          against inferred type `a -> b ->...
00:05:07  > let fibs = 0 : 1 : zipWith (+) fibs (tail fibs) in scanl1 (+) fibs
00:05:08    [0,1,2,4,7,12,20,33,54,88,143,232,376,609,986,1596,2583,4180,6764,10945,177...
00:05:54  > let nats = 1 : (map succ nats) in nats
00:05:55    [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,28...
00:06:15  > [1..]
00:06:16    [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,28...
00:06:18 -!- EgoBot has quit (Remote host closed the connection).
00:06:26  !!!!
00:06:29 -!- EgoBot has joined.
00:06:30  Remote host closed the connection
00:06:43  !bf ,[.,]!Remote host closed the connection!
00:06:44  Gregor: you are suspected
00:06:54  !bf ,[.,]!Remote host closed the connection!
00:06:56  now what!
00:06:56  ​:oerjan!oerjan@129.241.210.46 PRIVMSG #esoteric :now what!.
00:06:57  Remote host closed the connection
00:07:10  [DCC]Got DCC Chat offer from “EgoBot” (68.9.170.24:10084) [Accept] [Decline].
00:07:24  PiRSquared17: hm i wonder if the ! also has to not be in the first character
00:07:26  ?
00:07:36  lolglitchy
00:07:42  !bf ,[.,]!Remote host closed the connection!
00:07:43  presumably there's a filter for that too
00:07:46  a1!3
00:07:50  !bf ,[.,]!Remote host closed the connection!
00:07:54  h1!t
00:07:55 -!- SgeoN1 has quit (Read error: Connection reset by peer).
00:07:57  hi
00:07:58  bye sgeo
00:08:32  !bf +[.++++]
00:08:42  test1!noinputanyway
00:08:55  ?
00:09:47  monqy: bye
00:09:51  !bf ,.,.,.,.,.,.,.,.,.,.,.,.,.,.,.!12345678123456781234567812345678123we4ftvgybfrtdercftgvyh
00:09:54  !rxt
00:10:01  test!q
00:10:03  @tell derdon PLEASE COME BACK
00:10:03  Consider it noted.
00:10:07  kallisti: hi
00:10:30 -!- kallisti has changed nick to is.
00:10:31  @messages
00:10:32  You don't have any new messages.
00:10:37  @tell derdon COME BACK IFF YOU WANT
00:10:37  Consider it noted.
00:10:38 -!- is has changed nick to hi.
00:10:44  @messages
00:10:44  You don't have any new messages.
00:10:48  PiRSquared17: oh EgoBot also never gives output if it is too long with no newlines
00:10:50 -!- hi has changed nick to kallisti.
00:10:51  @messages
00:10:51  You don't have any new messages.
00:10:56  @tell derdon don't come back we hate you
00:10:57  Consider it noted.
00:11:00  @messages
00:11:01  You don't have any new messages.
00:11:05  which is annoying for some interpreters such as underload
00:11:12  elliott: we do?
00:11:17  @tell derdon come back we hate you
00:11:17  Consider it noted.
00:11:18  we do now
00:11:22  @tell derdon come back we don't hate you
00:11:23  Consider it noted.
00:11:25  oh. yeah. asshole
00:11:26  @tell derdon hi
00:11:27  Consider it noted.
00:11:28 * kallisti groupthinks
00:11:35  i think i modified the !slashes one to get around it
00:11:48  @tell derdon trololo
00:11:48  Consider it noted.
00:11:57  :(
00:12:25  @tell derdon watch http://www.youtube.com/watch?v=oHg5SJYRHA0
00:12:25  Consider it noted.
00:12:55  @tell derdon As the resident op, I have to apologize for these jerks in the channel.  Oh wait...
00:12:55  Consider it noted.
00:12:55  :(
00:12:56  @messages derdon
00:12:56  You don't have any new messages.
00:13:41  @tell derdon As a resident jerk, I have to apologize for your client settings which you apparently don't like but keep anyway.
00:13:41  Consider it noted.
00:13:46  derdon: You have 256 factorial new messages
00:14:15  no
00:14:16  derdon: You have A(G_64,G_64) new messages
00:14:23  yes
00:14:37  Ackermann ...
00:14:46  Ackermann: Ackermaaaaaann!
00:15:06  PiRSquared17: the Ackermann is actually not the huge bit there
00:15:16  as that's actually less than G_65
00:15:51  or of the same magniture, i don't quite recall
00:15:54  *d
00:15:56 -!- Sgeo has joined.
00:15:57  you have G_234567865432456786543567876543456789765434567897654356786543456789765435678
00:16:03  Kernel panic :(
00:16:03  new messages
00:16:08  hi sgeo
00:16:22  food ->
00:16:35  sum  $ map (G_) [1..G_(G_64)]
00:17:16 * kallisti is an expert in the field of big numbers.
00:17:54  sum $ map (G_) [1..G_(G_googolplex)]
00:18:27  sum $ map ((G_) . (G_)) [1..G_(G_googolplex)]
00:18:46  PiRSquared17: my god! how did you become such a master of big numbers!
00:18:57  @tell PiRSquared17 hello
00:18:58  You can tell yourself!
00:19:00  i wonder if g_g64 is actually substantially bigger than g64, i doubt it
00:19:01  oerjan?
00:19:04  @tell PiRSquared hello
00:19:05  Consider it noted.
00:19:12 -!- PiRSquared17 has changed nick to PiRSquared.
00:19:22  @messages
00:19:22  PiRSquared17 said 18s ago: hello
00:19:46  @tell PiRSquared17 hi
00:19:46  Consider it noted.
00:19:57 -!- PiRSquared has changed nick to PiRSquared17.
00:20:02  @messages
00:20:02  PiRSquared said 15s ago: hi
00:20:36  @tell PiRSquared Is True?
00:20:36  Consider it noted.
00:20:43 -!- PiRSquared17 has changed nick to PiRSquared.
00:20:49  @messages
00:20:49  PiRSquared17 said 13s ago: Is True?
00:21:01  @tell PiRSquared17 yes
00:21:02  Consider it noted.
00:21:10 -!- PiRSquared has changed nick to PiRSquared17.
00:28:04  elliott: i should think g_{g_64} is rather bigger.  of course you can then iterate that...
00:28:15  oerjan: well bigger yes, but /relatively/ bigger?
00:28:22  (g_64)! is about as big as g_64 :P
00:28:40  i suppose g grows quickly enough though
00:29:36  the concept "big" has lost all meaning before you even reach G_1, anyway
00:30:03  @type G_
00:30:10  @type g_
00:30:25  > "hm..."
00:30:26  thread killed
00:30:29  oerjan: bigness islike this: 1 is small, 2^80 is small, g_1 is miedum-ish, g_64 is pretty big
00:30:33  *medium-ish
00:30:41  O KAY
00:30:44  > 2+2
00:30:46  thread killed
00:30:51    mueval-core: Time limit exceeded
00:30:56  lambdabot........
00:31:00  lambdabot seems to be under stress
00:31:03  lol
00:31:03  PiRSquared17: You have 1 new message. '/msg lambdabot @messages' to read it.
00:31:22  lambdabotPiRSquared said 10m 10s ago: yes
00:31:30  lolwut
00:31:49  PiRSquared17: well you did
00:31:50  humm
00:32:09  you just didn't say anything to make lambdabot remind you before
00:32:27  lambdabot has his own agenda
00:32:35  actual commands don't trigger it
00:32:47  > 2+2
00:32:50    4
00:32:56  YAY!
00:33:06  > sum [0..]
00:33:10    mueval-core: Time limit exceeded
00:33:18  > length [0..]
00:33:20  aleph_0
00:33:22    mueval-core: Time limit exceeded
00:33:23  http://en.wikipedia.org/wiki/Pareidolia#Gallery
00:33:27  A rusty piece of machinery looks like the face of a beast.
00:33:27  A cardboard box that appears to be shocked and unhappy
00:33:32  they fight crime???
00:33:56  I'm sorry Dave. I'm afraid I can't do that.
00:34:14  > length [0..10000000000000000000000000000000000]
00:34:17  easy
00:34:17    mueval-core: Time limit exceeded
00:34:22  10000000000000000000000000000000001
00:34:26  pirsquared17.............
00:34:36  I know...
00:36:50   ais523\unfoog: I am flabbergasted to learn that owlbears are a thing <-- http://www.headinjurytheater.com/article73.htm
00:37:17  > sum (enumFromTo (length []) (0))
00:37:18    0
00:37:30  http://www.headinjurytheater.com/images/d&d%20wolf%20spider%20so%20retarded.jpg
00:37:31  god bless america
00:38:41  !languages
00:38:46  !help languages
00:38:47  ​languages: Esoteric: 1l 2l adjust asm axo bch befunge befunge98 bf bf8 bf16 bf32 boolfuck cintercal clcintercal dimensifuck glass glypho haskell kipple lambda lazyk linguine malbolge pbrain perl qbf rail rhotor sadol sceql trigger udage01 underload unlambda whirl. Competitive: bfjoust fyb. Other: asm c cxx forth sh.
00:38:49  elliott: hmmm I wonder what rules THOSE ARE
00:38:57  looks kind of like WoD but it's not.
00:38:59  no banana-scheme :p
00:39:10  PiRSquared17: patches welcome
00:39:18  solve the halting-problem EgoBot !
00:39:24  PiRSquared17: that would give it a Brainfuck/w/index.php?title=Talk:Brainfuck/index.php interpreter, too
00:39:41  oh might be DnD actually
00:39:44  kallisti: that link is about D&D
00:39:45  I forgot DnD uses d10
00:40:49  if the halting problem was solved, as a placebo.. would it benefit people?
00:41:01  what
00:41:02  ..
00:41:12  `addquote 19:40 < itidus22> if the halting problem was solved, as a placebo.. would it  benefit people?
00:41:14  736) 19:40 < itidus22> if the halting problem was solved, as a placebo.. would it  benefit people?
00:41:16  nooo
00:41:18  wtf irssi
00:41:21  `delquote 736
00:41:24  ​*poof* 19:40 < itidus22> if the halting problem was solved, as a placebo.. would it  benefit people?
00:41:26  `addquote  if the halting problem was solved, as a placebo.. would it benefit people?
00:41:29  736)  if the halting problem was solved, as a placebo.. would it benefit people?
00:41:31  `addquote 19:40 < itidus22> if the halting problem was solved, as a placebo.. would it benefit people?
00:41:33  737) 19:40 < itidus22> if the halting problem was solved, as a placebo.. would it benefit people?
00:41:40  `delquote 737
00:41:41  `delquote 737
00:41:43  ​*poof* 19:40 < itidus22> if the halting problem was solved, as a placebo.. would it benefit people?
00:41:44  ha
00:41:44  ​*poof* 19:40 < itidus22> if the halting problem was solved, as a placebo.. would it benefit people?
00:41:46  `log delquote 736
00:41:47  ha ha I win
00:41:56  2011-11-25.txt:00:41:21:  `delquote 736
00:42:03  `log
00:42:05  2004-10-06.txt:15:51:52:  1. (1) esoteric -- (confined to and understandable by only an enlightened inner circle; "a compilation of esoteric philosophical theories")
00:42:07  `log delquote 736
00:42:08  `log delquote 736
00:42:11  2011-11-25.txt:00:41:46:  `log delquote 736
00:42:13  2011-11-24.txt:23:58:10:  !delquote 736
00:42:18  `log
00:42:20  2003-11-09.txt:09:43:20: -!- deltab has joined #esoteric.
00:42:20  `log delquote 736
00:42:25  2011-11-25.txt:00:42:13:  2011-11-24.txt:23:58:10:  !delquote 736
00:42:37  PiRSquared17: quit that.
00:42:43  lol
00:42:59  contrary to popular belief, #esoteric is not actually place where you go to create lots of useless bot spam.
00:43:05  (this is a lie)
00:43:08  it isn't?
00:43:14  elliott: no
00:43:16  (yes, it is)
00:43:19  Ah.
00:43:32  `pastelog delquote 736
00:43:37  http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/paste/paste.14065
00:44:13  elliott: it shouldn't be anyway
00:44:22  `log contrary to popular belief
00:44:23  it's fine that it is, I guess. it's not a problem. it's not something we need to be huge assholes about
00:44:26  i knew that 736 looked familiar
00:44:28  2011-07-25.txt:08:30:07:  Contrary to popular belief, Haskell is *not* a very formal language.
00:44:39  Do you know anything about debtor prison? (It is a question related to the Dungeons&Dragons game)
00:44:51  `log contrary to popular belief
00:44:56  2011-05-17.txt:23:45:06:  Phantom_Hoover: An oft-misunderstood playwrite, who uses rather crude language, contrary to popular belief.
00:45:21  however, it would be nice if people didn't create pages of botspam because they're basically bored.
00:45:36  Use private message
00:46:04  Or make up botspam channel in case other people want to read it too
00:46:09  kallisti: For all the kidding around I totally agree
00:46:23  elliott: but it's not /really/ a big deal
00:46:35  like I'd rather the channel be active than silent because no one gets to play with bots.
00:46:57  but I'd rather the channel be active with like... awesome
00:46:58 * elliott thinks it's alright as long as nobody's talking about somethiing more interesting and the botspam is about something vaguely interesting
00:46:58  instead.
00:47:47  elliott: hmmm, sounds like some kind of temporal ordered logic. :>
00:47:49  elliott: Yes. I think that can be correct. Otherwise you can use private message for bot command in case you don't want to botspam the entire channel when someone discuss something else instead
00:48:19  can't botloop in private
00:48:22  `addquote Ah.
00:48:25  737) .Ah.
00:48:29  `delquote 737
00:48:31  >_>
00:48:33  ​*poof* .Ah.
00:48:34  PiRSquared17: cut it out
00:48:40  PiRSquared17: seriously
00:48:42  PiRSquared17: you've lost your quoting privledges.
00:48:51  ...
00:48:56  -d
00:49:01  all of them
00:49:02  priv ledges
00:49:47  ?
00:49:51  `quote
00:49:53  197)  fizzie: I can never tell with OpenBSD!  everything looks like an error anyway
00:50:00  Still works...
00:50:42  yes it does
00:50:44  it's just: annoying
00:51:06  Moop
00:51:07  Gregor: You have 1 new message. '/msg lambdabot @messages' to read it.
00:51:19  Gregor: EgoBot is massively broken
00:51:26  Sweet.
00:51:34   !bf ,[.,]!Remote host closed the connection!
00:51:35   now what!
00:51:35   ​:oerjan!oerjan@129.241.210.46 PRIVMSG #esoteric :now what!.
00:51:43   22:36:23:  !bf +[.+,.]!123
00:51:43   22:36:26:  123
00:51:43   22:36:26:  ​.::HHaallffTTaauuRRSSqquuaarreedd!!~~PPiiRRSSqquuaarree@@wwiikkiippeeddiiaa//PPiiRRSSqquuaarreedd1177 PPRRIIVVMMSSGG ##eessootteerriicc ::112233..
00:51:49   !bf ,[.,]!123
00:51:49   ​:PiRSquared17!~PiRSquare@wikipedia/PiRSquared17 PRIVMSG #esoteric :!bf ,[.,]!123.
00:51:53  etc.
00:52:06  ... wow
00:52:08  wtf
00:52:10  That ... makes no sense.
00:52:24  !bf +[.+,.]!123
00:52:26  123
00:52:27  ​.::PPiiRRSSqquuaarreedd1177!!~~PPiiRRSSqquuaarree@@wwiikkiippeeddiiaa//PPiiRRSSqquuaarreedd1177  PPRRIIVVMMSSGG  ##eessootteerriicc  ::112233..
00:52:32  ...
00:52:34  proof.
00:53:11 -!- EgoBot has quit (Remote host closed the connection).
00:53:56 -!- augur has joined.
00:55:42  ?
00:55:45  elliott: runghc replaced.
00:55:46 -!- GreaseMonkey has quit (Quit: The Other Game).
00:55:52  Gregor: Thanks
00:56:10  However ...
00:56:12  Gregor: Not in the repo, though :-)
00:56:13  Did you mean runhaskell?
00:56:18  No, it's interps/ghc/runghc.
00:56:25  OH
00:56:28  In EgoBot
00:56:34  >_<
00:56:37  Better undo it for HackEgo :)
00:56:37  *lambdabot* elliott said 21h 44m 48s ago: Replace HackEgo's runghc with http://sprunge.us/AYIK, thx (avoids really expensive optimisation, useless temporary file)
00:56:40  Yes :P
00:56:42  Oops :P
00:56:59  EgoBot apparently has other issues :P
00:58:29 -!- kallisti has quit (Quit: Changing server).
00:59:03  http://www.headinjurytheater.com/images/d&d%20beasts%20giant%20space%20hamster.jpg
00:59:06  Yessssssssssssssss
00:59:29  Also waves his hand near Kjugobe and says, ``There is nothing here! Are you drunk? Stand up!'' and tries to make him stand up, however he fell down again.
00:59:40  `log PPPiiiRRRSSSqqquuuaaarrreee
00:59:41 -!- CakeProphet has joined.
00:59:41 -!- CakeProphet has quit (Changing host).
00:59:41 -!- CakeProphet has joined.
00:59:45  2011-11-25.txt:00:59:40:  `log PPPiiiRRRSSSqqquuuaaarrreee
00:59:52 -!- esowiki has joined.
01:00:40 -!- esowiki has joined.
01:01:26 -!- esowiki has joined.
01:02:09 -!- esowiki has joined.
01:02:59 -!- esowiki has joined.
01:03:37 -!- esowiki has joined.
01:04:09 -!- esowiki has joined.
01:04:40 -!- esowiki has joined.
01:05:26 -!- esowiki has joined.
01:06:17 -!- esowiki has joined.
01:06:49 -!- esowiki has joined.
01:07:38 -!- esowiki has joined.
01:08:11 -!- esowiki has joined.
01:08:59 -!- esowiki has joined.
01:09:30 -!- esowiki has joined.
01:10:16 -!- esowiki has joined.
01:10:56 -!- esowiki has joined.
01:11:51 -!- esowiki has joined.
01:12:36 -!- esowiki has joined.
01:13:25 -!- esowiki has joined.
01:14:14 -!- esowiki has joined.
01:14:50 -!- esowiki has joined.
01:15:42 -!- esowiki has joined.
01:16:44 -!- esowiki has joined.
01:17:19 -!- esowiki has joined.
01:17:55 -!- esowiki has joined.
01:18:27 -!- esowiki has joined.
01:19:00 -!- esowiki has joined.
01:19:33 -!- esowiki has joined.
01:20:21 -!- esowiki has joined.
01:21:13 -!- esowiki has joined.
01:21:45 -!- esowiki has joined.
01:22:31 -!- esowiki has joined.
01:23:17 -!- esowiki has joined.
01:24:07 -!- esowiki has joined.
01:24:55 -!- esowiki has joined.
01:25:29 -!- esowiki has joined.
01:26:21 -!- esowiki has joined.
01:27:21 -!- esowiki has joined.
01:28:28 -!- esowiki has joined.
01:29:02 -!- esowiki has joined.
01:29:39 -!- esowiki has joined.
01:30:29 -!- esowiki has joined.
01:31:02 -!- esowiki has joined.
01:31:50 -!- esowiki has joined.
01:32:40 -!- esowiki has joined.
01:33:36 -!- esowiki has joined.
01:34:24 -!- esowiki has joined.
01:34:57 -!- esowiki has joined.
01:35:50 -!- esowiki has joined.
01:36:38 -!- esowiki has joined.
01:37:20 -!- esowiki has joined.
01:38:16 -!- esowiki has joined.
01:38:57 -!- esowiki has joined.
01:39:28 -!- esowiki has joined.
01:39:59 -!- esowiki has joined.
01:41:00 -!- esowiki has joined.
01:41:44 -!- esowiki has joined.
01:42:17 -!- esowiki has joined.
01:43:05 -!- esowiki has joined.
01:43:56 -!- esowiki has joined.
01:44:29 -!- esowiki has joined.
01:45:02 -!- esowiki has joined.
01:45:54 -!- esowiki has joined.
01:46:40 -!- esowiki has joined.
01:47:19 -!- esowiki has joined.
01:48:09 -!- esowiki has joined.
01:48:42 -!- esowiki has joined.
01:49:17 -!- esowiki has joined.
01:49:48 -!- esowiki has joined.
01:50:32 -!- esowiki has joined.
01:51:19 -!- esowiki has joined.
01:52:00 -!- esowiki has joined.
01:52:38 -!- esowiki has joined.
01:53:26 -!- esowiki has joined.
01:53:57 -!- esowiki has joined.
01:54:43 -!- esowiki has joined.
01:55:29 -!- esowiki has joined.
01:56:00 -!- esowiki has joined.
01:56:31 -!- esowiki has joined.
01:57:29 -!- esowiki has joined.
01:58:04 -!- esowiki has joined.
01:58:49 -!- esowiki has joined.
01:59:42 -!- esowiki has joined.
02:00:26 -!- esowiki has joined.
02:00:58 -!- esowiki has joined.
02:01:37 -!- esowiki has joined.
02:02:12 -!- esowiki has joined.
02:03:11 -!- esowiki has joined.
02:04:06 -!- esowiki has joined.
02:04:57 -!- esowiki has joined.
02:05:29 -!- esowiki has joined.
02:06:19 -!- esowiki has joined.
02:06:51 -!- esowiki has joined.
02:07:22 -!- esowiki has joined.
02:08:09 -!- esowiki has joined.
02:08:41 -!- esowiki has joined.
02:09:26 -!- esowiki has joined.
02:10:14 -!- esowiki has joined.
02:11:06 -!- esowiki has joined.
02:11:41 -!- esowiki has joined.
02:12:31 -!- esowiki has joined.
02:13:16 -!- esowiki has joined.
02:14:05 -!- esowiki has joined.
02:14:36 -!- esowiki has joined.
02:15:18 -!- esowiki has joined.
02:15:51 -!- esowiki has joined.
02:16:24 -!- esowiki has joined.
02:16:57 -!- esowiki has joined.
02:17:50 -!- esowiki has joined.
02:18:23 -!- esowiki has joined.
02:18:54 -!- esowiki has joined.
02:19:46 -!- esowiki has joined.
02:20:17 -!- esowiki has joined.
02:20:55 -!- esowiki has joined.
02:21:42 -!- esowiki has joined.
02:22:15 -!- esowiki has joined.
02:23:05 -!- esowiki has joined.
02:23:51 -!- esowiki has joined.
02:24:31 -!- esowiki has joined.
02:25:33 -!- esowiki has joined.
02:26:20 -!- esowiki has joined.
02:27:16 -!- esowiki has joined.
02:28:01 -!- esowiki has joined.
02:28:36 -!- esowiki has joined.
02:29:08 -!- esowiki has joined.
02:30:09 -!- esowiki has joined.
02:30:47 -!- esowiki has joined.
02:31:18 -!- esowiki has joined.
02:32:06 -!- esowiki has joined.
02:32:41 -!- esowiki has joined.
02:33:26 -!- esowiki has joined.
02:34:14 -!- esowiki has joined.
02:34:55 -!- esowiki has joined.
02:35:43 -!- esowiki has joined.
02:36:38 -!- esowiki has joined.
02:37:39 -!- esowiki has joined.
02:38:24 -!- esowiki has joined.
02:38:57 -!- esowiki has joined.
02:39:37 -!- esowiki has joined.
02:40:09 -!- esowiki has joined.
02:40:51 -!- esowiki has joined.
02:41:28 -!- esowiki has joined.
02:41:59 -!- esowiki has joined.
02:42:36 -!- esowiki has joined.
02:43:11 -!- esowiki has joined.
02:43:42 -!- esowiki has joined.
02:44:14 -!- esowiki has joined.
02:45:04 -!- esowiki has joined.
02:46:06 -!- esowiki has joined.
02:47:05 -!- esowiki has joined.
02:47:37 -!- esowiki has joined.
02:48:24 -!- esowiki has joined.
02:49:04 -!- esowiki has joined.
02:49:44 -!- esowiki has joined.
02:50:15 -!- esowiki has joined.
02:51:01 -!- esowiki has joined.
02:51:40 -!- esowiki has joined.
02:52:25 -!- esowiki has joined.
02:52:57 -!- esowiki has joined.
02:53:50 -!- esowiki has joined.
02:54:39 -!- esowiki has joined.
02:55:27 -!- esowiki has joined.
02:56:13 -!- esowiki has joined.
02:57:09 -!- esowiki has joined.
02:58:11 -!- esowiki has joined.
02:59:00 -!- esowiki has joined.
02:59:53 -!- esowiki has joined.
03:00:45 -!- esowiki has joined.
03:01:37 -!- esowiki has joined.
03:02:31 -!- esowiki has joined.
03:03:19 -!- esowiki has joined.
03:04:12 -!- esowiki has joined.
03:05:04 -!- esowiki has joined.
03:05:38 -!- esowiki has joined.
03:06:38 -!- esowiki has joined.
03:07:10 -!- esowiki has joined.
03:07:56 -!- esowiki has joined.
03:08:30 -!- esowiki has joined.
03:09:32 -!- esowiki has joined.
03:10:06 -!- esowiki has joined.
03:10:39 -!- esowiki has joined.
03:11:23 -!- esowiki has joined.
03:12:07 -!- esowiki has joined.
03:12:41 -!- esowiki has joined.
03:13:30 -!- esowiki has joined.
03:14:11 -!- esowiki has joined.
03:14:42 -!- esowiki has joined.
03:15:36 -!- esowiki has joined.
03:16:09 -!- esowiki has joined.
03:17:07 -!- esowiki has joined.
03:17:38 -!- esowiki has joined.
03:18:19 -!- esowiki has joined.
03:18:55 -!- esowiki has joined.
03:19:39 -!- esowiki has joined.
03:20:13 -!- esowiki has joined.
03:20:44 -!- esowiki has joined.
03:21:19 -!- esowiki has joined.
03:22:14 -!- esowiki has joined.
03:23:02 -!- esowiki has joined.
03:23:50 -!- esowiki has joined.
03:24:38 -!- esowiki has joined.
03:25:11 -!- esowiki has joined.
03:26:03 -!- esowiki has joined.
03:26:43 -!- esowiki has joined.
03:27:29 -!- esowiki has joined.
03:28:15 -!- esowiki has joined.
03:29:10 -!- esowiki has joined.
03:30:04 -!- esowiki has joined.
03:30:56 -!- esowiki has joined.
03:31:36 -!- esowiki has joined.
03:32:39 -!- esowiki has joined.
03:33:26 -!- esowiki has joined.
03:34:14 -!- esowiki has joined.
03:35:14 -!- esowiki has joined.
03:36:10 -!- esowiki has joined.
03:36:41 -!- esowiki has joined.
03:37:13 -!- esowiki has joined.
03:38:17 -!- esowiki has joined.
03:38:49 -!- esowiki has joined.
03:39:39 -!- esowiki has joined.
03:40:32 -!- esowiki has joined.
03:41:28 -!- esowiki has joined.
03:42:01 -!- esowiki has joined.
03:42:38 -!- esowiki has joined.
03:43:26 -!- esowiki has joined.
03:44:13 -!- esowiki has joined.
03:44:46 -!- esowiki has joined.
03:45:19 -!- esowiki has joined.
03:46:03 -!- esowiki has joined.
03:46:34 -!- esowiki has joined.
03:47:35 -!- esowiki has joined.
03:48:31 -!- esowiki has joined.
03:49:06 -!- esowiki has joined.
03:49:39 -!- esowiki has joined.
03:50:31 -!- esowiki has joined.
03:51:13 -!- esowiki has joined.
03:51:44 -!- esowiki has joined.
03:52:31 -!- esowiki has joined.
03:53:26 -!- esowiki has joined.
03:54:19 -!- esowiki has joined.
03:54:50 -!- esowiki has joined.
03:55:28 -!- esowiki has joined.
03:56:23 -!- esowiki has joined.
03:56:55 -!- esowiki has joined.
03:57:43 -!- esowiki has joined.
03:58:37 -!- esowiki has joined.
03:59:08 -!- esowiki has joined.
03:59:49 -!- esowiki has joined.
04:00:22 -!- esowiki has joined.
04:01:13 -!- esowiki has joined.
04:01:49 -!- esowiki has joined.
04:02:22 -!- esowiki has joined.
04:03:11 -!- esowiki has joined.
04:03:49 -!- esowiki has joined.
04:04:39 -!- esowiki has joined.
04:05:29 -!- esowiki has joined.
04:06:14 -!- esowiki has joined.
04:07:02 -!- esowiki has joined.
04:07:44 -!- esowiki has joined.
04:08:37 -!- esowiki has joined.
04:09:10 -!- esowiki has joined.
04:09:43 -!- esowiki has joined.
04:10:20 -!- esowiki has joined.
04:11:11 -!- esowiki has joined.
04:12:17 -!- esowiki has joined.
04:13:06 -!- esowiki has joined.
04:13:52 -!- esowiki has joined.
04:14:53 -!- esowiki has joined.
04:15:40 -!- esowiki has joined.
04:16:11 -!- esowiki has joined.
04:16:55 -!- esowiki has joined.
04:17:51 -!- esowiki has joined.
04:18:51 -!- esowiki has joined.
04:19:26 -!- esowiki has joined.
04:20:19 -!- esowiki has joined.
04:21:11 -!- esowiki has joined.
04:21:42 -!- esowiki has joined.
04:22:34 -!- esowiki has joined.
04:23:24 -!- esowiki has joined.
04:23:56 -!- esowiki has joined.
04:24:31 -!- esowiki has joined.
04:25:07 -!- esowiki has joined.
04:25:56 -!- esowiki has joined.
04:27:01 -!- esowiki has joined.
04:27:53 -!- esowiki has joined.
04:28:46 -!- esowiki has joined.
04:29:19 -!- esowiki has joined.
04:29:50 -!- esowiki has joined.
04:30:29 -!- esowiki has joined.
04:31:10 -!- esowiki has joined.
04:31:43 -!- esowiki has joined.
04:32:37 -!- esowiki has joined.
04:33:19 -!- esowiki has joined.
04:34:11 -!- esowiki has joined.
04:35:07 -!- esowiki has joined.
04:35:43 -!- esowiki has joined.
04:36:21 -!- esowiki has joined.
04:36:56 -!- esowiki has joined.
04:37:50 -!- esowiki has joined.
04:38:33 -!- esowiki has joined.
04:39:05 -!- esowiki has joined.
04:39:37 -!- esowiki has joined.
04:40:26 -!- esowiki has joined.
04:41:36 -!- esowiki has joined.
04:42:17 -!- esowiki has joined.
04:42:49 -!- esowiki has joined.
04:43:24 -!- esowiki has joined.
04:44:07 -!- esowiki has joined.
04:44:55 -!- esowiki has joined.
04:45:29 -!- esowiki has joined.
04:46:30 -!- esowiki has joined.
04:47:09 -!- esowiki has joined.
04:48:03 -!- esowiki has joined.
04:48:41 -!- esowiki has joined.
04:49:26 -!- esowiki has joined.
04:50:14 -!- esowiki has joined.
04:50:49 -!- esowiki has joined.
04:51:43 -!- esowiki has joined.
04:52:31 -!- esowiki has joined.
04:53:16 -!- esowiki has joined.
04:53:51 -!- esowiki has joined.
04:54:31 -!- esowiki has joined.
04:55:11 -!- esowiki has joined.
04:55:43 -!- esowiki has joined.
04:56:16 -!- esowiki has joined.
04:57:09 -!- esowiki has joined.
04:57:59 -!- esowiki has joined.
04:58:55 -!- esowiki has joined.
04:59:41 -!- esowiki has joined.
05:00:16 -!- esowiki has joined.
05:01:01 -!- esowiki has joined.
05:01:47 -!- esowiki has joined.
05:02:39 -!- esowiki has joined.
05:03:25 -!- esowiki has joined.
05:04:14 -!- esowiki has joined.
05:04:59 -!- esowiki has joined.
05:05:54 -!- esowiki has joined.
05:06:44 -!- esowiki has joined.
05:07:19 -!- esowiki has joined.
05:08:15 -!- esowiki has joined.
05:09:02 -!- esowiki has joined.
05:09:39 -!- esowiki has joined.
05:10:29 -!- esowiki has joined.
05:11:19 -!- esowiki has joined.
05:12:14 -!- esowiki has joined.
05:13:02 -!- esowiki has joined.
05:13:53 -!- esowiki has joined.
05:14:24 -!- esowiki has joined.
05:15:11 -!- esowiki has joined.
05:16:07 -!- esowiki has joined.
05:16:38 -!- esowiki has joined.
05:17:19 -!- esowiki has joined.
05:18:07 -!- esowiki has joined.
05:18:55 -!- esowiki has joined.
05:19:44 -!- esowiki has joined.
05:20:36 -!- esowiki has joined.
05:21:19 -!- esowiki has joined.
05:22:09 -!- esowiki has joined.
05:22:59 -!- esowiki has joined.
05:23:49 -!- esowiki has joined.
05:24:26 -!- esowiki has joined.
05:25:19 -!- esowiki has joined.
05:26:14 -!- esowiki has joined.
05:27:02 -!- esowiki has joined.
05:27:43 -!- esowiki has joined.
05:28:41 -!- esowiki has joined.
05:29:38 -!- esowiki has joined.
05:30:17 -!- esowiki has joined.
05:30:54 -!- esowiki has joined.
05:31:35 -!- esowiki has joined.
05:32:34 -!- esowiki has joined.
05:33:07 -!- esowiki has joined.
05:33:59 -!- esowiki has joined.
05:34:45 -!- esowiki has joined.
05:35:32 -!- esowiki has joined.
05:36:06 -!- esowiki has joined.
05:36:37 -!- esowiki has joined.
05:37:18 -!- esowiki has joined.
05:38:20 -!- esowiki has joined.
05:38:58 -!- esowiki has joined.
05:39:50 -!- esowiki has joined.
05:40:38 -!- esowiki has joined.
05:41:26 -!- esowiki has joined.
05:42:09 -!- esowiki has joined.
05:42:59 -!- esowiki has joined.
05:43:56 -!- esowiki has joined.
05:44:38 -!- esowiki has joined.
05:45:35 -!- esowiki has joined.
05:46:31 -!- esowiki has joined.
05:47:26 -!- esowiki has joined.
05:48:29 -!- esowiki has joined.
05:49:01 -!- esowiki has joined.
05:49:32 -!- esowiki has joined.
05:50:14 -!- esowiki has joined.
05:51:02 -!- esowiki has joined.
05:51:37 -!- esowiki has joined.
05:52:09 -!- esowiki has joined.
05:53:09 -!- esowiki has joined.
05:53:55 -!- esowiki has joined.
05:54:41 -!- esowiki has joined.
05:55:27 -!- esowiki has joined.
05:56:16 -!- esowiki has joined.
05:56:51 -!- esowiki has joined.
05:57:27 -!- esowiki has joined.
05:58:19 -!- esowiki has joined.
05:58:50 -!- esowiki has joined.
05:59:26 -!- esowiki has joined.
06:00:02 -!- esowiki has joined.
06:00:50 -!- esowiki has joined.
06:01:35 -!- esowiki has joined.
06:02:16 -!- esowiki has joined.
06:02:49 -!- esowiki has joined.
06:03:24 -!- esowiki has joined.
06:04:14 -!- esowiki has joined.
06:05:02 -!- esowiki has joined.
06:05:43 -!- esowiki has joined.
06:06:31 -!- esowiki has joined.
06:07:20 -!- esowiki has joined.
06:07:59 -!- esowiki has joined.
06:08:52 -!- esowiki has joined.
06:09:38 -!- esowiki has joined.
06:10:17 -!- esowiki has joined.
06:10:49 -!- esowiki has joined.
06:11:44 -!- esowiki has joined.
06:12:34 -!- esowiki has joined.
06:13:30 -!- esowiki has joined.
06:14:03 -!- esowiki has joined.
06:14:55 -!- esowiki has joined.
06:15:43 -!- esowiki has joined.
06:16:34 -!- esowiki has joined.
06:17:36 -!- esowiki has joined.
06:18:07 -!- esowiki has joined.
06:18:55 -!- esowiki has joined.
06:19:36 -!- esowiki has joined.
06:20:22 -!- esowiki has joined.
06:20:59 -!- esowiki has joined.
06:21:31 -!- esowiki has joined.
06:22:05 -!- esowiki has joined.
06:22:36 -!- esowiki has joined.
06:23:35 -!- esowiki has joined.
06:24:09 -!- esowiki has joined.
06:25:03 -!- esowiki has joined.
06:25:36 -!- esowiki has joined.
06:26:20 -!- esowiki has joined.
06:27:09 -!- esowiki has joined.
06:28:02 -!- esowiki has joined.
06:28:54 -!- esowiki has joined.
06:29:27 -!- esowiki has joined.
06:30:05 -!- esowiki has joined.
06:31:02 -!- esowiki has joined.
06:31:51 -!- esowiki has joined.
06:32:26 -!- esowiki has joined.
06:33:02 -!- esowiki has joined.
06:33:50 -!- esowiki has joined.
06:34:31 -!- esowiki has joined.
06:35:19 -!- esowiki has joined.
06:35:56 -!- esowiki has joined.
06:36:35 -!- esowiki has joined.
06:37:23 -!- esowiki has joined.
06:37:59 -!- esowiki has joined.
06:38:47 -!- esowiki has joined.
06:39:43 -!- esowiki has joined.
06:40:46 -!- esowiki has joined.
06:41:22 -!- esowiki has joined.
06:42:24 -!- esowiki has joined.
06:42:59 -!- esowiki has joined.
06:43:45 -!- esowiki has joined.
06:44:37 -!- esowiki has joined.
06:45:10 -!- esowiki has joined.
06:46:01 -!- esowiki has joined.
06:46:43 -!- esowiki has joined.
06:47:39 -!- esowiki has joined.
06:48:17 -!- esowiki has joined.
06:48:56 -!- esowiki has joined.
06:49:56 -!- esowiki has joined.
06:50:40 -!- esowiki has joined.
06:51:41 -!- esowiki has joined.
06:52:16 -!- esowiki has joined.
06:53:05 -!- esowiki has joined.
06:53:43 -!- esowiki has joined.
06:54:38 -!- esowiki has joined.
06:55:29 -!- esowiki has joined.
06:56:05 -!- esowiki has joined.
06:56:44 -!- esowiki has joined.
06:57:23 -!- esowiki has joined.
06:58:22 -!- esowiki has joined.
06:59:05 -!- esowiki has joined.
06:59:51 -!- esowiki has joined.
07:00:50 -!- esowiki has joined.
07:01:21 -!- esowiki has joined.
07:02:09 -!- esowiki has joined.
07:02:55 -!- esowiki has joined.
07:03:41 -!- esowiki has joined.
07:04:37 -!- esowiki has joined.
07:05:13 -!- esowiki has joined.
07:05:45 -!- esowiki has joined.
07:06:31 -!- esowiki has joined.
07:07:19 -!- esowiki has joined.
07:07:57 -!- esowiki has joined.
07:08:30 -!- esowiki has joined.
07:09:03 -!- esowiki has joined.
07:09:49 -!- esowiki has joined.
07:10:39 -!- esowiki has joined.
07:11:10 -!- esowiki has joined.
07:11:44 -!- esowiki has joined.
07:12:30 -!- esowiki has joined.
07:13:19 -!- esowiki has joined.
07:14:14 -!- esowiki has joined.
07:15:04 -!- esowiki has joined.
07:15:39 -!- esowiki has joined.
07:16:14 -!- esowiki has joined.
07:16:53 -!- esowiki has joined.
07:17:29 -!- esowiki has joined.
07:18:15 -!- esowiki has joined.
07:19:16 -!- esowiki has joined.
07:20:04 -!- esowiki has joined.
07:20:38 -!- esowiki has joined.
07:21:26 -!- esowiki has joined.
07:22:01 -!- esowiki has joined.
07:22:55 -!- esowiki has joined.
07:23:53 -!- esowiki has joined.
07:24:25 -!- esowiki has joined.
07:24:57 -!- esowiki has joined.
07:25:52 -!- esowiki has joined.
07:26:41 -!- esowiki has joined.
07:27:27 -!- esowiki has joined.
07:28:07 -!- esowiki has joined.
07:28:55 -!- esowiki has joined.
07:29:39 -!- esowiki has joined.
07:30:29 -!- esowiki has joined.
07:31:19 -!- esowiki has joined.
07:32:09 -!- esowiki has joined.
07:32:52 -!- esowiki has joined.
07:33:23 -!- esowiki has joined.
07:34:04 -!- esowiki has joined.
07:35:05 -!- esowiki has joined.
07:35:37 -!- esowiki has joined.
07:36:39 -!- esowiki has joined.
07:37:25 -!- esowiki has joined.
07:37:58 -!- esowiki has joined.
07:38:49 -!- esowiki has joined.
07:39:39 -!- esowiki has joined.
07:40:23 -!- esowiki has joined.
07:41:19 -!- esowiki has joined.
07:42:08 -!- esowiki has joined.
07:42:47 -!- esowiki has joined.
07:43:33 -!- esowiki has joined.
07:44:07 -!- esowiki has joined.
07:44:50 -!- esowiki has joined.
07:45:29 -!- esowiki has joined.
07:46:14 -!- esowiki has joined.
07:47:00 -!- esowiki has joined.
07:47:34 -!- esowiki has joined.
07:48:09 -!- esowiki has joined.
07:48:55 -!- esowiki has joined.
07:49:41 -!- esowiki has joined.
07:50:29 -!- esowiki has joined.
07:51:10 -!- esowiki has joined.
07:51:43 -!- esowiki has joined.
07:52:38 -!- esowiki has joined.
07:53:26 -!- esowiki has joined.
07:54:35 -!- esowiki has joined.
07:55:16 -!- esowiki has joined.
07:55:51 -!- esowiki has joined.
07:56:32 -!- esowiki has joined.
07:57:11 -!- esowiki has joined.
07:58:06 -!- esowiki has joined.
07:59:02 -!- esowiki has joined.
07:59:40 -!- esowiki has joined.
08:00:13 -!- esowiki has joined.
08:00:57 -!- esowiki has joined.
08:01:37 -!- esowiki has joined.
08:02:16 -!- esowiki has joined.
08:02:51 -!- esowiki has joined.
08:03:26 -!- esowiki has joined.
08:04:15 -!- esowiki has joined.
08:05:05 -!- esowiki has joined.
08:05:56 -!- esowiki has joined.
08:06:27 -!- esowiki has joined.
08:06:58 -!- esowiki has joined.
08:07:29 -!- esowiki has joined.
08:08:28 -!- esowiki has joined.
08:09:16 -!- esowiki has joined.
08:09:51 -!- esowiki has joined.
08:10:26 -!- esowiki has joined.
08:11:10 -!- esowiki has joined.
08:11:50 -!- esowiki has joined.
08:12:34 -!- esowiki has joined.
08:13:10 -!- esowiki has joined.
08:14:05 -!- esowiki has joined.
08:15:05 -!- esowiki has joined.
08:15:50 -!- esowiki has joined.
08:16:46 -!- esowiki has joined.
08:17:20 -!- esowiki has joined.
08:18:08 -!- esowiki has joined.
08:19:02 -!- esowiki has joined.
08:19:33 -!- esowiki has joined.
08:20:30 -!- esowiki has joined.
08:21:26 -!- esowiki has joined.
08:22:13 -!- esowiki has joined.
08:22:46 -!- esowiki has joined.
08:23:30 -!- esowiki has joined.
08:24:01 -!- esowiki has joined.
08:24:43 -!- esowiki has joined.
08:25:16 -!- esowiki has joined.
08:25:49 -!- esowiki has joined.
08:26:22 -!- esowiki has joined.
08:27:05 -!- esowiki has joined.
08:27:44 -!- esowiki has joined.
08:28:26 -!- esowiki has joined.
08:29:22 -!- esowiki has joined.
08:30:16 -!- esowiki has joined.
08:31:15 -!- esowiki has joined.
08:32:10 -!- esowiki has joined.
08:32:58 -!- esowiki has joined.
08:33:45 -!- esowiki has joined.
08:34:17 -!- esowiki has joined.
08:34:52 -!- esowiki has joined.
08:35:25 -!- esowiki has joined.
08:36:11 -!- esowiki has joined.
08:36:50 -!- esowiki has joined.
08:37:35 -!- esowiki has joined.
08:38:28 -!- esowiki has joined.
08:39:01 -!- esowiki has joined.
08:39:34 -!- esowiki has joined.
08:40:06 -!- esowiki has joined.
08:40:46 -!- esowiki has joined.
08:41:30 -!- esowiki has joined.
08:42:12 -!- esowiki has joined.
08:42:54 -!- esowiki has joined.
08:43:26 -!- esowiki has joined.
08:44:16 -!- esowiki has joined.
08:44:51 -!- esowiki has joined.
08:45:42 -!- esowiki has joined.
08:46:38 -!- esowiki has joined.
08:47:34 -!- esowiki has joined.
08:48:30 -!- esowiki has joined.
08:49:06 -!- esowiki has joined.
08:49:50 -!- esowiki has joined.
08:50:38 -!- esowiki has joined.
08:51:25 -!- esowiki has joined.
08:52:14 -!- esowiki has joined.
08:53:08 -!- esowiki has joined.
08:54:01 -!- esowiki has joined.
08:54:58 -!- esowiki has joined.
08:55:31 -!- esowiki has joined.
08:56:04 -!- esowiki has joined.
08:56:35 -!- esowiki has joined.
08:57:05 -!- esowiki has joined.
08:57:45 -!- esowiki has joined.
08:58:18 -!- esowiki has joined.
08:59:14 -!- esowiki has joined.
08:59:51 -!- esowiki has joined.
09:00:32 -!- esowiki has joined.
09:01:32 -!- esowiki has joined.
09:02:30 -!- esowiki has joined.
09:03:18 -!- esowiki has joined.
09:04:09 -!- esowiki has joined.
09:05:05 -!- esowiki has joined.
09:05:46 -!- esowiki has joined.
09:06:42 -!- esowiki has joined.
09:07:38 -!- esowiki has joined.
09:08:38 -!- esowiki has joined.
09:09:09 -!- esowiki has joined.
09:10:01 -!- esowiki has joined.
09:10:32 -!- esowiki has joined.
09:11:13 -!- esowiki has joined.
09:11:44 -!- esowiki has joined.
09:12:17 -!- esowiki has joined.
09:12:50 -!- esowiki has joined.
09:13:25 -!- esowiki has joined.
09:14:15 -!- esowiki has joined.
09:15:02 -!- esowiki has joined.
09:15:35 -!- esowiki has joined.
09:16:14 -!- esowiki has joined.
09:16:56 -!- esowiki has joined.
09:17:31 -!- esowiki has joined.
09:18:22 -!- esowiki has joined.
09:19:18 -!- esowiki has joined.
09:20:14 -!- esowiki has joined.
09:21:10 -!- esowiki has joined.
09:21:44 -!- esowiki has joined.
09:22:28 -!- esowiki has joined.
09:23:21 -!- esowiki has joined.
09:23:53 -!- esowiki has joined.
09:24:40 -!- esowiki has joined.
09:25:30 -!- esowiki has joined.
09:26:12 -!- esowiki has joined.
09:27:14 -!- esowiki has joined.
09:28:08 -!- esowiki has joined.
09:28:47 -!- esowiki has joined.
09:29:39 -!- esowiki has joined.
09:30:41 -!- esowiki has joined.
09:31:21 -!- esowiki has joined.
09:31:53 -!- esowiki has joined.
09:32:25 -!- esowiki has joined.
09:33:16 -!- esowiki has joined.
09:34:01 -!- esowiki has joined.
09:34:44 -!- esowiki has joined.
09:35:23 -!- esowiki has joined.
09:36:11 -!- esowiki has joined.
09:36:46 -!- esowiki has joined.
09:37:56 -!- esowiki has joined.
09:38:39 -!- esowiki has joined.
09:39:27 -!- esowiki has joined.
09:40:08 -!- esowiki has joined.
09:40:56 -!- esowiki has joined.
09:41:43 -!- esowiki has joined.
09:42:16 -!- esowiki has joined.
09:43:05 -!- esowiki has joined.
09:43:50 -!- esowiki has joined.
09:44:40 -!- esowiki has joined.
09:45:13 -!- esowiki has joined.
09:46:08 -!- esowiki has joined.
09:46:56 -!- esowiki has joined.
09:47:51 -!- esowiki has joined.
09:48:26 -!- esowiki has joined.
09:49:08 -!- esowiki has joined.
09:49:41 -!- esowiki has joined.
09:50:31 -!- esowiki has joined.
09:51:04 -!- esowiki has joined.
09:51:37 -!- esowiki has joined.
09:52:10 -!- esowiki has joined.
09:53:13 -!- esowiki has joined.
09:54:06 -!- esowiki has joined.
09:54:55 -!- esowiki has joined.
09:55:28 -!- esowiki has joined.
09:56:08 -!- esowiki has joined.
09:56:57 -!- esowiki has joined.
09:57:29 -!- esowiki has joined.
09:58:25 -!- esowiki has joined.
09:59:19 -!- esowiki has joined.
10:00:18 -!- esowiki has joined.
10:00:49 -!- esowiki has joined.
10:01:45 -!- esowiki has joined.
10:02:32 -!- esowiki has joined.
10:03:20 -!- esowiki has joined.
10:04:16 -!- esowiki has joined.
10:04:47 -!- esowiki has joined.
10:05:38 -!- esowiki has joined.
10:06:11 -!- esowiki has joined.
10:07:01 -!- esowiki has joined.
10:07:32 -!- esowiki has joined.
10:08:25 -!- esowiki has joined.
10:09:15 -!- esowiki has joined.
10:09:46 -!- esowiki has joined.
10:10:19 -!- esowiki has joined.
10:10:56 -!- esowiki has joined.
10:11:44 -!- esowiki has joined.
10:12:23 -!- esowiki has joined.
10:13:04 -!- esowiki has joined.
10:13:37 -!- esowiki has joined.
10:14:22 -!- esowiki has joined.
10:15:18 -!- esowiki has joined.
10:16:09 -!- esowiki has joined.
10:16:40 -!- esowiki has joined.
10:17:35 -!- esowiki has joined.
10:18:08 -!- esowiki has joined.
10:19:02 -!- esowiki has joined.
10:19:58 -!- esowiki has joined.
10:21:03 -!- esowiki has joined.
10:22:01 -!- esowiki has joined.
10:22:33 -!- esowiki has joined.
10:23:26 -!- esowiki has joined.
10:24:15 -!- esowiki has joined.
10:25:05 -!- esowiki has joined.
10:25:51 -!- esowiki has joined.
10:26:39 -!- esowiki has joined.
10:27:20 -!- esowiki has joined.
10:28:00 -!- esowiki has joined.
10:28:45 -!- esowiki has joined.
10:29:18 -!- esowiki has joined.
10:29:56 -!- esowiki has joined.
10:30:35 -!- esowiki has joined.
10:31:10 -!- esowiki has joined.
10:32:06 -!- esowiki has joined.
10:32:41 -!- esowiki has joined.
10:33:50 -!- esowiki has joined.
10:34:45 -!- esowiki has joined.
10:35:30 -!- esowiki has joined.
10:36:25 -!- esowiki has joined.
10:36:57 -!- esowiki has joined.
10:37:44 -!- esowiki has joined.
10:38:23 -!- esowiki has joined.
10:39:24 -!- esowiki has joined.
10:39:55 -!- esowiki has joined.
10:40:30 -!- esowiki has joined.
10:41:20 -!- esowiki has joined.
10:42:06 -!- esowiki has joined.
10:42:41 -!- esowiki has joined.
10:43:21 -!- esowiki has joined.
10:44:07 -!- esowiki has joined.
10:45:05 -!- esowiki has joined.
10:45:36 -!- esowiki has joined.
10:46:21 -!- esowiki has joined.
10:47:05 -!- esowiki has joined.
10:48:00 -!- esowiki has joined.
10:48:49 -!- esowiki has joined.
10:49:22 -!- esowiki has joined.
10:50:15 -!- esowiki has joined.
10:50:46 -!- esowiki has joined.
10:51:23 -!- esowiki has joined.
10:52:02 -!- esowiki has joined.
10:53:00 -!- esowiki has joined.
10:53:50 -!- esowiki has joined.
10:54:40 -!- esowiki has joined.
10:55:14 -!- esowiki has joined.
10:56:00 -!- esowiki has joined.
10:56:50 -!- esowiki has joined.
10:57:46 -!- esowiki has joined.
10:58:41 -!- esowiki has joined.
10:59:50 -!- esowiki has joined.
11:00:35 -!- esowiki has joined.
11:01:20 -!- esowiki has joined.
11:02:18 -!- esowiki has joined.
11:03:05 -!- esowiki has joined.
11:03:44 -!- esowiki has joined.
11:04:22 -!- esowiki has joined.
11:05:02 -!- esowiki has joined.
11:05:41 -!- esowiki has joined.
11:06:32 -!- esowiki has joined.
11:07:10 -!- esowiki has joined.
11:08:00 -!- esowiki has joined.
11:08:51 -!- esowiki has joined.
11:09:22 -!- esowiki has joined.
11:10:06 -!- esowiki has joined.
11:10:55 -!- esowiki has joined.
11:11:51 -!- esowiki has joined.
11:12:26 -!- esowiki has joined.
11:13:00 -!- esowiki has joined.
11:13:50 -!- esowiki has joined.
11:14:46 -!- esowiki has joined.
11:15:21 -!- esowiki has joined.
11:16:15 -!- esowiki has joined.
11:16:46 -!- esowiki has joined.
11:17:35 -!- esowiki has joined.
11:18:25 -!- esowiki has joined.
11:19:21 -!- esowiki has joined.
11:19:54 -!- esowiki has joined.
11:20:39 -!- esowiki has joined.
11:21:20 -!- esowiki has joined.
11:22:17 -!- esowiki has joined.
11:22:49 -!- esowiki has joined.
11:23:36 -!- esowiki has joined.
11:24:22 -!- esowiki has joined.
11:25:07 -!- esowiki has joined.
11:25:57 -!- esowiki has joined.
11:26:30 -!- esowiki has joined.
11:27:27 -!- esowiki has joined.
11:28:09 -!- esowiki has joined.
11:29:10 -!- esowiki has joined.
11:29:58 -!- esowiki has joined.
11:30:49 -!- esowiki has joined.
11:31:21 -!- esowiki has joined.
11:32:15 -!- esowiki has joined.
11:32:47 -!- esowiki has joined.
11:33:18 -!- esowiki has joined.
11:33:51 -!- esowiki has joined.
11:34:39 -!- esowiki has joined.
11:35:11 -!- esowiki has joined.
11:35:46 -!- esowiki has joined.
11:36:32 -!- esowiki has joined.
11:37:26 -!- esowiki has joined.
11:38:22 -!- esowiki has joined.
11:39:10 -!- esowiki has joined.
11:39:51 -!- esowiki has joined.
11:40:39 -!- esowiki has joined.
11:41:26 -!- esowiki has joined.
11:42:00 -!- esowiki has joined.
11:42:46 -!- esowiki has joined.
11:43:38 -!- esowiki has joined.
11:44:40 -!- esowiki has joined.
11:45:30 -!- esowiki has joined.
11:46:20 -!- esowiki has joined.
11:47:03 -!- esowiki has joined.
11:47:51 -!- esowiki has joined.
11:48:39 -!- esowiki has joined.
11:49:27 -!- esowiki has joined.
11:50:21 -!- esowiki has joined.
11:51:03 -!- esowiki has joined.
11:51:37 -!- esowiki has joined.
11:52:21 -!- esowiki has joined.
11:53:00 -!- esowiki has joined.
11:53:50 -!- esowiki has joined.
11:54:40 -!- esowiki has joined.
11:55:25 -!- esowiki has joined.
11:56:11 -!- esowiki has joined.
11:57:01 -!- esowiki has joined.
11:57:34 -!- esowiki has joined.
11:58:25 -!- esowiki has joined.
11:58:59 -!- esowiki has joined.
11:59:38 -!- esowiki has joined.
12:00:24 -!- esowiki has joined.
12:00:55 -!- esowiki has joined.
12:01:58 -!- esowiki has joined.
12:02:36 -!- esowiki has joined.
12:03:34 -!- esowiki has joined.
12:04:25 -!- esowiki has joined.
12:05:31 -!- esowiki has joined.
12:06:12 -!- esowiki has joined.
12:06:43 -!- esowiki has joined.
12:07:37 -!- esowiki has joined.
12:08:16 -!- esowiki has joined.
12:09:03 -!- esowiki has joined.
12:09:51 -!- esowiki has joined.
12:10:51 -!- esowiki has joined.
12:11:45 -!- esowiki has joined.
12:12:35 -!- esowiki has joined.
12:13:26 -!- esowiki has joined.
12:14:12 -!- esowiki has joined.
12:14:45 -!- esowiki has joined.
12:15:41 -!- esowiki has joined.
12:16:15 -!- esowiki has joined.
12:17:05 -!- esowiki has joined.
12:17:51 -!- esowiki has joined.
12:18:46 -!- esowiki has joined.
12:19:17 -!- esowiki has joined.
12:20:06 -!- esowiki has joined.
12:20:50 -!- esowiki has joined.
12:21:44 -!- esowiki has joined.
12:22:41 -!- esowiki has joined.
12:23:37 -!- esowiki has joined.
12:24:33 -!- esowiki has joined.
12:25:29 -!- esowiki has joined.
12:26:05 -!- esowiki has joined.
12:26:51 -!- esowiki has joined.
12:27:27 -!- esowiki has joined.
12:28:22 -!- esowiki has joined.
12:29:09 -!- esowiki has joined.
12:29:55 -!- esowiki has joined.
12:30:32 -!- esowiki has joined.
12:31:20 -!- esowiki has joined.
12:32:13 -!- esowiki has joined.
12:33:04 -!- esowiki has joined.
12:33:35 -!- esowiki has joined.
12:34:37 -!- esowiki has joined.
12:35:31 -!- esowiki has joined.
12:36:04 -!- esowiki has joined.
12:36:41 -!- esowiki has joined.
12:37:22 -!- esowiki has joined.
12:38:24 -!- esowiki has joined.
12:39:16 -!- esowiki has joined.
12:39:51 -!- esowiki has joined.
12:40:28 -!- esowiki has joined.
12:41:13 -!- esowiki has joined.
12:42:16 -!- esowiki has joined.
12:42:57 -!- esowiki has joined.
12:43:31 -!- esowiki has joined.
12:44:09 -!- esowiki has joined.
12:45:10 -!- esowiki has joined.
12:45:43 -!- esowiki has joined.
12:46:16 -!- esowiki has joined.
12:47:05 -!- esowiki has joined.
12:47:44 -!- esowiki has joined.
12:48:41 -!- esowiki has joined.
12:49:34 -!- esowiki has joined.
12:50:15 -!- esowiki has joined.
12:51:03 -!- esowiki has joined.
12:51:46 -!- esowiki has joined.
12:52:25 -!- esowiki has joined.
12:52:57 -!- esowiki has joined.
12:53:54 -!- esowiki has joined.
12:54:39 -!- esowiki has joined.
12:55:17 -!- esowiki has joined.
12:55:48 -!- esowiki has joined.
12:56:19 -!- esowiki has joined.
12:56:50 -!- esowiki has joined.
12:57:44 -!- esowiki has joined.
12:58:33 -!- esowiki has joined.
12:59:27 -!- esowiki has joined.
13:00:15 -!- esowiki has joined.
13:00:57 -!- esowiki has joined.
13:01:41 -!- esowiki has joined.
13:02:41 -!- esowiki has joined.
13:03:34 -!- esowiki has joined.
13:04:38 -!- esowiki has joined.
13:05:32 -!- esowiki has joined.
13:06:08 -!- esowiki has joined.
13:06:56 -!- esowiki has joined.
13:07:56 -!- esowiki has joined.
13:08:50 -!- esowiki has joined.
13:09:23 -!- esowiki has joined.
13:10:16 -!- esowiki has joined.
13:11:16 -!- esowiki has joined.
13:11:59 -!- esowiki has joined.
13:12:30 -!- esowiki has joined.
13:13:22 -!- esowiki has joined.
13:14:15 -!- esowiki has joined.
13:14:46 -!- esowiki has joined.
13:15:25 -!- esowiki has joined.
13:16:18 -!- esowiki has joined.
13:17:04 -!- esowiki has joined.
13:17:45 -!- esowiki has joined.
13:18:41 -!- esowiki has joined.
13:19:13 -!- esowiki has joined.
13:20:08 -!- esowiki has joined.
13:20:56 -!- esowiki has joined.
13:21:56 -!- esowiki has joined.
13:22:35 -!- esowiki has joined.
13:23:12 -!- esowiki has joined.
13:23:58 -!- esowiki has joined.
13:24:47 -!- esowiki has joined.
13:25:26 -!- esowiki has joined.
13:26:08 -!- esowiki has joined.
13:26:56 -!- esowiki has joined.
13:27:46 -!- esowiki has joined.
13:28:25 -!- esowiki has joined.
13:29:15 -!- esowiki has joined.
13:29:59 -!- esowiki has joined.
13:30:39 -!- esowiki has joined.
13:31:37 -!- esowiki has joined.
13:32:08 -!- esowiki has joined.
13:33:00 -!- esowiki has joined.
13:33:31 -!- esowiki has joined.
13:34:19 -!- esowiki has joined.
13:35:05 -!- esowiki has joined.
13:36:06 -!- esowiki has joined.
13:36:45 -!- esowiki has joined.
13:37:35 -!- esowiki has joined.
13:38:02 -!- esowiki has joined.
13:38:03  Logs: http://codu.org/logs/_esoteric/ . Also available via rsync: rsync --size-only -avz rsync://codu.org/logs/_esoteric/ logs/
13:38:05 -!- esowiki has joined.
13:38:06  Logs: http://codu.org/logs/_esoteric/ . Also available via rsync: rsync --size-only -avz rsync://codu.org/logs/_esoteric/ logs/
13:38:20 -!- esowiki has joined.
13:38:25 -!- esowiki has joined.
13:38:25 -!- esowiki has joined.
13:38:56 -!- esowiki has joined.
13:39:01 -!- esowiki has joined.
13:39:01 -!- esowiki has joined.
13:39:44 -!- esowiki has joined.
13:39:49 -!- esowiki has joined.
13:39:49 -!- esowiki has joined.
13:40:36 -!- esowiki has joined.
13:40:41 -!- esowiki has joined.
13:40:42 -!- esowiki has joined.
13:41:20 -!- esowiki has joined.
13:41:25 -!- esowiki has joined.
13:41:25 -!- esowiki has joined.
13:42:10 -!- esowiki has joined.
13:42:14 -!- esowiki has joined.
13:42:15 -!- esowiki has joined.
13:43:05 -!- esowiki has joined.
13:43:10 -!- esowiki has joined.
13:43:11 -!- esowiki has joined.
13:43:44 -!- esowiki has joined.
13:43:49 -!- esowiki has joined.
13:43:49 -!- esowiki has joined.
13:44:17 -!- esowiki has joined.
13:44:22 -!- esowiki has joined.
13:44:22 -!- esowiki has joined.
13:45:13 -!- esowiki has joined.
13:45:18 -!- esowiki has joined.
13:45:19 -!- esowiki has joined.
13:45:45 -!- esowiki has joined.
13:45:50 -!- esowiki has joined.
13:45:51 -!- esowiki has joined.
13:46:26 -!- esowiki has joined.
13:46:30 -!- esowiki has joined.
13:46:31 -!- esowiki has joined.
13:46:57 -!- esowiki has joined.
13:47:01 -!- esowiki has joined.
13:47:02 -!- esowiki has joined.
13:47:51 -!- esowiki has joined.
13:47:55 -!- esowiki has joined.
13:47:56 -!- esowiki has joined.
13:48:39 -!- esowiki has joined.
13:48:43 -!- esowiki has joined.
13:48:44 -!- esowiki has joined.
13:49:11 -!- esowiki has joined.
13:49:15 -!- esowiki has joined.
13:49:16 -!- esowiki has joined.
13:49:42 -!- esowiki has joined.
13:49:47 -!- esowiki has joined.
13:49:47 -!- esowiki has joined.
13:50:15 -!- esowiki has joined.
13:50:19 -!- esowiki has joined.
13:50:20 -!- esowiki has joined.
13:50:48 -!- esowiki has joined.
13:50:52 -!- esowiki has joined.
13:50:53 -!- esowiki has joined.
13:51:20 -!- esowiki has joined.
13:51:24 -!- esowiki has joined.
13:51:25 -!- esowiki has joined.
13:51:57 -!- esowiki has joined.
13:52:01 -!- esowiki has joined.
13:52:02 -!- esowiki has joined.
13:52:43 -!- esowiki has joined.
13:52:47 -!- esowiki has joined.
13:52:48 -!- esowiki has joined.
13:53:26 -!- esowiki has joined.
13:53:31 -!- esowiki has joined.
13:53:31 -!- esowiki has joined.
13:54:01 -!- esowiki has joined.
13:54:06 -!- esowiki has joined.
13:54:07 -!- esowiki has joined.
13:54:38 -!- esowiki has joined.
13:54:42 -!- esowiki has joined.
13:54:43 -!- esowiki has joined.
13:55:20 -!- esowiki has joined.
13:55:25 -!- esowiki has joined.
13:55:25 -!- esowiki has joined.
13:55:59 -!- esowiki has joined.
13:56:04 -!- esowiki has joined.
13:56:04 -!- esowiki has joined.
13:56:33 -!- esowiki has joined.
13:56:37 -!- esowiki has joined.
13:56:38 -!- esowiki has joined.
13:57:19 -!- esowiki has joined.
13:57:23 -!- esowiki has joined.
13:57:24 -!- esowiki has joined.
13:58:01 -!- esowiki has joined.
13:58:06 -!- esowiki has joined.
13:58:07 -!- esowiki has joined.
13:58:33 -!- esowiki has joined.
13:58:38 -!- esowiki has joined.
13:58:39 -!- esowiki has joined.
13:59:17 -!- esowiki has joined.
13:59:22 -!- esowiki has joined.
13:59:22 -!- esowiki has joined.
13:59:52 -!- esowiki has joined.
13:59:56 -!- esowiki has joined.
13:59:57 -!- esowiki has joined.
14:00:23 -!- esowiki has joined.
14:00:27 -!- esowiki has joined.
14:00:28 -!- esowiki has joined.
14:01:01 -!- esowiki has joined.
14:01:06 -!- esowiki has joined.
14:01:07 -!- esowiki has joined.
14:01:52 -!- esowiki has joined.
14:01:57 -!- esowiki has joined.
14:01:57 -!- esowiki has joined.
14:02:25 -!- esowiki has joined.
14:02:30 -!- esowiki has joined.
14:02:30 -!- esowiki has joined.
14:03:01 -!- esowiki has joined.
14:03:06 -!- esowiki has joined.
14:03:06 -!- esowiki has joined.
14:03:53 -!- esowiki has joined.
14:03:58 -!- esowiki has joined.
14:03:59 -!- esowiki has joined.
14:04:32 -!- esowiki has joined.
14:04:37 -!- esowiki has joined.
14:04:37 -!- esowiki has joined.
14:05:20 -!- esowiki has joined.
14:05:25 -!- esowiki has joined.
14:05:25 -!- esowiki has joined.
14:06:17 -!- esowiki has joined.
14:06:22 -!- esowiki has joined.
14:06:22 -!- esowiki has joined.
14:07:03 -!- esowiki has joined.
14:07:08 -!- esowiki has joined.
14:07:09 -!- esowiki has joined.
14:07:55 -!- esowiki has joined.
14:08:00 -!- esowiki has joined.
14:08:00 -!- esowiki has joined.
14:08:28 -!- esowiki has joined.
14:08:33 -!- esowiki has joined.
14:08:33 -!- esowiki has joined.
14:09:05 -!- esowiki has joined.
14:09:10 -!- esowiki has joined.
14:09:10 -!- esowiki has joined.
14:10:01 -!- esowiki has joined.
14:10:06 -!- esowiki has joined.
14:10:06 -!- esowiki has joined.
14:10:59 -!- esowiki has joined.
14:11:04 -!- esowiki has joined.
14:11:05 -!- esowiki has joined.
14:11:32 -!- esowiki has joined.
14:11:37 -!- esowiki has joined.
14:11:38 -!- esowiki has joined.
14:12:16 -!- esowiki has joined.
14:12:20 -!- esowiki has joined.
14:12:21 -!- esowiki has joined.
14:13:02 -!- esowiki has joined.
14:13:07 -!- esowiki has joined.
14:13:07 -!- esowiki has joined.
14:13:44 -!- esowiki has joined.
14:13:49 -!- esowiki has joined.
14:13:50 -!- esowiki has joined.
14:14:31 -!- esowiki has joined.
14:14:36 -!- esowiki has joined.
14:14:36 -!- esowiki has joined.
14:15:05 -!- esowiki has joined.
14:15:09 -!- esowiki has joined.
14:15:10 -!- esowiki has joined.
14:15:55 -!- esowiki has joined.
14:16:00 -!- esowiki has joined.
14:16:00 -!- esowiki has joined.
14:16:55 -!- esowiki has joined.
14:16:59 -!- esowiki has joined.
14:17:00 -!- esowiki has joined.
14:17:49 -!- esowiki has joined.
14:17:54 -!- esowiki has joined.
14:17:54 -!- esowiki has joined.
14:18:22 -!- esowiki has joined.
14:18:27 -!- esowiki has joined.
14:18:27 -!- esowiki has joined.
14:18:56 -!- esowiki has joined.
14:19:01 -!- esowiki has joined.
14:19:01 -!- esowiki has joined.
14:19:44 -!- esowiki has joined.
14:19:49 -!- esowiki has joined.
14:19:49 -!- esowiki has joined.
14:20:39 -!- esowiki has joined.
14:20:43 -!- esowiki has joined.
14:20:44 -!- esowiki has joined.
14:21:27 -!- esowiki has joined.
14:21:31 -!- esowiki has joined.
14:21:32 -!- esowiki has joined.
14:22:15 -!- esowiki has joined.
14:22:19 -!- esowiki has joined.
14:22:20 -!- esowiki has joined.
14:23:03 -!- esowiki has joined.
14:23:07 -!- esowiki has joined.
14:23:08 -!- esowiki has joined.
14:23:52 -!- esowiki has joined.
14:23:57 -!- esowiki has joined.
14:23:57 -!- esowiki has joined.
14:24:32 -!- esowiki has joined.
14:24:37 -!- esowiki has joined.
14:24:37 -!- esowiki has joined.
14:25:20 -!- esowiki has joined.
14:25:25 -!- esowiki has joined.
14:25:25 -!- esowiki has joined.
14:26:17 -!- esowiki has joined.
14:26:22 -!- esowiki has joined.
14:26:23 -!- esowiki has joined.
14:26:50 -!- esowiki has joined.
14:26:55 -!- esowiki has joined.
14:26:55 -!- esowiki has joined.
14:27:30 -!- esowiki has joined.
14:27:34 -!- esowiki has joined.
14:27:35 -!- esowiki has joined.
14:28:27 -!- esowiki has joined.
14:28:32 -!- esowiki has joined.
14:28:32 -!- esowiki has joined.
14:29:03 -!- esowiki has joined.
14:29:07 -!- esowiki has joined.
14:29:08 -!- esowiki has joined.
14:29:47 -!- esowiki has joined.
14:29:52 -!- esowiki has joined.
14:29:52 -!- esowiki has joined.
14:30:26 -!- esowiki has joined.
14:30:31 -!- esowiki has joined.
14:30:31 -!- esowiki has joined.
14:31:20 -!- esowiki has joined.
14:31:25 -!- esowiki has joined.
14:31:25 -!- esowiki has joined.
14:32:10 -!- esowiki has joined.
14:32:15 -!- esowiki has joined.
14:32:15 -!- esowiki has joined.
14:32:53 -!- esowiki has joined.
14:32:58 -!- esowiki has joined.
14:32:58 -!- esowiki has joined.
14:33:49 -!- esowiki has joined.
14:33:54 -!- esowiki has joined.
14:33:54 -!- esowiki has joined.
14:34:40 -!- esowiki has joined.
14:34:45 -!- esowiki has joined.
14:34:45 -!- esowiki has joined.
14:35:25 -!- esowiki has joined.
14:35:30 -!- esowiki has joined.
14:35:30 -!- esowiki has joined.
14:36:25 -!- esowiki has joined.
14:36:30 -!- esowiki has joined.
14:36:31 -!- esowiki has joined.
14:37:04 -!- esowiki has joined.
14:37:09 -!- esowiki has joined.
14:37:09 -!- esowiki has joined.
14:37:35 -!- esowiki has joined.
14:37:40 -!- esowiki has joined.
14:37:40 -!- esowiki has joined.
14:38:14 -!- esowiki has joined.
14:38:19 -!- esowiki has joined.
14:38:19 -!- esowiki has joined.
14:38:57 -!- esowiki has joined.
14:39:02 -!- esowiki has joined.
14:39:02 -!- esowiki has joined.
14:39:53 -!- esowiki has joined.
14:39:58 -!- esowiki has joined.
14:39:58 -!- esowiki has joined.
14:40:50 -!- esowiki has joined.
14:40:55 -!- esowiki has joined.
14:40:56 -!- esowiki has joined.
14:41:29 -!- esowiki has joined.
14:41:34 -!- esowiki has joined.
14:41:34 -!- esowiki has joined.
14:42:10 -!- esowiki has joined.
14:42:15 -!- esowiki has joined.
14:42:15 -!- esowiki has joined.
14:42:49 -!- esowiki has joined.
14:42:54 -!- esowiki has joined.
14:42:55 -!- esowiki has joined.
14:43:37 -!- esowiki has joined.
14:43:41 -!- esowiki has joined.
14:43:42 -!- esowiki has joined.
14:44:25 -!- esowiki has joined.
14:44:30 -!- esowiki has joined.
14:44:31 -!- esowiki has joined.
14:45:05 -!- esowiki has joined.
14:45:10 -!- esowiki has joined.
14:45:10 -!- esowiki has joined.
14:45:55 -!- esowiki has joined.
14:46:00 -!- esowiki has joined.
14:46:00 -!- esowiki has joined.
14:46:45 -!- esowiki has joined.
14:46:49 -!- esowiki has joined.
14:46:50 -!- esowiki has joined.
14:47:27 -!- esowiki has joined.
14:47:31 -!- esowiki has joined.
14:47:32 -!- esowiki has joined.
14:48:16 -!- esowiki has joined.
14:48:21 -!- esowiki has joined.
14:48:22 -!- esowiki has joined.
14:48:51 -!- esowiki has joined.
14:48:56 -!- esowiki has joined.
14:48:57 -!- esowiki has joined.
14:49:26 -!- esowiki has joined.
14:49:31 -!- esowiki has joined.
14:49:32 -!- esowiki has joined.
14:50:35 -!- esowiki has joined.
14:50:40 -!- esowiki has joined.
14:50:40 -!- esowiki has joined.
14:51:22 -!- esowiki has joined.
14:51:26 -!- esowiki has joined.
14:51:27 -!- esowiki has joined.
14:52:08 -!- esowiki has joined.
14:52:13 -!- esowiki has joined.
14:52:13 -!- esowiki has joined.
14:52:56 -!- esowiki has joined.
14:53:01 -!- esowiki has joined.
14:53:01 -!- esowiki has joined.
14:53:34 -!- esowiki has joined.
14:53:39 -!- esowiki has joined.
14:53:39 -!- esowiki has joined.
14:54:07 -!- esowiki has joined.
14:54:12 -!- esowiki has joined.
14:54:12 -!- esowiki has joined.
14:55:08 -!- esowiki has joined.
14:55:13 -!- esowiki has joined.
14:55:13 -!- esowiki has joined.
14:55:51 -!- esowiki has joined.
14:55:56 -!- esowiki has joined.
14:55:57 -!- esowiki has joined.
14:56:26 -!- esowiki has joined.
14:56:31 -!- esowiki has joined.
14:56:32 -!- esowiki has joined.
14:57:13 -!- esowiki has joined.
14:57:18 -!- esowiki has joined.
14:57:18 -!- esowiki has joined.
14:57:44 -!- esowiki has joined.
14:57:49 -!- esowiki has joined.
14:57:49 -!- esowiki has joined.
14:58:15 -!- esowiki has joined.
14:58:20 -!- esowiki has joined.
14:58:20 -!- esowiki has joined.
14:58:51 -!- esowiki has joined.
14:58:56 -!- esowiki has joined.
14:58:56 -!- esowiki has joined.
14:59:48 -!- esowiki has joined.
14:59:53 -!- esowiki has joined.
14:59:53 -!- esowiki has joined.
15:00:19 -!- esowiki has joined.
15:00:24 -!- esowiki has joined.
15:00:24 -!- esowiki has joined.
15:00:50 -!- esowiki has joined.
15:00:54 -!- esowiki has joined.
15:00:55 -!- esowiki has joined.
15:01:41 -!- esowiki has joined.
15:01:46 -!- esowiki has joined.
15:01:47 -!- esowiki has joined.
15:02:16 -!- esowiki has joined.
15:02:21 -!- esowiki has joined.
15:02:22 -!- esowiki has joined.
15:03:13 -!- esowiki has joined.
15:03:17 -!- esowiki has joined.
15:03:18 -!- esowiki has joined.
15:04:09 -!- esowiki has joined.
15:04:13 -!- esowiki has joined.
15:04:14 -!- esowiki has joined.
15:05:08 -!- esowiki has joined.
15:05:13 -!- esowiki has joined.
15:05:13 -!- esowiki has joined.
15:06:10 -!- esowiki has joined.
15:06:15 -!- esowiki has joined.
15:06:15 -!- esowiki has joined.
15:06:42 -!- esowiki has joined.
15:06:47 -!- esowiki has joined.
15:06:47 -!- esowiki has joined.
15:07:31 -!- esowiki has joined.
15:07:36 -!- esowiki has joined.
15:07:37 -!- esowiki has joined.
15:08:06 -!- esowiki has joined.
15:08:11 -!- esowiki has joined.
15:08:12 -!- esowiki has joined.
15:08:41 -!- esowiki has joined.
15:08:46 -!- esowiki has joined.
15:08:47 -!- esowiki has joined.
15:09:16 -!- esowiki has joined.
15:09:21 -!- esowiki has joined.
15:09:22 -!- esowiki has joined.
15:09:51 -!- esowiki has joined.
15:09:56 -!- esowiki has joined.
15:09:56 -!- esowiki has joined.
15:10:39 -!- esowiki has joined.
15:10:43 -!- esowiki has joined.
15:10:44 -!- esowiki has joined.
15:11:10 -!- esowiki has joined.
15:11:15 -!- esowiki has joined.
15:11:15 -!- esowiki has joined.
15:11:43 -!- esowiki has joined.
15:11:48 -!- esowiki has joined.
15:11:48 -!- esowiki has joined.
15:12:33 -!- esowiki has joined.
15:12:37 -!- esowiki has joined.
15:12:38 -!- esowiki has joined.
15:13:29 -!- esowiki has joined.
15:13:33 -!- esowiki has joined.
15:13:34 -!- esowiki has joined.
15:14:31 -!- esowiki has joined.
15:14:36 -!- esowiki has joined.
15:14:37 -!- esowiki has joined.
15:15:05 -!- esowiki has joined.
15:15:10 -!- esowiki has joined.
15:15:10 -!- esowiki has joined.
15:15:55 -!- esowiki has joined.
15:16:00 -!- esowiki has joined.
15:16:00 -!- esowiki has joined.
15:16:45 -!- esowiki has joined.
15:16:49 -!- esowiki has joined.
15:16:50 -!- esowiki has joined.
15:17:26 -!- esowiki has joined.
15:17:31 -!- esowiki has joined.
15:17:32 -!- esowiki has joined.
15:18:01 -!- esowiki has joined.
15:18:06 -!- esowiki has joined.
15:18:07 -!- esowiki has joined.
15:18:52 -!- esowiki has joined.
15:18:57 -!- esowiki has joined.
15:18:57 -!- esowiki has joined.
15:19:25 -!- esowiki has joined.
15:19:30 -!- esowiki has joined.
15:19:30 -!- esowiki has joined.
15:20:05 -!- esowiki has joined.
15:20:10 -!- esowiki has joined.
15:20:10 -!- esowiki has joined.
15:20:55 -!- esowiki has joined.
15:21:00 -!- esowiki has joined.
15:21:00 -!- esowiki has joined.
15:21:31 -!- esowiki has joined.
15:21:36 -!- esowiki has joined.
15:21:37 -!- esowiki has joined.
15:22:06 -!- esowiki has joined.
15:22:11 -!- esowiki has joined.
15:22:12 -!- esowiki has joined.
15:23:00 -!- esowiki has joined.
15:23:05 -!- esowiki has joined.
15:23:05 -!- esowiki has joined.
15:23:50 -!- esowiki has joined.
15:23:55 -!- esowiki has joined.
15:23:55 -!- esowiki has joined.
15:24:36 -!- esowiki has joined.
15:24:41 -!- esowiki has joined.
15:24:41 -!- esowiki has joined.
15:25:07 -!- esowiki has joined.
15:25:12 -!- esowiki has joined.
15:25:12 -!- esowiki has joined.
15:25:51 -!- esowiki has joined.
15:25:55 -!- esowiki has joined.
15:25:56 -!- esowiki has joined.
15:26:39 -!- esowiki has joined.
15:26:43 -!- esowiki has joined.
15:26:44 -!- esowiki has joined.
15:27:38 -!- esowiki has joined.
15:27:43 -!- esowiki has joined.
15:27:43 -!- esowiki has joined.
15:28:32 -!- esowiki has joined.
15:28:37 -!- esowiki has joined.
15:28:37 -!- esowiki has joined.
15:29:19 -!- esowiki has joined.
15:29:24 -!- esowiki has joined.
15:29:24 -!- esowiki has joined.
15:29:52 -!- esowiki has joined.
15:29:57 -!- esowiki has joined.
15:29:57 -!- esowiki has joined.
15:30:25 -!- esowiki has joined.
15:30:30 -!- esowiki has joined.
15:30:30 -!- esowiki has joined.
15:31:20 -!- esowiki has joined.
15:31:25 -!- esowiki has joined.
15:31:25 -!- esowiki has joined.
15:32:11 -!- esowiki has joined.
15:32:16 -!- esowiki has joined.
15:32:16 -!- esowiki has joined.
15:32:56 -!- esowiki has joined.
15:33:01 -!- esowiki has joined.
15:33:01 -!- esowiki has joined.
15:33:50 -!- esowiki has joined.
15:33:55 -!- esowiki has joined.
15:33:55 -!- esowiki has joined.
15:34:32 -!- esowiki has joined.
15:34:37 -!- esowiki has joined.
15:34:37 -!- esowiki has joined.
15:35:27 -!- esowiki has joined.
15:35:31 -!- esowiki has joined.
15:35:32 -!- esowiki has joined.
15:36:08 -!- esowiki has joined.
15:36:13 -!- esowiki has joined.
15:36:13 -!- esowiki has joined.
15:36:56 -!- esowiki has joined.
15:37:01 -!- esowiki has joined.
15:37:01 -!- esowiki has joined.
15:37:46 -!- esowiki has joined.
15:37:50 -!- esowiki has joined.
15:37:51 -!- esowiki has joined.
15:38:18 -!- esowiki has joined.
15:38:22 -!- esowiki has joined.
15:38:23 -!- esowiki has joined.
15:38:50 -!- esowiki has joined.
15:38:54 -!- esowiki has joined.
15:38:55 -!- esowiki has joined.
15:39:46 -!- esowiki has joined.
15:39:51 -!- esowiki has joined.
15:39:51 -!- esowiki has joined.
15:40:19 -!- esowiki has joined.
15:40:24 -!- esowiki has joined.
15:40:24 -!- esowiki has joined.
15:41:18 -!- esowiki has joined.
15:41:23 -!- esowiki has joined.
15:41:23 -!- esowiki has joined.
15:41:57 -!- esowiki has joined.
15:42:01 -!- esowiki has joined.
15:42:02 -!- esowiki has joined.
15:42:53 -!- esowiki has joined.
15:42:57 -!- esowiki has joined.
15:42:58 -!- esowiki has joined.
15:43:24 -!- esowiki has joined.
15:43:29 -!- esowiki has joined.
15:43:30 -!- esowiki has joined.
15:43:57 -!- esowiki has joined.
15:44:02 -!- esowiki has joined.
15:44:03 -!- esowiki has joined.
15:44:39 -!- esowiki has joined.
15:44:44 -!- esowiki has joined.
15:44:44 -!- esowiki has joined.
15:45:25 -!- esowiki has joined.
15:45:30 -!- esowiki has joined.
15:45:30 -!- esowiki has joined.
15:46:01 -!- esowiki has joined.
15:46:06 -!- esowiki has joined.
15:46:07 -!- esowiki has joined.
15:46:34 -!- esowiki has joined.
15:46:38 -!- esowiki has joined.
15:46:39 -!- esowiki has joined.
15:47:30 -!- esowiki has joined.
15:47:35 -!- esowiki has joined.
15:47:35 -!- esowiki has joined.
15:48:32 -!- esowiki has joined.
15:48:37 -!- esowiki has joined.
15:48:37 -!- esowiki has joined.
15:48:45 -!- esowiki has joined.
15:48:45 -!- glogbot has joined.
15:48:49 -!- esowiki has joined.
15:48:50 -!- esowiki has joined.
15:48:59 -!- esowiki has joined.
15:48:59 -!- esowiki has joined.
15:49:03 -!- esowiki has joined.
15:49:03 -!- esowiki has joined.
15:49:04 -!- esowiki has joined.
15:49:04 -!- esowiki has joined.
15:49:37 -!- esowiki has joined.
15:49:37 -!- glogbot has joined.
15:49:41 -!- esowiki has joined.
15:49:42 -!- esowiki has joined.
15:49:56  elliott: There were two instances of the bot running ... somehow ...
15:50:01  Which caused complete madness.
15:50:05  Awesome.
15:50:10  Meanwhilst, glogbackup is nowhere to be found ...
15:50:24  Well, glogbot was still running :P
15:50:26  It just wasn't logging.
15:51:02  No, glogbackup isn't even on #glogbot.
15:51:31  Ah :P
15:52:03  For the record, glogbot has NEVER HAD A CRITICAL SYSTEM FAILURE EVER.
15:52:27  Gregor: *For the record, glogbot has HAD A CRITICAL SYSTEM FAILURE ONCE.
15:52:50  Gregor: How long until glogbot critical system failurse are like OpenBSD remote holes in the default install :P
15:53:33 -!- MSleep has changed nick to MDude.
15:53:38  X-D
16:08:12  Gregor: BTW, did you see my amazing uncheatable karma system?
16:08:16  `url lib/karma
16:08:18  http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/lib/karma
16:08:24 -!- ais523 has joined.
16:08:29  It works by using the immutable hg log to see how many people ran karma+ or karma- on a person :)
16:08:47  And now I'm wondering why not just store everything in the hg log???
16:09:00  `quote could so easily just scan for past addquote commands that haven't been delquoted.
16:09:02  No output.
16:09:46  elliott: it'd seem a bit inefficient
16:09:54  Or, a bit: awesome?
16:10:07  not really
16:10:24  also, tracking quote numbers would be awkward
16:10:28  for `delquote by number
16:12:58 -!- copumpkin has joined.
16:19:03 * ais523 reads about the expression problem
16:42:53 -!- KingOfKarlsruhe has joined.
16:53:46 -!- KittyLevina has joined.
16:54:11 -!- KittyLevina has left.
16:54:20 -!- Mithay has joined.
16:54:25 -!- Mithay has left.
16:56:07 -!- sausage2 has joined.
16:56:14  zup. What's esoteric?
16:57:42  `welcome sausage2
16:57:44  sausage2: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
16:57:51 -!- Ikarus has joined.
16:57:59  `welcome Ikarus
16:58:01  Ikarus: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
16:58:03  Alright, where are you all coming from :P
16:58:27  elliott: someone dropped the channel name in #not-math
16:58:41  Oh dear.
16:58:51  Who's someone?
16:59:07  lament
16:59:41  I guess oerjan was rather timely then.
16:59:58  For someone who hates this place so much, lament sure does seem to be namedropping it everywhere.
17:00:03  Ikarus, what, exactly, did he say?
17:00:57  hehe
17:01:17  and being here reminds me that I should break unlambda some more
17:01:36  It can get more broken?
17:01:44  Unlambda is bad, Lazy K is less bad, although elliott obviously doesn't like it because he hates everything.
17:01:54  Unlambda is prettier.
17:02:32  elliott: been working off and on on sticking unlambda in hardware
17:02:39  Ooh, nice.
17:02:41  because it is just that insane to do
17:02:44  We need more functional CPU architectures.
17:02:56  Although preferably not ones based on Unlambda.
17:03:08  Phantom_Hoover: unlambda is a good practice model
17:03:28  Phantom_Hoover: What do you have against Unlambda, exactly :P
17:04:06  It's a terrible minimal language?
17:04:18  What's terrible about it? (And who said it was meant to be minimal?)
17:04:34  "Unlambda, designed by David Madore, is a minimal functional esoteric programming language[...]" — wiki
17:04:54 -!- sausage2 has left.
17:04:55  Oh snap, the incredibly authoritative resource that is our messy wiki.
17:04:58  bbiab, time to head to the batcave^Whackerspace
17:05:08  Backerspace.
17:05:40  Phantom_Hoover: http://www.madore.org/~david/programs/unlambda/ doesn't mention "minimal" at all, by the way.
17:06:00  Does it mention gay elves (this is the only other thing I know about Madore)?
17:06:12  Gay, *functional* elves!
17:17:59 -!- Ngevd has joined.
17:19:52  Hello!
17:21:16  http://www.naturfotograf.com/UV_flowers_list.html
17:21:18  Coooool.
17:24:08  Today's freefall is pretty good
17:24:14  I say sentences of that format a lot
17:24:30  "Today's [webcomic] is pretty good"
17:25:34  EDIT: Well yes, obviously Tolkien wasn't thinking about Dungeons & Dragons when he wrote the books. It's clear that magic simply doesn't work that way in Middle-earth, and there is some good reason within the context of the story for why Gandalf can't escape from the top of Orthanc more easily. I was trying to make a humorous out-of-context observation, not criticise Tolkien. Thank you for all your correspondence on that matter. :-)
17:25:35  poor dmm
17:26:21 -!- copumpkin has quit (Quit: Computer has gone to sleep.).
17:26:22  Today's IWC annotation is kinda annoying
17:28:27  Yeah, jokes are annoying
17:30:38  When I read the annotation for 2623 I went to bed and cried
17:31:12  After making the thread on the forums for it
17:32:19  Monopoly is serious stuff.
17:39:16  Nov 25 13:25:10       terminator apparently has a lot of that.
17:39:26  kallisti: I've used Terminator, but unfortunately Swing still sucks
17:39:51  Oh, hmm, this is some completely different terminator with similar splitting functionality, heh
18:03:11 -!- calamari has joined.
18:09:15  That Wikipedia game you were playing yesterday
18:09:20  How does it work for section links?
18:09:57  last link in first section of section (there are subsections ofc)
18:11:05  And disambiguation pages?
18:12:04  another wikipedia game?
18:31:33 -!- Ngevd has changed nick to Taneb|Dinner.
18:36:23 -!- monqy has joined.
18:36:36 -!- Taneb|Dinner has quit (Ping timeout: 252 seconds).
18:48:33 -!- Taneb has joined.
18:48:59 -!- derrik has joined.
18:49:09  Hello!
18:52:58  hi
18:53:23  List of eponymous laws -> Eponym -> Folk etymology -> Historical linguistics -> Etymology -> Austronesian languages -> Malayo-Polynesian languages -> Phonology -> Laboratory phonology -> Mary Beckman -> ToBI -> Prosody (linguistics) -> Focus (linguistics) -> Topiccomment -> Functional grammar -> Role and reference grammar -> Thematic role -> Thematic relation -> Patient (grammar) -> Agent (grammar) -> Indo-European languages -> Indo-Europe
18:53:23  an languages#Suggested macrofamilies -> Signal-to-noise ratio -> Spam (electronic) -> Internet service provider -> Bandwidth -> Graph bandwidth -> Adjacency matrix -> Spectral graph theory -> Colin de Verdire graph invariant -> Schrdinger equation -> Path integral formulation -> Fractional Schrdinger equation -> Hamiltonian mechanics -> Quantum mechanics -> Quantum gravity -> Orders of magnitude (mass) -> Kilogram -> Planck constant ->
18:53:24  Cycle per second -> Hertz -> Sine wave -> Fourier analysis -> Inverse function -> Exponentiation -> Public-key cryptography -> GNU Privacy Guard -> Politics of Germany -> Weimar Constitution -> Basic Law for the Federal Republic of Germany -> Preamble -> List of enacting clauses -> Popular sovereignty -> Vox populi -> Interview -> Question -> Imperative mood -> Grammatical mood -> Classical Arabic -> Sacred language -> Religion -> Reification
18:53:29   (fallacy) -> Rhetoric -> Greek language -> English language -> Slang -> Euphemism -> Friendly fire -> Fratricide -> Siblicide -> Human -> Anthropology -> Positivism -> Auguste Comte -> Altruism -> Ethical egoism -> Individualist anarchism -> Benjamin Tucker -> Liberty (18811908) -> Pierre-Joseph Proudhon -> Loan -> Bond (finance) -> Perpetuity -> Valuation (finance) -> Lawsuit -> Civil law (common law) -> Equity (law) -> Common law -> Aus
18:53:36  tralia -> Pacific Islands Forum -> Northern Mariana Islands -> Capital city -> County seat -> List of boroughs and census areas in Alaska -> United States Census Bureau -> President of the United States -> Inauguration of Barack Obama -> National Mall -> Washington Monum
18:53:42  ent -> 2011 Virginia earthquake -> Canada -> Standard of living -> South Korea -> East Asia Summit -> Kuala Lumpur -> Petronas Towers -> Kuala Lumpur Tower -> Petronas Towers
18:56:55  that is quite a wikisurf
18:56:55  glad to syay i havemnt done that in a while
18:57:07  Ended lamely
18:57:11  But what an adventure
19:00:45  Taneb: Wow :P
19:22:31  quintopia, you had an encoding issue in your last line
19:22:38  which encoding did you use?
19:22:47  wait hm
19:23:11  that isn't an encoding issue, you just inserted a character (0x7F) instead of backspace
19:23:17  quintopia, your backspace is broken
19:44:21  Taneb: why didn't it end up at Philosophy?
19:44:39  BECAUSE I USED THE LAST LINK OF THE INTRO RATHER THAN THE FIRST
19:44:50  heh
19:47:55 -!- pikhq_ has quit (Read error: Operation timed out).
19:50:08 -!- pikhq has joined.
19:51:17  http://sprunge.us/MJeU My second Perl program is rather less crap than my first one, I think :P
19:52:25  Hello I am back?
19:52:35  Hello
19:52:49  I really should record a vlog
19:53:04  Will you be crying about Monopoly.
19:53:17  No, I got over that a long time ago
19:53:26  The crying, that is, not Monopoly
19:53:47 -!- calamari has quit (Quit: Leaving).
19:54:06  I once killed someone over a game of Monopoly.
19:54:15  By kicking them in the face
19:54:42  Yes.
19:55:02  Phantom_Hoover: Help I wrote two Perl programs and didn't feel disgusted with myself what does this mean?
19:55:25  elliott: you have enough Haskell under your belt for it to balance out
19:55:54  elliott, you must play Monopoly as penance.
19:56:53  Hey, Ahruman is in that Monopoly thread!
19:58:58  Phantom_Hoover: He's EVERYWHERE.
19:59:00  It's creepy.
19:59:06  Ahruman?
20:00:20  Phantom_Hoover: Yes. On that IWC thing. Thing thing. Thing.
20:00:30  `quote seconds
20:00:32  42)  Seconds. 30 of them. Did I forget the word? \ 529)  I suck at the gravitron, I have survived something like 15 seconds in it at most.
20:00:36  Upsetting.
20:00:42  What.
20:00:44  529 sucks.
20:01:03  Well yes but it is funny to imagine fizzie dying repeatedly at the hands of a gravity-based doomsday device.
20:01:07  This is because he isn't here dammit.
20:01:32  `quote 529
20:01:34  529)  I suck at the gravitron, I have survived something like 15 seconds in it at most.
20:01:39  Indeed it does
20:01:43  `quote
20:01:46  477)  There's that saying that the definition of insanity is doing the same thing over and over again and expecting different results.  [...]  You've just gave me a different result  [...]  It's always insane to expect different results, even when it's likely to occur.
20:02:06  Hey, it's me /and/ fizzie!
20:02:06  What about running an RNG?
20:02:17  insanity
20:06:05  Maybe that's why people are always saying QM is insane...
20:07:46  elliott: the gravitron is great
20:07:48  although very difficult
20:17:38  Synesthesia -> Functional neuroimaging -> Social neuroscience -> Social relation -> Philosophy of social science -> Structure and agency -> Nature versus nurture -> Psychological nativism -> Behaviorism -> Behavior analysis of child development -> Radical behaviorism -> Hypothetico-deductive model -> Confirmation holism -> Dark matter -> Bullet Cluster -> MACS J0025.4-1222 -> Baryon -> Pentaquark -> Resonance (particle physics) -> Planck cons
20:17:38  tant and that links to my last one
20:20:51  wat
20:22:05  Phantom_Hoover has yet to try popular new phrase, " dying"
20:22:25 -!- hagb4rd has joined.
20:22:29  wat dying?
20:22:37  Phantom_Hoover: you missed the leading space
20:22:43  it's not dying, it's  dying
20:22:50  No I didn't.
20:23:04  I appended the new phrase directly to what I previously said.
20:23:06  ais523: You're assuming "wat" was followed by a word-separating space.
20:23:21  elliott: oh, hmm
20:23:28  you mean he just ran the two words together?
20:23:31   I appended the new phrase directly to what I previously said.
20:36:52 -!- Klisz has joined.
20:43:46 -!- Madoka-Kaname has quit (Quit: Hug~♪).
20:45:42 -!- Madoka-Kaname has joined.
20:45:43 -!- Madoka-Kaname has quit (Changing host).
20:45:43 -!- Madoka-Kaname has joined.
20:50:59 -!- elliott has quit (Ping timeout: 252 seconds).
21:04:52 -!- copumpkin has joined.
21:19:23 -!- DCliche has joined.
21:23:06 -!- Klisz has quit (Ping timeout: 260 seconds).
21:40:06  Odds that me and elliott have seen each-other, based on the assumption we both live in Hexham: quite likely
21:40:07  With extra information: not likely at all
21:42:06  Also, I AM ABOUT TO MAKE AN ESOLANG
21:42:27 -!- derrik has left.
21:42:40  derrik doesn't like esolangs
21:51:52 -!- Patashu has joined.
21:53:34  Taneb, did you really cry at the Monopoly thing.
21:53:52  Darths and Droids /and/ El Goonish Shive did upsetting comics the same day
21:54:00  I cried at the combination of the three
21:54:05  But mainly Monopoly
21:54:17  So tears physically came out of your face.
21:54:24  Yes
21:54:32  I, um,
21:54:41  monopoly tears
21:54:47  You... are a little bit weird.
21:54:55  I am a lot weird
21:55:12  I mean actual weird, not nerdy weird.
21:55:17  I am the second weirdest Irregular Webcomic and Homestuck reading esoteric programmer from Hexham
21:55:31  Who played Lego Alpha Team
21:55:31  elliott didn't read IWC until the rerun.
21:55:40  HE READS IT NOW
21:56:05  I also don't think he played Lego Alpha Team?
21:56:13  I think he did
21:56:29  I mentioned it once and he was  like "OH NO!"
21:56:39  "GET OUT OF MY LIFE"
21:56:49  `logs lego alpha team
21:56:51  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: logs: not found
21:57:00  `log lego alpha team
21:57:04  `pastelogs lego alpha team
21:57:19  I didn't play lego alpha team but I'm also not from hexham and don't read iwc or homestuck
21:57:26  oops?
21:57:32  2011-11-25.txt:21:56:05:  I also don't think he played Lego Alpha Team?
21:57:32  http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/paste/paste.23320
21:57:55  monqy, you should probably read Homestuck?
21:58:04  I guess you could also read IWC or move to Hexham, though.
21:58:16  i;ve promised some guys in another channel i'll read homestuck
21:58:46  Wait, EGS is the one notable primarily for gender swaps, right?
21:58:52  Yes?
21:58:59  so i'll probably read it in a week or so because winter break is then
21:59:07  I read it for the squirrel girl
21:59:12  Who is also half-alien
22:00:21  Taneb, furry xenophile asexual.
22:00:46  from hexham
22:01:12  /demi/xenophile
22:02:05 -!- KingOfKarlsruhe has quit (Quit: ChatZilla 0.9.87 [Firefox 8.0/20111104165243]).
22:03:53  But yeah, I am very weird
22:04:23  Now invent the game about squirrel girl who is also half-alien
22:04:27  This is no longer a point in dispute.
22:04:30  `quote octopus
22:04:33  231)  Invent the game called "Sandwich - The Card Game" and "Professional Octopus of the World" (these names are just generated by randomly) \ 262)  ais523: Maybe it is better, because I don't think the octopus will live very well in the tree. But the difference is that the Internet is lying and you cannot see such things; you could make modified picture, though, in order to lie more clearly, at least.
22:06:17  Wikipedia has three pages for "Lie algebra".
22:06:44  Whose website is "www.kom-posti.fi" and why is Chrome suggesting I go on it when I want to go on k related things?
22:27:34  In D&D game, there is really two major goals at once. One is to kill the green devil and the other is to help the Navy to deliver something to some remote town.
22:31:06 -!- DCliche has quit (Read error: Connection reset by peer).
22:31:30 -!- DCliche has joined.
22:48:24  Do you have a game "Sokoban on Drugs"?
22:48:31  no
22:48:38  I don't have, either.
22:48:45  I do not also
22:48:47  I do.
22:49:21  It's pretty fun, although the non-Euclidean grid's a bit tricky to get used to.
23:04:30 -!- Taneb has quit (Ping timeout: 276 seconds).
23:07:20 -!- Taneb has joined.
23:10:31  I played 4 people shogi (with partners); I won by discovered checkmate due to the losing player's partner placing a piece on the previous turn, blocking the escape route (note: you are allowed to capture your partner's pieces but you are not allowed to move into check even from your partner's pieces)
23:12:52 -!- DCliche has changed nick to Klisz.
23:20:06  How well can you see the moon if you use ten high-powered telescope lenses?
23:20:17  "Shark fins are the main ingredient in shark fin soup" <-- thanks, Discovery
23:23:39  Egypt: the new Russia? Discuss
23:27:06  Does "BBS" stand for "Be back soon"?
23:27:09  For the love of god I want a bath again.
23:27:26  Why do I always want a bath two hours after having a bath would be a good idea.
23:28:24  I garden pathed on that one
23:28:25  oops
23:28:25  Because you are secretly ICELANDIC
23:28:57  monqy, which one?
23:29:08  htat one
23:30:43  Be back soon
23:30:47 -!- Taneb has quit (Quit: Leaving).
23:40:09 -!- pikhq has quit (Ping timeout: 244 seconds).
23:40:15 -!- pikhq_ has joined.
23:45:43 -!- Ngevd has joined.
23:45:50  Hello!
23:46:14  I think I'll learn DOS Batch
23:47:36  'Learn'.
23:48:02  Write an Eodermdrome implementation, we need one of those.
23:48:46 * Phantom_Hoover → sleep
23:48:48 -!- Phantom_Hoover has quit (Quit: Leaving).
23:55:22  Was Phantom_Hoover meaning in DOS Batch, or just in general?

2011-11-26:

00:00:27 -!- yiyus has quit (Ping timeout: 240 seconds).
00:00:43 -!- oerjan has joined.
00:02:27 -!- hagb4rd has quit (Ping timeout: 240 seconds).
00:04:28 -!- Klisz has quit (Quit: You are now graced with my absence.).
00:05:51 -!- sebbu2 has joined.
00:05:55   I guess oerjan was rather timely then. <-- namedropping us is bad now? >:P
00:05:55  oerjan: You have 1 new message. '/msg lambdabot @messages' to read it.
00:05:58 -!- sebbu2 has quit (Changing host).
00:05:58 -!- sebbu2 has joined.
00:08:27 -!- sebbu has quit (Ping timeout: 240 seconds).
00:09:46 -!- Ngevd has quit (Ping timeout: 265 seconds).
00:10:27 -!- jix has quit (Ping timeout: 240 seconds).
00:10:51 -!- atehwa has quit (Ping timeout: 240 seconds).
00:10:57 -!- atehwa has joined.
00:11:26 -!- jix has joined.
00:13:30 -!- yiyus has joined.
00:18:16   I say sentences of that format a lot <-- maybe you could define an alias.
00:18:56  oops, he just left.
00:24:28   Ended lamely <-- that Capital city article seems to show up often.
00:28:24  @tell elliott  Phantom_Hoover: Help I wrote two Perl programs and didn't feel disgusted with myself what does this mean? <-- i don't understand the question >:)
00:28:25  Consider it noted.
00:33:01  @tell elliott it means you should embark on a long soul-searching quest to discover who you really are.
00:33:01  Consider it noted.
00:34:50 -!- ais523 has quit (Remote host closed the connection).
01:04:13 -!- Klisz has joined.
01:04:48 -!- derdon has quit (Remote host closed the connection).
01:14:35 -!- Vorpal has quit (Ping timeout: 258 seconds).
01:28:54 -!- hagb4rd has joined.
01:45:02 -!- kallisti has quit (Ping timeout: 244 seconds).
01:47:41  hm retrying United States with elliott's section rule changes the path after Syphilis#Tertiary
01:49:04 -!- itidus21 has joined.
01:49:27  Syphilis#Tertiary -> Aortic aneurysm -> Bleeding -> Blood donation -> Shelf life -> Eating -> Activities of daily living
01:53:26  -> Old age -> Geriatrics -> Greek language -> English language -> Slang -> Euphemism -> Friendly fire -> Fratricide -> Siblicide -> Human
01:56:24  -> Anthropology -> Positivism -> Auguste Comte -> Altruism -> Ethical egoism -> Individualist anarchism -> Benjamin Tucker -> Liberty (1881–1908) -> Pierre-Joseph Proudhon
01:58:07  -> Loan -> Bond (finance) -> Perpetuity -> Valuation (finance) -> Lawsuit
01:58:40  fart -> punk rock -> the offspring -> alternative songs -> coldplay -> teenage cancer trust -> wirral -> Wirral Metropolitan College -> Wirral Peninsula -> Hundred (county subdivision)
02:00:14  -> Civil law (common law) -> Equity (law) -> Common law -> Australia, which i'm sure i saw earlier today and i think it ended up eventually in the Petronas Towers loop
02:01:48 -!- Klisz has quit (Quit: You are now graced with my absence.).
02:02:49  -> japan -> infant mortality -> child mortality -> Millennium Development Goals -> AIDS -> Needle-exchange programme -> HIV -> Cancer -> List of causes of death by rate -> World Health Organization -> United Nations Development Group -> United Nations Development Programme -> Human Development Report -> (loops back to United Nations Development Programme)
02:03:54  itidus21: sounds like the end there might be another common one
02:04:07  curiously DMM also enters the japan set
02:04:18  david morgan-mar?
02:05:30  David Morgan-Mar -> Canon (company) -> Ōta, Tokyo -> Kamata Station (Tokyo) -> Japan ->
02:06:50  yeah he works at Canon, so it's not that strange
02:08:43  Norway -> Human Development Index -> Human development (humanity) -> Capability approach, this looks familiar.
02:08:52 -!- itidus21 has quit (Read error: Connection timed out).
02:09:26 -!- itidus21 has joined.
02:12:09  ah, that one ended in the Tests of general/special relativity loop
02:23:47  Which house systems is it possible to make a sundial to project?
02:24:09  heh
02:24:32  that reminds me of the digital sundial (a mathematical construction which iirc requires the axiom of choice)
02:25:25  I have read about digital sundials in Wikipedia that uses optical fiber to cause the light to make up digits
02:26:25  The mathematics for fractal digital sundial is described but I do not see a mention of the axiom of choice
02:26:53  oh it doesn't require it, it seems, and is actually practical?
02:28:06  digital sundial eh? so the idea is a sophisticated mapping of sun direction to light up a display of arabic numerals?
02:28:09  cool idea
02:28:59  yeah
02:42:04  zzo38: you'd want a house system which can be determined from the precise position of the sun in the sky, presumably.  and i think there will be at least some positions that happen twice in a year as the sun wanders between the tropics in both directions
02:43:01  but perhaps those two days will also have matching houses
02:43:23  (that is, each day in spring will have a matching day in autumn)
02:44:40  or very close to matching
02:46:15  Does it have anything to do with analemma or Sun declination (in equatorial coordinates)?
02:46:28  i don't know what those are
02:46:58  "In the final issue of Batman R.I.P., the Joker explains to an organization trying to destroy Batman that there is no use trying because Batman is always so far ahead in figuring out every scheme against him. Joker attributes this to _apophenia_, saying that he has literally been driven insane by this alone."
02:47:36  Equatorial coordinates means measure position of planets and sun and so on on the equatorial plane. The other way is to use the ecliptic.
02:48:54  zzo38: well the tropics are the largest magnitude latitudes of the sun in that system, i assume
02:49:23  Yes, that is correct.
02:51:47  According to Wikipedia: "Since the Earth's mean solar day is almost exactly 24 hours, an analemma can be traced by plotting the position of the Sun as viewed from a fixed position on Earth at the same clock time every day for an entire year." Using the horizon view and timed exposure modes in Astrolog, you can plot the analemma on the computer.
02:54:08  (The analemma is plotted using azimuth/altitude coordinates)
02:54:40  so yes, the analemma would be relevant.  although you'd really want an analemma based on when you're in the same _house_ position each day
02:54:55  and if those don't intersect, you can make a sundial.
03:00:17  hm...
03:00:36  *when the sun is in the same house position
03:04:04  "If space in the heavens is the basis for house division, the sky is divided into equal arcs of 30° each. Here, too, a difference will be made as to whether these divisions are made based on the ecliptic, or on the celestial equator."
03:04:10 -!- Klisz has joined.
03:04:41  i'd _guess_ that if you use the celestial equator, a house will be a fixed part of the sky, so should work with a sundial.
03:04:50  and easily.
03:11:23  As far as I know house systems always place the cusps on the ecliptic (although the different systems might project the equator or prime vertical or whatever). Regiomontanus houses: "The celestial equator is divided into twelve, and these divisions are projected on to the ecliptic along great circles that take in the north and south points on the horizon."
03:11:35  Campanus houses: "The prime vertical (the great circle taking in the zenith and east point on the horizon) is divided into twelve, and these divisions are projected on to the ecliptic along great circles that take in the north and south points on the horizon."
03:13:26  mhm
03:44:56 -!- copumpkin has quit (Quit: Computer has gone to sleep.).
03:57:43 -!- madbrain has joined.
03:57:47  hey
03:57:53  ho
03:57:55 -!- madbrain has changed nick to madbrrr.
03:58:04  cold, is it?
03:58:17  in montreal, yeah :D
03:58:35  trying to figure out if chess is turing complete
03:58:49  sounds good
03:59:00  if you allow walls and an infinite board and an infinitely repeating pattern for the infinite tape
03:59:10  infinite chessboard, same distribution of pieces?
03:59:27  no basically your program is the initial setup :D
03:59:35  oh
03:59:45  and the output is?
03:59:49  madbrrr: well then the question is what is a wall...
03:59:50  shortest checkmate?
04:00:06  like a part of the board?
04:00:07  itidus: space that pieces can't go through
04:00:33  exept that horses can still jump over it
04:01:13  quintopia: whether it's the white or the black player that can win 100% of the time perhaps?
04:01:40  Essentially you take one small walled corner somewhere
04:01:46  and setup the white king
04:01:54  1 move away from being checkmated :D
04:02:03  i'm confused
04:02:03  i dont know enough about turing machines to actually add to this
04:02:09  lol
04:02:12  so to stay alive he has to keep the black king in check
04:02:17  oh right
04:02:24  you only need one bit of output
04:02:26  duh
04:02:49  so basically each move, the white player must do one move to keep the black king in check
04:03:05  and then the black king has to move out of check
04:06:04  obviously with setups of rooks you can move the king around
04:06:19  but can you, say, store a bit?
04:06:59  madbrrr: er, you're not referring to castling, because the king can only do that on its first move
04:07:28  and not while in check, iirc
04:07:56  nah I don't think castling could be used to perform computation
04:09:00  indeed
04:09:32  if brainfuck can do computation then chess can
04:10:06  "Some other generalized games, such as chess, checkers (draughts), and Go are EXPTIME-complete because a game between two perfect players can be very long, so they are unlikely to be in PSPACE. But they will become PSPACE-complete if a polynomial bound on the number of moves is enforced.
04:10:12  "
04:10:35  may be relevant
04:10:52  say you have this setup
04:10:52  ###############
04:10:53  #R R        #r####
04:10:53  #RR         #   K#
04:10:53  ##  k       ######
04:10:53  ############
04:11:00  that's for arbitrary large, but finite board, of course
04:11:02  white to play
04:11:21  if white does anything other than check the black king, he's dead
04:11:41  a wall is essentially a hole in the board, isn't it.
04:11:45  yeah
04:11:48  so part of the board shape
04:12:15  might be possible to do computation without walls but I'm starting with the simpler case
04:12:44  now, to check the black king, white has to move one of his rooks
04:12:45  hmm
04:14:17 -!- Slereah has joined.
04:14:18  There are four ways for the uppercase player to put the lowercase player in check as far as I can see.
04:14:20 -!- kmc has joined.
04:14:52  zzo: except the black king can escape from the small diagonal hole :D
04:15:21  In tsume shogi, too, you are required to put opponent in check on every turn
04:15:53  madbrrr: Yes, I can see that; eventually black will win. However white can still put black in check
04:16:30 -!- Slereah_ has quit (Ping timeout: 276 seconds).
04:16:54  the idea is to come up with a setup where you force the king through a set of corridors
04:17:21  which moves the white's pieces around
04:17:42  and have computation using those pieces' position
04:19:43  it looks to me like that setup is a checkmate by moving an R down...
04:20:07  no see once you get to this:
04:20:19  i mean the one you pasted
04:20:56  ###############
04:20:56  #R       R  #r####
04:20:57  #R        R #   K#
04:20:57  ##         k######
04:20:57  ############
04:21:04  white to play
04:21:12  next move is obviously
04:21:25  ###############
04:21:25  #R         R#r####
04:21:25  #R        R #   K#
04:21:25  ##         k######
04:21:25  ############
04:21:31  madbrrr: er i'm saying that the first one you pasted will never get to that point because it's a one-move checkmate
04:21:44  oh
04:21:51  heh right
04:22:14  so many Rs that he can just block all 3 rows, right
04:22:41  Yes it is a one move checkmate
04:22:54  hmm
04:23:16  It is possible to change it, I suppose? Would it help to add new kind of pieces such as the Chinese cannons?
04:23:32  well
04:23:51  I'm trying to find something where you don't have to forbit perpetual check
04:23:56  *forbid
04:24:31  oh i'm guessing that's not necessary.  i mean the EXPTIME thing i pasted must essentially imply that it's possible to do arbitrary _finite_ computation, so it would be strange if an infinite board wasn't TC
04:24:39  like this
04:24:40  ###############
04:24:40  #RR         #r####
04:24:40  ##          #   K#
04:24:40  ## k        ######
04:24:40  ############
04:25:03  black king can just force a draw by going back and forth
04:25:03  Chinese cannon = When not capturing, moves the same as a rook, but when it is capturing, there must be exactly one piece (of any color and type) in between the from square and the target (this piece in between is called a "screen" and is unaffected by this move)
04:25:25  zzo: hm
04:26:15  I'm trying to do it with FIDE pieces only :D
04:26:32  but if there's no good way it might require some extra pieces yeah
04:27:20  an idea just occured to me
04:27:21  "That is why all the games were modified by playing them on an n × n board instead; in some cases, such as for Chess, these extensions are somewhat artificial and subjective."
04:28:01  so it is possible that it requires something else.  but the walls seem to me like such a thing already.
04:28:07  And then, what are rules for pawns going to be? I suppose it can be based on the relative positions of pawns to walls
04:28:08  a lot of the time these games are about static pieces.. but game of life is a game about dynamic objects on a board
04:28:48  zzo: I was thinking white pawns go up, black pawns go down :o
04:29:04  itidus21: well it's unusual in that you change a lot of cells simultaneously
04:29:25  madbrrr: Yes, but I mean for double step and promotion
04:29:36  oerjan: but suppose that a game like chess had pieces which had rules which didn't allow them to sit still unless they were stuck
04:30:05  zzo: dunno, was thinking of presuming that the game was ongoing so no double step
04:30:19  im going off on a tangent though... big tangent
04:30:21  and promotion, well, they'd have to reach the top of the program for that no? :D
04:30:38  itidus21: mind you there are other kinds of games where one player makes a lot of moves in their turn, like RISK
04:31:21  a lot of strategic conquest games, in fact
04:31:25  itidus21: You could have the game, each piece has to move exactly once on your turn; if they are stuck, they don't move, and if all your pieces are stuck you are stalemated.
04:32:02  Vinci is another that comes to mind
04:32:14  *catches my breath trying not to derail the other topic too far* like a set of rules for each piece which it has to follow..
04:32:50  that you don't tell a piece where to move each turn, it does it on its own.. and you just have some limited control .. like maybe allowed to specify movements of n pieces per turn
04:33:24  then you might for instance have pieces which explore the edges of a room
04:33:32  uh room? i mean an enclosed space
04:33:53  or pieces which move across a space back and forth
04:34:02  sounds like something that must already have been made.
04:34:14  everything has already been made(tm)
04:34:48  hmm
04:34:51  its probably just not very easy to do on a board
04:34:59  more of a computer-powered task
04:34:59  well, everything that doesn't require a new invention to work
04:35:11  that's sort of tautological
04:35:36  uhm
04:35:53  so in my minds eye i see like a 16bit role playing game village
04:36:07  where each townsfolk is performing some patterned walking
04:37:26  i'd be surprised if there wasn't someone here who had played such a game.  but i don't play that kind of games much, and i don't ... oh wait, lemmings is a bit like that
04:37:52  damn it
04:38:04  it's hard to find a good contraption using chess pieces
04:38:36  madbrrr: you want it to be deterministic, too, to encode a TM
04:39:23  oerjan: that means you need a setup where there is only one possible check on each move
04:39:32  and one possible king move in response
04:39:50  madbrrr: well or only one possible which doesn't allow the king to escape
04:39:58  in an unwanted direction
04:40:12  sounds hard to evaluate
04:40:45  well but it's the kind of evaluation you need for solving chess problems, anyway...
04:40:52  You could have game involving the board changing. One possibility is the board changes size after every few turns, or they have night time and day time, another idea I had is a game that adds a dimension every few turns. Or have cards that adjust the rules for the board.
04:41:21  and it might not have to take _long_ to escape.  just in case you need a little extra flexibility beyond a single immediate possibility
04:41:59      ##
04:41:59     ## #
04:41:59    ## # P
04:41:59   ## # P
04:41:59  ## # P
04:42:00  #k# P
04:42:00  ## P
04:42:01  ##PP
04:42:12  this one is fairly deterministic
04:42:37  P is for pawn?
04:42:41  but non resettable :(
04:42:42  yeah
04:43:04  yes the resetting might be tricky.  in fact you can just about ignore pawns for this reason.
04:43:36  yeah that leaves rooks, bishops, knights and queens
04:43:49  and extra kings
04:44:25  extra kings feels like cheating.
04:44:25  oerjan: :-? lemmings is a lot like that. nice point
04:44:43  queens seem to have too much range
04:45:02  Although an idea I have thought of this year is a game that uses a horoscope as the board, updating in real time (so the time you take to make your move has consequences; obviously a time limit would also be required for each turn); you could have cards, with certain configurations you make allows you to play cards to adjust harmonic factors and house settings and whatever
04:45:02  hard to make setups where they only can give one possible check
04:46:04  A game I have read about is called Quintuple Arcana, I don't know much about it except for: * The board and pieces * It has complete information and non random * The rules are extremely complicated and modes change depending on things in the game * There are even different levels of rules
04:46:06  that leaves mostly rooks, bishops and knights
04:46:19  oerjan: so with the lemmings idea.. you could have a stream of pawns coming out of one tile every few moves, and your job is then to assign it a role such as queen or rook or knight
04:46:43  itidus21: Or bishop, too
04:46:51  and some deterministic behaviour for each one
04:47:05  there could be something in that
04:47:36  wait how does dwarf fortress fit in this :P
04:47:46  i havent played dwarf fortress
04:47:49  :))
04:47:49  me neither
04:48:04  #
04:48:04  #  B          ###
04:48:04  #  B           R#
04:48:04  #BB#  k       ###
04:48:04  #########
04:48:05  dwarf fortress fits into everything
04:48:12  but from listening to those who do, it sounds like it has lots of roles
04:48:31  and somewhat self-determining characters
04:48:38  so i can imagine uh 2 aristocrats sitting by a board while a servant shifts the pieces around
04:49:26  and the notations would be something like: g5 to bishop
04:49:44 * Sgeo is now reading Dr. McNinja
04:49:55  I made up a game called "Giveaway Chess Puzzle", where you can make one move each turn. Goal is to lose all of your pieces. You must capture if able, otherwise you can make any move (if more than one capture is possible, you can choose which one). On computer player's turn, they automatically make all possible captures simultaneously.
04:50:02  yeah ok bishops might do it
04:50:04  madbrrr: you are going to somehow need pieces to be able to check in different contexts to reset things
04:50:32  oerjan: the chess -> lemmings conceptual bridge there was quite wonderful
04:50:39  heh
04:51:02  I wonder what's the computational class of lemmings
04:51:06  That can allow two pieces to end up in the same place. If they are the same kind of piece, it becomes a single piece of that kind. If they are different kind, it becomes a piece that cannot go. A computer player's piece might capture more than one thing, duplicating itself. If computer player's pieces cannot capture, you lose.
04:51:38  it's likely that lemmings has a crazy computational class like NP complete
04:51:45  It doesn't have promotion, en passan, double step, check, checkmate, castling, etc
04:52:08  sort of like how in the movie The One, he kills his multiverse selves to become more powerful
04:52:10  madbrrr: NP complete is nowhere near crazy enough there :P
04:52:29  http://en.wikipedia.org/wiki/PSPACE-complete#Discussion
04:53:39  particularly last half
04:54:37  :((
04:55:19  heavy math topics made all the more inviting by board games
04:55:22  and by that i mean that the first half is more likely to explode your brain, and doesn't really talk about games.
04:55:40  well
04:55:42  hmm
04:56:26  lemmings can present an obstacle that requires either N bashers, or M diggers
04:56:33  for any value of N or M
04:56:36  oerjan: thanks for recognizing the brain exploding potential of these things
04:56:54  itidus21: your :(( gave me a bit of a clue there :P
04:57:09  in fact it can present an obstacle that can be crossed with any combinations of bashers/diggers
04:57:18  im sick of these assholes in my other chatroom ..
04:57:26  i like half of them. and the other half i don't
04:57:37  1/N, 2/M, 3/O, 4/P, 5/Q, 6/R....
04:58:04  can ignore about 40% of them.. but that remaining 10% causes all the grief
04:58:34  in fact an obstacle can have more or less any number of paths through it
04:59:02  those paths can require any combination of bashers, diggers and builders
05:01:35 -!- madbrrr has quit (Read error: Connection reset by peer).
05:02:52 -!- madbrrr has joined.
05:03:52  I don't think you can setup an infinite tape in lemmings
05:04:00  or maybe even infinite lemmings
05:04:39  i don't like puzzles.. i don't know why..
05:05:09  the very word puzzle makes me kind of run away from a game
05:05:32  best games are the ones where you have to plan
05:05:37  might be that i'm dumb
05:05:40  example: mario 64
05:06:03  the thing about mario you see... is that mario isn't just a puzzle dressed up with pretty pictures
05:06:22  in mario 64 you run around the level
05:06:29  just for the hell of it
05:06:29  http://en.wikipedia.org/wiki/Game_complexity
05:06:30  yeah...
05:06:38  and figure out that it has a bunch of paths, each with deadliness N
05:06:44  then find out a star
05:06:58  surprise, to get that star, you have to go in spots X, Y Z
05:07:10  yeah....
05:07:16  the puzzle is figuring out the path that has the least overall deadliness
05:07:26  perhaps by that time it did start to become a puzzle
05:07:55  its very difficult for me to put into words
05:07:58  A lot of games are puzzles, but very, very cleverly hidden puzzles
05:08:15  but theres a fine line between game and non-game i think
05:09:00  <3 lemmings
05:09:05  like, a good action game is about figuring out the game world and how to pass through its typical obstacle setup
05:09:14  i wonder which neuroses affect my interest in puzzle games
05:09:36  that's part learning timings etc, but also it's a puzzle
05:09:47  i was never content with just getting through lemmings levels
05:09:50  i had to go back and save my blockers too
05:09:51  ;)
05:09:56  iti: it's the presentation... some puzzle games can have a very boring presentation
05:10:14  ex: sokoban
05:10:20  i couldn't care less.. unless it has boring puzzles :P
05:10:20  i love nothing more than to philosophize about these things
05:10:25  sokoban is boring
05:10:29  dude pushing boxes? fuck you
05:10:31  it's fine as a component of other puzzle games
05:10:36  or a theme level
05:10:41  but i don't want to play 100 sokoban levels in a row
05:10:54  the best puzzles have mechanical ingenuity and also variety
05:10:57  puzzles become more interesting when they involve punching a dude in the face
05:10:59  theres this element of representation which the presentation adds
05:11:18  i mean " iti: it's the presentation... some puzzle games can have a very boring presentation"
05:11:36  representation as in, representing things from the real world, or from other works of fiction
05:11:56  and the presentation can bring that representation
05:12:28  to me, that is one of the advantages of 3d games which can more closely represent the world around us
05:12:45  other thing that I don't like: games where you can never kill the badguys
05:12:58  only stun them for a couple seconds
05:13:11  so perhaps for people who like puzzle games, they are more capable of abstractly relating the business in a puzzle back to the real world
05:13:21  http://67.168.184.168:81/leet1.gif - leet7.gif :>
05:13:22  whereas someone like me requires that shallow relation
05:13:24  tricksy lemmingses
05:13:50  no idea itidus
05:13:56  humm
05:13:57  i don't care if it is anything like the real world :P
05:14:17  one of my three favorite puzzle games has a marble that you move around with the mouse and basically play a game of memory with
05:14:22  (through numerous obstacles)
05:14:36  it's not very world-like :)
05:14:43  ok so the problem with sokoban is that you can't learn much from it perhaps?
05:14:54  for me, the problem with sokoban is that it's boring
05:15:03  its just fundamentally boring basically? :D
05:15:04  what i want from a puzzle game is FIGURING OUT NEW THINGS
05:15:15  there's only so many ways you can figure out how to push a box in four directions
05:15:20  everything after that is just variations on a theme
05:15:34  i don't mind variations on a theme either, but it's rather monotonous in a game as simple as sokoban
05:15:46  my favorite games have lots of variety, lots of levels, and they never bore me :)
05:16:30  most of the time i like them with complex interactions, like chip's challenge or something
05:16:34  where there are lots of different pieces
05:16:34  hmm yeah.. theres rarely real world sokoban puzzles... but it would make an interesting take for a "saw" movie
05:16:38  but at the same time
05:16:45  another of my favorites is crystalex
05:16:52  and that's a pretty simple game, it just had great level design
05:16:59  you have a little ball that bounces up and down
05:17:03  you move it left and right
05:17:07  Game such as Hero Mesh can have a lot of level and lot of pieces. Currently you have to pay, but I have been working on a similar kind of thing but with Free software (and with some other things fixed too; so files cannot be directly compatible)
05:17:08  like.. someone trapped in a real world sokoban puzzle..with an ipad in his hand showing him the current state of things
05:17:14  lol
05:17:26  never heard of hero mesh
05:17:36  nope..
05:17:53  you mean mesh:hero ?
05:17:59 -!- MDude has changed nick to MSleep.
05:18:01  I have written a PHP version once which is more than half complete but is slow and crashes a lot.
05:18:05  looks like my kind of game
05:18:08  Later I will write a better program in C.
05:18:09  kind of dated graphics though
05:18:15  not that that matters much to me
05:18:18  if the puzzles are good ;)
05:18:27 -!- hagb4rd has quit (Ping timeout: 240 seconds).
05:18:38  Yes the puzzles are good.
05:18:44  actually it looks quite a bit like a ripoff of chip's challenge haha
05:18:48  collect the chips/collect the hearts
05:18:49  hmmm
05:18:49  ;p
05:18:53  i just think it would be very funny if there was some movie about a sokoban killer who traps his victims in sokoban mazes
05:19:00  You can make up your own kind of pieces too.
05:19:04  http://www.puzzlebeast.com/ has some basic multi element puzzles that are taken to the extreme using genetic algorithms to make difficult levels
05:19:09  for the hardest ones you have to look extremely far ahead
05:19:12  haha
05:19:26  genetic algorithms based on what fitness function? how many players solve them?
05:19:26  :P
05:19:39  based on how difficult it looks to solve
05:19:46  hmm
05:19:47   Ithink it looks at how long the solution is, as well as how many branches there are
05:19:50  it xplains it on the site
05:19:57  i wonder if they already made a sokoban the movie trailer
05:19:57  http://www.puzzlebeast.com/about/index.html
05:20:02  interesting
05:20:18  i remember some dude who tried to make a genetic shmup
05:20:24  the fitness function was how long someone played it for
05:20:24  haha
05:20:30  I will probably have even more limited graphics in my version, such as no animation and only one size of icons. As well as removing some other commands and adding a few new ones.
05:20:37  btw, mesh:hero reminds me (just looking at it not playing it) of drod and wonderquest
05:20:39  have you played those?
05:21:35  Depending on the level, you might not necessarily have to collect all the hearts. There can be different kind of rules you can program in, involving different kind of things.
05:22:53  nope and nope
05:22:59  i'm sure there's lots i haven't played
05:23:04  i have a particular hatred of boulderdash though
05:23:10  it's not boulderdash's fault
05:23:13  its all the clones
05:23:13  :P
05:23:35  http://www.puzzlebeast.com/slidingblock/sliding_irritating.html <- irritating indeed
05:23:39  that wasn't a fun puzzle, just a long one
05:23:39  :(
05:23:42 * myndzi\ tries the next one
05:23:42  I intend to remove the GotoLevel command, since WinLevel and LoseLevel can imply those. As well as making object pointers not be machine pointers (preventing crashing and randomness), having restrictions on IgnoreKey (preventing breaking replayability), and so on.
05:23:52  I have not played drod and wonderquest
05:24:18  is it possible to shrink the resolution of MESH:Hero? It's taking up more than my current screen
05:24:24  also the java implementation leaves a lot to be desired
05:24:25  Patashu: Yes.
05:24:40  View -> Image size A
05:24:48  oh wait
05:24:48  drod
05:24:51  deadly rooms of death
05:24:56  i didn't recognize it lowercase
05:25:03  i'm ambivalent towards that one
05:25:13  i played a bunch of kroz levels as a tiny kid haha
05:25:29  I don't see a 'view' button
05:25:31  I'm on the demo
05:26:05  one thing about presentation/display of a game is that various presentation(im overusing this word) methods just work more naturally with how our mind reacts to the world
05:26:45  like we have the understanding there already to process 3d coloured shapes... to compare 3d coloured shapes
05:27:14  so, if we ignore these processing facilities of the brain we can potentially make some comprehensions more burdensome
05:27:26  Patashu: The new version might have all those problem; I have the old version. I can make a shareware copy of the old version
05:27:31  and also our facility for symbolic association and so on
05:27:31  ah
05:28:31  like seeing a bar graph comparison of 10 vs 15.. compared to seeing the numbers 10 vs 15
05:28:47  they probably each have their own perceptive biases
05:30:07  well that is.. in a bar graph it becomes a representation of ratio of 2:3
05:30:57  so the numbers will give us more accuracy in doing arithmetic, but in actually comparing i would wonder if we better compare the bargraph
05:31:01  i guess i just don't have any trouble with abstract visualization
05:31:09  i mean, when you're solving a puzzle, usually associations harm you
05:31:38  (associations lead to assumptions, and assumptions prevent new ideas)
05:32:19  haha this shit's got lasers and fire and balloons and stuff
05:32:21  classic :)
05:32:26  What kind of associations and assumptions?
05:32:31  myndzi\: i think i'm just not that smart really.
05:32:31  any kind
05:32:43  the key to solving puzzles is to always be able to come up with new ideas
05:32:53  it helps if you're good at coming up with ideas that are close to correct
05:33:03  but most people i've seen get stuck by running out of ideas
05:33:05  i can't get anything out of a puzzle unless the relationship of the puzzle to the real world is obvious and shallow
05:33:18  that's too bad :(
05:33:29  im not sure why though
05:33:36  i blame it on some neuroses
05:34:08  hmm
05:34:22  perhaps
05:34:28  i've been doing puzzles since i was a little kid
05:34:34  my dad used to buy me one every birthday and every christmas
05:34:48  he eventually got pissed because they never lasted past the day i got them
05:34:49  :>
05:35:04  he told me in the end he would just go into puzzlettes and be like 'what's the hardest puzzle you have?'
05:35:34  but even so, variety is required to hold my interest; i couldn't for example get heavy into block disassembly puzzles or something like that
05:35:41  i have a few of many different kinds
05:35:47  :)
05:36:05  one of my favorites is evil
05:36:06  Note the old version is 16-bit program. It does not allow loading or creating puzzle sets with more than three levels, but it does allow programming your own rules (unlike the new shareware version).
05:36:20  it's a little cage that holds a steel marble
05:36:44  http://www.calendars.com/img/p/400/200100010306.jpg
05:36:54  last person i let try to solve it bent the bars and still didn't get it out :(
05:36:56  i had to get a new one
05:37:12  my old one was old enough that it had a shiny spot in the middle of the bars from friction with the ball haha
05:37:15  so what are you meant to do?
05:37:23  it's not obvious? :P
05:37:26  myndzi\: i find it all too easy to think up impossible situations.. do you find that your understanding of puzzles helps avoid such things?
05:37:31  goal = remove steel ball
05:37:46  itidus21: not sure what you mean
05:37:54  do you mean you give up too easily?
05:38:12  i'm not sure i could come up with a situation that i could declare absolutely impossible :P
05:38:19  i mean, i'm not gonna float up into space and walk on the sun anytime soon
05:38:22  but you can't quite rule it out
05:38:23  ;D
05:38:34  humm
05:39:00  impossible means... never, in all time
05:39:05  i prefer highly improbable :)
05:39:06  myndzi\: ok so one of the nastiest puzzles i suppose is... you're on death row.. you don't want to die.
05:39:30  that's it?
05:39:42  umm, solution: don't commit felonies
05:39:42  :P
05:39:52  or, weasel your way around the legal system for decades
05:39:59  or just man up and get it over with
05:40:00 * myndzi\ shrugs
05:40:07  now on the surface it must seem impossible as if god himself (not to purport some religion) built the prison
05:40:08  i don't consider that a puzzle, it's a situation
05:40:12  puzzles have solutions :)
05:40:33  ok.. would you say then that some situations don't have solutions? :>
05:40:52  well, if you're on death row there are still solutions
05:41:00  doesn't mean they've very likely, but there ARE possibiliites
05:41:15  presidential pardon, for example :P
05:41:33  new evidence, jail break, bribery, nuclear holocaust... heh
05:41:39  hehe
05:41:46  zombie breakout
05:41:58  so anyway.. i think such things is the uh... the true power of the master puzzle solver
05:42:15 * myndzi\ shrugs helplessly
05:42:26  solving difficult situations
05:42:28  i remember distinctly one time when my little brother was having a go at one of my block puzzles
05:42:45  this kind is made up of these c-shaped wooden blocks of various length
05:42:46  s
05:42:54  theres something on wiki about learned helplessness
05:42:55  I can provide the "Hero Mesh PHP" to you too if you want, but notice it is slow and incomplete and it crashes a lot.
05:43:12  http://www.adamdorman.com/_images/3d_wood_block.jpg
05:43:13  something like that
05:43:28  though the shape of that one is much different
05:43:41  there was a combination of five pieces required to make a basic shape that repeated throughout the puzzle
05:43:46  two long ones like this []
05:43:51  two short ones clasping around the bottom of them
05:43:59  and one going "through" and "up" hooking over the short ones; it all locks itself together
05:44:06  that may not be very well-explained
05:44:24  anyway, i saw him balance like four pieces and fumble and drop them trying to put the fifth in some weird way, over and over
05:44:39  sometimes he got it and tried to go further, then hit a dead end or something
05:44:47  he spent 80% of his time trying to balance these blocks to get them together
05:44:55  and not once did he ever try to find a better way to assemble them
05:45:03  (one that didn't require, say, balancing everything ridiculously)
05:45:30  it's not only being able to come up with new ideas, it's also knowing to try
05:45:39  of course, puzzles are a special case
05:45:50  you can pretty much assume the opposite of occam's razor in the case of puzzles/puzzle games
05:46:03  so it's easier to branch out quickly and rule out the simple stuff without much effort
05:46:37  heh, i've actually noticed it affect other areas of my life ;)
05:46:39  ok so here you mean, you can usually have faith in a puzzle
05:46:45  like if i drop something on the floor, i don't spend a lot of time searching in the same spot
05:46:51  hmm
05:47:00  ah, well, specifically with regards to puzzle games
05:47:05  yes, i have faith that a solution exists
05:47:15  and so i am comfortable trying increasingly ridiculous things
05:47:21  yeah.. when my mom loses something in her room i am like that
05:47:27  sometimes
05:47:29  hmm
05:47:36  one of the reasons i like crystalex so much is because its levels are designed so that you HAVE to do ridiculous things to succeed
05:47:39  in many cases
05:47:42  wow this feels like a nintendo discussion
05:47:43  like pixel perfect timing sometimes
05:47:53  or long sequences without mistakes
05:48:11  but with that game, i never ran out of ideas - i only had to get good enough to try them
05:48:23  when it's not a game, i still don't give up easily
05:48:24 -!- darkmoth has joined.
05:48:44  i spent 12 hours the other day learning how to use eclipse, write in java, and use a poorly documented library in order to accomplish a task
05:48:53  but i guess i could have faith that there was an answer there, too
05:48:57 -!- darkmoth has left ("Ex-Chat").
05:49:09  so, this is like a non religious use of the power of faith
05:49:21  well, it's not blind faith
05:49:37  it's not like "something is magical and i'll just trust that it exists"
05:49:46  it's "i know this should be possible, and i'm going to figure out how to do it"
05:50:03  occasionally i do hit something where i have to put it down or give up, but not often; and i usually come back to it
05:50:17  so then this gets interesting... how do we know a solution exists?
05:50:37  puzzle games aren't very fun without a solution :)
05:50:51  with some programming knowledge you know what is possible with programming
05:51:07  some things - like ai - aren't developed yet, but will probably be possible in the future
05:51:10  so.. then theres the star trek thing... where kirk made a solution by cheating
05:51:11  but with more common tasks
05:51:23  even if YOU don't know how to do it, you can frequently know that it's doable
05:51:31  ha, i have one puzzle
05:51:36  that's a big practical joke :)
05:51:57  it's a long square thing with a hole in the length of it, open on one side
05:52:07  at the bottom there are two holes drilled perpendicular through it
05:52:10  des cartes apparently used to intentionally send out math problems which had lies in them
05:52:12  and a rubber band is looped through
05:52:27  ah, well, discerning the lie is also possible :)
05:52:47  the joke - you have the other piece, which has a round knob on the end, a long skinny pole with a hook at the end
05:52:52  the supposed goal is to hook it on the rubber band
05:53:10  you demonstrate this to someone by putting it in the hole and making some random ass motions like a puzzle box type thing
05:53:17  and then you "pull" it out and it snaps back in
05:53:39  that one took me about 5 minutes before i took the piece with the rod out and laid it along the outside to see that it wasn't long enough ;)
05:53:49  the trick: you squeeze your fingers together and it shoots out of them
05:54:12  so i guess even lies can have solutions
05:54:55  uhm
05:55:06  you squeeze your fingers together on what?
05:55:39  im guessing this is one of those things that would be easier to watch than read
05:55:44  on the knob
05:55:45  it's like
05:55:48  but i am really enjoying this topic
05:55:53  ,------()
05:55:57  attacking my aversion to puzzles
05:56:07  so you hold the knob
05:56:14  and fidget around with the hook end inside the enclosure
05:56:23  and then you pretend it's hooked by pulling it out and shooting it back
05:56:29  then you "undo" it and give it to someone to try
05:56:40  because of what i described about trying new things
05:56:44  I made a lot of puzzles in the Super ASCII MZX Town series of games.
05:56:50  i quickly recognized that there was nothing to actually do with the rod in the hole
05:56:55  and solved the problem
05:57:05  but someone like my brother might sit there trying to hook it for an hour before giving up
05:57:36  by the way itidus21, i didn't want to gloss over what you said about learned helplessness; i'm familiar with the concept, do you feel like it applies?
05:57:39  oh.. i was hoping that you were gonna say you were able to teach your brother the right way
05:57:59  i dont know much about it.. but i just think it is part of the topic
05:58:09  ah
05:58:11  its really quite relevant infact
05:58:18  i don't believe so
05:58:24  it's a different kind of thing
05:58:31  learned helplessness is being beaten down so much that you won't try anymore
05:58:46  not being able to solve a puzzle is just how you've learned to approach problems and maybe something to do with base intelligence
05:58:54  but the effect is the same of not trying right?
05:59:03  sorta
05:59:09  in one case, you don't try because you're fucked up and depressed
05:59:14  in the other, you don't realize there's anything else to try
05:59:43  ok thanks. i dont really know the details of any of these things
05:59:48  i did try to teach my little sister about puzzle solving as an experiment
06:00:03  but she doesn't have the ability to focus very long on something she's not terribly interested in ;)
06:00:11  she is quite smart, but it wasn't for her
06:00:21  i'm not sure if it's a "nature" or a "nurture" thing, but it may be a combination
06:00:38  i know for a fact that many of my habits to approach problem solving were learned from my dad
06:00:45  and his taking me to work with him and helping him etc.
06:00:51  so for me, puzzle and situation are more or less synonyms
06:01:09  well, i think of the word puzzle as more specifically a kind of game
06:01:17  if it doesn't have a solution, it's not a very good puzzle ;)
06:01:22  but puzzles inherently have solutions
06:01:30  solving a situation then being applied puzzle-solving
06:01:31  mysteries, on the other hand...?
06:01:50  so... then we run into the question of what it means to solve a situation
06:02:17  myndzi, if you want something hard to solve, try the last 7 levels of this game http://www.remar.se/daniel/castle.php
06:02:19  situations have the potential for serendipity :-?
06:02:21  I've been stuck on them for a while
06:02:24  maybe you can do better
06:02:54  uhmm..
06:03:08  i guess i'd say
06:03:10  i guess it would seem that rules play a role
06:03:15  you don't know if a situation is a puzzle or a mystery
06:03:15  :)
06:03:24  and the only way to prove that it's a puzzle is to solve it :P
06:04:14  in some cases you can cheat
06:04:35  so an interesting idea here is are there any puzzles that can't be cheated
06:04:48  in terms of puzzle games
06:05:06  there is no cheat
06:05:07  :>
06:05:35  well, i mean, there can be - but it doesn't really count
06:05:43  it's the puzzle designer's job to ensure there are no shortcuts :P
06:05:55  there's one level in crystalex like that
06:06:02  like, in sokoban, analyzing the sourcecode woudn't save you..
06:06:04  it was one of the latest ones
06:06:21  er, last ones* = hard ones
06:06:26  but there was a simple shortcut to beat it
06:06:29  the author was like lol
06:06:44  yeah, i guess you could consider different classes of puzzles too :)
06:06:51  since the program merely encodes the rules... it doesn't show how to use those rules
06:07:09  to me it's just something solvable
06:07:18  reverse engineering an encrypted protocol is a puzzle
06:07:19  :P
06:07:35  (i'm lookin at you YVD and your "secure double encryption")
06:07:36  like.. you could have a chessboard with sokoban tiles...
06:07:48  and you could copy a board from a computerized sokoban
06:08:06  and you would have to say "how can i cheat?"
06:08:37  the only person you cheat in a puzzle is yourself
06:08:40  perhaps to take the solution and work backwards to the beginning one might try
06:08:51  accomplishing a goal isn't the reward; deriving the solution is
06:09:08  i don't really consider a puzzle fully solved until i can encompass it in my mind
06:09:16  sometimes i have to complete it many times before i can comprehend it
06:09:24  but for the same reason i'm not much of a fan of things like the rubik's cube
06:09:28  it's too... dry for me
06:09:33  hmm
06:09:34  too mathematical, not interesting
06:09:43  ironically i have an abiding interest in tetris
06:09:46  which i consider the exception to the rule ;)
06:09:49  in the comicbook series rurouni kenshin, kenshin is always thinking outside of the box
06:10:21  and that is what makes him the best
06:10:37  never read the manga
06:10:40  watched about half the anime
06:10:47  only particularly liked the first ova :P
06:10:48  i havent seen it all either
06:10:58  the worst is something like death note
06:11:08  where the author tries to write characters smarter than she(?) is
06:11:10  hehe
06:11:15  then it just comes out contrived and silly
06:11:20  OHO THAT WAS MY PLAN ALL ALONG
06:11:25  an example would be.. that his sword is too long.. so he is losing a swordfight
06:11:37  so what he does is he holds the sword by the blade itself
06:12:14  which fixes the length problem.. most surprisingly to his opponent
06:12:41  so thats problem solving
06:12:58  heheh....
06:13:02  something like that anyway :)
06:13:10  i'm playing this 'castle of elite' now hehe
06:13:29  so.. i have started to think about the true power of such kinds of thinking
06:14:31  and so, this topic suggests that the best way to solve what appears to be an unsolvable situation is faith that there is a solution
06:14:48  i suppose so
06:14:59  it's more like a tradeoff between time and reward
06:15:14  in the death row example, no matter how much time you spend, the reward is greater
06:15:25  sometimes the situation is trying to harm us
06:15:25  but sometimes you don't have enough time, or you spend more than is worth it
06:15:26  etc.
06:15:46  Read stuff about D&D game I have played. Often we try to do, having things even the dungeons master think is unsolvable, and then it can be solved. That is the best game.
06:17:19  After you put your socks on your cellular phone to absorb the radiation, what is the best way to clean out the radiation from the socks? [A] Put it in the microwave [B] Freeze it [C] Put it in the washing machine by itself [D] Wash them by hand
06:17:39  How many inches in a foot? [A] 12 [B] 49 [C] Meat [D] Pink
06:18:06  How many feet in a cup? [A] 3 [B] 12 [C] 56 [D] My foot doesn't fit in a cup.
06:18:17  lol.
06:18:29  well i have this document called "ideas". last edited 3rd october.  and one of the subheadings i put in is "Non-Obvious Solutions to Game Puzzles"
06:18:39  under this is listed
06:18:58  Wooden horse gift full of soldiers.
06:19:07  Using sword sheath as a weapon.
06:19:13  Holding sword by the blade.
06:19:33  Escaping wagon through wooden floor. (this was on some tv show)
06:19:41  Goku holding Raditz still and allowing Piccolo to kill both of them.
06:20:18  so.. this idea of treating real life situations kind of like puzzles really has my attention.
06:20:53  fits in with what zzo38 just said remarkably well
06:21:36  I think the best way of D&D game is deliberately unsolvable game that a working solution is found anyways.
06:21:59  so "unsolvable" is an illusion?
06:22:28  The dungeons master who invented it think it to be unsolvable but obviously they made a mistake
06:22:48  there are some inevitables like death and taxes
06:31:11  That is the kind of D&D game I like to play. I also like to play monster character, and some strange spells, etc. As well as difficult situation possibly not seem to be solvable. Probably different than most D&D game played.
06:32:08  well this game departs from obvious satisfyingly quickly
06:32:19  wish i hadn't been drinking beer all night beforehand now ;)
06:34:32 -!- madbrrr has quit (Read error: Connection reset by peer).
06:39:34 -!- Klisz has quit (Quit: You are now graced with my absence.).
06:41:08  hehe myndzi
06:42:53  zzo38: so i pondered on it a bit.. how does one create a space in which this type of solution exists
06:43:06  we really need a name for it..
06:43:29  such a solution that occurs in a deliberately unsolvable game
06:44:00  I don't know the name for it.
06:44:01  if it's deliberately unsolvable
06:44:03  and somebody solves it
06:44:07  it's not a very good game :)
06:44:32  super mario bros had world -1
06:45:03  that was pretty amazing that a game accidently had the capacity to take you to a level which wasn't supposed to be tere
06:45:27  world -1 was just data corruption
06:45:28  :P
06:45:37  so what happened there was.. instead of hard checking
06:46:05  it just accepted whatever warp zone input it got
06:46:42  so this is a strange idea.. that making the rules of a game too formal and enforced.. and the players may well be trapped by them
06:47:14  personally i like rules
06:47:24  if the challenge is too open my brain explodes
06:47:24  ;)
06:47:29  i am faced with constant indecision
06:47:30  yeah you need rules
06:47:33  give me a boundary to test any time
06:47:59   street fighter 2 also had some strange glitches
06:48:44  Try to play my Super ASCII MZX Town series of games.
06:48:55  It has some puzzles.
06:49:29  so game playing and problem/puzzle solving and solving the unsolvable and non-obvious solutions all seem to verge into something for me
06:49:55  This is PHP "PuzzleMesh" in case you are interested:   http://zzo38computer.cjb.net/prog/PuzzleMesh/PuzzleMesh-0-1-2.zip
06:51:03  super mario bros really fucked with peoples heads.
06:51:52  i study it a lot
06:54:10  the blue dudes - do they do anything but bounce back and forth?
06:54:13  i didn't read all the hints
06:54:19  this one seems kind of pointless
06:54:56  they flip switches they go past
06:54:59  and die if you place a block over them
06:55:03  and kill you
06:55:08  think that's it
06:55:18  heh ok
06:55:22  guess he was just a pointless one then
06:55:25  2 away from hard
06:55:31  they can also go through teleporters
06:55:44  yeah, i was just like.. why bother putting this guy here? he's not a challenge
06:55:56  red herring?
06:56:01 * myndzi\ shrugs
07:03:54  the most rewarding thing for me is when i can logic my way through a puzzle :)
07:04:01  like 2-12
07:08:33  myndzi\: another one is goku.. he seems to always find a solution to win a fight
07:08:47  he always warns the guy ahead of time.. i will beat you
07:08:53  give up now
07:08:56  yeah, but that's 'cause he's a Chosen One :P
07:09:38  heh
07:15:20  At the end of the chapter I entered this text:   (Can Kjugobe get out of prison (eventually)? What does Also do? Is Also a good name or is it confusing everyone? You don't know? Then you must learn. Read this book next time to learn what happens next$\ldots$)
07:15:24  Is it good?
07:25:17  I got stuck on one of the shareware levels in hero:mesh. the one with three worms and all the crates
07:27:19  Can your computer run 16-bit Windows programs? If so, I can give you the old shareware version
07:27:27  It should be able to it's widnows XP
07:27:29  *windows
07:27:43  If you have more levels for that game that would be cool
07:28:29  Yes I do have more levels I made up. However the shareware program will not load sets with more than three levels, so I will split it into sets with only three levels each if you want to play the more levels I have.
07:28:55  Only if it's not a bother to you
07:30:05  Not right now; maybe another day, though.
07:36:34  The more levels I have even have new kind of pieces, some of which I added in by myself.
07:36:54  This shareware is Falling Hero but it can be used to create and run normal Hero Heart game as well.
07:37:06 -!- Phantom_Hoover has joined.
07:41:43  huh
07:41:45  suddenly, dejavu
07:41:56  i seem to remember this level
07:42:34  you said that before
07:42:40  wut
07:42:44 * oerjan whistles innocently
07:42:46  :P
07:44:01  this level is a troll level
07:44:13  i wanted to make the thing go up to the top but you don't have to :(
07:44:17  this solution is much less fun
07:46:05  omg
07:46:06  this level too
07:46:11  i'm going crazy! :P
07:47:22  `log alice.*mad.*come here
07:47:49  `echo hi
07:47:53  2008-02-17.txt:00:58:29:  "But I don't want to go among mad people," Alice remarked.  "Oh, you can't help that," said the Cat: "We're all mad here. I'm mad. You're mad." "How do you know I'm mad?" said Alice.  "You must be," said the Cat, "or you wouldn't have come here."
07:47:53  hi
07:50:16  `echo Would you like some tea?
07:50:18  Would you like some tea?
07:51:39  `echo @tell HackEgo I am confused.
07:51:41  ​@tell HackEgo I am confused.
07:52:58  HackEgo will have put a zero width space before that @, so lambdabot ignores it.
07:53:13  oh i forget which bot s which
07:53:25  thats cool i was starting to feel guilty
07:53:56  i am forgetting that i am going among some clevers
07:59:03  how are you going myndzi?
08:00:03  3-8
08:00:06  and very drunk
08:00:08  lol
08:00:19  i swear to god i've played this before
08:00:22  i remember this level
08:00:22  :|
08:00:22 -!- zzo38 has quit (Remote host closed the connection).
08:00:57  haha
08:01:02  ok, I need some quick LUA help
08:01:08  how do I iterate over the return values of http://www.wowpedia.org/API_strmatch ?
08:01:36 * oerjan just followed a long chain from U.N.C.L.E. to Jangal movement of Gilan
08:05:50  passing through such articles as Millennium, Comet, Weather, Hearth, Nature, Aesthetics, Demand (economics), Greenhouse gas, House, Democratic Party (United States), Washington D.C, City, Arabic language, United Nations, Refugee, List of ethnic slurs.
08:05:58  (reversed)
08:13:12  jeah finally
08:13:15  that took way too many tries
08:13:18  my brain feels like mud
08:17:16  Hey, oerjan, how did the mathematician make sure he got the optimal amount of water from the ground?
08:22:20  Something something spherical cow
08:23:24  `log euclidean
08:23:52  2010-05-23.txt:22:03:07:  Just make the geometry non-Euclidean.
08:24:06  First, assume ground always sinks in water...
08:24:15  pikhq_, he used the well ordering theorem, actually.
08:24:24  ha ha
08:25:29  harl har
08:25:35  i passed seven crosses with only six
08:25:36  ;P
08:29:44 * oerjan throws an unstoppable object at Phantom_Hoover 
08:30:01 * Phantom_Hoover ducks
08:30:08  curses, foiled again
08:33:34 -!- Ngevd has joined.
08:33:49  lol i'm link
08:34:15  Hello!
08:34:25  so, the idea of unstoppable object basically is a bad rule
08:34:29  in some cases
08:34:42  because... it will be literally unstoppable if the rule has it so
08:34:49  or..
08:34:59  maybe it is that some such rules are good yes
08:35:05  but not all rules should be so concrete
08:35:18  yeah the rule itself is ok
08:35:48  belgian ales man
08:35:51  belgian ales
08:36:44  my hand-eye coordination is about to give out
08:36:44  ;p
08:36:53  ok which levels were you having trouble with?
08:36:54  i'm on elite
08:41:32 -!- oerjan has quit (Quit: Bye).
08:42:01 * pikhq_ throws an immovable object at KERNEL PANIC. CORE DUMPED.
08:42:08 -!- Ngevd has quit (Ping timeout: 252 seconds).
08:42:26  myndzi\, who are you talking to?
08:42:35  patashu
08:46:22  yo
08:46:26  oh
08:46:36  9,10,11,12 + the finalest level
08:46:39  are the only ones I haven't solved
08:46:44  What're you trying to play?
08:46:59  ah, only on 4-2 so far
08:47:04  Castle of Elite
08:54:49  i remember this level too
08:54:57  i must have played this
08:55:02  don't remember when or anything about it though
08:56:38  it's possible you could have, it's fairly old
08:56:56  if i did i ran into it the same way, you
08:56:56  haha
08:58:03  if i did i must have beaten it
08:58:05  i'd remember if i didn't
08:58:06  hmmm
08:58:31  so if you beat the whole game really quickly can I assume it's because of supressed memories?
08:58:37  lol
08:58:43  nah, i don't remember any solutions
08:58:53  i've just hit like 5 levels that seem familiar
08:59:34  4-2 is annoying
08:59:45  but it's a great example of the kind of level i don't mind
09:00:06  in one instance or a handful, i mean
09:00:12  as opposed to an entire game of it
09:04:33 -!- kallisti has joined.
09:04:34 -!- kallisti has quit (Changing host).
09:04:34 -!- kallisti has joined.
09:05:27  hey
09:05:51  monqy: hello
09:05:58  kallisti: hi
09:06:10  help im in python hell
09:06:27  i made incredibly stupid pattern matching to ease the pain but it still hurts
09:06:58  monqy: give me something more specific and maybe I can help? :P
09:07:09  nothing specific
09:07:10  just hell
09:07:11  or is there no escape?
09:07:21  monqy, are you sure it's not Python purgatory?
09:07:25  hm
09:07:38  monqy: use more metaclasses
09:07:39  problem solved.
09:07:40  punishment for me thinking taking this class would be a good idea
09:09:52  with what do metaclasses help? everything?
09:10:39  yes always
09:10:52  "there is only metaclass to do it with" -- Python slogan
09:10:56  *only one
09:11:37  I've never used metaclasses or decorators or anything like that..usually I avoid python, but this time I had no choice
09:11:46  where by used I mean
09:11:48  made them myself
09:11:56  decorators are good
09:12:10  kind of cumbersome to actually write, when they take parameters and stuff
09:12:15  but useful once you have them
09:13:00  of course the fact that they're syntactic sugar is simply a weakness of Python syntax.
09:13:03  nice solution though annoying to implement
09:13:42  the decorator syntax would be completely unecessary if Python had good lambda syntax
09:15:38 -!- hagb4rd has joined.
09:16:47  Lambdas are evil
09:16:51  Shame on you kallisti
09:16:58  I hope you're joking.. :P
09:17:09  You hope guido is joking
09:17:18  ...yes, I do.
09:17:20  But hope isn't cheap these days
09:17:28  I hope Python is revealed to be a joke language one day.
09:17:31  it frustrated me when i tried reading the functional python guide and it told me that lambdas are unreadable and should be avoided
09:17:43  monqy: everything is unreadable.
09:17:57  assignment expressions? unreadable
09:17:57  why did that guy write documentation on functional python if he can't aaaaaaaaaaaaaaaaagh
09:18:13  c obfuscation contest? unreadable
09:18:14  python is basically not functional, though it claims to be.
09:18:29  the fact that functions are first-class really is not enough.
09:18:41  python claims to be functional?
09:18:51  yes.
09:19:01  paradigms: object-oriented, imparative, functional
09:19:08  *imperative
09:19:12  ahaha really?
09:19:14  yep
09:19:16   with what do metaclasses help? everything?
09:19:18  who PUT that there
09:19:27  guido I'd guess? dunno
09:19:32  pffffffffffffff
09:19:39  Are metaclasses that thing cpressey linked to that I tried to make the Sierpinski numbers in response to?
09:20:01  van Rossum: setting dutch computer science back 80 years.
09:20:30  monqy: bahaha, "I’ll start by looking at a Python language feature that’s an important foundation for writing functional-style programs: iterators."
09:20:38  monqy: http://docs.python.org/howto/functional.html
09:20:56  Oh, wait, no, that was those abstract base thingies.
09:21:03  kallisti: yeah that's the one
09:21:22  "I'll start by looking at a Python language feature that's an important foundation for writing functional-style programs: object-orientation"   -- this guide, in essence
09:21:48  Phantom_Hoover: metaclasses are to classes as classes are to objects
09:22:03  you use them to alter behavior during class creation.
09:22:13  they're usually not needed.
09:22:14  "But it would be best of all if I had simply used a for loop:
09:22:14  total = 0
09:22:16  for a, b in items: total += b"
09:22:19  this makes me so mad
09:22:21  but Django uses them for example for its DB model classes.
09:22:27  for loops can go to hell
09:22:36  monqy: for loops: the essence of functional programming
09:23:24  "A theoretical benefit is that it’s easier to construct a mathematical proof that a functional program is correct."
09:23:36  wow this statement should be in a functional programming tutorial for Python.
09:23:40  *should NOT
09:26:23  i wonder what otherr howtwos there are
09:26:37  I'm on the fourth level of mesh, falling hero and already hard
09:26:41  no clue what I'm expected to do
09:26:41  here's a howto on python advocacy
09:26:44  how to advocate python
09:27:00  idioms and anti-idioms, this should also be good
09:27:01  monqy, Python for loops are really foreach
09:27:11  Sgeo: they can still go to hell
09:27:27  Haskell has a foreach, it calls it forM_
09:27:31  :t forM_
09:27:32  forall a (m :: * -> *) b. (Monad m) => [a] -> (a -> m b) -> m ()
09:27:40  haskell has lots of things
09:28:16  Sgeo: Haskell has decorators. they're called functions.
09:28:19  therefore..... (????)
09:30:30  on an unrelated note, I'm reading an article on how automatic transmissions work.
09:30:33  and it's blowing my mind.
09:30:37  so complicated.
09:32:52  It rests on planetary gears, right?
09:33:46  yes
09:38:07 -!- monqy has quit (Quit: hello).
09:39:13  mmk too drunk to continue :P
09:39:26  completed: all the lower levels and 1-5 of elite
09:39:42  haha appreciate it
09:39:45  if i remember i'll come back to it tomorrow and see if i can't crack the ones you have left
09:39:46  :)
09:40:00  i'll leave the game up to remind me!
09:47:06  Phantom_Hoover: http://static.howstuffworks.com/gif/automatic-transmission-brain.jpg
09:47:22  all of those passageways rooute the hydraulic fluid that determines when the car shifts gears.
09:49:12  so for example if you're accelerate rapidly it will shift at highe RPMS, but if you're accelerating softly it will shift at lower RPMs, and if you go full throttle the car will downshift (to increase the gear ratio so that the car accelerates faster, presumably what you wanted to do)
09:50:43  For some strange reason, we still aren't letting cars just drive themselves
09:50:49  Silly peoples
09:51:09 -!- derdon has joined.
09:52:50  automatic transmissions
09:52:55  are so much simpler than this.
09:52:56  er
09:53:01  s/automatic/manual/
09:56:13  also there's a little valve on the drive shaft that opens wider via centrifugal force as the drive shaft spins; this is what controls the fluid pressure in the hydraulic system. more pressure = faster speed.
09:57:25  UPDATE
09:58:20  it's like...
09:58:25  hydraulic logic circuits.
09:58:27  SO COOL.
10:03:05 -!- Ngevd has joined.
10:03:48  wow, awesome
10:03:54  mesh: falling hero has water pressure XD
10:23:45 -!- derdon has quit (Remote host closed the connection).
10:37:55 -!- derrik has joined.
10:57:48 -!- bigmuzzy has joined.
10:59:54 -!- bigmuzzy has left.
11:08:04 -!- derrik has quit (Quit: ChatZilla 0.9.87-rdmsoft [XULRunner 1.9.0.17/2009122204]).
11:09:39 -!- sebbu2 has changed nick to sebbu.
11:29:03 -!- hhj has joined.
11:29:26  Hi
11:29:34  Hello
11:30:13  FireFly: hi
11:30:18  Hey
11:30:40  fizzie: oy
11:30:51 -!- Patashu has quit (Quit: MSN: Patashu@hotmail.com , Gmail: Patashu0@gmail.com , AIM: Patashu0 , YIM: patashu2 , Skype: patashu0 .).
11:37:43 -!- hhj has quit (Remote host closed the connection).
11:59:38  Who's hhj?
13:02:43  Hoover Heavy Juggalo.
13:02:47  We use him for PR.
13:13:22  I'm the only person I have ever heard of who convinced himself that his best friend was imaginary
13:14:24  You like the number i?
13:14:28  (Sorry)
13:14:48  Bah, i is as real (in the non-mathematical sense) as any other number
13:15:07  But yeah, I did once convince myself that my best friend was imaginary
13:15:14  It was scarily easy
13:15:20  I'm pretty sure he isn't
13:15:54  Have you told him to get real?
13:17:31  Missed opportunity right there
13:17:52  Can Haiku use Java?
13:18:59  Have you tried adding him to his complex complement?
13:25:40  Hmm
13:25:43  Could work
13:25:46  How do I unaway?
13:26:56  There we go
13:28:53  Ngevd: i wondered if my friends are real in elementary school
13:29:20  But did you convince yourself with a rational argument?
13:30:12  and i made sure i have as complete as possible a graph between all the people i know with respect to knowing each other
13:30:40  Mine would be...
13:30:42  Ngevd: like what? i certainly convinced myself that there's no way to know
13:31:03  I reasoned that he had come into my life when I was feeling lonely
13:31:28  And is really cool and stuff and isn't the kind of person who would be friends with me
13:32:18  So, it was quite likely that he was a fabrication of my mind
13:32:37  did you do any sort of checks?
13:33:07  The next day, I asked him if he was real
13:33:10  He said "yes"
13:33:16  Then I asked his girlfriend
13:33:20  She said "yes"
13:33:24  it's sort of trivial to at least make sure that it's not the case that that friend is imaginary in all instances, and your other friends never are.
13:33:41  his girlfriend, who's a third party you only know through him?
13:33:51  !!!
13:34:19  No, other people know him, who I met before him
13:34:28  and why the hell would you ask them that, are you crazy enough that that's considered normal for you? :P
13:34:37  Pretty much
13:34:50  I once almost convinced myself that /I'm/ imaginary
13:34:58  Suck on that, Descartes!
13:35:12  i'm not at all sure i exist either
13:35:14 -!- oerjan has joined.
13:35:39  oerjan, do you know whether oklopol or I exist?
13:35:54  heh
13:36:40  well i don't know whether this laptop i'm typing on exists...
13:37:01  Now I will go and see the new Tintin film
13:37:40  Ngevd: but anyhow i never asked anyone if they exist, since i went with the all or nothing assumption in imaginary friends, instead i actually went through literally everyone i know and tried to made sure they have a connection to my parents
13:38:57  i was like 8 so i didn't know it would have to be someone important to me
13:39:22  I was 14 or 15 when this happened
13:39:54  Wait, it was just before my 16th birthday
13:39:55  at 15, i don't think i would've given a shit if my friends were imaginary
13:40:16  I will go watch movie now
13:40:23  have fun
13:40:27  i would now, probably
13:40:27  Farewell, people of similar interests!
13:40:28 -!- Ngevd has quit (Quit: Leaving).
13:40:55  being afraid you might just be insane is not really an interest
13:41:02  it's not, right?
13:41:34  As we might just be insane, it could be.
13:42:00  u see.
13:42:30  I bet oklopol is imaginary.
13:43:20  who knows
13:45:48  `log alice.*mad.*come here
13:45:54  2011-07-16.txt:21:17:53:  "But I don't want to go among mad people," Alice remarked.  "Oh, you can't help that," said the Cat: "we're all mad here. I'm mad. You're mad." "How do you know I'm mad?" said Alice.  "You must be," said the Cat, "or you wouldn't have come here."
13:46:48  !python print "test"
13:46:51  test
13:47:23  !python print re('''"But I don't want to go among mad people," Alice remarked.  "Oh, you can't help that," said the Cat: "we're all mad here. I'm mad. You're mad." "How do you know I'm mad?" said Alice.  "You must be," said the Cat, "or you wouldn't have come here."''')
13:47:24  Traceback (most recent call last):
13:47:30  oops
13:47:40  !python print rep('''"But I don't want to go among mad people," Alice remarked.  "Oh, you can't help that," said the Cat: "we're all mad here. I'm mad. You're mad." "How do you know I'm mad?" said Alice.  "You must be," said the Cat, "or you wouldn't have come here."''')
13:47:41  Traceback (most recent call last):
13:47:56  dammit what is the name of that function
13:48:24  !python print "test"*999999999
13:48:24  Traceback (most recent call last):
13:48:37  oh hm
13:48:56  !python print '%r'%'''"But I don't want to go among mad people," Alice remarked.  "Oh, you can't help that," said the Cat: "we're all mad here. I'm mad. You're mad." "How do you know I'm mad?" said Alice.  "You must be," said the Cat, "or you wouldn't have come here."'''
13:48:57  ​'"But I don\'t want to go among mad people," Alice remarked.  "Oh, you can\'t help that," said the Cat: "we\'re all mad here. I\'m mad. You\'re mad." "How do you know I\'m mad?" said Alice.  "You must be," said the Cat, "or you wouldn\'t have come here."'
13:49:44  `python test
13:49:47  python: can't open file 'test': [Errno 2] No such file or directory
13:49:59  `python -e print "test"
13:50:02  Unknown option: -e \ usage: python [option] ... [-c cmd | -m mod | file | -] [arg] ... \ Try `python -h' for more information.
13:50:21  *sigh*
13:50:30  `run echo '\''
13:50:32  bash: -c: line 0: unexpected EOF while looking for matching `'' \ bash: -c: line 1: syntax error: unexpected end of file
13:50:38  goddammit
13:51:00  oh wait
13:51:46  !python print repr("Only the fool would take trouble to verify that his sentence was composed of ten a's, three b's, four c's, four d's, forty-six e's, sixteen f's, four g's, thirteen h's, fifteen i's, two k's, nine l's, four m's, twenty-five n's, twenty-four o's, five p's, sixteen r's, forty-one s's, thirty-seven t's, ten u's, eight v's, eight w's, four x's, eleven y's, twenty-seven commas, twenty-three apostrophes, seven hyphens and, last but not least
13:51:47  File "", line 1
13:53:04  `run echo '"But I don'"'"'t want to go among mad people," Alice remarked.  "Oh, you can'"'"'t help that," said the Cat: "we'"'"'re all mad here. I'"'"'m mad. You'"'"'re mad." "How do you know I'"'"'m mad?" said Alice.  "You must be," said the Cat, "or you wouldn'"'"'t have come here." >wisdom/mad
13:53:06  bash: -c: line 0: unexpected EOF while looking for matching `'' \ bash: -c: line 1: syntax error: unexpected end of file
13:53:14  `run echo '"But I don'"'"'t want to go among mad people," Alice remarked.  "Oh, you can'"'"'t help that," said the Cat: "we'"'"'re all mad here. I'"'"'m mad. You'"'"'re mad." "How do you know I'"'"'m mad?" said Alice.  "You must be," said the Cat, "or you wouldn'"'"'t have come here."' >wisdom/mad
13:53:16  No output.
13:53:21  `? mad
13:53:23  ​"But I don't want to go among mad people," Alice remarked.  "Oh, you can't help that," said the Cat: "we're all mad here. I'm mad. You're mad." "How do you know I'm mad?" said Alice.  "You must be," said the Cat, "or you wouldn't have come here."
13:54:50  oh hm...
13:55:18  `learn "But I don't want to go among mad people," Alice remarked.  "Oh, you can't help that," said the Cat: "we're all mad here. I'm mad. You're mad." "How do you know I'm mad?" said Alice.  "You must be," said the Cat, "or you wouldn't have come here."
13:55:20  I knew that.
13:55:29  `? "But
13:55:31  ​"But I don't want to go among mad people," Alice remarked.  "Oh, you can't help that," said the Cat: "we're all mad here. I'm mad. You're mad." "How do you know I'm mad?" said Alice.  "You must be," said the Cat, "or you wouldn't have come here."
13:56:03  `run mv wisdom/'"But' wisdom/mad
13:56:05  mv: cannot stat `wisdom/"But': No such file or directory
13:56:15  huh
13:56:24  `ls wisdom
13:56:26  ​"but \ ? \ ais523 \ augur \ banach-tarski \ c \ cakeprophet \ category \ elliott \ everyone \ finland \ finns \ fizzie \ flower \ friendship \ functor \ fungot \ gregor \ hackego \ haskell \ ievan \ intercal \ itidus20 \ kallisti \ mad \ monad \ monads \ monoid \ monqy \ nooga \ oerjan \ oklopol \ phantom__hoover \ phantom_hoover \ php \ qdb \ qdbformat \ quine \ sgeo \ shachaf \ u \ vorpal \ welcome \ wiki \ you
13:56:33  ah
13:56:41  `run mv wisdom/'"but' wisdom/mad
13:56:43  No output.
13:56:48  `? mad
13:56:50  ​"But I don't want to go among mad people," Alice remarked.  "Oh, you can't help that," said the Cat: "we're all mad here. I'm mad. You're mad." "How do you know I'm mad?" said Alice.  "You must be," said the Cat, "or you wouldn't have come here."
13:57:18  "She's mad!" ~ Meg Giry
14:39:09 -!- PiRSquared17 has joined.
14:44:22 -!- PiRSquared17 has changed nick to PiRSquared17Bot.
14:44:34 -!- PiRSquared17Bot has quit (Changing host).
14:44:34 -!- PiRSquared17Bot has joined.
14:48:12 -!- PiRSquared17Bot has changed nick to PiRSquared.
14:48:22 -!- PiRSquared has quit (Changing host).
14:48:23 -!- PiRSquared has joined.
14:48:45 -!- PiRSquared has left.
14:54:23 -!- derrik has joined.
15:06:49  Aww, Introversion god rid of their motto.
15:17:45  Hmm?
15:28:25  *got
15:28:39  It used to be "The last of the bedroom programmers."
15:44:52 -!- kallisti has quit (Ping timeout: 276 seconds).
15:46:22 -!- kallisti has joined.
15:46:23 -!- kallisti has quit (Changing host).
15:46:23 -!- kallisti has joined.
16:02:32 -!- augur has quit (Remote host closed the connection).
16:03:24 -!- oklopol has left.
16:03:33 -!- oklopol has joined.
16:16:54 -!- ais523 has joined.
16:17:20 -!- MSleep has changed nick to MDude.
16:19:50 -!- elliott has joined.
16:20:05  -MemoServ- You have 8 new memos.
16:20:05  elliott: You have 6 new messages. '/msg lambdabot @messages' to read them.
16:20:23  why is elliott being spammed with messages?
16:20:31 * oerjan whistles innocently
16:20:46  well, a few of them may be mine
16:20:50  memoserv sends receipts :P
16:21:09  -MemoServ- They must be read one by one. ;P
16:21:12  oerjan: /ms read new
16:21:16  repeat until done
16:21:24  elliott: yeah yeah
16:24:32 -!- Ngevd has joined.
16:25:35 -!- oerjan has quit (Quit: Good night).
16:27:45 -!- plycke has joined.
16:27:45 -!- plycke has quit (Excess Flood).
16:28:28  Hello!
16:36:53  hi
16:37:03  <-- oerjan has left this server (Quit: Good night).
16:37:13  that was at 4:25 UTC
16:37:18  which is not night-time in Norway
16:37:21  mystery?
16:37:26  He could be far up North?
16:37:54  ais523: oh come on, you know oerjan's sleep schedule by now
16:38:04  that's at least two people who aren't paying enough attention to the channel
16:38:18  you both know who you are and I'm disappointed in you
16:38:44  `
16:38:46  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: : not found
16:45:13 -!- derrik has quit (Quit: sauna).
16:57:25  ais523: i think you may need a new response
16:57:38  heh
16:57:45  I was half-wondering if HackEgo would do that
17:05:14  Oh god is Sgeo reading Dr McNinja.
17:25:55 -!- ais523 has changed nick to ais523\unfoog.
17:34:53  Huh
17:35:12  I didn't make any CoaPs in the 300's or 500's
17:36:13  And that's terrible.
17:45:17 -!- PiRSquared17 has joined.
17:56:06  I follow 24 webcomics
17:56:29  23
17:56:51  In ALPHABETICAL ORDER!!!
17:57:37  there are fewer comics depending on the order you count them in?
17:57:54  LOL
17:57:54  No, I just stopped reading Three Panel Soul
17:58:07  And announced that I was going to say them all in alphabetical order
17:58:13  ...
17:58:17  `addquote  myndzi\: ok so one of the nastiest puzzles i suppose is... you're on death row.. you don't want to die.
17:58:20  739)  myndzi\: ok so one of the nastiest puzzles i suppose is... you're on death row.. you don't want to die.
17:59:10  Ngevd: We're all waiting. :'(
17:59:41  `karma+ elliott
17:59:46  elliott now has 1 karma.
17:59:56  Why don't I have a billion karma.
18:00:06  Awkward Fumbles, Brawl in the Family, Cheer, City of Reality, Comments on a Postcard, Darths & Droids, El Goonish Shive, Freefall, Girl Genius, Goost 26, Gunnerkrigg Court, Homestuck, Irregular Webcomic, Lightning Made of Owls, Misfile, New World Comics, Sparkling Generation Valkyrie Yuuki, Square Root of Minus Garfield, Super Effective, Tranquility Base, xkcd, and The Wotch
18:00:15  t comes after x
18:00:18  as everyone knows
18:00:25  `cat karma/elliott
18:00:26  The "the" isn't counted
18:00:28  cat: karma/elliott: Not a directory
18:00:30 -!- monqy has joined.
18:00:36  `ls karma
18:00:39  karma
18:00:47  `ls karma/karma
18:00:49  ls: cannot access karma/karma: Not a directory
18:01:00  `cat karma/karma
18:01:02  cat: karma/karma: Not a directory
18:01:10 * elliott facepalm
18:01:11  ...
18:01:16  `run ls -lh karma
18:01:18  ​-rw-r--r-- 1 5000 0 25 Nov 26 18:01 karma
18:01:19  `more karma/karma
18:01:21  karma/karma: Not a directory
18:01:26  IT'S NOT A DIRECTORY
18:01:26  `more karma
18:01:29  elliott now has 1 karma.
18:01:31  `dog karma
18:01:33  IT'S TOLD YOU IT'S NOT A DIRECTORY ABOUT FIVE THOUSAND TIMES
18:01:33  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: dog: not found
18:01:56  `ls karma
18:01:58  karma
18:02:05  hi
18:02:06  `cat karma/karma
18:02:07  cat: karma/karma: Not a directory
18:02:09  no stop
18:02:10  stop
18:02:11  i
18:02:12  ;_;
18:02:12  ?
18:02:21  not a directory ;_; ;_; ;_;
18:02:37  `file karma
18:02:39  karma: ASCII text
18:02:50  `cat karma
18:02:52  elliott now has 1 karma.
18:03:04  `whereis karma
18:03:07  karma:
18:03:10  `which karma
18:03:12  ​/hackenv/bin/karma
18:03:17  `who karma
18:03:18  `cat ​/hackenv/bin/karma
18:03:19  No output.
18:03:20  cat: ​/hackenv/bin/karma: No such file or directory
18:03:25  ???
18:03:31  `pwd
18:03:33  ​/hackenv
18:03:35  `ls bin/karma
18:03:37  bin/karma
18:03:42  `cat /hackenv/bin/karma
18:03:44  ​#!/bin/sh \ echo "$1 has $(lib/karma "$1") karma."
18:03:59  dunno why it didn't work that time
18:04:03  `ls lib/karma
18:04:05  lib/karma
18:04:34  `karma Ngevd
18:04:39  Ngevd has 0 karma.
18:04:42  `karma Taneb
18:04:46  Taneb has 0 karma.
18:04:50  Aww
18:04:54  `karma+ Ngevd
18:04:59  Ngevd now has 1 karma.
18:04:59  `karma- Taneb
18:05:04  Taneb now has -1 karma.
18:05:10  @pointless \x -> f x x
18:05:10  join f
18:05:19  @pointless \x -> x ^2
18:05:20  (^ 2)
18:05:23  obv
18:05:41  @pointless \a b -> b
18:05:41  const id
18:05:52  @pointless \a b -> b a
18:05:53  flip id
18:06:27  `karma Taneb|Hovercraft
18:06:31  Taneb|Hovercraft has 0 karma.
18:06:32  `karma Taneb|Kindle
18:06:37  Taneb|Kindle has 0 karma.
18:06:48  `karma ettioll
18:06:53  ettioll has 0 karma.
18:07:07  `karma noqmy
18:07:11  noqmy has 0 karma.
18:07:18  Nobody karmas any of me
18:07:24  Except for elliott, but he balances out
18:07:36  :(
18:07:38  `karma+ Ngevd
18:07:43  Ngevd now has 2 karma.
18:07:50  `karma+ elliott
18:07:55  elliott now has 2 karma.
18:08:06  Karmae.
18:08:25  Could be Greek
18:08:58  `karma+ noqmy
18:09:03  noqmy now has 1 karma.
18:09:10  karmai
18:09:16  `karma+ fungot
18:09:17  Ngevd: ' heheh, i gets heads like that myself when i first arrived here. but if she'd had to take it away
18:09:20  fungot now has 1 karma.
18:09:33  Because fungot is awesome
18:09:33  Ngevd: brutha stepped back. no‑one bothered her when she goes home.' he
18:09:40  Karmae.
18:09:42  oops
18:09:44  `karma+ fungot
18:09:44  `karma+ fungot
18:09:44  elliott: ' good idea, like another drink. then she looked at the man's mind?" said rincewind.
18:09:44  `karma+ fungot
18:09:45  `karma+ fungot
18:09:45  elliott: " that's right. i'm working, people are saying it might have happened.' vimes sighed. all around them, she thought, that was just the lady's maid to queen molly."
18:09:45  elliott: " hmm?" captain vimes, who shrugged.
18:09:45  elliott: ' er... well, to have sky on the horizon like a lightly-poached egg.' he pinched the bridge of his nose again.
18:09:50  `karma+ fungot
18:10:02  `karma+ fungot
18:10:02  monqy: the elf looked down at his face with the effort of calculation.
18:10:04  `karma- boxbot # nobody likes boxbot
18:10:14  whats a boxbot
18:10:16  fungot now has 2 karma.
18:10:23  fungot now has 2 karma.
18:10:26  fungot now has 2 karma.
18:10:26  boxbot # nobody likes boxbot now has -1 karma.
18:10:29  fungot now has 2 karma.
18:10:30  fungot now has 2 karma.
18:10:30  fungot now has 2 karma.
18:10:32  WHAT
18:10:34  `karma fungot
18:10:34  elliott: " ok," said leonard.
18:10:39  commands are isolated
18:10:43  fungot has 3 karma.
18:10:51  commands are isolated
18:10:53  oops
18:10:55  `karma fungot
18:10:55  elliott: angua glanced through the grubby window. the fog was hull that had been in the baby's mind, l can tell by the way the sphinx was moving its lips silently, as though it moved of its own.
18:10:59  fungot has 3 karma.
18:11:03  huh :P
18:11:11  monqy, Gunnerkrigg court
18:13:07  http://gunnerkrigg.proboards.com/index.cgi?board=general&action=display&thread=410&page=1
18:13:58  > map (\x -> x^2 - x*2 - x+2) [0..]
18:13:58    Ambiguous occurrence `-'
18:13:59   It could refer to either `L.-', defined at  > map (\x -> (x^2) - (x*2) - (x+2)) [0..]
18:14:14    Ambiguous occurrence `-'
18:14:15   It could refer to either `L.-', defined at  ...
18:14:27  > map (\x -> ((x^2) - (x*2)) - (x+2)) [0..]
18:14:27    Ambiguous occurrence `-'
18:14:28   It could refer to either `L.-', defined at  @more
18:15:39  boxbot looks friendly and nice
18:15:42  a friend??
18:15:48  BOXBOT IS TERRIBLE
18:15:55  NOBODY LIKES BOXBOT
18:16:06  He's just a box with arms
18:16:11  You may be thinking of Robox
18:16:12  i love boxbot already
18:16:21  Everyone loves Robox
18:16:27  whats a robox
18:16:38  "Box with legs" doesn't even BEGIN to describe it
18:16:49  then both are good
18:17:05  Roblox?
18:17:08  http://www.gunnerkrigg.com/archive_page.php?comicID=510
18:17:13  robox?
18:17:17  boxbot?
18:17:36  http://www.gunnerkrigg.com/archive_page.php?comicID=205
18:17:43  `addquote  BOXBOT IS TERRIBLE   NOBODY LIKES BOXBOT   He's just a box with arms   i love boxbot already
18:17:44  740)  BOXBOT IS TERRIBLE   NOBODY LIKES BOXBOT   He's just a box with arms   i love boxbot already
18:18:19  im conclude: both robox and boxbot are good
18:18:26  LIES
18:18:32  BOXBOT IS TERRIBLE
18:18:40  lies
18:18:43  boxbot is friend
18:18:48  friendbot
18:18:53  boxfriend
18:19:14  im friend too
18:19:17  of box
18:19:17  bot
18:20:24  http://gunnerkrigg.wikia.com/wiki/Boxbot
18:20:43  MAY ANGLES GUIDE YOU THROUGH THE HARD TIMES
18:21:54  hi oklopol
18:22:01  hi elliott
18:22:37  okokokokokokokokokoko
18:22:40  okokokokokokokokokoko
18:22:42  kokok
18:22:44  kjgj
18:22:45  okko
18:22:47  ollon
18:23:06 -!- copumpkin has joined.
18:23:19  avant okoing
18:24:28  maybe i could have a beer if i reached really far under my desk
18:24:54  Maybe I could have a beer if I went to oklopol's desk and stole it from him
18:25:01  oklopol, where's your desk?
18:25:40  under my roof.
18:25:53  which i rent so it's mine for now
18:26:08  Hmm
18:26:17  i also rent the ceiling
18:26:18  I've been meaning to go to oklopol-house
18:26:47  i don't really let people in before i clean this place up
18:26:49  so never
18:27:02  well under special circumstances
18:27:29  sorry Ngevd oklopol prioritises me over you
18:27:33  (it's a funny joke)
18:28:12  well i don't really know much about Ngevd
18:28:34  I'm like elliott but simultaneously less and more weird
18:28:35  unless he's also used other nicks. my irc memory is getting kind of worse.
18:28:40  oklopol: taneb
18:28:41  I'm Taneb
18:28:48  i knew that
18:28:52  kind of
18:28:53  no then
18:28:56  You're quoted on my User page
18:29:31  right so okay i know a lot about Ngevd then, and i should definitely consider sleeping more
18:29:39  i think i'm becoming even stupider
18:29:57  quite impossible :D :D :D D:D D D:
18:29:57  `log all me
18:30:10  all me
18:30:23  `log numbers\ of\ 0
18:30:23  2009-11-01.txt:13:05:52:  ehird, and those spaces are all messed up
18:30:28  No output.
18:30:31  `log all me
18:30:36  2010-11-27.txt:18:54:44:  elliott, also why did you call me crazy?
18:30:44  `log are all me
18:30:45  all me
18:30:47  our game can only handle 17000 elevators before it starts getting slow :(
18:30:49  2011-02-14.txt:23:46:34:  Our minorities statistics are all messed up. Er, Christians are in a minority, right?
18:30:56  oklopol: whats evelator
18:31:25  nono you have to read it from left to right, otherwise it might change its meaning
18:31:27  try again
18:31:56  oklopol: whats
18:31:58  oklopol: elevator
18:32:10  it's just a thing that goes back and forth
18:33:44  i like the smell of burning body hair
18:46:11  Ngevd: you like beer?
18:46:18  how did i not know this
18:46:26  I like beer, but not all too much
18:46:35  In fact, I will have one shortly
18:47:23  It appears to be Heineken
18:47:27 -!- derrik has joined.
18:50:04  Ngevd: How can you like beer, you're like 5 years old.
18:50:15  I'm older than you shut up
18:50:29  Yes the fact that I am 4 is not relevant Ngevd.
18:50:49  And it's legal to drink at 5 in Britain
18:50:53  in some circumstances
18:50:58  Drink alcohol, that is
18:51:09 -!- PiRSquared17 has left.
18:51:29  Yes but you're still 5.
18:52:58  Dutch beer and Italian food
18:53:06  You can tell I'm British
18:54:03  On that note,
18:54:05 -!- Ngevd has quit (Quit: dinner).
18:54:19  ngevd is weird
19:10:28  @tell oerjan http://www.reddit.com/r/haskell/comments/mm68o/ghc_74_branched_whats_in_for_christmas/c3291tr
19:10:28  Consider it noted.
19:30:25 -!- yiyus has quit (Ping timeout: 276 seconds).
19:34:46 -!- Klisz has joined.
19:35:54 -!- yiyus has joined.
19:36:35 -!- zzo38 has joined.
19:36:47 -!- sebbu has quit (Ping timeout: 244 seconds).
19:41:47 -!- sebbu has joined.
19:41:47 -!- sebbu has quit (Changing host).
19:41:47 -!- sebbu has joined.
19:43:24 -!- elliott has quit (Read error: Connection reset by peer).
19:43:34 -!- derrik has left.
19:43:39 -!- elliott has joined.
19:54:14  OpenGL vendor string: VMware, Inc.
19:54:14  OpenGL renderer string: Gallium 0.4 on llvmpipe
19:54:14  OpenGL version string: 2.1 Mesa 7.11.1
19:54:16  hmm, vmware?
20:03:22 -!- Vorpal has joined.
20:21:32 -!- quintopia has quit (Ping timeout: 258 seconds).
20:22:35 -!- kmc has quit (Quit: Leaving).
20:23:57 -!- quintopia has joined.
20:23:58 -!- quintopia has quit (Changing host).
20:23:58 -!- quintopia has joined.
20:30:47 -!- sebbu has quit (Read error: Connection reset by peer).
20:31:44 -!- sebbu has joined.
20:31:44 -!- sebbu has quit (Changing host).
20:31:44 -!- sebbu has joined.
20:32:41 -!- Ngevd has joined.
20:33:00  I had XChat open for about an hour before realising that I hadn't actually joined any channels
20:33:06  On which note, hello!
20:34:59  I may design a visual language designed for implementation of esoteric programming languages
20:37:35  I have a mental heuristic: Ngevd says "I may X" -> assume Ngevd will never X.
20:37:50  Pretty much
20:45:30 -!- elliott has quit (Quit: Leaving).
20:49:19 -!- Klisz has quit (Read error: Connection reset by peer).
20:49:41 -!- Patashu has joined.
20:49:41 -!- Klisz has joined.
20:50:13 -!- Klisz has quit (Read error: Connection reset by peer).
20:50:57 -!- Klisz has joined.
20:51:36  `logs ABCDEF...G
20:51:38  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: logs: not found
20:51:42  `log ABCDEF...G
20:51:47  2011-07-14.txt:19:09:45:  It's actually abbreviated ABCDEF...G
20:54:15 -!- DCliche has joined.
20:55:40 -!- Darth_Cliche has joined.
20:57:20 -!- Klisz has quit (Ping timeout: 260 seconds).
20:58:35 -!- DCliche has quit (Ping timeout: 240 seconds).
20:59:02 -!- Klisz has joined.
20:59:26 -!- Klisz has quit (Read error: Connection reset by peer).
20:59:51 -!- Klisz has joined.
21:00:22 -!- Darth_Cliche has quit (Ping timeout: 252 seconds).
21:00:22 -!- Klisz has quit (Read error: Connection reset by peer).
21:17:07 -!- kmc has joined.
21:18:42 -!- quintopia has quit (Ping timeout: 260 seconds).
21:27:17  fungot: ping
21:27:17  Ngevd: there was a brief scream from one of them life choices."
21:27:37  Damn, no pong
21:27:41  Must be disconnected
21:29:53 -!- quintopia has joined.
21:33:49  `? shachaf
21:33:52  shachaf mad
21:33:57  `rm wisdom/shachaf
21:33:59  No output.
21:35:10 -!- pikhq has joined.
21:35:36 -!- pikhq_ has quit (Ping timeout: 260 seconds).
21:44:47  Hello, shachaf
21:44:53  I don't really see you much
21:44:53  Ngevd
21:45:24  I've never seen you, as far as I know.
21:45:35  I'm sometimes called Taneb?
21:45:46  Well, I've seen your nick in IRC.
21:46:09  I meant we rarely converse
21:46:20  It's true.
21:46:24  What are you, Jonathan Hoag?
21:46:36  No, I'm elliott's evil twin
21:47:18  No, wait, I'm the good one
21:47:20  It is easily visible "Taneb" because it is the username after !
21:47:27  Peoplee always misinterpret that sentence...
21:47:43  Are you sure? Are you good one? Or evil? Or both good, possibly? Or both evil? Or both good and evil? Or mixed up?
21:48:11  I'm definitely good
21:48:17  OK
21:48:21  He's much more competent than me, so he must be the evil one
21:48:38  They must be evil due to competent??
21:48:43  Yes
21:50:04  Obviously
21:58:50  Do you know the time of day of birth of fictional characters? Do you ever make it up?
22:00:12  I am going to stick my head out of a window
22:00:15  Wish me luck!
22:00:21  Why?
22:01:40 -!- elliott has joined.
22:01:41  Because it is blustery
22:01:42  Phantom_Hoover...
22:02:04  DEFCON crashed.
22:02:06  "MY NAME IS ELLIOTT HIRD YOU KILLED MY FATHER PREPARE TO DIE"
22:02:16  Phantom_Hoover: Welp.
22:02:18  7ff3b2cb7000-7ff3b2cd7000 rw-s 268109000 00:05 3367                      /dev/dri/card0zsh: abort      ./defcon.bin.x86_64
22:02:19  Do I... leave it running?
22:02:30  Prepare to go back in time to kill your grandfather!!
22:02:32  I doubt much'll happen.
22:02:32  21:27:17:  Ngevd: there was a brief scream from one of them life choices."
22:02:33  :D
22:02:33  elliott: " in there. burn people in there?' said granny. the witch magic and the wizard magic are, i don't have to come.
22:02:44  Phantom_Hoover: Plot twist: I was actually moving my navy to attack.
22:03:33  I had everything build up between Africa and South America.
22:03:44  You'd never have made it past without extremely heavy losses.
22:03:49  :(
22:04:03  elliott, is it blustery where you are, at most 2 miles away from me?
22:04:12  DEFCON?
22:04:18  Ngevd: I... guess so? How do you know it's at most 2 miles.
22:04:30  You live in Hexham
22:04:33  Phantom_Hoover: All this game does is make me really want to play Worms.
22:04:33  Hexham isn't that big
22:04:35  Ngevd: Hexham is that small?
22:04:40  Yep
22:04:43  Huh.
22:04:55  Well, Hexham proper is
22:05:03  Hexham improper is HUGE
22:05:44  And extends for a good 30+ miles westwards from here
22:06:32  Phantom_Hoover: Dammit, I just realised I'd have to pirate W:A again to play.
22:07:47  The story of D&D game I play in has seventeen footnotes so far, and twelve chapters, and five sessions, and thirty-one pages in maximum print mode.
22:08:03  Wait till you can make a novel out of it
22:09:26  Yes, it is meant to be a novel. But not for sale, and in novel mode there are less pages (because character sheets, session titles, and footnotes are omitted)
22:11:01  I am probably only going to keep the TeX source file and the DVI file for anyone to download.
22:12:10  I've never actually played D&D
22:12:19  Got the Player's book thing
22:12:31  Even made a character
22:12:40  But never found anyone to play with...
22:12:51  What version?
22:13:01  4th ed, I'm afraid
22:13:06  I play 3.5 edition.
22:13:23  Read this story if you are interested in it! Now I finished typing all the sessions so far.
22:13:38  I was going to play a Dwarf Cleric
22:14:06  OK, play a dwarf cleric if you want to.
22:14:55  Does that have an implied "but you really shouldn't"?
22:15:14  No it doesn't imply that.
22:15:30  Oh good
22:16:43  The things about these game is you can play many different way, and makes the game interesting because of that. The different character, good at different things, have different preferences and spells and items and personality and so on, etc
22:17:15  Did you read the latest copy of my recording?
22:17:23  I haven't read any
22:18:32  TeX source file:   http://zzo38computer.cjb.net/dnd/recording/level20.tex     Printout file:   http://zzo38computer.cjb.net/dnd/recording/level20.dvi     Macro file:   http://zzo38computer.cjb.net/dnd/recording/dungeonsrecording.tex
22:20:12  Recommended tool for anything?
22:20:22  Read: I don't know how to use TeX
22:20:29  Or what DVI is
22:20:39  Ngevd: Evince can open DVI files.
22:21:00 -!- augur has joined.
22:21:43  Ngevd, DVI is what around three people use for TeX output.
22:22:07  The source file is also readable in any plain text viewer in case you want to
22:32:03 -!- Ngevd has quit (Quit: Leaving).
22:40:05  "Formally, a frame is defined to be a lattice L in which finite meets distribute over arbitrary joins,"
22:40:16  I think this may be the most confusing phrase I have ever read.
22:41:16  There are five words there which I know but which make no sense by their normal definitions.
22:45:48 -!- jix has quit (Remote host closed the connection).
22:53:11 -!- jix has joined.
22:57:47 -!- augur has quit (Read error: Connection reset by peer).
23:01:43 -!- augur has joined.
23:17:16 -!- aloril has quit (Ping timeout: 276 seconds).
23:29:38 -!- aloril has joined.
23:34:25  hi
23:35:19 -!- pikhq has quit (Ping timeout: 244 seconds).
23:35:27 -!- pikhq has joined.
23:37:27  elliott: you know how you ruined one of my NetHack games? well, I started another one to make it winnable again, and actually ascended that one :)
23:37:40  so I can go back to trying to ascend the original one, but am not sure there's time in November while I'm not busy
23:37:42  ais523\unfoog: I will clearly have to distract you more in the future!
23:38:00  ais523\unfoog: (Correction: I ruined _two_ of your NetHack games.)
23:38:11  what was the other one?
23:38:17  ais523\unfoog: The HP one and the silly arena one.
23:38:21  oh right, the HP one
23:38:34 * elliott starts writing his third Perl program.
23:38:46  Very worrying trend.
23:39:05  ais523\unfoog: What's the favoured mathematical operator to append to CPAN to get a usable tool these days?
23:39:16  elliott: cpanm -S
23:39:24  ais523\unfoog: Minus, then?
23:39:28  yep
23:39:36  Thanks.
23:39:53  you need to use -S rather than running it as root, or the perms end up wrong
23:39:58  ais523\unfoog: wow, it's even packaed in my OS, too
23:40:06  *packaged
23:40:11  Kitten?
23:40:17  ais523\unfoog: no, the OS I use :)
23:40:21  not the one I'd rather use
23:40:27  that's @ :)
23:40:34  I can have two OSes I'd rather use!
23:40:55  hmm, having said that, the module I want is /also/ in my package manager
23:41:10  does Perl have issues with mixing distro/cpan packages like Haskell does with distro/cabal-install packages?
23:41:49  ais523\unfoog: also, congrats on ascending
23:41:50  not noticeably; the major issue is that if you install a package both ways, you might not get the right copy
23:43:14  ais523\unfoog: I hope you're right :)
23:43:18  ais523\unfoog: does CPAN even have versioned dependencies?
23:43:34  yes
23:43:39  hmm
23:43:52 * elliott decides to do things via cpanminus for consistency
23:44:12  I, er, don't have a cpanm command-line tool
23:44:28  hmm, weird
23:44:32  oh, it's in usr/bin/vendor_perl/cpanm
23:44:39  why is it in /usr/bin/vendor_perl?
23:45:48 * elliott installs GD
23:46:04  ais523\unfoog: thanks, that was amazingly painless
23:47:20  ais523\unfoog: hmm, you know probably slightly more about perl packages than I do; is there anything you'd recommend to extract a file from a zip file as a bytestring? (without having to unpack the whole thing to the FS)
23:47:26  ais523\unfoog: if I can get a filehandle for it, even better
23:47:41  yes, but I've forgotten its name
23:47:57 * elliott has found Archive::Extract, but it seems to just do extract-to-FS
23:49:13  actually, zip file might be something I haven't done
23:49:20  Archive::Zip seems like the ridiculously fully-featured model
23:49:22  *module
23:49:28  I wonder if there's an Archive::Zip::Simple?
23:49:43  use Acme::Simple;
23:49:59  # language is now Lazy K; simplicity guaranteed
23:50:21  ais523\unfoog: hmm, Archive::Zip is done by somebody with an avatar I recognise!
23:50:23  MUST BE GOOD
23:50:36  Acme-BadExample-1.01Perl document, yes. Perl code, no damn way![Download] [Browse]30 Mar 2009
23:50:36  Acme-Everything-1.01Effectively loads every class in CPAN[Download] [Browse]10 Dec 2007
23:50:36  Acme-Mom-Yours-0.02Your mom is so fat she takes 2 months to compile[Download] [Browse]19 Apr 2009
23:50:52  I bet this guy wishes CPAN let you configure the sorting of your package list.
23:50:57  hi.
23:50:59 -!- pikhq_ has joined.
23:51:04  it's a bad sign when I can't figure out what method's used to get at a particular file in the zip archive
23:51:13 -!- pikhq has quit (Ping timeout: 258 seconds).
23:51:23  ais523\unfoog: http://search.cpan.org/~adamk/Archive-Zip-1.30/lib/Archive/Zip.pm#Zip_Archive_Accessors
23:51:25  ais523\unfoog: found with TOC
23:51:47  "Return the disk that I start on. Not used for writing zips, but might be interesting if you read a zip in. This should be 0, as Archive::Zip does not handle multi-volume archives."
23:51:52  ah right, that returns archive member objects, then you can call a method on /those/ to get a filehandle
23:51:53  hmm, is this an implementation of a common interface?
23:52:04  it's probably an implementation of a spec
23:52:41  elliott discovers the pain of object-oriented pel.
23:52:45  object-oriented pel
23:52:55  kallisti: it's actually not that painful at all
23:53:02 -!- kallisti has quit (Quit: Reconnecting).
23:53:13  it's a bit like other OO languages, except that it's made out of language primitives which means that the corner case behaviour is typically more obviosu
23:53:14  *obvious
23:53:23 -!- kallisti has joined.
23:54:23  ais523\unfoog: it just feels... weird.
23:54:25  in perl
23:54:26  mainly.
23:54:44  elliott: IO::Uncompress::Unzip may be the right module to use
23:54:51  but I just installed Archive::Zip :)
23:55:50  use IO::Uncompress::Unzip qw/unzip/; my $unzipped_file_contents; unzip "zipfile.zip" => $$unzipped_file_contents;
23:55:52  wow that's a nice API
23:56:09  ais523\unfoog: the zip is large
23:56:12  I only want to decompress one file of it
23:56:16  ah, aha
23:56:39  my $zip = Archive::Zip->new();
23:56:39  $zip->read($ENV{'HOME'} . '/.minecraft/bin/minecraft.jar') == AZ_OK or die;
23:56:39  my $terrain = $zip->memberNamed('terrain.png') or die;
23:56:39  my $terrain_fh = $terrain->fh();
23:56:39  that was easy!
23:57:14  IO::Uncompress::Unzip can do that too by adding , Name => "file-in-zip.ext" or whatever as an argument
23:57:20  so, hmm, pretty similar in both cases
23:57:27  ais523\unfoog: to a filehandle?
23:57:33  ais523\unfoog: I suppose it's no big deal to load this as a string
23:57:39  but it feels like a filehandle is FASTER :P
23:57:41  yep, but you have to pass a filehandle reference as argument
23:57:45  and I can't remember how to get one of those things
23:58:02  except with "open my $fh" which I think is special-cased
23:58:30  anyway, if you find a module that works, go for it
23:59:45  ais523\unfoog: Copyright (c) 2005-2007 Paul Marquess. All rights reserved.
23:59:49  for IO::Uncompress::Unzip
23:59:53  which is worrying
23:59:57  the dates?

2011-11-27:

00:00:01  especially since it was uploaded in 2008 :)
00:00:04  :)
00:00:05  ais523\unfoog: the latter date, in particular
00:00:31  wow, Archive::Zip had no releases from mid-2005 to mid-2009
00:00:45  ais523\unfoog: you can access filehandle refs explicitly with a *foo{THING} but... I'm pretty sure you don't ever need to?
00:01:22  kallisti: that's for accessing them after they're created, and there'd be no reason to do that if they already existed
00:01:39  hmm, GD::Image->loadFromPng is failing, but die "$!" doesn't print anything
00:01:43  :/
00:01:54  try $@
00:02:00  elliott: anything in the other error variables?
00:02:03  I was going to suggest $@
00:02:11  $! is more for failures in external binaries, IIRC
00:02:13  ais523\unfoog: thanks, I was just trying to bait someone into giving me another variable to try :)
00:02:28  although $@ is empty too :(
00:03:23  in what way is it failing? returning undef?
00:03:36  does the module specify how to get at errors?
00:03:46  ais523\unfoog: it returns undef, and not from what I can see
00:03:47  the example is
00:03:47          $myImage = new GD::Image(100,100) || die;
00:03:51  which doesn't do much in the way of error reporting
00:03:53  (for the constructors)
00:03:54  right
00:03:59    open (PNG,"barnswallow.png") || die;
00:03:59    $myImage = newFromPng GD::Image(\*PNG) || die;
00:03:59    close PNG;
00:04:02  nothing printing any error
00:04:47  globref, neat.
00:07:14  assuming that's the built-in open, open would save an error msg in $@
00:07:29  it's the myImage part
00:07:47  yeah I guess: something went wrong!
00:07:49 * kallisti helpful
00:07:53  ais523\unfoog: hmm, ah, if you have a filehandle in a $foo how do you pass it as a filehandle?
00:07:57  elliott: ouch at the globally-scoped filehandle names
00:08:02  elliott: $fo
00:08:04  *$foo
00:08:10  ais523\unfoog: is that $foo, or *$foo?
00:08:31  open my $foo, '<', 'barnswallow.png'; $myimage = newFromPng GD::Image($foo);
00:08:48  ais523\unfoog: hmm, aha, I think I've figured out the problem
00:08:51  open does a bit of magic to put a filehandle object in $foo
00:08:53  ->fh() seems to point to /compressed/ data
00:09:12  (I found this by trying to read a line from a known-text file in the archive)
00:09:40  ais523\unfoog: ah!
00:09:40  extractToFileHandle( $fh )
00:09:40  Extract (and uncompress, if necessary) the member's contents to the given file handle. Return AZ_OK on success.
00:09:42  that's what I want
00:09:54  now to figure out how to create a file handle to pass to that :/
00:10:04  elliott: nope, it'll write to a file that the filehandle represents
00:10:07 -!- ais523\unfoog has quit (Remote host closed the connection).
00:10:19  oh
00:10:31  elliott: temp file? :P
00:10:39  kallisti: I'd rather extract it to a string than do that
00:12:18 -!- amtal has quit (Ping timeout: 258 seconds).
00:12:44 -!- sebbu2 has joined.
00:12:44  elliott: you're using Archive:Zip or something?
00:12:44 -!- sebbu2 has quit (Changing host).
00:12:44 -!- sebbu2 has joined.
00:12:54  yes
00:13:02  hmm, is / integer division given two integer operands?
00:14:09  I.... don't think so.
00:14:11  !perl print 5/2
00:14:14  2.5
00:14:36 -!- sebbu has quit (Ping timeout: 258 seconds).
00:14:43  use integer;
00:14:48  forced integer division inside its scope
00:14:51  kallisti: how do I do integer division, then?
00:14:51  *forces
00:14:52  without that?
00:14:57  otherwise you could just floor?
00:15:04  I suppose I'll just assume nobody will have a broken file :)
00:15:21 -!- aloril has quit (Ping timeout: 244 seconds).
00:15:31  floor by the way is int
00:15:42  !perl print  int(5/2)
00:15:42  2
00:16:31  !perl {use integer; print 5/2, ' ' } print 5/2;
00:16:31  2 2.5
00:18:09  Yes, but integer division would be int(5) / int(1.5). Otherwise, you're just rounding the real division. – Rog Feb 12 '09 at 2:56
00:18:21  this person on stackoverflow seems to be confused about what integer division is.
00:18:33  lol
00:25:38  THIS FILE IS THE STUPIDEST THING EVER
00:27:16  elliott: :(
00:27:36  kallisti: let's say you wanted a single png file with a bunch of fixed-size textures in them
00:27:58  okay
00:28:02  kallisti: and you already have permanent, allocated 8-bit unsigned integers to identify the things being textured
00:28:04  do you
00:28:16  - make the file 16x16, use the already-allocated IDs to index them
00:28:16  OR
00:28:26  - make the file 16x16 but put the textures in a completely different order
00:28:27 -!- aloril has joined.
00:28:31  with no coherent mapping from the IDs
00:28:36  second one
00:28:37  more fun.
00:28:39  so that anyone who reads it has to maintain a list mapping the layout to real IDs
00:28:43  kallisti: CONGRATULATIONS! YOU'RE NOTCH!
00:28:57  yaaaaay
00:29:47  elliott: adding one to the many reasons you shouldn't play minecraft
00:30:44  kallisti: I'm not playing Minecraft! This computer can't even /run/ Minecraft.
00:30:56  this one can >.>
00:30:59  ..then wtf are you doing.
00:31:01 * quintopia is on his phone
00:31:09 -!- myndzi\ has changed nick to myndzi.
00:31:33  elliott: also I didn't mean play as in playing, I meant play as in play.
00:31:45  English does weird things with present tense so that it actually doesn't mean the immediate present
00:31:49  we use present progressive for that.
00:32:02  kallisti: mcmap
00:32:08  elliott: yes, but WHY?
00:32:12  if you do not play minecraft
00:32:29  I play Minecraft. Just not on this computer.
00:32:37  oh
00:32:41  okay. well that's... irrelevant. :P
00:32:48  Well, this is currently my only computer.
00:32:57  ah okay.
00:32:58  so it's like
00:33:13  you run... but your only pair of shoes is made of concrete currently.
00:33:19  Yes.
00:33:25  Exactly.
00:33:40  Better than abstract shoes
00:34:02  oh my god leftover turkey is so dry
00:34:03  http://www.minecraftwiki.net/images/7/78/TerrainGuide.png
00:34:06  i am actually considering
00:34:10  I'M CHOKING ON LITTLE BITS OF DRY BIRD MEAT.
00:34:10  scraping this file
00:34:15  by keeping track of the font
00:34:24  as an alternative to manually maintaining a list
00:35:24  why is that perfectly usable portal texture not being used.
00:35:35  elliott: implement minecraft server with portal gun.
00:35:42  Minecraft has portals, you idiot.
00:35:49  not portal portals
00:36:02  but the portal texture says "portal
00:36:06  not used"
00:36:23  Yes, because the portal texture is done procedurally.
00:36:49  ah
00:37:23  anyway portals to netherasslands does not count as portal gun omg yesssss
00:37:34  There are mods for that.
00:37:50  if you haven't figured this out by now: I really like portal guns
00:41:15  kallisti: what I'm doing now is reading the decompiled source to find the mapping
00:41:55  ....bahag\haha
00:42:17  kallisti: it's not that bad, there's a tool to give all the classes and fields good names :P
00:42:37  and it's Java, so not much is actually lost apart from names in the decompilation
00:42:44  DecompiledClass1, DecompiledClass2, DecompiledClass3, ...
00:42:58  kallisti: nope
00:43:04  excerpt:
00:43:05  EntityTNTPrimed.java                       NBTTagShort.java                                             WorldProviderSurface.java
00:43:05  EntityVillager.java                        NBTTagString.java                                            WorldRenderer.java
00:43:05  EntityWaterMob.java                        NetClientHandler.java                                        WorldSavedData.java
00:43:05  EntityWeatherEffect.java                   NetHandler.java                                              WorldSettings.java
00:43:12  magic.
00:43:20  oh right
00:43:20  because
00:43:23  the filenames
00:43:25  are the class names.
00:43:40  kallisti: no the filenames are obfuscated.
00:43:44  kallisti: people just map out each one on release
00:43:47  because
00:43:50  there are like five thousand mods
00:43:52  so
00:43:58  ah
00:44:01  people do this so it's not incredibly painful to mod it :P
00:44:15  good modders
00:44:21  kallisti: the bestest thing is, they have a tool to RE-obfuscate everything
00:44:26  kallisti: because you can't distribute the full minecraft.jar
00:44:35  kallisti: but distributing individual modded .class fails is turned a blind eye to
00:44:46  so it has to be re-obfuscated so it works with the rest of the stock classes in the .jar
00:44:46  HEH
00:45:21  funny legal things funny modders
00:46:24  what happens when you try to use 10 mods at the same time?
00:46:27  chaos?
00:47:17  kallisti: if they don't touch the same classes: it probably just works
00:47:22  kallisti: if they use ModLoader: it just works
00:47:30  even if they change the same stuff
00:47:31  ah
00:47:50  is ModLoader a mod or a Notch thing.
00:47:52  (well, it almost certainly just works. i'm sure _some_ things conflict even with ModLoader)
00:47:54  kallisti: a mod obviously
00:48:25  one mod to rule them all.
00:49:02  HUSSIE WHY YOU NO UPDATE?
00:49:15  /kick kallisti being terrible
00:49:46  elliott: Moment of force (often just moment) is the tendency of a force to twist or rotate an object; see the article torque for details. This is an important, basic concept in engineering and physics. A moment is valued mathematically as the product of the force and the moment arm. The moment arm is the perpendicular distance from the point of rotation, to the line of action of the force. The moment may be thought of as a 
00:49:57  kallisti: hi
00:50:00  kallisti: hi
00:50:28      private void renderEntityOnFire(Entity entity, double d, double d1, double d2,
00:50:28              float f)
00:51:15  I see.
00:51:25  kallisti: why paste
00:51:27  that
00:51:37  elliott: why'd you paste that?
00:51:43  WHO IS TRULY AT FAULT?
00:51:47  you pasted before me
00:51:48  WHO DESERVES TO POINT THE FINGER?
00:51:56  WHAT IS THE MEANING OF MEANING? WHAT IS WHY?
00:52:09  /kick kallisti being terrible
00:52:09  AND MORE IMPORTANTLY, WHY IS WHAT?
00:52:50  A boot is a type of footwear but they are not shoes. Most boots mainly cover the foot and the ankle and extend up the leg, sometimes as far as the knee or even the hip. Most boots have a heel that is clearly distinguishable from the rest of the sole, even if the two are made of one piece.
00:53:06  /boot kallisti
00:53:17  to the... hip? really?
00:53:19  hip boot.
00:53:20  kallisti, why are you pasting this?
00:53:21  ha. ha. ha.
00:53:23  being terrible
00:53:39   to the... hip? really? <-- seems insane
00:53:58      private BufferedImage unwrapImageByColumns(BufferedImage bufferedimage)
00:54:00  well "Hip boots, or waders as they are colloquially called, are a type of boot initially designed to be worn by river fishermen."
00:54:01  kallisti, ^
00:54:02  OK THIS IS STARTING TO GET BETTER
00:54:18              int i1 = ai[l] >> 24 & 0xff;
00:54:18              int j1 = ai[l] >> 16 & 0xff;
00:54:18              int k1 = ai[l] >> 8 & 0xff;
00:54:18              int l1 = ai[l] & 0xff;
00:54:18  what
00:54:22  elliott, java?
00:54:27  minecraft
00:54:30  ah
00:54:37  trying to find the texture id -> terrain.png index mapping
00:54:46  elliott, lol really?
00:54:46  a pair of field boots enjoying a warm summer day. http://en.wikipedia.org/wiki/File:Fieldboots.jpg
00:54:49  Vorpal: yes.
00:54:57  happy boots
00:54:58  Vorpal: i don't want to write my own.
00:55:00  they must be friends
00:55:27  heh
00:55:46  elliott, I assume the mapping will be truly terrible
00:55:57  Vorpal: i'm really hoping it's not in uh
00:55:58  equation form like the above
00:56:05      private TexturePackList texturePack;
00:56:07  aha?
00:56:18  elliott, have you checked that each block object isn't storing a constant of the offset in the texture it wants?
00:56:20  nope, not that :/
00:56:21  or something like that
00:56:26  Vorpal: oh god.
00:56:36  elliott, it is a possibility
00:56:36  Vorpal: i literally hadn't even considered that.
00:56:43  heh
00:56:53  elliott, well block class rather than block object
00:56:53  that's typically how texture maps are done.
00:56:56  at least historically
00:56:59  heh
00:57:06  Vorpal: is there really a class for every single block?
00:57:20  elliott, I don't know. I was just suggesting a possibility
00:57:20  oop power
00:57:29              return blockIndexInTexture;
00:57:32  elliott, it wouldn't surprise me if each one has a class or such
00:57:32  HAHAHAHAHAHAHAHA FUCK ME
00:57:41  elliott, hm?
00:57:44  Vorpal: you're right.
00:57:47  ah
00:57:52  oh my god, Block.java:
00:57:55      public static final Block planks;
00:57:55      public static final Block sapling;
00:57:55      public static final Block bedrock;
00:57:55      public static final Block waterMoving;
00:57:57  [...]
00:58:03  huh?
00:58:08  heh
00:58:13  what on earth is that?
00:58:13  Block.java contains a static final instance for every single type of block
00:58:18  oh right
00:58:24  that is an interesting design
00:58:24  I bet it's casted to the appropriate subclass
00:58:26  when needed
00:58:31  i. want. to. die.
00:58:33  probably
00:58:40  elliott, where are they instantiated?
00:58:45  OOP. Models anything.
00:58:48  i don't want to know.
00:58:54  i just want to get my data and run.
00:58:56  elliott, link me to it at least
00:59:11  Vorpal: download MCP, run decompile.sh, look at src/minecarft/net/minecraft/src/Block.java.
00:59:15  ah
00:59:21  elliott: "HAHAHAHAHAHAHAHA FUCK ME"
00:59:22  seems like too much work
00:59:32  Vorpal: download zip -> extract -> cp minecraft.jar -> sh decompile.sh
00:59:34  *shrug*
00:59:36  not much work
00:59:43  meh
01:00:01  elliott, anyway maybe it is all in the constructor:
01:00:19  this.planks = new Block(id,whatever,whatever)
01:00:31  elliott, in which case you could handle that easily
01:00:40  why on earth would you set static variables in a constructor
01:00:49  Vorpal: i am relatively certain it'll be in the subclasses
01:00:54  kallisti, the static constructor...
01:01:00  oh, yes.
01:01:12  kallisti, and I can think of nowhere else, since the declaration didn't assign them
01:01:27  like: public static final Block planks; rather than public static final Block planks = new ...;
01:01:31  elliott: you could probably use grep to make this easier somehow?
01:01:37  kallisti: yes I've been gerpping.
01:01:45  gerpping
01:01:51  yes.
01:01:56  quite
01:02:00  gerpping in minecarft.
01:02:09  yep
01:03:37  elliott: I mean eventually you could probably just grep a pattern that generates a list of every single offset used.
01:03:40  or whatever
01:04:03  once y ou get l33t enough
01:04:04  yes but i need to find where they are first.
01:04:09  elliott, is there a nice way to minimize fullscreen Uplink on Linux?
01:04:19  Alt-tab?
01:04:20  Sgeo: alt+tab
01:04:21  ...
01:04:33  Doesn't work for me
01:04:38  Unless I was alt+tabbing wrong
01:04:54          stone = (new BlockStone(1, 1)).setHardness(1.5F).setResistance(10F).setStepSound(soundStoneFootstep).setBlockName("stone");
01:04:55          grass = (BlockGrass)(new BlockGrass(2)).setHardness(0.6F).setStepSound(soundGrassFootstep).setBlockName("grass");
01:04:55          dirt = (new BlockDirt(3, 2)).setHardness(0.5F).setStepSound(soundGravelFootstep).setBlockName("dirt");
01:04:55          cobblestone = (new Block(4, 16, Material.rock)).setHardness(2.0F).setResistance(10F).setStepSound(soundStoneFootstep).setBlockName("stonebrick");
01:04:57          planks = (new Block(5, 4, Material.wood)).setHardness(2.0F).setResistance(5F).setStepSound(soundWoodFootstep).setBlockName("wood").setRequiresSelfNotify();
01:05:00          sapling = (new BlockSapling(6, 15)).setHardness(0.0F).setStepSound(soundGrassFootstep).setBlockName("sapling").setRequiresSelfNotify();
01:05:03          bedrock = (new Block(7, 17, Material.rock)).setBlockUnbreakable().setResistance(6000000F).setStepSound(soundStoneFootstep).setBlockName("bedrock").disableStats();
01:05:06  elliott: best design
01:05:06          waterMoving = (new BlockFlowing(8, Material.water)).setHardness(100F).setLightOpacity(3).setBlockName("water").disableStats().setRequiresSelfNotify();
01:05:09          waterStill = (new BlockStationary(9, Material.water)).setHardness(100F).setLightOpacity(3).setBlockName("water").disableStats().setRequiresSelfNotify();
01:05:12          lavaMoving = (new BlockFlowing(10, Material.lava)).setHardness(0.0F).setLightValue(1.0F).setLightOpacity(255).setBlockName("lava").disableStats().setRequiresSelfNotify();
01:05:15  Vorpal: I hate you for being right.
01:05:17  But, doesn't have the texture index, so ha!
01:05:39  Wait, yes it does, maybe?
01:05:43      protected Block(int i, int j, Material material)
01:05:43      {
01:05:43          this(i, material);
01:05:43          blockIndexInTexture = j;
01:05:43      }
01:05:46  elliott, I hate me for being right about that
01:05:49  as well
01:05:58          button = (new BlockButton(77, stone.blockIndexInTexture)).setHardness(0.5F).setStepSound(soundStoneFootstep).setBlockName("button").setRequiresSelfNotify();
01:06:04  So maybe it's in the classes except when it's obvious.
01:06:06  omits slightly
01:06:08  ...
01:06:09  vomits
01:06:14 -!- Sgeo|Uplink has joined.
01:06:20  Alt-Tabbing does nothing
01:06:21  e.g.
01:06:22          stone = (new BlockStone(1, 1)).setHardness(1.5F).setResistance(10F).setStepSound(soundStoneFootstep).setBlockName("stone");
01:06:25  has the texture ID
01:06:26  but
01:06:28          grass = (BlockGrass)(new BlockGrass(2)).setHardness(0.6F).setStepSound(soundGrassFootstep).setBlockName("grass");
01:06:29  doesn't
01:06:38  elliott, look: "stone.blockIndexInTexture"
01:06:39      protected BlockGrass(int i)
01:06:39      {
01:06:39          super(i, Material.grass);
01:06:39          blockIndexInTexture = 3;
01:06:39          setTickOnLoad(true);
01:06:41      }
01:06:46  Anyways, going to go get myself disavowed over a 300c fine
01:06:47  wtf
01:06:50  Vorpal: yes, which is assigned by
01:06:52           stone = (new BlockStone(1, 1)).setHardness(1.5F).setResistance(10F).setStepSound(soundStoneFootstep).setBlockName("stone");
01:06:55  oh
01:06:59  some classes have the texture index in the file
01:07:00  others don't
01:07:03  good.
01:07:08  consistent design.
01:07:08  elliott, oh my god
01:07:16  ouch
01:07:30  Vorpal: basically only the ones with a texture used in more than one place are done here, I think.
01:07:41  elliott, even so.... new
01:07:45  eew*
01:09:39  Waiting to be disavowed
01:09:42  this code really makes me hate myself.
01:09:53  ok
01:09:54  I THINK
01:09:56  what I can do
01:09:58  Going to disconnect to go on the Uplink channel, that won't be the disavow
01:10:00 -!- Sgeo|Uplink has quit (Client Quit).
01:10:02  is write a java program
01:10:07  that iterates through each block
01:10:09  and prints its ID and index
01:10:23  argh i want to DIEEEEEEEEEEEEEEE i hate this so much
01:10:57  elliott, heh
01:11:13  i have this horrible urge to just
01:11:15  only support painterly
01:11:18  which has a texture per file version
01:11:22  elliott, could this be an artifact of the decompilation?
01:11:27  that the real code is quite clean?
01:11:30  no
01:11:33  oh
01:11:33  it changes the arity of constructors
01:11:35  and shit
01:11:35  so
01:11:35  yeah
01:13:59 -!- amtal has joined.
01:14:18  Vorpal: ok i _think_ I have a strategy
01:14:26  grep each line, if the constructor arguments are right, then I have the ID and texture index
01:14:33  otherwise, look up that class for a line that sets the index
01:14:51  WHY CAN'T THIS BE IN A DATA FILE SOMEWHERE
01:27:24 * Phantom_Hoover → sleep
01:27:26 -!- Phantom_Hoover has quit (Quit: Leaving).
01:34:25  lavaMoving = (new BlockFlowing(10, Material.lava)).setHardness(0.0F).setLightValue(1.0F).setLightOpacity(255).setBlockName("lava").disableStats().setRequiresSelfNotify(); -- this is an interesting coding style
01:34:54  What is.
01:35:09  I guess itidus has never seen hideous method chaining stuff before.
01:35:14  correct
01:35:18  It's not hideous *shrugs*
01:35:22  Standard practice in Smalltalk and Objective-C
01:35:23  And I think Perl too
01:35:34  i haven't seen method chaining before
01:35:42  not really standard but it's commonly used in some libraries.
01:35:50  commin in Python libraries as well.
01:35:53  *common
01:36:03  I doubt that, Python libraries don't do explicit setters
01:37:22  some do, it's certainly not encouraged though.
01:37:34  for example pyparsing uses that style, and I think Twisted does in some cases? I don't remember
01:38:39  hmmm
01:38:55  so its kind of like saying
01:40:15  struct { int x, y, z; } point; point a.x(4).y(6).z(8);
01:40:49  basically the methods just return self/this/whatever
01:40:54  so you can call more methods on the return value.
01:41:06  instead of a.x = 4;  a.y = 6;  a.z = 8;
01:41:12  they don't necessarily have to be methods that set members, but they usually are.
01:41:17  uh my notations are always messy and inconsistent
01:41:23 * Sgeo suddenly gets a vision of $ chains in Haskell
01:41:38  That... is sort of like the same thing, isn't it?
01:41:50  not... really.
01:42:15  unless the functions update a record and then return that record, then sure.
01:42:49  but then it's not quite the same because in this style you're doing in-place operations
01:43:42  so it would be more like calling functions on an IORef via modifyIORef or something.
01:44:30  * Sgeo suddenly gets a vision of $ chains in Haskell
01:44:31  *. chains
01:44:50  but yes, it is similar.
01:46:33  elliott: correction: it's not really hideous by itself; it's hideous because that is the /cleanest/ way to do something like that in Java.
01:46:52  heh
01:47:19  I find this highly disconcerting.
01:47:45   WHY CAN'T THIS BE IN A DATA FILE SOMEWHERE <-- not oop enough
01:48:05  YOUR MOM ISN'T OOP ENOUGH
01:48:31  OK, time to Perl this shit up.
01:48:50  heh
01:49:05  elliott: yessssssss
01:49:06  elliott, you could just compile a few of the java files and link your own java program against it
01:49:21  Vorpal: yes, but I don't know how to go from block ID to block. and it'd be harder than just perling up the source
01:49:46  elliott, well you could do reflection to list the static members of the class I think
01:49:49  and iterate through them
01:49:53      public int getBlockColor()
01:49:54  I wonder WTF that does.
01:49:57  probably easier to use perl though
01:50:06  Vorpal: that's less preferable than finding how to look up frmo a block id :)
01:50:08  Vorpal: it is always easier to use Perl than Java.
01:50:13  Vorpal: but anyway I don't know what the dependencies of this thing is.
01:50:32  Vorpal: admittedly, I am not very happy about depending on the MCP to get the indices
01:50:33  elliott, I thought java had import stuff at the top?
01:50:41  Vorpal: yes. i am not going to recursively search for imports
01:50:48  ah
01:51:23  <$blocks_java> until /blocksList = new Block\[256\];$/;
01:51:23  I have to admit this is a compelling coding style :P
01:51:58  elliott, I don't understand it
01:52:03  <> reads a line
01:52:04  whut
01:52:11  elliott, the rest?
01:52:23  What do you think
01:52:26  oh right
01:52:27  I see
01:52:30  okay
01:52:38  elliott, very.... perl
01:52:42  kallisti: Is there a way to temporarily reassign the default file handle :-)
01:52:54  yes...
01:52:56  I don't remember the name
01:52:58  uh.....
01:53:17  let me look it up
01:53:31  select
01:53:33   Vorpal: admittedly, I am not very happy about depending on the MCP to get the indices <-- just parse the bytecode directly
01:53:38  select $file_handle
01:53:56  Vorpal: no.
01:54:02  and then anywhere in perl docs where it says "if file handle is omitted, uses the currently selected file handle"
01:54:06  elliott, good
01:54:12  it is now referring to whatever you select'd
01:54:30  kallisti: I love how select doubles as the perl thing and select(2)
01:54:34  so beautiful
01:54:37  lol
01:54:59  kallisti: so uh is that block-scoped
01:55:03  I'm not actually sure that it doubles as select(2) ?
01:55:07  elliott: no fucking clue. :P
01:55:12  I think it may be global
01:55:13  ?
01:55:20  kallisti: It does: http://perldoc.perl.org/functions/select.html
01:55:27  ah yes it does.
01:55:47  why do recently uploaded youtube videos always list ~300-320 views on popular channels? As in uploaded in the last couple of hours.
01:56:09  not even realistic number, it doesn't even change after I watched it for example
01:56:26  !perl open my $x, "test"; {select $x; print "hi"} print "hi"; close $x;
01:56:40  Vorpal: caching?
01:56:55  elliott, probably, but why about 300?
01:56:56  !perl open my $x, "test"; { print "hi"} print "hi"; close $x;
01:56:57  hihi
01:57:04  elliott: globally scoped, apparently.
01:57:08  Vorpal: because that's how many view it before the first regeneration from 0 views?
01:57:17  kallisti: sigh
01:57:25  elliott: what did you want to use select for?
01:57:32  elliott, I mean, I would expect it to vary between a channel with about 1 million subscribers and one with 100 000 subscribers
01:57:33  it does not
01:57:35  kallisti: shortening the code :)
01:57:40  Vorpal: *shrug*
01:58:25  kallisti, in general elliott is always lazily golfing everything
01:58:32  "Lazily"?
01:58:36  elliott: anyway you can do  $old_f = select;  select $new_f; [...code...]; select $old_f;
01:58:41  if you want.
01:58:46  kallisti: yes. ugly.
01:58:47  elliott, as in, you don't super-golf everything to remove every single char you can
01:59:06  I am always golfing as well.
01:59:08  Use of uninitialized value $_ in pattern match (m//) at colours.pl line 12.
01:59:09  wtf?
01:59:10  but I did
01:59:13  do <> until /blah/;
01:59:16  surely $_ should always be assigned there
01:59:22  or does it only assign to $_ when it's a loop condition >_>
01:59:37  I believe it only assigns to $_ when it's <> actually.
01:59:41  as in while(<>)
01:59:46  I think?
01:59:55  ok what's a nicer way to write {} until ...;
02:00:08  until(...) {}
02:00:08  :P
02:00:27  :(
02:00:35  how would you write "discard lines until one of them matches this regexp"
02:01:19  kallisti: ???
02:01:36  dropUntil? >.>
02:01:40  while(<>) { last if /blah/}
02:01:41  :D
02:01:52  kallisti: surely you mean
02:01:55  last if /blah/ while <>;
02:01:56  :D
02:02:03  not sure if last can go there, but sure.
02:02:06  also...
02:02:07  no
02:02:09  can't do that. :P
02:02:17  expr if x while y
02:02:21  is not valid (unfortunately)
02:02:31  :(
02:02:39  !perl print "hi" if 1 while 1
02:02:40  syntax error at /tmp/input.7931 line 1, near "1 while"
02:02:47  kallisti: now to find why it doesn't terminate :D
02:02:59  is this valid then? { last if /blah/ } while <>;
02:03:09  don't believe so.
02:03:11  you'd need a do
02:03:14  while is then a do-while loop
02:03:15  hm okay
02:03:25  right
02:03:29  !perl {print "hi" if 1} while 1
02:03:29  syntax error at /tmp/input.8056 line 1, near "while 1"
02:03:39  you can do do {...} if $x
02:03:40  though
02:04:03  do {...} is basically "execute this block and return an expression" except when it's part of a do...while
02:04:09  then it's all do-whiley
02:04:28  (I'm sure there's a better way to explain it)
02:04:34  (I bet the docs explain it better)
02:05:32  Not really a function. Returns the value of the last command in the sequence of commands indicated by BLOCK. When modified by the while or until loop modifier, executes the BLOCK once before testing the loop condition. (On other statements the loop modifiers test the conditional first.)
02:05:37  not it basically says the same thing.
02:05:39  s/not/no/
02:06:53  elliott: but yes, unfortunately you can't reduce everything to beautiful postfix statement modifiers.
02:07:07  sometimes you must write conventional looking loops.
02:07:18  Cries.
02:09:01  Vorpal: i'm actually fucking tempted to try and use a java bytecode lib
02:09:19  elliott: noooo, don't let it fucking temp you!
02:09:34  But that's the best kind of temptation!
02:10:53  kallisti: how do i make an unnumbered group :|
02:11:18  a what?
02:11:20  oh
02:11:22  regex
02:11:26  (?:...)
02:11:50  usually I find it better to name groups that you want to extract rather than putting ugly ?:'s everywhere
02:12:03  but it depends on the complexity of the regex.
02:14:26  kallisti: why can't I last inside of do { ... } while (blah);
02:14:46  because the docs say so. :P
02:14:47 -!- Slereah_ has joined.
02:15:02  do BLOCK does not count as a loop, so the loop control statements next, last, or redo cannot be used to leave or restart the block. See perlsyn for alternative strategies.
02:15:22  kallisti: ..............
02:15:34  I bet "alternative strategies" involve labels.
02:15:35 -!- Slereah has quit (Ping timeout: 252 seconds).
02:15:39  For last, you have to be more elaborate:
02:15:39      LOOP: {
02:15:39      do {
02:15:39  last if $x = $y**2;
02:15:40  # do something here
02:15:42      } while $x++ <= $z;
02:15:44      }
02:15:44  yes.
02:15:46  HA HA HA
02:17:31  elliott: alternative, put a label on the next line and goto
02:17:34  :P
02:20:36  GAAH THIS SUCKS
02:21:20  "unless can even be followed by one or more elsif statements, though you may want to think twice before using that particular language construct, as everyone reading your code will have to think at least twice before they can understand what's going on."
02:21:39  elliott: what? trying to do weird things in perl. I agree.
02:22:17  kallisti: no, having to write this stupid script
02:22:23  I think perl should just have an "else unless" :P
02:22:32  kallisti: which will be a COMPLETE PAIN to automate
02:22:59  elsunless bahahahaha
02:23:50  "If the LABEL is omitted, the loop control statement refers to the innermost enclosing loop. This may include dynamically looking back your call-stack at run time to find the LABEL. Such desperate behavior triggers a warning if you use the use warnings pragma or the -w flag."
02:24:03  so functions
02:24:06  can affect loops in their callers
02:24:08  beautiful
02:24:10  yep
02:24:30  goto can affect anything anywhere.
02:24:41  can you goto into the middle of a procedure
02:24:46  believe so, yes.
02:24:49  yessssssssss
02:25:05  can you goto in between the if and the ( in "if (...)"
02:25:07  it does have some restrictions
02:25:12  ....no
02:25:14  if yes, what about 4 bits into the (
02:25:15  don't believe so.
02:25:50  The goto-LABEL form finds the statement labeled with LABEL and resumes execution there. It can't be used to get out of a block or subroutine given to sort. It can be used to go almost anywhere else within the dynamic scope, including out of subroutines, but it's usually better to use some other construct such as last or die.
02:25:56  can't goto out of sort blocks. :(
02:25:58  sad day.
02:26:03  :'(
02:26:50  note that you do actually need a label to goto to
02:27:10  and they must be in "the dynamic scope"
02:27:31  so, on the call stack?
02:27:33  I think?
02:28:35  also note that with wantarray and caller you can write subroutines that do different things depending on where they're called.
02:29:56  !perl sub constant { wantarray? (1,2,3,4,5):
02:29:56  syntax error at /tmp/input.10598 line 1, at EOF
02:29:57  er
02:30:12  !perl sub constant { wantarray? (1,2,3,4,5): "hi" } print constant; print scalar constant
02:30:12  12345hi
02:34:55  wantarray gives you three contexts. 1 = array, 0 = scalar, undef = void
02:37:21  i know :P
02:38:13  oh.
02:38:14  :)
02:38:38  THE MORE YOU (ALREADY) KNOW.
02:39:03 -!- augur has quit (Ping timeout: 252 seconds).
02:41:56  !perl sub continue { print "(haha sucker)"; last}  for(1..100) { print "hi "; continue } print ' done";
02:41:57  syntax error at /tmp/input.12183 line 1, near "; continue"
02:42:15  !perl sub please_continue { print "(haha sucker)"; last}  for(1..100) { print "hi "; please_continue } print ' done";
02:42:15  Can't find string terminator "'" anywhere before EOF at /tmp/input.12260 line 1.
02:42:35  !perl sub please_continue { print '(haha sucker)'; last}  for(1..100) { print 'hi '; please_continue } print ' done';
02:42:35  hi (haha sucker) done
02:42:55  elliott: don't think of them as functions; think of them as control flow statements. :)
02:47:29 -!- augur has joined.
02:47:39  I wonder what you would use to emulate last, next, and goto in Haskll. Cont I guess?
02:48:07  yes, Cont.
02:48:13  kallisti: Haskell is functional programming language it doesn't have control flows
02:48:35  I was referring to "monadic programming" which typically emulates a number of imperative style control flow statements via functions.
02:48:43  or at least
02:48:45  sometimes does.
02:49:00  Some monads can do so, I suppose.
02:49:00  not necessarily typically.
02:49:43  anyway I believe cont would work for goto. I don't know how you would do last and next though.
02:49:49  (aka break and continue)
02:50:02  But Haskell functional programming also means you don't need control flows.
02:50:07  presumably just a specialized kind of goto.
02:50:07  kallisti: emulate is a good word
02:50:27  kallisti: Probably it can make a monad with those kind of commands possible if you wanted to
02:50:27  or perhaps model is a better word
02:50:35  "represent formally" :P
02:50:45  that too!
02:50:57  but operationally, you shouldnt think of it as control flow at all
02:51:49 -!- augur has quit (Remote host closed the connection).
02:52:45 -!- GreaseMonkey has joined.
02:52:53  the weird thing is that I'm pretty sure it will look nothing like normal gotos/breaks/continues
02:53:07  basically instead of labels you'd use monadic functions.
02:54:29  elliott, kallisti, UPDATE
02:55:22  I think to get break and continue to look exactly as they do in imperative languages you would need to pass the "label" to break to as part of the loop construct, set two implicit parameters, and then access the implicit parameters with the break and continue function.
02:55:26  *functions
02:56:27  otherwise you'd just have one "goto" function and then explicitly pass the continuations to go to.
03:03:29  elliott: have you killed yourself yet?
03:11:40  I guess so.
03:11:45  rip elliott
03:14:40  died as he lived; ripped to pieces by gotos.
03:16:26  Do you like the word "ecliptic longitude" or do you think it should be called something else?
03:17:30  i like "clitoric longitude"
03:17:34  zzo38: I think it's a good word, but I don't know what it means so I can't make a normative assertion there.
03:18:02  Equatorial coordinates have "right ascension" and "declination" instead.
03:18:27  And ecliptic longitude is not the same thing as the longitude of the Earth.
03:19:05  Ecliptic longitude means the angle measure on the plane of the ecliptic (the orbit of the Earth around the Sun).
03:19:57  then it is fairly descriptive
03:20:12  Right ascension is the same thing but on the equatorial plane.
03:20:13  would you prefer ecliptic latitude?
03:20:30  Ecliptic latitude is the other coordinate.
03:20:44  So, you have ecliptic longitude and ecliptic latitude.
03:23:38  patashu, ya here? :P
03:33:49 -!- Klisz has joined.
03:51:38  kallisti: hi im back from dead
03:52:53  kallisti: hi
03:55:36  cry
03:55:47  monqy: cry
03:55:49  cry
03:57:05  argh WHY IS THERE NOT A SIMPLE PLACE FOR THIS DATA
03:57:39  W H Y
03:57:43  Because it is not a simple data
03:58:01  it is
03:58:07  it's a byte=>byte mapping
03:58:12  i literally need 256 bytes
03:58:16  in a format that isn't
03:58:18  "java code"
03:58:20  or
03:58:24  "image with overlayed text in tiny font"
03:58:43  I don't know. Maybe convert it
03:59:12  tried that, the java code is too varying to do so, with conditionals and the like
03:59:19  and in the image with text, some of the text is abbreviated, etc.
03:59:22  so it's hard to map to the data values
03:59:41  Make that Java code to output it in the format you want
04:00:11  i've considered that, but getting the java code is quite hard, and it'd be a pain to compile it each time :(
04:29:17  ==> Found dependencies: URI::Escape, LWP::MediaTypes, Encode::Locale, HTTP::Status, HTTP::Negotiate, File::Listing, HTML::Entities, HTTP::Daemon, Net::HTTP, URI, HTML::HeadParser, HTTP::Cookies, HTTP::Date, HTTP::Request::Common, HTTP::Response, WWW::RobotRules, HTTP::Request
04:29:18  good grief
04:29:34  I'm here
04:29:35  what's up
04:29:59  perl dependencies
04:30:05  also myndzi wants to talk to you?
04:30:10  yeah meant that part
04:30:12  beat the game yet?
04:32:06  oh, i came back to it when i said that
04:32:07  i'm on level 12
04:32:08  :)
04:32:22  11 is amusing
04:32:25  i fell for it
04:33:01  i think 4-9 took me the longest so far
04:37:57 -!- augur has joined.
04:40:21 -!- Klisz has quit (Quit: You are now graced with my absence.).
04:43:42 -!- amtal has quit (Ping timeout: 258 seconds).
04:46:00  "The difference between theory and practice is larger in practice than it is in theory."
04:46:09  -- Michele Campeotto
04:46:31  nice
04:46:31  keep it up
04:47:35  I don't know who they are, or even if they first said it or quoted someone else
04:53:05  !perl $x = (0 => "scalar", 1 => "list"); sub test { wantarray} print $x{test}, " "; print @x{test}
04:53:15  lol..
04:53:20  !perl %x = (0 => "scalar", 1 => "list"); sub test { wantarray} print $x{test}, " "; print @x{test}
04:53:43  ...hmm
04:54:12  maybe @x{$key} doesn't work for hashes..
04:54:36  why would it
04:54:39  !perl %x = (0 => "scalar", 1 => "list"); print @x{0,1}
04:54:40  scalarlist
04:54:42  don't hashes contain scalars
04:54:43  oh it does nevermind.
04:54:46  oh
04:55:01  yes but @blah{$ind} says "I want a list result"
04:55:11  so then $ind is evaluated in list context
04:55:17  and taken as a list of keys to fetch
04:55:42  this is how "slices" work in perl.  @array[1..10]
04:56:40  $array[1..10] would interpret 1..10 in list context, which is like some weird flip flop operator.
04:56:45  *scalar context
04:57:16  similarly, $array[1,2,3,4] would evaluate 1,2,3,4 to 4 because , in scalar context is like , in C.
04:57:58  as you can see, this is superior to everything you have ever worked with in any other programming language.
04:58:06  (this is a lie)
05:05:35 -!- MDude has changed nick to MSleep.
05:06:46 -!- sebbu3 has joined.
05:06:47 -!- sebbu3 has quit (Changing host).
05:06:47 -!- sebbu3 has joined.
05:10:01 -!- sebbu2 has quit (Ping timeout: 245 seconds).
05:14:35  ok, 4-12 is kind of a bitch
05:14:35  :P
05:15:37  !perl 2**2
05:15:40  !perl print 2**2
05:15:40  4
05:24:04  !perl use List::MoreUtils; @x = (1,2,3); @y = (4,5,6); print join(' ', pairwise {$a + $b} @x,@y)
05:24:04  Can't locate List/MoreUtils.pm in @INC (@INC contains: /etc/perl /usr/local/lib/perl/5.10.1 /usr/local/share/perl/5.10.1 /usr/lib/perl5 /usr/share/perl5 /usr/lib/perl/5.10 /usr/share/perl/5.10 /usr/local/lib/site_perl .) at /tmp/input.28034 line 1.
05:24:07  :(
05:24:15  sad
05:26:48  attn, is anyone alive someone who sometimes plays minecraft / just owns minecraft, testing urgently needed
05:26:54  didn't Patashu play minecraft, i swear Patashu played minecraft
05:27:22  elliott: ha ha ha ha haa ha ha ha ha ha ha ha ha ha ha never
05:27:25  will I play minecraf
05:27:32  minecraf
05:27:37  yes
05:27:39  sic, motherfucker.
05:28:56  I've never played minecraft in my life
05:29:02  I've never even seen someone play minecraft in person
05:29:05  huh. i thought you did
05:29:14  all my knowledge about minecraft is like the knowledge one has of africa or france
05:34:42  Sgeo: ping
05:34:46  Sgeo: ping ping pnig ingp nig ipgn pgngipngpin pgin gpn igpnpgnipg
05:35:16  elliott, hi
05:35:23  Sgeo: YESSS
05:35:30  Sgeo: Can you play Minecraft from your current location!
05:35:45  Current location, yes
05:35:48  But I have homework to do
05:35:52  GOD DAMMIT
05:36:00  Ok, fine, I'll play now
05:36:15  No playing required :P
05:36:19  Just TESTIN'
05:36:21  Which is uh
05:36:22  Equivalent to playing
05:36:42  Sgeo: 95.149.229.230
05:39:37 -!- SgeoN1 has joined.
05:39:43  SgeoN1: What happened :P
05:39:44  Update
05:41:49  Someone wrote "It sounds like Libras are kind of obtuse." in response to something I wrote. When asked for clarification, they said it is because 180 degrees. But Wikipedia says "Angles larger than a right angle and smaller than a straight angle are called obtuse angles."
05:42:11  elliott, I was in a rush to tell you about UPDATE when computer slowed down
05:42:27  I CAN ASSURE YOU THAT TESTING MINECRAFT IS MORE IMPORTANT ;D
05:42:34  !
05:43:25  Why is that server subtitled as reddit creative
05:43:27 * Sgeo mindboggles
05:43:47  Sgeo: Because it is reddit creative...
05:43:56 * elliott watches chunks load.
05:44:08  This is... not so good so far.
05:44:11 -!- Klisz has joined.
05:44:21  Mostly because everything's grey.
05:44:34  I can't seem to fly
05:44:39  Double-space.
05:45:02  Isn't working
05:45:21  *shrug*
05:45:33  There's not much interesting, is there (I don't know what it actually looks like)
05:45:41  And mouse pointer isn't being captured
05:45:42  Can you try to /warp somewhere interesting?
05:46:37  Where?
05:47:00  Sgeo: /warp to get a list, I think.
05:47:02  Then just pick one :P
05:47:34  Wow, that looks pretty good. Is that water?
05:48:09  Sgeo: ?
05:48:14  http://i.imgur.com/XJQSd.png
05:48:15  Is what water?
05:48:19  What yer standing on.
05:48:25  No
05:48:58  Sgeo: What is it then?
05:49:01  It sure looks like water here.
05:49:11  And I see "water (10 deep)" all over the map.
05:49:16  Computers acting up, hold pn
05:49:22  ahhh gotcha 4-12!
05:49:56  It's grey, looks a little like the half-...whatever things
05:50:17  Sgeo: I'm just asking you what the landscape is if not covered with water...
05:50:23  Landscape?
05:50:26  I'm in a structure
05:50:29  Oh.
05:50:46  Can you exit the structure?
05:50:55  Yeah, I'm at surface level or near it
05:51:01 -!- hagb4rd has quit (Read error: Connection reset by peer).
05:51:09  y=64 exactly.
05:51:47  Surrounded by water
05:51:55  Heh.
05:51:57  But not literally on the water
05:52:03  This warp is ... not the best to test the colours.
05:52:03  Well, the structure's on the water
05:52:06 -!- oerjan has joined.
05:52:13  hi oerjan
05:52:24  hi elliott
05:52:24  oerjan: You have 1 new message. '/msg lambdabot @messages' to read it.
05:52:31  Sgeo: Some intricate open-air structure would be best.
05:52:59  There are only two warp points
05:53:12  Hmm, a lot of this badness is due to me not handling the alpha...
05:53:42  Sgeo: Can I put you on another server? :P
05:54:01  There's now sky overhead, and lots of glass nearby
05:54:21  (Sorry for impersonating you in chat, just had to check it worked.)
05:54:26  ("test" will go on your tombstone.)
05:55:05  I didn't see it
05:55:21  And now MC's acting up
05:55:25  I disconnected you.
05:55:30  So I could change the server.
05:55:36  !!!!!!!!
05:55:38  elliott: that mangling does look a little ugly
05:55:39  What.
05:55:44  oerjan: what mangling
05:55:48  SgeoN1: ?
05:55:49  from your link
05:55:59  oerjan: which link :P
05:56:04  elliott, scary that you're able to disconnect me
05:56:09  http://www.reddit.com/r/haskell/comments/mm68o/ghc_74_branched_whats_in_for_christmas/c3291tr
05:56:09  SgeoN1: Why is that scary?
05:56:19  Unless...... are you proxying?
05:56:32  No, I produced that mcmap screenshot from thin air.
05:57:01  oerjan: oh, right
05:57:09  oerjan: i linked it more as a "wow, polymorphic kinds are finally here!" thing
05:57:11  I was under the impression that you were separately connected, and testing some stalking tool
05:57:27  SgeoN1: Ah. No.
05:57:35  I'm testing mcmap's new texture script.
05:57:39  Restarting comp
05:57:53 -!- Sgeo has quit (Read error: Connection reset by peer).
05:58:28  elliott: challenge: try to find a good comment http://justrakudoit.wordpress.com/2010/12/29/perl-6-fibonacci-versus-haskell/
05:59:44  "What is the performance difference? I like to hate on Haskell because it is still so inefficient."
05:59:46 -!- Sgeo has joined.
05:59:48  lol
05:59:49  at this dude
05:59:53  elliott: I lol'd as well.
06:00:00  considering that Perl 6 doesn't have a working implementation..
06:00:35  well, rakudo is fairly working
06:01:33  Sgeo: hi
06:02:12  elliott: it's also funny on the grounds that perl (including perl 6 now) is always slow.
06:02:27  Do you ever make pizza with just tomato, garlic, olive oil and oregano?
06:02:28  well perl regexps are fast unless you hit an edge-case afaiu
06:02:38  zzo38: No dough?
06:02:40  Hi
06:02:44  elliott: right but that's... it.
06:02:49  that's where the performance ends.
06:02:49  Do you just, like, burn the tomatoes until they're hard enough to form a base?
06:02:49  elliott: You need the pizza bread too.
06:02:51  Sgeo: KONNEKT
06:02:55  zzo38: That's not "just" then!
06:03:04  Yes I made a mistake.
06:03:06  elliott, blargh
06:03:10  Sgeo: wut
06:03:28  elliott: apparently some people are under the delusion that Perl is somehow fast?
06:04:13  elliott, connected
06:04:26  elliott, teleportation is currently out of order
06:04:30  Indeed
06:04:39 -!- derrik has joined.
06:04:40  Can you walk upwards? :P
06:04:51  Oop, stop.
06:04:58  Too late.
06:05:00  Hmm.
06:05:14  OK, I'm going to need to override a few textures before this will even begin to look reasonable.
06:05:18  Thanks.
06:05:30  yw
06:07:38  Sgeo: could you try now maybe? :P >_>
06:09:11  ahaha
06:09:16  Sgeo: would I be correct in saying there's no grass nearby?
06:09:41  Um, there's... little bits of tall grass, I think?
06:09:44  But grass on dirt, no
06:09:48  "You've sealed the monsters away, and conquered the Castle of Elite. Way to go!"
06:09:52  Well, yes there is
06:09:55  But mostly not
06:10:03  WHADDABOUT NOW :P
06:10:05  "You've even solved every puzzle in the game - you're the ultimate puzzle master!!" ;)
06:10:14  ( Patashu )
06:10:23  Sgeo: hahahah still no grass?
06:10:42  Looks like snow
06:11:11  annoying...
06:11:54  Did you see that I died?
06:12:20  Nah, mcmap doesn't see things like that
06:12:30  06:12:02 [DIED] Unknown packet id: 0x9c
06:12:30  Feck
06:12:53  Sgeo: Can you try and die as quickly as possible if I set it up again with debugging?
06:13:07  Um, ok
06:13:12  Not sure the best way to die
06:13:14  /kill ?
06:13:20  Sgeo: /kill, or else jump off something high
06:13:22  It doesn't have to be that quick
06:13:33  Sgeo: Started
06:14:10  zzo38: pizza margherita is even simpler, although it contains different ingredients.  not that i've made it, only eaten it.
06:14:43  /kill is disabled
06:15:04  Lava is not
06:15:06  Sgeo: lava also works :)
06:15:48  or well, equally simple.
06:16:02  Sgeo: then respawn or whatever you did last time
06:16:44  Huh?
06:16:53  SgeoN1: ?
06:16:57  I did resaen after dying a lavary death
06:17:02  Reapawn
06:17:04  Sometimes I omit the tomato and garlic but include salt
06:17:07  Respawn
06:17:21  SgeoN1: oh, huh
06:17:24  That means it was something else :/
06:17:48  SgeoN1: What were you doing when it disconnected last time?
06:18:19  nice myndzi
06:18:26  maybe I'll ask you for hints later
06:18:38  zzo38: oh, your variant is called pizza marinara
06:18:47  elliott, don't remember
06:19:00  :(
06:19:03  Anyways, I want to get back to homework
06:19:07  http://en.wikipedia.org/wiki/Pizza#Pizza_types
06:19:23  Just deliberately disconnected
06:21:36  oerjan: i'm afraid you're going to have to start playing minecraft to help me with edbugging
06:22:29  neapolitan is so ludicrously simple compared to american style pizza, or american style pizza is ludicrously overdone, dependent on view
06:22:40  elliott: sorry
06:22:57  oerjan: yes i'm sorry i must inflict this on you. it is something we must achieve together.
06:24:20  hmm, 4 dollars 1 cent = 8-16 hours
06:24:24 -!- copumpkin has quit (Quit: Computer has gone to sleep.).
06:26:03 -!- sebbu3 has quit (Read error: Connection reset by peer).
06:26:29 -!- sebbu3 has joined.
06:26:30 -!- sebbu3 has quit (Changing host).
06:26:30 -!- sebbu3 has joined.
06:27:29 -!- Klisz has quit (Quit: You are now graced with my absence.).
06:27:32 -!- copumpkin has joined.
06:31:18 -!- copumpkin has quit (Client Quit).
06:40:12  http://en.wikipedia.org/wiki/Wikipedia
06:40:16  this article is very crufty
06:40:52  as long as it's not crunchy or crusty
06:40:56  *munch*
06:41:41  For example, in August 2007, the website WikiScanner began to trace the sources of changes made to Wikipedia by anonymous editors without Wikipedia accounts. The program revealed that many such edits were made by corporations or government agencies changing the content of articles related to them, their personnel or their work.[107]
06:41:46 * kallisti scared
06:42:06  you mean, corporations take /special interest/ in their Wikipedia articles?
06:42:08  I'm shocked.
06:42:13  well it's obviously because it can only be edited by people who don't edit wikipedia, for neutrality reasons.
06:42:26  heh.
06:43:11  http://en.wikipedia.org/wiki/File:Wikipedia_content_by_subject.png
06:43:23  I'd like to see this chart with "pop culture" made distinct from "culture and arts"
06:44:48  kallisti: I'm surprised it's only 30%.
06:45:01 * elliott is also surprised that mathematics and logic is only 1%.
06:45:08  elliott: I was actually under the impression that -- yess
06:45:10  that.
06:45:15  also technology
06:45:20  I thought there were way more of those articles.
06:45:28  but, then again, this is where I spend most of my time on Wikipedia
06:45:36  so, I'm a bit biased.
06:47:31 -!- copumpkin has joined.
06:47:44  http://en.wikipedia.org/wiki/Deletionism_and_inclusionism_in_Wikipedia   "notable topic"
06:49:19  Wikipedia is currently facing a problem of record numbers of volunteers abandoning the site due to excessive deletionism.[26][27][28][29][30][31]
06:49:22  ...
06:49:26  that's a lot of sources.
06:49:33  the deletionsts kept removing the sourcse
06:49:35  so they had to have more
06:49:45  heh
06:50:17  Deletionism was deletionismed away and retconjuration was retconjured in
06:50:54  ^^what I said makes perfect sense to one fandom
06:51:01  I only just discovered this article existed. Is it not the biggest ever violation of Wikipedia:Avoid self-references? Not to mention the fact that it essentially consists of a synthesis of already published material - more like a collection of trivia than an encyclopaedic article. I'm amazed and deeply disappointed that this article somehow passed AFD, and to me it seems to cross a very dangerous line, taking us down the ro
06:51:09   -- deletionist
06:51:41  taking us down the ro
06:52:21  elliott: the rest of the comment actually isn't important...
06:52:28  ad towards ever-increasing focus on Wikipedia  itself in Wikipedia articles, and the gradual obliteration of  the distinction between article-space and Wikipedia-space.  This belongs in the latter, not the former.
06:52:32  but there you go
06:52:37  i didn't want the rest
06:56:17  But don't you know about the rule about ignore all rules? That is why you have to ignore it so that you can make such an article as that. They should have a article about Wikipedia, too.
07:00:06  Who plays Minecraft and also doesn't have homework???
07:02:04  zzo38: I don't understand; there is an article about Wikipedia.
07:03:08  kallisti: Yes, as it is supposed to me. But they should still make it like any other article, even if someone copies it on something else it can be valid
07:04:22  This is a Wikipedia book, a collection of Wikipedia articles that can be easily saved, rendered electronically, and ordered as a printed book. For information and help on Wikipedia books in general, see Help:Books (general tips) and WikiProject Wikipedia-Books (questions and assistance).
07:04:27  what? I didn't know this was a thing.
07:04:28 -!- copumpkin has quit (Quit: Computer has gone to sleep.).
07:04:48  they're not as good as
07:04:50  that one we found
07:04:51  what was it Sgeo
07:05:11  http://esoteric.voxelperfect.net/wiki/Why_testing_is_good
07:05:12  http://esoteric.voxelperfect.net/wiki/Why_testing_is_good_2
07:05:13  oh my god
07:05:16  a spambot just
07:05:17  created thes
07:05:18  e
07:05:31  @tell ais523 [[Why testing is good]] and [[Why testing is good 2]] don't have any spam links, they are so perfect, please don't delete them, please
07:05:32  Consider it noted.
07:05:36  @tell ais523 please
07:05:36  Consider it noted.
07:05:41  elliott: esowiki is an ideal place to test your wiki spambot.
07:05:42  Spambot fail.
07:05:52  THERE IS NO FAIL IT'S BEAUTIFUL
07:06:15  No, beauty would be a spambot that accidentally becomes sentient.
07:06:29  hmmm, so if we switched to hackiki, would spambots still be a problem?
07:06:50  Probably not as much as MediaWiki, for various reasons.
07:07:19  WHAT THERE'S NO WIKIPEDIA BOOK ON CATEGORY THEORY
07:07:22 * kallisti mad
07:07:41  That is, if you require OpenID to login. And Hackiki is rare meaning less spambot programs specifically target it.
07:07:56  Probably none target it thus far.
07:07:59  we shouldn't require login
07:08:01  http://en.wikipedia.org/wiki/Mathematical_beauty
07:08:02  huh
07:08:02  But I think you should have both the MediaWiki and Hackiki, and give them read-only target to each other.
07:08:06  but spambots can be fairly "generic"
07:08:10  s/target/access/
07:09:40  elliott: Yes, it can be, but certain things it is less likely to do. Including OpenID, and protocols other than HTTP and SMTP.
07:10:02  yeah let's make an openid gopher wiki.
07:10:48  You cannot use OpenID on anything other than HTTP except something else I have heard that they might make OpenID on any protocol.
07:11:10  Even with HTTP, the spambot usually do not use commands such as PUT
07:11:19  As far as I know.
07:11:44  A spambot doesn't have to be smart. Indeed, it doesn't need to be much more than a few lines of shell script using curl.
07:12:22  Well, yes; however, regardless of how it is done, certain spambots are more common than others.
07:12:49  i've been thinking that spammers are a bit like resistent bacteria
07:13:42  each one may be resistent against certain spam-fighting methods.  and some may be multiresistent.
07:14:05  and one day there will be one which just cannot be stopped.
07:14:20  Yes that may be true; but still, some are more common than others.
07:14:36  And that is the point I am making about the different commonness
07:15:02 * kallisti thinks hackiki is the solution to all of our problems.
07:15:26  we could even embed interpreters into our articles!
07:15:36  kallisti: Yes, Hackiki would help a lot of things.
07:15:55  also: think of the possible security issues.
07:15:58  so wonderful.
07:16:00  to consider.
07:16:09  one day we will find that a spambot has embedded a spambot into our articles.  then singularity.
07:16:09  But I suggest not removing the MediaWiki.
07:16:18  But add the Hackiki too.
07:17:55  oerjan: when a spambot can't be stopped, it's indistinguishable from productive human contributions
07:17:57  so presumably the wiki admins don't have a fucking clue how to stop the last kind of spam.
07:18:02  at which point, spam has been solved
07:18:06  also, of course we do, it just relies on graue
07:18:11  without manual intervention.
07:18:19  you sound awfully fatalistic about this.
07:18:29  elliott: and graue is not responding i take
07:18:38  nobody's bothered because it's not a serious problem yet...
07:18:44  graue responded last time we had a huge spam influx
07:19:18  wait, there was a day when the entire first page of recent changes was spam deletions, and that's not a serious problem?
07:19:53  oerjan: i see you don't remember the _last_ huge spam influx?
07:20:33  I'm surprised hackiki hasn't gotten more attention
07:20:34  well yeah i do.
07:20:51  did the last huge spam influx have great spam
07:21:02  no
07:21:05  :(
07:21:29  One way to increase the changes in a horoscope board game would be to use extreme harmonics. But I think it should start with real positions and use various cards and moves to change things such as time offset and place offset and house systems and whatever. However, they would always update in real time.
07:21:38  maybe if made the hackiki interface a bit more user friendly it would catch on?
07:22:02  why do you expect hackiki to be popular
07:22:37  Don't make it more user friendly; for various reasons. One reason is that then too many people used it and it and spambots will target it. Other reason is to prevent you from making it impossible to use.
07:23:08  elliott: because it's a cool idea. :D) : )D :
07:24:06  I would at least expect some geek blogger  to be like "yo dawg check out hackiki it's the bomb diggity"
07:24:46  the bomb diggety eh? MAYBE I SHOULD CHECK IT OUT
07:26:40  elliott, hmm?
07:26:43  yesssss
07:26:48  Sgeo: ?
07:26:57   what was it Sgeo
07:27:02  Oh, right
07:27:15  The Esoteric programming languages book?
07:27:15  kallisti are you a geek blogger maybe you could be the geek blogger you'd expect
07:27:34  esoteric programming languages book is good
07:27:37  http://www.barnesandnoble.com/w/esoteric-programming-languages-including-hephaestus-books/1105758069?ean=9781243288011&itm=2&usri=brainfuck
07:27:44  why testing is good is also good
07:28:10  I have seen that a Japanese book mentions my esolang called AAAAAAAAAAAAA!!!!
07:28:41  Wow, nice cover
07:29:22  monqy: one day I will have a bloggs
07:29:31  for my projecks
07:29:45  http://www.barnesandnoble.com/c/hephaestus-books all good
07:30:48  Sgeo: nooo they
07:30:50  made the cover wrose
07:30:57  some even have ratings
07:31:10  Articles On Posthumous Novels, including: The Girl With The Dragon Tattoo, The Girl Who Played With Fire, The Girl Who Kicked The Hornets' Nest, Millennium (swedish Miniseries), The Metamorphosis, Radio Free Albemuth, Northanger Abbey (9/28/2011)
07:31:11  and reviews
07:31:17  i am going to read these reviews
07:31:48  monqy: hi buy minecraft i need... am tester
07:31:54  :(
07:31:56  Which ones have reviews?
07:32:09  you can se because there are stars
07:32:29  i love how some people actually bought these books
07:33:14  has anyone ever died
07:33:15  i love how these books exist
07:33:21  "From Cherryh's wesite: this is not a book by CJ Cherryh. It is a collection of Wiki articles made by a person trying to scam the public and the e-book system by using authors' names attached to what is not the authors' work."
07:33:34  But hey, it does say "Articles on"
07:35:12  http://www.barnesandnoble.com/w/serial-buses-including-hephaestus-books/1105516836?ean=9781244942738&itm=29&usri=hephaestus+books
07:35:19  $43
07:35:45  on some of these sites the books have good reivews
07:35:47  http://www.goodreads.com/book/show/12566363-maximum-ride-including
07:35:54  I could not put these books down! They were incredible. I do think that Max was a bit obonxious and some of the characters in the last books ( Max and Fang ) got a bit inconstant. But the boods were amazing nonetheless. I can't wait for the next book to come out in February 2012
07:36:06  http://www.barnesandnoble.com/c/hephaestus-books?sort=PD&size=30&startat=1 most expensive books
07:36:11  of the hephaestus books
07:36:41  monqy, wow
07:36:55  the boods were amazing
07:36:59  i suspect
07:37:04  that's just people giving reviews on the wrong book
07:37:05  rather than
07:37:08  elliott, yeah
07:37:09  purchasing it and reading it and reviewing it
07:37:10  Role-playing, including: Acting, Role-playing Game, Sexual Roleplay, Psychodrama, Roleplay Simulation, Area Of Effect, Sociodrama, Empty-chair ... Game (pen And Paper), Free Rpg Day
07:37:17  Hephaestus Books represents a new publishing paradigm, allowing disparate content sources to be curated into cohesive, relevant, and informative books.
07:37:24  sexual roleplay, psychodrama
07:37:52  wow choosemyhat.com is definitely the best website
07:38:05  that's gregor
07:38:11  I'm
07:38:13  I'm aware.
07:38:19  i'm just surprised people vote on it
07:38:23  wow someone likes the pirate hat
07:38:38  my vote is for all the ones that aren't pirate hats
07:38:40  except for sunday
07:38:50  I couldn't vote on today's hate because it am already to day.
07:38:51  guys let's all vote for http://codu.org/hats/BlueBeret-sm.jpg
07:38:54  he'll look like a complete shithead
07:38:55  all day tomorrow
07:38:56  http://choosemyhat.com/?s=1&day=15306
07:38:57  go go go
07:39:10  elliott: I picked good hats
07:39:13  because I like good hats.
07:39:14  FUCK YOU
07:39:18  monqy: correct his injustice
07:39:32  i voted for beret
07:39:39  monqy is groupthink
07:39:39  is Sgeo still homework (sgeo is probably still homework)
07:39:52  Sgeo is not homework
07:40:00  Sgeo is soon food
07:40:02  is sgeo
07:40:03  busy in any way
07:40:11  Not too busy to vote on a hat
07:40:18  i wasnt thinking about hat but ok
07:40:21  Sgeo: vote for mine
07:40:23  they're the awesome choices
07:40:33 * Sgeo voted beret
07:40:33  the ones that aren't the pirate hat or the beret
07:40:51  the beret is the only one that will have gregor punched in the face ten times in two days
07:41:15 * Sgeo is clueless about fashion
07:41:24  elliott: http://codu.org/hats/TamOShanter-sm.jpg
07:41:27  you forgot this one.
07:41:47  voting that one for tuesday
07:41:48  its good
07:44:50 * kallisti is the only one with good taste in hats.
07:44:55  time for us to all listen to superturing again
07:44:58  http://codu.org/music/e/superturing/superturing.ogg
07:45:45  Gregor: you don't happen to know toby elliott or matt mcpherrin, do you?
07:46:05  who's this person stealing my name
07:46:20  a man greater than you
07:46:27  impossible
07:46:35  you're insane :P
07:46:41  this is a good song
07:46:42  and perfect
07:46:44  You could have a rule, that, if an aspect line vanishes while a piece is standing on it, then that piece is removed from the game.
07:46:46 * elliott insane and perfect
07:47:09  that reminds me, elliott, how has your life insanity been lately anyhow?
07:47:27  perfect; before you ask, the perfection has been insane
07:47:29  http://twitter.com/#!/TobyElliottUK/status/140505693936562177
07:47:32  i found toby elliott for you
07:48:04  not him
07:48:10  no it's definitely him
07:48:13  i guarantee it
07:48:16  there are two toby elliotts???
07:48:30  i refuse to accept this
07:48:30  there can be only one
07:48:47  he works at mozilla, hence I asked gregor
07:49:43  elliott: http://codu.org/music/op9/GRegor-op9.ogg  I could easily imagine this in a Zelda game.
07:50:06  maybe with some more percussion
07:50:09  is gregor embarrassed of op9 or is it too new for that, i forget
07:50:17  i've only really listened to op. 13
07:51:07  Some of his earlier ones are pretty good, too.
07:58:47  kallisti: the opening bars of the melody are very close to super smash bros music
07:59:41  i could imagine it being in a zelda game as a joke
07:59:46  coppro: I thought so as well actually
08:00:08  My main problem with Op. 9 is the synth is terribad.
08:00:14  pikhq_: picky picky
08:00:23  yeah
08:00:51  my main problem is the only interesting things are the parts that make you go what the fuck, that's not right
08:01:12  superturing was intriguing tho
08:01:43  I've not listened to Op. 9 all the way through, because I can't stand that synth.
08:01:45  i've been wanting to do something like for some time now
08:02:06  What I need is a clone of Sgeo. Wait, no.
08:02:30  elliott, when I'm done cooking I'll come help you
08:02:38  i can help you right now
08:02:40  THERE IS NO COOKERY
08:02:41  ONLY SUFFERING
08:02:47  assuming it helps you that i'm leaving right now
08:02:52 * pikhq_ plays something from Distant Worlds II; that ought to clean it out
08:02:52  oklopol: It totally does. Thx
08:03:09  Real orchestra > synth
08:03:51  i like terribad synth
08:03:52  what an astute observation
08:04:23  monqy: me too
08:04:43  Well, it's not so much that synthesised music is *inherently* bad as it is that, when it's imitating real instruments, it's far too often uncanny valley.
08:04:47  pikhq_ is just jealous because he can't write music with terrible synths.
08:05:12  monqy: me too
08:05:21  orchestras sound boring
08:06:13  elliott: what with their dynamic exression of pitch and volume, using real life physics to produce timbres
08:06:16  boring.
08:06:18  help python is telling me i cant refer to a variable in the lexically enclosing scope :|||  i have a function within a function...and the function wont let me do the things i want to do...
08:06:25  monqy: you can't in python 2
08:06:27  wrap it in a list
08:06:29  use [0] to access
08:06:31  oh
08:06:34  ick
08:06:39  monqy: or just wrap it in an object
08:06:42  you might feel less bad
08:06:49  kallisti: have you ever heard an orchestra, they're so predictable
08:06:52  objects feel bad but maybe i can pretend it is a function
08:06:57  elliott: yes.
08:07:01  and, not necessarily
08:07:04  largely depends on the composer.
08:07:07  monqy: you could use a function too.
08:07:19  kallisti: no sorry orchestras are boring the end my good friend monqy can back me up
08:07:22  wait I thought Python 2.x had closures?
08:07:39  is that not what monqy is talking about?
08:07:51  oh he wants to modify things...
08:07:53  right?
08:07:57  no just reference
08:07:58  Yeah, very largely depends on the composer.
08:08:04  even if i do objects it probably wont be the worst thing ive done in this thing...i made REALLY DUMB quasi pattern matching to ease the pain of not having pattern matching
08:08:20  Some do fairly bland, boring stuff. Some blow your brains out, rearrange them, and put them back in.
08:08:30  monqy: oh if you reference then it works
08:08:33  it's just mutation that doesn't work
08:08:36  hmmmmmmm
08:09:00  so it does
08:09:12  i guess i was just testing wrognly
08:09:18  what a dumb error message though
08:09:27  (can't give names, my source for this is "listening to the classical radio station often, but not paying *that* close of attention to composer, so I can usually recognise composers but can't really tell you the names out of the blue")
08:09:46  though actually,,,i might need mutation,,,because this thing is really dfumb
08:10:02  class Ref:  def __init__(self, v=None): self.v = v
08:10:05  monqy: enjoy
08:10:22  :(
08:10:51  Well. I can say Bach is rather awesome.
08:10:53  maybe i will just be object oriented and make a class ;_;  can i put a class inside a function that might make me feel less bad
08:11:01  sure
08:11:18  it's generally preferable that you not do that though
08:11:20  as it breaks some things
08:11:21  but, who cares.
08:11:25  fuck preferability
08:11:32  ;_;
08:11:47  i have given up on makign this thing preferable at all the moment i had to do it.......
08:11:53  (in python)
08:12:01  there's really no reason to not just put the class at top-level
08:12:14  unless you're doing things that involve dynamic creation of classes on the fly
08:12:17  which... you probably aren't
08:12:21  what if i am
08:12:24  :> :> :>
08:12:26  then good.
08:12:30  do that.
08:13:22  basically I just remember that there's some software somewhere (I don't remember anything else about it) that cannot do  to classes that are not defined at top level.
08:13:33  ...this is very important, I know.
08:13:55  maybe it was inspect?
08:14:09  which would subsequently affect a lot of libraries that utilize reflection.
08:14:13  but I'm not sure.
08:17:02  monqy: anyway if you need some help let me know.
08:17:09 -!- zzo38 has quit (Remote host closed the connection).
08:17:36  i think i can handle this
08:18:09  i'm only giving myself tomorrow to finish it on the threat of painful guilt so all the pain will probably be over soon
08:21:09 * kallisti feels useful today.
08:21:21  I have helped TWO people with TWO languages. minorly.
08:21:22  yessss
08:29:33  monqy: oh also it should be class ref(object):
08:29:48  because capitalization style guide and new-style classes blah blah stupid
08:30:56  but note that no one actually follows a standard capitalization in Python programs.
08:31:33  CamelCase_is_COOLbutipreferinconsistentCaSiNg
08:31:47 -!- SgeoN1 has quit (Quit: Bye).
08:31:53  my-favourite-is-probably-this-one-for-reasons
08:32:13  fairly-classy
08:32:25  monqy: I like that one but also don't depending on the language syntax for reasons
08:32:29  that have already been discussed.
08:32:50  any capsy style depends on syntax
08:33:00  of course the best is to just use spaces.
08:33:14  depends on if you want to use spaces for other things
08:33:16  an example - another example
08:33:38  nah spaces are fine for everything
08:33:38  spaces may be best used there, but they may also be best used elsewhere
08:33:42  f an example
08:33:45  function application
08:33:51  (best language)
08:34:27  f g an example
08:34:33  obviously that's f ( g (an example))
08:34:43  map g an example
08:34:45  also im not used enough to spaces in variable names so it feels too much like separate things whereas variables really should just feel really grouped together and ig et confused between lexeme boundares ;_;
08:34:54  well, obviously this one is map f (an example)
08:34:55  In\ Tcl,\ this\ is\ quite \doable,\ if\ a\ bit\ silly.
08:35:02  quite a bit silly
08:35:17  Also, s/ \/\ /
08:35:18  |I think a few languages allow this sort of thing|
08:35:41  !perl ${hello hi} = 2;
08:35:44  Can't locate object method "hello" via package "hi" (perhaps you forgot to load "hi"?) at /tmp/input.16159 line 1.
08:35:48  oops
08:35:54  weird syntax
08:35:56  !tcl set {hello hi} 2
08:36:28   of course the best is to just use spaces.
08:36:30  ++, except seriously
08:36:46  elliott: well I was being /partially/ serious
08:36:51  it highly depends on the syntax, as monqy said.
08:37:08  it isn't practical if you have syntax because it forces you to make the syntax crappy to compensate
08:37:15  and if you're plain-text then it's really hard to raed
08:37:16  read
08:37:16  obviously you can't mix Haskell-style functional application with spaces-in-variable-names and expect an unambiguous parse.
08:37:56  elliott: so you're advocating the use of spaces in variable names for languages that have no syntax? am I reading correctly? o_o
08:38:06  yes.
08:38:14  oh okay.
08:38:39  Hmm. Spaces in variable names could be perfectly sensible in a C-style language.
08:38:48  Though you'd have to ban spaces in type names.
08:38:57  (no long long int for you!)
08:39:02  kallisti: for instance, @lang allows spaces in variable names, obviously
08:39:14  elliott: because it doesn't exist?
08:39:16  OOOOOOOH SNAP
08:39:22  ha ha ha. but no.
08:40:07  Presumably, @lang doesn't deal in plain text.
08:41:19  @lang should read Microsoft Word documents as programs.
08:41:19  pong
08:41:24  @lang
08:41:25  pong
08:41:26  >_>
08:41:42  @help lang
08:41:43  help . Ask for help for . Try 'list' for all commands
08:41:50  thank you lambdabot
08:42:14  @lang good command
08:42:15  pong
08:42:24  pikhq_: or presumably @lang has no syntax
08:42:26  whatever that means.
08:43:03  indeed it does not.
08:43:52  elliott: I consider Forth to have syntax; thus I'm going to probably consider @lang to have syntax.
08:44:00  Nope
08:44:26  I consider Lisp to have syntax; thus I'm going to probably consider @lang to have syntax.
08:44:36  I would also consider a straight-up parse tree to be syntax.
08:44:49  (which Lisp is very close to being, but not quite :P)
08:44:51  elliott: unless you speak @lang commands and store it as sound file.
08:45:05  or like... draw pictures
08:45:07  syntax would require representation as a string
08:45:07  or...
08:45:17  elliott: No.
08:45:26  well... I dunno? maybe?
08:45:29  @ping duh
08:45:29  pong
08:45:31  Syntax would require representation.
08:45:42  I'm not sure how you would describe the syntax of pure-data, for example.
08:45:44  no it wouldn't. a natural number has no syntax
08:45:50  since it's all graphical and flow-charty
08:46:02  A natural number doesn't have inherent representation.
08:46:18  and such is the nature of @lang?
08:46:46  "ADT = syntax" --pikhq, lying, because he considers strings to have syntax as dictated by BNF which is not part of their structure, and would not consider the syntax of C where each punctuation was swapped with another to be identical
08:48:30  "'ADT = syntax' --pikhq, lying, because he considers strings to have syntax as dictated by BNF which is not part of their structure, and would not consider the syntax of C where each punctuation was swapped with another to be identical" -- elliott, being dense
08:48:41  int main ) int argc * char $ argv (  }  printf(&Hello, World!\n&)' return 0' {
08:49:01  pikhq_: see, now i understand!
08:52:04  elliott: Let's say, hypothetically, C were defined in terms of the tree that results from parsing strings in C, rather than being defined in terms of that string.
08:52:24  I would say that tree *itself* has syntax, as there are rules governing how it can and cannot be structured.
08:53:45  ...oops
08:54:01  int main ) int argc * char $ argv (  }  printf)&Hello, World!:n&(' return 0' {
08:54:02  pikhq_: the problem is that i don't believe you. you may consider it syntax in some abstract sense, but definitely not the same way you consider C, Perl, brainfuck's concrete syntax. you might look at some C code which happens to be "represented" in this way (does that even make any sense?) and say it has Proper Syntax, but it'd be because a pretty-printer was transforming that tree into the familiar syntax... I abjectly disbelieve that you would
08:54:02  consider wildly differing concrete representations of the same abstract syntax to be the same syntax. and if you think a tree can be presented in a fully abstract form with no concretisation to it, i would like to see a picture.
08:54:41 -!- oerjan has quit (Quit: leaving).
08:54:46  pikhq_, does Ook have identical syntax to BF?
08:55:10  elliott: Hmm. Maybe I'm using the wrong term here.
08:55:23  elliott: Let's call the rules for how the parse tree must be constructed metasyntax.
08:55:28  @lang has metasyntax, but not syntax.
08:55:29  pong
08:55:37  pong indeed, lambdabot
08:55:52  pikhq_: hmmm, how about grammar instead of metasyntax? is that right?
08:56:01  pikhq_: I'm not sure I consider that a thing, either -- what /is/ "the parse tree" apart from the set of rules that construct it? there's not some weird overly-flexible data structure plus some limitations, just an a priori definition of a tree
08:56:15  an ADT is a sort of syntax, sure, but I wouldn't call it rules applying to some underlying thing
08:56:29  (but /not/ the sort of syntax you talk about when you talk about identifiers with spaces in them, that's an issue of concrete syntax)
08:56:44 -!- GreaseMonkey has quit (Quit: The Other Game).
08:57:04  elliott: Um, your tree data structure doesn't have many inherent rules. struct tree {struct tree *left; struct tree *right;}
08:57:20  (you think about trees in C?)
08:57:28  Okay, admittedly, bad example.
08:57:38  Far, far too limited of type.
08:57:53  I think about trees in Visual Basic. :>
08:57:56  data Expr t where ETrue :: Expr Bool; EFalse :: Expr Bool; EInteger :: Integer -> Expr Integer; EIf :: Expr Bool -> Expr a -> Expr a -> Expr a
08:57:59  Let's stick that in Haskell-ish. Which... Makes this go into severe nitpicking, actually.
08:58:05  note how EIf (EInteger _) _ _ doesn't type.
08:58:11  and not because of any additional "rules" layered on top
08:58:29  @lang is fully dependently-typed, so of course it can express a type of syntax that admits no invalid syntactical constructions
08:58:29  pong
08:58:35  (invalid semantic constructions, certainly)
08:58:49  not that "invalid syntactical constructions" is meaningful here -- it's just an abstraction inversion to get the point across
08:58:55  the language is defined by its structure
08:59:24  How's about we go with "human language sucks".
08:59:33  Actually, let's go more general.
08:59:35  "humans suck".
08:59:44  elliott: can you take this structure and provide a list of atomic components?
08:59:55  kallisti: sentence insufficiently meaningful
08:59:55 -!- derrik has quit (Ping timeout: 252 seconds).
09:00:23  pikhq not general enough
09:00:24 -!- derrik_ has joined.
09:00:37  elliott: also, are there combinations of these components that are invalid? Are there rules that determine if a given structure is invalid?
09:00:50  repeat previous complaint
09:01:31  elliott: would it be better if I spoke to you in math?
09:01:31  monqy: "Everybody and everything sucks"
09:01:40  now that is more like it
09:01:49  kallisti: probably not. but you're assuming too many concepts necessarily imply. just expand everything out.
09:02:35  elliott: you said that the language is defined by its structure... what does that mean?
09:02:44   data Expr t where ETrue :: Expr Bool; EFalse :: Expr Bool; EInteger :: Integer -> Expr Integer; EIf :: Expr Bool -> Expr a -> Expr a -> Expr a
09:02:45   note how EIf (EInteger _) _ _ doesn't type.
09:02:45   and not because of any additional "rules" layered on top
09:02:45   @lang is fully dependently-typed, so of course it can express a type of syntax that admits no invalid syntactical constructions
09:04:09  being dependently-typed means that all syntactical constructors are valid?
09:04:09  O
09:04:13  I'm confused.
09:04:30  *constructions
09:04:32  hi I'm kallisti.
09:04:33  yes.
09:04:34  you are.
09:04:39  confused, and that.
09:04:58  Is elliott trying to teach GADTs?
09:05:02  no.
09:05:04  no
09:05:05  I get those.
09:05:14  or so he claims, indeed!
09:05:17  not what elliott is currently saying though.
09:05:24  maybe i'll just buy a computer that can run minecraft
09:05:38  Your computer can't run Minecraft?
09:05:45  Oh, btw, I should be able to help you test now
09:06:03  Even if it can't run minecraft, it should be able to run slaves to armok
09:06:20  Sgeo: indeed not
09:06:26  Jafet: Heck no.
09:06:34  Sgeo: Same time, same bat-channel.
09:06:50  04:02 < elliott>  @lang is fully dependently-typed, so of course it can  express a type of syntax that admits no invalid syntactical  constructions
09:06:53  can you explain this bit?
09:07:03    data Expr t where ETrue :: Expr Bool; EFalse :: Expr Bool; EInteger :: Integer -> Expr Integer; EIf :: Expr Bool -> Expr a -> Expr a -> Expr a
09:07:05    note how EIf (EInteger _) _ _ doesn't type.
09:07:17  extend principle to dependent types, note that all things that would be "invalid syntax" are now things that "don't type"
09:07:31  If syntax is computable in the dependent typing system of @lang
09:07:34  you can't put an A where a B is expected, so says a parser, and so says the type-checker if you try and fudge up an invalid tree.
09:08:34  elliott: I don't think that really disproves that the syntax /exists/
09:08:43  that was not what i was talking about at the time.
09:08:47  oh
09:08:49  you are mixing up threads of "discussion"
09:09:00  i was merely disputing that there are "rules" which constitute a syntax, separate from the definition of the tree
09:09:29  Sgeo: (Bat-channel means IP address, for those who speaketh not the tongue. That is, for people who don't know what the hell I'm talking about. Certainly I don't.)
09:09:43  so, ADT = syntax? +_+
09:10:13  kallisti: I didn't say that, either!
09:10:15  Load, chunks, load.
09:10:17  Ah, you load.
09:10:34  Is there a site I can use to set up a poll on, equivalent to sites like quicktopic for instant forum topics?
09:10:38  --and not badly either, though your ice colour is not up to scratch.
09:10:41  Definitely need some handling of alpha.
09:10:58  elliott: okay so you're saying the language is just an ADT?
09:11:13  and then syntax is constructed however you lik?
09:11:14  +e
09:11:15  kallisti: No really, no.
09:12:08  "John is a married bachelor." is grammatically well-formed but expresses a meaning that cannot be true.
09:12:13  someone should make a movie about this.
09:12:19  title: Married Bachelor
09:12:21  Sgeo: And again, mayhaps?
09:12:22  romantic comedy
09:13:20  Hmm, but some of these colours are so strangely averaged.
09:13:54  Seems like a water colour is the next thing I need.
09:13:56  That was apparently a 1941 film.
09:14:08 -!- Phantom_Hoover has joined.
09:14:08  http://www.imdb.com/title/tt0033883/
09:17:31 -!- sebbu2 has joined.
09:17:32 -!- sebbu2 has quit (Changing host).
09:17:32 -!- sebbu2 has joined.
09:18:53 -!- sebbu3 has quit (Ping timeout: 240 seconds).
09:26:24 -!- sebbu has joined.
09:28:23  elliott, do I have anymore testing I need to do?
09:28:34  No Phantom_Hoover has taken over now he is like 50x better (not actually true).
09:29:17 -!- sebbu2 has quit (Ping timeout: 240 seconds).
09:32:31 -!- monqy has quit (Quit: hello).
09:54:58 -!- kmc has quit (Quit: Leaving).
10:31:50  Phantom_Hoover smel sfuny
10:42:45 -!- KingOfKarlsruhe has joined.
10:48:09 -!- derrik_ has quit (Quit: all for today).
11:22:53 -!- copumpkin has joined.
11:25:13 -!- copumpkin has quit (Client Quit).
11:28:26 * elliott considers using pam_ssh. do i dare?
11:28:28  pikhq_: do I dare.
11:28:49  last release 2009. always a good sign
11:39:27  elliott, there?
11:39:31  Vorpal: No.
11:39:36  elliott, you use xfce right?
11:39:43  Well, ostensibly. Yes.
11:40:02  elliott, do you happen to know if there is a way to tell xfce to not put an icon for a given partition on the desktop?
11:40:21  I have loads of pointless ones due to using lvm
11:40:31  Vorpal: Setting -> Desktop -> Icons? (I heartily suggest setting "icon type" to "none".)
11:40:49  Failing that, gconf or dconf or xfconf (real, apparently! I just made it up) or blah.
11:40:55  But desktops are quite an irritating thing, anyway.
11:41:14  elliott, "File system" just removes the one for / there.
11:41:25  "Icon type: None" removes them all. :-)
11:41:33  (You could put symlinks in ~/Desktop for the ones you want.)
11:41:36  (But really, desktops? In 2011?)
11:41:38  oh I guess /home is considered "removable devices"
11:41:57  oh well, I mount usb sticks from the terminal anyway
11:41:57  I don't remember the last time I've seen my desktop
11:42:09  aur/pam_captcha 1.5-4
11:42:10      A Visual text-based CAPTCHA challenge module for PAM/SSH Logins
11:42:12  Well, that's... novel.
11:42:30  Vorpal: A question in response! Do you know if I can make sudo-over-ssh ask the /connecting/ ssh for a pubkey auth?
11:42:54  hm
11:43:06  elliott, you can use pubkey for sudo?
11:43:15  i.e.: On the server donk connected via ssh from my desktop blob I run "sudo blah". sudo-on-donk does some PAM/ssh magic and ends up calling upon blob's ssh to do the standard public-key authentication.
11:43:23  Vorpal: That's what I'm asking.
11:43:32  So the private key isn't on donk at all, ssh-agent on blob works fine, etc.
11:43:46  That would be very nice, since the only reason I have a traditional password on servers is for sudo.
11:43:54  elliott, maybe with key forwarding and some pam module? Really I don't know much about pam.
11:44:05  Guess I picked the wrong person!
11:44:14  afraid so
11:44:19  http://bugs.debian.org/cgi-bin/bugreport.cgi?bug=595817
11:44:23  Aha! This looks like it.
11:44:34  "This module provides authentication via ssh-agent. It takes 3 arguments, file=/path/to/authorized_keys, debug, and allow_user_owned_authorized_keys_file. If an ssh-agent listening at SSH_AUTH_SOCK can successfully authenticate that it has the secret key for a public key in the specified file, authentication is granted, otherwise authentication files"
11:44:36  Yes! Bravo!
11:44:46  Now, does this obsolete pam_ssh...
11:45:12  elliott, I guess you need to forward the ssh agent thingy though?
11:45:16  "libpam-ssh-agent allows you to SSH to a machine with agent forwarding,
11:45:16  and use the agent to authorise PAM transactions, most notably sudo.
11:45:16  The upshot of this is that I can go:"
11:45:20  Not sure how that works, I always avoided it
11:45:24  Vorpal: See http://pamsshagentauth.sourceforge.net/
11:45:26  Always avoided what?
11:46:13  forwarding agent. Because of the security risks if someone else have root access to said machine. I mean, I may co-own a vps with someone without trusting them with my own private key.
11:46:27  which agent forwarding iirc would open for.
11:46:29  Um, this does not involve that at all.
11:46:45  "If an ssh-agent listening at SSH_AUTH_SOCK can successfully authenticate that it has the secret key for a public key in the specified file, authentication is granted, otherwise authentication files"
11:46:52  elliott, it says "agent forwarding" in the text you copied
11:46:56  Offering free authentication of a private key =/= offering private key.
11:47:02  I assume you know how public-key cryptography works.
11:47:38  elliott, yes. "On the remote system, if the ssh-agent connection is forwarded, it is also important that the root user is trustworthy, because they can access the agent socket (though not the key)."
11:47:46 -!- derdon has joined.
11:47:49  (quote from https://en.wikipedia.org/wiki/Ssh-agent)
11:47:59  elliott, which is what I meant.
11:48:07  Well that's moronic, who designed that?
11:49:13  elliott, whoever gave root full access independent of file system permissions :P
11:49:51  I don't see why that's relevant, it's just a case of the socket exposing things it shouldnt'
11:49:53 -!- Patashu has quit (Quit: MSN: Patashu@hotmail.com , Gmail: Patashu0@gmail.com , AIM: Patashu0 , YIM: patashu2 , Skype: patashu0 .).
11:49:53  shouldn't
11:50:02 -!- derrik has joined.
11:50:47  elliott, well, agent forwarding is designed to let you do recursive ssh with the private key locally basically. One use case would be ssh to some gateway kind of system of a LAN and then ssh to the system you want inside I guess
11:51:00  thus you need that ability
11:51:03  Yeah, that's sooooo common.
11:51:12  elliott, well, that is what it was designed for.
11:51:15  not your use case
11:51:23  and agent forwarding isn't commonly used.
11:51:46  Maybe it'd be more commonly used if it did something useful :)
11:51:52  whatever.
11:53:33  I wonder if the ssh protocol itself supports doing a pubkey auth after initial login
11:54:29  doubtful
12:02:59  (Is it normal to iterate SSH key generation until you get a randomart you like?)
12:03:10  nope
12:03:16  what is a "randomart"?
12:03:42  You know, the little pictures ssh-keygen draws you. Meant for host key authentication.
12:04:01  oh that, relatively new stuff
12:04:12  I just compare the fingerprint instead
12:04:18  as in the old style string
12:08:08  elliott, hm can opengl rotation matrices cause gimbal lock?
12:08:25  I'm not sure why you expect me to know.
12:08:57  oh well, worth a try
12:14:31 -!- copumpkin has joined.
12:15:14  Vorpal, can't all matrices?
12:15:14  Phantom_Hoover: You have 13 new messages. '/msg lambdabot @messages' to read them.
12:15:28  Phantom_Hoover, I guess so
12:15:34  elliott, ...
12:15:44  Wow
12:15:44  Phantom_Hoover, so quaternions is our only hope?
12:15:57  that is quite a lot
12:20:27  It is annoying that 2D arrays in C use row-column order.
12:20:35  column-row would be so much better
12:21:11  Vorpal: Dude, they use whatever order you specify.
12:21:23  2D arrays in C are annoying.
12:21:35  elliott, well, if you want foo[4][4] = { { a, b, c} ... }
12:21:39  err a,b,c,d
12:21:41  but anyway
12:21:46  when you write it as a constant there
12:21:47  For example, try passing one to a function.
12:21:49  Well, yes, you have to specify it in the order you use it :P
12:21:56  Jafet: Try returning one.
12:22:01  Jafet: Try returning a 1D array, for that matter.
12:22:20  elliott, problem is I want column-row in memory, but I don't want to have to turn my head when I write it in the source :P
12:22:36  Vorpal: That's why god invented code generation.
12:22:37  Thank you, god.
12:22:40  We love you.
12:39:31 -!- copumpkin has quit (Quit: Computer has gone to sleep.).
12:58:54  elliott, code generation for a simple task like filling out an projection matrix is silly :P
13:00:14  You call yourself a Unix user. (Do you? Anyway, it's a one-liner.)
13:00:18  Deewiant: Dramatic exit
14:34:15 -!- Phantom_Hoover has quit (Ping timeout: 248 seconds).
14:53:55 -!- Phantom_Hoover has joined.
15:41:59 -!- sebbu2 has joined.
15:41:59 -!- sebbu2 has quit (Changing host).
15:41:59 -!- sebbu2 has joined.
15:42:32 -!- sebbu has quit (Ping timeout: 244 seconds).
15:48:19 -!- elliott has quit (Ping timeout: 252 seconds).
16:05:05 -!- derrik has quit (Quit: gone).
16:10:31 -!- oerjan has joined.
16:57:27  It was quiet.  Too quiet.
17:09:44 -!- derrik has joined.
17:16:39 -!- Klisz has joined.
17:17:17 -!- MSleep has changed nick to MDude.
17:19:23  oerjan, yep
17:23:58  after reading today's iwc annotation, i predict dmm is currently receiving a flood of emails pointing out that AC doesn't move electrons from source to destination.
17:35:19  oerjan, and it breaks down for wired networks too when differential signalling is used.
17:35:47  well kind of
17:36:08  wired networks?
17:36:26  like ethernet
17:36:29  oh hm
17:36:51  afaik ethernet uses differential signalling.
17:36:58  whatever that is.
17:37:09  https://en.wikipedia.org/wiki/Differential_signaling
17:39:08  i had a dream that an apocalypse by velociraptor robots was coming
17:40:17  well, i guess that's easier than getting enough dna for actual cloning
18:07:40  i also had a dream that one of my flashcard decks had 320000 due cards
18:10:39  SRS hell.
18:11:24  (Jeeze, I consider it a long day when I've got 100 due)
18:11:41  well i have over 20 decks
18:12:13  and i often take a couple hundred new cards a day
18:12:48  When your review methods include "write down the entire sentence", you're going to have time-consuming SRSing.
18:13:07  yes, probably, i never move a muscle
18:13:24  Damned Japanese, being somewhat hard to ensure you actually notice the distinctions between characters otherwise.
18:13:41  but what's srs, a flashcard program?
18:13:50  When I had been going for recognition, I'd pull stupid shit like confusing 義, 議, 儀...
18:14:08  SRS is a class of flashcard study methods. "Spaced repetition system".
18:14:29  Y'know, where the cards have a longer time between repetitions each time you study them and answer correctly.
18:14:32  apparently i still can't see kanji
18:14:45  oh right.
18:14:54  i use anki
18:15:00  Yeah, figurs.
18:15:03  Figures, even.
18:15:09  That's probably the most used one.
18:15:26  probably, it's not particularly good, lacks tons of very basic things i need all the tiem
18:15:28  *time
18:15:47  Like?
18:16:04  for instance there's no way to get statistics for all decks at once
18:16:10  Aaaah.
18:16:21  Yeah, that's really rather annoying.
18:16:37  Hence why I've got a single largish deck with all my Japanese stuff in it.
18:16:45 -!- oerjan has quit (Quit: Good night).
18:17:14  i study my different japanese decks in different ways
18:17:46  I'm just running with sentences.
18:18:10  Working pretty well thus far.
18:18:31  i should probably get a deck from english to japanese sentences.
18:18:37  seems like the most useful kind of deck
18:20:01  Not really? I at least find it insanely useful doing the fairly simple Japanese-> (Reading, dictionary lookup of things unknown, translation if available), and making sure I can read, write, and understand the sentence in question.
18:20:39 -!- Klisz has quit (Quit: You are now graced with my absence.).
18:20:53  well that i have two decks for
18:21:39  (i don't make my japanese decks)
18:22:01  I'm not particularly focused on production. Y'know, I'd genuinely prefer to say "train station where?" and understand the response, rather than say "Excuse me, but could you tell me how I could find the train station" and be at a complete loss when someone answers. :P
18:22:18  good point
18:22:35  pikhq_, do you often visit Japan?
18:22:43  Vorpal: No.
18:22:54  Vorpal: In fact, I have never been.
18:23:01  what do you use your Japanese knowledge for then?
18:23:03  when watching anime, production is possibly even less useful
18:23:10  heh
18:23:16  okay I guess that is a possible use
18:23:18  why does knowledge need to be used for somethign
18:23:20  Vorpal: Mostly just Japanese media, ATM.
18:23:21  *something
18:23:42 -!- monqy has joined.
18:23:49  oklopol, it doesn't
18:23:51  Honestly, my obsession with Japanese only started because "Hmm. I need to take a foreign language class in high school. Japanese doesn't sound boring. Let's do that."
18:24:00  heh
18:24:16  And after that, I've just been doing it because I like learning the language.
18:24:17  i basically flipped a coin between japanese and chinese
18:24:51 -!- sebbu3 has joined.
18:24:51 -!- sebbu3 has quit (Changing host).
18:24:52 -!- sebbu3 has joined.
18:27:14  If I chose my language learning based on utility, I'd probably be learning ASL. Whiiiich it would actually behoove me to learn, TBH.
18:27:51 -!- sebbu2 has quit (Ping timeout: 248 seconds).
18:28:05  that would be awesome
18:28:35  it's just i would like to learn both the finnish and the american version, dunno how much they differ
18:28:48  assuming i guessed your acronym right
18:28:51  i rarely do
18:28:59  American Sign Language?
18:29:04  yeah
18:29:20  Looking it up, seems Finnish Sign Language is in a different language family entirely.
18:29:22  my other guess was that there's a language called age sex location
18:32:44 -!- zzo38 has joined.
18:33:10 -!- pikhq has joined.
18:33:27  i'm wondering if i should remove this one deck... or can kau as in buy also be used as the kanji for winning?
18:33:58  Um. I am unaware of that having those semantics.
18:34:15 -!- pikhq_ has quit (Ping timeout: 248 seconds).
18:34:44  "who bought the game?"
18:35:13  That's the only sensible semantics I'm aware of.
18:35:50  there are a couple other instances here where they've obviously just used something with the same pronunciation
18:36:19  Which premade deck are you using, anyways?
18:36:33  this is how to ttell the difference between japanese something something
18:36:35  *tell
18:36:56  i just use it to learn readings for kanji
18:39:04  also japanese coreplus and some listening comprehension decks and heisig's kanji deck and then another vocab deck, i love downloading decks.
18:41:50 -!- Ngevd has joined.
18:42:46  Hello!
18:43:21  f(x) walks into a bar
18:43:33  Barman says, "Sorry, we don't cater to functions here"
18:44:55  was that the punchline?
18:45:01  Yes
18:45:55  hmm
18:45:56  cool.
18:46:56  sine of x, cos of x, and e^x go to a party
18:47:24  sine of x and cos of x both go and have a good time
18:47:29  But e^x sits in the corner
18:47:46  Somebody goes and talks to him, asks him why he's not joining in
18:48:24  e^x says, "Sorry, but whenever I try to integrate, I end up with myself"
18:50:04  sine and cos aren't much better at that stuff
18:50:30  It was a small party
18:51:41  in that case, good one
18:52:38  I would tell you my last joke, but this IRC channel is too small to contain it
18:52:39  for all n, are there n functions which derive into each other? are they unique?
18:53:06  All polynomials form an infinite chain of derivatives going upwards
18:53:57  well they form infinitely many such chains, which are not disjoint
18:54:20  And end with 0
18:54:46 -!- sebbu3 has changed nick to sebbu.
18:54:50  yeah but that doesn't really answer the question
18:55:25  I haven't officially learnt about integration yet
18:55:49  somehow i doubt they'll teach you the answer to my question
18:56:04  unless you start your studies with advanced real analysis
18:56:17  Heh, I highly doubt that
18:56:44  for 1, exponential, for 2, hyperbolic sine, for 4, sine. what else?
19:05:39  "Get out of my way - or I'll differentiate you till you're zero!"  "Try it - I'm e to the x..."  "Too bad... I'm d/dy."
19:25:17 * Sgeo is amused
19:34:11  zzo38: do you have the copyright to that joke
19:34:21  oklopol: No.
19:34:38  I don't know if anyone does
19:41:06 -!- ais523 has joined.
19:42:03  oerjan: let D : C^C \to C^C (let's say C_\infty functions only) be the differentiation operator, does it have a unique set of n periodic points of period n for all n?
19:42:11  use your memory on that when you return
19:43:08  meant to say C_\infty, although i don't recall whether it's a subscript or a superscript... not very good at recalling notaiton
19:43:10  *notation
19:44:14  actually i sent a text to my colleague and he solved it in 2 minutes, ignore that.
19:44:49  well for analytic functions at least, it's kind of trivial for them but it's close enough a result in spirit
19:48:47 -!- Klisz has joined.
20:34:28 -!- GreaseMonkey has joined.
20:34:29 -!- GreaseMonkey has quit (Changing host).
20:34:29 -!- GreaseMonkey has joined.
20:36:40  Read my D&D game recording the end of what I wrote so far, tell me what would you do next if you are in that situation?
20:37:53  well i haven't read this but i would use magic
20:39:33  You want to use magic for everything?
20:39:47  You might eventually run out of magic.
20:40:05  Or be prevented from using magic in some other way such as antimagic fields
20:41:52  i'd find a way
20:41:58  i'd use magic to get more magic
20:42:13  I'd use THE POWER OF CHARISMA
20:42:36  You are not even being specific.
20:42:53  You would have to read it to figure out better, isn't it?
20:43:07  Yup
20:43:25 -!- KingOfKarlsruhe has left.
20:43:48  I have my own plans too but I won't tell you what it is yet
21:00:23 -!- DCliche has joined.
21:03:10  i hear d&d has dragons.
21:03:29  they are basically dinosaurs that breathe fire
21:03:38  Yes it has dragons. But currently in the game I was playing in, no dragons have been found yet
21:03:38  how does that work?
21:03:47 -!- Klisz has quit (Ping timeout: 245 seconds).
21:03:53  And some dragons are ice dragons instead of fire
21:03:56  and if you say magic, i will punch d&d.
21:04:34  http://hauns.com/~DCQu4E5g/Fire.htm
21:05:49  okay the author is retarded
21:05:57  *religious
21:25:53  oklopol: D&D dragons are much more intelligent than dinosaurs, or really anything that is currently known to ever have existed
21:25:53  ais523: You have 2 new messages. '/msg lambdabot @messages' to read them.
21:26:07  and they can do a bunch of bizarre things without magic, and magic just makes them even stronger
21:26:09  more intelligent than humans?
21:26:13  easily
21:26:20  it makes them kind-of hard to roleplay/DM
21:26:21  P_p
21:26:31 -!- Phantom_Hoover has quit (Ping timeout: 248 seconds).
21:27:00  p_P
21:27:21  @tell elliott I didn't delete "why testing is good" and the other one, Keymaker did
21:27:21  Consider it noted.
21:29:35  oklopol:
21:30:30  yeah what's your game
21:30:38  hi
21:30:58  hi.
21:31:07  really hi.
21:31:27  o
21:31:30  o
21:31:35  o
21:31:40  o
21:31:43  o
21:31:44  oko
21:31:51  okoko
21:31:53  okokoko
21:31:56  okokokoko
21:32:00  okokokokoko
21:32:04  okokokokokoko
21:32:05  okokokokokokoko
21:32:10  okokokokokokokoko
21:32:11  okokokokokokokokoko
21:32:17  okokokokokokokokokoko
21:32:18  okokokokokokokokokoko
21:32:20  ----
21:32:33  i may have to kill everyone on this channel
21:32:47  sorry, I was actually counting that time, was determined not to lose again
21:32:55  i'm watching office
21:33:06  (I suppose copy-paste would help get it perfect, but what would be the fun in that?)
21:34:26  okokokokokokokokokokokokokokokokokokokokoko
21:34:33  okokokokokokokokokokokokokokokokokoko
21:34:40  o
21:34:41  oko
21:34:43  okoko
21:34:44  okokoko
21:34:45  okokokoko
21:34:47  okokokokoko
21:34:48  okokokokokoko
21:34:49  okokokokokokoko
21:34:51  okokokokokokokoko
21:34:53  okokokokokokokokoko
21:35:13  o
21:35:13  oko
21:35:14  okoko
21:35:15  okokoko
21:35:16  okokokoko
21:35:17  okokokokoko
21:35:18  okokokokokoko
21:35:20  okokokokokokoko
21:35:21  okokokokokokokoko
21:35:23  okokokokokokokokoko
21:35:50  ^ul (o)(~(ko)*:S~:^):^
21:35:50  okookokookokokookokokokookokokokokookokokokokokookokokokokokokookokokokokokokokookokokokokokokokokookokokokokokokokokokookokokokokokokokokokokookokokokokokokokokokokokookokokokokokokokokokokokokookokokokokokokokokokokokokokookokokokokokokokokokokokokokokookokokokokokokokokokokokokokokokookokokokokokokokokokokokokokokokokoo ...too much output!
21:35:57  ^ul (o)(~(ko)*:S( )S~:^):^
21:35:58  oko okoko okokoko okokokoko okokokokoko okokokokokoko okokokokokokoko okokokokokokokoko okokokokokokokokoko okokokokokokokokokoko okokokokokokokokokokoko okokokokokokokokokokokoko okokokokokokokokokokokokoko okokokokokokokokokokokokokoko okokokokokokokokokokokokokokoko okokokokokokokokokokokokokokokoko okokokokokokokokokok ...too much output!
21:36:09  ^ul (o )S(o)(~(ko)*:S( )S~:^):^
21:36:09  o oko okoko okokoko okokokoko okokokokoko okokokokokoko okokokokokokoko okokokokokokokoko okokokokokokokokoko okokokokokokokokokoko okokokokokokokokokokoko okokokokokokokokokokokoko okokokokokokokokokokokokoko okokokokokokokokokokokokokoko okokokokokokokokokokokokokokoko okokokokokokokokokokokokokokokoko okokokokokokokokok ...too much output!
21:36:34  gah, /so tempted/ to submit it to anagolf…
21:36:42  :D
21:37:14  why isn't there an anagolf which is tested manually and where you have to implement a specific algorithm
21:37:17  i wonder
21:37:26  i want that quicksort in golfscript
21:37:58 -!- Phantom_Hoover has joined.
21:38:14  oklopol: I never did end up figuring out how to automatically mark a question "implement a mergesort algo that splits the list into three lists and then sorts them individually and merges them"
21:38:43  you could ask for mergesort specific data to be printed
21:38:51  oklopol: this dragons  guy is the strangest ever. he believes in God making life and man making life and Jesus returning and has no understnading of modern warfare. where do such people live?
21:38:54  like the sorted versions of halves of the lsit
21:38:55  list
21:39:14  quintopia: obviously america
21:39:45  oklopol: but I wasn't allowed to modify the question
21:40:13  in that case you could just look at what functions are called and with what arguments
21:40:18  oklopol: yeah, obviously. but elsewhere too?
21:40:30  at runtime
21:40:44  quintopia: maybe. crazy people out there
21:40:46  and out here
21:41:16  how does he not have an understanding of modern warfare? i mean sure that was just ridiculous but i assume you have a better argument
21:41:41 -!- copumpkin has joined.
21:42:04  oklopol: modern warfare doesn't involve dragons, therefore it sucks
21:42:22  the whole thing about making centaurs for cavalry
21:42:34  or fairy machine gun people
21:42:35  :D
21:42:39  like
21:43:09  he described a predator drone that nullifies the main advantage of a predator drone: that no one dies when it's shot down
21:44:00  we could just not give it equal rights, sorta like a modern nigger.
21:44:36  / woman / child / idiot
21:44:41  thats true. we could throw out modern ethics and solve that problem easily eh
21:45:30  modern ethics = living things are all equal?
21:45:33  no
21:45:40  no one gives a fuck if you rape a fish
21:45:44  no one
21:46:29  i mean any more than if you rape a chair, people might think there's something wrong with you of course
21:47:13  well i guess if you give it a human brain, which seems like something centaur might have...
21:47:26  i was thinking more like horse brain but the great looks of a human
21:50:32  My game is   http://zzo38computer.cjb.net/dnd/recording/level20.tex
21:50:54  The DVI file is also in that directory and so is the include file with macros for D&D 3.5e recording
21:50:55 -!- copumpkin has quit (Quit: Computer has gone to sleep.).
21:54:20 -!- derrik has quit (Quit: left).
21:55:38   no one gives a fuck if you rape a fish
21:55:53  Well, there are certain negative connotations of sleeping with the fishes.
21:56:55 -!- Ngevd has quit (Ping timeout: 248 seconds).
21:57:16  :SDSDSDSDSDSDSDSD
21:57:18  good'n
21:57:59  Yeah, I stole it from the Simpsons' good era.
22:05:12  people are not being very original toda
22:05:12  y
22:12:32 -!- Phantom__Hoover has joined.
22:12:44   people are not being very original toda
22:13:02  Well I applied the joke in an original way?
22:13:27 -!- Phantom_Hoover has quit (Ping timeout: 248 seconds).
22:15:15 -!- Phantom__Hoover has changed nick to Phantom_Hoover.
22:16:06  well true
22:31:32 -!- sebbu2 has joined.
22:31:32 -!- sebbu2 has quit (Changing host).
22:31:32 -!- sebbu2 has joined.
22:32:57 -!- sebbu has quit (Ping timeout: 245 seconds).
22:39:35 -!- Phantom_Hoover has quit (Ping timeout: 248 seconds).
22:41:32 -!- Sgeo has quit (*.net *.split).
22:41:33 -!- Madoka-Kaname has quit (*.net *.split).
22:41:33 -!- Nisstyre has quit (*.net *.split).
22:41:34 -!- Betawolf has quit (*.net *.split).
22:41:34 -!- rodgort has quit (*.net *.split).
22:41:38 -!- fizzie has quit (*.net *.split).
22:41:41 -!- lambdabot has quit (*.net *.split).
22:42:17 -!- Madoka-Kaname has joined.
22:42:20 -!- Madoka-Kaname has quit (Changing host).
22:42:20 -!- Madoka-Kaname has joined.
22:42:23 -!- Sgeo has joined.
22:42:24 -!- Betawolf has joined.
22:42:41 -!- fizzie has joined.
22:43:05 -!- Nisstyre has joined.
22:46:53 -!- rodgort has joined.
23:00:57 -!- Phantom_Hoover has joined.
23:01:01 -!- Phantom_Hoover has quit (Changing host).
23:01:02 -!- Phantom_Hoover has joined.
23:07:08  http://en.wikipedia.org/wiki/Nikolaos_Bourbakis
23:07:18  Such a good name, wasted.
23:07:53  ?
23:08:05  i assume this is a reference to the other bourbakis, but i still don't get it
23:08:55  His name is a stone's throw away from "Nicolas Bourbaki" and he goes into image processing.
23:09:59  there's a famous singer whose name has hamming distance 1 from mine, and another singer with the same name as my dad
23:10:11  and we're both just fucking around and doing nothing useful
23:11:22  A famous Finnish singer?
23:12:18  they've sold a gold album in US so basically the most famous group in finland
23:12:23  globally
23:12:46  It's not Lordi, is it?
23:12:59  :D
23:12:59  no
23:13:11  Lordi is the best thing about Finland.
23:13:23  Not like Sweden, Sweden is irrecoverably terrible.
23:13:38  ...
23:13:39  right
23:14:08  sweden and finland both have a lot of good metal bands
23:14:08  So your name is one character away from "Ville Valo"?
23:14:17  that's a bit of a leap
23:14:40  i've told this channel my name like 5 times
23:15:09  I was not listening at any of them.
23:15:36  so i assume you haven't read my master's thesis either
23:15:44  that's kind of rude.
23:15:51  i've read everything you ever published
23:16:47  Finding a list of Finnish names and listing those with a hamming distance of 1 from that is too much like hard work.
23:16:59  Unless it turns out W|A does it, which is a bit of a stretch.
23:17:02  you could look up common surnames
23:17:11  OK I'll read your master's thesis.
23:17:39  good.
23:17:50  it seems my surname is #21
23:18:47  (Where is your master's thesis.)
23:19:16  http://www.google.fi/url?sa=t&rct=j&q=master's%20thesis%20ville%20salo&source=web&cd=1&ved=0CCoQFjAA&url=http%3A%2F%2Ftucs.fi%3A8080%2Fpublications%2Fattachment.php%3Ffname%3DtSalo11a.full.pdf&ei=SsXSTq2uDcbc4QS4_-0_&usg=AFQjCNGKsoCtnZGHqyuEfAFcc89GdOpBHw
23:19:24  nice link.
23:19:37  doesn't even work :DSAfd
23:19:51  wait totally does
23:21:26  please disregard the typo in the abstract
23:21:51  i sent those for printing and then i'm like hmm did i ever get to writing an abstract....
23:27:17 -!- Jafet has quit (Quit: Leaving.).
23:27:50  and you can read our survey on picture-walking automata for a more complete treatment of picture-walking automata
23:28:00  it's about picture-walking automata
23:32:39 -!- Phantom_Hoover has quit (Read error: Connection reset by peer).
23:44:51 -!- augur has quit (Remote host closed the connection).

2011-11-28:

00:08:08 -!- augur has joined.
00:15:02 -!- Slereah has joined.
00:16:09 -!- Slereah_ has quit (Ping timeout: 260 seconds).
00:16:34 -!- augur has quit (Remote host closed the connection).
00:33:21 -!- ais523 has quit (Remote host closed the connection).
00:34:03  Sgeo: upeano spacedoot.
00:34:40  kallisti, my notifier hasn't gone off, therefore I assume you're lying
00:34:58 -!- Jafet has joined.
00:36:17  Sgeo: your loss
00:36:30 -!- Sgeo has left ("Leaving").
00:36:33 -!- Sgeo has joined.
00:36:49  lordi \m/
00:36:51  just sayin'
00:36:57  Sgeo: I guess you'll just never know how AWESOME this PUMPKINS are.
00:37:14  actually the video for blood red sandman gave me the boots: \m/ \m/
00:37:15                                                               `\o/´
00:37:15                                                                 |
00:37:15                                                                /'¯|_)
00:37:15                                                              (_|
00:37:18  kallisti, or, you may in fact be delayed in seeing the latest updates
00:37:29  Sgeo: no I've seen that
00:37:31  Because we saw pumpkins recently, but that was a while ago
00:37:39  THERE ARE MORE PUMPKINS
00:37:40  The pumpkins update
00:43:38 -!- pikhq_ has joined.
00:43:51 -!- pikhq has quit (Ping timeout: 258 seconds).
00:47:41  mmm cornbread.
00:47:42  so
00:47:43  fucking
00:47:44  good
00:48:07 -!- sebbu2 has quit (Ping timeout: 248 seconds).
00:51:12 -!- sebbu2 has joined.
00:51:13 -!- sebbu2 has quit (Changing host).
00:51:13 -!- sebbu2 has joined.
00:55:46  I made so that some Haskell functions can have Show; it works you can type     maybe (False, True) (join (,))    in GHCi and it tells you the output    Nothing -> (False, True)    Just False -> (False, False)    Just True -> (True, True)
00:56:01  If the type is ambiguous it assumes you mean ()
00:57:01 -!- DCliche has quit (Quit: You are now graced with my absence.).
00:59:37  > succ
01:01:36 -!- copumpkin has joined.
01:02:13  http://upload.wikimedia.org/wikipedia/en/math/a/5/e/a5e707d8d73a8dc420acfb9cb8794622.png
01:02:28  can someone explain this notation? it's a "family of sets"
01:02:42  which, if I understand correctly, is a multiset of sets.
01:07:23  if I understand correctly it's saying that the subsets are basically indexed by an integer or something?
01:09:01  A choice function is a function f, defined on a collection X of nonempty sets, such that for every set s in X, f(s) is an element of s.
01:09:08  The way i read it, there are some sets S for every i in set I, but that's somewhat loose and probably dodgy as an interpretation. Is there any context that would help?
01:09:15 -!- derdon has quit (Remote host closed the connection).
01:09:19  For any set X of nonempty sets, there exists a choice function f defined on X.
01:09:26  oh okay... axiom of choice now makes sense.
01:10:14  http://en.wikipedia.org/wiki/Axiom_of_choice
01:10:24  I see what the subscript i is for now.
01:11:24  ah, cool
01:15:54  I was going to say that restricts the sets to being countable, but I guess "I" could be real numbers here so not necessarily. also the mapping function I -> S is not necessarily bijective I think.
01:16:16  http://en.wikipedia.org/wiki/Indexed_family
01:21:35 -!- copumpkin has quit (Quit: Computer has gone to sleep.).
01:37:53 -!- Jafet has quit (Quit: Leaving.).
01:38:42  > let x = True in not x || x
01:38:56  ....no lambdabot?
01:39:01  NOOOOOOOOOOOOOO
01:39:56  let x = True in not x && x
01:39:57  False
01:40:09  Haskell: not a fan of intuitionism.
01:40:16  (ha ha ha)
01:41:06  of course Maybe Bool gives you a three-valued logic, in which you could probably say that not x || x  is unknown (aka Nothing in this construction)
01:41:31  or well, that not x || x  /can/ be unknown, depending on x.
01:43:28  on a related note
01:43:33  http://lonelynerdsinfedoras.tumblr.com/ needs more Gregor
01:44:34  kallisti, intuitionism?
01:45:08  yes, a kind of mathematical constructivism
01:45:16  What would the result of not True && True be in intuitionism?
01:45:45  http://en.wikipedia.org/wiki/Intuitionistic_logic
01:46:42 * kallisti is still learning so does not have an answer yet :P
01:49:04  well I think not True && True is False
01:49:17  but not p && p cannot in general be proven  (???)
01:51:40  ok quick question, what would be a good scheme standard to implement?
01:52:04  Does R7RS exist?
01:52:17  I've heard bad things about R6RS
01:52:18  i believe so
01:52:21  wait uh
01:52:46  it's got its first draft
01:52:59  but yeah i have heard bad things about versions after R5RS
01:54:06  I've heard bad things about people who hold strong opinions about scheme standards.
01:54:46  "The R6RS standard has caused controversy because it is seen to have departed from the minimalist philosophy."
01:55:34  that is not necessarily a bad thing. But I don't know anything about R6RS
01:56:20 -!- Jafet has joined.
01:56:52 -!- Vorpal has quit (Ping timeout: 244 seconds).
02:01:17 -!- Klisz has joined.
02:01:43 -!- MDude has quit (Ping timeout: 248 seconds).
02:07:26 -!- MSleep has joined.
02:12:44  and i just found a weird bug in wla-dx
02:13:02  if you attempt to include a completely empty file, it crashes
02:13:06  add a newline, it's happy
02:14:12  GreaseMonkey: that doesn't sound too weird.
02:14:45  they probably just overlooked the possibility of the empty file or something?
02:14:55  something like that
02:14:58 -!- zzo38 has quit (Remote host closed the connection).
02:15:33  what about files that contain characters but no trailing newline?
02:15:52  no crash
02:16:04  ah. yeah that's weird.
02:45:07  Hm, I'm pondering this one problem.  Implement a binary semaphore.  The only atomic operation you're allowed is a swap operation: swap(x,y) atomically swaps the values of *x and *y.
02:45:56 -!- TeruFSX has joined.
02:46:56  Arbitrarily many threads could be running at any time.  They can sleep, they can revive each other, and they can interact with each other's memories.
02:47:28  memories?
02:47:42  Yeah.  They use shared memory.
02:47:57  Oh, was thinking of the other definition of memory
02:48:12  Which might require Feather to implement?
02:48:17  >:D
02:48:48 * Sgeo is not thinking too clearly right now
02:49:26  My original thought was for the semaphore to be represented with a variable.  The variable contains 0 when the semaphore is available, and 1 when it's unavailable.  To try to procure the semaphore, a thread prepares a variable containing the number 1, and atomically swaps it with the semaphore variable.
02:51:42  If the thread gets a 0 from this swap, it successfully got the semaphore.  If it gets a 1 from the swap, it did not.
02:51:49  What's the problem with that, unless you have a rogue threat deliberately messing with other threads?
02:52:05  *thread
02:52:13  The problem with that is that there's no way to block on a semaphore.  If you want to procure the semaphore, and it's unavailable, you have to busy loop.
02:53:29  You want to give out the semaphore in fifo order?
02:54:33  Jafet: well, I want to give it out in *some* order.  If thread A procures a semaphore, then thread B tries to procure it, then thread A vacates it, then it should somehow wind up in B's possession.
02:54:36  You could probably implement a queue with atomic swaps
02:54:56 -!- TeruFSX_ has joined.
02:55:00  I've managed to create a queue that goes in the wrong direction.  Each thread has a pointer to the thread before it in line.
02:55:01  You don't have a thread notification mechanism; how do you even do that?
02:55:36  Unfortunately, once you're done with a semaphore, what you need to do is give it to the thread *after* you in line.
02:55:52  Jafet: well, they have shared memory.  To talk to a sleeping process, you change its variables and wake it up.
02:56:03  Okay, so you do assume a notification mechanism.
02:56:19  Well then, you should turn your queue the right way round, I guess.
02:56:20 -!- TeruFSX_ has quit (Read error: Connection reset by peer).
02:56:38  Yes, quite.
02:57:09  The way the queue is built is... more or less the same as my original thought above.  To try to procure the semaphore, you swap your own thread ID into the semaphore variable.
02:57:11 -!- TeruFSX_ has joined.
02:57:24  Either you get a 0, meaning the semaphore is yours, or you get the ID of the guy before you in line.
02:58:30  What you could do is have each thread reserve a location in its memory, then write the memory address to the semaphore. The next thread writes its address to that address.
02:58:31 -!- TeruFSX has quit (Read error: Connection reset by peer).
02:58:51  Er, writes its thread-id to that address.
02:59:27  What if two threads both read the semaphore variable at the same time, and then both write in their addresses at the same time?
03:00:02  I guess right after you swap, you can give guy-before-you your thread ID.  But what if guy-before-you tries to use your thread ID right before you give it to him...
03:00:10  Well, you'd need a small busy-loop while each thread atomically acquires its place in the queue.
03:00:43  I don't think there's any way around that.
03:01:53  Suppose that the zero address is invalid. Then a thread can lock the semaphore by swapping it with zero, add itself to the queue, and swap its memory address to the semaphore.
03:03:48  Hm.  Suppose that two threads try to swap zero into the semaphore at the same time.
03:04:36  One of the threads will get a zero out.  This means it can't proceed, so it has to sleep.  Who wakes it up?
03:04:56  tswett: "queue that goes in the wrong direction"  like a stack? :>
03:05:19  kallisti: that... yeah, a lot like a stack!
03:05:38  heh heh heh heh
03:05:53  tswett: it busy-loops for the minuscule amount of time it takes for the other thread to do two atomic swaps.
03:06:05  umad?
03:06:13 * kallisti mad
03:06:19 * tswett mad.
03:06:40  Yeah, I guess busy looping may be fine if the thread it's waiting on is guaranteed to finish quickly.
03:06:56  Inelegant but fine.
03:07:57  It's probably theoretically impossible to do this with your primitives and no busy waiting
03:08:04  Also, isn't a binary semaphore only two-valued?
03:09:03  A binary semaphore is what we're implementing; that doesn't mean we have to implement it on top of a Boolean variable.
03:09:19  I do wonder if it is theoretically impossible.  If it is, I ought to prove it.
03:09:27 * kallisti briefly imagines an "intuitionistic semaphore"
03:18:03 -!- copumpkin has joined.
03:31:49 -!- augur has joined.
03:49:18 -!- lambdabot has joined.
03:52:13 -!- Klisz has quit (Quit: You are now graced with my absence.).
04:05:28 -!- Jafet has quit (Quit: Leaving.).
04:25:29  HI FRIENDS
04:25:39  @hoogle a -> b -> a -> a
04:25:39  Graphics.Rendering.OpenGL.GL.VertexSpec Color3 :: a -> a -> a -> Color3 a
04:25:40  Graphics.Rendering.OpenGL.GL.VertexSpec Normal3 :: a -> a -> a -> Normal3 a
04:25:40  Graphics.Rendering.OpenGL.GL.VertexSpec TexCoord3 :: a -> a -> a -> TexCoord3 a
04:40:08 -!- augur has quit (Remote host closed the connection).
04:46:32 -!- augur has joined.
05:02:09 -!- kallisti has quit (Ping timeout: 260 seconds).
05:03:45 -!- kallisti has joined.
05:03:45 -!- kallisti has quit (Changing host).
05:03:45 -!- kallisti has joined.
05:05:22 -!- Klisz has joined.
05:18:15 -!- sebbu has joined.
05:18:16 -!- sebbu has quit (Changing host).
05:18:16 -!- sebbu has joined.
05:19:08 -!- sebbu2 has quit (Ping timeout: 244 seconds).
05:23:53  awwww yeah
05:24:02  two monitors. so I can watch starcraft II games and get shit done
05:26:08 -!- zzo38 has joined.
05:32:26 -!- Nisstyre has quit (Quit: Leaving).
05:33:12 -!- Nisstyre has joined.
05:51:47  Can there be barrier monad transformer?
06:00:43  I'm not really sure I understand barrier monads
06:01:04  I am trying to do it; maybe this way I trying can work.
06:02:46 -!- oerjan has joined.
06:04:47   oerjan: let D : C^C \to C^C (let's say C_\infty functions only) be the differentiation operator, does it have a unique set of n periodic points of period n for all n?
06:05:18  ugh help English formatting
06:05:26  a unique subspace of dimension n of periodic points of period | n
06:05:28  I'm supposed to format this as like...
06:05:31  name, title
06:05:37  but the title is like... three parts.
06:05:53  Ph.D., Dean, School of Computing and Software Engineering
06:05:55  or something like that.
06:06:09  should I use semicolons? halp
06:06:15  generated by e^(m*2pi*ix/n) for m=0,...,n-1.
06:06:18  do semicolons exist?
06:06:28  zzo38: can you explain a barrier monad?
06:06:36  @tell oklopol see logs
06:06:37  Consider it noted.
06:06:42  Semicolons exist but I don't know what context the document is
06:07:28  maybe like...
06:07:32  oklopol: er, scratch the formula, thinking too fast
06:07:42  Name, Ph.D.; Dean, School of Computing and Software Engineering
06:07:49  but the semicolon looks weird next to that .
06:07:50  drop the 2pi, i think
06:07:57  oh hm
06:08:16  it's e^(phi*x) where phi^n = 1, of course
06:08:25  kallisti: OK.   data Barrier f b t = Unit t | Barrier f (b -> Barrier f b t);   It means, there is a front type and a back type. The "yield" operation yields a front value and something else make a back value to continue. Similar to how generator functions in JavaScript are, a bit
06:08:25  of which there are n solutions.
06:09:00  zzo38: how does Unit fit into this?
06:09:18  Unit is the "return" operation:   return = Unit;
06:09:26  ah okay.
06:10:13  Of course it is also functor and applicative; all monads are supposed to be also functor and applicative.
06:10:25  the case n=4 gives e^x, e^(-x), e^(ix) and e^(-ix), and the last two can be rearranged as (e^(ix)+e^(-ix))/2 and (e^(ix)-e^(-ix))/(2i), which you may recognize.
06:10:31  ah okay, so then the monadic function is the second field there.  (b -> Barrier f b t)
06:10:43  @tell oklopol etc.
06:10:43  Consider it noted.
06:11:01  There is actually a third constructor   Fail String   which is the "fail" operation and is also used for the Alternative instance
06:11:42 -!- copumpkin has quit (Quit: Computer has gone to sleep.).
06:11:55  zzo38: how does >>= work? is there a >>=?
06:12:21  or is there just a f :: Barrier f b t -> Barrier f b t  ?
06:12:32  s/f/func/
06:12:38  (to differentiate it from the front type)
06:12:39  Yes there is a >>= it is:    Unit x >>= f = f x; Fail x >>= f = Fail x; Barrier a c >>= f = Barrier a $ c >=> f;
06:12:57  ah okay.
06:13:32  so the front value is... always the same?
06:13:36  at least when binding/\
06:13:38  and returning./
06:14:10  kallisti: Do you know the "yield" command in Javascript? The "yield" command here is similar thing (which is the reason why it is called "yield").
06:14:22  yield = flip Barrier Unit;
06:14:25  So, what's this Barrier thing?
06:14:41  Sgeo: ...
06:14:50  only one question asker allowed. :P
06:14:55  NOT REPEAT QUESTIONS
06:14:58 * kallisti decrees.
06:15:33  Sgeo: See above; I specified the definitions
06:16:12   actually i sent a text to my colleague and he solved it in 2 minutes, ignore that.
06:16:15  TOO LATE
06:17:24 -!- mtve has quit (Ping timeout: 260 seconds).
06:18:26 -!- yorick has quit (Ping timeout: 252 seconds).
06:19:12 -!- yorick has joined.
06:24:58 -!- Klisz has quit (Quit: You are now graced with my absence.).
06:27:11  kallisti: a system which has "truth values" for propositions is usually non-intuitionistic, because intuitionistic logic does not track truth but (constructive) provability.
06:27:59  well, right/
06:28:14  It could be possible, of course, to model "justified" or "provable" with boolean values, but then it would be quite clear that two values would not suffice.
06:28:19  but it's a sort of truth-valued logic..
06:28:47  It is possible to make classical logic in Haskell, too, by making a class of law of excluded middle.
06:29:27  if I understand correctly, it's a three-valued logic? or maybe doesn't work like that and exists only as symbolic transformations.. ?
06:29:27  moreover, it's not impossible to prove x || not x if we already know that x is either provable or disprovable
06:29:38  atehwa: yes, I understand that.
06:29:45  i vaguely recall there's a proof that no number of truth values suffices for intuitionistic logic
06:29:54  it may be no finite number
06:29:57  hmm, okay.
06:30:00  interesting.
06:30:17  kallisti: basically, intuitionistic logic is defined by those symbolic transformations
06:30:27  okay, yes I understand now.
06:30:37  what you're trying to do is to give a "semantics" for those symbolic transformations
06:30:52  And I think it can be done by three-valued logic, but I'm not sure
06:30:52  basically implication, though it acts as a symbolic transformation.
06:31:15  oerjan, so, if I were to do it in Haskell, would I require Integer or something, or is it not so straightforward?
06:31:15  Intuitionistic logic is the same as function types of Haskell (due to Curry-Howard).
06:31:18  Or a recursive data type?
06:31:27  Wait what?
06:31:37  well, there's a whole lot of "rules" that describe transformations which are allowed in intuitionistic logic because they're considered "constructive"
06:31:47  Sgeo: zzo38: I was about to say function type is basically implication due to Curry-Howard.
06:31:57  for one thing, intuitionistic logic satisfiability is PSPACE complete, while any finite truth value operators can have it checked in NP.  that's not a proof though since it's still not proved that NP /= PSPACE
06:32:03  I don't quite understand Curry-Howard
06:32:28  (p ||q) && not p => q is _not_ one of the allowed transformations, whereas (p => q) && p => q is.
06:33:09  Sgeo: okay so basically types in programs are like mathematical formula, and the program that the type describes is a proof of that formula.
06:33:38  Sgeo: so when you write the type a -> b  you're actually talking about a logical implication.
06:34:34  And when I write a -> b?
06:34:41  (I think I saw something about this)
06:34:46  wat?
06:35:10  The fact that there's no way to write a -> b (without cheating) means a -> b cannot be proved, or something?
06:35:22  Sgeo: i guess that you could use kripke models as your representation for intuitionistic logic.  i recall playing around with those.
06:35:30  kripke models?
06:35:49  Sgeo: well there's no proof of -> in intuitionistic logic because it's basically the axiom of intuistionistic logic.
06:37:21  http://en.wikipedia.org/wiki/Kripke_semantics#Semantics_of_intuitionistic_logic seems quite unreadable.
06:38:17  Some proofs are simple:    doubleNot = flip id; contrapositive = flip (.); deMorgan x = either (fst x) (snd x);
06:38:19  well, the notation anyway.
06:39:16  identity = id
06:39:18  whew.
06:39:22 * kallisti wipes brow.
06:40:08  :t flip (.)
06:40:09  forall a b (f :: * -> *). (Functor f) => f a -> (a -> b) -> f b
06:40:10  Because I'm lazy
06:40:22  ...wrong .
06:40:27  :t flip (Prelude..)
06:40:28  :t flip (Prelude..)
06:40:28  forall b c a. (a -> b) -> (b -> c) -> a -> c
06:40:29  forall b c a. (a -> b) -> (b -> c) -> a -> c
06:40:34  say you want to show that p || not p  is not provable in intuitionistic logic, by finding a kripke model in which it's not true in all frames.
06:41:01  In this case, c is Zero (an uninhabited type)
06:41:16  oerjan: what's the type for not in Haskell?
06:41:37  :t flip id
06:41:38  forall a b. a -> (a -> b) -> b
06:41:59  let frame 1 be one in which p is false, and frame 2 be one in which p is true.  that satisfies the condition.  but then not p is false in frame 1 because p is true in a later frame.  and p || not p is false in frame 1 because both p and not p are false there.
06:42:45 -!- Jafet has joined.
06:44:10  ah I see type Not a = a -> b
06:44:26  kallisti: b should be Void
06:44:28  not :: Not a
06:44:31  not = undefined  ?????
06:44:32  er
06:44:50  hmmm
06:44:51  oh
06:45:06  Void is the representation of false.
06:45:18  I called the uninhabited type Zero and defined as:    data Zero; type Not x = x -> Zero;
06:45:19  or _|_
06:46:17  hmmm okay, but then what's the proof?
06:46:21  Note you could represent natural numbers by using Zero as number zero and Maybe as successor. If there is such a thing as types that are only capable of holding bijective functions, you could use that to prove equality of natural numbers.
06:46:52  kallisti: proof of what?
06:46:57  oerjan: negation
06:47:03  is it given?
06:47:28  kallisti: to proven negation of x, you construct a contradiction from x.  i.e. you construct an element of Not x.
06:47:32  *prove
06:48:08  oerjan: oh okay. so in Haskell data types with constructors are automatically proven, basically.
06:48:33  if they're made of things that are proven (??)
06:48:37  they're automatically proven if you can find the arguments to their constructors...
06:48:46  yes
06:49:02  constructivism wheeeeee
06:49:05  For example:    Not Zero    proven by the function     id
06:49:41  "prove that booleans are true."   "okay here you go I made them"
06:49:56  s/are true/exist/
06:51:06   but not p && p cannot in general be proven  (???) <-- it can be disproven.
06:51:46  :t const (const True)
06:51:47  forall b b1. b1 -> b -> Bool
06:51:48  of course with that one in particular, that's a little circular semantically
06:52:12  :t asTypeOf (const True)
06:52:13  forall b. (b -> Bool) -> b -> Bool
06:52:14  @djinn Not (Not p, p)
06:52:14  f (a, b) = a b
06:52:27  explosion :: (p, Not p) -> q; explosion (x, y) = contradiction $ y x;     where    contradiction :: forall t. Zero -> t;
06:52:34  :t const (asTypeOf True)
06:52:35  forall b. b -> Bool -> Bool
06:52:39  kallisti: @djinn is an intuitionistic prover
06:52:54  @djinn Void
06:52:54  -- f cannot be realized.
06:52:57  @djinn f :: Void
06:52:57  Cannot parse command
06:53:03  @djinn a -> Void
06:53:03  -- f cannot be realized.
06:53:08  is Void not a thing?
06:53:36  Void is an uninhabited type.  you cannot actually construct it, it's a representation of a contradiction.
06:53:44  oh... right.
06:53:55  @djinn Void -> a
06:53:56  f = void
06:54:02  @djinn-env
06:54:02  data () = ()
06:54:03  data Either a b = Left a | Right b
06:54:03  data Maybe a = Nothing | Just a
06:54:03  data Bool = False | True
06:54:03  data Void
06:54:05  type Not x = x -> Void
06:54:07  class Monad m where return :: a -> m a; (>>=) :: m a -> (a -> m b) -> m b
06:54:08  class Eq a where (==) :: a -> a -> Bool
06:54:29  ah okay, so then Not Void is the only valid type for a in data Not a = Not (a -> Void)?
06:54:30  hm not sure where that void is defined.
06:54:52  kallisti: recursive types are not allowed in this context.
06:54:59  er hm sorry
06:55:00  misread
06:55:42  @djinn Not Void
06:55:42  f a = a
06:55:54  a = Void
06:56:20  @djinn Not Bool
06:56:20  -- f cannot be realized.
06:56:25  ah okay.
06:56:45 * kallisti gets it, I think.
06:58:05  that Bool definition is somewhat unrelated to the intuitionistic truth values
06:58:13  which are Void and Not Void, really
06:58:16  right.
06:58:35  Bool is a sum type of... unit types?
06:59:27  yeah.  @djinn's main purpose is to construct haskell functions with prescribed types, so the intuitionistic part is sort of just underlying.
07:01:22  @djinn a -> b -> a
07:01:22  f a _ = a
07:01:58  @djinn Either a b -> (a -> c) -> (b -> c) -> c
07:01:58  f a b c =
07:01:59      case a of
07:01:59      Left d -> b d
07:01:59      Right e -> c e
07:02:32  oerjan: also, are primitive types kind of just... unproven?
07:02:43  like Int#, State#, etc.
07:03:29   @djinn doesn't deal with those, i think.  it's not _really_ haskell, but a fragment without nontermination and without recursive types.
07:03:51  ah, well, the Haskell Report does define Int as a huge number of constructors right?
07:03:56  or something like that.
07:04:00  What does Either a b mean in the context of intuitionistic logic?
07:04:04  and you can define new nonrecursive types.
07:04:09  Sgeo: or
07:04:15  a or b
07:04:20  Ah, ok
07:05:14  also the | in data declarations is also or.
07:05:19  Can I read that as "If I have a proof of a or b, and I have a proof of if a then c, and I have a proof of if b then c, then c?
07:05:20  kallisti: well yeah.  it's not expected that implementations actually _use_ that representation. :P
07:05:33  Or do I have to do currying?
07:05:38  Sgeo: that's fine
07:06:16  Partial functions don't count as proofs, right? Otherwise I could prove Either a b -> a
07:06:24  indeed not.
07:06:48  What does Maybe a mean?
07:07:02  And how do I do logical and?
07:07:10  Logical and does (,)
07:07:11  and is (,)
07:07:12  it's isomorphic to Either () a
07:07:15  And logical or does Either
07:07:23  *Maybe is
07:07:45  Maybe makes it always true it is always provable by   Nothing
07:07:46  oerjan, I take it that that's essentially useless, since it should always be true
07:07:53  Sgeo: yeah
07:07:54  no that's why it's useful.
07:07:59  in program-land :P
07:08:00  For numbers, you might use Maybe for successor, though
07:08:31  @djinn Maybe a
07:08:32  f = Nothing
07:08:43  @djinn a
07:08:44  -- f cannot be realized.
07:09:32  @djinn Bool
07:09:32  f = False
07:10:09  type Bool = Either () ()    -- yes?
07:10:10  @djinn (() -> a) -> a
07:10:10  f a = a ()
07:10:17  kallisti: essentially :P
07:10:31  and () is useless since you can construct it on the fly
07:10:45  oh hm.
07:11:12  Why have anything other than Either, (,), and ()?
07:11:21  And (->)
07:11:25  i _think_ @djinn makes an attempt to use as many arguments as possible, i.e. it's slightly preference for linear logic.  so it's not _entirely_ useless.
07:11:37  @djinn Maybe a -> (a -> b) -> Maybe b
07:11:38  f a b =
07:11:38      case a of
07:11:38      Nothing -> Nothing
07:11:38      Just c -> Just (b c)
07:11:58  Since it is isomorphic to   Either () a   that is why it can be successor, if Either is addition, if you have a type of bijective functions:   Either () a <-> Maybe a     { Left () -> Nothing; Right x -> Just x; }   if you had a <-> type then you could *prove* it to be isomorphic.
07:12:08  Sgeo: that's basically what intuitionistic type theory is.  (don't forget Void)
07:12:53  oerjan: It is:   f = flip fmap
07:14:04   Why have anything other than Either, (,), and ()? <-- the others are defined using @djinn's definition mechanism
07:14:10  @list djinn
07:14:11  djinn provides: djinn djinn-add djinn-del djinn-env djinn-names djinn-clr djinn-ver
07:14:32  @djinn Void
07:14:33  -- f cannot be realized.
07:14:36  @djinn-add Fnord a b = Fnord a (b -> a)
07:14:37  Cannot parse command
07:14:37  @djinn Blah
07:14:38  Error: Undefined type Blah
07:14:43  @djinn-add data Fnord a b = Fnord a (b -> a)
07:14:45  If you had bijective function type then the types as numbers can be: uninhabited type for zero, Maybe for successor, Either for addition, (,) for multiplication, -> for exponent, <-> with same type on both sides for factorial
07:14:49  @djinn (a -> b) -> Void
07:14:50  -- f cannot be realized.
07:14:53  Oh, come on
07:15:01  @djinn a -> Fnord a b
07:15:02  f a = Fnord a (\ _ -> a)
07:15:14  Fnord?
07:15:21  Sgeo: i just defined it :P
07:15:43  I have no idea what it means
07:15:46  @djinn-names
07:15:47  Either Left Right Maybe Nothing Just Bool False True Void Not Void Monad Eq Bool Fnord Fnord
07:16:01  @djinn Void -> Void
07:16:02  f a = a
07:16:09  there seems to be some duplication there...
07:16:12  @djinn Void -> (a -> b)
07:16:12  f = void
07:16:19  ...huh?
07:16:27  What is void?
07:16:46  It should be:    void x = case x of { }     but Haskell doesn't accept that
07:16:52  Sgeo: void :: Void -> a
07:16:56  Ah
07:17:09  yeah it may be a special case
07:17:11  So basically, a statement that if you proven void, you can prove anything
07:17:20  yeah
07:18:44  @djinn (Void -> a) -> a -> b
07:18:45  -- f cannot be realized.
07:18:55  In TNT, (exist a. x) is equivalent to (not (forall a. not x))
07:18:57  Well, that does make sense
07:19:23  @djinn (a -> Void) -> a -> b
07:19:24  f a b = void (a b)
07:19:43  @djinn-del Fnord
07:19:51  @djinn-names
07:19:52  Either Left Right Maybe Nothing Just Bool False True Void Not Void Monad Eq Bool
07:20:04  @djinn Not Void
07:20:04  f a = a
07:20:06  And if you have x{5} or x{anything} then you can make (exist a. x{a})
07:20:24  Huh?
07:20:51  Sgeo: ?
07:21:18  Is it possible to do this in Haskell?
07:21:39  zzo38: sounds pretty much like dependent typing, so no.
07:22:06  hm maybe on the type level
07:22:29  and who knows with the new type -> kind lifting that's coming up
07:22:34  To be specific, I mean of making (exist a. x{a}) from (x{5}) or whatever
07:22:47  What is type -> kind lifting?
07:24:51  How did it figure out Not Void?
07:25:29  because it's Void -> Void[D
07:25:40  How does Not work
07:25:41  ?
07:26:01  data Not a = Not (a -> Void)
07:26:06  no data
07:26:09  @djinn-env
07:26:10  data () = ()
07:26:10  data Either a b = Left a | Right b
07:26:10  data Maybe a = Nothing | Just a
07:26:10  data Bool = False | True
07:26:10  data Void
07:26:12  type Not x = x -> Void
07:26:14  class Monad m where return :: a -> m a; (>>=) :: m a -> (a -> m b) -> m b
07:26:16  class Eq a where (==) :: a -> a -> Bool
07:26:23  ah.
07:26:39  Ah, I'm starting to get an understanding of it now
07:27:05  Does Not need to be a type?
07:27:16  zzo38: http://www.reddit.com/r/haskell/comments/mm68o/ghc_74_branched_whats_in_for_christmas/c328u7i has a small example
07:27:26  well the reply to that
07:27:34  @djinn Either a (Not a)
07:27:35  -- f cannot be realized.
07:27:53 -!- Vorpal has joined.
07:27:56  How would dependent types allow you to make (exist a. x{a}) from (x{5})? GHC does have a existential types extension
07:28:42  zzo38: well it's the part of using the value 5 rather than a type to quantify over, which is problematic.
07:29:01  and which _might_ work with the new extension, i don't know
07:29:12  But I mean for any type in general, not necessarily 5
07:29:18  s/type/value/
07:29:29  well then i guess ghc can do some of it on the type level.
07:30:16  data Exists x = forall a. Exists (x a)
07:31:36  zzo38: dependent types is when you allow types to depend on values.  and ghc does not support it fully, not even with the new extension.
07:32:18  Actually, in the case I given, the 5 *will* be a type, such as (Maybe (Maybe (Maybe (Maybe (Maybe Zero)))))
07:32:40  So it won't depend on a value.
07:33:04  So, it's a bit more that you're doing type-level computation.
07:33:20  well then it should be possible.  although there may be further difficulties when you unpack it from the existential again (you cannot compare well things unpacked at different points)
07:33:43  No I mean to prove it by writing functions like how Curry-Howard is
07:41:11  I do have idea of bijective function syntax: A new built-in type "<->" which is like "->" but only bijective functions (a value of this type is allowed to be undefined but can return undefined if and only if the input is undefined), a new keyword "bijective" which introduces layout, and new built-in functions called "inverse" and "runBijective"
07:42:47  inverse :: (a <-> b) -> (b <-> a); runBijective :: (a <-> b) -> a -> b;
07:44:40  The bijective keyword would make a value having a <-> type, and inside would be something similar to a case block (but with some restrictions).
07:45:21  Would this seem to work to you?
07:45:37  i expect finding the right restrictions is the hard part here.
07:48:48  You should also allow bijective functions to be called directly without the use of runBijective (and calling bijective functions directly would be allowed in a bijective case block). I do have some ideas about the restrictions. For example, each variable used on either side must be used exactly once on each side
07:51:19  well my doubt is whether simple restrictions will allow you to write all the bijective functions you want.
07:52:32  Other restriction would be you would be disallowed to write values of recursive types
07:52:40  for example, if f is a halting but otherwise non-bijective function, then g x = x `xor` f x  is a bijective function.
07:52:56  er...
07:53:16  *for example, if f is a halting but otherwise non-bijective function, then g (x, y) = (x, y `xor` f x)  is a bijective function.
07:54:19  and there are other functions than xor which work that way... any group operation for example.
07:55:13  this is what i thought of when i was pondering reversible computing previously.
07:56:14  You might need to add additional built-in functions
07:57:56  But I don't know if that would make it complete
07:58:18  me neither
07:59:32  I also don't know how you would use it to prove that there is no such bijective function of types (such as: Not (Zero <-> Maybe Zero))
08:04:38  A proof in intuitionistic or classical logic using Curry-Howard would require all functions written to halt, and that is assumed and the logic still works. Maybe something similar can still work with bijective function type?
08:09:53  linear logic seems somewhat relevant, but not perfectly.
08:10:18  it has the "every argument must be used exactly once" property
08:11:02  but it still allows a function and an argument to combine in a nonreversible way.
08:13:43  I wonder if you could do STM-like stuff without actual repeats (using blocking instead) by using an arrow instead of a monad
08:14:32  That way, all information about what variables may be accessed is known statically, and thus the system can check for conflicting variable access
08:14:47  Before running the thread
08:15:00  hm.
08:15:09  arrows or applicatives, maybe.
08:15:29  Are arrows applicatives?
08:15:41  such prescheduling is supposed to be one of the advantages of arrow/applicative parsers.
08:15:49  Sgeo: technically yes
08:16:07  when you fix the first type argument
08:17:47  http://cdsmith.wordpress.com/2011/07/30/arrow-category-applicative-part-i/
08:20:31  I need sleep
08:20:34  (btw the answer to the title question is "not quite")
08:20:48  as you need some extras in the other direction.
08:21:25  Could you define applicative in terms of   fmap   and   liftA2 (,)   and   pure
08:22:37  zzo38: yes.  i think that was mentioned in one of the comments to that link.
08:22:48  lax strong monoid something
08:24:14  Can you add something weaker than join or >>= that can still define a monad from an applicative, because join or >>= can be defined from this new thing and the applicative things
08:25:35 -!- monqy has quit (Quit: hello).
08:26:53 -!- GreaseMonkey has quit (Quit: The Other Game).
08:27:42 -!- mtve has joined.
09:15:18 -!- derdon has joined.
09:31:40 -!- oerjan has quit (Quit: leaving).
09:50:49 -!- zzo38 has quit (Remote host closed the connection).
10:05:59  hi
10:49:03 -!- derdon has quit (Remote host closed the connection).
10:54:32 -!- ais523 has joined.
11:57:56 -!- zzo38 has joined.
12:03:22  oerjan: ah, your proof if even nicer than his.
12:03:22  oklopol: You have 2 new messages. '/msg lambdabot @messages' to read them.
12:03:24  *is
12:19:49  The phrase quod erat demonstrandum is a translation into Latin from the Greek ὅπερ ἔδει δεῖξαι (hoper edei deixai; abbreviated as ΟΕΔ). Translating from the Latin into English yields, "what was to be demonstrated";
12:19:59  that's what all the cool mathematicians say instead.
12:21:34 * Sgeo envisions representing a computable real with a list of tuples, the first number of the tuple being an approximation, and the second being the how far off the approximation is, such that the second number is equal to or larger than the error
12:21:47  Presumably, later values in the list would be better approximations
12:21:54  French people say CQFD
12:22:17  Although I'm pretty sure there's some other infinite list representation of reals somewhere
12:22:29  How do you compute how far off the approximation is from the real value without already having information about the number?
12:23:15  kallisti, the error given in the second number of the tuple may be larger than the actual distance between the approximation and the actual value
12:23:26  I'm presuming there is an actual value, just not easy to represent
12:23:43  I think it makes sense to say that pi is 3 plus or minus .15
12:23:50  For instance
12:24:47  e is kind of like 0 plus or minus infinity.
12:25:02  ..
12:25:37  Most numbers are
12:25:43  Although i isn't
12:25:55  what is a "number"?
12:25:57  If the approximations don't converge, then it doesn't represent an actual number
12:26:11  Can still do comparisons though, in some cases
12:26:59  I should write some code for this
12:29:36  Hey
12:29:38  Sgeo
12:29:43  Hi Slereah
12:29:57  Markov wrote a whole article on writing down definable numbers!
12:30:00  It was neat
12:30:05  Basically, it was like
12:30:22  (f(x) - g(x))/h(x)
12:30:29  Where fgh are recursive functions
12:33:49  Linky?
12:34:04  Although I have a feeling you're referring to a historical source
12:34:07  But still, linky?
12:34:16  Historical indeed
12:34:23  I can give you the reference
12:37:51  Марков, А. А. О конструктивных функциях
12:38:07  Or just Markov, "On Constructive Functions"
12:38:36  I should scan it
12:38:51  No doubt it's already been scanned
12:38:58  Not sure
12:39:02  And sold to universities
12:39:13  http://www.haskell.org/pipermail/haskell-cafe/2011-May/091585.html
12:39:16  I got it from a book that I bought because I could not find an article in it anywhere
12:39:21  infinity = Succ infinity
12:39:31  I find the properties of that fascinating
12:39:44  infinity > any finite natural number
12:39:47  = fix Succ
12:40:05  infinity > infinity = _|_
12:41:05  data Ordinal =
12:41:08  Hmm, might break on *
12:41:27  Since probably * is defined with Zero on one of the sides as making it = Zero
12:41:34  When the result should probably be _|_
12:41:48  > 5/0
12:41:49    Infinity
12:41:51  > 5/0 > 6/0
12:41:52    False
12:42:02  Sgeo: IEEE disagrees. :P
12:42:06  > 6/0 > 5/0
12:42:07    False
12:42:27  > 5/0 >= 6/0
12:42:28    True
12:42:31 * kallisti gasps.
12:43:16  But then you break the notion of a == b implying a-b==0
12:43:21  > 6/0 - 5/0
12:43:22    NaN
12:43:45  Oh, no! Extending a field with infinity does not produce a field!
12:43:51  Stop press
12:44:46  :t cycle
12:44:47  forall a. [a] -> [a]
12:45:50  > cycle $ cycle [1,2,3,4,5]
12:45:51    [1,2,3,4,5,1,2,3,4,5,1,2,3,4,5,1,2,3,4,5,1,2,3,4,5,1,2,3,4,5,1,2,3,4,5,1,2,...
12:45:54  Actually, I think 0ω is defined as 0.
12:46:08  > fix cycle [1,2,3,4,5]
12:46:09    Couldn't match expected type `[t1] -> t'
12:46:09          against inferred type `[a]'
12:46:17  So it works out fine, as long as you use unamb.
12:46:21  > fix (cycle.) [1,2,3,4,5]
12:46:22    *Exception: stack overflow
12:46:30 * Sgeo non-arbitrarily decides that a better representation of definable reals is as an infinite list of tuples, but the tuples are a lower and upper bound
12:46:34  Haskell needs to fix this bug. :P
12:46:44  Rather than average and distance
12:46:53  Makes it easier to define sine
12:46:56  etc.
12:47:27  That doesn't really define definability
12:48:02  Are there definable numbers that don't fit the mold? I think I'm fine with some lists that don't represent definable numbers
12:48:04  :t fix (cycle$)
12:48:05  forall a. [a]
12:48:17  > fix (cycle$)
12:48:21    mueval-core: Time limit exceeded
12:48:34  You seem to have described the set of real numbers.
12:50:01  Note: My Haskell library has no intention of making it possible to define undefinable numbers. If you manage to do this with my library, the destruction of the universe is on your hands.
12:52:55 -!- elliott has joined.
12:53:05  elliott: hi
12:53:16  bye
12:53:17  brogerr
12:53:17  elliott: You have 1 new message. '/msg lambdabot @messages' to read it.
12:53:43   ais523 said 15h 26m 2s ago: I didn't delete "why testing is good" and the other one, Keymaker did
12:53:48  ais523: should have protected it!
12:54:00  elliott: protection has no correlation with deletion at all?
12:54:01  in fact, we should just protect all the spam pages...
12:54:11  in fact, nowadays, you can typically even protect a page that doesn't exist
12:54:16  although I'm not sure if Esolang implements that
12:54:31  @tell kallisti something important.
12:54:31  You can tell yourself!
12:54:32  ais523: well, I presume people think twice before deleting a protected page
12:55:37  elliott: not if it was protected because elliott thinks that protecting spam is a good idea
12:55:50  hmm, I wonder if there's a wiki on the Internet whose only purpose is to be edited by spambots
12:55:56  ais523: yes, but you're more reliable than that! :P
12:56:03  and i hope so
12:56:03  and it's just left with registration and anonymous editing open, and left there
12:56:36  the problem is, it'd be basically impossible to find
12:56:37  18:22:35:  pikhq_, do you often visit Japan?
12:56:38  18:22:43:  Vorpal: No.
12:56:38  18:22:54:  Vorpal: In fact, I have never been.
12:56:38  18:23:01:  what do you use your Japanese knowledge for then?
12:56:38  world domination
12:56:40  as any sane search engine would sort it to the bottom
12:56:46  ais523: you could advertise it
12:56:49  with spam, even
12:56:50  elliott: Japanese is actually a vaguely useful language to know
12:56:58  then your spambots start editing your own wiki...
12:57:11  I am Wikipedia programmer Brandon Harris. AMA (self.IAmA)
12:57:17  I come across words in languages I don't understand, occasionally
12:57:24  and Japanese is one of those languages
12:57:25 * elliott just stares at that headline for a while.
12:58:50  what's stareworthy about the headline?
12:59:03  elliott: heh
12:59:35  ais523: I have trouble conceiving of Wikipedia programmer Brandon Harris as a real person, he's just that guy in the donation boxes
12:59:38  ais523: like Big Brother
13:00:02  there was no issue for me
13:00:16  in the TV series, Big Brother is a real person too
13:00:19  several, I think, who work in rotation
13:01:33  elliott: Brandon Harris, antagonist to the man.
13:02:04  for twelve years you have been asking, "who is brandon harris?"
13:02:09  this is brandon harris speaking.
13:05:12  "I also work for Wikipedia, and had a rather scary email recently: "Before you edit a banner or update some code, just remember that if our readership was a country it would be the 3rd largest country in the world.""
13:06:29  `log brandon harris
13:07:03  2011-11-28.txt:13:02:04:  for twelve years you have been asking, "who is brandon harris?"
13:07:17  `pastelog brandon harris
13:07:28  http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/paste/paste.24786
13:07:54  2011-10-05.txt:19:38:28:  "A personal appeal from Wikipedia programmer Brandon Harris."
13:08:41  ais523: haha, wikipedia had to take down the fundraising statistics page because of the traffic from reddit
13:08:59  that sort of thing actually happens occasionally
13:09:20  elliott: I feel like reddit is like this hivemind of horrible internet trend stuff.
13:09:31  it is
13:09:36  when you get up to Admin level, you have to be careful to avoid Wikipedia slashdotting itself
13:09:52  ais523: but how.............
13:09:57  you need to know which bits can handle heavy traffic and which bits can't
13:10:23  (hint: you don't want to hit the toolserver on every page read, or even every edit (more than it's currently hit, that is))
13:10:37  ais523: hmm, is there only /one/ toolserver?
13:10:39  likewise, you can hit the API on every read, but not really perform more than a few queries
13:10:43  elliott: yes
13:10:51  ais523: "The Wikimedia Toolserver is a collaborative platform providing Unix hosting for various software tools written and used by Wikimedia editors. The service is operated by Wikimedia Deutschland e.V. with assistance from the Wikimedia Foundation.
13:10:51  It consists of thirteen servers as outlined here."
13:10:59  hmm, it looks like one
13:11:01  no it's not, I found the answer before you gave me an incorrect one :P
13:11:02  to users
13:11:12  ais523: so does wikipedia itself :P
13:11:20  so does Facebook. (I think)
13:11:27  (so does everything)
13:11:30  FWIW, there's only one physical server that handles write changes
13:11:34  as in, things that handle the database
13:11:38  the vast majority of them are for reads
13:11:40  https://wiki.toolserver.org/w/images/b/b5/Toolserver-cluster.svg
13:11:51  which makes sense, given Wikipedia's load patterns
13:12:10  ais523: I can't help but feel that Wikipedia could do a lot better than it could if it wasn't tied to its software
13:12:17  (I think they can trivially hot-swap /which/ server handles the writes, though, for redundancy)
13:12:37  yep, MediaWiki is painful
13:12:39  internally
13:12:52  it's excellent in terms of its user-facing behaviour, but behind the scenes it's a mess
13:13:06  there's no need to have a linear history at all, for one thing
13:13:28  "see page as of time X" is a useful operation
13:13:38  ais523: yep, but that's not the same thing
13:13:41  although nonlinear histories can be linearised for that purpose
13:13:55  ais523: I mean, you could easily allow edits to be done on N servers instead of 1
13:13:59  elliott: how do you stalk people with differing viewpoints from your own so you can call them out as deletionists or pushing a POV?
13:14:00  and just merge it afterwards
13:14:09  ais523: although you have to block the confirmation page until the merge happens
13:14:13  so you can notify of conflicts
13:14:27  elliott: well I guess no linear history wouldn't affect the user changes log.
13:14:29  kallisti: with binoculars
13:15:14  I don't think Wikipedia's designed to take Linus' Law into account, either
13:15:22  (note: not actually joking. people do that.)
13:15:26  hmm… MediaWiki's storage model is essentially what git's designed for
13:15:46  kallisti: I've been known to stalk suspected trolls/spammers/vandals before now in order to make sure
13:16:10  and yet it ignores most of the optimisations git's made to handle that
13:16:22  ais523: yes, MediaWiki suffers from being developed before common RCSes
13:16:28  DVCSes, rather
13:16:37  (RCS wouldn't work very well :P)
13:16:38  does SVN use reverse diffs for storage?
13:16:46  dunno anything about SVN's storage
13:17:32 * ais523 frowns at the TDWTF discussion of the twelve weights problem
13:17:43  ais523: mediawiki is only 2 years older than svn, anyway
13:17:52  because it's actually solvable with 13 (at least if you only care about knowing the odd one out, not lighter/heavier), and everyone's missed it so far
13:17:54  sorry, more like one year
13:18:02  so it wasn't really an option at the time, I wouldn't think
13:18:08  elliott: wow, it's hard for me to envisage something revision-control-like being older than SVN
13:18:11  apart from CVS and RCS
13:18:31  ais523: open-source VCS is novel field, really
13:18:38  it only got started around 2001
13:18:45  I mean, anything other than CVS
13:19:34  before VCS closed source developers collaborated via email attachments.
13:19:40  (ha ha ha.  but probably true)
13:19:49  ais523: list of VCSes older than SVN:
13:20:10  SCCS (1972) RCS (1982)
13:20:10  PVCS (1985)
13:20:10  CVS (1990) CVSNT (1998)
13:20:12  Software Change Manager (1970s) ClearCase (1992) CMVC (1994) Visual SourceSafe (1994) Perforce (1995) StarTeam (1995)
13:20:16  TeamWare (1990s?) Code Co-op (1997) BitKeeper (1998)
13:20:21  elliott: you can't cure my prejudices with facts!
13:20:41  ais523: no, but I can cause you severe cognitive dissonance! MWAHAHAHAHA
13:21:02 * kallisti 's cognitive dissonance sounds awesome.
13:22:03  gah, my IRC client prints elliott's and kallisti's name in the same color, and I keep reading kallisti's lines as being from elliott and having to do a double-take
13:22:06  even reading the article on cognitive dissonance fills me with anxiety about cognitive dissonance.
13:22:19  also, that line of mine, I typed "color" then spend around 4 seconds wondering whether "colour" would be a better spelling
13:22:20  ais523: this is because we are almost the same person.
13:22:32  ais523: turn off nick colouring, then you just mix people up because of similar names
13:23:40 -!- MSleep has changed nick to MDude.
13:24:01  dude what if we had hair on our palms?
13:24:05  handshakes would be so much weirder.
13:33:33 * ais523 is not entirely convinced that kallisti is not a spambot
13:33:36  just mostly convinced
13:34:08  fungot, can you do handshakes?
13:34:08  Jafet: " who says?" screamed glod. " he was no longer an option. he could hear the sounds of argument coming from the fnord fnord.
13:34:29  ais523: The word douche came to English via French – where today it means shower (from Italian: doccia "conduit pipe" and docciare "pour by drops"). It is thus a notorious false friend encountered by non-native speakers of English.
13:34:53  kallisti: the funny thing is, I actually know its French meaning rather better than its English one
13:39:53  I bet that fizzie is here.
13:41:08  I bet elliott is here.
13:41:15  Wrong!
13:41:17 * kallisti better gambler.
13:43:15  I think elliott would get better odds on his/her bet
13:43:45  I would indeed get better odds on his/her bet.
13:44:40  watg
13:47:16  but my odds are 1 in 1..
13:47:27  THAT'S ALL THE ODDS
14:01:48  bah, @ has made me unable to be interested in low-level OS news
14:02:29  elliott: oh my god I decided to visit reddit on my own free will what have I done
14:02:39  there's a random button.
14:03:04  there is?
14:03:12  yes you hit random and it /goes to random thingies/
14:03:14  oh, random subreddit.
14:03:17  boards? uh...
14:03:18  who the hell looks at the top bar
14:03:20  subreddits.
14:03:28  http://www.reddit.com/r/RATS/ rats
14:05:29  http://www.reddit.com/r/somethingimade/
14:06:52  elliott: show off awesome perl scripts here.
14:06:55  http://www.reddit.com/r/nostalgia/
14:07:01  elliott: reflect on painful childhood memories.
14:07:05  such as writing perl scripts.
14:08:57   FWIW, there's only one physical server that handles write changes  as in, things that handle the database <-- very doubtful that mediawiki wouldn't use a distrubuted database server. Doesn't even mysql support that nowdays? I know postgre supports it well for example.
14:09:11  http://www.reddit.com/r/frugalmalefashion/
14:09:12  wtf
14:09:44  http://www.reddit.com/r/actuallesbians/
14:09:47  oh my god it never ends.
14:10:15  http://www.reddit.com/r/Psychonaut/
14:10:17  I found home.
14:10:23  In the "X is a monad" series:
14:10:34  where's /r/fakelesbians
14:10:36  A certain way of writing BF programs is a monad (I think)
14:10:53  Sgeo: what
14:11:08 * itidus21 laughs
14:11:15  Vorpal: maybe ais523 means "one hostname" like he did with the toolservers:P
14:11:16  State representing locations of variables
14:11:52  Run the monad, which must return something of a certain type, and you get a BF program
14:11:54  elliott: ah help kallisti is always taken how do I make usernames?
14:11:55  Anyways, bye
14:12:21  kallisti: kakeprophet
14:12:28  noooo
14:12:32  cakeprophet is better
14:12:40  I need
14:12:42  ORIGINAL THOUGHT
14:12:43  kallisti: if you do sign up to reddit, i suggest the first thing you do is to unsubscribe from all default subreddits
14:12:46  THAT IS NOT LAME.
14:12:50  elliott: obviously
14:12:55  at least /r/{pics,funny,politics}
14:12:59  oh /r/WTF too
14:13:09  politics might be good
14:13:14  kallisti: /r/politics is actually US politics (is actually US politics circlejerk)
14:13:17  but maybe there are better news sources.
14:13:23  elliott: that's fine I like that .
14:13:29  no you really don't
14:13:33  oh. okay.
14:13:38  elliott, anyway you still need to propagate writes in a consistent order, even with a distrubuted db. At least if you want a consistent history for edits like mediawiki does
14:14:33  hm an obvious solution to load balancing here would be to hash the article identifier and use that to select which database server to use. Don't even need distributed databases for it
14:14:36  Vorpal: only a few things need consistent ordering in MW
14:14:37  Also /r/{atheism,gaming} and maybe /r/{IAmA,todayilearned} and /r/AskReddit
14:14:49  /r/atheism isn't default these days
14:14:51  Nor is gaming
14:15:02  atheism? default? whut.
14:15:03 * elliott checks the default list
14:15:04  They appeared to be, I just logged out to check
14:15:11  Oh, gaming and atheism are
14:15:51  elliott: it's like they want /r/atheism to be full of controversy
14:15:53  kallisti: OK, here's an unsubscribe list: /r/{pics,funny,atheism,politics,WTF,AskReddit,AdviceAnimals} and most likely /r/{gaming,todayilearned}
14:15:54  by putting everyone in it.
14:16:21  You definitely want out of /r/gaming, there are better replacements
14:16:29  Deewiant: Yeah, I'm not subscribed so I didn't feel qualified to say
14:16:29  such as?
14:16:39  kallisti: No, it's not full of controversy at all, /r/atheism is actually the internet's largest circlejerk
14:16:51  /r/{Games,gamernews,truegaming}
14:17:02  truegaming sounds good maybe?
14:17:04  Depending on what you want, you can pick (I'm subbed to all three)
14:17:08  or maybe it's falsegaming acting like truegaming
14:17:08  truegaming is only for discussions
14:17:08  kallisti: Okay, what Deewiant said, except don't subscribe to anything starting with "true"
14:17:18  but true sounds all elitist.
14:17:19 -!- Madoka-Kaname has quit (Remote host closed the connection).
14:17:21 * kallisti elite
14:17:27  Of true* I'm only in TrueReddit and truegaming
14:17:32  I find they have interesting content
14:17:40 -!- Madoka-Kaname has joined.
14:17:49  Deewiant: Maybe, I just can't stand the implicit elitism :P
14:17:58  http://www.reddit.com/r/TrueTrueReddit
14:17:59  so my brother has skyrim.. watching him play it makes my life feel painfully inadequate.
14:18:01  I'm in it for the links, not the comments :-P
14:18:02  This is actually a real non-joke subreddit.
14:18:10  http://www.reddit.com/r/content/   omg so much content
14:18:11  "As TrueReddit grows, it will become less like TrueReddit. See "Hot Tubbing an Online Community" for thoughts as to why. By virtue of the fact that it is smaller, and will not yet make /r/all, TrueTrueReddit is better equipped to adhere to its own standards."
14:18:12  Oh, it's non-joke these days
14:18:12  itidus21, why don't play it yourself too?
14:18:15  TrueTrueReddit used to be a joke
14:18:20  TruestReddit
14:18:32  Vorpal: do you want the real answer?
14:18:35  itidus21: I don't understand the hype around Skyrim actually.
14:18:38  though it is a good game.
14:18:41  itidus21, why do you ask?
14:18:56  kallisti: it looks like so much freaking fun thouhg
14:18:58  kallisti: Oh, and don't subscribe to /r/programming, though it isn't default
14:18:59  kallisti, not a good game. A fun game sure, but too buggy to be a good game
14:19:05  elliott: well, duh.
14:19:13  elliott: that would be like going to the programming board on 4chan.
14:19:16  /r/AskReddit can be moderately interesting for some things but I think it's best to just take a quick look at the topics once a week or so than have it on your frontpage all the time
14:19:19  kallisti: /r/coding is... "okay", but /r/haskell is the only decent programming subreddit I know of
14:19:22  At least, that I care about
14:19:28  kallisti, somehow after I saved a game I got a non-random quest a second time.
14:19:31  Actually it's one of the only reasons I use reddit still :P
14:19:32  elliott: I am an expert at internetz brah, I've got this.
14:19:33  that annoyed me
14:19:34  elliott: You know that /r/programming is better these days, right?
14:19:47  Deewiant: I read it every day; it really isn't
14:19:52  I think it is
14:19:57  Vorpal: certainly less buggy than previous Bethesda games
14:20:08  Deewiant: OK, the links are usually interesting, but then I check the comments and everything goes downhill
14:20:12  Vorpal: or well, many many many games that people have flooded money into.
14:20:14  Deewiant: Especially if it involves Haskell :)
14:20:25  elliott: The solution to this for you is: don't check the comments
14:20:31  kallisti, well maybe on release. I didn't play oblivion until some fairly late patch
14:20:34  elliott: (For others, it's also "don't care about the comments" but I doubt that works for you)
14:20:34  Deewiant: I can't stop myself
14:20:41  Vorpal: perpetuating a vile industry that encourages rapid deadlines and not good finished products.
14:20:53  VILE
14:20:55  VILE I SAY
14:20:58  heh
14:21:00  yes, evil
14:21:03  like vile
14:21:06  what is deadlines about?
14:21:06  elliott: I wonder if RES or something allows for removing the comment links :-P
14:21:07  but with shit switched around.
14:21:16  Deewiant: I tried RES once and I just got annoyed at all the visual noise :P
14:21:29  elliott: Just configure it, you can remove everything you don't want
14:21:36  Yeah I know, I just also don't have any use for it
14:21:43  i mean, if deadlines are such a problem why are they so important
14:21:54  I use it mostly for its "hide child comments" feature
14:21:56  http://www.reddit.com/r/shrooms/  I am disappointed at the lack of quality post things.
14:22:04  itidus21: What's the real answer, since Vorpal is too boring to ask
14:22:07  kallisti, anyway, I seen quite a few stable games on their release. None of them were open world sandbox games though.
14:22:28  elliott: as with most things it is best understood in a functional sense
14:22:34  /r/starcraft  yesssss
14:22:34  :)
14:22:45  /r/starcraft is kind of shitty as well
14:22:47  I think they have an IRC channel as well?
14:23:09  As an anthropologist studying the primitive /r/starcraft natives, I can confirm that it's shitty
14:23:12  It's more about the people than the game
14:23:17  Also they're weird
14:23:24  elliott: but maybe it has like... starcraft games?
14:23:25  and stuff?
14:23:35  elliott: so.. the core explanation is i don't have either 1) the game 2) a PC which could play the game.
14:23:44  itidus21: Riveting
14:23:49  elliott: I bet they use a lot of jargon you don't understand.
14:24:00  For me /r/starcraft is like /r/AskReddit, I check it on occasion but don't subscribe to it or read it actively
14:24:01  but it gets more complex
14:24:06  elliott, my only experience of starcraft is watching a few minutes of a commentated match. It was mostly incomprehensible jargon.
14:24:26  Vorpal: the jargon is actually not that dense.
14:24:28  Surprise: thing you know nothing about is incomprehensible
14:24:36  Deewiant: I don't know why you'd check /r/AskReddit ever, anything actually decent filters through to /r/bestof or whatever (which is admittedly kinda awful itself), and the rest is really awfully inane stuff
14:24:43  I don't read /r/bestof
14:24:45  kallisti, just as dense as for dota/lol/hon.
14:24:46  FoxTrot creator Bill Amend is thinking about doing StarCraft 2 commentaries. Let's encourage him! (twitter.com)
14:24:46  What.
14:24:52  which is also mostly incomprehensible
14:24:52  Deewiant: /r/bestof is default these days :P
14:24:58  Deewiant: http://blog.reddit.com/2011/10/saying-goodbye-to-old-friend-and.html has the current list
14:25:04  elliott: I unsubscribed from it long before it was default :-P
14:25:05  elliott: 6pool, 3rax, 3gate, 1-1-1, etc
14:25:13  1) i don't have a job.  2) i don't have any money 3) i don't have any income. 4) whatever money i got in the last year from gifts such as xmas or birthday or other ended up going to my mom
14:25:15  kallisti: Nope, haven't seen anything like that
14:25:24  kallisti: I think you're expecting too much of them, it seems to mostly be celebrity worship crap
14:25:28  4b) she ended up wasting most of this buying me soft drink and junkfood
14:25:28  ..oh
14:25:30  dumb.
14:25:37  I was expecting like... people who play starcraft
14:25:39  and know things about it.
14:26:41  1) my brother has an explosive anger problem 2) my brother is greedy and selfish for some reason 3) due to (1) and (2) whenever i might acquire anything my brother wants he will just take it rather than waste energy getting his own copy of said thing
14:27:14  when i was about 10, i learned that in my house if i wanted to make a glass of cordial i basically had to pour one for everyone
14:27:18  itidus21, you forgot 2i) There are other ways to get hold of games if you want to.
14:27:20  elliott: As for /r/AskReddit, there's a good question once in a while plus I find reading about amusing real-world stories a significant improvement to e.g. /r/{funny,pics,videos}; it works with RES's "hide all child comments" well, too, so you can only read the top-level replies
14:27:27  itidus21: http://www.reddit.com/r/drugs/
14:27:51  im trying to express i guess how futile my life is..
14:28:01  http://i.imgur.com/MvQ9G.jpg
14:28:03  itidus21, unless you use a console rather than a PC for gaming, in which case why on earth?
14:28:05  I'm trying to figure out
14:28:10  what this picture is trying to express
14:28:15  an unrelated problem altogether.
14:28:32  itidus21: this is perhaps the most elaborate learned helplessness ever conveyed over irc
14:28:51  itidus21, just use torrents? *shrug*
14:28:53  Deewiant: "hide all child comments" sounds nice in theory but makes me miss out on e.g. when a high voted comment has an even higher-voted reply proving it's bullshit :P
14:29:08  Vorpal: my pc isn't near good enough to run it
14:29:09  elliott: You can always manually check the replies
14:29:22  well i am not sure how good my pc is though but yeah
14:29:22  elliott: we're all in a state of learned helplessness man.
14:29:23  elliott: (There's a "show child comments" button after hiding)
14:29:34  elliott: what are you gonna do about pollution, dawg?
14:29:36  nothin'
14:29:36  not shit.
14:29:39  elliott: And that's what I usually do when I come across something that might need proving :-P
14:29:48  elliott: But it hides pun threads and such effectively.
14:29:55  Deewiant: Maan, I don't read reddit to think
14:30:02  But yeah, anything that gets rid of pun threads is tempting :P
14:30:15  itidus21, well then I guess you are stuck. Gaming when there are ranged weapons (bows and spells here) on consoles is generally horrible anyway due to lack of any sort of precision in aiming without a mouse.
14:30:17  wow a lot of pill-poppers on /r/drugs
14:30:20  lame.
14:30:58  uh oh, Vorpal is one of those "I can't aim with a thumbstick" people.
14:31:08  Vorpal: im just saying i feel how deprived i am when watching my brother play skyrim on a pc
14:31:19  kallisti, I consider "auto aim" to be cheating. I know a lot of shooters on consoles use them.
14:31:25  But that shouldn't be needed
14:31:27  Vorpal: that's not what I'm talking about.
14:31:29  it's not needed
14:31:40  you can do this neat thing where you turn up the sensitivity on the aiming
14:31:42  and ... i feel how fucked my life is on every level..
14:31:46  kallisti, it takes much more time to aim with a thumbstick than with a mouse
14:31:53  and it gives you like, control over where you aim things based on how far you tilt the thumbstick
14:31:56  it's pretty neat.
14:32:18  Vorpal: s/$/ for me/
14:32:22  Vorpal: s/$/ because i'm bad at it/
14:32:25  i keep myself happy by lying to myself
14:32:28  sweet lies
14:32:41  kallisti, still inferior to a mouse.
14:33:04  kallisti, anyway another problem: current consoles are way behind PCs when it comes to graphical fidelity.
14:33:19  ~graphical fidelity~
14:33:24  lol
14:33:31  graphical quality then. Whatever you call it
14:33:45  elliott: i have learned that a nation has a similar problem when it feels its borders are too small.. and it has to ask all its neighbors to compromise
14:34:05  like suppose italy wanted to expand itself.. then all of europe might have to shift their borders
14:34:57  i have also learned that revolution tends to lead to a lot of deaths, and that border-renegotiations tends to lead to war
14:35:30  kallisti, just compare a high end PC with the current PS3 or xbox 360 (wii is even further behind it seems). Assuming they all render to the same resolution, which system will be able to provide the best graphics? The PC.
14:35:32  and i know that, inspite all this a majority of the population of the world are screwed
14:36:26  Vorpal: nobody actually gives a shit though because nobody derives fun from standing in front of a texture and admiring how high-resolution it is.
14:36:30  its like helplessness might be part of the system.. like... why are creatuers with learned helplessness surviving natural selection
14:36:43  Vorpal: and consoles are attached to televisions which you sit further away from to play and therefore notice finer details less.
14:37:23  elliott, the second point is true yes.
14:37:25  itidus21: because we don't actually have to fight for our lives/
14:37:31  itidus21: we've won the game.
14:37:35  collectively
14:37:40  yay
14:37:45  in... this country anyway
14:37:50  and many others.
14:37:50  I prefer games to cover a larger part of my field of view though.
14:38:56  elliott, but you yourself complained about the texture quality in skyrim screenshots. So you obviously do think it matter to some degree.
14:39:01  matters*
14:40:12  one of the cool things about it is so much voice acting in it.. and so much stuff in it.. and the conversation trees (seem a bit contrived at times, but oh well)
14:40:58  its not hte game itself i guess, but realizing that i'm not at that level of society that can play a modern pc game
14:41:00  elliott: oh snaaaapp
14:41:05  its not like owning a car
14:41:14  its merely a pc..
14:41:18  but..
14:41:20  >_>
14:41:34  its more than i can fit into my life
14:41:38  dude who needs a car.
14:41:39  just like
14:41:45  order groceries online, do freelance work.
14:42:14  take the bus
14:42:16  or train
14:42:21  Vorpal: ha
14:42:22  clearly if i cannot buy myself a new pc ... a car is not in wildest dreams (even though diabetes is main reason i shouldn't drive.. and problems i suspect in my vestibular system)
14:42:32  kallisti, well if you are in US you are screwed
14:42:48  and.. you can rule out a girlfriend
14:42:55  hm?
14:43:01  but thats kind of implied by the whole geek thing :P
14:43:15  not really.
14:43:54  maybe you're just caring about the wrong things, and letting completely irrational beliefs hold you back. hmmmm?
14:44:28  at this rate, before i die i will face a living hell on earth
14:44:43  as the problems i am describing escalate and close in on me
14:44:48  anyway there are compsci students that are female. Far fewer than half of the students, but they do exist at the university I'm studying at least.
14:45:05  Vorpal: yes I even saw one in one of my classes!
14:45:06  of course
14:45:21  i never planned for the possibility my brother would turn on me
14:45:32  kallisti, I think it is something like two out of 18 in one of the current courses I'm taking.
14:45:43  courses I'm currently taking*
14:45:49  she was even attractive! but, that's no place to pick up women, since... everyone is basically fawning her.
14:46:08  and she was probably like married or something
14:46:26  heh
14:46:52 -!- ais523_ has joined.
14:46:57 -!- nooga has joined.
14:47:10  kallisti, not so much of that here. I usually hang around with a group of around 5 people for stuff like lunch and so on, one of them is in that group. Just plain friends.
14:47:28  so, question I'm asking my students in this marking session: they have to write (in Java) a recursive method that sums a linked list
14:47:32  hi ais523_, run away
14:47:44  and I'm asking them what would happen if they removed the base case
14:47:52  the answers are interesting, sometims
14:47:52  ais523_, speaking of which, does java optimise tail recursion?
14:47:53  *sometimes
14:48:04  Vorpal: I don't know; I think it's allowed to, but generally doesn't in debug mode
14:48:08  but I'm not sure
14:48:09  ah
14:48:42  ais523_, so what sort of interesting answers were there?
14:48:43  linked list, in java, what for? how?
14:48:53  nooga: same way you define a linked list in C
14:48:58  nooga, it is trivial to do with classes?
14:49:11  nooga, since everything but the primitive types are by reference
14:49:22  at least as far as I know
14:49:22  or, fwiw, java.util.LinkedList
14:49:52  but there are no pointers in java
14:49:58  yes there are
14:50:00  everything's a pointer
14:50:04  no need to roll your own when perfectly reasonable doubly-linked lists exist
14:50:11  nooga: Java has references, which are a special case of pointers
14:50:19  nooga, everything except primitive types are references.
14:50:24  (or to look at it another way, pointers are a common way to implement references)
14:50:28  and references are enough for a linked list
14:50:34  oh, okay
14:51:13  I come from a world of pointers
14:51:18  ais523_, so what sort of interesting answers were there?
14:51:23  Vorpal: well, the students who are trying to answer everything by rote assume they'd get a stack overflow, because that's always what happens when you remove the base case of a recursion, right?
14:51:34  so I ask them what'd happen when the end of the list is reached
14:51:35  ais523_, heh
14:51:37  nooga: ruby - world of pointers
14:51:41  funniest answer so far is that it goes back to the start of the list
14:51:57  Yes, java.util.LinkedList, the linked list that lacks an easy of way of retrieving the tail
14:51:57  ais523_, non-ciruclar list I take it?
14:52:01  circular*
14:52:08  Vorpal: singly linked
14:52:19  it's handrolled, and does have an accessor for the tail
14:52:20  ais523_, you can have a singly linked circular list!
14:52:27  but sure
14:52:34  elliott: well, ruby is not my main language ;p
14:52:46  also, it doesn't have a constructor or setter method that would allow creating a circular one without bypassing the security model somehow
14:52:55  Deewiant: Seriously?
14:53:01 * kallisti hasn't figured out his "main language"
14:53:06  I don't think I have one of those.
14:53:13  elliott: seriously; you can mutate it into its tail
14:53:15  ais523_, how can someone fail a simple question like that, I don't get it.
14:53:20  elliott: It's the reason I rolled my own at one time
14:53:23  but not get a reference to the tail without changing it
14:53:38  Oh, right, it's "linked list: the arraylist interface"
14:53:46  AKA the least useful structure, ever
14:53:55  wait
14:53:56  You can do subList(1, list.size()) but that probably copies n-1 elements
14:54:00  btw, about tail-calls in Java, I just looked it up; the JVM doesn't do it because it needs to maintain the stack trace as expected
14:54:13  ais523_, ouch
14:54:15  You can do tail calls with stack traces trivially
14:54:17  but individual JVM languages can optimise tail-recursion (i.e. self-tail-calls) into loops if they want
14:54:20  But that's GvR's excuse too
14:54:29  I thought you don't give a shit about Java and now, suddenly, everybody is talking about Java
14:54:32  how come
14:54:37  because ais523_ brought java up
14:54:40  because ais523_ teaches java
14:54:42  ais523_, is javac able to do that?
14:54:43  "Trivially" is a bit much; simply, maybe :-P
14:54:45  you can get the names of functions trivially
14:54:48  because we talk about the things ais523_ talks about
14:54:50  elliott: you can't inspect the values of params back along the stack, though
14:55:08  ais523_: excuse me, but... begone!
14:55:09  elliott: because I'm marking Java right now, except it's a two-week exercise and the student in this slot did it all last week
14:55:09  :]
14:55:09  ais523_: Sure you can, it just means you leak memory
14:55:12  to get the week off this week
14:55:20  Admittedly, that's almost the same as not optimising tail calls
14:55:22  elliott: wait, is that even a tail-call any more?
14:55:33  the obvious place to store it is the call stack
14:55:41  Store it somewhere bigger
14:55:47  I suppose it'd be a tail-jump; when you actually hit the return of the tail-calls, just pop all the stack elements at once
14:55:57  so you get a speed improvement if not a space improvement
14:56:06 * elliott thinks the tail call argument is rubbish anyway
14:56:09 * ais523_ realises with horror that this is actually a standard idiom in INTERCAL
14:56:12  people just make it up when trying to think of excuses not to implement it
14:56:18  the jvm should have a flag to loop tail recursion and not give a damn about stack data :/
14:56:33  tail-jumping, that is
14:56:35  I have never heard of anyone failing to debug a Scheme program because they tail-recursed and the stack trace didn't have all the frames
14:57:15  elliott: the typical API to a Prolog debugger (which seems standard among multiple implementations, strangely) tends to have two different operation modes, one which tail-recurses and one which doesn't
14:57:24  I'm not sure if it extends to tail-calls generally
14:57:29  prolog is weird though
14:57:43  also anyone who does tail recursion optimisation as opposed to tail call optimisation
14:57:46  is not my friend, advanced warning
14:58:02  when not debugging, it optimises out the tail-recursions just fine (again, not sure about general tail calls); in the debugger, I imagine being able to see them helps sometimes
14:58:17  meanwhile, Perl has specific syntax for doing a tail-call, and probably doesn't do them if you don't use it
14:58:20  anyway you could just do the optimisation at compile-to-bytecode time. So there is really no obvious reason to not have it there rather than in the jvm
14:58:25  which is an interesting middle ground
14:58:28  unless you can JIT better doing it in the JVM I guess.
14:58:29  didnt prolog come before haskell?
14:58:33  Vorpal: I think the JVM has a concept of methods
14:58:42  quintopia: I'm not sure, they're both earlier-than-you'd-think
14:58:46  and I'm not sure which is more earlier
14:58:47  ah
14:59:38  ais523_, probably. Still there is no obvious reason to not optimise tail calls already in the compiler if the end result (the machine code produced by the JIT) ends up equally good to doing the whole thing in the JIT would have.
14:59:43  gah the grammar of that.
15:00:00  hm
15:00:12  http://blogs.oracle.com/jrose/entry/tail_calls_in_the_vm
15:00:12  prolog predates haskell by over two decades :O
15:00:16  never really thought about TCO before
15:00:23  (proposal to add tail-calls to Java bytecode in a backwards-compatible way)
15:00:48 -!- elliott_ has joined.
15:01:04   didnt prolog come before haskell?
15:01:11  prolog 1972
15:01:24  haskell 1987-1990
15:01:31  wow, Prolog's as old as INTERCAL
15:01:35 * elliott_ doesn't think haskell is "earlier than you'd think", personally
15:01:46  < quintopia> prolog predates haskell by over two decades :O
15:01:49 * elliott_ is surprised that Prolog is that old though
15:01:55  I would have guessed... 1983?
15:02:20  ISO Prolog is 1995, though.
15:02:49  i suspect the syntax that haskell and prolog have in common was extant before 1995
15:02:52  in prolog
15:03:05  that's
15:03:09  not much syntax at all
15:03:14  in fact, I'm having a hard time of thinking of a single piece
15:03:22  well, not exact syntax
15:03:58  but the idea of multiple alternate subcases of a fact/function being built into a syntactical structure
15:04:13 -!- elliott has quit (Ping timeout: 245 seconds).
15:04:25  huh?
15:04:48  its not something languages had before prolog that i can tell
15:05:09  do you just mean writing pattern-matching like
15:05:13  f ... = ...
15:05:14  f ... = ...
15:05:16  rather than like
15:05:18  f x = case x of ...
15:05:27  and not being able to define multiple top-level clauses for "f"?
15:05:35  yeah i guess
15:05:47  otherwise i dunno what you mean
15:05:56  of the idea of patternmatching defs in general
15:06:26  anyways shower time. i'm already running way late.
15:07:19  for shower?
15:08:32 -!- ais523_ has quit (Ping timeout: 265 seconds).
15:13:34 -!- ais523_ has joined.
15:13:54  back
15:14:12  and that was a weird pingout, pinging out from the webclient while on a desktop computer with a wired connection
15:15:05  the way patternmatching defs work in Prolog is entirely different from the way they work in Haskell, though
15:15:14  as in, they do the same thing, but for entirely different reasons
15:16:05  hmm, is it possible to create a reversible language where only the program /state/ needs to be known to compute the previous one, not the state _and_ the program?
15:16:12  I realise that's a kind of vague concept
15:16:23  reversible CAs do that, except they embed the program into the state already, kind of :P
15:18:25 -!- zzo38 has quit (Remote host closed the connection).
15:23:18  ais523_: oh, my name is johny, what the F**K? seems to be forming properly in my head
15:23:29  by which I mean, I'm coming up with a language and it seems good enough to give it the name
15:27:47  yay
15:27:53  capital J on Johny, right?
15:27:55 -!- copumpkin has joined.
15:28:06  ais523_: probably
15:28:16  I can check, if necessary
15:28:41 -!- ais523_ has quit (Quit: Page closed).
15:30:31  the ** in the name of that language, I mentally pronounce as somewhere between öö and üü
15:30:35  but a bit shorter
15:33:48  hmm, the problem with having reversibility based on state alone is that no two different programs can produce the same state
15:34:03  seems like I'm edging close to Rice's theorem if I'm not careful
15:38:39  which one is Rice's theorem?
15:39:04  http://en.wikipedia.org/wiki/Rice's_theorem
15:39:16  in this context, the problem is basically that you can't compute equality for functions
15:40:17  oh right, that one
15:41:53  incidentally, a few days ago, there was a Haskell fan flaming OCaml for accepting = on functions (and throwing an exception if you tried to use it)
15:42:03  also, for defining < and > on absolutely everything that has an =, even if it's arbitrary
15:42:15  (that is, they're consistent with =, but otherwise arbitrary, in some cases)
15:44:39  ais523: where? (and I agree)
15:44:47  although, that  thing is a bit hypocritical
15:44:55  Haskell has arbitrary Ord instances too
15:45:04  beacuse our structures like to use them
15:45:09  elliott_: in real life
15:45:38  in real life my structures are giant monsters that eat me.
15:45:41  one advantage of working in a CS department is that you have a nontrivial chance of encountering a Haskell fan
15:45:59  elliott_: remember the Bjorn stories? kallisti reminds me of that, just less extreme
15:46:10  lol
15:46:23  what are those?
15:46:41  `log Bjorn
15:46:47  2011-09-13.txt:18:09:15:  `log Bjorn
15:46:52  that wasn't useful…
15:46:54  `log Bjorn
15:47:04  2010-07-24.txt:03:54:13:  The merchant tottered away uneasily, and decided to get a job that involved fewer crazy people. Say, telemarketing. Bjorn voyaged on through the dark for maybe three meters before giving up and resting for the night.
15:47:07  past elliott: stop being curious
15:47:14  there we go, it's that sort of thing
15:47:26  `log Bjorn
15:47:31  2011-09-13.txt:18:07:47:  oh, I forgot all about the Bjorn thing
15:47:35  `log Bjorn
15:47:41  2010-07-24.txt:03:52:04:  As Bjorn woke the next morning, he was, much to his chagrin, reminded of his exploits-to-be by his least favourite region of the brain, which was whatever part stored memories; Bjorn wasn't really sure how the brain operated, apart from that he wished it wouldn't do so in such an efficient and unforgetting manner. So he trundled off again to the pub, and finally got up the energy,
15:47:51  that alise was a weird person
15:47:54 -!- copumpkin has quit (Remote host closed the connection).
15:48:18 -!- copumpkin has joined.
15:49:03  alise was better at Bjorn stories than the rest of us
15:49:24  Sgeo: updersation between itidus21, Vorpal, and kallisdeet
15:49:30  Bjorn, sadly, was better at Bjorn stories than himself, but he wished it was worse
15:49:35  (continuing with the fractal theme)
15:50:07  ais523: hmm, I think I know how to implement addition in My name is Johny, what the F**K? branch 2, but I'm not sure about multiplication
15:50:20  that's always a good sign
15:50:45  ais523: but if what I have is a correct implementation of multiplication, I fear that the language may be fairly boring
15:51:06  is it obvious?
15:51:17  if it's correct but non-obvious given esolang knowledge, you've probably found something new
15:51:24  is what obvious?
15:51:29  the multiplication impl
15:52:30  ais523: I think so
15:52:37  hmm, ah, I think I know what I need
15:52:50  unfortunately, I'm not sure how to make it /mandatory/
15:52:56  if it's not, you can write programs easily but boringly
15:55:05 -!- Phantom_Hoover has joined.
15:55:23  ais523:
15:55:23  fact(Z)    = (S(Z), Z);
15:55:23  fact(S(n)) =
15:55:23    let (r,  j)    = fact(n);
15:55:23        (r', j')   = times(S(n), r)
15:55:23    in  discard j' = r;
15:55:25                r  = fact(S(j))
15:55:27    in  (r', S(j));
15:55:52  elliott_: is that MNIJWTF?
15:55:59  ais523: branch 2 branch 1
15:56:34  gah, it looks vaguely like Haskell but trying to interpret it as Haskell makes my head spin
15:56:40  that's also a good sign :)
15:56:56  ais523: try ignoring discard...in
15:57:06  and note that times returns a tuple
15:57:08  nah, I think I know what discard does
15:57:18  it asserts that both values are equal, and then forgets about them
15:57:24  and forgetting about data is otherwise impossible
15:57:25  it only forgets about the LHS
15:57:30  err, right
15:57:32  right
15:57:34  ofc
15:58:04  ais523: the problem is mainly, how do I force people to use discard? rather than just doing something like
15:58:12  fact(Z)    = (S(Z), Z);
15:58:12  fact(S(n)) =
15:58:12    let (r,  j)  = fact(n);
15:58:12        (r', j') = times(S(n), r)
15:58:12    in  (r', (r, j', S(j)));
15:58:24  where you basically just thread computations and put all the junk in one value
15:58:40  what about making the language typed?
15:58:46  elliott_: the value is thusly called "the trunk"
15:58:47  (as in, typed lambda calculus)?
15:58:49  ha. ha.
15:59:25  ais523: ooh, that might actually work
15:59:39  ais523: except, ah, no
15:59:49  then you have to invent a monstrously complicated ADT to lump all the junk in one value
16:00:04  err, not ADT
16:00:09  fact(Z)    = (S(Z), [Z]);
16:00:09  fact(S(n)) =
16:00:09    let (r,  j:js)  = fact(n);
16:00:09        (r', j') = times(S(n), r)
16:00:09    in  (r', S(j) : r : j' : js);
16:00:12  recursive type
16:00:12  hereafter called "the trunk"  plz
16:00:22  ais523: maybe if it was the simply typed lambda calculus
16:00:23  kallisti: but we're trying to get rid of it
16:00:27  ais523: but the STLC can barely /compute/ anything
16:00:32  I'd like this to be TC
16:00:39  ais523: okay then plz name your finished solution "the trunk"
16:00:40  elliott_: what's the difference? no recursive types?
16:01:06  kallisti: elliott_ and I both care deeply about MNIJWTF, we want a truly great language to represent the name
16:01:08  ais523: STLC just has Q and (A -> B) as types
16:01:11  where Q just means "anything"
16:01:28  elliott_: crazy idea: what about bounding memory usage somehow?
16:01:44  although that gets rid of TCness, it still allows the vast majority of practical programs
16:01:54  apart from interps and similar constructs that absolutely need to be TC
16:02:09  hmm, that reminds me, I still need to invent ACK
16:02:23  the esoteric programming language that is not TC, but only barel
16:02:25  *barely
16:03:14  ais523: hmmm, maybe
16:03:47  ais523: what if i made it bounded but infinite?
16:03:48  (the idea is, there are two sorts of entropy; there's minor entropy and major entropy, all operations cost minor entropy, major entropy allows you to ackermann-function your minor entropy but you only have a finite, program-specified, amount)
16:03:52  hey guys we're on topic.
16:03:53  amazing.
16:04:02  kallisti: stop trying to derail us, this channel is even better ontopic than offtopic
16:04:09  I'm... not?
16:04:39 * kallisti was actually just discussing (read: ranting to himself with a witness) an esolang.
16:04:40  ais523: that is to say, like, you have aleph_null ram
16:04:59  ais523: but if you do f(g(x), h(x)), the computations of g(x) and h(x) can only take half of it
16:05:07  and f gets all of it, because it's a tail call
16:05:10  that's, umm, wow
16:05:15  does that even make sense?
16:05:18  please tell me that makes sense
16:05:29  I don't think so, so let's keep thinking about it until it makes even less sense
16:06:04 -!- calamari has joined.
16:06:08  ais523: so the idea would be, make it so that just piling all the junk from multiple calls together ends up using an impossible amount of RAM
16:06:21  yep
16:06:27  ais523: i.e., because you recurse, and then use more than ten times that, or whatever
16:06:36  so the whole function needs RAM n > n for certain inputs
16:06:41  and it's rejected by the RAM checker
16:06:42  hmm, now I'm reminded a bit of Advice
16:06:50  it's one of the ICFP esolangs
16:07:12  and it's basically just Thue-on-trees, except that if the same number of replacements need to be made on both branches of a tree, it doesn't replace on either
16:07:29  which is a restriction that's perfectly gauged to throw a spanner in the works of typical algorithms
16:07:40  wow so I think I've actually figured out my esolang.
16:08:05  (my solution to programming in it was to make sure that only one replacement was possible at any given time, so that it'd always be split 1/0 everywhere that mattered and thus avoiding a balanced situation)
16:08:20  that applies to subtrees, too, obviously, or it'd be trivial
16:09:18  ais523: incidentally, it's meant to be term rewriting, if it isn't obvious
16:09:20  my language, that is
16:09:33  You guys were talking about entropy without me?
16:09:43  Wait no that's stupid entropy.
16:09:55  elliott_: yep, I figured it was some sort of match-and-unmatch thing, like Anarchy
16:10:22  ("unmatch" is a great name for the operation of creating a data structure from a template)
16:13:46  ais523: hmm, I'm quite worried that the junk value always seems to be one of the parameters to the function
16:13:56  I suppose it's because these functions are pretty simple so far
16:14:22  elliott_: hmm, I'm reminded of Unassignable now
16:14:33  finding workable junk values there was really hard
16:14:36  * :≠
16:14:41  yay, I can finally type its actual name
16:14:50 * elliott_ is trying fib now, which is interesting because it recurses twice
16:17:13  wow, fib is difficult
16:18:39  fib(Z) = (0, Z);
16:18:39  fib(S(Z)) = (S(Z), S(Z));
16:18:39  fib(S(S(n))) =
16:18:39    let (a, j)      = fib(n);
16:18:39        (b, j')     = fib(S(n));
16:18:40        (r, j'')    = add(a, b)
16:18:42    in  discard j'  = S(j)
16:18:44                j'' = a
16:18:46                a   = fst(fib(j))
16:18:48                b   = fst(fib(S(j)))
16:18:50    in  (r, S(S(j)));
16:18:52  the problem there is that there's no such thing as fst
16:18:58  indeed
16:20:54  hmm, ah
16:20:56  fib(Z) = (0, Z);
16:20:56  fib(S(Z)) = (S(Z), S(Z));
16:20:56  fib(S(S(n))) =
16:20:56    let (a, j)          = fib(n);
16:20:57        (b, j')         = fib(S(n));
16:20:59        (r, j'')        = add(a, b)
16:21:01    in  discard j''     = a
16:21:03                (a, j)  = fib(j))
16:21:05                (b, j') = fst(fib(S(j)))
16:21:07    in  (r, S(S(j)));
16:21:09  wow, that's longer than it looks in my editor
16:21:11  errr
16:21:13  scratch that
16:21:25  http://sprunge.us/TYBY
16:21:31  oh, and I forgot semicolons
16:22:43  ais523: I suppose there's no problem in letting you use a variable after it's discarded
16:22:58  indeed
16:23:16  although, you could just put a discard list at the end of a function
16:23:20  ais523: the main problem is that it's easy to cheat discard
16:23:28  ais523: by giving it a definition that _isn't_ equivalent
16:23:36  but just happens to work in all the cases you try
16:23:50  should be instant runtime crash if they're different at runtime
16:24:00  I don't see why it's a problem if they're always the same at runtime but defined differently
16:24:06  ais523: that's cheating; you can't do that in the "architecture" of the language
16:24:14  ah, OK
16:24:17  ais523: I mean, on real computers, you don't have to do discard at all! you can just throw away the values
16:24:35  the idea is that you can throw away information as long as you can prove you already have it
16:24:43  which isn't the same thing as just happening to have the right bits
16:24:54  you need to prove you've already computed it redundantly, in essence
16:25:04  hmm
16:26:51 -!- olsner has joined.
16:27:21  ais523: I suppose it could try and prove it itself via term rewriting
16:27:26  not sure it would work though
16:27:40  make it ship with a machine-readable proof, Coq/Agda-style?
16:27:42  ais523: sort of, prolog style
16:27:43  like if you do
16:27:45  a = b
16:27:50  it computes b symbolically
16:27:53  and checks that it's a
16:28:07  ais523: that's also cheating, but more importantly it's really boring
16:28:12  heh, I think that's another operation that I'm planning for Anarchy
16:28:12  because proofs are boring to write
16:28:13  quick, someone summarize the last week of #esoteric for me
16:28:16  elliott_: OK
16:28:22  olsner: boring
16:28:24  olsner: is that possible?
16:28:25  except for just now
16:28:36  but yes, today it's been interesting, the rest of the week, not so much
16:28:40  elliott_: ok, I'll just assume I haven't missed anything then :)
16:29:09  elliott_: yes, everything is so much easier when I resist the urge to not make this a term rewriting language.
16:29:27  term rewriting is great
16:29:34  and instead just make it an awesome term rewriting language.
16:29:36  s/term/graph/g
16:29:44  more languages should do term rewriting
16:30:33  ais523: heh! i think i can use this model to do a kind of uniqueness typing
16:30:50  so this is kind of turning into a spatial and temporal logic graph rewriting language, if that's even a thing.
16:32:08  also nondeterministic because why not.
16:35:19  http://sprunge.us/ENjA
16:35:21  I think this works
16:35:33  the main problem is that you could discard the last world and return the second-last world, which is problematic
16:37:51  ais523: heh, then I thought of a solution but it's just a monad
16:38:16  elliott_: monads in general, or a specific monad?
16:38:21  the io monad
16:38:37  right yes, that became obvious when I clicked on the link
16:38:47  er, no
16:38:51  that sprunge isn't the IO monad
16:39:10  nope, but it becomes clear that IO is how you'd fix it
16:39:24  right
16:39:32  that's so boring though, it doesn't use the reversibility at all
16:39:42  the only additional thing you'd need is like
16:39:50  discard X in E -- E has to have type IO t for some t
16:39:54  and X can have any type
16:40:04  so that you can, e.g., read a line from the terminal without having to print it out later or whatever
16:40:16  (discard X in E has the same type as E, ofc)
16:40:49 -!- sebbu2 has joined.
16:41:02 -!- sebbu2 has quit (Changing host).
16:41:02 -!- sebbu2 has joined.
16:41:12 -!- sebbu has quit (Ping timeout: 248 seconds).
16:41:42  ais523: time to see if I can write reverse : [a] -> [a]
16:43:25  append([], ys) =
16:43:25    discard [] = take(Z, ys)
16:43:25    in (ys, Z);
16:43:25  append(x:xs, ys) =
16:43:25    let (xs', j) = append(xs, ys)
16:43:25    in  (x:xs', S(j));
16:43:30  hmm, that can't possibly work, which is a bad sign
16:43:36  because I can't think of another way to do it
16:43:50  and I also can't see how that's invalid
16:45:03  ais523: hmm, I might pop back to branch 1, which is a completely different language
16:45:19  ais523: http://esoteric.voxelperfect.net/wiki/User:AlisonDiaz603
16:45:59  deleted (I assume you didn't want protection instead :P)
16:46:12  I have just noticed a name in a Wikipedia article which is spelt two different ways in two consecutive paragraphs.
16:48:25 -!- copumpkin has quit (Remote host closed the connection).
16:48:32  ais523: btw, though I'm not as annoyed as oerjan, I think you should contact Graue if spam continues at this rate, at least to give you bot privileges so that you can keep the deletions off recentchanges
16:48:57  elliott_: he'd need to give me the option to set/unset bot privs
16:49:09  ais523: why can't he just set bot privileges for all admins?
16:49:10  rather than just to put them on constantly, because then none of my edits would show up in recent changes
16:49:13  ah
16:49:21  is there a way to do that without giving you crat privs?
16:49:25  I'm also not sure what happens to admin actions marked bot actions
16:49:34  elliott_: yes, but it's nontrivial and may require recentish MediaWiki
16:49:39  *sigh*
16:49:43  admins can set/unset all sorts of flags on Wikipedia
16:49:56  (none of the really important ones, but flags like "can use rollback" are routinely toggled by admins)
16:50:07  ais523: well, whatever, I just think you should contact him to get /something/ done if recent changes continues to be completely clogged with spam
16:50:37  what I'd really like is the AbuseFilter extension
16:50:43  it lets admins configure anti-spam rules
16:51:01  that would be preferable to our current (terrible) capthca system.
16:51:04  captcha
16:51:16  but i have a feeling that graue has Strong Opinions on the Right Way to do this
16:51:37  we could at least have a better captcha
16:51:44  admins can create accounts, right?
16:51:54  yes, for other people as well as themselves
16:51:57  then it doesn't matter if we have an image-only captcha
16:52:06  people who can't use it can ask an admin for an account
16:52:09  it requires an email address, though
16:52:22  as the admin doesn't get to see the resulting password, and it has to be sent /somewhere/
16:52:31  right
16:52:37  (random fact: for a while, I handled quite a large proportion of Wikipedia's manual account creation)
16:53:14  what was that used for?
16:53:27  mostly usernames that hit the blacklist
16:53:41  like being too similar to another user, or containing blacklisted words, that sort of thing
16:53:48  checking to see if the blacklist should be overriden in that case
16:54:05  (being too similar to someone who registered six years ago and has never edited, for instance, typically I'd allow that)
16:55:47  But five years, hell no!
16:56:00  heh
16:59:36  someone help me forget an idea I just had, please
16:59:49  !perl print (("stay in school", "drop out")[int(rand(2))])
16:59:52  stay in school
16:59:58  EgoBot: thanks egobot
17:00:07  `run perl -e 'print (("stay in school", "drop out")[int(rand(2))])'
17:00:09  drop out
17:00:11  kallisti: HackEgo is cooler.
17:00:15  You should trust HackEgo instead.
17:00:26  I somehow doubt that.
17:00:37  still MY TIME MANAGEMENT SKILLS ARE FUCKING DISAPPEARING AAAAAAH
17:00:40  @die 2
17:00:40  2 => 2
17:00:44  @die 1d2
17:00:44  1d2 => 2
17:00:46  not that I had any in the first place.
17:00:48  but now they're more important.
17:01:06  Majority opinion points to "drop out"
17:02:06  PRNGs is no way to make important life decisions.
17:03:26 -!- copumpkin has joined.
17:03:30  www.random.org says 1 so "stay in school" it is
17:04:06  !perl print ( int rand(6 > 0) ? "continue living" : "kill yourself" )
17:04:07  kill yourself
17:04:09  lol
17:04:30  I'm bad at Russian roulette
17:04:34  er
17:04:36  except
17:04:36 -!- copumpkin has quit (Remote host closed the connection).
17:04:38  I fucked up the code
17:04:42  so I'm just bad at programming
17:04:46  !perl print(int rand(6 > 0))
17:04:46  0
17:04:55  !perl print(rand(6 > 0))
17:04:56  0.262715389094414
17:05:01 -!- copumpkin has joined.
17:05:07  is 6 greater than 0
17:05:12  Yes
17:05:23  !perl print ( (int rand 6) > 0  ? "continue living" : "kill yourself" )
17:05:24  continue living
17:05:25  thanks
17:05:28  yesssss
17:07:19  !perl print int rand 6
17:07:19  1
17:08:05  !perl print int rand 6
17:08:05  0
17:08:07  !perl print int rand 6
17:08:08  2
17:08:09  !perl print int rand 6
17:08:10  3
17:08:26  you're all being terrible at distracting me.
17:09:37  echo '#!/bin/perl' > bin/russianroulette && echo 'print ( (int rand 6) > 0  ? "continue living" : "kill yourself" )' >> bin/russianroulette && chmod +x bin/russianroulette
17:09:56  `run echo '#!/bin/perl' > bin/russianroulette && echo 'print ( (int rand 6) > 0  ? "continue living" : "kill yourself" )' >> bin/russianroulette && chmod +x bin/russianroulette
17:09:58  No output.
17:10:07  `russianroulette
17:10:07  `rm bin/russianroulette
17:10:10  NOOOOOO
17:10:11  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: /hackenv/bin/russianroulette: /bin/perl: bad interpreter: No such file or directory \ /home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: /hackenv/bin/russianroulette: Success
17:10:27  No output.
17:10:33  Success
17:11:29 -!- monqy has joined.
17:11:52  monqy: success
17:12:00  hi
17:12:19  monqy: monqy :elliott
17:12:29  hi
17:12:32  hey
17:12:46  zah
17:12:55  speaking of success, I finished the python yesterday/lastnight
17:13:37  hopefully that means no more for a while. will likely have to do c++ next quarter though :( why is everything bad
17:13:48  "On the one hand, Java was slow, bloated, and not too portable. On the other hand, Inferno was quick, small, portable*, and marketed by AT&T. So naturally Java became popular."
17:14:14  inferno? that any good?
17:14:39  http://en.wikipedia.org/wiki/Inferno_(operating_system)
17:15:01  tetris excitement
17:26:36  ais523: quick, talk about Feather
17:35:52  ais523: that wasn't quick!
17:52:05  elliott_: obviously he wrote an IRC client in Feather
17:52:08  and discussed in the pass.
17:52:10  t
17:52:11  the passt
17:52:44  using the Feather inerpretre that's written in Feather.
17:52:55  ais523: confirm/deny
17:53:22  ais523: probably too insane to do either.
17:53:25  er
17:53:28  elliott_: ^
18:06:20  is prototype inheritance in JS a real, built-in language fearture?
18:06:23 -!- zzo38 has joined.
18:06:27  or just a stupid hack?
18:07:34  JavaScript prototype inheritance is a language feature. I'm not sure how that's related to whether it's a stupid hack or not.
18:08:58  kallisti: /all/ Feather interpreters are written in Feather
18:09:04  if they weren't, they wouldn't be Feather interpreters, by definition
18:09:27  this confused me for a bit, before I realised that you could write a Feather interp as a polyglot between Feather and some other language
18:09:33  and as long as everything had the same meaning, it'd work fine
18:10:50  ..
18:10:55  elliott_: But is it in the language itself or just in the runtime that could be altered? How is it different from prototype inheritance implemented in C? Would this make C object oriented? :D
18:11:06  ais523: you realize that doesn't really make any sense at all right?
18:11:16  nooga: (a) it is part of the language itself. it must be implemented in the runtime, of course, like all language features.
18:11:17  I'm asking because I have an argument with guy that states that JS is legit OO language
18:11:27  nooga: (b) C does not have prototypes...
18:11:31  kallisti: there is a reason that Feather drives people who attempt to understand it crazy
18:11:40  I think you're beginning to see the edges of it
18:11:42  nooga: of course JS is an object-oriented language.
18:11:47  nooga: Do you know of Self?
18:11:56  yeah
18:12:06  the reason it's so maddenning is that you're constantly struggling with the issue of whether Feather makes sense or not
18:12:14  nooga: also, you can do OO quite well in C
18:12:21  ais523: i know taht
18:12:31  but it does not make C an OO language
18:12:34  and that's my point
18:12:37  you can even setup vtables by hand and get it working exactly like a saner version of C++ if you like
18:13:08  nooga: JavaScript has language support for objects with self-reference and constructors. JavaScript has built-in language support for prototypes via the .prototype functionality.
18:13:09  ais523: I've read a book about it
18:13:19  It is unquestionably a real object-oriented language based on prototypical inheritance.
18:13:42  It's also not a very good language in general, but that's an orthogonal issue.
18:13:55  elliott_: understood
18:14:00  elliott_: how does JS do delegation, or the equivalent? I seem to remember something like making the prototype a function that looks at the superobject's prototype
18:14:22  ais523: I don't remember exactly how it works; I've tried to forget as much JS as possible.
18:14:27  http://ejohn.org/blog/simple-javascript-inheritance/
18:14:33  but this is just completely wrong
18:14:51  nooga: That's just syntactic sugar.
18:14:54  i could write OO programs in C with less syntactic clutter
18:14:55  Well.
18:14:57  elliott_: why do you hate JS as much as you do? I don't understand it well enough to truly hate it
18:15:03  Half syntactic sugar for delegation, half attempting to make it look like class-based inheritance.
18:15:28  ais523: I don't really hate it, it's just not very pleasant to use; a large part of that is because browser APIs, especially the DOM, are terrible.
18:15:33  elliott_: well, class-based inheritance is a special case of prototype-based inheritance
18:15:34  ais523: But also its scoping is awful.
18:15:44  elliott_: isn't it block-scoped?
18:15:47  well, sometimes?
18:15:50  oh, I see what you mean
18:16:00  ais523: no
18:16:02  ais523: it's function-scoped
18:16:09  ouch
18:16:13  seriously?
18:16:16  ais523: for (var i = ...; ...; ...) { ... }; /* surprise, i is still in scope! */
18:16:25  (and any previous "i" in the function overwritten)
18:16:40  what about {for (var i = …; …; …) { … };} /* is i still in scope here? */
18:16:46  i don't think that's valid
18:16:47  people do
18:16:50  (function() { ... })()
18:16:52  for closures
18:16:54  wow
18:17:03  another thing I dislike about JS is how lax and implicit its coercions are
18:17:06  and conversions, too
18:17:17  hmm, that would be a fun use for C++ lambda syntax: [](){ … }()
18:17:26  although {} works just as well in C++
18:17:42  elliott_: that's just typical dynamic language typing syndrome
18:17:47  at least, it's endemic to both JS and PHP
18:18:11  ais523: Python and Ruby don't suffer from it
18:18:16  ais523: Perl sort of does, but it's at least consistent about it
18:18:24  Perl uses a different solution to the problem
18:18:28  because it separates its string and number operators strictly
18:18:37  Python and Ruby make sure that values are always clear on their own type
18:18:39  "Some languages, such as Perl, began as scripting languages[3] but were developed into programming languages suitable for broader purposes. Other similar languages – frequently interpreted, memory-managed, or dynamic – have been described as "scripting languages" for these similarities, even if they are more commonly used for applications programming. They are usually not called "scripting languages" by their own users."
18:18:44  err, Perl users don't call it a scripting language?
18:18:44  whereas Perl makes sure that contexts are always clear on their own type
18:18:54  elliott_: I call it a scripting language when I use it for scripting
18:19:03  haha
18:19:03  something like TAEB, it doesn't really feel like I'm using a scripting language, though
18:19:20  it feels like I'm using a not-really-designed-for-scripting subset of a scripting language
18:19:27 * elliott_ thinks Perl is probably okay for scripting, but wouldn't use it for anything non-scripty. /me also considers it a flaw when a language is only good at one
18:19:45  I agree, so I moved it. Not an admin tho so history will look weird. Elfguy 20:37, 16 August 2005 (UTC)
18:19:46  --[[Talk:Scripting language]]
18:19:49 -!- Klisz has joined.
18:19:52  elliott_: perl does have pretty good scoping rules though.
18:19:59  in regard to the above.
18:20:03  about JS scoping
18:20:04  kallisti: nowadays
18:20:13  Perl is one of the few modern languages with proper dynamically-scoped variables
18:20:14  it took multiple tries to get it right
18:20:30  elliott_: Perl did what it usually does, and put every sort of scoping it could think of into the language
18:20:32  also, I believe Python is function-scoped as well for local variables.
18:20:46  it is
18:20:53  good.
18:20:54  ..
18:20:57  but at least variables can't be referenced before definition
18:20:58  package scope, dynamic scope, lexical scope, you can even have truly global scope if you like (this requires you to name your variables starting with a control character)
18:21:00  (in js they're just undefined)
18:21:06  and at least it doesn't /pretend/ to have a declaration keyword (var)
18:21:20  ais523: control character? seriously?
18:21:28  elliott_: yes; there's sugar to write it in ASCII
18:21:36  what sugar?
18:21:42  I like how Python is sometimes less strict than Perl, mainly regarding variable declaration (or lack thereof)
18:21:42  ${^This_starts_with_control_T}
18:21:44 -!- derrik has joined.
18:21:49  awesome
18:21:50  but it's stored as a literal control-T internally
18:21:59  kallisti: nothing's looser than strict/warningsless perl
18:22:23  incidentally, it's 2011; why doesn't perl have a flag to enable both strict and warnings?
18:22:30  and you can put a literal control-T in the source, if you really want to
18:22:52  elliott_: I believe they want it to be module-specific. This is why the -w flag is discouraged.
18:22:56  elliott_: because scripts where you want strict and warnings, which is ones that are longer than oneliners, are scripts where there's no big loss in writing "use strict; use warnings;"
18:23:13  ais523: the loss is that it takes time and annoys me :P
18:23:13  because -w is applied globally.
18:23:15  whereas for the really insane golfing, poetry, etc, you probably want them off
18:23:18  kallisti: it is? seriously?
18:23:23  yes.
18:23:34  kallisti: are you muddling it with -W, which is very very global?
18:23:42  maybe?
18:23:50  I thought -w turned on warnings in the perl interpreter
18:24:06  which is not a module-specific thing.
18:24:14  i hate js fanboys
18:24:17  -w sets the global variable ${^W}
18:24:18  anc C++ fanboys
18:24:23  which turns on warnings
18:24:28  so... yes?
18:24:29  but it can be turned on and off scopely as usual
18:24:33  and, especially, PHP fanboys
18:24:34  it's just that most modules don't start "no warnings;"
18:24:43  right.
18:24:47  so because -w changes the default warning setting from off to on, it affects them too
18:24:59  -W turns on warnings regardless of "use warnings;" or "no warnings;" or ${^W} or anything
18:25:06  ah okay.
18:25:46  (btw, you can golf ${^W} down to $^W because the name's one char long, and further to $ followed by a literal control-W)
18:25:59 -!- Klisz has quit (Quit: You are now graced with my absence.).
18:26:04  Larry -Wall
18:26:23  elliott_: incidentally, aside from it being a requirement for certain uses of Getopt and $_ hacks, I haven't really used dynamic scope much in Perl.
18:26:26  I can't remember what -a does
18:26:34  and why would you turn on automatic line-ending handling twice?
18:26:41  kallisti: it's good for configuration settings, generally
18:26:47  for instance, whatever stdout is
18:26:58  ais523: you know the options for Larry?
18:26:59  common lisp puts it to good use like that
18:27:22  elliott_: in the Crawl codebase, I've seen a class whose objects are dynamically-scoped booleans, using RAII
18:27:34  it really confused the person who asked me for help with it, because they didn't understand it
18:27:44  ais523: ouch
18:27:47  if the code were RAIIing everywhere, it'd probably be fine, but it's the only bit of RAII I've seen in the code
18:27:55  which just makes it more confusing
18:28:01     Awk Traps
18:28:01         Accustomed awk users should take special note of the following:
18:28:01         ·   A Perl program executes only once, not once for each input line.  You can do an implicit loop with "-n" or "-p".
18:28:17  -p is great for golfing
18:28:24  ais523: -a turns on autosplit mode. I'm not sure if someone else has already said this or not.
18:28:27  to the extent that many programs, you actually write #!perl -p at the start
18:28:36  kallisti: nope
18:28:39  kallisti: hmm, I thought that was -s, perhaps I was confused
18:28:46 * ais523 perldoc perlrun
18:28:49  ais523: I just find it funny that it has to be pointed out that lines run once
18:29:04  ah, -a is autospit, -s parses command-line arguments
18:29:07  ais523: why not "man perlrun"
18:29:15  elliott_: plenty of languages have an implicit loop
18:29:32  also, because I'm used to perldoc nowadays for Perl-related things because it has all the manpages and more stuff beyond that
18:29:47  you can use perldoc -f to get a section of perlfunc, you can't do that with man, for instance
18:29:54  and perldoc and man produce identical output for the manpages
18:30:02  not identical
18:30:03  I think; reasonably identical, at least
18:30:14  oh, the wrapping's different
18:30:28  I think I prefer right-ragged to ASCII-justified
18:31:00  the status bar is different, more importantly
18:31:04  anyway, if you prefer that, set man to do that
18:31:28  elliott_: oh right, man's overriding my less settings, perlrun isn't
18:31:28  ais523: err, both are ragged-right here
18:31:36  and, hmm, indeed
18:31:47  man's normally justified, I just assumed it'd be for perl docs too
18:32:06  presumably the manpages are actually generated as manpages, not via nroff
18:32:16  but, hmm
18:32:23  `run echo 'open 0;print<0>' > quine.pl && perl quine.pl
18:32:26  open 0;print<0>
18:32:40  totally pure guys.
18:33:00  $ l `man -w perlrun`
18:33:17  hmm, it looks like nroff
18:33:34  .\" For nroff, turn off justification.  Always turn off hyphenation; it makes
18:33:36  .\" way too many mistakes in technical documents.
18:33:39  ah, interesting
18:33:52  it looks like some workaround for nroff specifically in pod2man
18:34:02  it's conditioned on nroff being the implementation used, and wouldn't happen in groff or troff
18:34:08  what's the fastest way to forget how to write assembly code?
18:34:13  `rm quine.pl
18:34:15  No output.
18:34:19  elliott_: in which language?
18:34:27  spanish
18:34:40  I think you'd have to learn how to write asm in spanish first
18:34:44  in order to forget it
18:34:55  indeed
18:35:40  ais523: (what did you actually mean by that question?)
18:36:40  which asm variant, I think I meant
18:36:40  as in, x86 asm, 6502 asm, etc
18:37:09  x86(-64, ostensibly)
18:37:15  I suppose if you wanted to forget asm for a particular platform, you could just learn it for another platform that's much nicer
18:37:20  go work on SPARC asm or something for a while
18:37:28  why do you want to forget x86 asm, incidentally?
18:38:00  ais523: to prevent me from trying to write a horrible thing
18:38:12  it might be easier to fix the reason rather than the immediate problem
18:38:12  elliott_: oh, err, uh-oh
18:38:12  elliott_: you'll fail
18:38:23  (if I demoralize elliott_ enough, that'll have the same effect with less pain)
18:38:44  elliott_: writing a horrible thing will make you a worthless human being, even if you succeed; especially if you succeed, possibly more so if you fail
18:39:05  ais523: see, now what'll happen is I'll end up writing it anyway, and then I'll get all sad because you're mean
18:39:10  LOOK AT WHAT YOU HAVE DONE
18:39:18  elliott_: you don't want to make me mean, do you?
18:39:28  not even retroactively? especially not retroactively?
18:39:42  !feather ais523->mean = true
18:39:51  that looks nothing like Feather
18:40:02  you'd have to <<= me with a slightly modified ais523
18:40:04  you can change Feather's syntax, can't you?
18:40:07  probably through a wrapper function, to prevent a time loop
18:40:18  !feather loads the Alternate Standard Feather Library which is more popular nowadays
18:40:23  that reskins the syntax
18:40:25  elliott_: well, yes, I guess, but at some point it stops being Feather, and starts being a different language with similar semantics but different syntax
18:41:02  ais523: changing <<= to = and adding sugar for record access doesn't seem that drastic
18:41:24  hmm, I guess so
18:41:29  but that'd be negative sugar
18:41:36  as you would need just a space there for record access, typically
18:41:54  ais523: in the future, people like to put spaces in identifiers
18:42:05  so that was added to the ASFL due to popular demand
18:42:06  also, hmm, I wonder if the value of ais523 mean would be shared with other values
18:42:07  retroactively
18:42:34  you could do "ais523 mean <<= true" (and probably get yourself stuck in a time loop), but if it was sharing with other booleans at the time, that'd be equivalent to "false <<= true", which, umm, is probably a bad idea
18:42:46  (this is assuming you have sugar for false and true, which you probably do)
18:43:02  false <<= true looks set to be even more fun than false become: true
18:43:25  what happens if you do, e.g., x <<= [x] where [x] is the singleton list of x?
18:43:33  Feather rapidly allocates memory?
18:43:36  it doesn't recurse
18:43:46  you get a list containing the metaold value of x
18:43:57  however, that point in the code would be evaluated again, unless something stopped it
18:44:07  ais523: hmm, is there any way to make a cyclic structure in Feather?
18:44:21  <<= is incredibly unsafe; if it doesn't change some previous control flow behaviour of the program, you get a time loop
18:44:42  so people will probably normally use sugar around it to use some safer operation, such as "add currently nonexisting method"
18:45:08  elliott_: the trick would probably be to use the arbitrary number
18:45:10  s/people/ais523/
18:45:28  you can't have a true cyclic structure, but you can have a retroactively cyclic structure
18:45:52  in any case my 4D logical graph rewriting language is going to.. what's the word.. baller.
18:45:56  oh
18:46:09  ais523: Feather concurrency sounds like fun
18:46:14  anyone taking part in ioccc ?
18:46:18  (that is, any test you perform to try to demonstrate it not cyclic, it retroactively becomes just cyclic enough to prevent that test working; if you do something that would be an infinite loop on a cyclic structure, you get an infinite loop)
18:46:21  nooga: Gregor and ais523
18:46:23  nooga: I am, Gregor is
18:46:30  I do feel like writing something in C
18:46:44  just not sure if I want to write obfuscated C, or why I would bother trying to make an entry.
18:46:53  ais523: here's a fun concurrency strategy: if conflicts occur, retroactively use a different ordering of threads instead
18:46:59  OMG I missed Featherchat???
18:47:04  elliott_: brilliant
18:47:07  kallisti: fame and glory
18:47:12  really, I'm not going to even attempt concurrency in Feather
18:47:15  Just write whatever in C according to the program you want to write specifically
18:47:22  kallisti: May as well not bother, as I'm going to win.
18:47:26  it's sort-of like trying to do concurrency in Haskell, only worse
18:47:29  Gregor: there are multiple winners
18:47:44  ais523: Only one "best in show" (or whatever they call it)
18:47:45  ais523: concurrency in haskell works brilliantly
18:47:49  Gregor: I'm not aiming for best in show
18:47:51  tyvm
18:47:58  but for small program, and rules abuse
18:48:15  elliott_: indeed; but you need external libraries, or else for the compiler to deduce it as an optimisation
18:48:20  ais523: Actually, I want them to invent a category for me.
18:48:24  (external = not writable in Haskell)
18:48:25  But failing that, I'll take best in show X-P
18:48:35  ais523: by "concurrency", I just meant lock-step or whatever
18:48:38  not native threads
18:48:42  hmm, right
18:48:47  you'd have to change the entire execution model of the program
18:48:55  but the worrying thing is, this is Feather, and you can actually /do/ that
18:49:01   in any case my 4D logical graph rewriting language is going to.. what's the word.. baller.
18:49:09  Graphs are nondimensional you eejit.
18:49:28  okay fine well what's a graph except now it has distances in a 4D space.
18:49:46  kallisti: a labeled-edge graph?
18:49:59  (do the positions matter in 4D? or just the distances?)
18:50:07  oh? a labeled-edge GRAPH you say?
18:50:10  kallisti, distances?
18:50:11  What?
18:50:14  ais523: the position I think?
18:50:23  maybe just distances? both? -shrug-
18:50:23  Graphs... don't have distances inherently.
18:50:36  Phantom_Hoover: indeed; but you can certainly define a sort of graph that does
18:50:36  Phantom_Hoover: believe it or not I am actually familiar with graph theory
18:50:45  and they are in fact useful
18:50:47  You're just going to be assigning labels to edges based on some embedding of the graph.
18:50:54  Phantom_Hoover: that's why I said labeled-edge graph
18:51:08  Oh, right.
18:52:13  kallisti, but why 4D?
18:52:17  I'm thinking only distances or relevant, so it may not really have 3 spatial dimensions.
18:52:25  3 = 4
18:53:01  Phantom_Hoover: going for reversability, the 4th dimension would be forward and backward in computation steps.
18:53:05  My guess is that the only thing actually having an embedding somewhere is going to change is the fact that the triangle inequality imposes limits.
18:53:13  kallisti, um...
18:53:52  Phantom_Hoover: nah, if you know nearly all the sides and diagonals of a hyper-n-gon, then that's going to lock in the location of the points, thus restricting the other sides and diagonals
18:54:06  the value of n depends on the number of dimensions involved
18:55:08  in any case whether or not it actually corresponds to a 3 dimensional space is irrelevant. I don't think I'm going to keep track of position but instead just do distance relationships.
18:55:34  But as ais523 says, you need to know position to tell if the distance relationships are meaningful.
18:55:59  meaningful in what sense? can't I just not care?
18:56:15  you possibly can not care
18:56:16  Sure, but then why call them distances at all?
18:56:22  the problem is wondering about whether or not you have reason to care
18:56:24  You're just assigning arbitrary numbers to edges.
18:56:36  ais523: argh, I'm trying to think of how the infinite division memory model works and it's so confusing
18:56:51  as in, do you have a reason for them to act like distances? and if so, is it just triangle inequality, or do you need more than that?
18:57:01  ais523: not really no.
18:57:15  ais523, BtW, your hyper-n-gon thing might just be a special case of the triangle inequality?
18:57:16  no reason for them to be distances.
18:57:21  Phantom_Hoover: *general case?
18:57:32  and it is, sort-of, but can lead to equalities as well as inequalities
18:57:33  f(x) = 1 : f(x) is easy to reject, because f^M(x) = 1 + f^M(x)
18:57:45  No, I think the triangle inequality results in it?
18:57:49  "The worst example of this sort of thing in my lifetime, and arguably in the entire history of science, has been the AGW (anthropogenic global warming) panic. Now that the wheels are falling off that juggernaut, I’m starting to hear ordinary people around me wonder how I knew it was bullshit and hot air so much in advance…" --esr
18:57:54 * elliott_ gets popcorn
18:58:12  ESR is a global warming denialist?
18:58:17  ais523: this surprises you?
18:58:18  hmm, I'm not massively surprised
18:58:25  I wouldn't have been surprised by the opposite either, though
18:58:45  think of an idiotic far-right libertarian position; if esr doesn't have it, you should be surprised
18:58:59  but there are idiotic far-right libertarian positions that contradict each other
18:59:11  ais523: indeed
18:59:43  I've discovered that the idiotic far-right libertarian at my school is a) crazy and b) probably an actual sociopath.
19:00:10  ais523: the nodes corresponding to a physical space was just an interesting idea, but the main proof of concept is the non-deterministic time-based shenanigans (we seem to be doing a lot of those lately)
19:00:23  'Lately'.
19:00:24  "Rhetoric that mixes science with the tropes of eschatological panic." actual quote
19:00:26  yep, especially as I was playing Braid yesterday
19:00:38  Phantom_Hoover: lately?
19:00:44  Feather transcends the timeline; ais has always not being developing it.
19:00:48  oh
19:00:54  hey, I work on it sometimes
19:01:03  I even did NEF just fine without getting very bad
19:01:04  *very mad
19:01:06  ais523: is Braid actually worth playing? I've been put off by how pretentious the developer is
19:01:08  although I'm not sure it's useful
19:01:16  (I think I see '523' as ais' last name now.)
19:01:27  elliott_: it's, umm, reasonably pretentious plotwise, but the graphics are pretty and the puzzles are interesting
19:01:38  the "no filler" rule is really grating, though
19:01:42  after a while you start wishing for filler
19:01:45  heh
19:02:04  it's also very difficult
19:02:18  which is arguably good, as it means you won't reach the ending, which is the most pretentious part
19:02:36  :D
19:02:42  :D
19:03:02  oklopol, come on, you're meant to join in there.
19:03:03  Phantom_Hoover: Can AII be a metaphor for globalisation please.
19:03:25  Like, after you finish the single-player campaign, "IT WAS GLOBALISATION ALL ALONG" pops up and you have to "OH I GET IT" to get back to the menu.
19:03:31  Yes.
19:03:32  ais523: would a 3D space be easier to manage if I restricted the graph from forming cycles with its present edges.  (think of present edges as just... normal graph edges)
19:03:42 -!- ais523 has quit (Read error: Connection reset by peer).
19:03:46  Phantom_Hoover: Except clicking "OH I GET IT" just makes it change into "VERY CLEVER".
19:03:48  I fixed another thing in Super ASCII MZX Town game
19:03:54  Phantom_Hoover: And you have to click it again.
19:04:07 -!- ais523 has joined.
19:04:32  < kallisti> ais523: would a 3D space be easier to manage if I restricted  the graph from forming cycles with its present edges.  (think  of present edges as just... normal graph edges)
19:04:35  [error] Closing Link: 147.188.254.189 (No more connections allowed in your connection class)
19:04:36  ?
19:05:00  ais523: get off the internet, low-class scum.
19:05:04  kallisti: yes, in fact you could do it even in a 2D space, but then you basically have a tree, not a graph (it becomes an actual tree if you give it a root)
19:05:38  ais523: wow, so a tree is like... a graph without cycles?
19:05:47 * elliott_ facepalm
19:06:00  kallisti: that is the graph-theoretic definition of "tree", yes
19:06:15  (don't forget it's connected!)
19:06:17  rooting it gives you the programming-language definition of "tree"
19:06:24  well, OK, it's not a tree if it isn't connected
19:06:27  it has to be connected to be a tree
19:06:34  otherwise it's a forest (actual technical term)
19:06:36  "No more connections allowed in your connection class"
19:06:37  In English, this means the server is full for people like you, at least for now. People from different providers might still be able to connect. You might see this sometimes on servers that you were able to connect to just recently. Try a different port on the same server (other than 6667) or try a different server for a while.
19:06:39  how helpful
19:06:39  I made barrier monad transform now.   newtype BarrierT f b m t = BarrierT { runBarrierT :: m (Either t (f, b -> BarrierT f b m t)) };
19:06:50  "people like me"
19:06:52  they exist?
19:06:55  lol
19:07:14  ais523: are you sure a tree has to have a root to be a tree in computer science? seems kind of arbitrary.
19:07:27  I mean, I know they typically do...
19:07:50  kallisti: it's not arbitrary; it's hard to define an ADT without one
19:07:56  kallisti: I'm talking about the usual recursive definition in terms of trees having a possible value (perhaps only if they have no branches), and 0-n branches
19:07:59  that naturally leads to a route
19:08:07  *root
19:08:29  you can imagine a sort of "doubly-linked tree" which wouldn't need one, but it probably wouldn't be very useful given the typical applications of trees in CS
19:08:39  ais523: that doesn't encompass, e.g. data Tree a = Branch (Tree a) (Tree a) | Leaf a
19:08:44  because n is fixed
19:08:53   you can imagine a sort of "doubly-linked tree" which wouldn't need one, but it probably wouldn't be very useful given the typical applications of trees in CS
19:08:58  ais523: the closest thing is a tree zipper
19:09:01  which /is/ very useful
19:09:01  I honestly haven't considered efficiency at all for this language.
19:09:11  list zippers are what we use instead of doubly-linked lists, after all
19:09:34  elliott_: right, indeed; I was talking about not needing a root, rather than not having the links back (which are potentially useful for reasons unrelated to rooting)
19:09:50  rewriting nodes based on whether or not they satisfy logical predicates in a huge graph that never shrinks is probably not going to be fast.
19:10:03  also, the "n is fixed" is a special case; that's a binary tree, which is a case of a tree where n = 0 or 2
19:10:43  fair enough, but the n=2 case has no value
19:10:58  also, what about data Tree a = Branch a (Tree a) (Tree a) | Leaf? that has a value only when n=2
19:11:41  perhaps if I restrict the kinds of predicates that one can use, then I can make the lookup algorithm fairly efficient..
19:11:57  elliott_: a conditional value is fine as well, I think
19:12:06  conditional on n, or maybe even on something else
19:12:23  kallisti: part of the reason I haven't implemented eodermdrome is that I can't think of an efficient way to do it
19:12:50  ais523: in particular I intend to restrict the rewrite rules so that subgraphs cannot be replaced in one rewrite.
19:13:11  well, single nodes are subgraphs I guess.
19:13:15  ais523: didn't oklopol come up with an efficient way? Phantom_Hoover?
19:13:25  elliott_: I think oklopol was working on it, but I can't remember the outcome
19:13:40  I thought the efficient way has been well-known in here for ages.
19:13:56  ais523: can we delete [[Excela]] so people stop vandalising it?
19:13:58  hmm, come to think of it, indexing by degree, and context degree up to n levels, would be pretty efficient
19:14:03  ais523: you should probably protect it, anyway
19:14:17  elliott_: if it gets spammed much more, I'll put an appropriate protection level on
19:14:20  is it anons or registered users?
19:14:23  ais523: it just got spammed
19:14:26  http://esoteric.voxelperfect.net/w/index.php?title=Excela&action=history
19:14:32  I don't think it's going to stop
19:14:34  and it's registered users
19:14:46  it's every three days, roughly
19:14:47  I'm thinking I could probably make it efficient if I restrict the kinds of rewrite rules and predicates that can be expressed, and by using other data structures besides a graph in the implementation, at the expense of more memory overhead.
19:14:52  elliott_: you just made me revert your revert by mistake!
19:14:53  sometimes more often
19:14:55 * ais523 reverts
19:14:57  for a language that, as far as I can tell, does not ever free memory.
19:15:18  unless a garbage collection or manual memory management scheme can be created... but I have no idea how that would work.
19:15:35  elliott_: with those spambots, in the past, all the spamming they've done has been confined to one article, but moves to a different one if you protect it
19:16:06  kallisti: most modern languages never free memory
19:16:28  ..wha? is this some weird technical distinction I'm missing?
19:16:40  I'm pretty sure they do.
19:16:48  no they don't
19:16:56  Python has no free(), Perl has no free()
19:16:57  elliott_: do you mean "return memory to the OS" by "free"?
19:17:00  Ruby has no free()
19:17:02  Haskell has no free()
19:17:06  Common Lisp and Scheme have no free()
19:17:12  ah, no, you mean "don't have an explicit command to free"
19:17:13  s/language/implementation/
19:17:18  ais523: no, I mean "don't free"
19:17:27  elliott_: $x = undef; will free the previous thing that $x referred to if it was the only reference
19:17:32  the fact that most implementations optimise things by discarding memory that they can prove won't be referenced in the future is irrelevant tot he language
19:17:38  ais523: no it won't
19:17:45  elliott_: and even run its finalisers
19:17:50  s/language/implementation/    --debate solved
19:17:53  well, finalisers are usually implementation-specific
19:17:58  and unpredictable
19:18:10  for instance, I bet Jython won't run finalisers if you do x = None
19:18:12  elliott_: they're part of the language in Perl 5 and predictable; this sort of thing may be /why/ it only has one impl
19:18:14  because it doesn't use refcounting
19:18:23  does Python even have finalisers?
19:18:30  yes.
19:18:35  __del__
19:18:40  (also, is "finaliser" or "destructor" the more common name nowadays?)
19:18:49  destructor I believe
19:18:51  is what I see the most.
19:19:01  finaliser
19:19:07   ais523: didn't oklopol come up with an efficient way? Phantom_Hoover?
19:19:17  destructor is Python jargon meaning something else, I think, which is why kallisti might see it more often
19:19:25  certainly I always see "finaliser" in memory-management texts
19:19:39  elliott_: no I see it in my Java and C++ classes as well.
19:19:40  I concluded that implementing Ullman's algorithm with appropriate specialisations would get the match stage (the real time sink) down to polynomial time.
19:19:59  I normally go with Java terminology for javaish-OO stuff, bceause Java's implementation on the javaish-OO world is quite large
19:20:05  Phantom_Hoover: I thought there was something simpler than that
19:20:14  (we really need a name for the Java/C++/C#ish OO to distinguish it from Smalltalky OO)
19:20:18  ais523: well, they're called finalisers in java
19:20:22  elliott_: I know
19:20:29  ais523: anyway, destructors are something subtly different, I believe
19:20:29  that's why I used that name without really thinking
19:20:37  ais523: they're things you run explicitly
19:20:40  cf. C++
19:20:42  even though you aren't meant to use finalisers in Java ever nowadays
19:20:45  Well, Ullman's algorithm optimises subgraph matching down to polynomial if you have constant subgraphs.
19:20:49  because they're so unpredictable
19:20:54  Which is the case in Eodermdrome.
19:21:04  ais523: I think it's usually called class-based OO
19:21:06  ais523: why unpredictable? just because GC is?
19:21:09  kallisti: smalltalk is class-based
19:21:17  oh..
19:21:23  right. I was thinking of self and friends.
19:21:28  elliott_: in Java, there's no guarantee that they're ever actually run at all
19:21:37  ais523: sure; that doesn't seem relevant to me
19:21:46  and I'm not sure if it's purely GC-related
19:21:48  GHC's finalisers have the same property and they're used with abandon
19:21:48  although it probably is
19:22:18  also, hmm, what context do GHC finalizers run in? some suitable IO monad that's made to happen at an arbitrary time relative to other events?
19:22:39  http://hackage.haskell.org/packages/archive/base/4.4.1.0/doc/html/Foreign-ForeignPtr-Safe.html
19:22:53  your question is incoherent and contains type errors, so i'll just link you docs instead :P
19:23:01  indeed, it contains type errors
19:23:10  I missed that they aren't Haskell
19:23:21  elliott_: your mouth is a type error
19:23:26  ais523: huh?
19:23:41  well, they're run via the FFI
19:23:42 -!- oerjan has joined.
19:23:43  oh, http://hackage.haskell.org/packages/archive/base/4.4.1.0/doc/html/System-Mem-Weak.html also has finalisers
19:23:45  ais523: no they're not
19:24:11  "A finalizer is represented as a pointer to a foreign function…"
19:24:23  well, OK, but that's not relevant: http://hackage.haskell.org/packages/archive/base/4.4.1.0/doc/html/Foreign-Concurrent.html
19:24:35  and the System.Mem.Weak finalisers are just actions too
19:25:49  so the answer is, they have to return a marshallable type, or an IO of a marshallable type
19:26:01  and making them pure functions is obviously ridiculous, so in practice, they're IO actions
19:27:06  Hey guys if you're libraring can you see if you can find an implementation of that algorithm.
19:27:55  ais523: huh?
19:27:59   so the answer is, they have to return a marshallable type, or an IO of a marshallable type
19:28:03  this is wrong and/or makes no sense
19:28:31  ah, I saw type FinalizerPtr a = FunPtr (Ptr a -> IO ())
19:28:42  then looked up the definition of FunPtr, and saw its restriction on types it accepted
19:28:53  and missed that FinalizerPtr had a stronger restriction (specificlaly, that it returned IO ())
19:28:55  ais523: you read wrongly
19:29:13  well, it's true that the types are always used that way in finaliser use
19:29:16  elliott_: look, it's pointless linking me to docs if you're going to disagree with everything that I glean from them
19:29:20  even if I'm wrong
19:29:21  but it's quite irrelevant, since the FinalizerPtr takes a Ptr
19:29:33  so it's irrelevant whether the a being finalised is marshallable or not
19:29:51  I didn't say it was relevant
19:29:55  I was talking merely about the return value
19:29:57  which is IO ()
19:29:57  ais523: I link you to documentation because I can't think of any way to answer your question because it doesn't make any sense; I can just ignore false things you deduce from it if you want *shrugs*
19:30:39  the return value is IO (), the argument isn't IO anything, thus the finalizer is an IO action
19:30:43  which is what the question was in the first place
19:30:54  err, "the argument isn't IO anything"?
19:32:01  elliott_: a function of type IO a -> IO a isn't really an IO action
19:32:09  functions aren't IO actions
19:32:15  IO actions look like IO a for some a
19:32:28  ah, aha
19:32:29  (id m :: IO a) for some m, a is certainly an IO action
19:32:33  terminology clash?
19:32:37  and (IO a -> IO a) is certainly a function from an IO action to an IO action
19:32:53  the IO /value/ is what's referred to as the action
19:32:56  ais523: no, just the typical non-Haskeller mistake of assuming something like (IO a) is a "function of 0 arguments"
19:33:07  thus assuming that if (IO a) is an action then (... -> IO a) must be too
19:33:13  at least, that's how I usually see that mistake being made
19:33:22  hmm, I think I might have made it based on different reasoning
19:33:27  it's because of the whole do-sugar thing
19:33:43  it's because you can >>= onto a function of type x -> IO a
19:33:51  well, OK
19:33:54  and that's a behaviour of >>= rather than of IO
19:34:00  but it feels like a behaviour of IO unless you concentrate
19:34:07  anyway, can anyone here get behind ACM paywalls who isn't too legalistic to share the spoils?
19:34:29  ais523: I think "join :: IO (IO a) -> IO a" may be clarifying, then, since you can use fmap/return/join instead of return/(>>=)
19:34:35  But of course there is more than >>= since there is also fmap, join, <$>, <*>, and so on
19:34:44  elliott_: even people who can get behind the paywalls, it's heavily DRMed
19:34:56  so I'm not entirely sure copying the resulting file would work, although it probably would to some extent
19:34:59  ais523: i.e., "if you have an IO program that produces another IO program that produces an a, then you can turn that into an IO program that produces an a (by just executing the program you get out of it)"
19:35:14  ais523: also, I'm pretty sure it would, since people regularly get pdfs behind paywalls for others...
19:35:24  oh, never mind, foudn it
19:35:25  found it
19:35:33  my guess is you'd be able to read it, but need a hacked PDF reader to be able to do anything but read it
19:35:42  perhaps it'd allow printing, if you were lucky
19:35:46  ais523: "hacked"? lol!
19:35:51  ais523: you realise that no pdf reader apart from like
19:35:53  acrobat and xpdf
19:36:00  actually obey the drm bullshit
19:36:00  respects the DRM?
19:36:14  Retype it if you need to...
19:36:18  elliott_: in that case, they're illegal in the US, or some such nonsense
19:36:29  ais523: I doubt that very much
19:37:08  the DMCA is kind-of ridiculous
19:37:15  it's much the same thing as libdvdcss, just on a smaller scale
19:37:39  (in that instead of heavy encryption, it's just a note saying "please")
19:37:39   anyway, can anyone here get behind ACM paywalls who isn't too legalistic to share the spoils?
19:37:59  I have several friends in university who probably have access.
19:38:03   Sgeo: updersation between itidus21, Vorpal, and kallisdeet <--  what?
19:38:05  ais523: you should delete evince, it's clearly illegal :)
19:38:09  Phantom_Hoover: Dude, I just linked you to the pdf.
19:38:18  Yes, it was a general thing.
19:38:22  elliott_: this sort of thing is why I refuse to go to the US :)
19:38:42  ais523: I'm sure we have something draconian enough to outlaw it
19:38:42  also, why I didn't take any sort of computer with me to Canada, although that was at least just as much a distrust of airports
19:39:22  I spent a week without Internet access there (except for a few minutes when I sneaked onto one of the computers the lecture hall used for projecting stuff on the screen; an old trick)
19:39:31  heh
19:39:42  without even usable phone, either, mobile or landline
19:40:09  (there were payphones, but they took around 5 minutes to calculate the cost of a call to the UK, and then quoted an amount so large it'd have been really awkward to pay using coins)
19:42:28  OK, ais523 has to hear my terrible idea now because it'll either help me forget about it, or reassure me that I'm not the only one suffering
19:42:44  elliott_: you have found your own Feather :)
19:43:16  ais523: a simple POSIX-alike where everything is run in ring 0 with @-style techniques; memory access requires checking that it's owned by the process
19:43:34  enforced how?
19:43:41  a ring 0 process could trivially change the perms
19:43:48  I /think/ it would end up more efficient than traditional implementations, because a branch per RAM access is cheaper than the syscall overhead
19:43:49  oh, statically
19:44:02  ais523: yep; although I was also considering if hardware virtualisation stuff could do it
19:44:03  you verify that the program is itself doing access checks on itself
19:44:05  since that's ubiquitous nowadays
19:44:08  and don't run it if it doesn't
19:44:13  that feels strangely evil
19:44:18  ais523: well, I was just going to make a C compiler do it
19:44:24  and have it be trusted
19:44:29  but checking the binary would be viable, too
19:44:32  yes, but what it does to the poor binary is beautifully ridiculous
19:44:47  it'd be the age of lawful programs
19:44:56  don't do anything without checking it's legal first, even though they /could/
19:45:01  ais523: oh, and if the compiler is trusted that lets it optimise out certain checks
19:45:09  indeed
19:45:18  e.g. a = malloc(...); if (a) { ... *a ... } -- you don't need to check a afterwards
19:45:21  in the block
19:45:23  that sounds like a recipe for exploiting compiler bugs
19:45:28  ais523: yes, indeed
19:45:35  ais523: compiler bugs can already lead to exploits, though
19:45:42  if a daemon running as root is miscompiled
19:45:44  again, indeed
19:46:04  probably less likely to be exploitable on average, but it's still a qualititative difference
19:46:14  anyway, I'm tempted to do this because it sounds easier than @, and would be a neat proof-of-concept that some of its low-level details do increase efficiency
19:46:36  hmm, I remember the paper that found that if a processor got even a single multiplication wrong, it would be possible to crack some sort of encryption (I forget what) done on it
19:46:36  and ofc with @ the risk for compiler bugs is reduced since it's not based on "checks" for safety, but safety-by-design using the object capability model and the type system
19:46:42  heh, neat
19:46:43  brb
19:46:44  There is no statement of there ever being any male Sheikah since the true gender of Sheik is debated by many fans.
19:46:47  assuming you can get it to encrypt arbitrary text for you, or something like that
19:46:50  s/fans/slash fiction writers/
19:47:14  kallisti: I think it's mostly an issue of semantics
19:47:21 -!- zzo38 has quit (Quit: zzo38).
19:47:43  this reminds me of the argument over Metroid Prime's gender (he, she, it are all viable options with plausible arguments makeable for them; plot-wise, it doesn't matter in the least)
19:47:55  the thing about Sheik though
19:47:59  is that Sheik is Zelda
19:48:00  and, by extension, Dark Samus'
19:48:13  and it doesn't explicitly mention anything about Sheik actually being male
19:48:14  so
19:48:18  kallisti: I'd be very surprised if that prevented people writing Sheik/Zelda slashfic
19:48:19  I would just kind of assume
19:48:32  that Sheik is a female, like Zelda, since they're the same person
19:48:37  Sheik was deliberately made with a male 3D model
19:48:46  but that was to keep the Sheik=Zelda thing secret from the player until right at the end of the game
19:48:48  sure MAGICAL GENDER CHANGING is possible but... not mentioned so not canon.
19:49:11  I think the most plausible argument is that Zelda is just very good at disguising herself, even if it includes cross-dressing
19:49:25  basically I think some people just want Sheik to have a penis.
19:49:39 * kallisti nods.
19:50:21  or like, they played the game thinking Sheik was a male and then when it was revealed they.... resisted changing their mind or something?
19:50:38  perhaps
19:51:29  though you could argue that there may be magic involved, since sheik has different eye color (red, like a Sheikah)
19:51:41  maybe Zelda just has some awesome contacts though.
19:51:50  you know what's fun? speculation about video game characters.
19:51:54  so fun.
19:55:17  kallisti, magic being involved is uncontroversial.
19:55:51  Conservation of volume is presumably still conserved under normal circumstances, no matter how many bandages you use.
19:56:14 -!- calamari has quit (Quit: Leaving).
20:01:27  back; disappointed not to see "biarb" from ais523
20:02:10  kallisti: I find it odd to posit that magic is used for changing eye-colour but to consider it unreasonable to posit that magic was used to change a far more drastic change in bodily structure (note: I have never played a Zelda game for long)
20:02:26  ofc, this is unrelated to the question of gender
20:03:41  does anyone know much about AMD-V / Intel VT-x?
20:12:43  elliott_: in Zelda games, magic exists but mostly only has a few defined effects
20:12:53  ais523: is changing eye-colour one of them?
20:12:56  no
20:13:07  but Zelda seems capable of unusual magical abilities
20:13:16  then my point stands :P
20:13:22  so who knows what magic she can do
20:13:32  I'm wondering if she was just using coloured contact lenses, though
20:14:37  thing it's hard to find information on: whether you can do hardware virtualisation in ring 0
20:14:42  as in, the code being virtualised runs in ring 0
20:15:30  ah, yes
20:15:34  that's what hardware virtualisation is for, it seems
20:20:29  ais523: hmm, I think what I'm doing is something like Xen, but where each program is an OS
20:20:40  and runs without a kernel
20:21:16  this sounds like decent practice for @
20:21:55  ais523: yes, the only problem is that (a) I don't have a machine with the virtualisation stuff I need (b) it's literally all about low-level hardware details :)
20:23:01  elliott_: I'm not sure if I should advise you to put @ off, or complete it now before you end up getting a job and not having time for that sort of large project
20:23:29  ais523: clearly the only solution is to have someone pay me to work on @
20:23:51  actually, I should write all but one line of @ while it's still in my head, and then write the last line whenever I need a Ph.D. handy :D
20:24:42  elliott_: you can actually get a PhD entirely on work you've already done
20:24:49  just, you're unlikely to get funded in that situation
20:25:03  heh
20:25:17  I think the main problem is that I'd have to write a book justifying @
20:25:23  actually, I've probably already done that in here
20:25:59  the main problem is finding all the previous work on mildly related things
20:26:07  to show how a) you were inspired by it, and b) it's different from what you're doing
20:26:33  ais523: I'm kind of already doing that by digging up everything related I can find to take inspiration from it :P
20:26:46  elliott_: keep a record of it, then
20:26:53  that's the boring part :(
20:26:53  citation details, at least
20:27:02  but I probably should at least have a bookmark folder or something
20:27:06  nah, less boring doing it at the time when it's easy, then later when it takes a lot longer
20:27:07  since I keep losing things
20:27:14  ais523: s/then/than/, presumably
20:27:17  err, yes
20:27:22  grabbing citation details is quick and easy
20:27:33  formatting them for consistency is the boring part, but that can easily be done much later
20:28:06  ais523: ooh, I know, I'll just do @ now, and then my Ph.D. can be /naming/ it
20:28:22  lots of graphs and statistics on the emotional response to various potential names
20:28:22  hahahaha
20:28:33  then it'd, umm, be a PhD in marketing
20:28:45  which would be a bizarre thing for you to have
20:28:58  ais523: no, I'd, er, develop a New Kind of Name Generation Algorithm
20:29:04  that only works on @, for some reason
20:29:28  elliott_: spambot-based naming?
20:29:39  perfect @ name generator algorithm that only works on @: get_current_os_name()
20:31:02  but it only works on @ /after it's named/
20:31:13  ais523: it's not @ until it's named!
20:31:38  wow, will this conversation look weird once @ /is/ named and we search-and-replace the logs
20:33:08 -!- GreaseMonkey has joined.
20:33:39  ais523: ooh, now i really hope Gregor does tha
20:33:39  t
20:33:53  and clog's owners too?
20:34:09  ais523: clog will probably turn to rust before then
20:34:22  but the logs will probably be backed up
20:34:24  also, can IRC bots rust?
20:34:40  if any IRC bot can, clog can
20:35:28  it'll just eventually clog up
20:35:33  /kick oerjan
20:36:33  how rude
20:37:06  @ elliott_ You can't rewrite history!
20:37:19  My name is indeed @ elliott_.
20:37:21  @ ais523 I'm just going to start Twitter-addressing everybody.
20:37:24  I changed it after the completion of @ to honour it.
20:37:38  shachaf: that's not twitter-addressing, you need to omit the space, and also replace @ with an at sign
20:37:52  elliott_: With a what?
20:38:06  I don't know if I have it on my keyboard; you should type it so I can copy it.
20:38:33  ＠
20:39:07  shachaf: \@
20:39:13  (thankfully, the regexp will take escapes into account)
20:39:54  You could've picked a less common character...
20:41:14  shachaf:
20:41:15  [elliott@dinky esoteric]$ fgrep '\@' ????-??-??.txt | wc -l
20:41:15  26
20:41:50  I mean, less common than '@'.
20:42:01  `run fgrep '\@' ????-??-??.txt | wc -l
20:42:04  fgrep: ????-??-??.txt: No such file or directory \ 0
20:42:08  shachaf: @ is the only thing that's right for it
20:42:09  wait, I need to change the directory
20:42:11  everything else looks wrong
20:42:13  `run fgrep '\@' logs/????-??-??.txt | wc -l
20:42:16  fgrep: logs/????-??-??.txt: No such file or directory \ 0
20:42:20  `run fgrep '\@' /var/irclogs/_esoteric/????-??-??.txt | wc -l
20:42:20  `ls
20:42:25  aha, that's where it is?
20:42:39  31
20:42:44  bin \ canary \ karma \ lib \ paste \ quotes \ share \ wisdom
20:42:59  `ls -F
20:43:01  bin/ \ canary \ karma \ lib/ \ paste/ \ quotes \ share/ \ wisdom/
20:43:48  `? shachaf
20:43:50  shachaf? ¯\(°_o)/¯
20:43:56  NOOOOOOO
20:43:57  `help
20:43:58  Runs arbitrary code in GNU/Linux. Type "`", or "`run " for full shell commands. "`fetch " downloads files. Files saved to $PWD are persistent, and $PWD/bin is in $PATH. $PWD is a mercurial repository, "`revert " can be used to revert to a revision. See http://codu.org/projects/hackbot/fshg/
20:44:20  `run hg diff 1170 1171
20:44:24  1170: No such file or directory \ 1171: No such file or directory
20:44:28  `run hg diff -r 1170 -r 1171
20:44:31  diff -r 0d97b97d3636 -r 1cc5d9c44760 wisdom/shachaf \ --- a/wisdom/shachaf.Sat Nov 26 18:17:45 2011 +0000 \ +++ /dev/null.Thu Jan 01 00:00:00 1970 +0000 \ @@ -1,1 +0,0 @@ \ -shachaf mad
20:44:42  `run hg diff -r 1170 -r 1171 | patch
20:44:45  The next patch would delete the file shachaf, \ which does not exist!  Assume -R? [n]  \ Apply anyway? [n]  \ Skipping patch. \ 1 out of 1 hunk ignored
20:44:49  `run hg diff -r 1170 -r 1171 | patch -R
20:44:52  patching file shachaf
20:44:59  `ls wisdom
20:45:01  `run mv shachaf wisdom
20:45:02  ​? \ ais523 \ augur \ banach-tarski \ c \ cakeprophet \ category \ elliott \ everyone \ finland \ finns \ fizzie \ flower \ friendship \ functor \ fungot \ gregor \ hackego \ haskell \ ievan \ intercal \ itidus20 \ kallisti \ mad \ monad \ monads \ monoid \ monqy \ nooga \ oerjan \ oklopol \ phantom__hoover \ phantom_hoover \ php \ qdb \ qdbformat \ quine \ sgeo \ u \ vorpal \ welcome \ wiki \ you
20:45:03  No output.
20:45:11  `? shachaf
20:45:14  shachaf mad
20:45:21  Well.
20:45:33 * shachaf is flattered that you went to all that trouble.
20:45:34  `rm wisdom/shachaf
20:45:36  No output.
20:45:37  why not just re-add it by hand?
20:45:51  it'd probably have been simpler
20:45:56  `? banach-tarski
20:45:58  ​"Banach-Tarski" is an anagram of "Banach-Tarski Banach-Tarski".
20:46:07  oerjan added that
20:46:09  I cannot be blamed
20:46:12  `revert
20:46:13  Done.
20:46:14  it's a good one
20:46:31  elliott_: don't you need to revert 2? or does it just revert the last side-effecting command?
20:46:34  `? shachaf
20:46:36  shachaf mad
20:46:40  ah, the latter
20:46:43  ais523: only mutating commands commit
20:46:52  `? c
20:46:54  C is the language of��V�>WIד�.��Segmentation fault
20:46:54  elliott_, like `quote ?
20:47:03  Vorpal: not any more
20:47:09  `rm wisdom/shachaf
20:47:11  No output.
20:47:12  `hg commit
20:47:12  `revert
20:47:13  elliott_, oh? Why did you remove that feature?
20:47:15  abort: could not lock working directory of /hackenv: Read-only file system
20:47:19  `? you
20:47:22  Vorpal: because it'd mess up transactional hackego :)
20:47:22  you a haskell
20:47:26 * shachaf has no idea how to use hg.
20:47:29  Done.
20:47:41  `rm wisdom/shachaf
20:47:41  `? u
20:47:43  No output.
20:47:45  `revert
20:47:45  shachaf, stop it
20:47:47  Done.
20:47:56  You stop it!
20:47:56  u monad?
20:48:07  `cat bin/revert
20:48:09  cat: bin/revert: No such file or directory
20:48:13  How is HackEgo talking withotu commands?
20:48:13  `rm wisdom/shachaf
20:48:15  No output.
20:48:24  shachaf, at least two people want to keep it. Me and elliott. That means a majority of us three.
20:48:36  It's okay, he can have it deleted.
20:48:40  Vorpal: I have extra votes because I'm me.
20:48:53  elliott_, you just did that to annoy me. Good job :P
20:49:03  shachaf: but kallisti has extra votes because he's Bjorn
20:49:26  `help
20:49:28  Runs arbitrary code in GNU/Linux. Type "`", or "`run " for full shell commands. "`fetch " downloads files. Files saved to $PWD are persistent, and $PWD/bin is in $PATH. $PWD is a mercurial repository, "`revert " can be used to revert to a revision. See http://codu.org/projects/hackbot/fshg/
20:49:32  Vorpal: The only reason you wanted to keep it was that elliott_ wanted it.
20:49:39  elliott_: You should get rid of the _.
20:49:45  It's grating on the fingers, you know.
20:49:45  shachaf, come on. We two usually never agree on /anything/
20:49:58  Vorpal: Unless annoying a third party is at stake!
20:50:10  shachaf, not really no
20:50:27  shachaf: wait, you're annoying? I hadn't realised
20:50:35  X-D
20:50:41  Yes, shachaf is super annoy(ing|ed).
20:50:59  I hadn't either.
20:52:08   Yeah, I was buying cell-batteries the other day and the retailer wanted me to enter a facebook user and password so it could automatically insert a facebook comment that I had purchased batteries from them.
20:52:37  gah, my mind cannot comprehend the amount of stupidity in existence implied by that comment
20:52:44  (not from the author, he clearly couldn't either)
20:53:23  ais523: if it makes money, it's not stupidity
20:53:29  wow
20:53:40  elliott_: I'm not convinced it's stupid from the retailers' point of view either
20:53:55  but for it to be sensible from their point of view, implies a sufficient number of stupid people around that it actually makes a profit
20:54:59  ais523, it could be an experiment to find out if that is the case?
20:55:00  ais523: well, it's not necessarily stupid to prioritise not being bothered by a retailer over very minorly annoying some people, considering how much noise facebook has anyway
20:55:05  hopefully it is not the case
20:55:32  elliott_: it /is/ stupid to give a username and password that you probably use for everything to a random retailer, though
20:56:15  ais523: well, OK, but I'd rather blame (a) the username/password model to start with and (b) the lack of proper computer security education, although (b) is massively impaired by the fact that the current systems are unusable (see (a))
20:56:39  what model would be better than username/password, and also that people could be persuaded to use?
20:56:44  and there are situations where you have to give away your password; for instance, when trying to get my MacBook replaced, Apple demanded my password
20:56:53  which doesn't exactly educate people not to give their passwords away
20:57:11  elliott_: err, what? that seems like a bizarre thing for them to want
20:57:22  is that the login password to unlock the computer for the main user?
20:57:24  ais523: I tried notto think too much about it
20:57:29  and no, my Apple ID password
20:57:31  over the phone
20:57:35  ...
20:57:37  what
20:57:42  ah, OK, probably to verify that you're an actual customer of theirs
20:57:53  yes, something like that
20:57:58  a password to log in to the person at the other end of the phone is reasonable
20:58:07  no obvious reason why they should be restricted to computers
20:58:15  yes, but it's still giving your password to someone else, so it's hardly surprising that people aren't averse to doing that
20:58:20  other than salting/hashing being hard to do mentally
20:58:33  ais523, hardware certificates + password entered on the hardware certificate device use to sign a response code. That should be better than classical user/password. Major PITA for anything except bank transactions and other high security stuff
20:58:35  (actually, salting is easy)
20:58:49  a password existing for the purpose of giving to specific other people is reasonable to give to those people
20:58:55  ais523: anyway, I don't know which model is necessarily better than passwords, but things like OpenID are a start, even if they have a password at the base of it; public key crypto is also promising
20:59:32  elliott_, hardware certificates :P
20:59:42  Vorpal: a GPG key on a USB key integrated into your browser that asks for the passphrase when it's plugged in doesn't seem that bad to me
20:59:54  especially if the USB key doesn't expose the GPG key but just signs things as it
20:59:58  elliott_, I was thinking along the lines of smartcard but sure
21:00:11  elliott_: in that case, you can put a fingerprint reader on the USB device
21:00:25  ais523: everything i've read suggests fingerprint readers are completely insecure
21:00:27  probably saves time over password memorisation, and you still have two factors
21:00:42  elliott_: right, the problem is that they're too easily brute-forced
21:00:47  fingerprint readers are insecure yeah
21:00:49  ais523: and copiable, I believe?
21:00:53  but someone would probably notice brute-forcing in a shop
21:00:58  you want an iris scanner!
21:01:12  ais523: true, but nobody wants an authentication mechanism that only works in shops
21:01:18  ah, OK
21:01:31  all biometrics are copiable for the same reason that all videos are copiable
21:01:38  they have to be translated to data at some point, and you can copy that
21:01:51  ais523, fingerprints are easy to copy however iirc
21:01:51  ais523: in a shop, something like logging in on a smartphone and passing an authentication to post a status update wirelessly seems like the most reasonable way to do something like this (not that it /should/ be done)
21:01:53  and just use it directly rather than scanning it in
21:02:12  that way, the shop can't do anything at all apart from post one status update right then
21:02:15  elliott_: hmm, perhaps the shop should have a QR code, and the smartphone scans that
21:02:23  it probably knows the Facebook username/password already
21:02:25  ais523, like if you have a laser printer + some stuff that is easy to get your hands on for not a lot of money you can copy a fingerprint
21:02:30  heh; I gather that QR codes aren't gaining traction because they're really ugly,t hough
21:02:33  *, though
21:02:34  forgot the exact details
21:02:37  you'd probably have to accept an authorisation popup first time
21:02:42  elliott_: also, because they seem to have too much computational power
21:02:47  really?
21:02:49  I heard a rumour of QR code trojans a while back
21:02:50  elliott_, they are gaining traction here in Sweden, slowly.
21:02:57  but I have no idea what level of social engineering that required to work
21:03:06  Vorpal: they might be a growing fad, but that doesn't mean they're gaining long-term traction
21:03:09  ais523: wow
21:03:12  well sure
21:03:19  ais523: they only encode a small bit of textual data to my knowledge, so that's surprising
21:03:24  it might have been as simple as "QR code points at website containing malicious software download"
21:03:55  probably was, actually, and the media went crazy about it as usual
21:04:06  definitely the former
21:04:11  qr codes just encode data
21:04:28  don't listen to mainstream media wrt viruses. They are bloody useless.
21:05:04  Vorpal: s/viruses/computers/
21:05:16  s/computers/anything/ (per Knoll's Law)
21:05:25  *Law of Media Accuracy
21:05:41  Vorpal: well, this was tech media
21:05:45  but they can be just as bad sometimes
21:05:51  they just sound more like they know what they were doing
21:06:21  elliott_, true
21:06:30  ais523, heh
21:06:36  ais523: that's why you stick to respected institutions like The Register!
21:06:53  elliott_: at least the Register is reasonably consistently biased
21:07:02  (it has a strong pro-Paris-Hiltion bias)
21:07:02  heh
21:07:18  wat
21:07:37 -!- oerjan has quit (Quit: Good night).
21:07:43  Vorpal: do you know anything about x86 hardware virtualisation
21:08:20  elliott_, yes
21:08:25  elliott_, not much though
21:08:31  elliott_, why?
21:08:52  Vorpal: well, I know it can be used to virtualise code running in ring 0
21:08:59  presumably it can be used to remap memory accesses by that code?
21:08:59  yes and?
21:09:04  hm
21:09:06  I know it can remap memory accesses by virtualised stuff in ring-3
21:09:33  elliott_, no idea. Probably depends on if it is hardware stuff, in which case you need an IOMMU, which is not yet common on consumer (read: non-server) hardware
21:09:43  hmm
21:09:45  as in DMA or such
21:09:45  http://en.wikipedia.org/wiki/Extended_Page_Table
21:09:48  I think this will work
21:09:55  "A separate set of page tables (the EPT tables) translate from guest-physical addresses to the host-physical addresses that are used to access memory."
21:10:03  elliott_, sure
21:10:07  elliott_, what about it?
21:10:11  and why do you want it
21:10:13  well, it'll let me remap the memory
21:10:17  of ring-0 stuff being virtualised
21:10:26  why are you virtualizing ring-0 stuff?
21:10:28  only Nehalem-onwards, but oh well
21:10:32  and looks like AMD implements the same thing
21:10:42  elliott_, you want to use kvm. Because AMD and Intel use different models for it
21:10:45  kvm abstracts that
21:10:49  Vorpal: no, I don't
21:10:55  oh?
21:11:16  it's an OS ide I've had that is both significantly easier to do than @, and demonstrates/tests some of its low-level performance benefits
21:11:17  *idea
21:11:32  basically, it's a POSIX-ish kernel that runs everything in ring 0 that virtualises every process
21:11:36  (for security)
21:11:44  heh
21:11:49  but yeah
21:11:53  my desktop can run that
21:12:03  elliott_, I think virtualbox has it as a "nested page table" thingy
21:12:05  hmm, although, I'm not sure how expensive ring 0 stuff talking to the virtualisation code is
21:12:22  elliott_, without that feature you just handle those page tables in you hypervisor software
21:12:24  if it's as expensive as a syscall, then my adventage is lost
21:12:39  elliott_, might be more expensive
21:12:39  so if anyone knows the answer... let me know
21:12:47  wouldn't surprise me
21:12:55  Vorpal: well, not much more expensive, at least, or Xen would be really slow
21:13:03  Vorpal: ISTR that running Linux under Xen is actually faster than running it natively
21:13:05  in certain scenarios
21:13:13  heh
21:13:24  I really want to see a citation on that
21:13:36  don't have one, I'm afraid
21:13:51  elliott_, anyway linux has special code to run better as a guest
21:13:52  Vorpal: anyway, even if virtualisation isn't possible the OS idea will still work... I'll just go back to my original idea of building the checks into the compiled code
21:14:21  because I think a branch on every memory access will pay itself off by the vastly reduced syscall overhead
21:16:11  ais523: OK, your new job (changed from discouraging me to write this) is to make sure I continue writing it after I get a bootloader
21:16:18  I really like writing bootloaders
21:16:28  haha
21:17:37  one of the main problems with @ is that it's not at all clear where it actually starts running
21:18:36  presumably you have some outside-@ bootloader that just sets up for bits of disk to be swapped into memory so they can start running again
21:20:32  ais523: and then jumps where?
21:20:52  to where the IP was the last time stuff got flushed to disk
21:20:53 -!- sebbu2 has changed nick to sebbu.
21:20:55  which should be very recent
21:21:15  in fact, it's going to be in the disk-flushing routines, which makes life rather easier
21:21:19  ais523: there's more than one IP, and there's more machine state than just RAM + registers
21:21:40  ais523: anyway, that doesn't work, because you need to set up more than that
21:21:44  timers, interrupts, and so on
21:21:47  elliott_: well, it jumps to stuff to restore that, then to where stuff was
21:21:56  the problem may be difficult, but it's easy to describe
21:21:56  (the IP of the disk-flushing stuff won't be stored)
21:22:06  (because it's run from a timer, and doesn't block anything)
21:22:13  (well, it does blockt hings, but not /everything/)
21:22:18  (it just causes a switch to another thread, mostly)
21:22:39  ais523: right, but where is that stuff? :)
21:22:52  for proper orthogonal persistence, it has to be persisted
21:23:28  alternatively, you could decide that some of it can't meaningfully be persisted (network driver state, for instance), in which case it'd be the driver's job to initialise it
21:23:44  basically, look at what Linux does on hibernate/unhibernate; it's basically that
21:23:57  I know that much, but Linux unhibernate is too specialised
21:24:03  because it assumes all the structures and the like are the same
21:24:09   because I think a branch on every memory access will pay itself off by the vastly reduced syscall overhead <-- depends on how IO-bound the code is.
21:24:11  @ can't assume that, it needs to have a completely generic bootloader
21:24:19  for IO you traditionally need lots of syscalls
21:24:21  Vorpal: I disagree
21:24:36  Vorpal: even CPU-bound tasks that do, e.g. concurrency of any sort, have to do communication
21:24:49  elliott_: it's not the bootloader's job to do most of the unhibernate
21:25:02  ais523: then whose job /is/ it, and how does the bootloader get to it?
21:25:22  also, wrt the other conversation, concurrency primitives don't touch the kernel except when there's contention, nowadays
21:25:31  elliott_, I'm considering the sort of heavy task I personally do a lot of. Which is stuff like optimising non-linear equations over thousands of data points for best fit.
21:25:37  elliott_: it's the init scripts' job, IIRC
21:25:39   also, wrt the other conversation, concurrency primitives don't touch the kernel except when there's contention, nowadays
21:25:41  pure number crunching
21:25:44  ais523: yes, because syscalls are slow
21:25:45  I can't remember if they're run by init directly during unhibernate, or some other way
21:25:49  and so removing syscall overhead sped things up
21:25:50  elliott_: exactly
21:26:04  but the point is, there isn't currently syscall overhead in that because it was removed a different way
21:26:16  elliott_, avoiding checks on memory access by being smart in the compiler will certainly pay off for some tasks though
21:26:17  Vorpal: "tight loop of number crunching with a data set that fits into RAM and absolutely no concurrency whatsoever" is rare and becoming even rarer as multicore gets more and more ubiquitous
21:26:25  so the issue is about how syscall-bound the program is
21:26:37  Vorpal: for a job like that, anyway, a /scheduler/ is a bottleneck
21:26:39  Web of Lies gives you a really good idea of how syscall-bound a program is
21:26:46  and if you're not calling any syscalls, why not run it directly on bare hardware?
21:26:48  as it has no timing effect on anything but syscalls
21:26:52  elliott_, well yes.
21:26:53  so OSes are already working against tasks like that
21:27:00  nobody will care if they work against them a bit more
21:27:13  elliott_: I've actually been wondering how @'s scheduler works, or if it has one, and if it doesn't have one what it does instead
21:27:25   and if you're not calling any syscalls, why not run it directly on bare hardware? <-- because it is less convenient when debugging :P
21:27:55  and usually you do some syscalls even in those cases. Load initial data set, write out final result
21:28:00  at the very least
21:28:04  indeed
21:28:15  so reducing sysccall overhead helps there
21:28:18  so that is like 3 syscalls minimum, one read, one write, one exit
21:28:22  probably a few more
21:28:26  probably not as much as you lose, but it's likely that you do a bunch of read and writes
21:28:33  because a lot of datasets can't fit into RAM
21:28:40  at least, the datasets where you /really/ care about performance do
21:28:51  because a small change in constant factors has a large change on the end result due to the size of the data
21:28:56  elliott_, the thing about those syscalls in this case is that they are one-time. They don't really vary that much between data sets of different sizes either. It is still a single read and a single write
21:29:02  Vorpal: see above
21:29:02  ais523: that's something I've been thinking about a lot recently
21:29:10  ais523: it definitely does have a scheduler
21:29:21  elliott_, if your data set can't fit into your ram things are going to be horribly slow anyway
21:29:23 -!- Patashu has joined.
21:29:39  elliott_, even without considering IO overhead disks are way slower than ram
21:29:47  Vorpal: Most data sets don't fit in RAM.
21:29:50  Vorpal: not really, if you can do it in chunks of 8 gigs or so at a time...
21:29:56  At least, most data sets you give a shit about.
21:29:59  assuming there's not too much interdependency
21:30:05  pikhq_, indeed.
21:30:19  ais523: and, problematically, it needs a /really good/ scheduler
21:30:36  In a land where heavy computing jobs go through a terabyte drive in a day, everything is IO bound.
21:30:37  elliott_: with the caps to do anything
21:30:39  anyway my /personal/ use case here is mostly stuff that fits into ram. Like 5-6 GB of data.
21:30:41  ais523: and it needs to handle millions of tasks (= processes/threads) running
21:30:54  ais523: oh, it's not a problem for such low-level code to have all permissions
21:30:58  well, OK
21:31:00  although it doesn't need quite that many
21:31:22  elliott_: it needs to be able to stick the IP in the middle of arbitrary code
21:31:28  ais523: basically I need tasks to be as cheap as lightweight threads in GHC(/Erlang/whatever)
21:31:57  there's no real problem with a million-task scheduler with current technology; the issue is more adapting for various patterns of blocked/nonblocked
21:31:59  yeah erlang have really light weight processes
21:32:08  iirc ~300 words per thread + stack
21:32:08  Vorpal: not as lightweight as GHC, to my knowledge
21:32:21  at least speed-wise
21:32:22  for handling operations like sleep, etc, you aren't going to do better than n log n (possible with a heap-like priority queue)
21:32:28  is that going to be good enough?
21:32:30  elliott_, quite possible
21:32:32  ais523: well, the problem is more memory usage
21:32:48  ais523: I need some subdivision of the massive heap to do effective GC
21:32:52  just throw in more RAM. that is where computers are heading anyway
21:32:57  ais523: I want to be able to do copying, incremental GC
21:33:04  elliott_: is the scheduler doing that?
21:33:05  ais523: tasks seem a reasonable unit to do that at
21:33:07  elliott_, can't you have per-process heap for stuff not likely to be sent between threads?
21:33:07  ais523: no
21:33:10  ais523: but the point is, how do you divide it?
21:33:16  there's no concept of "process"
21:33:19  Vorpal: there's no concept of "process"
21:33:20  elliott_, per task then
21:33:24  Vorpal: that's the problem
21:33:31  I assume there is a concept of "unlikely to be sent to a different task", but it'd be quite hard to determine
21:33:42  elliott_, or per unit that can be stopped independently from other units for GC tasks
21:33:43  my memory management strategy involved 2 mebioctets + 4 kibioctets per pool
21:33:47  in pages
21:33:50  I suppose you could just use the generational GC approach, treating all data as that until it's actually sent to another task
21:33:51  that's not viable for millions of threads
21:34:01  hm
21:34:03  2 megs * 1 million = 2 terabytes
21:34:05  whoopsie!
21:34:12  elliott_, do you need to split on whole pages?
21:34:13  (and this has to be in /RAM/, not on disk)
21:34:14  elliott_: why not? just use a system where the address space is way bigger than the actual amount of memory
21:34:20  ais523: in /pages/
21:34:23  although, x64 probably doesn't meet that requirement
21:34:25  that map to /physical RAM/
21:34:27  elliott_, afaik erlang does not use a whole page per process
21:34:32  elliott_: oh, physical, ouch
21:34:39  Vorpal: well, that was my memory management trick, to make an allocation take 2 cycles
21:34:43  and no branches
21:34:51  for allocations of less than 4 kilobytes
21:34:53  elliott_, ... that might not be a good tradeoff
21:34:54  (= almost all of them)
21:35:06  Vorpal: it's an excellent tradeoff, it just means I can't have a pool per task
21:35:18  which brings up the question, how /do/ I divide pools?
21:35:18  hm
21:35:31  note: two CPUs cannot allocate from the same pool at once
21:35:34  and I don't want to use locks
21:35:43  so I can't just say "oh, divide it between 100 tasks"
21:35:56  because those tasks will have vastly reduced concurrency
21:36:00  a pool per cpu?
21:36:18  or core or whatever
21:36:25  Vorpal: a CPU isn't really anything; this has to be of the real heap, which is of ~a terabyte in size
21:36:27  not RAM itself
21:36:31  because GC is done on the real heap
21:36:41  elliott_, I don't see any reason why all the allocations of a single task have to come from the same pool
21:36:44  also
21:36:46  if it is moved to a different CPU
21:36:49  that would tie tasks to CPUs permanently
21:36:53  hm wait
21:36:55  cache lines
21:37:01  okay I see reasons
21:37:04  Vorpal: it's nothing to do with cache lines, but that's not what I said
21:37:13  the reason two CPUs can't use a pool is because there's a really nasty race condition
21:37:20  elliott_, you don't want to share a page between two CPUs unless it is actually shared data :P
21:37:22  that could only be solved with a lock or slower CAS shit
21:37:27  which defeats my 2 cycle allocation strategy
21:37:38  elliott_, when allocating yes. But not when /using/ said pages
21:37:48  that's what I said
21:37:50  if you allocated offset 40-57 in the page
21:37:51  but
21:37:55  you can use that freely
21:37:56  a program can allocate from its pool at any time
21:38:01  and a program only uses one pool at a time
21:38:05  (it's expanded when necessary)
21:38:08  (and is the unit of GC)
21:38:17  elliott_, I suggest tying the pool to the cpu instead.
21:38:21  but whatever
21:38:22  elliott_: hmm, how common are allocations? and how common would they be if they were very cheap?
21:38:24  Vorpal: I just told you that doesn't work at all
21:38:28  Vorpal: _there is no CPU_
21:38:32  elliott_, I don't think your GC design is viable.
21:38:35  it is
21:38:42  you just don't understand it
21:38:44  not with millions of tasks
21:38:49  because you keep making references to "CPUs" and other things that don't exist
21:38:55  also, hmm, how do you verify that a process doesn't access out-of-address-space when it's allocating memory dynamically
21:39:02  Vorpal: I never said I want a pool per task
21:39:04  elliott_, what the fuck do you execute the damn code on then?
21:39:05  that's what I'm trying to avoid right now
21:39:08  pink creepers?
21:39:14  Vorpal: lol, you're an idiot
21:39:23  Vorpal: you cannot make reference to CPU in the distribution of pools
21:39:32  elliott_: CPU affinity is only meaningful wrt per-CPU cache, AFAICT
21:39:36  elliott_: Then your memory model does not handle NUMA.
21:39:39  elliott_, why?
21:39:43  pikhq_: w h a t
21:39:45  and possibly, in the future, per-CPU RAM that isn't cache, but that's not standard yet
21:39:50  and yes pikhq_ has a point
21:39:59  however, I'm not convinced that per-CPU cache is unimportant here
21:39:59  Vorpal: I've decided explaining to you won't make you any less stupid, so I'm just going to answer ais523 instead
21:40:00  NUMA?
21:40:05   elliott_: hmm, how common are allocations? and how common would they be if they were very cheap?
21:40:07  Non-Uniform Memory Access.
21:40:09  ais523: exceedingly common
21:40:11  Phantom_Hoover, Non-uniform memory access
21:40:13  like core i7
21:40:19   also, hmm, how do you verify that a process doesn't access out-of-address-space when it's allocating memory dynamically
21:40:21  ais523: hm?
21:40:22  at least with dual cpus (not cores)
21:40:44  elliott_: say a process writes the equivalent of char* a = malloc(5); putc(a[7]);
21:40:54  Wherein each CPU has its own memory (but can access that of others, though more slowly)
21:40:57  hmm, that's not a huge problem, you could just insist on bounds checks everywhere
21:41:03  and I think that'd be enough
21:41:11  ais523: it can't, and bounds checks aren't necessary
21:41:18  pikhq_, I believe nehalem and after is that, rihght?
21:41:20  right*
21:41:22  elliott_: umm, I mean char[], not char*
21:41:24  ais523: the whole point of @ is that it doesn't run untrusted code
21:41:36  Vorpal: For Intel, yeah.
21:41:38  elliott_: I know; the question is, how do you determine whether such code is trustworthy
21:41:40  pikhq_, yeah
21:41:45  ais523: umm, the capability model? come on
21:41:48  and the answer, AFAICT, involves bounds checks, either runtime or statically
21:41:52  pikhq_, I believe amd have on-cpu MMUs too?
21:41:55  ais523: if you can prove to the @lang compiler that you never access out of bounds, bounds checks can be omitted
21:41:56  pikhq_, since even longer
21:41:59  ais523: for instance, length-carrying vectors
21:42:02  didn't k8 introduce that?
21:42:05  elliott_: yep, indeed
21:42:09  that's what I meant by static bounds checks
21:42:09  there's no "checks" there, your program just doesn't type if it accesses things wrong
21:42:10  Yeah, AMD's been doing NUMA a long freaking time.
21:42:15  ais523: I typed that before you said it
21:42:16  I thought it was a problem, just realised it wasn't one
21:42:23  pikhq_, and elliott_ has no clue about it...
21:42:28  Vorpal: lol
21:42:39  8 years now.
21:42:42  Vorpal: stop being a fucking moron and assuming that because you don't understand how @'s GC works, I know nothing about NUMA
21:42:45  AMD Dragostea Din Tei?
21:42:55  copumpkin: lol
21:43:12  elliott_, well pikhq_ had a point about you needing to use a local pool if possible or suffer bad speed.
21:44:00  that's irrelevant, since processes point to the abstract memory space.
21:44:13  if necessary, the pool can be loaded into the RAM of the CPU it's running on.
21:44:17  hm
21:44:31  elliott_, but you said there was no such thing as a CPU :P
21:44:50  Vorpal: Insofar as virtual memory is concerned, there is no meaningful notion of "CPU".
21:44:56  Vorpal: because you kept trying to define pool allocation in terms of CPUs after I repeatedly told you that made no sense
21:45:01  pikhq_, well obviously
21:45:02  As the virtual memory space would be identical with 1 CPU or 1000.
21:45:03  summary of elliott_'s arguments: CPUs are not a program-visible concept, in the cases where they're relevant that's handled by the memory allocator or pager
21:45:12  ais523: not exactly
21:45:18  you can't tie pools to CPUs because
21:45:24  (a) that'd mean tasks would be permanently tied to one CPU
21:45:24  elliott_, I'm suggesting that as a way to avoid having as many pools *and avoid the race conditions*
21:45:32  (b) what the hell do you do for tasks on disk?
21:45:33  elliott_, it means a completely different GC model though
21:45:35  you GC disk too
21:45:37  in units of pools
21:45:45  it makes no sense at all
21:45:59  Vorpal: well thanks, that's a really unuseful suggestion and also not what you actually said?
21:46:10   (a) that'd mean tasks would be permanently tied to one CPU <-- no, the pool of the current cpu would be transparently used when allocating.
21:46:17  and you could access any pool
21:46:25  for stuff you already allocated
21:46:33   (b) what the hell do you do for tasks on disk? <-- hm?
21:46:34  my GC model works perfectly fine with a decent way to allocate tasks, which you have so far not offered a single idea for, so I'm going to assume that you just don't understand the model, since you haven't asked for it or demonstrated any knowledge of it
21:47:11   Vorpal: well thanks, that's a really unuseful suggestion and also not what you actually said? <-- it was exactly what I said
21:47:20  elliott_: I vote you have a certain number of pools (based on RAM or disk size?), and when a thread starts it gets assigned the least used pool.
21:47:28  "pool per cpu durrr" != " elliott_, I'm suggesting that as a way to avoid having as many pools *and avoid the race conditions*"
21:47:48  elliott_, then you misunderstood me
21:47:55  sigh
21:47:58  this is pointless
21:48:02  hmm, what's the reason for having more than one pool? I know it's a good one, but it'd probably make this clearer to have it spelt out
21:48:06  elliott_, pikhq_'s idea makes sense
21:48:12  elliott_, but you are likely going to ignore it
21:48:16  ais523: you can't do copying GC on a terabyte if you don't have another terabyte
21:48:34  Vorpal: i'm working on a response to him because he's not an insufferable shithead; you, on the other hand, are going on /ignore
21:48:42  fun fact: I can't type infinitely fast
21:49:00  ais523: Incremental GC.
21:49:09  pikhq_: that's not viable, since GC of a pool pauses every task using that pool, and two tasks on the same pool cannot ever be run at the same time (= on different SMP CPUs)
21:49:13  elliott_: hmm, OK; what's stopping you having half the memory as one pool, and the other half as the place it gets copied to? other than the wastefulness?
21:49:20  ais523: and you can hardly pause the entire OS while you GC an entire terabyte, either
21:49:24  that'd take an awfully long time
21:49:31  ah, right
21:49:42  ais523: well, that's wasteful, but even then, doing a single atomic copying-GC on a terabyte pool -- on disk! -- would be insanely slow
21:49:55  so, hmm, are you planning to go on a stop-and-copy architecture specifically? or some other sort of copying GC?
21:50:14  ais523: well, it'll be generational (pools will contain multiple generations, I think)
21:50:30  (and past a certain generation, they'll be dissociated from a pool entirely)
21:50:42  (so that really long-lived objects just sort of hang around on disk and are basically never touched by the GC)
21:50:59  elliott_: That sounds like the limits of having multiple tasks per pool.
21:51:13  pikhq_: hm?
21:51:14  And you already agreed that one pool per task isn't viable, so.
21:51:19  ais523: stop-and-copy seems the most viable strategy
21:51:32  ais523: although, it would be nice if you could have a tight loop with allocation that was guaranteed to never pause for long at all
21:51:51  ais523: so you could write things that really have to be realtimeish, e.g. small-buffer video/audio code
21:51:59  without having to avoid allocations (nearly impossible in @lang)
21:52:06  What you need is a scheme for assigning task to pool, and so I gave you a simple one and claimed it was impractical because, basically, it would involve multiple tasks in a pool.
21:52:42  Though: if you want to limit the stoppage, there's no reason for the pool assignment for a task to be *permanent*.
21:52:51  pikhq_, I gave him another scheme for the same thing and he claimed it was impractical too. This discussion is being pretty pointless
21:52:52  pikhq_: well, you need to assign them with some intelligence
21:53:12  pikhq_: e.g., a cluster of 10 threads that "work together" in some sense to serve some larger task that started them, are probably OK to put on the same pool
21:53:22  That's a fairly 'mundane' scheduling problem.
21:53:31  because they're "related", and so it doesn't matter if they don't run at the same time SMPly
21:53:41  You get similar issues with trying to stick related tasks in the same NUMA group.
21:53:45  mm
21:54:02  It's not exactly an *easy* problem, but it's at least a rather well-understood one, and not at all @-specific.
21:54:31  pikhq_: I wonder how fast I could get a concurrent allocator
21:54:47  I basically need an atomic form of {*y += n; x = *y;}
21:54:58  where x is a register and y is a memory location
21:56:18  Definitely CMPXCHG.
21:56:35  (x86's primary atomic instruction)
21:56:36  pikhq_, that might need retrying if it fails
21:56:46  isn't there an atomic increment?
21:56:52  Not sure if it returns the old value
21:56:55  pikhq_: I have a feeling it's not going to be quite as fast as MOV + ADD
21:56:57  or any value even
21:57:31  elliott_: It is if there's no contention.
21:57:58  hmm, I'm not sure how cmpxchg would work, because you need to do an increment, not just a swap with some predetermined value
21:58:02  so it'll need some lock layering on top
21:58:48  pikhq_, I presume elliott_ is actually ignoring me. But lock xadd might do the job
21:59:26  unless I misunderstood the docs
21:59:35  which definitely won't be as fast
21:59:44  elliott_: What you do is blithly fetch the value, increment it, and attempt the cmpxchg. If it fails, you restart.
21:59:45  elliott_, oh lock xadd will be
21:59:54  oh, ah
21:59:56  The thing is, you pass cmpxchg what the old value should be.
22:00:03  how cheap is cmpxchg with no contention?
22:00:11  pikhq_, I'm /pretty/ sure lock xadd will do this even cheaper.
22:00:12  pikhq_: oh, that's a problem
22:00:20  presumably, you branch to determine whether the cmpxchg worked or not?
22:00:21  pikhq_, you might want to inform elliott_
22:00:29  the whole idea with my 2-cycle allocator is to avoid branches
22:00:57  Having a single branch that'll be predicted correctly almost always is not going to be notably worse. :)
22:01:09  oh looks like pikhq_ is ignoring as well
22:01:13  pikhq_: it is when it's something as common as this :P
22:01:24  pikhq_: and I'm not so sure it'll always be predicted correctly
22:01:38  ^say elliott I know the solution to this. There is a better atomic instruction. I told you above.
22:01:50  ^help
22:01:50  ^ ; ^def   ; ^show [command]; lang=bf/ul, code=text/str:N; ^str 0-9 get/set/add [text]; ^style [style]; ^bool
22:01:50  allocation is really common, and probably follows very predictable patterns in @lang's generated code, so I would not be surprised if the contention rate was high for a pool
22:01:52  Vorpal: Is xadd atomic?
22:01:59  pikhq_, with the lock prefix
22:02:20  pikhq_, but you need that for anything to be atomic
22:02:34  Hmm, sure enough, that works better.
22:02:53  hmm, xadd? this looks like the right thing
22:02:53  pikhq_, don't tell elliott_ since he doesn't want to know what I have to say :P
22:03:21  the question is how much slower LOCK XADD is compared to ADD + MOV in a uniprocessor situation
22:03:34  probably not noticeably, but it'd be interesting to know exactly
22:03:53  you can trivially specialise the code on the fly
22:03:55  In a uniprocessor situation, it's "ADD + MOV + MOV".
22:04:03  and uniprocessors are kind of outdated anyway
22:04:36  pikhq_, isn't it xchg,add even?
22:04:39  pikhq_: hmm, I don't think xadd can do memory
22:04:42  0F C1/r XADD r/m32, r32 Exchange r32 and r/m32; load sum into r/m32.
22:04:46  oh, hmm, yes it can
22:04:55  If it couldn't it would be worthless.
22:04:58  right :)
22:05:15  "It's atomic because it accesses a per-thread resource!"
22:05:17  the fact that xadd has sparse google results is worrying, though
22:05:27  is it one of those CISCy instructions that nobody generates any more and so has really badly optimised microcode? :p
22:05:48  No, it's one of the basic atomic primitives.
22:06:14  http://www.xadd.net/ Why did someone buy a domain for this
22:06:16  what do you do when a pool is full anyway
22:06:31  Collect.
22:06:51  pikhq_, yeah but you need to reset the counter to be able to use this simple allocation stratergy
22:06:54  or even move data
22:06:59  Vorpal: accesses to it will go into the 4k barrier page space and thus cause a page fault
22:07:05  pikhq_, this simple scheme can't handle skipping holes after all
22:07:19  Vorpal: Moving GCs are not magic.
22:07:20  Vorpal: nor do modern GCs
22:07:27  everyone uses a pointer-bumping allocator these days
22:07:32  heh
22:07:33  they just do it with a branch
22:07:34  really?
22:07:39  interesting
22:07:42  Yeah, basically everyone but Boehm.
22:07:46  Vorpal: yes, which is why you allocate a new pool and compact as you move it there
22:07:51  And Boehm only doesn't because it needs to work with C.
22:07:52  by copying contiguously.
22:07:53  I thought the glibc allocator for example was extent based
22:07:56   http://www.xadd.net/ Why did someone buy a domain for this <-- I thought you were in favour of foldl.whatever?
22:08:00  Vorpal: glibc: "a garbage collector"
22:08:01  Vorpal: That's *not* a GC.
22:08:06  elliott_, well true, not the case
22:08:09  ais523: those were cute, this is just silly
22:08:27  also, TLDs are getting increasingly obnoxious to remember
22:08:34  if they were used for their original purposes, there wouldn't be a problem
22:08:41  but there isn't really a TLD for "novelty website"
22:08:46  heh
22:08:56  ais523: hey, I have a .net that's actually an internet service provider!
22:08:57  The TLD system is just very poorly suited to the modern 'net.
22:09:04  elliott_: wow
22:09:17  arguably something like Freenode can plausibly correctly be .net too
22:09:26  pikhq_, the ccTLDs kind of work still. Except for US.
22:09:34  ais523: admittedly, the service we provide is mainly a minecraft server
22:09:40  but that's an internet service that we're providing
22:09:42  haha
22:09:47  heh
22:09:48  and web hosts are considered ISPs, so I don't see why that shouldn't be
22:09:58  elliott_, they are!?
22:10:13  Vorpal: In a sense. They provide a service on the Internet.
22:10:13  http://en.wikipedia.org/wiki/Internet_service_provider
22:10:19  the technical meaning differs from the colloquial meaning
22:10:24  (which only means "an actual internet link provider")
22:10:29  pikhq_, well, that is not what people /usually/ mean by ISP
22:10:33  elliott_, quite
22:10:36  bah, that page has the wrong definition
22:10:36  Or "a provider of Internet service".
22:10:42  prescriptivists :)
22:10:46  but .net was originally meant for the technical meaning
22:10:51  not just the colloquial one
22:10:52  I know that
22:10:57  oh wait
22:11:01  misread you
22:11:16   but .net was originally meant for the technical meaning <-- that would include pretty much everything then
22:11:17  elliott_: I think nowadays, I conclude that "internet service provider" and "ISP" actually have somewhat different meanings
22:11:40  Vorpal: not really; a corporation not in the business of selling internet services wouldn't
22:11:56  a web server isn't really "providing" anything
22:12:01  IMO
22:12:31  hm x68/x87 really doesn't have that many general purpose instructions. It just have a lot of variants of each one. It *does* have a lot of floating point and SIMD instructions though.
22:12:39  x68
22:12:39  x68?
22:12:45  err x86
22:12:45  typo
22:12:48  the only algol 68 coprocessor
22:12:51  obviously :P
22:12:56  elliott_: well, m68k is an arch
22:13:31  it is still CISC obviously due to that nearly everything can do memory accesses.
22:13:41  pikhq_: I don't suppose there's a LOCK XADD AND ALSO JUMP HERE IF IT EXCEEDS A CERTAIN VALUE :)
22:13:49  or, to phrase that another way:
22:13:52  how do I do atomic allocations of >4k?
22:14:14  pikhq_: ouch, there's a nasty race condition even with atomic <4k allocations
22:14:29  what if you have exactly 1 byte left in the pool, and two processes do 4k allocations at once?
22:14:34  one of them gets an address /beyond/ the barrier page
22:14:38  elliott_, I doubt there is. Possibly you could optimise if you know the allocation is larger/smaller than the size and do a slow path when you don't know.
22:14:41  that might even be in some other task's valid memory
22:14:47  and it can access it freely
22:14:47  hm
22:14:55 -!- Slereah has quit (Ping timeout: 244 seconds).
22:15:14  if you restrict pools to non-concurrent access you can solve that easily, by checking the pool pointer for overflow on context switch
22:15:22  oh, hmm
22:15:24  that's actually a general flaw
22:15:31  if you allocate twice without actually accessing the RAM
22:15:33 -!- Slereah_ has joined.
22:15:40  I suppose the solution is to just ban allocating before you access a previous allocation
22:15:46  not a big deal
22:16:08 * ais523 works out how to mark a question where one of the requirements is "efficiently"
22:16:10  elliott_, you could allocate numtask*largest barrier memory?
22:16:25  luckily, this is easier than the mergesort issue, because I can populate the caches with invalid data and then see if the algo blindly trusts it
22:16:27  Vorpal: huh?
22:16:32  if it doesn't, it's not efficient
22:16:41  ais523, if applicable look for complexity?
22:16:57  Vorpal: I thought of that first, and it is possibly applicable
22:17:25  the average-case performance is probably the same, but I could make the worst-case performance for the most obvious unwanted method blow up
22:17:30  but that's probably harder to write
22:17:45  (the same in terms of complexity, that is, not in overall performance)
22:17:49  elliott_, well if you can allocate at most n bytes if you have n*tasks_in_pool barrier memory it would be safe
22:17:59  assuming you access all before next allocation
22:18:08  Vorpal: no, you would have to allocate n*tasks
22:18:20  so = millions
22:18:24  because you can have
22:18:26  hm okay
22:18:34  {2M pool page}, {4k barrier page}, {2M pool page of another task entirely}
22:18:40  if you're 1 byte from the end of the first pool page
22:18:43  increment 4k, increment 4k
22:18:46  you're in someone else's memory
22:18:51  and it won't page fault when you access it
22:19:18 -!- kmc has joined.
22:19:18  elliott_, is that 2M huge page?
22:19:24  yes
22:19:33  elliott_, x86 can do unaligned ones?
22:19:36  I'm surprised
22:19:40  well, probably not
22:19:42  it was a simplified example
22:19:49  I would expect them to have to be aligned on 2 MB boundaries
22:20:04  even if I used a 2M barrier page
22:20:07  which means your scheme would kind of not work very well, though beautiful
22:20:12  you just need to increase the number of allocations
22:20:17  well yeah
22:20:18  to show that it's still a problem
22:20:21  Vorpal: well, it'll work fine
22:20:25  2 megs is about as big as 4 megs
22:20:32  heh
22:20:34  I only need to wait a few years for everybody's memory to double
22:21:24  elliott_, I don't think I will be getting 32 GB in a hurry :P
22:22:14  actually, one problem with this allocator style is that you have to calloc pools
22:22:27  or, hmm, perhaps not
22:23:03  elliott_: you definitely don't want processes reading privileged data from leftover pools, so you have to statically ensure it's not used before alloc, or else zero it on the alloc
22:23:16  elliott_, hm why would the code be allowed to read uninitialised memory? After all isn't the system generating the machine code from @lang?
22:23:25  which could ensure that didn't happen
22:23:33  ais523: @lang programs aren't allowed to just arbitrarily read from their pool, ofc
22:23:38  elliott_: right, indeed
22:23:42  elliott_, then it shouldn't be a problem
22:23:46  they're only allowed to interpret it in ways they're allowed to
22:23:46  ais523: a Haskell compiler won't spit out code looking like that, so an @lang compiler won't either
22:23:51  Vorpal: the problem was:
22:23:59  the GC has to look at the bytes in the heap to determine object structure
22:24:06  hm
22:24:07  right
22:24:11  how does it know it's looking at a real, fully-allocated object, instead of just the garbage at the end?
22:24:14  but I think it's easy
22:24:14  elliott_: bleh, no typed GC?
22:24:21  ais523: of course it's "typed"...
22:24:23  but I think it's easy
22:24:25  because the GC is only called on overflow
22:24:30  elliott_, typed allocations.
22:24:31  so you /know/ the last object wasn't fully allocated
22:24:42  Vorpal: yes, of course; how do you think that solves the problem?
22:25:35  well the GC could see how far we allocated. And we might write a bit in a header of the allocation to indicate that we have allocated it but not yet used it
22:25:45  hm, probably rather awkward way of doing it
22:26:17  Vorpal: doesn't help
22:26:24  hm true
22:26:27  Vorpal: what happens when another CPU overflows the pool after incrementing pointer
22:26:30  but before setting the bit
22:26:39  as in
22:26:42  before _this_ cpu sets the bit
22:26:47  oh good point
22:26:47  these are all problems caused by concurrent pool access
22:26:58  why don't CPUs have transactional memory ffs
22:27:11  elliott_, iirc powerpc does
22:27:13  !
22:27:24  that would surprise me
22:27:28  oh wait, it was load-store barriers
22:27:30  nevermind
22:27:41  still, they are considerably more powerful iirc
22:28:26  i'm tempted to just forbid concurrent access again and think of another way to do things
22:28:50  hm
22:28:58  elliott_, concurrent access has another problem anyway
22:29:06  maybe I could use small pools by default without the fancy barrier stuff and expand that on first gc
22:29:15  and that is that of cache line ownership moving between CPUs
22:29:35  Vorpal: well. that will happen anyway
22:29:36  cache lines are iirc about 64 bytes or such
22:29:51  Vorpal: since another task on the same pool will run on another CPU while other tasks on the same pool are stopped
22:30:06  I suppose I could tie pools to CPUs but that sounds like a pain on e.g. 4-core systems
22:30:11  where you just don't have many CPUs
22:30:22  (where by "CPU" i mean "core")
22:30:25  elliott_, yes but you don't want that to happen for no good reason. Sure it will happen when rescheduling. And when sharing a lock for something (and you will need locks for some stuff I bet, hardware access at the very least)
22:30:39  (like a lock for "accessing ethernet card memory mapped registers")
22:30:42   Vorpal: what happens when another CPU overflows the pool after incrementing pointer
22:30:42   but before setting the bit
22:30:42   as in
22:30:42   before _this_ cpu sets the bit
22:30:44  i thought of a solution to this
22:30:50  oh?
22:31:00  i could make the GC wait until every process on the pool allocates again
22:31:04  and thus causes another pagefault
22:31:06  heh
22:31:12  which would ensure that no partial allocations have been done
22:32:12  elliott_, actually no you can't. Segfault is a *nix term. The x86 term is general protection fault or page fault depending on what exactly you are doing
22:32:16  ;P
22:32:26  i never said segfault?
22:32:34  huh I misread
22:32:36  :(
22:32:39  twice
22:32:46  I did a double take on seeing "segfault"
22:32:48  yet it wasn't there
22:32:51  oh well
22:33:31  elliott_, anyway wouldn't that go into the next page anyway?
22:33:37  hmm, even if i don't use this fancy barrier page strategy
22:33:51  I don't see any way to avoid allocating one page per task if I'm going the "really lightweight, no concurrent access model"
22:33:55  elliott_, do you plan to have much of a stack btw?
22:34:02  or hmm yes i could
22:34:10  because allocation on a task local stack would be /way/ cheaper.
22:34:51  of course that means at least two pages anyway... with the barrier page
22:36:38 -!- ais523 has quit (Remote host closed the connection).
22:37:02  Vorpal: no it wouldn't
22:37:05  stack allocation is pointer-bumping
22:38:27  pikhq_: hmm, xadd (/without/ lock) will probably be slower than mov + add, right? thinking about a non-concurrent access scenario
22:41:44  Vorpal: stacks are basically thought to be faster because people use simpler allocators with them
22:41:52  namely, pointer-bumping
22:43:06 -!- Jafet has quit (Quit: Leaving.).
22:43:30  back
22:43:42   stack allocation is pointer-bumping <-- yes
22:43:50  elliott_, but you still need to detect stack overflow
22:44:06  yes. so it is more expensive than my allocator
22:44:30  so i don't see how a stack would help
22:44:32  elliott_, what is your GC root btw?
22:44:48  Vorpal: the continuation
22:44:51  ah
22:45:50  stack allocators have one advantage: no need to GC. Because returning just bumps the pointer the other way
22:46:01  elliott_: xadd without lock is not much more than mov+add.
22:46:08  pikhq_: right. but it is more :)
22:46:22  Vorpal: they also require a traditional notion of stack
22:46:29  well yes
22:47:29  I have to say that the rep prefix of x86 is quite curious
22:48:34  useful for boot sector golfing
22:48:39  sure
22:48:43  but not much else
22:49:05  it is truly a CISC left over
22:49:29  so is x86
22:50:57 -!- derrik has quit (Quit: nights).
22:51:28  elliott_, touche
22:53:39  "Any VEX-encoded instruction with a LOCK prefix preceding VEX will #UD." <-- it doesn't say anything else under "VEX and the LOCK prefix". Like it would be useful to say if it works in the other order.
22:53:43  fuck you intel
22:54:00  hm it doesn't
22:54:08  because VEX isn't a prefix anyway
22:54:14  so why no LOCK on VEX?
23:03:51  hmm, looks like my tasks have to take up at least 144 bytes
23:04:01  elliott_, impressive
23:04:10  _at least_ :P
23:04:17  that's just the number of registers on x86-64, including IP
23:04:28  ofc if i don't use all registers for computation then they can take less...
23:04:41  or if certain registers are always used as like scratch space before being put into memory
23:04:46  then I can avoid storing them
23:04:52  elliott_, "A newly spawned Erlang process uses 309 words of memory in the non-SMP emulator without HiPE support. (SMP support and HiPE support will both add to this size.)"
23:04:59  so far you beat erlang
23:05:10  hmm, why do they need that much?
23:05:14  2.4 kilobytes is quite a lot
23:05:17  don't know
23:05:35  elliott_, it may include the default stack
23:05:36  perhaps
23:05:41  gah, i just thought of a response to something ais said, but he's left
23:05:54  use @tell?
23:06:09  that doesn't have immediate payoff :) but fine!
23:06:18  elliott_, "The size includes 233 words for the heap area (which includes the stack). The garbage collector will increase the heap as needed."
23:06:22  elliott_, that is why it is so large
23:06:33  @tell ais523  there's no real problem with a million-task scheduler with current technology; the issue is more adapting for various patterns of blocked/nonblocked
23:06:33  Consider it noted.
23:07:08  @tell ais523 in @, there's no such thing as a "blocked task"; a blocked task's data (not necessarily including its pool data, just the pointer) is moved into whatever's being /blocked on/
23:07:09  Consider it noted.
23:07:16  @tell ais523 and then removed from the scheduler's list of tasks
23:07:17  Consider it noted.
23:07:18  elliott_, anyway so the real overhead is 76 words
23:07:35  @tell ais523 that is, sockets know which threads are blocked on them, and resume those threads when they receive data or whatever
23:07:35  Consider it noted.
23:07:37  elliott_, which is far smaller
23:07:42  Vorpal: right, 608 bytes
23:08:03  elliott_, 304 on 32-bit
23:08:27  irrelevant
23:08:32  oh?
23:08:36  32-bit systems still exist
23:08:41  not for long
23:08:51  not in the pc market anyway
23:08:54  well yeah
23:09:08  elliott_, but globally most processors are likely 16-bit or 8-bit still
23:09:14  yeah, but they don't run erlang
23:09:17  true
23:09:25  also, i think 32-bit is the most common nowadays actually, because of ARM in the embedded space
23:09:26  and things like that
23:09:34  elliott_, still erlang can run on vxworks. Which opens up a whole embedded market
23:09:37  full CPUs in embedded stuff is becomming more common
23:09:49  unfortunately I don't think @ will work very well on 32-bit
23:09:53  maybe in the embedded space
23:09:58  heh
23:10:04  not kidding
23:10:14  what kind of disks do vxworks devices have :P
23:10:16  elliott_, 64-bit in embedded is rare. it is mostly consoles and PCs that are 64-bit
23:11:03  elliott_, hm... the ones I used at university had either flash with some weird connector or plain CF cards.
23:11:08  i mean, size
23:11:23  elliott_, well I have a CF card somewhere. Let me find a ruler ;)
23:11:32  elliott_, anyway it was a dev system. Kind of high end.
23:11:43  like x86, pentium, 500 MHz
23:11:50  or something absurdly overpowered like that
23:11:57  1 or 2 GB flash probably
23:12:08  basically, a 32-bit @ system can address 4 gigabytes, total, including disk
23:12:10  elliott_, but it varies depending on applications :P
23:12:16  elliott_, ouch
23:12:25  so it works fine in like most embedded scenarios i guess
23:12:28  but not on a desktop
23:12:42  i can think of workarounds, but they're all sloooooooow
23:12:52  anyway there is large file system support on other systems. Obviously not on @
23:13:07  elliott_, wait, x86-64 systems actually have 48 bits virtual address space right?
23:13:10  Vorpal: well it doesn't really work because of the uniform address space
23:13:18  Vorpal: Currently.
23:13:22  pikhq_, indeed
23:13:23  basically you'd need to store all pointers as large filesystem addresses
23:13:30  dereferencing those would be slow as shit
23:13:30  That's a limit of the MMU, not the ISA.
23:13:44  that means 35.18 TB
23:14:12  Vorpal: and? :P
23:14:24  elliott_, that is kind of close to modern storage size.
23:15:00  Vorpal: when single machines start addressing 35 terabytes, AMD and Intel will start releasing CPUs with MMUs that can address 64 bits.
23:15:04  or 54 bits or whatever :P
23:15:06  elliott_: Better/worse: you could use segmentation.
23:15:21  elliott_, I have like slightly more than 1/17th of that in disks in my computer
23:15:29  pikhq_: I don't see how that would work; pointers would have to store the segment they're in
23:15:35  Vorpal: moore's law doesn't work _that_ fast.
23:15:36  elliott_, I meant for disks, Not for ram
23:15:48  elliott_, since you do uniform address space
23:15:53  the disk size matters for you
23:15:57  Did I contradict that?
23:16:02  nope
23:16:21  elliott_, I was just finishing my line of thought before reading further. I use blocking IO
23:16:26  Vorpal: I'm pretty sure that the MMU bit width will increase when we're living in the space age and people have 35 terabytes of disk.
23:16:26  in my brain
23:16:36  elliott_: Segments map to physical space. Recent x86 has 36-bit address space. :P
23:16:38  Even if it doesn't, 35 terabytes is a lot of storage.
23:16:54  I doubt you, as a person, will need >35 terabytes of personal storage before @ takes over the world.
23:17:05  pikhq_: that's still tiny :P
23:17:24  elliott_: Also, alternately you *could* make it so that far pointer dereferencing is the expensive operation.
23:17:31  Which nets you a potentially 46-bit address space.
23:17:40  This would be an *insane* hack, though.
23:18:07  elliott_, 35 TB is ~1501 blueray disc
23:18:25  Vorpal: I will consider your concerns if you personally buy 1501 blu-ray discs.
23:18:39  nah I'll torrent them
23:18:49  elliott_, I wonder how much traffic I download in a year
23:18:51  Vorpal: If you use sane encodings, chop a order of magnitude off that.
23:18:55  (x264 is awesome shit)
23:18:56  err how much traffic downstream I mean
23:19:09  pikhq_, who said movies
23:19:18 * elliott_ attempts to find a blank blu-ray on Amazon.
23:19:20  pikhq_, games on blueray happens nowdays
23:19:31  pikhq_, I downloaded a 25 GB game at one point
23:19:33  Vorpal: Technically, yes. They're generally empty.
23:19:44  pikhq_, nope. Rage was 25 GB download
23:19:50  Due to targetting DVD platforms as well, and nobody likes multiple disks.
23:19:52  or 24 or so
23:20:09  Jesus, what did they include, the genomes of all sequenced species?
23:20:18  pikhq_, really bad texture quality
23:20:22  pikhq_, the install size was 27 GB iirc
23:20:49  pikhq_, iirc they said the raw data of the game they had on their development servers was over 1 TB
23:21:15  pikhq_, and Rage is a really bad game. Boring, uninspired story, mediocre gameplay
23:21:22  and quite uneven texture quality
23:21:32  everything from state of the art to something utterly jagged.
23:21:43 -!- kmc has quit (Quit: Leaving).
23:22:19  "Higher res is better. Derp, scale!"?
23:22:39  pikhq_, it feels like a tech demo for the engine to tell the truth :P
23:23:26  pikhq_, the skydome was truly impressive though
23:24:58  pikhq_, anyway there are many games that come on dual layer DVDs these days
23:25:19  iirc witcher 2 was about 7 GB large download. Somewhat more when installed on disk
23:25:35  and that game has high texture quality and good gameplay and everything :P
23:26:02  hm system requirements is 16 GB free disk
23:27:17  pikhq_, speaking of which... that is a rare game these days. Witcher 2 is completely DRM free.
23:27:39  (except when bought from steam iirc)
23:29:56  Steam has DRM?
23:30:07  elliott_, where have you been?
23:30:12  Not using Steam.
23:30:18  right
23:30:39  That sucks.
23:30:42  elliott_, steam has DRM that is fairly easy to work around by replacing a few dll files
23:30:57  Easier to pirate, no?
23:31:00  replacement ones are kind of well developed already
23:31:05  elliott_, pretty much.
23:31:46  not all steam games use the drm of course
23:32:10  generally you know when a game refuses to run without steam running, then it uses the drm
23:32:13  elliott_, like skyrim does
23:32:22  (note: easy to work around :P)
23:32:25  Gross.
23:32:51  elliott_, yes we are talking about steam indeed :P
23:33:07  Why do people like Steam again?
23:33:49  elliott_, because it was first and it is convenient. And there are far worse DRM examples.
23:34:13  Vorpal: But I've actually seen people rejoice when games they already own became available on Steam.
23:34:18  elliott_, and because it has all the games (pretty much). Which it does because it is popular with the users.
23:34:25  elliott_, really?
23:34:27  why?
23:34:35  elliott_, is it for the steam achievements?
23:34:44  maybe...
23:34:47  Vorpal: The only reasons I've heard are because of the "social" features of it and the achievements and crap. Which I find completely incomprehensible.
23:35:08  I mean, I'd prefer to just ask people if they want a game rather than cyberstalking them for the purpose.
23:35:11  elliott_, oh yeah you can use it for easy invites to friends for multiplayer games iirc.
23:35:14  which is kind of nice
23:35:16  And achievements are a scourge.
23:35:31  Achievements are what happen when you can't think of a decent in-game way to reward players for doing things.
23:35:37  So you decide to annoy them instead
23:35:40  s/$/./
23:35:48  elliott_, it is easier to click a friend's name in a list than to ask them to provide a port number and so on
23:36:23 * elliott_ is used to playing multiplayer games with decent lobby systems.
23:36:33  Admittedly skipping the lobby entirely would be preferable.
23:36:35   Achievements are what happen when you can't think of a decent in-game way to reward players for doing things. <-- I like stuff that are kind of like achievements but are for the current game only and have an in game effect
23:36:50  So, not achievements.
23:37:24  elliott_, like, in witcher 2, if you stay within a protective spell bubble during a part of the introduction of chapter 1 you get a +5 or something bonus to something
23:37:29  stuff like that
23:37:57  or following a certain path doing a certain mission within certain parameters grants you 100 extra carrying capacity
23:38:41  elliott_, anyway you might want to reward a player who went through the entire game without killing any enemy, using sneaking and such instead.
23:38:46  how would you do that?
23:38:53  achievement is the usual answer
23:38:57  Well, badges at the end are OK
23:39:04  hm
23:39:06  Achievements that happen mid-game not so much
23:39:10  I mean
23:39:10  true
23:39:13  If it's just for things like easter eggs sure
23:39:17  But if it's like "100 kills" fuck that
23:40:04  elliott_, what about stuff like "navigated down a steep hill without taking fall damage". Yogscast suggested that should be an achievement in skyrim (it isn't, it has the boring type of achievements, mostly "did questline x")
23:40:25  of course it would be hard to measure that
23:40:36 -!- pumpkin has joined.
23:40:57  elliott_, but yes, I seen pretty bad achievements. And I seen less bad ones.
23:41:03  The achievement comes from managing that in the first place :P
23:41:08  heh
23:41:16  If it's obvious that you've done something hard, you don't need to yell at players that they've done it
23:41:22  elliott_, but you want something you can brag about on your steam profile!
23:41:25  ;P
23:42:25  pikhq_: Do you know much about hardware virtualisation
23:43:02  elliott_, anyway I remember reading about some game where the devs put in achievements for stuff they thought were so improbable that they were for all practical purposes impossible. Just to see how long it took for players to figure out a way to do them.
23:43:09 -!- Jafet has joined.
23:43:19  all were done within a year iirc
23:43:23  forgot which game it was
23:43:28  heh
23:43:37 -!- copumpkin has quit (Ping timeout: 248 seconds).
23:44:39  elliott_, anyway gamersgate is a better online store than steam really. No silly client crap.
23:46:09  elliott_, another one I heard was good but which I never used myself is desura. Mostly focused on indie stuff iirc
23:46:21  elliott_, so there are alternatives to steam that are less shitty
23:46:25  just not as popular
23:46:34  Desura has a client thing.
23:46:50  elliott_, yes, but a less obnoxious one
23:46:52  by far
23:47:06  What ever happened to just delivering binaries.
23:47:35  elliott_, that is gamersgate. They let you download a downloader program basically. And then that downloads the binary.
23:47:37  so almost :P
23:47:51  I guess a downloader makes sense on windows because I doubt IE can resume a broken download
23:47:57  Nobody uses IE
23:48:02  But Firefox sucks at resuming downloads
23:48:05  Probably Chrome too
23:48:05  that too
23:48:14  elliott_, so that is why they use a downloader
23:48:18  I use wget for such stuff
23:48:23  wget -c works wonders
23:49:54 * Phantom_Hoover → sleep
23:49:55 -!- Phantom_Hoover has quit (Quit: Leaving).
23:50:04  heh gamersgate is a Swedish company? Didn't know that
23:50:25 -!- nooga has quit (Ping timeout: 244 seconds).
23:51:39  Why does scan.co.uk have to be so unusable.
23:53:28  elliott_: Not much.
23:53:32  pikhq_: Damn
23:53:56  pikhq_: So you wouldn't know how expensive something in ring 0 calling on the hypervisor would be?

2011-11-29:

00:02:28  Not really.
00:02:34  :'(
00:05:28  elliott_, benchmark it?
00:05:34  (okay that is a LOT of work I know)
00:06:09  elliott_, anyway I'm pretty sure hypervisor is more expensive than syscall. Or at least as expensive.
00:06:28  anything else would greatly surprise me
00:10:56  :(
00:22:50 -!- kmc has joined.
00:32:36 -!- kmc has quit (Quit: Leaving).
00:49:25  hmm
01:00:49 -!- elliott has joined.
01:00:49 -!- elliott_ has quit (Read error: Connection reset by peer).
01:07:56 -!- SimonRC has quit (Ping timeout: 260 seconds).
01:09:27 -!- SimonRC has joined.
01:27:42  "The operating system was "inspired by the literary heritage of Dante Alighieri (particularly the Divine Comedy)"? What kind of sense does that make? I challenge anybody to tell me what it was about Dante's philosophy, politics, writing style or anything else that inspired this operating system."
01:38:24  hi.
01:42:33 -!- Vorpal has quit (Ping timeout: 248 seconds).
01:49:23  x86 rings are not unlike the circles of hell
01:59:45 -!- kmc has joined.
02:04:18  elliott: hlep
02:04:28  Jafet: :D
02:04:31  quintopia: one cannot be hlepped
02:04:38  sad day
02:06:44  quintopia: but go on
02:07:49  sam is crouched behind a desk with two guns pointed at him. he has a tiny revolver with four bullets. he has two guns pointed at him. his girlfriend is tied up with an enemy pointing another gun at her head. save him without a deus ex machina. she can die.
02:08:05  but she can't die by brains blowing cuz she has to say stuff before she dies
02:09:44  Uhhh
02:09:52  Can we see sam's character sheet first?
02:10:32  quintopia: shoot the girlfriend, use element of surprise to escape
02:10:57  not brains blowing, shoot the heart instead or w/e
02:11:01  he wouldn't shoot his girlfriend...
02:11:05  or would he...
02:11:07  hmmm
02:11:07 -!- kmc has quit (Remote host closed the connection).
02:11:19  quintopia: that wasn't one of the requirements
02:11:27  it's his girlfriend!!!!!
02:11:30  She asks him to shoot her, he shoots her, and escapes
02:11:36  There, all criteria met
02:11:45  quintopia: won't be his girlfriend if he dies, will she?
02:11:45 -!- kmc has joined.
02:11:46  she's pregnant. why would she ask him to shoot her?
02:11:50  so he's basically fucked on the girlfriend front, either way
02:12:08  yes, but he i don't want him to do anything out of character
02:12:25  quintopia: shoot a precisely-aimed bullet at the girlfriend so that her womb bursts open; grab baby and escape
02:12:26  Sam hypnotizes the enemies
02:12:27  100% realistic
02:12:35  happens all the time
02:12:53  If you're Tarantino, shoot her in the side of the head.
02:12:53  happened to me the other week, someone shot me and my baby escaped
02:12:54  she's only like 2 mos preggo
02:12:58  no baby yet just fetus
02:13:08  quintopia: sam believes that life begins at conception.
02:13:10  walking fetus!
02:13:48  quintopia: so what is the uh
02:13:49  context here
02:13:59  a novel i'm writing?
02:14:22  It starts in media res
02:14:50  quintopia: i suggest not getting sam in that situation
02:15:03  Novels with guns are shitty anyways
02:15:28  quintopia: yeah they should be using uh
02:15:31  bows 'n arrows instead
02:15:36  lol
02:15:42  archery II: this time it's personal
02:15:46  but it's more exciting to have him in that situation
02:15:55  but i have an idea
02:16:02 * quintopia thinks text adventure
02:16:04  >look
02:16:09  Cloaks 'n daggers
02:16:12  quintopia: have him start just like
02:16:13  dancing
02:16:21  he just starts dancing
02:16:23  with the people with guns
02:16:31  and he does a jig over to his girlfriend
02:16:33  and kicks her out the window
02:16:35  and then jumps after her
02:16:38  but there's a trampoline underneath
02:16:38  YES
02:16:39  so he bounces back up
02:16:41  and shoots the bad guys
02:16:43  lul
02:16:45  best
02:17:07  i forgot about that patio outside!
02:17:38  he pulls the deskk drawer out
02:17:51  throws its contents at the guy with the girlfriend
02:18:15  but the other dudes will just shoot him...
02:18:37  Desks are bulletproof, man.
02:18:55  ah
02:19:33  this is a *big* desk
02:20:13 -!- pikhq has joined.
02:20:23 -!- pikhq_ has quit (Ping timeout: 252 seconds).
02:20:39  so then he jumps over the desk and runs at him with the other dudes shooting at him. but he shields himself with the desk drawer.
02:20:46  yep. it could happen.
02:21:09  Hollywood in writing
02:21:44  i know...its all so cliche :P
02:22:00  Actually that sounds more like a John Woo thing
02:22:19  so then he gets shot some when they figure out to shoot low...
02:22:46  and then...
02:22:50  rocks fall, everyone dies
02:22:57  Sam looks behind him and sees a fire extinguisher. He grabs it and uses it to lay down a smoke screen
02:23:05  oh shit good idea
02:24:12  Not knowing where he is, they start shooting at random and hit each other
02:24:15  The end
02:25:13  So, you have two days to finish the novel?
02:28:17  this novel is terrible
02:31:45  it doesn't matter if it is terrible
02:31:47  it is fun
03:11:14  hmm
03:11:39  they really need to do an fps crossed with secondlife
03:12:03  not specifically secondlife but something like that
03:26:36 -!- elliott has quit (Quit: Leaving).
03:27:05 -!- elliott has joined.
03:27:11  Gregor: Have you used Emscripten?
03:38:46 -!- kmc has quit (Quit: Leaving).
03:40:00 -!- zzo38 has joined.
03:46:17 -!- Nisstyre has quit (Ping timeout: 248 seconds).
03:56:00 -!- kmc has joined.
04:01:34  hey
04:04:13  hi
04:05:53  11 PM is an interesting time to wake up.
04:06:40  yes
04:13:04  @tell Vorpal so in one of the earlier missions of Magicka there's this dude that freaks out about goblins and says a bunch of hilarious gibberish; is any of that Swedish?
04:13:05  Consider it noted.
04:21:24  Goblins?
04:21:47  I don't seem to recall any goblins
04:22:23  ..
04:22:28  you lie.
04:23:04  ..?
04:23:22  I didn't say no goblins were ever mentioned, just that I don't remember goblins being mentioned
04:23:35  We are talking about Puella Magi Madoka Magica, right?
04:23:37  What does it mean "Note: this does not yield a monad unless the argument monad is commutative. "
04:24:40  zzo38: in the context of what?
04:24:51  Sgeo: yes of course.
04:24:52  that thing
04:24:54  that I don't know of.
04:25:24  kallisti: ListT
04:25:55  hi #esoteric
04:26:05  good job sgeo
04:26:08  zzo38, that's just the standard implementation that has that issue, I think?
04:26:16  Although I don't understand it either.
04:26:20  monqy, hm?
04:26:39  pretty sure magicka is a game kallisti plays
04:26:43  Oh
04:27:00  monqy smart
04:29:01  Sgeo: does ListT mean anything other than the "standard implementation"?
04:29:19  monqy, "ListT done right"?
04:32:04  how should I know
04:33:28 -!- Sgeo has left ("Leaving").
04:33:31 -!- Sgeo has joined.
04:33:40  There is no need to keep referencing/commenting on the past to validate the present and future as a sort of musical emollient for the masses. All artists plunder from everywhere, so did Simon and Garfunkel but to put Fleetfoxes into a neat box of "our generations Simon and Garfunkel" is really missing the point in a major way and quite insulting to FFs. I'm listening carefully to music 30 years, and I've never heard anyt
04:33:47  youtube comments are great.
04:34:11  yes
04:40:18 -!- augur has quit (Remote host closed the connection).
04:40:37  coppro: Ping
04:41:49  Is there another kind of ListT?
04:42:36  http://www.haskell.org/haskellwiki/Amb :-)
04:43:14  elliott: pong
04:43:31  help I'm too dead to read this code.
04:43:34  coppro: I thought I had a question, but then I realised that clang almost certainly does -m32, so I lost my question
04:44:12  well, I can read cut
04:44:18  it clears the state list.
04:44:18  oh
04:44:21 * kallisti smart.
04:48:32 -!- pumpkin has changed nick to copumpkin.
04:52:04  Fleet Foxes are so authentic, they use reverb effect on every track
04:52:45  Jafet: true authenticity comes from having reverb right in your SOUL
04:54:10  copumpkin, are you a dual?
04:58:20  Jafet: elliott: lolwhat
05:07:49  elliott, kallisti: UPDATE
05:08:25  cool
05:12:47 -!- MDude has changed nick to MSleep.
05:20:33 -!- augur has joined.
05:34:32 -!- TheJimmyJames1 has joined.
05:47:14 -!- kmc has quit (Quit: Leaving).
05:52:50  What should a function be called:   BarrierT f b m t -> BarrierT (f, b -> BarrierT f b m t) (BarrierT f b m t) m t     and      Barrier f b t -> Barrier (f, b -> Barrier f b t) (Barrier f b t) t
05:55:30 -!- kmc has joined.
06:02:26 -!- copumpkin has quit (Quit: Computer has gone to sleep.).
06:05:59 -!- Jafet has quit (Quit: Leaving.).
06:09:33  @tell Gregor pachelbel
06:09:33  Consider it noted.
06:11:59 -!- Vorpal has joined.
06:14:37  Do you know what such functions and there inverse would be called? I don't know.
06:15:44 -!- TheJimmyJames1 has quit (Quit: Leaving.).
06:23:00  wtf my dns is broken
06:23:01  Vorpal: You have 1 new message. '/msg lambdabot @messages' to read it.
06:23:50  The DNS breaks sometimes in my computer, and then later it is fixed.
06:24:17  kallisti: I don't remember which part you refer to. But in general the voiced over dialogue is mostly made up language with some English and Swedish words thrown in.
06:24:30  brb going to restart my bouncer
06:24:38  it's dns is broken for most other networks
06:24:41  (wtf...)
06:24:46 -!- Vorpal has quit (Quit: ZNC - http://znc.sourceforge.net).
06:25:24 -!- Vorpal has joined.
06:25:57  actually it is routing to half the internet that is broken
06:27:10  wtf ping works but connecting does not?
06:27:16  and nor does traceroute
06:27:46 -!- Vorpal has quit (Client Quit).
06:28:22 -!- Vorpal has joined.
06:28:55  actually not that either. Everything works fine from my laptop...
06:29:15  I don't know??????
06:30:03 -!- kmc has quit (Quit: Leaving).
06:31:06  Do you have any suggestions of the names of the functions I have described?
06:35:03 -!- kmc has joined.
06:35:42 -!- Vorpal has quit (Quit: ZNC - http://znc.sourceforge.net).
06:36:17 -!- Vorpal has joined.
06:38:16 -!- TheJimmyJames has joined.
06:44:44 -!- oerjan has joined.
06:46:38  hi oerjan
06:47:50 -!- TheJimmyJames has quit (Read error: Operation timed out).
06:49:27 -!- TheJimmyJames has joined.
06:49:33  dammit why must the godel's letter comment feed be limited to 10 comments
06:49:59  goedel's letter. not goedel's last letter. not goedel's first letter
06:49:59  just
06:50:01  goedel's letter
06:50:14  *+lost
06:50:38  every time the two MrX and Pelotom trolls and counter-trolls post i lose messages and end up hunting around recent posts
06:57:03 -!- augur_ has joined.
06:57:54 -!- augur has quit (Ping timeout: 255 seconds).
06:58:18 -!- TheJimmyJames has quit (Read error: Connection reset by peer).
06:58:21 -!- elliott has quit (Ping timeout: 255 seconds).
06:59:06  Someone tried to answer my questions but seems as they did not understand this question. Did you even understand that?
07:03:00  Do any NSF music files use the track numbers to specify different variations (such as repeat vs non-repeat, equal temperament vs just intonation, etc) instead of another song?
07:05:58 -!- Jafet has joined.
07:06:02 -!- Jafet has quit (Changing host).
07:06:02 -!- Jafet has joined.
07:12:59 * oerjan braces for embarrasment by commenting on the issue on the blog again.
07:13:41  (as in "why don't you just do this" embarassment)
07:18:27  *+s
07:22:14 -!- kmc has quit (Quit: Leaving).
07:29:07 -!- zzo38 has quit (Remote host closed the connection).
07:35:50  hmmm
07:35:53  I need a new username for things.
07:36:05  bad_apple
07:36:15  oerjan: one must never be afraid of embarassment
07:36:22  O KAY
07:36:27  WE ARE ALL FOOLS
07:36:34  it is foolish to pretend you are not.
07:36:35  one should also learn to fly by flapping one's arms.
07:36:46  well, no...
07:37:08  kallisti: why not?  it's approximately as easy.
07:37:21  http://www.youtube.com/watch?v=_F9RJSPnf8A
07:37:23  because this is better.
07:41:45 -!- Vorpal has quit (Quit: ZNC - http://znc.sourceforge.net).
07:41:50  That's not flying, that's falling with style.
07:42:21 -!- Vorpal has joined.
07:42:23 -!- Vorpal has quit (Remote host closed the connection).
07:43:26  oerjan: I want to do this, but I know I'd just crash into some rocks
07:44:30  . The United States Parachute Association (USPA) requires in the Skydivers Information Manual that any jumper flying a wingsuit for the first time have a minimum of 200 freefall skydives, made within the past 18 months, and receive one-on-one instruction from an experienced wing suit jumper, or 500 jumps experience to go without an instructor.[16] Requirements in other nations are similar. Wingsuit manufacturers offer train
07:45:57 -!- Vorpal has joined.
07:46:01 -!- Vorpal has quit (Changing host).
07:46:01 -!- Vorpal has joined.
07:46:43  [    0.585378] pci_root PNP0A08:00: address space collision: host bridge window [mem 0x000c8000-0x000dffff] conflicts with Video ROM [mem 0x000c0000-0x000cffff]
07:46:44  gnh
07:52:04  oerjan: I want to jump off a skyscraper in one of those wingsuits
07:52:16  and then follow.... a carefully planned route so I doubt crash into anything.
07:52:57  i'd be worried about turbulence.
07:53:18  well, if there were any chance of getting beyond my immense fear of heights, that is.
07:53:36  oerjan: I'd be worried about a stray gust of wind.
07:53:41  presumably they only fly when there's no wind?
07:54:13  i thought that was more or less the same thing.
07:54:33  turbulence is a more abrupt change
07:54:35  in most contexts
07:54:43  These techniques include the orientation relative to the aircraft and the airflow while exiting, and the way in which the flier will spread his legs and arms at the proper time so as not to hit the aircraft or become unstable in the relative wind.
07:54:51  ah yeah, they could just decrease surface area if they need to
07:55:48  http://www.pbfcomics.com/28/
07:57:34  With body shape manipulation and by choosing the design characteristics of the wingsuit, a flier can alter both his forward speed and fall rate. The pilot manipulates these flight characteristics by changing the shape of his torso, arching or bending at the shoulders, hips, and knees, and by changing the angle of attack in which the wingsuit flies in the relative wind, and by the amount of tension applied to the fabric wing
07:57:40  I wonder how they like
07:57:43  make themselves rotate.
07:58:36  While still very experimental, powered wingsuits, often using small jet engines strapped to the feet[13] or a wingpack set-up, allow for even greater horizontal travel and even ascent.
07:58:40  wtf
07:58:40 -!- Vorpal has quit (Quit: ZNC - http://znc.sourceforge.net).
07:59:20  The proper term is "holy wtf batman".
07:59:26 -!- Vorpal has joined.
08:02:12 -!- nooga has joined.
08:05:29  to the batwingsuit
08:07:52  http://www.youtube.com/watch?v=h4arnATc04U
08:07:54  this is so good
08:09:32  kallisti: I bet being in the jet is more comfortable :P
08:10:11  also those jets are flying rather slowly (for jets that is)
08:10:33  well, yeah...
08:12:42  still his power to weight ratio is going to be pretty high because... well it's just a carbon-fiber wingspan and a person.
08:13:03  he just lacks much fuel I'd imagine.
08:14:11  kallisti: and the human body can only take so much...
08:14:46  wrt air speed and so on
08:20:23 * kallisti watches a man fly over the English Channel in a JETPACK
08:21:16  personally it is not how I would chose to commute
08:22:13  that's because you're boring.
08:25:28  kallisti: got a link to the video though?
08:26:14  brb
08:26:41  it's not as interesting as the grand canyon vid
08:27:42  http://www.youtube.com/watch?v=WgdIE2t8QkM
08:30:22  he does some neat stunts in that one.
08:38:44  kallisti: obviously you don't do stunts when commuting :P
08:40:52 * kallisti zzzzzzs
08:41:15  kallisti: creeper with dyslexia?
08:41:27  wat?
08:41:31  kallisti: that sound
08:41:45  wat?
08:41:57  it's like a thing
08:41:59  that indicates sleeping
08:42:01  kallisti: you never played minecraft?
08:42:13  ..
08:42:18  ugh
08:42:19  no
08:42:21  kallisti: oh
08:42:21  I have better things to do
08:42:23  ...
08:42:26  come on it is fun
08:42:37  I disagree.
08:42:43  kallisti: have you tried it?
08:42:51  and I don't mean the free classic version
08:42:51  I've seen people play it.
08:42:57  I actually have a pretty good imagination
08:42:58  so like
08:43:01  I can imagine playing it
08:43:03  without even having to
08:43:05  it's the neatest thing.
08:43:10  kallisti: well at least it isn't like starcraft. I watched people play that. Seems utterly boring.
08:43:19  ...that is where you are wrong.
08:43:29  starcraft is like real-time chess on crack.
08:43:38  kallisti: which is utterly boring
08:44:20  kallisti: I tried many RTS, but so far I only found one fun to play: darwinia.
08:44:41  http://www.youtube.com/watch?v=tbwG63KVQz4
08:44:44  this game is good.
08:45:01  kallisti: is there any jargon in it?
08:45:12  maybe.
08:45:19  but Husky is pretty good at explaining what is happening
08:45:20  if you like
08:45:24  know starcraft basics
08:45:34  not really
08:45:47  he says "macro"
08:45:51  which isn't really very jargony
08:45:59  kallisti: meaning like autohotkey?
08:46:02  no.
08:46:04  macromanagement
08:46:07  I see
08:46:13  it refers to how you produce and spend money.
08:46:14  your economy.
08:46:16  unit production
08:46:17  etc
08:46:35  kallisti: he has an annoying voice IMO
08:46:47  when you expand to new bases, when you research new tech, and what units you produce... are basically the three important points of macro.
08:46:51  anyway I need to leave for university soon, won't be able to watch the whole thing now
08:46:53  Vorpal: you get used to it :P
08:47:22  there's also "micro" which is micromanagement... which is movement of individual units / multitasking
08:47:43  I know about micromanagement. I played dwarf fortress. Which is not exactly RTS. Still fun though.
08:47:48  kallisti: ever played dwarf fortress?
08:47:55  yep
08:47:57  it's fun.
08:47:59  yeah
08:48:05  Vorpal: micro has a more specific meaning than it's usual meaning.
08:48:06  in sc2
08:48:09  I see
08:49:34  kallisti: anyway, I prefer sandbox games. Like minecraft and dwarf fortress.
08:49:37  or RPGs
08:49:46  open world RPGs are especially fun
08:49:57  me too, I just don't like minecraft because it's not a fun game. :P
08:50:13  but I also like strategy/competitive real-time games
08:50:17  kallisti: it sure is. Sure the combat is meh. I prefer creative.
08:50:31  some FPSes, super smash bros, magicka, starcraft,
08:50:46  I kind of suck at aiming at moving objects :P
08:50:54  I'm okay with stealth based FPS
08:50:59  like deus ex
08:51:06  my favorite FPS game is zombies mod in CoD actually. don't really like the multiplayer but the zombies mode is very fun.
08:51:15  *mode
08:51:15  mhm
08:51:58  my max round is 32 on the kino der toten map
08:52:02  solo
08:52:08  kallisti: The only FPSes I found fun to play are ones that are RPG-FPS mixes really. Like Deus Ex Human Revolution. Or Fallout New Vegas (haven't played Fallout 3)
08:52:24  opposite for me on the fallout stuffs
08:52:28  I played fallout 3
08:52:36  well, the mechanics are pretty similar
08:52:41  just different setting and story
08:52:46  I've seen it.
08:52:56  the mechanics are a little different also. they changed some skills around.
08:53:03  right
08:53:07  and the crafting stuff
08:53:09  the VATS system is interesting
08:53:18  the vats system is boring. :(
08:53:27  oh?
08:53:30  I disagree
08:53:32  but whatever
08:53:35  especially with all the vats-related perks.
08:53:40  hm
08:53:52  you basically just vats everything and..... continue vatsing everything
08:53:52  anyway I need to leave. Cya
08:53:56  mmk
08:53:57  kallisti: actually no
08:54:15  kallisti: VATS isn't realistic for sniper rifle over long distance at a large unmoving target
08:54:24  VATS underestimate the chance to hit then
08:54:25  bbl
08:54:37  oh... kAY? :p  BYE
08:55:17  The chance to hit depends on your screen resolution, too
08:56:55  UNFAIR!
08:56:58  ..
08:57:43  And the bullets are instantaneous rays anyway, so it doesn't matter if they're moving
08:58:05  well I don't think vats is based on your screen res.
08:58:22  No, but manual aiming can be
08:58:37  If you max out your character so that there's no sway
08:58:58  HD TVS ARE OVERPOWERED. QQ
08:59:10  Uh, they have only HD resolution.
08:59:22  Nothing on my 2560x1440
09:00:04  Hm, did Bethesda really use the same game engine for four games?
09:00:18  That just feels like they pulled something on the world
09:01:06 -!- GreaseMonkey has quit (Quit: The Other Game).
09:03:03  Jafet: sort of.
09:03:15  Jafet: they used a new AI for the NPCs in skyrim
09:03:23  I'm sure there have been improvements.
09:03:31  Shiny rocks
09:03:44  graphics, yes. shiny interfaces.
09:04:34  oh, and, uh, giant fucking worlds filled with towns, caves, dungeons, random encounters, every NPC having voice-overs, multiple options for quests, etc.
09:04:55  The new AI isn't any more believable than the Oblivion ones, though
09:04:57  it's not like they're getting away with anything.
09:05:02  It's the NPC animations doing the most of the work
09:05:04  Jafet: well yeah, but it's new nonetheless
09:05:30  nothing was pulled, I think. I believe they've put plenty of work into each game.
09:05:32  The NPCs tilting their heads actually goes a long way to create realism
09:05:44  it's better than before, certainly
09:06:34  Well, when you set out to create a game on the scale that Bethesda does, you normally wouldn't want to release it in a rough, bug-ridden state like Bethesda does.
09:08:51 -!- oerjan has quit (Quit: leaving).
09:13:31  what
09:13:33  skyrim
09:13:37  oh yeah
09:14:14  that reminded me of my second pc which runs the game constantly for 3 days
09:28:06  @tell elliott amb is interesting. It does something similar to what I have in mind for my graph language, except that in the graph language it will be implicit to every change of state.
09:28:06  Consider it noted.
09:29:00  lambdabot - the Siri of IRC
09:30:39  @tell kallisti to stop using @tell
09:30:39  You can tell yourself!
09:30:45  lambdabot: thanks
09:39:10  hmm
09:39:21 * kallisti checks out Oz to see how it efficiently does constraint programming.
09:42:11  I'm not really sure if any of this is relevant though
09:50:55  but basically the syntax would look something like....
09:51:21  constraint { node -> replacement; node -> replacement; ... }
09:51:31  the symbols can be changed later if desired.
09:53:01  and if the same node is replaced by two rules then this essentially creates two nodes with past edges that point back to the original node.
09:53:16  a sort of non-deterministic split.
09:54:21  so, the somewhat annoying problem of determining the order of execution of graph rewriting rules
09:54:24  is.. no longer a problem.
09:57:16  so I guess I should start working on a) what constraints look like b) how to define predicates to use in constraints c) how to define functions in general d) some built-in operations e) how to refer to nodes
09:57:29  I guess the constraint would have variables... so like
09:57:54  X > 2 { X -> X+1 }
09:58:29  X here refers to any node. if a node satisfied the constraint, then it's replaced by the node that's produced from adding one to the node's value.
10:00:21  X > Y { X -> null }
10:00:27  this would delete every node but the smallest.
10:01:21  (delete is kind of the incorrect word, as you can still backtrack)
10:06:07 -!- monqy has quit (Quit: hello).
10:06:15  monqy: hello
10:06:44  but I also want things like....
10:07:00  X > Y { X -> past(X) }
10:07:10 -!- hagb4rd has joined.
10:07:42  which would replace X with a past node of itself. since there could possibly be more than one past node this is non-deterministic.
10:08:07  hmmm okay I could just have sets.
10:08:18  X > Y { X -> [X, X+1] }
10:08:43  replace all non-minimum nodes with both itself and itself plus 1
10:09:02  and then have a | which applys constraints to sets.
10:10:20  something like...
10:11:07  X > Y { X -> e in past(X) | e = e^2 }
10:12:21  or....
10:13:27  X > Y { X -> a,b in past(X) | distance(X,a) > distance(X, b) }
10:13:37  to revert to the most recent past node.
10:14:55  minimum(X) := a,b in X | distance(X, a) > distance(X, b)
10:15:22  X > Y { X -> minimum(past(X)) }
10:15:34  er...
10:15:34  no
10:15:35  wait
10:15:46  that doesn't work :P
10:16:06  you need something like...
10:16:37  minimum(X) := b where a,b in X | distance(X, a) > distance(X, b)
10:16:56  (will improve the syntax of these things at some point)
10:20:55  > let x = [1..5] in [b | a <- x, b <- x, a > b]
10:20:55    [1,1,2,1,2,3,1,2,3,4]
10:20:59  lol
10:21:38  whoa
10:24:21 -!- azaq23 has joined.
10:24:37 -!- azaq23 has quit (Max SendQ exceeded).
10:27:10 -!- nooga has quit (Ping timeout: 255 seconds).
10:29:30 -!- ais523 has joined.
10:30:38 -!- nooga has joined.
10:40:57  > let x = [1..5] in [b | let s = join(liftA2(,))x, (a,b) <- s, a > b]
10:40:58    [1,1,2,1,2,3,1,2,3,4]
10:41:00  :(
10:41:13  same thing.
10:42:01  > concat . init . inits $ [1..5]
10:42:03    [1,1,2,1,2,3,1,2,3,4]
10:42:54  kallisti, weren't you going to sleep?...
10:44:12  :t init
10:44:12  ais523: You have 4 new messages. '/msg lambdabot @messages' to read them.
10:44:13  forall a. [a] -> [a]
10:44:17  ais523, hello
10:44:19  hi
10:44:23  Vorpal: no
10:44:29  > init [1,2,3,4,5]
10:44:30    [1,2,3,4]
10:44:32  backwards tail?
10:44:37  kallisti, pretty sure you said like "zzzzzs" or something
10:44:37  I was actually zzzzzing because you were putting me to sleep. :P
10:44:42  kallisti, oh
10:44:50  Vorpal: ha ha ha
10:45:24  hm that is some interesting xmas decoration in the window to the robotics lab here at university
10:45:35  anyway how do you implement minimum on a set without doing something like a fold
10:45:52  kallisti: well, you could do an associative fold
10:45:57  which isn't the same as foldl or foldr
10:46:03  but you might still consider it as being like a fold
10:46:22  basically LEDs mounted on a fan, rotating. The LEDs are synced to the rotation so they spell out a word
10:46:27  gnh, did that get through? Just lost wlan for a bit
10:46:29  ("God Jul", Swedish for "Merry Christmas")
10:46:48  fuck microwave ovens.
10:46:51  or I guess actually what I'm asking
10:46:54  they mess up wlan badly
10:47:08  is how do you use universal quantification to get the minimum of a set.
10:47:19  oh...
10:47:20  duh
10:47:43  exists a. forall b. a < b
10:47:46  hm and the time too
10:47:48  on the fan
10:48:20  hmmm my mother seems to be under the impression that second-hand hookah vapor is somehow going to be bad for her because she has asthma.
10:48:27  which I think is probably not true.
10:52:55  because I'm on the other side of the house
11:41:35 -!- ais523_ has joined.
11:41:59 -!- ais523 has quit (Disconnected by services).
11:42:01 -!- ais523_ has changed nick to ais523.
11:42:05  X just exited for no obvious reason…
11:44:16  ais523: I love when that happens.
11:47:12  hmm, there's garbage on tty2
11:48:25  ais523: data has feelings too. just because no one's using it doesn't mean it's not data.
11:48:39  garbage is insulting to those poor bits. :(
11:48:52  *desert login: 1*41*41*41*41*4Password:                          HHHHHHHHHHHPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPHHHHQQQQQPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPUbuntu 10.04.3 LTS desert tty2
11:48:54                                                          desert login:
11:49:03  (note: that isn't actually my password)
11:49:09  good password
11:51:15  (nor my username)
12:22:22 -!- nooga has quit (Ping timeout: 255 seconds).
12:37:07 -!- augur_ has changed nick to augur[afk].
12:44:24 -!- ais523 has quit (Ping timeout: 244 seconds).
12:46:30 -!- sebbu2 has joined.
12:46:31 -!- sebbu2 has quit (Changing host).
12:46:31 -!- sebbu2 has joined.
12:47:27 -!- Phantom_Hoover has joined.
12:47:31 -!- ais523 has joined.
12:48:09 -!- sebbu has quit (Ping timeout: 248 seconds).
12:49:32  can anyone explain why you would said "pairwise distinct" instead of "all elements are unique"
12:51:02 -!- ais523 has quit (Excess Flood).
12:52:40 -!- ais523 has joined.
13:01:03  what the hell
13:01:07  about a week ago
13:01:25  I was commenting on how warm it is in November
13:01:27  and today
13:01:28  it's snowing.
13:02:01  I don't even think it's below freezing. no, it's not.
13:10:39  erss kapakassa ja vakioasiakas ehdotti hnelle
13:15:59 -!- ais523 has quit (Ping timeout: 252 seconds).
13:18:54  itidus21: don't pretend you're not American.
13:19:19  http://s3.amazonaws.com/data.tumblr.com/tumblr_l99k91VcPO1qdpbleo1_1280.jpg?AWSAccessKeyId=AKIAJ6IHWSU3BX3X7X3Q&Expires=1322659120&Signature=ZADFaT4zuI5XQjZSiuliUVob0VQ%3D
13:20:04  ah, this must be what Sweet Bro and Hella Jeff is parodying.
13:20:16 -!- ais523 has joined.
13:24:36  http://www.reddit.com/r/askscience/comments/mt83n/dear_sociologists_why_do_black_people_not_enjoy/
13:24:37  Phantom_Hoover: You have 9 new messages. '/msg lambdabot @messages' to read them.
13:24:38  This, wow.
13:26:36 -!- ais523 has quit (Ping timeout: 244 seconds).
13:27:25 -!- Patashu has quit (Quit: MSN: Patashu@hotmail.com , Gmail: Patashu0@gmail.com , AIM: Patashu0 , YIM: patashu2 , Skype: patashu0 .).
13:27:32  @tell elliott why why why this was a good day
13:27:32  Consider it noted.
13:28:17  Phantom_Hoover: you're so popular.
13:31:35  interesting, so pistachio seeds actually split open like that because of artificial selection.
13:39:12 -!- nooga has joined.
14:11:19  http://pics.kuvaton.com/kuvei/there_is_no_censorship_in_us.jpg
14:22:08  kallisti, that's a significantly more complex thing than straight "censorship".
14:26:59  yes I agree.
14:27:32  it seems to strange to me that for some reason the US needs different information/stuff from the rest of the world.
14:28:13  It'll mainly be a combination of culture, world prominence and the size of the market.
14:30:49 -!- olsner has quit (*.net *.split).
14:36:47 -!- olsner has joined.
14:48:58 -!- ais523 has joined.
14:59:47 -!- Zuu has quit (Read error: Connection reset by peer).
15:01:51 -!- copumpkin has joined.
15:03:53 -!- Zuu has joined.
15:17:37  http://www.dalnefre.com/wp/2011/11/fexpr-the-ultimate-lambda/
15:17:47  This looks exceptionally stupid from a cursory glance.
15:18:04  "Application of a Lambda causes evaluation of its operands, producing arguments which are combined as specified by a body expression."
15:18:16  Yes, yes it is.
15:19:42  that doesn't make sense to me.
15:19:44  producing arguments?
15:19:59  oh
15:20:12  ...that's... stupid.
15:20:48  It appears he's reinvented lazily-evaluated lambdas.
15:23:47  "application of a lambda causes evaluation of its operands"  sounds pretty unlazy to me.
15:32:21 -!- mrgaddy has joined.
15:33:16  hello to all esoterics!
15:33:54  `? welcome
15:34:02  Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
15:35:52 -!- mrgaddy has quit (Client Quit).
15:36:40  Another neopagan sent packing.
15:39:00 -!- MSleep has changed nick to MDude.
15:40:23 -!- copumpkin has quit (Remote host closed the connection).
15:40:48 -!- copumpkin has joined.
15:43:59  Phantom_Hoover: sometimes I wish we were a joint channel between neopagans and amateur language designers.
15:44:18  Hey, oklopol's a professional language designer.
15:45:07  I guess Gregor kind of is too?
15:45:08  well, no
15:45:19  unless he wrote a paper about Plof?
16:02:48 -!- pikhq has quit (Ping timeout: 244 seconds).
16:02:57 -!- pikhq has joined.
16:05:17 -!- ais523 has quit (Remote host closed the connection).
16:24:34 -!- elliott has joined.
16:26:50  !perl print "\n" =~ /\s/
16:26:53  1
16:26:57  whew. sanity.
16:29:33 -!- elliott has set topic: The IOCCC is back on! http://www.ioccc.org | http://codu.org/logs/_esoteric/.
16:29:41 * elliott now proceeds to find out why oerjan did that.
16:29:41  elliott: You have 2 new messages. '/msg lambdabot @messages' to read them.
16:33:26  !perl my $x = "hi hi ho hi"; while ($x =~ /hi/g) {print $&}
16:33:27  hihihi
16:33:33  whew. sanity.
16:33:38  sometimes I have to check when I'm writing perl.
16:34:24  isn't loss of sanity the standard perl coding state
16:34:42  yes.
16:34:57  actually it's the loss of sanity that makes me check all of these dumb things.
16:35:15 * kallisti cannot remember like 3 million special cases of stuff all the time.
16:37:10 -!- sebbu2 has changed nick to sebbu.
16:44:50  i wasn't accepted in stacs :(
16:45:09  Oh noklopol?
16:45:51  if you look at accepted papers in http://stacs2012.lip6.fr/, you'll see why
16:45:53  they are idiots.
16:46:28  oklopol is dum lol
16:54:01 -!- ais523 has joined.
17:03:52 -!- kallisti has quit (Ping timeout: 258 seconds).
17:05:56  elliott: here? if you're reading this live and not logreading, here's a hilariously breakage of a phpBB webforum: http://mafiascum.net/forum/viewtopic.php?f=8&t=14360&start=50
17:06:00  everyone's panicking, obviously
17:06:13  (creating new posts works, incidentally, it's just that all existing information seems to be badly messed up)
17:06:14  hi
17:06:21  ha
17:06:29  my favourite bit is the "Jump to" box at the bottom
17:06:35 -!- kallisti has joined.
17:06:43  oh, and half the pages fail with an internal error, the others are like that
17:07:04 * Sgeo was vaguely considering playing on MS once
17:07:10  Not sure I have the patience though
17:07:19  if you're not sure, you don't
17:07:47  elliott: as a bonus, none of the site admins are online, but one of the art people is, and tried to fix the problem by changing the default style to be one that they were working on as a joke
17:07:58  (or at least, that had amsuing placeholder graphics in)
17:08:02  heh
17:08:10  so everyone assumed that it was some sort of hack attempt
17:08:16  (they changed it back after it was clear that it did nothing useful)
17:08:29  but now everyone is blaming the tigers
17:08:41  ais523, where can you see what anyone is actually saying?
17:08:53  Oh, is there an IRC channel?
17:09:08  Sgeo: any thread which was created after this happened
17:09:09  like http://mafiascum.net/forum/viewtopic.php?f=8&t=19711
17:09:23  Ah
17:09:47  hmm, I /might/ actually end up using the state variable declaration in PErl
17:09:47  for my IRC bot
17:12:13  elliott: any idea of what could cause that sort of breakage?
17:12:20  it seems to be some sort of systematic corruption
17:14:10 -!- monqy has joined.
17:14:25 -!- kallisti has quit (Ping timeout: 255 seconds).
17:14:30 -!- kallisti has joined.
17:14:30 -!- kallisti has quit (Changing host).
17:14:30 -!- kallisti has joined.
17:15:36  ais523: hmm, reordering of table columns?
17:15:41  or inserting a new one in the wrong place
17:15:53  @help
17:15:54  help . Ask for help for . Try 'list' for all commands
17:15:56  @help help
17:15:57  help . Ask for help for . Try 'list' for all commands
17:16:04  perhaps, but it pretty clearly involves more than one table with any sensible architecture
17:16:09  e.g. everyone's showing as having joined on the epoch
17:16:17  weird
17:16:30  (I'm not assuming that phpBB's arch is sensible, but I don't think it'd be /that/ crazy)
17:16:36  "Who the Eff are you and how did you join in 1969"
17:16:50  hmm, unless join dates are calculated from the posts table
17:16:59  ais523: they're not
17:17:07  I know a /very slight/ amoutn about phpBB
17:17:13  good to know
17:17:20  there's definitely an index on (user, thread, date)
17:17:23  in the posts table
17:17:39  so it wouldn't be impossible to assume there's one on (user, date) too; it'd just be wrong
17:19:35  ais523: well, join date can't be calculated from date of first post
17:19:47  yes, that's what I meant by "wrong"
17:19:56  oh, everyone's avatar vanished too
17:20:09  (but changing avatars worked and put them back to normal, or alternatively tiger-themed)
17:20:14  and that can't be related to the posts table, surely
17:20:37  ais523: well, IIRC avatar info is stored in a table, just not the files themselves
17:21:05  right, but it wouldn't be the same table as posts unless the database was normalized in a really crazy way
17:21:17  typically, changing avatar changes it on all posts, you don't want to go back over all the posts and update it by hand
17:21:29  thus, it's stored in a separate table, almost certainly
17:21:30  lol
17:21:35  i think it's stored in the user table
17:21:51 -!- kallisti has quit (Ping timeout: 240 seconds).
17:22:05 -!- kallisti has joined.
17:22:05 -!- kallisti has quit (Changing host).
17:22:05 -!- kallisti has joined.
17:22:15  help I'm in wlan limbo
17:22:44  "The tigers are unrelated to the problem at hand."
17:23:27  ais523: this xalxe person sure does post a lot
17:23:33  elliott: I wonder how long "pretentious hipster" has been cool.
17:23:44  elliott: he's not a top poster site-wide, he's just interested in the whole tigers incident
17:23:44  at least since like the 50s right?
17:23:55  Tiger Incident(tm)
17:24:32  well, it has to be called something
17:24:43  ais523: the blognomic dynasty is still going?
17:24:58  elliott: it's the one after the one that started during the Agoran invasion
17:25:03  yep, I know
17:25:10  the last one was very short
17:25:14  this one seems a more usual length
17:25:15  it's been on this one the last like ten times i've checked :P
17:25:19  although it's in need of a win condition
17:25:40  you know what would be awesome
17:25:42  elliott: btw, I realised that Braid's time travel model is a superset of Feather's; e.g. the first puzzle in world 3 is pretty much exactly a <<= operation, giving the key to the player
17:25:49  haha
17:25:58  and world 2 should serve as a big demonstration of why timeloops are so easy to make by mistake in Feather
17:26:06  little balls of soft pretzel, filled with mozzarella. one day I shall make that.
17:26:10  it's actually a good visualisation tool
17:26:20  has it solved any feather problems yet?
17:26:26  no, I don't think so
17:26:40  in Braid, things can just have a glowy green outline and be outside the usual flow of time
17:26:46  that's like the Feather version of unsafePerformIO
17:26:48  cheating!
17:26:53  did someone say feather
17:26:58  can you play the game without that?
17:27:20  you can't cause things to do that; some puzzles (all in world 3, and many elsewhere) have them naturally on the map, thouhg
17:27:21  *though
17:27:56  each world has its own gimmick (apart from 2, whose gimmick is not having a gimmick)
17:28:06  btw, the worlds are numbered starting from 2; it's an effect of the pretentiousness
17:28:07  2 is first
17:28:26  the end is 1, right?
17:28:43  yep
17:29:01  well, or beginning depending on how you look at it, the game's plot is time-reversed (probably inevitably)
17:29:35  but it's the level you play last
17:29:45  ais523: a video title on YouTube you might find amusing: "55 Bugs in 3 Minutes (Minecraft 1.0.0)"
17:29:56  indeed
17:30:05  is it single-segment, or IL?
17:30:14  ?
17:30:37  are there discontinuities in the action, like saving and then loading elsewhere, or cutting with things done during the cut?
17:31:06  (if it repeatedly saves and loads in the same place, it's segmented, but that seems really unlikely for that sort of video)
17:31:23  oh, there's a cut after every bug
17:31:31  demonstrating them all with one large contraption would be... impressive
17:32:10  single-segments are much more impressive than ILs for that reason
17:32:14  Project for Pyralspite?
17:32:16  "in single player, arrows don't affect a pressure plate until a particle effect intersects the pressure plate"
17:32:32  although ILs are generally much faster, to make up for it
17:32:37  still can't get over how unlikely that bug is
17:32:38  That bug still amazes me.
17:33:06  ais523: (What is that terminology from? TASes?)
17:33:07  Boosters, I can get. Water ladders, I can get. Boatvators, I can get. But that?
17:33:14  elliott: unassisted speedruns
17:33:22 -!- TheJimmyJames has joined.
17:33:23  TASes are really heavily segmented by definition
17:33:38  although there's been one attempt I know of at an IL TAS, TASvideos wouldn't accept it
17:34:05  as they verify that the whole run is continuous using emulators, and ILs aren't continuous by definition
17:34:09  ais523: well, TASes are indistinguishable from someone playing ridiculously well without save-scumming, no?
17:34:17  I mean, the end result
17:34:23  elliott: right, indeed
17:34:27  oh, I had the terminology the wrong way aroudn
17:34:29  so they look like single-segments when played back
17:34:33  Phantom_Hoover: all creative sandboxy games need perpetual motion machines.
17:34:36  what does IL stand for?
17:34:39  or occasionally, single-segment with resets
17:34:41  individual level
17:34:43 -!- TheJimmyJames has quit (Client Quit).
17:34:51  because you have to play the whole game a level at a time in any order
17:35:07  heh
17:35:17  it's typically used for things like racing games
17:35:28  where the levels are all independent, and any ordering of the levels is entirely arbitrary
17:35:48  (and continuity is thus not required; SDA even allows the levels of an IL to be done by different people, and just adds together the best time achieved for each level)
17:36:00  "A half-block with ice underneath it is slippery."
17:36:03  Phantom_Hoover: we are using this
17:36:13  Yes.
17:36:17  Yes we are.
17:37:47  elliott:  I think I would play minecraft if it were more CAy
17:38:11  Conway's Game of Life: the Game!
17:38:45  I guess redstone is kind of like wireworld???? kind of???????
17:38:52  kallisti: Elliottcraft (the game I'm not really working on but am designing, and that's named after elliott to cause confusion) is basically a bully automaton
17:38:55  with only a few individual components
17:39:00  being 3D rather than 2D means only a few are needed
17:39:07  and I think it's TC, although haven't proven it
17:39:23  ais523: import state: ground
17:39:26  *important
17:39:36  assuming you walk around in it
17:39:51  kallisti: there is a possible content for a cell that is solid and does nothing
17:40:03  good.
17:40:06  two, in fact, one that falls and can be pushed around, and one that's immobile and just hangs there in midair
17:40:14  excellent.
17:40:26  ais523: So, sand and stone? :-)
17:40:34  stupid minecraft and its IMPOSSIBLY FLOATING STRUCTURES which are SOMETIMES NOT WANTED.
17:40:38  but OTHERTIMES KIND OF COOL.
17:40:41  ais523: (in Minecraft, sand and gravel alone are affected by gravity)
17:40:44  elliott: I don't think they have names yet, other than really descriptive names
17:40:57  but the moveable one acts rather more solid than sand
17:41:05  ais523: sand is solid in MC
17:41:10  oh, right
17:41:22  I read MC as mind control.
17:41:24  well, the game isn't going to make much sense real-worldly, but it should make at least more sense than /that/
17:41:44  I've even vaguely envisaged it working as an MMO
17:42:02  ais523: glider guns are a must.
17:42:03  and I'm trying to work out how easily you could attack people by building walls around them or sending lots of factory blocks at them
17:42:11  kallisti: oh, don't worry about that
17:42:21  there's a block whose purpose is to be a glider with side effects, and it's quite easy to create
17:42:46  reflecty mirror things that move gliders around?
17:42:54  also: portals
17:42:58  every game benefits from portals.
17:43:15  for example see: portal
17:43:19  ais523: I've always liked the idea of games that are basically single-player MMOs
17:43:25  let's see… we have air, ground-like blocks (mobile/levitating), conveyor blocks (mobile/levitating), factory blocks
17:43:35  conveyor blocks and factory blocks both have six possible orientations
17:43:38  elliott: that sounds horrible kind of. almost as horrible as regular MMOs
17:43:55  none of the blocks can self-propel; but factory blocks can repeatedly create conveyor blocks beneath themselves
17:44:05  which effectively gives you a side-effecting glider
17:44:13  ais523: you could eliminate the diffusion of mobile and levitating by just putting block on a single kind of levitating block.
17:44:17  i.e., the only mode is online server play
17:44:18  /but/
17:44:23  everyone spawns like miles and miles away from each other
17:44:34  so you never know unless you like accidentally cross the path of someone exploring far out
17:44:35  kallisti: that'd make severe differences from the way computation worked
17:44:39  or make plans to meet up with someone
17:44:40  elliott: but then, how would you play it offline?
17:44:48  also, someone would probably make some sort of space-filling machine before long
17:44:54  and everyone would come across it eventually
17:44:58  ais523: you don't (bonus points if it doesn't tell you it's connecting to the network before you realise it yourself)
17:45:15  elliott: then it's effectively malware
17:45:19  ais523: AWESOME malware
17:45:23  ais523: peano curves: the game?
17:45:24  well, yes, but still malware
17:45:31  elliott: more to the point, my network connection is often very unreliable
17:45:41  so I'd notice the game repeatedly crashing
17:45:43  ais523: well, it helps to dilute the world of malware with fun malware
17:45:47  a world with fun malware > a world with unfun malware
17:46:42  a world with fun malware + a world with unfun malware = a world with unfun malware
17:46:46  therefore, a world with fun malware = 0
17:47:20  ...
17:47:36 * kallisti good math
17:47:37  therefore, a world with unfun malware < 0
17:47:48  (and <0 < <3)
17:48:25  > (<0) < (<3)
17:48:26    *Exception: (==): No overloading for function
17:49:06  hmm, I wonder why that's erroring on (==)
17:49:15  a large part of me wishes that functions were orderable and equatable.
17:49:33  then define ordering and equality on functions
17:49:35  ais523: I wonder why that's a runtime error.....
17:49:40 -!- nooga has quit (Ping timeout: 245 seconds).
17:49:48  because
17:49:58  > (sin + cos) pi
17:49:59    -0.9999999999999999
17:50:10  elliott: some library, presumably?
17:50:18  also, what?
17:50:20  library for what
17:50:22  > cos pi
17:50:22    -1.0
17:50:26  > sin pi
17:50:26    1.2246467991473532e-16
17:50:30  oh, I see
17:50:32  ais523: num instance for functions
17:50:41  elliott: defining + on functions
17:50:44  sin pi.....
17:50:50  ais523: it's just a Num instance
17:50:55  but Num requires Eq and Show
17:50:56  because bad
17:51:00  oh, aha
17:51:14  elliott: does Eq requite Ord?
17:51:20  erm
17:51:22  but Num requires Ord and Show
17:51:23  Ord requires Eq
17:51:24  or does it
17:51:25  @src Num
17:51:25  class  (Eq a, Show a) => Num a  where
17:51:25      (+), (-), (*)           :: a -> a -> a
17:51:25      negate, abs, signum     :: a -> a
17:51:25      fromInteger             :: Integer -> a
17:51:26  oh...
17:51:27  okay.
17:51:29  no Ord isn't required
17:51:31  I wonder why they defined it
17:51:42  me too.
17:52:04  and I wonder why they defined it in terms of ==
17:52:13  @src (a->b) <
17:52:13  Source not found. BOB says:  You seem to have forgotten your passwd, enter another!
17:52:22  > ((+3) > (+4)) 5
17:52:23    Couldn't match expected type `t1 -> t'
17:52:23          against inferred type `GHC.B...
17:52:36  ..
17:52:38  yeah
17:52:38  it'd be great if the rest of the error was printed
17:52:45  :t ((+3) > (+4))
17:52:45  Bool
17:52:48  Pretty clearly GHC.BOol or siome..
17:52:50  ah, there we go
17:52:59  in retrospect, that was inevitable
17:53:03  ..heh, indeed.
17:54:03  elliott: does caleskell do any other stuff with function instances that would require Ord?
17:54:11  don't think so
17:54:48  @info (->)
17:54:48   Parse error at "->)" (column 2)
17:54:57  @help info
17:54:58  help . Ask for help for . Try 'list' for all commands
17:55:05  @help @info
17:55:05  help . Ask for help for . Try 'list' for all commands
17:55:10 * Sgeo facepalms
17:56:42  ais523: I imagine one of the tests of the compare function or <=  (whichever they defined for (->)) involves equality somewhere.
17:56:56  and then < etc are defined from that.
17:57:26  Um, why would they define Ord Num with compare or <= being anything other than error?
17:57:29  but that doesn't really explain why there is a completely useless Ord instance of (->)
17:57:35  Erm, I mean, Ord (->)
17:58:13  maybe they were lazy and just used the same error message they use with (==) to make their shitty useless instance.
18:00:30  perhaps it's actually a bug and no one realized that the Ord instance isn't actually needed.
18:00:47  ,,
18:01:00  ...
18:03:19 * Sgeo gets the discussion going in #haskell
18:08:29  Sgeo: it's Ord (a->b), right? (->) is quite different from (a->b)
18:08:36  Oh
18:09:01  ais523: probably.
18:09:16  > () > ()
18:09:17    False
18:09:19  ais523: people often abbreviate instances for (->) in that way, it's kinda gross though
18:09:21  ...bah
18:09:29  elliott: does the language accept it?
18:09:33  no.
18:09:36  no, but we're not talking in haskell
18:09:40  well, OK
18:09:49  but that's like abbreviating int* to int in C
18:10:00  not really
18:10:06  even if you're not talking in C, it's still going to be really confusing
18:10:20  it's definitely obvious that you're saying (make functions do stuff) in much the same way as saying something like "an instance for monads"
18:11:04  Oh
18:11:12  There is a sensible definition of Ord for a->b
18:11:17  Well, actually
18:11:22  Don't know about sensible, but
18:11:30  no there isn't
18:11:34  :t max
18:11:35  forall a. (Ord a) => a -> a -> a
18:12:04  ais523: not really, since Ord (->) is totally invalid, and there's only one possible "expansion" to validity
18:12:08  as opposed to Ord Int vs. Ord (Ptr Int)
18:12:14  > max (+2) (+3) $ 5
18:12:15    8
18:12:24  Well, not "sensible"
18:12:25  Sgeo: ...and?
18:12:27  :t compare
18:12:28  forall a. (Ord a) => a -> a -> Ordering
18:12:30  @src Ord
18:12:30  class  (Eq a) => Ord a  where
18:12:30      compare      :: a -> a -> Ordering
18:12:30      (<), (<=), (>), (>=) :: a -> a -> Bool
18:12:30      max, min         :: a -> a -> a
18:12:33  elliott: Ord (a->a)?
18:12:36  How do you implement compare
18:12:37  But max and min are defined
18:12:46  So? The others aren't
18:12:50  elliott: with guards.
18:12:53  and stuff
18:12:53  But ah, I guess that's why
18:12:58  I wrote a consistent compare for functions
18:12:59  or something.
18:13:02  ais523: (a -> b), Ord (a -> a) isn't valid and wouldn't work if it did
18:13:04  it was kind of slow though
18:13:13  s/did$/was/
18:13:16  ais523: for example: "an Ord instance for monads" when you actually mean an Ord instance for (Monad m, Ord a) => m a   or something.
18:13:24  uh
18:13:25  aha, you can define <= in terms min as (<=) a b = min a b == a
18:13:32  kallisti: not sure how you'd define that
18:13:32  kallisti: that instance would be terrible and not work
18:13:32  that's where the call to == is coming from, probably
18:13:34  and
18:13:36  nobody says that
18:13:40  *in terms of min
18:13:41  and nobody would know what you meant if you said that :P
18:13:49  ais523: right
18:13:56  that's actually a plausible definition of <= for functions, it's just uncomputable
18:14:10  (and non-transitive)
18:14:16  I had a valid definition of it for functions
18:14:43  copumpkin: What did it do
18:14:53  Try the entire argument space?
18:15:03  yeah, but it's not that simple
18:15:16  That sounds fairly non-terminating :P
18:15:46  copumpkin: does "valid" here imply "computable"?
18:16:05 * ais523 tries to work out if sorting functions lexicographically by what they map the entire argument space to makes any sort of sense
18:16:25  I think it does with restrictions on the functions; differentiability is probably enough, but too strong
18:16:36  WTF
18:16:38  >deriv abs 0
18:16:42  > deriv abs 0
18:16:43    0
18:16:46  (that is, it's meaningful, but impossible to compute without more information)
18:16:47  > deriv abs (-1)
18:16:48    -1
18:16:59  > deriv abs 20
18:17:00    1
18:17:03 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds).
18:17:10  Sgeo: I bet it's just taking the average of left-derivative and right-derivative
18:17:14  > deriv abs x
18:17:15    signum x * 1
18:17:17  elliott: I'm pretty sure I've heard the phrase "instance for monads" used before. also: I wasn't anticipating my example would be reviewed for its plausibility of implementation. :P
18:17:25  ah no, doing it symbolically
18:17:28  @src deriv
18:17:28  Source not found. Where did you learn to type?
18:17:28  >deriv sin
18:17:32  > deriv sin
18:17:33    Overlapping instances for GHC.Show.Show (a -> a)
18:17:33     arising from a use of `...
18:17:44  > deriv sin x
18:17:45    1 * cos x
18:17:51  yep, symbolically all right
18:18:10  @hoogle (Monad m) => m a -> a
18:18:11  Prelude (>>) :: Monad m => m a -> m b -> m b
18:18:11  Control.Monad (>>) :: Monad m => m a -> m b -> m b
18:18:11  Control.Monad.Instances (>>) :: Monad m => m a -> m b -> m b
18:18:11  :t deriv
18:18:12  forall a b. (Num a, Num b) => (Dif a -> Dif b) -> a -> b
18:18:21  elliott, ais523: it only worked on finitely enumerable domains, and it would create a list of all functions
18:18:23  ais523: not symbolically, I don't think
18:18:23  oh come on, Haskell, no breakMonads function?
18:18:25  although it might be
18:18:27  and then find who appeared first in that list
18:18:32  I think it's AD
18:18:34  it was awesome
18:18:36  and the symbolicness comes from the Expr stuff
18:18:39  which comes in because of x
18:18:41  > deriv sin 99.4
18:18:42    0.4257869286693041
18:18:45  :t deriv sin 99.4
18:18:46  forall a. (Floating a) => a
18:18:47  yeah
18:18:50  elliott: how does it differentiate sin to cos without doing it symbolically?
18:18:54  and actually say the result is cos
18:19:02  is it just guessing that the result acts like cos?
18:19:03  ais523: that's part of the definition of sin
18:19:03  :t sin
18:19:04  forall a. (Floating a) => a -> a
18:19:10  it's part of the Floating instance for Dif
18:19:20 -!- zzo38 has joined.
18:19:23  > deriv (\a -> sin a * sin a) x
18:19:24    1 * cos x * sin x + sin x * (1 * cos x)
18:19:24  tl;dr typeclass hacks.
18:19:32  it's not a typeclass hack
18:19:52  elliott: it has to know that the input is sin, surely?
18:19:56  ais523: what
18:20:02  otherwise it's comparing functions and we already know that's impossible
18:20:10  no it's not
18:20:13  @messages
18:20:14  You don't have any new messages.
18:20:20  :t deriv
18:20:21  forall a b. (Num a, Num b) => (Dif a -> Dif b) -> a -> b
18:20:30  instance Blah (Dif a) where sin = ...
18:20:45  elliott: right, symbolic
18:20:48  no
18:20:49  not symbolic
18:21:03  the definition of sin will be something that says "this is sin"
18:21:13  thus, it's symbolic
18:21:17  no
18:21:17  not symbolic
18:21:19  unless you're using a really weird definition of the term
18:21:24  ais523: the reason it says cos
18:21:26  is because you used "x"
18:21:27  :t x
18:21:28  Expr
18:21:30  > sin x
18:21:30    sin x
18:21:31  > cos x
18:21:32  you're just saying lots of stuff that proves it's symbolic
18:21:32    cos x
18:21:39  you are still doing stuff that says it's symbolic
18:21:45  ais523: you're just saying lots of stuff that proves you don't know wtf it's doing
18:21:47  THE EXPR STUFF IS SYMBOLIC
18:21:50  the deriv stuff isn't
18:22:06  elliott: it's printing the result symbolically because I used x, indeed
18:22:18  but it was symbolic all along, because you can't go backwards from numerical to symbolic, in general
18:22:18 -!- elliott has left ("ragequit").
18:22:56  elliott rageparts easily.
18:23:01  ais523: presumably it has to do some maths
18:23:04  I'm not used to elliott rageparting
18:23:07  ais523: on top of being symbolicish
18:23:27  symbolic differentiation basically means that it's using some sort of AST or similar representation of the functions, and operating on that
18:23:33  rather than evaluating the functions and operating on the resulting values
18:23:40 -!- elliott has joined.
18:23:44  and then somehow making them back into functions
18:23:55  ais523: I suggest you look up automatic differentiation
18:23:59  rather than arguing from incredulity
18:24:59  elliott: I've just looked it up; Wikipedia says that it isn't symbolic differentiation, then goes on to define it, with a definition that shows that it clearly is symbolic after all
18:25:11  unless "symbolic differentation" refers to something other than differentiation which is symbolic
18:25:13  you are incorrect
18:25:21  ais523: Then, go there and fix it if it is wrong?
18:25:25  http://blog.sigfpe.com/2005/07/automatic-differentiation.html
18:25:36  the fact that the operations are defined with variables
18:25:38  does not make them symbolic
18:25:40  Or, put a note on the Talk page to notify them in case someone has reasons to keep it how it is?
18:25:46  because there are no symbols at runtime
18:25:49  and no symbol manipulation at runtime
18:25:55  the only thing involving symbols or symbol manipulation is Expr
18:26:00  which is completely distinct from the automatic differentiation code
18:26:07  and unrelated to it
18:27:26 * elliott tries to find sigfpe's longer post.
18:28:24  elliott: OK, so automatic differentiation there is an optimization of an optimization of symbolic differentiation where you're superstrict
18:28:30  no
18:28:33  it's basically a specialiser
18:28:36  no
18:28:50  elliott: if you give in x as the argument, then you don't get any specialisation hapening
18:28:52  *happening
18:28:53 * elliott will just keep saying "no" every time you make an incorrect statement, since you don't actually listen to the corrections.
18:28:58  ais523: you can't give x in as an argument. x is not a number.
18:29:04  > deriv (sin :: Double -> Double) pi
18:29:07  elliott: nor is d
18:29:12  you cannot pass x to that sin
18:29:15  because it only takes Doublse
18:29:16  Doubles
18:29:19  oh wait, type error
18:29:22 -!- quintopia has quit (Ping timeout: 244 seconds).
18:29:24  sigh
18:29:25  anyway
18:29:28  automatic differentiation works because it redefines * on d
18:29:30  such that d*d = 0
18:29:32  no
18:29:53    Couldn't match expected type `Data.Number.Dif.Dif a'
18:29:53          against inferr...
18:29:55  elliott: the type error there is /mandatory/
18:30:00  because, d is not a Double
18:30:10  yes, it is, it was a trivial mistake and irrelevant because you don't actually understand how AD works
18:30:17  > deriv (sin :: Dif Double -> Dif Double) pi
18:30:18 -!- Phantom_Hoover has joined.
18:30:18    -1.0
18:30:31  I presume a Dif Double accepts d
18:30:33  and also, are not interested in understanding, as opposed to just telling me I'm wrong and apparently Wikipedia and everyone else on the planet too based on misunderstandings
18:30:35  so I'm done
18:30:46  elliott: I've read the page, and I understand AD pretty well, by now
18:30:53  it's orthogonal to symbolic versus not symbolic
18:31:11  however, it requires redefining terms in the original expression
18:31:20  and thus, you need a symbolic version of the input
18:31:46  no you don't, you just need a polymorphic function
18:32:25  Is there an instance (Num a) => Num (Dif a)?
18:32:35  I would hope so.
18:32:46  > let f :: forall a. (Floating a) => a -> a; f x = sin x + cos x {- haskell has no facility for "inspecting" this function symbolically -} in (f (pi :: Double), deriv f (pi :: Double))
18:32:47    (-0.9999999999999999,-1.0000000000000002)
18:33:32  elliott: actually, Haskell /can/ inspect that function symbolically
18:33:38  incorrect
18:33:45  create a new type, of typeclass Floating, that builds an AST
18:33:48  and defines sin, +, cos
18:33:54  (which it does, as it's of typeclass Floating)
18:34:00  that is not "inspecting the function symbolically"
18:34:06  also, types aren't "of typeclasses".
18:34:07  how is it not?
18:34:15  well, with an instance of that typeclass
18:34:20  ais523: by that argument, map is "symbolic"
18:34:24  I didn't mean to imply that a type could only belong to one typeclass
18:34:30  > map (\x -> "f " ++ show x) [1,2,3,4]
18:34:31    ["f 1","f 2","f 3","f 4"]
18:34:35  elliott: but, umm, it is?
18:34:35  OMG SYMBOLIC!
18:34:54  > cycle ["yes no "] --tl;dr
18:34:56    ["yes no ","yes no ","yes no ","yes no ","yes no ","yes no ","yes no ","yes...
18:34:59  oops
18:35:02  > foldr (\a b -> a ++ " `f` (" ++ b ++ ")") "z" ["a","b","c","d"]
18:35:03    "a `f` (b `f` (c `f` (d `f` (z))))"
18:35:04  > cycle "yes no " --tl;dr
18:35:05  OMG FOLDR IS SYMBOLIC
18:35:05    "yes no yes no yes no yes no yes no yes no yes no yes no yes no yes no yes ...
18:35:12  elliott: again, why would you expect it to not be?
18:35:16  EVERYTHING IS SYMBOLIC DESPITE THERE BEING NO SYMBOLIC SEMANTICS IN HASKELL OR CODE IN GHC
18:35:16  it doesn't need to evaluate anything
18:35:26  ais523: it's true that if you define every function as symbolic, then AD is symbolic, yes.
18:35:39  maybe there are even two people on the planet stupid enough to take such a view
18:35:41  wait, actually, no
18:35:54  hmm
18:36:27  ais523: btw, I think you'll find that most implementations of AD look like data Dif a = Dif a a, which has a conspicuous lack of symbolic d.
18:36:41  (d = Dif 0 1, _not_ symbolic at all, _not_ handled specially by the Num instance at all)
18:36:43  elliott: right, that's a specialization
18:36:55  no, that's the definition
18:37:00  > deriv (const 4) pi
18:37:02    0
18:37:05  http://en.wikipedia.org/wiki/Dual_number
18:37:13  ah, I know why map isn't symbolic, despite everything; it's because it doesn't try to provide definitions for any of the subexpressions of the original
18:38:36  AD is that differentiation thing— yep.
18:39:35 -!- quintopia has joined.
18:39:35 -!- quintopia has quit (Changing host).
18:39:35 -!- quintopia has joined.
18:39:53  > deriv (\x -> x^x) x
18:39:54    No instance for (GHC.Real.Integral
18:39:54                      (Data.Number.Dif.Dif...
18:39:54  Are you discussing whether it counts as symbolic derivation or not.
18:39:58  > deriv (\x -> x**x) x
18:39:58  oh, forgot Conal has a serise of posts about it: http://conal.net/blog/posts/what-is-automatic-differentiation-and-why-does-it-work
18:39:59    (1 * recip x * x + log x * 1) * exp (log x * x)
18:40:00  What should I name the function to put the barrier monad into the other form?
18:40:01  elliott: hmm, I think you'll agree with the following statement: "Any function that doesn't mention Dif and is valid input to dif is also valid input to \f -> f x"
18:40:06  Phantom_Hoover: no, ais is blindly claiming it is without justification
18:40:18  do you?
18:40:43  (where x is Expr's x, there)
18:40:44  ais523: no, (Dif a) could easily have instances that Expr doesn't
18:40:55  Replace every number X  with the number x + x'ε, where x' is a real number, but ε is nothing but a symbol with the property ε^2 = 0. Using only this, we get for the regular arithmetic
18:40:58  elliott: does it?
18:40:59  elliott: IT'S JUST A SYMBOL DUDE
18:41:02  elliott: SYMBOLIC
18:41:02  and would it make sense for it to?
18:41:02  It's... kind of symbolic, in that it only works for functions that only use + and *, but that's not really symbolic in the conventional sense.
18:41:09  and couldn't the same instances be added to Expr too?
18:41:16  kallisti: moron
18:41:25  Phantom_Hoover: Uhh, it works for functions that use plenty other than + and *.
18:41:32  elliott, hmm, like?
18:41:37  Phantom_Hoover: AD is widely used to differentiate entire procedural algorithms written in C.
18:41:44  Phantom_Hoover: Like anything?
18:41:47  Any operator.
18:41:55  elliott: (note: sarcasm)
18:41:57  ais523: I don't know whether it does
18:42:01  elliott: but they need either the source code or the resulting binary to work, presumably
18:42:05  Sorry, I meant to clarify, that doesn't use any numerical operations other than + and *.
18:42:21  ais523: if you made your question precise -- "any f :: (Num a) => a -> b can have be applied to (x :: Expr) where instance Num Expr"... no shit?
18:42:28  Phantom_Hoover: ...no?
18:42:41  so, I think by "symbolic", I mean "there is enough polymorphism present that you can just give a lot of AST-building definitions of the operators and end up with a parse tree of the function"
18:42:46 -!- zzo38 has quit (Remote host closed the connection).
18:42:47  > deriv sin (x :: Expr)
18:42:48  which is clearly different from your definition, thus the argument
18:42:49    1 * cos x
18:42:57  elliott, how would you use it on, say, ln x.
18:43:04  I notice a distinct lack of + and *
18:43:08  ais523: your definition is ridiculous: every polymorphic function becomes symbolic
18:43:17  Without using the series expansion; that's just expressing it in terms of + and *.
18:43:23  > deriv log (x :: Expr)
18:43:24    1 * recip x
18:43:29  > deriv log (pi :: Double)
18:43:30    0.3183098861837907
18:43:35  elliott: hmm, I suppose they are
18:43:36  Using Expr just confuses things.
18:43:39  and that's probably a good thing
18:43:43  elliott: I think it clarifies.
18:43:48  it doesn't
18:43:51  because Expr only works for a small subset
18:44:05  iirc it fucks up on abs or something, I forget exactly what I ran into when I tried to use AD with Expr
18:44:05  well, because it's missing instances, but right
18:44:13  no
18:44:14  > abs x
18:44:15  because the types don't work out
18:44:16    abs x
18:44:22  > deriv abs (x :: Expr)
18:44:23    signum x * 1
18:44:32  > deriv signum (x :: Expr)
18:44:32    0
18:44:35   iirc it fucks up on abs or something, I forget exactly what I ran into when I tried to use AD with Expr
18:44:42  "I forget exactly what I ran into"
18:44:50  indeed
18:45:00  and I'm currently trying to work out what leads to the sin -> cos case
18:45:21  Floating instance for dual numbers.
18:45:23  I think?
18:45:29  ais523: the definition of sin for Diff references cos, obviously
18:45:35  ais523: as the definition of sin for dual numbers /involves/ cos
18:45:40  because of the infinitesimal part
18:45:49  ais523: but the sin and cos referenced are those of the underlying numeric type
18:45:54  aha, of course
18:45:59  and for Expr, that consists of prepending "cos " (roughly)
18:46:40  elliott, but, um, seriously, the proof of AD uses a polynomial; how do you use it on things that aren't polynomials?
18:46:53  magic.
18:47:03  Phantom_Hoover: well, all the things that it's being tried on are polynomials
18:47:14  in the case of sin/cos, they're infinite-degree, but still polynomials
18:47:26  and in general, working on all polynomials means it works on anything that has a Taylor expansion
18:47:35  and things that don't are unlikely to be meaningfully differentiable anyway :)
18:47:55  Note that the standard ad libraries don't actually define things via Taylor expansions.
18:48:04  elliott, yes, so how do they do it?
18:48:07  no, because it would be stupid to do so
18:48:17  they're only relevant in proving that the technique works
18:48:23  Phantom_Hoover: they use basic calculus.
18:48:30  Um, no?
18:48:38  Phantom_Hoover: sin = liftAD sin cos
18:48:56  for instance
18:49:01  the ad library has
18:49:07      lift1  :: Num a => (a -> a) -> (D t a -> D t a) -> t a -> t a
18:49:08  What does liftAD do?
18:49:19  where sin = lift1 sin cos
18:49:25  Phantom_Hoover: Depends on which type you use
18:49:29  for the simple
18:49:29  data Forward a = Forward !a a deriving (Show, Data, Typeable)
18:49:30  it's
18:49:33      lift1 f df (Forward b db) = Forward (f b) (dadb * db)
18:49:34          where
18:49:34              Id dadb = df (Id b)
18:49:42  (where
18:49:42      type D Forward = Id
18:49:42  )
18:50:58 -!- oerjan has joined.
18:51:21  oerjan: why did you put the tunes logs in the topic? I logread but didn't see anything about it :P
18:51:43  elliott: it was while glogbot was crashed
18:51:52  elliott: that's a lot of glue code..
18:51:52  ah
18:51:58  kallisti: because it's generic
18:52:01  kallisti: it has all kinds of AD types
18:52:12  including like
18:52:13  -- | A @Tape@ records the information needed back propagate from the output to each input during 'Reverse' 'Mode' AD.
18:52:13  data Tape a t
18:52:13      = Lift !a
18:52:13      | Var !a {-# UNPACK #-} !Int
18:52:14      | Binary !a a a t t
18:52:16      | Unary !a a t
18:52:17  elliott: right. I think probably a simple example would be easier to follow though?
18:52:18      deriving (Show, Data, Typeable)
18:52:20  -- | @Reverse@ is a 'Mode' using reverse-mode automatic differentiation that provides fast 'diffFU', 'diff2FU', 'grad', 'grad2' and a fast 'jacobian' when you have a significantly smaller number of outputs than inputs.
18:52:23  newtype Reverse a = Reverse (Tape a (Reverse a)) deriving (Show, Typeable)
18:52:25  that uses StableNames and observable sharing and shit
18:52:26  kallisti: I was giving an actual example
18:52:30  elliott: yes I know.
18:52:32  to show something that actually works
18:53:01  big :: Nat -> Bool
18:53:01  big (S (S (S (S (S (S (S (S (S (S _)))))))))) = True
18:53:01  big _ = False
18:53:02  what a swell function
18:53:36  but you could also just say sin (Dif x dx) = Dif (sin x) (dx * cos x)
18:53:39  to demonstrate the basic idea.
18:53:48  sure
18:53:51  elliott, hangonhangonhangon, is liftAD just /defining/ the derivative?
18:54:07  Phantom_Hoover: sin on the dual numbers inherently involves cos.
18:54:13  It's not "defining" the derivative.
18:54:26  Computing sin on the dual numbers involves computing sin on the underlying number type, and cos on the same dual number type.
18:54:39  You could also define "sin x = x+1", it just wouldn't be sin.
18:54:50  Similarly, the only sin for the dual numbers is lift1 sin cos.
18:55:02  Oh, OK.
18:57:10  elliott: the formal definition of dual numbers is oddly similar to complex numbers.
18:57:22  kallisti: it's not really odd
18:57:22  Well nawww.
18:57:26  kallisti: complex numbers is adding i^2 = -1
18:57:29  kallisti: dual numbers is adding d^2 = 0
18:57:39  they're both gonna end up looking pretty similar :P
18:57:44  right that is the similarity I was talking about. :P
18:58:10  it's basically just a different complex number algebra.
18:58:44  A different complex number algebra?
18:58:45 -!- derrik has joined.
18:59:12  oh you can do second derivatives like this also you just need a second level
18:59:13  or more generally
18:59:19  data Diff a = Diff a (Diff a)
18:59:24  The complex numbers are just ((R,R), +, *); change + or * and you don't have the complex numbers any more.
18:59:27  but some things stop terminating if you do it like /that/ :P
19:00:01  Phantom_Hoover: you can't take square roots, sins, and cosines of complex numbers?
19:00:17  well, scratch square roots actually
19:00:27  kallisti, those are all derived from the stuff I stated.
19:01:13  oh right division.
19:01:15 * elliott wishes there was Automatic Integration. :p
19:01:20  Codual numbers!
19:01:31  elliott: make them
19:01:42  publish paper
19:01:43  get rich
19:03:31  kallisti, we can already do integration on polynomials really easily.
19:04:07  but not with codual numbers!
19:04:25  Phantom_Hoover: --Phantom "Help runge kutta" Hoverboard
19:04:49  elliott, hey, I found highly contradictory information on what it could be applied to!
19:05:13  Phantom_Hoover: (Wait what if we just rewrote Newtonian physics with polynomials?)
19:05:19  Phantom_Hoover: (THINK ABOUT IT)
19:05:28  Phantom_Hoover: are you sure you don't need like triangles or something to define sine?
19:05:30  elliott, they tried that, turns out it's impossible.
19:05:42  Phantom_Hoover: Maybe they didn't try hard enough?
19:05:48  Phantom_Hoover: Maybe they used the wrong foundation.
19:05:52  kallisti, sin x = x - x^3/3! + x^5/5! - ...
19:05:53  Let's try it with THE POWER OF TYPE THEORY AND UNSAFECOERCE.
19:05:58 -!- azaq23 has joined.
19:06:02 -!- azaq23 has quit (Changing host).
19:06:02 -!- azaq23 has joined.
19:06:32  kallisti, this definition is demonstrably equivalent to the triangle one, although it's pretty circuitous to actually show it.
19:06:45  Phantom_Hoover: oh okay. but then you forgot the infinite paper.
19:06:52  elliott: aren't those two opposite powers?
19:06:52  Phantom_Hoover: 3/3! = 1! = 1 idiot dummy
19:07:04  sin x = x - x^1 + x^1 - ...
19:07:05  ===
19:07:08  sin x = x - x + x - ...
19:07:10  .Q.E.D
19:07:10  olsner, yes, they fight crime.
19:07:24  elliott "bad at teaching" hird
19:07:28  You've proven that sin x doesn't converge for all x?
19:07:35  Well, all nonzero x.
19:07:41  Phantom_Hoover: no we just need to use
19:07:42  ooh, TYPE CRIME, it's like thoughtcrime
19:07:44  ZETA FUNCTION REGULARISATION
19:07:49  it solves all summing problems
19:07:57  elliott, I think fax may have been a bad influence on you.
19:08:00 * kallisti has never had a problem summing.
19:08:23  Phantom_Hoover: OK I have determined that sin(x) = 1/4e^pi + (x*0.0000000000014) for all x apart from 3.
19:08:30  sin(3) = god.
19:08:53  Is that what zeta function regularisation actually says.
19:09:05  Yes. It has helped us find god.
19:09:12  Thanks, zeta function regularisation. Theta function regularisation.
19:09:52  Phantom_Hoover: I really want to believe in string theory because one kind of string theory involves using zeta function regularisation to work out a sum for actual physical things???
19:10:02  I want to believe that God is awesome enough to put that into physics.
19:10:11  elliott, check out the WP article?
19:10:20  elliott: too bad that's bad because string theory ew
19:10:31  Phantom_Hoover: ?
19:10:45  The first example is bog-standard QFT.
19:11:00  Phantom_Hoover: Is it? YESSSSSSSSSSSSS
19:11:04  THANKS GOD
19:11:12  kallisti: Aw c'mon, everyone likes string theory, it's so elegant!
19:11:34  (Before Phantom_Hoover rips into me: it's a joke.)
19:12:15  elliott, wait, how much do you actually know about zeta function regularisation beyond "you can use it to prove mad things about infinite sums".
19:12:29  elliott: sometimes I feel like have a superpower to recognize jokes.
19:12:33  unless they're just incredibly deadpan.
19:12:41  Phantom_Hoover: I am like the world's foremost expert of zeta function regularisation?
19:12:55  elliott, what's the zeta function.
19:13:05  Phantom_Hoover: RIEMANNIAN
19:13:22  elliott: of all the people I know you seem to know the most about it, so that's a yes
19:13:29  Riemann, mon.
19:13:36  olsner, you knew fax, no?
19:14:22  Zeta-Function Regularization is Uniquely Defined and Well
19:14:24  E. Elizalde
19:14:26  (Submitted on 6 Aug 1993)
19:14:28  Hawking's zeta function regularization procedure is shown to be rigorously and uniquely defined, thus putting and end to the spreading lore about different difficulties associated with it. Basic misconceptions, misunderstandings and errors which keep appearing in important scientific journals when dealing with this beautiful regularization method ---and other analytical procedures--- are clarified and corrected.
19:14:33  Q.E.D. bitchen
19:14:46  Phantom_Hoover: nope, I've never used fax
19:15:11  elliott, is E. Elizalde you in a previous life.
19:15:17  Phantom_Hoover: Yes.
19:15:27  Phantom_Hoover: I revived two years later.
19:15:56  I should probably learn some analysis sometime, it seems cool.
19:16:52  Phantom_Hoover: Yes then you will know 1 thing, ha ha ha
19:17:05   :'(
19:17:15   oh come on, Haskell, no breakMonads function? <-- it makes very little sense to do that for an arbitrary monad
19:17:46  because different monads need different kind of setup to get started
19:17:52  elliott, update
19:17:55  oerjan: some can't get started at all
19:18:01  kallisti: dupdog
19:18:02  What does breakMonads do.
19:18:17  Phantom_Hoover:  @hoogle (Monad m) => m a -> a
19:18:28  would be its type
19:18:56  Ah, yes, the classic "help i want out" response to a monad.
19:19:33  Don't most useful monads have a function like that, except with more arguments?
19:19:37  i mean, _even_ if you admit unsafePerformIO it still doesn't make sense for every monad.
19:19:54  oerjan: unsafePerformIO is in the report :)
19:19:59  Sgeo: yeah.  except sometimes the output too has more arguments.
19:20:05  Sgeo: not necessarily
19:20:09  e.g. lists
19:20:15  I mean, the function monad doesn't, except it does if you consider the input "more arguments"
19:20:18  Sgeo, and there's the crux of the matter: m a isn't associated with any particular value of a.
19:20:30  14:17 < elliott> kallisti: dupdog
19:20:33  elliott: what about it?
19:20:33  elliott, why shouldn't I?
19:20:45 -!- sebbu2 has joined.
19:20:45 -!- sebbu2 has quit (Changing host).
19:20:45 -!- sebbu2 has joined.
19:20:49  oerjan: well you could always add it as a method to Monad, with the default definition of undefined
19:20:58  Sgeo: well you are basically just defining "useful monad" as "something which can be turned into a function from something else to something with an a in it"
19:21:01  so that it still breaks arbitrary monads. :>
19:21:14  kallisti: yeah fail needs company in its brokenness
19:21:15  But yes, like Phantom_Hoover said.
19:21:18  I think (a -> Bool) is a monad.
19:21:22  (pure sets)
19:21:30  oh, for Eq a
19:21:46 -!- sebbu has quit (Ping timeout: 248 seconds).
19:21:58  er hm
19:21:59  elliott: Cont r may be a better example
19:22:02  elliott, what's wrong with that as a definition of a useful monad?
19:22:02  how do you do join
19:22:08  Sgeo: (a -> Bool) -> a
19:22:11  can you write that?
19:22:12  you just cannot get an a result out of that
19:22:38  elliott, least value of a such that the function results in true, for some arbitrary well-ordering.
19:22:42  assuming r and a are not allowed to depend on each other
19:22:44  oerjan, even with applying id?
19:22:46  Phantom_Hoover: you only have (Eq a)
19:22:49  Sgeo: um
19:22:51  ZFC'd.
19:22:52  newtype PS a = PS (a -> Bool)
19:22:54  erm, using id
19:22:58  run :: (Eq a) => PS a -> a
19:23:08  Sgeo: id doesn't give you Cont r a -> a
19:23:12  oh
19:23:13  for Cont, ok
19:23:21 -!- nooga has joined.
19:23:21  :t runCont
19:23:22  forall r a. Cont r a -> (a -> r) -> r
19:23:40  oerjan: oh PS isn't a monad
19:23:41  unfortunately
19:23:41  You... get an r?
19:23:45  obviously that shows id works if a = r
19:23:48  because it's not a functor, it's a contrafunctor
19:24:07  er, hmm
19:24:09  that seems wrong
19:24:14  because Set /is/ a monad, modulo Ord constraint
19:24:16  so what's up?
19:24:24  Sgeo: note that breakMonad was supposed to have the type forall m a. Monad m => m a -> a
19:24:37  fmap :: (a -> b) -> (a -> Bool) -> (b -> Bool)
19:24:37  *breakMonads
19:24:41  wtf
19:24:46  oerjan: how is Set a monad again? that makes no sense
19:25:01  elliott: it's not
19:25:07  oerjan: MODULO ORD CONSTRAINT
19:25:42  ugh
19:25:47  it's because Set can access its inner "list of values"
19:26:22  elliott: apply f to that list, then nub . sort, i presume
19:26:40  oerjan: yes, but it's really gross because it means Set is nothing like a set :(
19:26:44  oh, and set union somewhere
19:26:51  elliott: yes the set monad is basically the same as the list monad, modulo ord constraint
19:27:03  oerjan: even worse: you can't define contramap for Set
19:27:09  but you /can/ for (-> Bool)
19:27:14  Sets are like the opposite of sets :P
19:28:53  contramap?
19:28:59 -!- sebbu2 has changed nick to sebbu.
19:29:49  Sgeo: see contravariant package
19:31:26  contramap scares me
19:31:32  -> Bool is a contravariant functor, yes.  also it's its own adjoint functor, and when you compose those you get Cont Bool as the monad.
19:32:08  oerjan: yes, i'm just annoyed that (Set a) and (a -> Bool) are almost opposites
19:32:14  Set has fmap, (-> Bool) has contramap
19:32:41  I would think of the former as the latter except (a) faster and (b) you can get a magic ordered list of values out of it, but that doesn't affect what you can actually "do" to it :P
19:33:16  elliott: it may be somewhat analogous to how a finite dimensional vector space is its own dual, but the isomorphism is not natural (you need to pick an arbitrary basis)
19:33:24  heh
19:33:55  oerjan: I'm trying to think of monads that you can't "run" apart from data Trivial a = Trivial (or was it data Trivial a) and Cont...
19:34:04  having a hard time of it :P
19:34:25  elliott: hmmm.. what is "run" for lists?
19:34:40  kallisti: head :P
19:34:46  ah
19:34:47  but more relevantly,
19:34:50  [a] -> Maybe a
19:34:57  Sgeo probably considers that close enough to "running"
19:35:02  since (Maybe a) sometimes has an a in it
19:35:20  elliott: at least you know when it doesn't run.
19:35:55  so wait is Sgeo arguing in favor of breakMonads or something? I haven't been paying attention
19:36:44  come to think of it, inner products are what you add to _make_ that self-dualism natural for vector spaces, maybe there's an analogue for Set a and a -> Bool
19:39:11  safeIndex would probably be better
19:39:30  fsvo "better"
19:39:47  FSVO IS MINE
19:39:48  MIIIIIIIINE
19:41:10  elliott: friendship fsvo
19:41:22  elliott: ... fsvo fsvo
19:41:30  iouhfjkhflsd
19:41:36  elliott: hi friendship fsvo help
19:41:46  monqy: HELP
19:41:50  monqy: hlep
19:41:51  fsvo friendship
19:42:58  :t Expr
19:42:59  Not in scope: data constructor `Expr'
19:43:02  @hoogle Expr
19:43:03  Text.Parsec.Expr module Text.Parsec.Expr
19:43:03  Text.ParserCombinators.Parsec.Expr module Text.ParserCombinators.Parsec.Expr
19:43:03  Text.ParserCombinators.Parsec.Expr buildExpressionParser :: OperatorTable tok st a -> GenParser tok st a -> GenParser tok st a
19:43:19  hmm is there a SimpleReflect type that has a parameter?
19:44:10  http://hackage.haskell.org/packages/archive/show/0.4.1.1/doc/html/SimpleReflect.html
19:45:47  so no
19:46:07  would a... simple-reflect monad be possible?
19:46:15  heh
19:46:44  elliott, kallisti: hi
19:46:51  monqy: stop kallisti
19:46:57 -!- sebbu2 has joined.
19:46:57 -!- sebbu2 has quit (Changing host).
19:46:57 -!- sebbu2 has joined.
19:47:01  kallisti: no. return :: a -> Reflect a
19:47:02  qhat did kallisti do
19:47:03  what string do you use?
19:47:09   fsvo "better"
19:47:09   FSVO IS MINE
19:47:09   MIIIIIIIINE
19:47:09   elliott: friendship fsvo
19:47:09   elliott: ... fsvo fsvo
19:47:10   iouhfjkhflsd
19:47:12   elliott: hi friendship fsvo help
19:47:14   monqy: HELP
19:47:16   monqy: hlep
19:47:26  kallisti: :(
19:49:52  :)
19:49:58 -!- Klisz has joined.
19:51:06 -!- sebbu has quit (Ping timeout: 248 seconds).
19:52:57  https://github.com/ghc/testsuite/commit/dfdb979305d5ebb7b28fcabce06d9095d81d34da
19:53:01  monqy: oerjan: Phantom_Hoover: terrifying
19:53:36  ???
19:53:47  terrifying
19:54:27  But that’s not all! Humble Introversion Bundle customers now have access to the source code for Darwinia, Multiwinia, DEFCON, and Uplink! Once you've purchased the bundle, check your download page for a source snapshot and gain access to Introversion's developer forums, wiki, and SVN repository.
19:54:28  !!!!!!!1183748975438957
19:54:44  you mean the call stack thing which he promised a while ago?
19:54:59  oerjan: yes but I DIDN'T KNOW IT WAS BEING EXPOSED TO USER CODE...
19:55:12  https://plus.google.com/107890464054636586545/posts/YJzAAxw28N7
19:55:22  heh
19:56:47  what is this thinge..
19:57:12  call stack inspection for ghc haskells?
19:57:19  terrifying indeed
19:57:31  what about call stack /manipulation/?
20:00:07  elliott, I think this is old news that I saw in here but didn't process properly, but Introversion source now available for Humble Bundle purchasers
20:00:16   But that’s not all! Humble Introversion Bundle customers now have access to the source code for Darwinia, Multiwinia, DEFCON, and Uplink! Once you've purchased the bundle, check your download page for a source snapshot and gain access to Introversion's developer forums, wiki, and SVN repository.
20:00:16   !!!!!!!1183748975438957
20:00:16   you mean the call stack thing which he promised a while ago?
20:00:16   oerjan: yes but I DIDN'T KNOW IT WAS BEING EXPOSED TO USER CODE...
20:00:17   https://plus.google.com/107890464054636586545/posts/YJzAAxw28N7
20:00:19   heh
20:00:21   what is this thinge..
20:00:23   call stack inspection for ghc haskells?
20:00:25   terrifying indeed
20:00:27   what about call stack /manipulation/?
20:00:29   elliott, I think this is old news that I saw in here but didn't process properly, but Introversion source now available for Humble Bundle purchasers
20:00:35  sgeo's memory lasts less than 6 minutes
20:00:46  elliott, I could swear I saw it earlier than 6 minutes ago
20:00:51  Like hours ago or something
20:02:30  elliott: maybe his memory only keeps the first reference
20:03:40  like: "Major online game" -> "Active Worlds"
20:03:55 * oerjan coughs
20:04:15  :D
20:04:40 -!- Jafet has quit (Quit: Leaving.).
20:05:33  wow, he remembers things from hours ago, Sgeo is quite the memory artist
20:06:10  he should join a circus
20:06:12  that's nothing, i remember things from _months_ ago.  like, er, um...
20:06:16  :D
20:06:17  you too
20:06:19 -!- GreaseMonkey has joined.
20:06:19  Introversion forums, why are you down?
20:08:22 -!- sebbu2 has changed nick to sebbu.
20:08:39 * kallisti still remembers most of his schedule throughout high school.
20:09:11  and college schedules, even!
20:09:31  i vaguely remember that i once remembered my schedule
20:10:40  I think I took some typing class and geometry at the same time.
20:10:42  so bad.
20:10:54  typing
20:10:55  class
20:10:59  ??????
20:11:00  yes.
20:11:07  it was like "how to use microsoft office: the class"
20:11:13  wow great
20:11:14  and it included a lot of typing of documents
20:11:16  and spreadsheets.
20:11:28  it was actually awesome because I would always finish first and then basically do nothing the rest of the class.
20:11:35  normally doing nothing is boring
20:11:40  but doing nothing with a computer is AWESOME.
20:11:46  most of my high school schedule was unscheduled time, not exactly hard to remember that schedule
20:11:51 * Phantom_Hoover downloads the Uplink source.
20:12:25  monqy: I also took this class called construction
20:12:27  it was hilarious
20:12:30  and awful.
20:12:37  I'm imagining a class about playing with blocks
20:12:39  I USED SAWS. YEAAAAAH
20:12:50  I'm bad at saws.
20:12:56  We call that DT over here.
20:13:01  well except jigsaws. jigsaws are fun.
20:13:22  I made a stick man out of metal and also a plastic self-portrait.
20:14:55  Phantom_Hoover: So, a stick man out of metal and a stick man out of plastic?
20:15:07  No, it was a Phantom_Hoover.
20:15:59 -!- Slereah has joined.
20:16:37  http://en.wikipedia.org/wiki/File:Frida_Kahlo_(self_portrait).jpg  "Its inclusion in the article adds significantly to the article because it shows the subject of the article"
20:16:42  Frida Kahlo is the history of art.
20:17:42 -!- Slereah_ has quit (Ping timeout: 260 seconds).
20:26:04  "As you’ve discovered, the grandaddy machine-learning algorithm of them all, back-propagation, is nothing but steepest descent with reverse mode automatic differentiation. This means that if you wrote a neural network that simply evaluated, but didn’t know how to learn, and passed it into a routine for optimisation using steepest descent by reverse mode AD, then it would use back-propagation without anyone having to even know that such a thing
20:26:04   as back-propagation existed. Internally it would actually perform exactly the same operations as back propagation."
20:26:10  ais523: thanks for being wrong, it's made me google up things and remember how cool AD is
20:30:56  elliott: neat
20:33:42  > deriv log 0
20:33:43    Infinity
20:33:47  ha ha ha ha
20:33:57  > deriv abs 0
20:33:58    0
20:34:13  shocking
20:34:20  >deriv (\x -> if x > 5 then 0 else x) 4
20:34:25  > deriv (\x -> if x > 5 then 0 else x) 4
20:34:27    1
20:34:29  > deriv (\x -> if x > 5 then 0 else x) 6
20:34:30    0
20:34:58  If I put in 5 it's going to be 1, isn't it, even though that's not the right answer
20:35:01  > deriv (\x -> if x > 5 then 0 else x) 5
20:35:02    1
20:35:17  how is it not right?
20:35:28  oh, nevermind..
20:35:47  "limits? what are those?"
20:35:49  Sgeo: Were you expecting itto work perfectly?
20:35:53  *it to
20:36:01  elliott, no, but I can dream, can't I?
20:36:10  No.
20:36:35  Hmm, maybe there should be an if' function that ... does something
20:36:49  what
20:36:53  elliott: how does it determine that constants have a derivative of zero but variables have a derivative of one. actually nevermind I see how it works for variables but not for constants.
20:37:18  it just passes in the argument with the 1
20:37:25  I suppose you could have (==*) :: (Eq a) => Diff a -> Diff a -> Diff Bool; ifE :: Diff Bool -> Diff a -> Diff a, but I have no clue what you'd do with Diff Bools.
20:37:30  if' :: (Num a) -> a -> (a,a) -> (a -> a) -> (a -> a) -> a
20:37:40  :t deriv
20:37:41  forall a b. (Num a, Num b) => (Dif a -> Dif b) -> a -> b
20:37:48  oh... nevermind
20:37:49  kallisti: const 1 :: Diff Double -> Diff Double
20:37:52  kallisti: === const (D 1 0)
20:37:53  kallisti: fromInteger in the Num instance?
20:38:00  i havent read the thing
20:38:01  const (D 1 0) (D 0 1) == (D 1 0)
20:38:01  ;_;
20:38:03  blah blah blah
20:38:08  a while ago i read stuff about AD then i forgot it all
20:38:08  oops
20:38:25  elliott "bad at teaching still" hird
20:38:39  but I got it
20:38:40  so nevermind.
20:40:29  monqy: I keep forgetting fromInteger is a method of Num and not just some magical thing somewhere else.
20:41:52  > deriv (\x -> 2*x) 3
20:41:54    2
20:42:32  > deriv (sin + cos) x
20:42:32    1 * cos x + 1 * negate (sin x)
20:42:37  > reduce $ deriv (sin + cos) x
20:42:38    1 * cos x + 1 * negate (sin x)
20:42:41  :-(
20:43:00  :t reduce
20:43:01  Expr -> Expr
20:43:17  :t reduce $ x - x
20:43:18  Expr
20:43:27  > reduce $ x - x
20:43:29    x - x
20:43:38  @src reduce
20:43:39  reduce _ 0 = undefined
20:43:39  reduce x y = (x `quot` d) :% (y `quot` d)
20:43:39      where d = gcd x y
20:43:39  @hoogle (a -> a) -> a -> Int -> a
20:43:40  Data.Sequence iterateN :: Int -> (a -> a) -> a -> Seq a
20:43:40  Data.Sequence adjust :: (a -> a) -> Int -> Seq a -> Seq a
20:43:41  Data.IntMap adjust :: (a -> a) -> Key -> IntMap a -> IntMap a
20:43:50  Sgeo: wrong reduce
20:44:04  Huh.
20:44:20  I'd've thought that function would be one of the basic ones.
20:44:44  Phantom_Hoover: To do what? Iterate a function?
20:44:47  The arguments are all the wrong way around.
20:44:53  Int -> (a -> a) -> a -> a would be the right way.
20:44:56  iterate and !!, tada!
20:45:17  elliott, I thought Hoogle was order-blind.
20:45:30  Phantom_Hoover: It doesn't exist in the stdlib.
20:45:33  I'm just saying if it did...
20:47:13  @pl i n f a = iterate f a !! n
20:47:13  i = flip (flip . ((!!) .) . iterate)
20:47:27  :t (n f a = iterate f a !! n
20:47:28  parse error on input `='
20:47:28  er
20:47:35  :t (\n f a -> iterate f a !! n)
20:47:36  forall a. Int -> (a -> a) -> a -> a
20:47:54 -!- pikhq_ has joined.
20:47:55 -!- pikhq has quit (Ping timeout: 252 seconds).
20:50:40 -!- Phantom_Hoover has quit (Ping timeout: 244 seconds).
20:52:27  > foldr (\x acc -> x:acc) [] [x,y,z]
20:52:28    [x,y,z]
20:52:45  > foldr (:) [] [x,y,z] -- before someone yells at me about the lambda
20:52:46    [x,y,z]
20:53:23  @help quickcheck
20:53:24  help . Ask for help for . Try 'list' for all commands
20:53:28  @quickcheck
20:53:29  Unknown command, try @list
20:53:30  Sgeo: too late. you can't fix it.
20:53:42  shouldn't use lambdas for simple things.
20:54:27  so. I'm kind of bad at quantum mechanics. enlighten me: is there anything in quantum mechanics that disproves determinism?
20:54:32  I think there is.
20:54:49  Well, disproves it assuming you hold to no causal influences exceeding c
20:54:54  Wait, no
20:55:09  Hidden variables are disproved assuming no non-local influences
20:55:31  I think multiple-worlds is considered deterministic without being a local variable theory
20:58:44  I
20:59:22  'm just wondering if my deterministic viewpoint is perhaps unwarranted due to things I don't understand about the universe.
21:11:02  elliott, kallisti update
21:17:04 -!- Ngevd has joined.
21:19:16  Hello!
21:20:16  I found a 29-step wiki surf loop
21:26:18  first link or last link?
21:26:33  It loops
21:26:35  Um
21:26:58  I'm not sure which link you mean
21:28:45  do you follow the first or last link on each page?
21:28:50  Last in the intro
21:29:52  I put the path in an article on our wiki
21:29:59  err, that sounds off-topic
21:30:07  In my userspace
21:30:09  oh
21:30:17  User:Taneb/Wiki surf
21:30:22  "made because I am bored and lonely and have no access to IRC"
21:30:25  Ngevd: http://webchat.freenode.net/
21:30:30  Blocked in school
21:30:36  lame
21:37:30  Ngevd: i recalled some of the members of your loop from before but not the loop itself, so i followed it and the link Policy studies -> Public administration has already been broken by an edit
21:37:40  !!!
21:38:41  It is possible I made a mistake
21:39:04  Ngevd: no, there was definitely a recent edit prior to which that was correct
21:39:10  Wow
21:39:26  so, these long loops may not be very stable :P
21:41:40  in suspect the entire Public administration -> Policy studies part was included in what we did previously - all of them sound familiar.
21:42:07  tempting to write a bot to try and find these loops
21:42:17  *i suspect
21:42:27  longest path from A to A has to be something CS has optimised to hell by now, right? :)
21:42:36  heh
21:42:48  only need to do it some 2 million times to get the longest one
21:43:19  oerjan: (/is/ there a fast algorithm for that? :P)
21:43:45  well yeah you just need to iterate all pages and for each page follow its path until you hit one you already visited, so it's O(n) in total
21:44:24  and obviously that's as fast as you can hope for
21:44:31  well, OK :P
21:44:45  oerjan: already visited globally, or from the last iteration?
21:44:46  of the pagespace
21:44:51  globally
21:45:04  yeah i guess it's not too bad
21:45:07  unless you want to duplicate work
21:45:27  it should _still_ be O(n*max path length) if you don't, though
21:45:35  and you only have to track the set of seen pages
21:45:38  not all the paths
21:45:42  you can flush out paths to disk
21:45:46  so it won't take much ram either
21:46:14  seen pages and the path lengths of them
21:46:45  oerjan: hm right
21:47:36  and it will be slightly different if you hit a seen page from a previous iteration or a seen page from this one (the latter means a _new_ loop, naturally)
21:48:27  oerjan: um you can't have a new loop with an immutable set can you
21:48:31  because each page has exactly one successor
21:49:10  by definition there is only zero or one cycles involving any given page
21:50:02  elliott: by "new" i mean "not previously discovered"
21:50:11  ah
21:53:59  oerjan: dammit now I want to write this :P
21:54:49  getting the intuitive "last link" detection quite right might be tricky.
21:54:58  especially with your section rule.
21:55:00 -!- copumpkin has quit (Ping timeout: 244 seconds).
21:55:26  oerjan: well things like references and the "citation needed" links don't look like [[...]] in wikicode
21:55:43  well ok
21:55:44  so once you have a section, just scan back for a [[...]]
21:55:56  to isolate the section, just take up to the next line starting with =
21:56:04  or  interwiki links need to be ignored too, i've skipped some wiktionary ones
21:56:36  oerjan: yeah
21:57:52  oerjan: ooh now i'm imagining a pretty graph you could draw with this
21:57:59  actually hm would that work
21:58:03  oh no it wouldn't :(
21:58:26  and probably other namespaces, in case you hit an article which has no introduction links other than those top boxes
21:58:46  oh and what about side boxes, i've ignored those.  but i guess they are templates anyway.
21:58:49 -!- Patashu has joined.
21:58:51  oerjan: yeah, to both.
21:58:56  oerjan: it doesn't have to be completely perfect :P
21:59:11  oerjan: i doubt the longest chain involves ten non-templated side boxes that link into the Wikipedia namespace
21:59:28  MAYBE
21:59:54  oerjan: oh i thought of a graph that could be drawn. but it's very silly
22:01:03  maybe you could make a chain by following the random page link until the PRNG cycles
22:01:07  there's only one outgoing edge from each page.  reminds me of BackFlip's > command
22:01:53  oerjan: given a page p, start with a node of just that, and connect it to all the n-chains of p. the 0-chain of p is following the first link, the 1-chain of p is following the second (at each step, ofc), the (-1)-chain of p is following the last, the (-2)-chain is second-last, etc.
22:02:02  hmm that wouldn't work unless all pages had the same number of links :(
22:02:11  I JUST WANT A PRETTY GRAPH
22:02:27  hm
22:02:29 -!- Jafet has joined.
22:05:52  oerjan: ofc i could just draw a graph of all links but that kind of thing has been done and it isn't related to this game :P
22:06:11  (I wonder how well graphviz deals with such massive graphs...)
22:15:39 -!- oerjan has quit (*.net *.split).
22:16:00  smallest netsplit
22:16:03  netsplit kitten
22:16:08  so adorable
22:17:46  I'm pretty sure that that's just oerjan's quit message
22:18:03  ...no, it's not.
22:18:11 -!- oerjan has joined.
22:18:11  he usually goes for "Good night".
22:18:34  Then he must be unusually susceptible to netsplits?
22:18:45  false
22:18:47  wat
22:18:52  oerjan is up all the time
22:18:56  Or I sort of roll about half the people in this channel to one in my head?
22:19:36  I wonder in which half am I then
22:19:40  oerjan: oh. by the way
22:19:46  oerjan: I found an example of an applicative functor that isn't a monad, IIRC
22:19:48  way the by.
22:19:56  oerjan: on the epigram blog.
22:19:58  weigh the bi
22:20:15  IT DOESN'T COUNT IF IT NEEDS DEPENDENT TYPING
22:20:30  oerjan: um no, in haskell.
22:20:32  oerjan: http://www.e-pig.org/epilogue/?p=186
22:20:40 -!- Phantom_Hoover has joined.
22:20:41  "Structure cops will note that De is another example of an applicative functor which is not a monad — join would bring things from the far future to the near future, and that had better not be possible. However, where applicative functors in general only pull through traversable functors (containers with finitely many elements), De pulls through all containers. So it’s a bit special. I wonder what it is."
22:21:00 -!- derrik has quit (Quit: quitter).
22:22:28  Is there a simple way to tell if a list is finite in Haskell?
22:22:52  "‘NuDe’ is a fixpoint giving co-trees with delayed children."
22:23:02  I SEE
22:23:16  Ngevd: not that halts if it isn't
22:23:58  oerjan: it's mcbride, you are surely used to the puns by now :P
22:24:05  Ngevd: mathematically impossible
22:24:10  hm i may not have read that many of his
22:24:27  oerjan: really?
22:24:31  but he's so cool :(
22:27:13  what are you... ah.. haskell & theory
22:27:33  that's all we ever do
22:28:22  I think I actually understand folds now
22:28:31  you
22:28:32  what
22:28:37  Just sort of think of accum as the rest of the fold
22:28:37  how have you failed to understand folds for this long
22:28:38  hm that argument that De isn't a Monad looks rather like "it isn't a monad because we have disallowed the obvious way of making it one for semantic reasons."
22:28:44  > foldr f z [a,b,c,d]
22:28:45    f a (f b (f c (f d z)))
22:28:53  I think we should make a #esoteric-haskell; there's been far more Haskell chat than Minecraft chat.
22:28:54  @src foldr
22:28:55  foldr f z []     = z
22:28:55  foldr f z (x:xs) = f x (foldr f z xs)
22:29:02  oerjan: um no
22:29:06  oerjan: because the implementation isn't the specification
22:29:12  oerjan: (the specification doesn't talk about unsafeCoerce!)
22:29:12  Phantom_Hoover: +1
22:29:18  Phantom_Hoover: Haskell is the best esoteric language!
22:29:21  Ngevd, quiet, you.
22:29:25  oerjan: like
22:29:32  I actually understand that definition better than the expanded form, I think
22:29:32  oerjan: the implementation could _also_ implement a function that exposed the unsafeCoerceness
22:29:50  oerjan: being able to implement an interface for an implementation doesn't mean that the semantic model can do it, because exposing that interface might /break/ the model
22:29:51  Phantom_Hoover: I though that Minecraft has been forgotten
22:30:15  Sgeo: s/:/`f`/, s/[]/z/
22:30:18  a : b : c : d : []
22:30:19  ->
22:30:24  a `f` b `f` c `f` d `f` z
22:30:27  (except right-associative)
22:30:28  Only because of the Bukkit team's lack of appropriate psychostimulants.
22:30:45  infixr 9 `f`
22:31:26  elliott: well, i'm not convinced that it gives an example of an Applicative in _haskell_ which cannot be made into a Monad.
22:31:40  oerjan: because you need unsafeCoerce to implement it?
22:31:59  In dependent typing, is it possible to make a thingy such that it's impossible to implement a Monad thingy that violates the monad laws?
22:32:05  As in, the compiler checks the monad laws?
22:32:33  um the unsafeCoerce isn't even used in the Applicative instance.  which is obviously isomorphic to Identity, btw.
22:32:39  Sgeo: it "checks" them because you have to prove them
22:32:48  oerjan: well ok
22:32:50  Ah, cool
22:32:52  elliott, you do?
22:32:57  Oh, dependent typing.
22:33:01  Sgeo: "cool", heh
22:33:14  Sgeo: Spoken like someone who's never tried to prove anything substantial in Coq or Agda before
22:34:39  The, um
22:34:50  The top result for "hardback" on DDG is Memory Beta.
22:34:59  As in, the definition box at the top.
22:35:05  elliott: do those things have unsafeProveAnything?
22:35:19  olsner: well yes
22:35:33 -!- oerjan has quit (Quit: unsafeGoodNight).
22:35:49  They have Axiom unsafeProveAnything : forall x, x.
22:35:58  Remember when we created ABCDEF...G?
22:36:44  OK so I have discovered a cupboard in the school lab which contains, among other things, toluene, nitric acid and sulphuric acid.
22:36:45  FINALLY
22:37:17 -!- GreaseMonkey has quit (Remote host closed the connection).
22:39:26  http://esoteric.voxelperfect.net/wiki/User:Taneb/ABCDEF...G
22:39:38  Someone make sense out of that
22:40:35 -!- copumpkin has joined.
22:40:42  We didn't even implement ABCDEF
22:42:46  @tell oerjan Sgeo needs a swat for abbreviating Adjudicated Blind Collaborative Design Esolang Factory
22:42:46  Consider it noted.
22:43:46 -!- azaq23 has quit (Quit: Leaving.).
22:45:27  I've been swatted for less
22:48:42 -!- hagb4rd has quit (Ping timeout: 248 seconds).
22:50:28  AbstractBeanClassDelegationExceptionFactoryGenerator
22:54:29  @hoogle zipWith5
22:54:29  Data.List zipWith5 :: (a -> b -> c -> d -> e -> f) -> [a] -> [b] -> [c] -> [d] -> [e] -> [f]
22:54:31  yesss
22:56:20  hmm, what's a fast way of doing (last . takeWhile p)
22:58:04 -!- GreaseMonkey has joined.
22:58:04 -!- GreaseMonkey has quit (Changing host).
22:58:04 -!- GreaseMonkey has joined.
23:00:41  last . takeWhile p
23:02:52  foldr1 (\a b -> if p b then b else a), maybe
23:05:03  Jafet: Fast :P
23:05:07  Deewiant: Fair enough
23:05:11  I'm fine if it has a Maybe result
23:06:07  How is that slow?
23:06:51  Jafet: Hmm, I was thinking it'd involve two traversals, but it won't will it
23:06:52  Alright then
23:07:10  It might, but that's still fast
23:07:25  Cons, uncons, cons, uncons
23:07:37  That's what I meant, they're in lock-step
23:07:40  In a strict language it'd be slow
23:07:49  It'd still be fast!
23:07:55  ...unless allocation is slow.
23:08:59  Jafet: I have a fear of traversing lists multiple times
23:09:03  I just don't do it, ever
23:13:17 -!- Ngevd has quit (Ping timeout: 260 seconds).
23:14:01  {-# RULE "warm blanket" last . takeWhile p = my'Faster'LastTakeWhile #-}
23:15:58  :D
23:24:22 -!- Jafet has quit (Quit: Leaving.).
23:27:46 -!- Phantom__Hoover has joined.
23:30:50 -!- Phantom_Hoover has quit (Ping timeout: 248 seconds).
23:56:39 -!- ais523 has quit (Remote host closed the connection).
23:58:19 -!- augur[afk] has changed nick to augur.

2011-11-30:

00:06:14  15:26:12  is there a canonical example of an applicative functor that isn't a monad?
00:06:14  15:26:56  or rather can't have a monad constructed around it.
00:06:14  15:29:51  tnks: ZipList
00:06:14  15:29:53  tnks: ZipList
00:06:15  AAAAAAARGH
00:06:27  @tell oerjan GET YOUR ZIPLIST JOIN FORMULATED, I NEED TO GO ON THE OFEFNSIVE ALREADY
00:06:27  Consider it noted.
00:06:35  @tell oerjan *OFDSIOFG
00:06:35  Consider it noted.
00:12:14 -!- Jafet has joined.
00:20:17 -!- Nisstyre has joined.
00:21:52  Phantom__Hoover
00:21:55  Im disapointe in you
00:23:53  elliott: What?
00:23:56  ZipList join?
00:24:01  Yes.
00:24:24  You can make such a thing?
00:24:36  oerjan reckons he has.
00:24:37 -!- nooga has quit (Ping timeout: 260 seconds).
00:24:52  It's basically just diagonalisation a la the reader monad, but tricksy because of the no guarantee of equal length.
00:25:18  Right, but I thought that was "tricksy" as in "impossible" because of that.
00:25:19  (oerjan is sceptical that there are any Haskell ADTs that can be made applicative functors that can't be made monads (with the two instances agreeing))
00:25:34  shachaf: Well, he wrote it out once in here I think and claimed it worked :P
00:26:04   (oerjan is sceptical that there are any Haskell ADTs that can be made applicative functors that can't be made monads (with the two instances agreeing))
00:26:08  Well, I suppose that's easily disprovable.
00:26:15  But you need existential quantification.
00:44:23 -!- Jafet has quit (Quit: Leaving.).
00:51:45 * Phantom__Hoover → sleep
00:51:54  If only I had a way of indicating DEFCONery.
00:52:05 -!- Phantom__Hoover has quit (Quit: Leaving).
01:02:53 -!- Jafet has joined.
01:04:16 -!- Jafet has quit (Client Quit).
01:05:01 -!- Jafet has joined.
01:13:29 -!- Jafet has quit (Quit: Leaving.).
01:16:08 -!- xmorc has joined.
01:18:04 -!- xmorc has quit (Client Quit).
01:30:26  https://upload.wikimedia.org/wikipedia/commons/b/bd/CricketBattingAverageHistogram.gif Wow.
01:40:25  integration should be banned
01:41:40  pikhq_: join me in "anti integration league"
01:41:45  wait no that sounds racist
01:43:01 -!- pikhq has joined.
01:43:03 -!- pikhq_ has quit (Ping timeout: 240 seconds).
01:48:16  pikhq: :(
01:55:46  elliott: ?
01:55:51   integration should be banned
01:55:51   pikhq_: join me in "anti integration league"
01:55:51   wait no that sounds racist
01:55:56  Ah.
01:56:03  Why should it be banned?
01:56:16  It's icky. Also uncomputable.
01:56:53  ^in the general case
01:57:15  pikhq: The general case including........... Newtonian physics
01:57:36  Um?
01:58:04  Which means numeric approximations
01:58:06  Which means pain :'(
01:59:28  pikhq: ("Um?"?)
02:08:42 -!- Jafet has joined.
02:19:21  > text $ "pikhq: (" ++ fix ("\"" ++) ++ "Um" ++ fix (++ "\"?") ++ ")"
02:19:26  > var $ "pikhq: (" ++ fix ("\"" ++) ++ "Um" ++ fix (++ "\"?") ++ ")"
02:19:33  WORK WITH ME HERE LAMBDABOT
02:19:38    mueval-core: Time limit exceeded
02:19:38    thread killed
02:19:53  > "pikhq: (" ++ fix ("\"" ++) ++ "Um" ++ fix (++ "\"?") ++ ")"
02:19:58    mueval-core: Time limit exceeded
02:20:10  pah
02:33:03 -!- pikhq has quit (Ping timeout: 240 seconds).
02:33:09 -!- pikhq_ has joined.
03:10:47 -!- Jafet has quit (Quit: Leaving.).
03:11:26 -!- Jafet has joined.
03:46:42  > deriv (\x -> (+3) * x) (+4)
03:46:43    Couldn't match expected type `a -> a'
03:46:43          against inferred type `Data.N...
03:50:22  Hmm!
03:50:44  > ((cos^2) + (sin^2))
03:50:46    Overlapping instances for GHC.Show.Show (a -> a)
03:50:46     arising from a use of `...
03:50:49  > ((cos^2) + (sin^2)) 5
03:50:50    0.9999999999999999
03:51:17  :t deriv (\x -> (+3) * x)
03:51:18      Couldn't match expected type `a -> a'
03:51:18             against inferred type `Dif a1'
03:51:18      In the second argument of `(*)', namely `x'
03:51:29  > deriv (\x -> (+3) * x) (+4) 10
03:51:31    Couldn't match expected type `a -> a'
03:51:31          against inferred type `Data.N...
03:51:43  @env
03:51:43  Maybe you meant: v wn
03:51:47  bleh /me finds L.hs
03:51:54  gotta track down where deriv is from so I know what the constructor is
03:52:42  http://hackage.haskell.org/packages/archive/numbers/2009.8.9/doc/html/Data-Number-Dif.html
03:53:19  :t deriv (\x -> df (+3) (deriv (+3)) * x)
03:53:20      The section `+ 3' takes one argument,
03:53:21      but its type `Dif a' has none
03:53:21      In the first argument of `df', namely `(+ 3)'
03:53:31  er duh
03:53:43  :t deriv (\x -> df (+3) 1 * x)
03:53:44      The section `+ 3' takes one argument,
03:53:44      but its type `Dif a' has none
03:53:44      In the first argument of `df', namely `(+ 3)'
03:53:46  oops
03:53:51  :t (\x -> df (+3) 1 * x)
03:53:52      The section `+ 3' takes one argument,
03:53:52      but its type `Dif a' has none
03:53:52      In the first argument of `df', namely `(+ 3)'
03:53:58  oh!
03:54:00  :t deriv (\x -> mkDif (+3) 1 * x)
03:54:01  forall a. (Num a) => (a -> a) -> a -> a
03:54:07  > deriv (\x -> mkDif (+3) 1 * x) (+4)
03:54:08    Overlapping instances for GHC.Show.Show (a -> a)
03:54:08     arising from a use of `...
03:54:09  kallisti: ^
03:54:23  :t mkDif
03:54:24  forall a. a -> Dif a -> Dif a
03:55:22  I don't see what's wrong with kallisti's original thing?
03:55:46  the types don't work
03:55:50  (+3) does not match (Dif _)
03:55:53  because it's (_ -> _)
03:56:55  ah right
03:56:59  can't do fromInteger magic there.
03:57:12  > deriv (\x -> mkDif (+3) 1 * x) (+4) pi
03:57:13    *Exception: (==): No overloading for function
03:57:17  A+
03:57:31 * elliott doesn't know why that doesn't work.
03:57:44  :t deriv (\x -> mkDif (+3) 1 * x) (+4) pi
03:57:45  forall a. (Floating a) => a
04:30:20  elliott: I'm guessing pi for (->) is const pi?
04:30:36  it couldn't exactly be anything else
04:31:15  Ah
04:31:38 * elliott has no idea why the deriv thing there invokes ==
04:32:53  > mkDif (+3) 1
04:32:54    Overlapping instances for GHC.Show.Show (a -> a)
04:32:54     arising from a use of `...
04:32:58  > mkDif (+3) 1  * pi
04:32:59    Overlapping instances for GHC.Show.Show (a -> a)
04:32:59     arising from a use of `...
04:33:19  > deriv (\x -> (+ (Dif 3)) * x) (+4)
04:33:20    Not in scope: data constructor `Dif'
04:33:21  maybe it checks the output for some reason?
04:33:25  Sgeo: ...
04:33:32  > deriv (\x -> (+ (Dif 3 0)) * x) (+4)
04:33:34    Not in scope: data constructor `Dif'
04:33:40  > deriv (\x -> (+ (D 3 0)) * x) (+4)
04:33:41    Not in scope: data constructor `D'
04:35:54  I believe in you Sgeo.
04:36:02  I believe in your ability to read previous lines of code.
04:36:08  :t mkDif
04:36:09  forall a. a -> Dif a -> Dif a
04:36:15  Sgeo: yesssss!
04:36:18  triumph!
04:37:03  :t deriv
04:37:05  forall a b. (Num a, Num b) => (Dif a -> Dif b) -> a -> b
04:38:31  "Now we're told that coyotes don't TYPICALLY eat children" -- local CBS news
04:40:57  wow
04:41:22  elliott: there are apparently some coyotes in Atlanta's parks
04:41:26  (park? I don't know)
04:46:03  kallisti, elliott update
04:46:45  there are lots of parks
04:47:08  if any has coyotes, i'd bet on palisades
04:47:19  its just a forest
04:49:24  ..no
04:50:29 -!- copumpkin has quit (Quit: Computer has gone to sleep.).
04:53:35 -!- copumpkin has joined.
05:05:18 -!- Jafet has quit (Quit: Leaving.).
05:09:18 -!- zzo38 has joined.
05:24:07  Now I invented the functions: opencont, closecont, opencontT, closecontT
05:25:23  o.O
05:26:11  opencont (Barrier a c) = Barrier (a, c) opencont; closecont (Barrier (a, c) f) = Barrier a $ closecont . f . c;
05:26:37  Oh
05:26:47 * Sgeo still has no idea what barrier monads are
05:26:52  nobody does
05:26:57  closecont . opencont = id
05:27:31  Sgeo: Do you know about the generator functions (with yield) in JavaScript and in Python? Barrier monads is similar to that
05:27:41  Ah
05:27:53  Not familiar with JS, but am familiar with Python generator functions
05:28:21  There's a Haskell library with yield somewhere
05:28:23  I think the JS and Python generator functions are similar to each other
05:32:31 -!- Sgeo has quit (Ping timeout: 244 seconds).
05:33:05 -!- Sgeo has joined.
05:36:30  @pl \f xs -> tail xs ++ [f xs]
05:36:30  liftM2 (++) tail . flip flip [] . ((:) .)
05:36:33  @t \f xs -> tail xs ++ [f xs]
05:36:34  Maybe you meant: tell thank you thanks thx ticker time todo todo-add todo-delete topic-cons topic-init topic-null topic-snoc topic-tail topic-tell type . ? @ ft v
05:36:35  @ty \f xs -> tail xs ++ [f xs]
05:36:38  forall a. ([a] -> a) -> [a] -> [a]
05:36:43  @. hoogle ty \f xs -> tail xs ++ [f xs]
05:36:44  Plugin `compose' failed with: Unknown command: "ty"
05:36:47  @. hoogle type \f xs -> tail xs ++ [f xs]
05:36:48  Parse error:
05:36:48    forall a. ([a] -> a) -> [a] -> [a]
05:36:48   
05:36:55  @hoogle ([a] -> a) -> [a] -> [a]
05:36:55  Foreign.Marshal.Utils withMany :: (a -> (b -> res) -> res) -> [a] -> ([b] -> res) -> res
05:36:56  Data.Generics.Aliases ext1Q :: (Data d, Typeable1 t) => (d -> q) -> (forall e. Data e => t e -> q) -> d -> q
05:41:43  zzo38, http://hackage.haskell.org/packages/archive/generator/0.5.4/doc/html/Control-Monad-Generator.html
05:43:13  um
05:43:17  Sgeo: isn't that just Writer
05:43:18  except stupid
05:43:43  Life is weird at times.
05:43:52  https://upload.wikimedia.org/wikipedia/commons/3/3d/Ventricaria_ventricosa.JPG That's a fucking single-celled life form.
05:44:21  They typically are 1-4 centimeters in diameter.
05:45:05  I take it that Barrier is more like Python's abilities to pass in arguments to a generator?
05:45:26  Or, actually, even getting items out one at a time makes sense, doesn't it... no, it does not
05:45:38  Except as an already existing monad
05:45:57  Will laziness cause the writer monad to also pause?
05:46:09  If I only ask for the log
05:46:28  "pause"?
05:46:53  elliott, as in, not continuing to compute past, say, the first tell until I ask for the next item in the list
05:47:13  how could it compute things you didn't force
05:47:55  What was the other function used with the Writer monad
05:48:32  In JavaScript, there is a function g.send(x) that sends x to the result of yield inside of the generator function
05:48:48  zzo38, Python has something similar
05:49:06  And I guess that's what Barrier monads do?
05:49:40  "The Monad: and other essays upon the higher consciousness - Google Books Result"
05:49:40 -!- kallisti_ has joined.
05:49:49  "The sceptic erects a barrier round himself by his aggressive unbelief — a barrier which it is not worth the while of the non-physical entity to pierce ..."
05:50:15  Sgeo: Yes, it does that. This is the definition:   data Barrier f b t = Unit t | Barrier f (b -> Barrier f b t) | Fail String;    yield :: f -> Barrier f b b; yield = flip Barrier Unit;
05:51:45 -!- kallisti has quit (Ping timeout: 245 seconds).
05:51:58  So f is the type of values that can be passed out of the Barrier monad, and b is the type that can go into it?
05:52:56  Sgeo: Yes.
05:53:07  That's cool
05:53:14  Is it on Hackage yet?
05:53:14  >.>
05:53:33  Not yet. But I will put it on later.
05:54:20  It vaguely reminds me of Iteratees, although Iteratees can only give one answer
05:54:26  iirc
05:59:17  The function to make it to a list is  collect :: Barrier f () t -> [f]
05:59:51  There is also reverse operation is  uncollect :: [x] -> Barrier x a ()
06:02:45  I'm trying to envision bind
06:03:12  I can tell you how I defined it if you want that
06:03:27  Hmm, I guess if the thing on the left is a Barrier f (b -> Barrier f b t), the whole thing could be of that form
06:04:21  But sure
06:05:15  Unit x >>= f = f x; Barrier a c >>= f = Barrier a $ c >=> f;
06:06:20  That is far more concise than I could have written at first glance.
06:06:49  I assume Fail a >>= _ = Fail a
06:06:50  ?
06:07:04  Sgeo: Yes.
06:07:26  And there is instance of Alternative which is based on that.
06:07:36 -!- Jafet has joined.
06:07:42 * Sgeo is still a bit shaky on how Alternatives work in general
06:07:47  Or what they're useful for
06:08:02  Except parsing monads, ofc, but I don't understand how parsing monads work internally either
06:09:01  They allow parser embiggenment
06:09:29  They can be used with things other than parsers too.
06:10:13 -!- DCliche has joined.
06:11:42  Now I added a MonadPlus instance. However, it doesn't follow the right zero law but MonadPlus for many other monads also does not follow right zero law (but there are also many that do follow the right zero law).
06:12:01  empty = Fail []; Unit x <|> _ = Unit x; Fail y <|> x = annotateFail y x; Barrier a c <|> x = Barrier a $ \y -> (c y <|> x);
06:12:09  mzero = empty; mplus = (<|>);
06:13:46 -!- Klisz has quit (Ping timeout: 244 seconds).
06:13:53  zzo38, when you were writing  Barrier a c >>= f = Barrier a $ c >=> f, did you first write that c >=> f as something else?
06:14:11  I guess I want reassurance that I don't need to catch things like that immediately
06:14:54  Sgeo: I did first write it like that, but maybe some other people might not (I don't know)
06:18:43  zzo38, it should be possible to write crosstalk :: Barrier f b t1 -> Barrier b f t2 -> ([f],[b]), right?
06:19:45  Wait, what if one wants to consume more than the other?
06:28:08  Sgeo: I have not thought of that function, but I might be able to. I suppose if one wants to consume more than the other, then you just use the shorter one
06:37:25 -!- pikhq has joined.
06:37:42 -!- pikhq_ has quit (Ping timeout: 252 seconds).
06:42:07  @ask oklopol remember when you used to be stupid?  j-invariant: actually i probably couldn't lecture all night, since the first nontrivial thing you usually do about CA is a theorem i actually don't know how to prove :D
06:42:08  I managed to do this:  crosstalk :: Barrier f b t1 -> Barrier b f t2 -> [(f, b)]; crosstalk (Barrier a1 c1) (Barrier a2 c2) = (a1, a2) : crosstalk (c1 a2) (c2 a1); crosstalk _ _ = [];
06:42:08  Consider it noted.
06:54:35 -!- DCliche has quit (Quit: You are now graced with my absence.).
07:01:36  crosstalkT :: (Functor m, Monad m) => BarrierT f b m t1 -> BarrierT b f m t2 -> m [(f, b)]; crosstalkT x y = liftM2 (liftA2 (,)) (runBarrierT (() <$ x)) (runBarrierT (() <$ y)) >>= either (const $ return []) (\((a1, c1), (a2, c2)) -> ((a1, a2) :) <$> crosstalkT (c1 a2) (c2 a1));
07:06:44  crosstalkT x y = liftM2 (liftA2 (,)) (runBarrierT ([] <$ x)) (runBarrierT ([] <$ y)) >>= either return (\((a1, c1), (a2, c2)) -> ((a1, a2) :) <$> crosstalkT (c1 a2) (c2 a1));
07:13:24 -!- GreaseMonkey has quit (Quit: The Other Game).
07:22:58 -!- copumpkin has quit (Quit: Computer has gone to sleep.).
07:33:21  @hoogle deriv
07:33:21  package derivation-trees
07:33:21  package derive
07:33:21  package derive-gadt
07:33:32  aw, mu-eval doesn't have those.
07:33:39  :t deriv
07:33:40  forall a b. (Num a, Num b) => (Dif a -> Dif b) -> a -> b
07:33:46  @hoogle (Dif a -> Dif b) -> a -> b
07:33:47  Warning: Unknown type Dif
07:33:47  Data.Generics.Aliases ext1T :: (Data d, Typeable1 t) => (forall e. Data e => e -> e) -> (forall f. Data f => t f -> t f) -> d -> d
07:37:49  kallisti_: i found the package earlier
07:39:06  elliott: so you actually added it to lambdabot?
07:39:15  ...no
07:39:34  @src deriv
07:39:35  Source not found. You speak an infinite deal of nothing
07:39:56  elliott: also how does AD work in languages like C where there's no operator overloading.
07:40:03  you said it could be used to differentiate C functions and the like.
07:40:09  external tools
07:40:18  in C++ they do horrible template hacks
07:41:39  well duh
07:41:49  that's how you do anything complex in C++
07:43:03  does it require the C source?
07:43:07  obviously
07:44:40  elliott: who knows it could do some machine code hacks.
07:45:37  elliott: so if you didn't add ad to lambdabot how is it there?
07:45:45  lambdabot imports a fuckton of shit
07:45:52  oh.
07:46:05  hm, I guess mu-eval hasn't caught up or doesn't use the same imports.
07:46:10  it's very picky about its imports.
07:50:40  what's the name of the package that defines deriv?
07:51:27  tried ad, fad, rad, and Data.Ring.Module.AutomaticDifferentiation but I don't think it's the same one
07:51:42  kallisti_: stop attributing these things to mueval
07:51:44  it is L.hs alone
07:52:52  grr, I wish this glib queue had the property I want
07:53:30  elliott: L.hs?
07:53:37  kallisti_: see lambdabot sourec
07:57:24  I think lists encode an at-most:
07:57:28  Data.Number.Dif is commented out from the mueval source. :(
07:57:32  [] fits the type [a], [[a]], etc.
07:57:43  kallisti_: mueval is irrelevant
07:57:56  elliott: ...to?
07:57:57  Is there a way to encode at-least?
07:58:03  kallisti_: the lambdabot imports
07:58:08  Sgeo: i don't have any idea what you are talking about
07:58:10  elliott: it's certainly relevant to what I'm talking about.
07:58:14  which is not lambdabot
07:58:16  it's mueval
07:58:28  heh
07:58:44  ..I mean, clearly lambdabot imports it.
07:58:47  that wasn't the issue. :P
07:58:55  [] fits the type [[[a]]], as do [[]] and [[[]]] and [[[[]]]] but [[[[[]]]]] does not
07:59:37  (Typeclasses could be used to clean up that a, but I need to go to sleep soon)
07:59:56  So [[[a]]] means "Accept at most [[[[]]]] but no numbers larger than that"
08:00:15  (Treating these nested lists as numbers)
08:00:34  I should go to sleep now, I have an exam tomorrow
08:01:53  Hmm, I'd wonder if tuples are a better bet, but there are no one-element tuples
08:02:02  ...and also, it wouldn't work, so n/m
08:02:40  1-tuples are a completely pointless thing.
08:02:49  ugh, this sucks
08:03:15  except newtypes I guess. newtypes are kind of like 1-tuples I guess.
08:03:33  The point here is the nesting, though
08:04:10  Just (Just (Just Nothing ) )  zomg
08:05:17  That works just as well (or better), but which is easier to type?
08:05:27  > Nothing :: Maybe ( Maybe ( Maybe a ) )
08:05:28    Nothing
08:06:16  What I'm curious about is if it's possible to encode at-least
08:06:20  Sgeo: which is less broken.  (not completely unbroken, but less broken at least)
08:06:37  Sgeo: what does that even mean.
08:06:46  (note: I read the explanation above; still confused)
08:06:52  Values of a certain "value" or greater, as specified in the type, pass the type
08:06:56  basically, what are you doing.
08:07:14  What I currently have is values of a certain "value", or less, as specified in the type, pass the type
08:07:21  So [] represents 0, for instance
08:07:36  And passes [a], [[a]], [[[a]]], etc
08:07:39  pikhq: Deewiant: I need a C language lawyer, ping
08:07:45  Pong
08:08:03  Whereas [[]] represents 1 and passes ... erm, [a], [[a]], [[[a]]]. Let's say that [[]] is 0
08:08:14  [[[]]] passes.... ok, bluh
08:08:16  elliott: I need a real lawyer; I may actually kill Sgeo.
08:08:19  Let's start this again
08:08:21  Sgeo: [[]] doesn't pass [a]
08:08:29  Deewiant: Does C99 give enough guaranteed on accesses to a global volatile bool so that {x = false;} and {x = true;} are atomic with respect to "if (x)"
08:08:40  [] doesn't fit the oh so heavy burden imposed by a?
08:08:48  i.e. can I assume it works like an atomic shared bit for setting and testing
08:08:56  (Setting to constants)
08:09:18  "At sequence points, volatile objects are stable in the sense that previous accesses are complete and subsequent accesses have not yet occurred."
08:09:29  Let's say that [] is 0. It passes [()], [[()]], [[[()]]], etc.
08:09:41  > [[]] :: [a]
08:09:42    Couldn't match expected type `a1' against inferred type `[a]'
08:09:43     `a1' is a ...
08:09:53  kallisti_: You can pass [[]] to a function expecting [a]
08:09:57  Is I think Sgeo's point
08:10:05  Deewiant: Alright. I still feel bad about using it.
08:10:13  [[]] 1, by contrast, does not fit [()], but does fit [[()]], [[[()]]], etc.
08:10:41  > let id :: [a] -> [a]; id x = x in id [[]]
08:10:43    [[]]
08:10:50  Deewiant: (I was hoping to eliminate the global volatile variable world_running from mcmap, but GLib doesn't offer something as simple as "a queue that you can disown so that pushes just do nothing" (or equivalent).)
08:11:00  So, So, [[]] 1 is not at-most [()] 0
08:11:08  Deewiant: (So removing world_running would cause every received world-relevant packet to leak memory in the queue.)
08:11:09 -!- oerjan has joined.
08:11:09  (The former is the value, the latter is the type)
08:11:11  (If the world's stopped.)
08:11:37  So, [()] in the type means at-most 0. [[()]] in the type means at-most 1. etc.
08:11:50  elliott: Can't you clear the queue at some later time?
08:12:00  I'm still pondering potential usages of this, but I also have to wonder if there's a way to encode at-least.
08:12:01  Deewiant: Clear it howso
08:12:11  Deewiant: The point is that after the world thread ends, nobody is popping the queue
08:12:15  But the proxy thread is still pushing
08:12:27  When does this matter
08:12:47  The world thread sounds like something important (note: I have no idea what the threads are for)
08:13:04  kallisti_, is anything I'm saying making sense?
08:13:15  Deewiant: When the world thread crashes in a predictable manner :)
08:13:32  Deewiant: fizzie thought it important that the proxy continue to function even if the map and commands break
08:13:42  elliott: And you want to keep the program running after this?
08:13:47  ./world.c:stopf("chunk update decompression: inflateInit: %s", zError(err));
08:13:47  ./world.c:stopf("chunk update decompression: inflate: %s", zError(err));
08:13:47  ./world.c:stopf("broken decompressed chunk length: %d != %d and < %d",
08:13:47  ./world.c:stopf("too high chunk update: %d..%d", y0, y0+ys-1);
08:13:53  Basically it happens when chunk updates are fucked
08:14:02  Deewiant: Well, it already does
08:14:09  elliott: haven't Mojang fixed them?
08:14:18  Deewiant: It works fine without even world_running, it just leaks memory
08:14:33  Sgeo: um... I guess.
08:14:37  Deewiant: I'd rather remove stop entirely or make it not leak memory and not use a volatile global
08:14:40  but.. I don't know why you're doing that.
08:14:42  I don't know how to achieve the latter
08:14:47  kallisti_, BECAUSE I CAN
08:14:48  elliott: What exactly works fine, what does the world thread do :-P
08:14:57  (Also: Note: Practical usages still to be determined)
08:15:01  Deewiant: Processes incoming world-relevant packets
08:15:08  Deewiant: Map chunk updates, entity position updates, chat messages
08:15:19  Sgeo: DUDE EITHER ENCODES LIKE..... LINKED LISTS
08:15:21  elliott: Right, so, what exactly is still happening without the world thread
08:15:23  Deewiant: Basically the world thread handles everything that isn't part of mcmap's fun ol' proxying/console regime
08:15:25  Deewiant: Proxying
08:15:28  Proxying and the console
08:15:34  Deewiant: iirc it handles tracking of the world, for map display purposes and so on. Basically everything that isn't just "pass on to client/server"
08:15:35  The map just freezes
08:15:45  Right, hmh
08:15:50  Sgeo: Either Int (Either Bool (Either (IO Awesome) ()))
08:15:55  duuuuude think of the implications
08:16:04  (The world thread is separate because fizzie thinks processing world packets might be slow; in reality the threading overhead almost certainly dwarfs it, but that's a battle for another day)
08:16:12 -!- nooga has joined.
08:16:23  Deewiant: I get the feeling that a volatile global is The Way to do this, and if I want to avoid them I should use a super-high-level concurrency library
08:16:34  Rather than glib's "here's some thread-starting functions... and a mutex... and a queue".
08:16:39  "Have fun with that."
08:16:43  heh
08:16:50  (Heck, glib even has some operations on volatile pointers to lock bits atomically.)
08:17:09  elliott: so are the glib threads any better than pure pthreads? Apart from portability concerns that is.
08:17:42  Vorpal: Well, they have a bit more than just mutexes; run-once sections, conditions, and the aforementioned queues
08:17:48  Maybe pthreads has queues, I dunno
08:17:50  But portability is nice
08:18:02  Oh, also read-write locks
08:18:04  That's nice too
08:18:08  elliott: I know pthreads have condition variables. No idea about run-once sections.
08:18:25  Also ~RECURSIVE MUTEXES~
08:18:32  pthreads have that
08:18:45  also pthread_rwlock_init
08:18:56  Deewiant: I'm wondering why I don't just make stopf situations drop the current packet
08:19:01  Deewiant: The network protocol is synchronised at that point anyway
08:19:05  Adjective:
08:19:07  (of words or the person speaking them) Fluent and voluble but insincere and shallow.
08:19:15  So... I'm gonna do that
08:19:22  elliott: hm... won't that fuck up for the client?
08:19:35  Vorpal: This happens after it's forwarded to the client
08:19:38  ah okay
08:19:46  The Notchian client just sort of magically makes sense of any data you throw at it
08:19:57  elliott: might want to rename it from stopf to something else then
08:20:12  elliott: really? I guess you should look at mcp stuff to figure out what you are missing then
08:20:15  Vorpal: I'm not going to modify the macro to insert a return :-P
08:20:21  And no, it mostly just ignores things
08:20:24  heh
08:20:29  I don't think we ever actually get these stopf errors these days
08:20:37  But that's life, or some such
08:20:46  bbl
08:20:51  (university)
08:21:00  More like unicrappity
08:21:31  bbl
08:21:34  (christmas carols)
08:21:59  Deewiant: My delightful new prefix for these "zlib fucked up" errors is [WHAT]
08:29:06  http://www.cracked.com/article_16508_6-terrifying-things-they-dont-tell-you-about-childbirth.html
08:29:11  oh, I'm on this part of the internet again.
08:35:30  Is there any proper name for this?    data T a b = T b ((T a b -> a) -> a);    What is its meaning?
08:38:53 -!- Phantom_Hoover has joined.
08:39:31  Deewiant: Can you please shoot whoever made gcc too stupid to realise that if (...) { x = y; } else if (...) { x = z; } else call_noreturn_function() cannot leave x uninitialised
08:40:02  lambdabot!
08:40:03  Phantom_Hoover: You have 8 new messages. '/msg lambdabot @messages' to read them.
08:41:04  elliott: Ah, but what if somebody else provides a call_noreturn_function() that actually returns
08:41:17  Deewiant: IT'S __ATTRIBUTE__((NORETURN))
08:41:18  IN THE HEADER
08:41:33  elliott: Do those __attribute__s actually have to match?
08:41:35  Shoot whoever made you use -Werror
08:41:36  (I'm not sure)
08:41:57 * kallisti_ has just now watched double rainbow.
08:42:02  Deewiant: I don't define it with that attribute in the .c file since it includes the relevant header :-P
08:42:10  Jafet: fizzie
08:42:28  Jafet: But I'm kinda warning-phobic anyway, it only takes about four warnings to make me start ignoring any fifth warning that might pop up
08:42:30  elliott: But anyway, what if you explicitly return thereafter
08:42:32 -!- monqy has quit (Quit: hello).
08:42:57  Deewiant: Doesn't work (thank god)
08:43:07  I'm not sure what it's complaining about
08:43:14  Remember the zero-one-infinity rule. Fix all warnings, or fix the first warning, or ignore all warnings
08:43:15  Is it just complaining because I declare them without initialising them RIGHT THERE...
08:43:31  C is easy anyway, you can initialize almost anything with 0
08:43:36  Be thankful you're not in C++
08:43:55  http://sprunge.us/bGIN ;; COME ON LET ME APPLY THIS
08:44:03  Jafet: Nope, socket_t must be used abstractly here
08:44:07  Jafet: Could be a struct
08:44:17  Jafet: On Windows it's a "SOCKET", whatever that is
08:44:40  A shout, for one thing
08:45:06  Deewiant: BTW once I get around to pushing this stuff could you test the Windows build, I think it should even be working
08:46:21  When I'm next in Windows after that, sure
09:05:00 * oerjan swats Sgeo for abbreviating Adjudicated Blind Collaborative Design Esolang Factory -----###
09:05:00  oerjan: You have 3 new messages. '/msg lambdabot @messages' to read them.
09:05:57  :t ZipList
09:05:58  forall a. [a] -> ZipList a
09:14:28  > scanl1 (zipWith (flip const)) [[1,2,3],[4,5],[6,7,8,9]]
09:14:30    [[1,2,3],[4,5],[6,7]]
09:14:38  > scanl1 (zipWith (flip const)) []
09:14:40    []
09:18:28  \setbox0=\hbox{\write16{\csname zzz\endcsname}}\show\zzz\shipout\box0\show\zzz
09:19:20  oerjan: is that it?
09:19:23  Deewiant: Language lawyer time
09:19:31  Deewiant: Is it OK to define a function in a header and then never talk about it again and then link the program
09:19:33  no, just a small part
09:19:50  elliott: Define, not declare?
09:19:54  Er, declare
09:20:11  Yes, of course
09:21:09  Deewiant: Gross
09:21:12 -!- nooga has quit (Quit: Lost terminal).
09:21:34  > scanr1 ((drop 1 .) . (:)) [[1,2,3],[4,5],[6,7]]
09:21:35    Occurs check: cannot construct the infinite type: a = [a]
09:21:40  elliott: the alternative would be macro hacks.
09:21:41  oops
09:21:45  elliott: math.h can be used without linking libm, you know :-P
09:22:09  > scanr1 ((. drop 1) . (:)) [[1,2,3],[4,5],[6,7]]
09:22:10  Deewiant: BUT STILL
09:22:10    Occurs check: cannot construct the infinite type: a = [a]
09:22:15  wtf
09:22:25  :t scanr1 ((. drop 1) . (:))
09:22:26      Occurs check: cannot construct the infinite type: a = [a]
09:22:26        Expected type: [a]
09:22:26        Inferred type: [[a]]
09:22:29  ?ty (. drop 1) . (:)
09:22:30  forall a. a -> [a] -> [a]
09:22:35  ?ty scanr1
09:22:36  forall a. (a -> a -> a) -> [a] -> [a]
09:22:44  oh hm
09:23:00  ?ty scanr
09:23:01  forall a b. (a -> b -> b) -> b -> [a] -> [b]
09:23:06  > scanr ((. drop 1) . (:)) [] [[1,2,3],[4,5],[6,7]]
09:23:08    [[[1,2,3]],[[4,5]],[[6,7]],[]]
09:23:20  > scanr ((drop 1 .) . (:)) [] [[1,2,3],[4,5],[6,7]]
09:23:22    [[],[],[],[]]
09:23:30  oh hm
09:23:55  > scanr1 ((. drop 1) . (++)) [[1,2,3],[4,5],[6,7]]
09:23:56    [[1,2,3,5,7],[4,5,7],[6,7]]
09:24:03  > scanr1 ((drop 1 .) . (++)) [[1,2,3],[4,5],[6,7]]
09:24:05    [[2,3,5,6,7],[5,6,7],[6,7]]
09:24:19 * oerjan swats Deewiant for disturbing him
09:24:25  * -----###
09:24:36  What're you trying to do :-P
09:24:46  ZipList join
09:25:40  :t (. ?f) . (:)
09:25:41  forall (f :: * -> *) a. (?f::f [a], Functor f) => a -> f [a]
09:25:41  Once I made a join function for ZipList
09:26:19  :t (Prelude.. ?f) Prelude.. (:)
09:26:20  forall a a1. (?f::a -> [a1]) => a1 -> a -> [a1]
09:26:41  argh
09:26:49  pointless is pointless today
09:27:13  oerjan: complete double rainbow all the way.
09:27:21  :t scanr (\x xs -> x:map (drop 1) xs) [] [[1,2,3],[4,5],[6,7]]
09:27:22  forall a. (Num a) => [[[a]]]
09:27:27  > scanr (\x xs -> x:map (drop 1) xs) [] [[1,2,3],[4,5],[6,7]]
09:27:27    [[[1,2,3],[5],[]],[[4,5],[7]],[[6,7]],[]]
09:27:34  oops
09:27:39  > foldr (\x xs -> x:map (drop 1) xs) [] [[1,2,3],[4,5],[6,7]]
09:27:40    [[1,2,3],[5],[]]
09:29:17  :t let join = ZipList . diag . scanl1 (zipWith (flip const)) . getZipList where diag = concat . takeWhile (not . null) . map (take 1) . foldr (\x xs -> x:map (drop 1) xs) [] in join
09:29:18  forall a. ZipList [a] -> ZipList a
09:29:24  oops
09:29:41  :t let join = ZipList . diag . scanl1 (zipWith (flip const)) . map (getZipList) . getZipList where diag = concat . takeWhile (not . null) . map (take 1) . foldr (\x xs -> x:map (drop 1) xs) [] in join
09:29:42  forall a. ZipList (ZipList a) -> ZipList a
09:30:03  @let zjoin = ZipList . diag . scanl1 (zipWith (flip const)) . map (getZipList) . getZipList where diag = concat . takeWhile (not . null) . map (take 1) . foldr (\x xs -> x:map (drop 1) xs) [] in zjoin
09:30:03    Parse error: in
09:30:09  @let zjoin = ZipList . diag . scanl1 (zipWith (flip const)) . map (getZipList) . getZipList where diag = concat . takeWhile (not . null) . map (take 1) . foldr (\x xs -> x:map (drop 1) xs) []
09:30:10   Defined.
09:30:17  ze join
09:30:45  > getZipList . zjoin . ZipList . map ZipList $ [[1,2,3],[4,5],[6,7,8,9]]
09:30:47    [1,5]
09:30:57  good, good
09:30:58  oerjan: hm what are the monad laws stated with join...
09:30:59  elliott: ^
09:31:35  i have a cold so i'm not sure i can get all that
09:31:49  Isn't join (return m) = m one of them?
09:32:00  i was just writing that.
09:32:03  Phantom_Hoover: assuredly
09:32:27  oerjan: and return (join m) = m, presumably?
09:32:43  no that doesn't look reversible
09:33:09  also join (return m) = m needs to be well typed
09:33:34  join (fmap g (join (fmap f m))) = join (fmap (join . fmap g . f) m)
09:33:40  is the long one
09:33:42  translated directly
09:33:44  it's uh
09:33:45  quite ugly
09:33:46  some stuff like that
09:33:50  hm well
09:33:53  join x = join y
09:33:54  can be reduced to
09:33:55  x = y
09:33:56  obviously
09:33:57  elliott: surely there must be some blog that has them
09:34:10  fmap g (join (fmap f m)) = fmap (join . fmap g . f) m
09:34:14  and surely we can lift that join outwards...
09:34:22  oerjan: well ok
09:34:25  elliott: join is not a reversible operation, i said
09:34:37  -- The standard monad laws.
09:34:37  join . return == id
09:34:38  join . fmap return == id
09:34:38  join . join == join . fmap join
09:34:43  those ones, apparently
09:34:52  those seem... strangely short
09:34:57  but i guess associativity is a detail of (>>=) itself
09:35:02  > join [[1]] == join [[],[1]]
09:35:03    True
09:35:10  there are also the laws of fmap itself as a Functor, of course
09:35:19  oerjan: yes but we know those are OK
09:35:22  since we're only introducing Monad
09:35:34  fmap, like batman, has only one rule.
09:35:53  Jafet: two, actually
09:35:54  @src ZipList return
09:35:54  Source not found. That's something I cannot allow to happen.
09:35:58  *grr*
09:36:29  iiro[3[[3452#$[323523[62[45#${^347[2246}$%&4[646}#$%[34]3[4534[3[$)%%_3#
09:37:47  my brain was _just_ too fried to get \x xs -> x:map (drop 1) xs into point-free form, so the monad laws are obviously beyond reach.
09:37:49  I think the ZipList has similar to (Natural ->) monad (that is, assuming a type for any natural numbers!)
09:38:02  Except that ZipList can be finite
09:38:06  oerjan: i'm working on proving these btw
09:38:47  oerjan: hm would you call map getZipList (repeat m) = repeat (getZipList m) a distributive property
09:38:48  oerjan: foldr (.) id . map fmap == fmap . foldr (.) id
09:39:14  zzo38: yes, it's the finiteness that makes it complicated.  in particular if the sublists are not sorted by length, monad laws break without the scanl1 (zipWith (flip const)) adjustment.  i _hope_ that's enough.
09:39:42  http://www.youtube.com/watch?v=f0P_btTkUgg
09:39:48  Jafet: the problem isn't me understanding it in general, it's understanding it when i have a cold
09:39:56  that shit was off the chain wicked bananas.
09:40:00  Oh wait, my rule doesn't type in Haskell
09:40:34  you might want to include the actual function mapped over
09:41:01  I wanted to make it pointfree
09:41:18  Jafet: oh that's your formulation of the functor laws as one equation?
09:41:31  > scanl1 f (repeat x)
09:41:32    [x,f x x,f (f x x) x,f (f (f x x) x) x,f (f (f (f x x) x) x) x,f (f (f (f (...
09:41:48  o-kay
09:42:02  oerjan: proof of first law is currently at "  ZipList . diag . scanl1 (zipWith (flip const)) . repeat $ getZipList m" btw
09:42:09  which is
09:42:09  Do you know what this is?    data T a b = T b ((T a b -> a) -> a);    I don't know what this is?
09:42:10  not very far :P
09:42:22  It's one law that says a functor is a group homeomorphism or something
09:42:35  oerjan: btw what would you call \x xs -> x : map (drop 1) xs
09:42:36  elliott: you might want to understand join on a more intuitive level first?
09:42:40  Sadly in Haskell they must be written as two laws
09:42:51  i put it in its own definition to keep my columns sane :P
09:42:56  zzo38: cobarrier monads
09:43:05  barrier comonads?
09:43:08  cobarrier comonads?
09:43:08  oerjan: ha! as if I could apply _intuition_ to a problem like this
09:43:42  oerjan: isn't zipWith (flip const) = flip (zipWith const)
09:43:43  oerjan: I understand join on an intuitive level. does that mean I can prove everything?
09:44:06  > zipWith (flip const) x x
09:44:07    Couldn't match expected type `[a]'
09:44:07          against inferred type `SimpleRef...
09:44:13  @check \xs -> zipWith (flip const) xs xs == xs
09:44:14    "OK, passed 500 tests."
09:44:18  elliott: hoo hoo hoo
09:44:22  kallisti_: Actually I don't know what it is.
09:44:58   oerjan: btw what would you call \x xs -> x : map (drop 1) xs
09:45:03 -!- augur has quit (Read error: Connection reset by peer).
09:45:12  zzo38: it's a cobarrier monad..
09:45:12  elliott: the intuition is to take the diagonal of a matrix, but with the restriction that not just the diagonal elements but all elements above and to the left must also exist
09:45:25  zzo38: (it's probabky not)
09:45:39  elliott: shear?
09:45:43  oerjan: ok
09:46:01  > foldr f z (repeat x)
09:46:02    f x (f x (f x (f x (f x (f x (f x (f x (f x (f x (f x (f x (f x (f x (f x (...
09:46:35  elliott: astonishing
09:46:42  quite
09:46:50  kallisti_: I think it isn't, but I don't know. But I think it is a functor     fmap f (T x y) = T (f x) $ \z -> y (z . fmap f);
09:46:56  oerjan: now at the point   ZipList . concat . takeWhile (not . null) . map (take 1) . fix . shear $ getZipList m :P
09:47:03  kallisti_: well you also have to understand _proofs_, i guess
09:47:17  oerjan: sure I get proofs.
09:47:25  good, then there's hope.
09:47:31  you start with X, you do shit until it's Y. QED
09:47:58    ZipList . concat . takeWhile (not . null) . map (take 1) . fix $ \xs -> getZipList m : map (drop 1) xs
09:48:02  kallisti_: i assume you're being sarcastic
09:48:07  oerjan: looks like we're getting somewhere
09:48:13  oerjan: well that's one way to write proofs isn't it?
09:48:35  kallisti_: yes, but it's so vague it would apply to the work of most crackpots.
09:48:52  of course it doesn't really describe proof by contradiction or induction very well.
09:49:33  I bet there are proof techniques I've never even /heard/ of!!
09:49:44  Proof by crackpots
09:50:01  oerjan: hm is map f $ fix (\xs -> x : map g xs) ==> fix (\xs -> f x : map g xs) valid
09:50:03  i think so
09:50:20  oh wait no
09:50:31  I am not very good at proofs in general but I could prove some things by myself, including Pythagorean theorem, and that the sequence of repeated run length encoding starting with 1 (1, 11, 21, 1211, 111221, etc) has only 1,2,3 and has no "333" in it
09:50:33  map f $ fix (\xs -> x : map g xs) ==> fix (\xs -> f x : map (f . g) xs)
09:50:34  is, though, I think
09:50:39  (validate me oerjan? is this correct)
09:50:56  i have a cold, i say.
09:51:00  > map f (fix (\xs -> x : map g xs)) :: [Expr]
09:51:01  elliott: that doesn't look right to me.
09:51:01    [f x,f (g x),f (g (g x)),f (g (g (g x))),f (g (g (g (g x)))),f (g (g (g (g ...
09:51:10  > fix (\xs -> f x : map (f . g) xs) :: [Expr]
09:51:11    Ambiguous type variable `a' in the constraints:
09:51:11     `SimpleReflect.FromExpr ...
09:51:20  elliott: oh wait
09:51:20  > fix (\xs -> f x : map (\x -> f (g x)) xs) :: [Expr]
09:51:21  nevermind
09:51:21    Ambiguous type variable `t' in the constraints:
09:51:21     `GHC.Show.Show t'
09:51:21       a...
09:51:24  argh!
09:51:29  that looks right to me.
09:51:32  I misreaed.
09:51:37  kallisti_: shut up and let me get lambdabot to take it :)
09:51:50  > fix $ ([0,1]++) . map succ . concatMap ((:) <$> length <*> pure.head). group
09:51:51  i think it is _not_ valid actually.
09:51:52    [0,1,2,1,2,2,2,3,2,2,4,3,2,4,3,3,2,5,2,4,2,3,2,5,3,4,2,3,2,6,2,3,2,5,2,3,2,...
09:51:59  :t fix (\xs -> f x : map (\x -> f (g x)) xs) :: [Expr]
09:52:00      Ambiguous type variable `t' in the constraints:
09:52:00        `Show t' arising from a use of `f' at :1:29-35
09:52:00        `SimpleReflect.FromExpr t'
09:52:00  oh wait
09:52:01  yeah
09:52:02  nevermind
09:52:03  :t fix (\xs -> f x : map (\x -> f (g x)) xs)
09:52:04  forall a t. (SimpleReflect.FromExpr a, SimpleReflect.FromExpr (a -> t), SimpleReflect.FromExpr (t -> a)) => [a]
09:52:04  it's not.
09:52:10  sigh
09:53:09  > let m = [1,2,3,4] in fix (\xs -> m : map (drop 1) xs)
09:53:09    [[1,2,3,4],[2,3,4],[3,4],[4],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[...
09:53:13  Equatorial coordinates have right ascension and declination, or hour angle and declination, but is it sense to have local declination too?
09:53:18  > inits [1,2,3,4]
09:53:19    [[],[1],[1,2],[1,2,3],[1,2,3,4]]
09:53:23  > tails [1,2,3,4]
09:53:24    [[1,2,3,4],[2,3,4],[3,4],[4],[]]
09:53:27  > tails [1,2,3,4] ++ repeat []
09:53:28    [[1,2,3,4],[2,3,4],[3,4],[4],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[...
09:53:45  elliott: with map f on the outside f only gets applied once to each element
09:53:49  yes, I nkow
09:53:50  know
09:53:56  on the inside it gets applied... um, a lot.
09:53:59  sh
09:54:00  hh
09:54:36  > map (take 1) (tails [1,2,3,4] ++ repeat [])
09:54:38    [[1],[2],[3],[4],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[...
09:54:54  > map pure [1,2,3,4] ++ repeat []
09:54:55    [[1],[2],[3],[4],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[...
09:55:07  > join . map $ (take 1) (tails [1,2,3,4] ++ repeat [])
09:55:08    Couldn't match expected type `[a1] -> a'
09:55:08          against inferred type `[a]'
09:55:18  > join . map (take 1) $ (tails [1,2,3,4] ++ repeat [])
09:55:22    mueval-core: Time limit exceeded
09:55:37  can someone submit a bug report for me.
09:55:55  titled "halting problem not solved"
09:56:03  oerjan:   ZipList . concat . takeWhile (not . null) $ map (:[]) (getZipList m)
09:56:12  oerjan: looks like it's working
09:56:14  It is solved
09:56:20  See NonTerminationException
09:56:33   (oerjan is sceptical that there are any Haskell ADTs that can be made applicative functors that can't be made monads (with the two instances agreeing))
09:56:36  i didn't say that.
09:56:41  oerjan: i clarified later, but ok
09:57:32  elliott: hmmm, I've run out of fractals. perhaps I need a new updoot theme?
09:57:42  kallisti_: CANTFIX
09:57:54  oerjan: behold the most handwavey thing _ever_ written: http://sprunge.us/hfGR
09:58:02  at least my steps are trivial enough to justify, I'm just too lazy to
09:58:16  Define a type of function, that if you have this function and pure and <*> then you can make join. Is there such a thing?
09:58:23  zzo38: join
09:58:27  it's called join.
09:58:56  I know that, but it isn't what I meant
09:59:26  elliott: pick a theme for me
10:00:08  hmm I'll try to find more fractals I guess.
10:00:12  elliott: pure m is what i call a "rectangular" element, so zjoin really cannot break on it - it essentially doesn't go outside the _Applicative_ part.
10:00:21  oerjan: right
10:00:54  oerjan: the join . fmap return one is going well:   ZipList . diag . scanl1 (zipWith (flip const)) . map repeat $ getZipList m
10:01:12  that is, on a rectangular element, join is determined entirely by the Applicative functions.
10:01:20  Sgeo: upoundary of the tame deetdragon
10:01:24  elliott: that one is also rectangular.
10:01:44  oerjan: yes, I am sure that zjoin works fine in the theory you have used to create it :P
10:01:53  heh
10:02:15  > scanl1 (zipWith (flip const)) $ map repeat [a,b,c]
10:02:17    [[a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a...
10:02:19  elliott: for rectangular elements, the scanl1 (zipWith (flip const)) part does nothing.
10:02:22  > tail . scanl1 (zipWith (flip const)) $ map repeat [a,b,c]
10:02:23    [[b,b,b,b,b,b,b,b,b,b,b,b,b,b,b,b,b,b,b,b,b,b,b,b,b,b,b,b,b,b,b,b,b,b,b,b,b...
10:02:27  right.
10:03:06 -!- Ngevd has joined.
10:03:11  > foldr f z (map repeat [a,b,c,d])
10:03:12    f [a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,...
10:03:20  > foldr f z (map pure [a,b,c,d])
10:03:21    No instance for (GHC.Show.Show (f SimpleReflect.Expr))
10:03:21     arising from a us...
10:03:23  Hello!
10:03:27  > foldr f z (map (:[]) [a,b,c,d])
10:03:27    f [a] (f [b] (f [c] (f [d] z)))
10:03:32  ok not immensely surprising :P
10:04:05  oh duh
10:04:11  foldr f z . map g = foldr (f . g) z
10:04:12  that'll help
10:04:30  hahahaha broccoli has a measure Hausdorff dimension of 2.66
10:04:31  awesome.
10:04:41  *measured
10:06:19  that's also a measure dimension, sort of.
10:06:45  as it's the dimension of sets that may have nontrivial hausdorff measure of that degree
10:07:00  (degree may not be actual term)
10:07:51  oerjan: join . fmap return = id proved
10:07:57  join . join = join . fmap join -- this seems like the hard one
10:08:15  elliott: oerjan: Norway is more Hausdorffy than Great Britain. Fight.
10:09:08  (apparently dimension is the term used)
10:09:26  oerjan: indeed
10:09:31  kallisti_: why should i fight, it's obviously true
10:10:12  elliott: yeah that's the one where you have to test non-"rectangular" sets, so the scanl1 (zipWith (flip const)) part becomes important
10:10:21    ZipList . diag . scanl1 (zipWith (flip const)) . map getZipList . diag . scanl1 (zipWith (flip const)) . map getZipList . getZipList $ m
10:10:22    ZipList . diag . scanl1 (zipWith (flip const)) . map (getZipList . join) $ getZipList m
10:10:26  oerjan: i have to prove these two lines equal
10:10:27  oerjan: because you guys should take mathematics /personally/
10:10:28  fml :P
10:10:36  hmm
10:10:44  ZipList . diag . scanl1 (zipWith (flip const)) . map getZipList . diag . scanl1 (zipWith (flip const)) . map getZipList . getZipList $ m
10:10:47  ZipList . diag . scanl1 (zipWith (flip const)) . map getZipList . map join $ getZipList m
10:10:59  so actually
10:11:00  i just need to prove
10:11:01  diag . scanl1 (zipWith (flip const)) . map getZipList
10:11:02  = map join
10:11:04  no?
10:11:13  oerjan: also, maybe elliott secretly thinks having a lower Hausdorff dimensions is better for a high quality nation.
10:11:38  oh and on ZipLists "rectangular" elements obviously are what you intuitively call rectangles, it's just that it applies more generally to any attempt to extend Applicatives to Monads, i believe.
10:12:21  oerjan: so what is it you actually believe about Applicative then
10:12:42 * kallisti_ believes Applicative created the world and made it flat.
10:13:04  http://sprunge.us/XfUi; too lazy to do the last proof for now
10:13:06  aka
10:13:09  the one involving any kind of thought at all
10:13:31  oerjan: have you checked whether this monad's ap and liftM agree?
10:14:44  that would be rather astounding, since they don't have the same type ;P
10:15:54  kallisti_: well lower hausdorff dimension probably gives easier industrial packaging.
10:16:00  oerjan: har har har
10:16:03  with the Applicative instance I mean of course
10:17:03  The Peano curve packs pretty well
10:17:03  elliott: well the zjoin is _designed_ to be correct on rectangular elements automatically, and all elements that are actually joined when constructing ap and liftM stuff are rectangular.
10:18:18  oerjan: i meant tested empirically :P
10:18:26  probably not :P
10:19:48  fmap (\x -> fmap (f x) m) n  is the general form of a rectangular element in an arbitrary Functor.
10:21:43  Deewiant: I don't suppose you know how to get backtraces for individual threads in gdb after they all exit
10:21:43  empiricism in math? zah1
10:21:45  applying join to that should give liftM2 f n m, so it's determined by the Applicative part.
10:22:00  elliott: Nope, printf all the way
10:22:15  Deewiant: :(
10:23:44  elliott: basically, you might want to prove zjoin (fmap (\x -> fmap (f x) m) n) = liftA2f n m  as a lemma to use.
10:23:54  *liftA2 f n m
10:24:02  oerjan: yes. when i get back to it :P
10:24:41  in a sense it is the initial definition of zjoin, which is then extended in some hopefully consistent way to all elements.
10:25:25  and from it should follow that everything Applicative behaves correctly with it.
10:27:30  and also the first and second monad laws.  it's just the third one which can still break.
10:27:33  afair.
10:29:41 -!- Ngevd has quit (Ping timeout: 245 seconds).
10:31:26  elliott: btw my intuitive but maybe not sufficiently checked reason for why the scanl1 (zipWith (flip const)) adjustment should fix the join . join == join . fmap join  third law formulation  is that it forces the necessary _cubic_ parts of the m (m (m x)) element to exist.
10:31:34  heh
10:31:43  you should publish this >:)
10:31:50  AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAa
10:32:30  Functional Pearl: Categorical Gardening: Applicative Functors to Monads with Shears and Cubes
10:33:37  that is, an element is included in join (join m) iff its entire ancestor "cube" is included, which should be the same as the requirement for an element in join (fmap join m) to be included.
10:34:37  elliott: Gregor has a paper called "The Eval that Men Do"
10:34:44  which makes me cringe
10:34:47  everytime I read it.
10:35:16  (the "cube" being the elements that are above and to the left of it in any of the containing sublists, seen as a 3-dimensional grid)
10:36:00  kallisti_: we named that
10:36:28  elliott: that "shear" was a bit of a joke, it just looks like a geometric shear transformation in how it moves list elements.
10:37:04  elliott: who's "we"?
10:37:36  kallisti_: #esoteric
10:37:55   elliott: Gregor has a paper called "The Eval that Men Do" <-- i recall that, i vaguely think he asked us for more eval suggestions :P
10:39:57  The Root of All Eval is an obvious one.
10:40:11  Phantom_Hoover: Yes, we covered all the bases.
10:40:16  i'm sure it was m... right
10:40:28  Oh dear god this paper is amazing.
10:40:29  all your eval bases are belong to us
10:40:45  "The Eval that Men Do" is better because it's still a horrible pun while also being relevant to the paper.
10:41:03  whereas "The Root of All Eval" is less relevant
10:41:09  *-s
10:41:09  unless you're talking about like.... trees or something.
10:50:52 -!- variable has quit (Excess Flood).
10:52:07 -!- variable has joined.
11:01:29  "Encapsulate world queue into an abstract interface"
11:01:36  Gotta think of a way to make this commit subject less terrible
11:05:37  elliott: Inact the principle of information hiding on world queue by means of implementing an abstract protocol."
11:05:45  s/^/"/
11:05:47 -!- Phantom_Hoover has quit (Ping timeout: 248 seconds).
11:19:11 -!- Phantom_Hoover has joined.
11:28:00 -!- zzo38 has quit (Remote host closed the connection).
11:36:26 -!- oerjan has quit (Quit: leaving).
11:40:02 -!- sebbu2 has joined.
11:40:54 -!- sebbu has quit (Ping timeout: 244 seconds).
12:15:39 -!- elliott_ has joined.
12:15:39 -!- elliott has quit (Read error: Connection reset by peer).
12:32:28 -!- sebbu2 has quit (Ping timeout: 260 seconds).
12:35:00 -!- sebbu2 has joined.
12:35:00 -!- sebbu2 has quit (Changing host).
12:35:00 -!- sebbu2 has joined.
12:37:24 -!- Phantom_Hoover has left ("Leaving").
12:37:42 -!- Phantom_Hoover has joined.
12:39:26 -!- sebbu3 has joined.
12:41:35 -!- augur has joined.
12:43:23 -!- sebbu2 has quit (Ping timeout: 248 seconds).
12:53:27 -!- sebbu3 has changed nick to sebbu.
13:00:48  elliott_: you could try dumbing it down
13:01:55  "I maed an abstract interface out of teh world queue."
13:05:00 -!- Patashu has quit (Quit: MSN: Patashu@hotmail.com , Gmail: Patashu0@gmail.com , AIM: Patashu0 , YIM: patashu2 , Skype: patashu0 .).
13:16:12 -!- Ngevd has joined.
13:20:28  Hello!
13:36:48 -!- sebbu2 has joined.
13:37:47 -!- sebbu has quit (Ping timeout: 248 seconds).
13:45:41  > 2 + 2
13:45:42    4
13:47:24  > tau
13:47:25    Not in scope: `tau'
13:48:46  > (0/0) == (0/0)
13:48:47    False
13:52:24  I think it's time
13:52:28  for two monitors once again.
14:16:07 -!- elliott_ has quit (Read error: Connection reset by peer).
14:16:49 -!- elliott_ has joined.
14:18:17  elliott_: hi
14:18:23  hi
14:25:59  I wonder if Coke and coffee mixed together is good
14:29:44  > pi :: Expr
14:29:45    pi
14:29:50  > deriv sin pi
14:29:51    -1.0
14:29:57  > deriv sin (pi :: Expr)
14:29:59    1 * cos pi
14:30:42  elliott_: using Expr with deriv is actually very cool.
14:30:49  Yes, when it works :P
14:31:00  what breaks, in particular?
14:32:00  I forget, sorry.
14:32:48  elliott_: noooooo, how could you.
14:33:13  I have abstracted you from "human being" to "limitless and impatient well of information"
14:33:25  you're breaking my encapsulation!
14:36:47  > deriv (\a -> a * sin a * ln a * a^2 + 1) (x :: Expr)
14:36:48    Not in scope: `ln'
14:36:52  > deriv (\a -> a * sin a * log a * a^2 + 1) (x :: Expr)
14:36:54    ((1 * sin x + x * (1 * cos x)) * log x + x * sin x * (1 * recip x)) * (x * ...
14:37:42  why must it have 1 * everywhere?
14:37:46  what a waste!
14:38:22  I guess Expr could special case 1 so that it's omitted, however, I think it's left in for demonstration of function implementations.
14:38:56  it would be nice to have different Expr "styles", one that attempts to reduce expressions and one that's verbatim
14:40:47  hmmm, also
14:41:23  you could probably also extend Expr to generate ASTs?
14:44:03  "I can (well, almost) hear you asking yourselves "why?".  Hurd will be
14:44:03  out in a year (or two, or next month, who knows), and I've already got
14:44:05  minix."
14:44:19  -- Linux Torvalds, 1991
14:44:25  ...
14:44:27  yes Linux
14:44:30  I refuse to correct it.
14:46:23   I guess Expr could special case 1 so that it's omitted, however, I think it's left in for demonstration of function implementations.
14:46:29  > reduce $ deriv sin (pi :: Expr)
14:46:30    1 * (-1.0)
14:46:35  heh
14:46:44  > exprValue $ deriv sin (pi :: Expr)
14:46:44    Not in scope: `exprValue'
14:46:47  oh interesting
14:47:18  :t reduce
14:47:19  Expr -> Expr
14:47:22  @hoogle Expr -> a
14:47:23  Warning: Unknown type Expr
14:47:23  Unsafe.Coerce unsafeCoerce :: a -> b
14:47:23  Prelude id :: a -> a
14:47:27  bleh
14:47:29  stupid hoogle
14:47:30  > intExpr $ deriv sin (pi :: Expr)
14:47:31    Not in scope: `intExpr'
14:47:33  > doubleExpr $ deriv sin (pi :: Expr)
14:47:34    Not in scope: `doubleExpr'
14:47:36  lame
14:48:09  or wait, does Num make any assumptions about whether or not it's a field?
14:48:31  :t fromIntegral
14:48:32  forall a b. (Integral a, Num b) => a -> b
14:48:44  in other words, is it required that  fromIntegral 1 * x == x  ?
14:49:28  Num has no laws
14:49:33  oh, okay.
14:49:43  @quote without laws
14:49:44  No quotes for this person. There are some things that I just don't know.
14:49:47  @quote elliott laws
14:49:48  No quotes match. Take a stress pill and think things over.
14:49:50  @quote elliott_ laws
14:49:51  No quotes for this person. Take a stress pill and think things over.
14:49:53  @quote elliott type
14:49:53  elliott says: a typeclass is nothing without semantics
14:49:55  @quote fuck
14:49:55  Oh.
14:49:56  medfly says:  THIS IS SPARTA!  go fuck yourself
14:50:00  I misremrembered myself'e'. :'(
14:50:16  Wow, Google just understood "ahaskel wekly naws".
14:50:49  indeed it does.
14:51:00  IT'S LIKE THEY DO SOME KIND OF LEVENWEEJRIJSJW DISTANCE
14:51:09  http://www.google.co.uk/search?gcx=w&sourceid=chrome&ie=UTF-8&q=LEVENWEEJRIJSJW+DISTANCE
14:51:21  alas
14:51:44  LEVENstEW DISTANCE
14:51:45  works
14:52:02  leven stew
14:52:41  help sleep deprivation and weird blood pressure drops.
14:56:26  elliott_: help me find ways to break deriv
14:56:41  :t logBase
14:56:42  forall a. (Floating a) => a -> a -> a
14:58:12  elliott_: how is differentiation implemented in mathematica?
14:58:21  symbolically and badly
14:58:37 -!- copumpkin has joined.
14:58:49  > deriv (\x -> fromEnum . isInfinity $ x) 3
14:58:50    Not in scope: `isInfinity'
14:58:59  > deriv (\x -> fromEnum . isNegativeZero $ x) 3
14:59:00    Couldn't match expected type `Data.Number.Dif.Dif b'
14:59:01          against inferr...
14:59:10  > deriv (\x -> fromEnum . x == 2) 3
14:59:11    Couldn't match expected type `Data.Number.Dif.Dif b'
14:59:12          against inferr...
14:59:12  lol
14:59:18  > deriv (\x -> fromEnum (x == 2)) 3
14:59:19    Couldn't match expected type `Data.Number.Dif.Dif b'
14:59:20          against inferr...
14:59:22  orjeiojwrrijweroijhweroihwetoihwer
14:59:26  :t fromEnum
14:59:27  forall a. (Enum a) => a -> Int
14:59:28  oh
14:59:45  > deriv (\x -> fromIntegral (fromEnum (x == 2))) 3
14:59:46    0
15:41:58  kallisti_: PUNPUNPUN
15:41:58  Gregor: You have 1 new message. '/msg lambdabot @messages' to read it.
15:44:26  Gregor: FUNFUNFUN
15:44:42  > 1 `mappend` 2
15:44:43    Ambiguous type variable `a' in the constraints:
15:44:43     `Data.Monoid.Monoid a'
15:44:43   ...
15:44:59  :t Add
15:45:00  Not in scope: data constructor `Add'
15:45:38  > Sum 1 `mappend` Sum 2
15:45:39    Sum {getSum = 3}
15:45:46  amazing.
15:47:24 -!- copumpkin has quit (Remote host closed the connection).
15:47:42  > const (Sum 3) `mappend` const (Sum 4) $ 6
15:47:44    Sum {getSum = 7}
15:47:48 -!- copumpkin has joined.
15:48:46  > tail `mappend` (++"dongs") $ " lol"
15:48:48    "lol loldongs"
15:50:14  sometimes I feel the number of instances you can make with a -> b is just out of hand.
15:50:38  most of the time, however
15:50:41  I don't think that.
16:00:11 -!- kallisti_ has quit (Ping timeout: 252 seconds).
16:05:33 -!- kallisti has joined.
16:05:33 -!- kallisti has quit (Changing host).
16:05:34 -!- kallisti has joined.
16:12:14 -!- ais523 has joined.
16:13:09  well, I completed Braid, anyway (any%; 100%ing it takes years without spoilers, apparently, and the game disguises the fact that there is a better ending than the obvious one)
16:20:19  ais523: apparently you have to wait on one level for like two hours or some other dumb shit like that
16:21:12  yep
16:21:19  around an hour and a half
16:21:30  why did he think that was a good idea
16:23:14  well, the mere existence of the stars is hidden
16:23:18  incidentally, does anyone know a better way of deleting a function definition in vim than d/^}/?
16:23:32  and putting things behind very long waits is a good way to hide them
16:23:37  ddd% works, but is gross
16:23:44  (it's how most of the instances of Totaka's Song are hidden, for instance)
16:24:20  oh, d]} might do it
16:24:32  oh! d}
16:24:37  nice
16:26:40  the other issue with Braid is that you don't get to hear the music much
16:26:49  as half the time it's playing backwards or at a crazy speed or whatever
16:27:59  hmm, fun thing I just noticed by accident: the MediaWiki keyboard shortcut for "delete" (alt-shift-d) means "undelete" on a nonexistent page
16:29:30  (diff) (hist) . . m Excela‎; 12:24 . . (+1,570) . . Oerjan (Talk | contribs) (Fnord)
16:29:30  (diff) (hist) . . Excela‎; 10:35 . . (-1,570) . . Theodorex1Jf (Talk | contribs)
16:29:35  ais523: _please_ protect Excela already...
16:29:42  oh wait
16:29:47  you said they moved to another page if they did that
16:29:49  yep
16:29:52  have we had google translate bots before?
16:29:57  I don't recall any but I may be wrong
16:30:06  I don't think so
16:30:14  ais523: just protect every page except [[Snack]] for a few days
16:30:17  but it may be the same framework finding anew way to get around filters
16:30:19  then we don't have to bother reverting
16:30:34  also, protecting an entire namespace needs dev powers
16:30:43  I meant manually :)
16:30:44  or a huge amount of very very spammy protection by hand
16:31:03  ais523: ooh, now I want to not revert the spam for long enough to see if the bots will ever re-mangle a mangled page
16:31:21  maybe if left to their own devices they'll turn any page into completely unintelligible mush
16:31:26  s/maybe if/maybe/
16:33:11 -!- aloril has quit (Ping timeout: 252 seconds).
16:34:41 -!- Ngevd has quit (Ping timeout: 245 seconds).
16:38:08 -!- Ngevd has joined.
16:38:27 -!- Ngevd has quit (Client Quit).
16:41:14   as half the time it's playing backwards or at a crazy speed or whatever <-- that annoyed me too
16:41:25  anyway how did you end up playing Braid?
16:41:57   ais523: apparently you have to wait on one level for like two hours or some other dumb shit like that <-- just let it run in the background while you eat lunch
16:42:28  Vorpal: I watched a speedrun, and it inspired me to play the game
16:42:32  heh
16:42:39  I had it already, but it had a dependency on nvidia-something so I thought it wouldn't work
16:42:42  ah
16:42:46  but I installed the nvidia package anyway and it did work
16:42:54  hm
16:43:04  ais523: I played it on ati/amd so yeah
16:43:32  I use Intel graphics; I deliberately aim for laptops which have them
16:43:43  works better on Linux than the alternatives, typically
16:43:49  hybrid graphics is a nice alternative there
16:43:56  ais523: Better modulo their being terrible
16:44:02  Good drivers only get you so far :P
16:44:03  you can use intel unless you want good 3D performance
16:44:04  elliott_: they're good /enough/
16:44:07  for what I want to do
16:44:22  what's important for me are good drivers and good enough 3D performance
16:44:25  and Intel hits both requirements
16:44:50  you have very low 3D expectations then
16:45:54  it's good enough to play Neverwinter Nights
16:46:00  which admittedly is a pretty old game
16:46:12 -!- aloril has joined.
16:46:46  ais523: come on, I had some third-party stuff fail on intel graphics in NWN due to texture compression formats that weren't supported
16:46:56  and you can't really drag the graphical quality settings to max
16:47:10  which is ridiculous for such an old game.
16:47:35  anything that isn't intel graphics have been able to run nwn on max graphical settings for several years
16:47:57  so OSX is estimated at 86,000,000 lines of code.. windows xp at 45,000,000 lines of code.. do you think a haskell OS would end up down at 1,000,000?
16:49:07  os x is larger than windows xp?
16:49:08  heh
16:49:11  which version of os x
16:49:23  i said estimated anyway
16:49:26  ah okay
16:49:29  10.4
16:49:46  wiki reference says
16:49:50  "Jobs, Steve (August 2006). "Live from WWDC 2006: Steve Jobs Keynote". Retrieved 2007-02-16. "86 million lines of source code that was ported to run on an entirely new architecture with zero hiccups.""
16:52:40  Windows XP, released in 2001, has 35 million lines of code
16:52:57  . Windows XP was compiled of 45 million lines of code.
16:53:16  whats 10 million lines of code between friends
16:55:15  Several thousand engineers have labored to build and test Windows Vista, a sprawling, complex software construction project with 50 million lines of code, or more than 40 percent larger than Windows XP.
16:55:43  clearly theres a bit of bullshitting going on somewhere
16:56:59  the new york times says "35 million lines of code."
16:57:10  wiki sourcing the windows facebook page says 45
16:57:33  seems these numbers are fairly meaningless
16:58:04  jeff atwood says 40 million
16:58:30  apparently quoting wikipedia
17:12:07 -!- copumpkin has quit (Remote host closed the connection).
17:17:45 -!- copumpkin has joined.
17:25:14 -!- monqy has joined.
17:25:45  in 2008 Linux had approx. 6 million lines of actual code.
17:25:56  over 10 million includes whitespace and comments.
17:26:52  note this is just the kernel itself.
17:29:36  9793 Torvalds, an asteroid named after Linus Torvalds
17:29:36  9882 Stallman, an asteroid named after Richard Matthew Stallman, American hacker, founder of the free software movement and the GNU project
17:29:39  9965 GNU, an asteroid named after the GNU project
17:29:53  9885 Linux is an asteroid discovered on October 12, 1994 by Spacewatch. The asteroid is named after the Linux operating system kernel
17:30:18  I love asteroid names.
17:31:59  wow there are 18,269 Main Belt asteroid articles.
17:33:27  probably mostly autogenerated
17:33:38  kallisti: 1994?
17:33:46  named after Linux only 3 years after it began...
17:34:00  Discovered
17:34:06  Named, possibly later
17:34:14  Ah
17:34:28  Or not, but I think that's possible
17:35:04  I suppose Linux would have been fairly popular in that kind of environment by 1994
17:36:01  14070060 total lines in Linux 3.1.1, according to ohcount; 10011948 excluding comments and whitespace
17:36:30  Deewiant: How much excluding drivers?
17:36:40  (This includes xml, xslt, scheme, and other languages)
17:36:51  I bet a lot of that is documentation
17:37:00  Probably not *that* much though :P
17:37:16  As of January 4, 2011, using current LOC and wage numbers with David A. Wheeler's calculations it would cost approximately 3 billion USD (about 2.2 billion EUR) to redevelop the Linux kernel.
17:37:24  If you want just the C and assembler files, 13233055+459402 and 9396007+362268
17:37:38  kallisti: David A. Wheeler's calculations = sloccount's bullshit estimates :P
17:37:50  Ohloh and sloccount and all these things always estimate like a million times what things would actually cost to develop
17:37:53  There's also 247515+149638 of "cpp", which I guess is headers
17:38:01  I think they claimed cfunge would cost like $80k or something
17:38:20  Deewiant: I'm more interested in how much of that is driver code
17:38:39  elliott_: I'm running your not-drivers calculation, it'll take a while
17:38:41  elliott_: hey programmers are expensive. and lazy.
17:38:47  Adding a driver doesn't really increase the overall complexity of a system, so in some sense drivers are free from the perspective of the rest of the system
17:39:00  Whereas adding code within the core system does increase complexity
17:42:13  elliott_: http://sprunge.us/TXcC
17:42:50  Wow, so only 56% of Linux is drivers
17:43:01  That's an awfully big core
17:44:11  elliott_: so assuming an average yearly salary of $63k (current average in the US), they're saying it would take....
17:44:44  > (63/80)*12
17:44:46    9.45
17:44:55  one person 9.45 months to code cfunge?
17:45:30  (granted they probably used a different estimation technique)
17:45:39  (or at least a different average salary)
17:46:03  kallisti: I believe the method is literally "take statistic for lines/day a programmer writes, scale by salary"
17:46:26  http://hg.openjdk.java.net/hsx/hotspot-rt/hotspot/rev/763f01599ff4 Ha ha ha oh boy
17:46:59  oh, well that's kind of reasonable I guess.
17:48:50  assuming it's non-whitespace lines.
17:49:04  well...
17:49:13  no I guess those kind of count too? comments do anyway
17:49:29  as that represents documentation effort.
17:53:45  "Of course 5 years from now that will be different, but 5 years from now everyone will be running free GNU on their 200 MIPS, 64M SPARCstation-5."
17:53:52  linus v. tanenbaum is so fun
17:54:05  it's like they're pretending to be oblivious people in 1992
17:54:09  badly
17:54:53 -!- oerjan has joined.
17:54:53 * kallisti is like he's pretending to be an oblivious person in 2011
17:55:59  interestingly enough it takes about as much time for a person to produce cfunge as it does to create a baby.
17:56:06  based on that probably horrible estimate.
17:56:24 -!- Ngevd has joined.
17:56:26  Hello!
17:57:02  hi
17:57:52  next: produce a funge98 interpreter through genetically engineering a baby
17:58:39  !hey
17:58:39  it would be horrible if compilers attempted to detect typos and simply corrected them under the hood...
17:58:58  I've heard of a compiler that did that
17:59:05  Apparently it was awful
17:59:31   interestingly enough it takes about as much time for a person to produce cfunge as it does to create a baby. <-- it takes 2 people to create a baby
17:59:34  well perl supposedly resolves ambiguities automatically
17:59:48  ais523: I just saw an interesting way to upload a *.patch to a mediawiki installation that didn't accept that type: "File:Makefile.patch.png"
18:00:11  ais523: do people ever try that sort of stuff on wikipedia?
18:00:13  Vorpal: just write a piet program that performs the patch
18:00:22  nobody can delete that for not being a valid image
18:00:23  hah
18:00:28  `addquote  interestingly enough it takes about as much time for a person to produce cfunge as it does to create a baby.
18:00:34  elliott_: it is on the defcon dev wiki
18:00:37  741)  interestingly enough it takes about as much time for a person to produce cfunge as it does to create a baby.
18:00:47  Vorpal: people attempted it occasionally; on Wikipeida such files can be speedied
18:00:49  *Wikipedia
18:00:50  ah
18:00:56 -!- derrik has joined.
18:01:33  elliott_: you know you get dev access to uplink/darwinia/defcon/multiwinia with the humble bundle now
18:01:36  which is great
18:01:51  No, I completely missed getting an email about it and it being near the top of /r/programming.
18:01:56  I think normally they sell that for a higher price
18:02:03  See, what I usually do is ignore my email and not read reddit, because hey, Vorpal will let me know.
18:02:06  elliott_: ah good thing I told you then :P
18:02:16  happy australian mailman mailing list reminders day!
18:02:22  Vorpal: DEFCON and Multiwinia source are new, I believe.
18:02:27  hm really
18:02:29  okay
18:02:33  No, just DEFCON.
18:02:35  elliott_: it's even on Slashdot
18:02:37  elliott_: anyway my statement was correct then. I forgot the question mark above
18:02:37  ais523: It's the most - wonderful tiiiiime of the year!
18:02:47  so yes you knew it. Which was all I stated :P
18:02:53  ais523: happy ammlr day!
18:03:00  hmm, abbreviation ruins it
18:03:09  yep, you have to write it out
18:03:14  speaking of which. Tomorrow is my birthday
18:03:25  ais523: happy australian mailman mailing list reminders day, then
18:03:39  Vorpal: sorry, I only wish people happies on australian mailman mailing list reminders day.
18:03:42  Vorpal, how old will that make you?
18:03:47  the day we worship the ancient sumerian god Amm Lr
18:03:52  Vorpal: try getting a better birthday
18:04:05  ais523: haha, I just noticed how many players blognomic has now
18:04:06  Ngevd: err, I'm old enough to not think much about my age. Lets see... *gets calculator*
18:04:23  Vorpal is old as dirt
18:04:24  22
18:04:24  elliott_: it's going back to normal
18:04:39  oerjan: have you had a birthday recently, i kinda lose track
18:04:44  oerjan: but seriously, you stop thinking about exact age once you get past 20 or so.
18:04:48  wow, I'm older than Vorpal?
18:04:56  of course you are
18:04:57  ais523: aren't you like 24?
18:05:00  yes
18:05:14  does ais523 not remember when Vorpal was 18
18:05:17  anyway of course, I thought it was well established
18:05:19  or was it 19
18:05:28  elliott_: if by "recently" you mean in the last 6 months, then yes.
18:05:32  elliott_: err I was in this channel before I turned 18 I'm pretty sure
18:05:43  Vorpal: no
18:05:46  oerjan: happy belated australian mailman mailing list reminders day!
18:05:49  elliott_: yes.
18:05:53  Vorpal: 2008
18:05:59  Vorpal: only until you start reaching round numbers again :P
18:06:07  hm
18:06:12  oerjan: :/
18:06:15  oh, hmm, 2007
18:06:21  Vorpal: 2007-10-30
18:06:27  elliott_: so 17 then
18:06:31  is the day I made my worst mistake
18:06:35  lol
18:06:35  elliott_, how old were you when you came here?
18:06:46  11 or 12 iirc?
18:06:48  Ngevd: umm, 11 or 12
18:06:50  I forget exactly
18:07:12  When I was 11 or 12, that was about when I started in the Murderous Maths forum
18:07:13  I think
18:07:20  Which I have since sadly abandoned
18:08:05  Ngevd: well it's good you left before you were murdered
18:08:07  arvid=> select * from irc.logs_na where nick = 'elliott' order by serial ASC limit 1;
18:08:07   serial |       tstamp        |  nick   | target |                   uhost                    | type | body
18:08:07  --------+---------------------+---------+--------+--------------------------------------------+------+------
18:08:07   208001 | 2006-12-29 21:42:41 | elliott |        | n=ehird@user-5440e204.wfd80a.dsl.pol.co.uk |    3 |
18:08:12  elliott_: you can count it from that
18:08:17  Yep, I was 12
18:08:29  The 16th of October 2007
18:08:29  (note, normalised nick, that is why it says elliott)
18:08:32  Vorpal: that one doesn't count, i joined, was too intimidated to say anything, then left
18:08:37  the next time i joined was in 2007
18:08:44  elliott_: wait is it normalised or normalized in UK English?
18:08:55  Vorpal: depends on dialect
18:08:58  Depends whether en-gb or en-gb-OED
18:08:59  OED uses -zed
18:09:13  Ngevd: *en-GB, *en-GB-oed
18:09:14   208001 | 2006-12-29 21:42:41 | elliott |        | n=ehird@user-5440e204.wfd80a.dsl.pol.co.uk   |    3 |
18:09:14   208002 | 2006-12-29 21:43:09 | elliott |        |                                              |    4 |
18:09:14   271393 | 2007-05-14 17:48:38 | elliott |        | n=ehird@user-54457988.lns6-c11.dsl.pol.co.uk |    3 |
18:09:22  elliott_: too intimidated by what?
18:09:25  I joined the UMMF 17 days before my 13th birthday
18:09:30  Vorpal: lots of people and silence!!!!
18:09:34  elliott_: heh
18:09:45  you could have all been nasty. I don't talk until I'm sure I'm the nastiest one present
18:09:56  hah
18:10:18  anyway 11 then, assuming i can do arithmetic
18:10:22  wait OED isn't the default for en-gb?  sacrilege!
18:10:23  which i'm not sure of
18:10:30  1995-08 --> 2006-12
18:10:36  or --> 2007-05, the same either way
18:10:55  oerjan: -zed is the only common case where -oed disagrees from common british english usage iirc
18:11:03  aha
18:11:26  oerjan: and they list -ise too
18:11:29  just not as the preferred spelling
18:11:36  "The use of -ize instead of -ise does not affect the spelling of words ending in -yse, such as analyse, paralyse and catalyse"
18:11:38  didn't know that
18:12:11  an excellent analyzis
18:14:12  oerjan: oh, looks like OED has a few other idiosyncrasies too, like preferring "co-operate"
18:14:29  coöperäte
18:14:33  oerjan: confusing matters further, it seems like "cooperate" is what appears in their "consumer" dictionaries
18:14:42  as opposed to the unusable-as-a-dictionary OED text itself :P
18:14:44  As opposed to English cooperate, or Esoterian coperate.
18:15:11  Read as "Estonian".
18:15:12  or volapük köüperät
18:15:23  Was confusing, 'cuz they do use os and diaereses a lot.
18:15:24  (note: possibly not actual volapük)
18:15:57  lojban c'ou,. zrxrope
18:16:20  c'ou,. tvtrope
18:16:29 -!- Slereah_ has joined.
18:16:59  http://oxforddictionaries.com/definition/cooperate?view=uk or is it.....
18:17:06  i don't care enough to try and dig deeper
18:17:22  Coöperate.
18:17:28  cöpærüt
18:17:35  http://en.wiktionary.org/wiki/cooperate#Alternative_forms
18:17:47  oerjan: pretty
18:17:47 -!- Slereah has quit (Ping timeout: 248 seconds).
18:17:54  Phantom_Hoover:  As opposed to English cooperate, or Esoterian coöperate.
18:18:05  Phantom_Hoover: Anyway I will stop being annoyed by your diaeresing if you apply it properly.
18:18:07  Ah, of course.
18:18:18  elliott_, excuse me how else do you apply it.
18:18:23  Phantom_Hoover: I.e., to all diaereses, not just diaereses on adjacent vowels.
18:18:35  I once talked like that for an /entire minute/; I'm sure you can manage.
18:18:42  Yes fine I will do it.
18:18:42  Erm
18:18:46  s/adjacent vowels/repeated vowels/
18:19:59  This is quite easy.
18:20:15  ('ea' isn't a diaeresis.)
18:20:20  (Nor is that one.)
18:20:37  Phantom_Hoover: Talk about poetry.
18:20:46  *poëtry.
18:21:14  Phantom_Hoover: Also shouldn't it be di(ae with " on top)resis because of the i, or am I wrong.
18:21:23  In phonology, hiatus (English: /haɪˈeɪtəs/; Latin: [hɪˈaːtʊs] "gaping")[1] or diaeresis (/daɪˈɛrɨsɨs/ or /daɪˈɪərɨsɨs/,[2] from Ancient Greek διαίρεσις diaíresis "division")[3] refers to two vowel sounds occurring in adjacent syllables, with no intervening consonant. When two adjacent vowel sounds occur in the same syllable, the result is instead described as a diphthong.
18:21:23  The English words hiatus and diaeresis themselves contain a hiatus between the first and second syllables.
18:21:59  Yeah, you need "diæ̈resis".
18:22:13  How far does this rabbit hole go?
18:22:31  SO FAR.
18:22:37  I would have gone for potry
18:22:48  Phantom_Hoover: Will you cooperate on your hiatus to produce poetry with diaereses?
18:22:50  Yes, that is because you are an idiöt.
18:23:13  16:29:35:  ais523: _please_ protect Excela already...
18:23:14  16:29:42:  oh wait
18:23:14  16:29:47:  you said they moved to another page if they did that
18:23:31  what we need is some way to protect the page so the bots don't actually realize it is protected
18:23:33  is excela a brainfuck derivative
18:23:41  oerjan: ghostprotecting?
18:23:54  ...i guess
18:24:01  Ghostecting.
18:24:07  oerjan: ("ghostbanning" is a common term for the forum equivalent of that)
18:24:13  (only the ghostbanned user can see their own posts)
18:24:28  elliott_: well it sounds like what reddit does with voting
18:24:28  that would require an extension that probably doesn't even _exist_ yet though, so good luck with that :P
18:24:37  oerjan: yeah
18:24:53  Wow, diȧėreses (look, I don't have a compose binding for it) are remarkably uncommon.
18:25:11  Phantom_Hoover: æ̈ here you go.
18:25:24 -!- elliott_ has left ("Leaving").
18:25:26 -!- elliott_ has joined.
18:25:27  elliott_, better, get me a decent .XCompose.
18:25:38  Phantom_Hoover: I think if you get an ae, and then do what you do for a diaeresis and then press space, it'll work.
18:26:07  Nope.
18:26:32  *shruggot*
18:26:33  elliott_: it's rather ridiculous with a page that has a plethora of recent edits but hasn't really been changed since 2006 :P
18:26:36  I wish I knew of a decent .XCompose.
18:26:48  oerjan: we should start improving it to confuse the spambots
18:26:52  heh
18:27:19  die, reses!
18:27:29  elliött_, I distinctly recall someöne linking me to one on reddit, but I didn't keep track of it.
18:28:44  http://forums.introversion.co.uk/introversion/viewtopic.php?t=3003
18:28:49  *snigger*
18:30:19  Phantom_Hoover: hehehehehe
18:30:21  headclot
18:30:46  "Who said I was joking - I bought the Humble Introversion bundle and I was quite impressed at what I saw."
18:30:52   9882 Stallman, an asteroid named after Richard Matthew Stallman, American hacker, founder of the free software movement and the GNU project
18:30:53  Email: Technology_rocks@hotmail.com
18:31:02  if that ever gets close to earth, we're fucked
18:31:52  "We do not exist on the internet yet at least. :/"
18:31:54  Humble INTP bundle
18:31:55  heheheheehehehehehehe
18:32:42  hm i haven't seen myers-briggs mentioned much in a while
18:46:03 -!- Phantom_Hoover has quit (Ping timeout: 248 seconds).
18:47:58  oerjan: where?
18:48:44  elliott_: um, i didn't mean to imply that i'd seen it, i just thought of the fact i hadn't after making that pun
18:49:12  ok
18:49:34 -!- derrik has quit (Quit: restart).
18:52:40  boredom -> Special:Random -> Kit Osbourne -> Combat Zone Wrestling -> Philadelphia -> Gentrification -> Property tax -> Mill (currency) -> Latin -> Ancient Greek which we've hit before
18:54:15  we got a strong acceptance to STACS 2012!
18:54:16  oklopol: You have 1 new message. '/msg lambdabot @messages' to read it.
18:54:45 -!- derrik has joined.
18:54:58  elliott_: about that message, didn't i then prove the theorem?
18:55:18  Ancient Greek still leads roundabout to Greek language :P
18:55:42  also, other reviewers may or may not have given us equally great reviews.
18:56:08  and some of them may or may not have pointed out a full page listing of typos and thinkos
18:56:29  oklopol: can you prove a lil' theorem oerjan needs
18:56:50  which one
18:57:23  hm this was one of the really long ones, still passing through Human (after Ngevd's very temporary cycle i feel like rechecking where this one goes; no change so far i think)
18:57:44  oklopol: oh it's just a simple one, proving the equivalence of two really simple functions
18:57:46  isn't that right oerjan
18:57:53  Did we ever come to a conclusion on differentiation chains?
18:58:00  oerjan's just not smart enough to do it you see
18:58:00  yeah oerjan solved it
18:58:12  The answer was?
18:58:18  Ngevd: answer to what
18:58:22  just look at e^(ax)
18:58:31  elliott_: are you talking about the ZipList stuff?  i think it's pretty clear in principle.
18:58:41  and choose a fittingly
18:58:49  but oerjan: did you get uniqueness from that?
18:59:12  i think you then get that from taylor series with little trouble for analytic functions
18:59:16  oklopol: i didn't actually _give_ the proof, i just recalled what i remembered as the answer
18:59:53  i consider e^(ax) a proof of existence, but okay so you know it's unique
19:01:41  oklopol: i'm pretty sure, although i don't recall how it goes, it's probably some linear operator proof
19:02:36 -!- Phantom_Hoover has joined.
19:02:43  also i think you need only something like C^n functions to make it so
19:03:08  ...well, it's obviously C^infty once something _is_ a solution.
19:08:29  oklopol: oh it may involve one of the basic extension theorems for differential equations - if the values of a solution function and its n-1 first derivatives at a point are given, then its extension to some neighborhood is unique and by some linear algebra some linear combination of the e^(ax) things obviously fits.
19:09:19  iirc
19:13:01  ah the Human article after a while actually reaches Ngevd's Valuation (finance)
19:14:41  so basically this path is ridiculously long
19:15:01 -!- GreaseMonkey has joined.
19:15:18  I think I first encountered that loop via Human Population...?
19:15:22  I started at "chess"
19:15:51  oh wait sorry it wasn't one of Ngevd's anyway, he had Valuation of options -> Option (finance)  at one point
19:15:57  Oh, did they remove the philosophy loop?
19:15:59  which is similar but not the same
19:16:08  Phantom_Hoover: we are not doing the same game
19:16:15  Ah.
19:17:16  we are looking at the last link of the introduction section, which tends to give _rather_ longer paths
19:17:30  but still has some commonly occuring end cycles
19:17:46 -!- kmc has joined.
19:18:23  oerjan: hm i wonder what the longest cycle on wikipedia in _general_ is
19:18:33  i.e. picking which link to follow by a magic oracle that picks the one that leads to the longest cycle :P
19:19:11  ah now reaching President of the United States.  i don't believe anything has changed on this path since last time
19:20:10  elliott_: hm i wonder what would be an algorithm for that.  in fact isn't that hamiltonian-cycle like, so likely NP-complete
19:20:16 -!- derrik has quit (Ping timeout: 240 seconds).
19:20:59  oerjan: http://en.wikipedia.org/wiki/Longest_path_problem ?
19:21:06  NP-complete, apparently
19:21:07  that is, solving it requires at a minimum finding out whether there is a hamiltonian cycle
19:21:07  :(
19:21:08  could even be harder, but certainly at least as hard as hamiltonian.
19:21:18  oklopol: hamiltonian hard, it seems
19:21:23  godo term that
19:21:25  hamiltonian hard
19:21:49  well it's the usual meaning of "hard" in complexity theory
19:22:05  that's just hardness / completeness of the decision problem. but wait, that's enough.
19:22:16  then just do a binary search
19:22:26  that's the way it usually goes
19:22:34  err
19:22:41  assuming the decision problem has a suitable parameter to search by
19:23:08  except nono, a nondeterministic tm cannot necessarily show that something is not doable
19:23:27  or that some length cannot be done
19:24:27  oklopol: well of course.  you end up with the oracle class P^NP
19:24:46  so we agree that it's probably not np-complete
19:24:56  np-hard, is the term :P
19:25:16  obviously i know that, since i just used it
19:25:24  which is obvious from hamiltonian-hard + hamiltonian being NP-complete
19:26:12  basically we'd need to show it's in co-np i guess
19:26:55  erm
19:27:14  i mean
19:27:22  it's likely to be hard for _both_ NP and co-NP, i'd think
19:27:48  but if the decision problem is in both np and co-np, then isn't the problem of actually finding the longest path in np
19:28:20  since you can then do binary search within np
19:28:30  NFP
19:28:40  well sure
19:28:56  or wait
19:29:11  please stop arguing about terminology and start agreeing with everything i say
19:29:11  ais523: there?
19:29:35  yes
19:29:37  FNP, was it
19:29:40  ais523: know anything about Dungeons of Dreadmor? All I know it is a rouge like, and was added to the last humble bundle.
19:29:45  I don't
19:29:47  So I figure you might know if it is any good
19:29:47 -!- MDude has quit (Ping timeout: 248 seconds).
19:29:48  ah okay
19:29:50  fnp
19:29:57  well I'll give it a try
19:30:35  functions calculabilated in nondeterministic polynomial time
19:30:35  well, maybe.  it looks a little tricky.
19:30:45  heh, difficulty setting: elves (easy), dwarves (normal), going rouge (hard). Plus a permadeath option
19:30:53  hm what to chose
19:31:03  I'm tempted to go for the nethack way of doing it
19:31:31  Going rouge ... SO RED ... SO RED IT HURTS MY EYES
19:31:43  typoed that :P
19:31:54  rogue of course
19:31:58  get an upper bound for biggest value, then do binary search, starting both the np algo and the np algo for the complement at the same time, one of them returns true in polynomial time, continue for linearly many steps to reach value
19:32:10  hm we're on to South Korea, i vaguely recall we may be on the way to the Petronas Towers cycle
19:32:16  no?
19:32:22  okay no class selection. Instead you select 5 skills from a set of... ~40
19:32:56  actually 7 out of 34. I fail at counting today
19:33:01  and there is a random button
19:33:03  running the algos at the same time is a polynomial increase, and there's a linear bound on the length of the upper bound
19:33:27  oklopol: well i'm just not quite sure that's what they meant by FNP in wikipedia
19:33:42  oerjan: hmph now i really want to know the longest cycle in wikipedia :P
19:33:47  oerjan: how many years do i gotta wait to bruteforce it
19:34:09  oerjan: that's the definition of NP imo :D
19:34:43  oklopol: er NP is decision problems.  you are trying to calculate a function problem, which obviously has a different name.
19:34:51  no race selection
19:35:09  i'm just not sure wikipedia's FNP is precisely the class you are using.
19:35:24  it had this strange relation definition
19:35:51  oerjan: HOW MANY YEAAAAAAARS
19:35:57  oh it has its own article too, i just looked at FP
19:36:15  oerjan: yeah but i mean fnp has nothing to do with the class fnp in complexity theory imo
19:36:25  elliott_: get to the singularity first, and we can start estimating
19:36:28  that's just the language of witnesses
19:36:35  oerjan: cries
19:36:35  or whatever they like to call it
19:36:40  oklopol: how many years !!!!
19:36:52  elliott_: 14
19:37:06  elliott_: there is of course a possibility that wikipedia's graph allows for some greatly simplifying optimizations
19:37:24  i just checked the definition of fnp in my book and it's definitely the relations computable by a nondeterministic turing machine.
19:37:33  oerjan: well paths are very short in general
19:37:47  in the sense that you get nondeterministic output from your tm
19:37:59  but let me check again, actually...
19:38:03  ais523: so far it seems like a good rougelike. Good game music too. It doesn't take itself seriously though.
19:38:17  that's also often good in roguelikes
19:38:20  oerjan: "If you follow the best route in all cases, it takes an average of 4.573 clicks to get from any Wikipedia article to any other."
19:38:51  "Bellare and Goldwasser showed in 1994 using some standard assumptions that there exist problems in NP such that their FNP versions are not self-reducible, implying that they are harder than their corresponding decision problem.
19:38:55  elliott_: I wonder what the value is not counting orphan and linkless?
19:38:55  "
19:39:16  so.
19:39:31  ais523: "Wikipedia has 2301486 articles with 55550003 links between them (at least in my dataset, those numbers have definitely changed by now). The largest "strongly-connected-component" of wikipedia has 2111480 articles. That is, there are 2111480 articles with the property that from any of them, it is possible to get to any other one. The rest are mostly pages that no-one has linked to or disambiguation pages. For the graph-theory nerds, there is no
19:39:31  other disjoint strongly connected component of more than about 3 articles. For everyone else, the remaining 190006 articles are pretty boring, linkwise."
19:39:34  ais523: so i doubt it'd change much
19:39:46  ah, interesting
19:39:52  Screw this, I'm getting the latest humble indie bundle
19:39:56  fnp, in my book, is not even anything, they use the terms NPMV and NPSV for multi- and single-valued functions calculated by a tm
19:40:02  elliott_: um i was assuming you wanted to always take the _worst_ route
19:40:05  oerjan: well yes
19:40:08  fp is what it should be
19:40:09  wow, someone's probably been looking carefully for walled gardens
19:40:12  oerjan: i was just telling you the only thing i knew about wikipedia's graph :P
19:40:15  (articles linking to each other but not to articles in general)
19:40:16  ais523: that was in 2008
19:40:32  ais523: well yeah, it is graphical of course. What else would one expect from a modern game. Oblique graphics (I think the term is, like isometric but aligned with one axis)
19:40:33  ais523: I think it's more infoboxes
19:40:37  and obsessive linking of dates
19:40:38  and thinks like that
19:40:39  *things
19:40:41  and countries
19:40:43  elliott_: those only go one way
19:40:47  well, OK
19:40:48  that doesn't lead to a strongly connected component
19:40:51  unless it goes both ways
19:41:24  "In the complexities below, I just use "n" to denote either number of nodes or number of edges. Since the graph is so sparse, they're mostly interchangeable."
19:42:05  Graphs? Complexity? This is Eodermdrome, right?
19:42:26  I had an idea for another graph-based esolang
19:42:41  But then I remembered I still need to finish Salesman
19:42:43  Petronas Towers it was.
19:42:57  Phantom_Hoover: wikipedia
19:43:19  elliott_: wikipedia as an eodermdrome program.  discuss.
19:43:20  Wikidermdrome.
19:43:25  ais523: the game has some interesting name for your basic stats. I think "burliness" is it's name for "strength" and so on
19:43:33  heh
19:43:34  sagacity is probably int I guess?
19:43:42  Vorpal, stat names are always a sign of quality!
19:43:42  caddishness I don't know
19:43:49  well i suppose eodermdrome state fits better.
19:43:52  Caddishness, I assume, would be charisma.
19:44:01  Phantom_Hoover: no but in this case a sign that the game is not taking itself seriously at all.
19:44:32  there is nimbleness (dex I presume), savvy (wis?) and stubbornness (?)
19:45:53  help how do I install .rpm
19:45:58  a traffic cone as a helmet... heh
19:46:21  Ngevd, is this a Humble Bundle thing?
19:46:24  Yes
19:46:28  DEFCON
19:46:46  Ooh, there's a .deb
19:46:47  Ngevd: just use the .tar.gz?
19:46:49  or that
19:46:49  .debs are easy
19:46:49  I'd just download the .gz, TbH.
19:47:25  Much less fuss, and it's not like adding a launcher (the only serious advantage of a .deb in this context) isn't much work.
19:49:39 * Phantom_Hoover purges SpaceChem, uses APT again.
19:49:42  Um.
19:49:45  The .deb is not much less fuss.
19:49:51  You can literally double click them to install.
19:49:58  *more fuss
19:50:01  Ngevd: Use the .debs.
19:50:23  I was only not using the .debs because of momentary selective blindness
19:51:06  wand of laser
19:51:43  Is it bad that so far my favourite roguelike is Pokmon Mystery Dungeon Red Rescue Team?
19:52:18  ais523: the description of wand of laser is funny: "Aside from tangential properties, this wand's primary magical power involves distracting cats"
19:52:41  pretty effective still
19:53:09  stats are "entropy: 27, burn rate: 15" whatever that means
19:53:30  Perhaps it's describing the standard entropy value.
19:53:58  oh okay the tutorial just told me, it has a chance of burnout when used based on entropy and entropy increases with every use
19:54:10  not sure about burn rate though
20:02:11  Ngevd: no, it's a pretty good roguelike
20:02:33  Explorers of Time/Darkness/Sky is better, though; Sky removed a lot of rough edges but added a couple of silly mechanics, but it's probably still the best of the three
20:02:39  the problem is that it starts out far too easy
20:02:44  (all three, that is)
20:07:07 -!- Phantom_Hoover has quit (Ping timeout: 248 seconds).
20:08:12 -!- zzo38 has joined.
20:09:21 -!- Phantom_Hoover has joined.
20:11:49  oerjan: thanks for reminding me of that six degrees of wikipedia thing, followed some links and the guy has an interesting series of haskell posts on his blog :P
20:12:27 -!- BeholdMyGlory has quit (Ping timeout: 248 seconds).
20:12:47  yw
20:13:39  unfortunately it involves arrows so i don't understand it :'(
20:15:19  Can Applicative be defined in terms of fmap and pure and (liftA2 (,)) instead of (<*>) and pure?
20:15:42  zzo38: yes, i said.
20:16:55  fm <*> x = uncurry ($) `fmap` liftA2 (,) fm x
20:18:52  also i mentioned that a blog comment called it lax monoidal category or something like that
20:33:34   Please describe in glowing terms the inventor of IRP.
20:33:34   I have no idea who invented IRP
20:33:34   :(
20:33:45  (In #irp )
20:34:12  SIC TRANSIT GLORIA MVNDI
20:36:55  Gregor: Can you go back in time and not invent IRP?
20:37:23  elliott_: If I hadn't invented IRP, you couldn't have even just requested that in IRP#esoteric NOW COULD YOU
20:40:31  IRP, is that the internet relay programming or whatchamacallit?
20:40:48  No.
20:40:54  IRP is Ignorant Rabbi Preachers.
20:40:58  Gregor is one.
20:41:16  why am i suddenly having this deja vu feeling
20:41:40  `log [i]gnorant rabbi preachers
20:42:08  2011-11-30.txt:20:40:54:  IRP is Ignorant Rabbi Preachers.
20:43:36  i guess i must have loaded from a saved game, or something.
20:43:49  oerjan: you know how temperamenatl `log is :P
20:43:57  or does synchronicity guarantee that it would have given the right result
20:43:59  `log [i]gnorant rabbi preachers
20:44:06  2011-11-30.txt:20:42:08:  2011-11-30.txt:20:40:54:  IRP is Ignorant Rabbi Preachers.
20:44:40  elliott_: it doesn't look _overly_.
20:44:56  there would be another word if my brain were working.
20:47:41  "were"? how many brains do you have?
20:48:02  in which we learn that olsner doesn't know about the subjunctive.
20:49:36  i'm starting to worry about my increasing snarkiness.  slightly.
20:49:38  *sigh* this troll on reddit hasn't replied to the second-last phase of my argument
20:51:51  oerjan: hmm, is that the subjunctive? can you combine subjunctive with if?
20:52:02  pretty sure
20:52:59  in fact i suspect that's the _majority_ of uses
20:55:32 -!- augur has quit (Read error: Connection reset by peer).
20:57:48  oh well.. I'm not the authority on moods anyway, not even the subjunctive one
20:59:36  oerjan: your original line was slightly awkward-seeming btw
20:59:46  which one?
20:59:47  but not wrong at all
20:59:51   there would be another word if my brain were working.
20:59:58  "there would be another word were my brain working" seems better to me
21:00:06  aha
21:00:47  which of course looks more awkward to _me_, but... :P
21:01:00  aha! told ya the if was wonky
21:01:55  oerjan: well the whole thing is kind of awkward, it doesn't feel like the way someone would talk without trying to
21:02:42  Quiet, Thou
21:03:09  talking without trying to is also awkward
21:03:22  nah is fohel askgaøla gloher
21:03:26  ... were it to happen
21:24:15 -!- augur has joined.
21:32:47  oerjan: heh i just realised that arrow notation having banana brackets is funny
21:33:03  O KAY
21:33:12  oerjan: do you
21:33:13  get it
21:33:19  no.
21:33:26  oerjan: time flies like a
21:33:32  *n
21:33:39 * oerjan swats elliott_ -----###
21:33:45  :'(
21:33:49  crying
21:33:56  there was a banana fly on your head
21:34:52  oerjan: (do you (understand arow,)es)
21:35:04  no one does
21:35:29  even oleg just pretends they're applicatives + category
21:35:56  oerjan: i have not found that to help, seeing as I failed to derive arr from Applicative + Category without looking it up :P
21:36:01  ((<$> id))
21:36:09  funny that
21:36:25  are you implyig im stupid :(
21:37:25  nah just retired
21:37:36 * elliott_ cry
21:37:55  lack of oxygen.
21:38:33  elliott_: you know about weird C++ stuff right?
21:38:42  Phantom_Hoover: kill oerjan , to die for, insult with old meme
21:38:53  Vorpal: i AM weird C++ stuff --leonardo de vinci
21:38:57  *da
21:38:58  wha
21:39:05  oh wai
21:39:06  t
21:39:10  obnoxious meme is obnoxious
21:39:10  da is actually rihght
21:39:11  elliott_: any idea why foo might not work (due to "'foo' was not declared in this scope") while this->foo works perfectly?
21:39:13  that was meant to be a funny joke
21:39:15  oops.
21:39:19  elliott_: templates are involved
21:39:29  Vorpal: is this a puzzle or can i see code
21:39:57  elliott_: it is from darwinia source, trying to get it to compile. Adding this-> worked. I don't think I'm legally allowed to paste it just like that.
21:40:09  Vorpal: i own the bundle.
21:40:19  elliott_: well I need to paste it to you in private then, sec
21:41:55 * oerjan wonders if internet memes will be like fashion, and recycle in a few decades
21:42:17  xkcd did a comic on that, although I can't remember if it was pre- or post-decay.
21:42:26  oerjan: http://xkcd.com/286/
21:42:31  Phantom_Hoover: WAY AHEAD OF YOU
21:42:47  Pre-decay, then.
21:42:57  all your memes are belong to us
21:43:16  Retroturn.
21:43:32  hmm, when was aybabtu?
21:44:24  "-- became an Internet phenomenon or meme in 2000–2002."
21:44:25  fizzie: You have 1 new message. '/msg lambdabot @messages' to read it.
21:44:31  elliott_: see /msg
21:44:32  Why ask a random channel when you can ask Wikipedia?
21:44:53  I asked first, then I went to wikipedia and waited for someone to repeat the information I just read there
21:44:56  WHAT IF WE WANT A RANDOM ANSWER
21:45:05  or a funnier answer
21:45:14  fizzie: YOUR MISTAKE WAS SPEAKING
21:45:33  Most of what I speak is like that.
21:48:33  fizzie: Oh, you're cheating.
21:48:37  You can't speak and then chat like that.
21:48:41  *cheat
21:49:38 -!- Patashu has joined.
21:59:08 -!- Taneb has joined.
22:02:11 -!- Ngevd has quit (Ping timeout: 245 seconds).
22:02:22 -!- MDude has joined.
22:04:22 -!- oerjan has quit (Quit: Good night).
22:07:04 -!- lambdabot has quit (Quit: #lesswrong).
22:18:17 -!- Jafet has quit (Quit: Leaving.).
22:20:16  Deewiant: Test the Windows build already
22:20:26  elliott_: help
22:22:05   Just noticed my email in my account settings was 0.034064395384923 I asume that was the issue.
22:22:09  hahaha
22:22:20  (it seems to be back to normal now…)
22:23:01 -!- elliott_ has quit (Read error: Operation timed out).
22:26:29  http://www.youtube.com/watch?v=rzXOVbYUamc
22:26:36  Conclusion: quintopia should live in IKEA.
22:30:37 -!- ais523 has quit (Remote host closed the connection).
22:50:22   http://www.youtube.com/watch?v=rzXOVbYUamc <-- cool
23:20:02 * Phantom_Hoover → sleep
23:20:04 -!- Phantom_Hoover has quit (Quit: Leaving).
23:20:12  Good idea
23:42:12 -!- Taneb has quit (Ping timeout: 260 seconds).
23:57:17 -!- Klisz has joined.