00:00:22 I think polypoly is a CMS system 00:03:27 poly wants a cookie 00:03:48 boily: i'm sorry, that must clearly be rholy- greek r is always aspirated hth 00:31:46 `learn A rholypoly is an edible Greek species of Armadillidiidae. Goes well with garlic! 00:31:47 I knew that. 00:33:12 gah i think this packet of orange juice is unusually sour 00:47:06 orange juice comes in packets? 00:47:39 -!- conehead has quit (Quit: Textual IRC Client: www.textualapp.com). 00:48:02 what's this about lovers and wives and poly 00:48:05 also why is Quintopia capitalized today 00:50:01 kmc: http://www.supermarket.no/media/catalog/product/cache/1/image/235x/f6f16b5d1c90e7b178d9c9bcfc699527/s/u/sunniva-orginal-appelsinjuice-1_75-l.jpg 00:51:55 Quintopia is in a permanent state of being capitalized. 00:52:56 well 00:53:02 in other channel there is a quanticle 00:53:13 it frequently results in mispings 00:53:17 same length and start 00:53:29 i thought a case difference might help 00:54:03 also hi boily, would you like to know what i am most likely to be doing at a given hour of a random day? 00:54:47 -!- metasepia has joined. 00:54:55 Quintopia: yes? 00:57:47 i don't like that brainfuck survey. i want to answer "this and this and this are all good choices" and "it depends" for all of them 00:58:33 http://ibin.co/1OMoLTjhEy49 00:59:29 a standard that just enumerates all possible behaviors without specifying anything sounds pretty good 00:59:43 if a standard is what the survey is supposed to produce 00:59:56 "notsleeping" means "i should be asleep but i'm doing some other random crap". if i filter out "notsleeping" and "bed" those four hours become "blog, sleeping, sleeping, sleeping" 01:00:53 -!- Phantom__Hoover has quit (Quit: Leaving). 01:01:17 http://ibin.co/1OMr2pMlF2v4 this is the same thing but on the weekend 01:04:47 is that localtime? 01:05:13 -!- ^v has joined. 01:08:45 yes that's US eastern time (adjusted for dst as necessary?) 01:10:22 your timezone is misaligned hth 01:10:51 a side effect of an evening job 01:11:09 I had one one summer. I was working from 5pm up until about 2am. 01:11:30 I remember 'tis was the summer where I watched the Fullmetal Panic the first time. 01:12:26 is that related to full metal jacket? 01:12:47 also 'tis was makes no sense hth 01:14:02 no. 01:14:26 it's too late for me to properly conjugate. 01:14:49 it's never too late! even the dead can learn to read! 01:15:07 okay time for exercise 01:15:29 -!- realzies has quit (Ping timeout: 246 seconds). 01:15:48 what kind? 01:16:30 @src foldr 01:16:30 foldr f z [] = z 01:16:30 foldr f z (x:xs) = f x (foldr f z xs) 01:16:40 grammatical workout! 01:17:58 int-e: http://stackoverflow.com/questions/23969963/printing-definitions-of-functions-classes-in-ghci-with-lambdabot 01:19:14 i think the answer is "lambdabot can't do that" but i'm not sure enough to answer. 01:20:08 -!- nooodl has quit (Quit: Ik ga weg). 01:22:41 @tell int-e http://stackoverflow.com/questions/23969963/printing-definitions-of-functions-classes-in-ghci-with-lambdabot 01:22:41 Consider it noted. 01:34:01 -!- yorick has quit (Remote host closed the connection). 01:37:50 -!- Sorella has quit (Ping timeout: 265 seconds). 01:38:09 -!- TodPunk has quit (Read error: Connection reset by peer). 01:44:04 -!- realz has joined. 01:44:04 -!- realz has quit (Changing host). 01:44:04 -!- realz has joined. 01:48:51 ~metar CYUL 01:48:52 CYUL 010100Z 11006KT 30SM SCT240 18/09 A3029 RMK CI4 SLP257 01:48:57 windows open tonight. 01:49:03 -!- boily has quit (Quit: AERATED CHICKEN). 01:49:29 -!- metasepia has quit (Remote host closed the connection). 01:52:20 -!- tromp has quit (Remote host closed the connection). 01:52:46 -!- tromp has joined. 01:57:31 -!- TodPunk has joined. 01:58:21 halp 01:58:38 someone tell me how it works (and whether it is correct) http://bpaste.net/show/326061/ 01:58:44 i know no haskell 02:00:08 (for us in a repl) 02:01:17 (:[]) 02:03:37 Quintopia, you should hire back the wizards who wrote this 02:05:44 it's supposed to count the number of paths of length at least 1 in a 3x3 grid 02:10:25 -!- ^v has quit (Quit: http://i.imgur.com/Akc6r.gif). 02:11:00 -!- conehead has joined. 02:15:44 -!- ^v has joined. 02:18:13 :t runStateT 02:18:13 StateT s m a -> s -> m (a, s) 02:20:27 Quintopia: looks plausible hth 02:22:30 although this made not be one of the cases where StateT is clearer than explicit accumulator passing :P 02:22:35 *may not 02:23:37 and adjacents might seem a little inefficient (no caching of results) 02:27:29 -!- ^v has quit (Quit: http://i.imgur.com/Akc6r.gif). 02:27:47 -!- ^v has joined. 02:28:20 Quintopia: perhaps it would help if i unraveled the StateT part? walk (visited@(cur:_) = do next <- adjacents cur; if (next `elem` visited) then return visited else (walk (next:visited)) ... oh wait there's a bug. 02:28:55 -!- Patashu_ has quit (Ping timeout: 252 seconds). 02:29:12 Quintopia: nope it's not correct because it will duplicate final paths if there is more than one already visited cell to the final one 02:30:14 so it overcounts? 02:30:31 yeah 02:31:15 *cell next to 02:33:03 let walk :: StateT [(Integer, Integer)] [] (); walk = do {visited@(cur:_) <- get; next <- lift (adjacents cur); unless (next `elem` visited) (modify (next:) >> walk)} 02:33:06 oops 02:34:07 let walk :: StateT [(Integer, Integer)] [] (); walk = do {visited@(cur:_) <- get; next <- lift (adjacents cur); guard (next `notElem` visited); (modify (next:) >> (get `mplus` walk)} 02:34:13 try that. 02:34:23 oh wait 02:34:28 hmph 02:34:47 I saw that someone did make up a "co-do-notation", which they called "method-notation". 02:36:14 i recall there was a discussion about whether comonad notation was method calls. i don't think everyone agreed. 02:36:22 *was essentially 02:37:06 let walk :: StateT [(Integer, Integer)] [] (); walk = do {visited@(cur:_) <- get; next <- lift (adjacents cur); guard (next `notElem` visited); (modify (next:) >> (return () `mplus` walk)} 02:37:47 <^v> '=a$#""7[H 02:38:03 it doesn't matter what it returns since it's extracting just the state anyway. 02:38:53 i _think_ that will work but someone might want to test it. 02:39:55 I don't know if it is like method calls either, but I can see how it work. It is similar to a do-notation, and you can bind variables, but instead of giving a wrapped result and the variable's value is unwrapped, it is other way around; furthermore, there is a implicit variable "this" which is defined as the current value of the object at the current step. It can be call method-notation, whether or not it is resembling method calls. 02:40:27 Even just like, do-notation does not necessarily have to sequence actions either. 02:41:26 oerjan: just can you tell me what result it gives? i don't have haskell set up here 02:41:41 wait you want _me_ to test it, how awkward 02:42:09 Quintopia: You can also run Haskell codes on lambdabot and on HackEgo 02:43:17 i think i would fail miserably if i tried that 02:43:20 i'm hopeless 02:44:14 oh mismatched parenthesis 02:44:21 sad mac 02:44:24 let walk :: StateT [(Integer, Integer)] [] (); walk = do {visited@(cur:_) <- get; next <- lift (adjacents cur); guard (next `notElem` visited); modify (next:) >> (return () `mplus` walk)} 02:45:59 oerjan: (return () `mplus` ...) actually does something? 02:46:11 of course this would be just the time for that autoscrolling bug of my touchpad driver to happen 02:46:27 Quintopia: result is 644 hth 02:47:01 wow so low. 02:47:23 elliott: sure, in this case the return () gives an alternative which halts the computation there with the current path, and then the part after does the prolonging alternative. 02:47:35 > return () `mplus` [1,2,3] 02:47:37 No instance for (GHC.Num.Num ()) arising from the literal ‘1’ 02:47:42 > return 0 `mplus` [1,2,3] 02:47:44 [0,1,2,3] 02:47:48 er. 02:47:52 why am I doing that 02:47:54 oerjan: and this counts a->b and b->a as separate paths, yes? 02:47:54 the current path being in the StateT state 02:48:03 right, okay. weird 02:48:11 Quintopia: yes. also it does not repeat cells in the path. 02:48:30 good good 02:48:40 i trust you 02:48:59 well you can trust me, but _i_ don't trust that code not to have bugs hth 02:49:48 tdh 02:50:09 but my faith that your code is correct is higher than my faith that random guy's code is correct 02:50:14 although the first 5 elements of paths do look plausible 02:50:39 [[(1,0),(0,0)],[(2,0),(1,0),(0,0)],[(2,1),(2,0),(1,0),(0,0)],[(1,1),(2,1),(2,0),(1,0),(0,0)],[(0,1),(1,1),(2,1),(2,0),(1,0),(0,0)]] 02:51:07 (the paths are backwards from the point the search starts) 02:51:39 there are 9 cells so, hm... 02:52:03 > product [1..9] 02:52:05 362880 02:52:39 or hm 02:52:53 > 1*2*3*4^6 02:52:54 24576 02:53:06 um no 02:53:12 > 1*2*3*4^5*9 02:53:14 55296 02:53:32 that's like a slightly better overestimate 02:53:41 -!- conehead has quit (Quit: Computer has gone to sleep). 02:53:51 the best underestimate i can think of is 256 02:54:14 and with some cells only having 1-3 neighbors - oh wait, except for the first only 3 can be used... 02:54:29 > 1*2*3^5*4*9 02:54:31 17496 02:54:55 still an overestimate. i don't think it's so implausible that it's 644. 02:55:08 um 02:55:39 that doesn't say much for the security of the combo lock on my smartphone then 02:55:41 i forgot paths don't all have length exactly 9. not that i think that matters much for this estimate. 02:55:54 Quintopia: heh 02:55:59 unless it locks down after too many wrong attempts. i don't think it does. 02:56:53 zzo38: actually HackEgo no longer has haskell 02:57:59 oerjan: could you better explain me the bug you fixed. something like if the final node is adjacent to two visited vertices it counts the path twice? 02:58:12 why did it do that? 02:58:42 right, okay. weird <-- the StateT ... [] () just lifts the mplus of the underlying [] monad, btw 02:59:22 WHy does it no longer have Haskell though? 02:59:42 zzo38: Gregor didn't install haskell on the new server when he moved HackEgo 03:01:03 O, well you can still use Haskell on lambdabot although there are various restrictions if you do that. 03:01:50 Quintopia: yep, because the unless (next `elem` visited) test happens _after_ next has already been selected and thus, if the test fails for two different next's, they give two different "parallel computations" with the same result. 03:01:53 You could also see if you have access to a telnet or SSH with Haskell installed 03:03:11 -!- kmc has left. 03:05:20 while my version works by simply failing the computation with no result at all in that case, and instead doing a return () before the recursive walk 03:06:16 oerjan: the guy who wrote it thinks it's "obvious" that the test will happen after next has been selected. why does it fail in that case? 03:07:46 Quintopia: it fails because a result path is counted once for each "next" that stops it 03:09:01 and the next is not itself included in that path 03:09:13 oh that makes sense 03:15:14 "isnt [] a left zero of >>?" 03:16:13 Quintopia: yes, and so? 03:17:20 he tested the line you pasted above and said it failed 03:17:43 my last version? 03:18:03 i did fix a mismatched parenthesis 03:18:36 the one from :44 03:20:07 it should be let walk :: StateT [(Integer, Integer)] [] (); walk = do {visited@(cur:_) <- get; next <- lift (adjacents cur); guard (next `notElem` visited); modify (next:) >> (return () `mplus` walk)} 03:21:19 i think that's what i said 03:21:37 did he remember to include the other lines from the pastebin? 03:22:03 i would assume so. they were in his repl after all 03:22:30 and also to re-let the following ones 03:22:36 so they use the new version 03:22:49 what kind of failure did he get 03:23:38 if he pasted from irssi there may be formatting problems due to line wrapping (i had to fix that) 03:23:39 -!- ^v has quit (Read error: Connection reset by peer). 03:24:07 -!- ^v has joined. 03:27:34 mapM_ (print.reverse) $ take 30 paths looks precisely as i would expect, and there are no duplicate paths. 03:28:02 <^v> '=a$#]\[[H 03:28:38 ^v: are you a russian encrypted channel 03:29:49 Quintopia: well, not much i can do to help without a bug report hth 03:32:48 you might get one 03:33:02 oops 03:35:58 -!- not^v has joined. 03:36:43 -!- ^v has quit (Ping timeout: 240 seconds). 03:37:56 so i did, confusion cleared up now 03:38:10 waht 03:38:14 -!- not^v has changed nick to ^v. 03:40:24 ^v: we now agree that my haskell definition seems to work 04:09:50 -!- Bicyclidine has quit (Ping timeout: 255 seconds). 04:09:54 -!- Patashu has joined. 04:15:53 -!- Patashu_ has joined. 04:15:53 -!- Patashu has quit (Disconnected by services). 04:24:56 -!- FireFly has quit (Excess Flood). 04:25:27 -!- kmc has joined. 04:26:43 -!- FireFly has joined. 04:46:46 I am writing the C library for VM360, which is based on Ada/CS Object Machine, which is based on IBM 360/370 series mainframe computers. 04:47:44 zzo38: the IBM 360 was a sweet computer 04:48:05 mcpherrin: I don't know much about it though. 04:48:38 zzo38: a bunch of my coworkers used them 04:48:54 OK 04:48:57 they were microcoded, which was pretty aweomse 04:49:21 Yes, I think it would be 04:49:38 apparently the IBM techs had various debugging microcode they could use 04:50:53 It would be sweet if you could get the actual microcode and run that in an emulator 04:52:07 Yes it could, but I don't have any such thing, nor is it what I am making. 04:59:18 How do I detect floating point underflow in a C code? 05:00:09 <^v> so 05:00:12 <^v> making malbolge 05:00:17 <^v> in 4D 05:01:28 <^v> oh and it uses base 9 05:02:27 ^v: http://esolangs.org/wiki/Most_ever_Brainfuckiest_Fuck_you_Brain_fucker_Fuck 05:03:48 anger management issues 05:03:58 <^v> > and take its decimal expansion 05:03:59 Not in scope: ‘its’ 05:03:59 Perhaps you meant one of these: 05:03:59 ‘ito’ (imported from Control.Lens), 05:03:59 ‘bits’ (imported from Data.Bits.Lens)Not in scope: ‘expansion’ 05:04:03 <^v> > then you go fuck yourself. 05:04:04 :1:1: parse error on input ‘then’ 05:04:04 <^v> oh 05:04:05 <^v> crap 05:04:09 <^v> lambdabot, stahp 05:04:32 feature 05:04:34 * ^v beats the shit out of lambdabot until it stops beeping 05:04:58 <^v> elliott, NOTICE atleast ;-; 05:05:01 anyway: malbolge in a hilbert space 05:05:10 it discourages starting lines with > 05:05:22 <^v> show the "not in scope" then notice them the "peraps you meant" 05:09:47 <^v> would anyone even want to try to use my malbolge? 05:29:17 <^v> Talk talk:Turing tarpit 05:29:17 <^v> pssst... spambots... edit this page so it gets protected... —ehird 19:01, 13 April 2011 (UTC) 05:29:17 <^v> Spambot: No. 05:38:08 thank you, I do in fact remember writing that comment three years ago. 05:39:02 "It is easy to figure out my speed, since I walk at a constant speed," Recordis said proudly. 05:42:07 <^v> A regular 4294967296-gon is constructible with straightedge and compass. 05:42:09 <^v> mkay 05:42:36 that's news you can use 05:42:58 procedure for drawing higher polygons with a straightedge and compass: just draw a fucking circle noone can tell the difference 05:43:18 "2^32-agon" has a better ring to it 05:43:36 four score and 2^32 ago 05:44:54 I keep seeing a red lobster ad for "the ultimate, lobster topped lobster" 05:49:31 Bike: if you draw one a thousand miles wide they can 05:50:03 i am not going to do that 05:51:39 <^v> http://puu.sh/9a0uj/6964e4826c.png 05:51:43 <^v> NOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOO 05:51:53 <^v> why are my puushes long now D: 05:52:23 excuse you, i'm at LEAST three fourths assing 06:03:11 -!- password2 has joined. 06:08:12 -!- Slereah has joined. 06:09:38 -!- ^v has quit (Quit: http://i.imgur.com/Akc6r.gif). 06:09:46 -!- Slereah_ has quit (Ping timeout: 252 seconds). 06:12:24 -!- ^v has joined. 06:12:57 -!- tertu has quit (Ping timeout: 252 seconds). 06:13:51 These characters start with a deadline to understand using integrals for areas of 2 hours 56 minutes. They only start making progress with 9 minutes left. 06:15:18 that sounds like every maths problems set I tried to do 06:15:34 -!- ^v has quit (Client Quit). 06:15:54 -!- johnw has joined. 06:16:21 also, I feel I should add, what 06:16:29 yeah i'm having trouble parsing t his 06:16:47 I assume Sgeo is watching anime in which people learn maths 06:16:57 reasonable assumption 06:16:59 kmc: book 06:17:20 nope anime 06:18:02 The Gremlin set fires in pools that will destroy the country unless the pools are filled with the exact amount of water needed 06:18:45 buh? 06:18:51 kmc: Blaketh taught me to play pool the other day 06:18:58 except i'm still confused about the rules and also bad at it 06:19:07 you can like, fill a pool with water without computing how much water there is beforehand 06:19:51 is this a maths book in which there's a story and the moral of the story is you should've learned maths 06:20:00 shachaf: the first part is right 06:20:04 also integrals are really demoralizing as homework goes 06:20:13 or a meta-maths book where you have to use integrals or something to figure out how long it took people to learn maths 06:20:23 i had an assignment to do fourier series of a bunch of functions and i pretty much gave up after one trig integral 06:20:26 fuckem 06:20:43 integrals are a bit of a scow imo 06:21:32 "Lunch right now?" the count cried. "It's 11:23 1/2 A.M.!" 06:21:39 the fuck is a scow 06:21:50 "We always have lunch at 11:23 1/2 A.M., on the dot," Recordis said. 06:21:53 a barge 06:24:34 "I hope it's some easy number like 2 or 3," Recordis said. "We need to think of some letter to stand for the unknown base until we find out what it is." 06:24:50 They turned to me, and I came up with another suggestion: that we let the letter e stand for the unknown base. 06:25:09 Sgeo: if you quote much more it's going to rapidly exceed the bounds of fair use. 06:25:42 (I may have ulterior motives for wishing to stop the unauthorised reproduction of bad books into IRC channels I'm in.) 06:25:46 this prose sucks 06:25:56 Bike is correct 06:26:03 hey remember that time we got that ~esoteric~ book linked here 06:26:07 that was like, a whole week ago 06:26:10 man good times huh 06:27:15 It's not a bad book! I love it! Just... the writing seems more blatantly written to serve the needs of the math, which does make sense 06:28:04 that's how it always goes 06:28:16 the plot and writing and characters are total s hit but you keep reading because you're a fucking nerd 06:29:06 I respect your opinion and still think it's a bad book. 06:30:54 At one point, someone slips while etching something on glass, so they decide to find the answer for what was accidentally etched 06:33:57 -!- johnw has left ("ERC Version 5.3 (IRC client for Emacs)"). 06:42:41 -!- conehead has joined. 07:47:35 -!- password2 has quit (Ping timeout: 265 seconds). 07:55:23 -!- scp has joined. 07:56:20 `relcome scp 07:56:21 Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: . (For the other kind of esoterica, try #esoteric on irc.dal.net.) 07:56:48 `cat bin/relcome 07:56:49 rwelcome 07:56:54 Sweet rainbow 07:57:04 and thanks 07:57:09 `run ln -sf rwelcome bin/relcome 07:57:11 No output. 07:57:31 `relcome scp 07:57:32 scp: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: . (For the other kind of esoterica, try #esoteric on irc.dal.net.) 07:57:33 Better. 07:59:17 -!- lollo64it has quit (Ping timeout: 252 seconds). 07:59:56 -!- Slereah has quit (Read error: Connection reset by peer). 08:00:13 -!- Slereah_ has joined. 08:06:13 oh the `undo didn't reinstate links either... 08:08:24 `cat bin/welcome 08:08:25 #!/usr/bin/perl -w \ if (defined($_=shift)) { s/ *$//; s/ +/ @ /g; exec "bin/@", $_ . " ? welcome"; } else { exec "bin/?", "welcome"; } 08:10:54 `` ls bin/welcome* 08:10:55 bin/welcome \ bin/welcome13 08:13:05 `` ls bin/*welcome* 08:13:06 bin/rwelcome \ bin/welcome \ bin/welcome \ bin/welcome13 08:13:53 `welcome 08:13:54 Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: . (For the other kind of esoterica, try #esoteric on irc.dal.net.) 08:14:05 ic 08:15:28 `run sed -i 's/welcome/welcome "$@"/' bin/welcome 08:15:29 No output. 08:15:38 `welcome hi 08:15:39 hi: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: . (For the other kind of esoterica, try #esoteric on irc.dal.net.) 08:16:12 `welcome hi 08:16:13 hi: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: . (For the other kind of esoterica, try #esoteric on irc.dal.net.) 08:16:23 I like the rainbow much better than the bold (as experienced via irssi) 08:16:37 Well, there are many variants. 08:16:40 `WeLcOmE scp 08:16:41 ScP: wElCoMe tO ThE InTeRnAtIoNaL HuB FoR EsOtErIc pRoGrAmMiNg lAnGuAgE DeSiGn aNd dEpLoYmEnT! fOr mOrE InFoRmAtIoN, cHeCk oUt oUr wIkI: . (FoR ThE OtHeR KiNd oF EsOtErIcA, tRy #EsOtErIc oN IrC.DaL.NeT.) 08:19:53 -!- Burton has quit (Ping timeout: 245 seconds). 08:21:52 -!- Phantom_Hoover has joined. 08:24:03 kmc: http://www.friendsofcoleridge.com/membersonly/Clayson_Ramsgate_files/borges.htm 08:32:26 -!- Burton has joined. 08:40:08 -!- impomatic__ has left. 08:41:25 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 08:48:24 shachaf: that last example is way too optimistic about the case-insensitivity of the systems I use 08:53:19 hey we just fixed the url so it _should_ work... 08:53:30 before it didn't at all. 09:06:16 -!- lollo64it has joined. 09:10:02 oerjan: Was the "other way" just removing the main-page part from the URL? 09:11:32 yeah 09:11:59 and the wiki/ 09:15:08 So sneaky. 09:16:07 back when the first `welcome was made, the link didn't work without the wiki/ at least 09:16:43 since there was a root page with links to the archive as well 09:16:48 and the forum 09:41:53 -!- Phantom__Hoover has joined. 09:42:48 -!- Phantom_Hoover has quit (Ping timeout: 245 seconds). 10:13:29 -!- lollo64it has quit (Ping timeout: 252 seconds). 10:28:45 -!- lollo64it has joined. 10:32:53 -!- oerjan has quit (Quit: leaving). 11:12:37 there was a forum? 11:17:09 olsner: http://esolangs.org/forum/ 11:25:45 -!- boily has joined. 11:31:37 -!- Vorpal has joined. 11:43:06 wait, there is a forum? 11:55:32 -!- ais523 has joined. 12:08:31 the more I read about rust, the more it makes sense. 12:17:23 -!- lollo64it has quit (Ping timeout: 245 seconds). 12:36:07 -!- yorick has joined. 12:55:11 -!- Patashu_ has quit (Ping timeout: 252 seconds). 13:01:58 -!- MindlessDrone has quit (Quit: MindlessDrone). 13:02:00 -!- shikhin has joined. 13:08:45 -!- kallisti_ has quit (Ping timeout: 252 seconds). 13:18:51 -!- MindlessDrone has joined. 13:22:05 -!- realz has quit (Ping timeout: 246 seconds). 13:25:45 -!- realz has joined. 13:25:45 -!- realz has quit (Changing host). 13:25:45 -!- realz has joined. 13:30:50 -!- realz has quit (Ping timeout: 246 seconds). 13:34:13 -!- realz has joined. 13:37:19 One thing I wonder is 13:37:29 What languages did the Soviet Union use, outside of assemblyu 13:39:47 Did they use capitalist swine languages or make their own 13:46:13 -!- impomatic has quit (Read error: Connection reset by peer). 13:48:28 Bah. SO does not allow anonymous answers at all? I mean I can get the effect by making a new account, and they do not verify e-mail addresses, but there will be an account. 13:48:53 it's just another stupid social media website. 13:51:16 int-e: I think the intended purpose of Stack Overflow is to use gamification and social media techniques to trick people into contributing to an FAQ 13:51:57 maybe 13:52:18 But I don't want to play that game. They tend suck up my time. 13:52:21 tend *to 13:52:26 IRC is bad enough :P 13:57:17 I should brush my teeth. 13:57:20 -!- boily has quit (Quit: Poulet!). 14:18:53 "I got interested in the Soviet space program and was interested to discover that the software on the Buran spacecraft circa 1988 was written in Prolog. " 14:18:55 I knew it 14:19:00 Prolog is a communist plot 14:19:37 "The author himself participated in many early projects (mostly in hardware) and according to him analog hardware was in favor for a long time, he mentions that space rendezvous tasks didn't use digital computers until the late 70's." 14:20:29 http://en.wikipedia.org/wiki/DRAKON 14:20:30 Oh man 14:23:37 nothing wrong with prolog, except for cuts and negation as failure ;-) 14:24:12 (I prefer declarative programming languages) 14:24:26 prolog with cut is a completely different language to prolog without cut 14:26:35 Slereah_: they at least invented their own hardware 14:26:37 oh 14:26:43 you cited something related to that already 14:26:47 er, quoted 14:28:02 I think they had some ternary computers 14:28:09 Yeah 15:09:18 -!- Bike_ has joined. 15:09:45 Slereah_: they started cloning western hardware in... i wanna say the 70s, and before that things were kind of prehistoric 15:09:51 Drakon and DSSP are the languages i can remember 15:10:51 here's a manuscript http://www.sigcis.org/?q=node/85 15:11:00 it's mostly about the relay era, but still interesting 15:11:03 -!- Bike has quit (Disconnected by services). 15:11:06 -!- Bike_ has changed nick to Bike. 15:12:57 i'm semi-aware of a book on the space coomputers, but it's only in Russian and i don't know anything about it beyond the ISBN 15:15:15 analogue computers make sense. you don't have to worry about clocks, A/D and D/A conversion, and the associated latencies. 15:16:31 -!- tertu has joined. 15:16:35 I wonder where the cited cost savings for ternary computers come from and whether there is anything like CMOS (which cut down power consumption of binary computers tremendously) for ternary logic. 15:18:05 (with emphasis on the "C"omplementary part) 15:18:14 setun was 1958, they sure as fuck weren't using ICs 15:18:46 I cannot fathom what a ternary logic gate would look like. 15:20:21 http://www.computer-museum.ru/english/setun.htm here, have a badly translated article about it 15:20:25 -!- nooodl has joined. 15:20:49 i guess "Threshold realization of threevalued logic on electromagnetic elements" would be the paper 15:21:26 I think ternary may have been killed by the miniaturization of circuits 15:21:33 small transistors only work properly at low voltages 15:21:44 meaning three voltage levels become much harder to distinguish than two 15:22:02 there's been a steady downward decline in the voltages computers use internally, because of this 15:22:16 http://en.trinary.ru/projects/setunws/ i recommend switching randomly 15:26:10 also try pushing buttons 15:27:13 http://en.wikipedia.org/wiki/Non-English-based_programming_languages 15:27:17 >chinese C++ 15:27:20 Oh lawdy 15:29:29 قلب (qlb) – an Arabic Scheme-like programming language exploring the role of human culture in coding[22] 15:29:31 What 15:32:00 -!- drdanmaku has joined. 15:36:30 -!- ^v has joined. 15:58:26 -!- shikhin has quit (Ping timeout: 276 seconds). 15:59:52 -!- shikhin has joined. 16:05:51 -!- sebbu has quit (Ping timeout: 252 seconds). 16:57:56 -!- tertu has quit (Disconnected by services). 16:57:56 -!- ter2 has joined. 17:03:25 -!- Leb has joined. 17:05:05 !bfjoust almost_a_vibrator >(+-)*100000 17:05:18 Score for Leb_almost_a_vibrator: 7.4 17:05:56 Leb: the main way that program wins without the > is that opponents think they've cleared the flag and move on 17:06:19 with the >, if that happens, the enemy program will just assume it cleared a decoy and move on to the flag 17:07:00 yes, it was supposed to mostly draw 17:07:10 brb 17:07:15 -!- sebbu has joined. 17:07:53 -!- sebbu has quit (Changing host). 17:07:53 -!- sebbu has joined. 17:11:22 -!- ais523 has quit. 17:13:18 -!- Phantom__Hoover has quit (Ping timeout: 240 seconds). 17:33:20 While on the topic of weird old russian computers, there's also http://en.wikipedia.org/wiki/Computer_for_operations_with_functions 17:42:56 -!- Sorella has joined. 17:49:32 i love operations with functions! 17:49:52 Slereah_: i think i saw an article on that one. turns out most editors barf on rtl text, who knew 17:50:38 -!- blitter64 has joined. 17:52:18 -!- conehead has quit (Read error: Connection reset by peer). 17:55:41 -!- conehead has joined. 17:56:22 -!- mhi^ has joined. 17:59:31 -!- Bike has quit (Ping timeout: 252 seconds). 18:01:09 -!- Leb has quit (Quit: Page closed). 18:01:19 -!- Bike has joined. 18:17:39 -!- ais523 has joined. 18:19:47 -!- shikhin has quit (Quit: leaving). 18:26:39 -!- mhi^ has quit (Quit: Lost terminal). 18:30:41 -!- mhi^ has joined. 18:36:00 -!- canaima has joined. 18:36:42 hola:-X 18:36:59 -!- canaima has left. 18:39:43 that didn't last long 18:40:21 -!- lollo64it has joined. 18:40:38 -!- ais523 has quit (Read error: Connection reset by peer). 18:40:46 -!- callforjudgement has joined. 18:41:37 https://en.wikipedia.org/wiki/Space_selfie "A space selfie is a selfie (self-portrait photograph typically posted on social media sites) that is taken in space." 18:42:06 v. encyclopædic 18:43:08 Serious topics in the mainstream news 18:46:51 Space selfies can be dated back to 1976 when the lander of the Viking 2 mission took the photo of its deck after landing on Mars; however they were not considered by Discovery News as a true selfie in its list of top 10 space robot selfies. 18:47:14 https://en.wikipedia.org/wiki/File:Curiosity_first_space_selfie_%28raw_image%29.jpg is mars like, dusty 18:47:30 i mean that dusty 18:49:27 There have been worse selfies 18:50:27 list of top 10 space robot selfies 18:50:29 quality journalism 19:04:53 -!- Zuu has joined. 19:06:32 -!- Zuu has quit (Client Quit). 19:09:55 -!- lollo64it has quit (Remote host closed the connection). 19:12:21 -!- Zuu has joined. 19:34:18 -!- impomatic__ has joined. 19:34:49 -!- impomatic__ has changed nick to impomatic. 19:46:30 Do you know of any C program to parse a Haskell syntax? 19:50:34 -!- AnotherTest has joined. 19:58:43 no 20:12:46 -!- MindlessDrone has quit (Quit: MindlessDrone). 20:18:57 I want to use a object notation (like JSON or XML or YAML or whatever), but having the features like: * Data types: string, integer, floating-point, null, record, reference, list, foreign-function-call. * External text encoding (if used from a C program, you can therefore make up any text encoding you want). * Non-indentation-sensitive syntax. * An object can be tagged with a name, and referenced before, after, and/or inside of that object. 20:19:33 O, and perhaps also simple macros. 20:19:44 macros in data? 20:20:57 Yes; I want to specify a macro for a certain data structure and use the macro many times just filling in the parameters that differ. Similar to a C macro, kind of. 20:21:34 Doesn't some lisps have a way of encoding recursive structures using some # syntax? 20:21:53 I know that SpiderMonkey (JS) does, and I think that was borrowed from some lisp 20:21:56 I don't know, but I am not trying to make recursive structures anyways 20:22:03 using libz is almost like automatically determining a suitable set of macros 20:22:15 Well, I was thinking about the "give a name of a subexpression and re-use it" part 20:22:49 Oh, hm, maybe that's not what you meant with giving a name to an object and referencing it 20:22:55 it seems that zzo wants parameters. 20:22:56 FireFly: No, I meant to reference it, not re-use it. Furthermore, multiple same expressions with different names can also be considered different references. 20:23:15 like foo(x) = [4,x,4,4,4,4], and then have a data structure of [foo(7),foo(4)] 20:23:52 Bike: Yes, to have a macro like that. 20:25:26 Actually macro could be considered as the same datatype as a foreign-function-call; the differences is just that a macro is defined inside of the data file, and then a foreign-function-call will call a C function or whatever (and which might create an opaque object of its own type, or do other things, including possibly side-effects). 20:25:52 man i've always wanted to call out to C from json, 20:25:56 https://developer.mozilla.org/en-US/docs/Web/JavaScript/Sharp_variables_in_JavaScript aha 20:26:51 that's pretty lol 20:27:25 FireFly: Yes I have seen that 20:39:44 -!- AnotherTest has quit (Ping timeout: 240 seconds). 20:41:32 -!- oerjan has joined. 20:45:05 I can try to make up such format but I don't know what it is called! 20:45:33 Zzo's Cool Data Storage Format 20:47:02 -!- Patashu has joined. 20:47:13 Maybe I should abbreviate it? Then it would be called "ZCDSF" 20:47:28 good thinking. 20:47:30 I suppose it is OK 20:51:10 wait, there is a forum? <-- only the archive. it was hardly ever used and overrun with spam, so when elliott took over from graue he made it readonly. 20:51:26 -!- Patashu_ has joined. 20:51:26 -!- Patashu has quit (Disconnected by services). 20:51:29 -!- ter2 has quit (Ping timeout: 252 seconds). 20:53:03 i see 20:53:38 Did they use capitalist swine languages or make their own <-- i do recall reading about refal, which seemed interesting. 20:53:42 we used it occasionally just for the fun of using t 20:53:52 but the wiki's better for the sort of thing you'd normally use a forum for, IMO 20:54:34 -!- Patashu has joined. 20:54:43 i think it mainly existed because graue had a sort of hangup that the wiki _shouldn't_ be used as a forum. 20:57:44 -!- Patashu_ has quit (Ping timeout: 240 seconds). 20:58:00 -!- ter2 has joined. 20:58:28 -!- Patashu_ has joined. 20:58:28 -!- Patashu has quit (Disconnected by services). 20:59:27

Bah. SO does not allow anonymous answers at all? I mean I can get the effect by making a new account, and they do not verify e-mail addresses, but there will be an account. <-- that's weird, my first SO answer was definitely unregistered. although i _did_ use my real name and probably gave my email address, it wasn't made into a "real" account until after i had to go through hoops to get it back because my cookies had long since expired. 21:00:12 i suppose they're really sort of accounts anyway. 21:00:25 https://stackoverflow.com/users/3696868/user3696868 21:00:34 is what I meant 21:01:26 yeah that's probably as anonymous as it gets. 21:01:32 I guess "Unregistered" is there way of saying that it's not a full account yet. 21:01:36