00:03:43 -!- feliks has joined. 00:05:20 hmmmm. hellogic 00:07:35 boily: Good point 00:07:49 boily: But tswett doesn't lend itself to porthellos as easily as e.g. hppavilion[1] 00:08:57 best I found was tswellott. or warrigello, depending on how he's connected as. 00:09:05 Ah 00:09:17 -!- tromp has joined. 00:09:37 hppavilion[1]: yours sounds better, imho. it has that... Elvish feel to it? 00:10:19 It does, doesn't it... 00:11:06 * int-e tswats tswett with a mapole because it's easier than a salutation. 00:11:34 mapoles are great, eh? 00:11:40 Yes, yes they are 00:13:00 c#qqRr#j¸$5^ 00:13:26 ↑ that should be rendered with a tengwar font. 00:15:22 `? mapole 00:15:33 A mapole is a thwackamacallit built from maple according to Canadian standards. The army version includes a spork, a corkscrew and a moose whistle. A regulatory mapole measures 6' by 12 kg, ±0.5 inHg. 00:16:34 `? moose 00:16:35 moose? ¯\(°_o)/¯ 00:17:00 I guess it's a secret nordic weapon of mass distraction? 00:18:45 it's not really secret. meese are quite big by themselves; pretty hard to hide hth 00:19:50 can you catch a moose with a choose trap 00:20:14 ... 00:20:17 ... 00:20:32 * boily THWACKS oerjan. 0.35 shachafs. 00:21:07 brutal. 00:21:08 hoily 00:21:11 where did you get that 00:22:04 boily: then why do you need a moose whistle? I thought it was to lure them out of their lairs... 00:22:55 int-e: sprite contains caffeine, i think. rootbeer usually doesnt but can. mountain dew definitely does but isnt a cola 00:23:18 int-e: it's for giving them orders under adverse weather or great distances. 00:23:26 shachaf: get what? 00:23:40 the mapole 00:24:02 oh, secondary portative one, in case I had lent my main one to someone else. 00:24:09 btw, can I get it back please? 00:24:54 augur: "Sprite is a colorless, lemon and lime flavored, caffeine-free soft drink" (well okay, there's a variant with caffeine) 00:26:49 boily: that reminds me of someone absconding with my swatter... 00:27:08 or wait, it was the saucepan 00:27:25 -#-#-# ... slightly modified 00:27:43 ###----- 00:27:52 oh, right. 00:27:58 * boily resaucepans oerjan 00:28:07 boily: there are too many fake swatters and mapoles around. we need a certification system. 00:28:27 mine's mine. 00:28:37 int-e: hm! well then ive wasted money on sprite too many times :( 00:28:47 let's have a rowboat: ###-----\__/-----### 00:29:09 augur: the caffeine was in you all along! 00:29:18 oerjan: :o 00:30:11 * oerjan considered making a wisdom about fake mapoles, but then realized what the portmanteau would be... 00:32:07 UUUUUUUUUUUUUUUH! 00:32:20 * boily snatches his precious mapole back from shachaf 00:32:36 `? popcorn 00:32:38 popcorn? ¯\(°_o)/¯ 00:32:48 fungot: popcorn? 00:32:48 int-e: fnord olet fnord." fnord 00:32:57 fungot: you must be kidding 00:32:57 int-e: i don't have 00:33:02 ^style 00:33:02 Available: agora alice c64 ct darwin discworld enron europarl ff7 fisher fungot homestuck ic irc* iwcs jargon lovecraft nethack oots pa qwantz sms speeches ss wp youtube 00:33:10 oerjan: try "mock mapole" hth 00:33:17 fungot: I know you can do better than that 00:33:17 int-e: irp will solve it. i quite like ribbit. :) i'm still not entirely clear on how composable continuations work and where you don't 00:33:19 int-e: that "olet" is finnish 00:33:44 oerjan: thanks, but I'm more upset about the f-words. 00:34:03 int-e: well it was presumably bordered by fnordable finnish words 00:34:04 -!- jaboja has quit (Ping timeout: 240 seconds). 00:34:07 (though this explains why they would be so frequent in that context) 00:34:58 oerjan: et ole suomalainen hth 00:35:14 fnord fnord fnord ♪ 00:35:55 califnordication? 00:36:09 about GG: there's something weird going on. I remember the "horse", near the beginning of the colour pages. and it's nowhere to be seen. 00:36:31 boily: wat? 00:36:39 oh. 00:36:44 it may be that the color pages are starting earlier these days 00:36:47 -!- llue has quit (Quit: That's what she said). 00:36:57 -!- lleu has joined. 00:37:17 yes, cheyenne wright reapplied some color 00:37:54 (I have to admit that I'm unsure about the horse reference) 00:38:17 but I did notice some very early colorization lately 00:38:43 int-e: it's been changed to symbolize agatha's "breakthrough", i think. 00:39:03 while originally it was just black and white because that's how it was published, maybe? 00:39:50 speaking of horses, hmm 00:40:04 -!- jaboja has joined. 00:40:10 boily: anyway, http://www.girlgeniusonline.com/comic.php?date=20050404#.Vu9C2Tbmpjo 00:40:22 stupid fake anchors 00:40:55 i once managed to turn it off by disabling one of the advertising sites, but now there are so many... 00:41:25 it was something google-added, i think. 00:41:53 hmm still two months before the paperback edition of The Shepherd's Crown is released 00:41:55 ain't got any on my current URL. I'm pretty strict with noscript. 00:42:13 and yeah, I was getting to it. I just needed to be patient for the "horse". 00:43:02 That horse. 00:44:49 I needed the picture :) 00:44:58 -!- lynn_ has joined. 00:45:01 [wiki] [[Funge-98]] https://esolangs.org/w/index.php?diff=46627&oldid=44830 * Ozwg6693 * (+2947) Starts the quest to make this an actual page and not a joke. Page is a WIP 00:45:02 -!- lynn has quit (Ping timeout: 260 seconds). 00:47:11 [wiki] [[Talk:Funge-98]] N https://esolangs.org/w/index.php?oldid=46628 * Ozwg6693 * (+266) Created page with "==Name?== If this is to be the sequel page to Befunge, should it be Befunge or Funge? I like Funge (since the original page isn't Befunge-93), and vote to change the name on..." 00:49:03 [wiki] [[Funge-98]] https://esolangs.org/w/index.php?diff=46629&oldid=46627 * Ozwg6693 * (-55) Professionalism upgrade. 00:50:59 * oerjan will not touch that funge cleanup with a ten foot pole 00:51:13 -!- lynn_ has quit (Ping timeout: 240 seconds). 00:52:25 -!- hppavilion[2] has joined. 00:52:44 . o O ( what if we make it 10 nano-light-seconds instead? ) 00:53:58 fizzie: please shampoo fungot twh 00:53:58 boily: that's what we wanted in the first 00:55:21 -!- hppavilion[1] has quit (Ping timeout: 244 seconds). 00:56:49 dammit i'm trying to search the logs for when i discovered how to turn off that anchor, but i cannot find _that_ either. 01:01:33 12:09:18: some script from addthis.com does it. 01:01:35 12:23:45: ah there it's gone. 01:01:40 2014-12-06 01:01:57 aha 01:04:52 yay 01:05:27 int-e++ 01:07:14 oerjan: you should have a keyword you use to leave notes to yourself in the logs hth 01:07:33 shachaf: heh. 01:07:46 i think _today's_ logs will work fine, next time. 01:07:50 @karma int-e 01:07:50 int-e has a karma of 9 01:08:17 THIS IS A KEYWORD PRIVMSG FOR OERJAN TO REMEMBER. ♪DING♪ 01:08:19 shockingly low 01:08:34 @karma dons 01:08:35 dons has a karma of 2 01:08:52 the karma has been reset several times 01:09:02 (dons used to be in the three digit range) 01:10:20 who's dons? 01:11:36 boily: don stewart 01:12:24 http://stackoverflow.com/tags/haskell/topusers 01:12:44 the don stewart. 01:13:34 @karma shachaf 01:13:34 You have a karma of 92 01:13:43 oerjan might remember why my karma is artificially inflated tdnh 01:14:01 @karma oerjan 01:14:01 oerjan has a karma of 32 01:14:18 * int-e is also not very active on #haskell anymore, to put it mildly 01:15:21 shachaf++ 01:16:00 -!- nooga_ has joined. 01:18:00 @karma boily 01:18:01 boily has a karma of 109 01:18:04 -!- nooga_ has quit (Read error: Connection reset by peer). 01:18:14 that seems rather unlikely 01:18:26 @karma synx 01:18:26 synx has a karma of 11 01:18:32 how the did I manage 109... 01:18:36 -!- nooga has quit (Ping timeout: 250 seconds). 01:18:52 boily-- ... let's put things right ... 01:20:01 @karma boily 01:20:02 boily has a karma of 108 01:20:27 `factor 109 01:20:50 109: 109 01:21:00 boily++ 01:21:04 108 is much smoother 01:21:07 clearly better with a prime hth 01:21:20 `factor 108 01:21:24 108: 2 2 3 3 3 01:21:24 I mean really, really smooth. 01:21:34 IC 01:22:29 btw, 107 is prime too, if that's what you want 01:25:11 I like 108. it's a buddhisticaly good number. 01:31:13 -!- lleu has quit (Quit: That's what she said). 01:31:44 `? french 01:31:46 Le français n'est pas le démon, visitez les Coupeurs. Ne pas couvrir. Meilleur avant! 01:31:55 boily: what is Coupeurs 01:31:59 (or are) 01:33:11 -!- nooga has joined. 01:35:24 `? norwegian 01:35:25 norwegian? ¯\(°_o)/¯ 01:35:53 `? german 01:35:54 german? ¯\(°_o)/¯ 01:36:16 `? finnish 01:36:17 Finnish suomalaiset ei Perkeleistä on hakkapeliittaan. Ei saa peittää. Parasta ennen! 01:36:42 `le/rn norwegian/Norsk ikke faen er Hakadalen. Må ikke tildekkes. Best før! 01:36:48 Learned «norwegian» 01:37:17 `? english 01:37:18 english? ¯\(°_o)/¯ 01:37:58 i'd appreciate english 01:39:24 `le/rn English not Satan is Hackensack. Do not cover. Best before! 01:39:27 No output. 01:39:35 oops 01:39:41 `learn English not Satan is Hackensack. Do not cover. Best before! 01:39:44 Learned 'english': English not Satan is Hackensack. Do not cover. Best before! 01:39:49 oerjan: went for something "Hackerish" hth 01:40:04 i did not. no hackers in norway hth 01:40:21 we're all still learning to le/rn. 01:40:26 hacker, in the sense to cut something. cutter, coupeur. 01:40:35 maybe I should've went with Trancheur. 01:40:35 in any case, hakkapeliitta has nothing to do with hackers afaik 01:40:55 to learn is human, to le/rn divine 01:41:07 wtf 01:41:24 hm checking... 01:41:57 "Hakkapeliitta (Finnish pl. hakkapeliitat) is a historiographical term used for a Finnish light cavalryman in the service of King Gustavus Adolphus of Sweden during the Thirty Years' War (1618 to 1648)." 01:43:02 apparently it _is_ relating to hacking in the violent sense. 01:43:05 *related 01:43:30 Choppeur? Émincisseur? Élagueur? 01:45:16 hm tricky 01:46:49 -!- Phantom_Hoover has quit (Read error: Connection reset by peer). 01:49:49 `` rm wisdom/{english,norwegian} 01:49:52 No output. 01:50:06 this simply does not work, then. 01:50:59 my trusty old memory will have to come up with some better word that fits. perhaps some time around christmas. 01:51:32 there are plenty of christmases coming up. good occasions for thinking about nonsensical Finnish. 01:51:40 of course, all i can think of is "amortized" hth 01:52:06 strange times we are living in. oerjan remembers amortized. 01:52:11 boily: it's not the finnish that is the problem. 01:55:27 -!- boily has quit (Quit: SPIDER CHICKEN). 01:58:00 @tell boily “Danish pronunciation: [ˈsmɶɐ̯ɐˌb̥ʁœðˀ]”. am I supposed to just cough the word? <-- don't be ridiculous. you're supposed to put a potato in your mouth hth 01:58:01 Consider it noted. 02:09:38 -!- lleu has joined. 02:11:45 @tell b_jonas But it also turns out, and I admit I don't understand why, that two counters are also enough, but in that case the slowdown isn't exponential, it's double-exponential. <-- you store n counters in n prime exponents of a single one, + 1 scratch for multiplication and division. 02:11:45 Consider it noted. 02:21:52 `? bogosort 02:21:58 Bogosort is an efficient sorting algorithm for nondeterministic Turing machines. Taneb may have invented it. 02:28:32 -!- tromp has quit (Remote host closed the connection). 02:40:24 -!- nooga has quit (Ping timeout: 276 seconds). 02:43:56 -!- tromp has joined. 03:07:58 `? bogobogosort 03:08:00 bogobogosort? ¯\(°_o)/¯ 03:16:28 -!- APic has quit (Ping timeout: 252 seconds). 03:22:07 -!- jaboja has quit (Ping timeout: 250 seconds). 03:49:16 ITL tswett implies nuclear weapons have no ethical consequences. 03:58:22 -!- Lord_of_Life has quit (Ping timeout: 248 seconds). 04:12:45 -!- heroux has quit (Ping timeout: 244 seconds). 04:13:47 -!- heroux has joined. 04:17:44 would it be possible to define a generic bogo- transform for algorithms? 04:22:15 -!- MoALTz_ has joined. 04:22:59 -!- heroux has quit (Ping timeout: 248 seconds). 04:24:26 -!- treaki_ has joined. 04:25:38 -!- Lord_of_Life has joined. 04:25:42 -!- MoALTz has quit (Ping timeout: 276 seconds). 04:28:01 `? tg 04:28:04 tg? ¯\(°_o)/¯ 04:28:13 -!- treaki__ has quit (Ping timeout: 244 seconds). 04:29:01 `learn TG is short fot Turing-Gödel, the highest possible level of difficulty of a multiplayer game. 04:29:03 Learned 'tg': TG is short fot Turing-Gödel, the highest possible level of difficulty of a multiplayer game. 04:29:19 `learn TG is short fot Turing-Gödel, the highest possible level of difficulty for a multiplayer game. 04:29:21 Relearned 'tg': TG is short fot Turing-Gödel, the highest possible level of difficulty for a multiplayer game. 04:30:39 -!- mad has joined. 04:31:07 `? mad 04:31:09 This wisdom entry was censored for being too accurate. 04:31:15 -!- heroux has joined. 04:34:17 You shouldn't censor them regardless of accuracy, unless "censor" is supposed to be the actual text of the entry anyways, in which case it should be censored regardless of accuracy. 04:34:59 it is currently the actual text of the entry hth 04:35:32 hi 04:37:09 -!- XorSwap has joined. 04:40:33 mad: Hi 04:40:40 mad: I've started writing compilers :) 04:41:40 `? fot 04:41:41 fot? ¯\(°_o)/¯ 04:41:49 oerjan: OOOOOOEEEEEEEEEEEEEEEEEERJAAAAAAAAAAAAAAAAN 04:42:15 The Shadow, The Plague, The Void wants you in its unholy office. Now. 04:43:31 * oerjan thinks this sounds like a good day to skip work. 04:44:05 Hm... 04:44:15 Along with compilers, I want to deal with the semantic web a bit 04:44:20 not that i have work. 04:44:26 oerjan: Exactly. 04:45:12 i know nothing about the semantic web, which looks like it will work excellently for my work-avoiding plans today. 04:45:59 is that "fot" relevant to me in any way btw 04:46:11 oerjan: Well, you did say "fot" in tg 04:46:15 Instead of "for" 04:46:19 oops 04:46:22 Which may have been a pun, but if it was I don't get it 04:46:39 `learn TG is short for Turing-Gödel, the highest possible level of difficulty for a multiplayer game. 04:46:41 Relearned 'tg': TG is short for Turing-Gödel, the highest possible level of difficulty for a multiplayer game. 04:46:42 I was confused after your second le/rn because you didn't fix it and I couldn't see the difference (I found it) 04:47:05 min_nd might be an interesting project. A minimal NodeJS-like language 04:47:11 Not JS, but similar 04:48:21 Maybe I'll compile it xD 04:48:28 (THAT would be a good idea :P) 04:48:35 (Well, actually...) 04:48:44 (Hm... Should I? 04:48:45 compile early, compile often 04:49:09 oerjan: Would compiling a JS-ish language result in hellfire raining from the sky to undo me? 04:49:31 (undoing me as in not just killing me, but erasing the fact that I ever existed in the first place) 04:49:49 Either because it's an atrocity OR because it would be hard. Both work. 04:50:00 The more I think about it, the louder the "yes" becomes. 04:50:13 (yes as in "don't") 04:50:13 depends what you mean by 'compile' 04:50:53 mad: Produce an executable. I'd remove some of the worse-for-compiling parts- e.g. reduced dynamic typing- but I would keep JS in spirit if I were to do that 04:51:02 if all the variables are dynamic typed still and it tests the type of each variable before doing operations on them, is it really 'compiled'? 04:51:26 mad: That's why it wouldn't be dynamically-typed 04:51:42 if it's not dynamically typed then it can be compiled 04:51:45 It'd be boo:python::min_nd:JavaScript 04:52:14 I don't think I should, mostly because higher-level functions 04:52:33 then it would be competing against java/c# (if it has a garbage collector), or c++ (if it doesn't have a garbage collector) 04:52:35 Then again, Haskell has higher-level functions (and static typing) 04:52:43 mad: Yeah, probably 04:52:59 I'll likely just interpret it, or VM it maybe 04:53:05 haskell is in a different category because it has no side-effects whatsoever 04:53:10 mad: Yeah 04:53:11 True 04:53:14 everything in haskell is local 04:53:28 Exactly 04:53:33 That's why I doubt I can compile it 04:54:13 zzo38: You like Node. What's the stuff that NEEDS to be included if it were minimized? 04:54:15 this allows some more optimizations in theory (ie turning loops into SIMD) 04:54:16 (undoing me as in not just killing me, but erasing the fact that I ever existed in the first place) <-- don't be silly. all evidence indicates that has never happened to anyone hth 04:54:27 oerjan: Well-played. 04:54:38 (Maybe I'll make min_nd tapey :P) 04:55:02 but also prevents some other pretty big optimizations (ie you can't just share pointers to the same object all over the place) 04:55:03 mad: Vectorization? 04:55:34 yes, in theory non-side effect code can be vectorized 04:55:50 hppavilion[2]: Probably first-class functions would be one 04:55:56 Obviously 04:56:09 because the compiler can prove that pointers to arrays passed to a function don't overlap 04:56:13 because they can't 04:56:42 in practice there are no real performance-oriented non-side effect languages today 04:56:46 so people use c++ 04:56:50 zzo38: And events, ofc 04:57:14 current non-side effect languages don't really care about perf that much and are designed for other goals 04:57:14 mad: Yeah, I find the way programmers talk about their favorite language funny 04:57:47 Events is a feature of Node.js, and DOM has different kind of events, although neither is core JavaScript 04:57:49 "I use Haskell because it has these performance benefits that I love, and not because it's a fucking awesome language that I fell in love with" 04:58:09 zzo38: But I'm minimizing Node, not JS 04:58:14 heh 04:58:23 JS is just minimized by proxy, being a Node thing 04:58:34 (I call it: "nanode") 04:58:44 Or more accurately, Node is a JS thing 04:58:52 But thingship is commutative in this case 04:59:11 -!- heroux has quit (Ping timeout: 250 seconds). 04:59:30 Yes, OK 05:00:03 mad: Yep. Computers have enough memory and enough processing speed nowadays that using the optimal language for a task is nearly always pointless objective; the end user won't notice in most cases 05:00:14 It's more about not using a shit language and being a decent programmer 05:00:30 errrrrr 05:00:42 mad: That's not a happy noise for me. 05:00:42 I think it's application dependent 05:00:49 mad: Yeah, but in most cases 05:01:00 Unless you need to-the-femtosecond accuracy 05:01:12 Most languages will do 05:01:14 if you're doing video games or what I do (sound processing), then C++ more or less can't be replaced 05:01:22 mad: Even by Rust? 05:01:48 :P 05:01:52 rust would do 05:01:53 I can program with many different programming language, such as C and Forth and 6502 and JavaScript and whatever else; they can be use for different purpose 05:02:33 in theory java or c# aren't that far from being video-game usable 05:02:43 minecraft runs on java 05:02:53 some XNA games run on c# 05:03:14 but writing games in java isn't easier than writing them in c++ 05:03:18 It depends what game 05:03:19 so there's no benefit 05:03:37 and there's a clear cost (garbage collector pauses) 05:04:27 zzo38 : ok, name me a game that's easier to write in java than in c++ 05:05:37 mad: Any game that your boss told you to write in Java 05:05:58 Assuming you're a proficient Javagrammer 05:06:12 We need specific names for different types of programmers 05:06:47 Pygrammers (pythonistas), Scigrammers (scientific computing), Pro-grammars (linguists, particularly ones who moonlight as pedants) 05:07:47 I wouldn't know because I don't program in Java or C++ 05:12:43 hpp: if your boss tells you to write a game in java 05:12:53 -!- XorSwap has quit (Quit: Leaving). 05:13:04 ...you need to work in a better game company :o 05:13:05 :D 05:13:12 -!- XorSwap has joined. 05:13:21 zzo38 : but you program in C? 05:16:17 -!- XorSwap has quit (Client Quit). 05:16:17 -!- APic has joined. 05:16:21 -!- XorSwap has joined. 05:17:48 -!- XorSwap has quit (Client Quit). 05:21:58 -!- lambda-11235 has quit (Quit: Bye). 05:23:43 -!- lambda-11235 has joined. 05:24:35 -!- lambda-11235 has quit (Client Quit). 05:33:01 med: Yes I do make program in C 05:54:28 Do you have PNG picture with Japanese mahjong arrange in grid? 05:57:58 -!- heroux has joined. 06:05:23 -!- heroux has quit (Ping timeout: 244 seconds). 06:05:33 -!- lynn has joined. 06:09:57 -!- lynn has quit (Ping timeout: 260 seconds). 06:23:33 -!- pelegreno has quit (Remote host closed the connection). 06:24:45 -!- pelegreno has joined. 06:32:13 -!- dingbat has quit (Quit: Connection closed for inactivity). 06:41:42 -!- tromp has quit (Remote host closed the connection). 06:58:37 mad: Lots of Android games are Java, although they are hardly AAA games 06:59:51 that's because they made the mistake of making the api java based but yeah 07:03:18 -!- heroux has joined. 07:12:19 There are also other virtual machines to make computer game and other program out of 07:21:34 -!- heroux_ has joined. 07:21:47 mad: Have you done anything with Rust? 07:22:17 mad: Fair enough 07:22:28 FreeFull: Have you ever done anything with dk? 07:22:39 "Fur Elise in Q semiminor" 07:22:53 hppavilion[2]: What's dk? 07:22:59 Donkey Kong? 07:23:11 FreeFull: Compiled programming language 07:23:16 -!- heroux has quit (Ping timeout: 264 seconds). 07:23:20 -!- heroux_ has changed nick to heroux. 07:23:29 Obviously I haven't done anything with it before, given I haven't heard of it before :) 07:23:44 FreeFull: OK, that's good 07:24:02 FreeFull: The fact that you haven't used it yet means my computer isn't necessarily completely open 07:24:15 FreeFull: Because I haven't published dk yet :P 07:25:22 =P 07:25:40 FreeFull: I've been learning how to write compilers, and dk is my first compiled language :P 07:25:45 It has... expressions 07:25:49 And putc() 07:25:54 Woo, expressions! 07:26:04 Pft, why would you want I/O? =P 07:26:06 binary: +-*/, unary: -x 07:26:22 FreeFull: Because some people like knowing if their code works 07:26:28 Though it's just O at the moment =P 07:26:41 FreeFull: I'm currently getting functions to work 07:26:52 See if you know how to compile it into QUACKVM codes (either assembly or binary) 07:27:53 Ah! Just figured out a bug! 07:28:16 zzo38: You can write a backend from the Walric Platform (the WP compiler collection's IL) 07:28:33 YES! 07:28:35 -!- heroux has quit (Ping timeout: 248 seconds). 07:28:38 I GOT FUNCTIONS WORKING! 07:28:46 AT LEAST TO SOME DEGREE! 07:28:55 THEY'RE REALLY JUST PROCEDURES AT THE MOMENT! BUT STILL! 07:29:00 What is the specification of such IL? 07:29:05 It was just a bug from a simple workaround 07:29:16 zzo38: Currently nonexistent, as it's still in development 07:29:29 -!- AnotherTest has joined. 07:29:41 zzo38: But it's a simple ASM inspired by TIS-100, sans massive parallelity 07:29:44 -!- heroux has joined. 07:30:54 zzo38: It uses an accumulator for arithmetic and conditionals, has partial orthagonality, and memory is loaded with LD and stored with ULD from and to the exp and imp registers 07:33:41 zzo38: I'm considering making return a function. Is that an awful, awful idea? 07:34:29 To know, QUACKVM is using 16-bit cells. Memory cell 2 acts somewhat like an accumulator. 07:34:53 I don't know if that is awful idea it depend on the context of the rest of the programming language I think? 07:35:19 zzo38: Ah, mine uses 64-bit memory and registers. So that might (read: would most definitely) be an issue 07:35:44 Though I suppose I could make up the spec to allow for differently-sized registers 07:35:53 Depending on the final target 07:38:04 zzo38: To make return work, it's literally 5 lines of unconditional ASM, so I'll do that 07:38:07 ret(x) 07:38:19 Wait, but that'll mess with typechecking... 07:38:22 Hm... 07:38:39 Wait, not exactly 07:38:55 If you return a value of the wrong type, it'll just bitcast automatically, which is probably even worse 07:39:02 Yes it is a possibility to allow different size registers; that is a possible design. When someone needs such a design, now you have it! 07:42:14 -!- tromp has joined. 07:46:27 -!- bender| has joined. 07:47:12 -!- tromp has quit (Ping timeout: 276 seconds). 08:02:44 YES! 08:02:51 FUNCTIONS ARE NOW ACTUALLY FUNCTIONS! 08:03:28 One thing I'm considering is a nullary operator called $ 08:03:56 When you put an expression on a line of its own, it is evaluated and its result is stored in $ 08:04:17 I mean acc 08:04:21 When an operator is evaluated, it's assumed its left argument is in acc 08:05:03 $ would basically mean "do nothing" when on the left and "move the accumulator to the aux register prior to overwriting it with the left argument" when on the right 08:05:22 Basically, $ allows you to reuse the expression on the previous line, which is good for big expressions 08:05:29 5+9 08:05:31 $-2 08:05:42 putn($) 08:05:50 >>> 12 08:39:24 do you guys ever sleep 08:39:59 -!- mad has quit (Quit: Pics or it didn't happen). 08:41:07 zzzleep is for the wezzz 08:48:28 -!- llue has joined. 08:48:38 -!- llue has quit (Changing host). 08:48:38 -!- llue has joined. 08:49:36 -!- lleu has quit (Ping timeout: 276 seconds). 08:50:55 -!- lynn has joined. 09:01:01 -!- hppavilion[2] has quit (Ping timeout: 244 seconds). 09:02:49 http://lua-users.org/lists/lua-l/2009-11/msg00089.html 09:08:08 -!- tromp has joined. 09:11:51 -!- Alcest has joined. 09:12:35 tromp: hi you got a bit reddited https://www.reddit.com/r/programming/comments/4b8264/celebrates_obfuscation_and_conciseness_with/ 09:12:38 -!- Alcest has quit (K-Lined). 09:12:54 -!- tromp has quit (Ping timeout: 260 seconds). 09:12:59 r.i.p. 09:13:59 @tell tromp you got a bit reddited https://www.reddit.com/r/programming/comments/4b8264/celebrates_obfuscation_and_conciseness_with/ 09:13:59 Consider it noted. 09:14:43 oerjan: if you don't want publicity, IOCCC is not a good venue to post things 09:15:06 MAYBE 09:15:35 that page didn't seem to have been linked before, though. 09:36:06 -!- nooga has joined. 09:45:30 -!- zadock has joined. 09:46:31 -!- lynn has quit (Ping timeout: 244 seconds). 09:48:14 -!- augur has quit (Ping timeout: 248 seconds). 09:48:25 -!- zadock has quit (Remote host closed the connection). 09:50:58 -!- J_Arcane has quit (Ping timeout: 268 seconds). 09:53:07 -!- Frooxius has quit (Quit: *bubbles away*). 09:55:08 -!- oerjan has quit (Quit: Nite). 10:01:50 -!- augur has joined. 10:08:14 -!- bender| has quit (Ping timeout: 268 seconds). 10:19:26 -!- mroman has joined. 10:22:08 -!- llue has quit (Ping timeout: 244 seconds). 10:30:34 -!- lleu has joined. 10:32:22 -!- bender| has joined. 10:35:43 -!- boily has joined. 10:43:32 -!- tromp has joined. 10:47:57 -!- tromp has quit (Ping timeout: 248 seconds). 11:01:20 So, that BLC self-interpreter is pretty small. 11:02:46 Is BLC the only thing that that could reasonably be a self-interpreter for? 11:09:50 Ooh, this particular sequence is U'^(F R U' R'). 11:10:02 . o O ( That's a horribly non-mathematical term, "reasonably". ) 11:11:14 Yes, I think I like that sequence. 11:13:29 As for its effect? Let me append U to it; that seems to make it a little easier to understand. 11:13:55 U^(F R U' R') is meaningful too 11:14:22 I just realized that I use those for flipping edges :P 11:15:12 Relative to the U face: it moves UBL, UBR, and UFL counterclockwise, then rotates UBL in-place clockwise and UBR in-place counterclockwise. 11:15:55 the first one flips two opposite edges; the second flips two neighbouring edges. I don't care about the rest ;) 11:16:43 or vice versa... hmm :) 11:18:04 (and of course I should care if I wanted to be faster) 11:18:12 Isn't your thing the opposite of my thing/ 11:18:47 -!- boily has quit (Quit: SEWER CHICKEN). 11:20:39 So now I've got this stupid sequence: U' R' F R' B2 R F' R' B2 R2 11:21:17 I don't see where the beauty is. 11:21:56 anyway, the point to my mind is that after F R U' R', all pieces of the bottom two layers are safely stashed in the bottom two layers again... while one edge piece on the top has been flipped 11:23:39 Though... that's a pretty interesting part in the middle there. We've got, like... F R' B2 R F' R' B2 R 11:23:57 tswett: and yes, it's the inverse of course... 11:23:59 That part is [F, R' B2 R]. 11:24:19 * int-e failed to recall the group theoretic point of conjugation ;) 11:24:42 In context: U' R' [F, R' B2 R] R 11:25:29 You can make that even more concise if you want: U' [F, B2^R']^R' 11:26:49