00:00:29 If even finding a collision with two arbitrary inputs is hard, surely finding a collision with two inputs with a bunch of constraints is harder. 00:00:40 i haven't found the code that actually constructs the fingerprint for a TypeRep ... 00:02:19 Data.Typeable.Internal 00:03:28 Unless you mean the MD5 code, which is in GHC.Fingerprint. 00:04:30 Unless you mean the code inside the compiler, which is different but does the same thing. 00:05:10 ok it's mkPolyTyConApp, looks like it takes a list of the fingerprints for TyCon, kinds and type arguments and passes to fingerprintFingerprints 00:05:53 For applications, yes. 00:06:11 There used to be a bug with associativity so now they use a list instead. 00:06:12 i'm particularly interested in those, since they can be built arbitrarily complex 00:06:40 while a TyCon is sort of limited in information content 00:15:23 I'm about to attempt something that sounds pretty difficult. 00:15:33 Namely, proving that the infinite cyclic group has at least two elements. 00:15:56 fiendish 00:16:13 I dunno, I think that's a little too advanced for where I am right now. Instead, I'll try to prove that the infinite cyclic group is not the trivial group. 00:16:38 good move 00:17:19 -!- aretecode has quit (Quit: Toodaloo). 00:26:21 Sounds promising. Now most people, see, they would just blindly start with the singleton group. 00:28:56 `unidecode ⋄⌷ 00:28:57 ​[U+22C4 DIAMOND OPERATOR] [U+2337 APL FUNCTIONAL SYMBOL SQUISH QUAD] 00:31:05 All right, I successfully managed to prove a different theorem. 00:31:13 Namely: the cyclic group of order 2 has at least two elements. 00:32:17 Did you use the diamond operator and the APL functional symbol squish quad to denote those two elements? 00:32:22 No. 00:48:28 factorio looks like a nice little df like 00:48:49 -!- hppavilion[1] has joined. 00:49:09 what's nice about it? 00:49:27 the goal is literally to make it boring 00:49:52 i guess i don't really get that kind of game 00:50:20 if the game is good, it cannot get boring 00:50:30 become even 00:51:08 I really like Factorio. 00:51:25 The idea of the game is that you design stuff and build it. 00:51:46 izabera: have you ever played df? 00:52:30 That's pretty much, like, what I do. 00:52:34 what's df? 00:52:38 dwarf fortress? 00:52:45 yeah 00:52:52 then no 00:52:58 do it 00:53:42 sure why not, it's almost 3am and i just had my 5th coffee 00:53:52 I take tools and figure out how to use them to achieve goals. 00:54:12 it is one of the deepest games out there. sadly it is also one of the most complex ones 00:54:38 You'd think Mine Tycoon would be a boring game, but it's actually about excavation. 00:55:32 By the way, I'm pretty sure that in tennis, scores of 30–30 and 40–40 are functionally equivalent. 00:55:48 In either case, the condition for winning is gaining a two-point lead. 00:57:02 * oerjan swats Jafet -----### 00:57:59 Can someone look over Stare and give me suggestions? http://esolangs.org/wiki/Stare 00:58:36 what kind of suggestions? 00:58:50 Wait, I have to fix something first 00:58:52 Just ideas 00:58:59 New commands, new syntax possiblities, etc. 01:01:29 hppavilion[1]: I like it. Consider eliminating unnecessary instructions. 01:01:32 hypnotic dendro-erotic suggestions in order toenslave body and mind 01:02:17 tswett: I don't want to make it a Turing Tarpit (or Push-Down Automaton Tarpit), I want to make it a useable, but strange, language 01:02:19 xD 01:02:45 *nod* 01:03:08 consider eliminating relevant instructions then 01:03:28 In that case, you're missing the bitwise logic operators. 01:04:24 All you really need is either bitwise "and" or bitwise "or"; bitwise "not" is the same as subtracting from -1. Well... that's if you're using two's complement representation. 01:05:39 And then you can use de Morgan's laws to get the other one. 01:05:47 But you may want to just go ahead and include all three. 01:06:37 Are numbers allowed to be arbitrarily large, or is there a limit to them? 01:07:10 ⰀⰁⰂⰃⰄⰅⰆⰇⰈⰉⰊⰋⰌⰍⰎⰏ 01:07:38 [wiki] [[Stare]] http://esolangs.org/w/index.php?diff=44171&oldid=44132 * Hppavilion1 * (+304) added a push instruction, fixed up the interpreter description. 01:08:06 ႠႡႢႣႤႥႦႧႨႩႪႫႬႭႮႯ 01:08:09 `unidecode ⰀⰁⰂⰃⰄⰅⰆⰇⰈⰉⰊⰋⰌⰍⰎⰏ 01:08:10 ​[U+2C00 GLAGOLITIC CAPITAL LETTER AZU] [U+2C01 GLAGOLITIC CAPITAL LETTER BUKY] [U+2C02 GLAGOLITIC CAPITAL LETTER VEDE] [U+2C03 GLAGOLITIC CAPITAL LETTER GLAGOLI] [U+2C04 GLAGOLITIC CAPITAL LETTER DOBRO] [U+2C05 GLAGOLITIC CAPITAL LETTER YESTU] [U+2C06 GLAGOLITIC CAPITAL LETTER ZHIVETE] [U+2C07 GLAGOLITIC CAPITAL LETTER DZELO] [U+2C08 GLAGOLITIC 01:08:43 `unidecode ︘ 01:08:44 ​[U+FE18 PRESENTATION FORM FOR VERTICAL RIGHT WHITE LENTICULAR BRAKCET] 01:08:49 Ⰴ = GLAGOLITIC ERECT PENIS 01:08:49 tswett: The numbers are equivalent to "long"s on the machine on which it was compiled. Or in the case of my implementation, 64-bit integers because I'm using python 01:08:58 hppavilion[1]: *nod* 01:09:19 nice 01:14:59 Actually, I think I'll make the numbers double-precision floating points 01:16:13 (Or in the Python implementation, whatever you call a variable's type in python (as that's how python works)) 01:16:27 blarg ? 01:16:53 tswett: Wait, but what if you call PRINT on a noninteger floating point thing? 01:16:58 And what about rounding errors? 01:16:59 Oh well 01:17:07 I'll just use 64-bit integers in this 01:17:25 (or 32 if compiled as a 32-bit application) 01:17:30 `unidecode Ⰴ 01:17:30 ​[U+2C04 GLAGOLITIC CAPITAL LETTER DOBRO] 01:17:58 I wouldn't have been completely surprised if it had been GLAGOLITIC ERECT PENIS. Or, I guess, GLAGOLITIC SYMBOL FOR ERECT PENIS. 01:18:05 The latter would be more likely. 01:19:04 someone should add Ⰲ and Ⰴ to myndzi 01:19:57 myndzi: can you add Ⰲ and Ⰴ twh 01:23:50 [wiki] [[Stare]] http://esolangs.org/w/index.php?diff=44172&oldid=44171 * Hppavilion1 * (+1693) Clarified the syntax, added text commands and some new command(s). 01:27:39 -!- ChanServ has set channel mode: +o oerjan. 01:27:48 -!- oerjan has set channel mode: +b *!*5f760a3b@*.com/ip.95.118.10.59. 01:27:48 -!- oerjan has kicked Elite-1 Hi hagb4rd. 01:28:25 took me too long to be sure this time... 01:28:34 -!- oerjan has set channel mode: -o oerjan. 01:29:27 who's hagbard? 01:30:14 a troll who has been banned here for years 01:30:18 Everyone, I have a useful video. 01:30:19 https://www.youtube.com/watch?v=AqEzI9rPvP4 01:30:20 hth 01:31:41 lolwut 01:31:51 [wiki] [[Stare]] http://esolangs.org/w/index.php?diff=44173&oldid=44172 * Hppavilion1 * (+559) Always-executed line type, Hello World. 01:32:14 what's an efficient way to find the longest substring that appears more than once in a string? 01:32:40 1) Go to stack overflow 01:32:48 tswett: nice top comment 01:32:49 2) Look up that question exactly 01:33:13 3) Find if it's been answered. If not, ask it. Proceed to step 4. If not, continue normally 01:33:22 s/4/5 01:33:41 undo 01:34:00 s/Proceed to step 4. If not, continue normally// 01:34:09 4) Copy code. 01:34:25 5) Profit (from the royalties from the application you just made) 01:34:42 i was expecting a ??? step 01:35:20 Nope 01:35:25 The process it pretty well-defined 01:38:01 izabera: http://stackoverflow.com/questions/11853668/how-do-i-find-the-largest-sequence-in-a-string-that-is-repeated-at-least-once fwiw 01:38:49 * oerjan did steps 1 and 2 in google instead 01:38:54 yes i did too 01:39:16 -!- bb010g has joined. 01:39:57 [wiki] [[Stare/1.0]] N http://esolangs.org/w/index.php?oldid=44174 * Hppavilion1 * (+5133) Moved contents of Stare here 01:42:19 [wiki] [[Stare]] http://esolangs.org/w/index.php?diff=44175&oldid=44173 * Hppavilion1 * (-4846) Changed page to a "list" of dialects 01:43:39 [wiki] [[Stare]] M http://esolangs.org/w/index.php?diff=44176&oldid=44175 * Hppavilion1 * (+21) Fixed opening text to reflect the page rearrangement 01:44:56 The Stare 1.0 design is complete! 01:45:36 The page may change in the future to clarify the design, but no new features will be added to that page's specification 01:46:27 Stare 2.0 will have support for Functions, libraries, etc. 01:46:32 Stare 3.0 will add OO support 01:52:12 [wiki] [[Stare/1.0]] M http://esolangs.org/w/index.php?diff=44177&oldid=44174 * Hppavilion1 * (+23) Fixed some inconsistencies 01:52:52 [wiki] [[Stare/1.0]] M http://esolangs.org/w/index.php?diff=44178&oldid=44177 * Hppavilion1 * (+4) Linked to the ZWG 01:53:38 hppavilion[1]: btw we do have a "Move" button in the wiki menu 01:53:40 [wiki] [[Stare/1.0]] M http://esolangs.org/w/index.php?diff=44179&oldid=44178 * Hppavilion1 * (-6) 01:53:59 oerjan: I know, but I didn't move the entire page, just most of it 01:54:05 I kept the opening text 01:54:13 The stuff before the Table of Contents 01:54:17 mhm 01:55:24 [wiki] [[Stare/1.0]] M http://esolangs.org/w/index.php?diff=44180&oldid=44179 * Hppavilion1 * (+1) Grammar 01:57:29 `cat bin\? 01:57:30 cat: bin\?: No such file or directory 01:59:44 hmph 02:00:26 -!- ChanServ has set channel mode: +o oerjan. 02:00:33 -!- oerjan has set channel mode: +n. 02:00:40 -!- oerjan has set channel mode: -o oerjan. 02:00:50 sic transit gloria mundi 02:01:33 So 02:01:36 Any suggestions yet? 02:07:03 [wiki] [[Stare]] http://esolangs.org/w/index.php?diff=44181&oldid=44176 * Hppavilion1 * (+258) Dialect summary 02:07:58 "Thus goes the glory of the world." No, that can't be the right translation. 02:08:49 Huh, apparently that is, in fact, the right translation. 02:08:57 Except "passes" for "goes" would be better. 02:11:06 -!- heddwch has changed nick to shikh. 02:13:24 "Diseases are transmitted through Gloria's mouth." 02:14:04 -!- shikh has changed nick to heddwch. 02:14:49 Also: ars longa, vita brevis: "our long white beards". 02:15:16 I think I learned both from something that was in Finnish. 02:15:20 [wiki] [[Stare]] http://esolangs.org/w/index.php?diff=44182&oldid=44181 * Hppavilion1 * (+881) Rearranged article to list upcoming dialects (by type system) 02:15:26 There 02:16:03 I'm planning for a total of 4 differenent Stare dialects, two statically typed and two dynamic 02:16:10 [wiki] [[Dumbf*ck]] http://esolangs.org/w/index.php?diff=44183&oldid=8347 * 108.45.95.33 * (+181) Added info about first implementation 02:16:53 [wiki] [[Dumbf*ck]] http://esolangs.org/w/index.php?diff=44184&oldid=44183 * 108.45.95.33 * (-22) 02:17:47 [wiki] [[Dumbf*ck]] http://esolangs.org/w/index.php?diff=44185&oldid=44184 * 108.45.95.33 * (-6) /* Implementation */ 02:20:50 [wiki] [[Stare]] http://esolangs.org/w/index.php?diff=44186&oldid=44182 * Hppavilion1 * (+559) Basic Idea 02:21:18 I may do more Stare dialects in the future 02:23:11 Is Haskell's If/Then/Else defined in haskell or is it primative? 02:23:19 It's primitive. 02:23:22 Ah 02:24:04 https://www.youtube.com/watch?v=lu98k5vVP-Y 02:24:20 My best guess at a Latin translation for "our long white beards" would be, oh... "nostrae barbae blancae largae". 02:24:25 When in doubt, append -ae to everything. 02:24:31 -!- contrapumpkin has quit (Quit: My MacBook Pro has gone to sleep. ZZZzzz…). 02:24:35 Because I can see then and else just being an identity function and if being a function that accepts three arguments and returns the second if the first is true, else the third 02:25:01 Making if/then/else a massive lie that is really just there for ease of reading 02:25:20 Perlskell anyone? 02:25:41 * hppavilion[1] is now shipping Perlskell because he is very strange 02:26:10 Well, let's see what it is then 02:26:16 What what is? 02:26:19 in agda if then else is just a single function because you can have arbitrary fixity for your functions 02:26:20 perlskell? 02:26:40 Yes 02:26:42 Ah 02:26:55 Well, the syntax is "if x then y else z"; if it were as you said, the syntax would have to be "if x (then y) (else z)". 02:26:57 It's like haskell, but with perl's demonic type system 02:27:01 Seriously 02:27:03 In perl 02:27:08 "2"+"2" evaluates to 4 02:28:06 perlskell: "He was a washed up has-been who was big in the 90's. She was a bookish mathematics professor. Can love bloom? Watch wednesday night at 9!" 02:28:11 I can see I have left you in a stunned silence 02:28:27 oren_: Which is which? 02:28:45 it's much easier to just have then and else be sole inhabitants of the types Then and Else and then have if discard its 2nd and 4th arguments 02:28:47 obviously Haskell is female 02:29:01 Are you /sure/ 02:29:07 ? 02:29:10 Wait a minute 02:29:18 They're both nonbinary. 02:29:21 anything ending in elle is female. it's like, arule 02:29:26 -!- Phantom_Hoover has quit (Read error: Connection reset by peer). 02:29:45 I thought there was a tradition of having if' x y z = if x then y else z. 02:29:45 I remember from when I was learning haskell that else is actually a variable defined to "True" in the standard library! 02:29:49 Arule, the plural of the Italian word "arula". 02:29:50 WTF is going on!? 02:29:59 hppavilion[1]: that was "otherwise". 02:30:25 tswett: Really? 02:30:32 GT translates "our long white beards" as "longis albis cresceret barba eorum", which I'm sure is wrong. 02:30:34 Could've sworn it was "else"... 02:30:35 @src otherwise 02:30:35 otherwise = True 02:30:42 Huh 02:30:43 and obviously, perl is a washed up has-been who was big in the 90's 02:30:45 @src if 02:30:45 Source not found. Whoa. 02:30:48 @src if' 02:30:48 Source not found. Have you considered trying to match wits with a rutabaga? 02:30:54 @src (+) 02:30:55 Source not found. Sorry about this, I know it's a bit silly. 02:31:00 Possibly the if' thing isn't all that widespread. 02:31:07 @src (!) 02:31:07 arr@(Array l u _) ! i = unsafeAt arr (index (l,u) i) 02:31:11 I'm sure I've seen it somewhere, though. 02:31:18 @src fact 02:31:18 Source not found. The more you drive -- the dumber you get. 02:31:27 @src factorial 02:31:28 Source not found. You type like i drive. 02:31:32 @src ? 02:31:32 Source not found. Abort, Retry, Panic? 02:31:44 YOU SHOULDN'T HAVE SHOWN ME THAT 02:31:48 @src src 02:31:48 Source not found. I feel much better now. 02:32:10 @src import 02:32:10 Source not found. Wrong! You cheating scum! 02:32:12 @src unsafeAt 02:32:13 Source not found. Maybe you made a typo? 02:32:13 I did in fact get one thing right in my translation attempt. The Latin word for "beards" is "barbae". 02:32:23 @src (!) 02:32:24 arr@(Array l u _) ! i = unsafeAt arr (index (l,u) i) 02:32:37 What's the Peano Axiom for exponentation? 02:33:04 I don't know of any Peano Axioms for exponentiation? 02:33:30 There aren't very many Peano axioms, and exponentiation isn't one of them. 02:33:53 WE MUST DISCOVER IT THEN 02:34:06 I'm creating a computer language, vaguely like Haskell, in which you can define mathematical stuff. 02:34:16 What is the definition of x**y for natural numbers? You are given only the operation S(x) which returns x+1 02:34:31 Well, define multiplication first. 02:34:43 Well, define addition first. 02:34:58 Then x**S(y) is x*(x**y) and x**0 is 1. 02:35:13 My language kind of has a definition of the natural numbers. 02:35:38 Actually, no, now it *does* have a definition of the natural numbers. 02:35:38 Whoa! /That/'s a mistake! 02:35:54 Good luck with floating-point! 02:35:57 Hofstadter's book "Godel, Escher, Bach" discusses a programming language "BlooP" and "FlooP", with conditions as well as comparing numbers and addition and multiplication, counted loops, and a few others. 02:36:11 x+S(y) is S(x)+y and x+0 is x. HTH 02:36:30 Here's the definition of the natural numbers in my language. 02:36:31 I have found that you don't need conditions, comparison, addition, or multiplication, and can define all of them in terms of the successor operation and counted loops. 02:36:36 So yes clearly it is possible to do 02:36:51 variety NatNumAlgebra { sort Nat; zero : Nat; succ : Nat -> Nat; }; presentation NatNum : NatNumAlgebra { }; 02:37:24 tswett: Ah, OK. I can see its working I think 02:37:44 First, you define the concept of a "natural number algebra". 02:37:47 (Although I don't know what "presentation" does, as the example given is blank) 02:38:03 A natural number algebra essentially consists of a set, an element of the set, and a function on the set. 02:38:04 (But in this case it looks like OK if blank) 02:38:47 I can see all of that, yes, it is already clearly enough 02:39:39 Do you have other examples (including some with "presentation" with some stuff inside { } block)? 02:39:42 Then you define the natural numbers as being the free natural number algebra generated by no generators. 02:39:57 Yeah, sure. Have... the Klein four-group. 02:40:26 variety Group { algebra : Monoid; inv : Elem -> Elem; forall x : Elem, mult x (inv x) = ident; forall x : Elem, mult (inv x) x = ident; }; 02:41:20 presentation KleinFourGroup : Group { a : Elem; b : Elem; mult a a = ident; mult b b = ident; mult a b = mult b a } 02:41:49 Ah, OK now I can see how that works 02:42:39 I want to see Peano's Axioms extended to defined for all real- or better, all complex- numbers 02:42:51 tswett: interesting! 02:43:02 tswett: does the KleinFourGroup sing love songs? 02:43:20 coppro: I haven't worked out the language sufficiently far that it can determine that. 02:43:29 I guess the path of love is never smooth. 02:44:57 @pl \x y z -> if x then y else z 02:44:58 if' 02:45:01 fizzie: ^ 02:45:27 it's used there because otherwise @pl wouldn't have anything to return 02:45:33 @pl \x -> x x 02:45:33 join id 02:45:49 @pl (\x -> x x) (\x -> x x) 02:45:52 ap id id (ap id id) 02:45:52 optimization suspended, use @pl-resume to continue. 02:46:16 @pl \y -> (\x -> y (x x)) (\x -> y (x x)) 02:46:17 ap (. join id) (. join id) 02:46:37 hppavilion[1]: haskell's if x then y then z is officially syntactic sugar for case x of { True -> y; False -> z } 02:46:58 Too bad I can't get the type of that expression. 02:47:03 @type ap (. join id) (. join id) 02:47:04 Occurs check: cannot construct the infinite type: a0 ~ a0 -> b 02:47:05 Expected type: (a0 -> b) -> (a0 -> b) -> b 02:47:05 Actual type: ((a0 -> b) -> b) -> (a0 -> b) -> b 02:47:12 case is the most primitive pattern matching construct in the report 02:47:53 -!- contrapumpkin has joined. 02:48:13 Now, there's a funny thing about varieties and presentations. 02:48:29 Theoretically, presentations are redundant. You could just move all of the things from the presentation into the variety. 02:48:41 And then use the empty presentation to get the thing you wanted. 02:50:11 -!- boily has joined. 02:50:15 HOME! 02:50:22 boily: :D 02:50:26 where were you? 02:50:31 did you go to NYC two weeks early? 02:50:35 chelloppro! 02:50:39 no, I was in Singapore :D 02:50:45 @massages-loud 02:50:46 coppro said 14d 16h 50m 3s ago: http://csclub.uwaterloo.ca/~scshunt/mj-reference-wip.pdf 02:51:12 But presentations are restricted: you can only define nullary operators (that is, constants), not other operators; and identities can't use universal quantification. 02:51:36 I guess ultimately, a presentation is a specific type of way of extending a variety to get another variety. 02:51:38 boily: actually that one's sort of out of date 02:51:53 I decided scribus sucked so I've redone the top half in inkscape. Haven't done the table yet though 02:52:20 "*munch*", says I with a Double Big Mac in my mouth. 02:52:50 boily: what was in Signapore, besides boily? 02:52:56 Now, it's kind of interesting what a finitely presented natural number algebra turns out to be. 02:52:57 vacation? 02:53:32 -!- hppavilion[1] has quit (Ping timeout: 272 seconds). 02:53:34 Namely: it's a state machine, where there's a defined initial state, and some states have defined successor states. 02:53:49 If a state doesn't have a defined successor state, it just automatically gets an anonymous successor state. 02:54:00 It's possible for two different states to have the same successor state. 02:54:17 There's no input; the initial state completely determines the sequence of states the machine goes through. 02:54:54 coppro: yup. two weeks over there under the sun, with a weekend spent in Malaysia. 02:54:58 Of course, you're only allowed to define the successor states for finitely many states; otherwise it wouldn't be finitely presented. 02:55:27 nice! 02:57:19 I'll upload pictures some time this week. 02:57:55 wboily! 02:59:19 serjanlamat pagi! 03:05:06 -!- hppavilion[1] has joined. 03:08:58 Hellu 03:10:24 Helluppavilion[1] 03:10:28 [wiki] [[Stare]] http://esolangs.org/w/index.php?diff=44187&oldid=44186 * Hppavilion1 * (+170) Stare 1.1 03:10:46 -!- oerjan has quit (Quit: ZZZ). 03:14:54 Is "Hellu" anything like "Hello"? 03:15:58 it's a good enough appruximation. 03:27:56 [wiki] [[Stare/1.1]] N http://esolangs.org/w/index.php?oldid=44188 * Hppavilion1 * (+946) Created update log. 03:28:19 [wiki] [[Stare/1.2]] N http://esolangs.org/w/index.php?oldid=44189 * Hppavilion1 * (+534) Created Page (WIP) 03:28:50 I'm creating updates more as a symbolic thing than a practical thing xD 03:29:11 zzo38: Yes it is 03:29:18 Hi boily! 03:29:57 Honestly, the updates are so that the base isn't too featureful xD 03:33:19 How is that? 03:33:25 [wiki] [[Stare]] M http://esolangs.org/w/index.php?diff=44190&oldid=44187 * Hppavilion1 * (+298) Stare 1.2 03:34:30 should I get factorio? 03:45:23 -!- boily has quit (Quit: LAGGED CHICKEN). 03:48:29 So... I've already planned out a programming language and 2 updates to it, along with some farther-in-the-future updates for later 03:48:46 I have succeeded 03:48:47 :) 03:48:47 -!- variable has quit (Ping timeout: 264 seconds). 03:50:22 You say "so that the base isn't too featureful"; are these extensions, or what is it? 04:20:53 zzo38: Stare 1.0 is the original language, Stare 1.x languages are upgrades of the language, Stare x.0 is an in-house derivative, and Stare x.y is an upgrade of that in-house derivative 04:21:07 Third Digit Updates are bugfixes 04:21:15 And not to be given a wiki subpage 04:24:45 აბგდევზთიკლმნოპჟრსტუფქღყშჩცძწჭხჯჰჱჲჳჴჵჶჷჸჹჺ 04:24:54 I'm done georgian 04:35:54 hppavilion[1]: OK 04:37:10 d 04:54:05 -!- PinealGlandOptic has joined. 04:55:13 I want to make a game in Prolog... 04:55:16 Is that possible? 04:55:20 What kind of game? 04:55:24 I don't know 04:55:28 I don't /really/ want to 04:55:38 I just want someone to do it and then to get the memory of having done it xD 04:55:43 I don't know much about Prolog programming. 04:55:49 I don't either 04:55:50 xD 04:57:10 Try to see what you can make with QUACKVM, or a higher level programming language compiler to target it. I would be interested to see what anyone else can do with it. 05:01:18 I don't see a apge for QUACKVM 05:01:22 -!- doesthiswork has quit (Quit: Leaving.). 05:01:38 I don't remember how to use QUACK xD 05:02:40 There is no page in esolang wiki or anywhere else, only a .zip archive containing documentation and C codes and some example programs 05:04:45 Want to make a C-Like language for it?? 05:05:14 (There is a Minesweeper game, Robot find kitten game, a start of a Panel de pon puzzle mode game, a Munching squares demo, and a few other small examples.) 05:05:46 I just used the assembly language, although you might prefer other kind of programming languages 05:08:45 zzo38: How do I run a program?? 05:08:48 Need I compile first? 05:09:15 And how do I assemble? 05:09:41 zzo38: Do you have a GitHub? 05:09:55 No I do not use GitHub, I just have the plain files 05:10:04 OK :/ 05:10:11 Is there a reason for that? 05:10:24 I mean, GH is pretty useful 05:10:57 It is easier and simpler to work with and do not require web browser or a git client or anything else like that, you can just download the file. 05:11:45 Ah. 05:12:02 To run a program you run it specifying the ROM filename on the "quackvm" commandline, optionally followed by a disk filename. The provided implementation might not work except in xterm. To assemble, put filename on commandline of "quackasm"; output goes to stdout and must be redirected to write to the ROM file. (You can also append banks by appending to the file.) 05:12:10 But it'd get more exposure if you were to put it on GH. You could, of course, share it on GitHub AND have it on your website 05:12:41 So I need to compile the files first? 05:12:42 OK 05:12:48 GCC will do, correct? 05:12:59 Yes, GCC will do, it is what I used. 05:13:11 OK 05:13:11 Great 05:13:20 Or just run them with bash, they should compile if you do that 05:13:54 Unfortunately, I'm a windows user for the moment xD 05:14:11 So A) I can't use bash and B) I don't have termios.h 05:14:26 Then you probably cannot compile quackvm.c at all; you could try to write your own implementation though. 05:14:34 I've been meaning to dual-boot with a linux distribution 05:14:40 I can compile quackvm 05:14:45 Just not the assembler 05:15:33 I don't expect that implementation to work on Windows. However, you can look at the codes and the documentation and use that to make up your own implementation for Windows. 05:15:49 zzo38: What is Termios used for? 05:15:56 (Both in the assembler and in general)? 05:16:16 The assembler shouldn't need termios 05:17:01 Oh right 05:17:03 The VM implementation uses it to set noncanonical mode 05:17:19 It was quackvm that broke when I tried compiling 05:17:36 I'm a python programmer. Not much C experience. What's noncanonical code? 05:17:58 Noncanonical mode for terminals means that input is done by characters rather than by lines. 05:18:27 To use the assembler in Windows, you probably need to add something into the program to make stdout into binary mode (and I will accept patches for it) 05:18:28 Ah 05:18:36 OK? 05:19:10 While I'm at it, I might as well send you the .exes to pack with it if you wnat 05:19:15 However the .rom files are the output of the .asm files so you don't need to assemble them if you want to use only the existing programs without changing it 05:19:18 Most windows users are too lazy to compile xD 05:19:21 Ah 05:20:25 I might be able to do it with... um 05:20:35 Let me check the python code I copied earlier for /my/ vm 05:20:53 msvcrt 05:21:35 If you want, you can try to make an implementation of QUACKVM for Windows. As long as it is open-source I will agree to either include the files or to make a file that lists the links to the Windows versions as well as any other implementations and related stuff 05:22:05 ... 05:22:08 Make sure you have the latest quackvm.zip the earlier ones had a few mistakes! 05:22:09 I don't understand C 05:22:34 I probably should just use python if I'm going to make an implementation 05:22:47 You can use Python if you want to, that's OK 05:22:49 Which makes it cross-platform AND open source 05:23:02 Did you document the file format? 05:23:16 I assume files are flat binaries because you didn't have any suggestions for me xD 05:23:57 What's the URL for the latest zip? 05:23:59 Note that some features are optional to implement. 05:24:10 I'll implement them anyway xD 05:24:21 That's OK! 05:24:23 Hi all, is it ok to ask an assembly related question here, or is there a more appropriate channel? 05:24:44 (asking on behalf of a friend who's stuck on a programming assignment. I would know how to solve it if it's not assembly) 05:24:48 Patashu: I don't know; ask anyways in case anyone knows, but if there are others you can try that too 05:25:03 The URL is the same as the previous versions; it is: http://zzo38computer.org/prog/quackvm.zip 05:25:59 so what the program needs to do is read and validate numbers from the user. from the second number onwards, it also needs to compare the new and last number and print which one was higher. 05:26:18 so say you put in 1, then 2, it compares 2 to 1 and 2 is greater, then you put in 30, it compares 30 to 2 and 30 is greater, etc 05:26:26 Patashu: But you should nevertheless mention (whether you ask here or elsewhere), assembly language for what computer? 05:26:41 http://pastie.org/private/kztje7hm3tuvpdlhauv7ba#27 I think it's called nasm, e.g. this is documentation for it http://www.tortall.net/projects/yasm/manual/html/nasm-effaddr.html 05:26:53 so the specific problem we're having is, we want to swap the pointers to our two input buffers after reading each number in 05:27:14 so we're always, for example, inputting the newest number into input1, then comparing input1 to input2, then swapping what was in input1 to input2 and reading into input1 again 05:27:21 I'm a bit clueless. What exactly does "the predicate succeeding" do in your VM? 05:27:51 but the problem we're having is that lea input2, dx ; and mov input2, dx ; are both compiler errors. 05:28:14 and we know that it will work if you surround input2 in brackets, like this: [input2] but that does something different - it uses the value input2 is pointing to, not the 'pointer' of input2 itself, and we want to swap the two pointers specifically 05:28:16 (fin) 05:28:44 hppavilion[1]: It matters if the instruction has the predicate bit set; then a cell follows which tells it where to go if the predicate succeeds/fails (depending on the sign bit) 05:29:05 hppavilion[1]: I believe the newest documentation documents that? If it isn't clear, you can tell me and I can try to fix it. 05:29:23 I'm still uploading the newest docs to Drive so I can read them 05:29:26 I don't have MS Office xD 05:29:43 hppavilion[1]: It is a plain text file, not a MS Office document 05:29:49 It's a .doc 05:29:54 That's an MS office document 05:30:31 Yes, but it is still a plain text file. The .doc extension is used for both (although using it for plain text is a bit old), although Wordpad should be able to open it anyways hopefully? 05:30:38 Patashu: I don't know much of nasm syntax or x86 instruction set, nor do I know what other channel to try 05:30:51 zzo38: NP, thanks for hearing me out 05:31:02 oh, here it is 05:31:05 ##asm, let me try that 05:31:09 Patashu: But if someone else happens to be on and who knows the answer, they will answer you too 05:31:31 yeah, thanks 05:32:18 hppavilion[1]: So you can read it with Wordpad. (Notepad will not work because Notepad requires CRLF line endings) 05:32:36 Notepad++ will probably work 05:32:53 Doesn't matter though, I uploaded it to Google Drive and had Google Docs convert it to a Google Docs document 05:33:17 You can do that if you want, that is fine, the document is public domain anyways 05:34:37 Whelp 05:34:45 I have NO clue how your vm works 05:34:49 All other files there are also public domain. 05:34:51 I'm getting a vague idea 05:34:58 Public domain is fun 05:35:54 Sorry, if I am being unclear in the documentation, then I hope to fix it. You could try to understand by the C codes too if you want to, even if you cannot understand C codes very well, it might be better than reading only one file 05:36:20 I think I just don't understand low-level processing enough xD 05:37:06 That might be it. It can be a good idea to learn, not only for this but for dealing with other stuff too 05:37:38 -!- shachaf has set topic: English spelling reforms | https://dl.dropboxusercontent.com/u/2023808/wisdom.pdf http://codu.org/logs/_esoteric/ http://tunes.org/~nef/logs/esoteric/ | http://esolangs.org/. 05:38:42 all characters of my font (so far) in unicode ordering: http://www.orenwatson.be/fontcharlist.htm 05:40:22 zzo38: oh, you've documented the instruction format and encoding of that interpreter? 05:40:52 b_jonas: Yes, I have done it now (I don't know if it is clearly enough) 05:41:29 oren_: That looks like good so far 05:44:50 Well 05:44:52 I hit a wall 05:45:05 I need a way to convert a string of bits to a floating point 05:45:16 Why? 05:45:44 For the floating-point instructions 05:46:25 There are no floating-point instructions 05:46:58 I mean instructions that operatate on registers containing double-precision floating point numbers 05:47:01 For MY VM 05:47:32 Ah, well, I do not know Python, nor have I seen such instruction in your documentation? Maybe it was a bit old one! 05:47:35 -!- MDude has changed nick to MDream. 05:48:06 zzo38: I just realized I need it x 05:48:07 D 05:48:08 Wait 05:48:11 No I don't 05:48:26 Wait 05:48:28 Yes I do 05:48:35 I have lost track of what I'm talking about xD 05:48:49 I was thinking about a SETF instruction, but I don't need that 05:49:22 But I must've added those instructions after I talked to you 05:49:48 What did you expect to need them for? 05:50:15 For floating-point operations 05:50:30 This VM is intended to have actual uses xD 05:51:45 Yes, if you intend to use with programs that require floating-point. Many programs don't and use fixed-point. But, look in Python documentation maybe you can find it 05:52:44 I will 05:55:12 -!- sc00fy has joined. 05:57:17 -!- sebbu2 has changed nick to sebbu. 06:05:30 -!- sc00fy has quit (Ping timeout: 240 seconds). 06:24:30 -!- JesseH has quit (Ping timeout: 240 seconds). 06:45:55 -!- ^v has quit (Ping timeout: 250 seconds). 06:47:15 `danddreclist 67 06:47:16 danddreclist 67: shachaf nooodl boily \ http://zzo38computer.org/dnd/recording/level20.tex 06:47:25 I will add the character sheets a bit later 06:59:49 -!- hppavilion[1] has quit (Ping timeout: 246 seconds). 07:07:17 Also is still around? 07:10:39 -!- bender has joined. 07:14:40 Not yet at least 07:15:01 -!- x10A94 has joined. 07:20:42 Hi 07:27:15 -!- AnotherTest has joined. 07:44:16 hi 08:08:05 -!- ais523 has joined. 08:33:29 -!- AnotherTest has quit (Ping timeout: 244 seconds). 08:48:46 -!- FreeFull has quit (Ping timeout: 240 seconds). 08:50:51 -!- FreeFull has joined. 09:00:37 -!- heddwch has quit (Read error: Connection reset by peer). 09:01:11 -!- heddwch has joined. 09:04:32 -!- bender has changed nick to bender|. 09:04:40 -!- bender| has quit (Changing host). 09:04:41 -!- bender| has joined. 09:06:42 -!- AnotherTest has joined. 09:16:46 -!- sc00fy has joined. 09:48:42 -!- AnotherTest has quit (Ping timeout: 246 seconds). 09:51:22 -!- AnotherTest has joined. 10:17:24 -!- aloril has quit (Ping timeout: 246 seconds). 10:24:33 -!- lleu has joined. 10:28:46 -!- sc00fy has quit (Ping timeout: 246 seconds). 10:34:39 -!- Phantom_Hoover has joined. 10:35:31 -!- boily has joined. 10:47:36 -!- aloril has joined. 10:49:26 -!- ais523 has quit (Quit: meeting). 10:56:36 -!- J_Arcane has quit (Ping timeout: 246 seconds). 11:25:02 -!- boily has quit (Quit: CYCLOPEAN CHICKEN). 11:36:50 -!- bender| has changed nick to bender. 11:40:49 -!- FreeFull has quit (Quit: BBS). 11:44:54 -!- hppavilion[1] has joined. 11:49:26 -!- hppavilion[1] has quit (Ping timeout: 265 seconds). 11:57:49 -!- Frooxius has quit (Quit: *bubbles away*). 11:58:02 -!- Frooxius has joined. 12:08:48 -!- darkl0ck has quit (Ping timeout: 264 seconds). 12:27:30 -!- Patashu has quit (Ping timeout: 268 seconds). 12:35:03 -!- ais523 has joined. 12:35:39 -!- Frooxius has quit (Read error: Connection reset by peer). 12:35:44 -!- Froox has joined. 12:36:17 -!- AnotherTest has quit (Ping timeout: 252 seconds). 12:38:46 -!- Froox has quit (Client Quit). 12:38:57 -!- Frooxius has joined. 12:42:35 -!- FreeFull has joined. 12:47:42 -!- JesseH has joined. 12:52:51 -!- bb010g has quit (Ping timeout: 244 seconds). 13:02:37 -!- AnotherTest has joined. 13:03:26 -!- bb010g has joined. 13:35:39 hmm, spambot says ATM MASTER CARD, and although it's almost certainly a typo for MasterCard, there's somehow a very different connotation 13:37:26 ATM SKELETON CARD 13:38:17 Did you get to see Sunday's plot-of-the-day? http://zem.fi/bfjoust/vis/cycles/ 13:38:18 ATM INTERCALDIATE CARD 13:38:55 fizzie: I didn't 13:38:58 * ais523 looks now 13:39:15 oh wow, margins is going to be hilarious again isn't it? 13:39:44 fizzie: hmm, I can't see the top few lines at the same time as the graph at the bottom 13:39:53 ah right, i can click 13:39:55 rather than hover 13:41:24 fizzie: suggested improvement to that: in the graph at the bottom, show which program won 13:41:39 correlation between win rate and cycle length is interesting to know 13:44:32 Mm. I could use three different colors for the bar (with a legend on the right side), although currently there's always at least one zero-height bar, so I'd have to pad them a bit. 13:44:33 THE MASTER CARD OF YENDOR 13:44:36 no wait 13:44:39 !bfjoust test ,[.,]!Hello, world! 13:44:47 ​Score for ais523_test: 6.1 13:45:06 THE PLATINUM YENDORIAN MASTER CARD 13:45:18 and THE MASTER CARD OF THIEVERY 13:46:13 btw, my latest adventures in Windows land: 13:46:40 network share with two directories, named "a" and "A", in the same directory. Explorer lists "A" no matter which one I'm trying to view. 13:50:03 !ztest test . 13:50:03 ais523.test: points -32.10, score 3.26, rank 47/47 13:52:08 The plots still won't auto-update, sadly. 13:53:47 what is bfjoust ? 13:54:11 a brainfuck programming game 13:55:30 fizzie: your website is missing a link to the repository of programs 13:55:33 (I'm currently updating the wiki page) 13:55:38 (and noticed it isn't listed anywhere) 13:56:25 seems to be http://zem.fi/bfjoust/hill.git/ 13:56:51 izabera: look on esolangs.org, there's an entry 13:57:07 it's a strange game ais523 is good at 13:57:15 I'm editing the page right now 13:57:19 so the bot should post a link to it soon 13:57:23 when I save the page 13:57:57 [wiki] [[BF Joust]] http://esolangs.org/w/index.php?diff=44191&oldid=40553 * Ais523 * (-246) update information about the hills; fix capitalization of "brainfuck" 13:58:00 there we go 13:58:18 b_jonas: reading about it now 13:58:35 Gregor: your certificate for https://codu.org is expired 14:01:54 b_jonas: one of the things I love about BF Joust is that unlike almost all competitive games, you can play it against yourself 14:02:18 because there's no hidden information involved, you can see all the programs you're competing against and analyze how they work, but that doesn't necessarily help in beating them 14:03:06 ais523: sure. competitive rubik cube solving is like that too. 14:03:29 ais523: there's hidden information, but only in the sense that the tape length and polarity are hidden from the bfjoust code. 14:03:50 b_jonas: rubiks cube solving is competitive only in the sense that you can compare two solution events to see which one had the shorter time 14:03:57 there's no interaction between the different players 14:04:04 ais523: yes, that's true. 14:04:12 BF Joust has plenty of interaction, but the twist is you have to write down your strategy in all possible situations in advance 14:04:12 only metagame interaction. 14:05:38 so then it's like... ICFP contest 2004 about the ants? 14:05:56 that's a two-player game where you have to write down the strategy in advance 14:06:20 people played it for a while after the contest, though I think they have mostly stopped now. 14:06:38 yes, I think that's a good comparison 14:07:16 it also uses a somewhat simple programming language, one that doesn't have a large memory or registers. 14:07:51 a large general purpose random access memory that is. 14:10:17 in windows, what's the proper combination of backslashes and/or slashes in a pathname like \\?\UNC\\\HOSTNAME\sharename\ ? 14:11:35 I'm not sure 14:11:47 and my searches are failing because duckduckgo doesn't recognise \\?\ as a search term 14:11:55 * ais523 tries putting quotes around it 14:12:04 oh, now it does recognise it, but can't find any results anyway 14:14:22 apparently it needs a single backslash between UNC and the server name 14:15:14 good, sort of works now 14:15:29 do I even want to know what you're doing? 14:16:16 ais523: I mentioned above: 14:16:30 oh wait, you weren't here 14:17:16 ais523: Yeah, I was sure I had the hill repository link somewhere, but turns out I didn't. The program names in the score table link to the gitweb view, which I think used to have the URL, but it seems to have gotten lost. 14:17:31 "btw, my latest adventures in Windows land: network share with two directories, named "a" and "A", in the same directory. Explorer lists "A" no matter which one I'm trying to view." 14:17:35 you were here 14:18:12 I thought it might be connected to that 14:18:31 I want to try to list both directories out of curiosity 14:19:04 I don't think this will help, because it's still case insensitive normally 14:21:06 oh brilliant 14:21:10 it's non-deterministic too 14:21:16 apparently it's locally cached for a while 14:21:25 so whcihever dir I try to access first, I'm stuck at it 14:22:22 -!- Phantom_Hoover has quit (Ping timeout: 260 seconds). 14:22:43 Interestingly, bfjoust resembles not a tilt (lance charge) but a traditional joust (with multiple rounds and fighting styles) 14:36:47 -!- Phantom_Hoover has joined. 14:36:49 Jafet: Is the latter composed of multiple instances of the former? 14:38:32 (I've been wondering about the word to use for a single "instance" (particular pair of programs, tape length and polarity). The article sometimes calls it a "match", but it's not even consistent. 14:39:31 fizzie: "round" seems to make sense 14:39:39 btw, if you're talking about the wiki article 14:39:43 In "-- tournaments generally run 42 matches between the two warriors -- A program is scored based on the number of configurations in which it won, minus the number of configurations in which it lost; thus +42 is a perfect score for an individual match --" the first half implies there are 42 matches, but the second half implies "an individual match" is all 42. 14:39:52 you can make it consistent and then people will start using your terminology 14:40:08 that's how the whole "sieve" and "kettle" thing started 14:40:21 (this also implies that the word you choose is likely to catch on even if it makes no sense) 14:40:56 I don't remember my wiki password, and my password manager is inaccessible. :) 14:41:20 The article uses the word "round" for one of what I've been calling cycle, too. 14:41:29 Well, maybe not. 14:41:32 I think I just read that too fast. 14:41:41 "In each round of a match, both warriors simultaneously execute one of the above instructions at each time step (or 'cycle')." 14:42:00 I wouldn't mind it being "match" for the full set of 42, and "round" for one configuration. 14:42:29 My protobuf messages call the former a single "joust". 14:44:01 I think "cycle" is standard by now 14:45:32 -!- bender has quit (Quit: Ping Pong Fuckout). 14:47:26 [wiki] [[BF Joust]] http://esolangs.org/w/index.php?diff=44192&oldid=44191 * 74.125.57.54 * (-7) /* Matches */ (Hopefully) consistify terminology. 14:47:39 Usernames are for chumps anyway. 14:51:49 -!- nycs has joined. 14:51:49 -!- nycs has changed nick to `^_^v. 14:52:59 ais523: I know, but I've been having issues with StartSSL @_@ 14:53:15 Gregor: fair enough, just making sure you were aware 14:53:40 the whole certs and expiry thing is basically a blatant cashgrab as it is 14:53:41 [wiki] [[BF Joust]] http://esolangs.org/w/index.php?diff=44193&oldid=44192 * 74.125.57.54 * (+109) /* Competitive hills */ Tweak zem.fi hill replacement strategy description. 14:54:14 My StartSSL cert for zem.fi is expiring on October 7 this year. 14:54:15 fizzie: hmm, I guess my programming mind saw the two as equivalent 14:54:29 (re your edit) 14:55:06 I was hoping letsencrypt would've been launched (as scheduled) so I wouldn't have to keep dealing with StartSSL. 14:56:36 fizzie: Any year now. 14:56:59 I think they've only moved the announced dates back once. 14:57:08 (Before that, they just didn't have launch dates.) 14:59:22 Arguably, my replacement strategy is "less sane" (in that you can replace a better program by a worse one), but that's what I ended up when implementing it. 15:02:04 fizzie: it's equivalent over time, the only difference is the instant at which you take the snapshot 15:02:16 or, hmm, not /quite/ 15:02:23 because it affects the scores of the incoming program 15:03:10 `unidecode ; 15:03:11 ​[U+003B SEMICOLON] 15:04:02 `unidecode ; 15:04:03 ​[U+037E GREEK QUESTION MARK] 15:06:05 Maybe I should use that as my regular question mark; what do you guys think; 15:07:58 Sounds good⸮ 15:08:18 Why not use U+200B​ 15:09:55 -!- J_Arcane has joined. 15:12:43 fizzie: how about "game" for a particular pair of programs on a length and polarity, and "match" for the set of all games between two programs on each length and polarity? 15:13:56 or maybe the first one could be a "run" 15:15:02 There was one instance of calling it a "run", but I just went with a "round". 15:16:46 and then you need words for the set with two programs on a given polarity but varying length, and the set with two programs with a given length but varying polarity. :-) 15:17:59 I think I'll call one a "slice", and the other a "sluice". 15:21:57 -!- J_Arcane_ has joined. 15:23:03 -!- J_Arcane has quit (Ping timeout: 255 seconds). 15:23:07 -!- J_Arcane_ has changed nick to J_Arcane. 15:26:58 sluice? is that a real word? 15:30:07 Yes. 15:30:14 @wn sluice 15:30:16 *** "sluice" wn "WordNet (r) 3.0 (2006)" 15:30:18 sluice 15:30:20 n 1: conduit that carries a rapid flow of water controlled by a 15:30:22 sluicegate [syn: {sluice}, {sluiceway}, {penstock}] 15:30:26 v 1: pour as if from a sluice; "An aggressive tide sluiced 15:30:28 [5 @more lines] 15:30:50 As far as making sense goes, it's in the sieve/kettle ballpark. 15:31:28 2. (1) sluice, flush -- (irrigate with water from a sluice; "sluice the earth") 15:31:38 "sluice the earth" sounds like something a supervillain would say. 15:33:15 oh, a *conduit*. well, that explains everything: http://darthsanddroids.net/episodes/1013.html 15:33:37 I was aware of the word "sluice", but I wouldn't necessarily expect a non-native speaker to know it 15:33:39 it's a pretty obscure word 15:34:33 Yah 15:34:43 "slice" is much better-known 15:34:45 * APic no native English-Speaker, and did not know that Word 15:34:49 True 15:34:58 (although a sluice-gate could probably be used for slicing, especially if you sharpened the bottom of it) 15:36:51 -!- AnotherTest has quit (Ping timeout: 256 seconds). 15:37:06 ok, so sluice. that means we have conduits in bfjoust. 15:38:15 huh, "penstock" is a synonym for "sluice"? 15:39:15 well, in some of their meanings 15:39:22 presumably 15:40:00 great build system set up here, I think I only have to edit the description file in like six places to add a new set of source files. 15:43:29 http://darthsanddroids.net/episodes/1013.html has some great technobabble. Heisenfram, Hyperfluid, Intermix, Phlebotinum, and Wavelet conduits. 15:50:43 -!- oerjan has joined. 15:52:07 ais523: I probably know of 'sluice' because of encountering references to sluice gates in somewhere or another. 15:52:26 sluices and sluicegates go together, really 15:52:26 I think a game, perhaps. 15:52:40 you need a sluice gate in order to be a sluice 15:52:46 but a sluice gate doesn't have a whole lot of useful applications 15:52:49 gating sluices is the main one 15:52:50 http://finalfantasy.wikia.com/wiki/Garamsythe_Waterway "The Sluice Gate Key can be obtained from Sorbet after completion of the White Mousse Hunt." 15:52:56 hi 15:53:03 fizzie: huh, I didn't expect an FFXII reference 15:53:05 hi oerjan 15:53:08 It's possible I knew of sluices beforehand, but I've at least obtained the Sluice Gate Key. 15:53:25 today i did something i'd never thought plausible: i voted in a norwegian church election. 15:53:40 oerjan: heh 15:54:34 oerjan: did you care about who won? 15:54:47 I voted in the UK local police commisioner elections a while ago 15:54:59 which had one of the lowest turnouts ever 15:55:08 mostly as a negative vote to make sure that particular candidates didn't win 15:55:20 local police commisioner elections? I haven't heared of such a thing. 15:55:36 and sure, negative vote is perfectly normal, it happens on bigger elections too. 15:55:40 it was for a good cause. it so happens that this year the main issue in the election has been whether the church should perform gay marriages... 15:56:04 when all the candidates seem bad, some of them can still be worse, and then it's worth to vote for another, even if you're not sure who's the best candidate. 15:56:14 -!- mihow has joined. 15:56:25 ais523: What all do you elect here? I think I'm eligible to vote on some local things now. 15:56:27 (also, the church election is colocated with the municipality elections, so it was a simple thing to vote in both) 15:56:48 fizzie: there are two main groups of elections (which sometimes fall on the same day, which makes counting easier) 15:57:15 -!- yiyus has quit (Ping timeout: 246 seconds). 15:57:17 one is a general election; that used to happen approximately every five years (I think a new law means that it happens /exactly/ every five years because governments were scheduling them tactically) 15:57:38 in a general election, every position for a member of parliament is voted on 15:58:14 each person gets to vote for one member of parliament "slot" depending on where they live (the slots are called "constituencies" and have names like Birmingham Edgbaston) 15:58:53 it's plurality voting, and the members of parliament then can plurality vote on laws 15:59:26 the prime minister is loosely defined as "anyone who can plausibly claim to be prime minister, and not have over 50% of the MPs oppose that claim" 15:59:38 the other main election is a local election; that affects the makeup of the local council 15:59:52 Apparently the general one requires citizenship. 15:59:56 ais523: hmm. can that mean there's two opposing prime ministers? 16:00:13 -!- contrapumpkin has changed nick to copumpkin. 16:00:27 b_jonas: I think there's a countably infinite number of prime ministers. 16:00:44 that works much the same way as a general election, except a) the slots are more specific (and called "wards", not "constituencies"), and b) there are three candidates elected per ward (although in some elections, you vote for all three, some you vote for only one) 16:01:03 fizzie: oh, the prime minister also has to be an MP 16:01:18 fizzie: well, there can't be much more than that, unless they're overlapping a lot 16:01:27 or are very small 16:01:28 b_jonas: it could sort-of happen; however, the Queen has the final say as to who the Prime Minister is (although if she gets it wrong, she'll instantly be overriden by 50% of the MPs) 16:01:55 it's generally considered that it would be very embarassing for the Queen to nominate someone Prime Minister and immediately get them voted out 16:01:58 ais523: ok, that means it's effectively the same system as in Hungary, but defined backwards 16:02:22 ais523: wait, does that mean britain will no longer have freely scheduled dissolution of parliament? 16:02:27 so she normally delays the official announcement until it's clear that one party can control a confidence vote 16:02:40 oerjan: I believe so; there's some provision for emergencies, which may or may not be badly defined 16:03:07 fizzie: and as for what "councillors" elected in a local election do, they get to control the budget for the local area and vote on how it's used 16:03:18 -!- bb010g has quit (Quit: Connection closed for inactivity). 16:03:19 here, the President of the Republic proposes a prime minister to make a government, but then the majority of the parliment has to vote _for_ him before he can become a prime minister, so the President generally proposes the one person who would get the votes in first place, 16:03:26 in my case, the council in question is Birmingham City Council, who control the budget for all the day-to-day running of Birmingham 16:03:26 norway has had a fixed schedule basically always, and some have argued that we _should_ introduce dissolution 16:03:36 things like funding the police, repairing streetlights, garbage collection 16:03:39 and for that he may have to wait before parliment parties make an agreement, if no party is in majority after the elections. 16:04:23 the council itself is funded by two sources: a) money from the national tax budget (allocated by parliament); b) council tax, which is charged against houses (more expensive the more impressive the house) and has to be paid by their owners 16:04:57 ais523: all of that sounds normal, it's just the part where you said "local police commisioner" that sounds strange 16:05:02 so a council election is really about how you want the council to prioritize their budget 16:05:10 b_jonas: most people think it shouldn't have been an elected position in the first place 16:05:41 we've only had one election for that 16:05:41 ais523: wait, only those two? local councils can't have tax on industry? 16:06:11 -!- yiyus has joined. 16:06:19 b_jonas: local councils can't impose their own taxes (other than council tax), although they can certainly try to claim a bigger share of the national taxes on whatever basis they feel like 16:06:37 oh, btw, all this applies to England specifically; the situations in Wales, Scotland, and Northern Ireland are more complicated and I don't know all the details 16:10:22 ok 16:10:25 (and no idea about the smaller islands; Anglesey almost certainly counts as part of Wales, and the Hebrides and the like as part of Scotland, but what about the Isle of Man, or Wight, or the Channel Islands, or the Falklands?) 16:10:53 yes, those all have crazy special rules 16:10:59 about everything in general 16:11:41 the UK being centered around an archipelago (which isn't all part of the UK, nor is all of the UK there) makes geographical terminology pretty awkward sometimes 16:12:00 even the name of the archipelago itself is apparently very contentious on Wikipedia 16:12:08 heh 16:12:13 "British Isles" is the most common, but some Irish people feel that that's discriminatory 16:12:50 -!- ais523 has quit. 16:13:13 (that kind of irish person is mostly out to make a point, though) 16:13:14 -!- ais523 has joined. 16:13:19 (that kind of irish person is mostly out to make a point, though) 16:13:32 now I'm wondering if "Great Britain" (the name of the largest island in the archipelago) is contentious too 16:13:55 -!- ^v has joined. 16:23:48 ais523: it's possible that different names are better for different purposes. 16:25:31 Like, a politician has to use one name in his speech to avoid some people feeling insulted; but you have to use another name when addressing a postal mail so that it gets there more reliably. 16:25:52 There's some crazy naming issues, like that about Macedonia or Taiwan. 16:26:27 Or Serbia, which had to stop calling itself Yugoslavia after a while. 16:27:03 -!- Vorpal has joined. 16:27:54 `culprits useless_file.txt 16:27:56 fizzie estin 16:28:15 `? estin 16:28:15 estin? ¯\(°​_o)/¯ 16:28:58 "after a while"? did they keep doing it after montenegro left? 16:32:00 -!- S1 has joined. 16:32:19 Has someone here ever made something in BANCStar? 16:32:34 b_jonas: weren't you a BANCStar "expert"? 16:32:38 `welcome S1 16:32:39 S1: 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 EFnet or DALnet.) 16:32:40 what? no 16:32:41 hue 16:32:49 hm not even that long, they changed in 2003 16:32:50 b_jonas: hmm, maybe I've confused you with someone else then 16:32:50 I was just interested and read some of the disassembler code 16:32:54 bearing in mind that this is all relative 16:33:01 knowing anything at all about BANCStar probably makes you an expert 16:33:05 yes 16:33:07 -!- spiette has joined. 16:33:08 then even I am an expert 16:33:09 I guess so 16:34:37 Just wondered if someone made something reasonable that could have been shown. But now I realize I would not want to read it anyway 16:34:41 Hello! I'm back! 16:35:54 -!- S1 has left. 16:35:57 -!- S1 has joined. 16:36:02 dammit, ^W 16:36:07 ais523: Why did you welcome me? 16:36:20 isn't there no surviving implementation of BANCStar? 16:36:26 (known) 16:36:47 S1: habit 16:37:16 secretly, he did it so as not to risk any `relcomes 16:37:30 `relcome ? 16:37:30 ​?: 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 EFnet or DALnet.) 16:37:37 * oerjan cackles madly 16:38:01 I have colours turned off in my client :-P 16:38:24 i,i `mkx rmelcome//rm bin/relcome 16:38:34 colours are not a valid topic for any irc 16:38:51 Vorpal: where have you been? 16:39:10 i guess it's vacation season 16:39:29 oerjan, well I moved out from my parents, and like the week before that the HDD of the RPi that runs the znc bouncer died, and I didn't have time to deal with that until now 16:39:44 oh :( 16:39:53 So that is why I have not been on IRC 16:40:11 oh, Vorpal is here! 16:40:13 Fucking HDDs, I want some durable storage. Install and forget 16:40:18 look at me, I'm the BANG-Star EGG-Spurt 16:41:10 btw i turned on +n yesterday, hagb4rd was around and made brief use of it. 16:41:38 -!- hppavilion[1] has joined. 16:41:41 oerjan: no implementations. the buy who brought us the bangstar samples and disassemblers said he has an old floppy with the implementation that he may be able to read somehow, then he disappeared completely. so be careful. 16:41:59 ....ok 16:42:19 "We are sure there is nothing fishy about this" 16:42:29 that, yes 16:42:52 but if you're not a trained professional BANG-Star EGG-Spurt, then don't try it at home anywya. 16:43:03 it can be dangerous 16:43:18 Also it's BANCStar, not BANGStar 16:44:47 I figured out some things of BANCStar too; see the talk page 16:44:50 b_jonas: you seam to be speaking vaguely pornographic, are you sure you're not hagb4rd 16:46:04 he did it twive 16:46:06 twice 16:48:28 one, two, twee, twour, twive times! 16:48:58 ais523, how are you btw? 16:49:10 twive is even more than twice 16:49:24 Vorp'hello. I don't even remember how long you've been gone. 16:49:33 Can't have been that long, seeing as I still haven't graduated. 16:49:49 Vorpal: temporarily inconvenienced, with no real long-term problems right now 16:49:53 are you graduating gradually 16:50:04 I'm spending most of my time at work, because my house is being re-plumbed 16:50:09 and is currently almost a building site 16:50:25 -!- ais523 has changed nick to callforjudgement. 16:50:33 -!- callforjudgement has changed nick to ais523. 16:50:35 oerjan: I think it's required to be somewhat discrete by the rules. 16:51:47 how unnovative 16:55:10 -!- hppavilion[1] has quit (Ping timeout: 246 seconds). 17:05:40 Vorpal: temporarily inconvenienced, with no real long-term problems right now <-- well my toe hurts and the doctors don't know what it is so far... 17:05:47 But that is not related to not being here 17:09:53 ok, apparently I'm an expert because I created the esowiki webpage for BANCStar. 17:10:31 clearly. 17:10:47 an expert on bancstar? 17:11:10 * S1 drops 17:12:01 i think zzo38 is also a bit of an expert, istr he did some investigations 17:12:18 Yes I did too 17:12:36 Although neither of us are really an expert as far as I know. 17:12:45 yep. and GreyKnight did more investigations. 17:13:50 Some things I have come to conclusion differently than other people have done 17:14:25 oh, hmm, we are missing someting 17:14:27 `welcome Vorpal 17:14:28 Vorpal: 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 EFnet or DALnet.) 17:14:45 I see the habit now, ais523 17:15:21 Vorpal hasn't been here for ages, we need to make him welcome ;-) 17:15:32 yes 17:15:47 I never said it's a bad habit, anyway 17:16:43 `wälcåmä Vorpal 17:16:46 Vårpal: Wälcome to the intärnatiånal hub får äsåteric programming language däsign and deplåyment! Får måre infårmation, check out our wiki: . (For the åther kind åf äsåterica, try #esåtäric ån ÄFnet år DALnät.) 17:17:42 this is æwesøme 17:18:21 b_jonas: not fair, you added another stupid welcome variant since last time I deleted a bunch of them? 17:20:38 ais523: it's a generic Swedifier 17:20:48 `` echo 'hello, world' | en2sv 17:20:49 hellå, wårld 17:22:43 -!- atrapado has joined. 17:23:14 `? me 17:23:15 Me is a proud member of the tEaM. 17:23:37 `culprits wisdom/me 17:23:38 int-e 17:27:25 I have almost as many footnotes as sessions, but only approx. half as many chapters as sessions 17:30:08 `cat bin/wälcåmä 17:30:09 ​#!/bin/sh \ exec welcome "$@" | bin/en2sv 17:30:17 `cat bin/en2sv 17:30:18 ​#!/usr/bin/perl \ use Encode; binmode *$_,"encoding(utf8)" for STDIN,STDOUT; local$/; for (split//,) { rand(5)<3 and y/EOeo/\xc4\xc5\xe4\xe5/; print } 17:31:06 b_jonas, what is that? 17:31:13 "`wälcåmä " I mean 17:31:18 just adding random dots? 17:31:38 We should add a proper Swedish and Norwegian welcome message, don't you agree oerjan ? 17:32:05 If you know how to write in Swedish and Norwegian then you can try to do such thing 17:32:22 zzo38, well I do know Swedish and oerjan knows Norwegian obviously 17:32:32 Vorpal: spells stuff in Swedish. Swedish randomly spells "e" as either "e" or "ä", and similarly randomly spells "o" as either "o" or "å". It should also do other changes, but those would be more complicated to implement. 17:32:43 are you sure there wasn't one already? 17:32:50 b_jonas, hah :P 17:33:01 `` ls wisdom/*elko* 17:33:01 wisdom/welkom 17:33:10 `` ls wisdom/*älko* 17:33:11 wisdom/välkommen 17:33:17 Let me do the proper translation to Swedish 17:33:18 `? välkommen 17:33:19 Hej och välkommen till den internationella knutpunkten för design och distribution av esoteriska programspråk! För mer information, se vår wiki: http://esolangs.org/wiki/Main_Page. (För den andra sortens esoterism, pröva #esoteric på irc.dal.net.) 17:33:24 TOO LATE 17:33:37 I'll try, and undoubtedly fail extremely badly, to translate the welcome message into Latin. 17:34:10 Why is the speecher on my computer so bad????? It is making all of the wrong noise!!!! 17:34:11 `elcomeway tswett 17:34:11 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: elcomeway: not found 17:34:16 :P 17:34:34 zzo38: you seem very upset about this 17:35:06 It still works though despite that 17:35:07 Välkommen till den internationella hubben för esoterisk programmeringsspråksdesign och -driftsättning! För mer information kolla upp vår wiki: . (För den andra typen av esoterisk, pröva #esoteric på EFnet eller DALnet.) 17:35:17 oerjan, oh it exists, damn 17:35:24 (Well, the speaker on right side works; the one on left sometimes it doesn't works) 17:35:46 oerjan, not enough concatenated words in that though 17:36:04 "programmeringsspråksdesign och -driftsättning" is clearly superior to "design och distribution av esoteriska programspråk" 17:36:21 Especially deployment != distribution 17:36:29 Especially since* 17:37:00 OKEJ 17:37:25 oerjan, though "knutpunkten" is better than "hubben" clearly 17:37:55 självklart 17:38:24 Hej och välkommen till den internationella knutpunkten för esoterisk programmeringsspråksdesign och -driftsättning! För mer information, se vår wiki: . (För den andra sortens esoterism, pröva #esoteric på EFnet eller DALnet.) 17:38:31 That seems to be the best of both 17:38:34 Benvenite ad centrum internationalis de designatio et deplementatio de linguae esotericae programmati! Per plus informatio, mira nostro wiki: . (Per alter tipus esotericae, proba #esoteric in EFnet vel DALnet.) 17:38:45 I don't know of any specific errors in that. 17:39:03 i can see lots of case errors 17:39:24 hmm, welcome in real Swedish 17:39:38 Some of those are definitely real Latin words. "Ad", "per", "plus", "alter", "in". And I feel like "centrum" looks about right. 17:39:45 -!- AnotherTest has joined. 17:40:46 What case is that supposed to be? Uh, there's nominative, accusative, dative, genitive, ablative, and vocative. So the word for "center" should be in the... dative? 17:41:03 -!- ais523 has quit. 17:41:36 Benvenite ad centrum internationalem de designatione et deplementatione de linguis esotericis programmatis! 17:42:06 I assume you came up with that by just taking my "translation" and sticking the right case endings on. 17:42:08 i thought accusative 17:42:11 yeah 17:42:48 i suspect "de" should be replaced with genitive 17:42:57 or something 17:43:09 Are you aiming for latin? 17:43:11 that gets beyond my actual knowledge, i think 17:43:25 b_jonas: i think so 17:43:40 `? welcome.la 17:43:41 welcome.la? ¯\(°​_o)/¯ 17:43:57 `benvenite 17:43:57 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: benvenite: not found 17:44:00 `` ls wisdom/*enve* 17:44:01 wisdom/bienvenue 17:44:15 `` ls bin/*enve* 17:44:16 bin/arienvenido \ bin/benvenuto \ bin/bienvenido 17:44:32 `benvenido 17:44:33 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: benvenido: not found 17:44:36 `benvenuto 17:44:37 welcome.it? ¯\(°​_o)/¯ 17:44:49 `bienvenido 17:44:49 ​¡Bienvenido al centro internacional para el diseño y despliegue de lenguajes de programación esotéricos! Por desgracia, la mayoría de nosotros no hablamos español. Para obtener más información, echa un vistazo a nuestro wiki: http://esolangs.org/. (Para el otro tipo de esoterismo, prueba #esoteric en EFnet o DALnet.) 17:44:51 hmph 17:45:08 the spanish one is the only non-english one that sees serious use 17:45:17 because of the canaimas 17:45:31 `? canaimas 17:45:32 canaimas? ¯\(°​_o)/¯ 17:46:47 `` grep -i anaima wisdom/* 17:46:49 grep: wisdom/le: Is a directory \ grep: wisdom/¯\(°_o): Is a directory \ grep: wisdom/¯\(°​_o): Is a directory \ Binary file wisdom/reflection matches 17:46:56 bah 17:47:03 `` grep -Ri anaima wisdom/* 17:47:05 `` rgrep -i anaima wisdom # hth 17:47:06 Binary file wisdom/reflection matches 17:47:07 No output. 17:47:34 is there a difference between rgrep and grep -R 17:47:37 no 17:47:43 but there's a difference between wisdom and wisdom/* 17:49:10 `mk wisdom/welcome.sv//Hej och välkommen till den internationella knutpunkten för esoterisk programmeringsspråksdesign och -driftsättning! För mer information, se vår wiki: . (För den andra sortens esoterism, pröva #esoteric på EFnet eller DALnet.) 17:49:12 wisdom/welcome.sv 17:49:19 `? welcome.sv 17:49:20 Hej och välkommen till den internationella knutpunkten för esoterisk programmeringsspråksdesign och -driftsättning! För mer information, se vår wiki: . (För den andra sortens esoterism, pröva #esoteric på EFnet eller DALnet.) 17:49:33 `os 17:49:33 os 17:49:44 `cat bin/os 17:49:44 ​#!/bin/bash \ echo "$0" | sed -e 's_.*/__' 17:50:04 wat 17:50:22 `culprits bin/os 17:50:24 `run ln -s os bin/wat 17:50:24 tswett tswett tswett tswett 17:50:25 No output. 17:50:27 -!- zzo38 has quit (Remote host closed the connection). 17:50:27 `wat 17:50:28 wat 17:50:38 `rm bin/wat 17:50:41 No output. 17:51:18 `rm wisdom/välkommen 17:51:21 No output. 17:51:34 i think wisdom.?? scales better 17:51:49 * welcome.?? 17:52:37 `` rgrep kommen bin/ 17:52:42 No output. 17:52:45 "welcome.no" gives out bit of mixed signals for English speakers, though. 17:53:06 welcome.norvenskuomi 17:54:13 I guess you can have welcome.nb and welcome.nn separately. 17:54:40 ooh 17:56:18 have you considered /nick oohrjan twh 18:01:02 noo 18:01:40 i am hitting a roadblock here: i have no idea what, if any, is the norwegian word for software deployment. 18:03:20 hm there are hits for "driftssetting" but too few of them 18:03:46 oh an s too much 18:03:50 is there a word for "software"? 18:04:49 hm "idriftsetting" has slightly more hits than that again 18:05:01 int-e: erm... 18:05:17 "programvare" usually 18:05:29 Oh, we have "aufsetzen", hmm, but it's really derived from "setup", I'm afraid. 18:05:58 oerjan: ah, better than german. (we have Programme, but a collection of those would just be software, I think) 18:06:14 oh "idriftsettelse 18:06:16 " 18:06:28 except that would obviously be bokmål only, hm... 18:06:59 (Historically, "program" *may* have come from german? I wonder how to check that...) 18:08:43 -!- fractal has quit (Quit: ZNC - http://znc.in). 18:09:50 oerjan: Oh and brainfuck, I also feel that checking for a non-zero remainder after dividing by 2 may be impossible with 3 cells; after all this inability of getting information out of a division loop is what makes Fractran and related languages such an attractive target (because you can cheat, undoing speculative multiplications all the time) 18:12:28 applying the same trick to I/O, if you add a special output character that means "please disregard the last character" (something like backspace), that should "solve" the problem. 18:15:05 -!- Vorpal has quit (Ping timeout: 252 seconds). 18:15:15 yes, i also realized that you can interleave junk output 18:16:44 -!- Vorpal has joined. 18:23:27 -!- S1 has quit (Quit: We are the revolutionaries). 18:49:46 -!- fractal has joined. 18:59:19 -!- hppavilion[1] has joined. 19:02:17 do you guys know this? http://spritesmods.com/?art=rapidisnake 19:03:23 video on page 5 19:04:45 -!- `^_^v has quit (Ping timeout: 250 seconds). 19:05:21 -!- x10A94 has quit (Quit: I'm outta here). 19:06:06 -!- `^_^v has joined. 19:08:42 izabera: heh 19:08:59 heh indeed 19:16:47 -!- ais523 has joined. 19:20:07 -!- heddwch has changed nick to Frankenheimer. 19:21:09 -!- MDream has changed nick to MDude. 19:23:24 would you guys expect a smart compiler to compute strlen every time in that loop? http://arin.ga/dpDMHa/raw 19:23:46 both gcc and clang do 19:26:07 -!- FreeFull has quit (Quit: BBS). 19:26:14 -!- Frankenheimer has changed nick to frankenstein. 19:26:25 -!- frankenstein has changed nick to hethuh. 19:28:56 -!- hethuh has changed nick to hedwig. 19:29:24 -!- hedwig has changed nick to heddwch. 19:32:27 -!- FreeFull has joined. 19:40:59 izabera: /me looks 19:41:43 hmm, is the compiler allowed to assume that i isn't an element of argv[1]? 19:41:59 By strict aliasing, yes. 19:42:02 I think it is because i is a local variable, and possibly also because it has the wrong type (not sure on that one) 19:42:25 I don't think it's allowed to assume getchar doesn't modify what argv points to, at least from general principles. 19:42:29 is it also allowed to assume that putchar doesn't change argv? I think no, unless it has putchar special-cased 19:42:35 right, yes 19:42:47 I think the compiler can't assume what getchar/putchar do to main's arguments 19:43:02 actually, you could probably use setvbuf to shift the stdio buffer into memory you controlled 19:43:09 and then recursively call main using the same buffer as part of argv 19:43:18 I… think I may have a new IOCCC idea 19:48:09 Environment variables are stored near to the program arguments 19:51:58 to be a proper IOCCC entry I can't rely on system-specific things 19:52:06 but I can definitely store things in stdio buffers 19:52:45 cycles.json went from 227428 to 347439 bytes when I added -1/0/1 numbers for all pairs/rounds in preparation for indicating the winner. 19:53:08 that's not that bad 19:53:40 -!- hppavilion[1] has quit (Ping timeout: 246 seconds). 19:55:02 -!- nycs has joined. 19:55:57 -!- `^_^v has quit (Ping timeout: 246 seconds). 20:00:20 sorry i was away 20:00:32 ais523: thanks for that 20:02:05 ais523: putchar takes an int, not a pointer. how can that possibly change argv[1] ? 20:02:43 izabera: putchar writes to a stdio buffer 20:03:06 the buffer isn't written to the screen immediately unless you do something to flush it (by default, this is writing '\n', but it's customizable) 20:03:20 i see where you're going 20:03:32 izabera: now, suppose you call main recursively; you can give it a pointer to the stdio buffer (which is potentially under user control) in its argv 20:03:33 it's awful 20:03:44 yes but... i don't 20:03:46 there's no rule in C saying you /can't/ do this 20:04:08 and your program could potentially be linked against a separate library that contains a recursive call to main (say you link against a custom libc) 20:04:17 so the compiler doesn't have enough information to know that you're not going to do that 20:04:22 and has to play it safe 20:04:42 GCC has attributes you can use to mark "pure" functions, of which more assumptions can be made. (Of course, putchar can't be one.) 20:04:50 i see 20:06:17 * izabera scratches her head 20:06:28 restrict was invented for this, too 20:06:47 if main's second argument was char *restrict *, then it'd know that argv isn't aliasing any global (including stdout) 20:06:55 *if main's second argument were 20:08:51 doesn't seem to change anything 20:23:46 ais523, hm good IOCCC idea, but what would you use it for that is interesting though? 20:23:52 no idea yet 20:24:08 maybe some sort of scanf-based logic 20:24:51 ais523, oh yeah, you could scanf from and into that same buffer (possibly different parts of it) 20:25:48 As long as you provided long enough arguments for there to be enough buffer to work with 20:26:09 good night 20:28:39 ais523, btw, how goes feather? Or is it dead? 20:28:40 XD 20:28:55 Vorpal: it's no more dead than before 20:28:58 I think about it occasionally 20:29:14 The Underlambda Project actually shares some similarities with Feather, but is less insane 20:29:16 Fair enough 20:29:36 But underlambda is also not done, right? 20:30:06 indeed 20:30:19 huh, you actually remember what underlambda is? nobody else seems to :-P 20:30:54 over the years I've really made progress in pinning down the details, though 20:31:01 I've just assumed -- from the name -- that it'd be (unlambda + underload) / 2. 20:31:11 I even found a way to do subtraction that I'm happy with 20:31:24 fizzie: that's the etymology, and it's not a bad description 20:31:26 ais523, I don't remember how it works no 20:31:31 but the resulting language is higher-level than that description would imply 20:31:31 http://zem.fi/bfjoust/vis/cycles/ now shows the winner in the subgraph. 20:31:33 I remember that it is a thing though 20:31:37 fizzie: thanks :-) 20:31:53 If it looks strange, I might ha... actually, I did. 20:32:03 Yeah, one half of the scores are the wrong way around. 20:32:22 fizzie, that is a blank page for me below the text? 20:32:36 And no, not adblock or noscript 20:34:16 good night 20:34:19 It might not be all that cross-platform. 20:34:37 fizzie, chromium on Debian wheezy 20:35:07 Checking firefox 20:35:19 Okay that works 20:36:40 I'm using Chromium on Debian [something], too. 20:37:02 (Chromium 45.0.2454.85.) 20:37:09 fizzie, nope, the graph doesn't show up there 20:37:17 Version 37.0.2062.120 Built on Debian 7.6, running on Debian 7.9 (281580) (64-bit) 20:37:21 fizzie, quite a bit older 20:37:27 Since I'm still running oldstable 20:37:34 Need to update to stable 20:37:46 At some point, good night for real now *turns off monitor* 20:37:46 Mm. I may have inadvertently relied on something modern somewhere. 20:38:04 I think d3 should be relatively portable, though, since it's so popular, so it's probably something I did. 20:41:35 fizzie: ooh, new visualisation idea: current position for each warrior at the end of the match 20:42:00 would be nice to see how "far" the loser got through the winner's decoys 20:43:20 I could do some sort of a summarizer. You can of course see individual ones with the egojsout viewer. 20:43:50 indeed, it's the summary that's more interesting 20:44:08 I'm not sure what you'd want to average over: opponents and tape lengths are the obvious things to average over though 20:48:34 fizzie: it doesn't work in IE 11 either hth 20:48:57 oerjan: Does it just not show up? 20:49:17 yeah, nothing below the text 20:49:40 well except space 20:50:12 Hrm. 20:50:24 I'll test it when I boot to Windows next. In fact, could do that now. 20:50:37 I've been thinking about going 10, despite everything. 20:54:52 as long as you stay away from the edge 20:55:01 Microsoft Edge, that is 21:01:31 Oh, Math.log10 was something very new, it seems. 21:01:48 -!- Patashu has joined. 21:02:01 Works from Chrome 38 onwards; Vorpal managed to pick the newest non-working Chrome. 21:04:01 I'll patch it in when I'm next *away* from Windows. This dual boot thing is kind of inconvenient. I have git here in Winland, but not e.g. the SSH keys for uploading a fixed version, or rsync... wait, since when do I have rsync? 21:04:33 Also the console is bash. Am I actually in Windows at all? 21:04:51 I guess I've made an effort to make this feel homely. 21:06:08 why even boot windows? 21:07:12 Games maybe twice a year, in my case. 21:07:49 there are plenty of games for linux 21:08:13 They're the wrong ones. 21:09:47 I think about half of my Steam library is Windows-only. Can't recall the exact number. 21:16:18 -!- nycs has quit (Ping timeout: 260 seconds). 21:23:15 [wiki] [[Special:Log/newusers]] create * GoogolPlanck * New user account 21:24:54 -!- oerjan has quit (Quit: Nite). 21:38:16 [wiki] [[Symball]] N http://esolangs.org/w/index.php?oldid=44194 * GoogolPlanck * (+26) Created page with "== Syball == == Symball ==" 21:38:33 -!- MercurialHg has joined. 21:42:56 -!- AnotherTest has quit (Quit: ZNC - http://znc.in). 21:45:26 -!- Patashu has quit (Ping timeout: 240 seconds). 21:47:47 -!- Protheus_ has joined. 21:51:24 -!- MercurialHg has quit (Ping timeout: 264 seconds). 21:51:38 -!- Protheus_ has changed nick to MercurialHg. 21:52:02 http://www.telegraph.co.uk/news/science/space/11856221/Humans-may-accidentally-send-aliens-a-computer-virus.html wtf? 21:52:04 What? 21:52:44 I mean, I guess poorly designed alien equipment might malfunction if it interprets signals from space as machine code because aliens are idiots, but... a virus? 21:57:28 i'm too lazy to make the independence day joke 21:59:05 [wiki] [[Symball]] http://esolangs.org/w/index.php?diff=44195&oldid=44194 * GoogolPlanck * (+3020) 22:00:52 what's a polite way to tell your healer that it's not ok to disconnect in the middle of a dungeon 22:01:14 [wiki] [[Language list]] http://esolangs.org/w/index.php?diff=44196&oldid=44166 * GoogolPlanck * (+14) /* S */ 22:03:34 meanwhile 22:03:51 for some reason when i middle click in chrome it opens anywhere from one to four new tabs 22:04:07 it's very exciting 22:05:36 I made the mistake of reading comments on a news site 22:08:38 -!- boily has joined. 22:14:52 My left click sometimes doubleclicks on its own, so I get 1-2 tabs when ctrl-clicking. 22:16:27 fizziello. middle click? 22:16:48 boily: It also drops items when dragging. 22:17:01 -!- Wright has joined. 22:17:06 And the right click only clicks on every third or so attempt. 22:17:11 ... 22:17:28 that is quite suboptimal. 22:17:49 -!- ais523 has quit (Ping timeout: 252 seconds). 22:17:51 Well, the new mouse from Amazon instead scrolls on its own when in the free-spinning mode I've gotten very used to. 22:18:08 The scroll wheel has an orientation it likes, and it returns to it by gravity. 22:18:28 Scrolling up to a page's worth up and down after every operation, depending on the angle it was left at. 22:18:56 And the replacement for that is somewhere in France, and will be delivered a week from now, even though they said they'll use the fastest possible shipping method. 22:19:29 fizzie's suboptimouse. 22:20:21 I've heard "The House of the Mouse" is a term people use of the Disney corporation. 22:22:35 fizzie, finnish deliveries are low-priority and don't occasion the use of a plane 22:22:37 or boat 22:22:40 or car 22:22:43 or bicycle 22:25:19 Phellontom_Hoover. 22:25:36 are you saying Finnish deliveries are made by foot? 22:25:42 or by submarines? 22:25:49 or by ICBM? 22:26:01 motorbike 22:26:13 trains 22:26:32 trikes 22:27:10 unicycles would be awesome 22:27:28 would be? unicycles are real 22:27:35 i'd appreciate someone in the front of my door on a unicycle with a package for me 22:28:05 olsner: i mean as a delivering tool 22:28:27 there are also unitandems, that would be even more awesome 22:29:12 mynamello. 22:29:15 unitandems? 22:29:28 unitandems. 22:51:11 -!- atrapado has quit (Quit: Leaving). 23:16:59 gVd Eving 23:17:14 -!- MercurialHg has quit (Quit: Leaving). 23:18:40 it's not Evning? 23:18:42 [wiki] [[Symball]] M http://esolangs.org/w/index.php?diff=44197&oldid=44195 * GoogolPlanck * (+1) /* Docs */ 23:19:21 wAt, Dat SVd bE EvniG 23:30:15 symball is neat. not that special, but slim and you can obfuscate great 23:30:46 i am temoted to write symball code that is valid with two different reading offsets 23:31:02 *tempted 23:37:08 helloren_! 23:37:32 is that some kind of klingonified English spelling? 23:47:57 klingon? 23:47:59 no 23:48:32 http://www.orenwatson.be/speliG.htm