2019-08-01: 00:05:46 -!- adu has quit (Quit: adu). 00:44:34 So it turns out writing machine code can be kind of tedious. 01:43:53 [[Your Pillows]] N https://esolangs.org/w/index.php?oldid=64877 * A * (+1073) Created page with "[[Your Pillows]] are [[esoteric programming language]]s directly based off pillows. It is somehow influenced by [[Brace For Impact]] and [[Beatnik]]. ==Syntax of your pillows=..." 01:55:50 [[Ummm...]] M https://esolangs.org/w/index.php?diff=64878&oldid=59008 * A * (+190) 01:56:22 -!- adu has joined. 01:57:33 [[Your Pillows]] M https://esolangs.org/w/index.php?diff=64879&oldid=64877 * A * (+197) /* Instructions */ 02:04:41 -!- FreeFull has quit. 02:35:00 `? password 02:35:01 The password of the month is int-e's job. 02:41:11 `learn The password of the month is surprising. 02:41:14 Relearned 'password': The password of the month is surprising. 03:21:35 [[Talk:ACL]] https://esolangs.org/w/index.php?diff=64880&oldid=64862 * JonoCode9374 * (+138) /* Python Interpreter */ 03:23:49 [[ACL]] https://esolangs.org/w/index.php?diff=64881&oldid=64870 * JonoCode9374 * (+449) /* Technical Regarding Interpreter */ Python interpreter done! 03:26:32 -!- xkapastel has quit (Quit: Connection closed for inactivity). 04:36:50 -!- doesthiswork has quit (Ping timeout: 248 seconds). 06:11:29 [[User talk:A]] M https://esolangs.org/w/index.php?diff=64882&oldid=64766 * A * (-13424) Remove all of them; it is always visible in the page history. 06:12:11 [[User talk:A]] M https://esolangs.org/w/index.php?diff=64883&oldid=64882 * A * (+632) /* Blocked */ 06:12:44 [[User talk:A]] M https://esolangs.org/w/index.php?diff=64884&oldid=64883 * A * (+3) /* Game */ 06:14:21 [[User talk:A]] M https://esolangs.org/w/index.php?diff=64885&oldid=64884 * A * (-337) /* Game */ 06:23:53 [[User talk:A]] M https://esolangs.org/w/index.php?diff=64886&oldid=64885 * A * (+905) /* Game */ 06:24:09 [[User talk:A]] M https://esolangs.org/w/index.php?diff=64887&oldid=64886 * A * (+17) /* One */ 07:34:08 -!- Sgeo_ has joined. 07:37:07 -!- Sgeo__ has quit (Ping timeout: 245 seconds). 07:37:20 -!- adu has quit (Read error: Connection reset by peer). 07:38:02 -!- adu has joined. 07:59:01 -!- Frater_EST has joined. 08:05:10 -!- Lord_of_Life has quit (Ping timeout: 272 seconds). 08:05:30 -!- Lord_of_Life has joined. 08:09:29 [[User talk:A]] M https://esolangs.org/w/index.php?diff=64888&oldid=64887 * A * (+1170) /* One */ 08:11:49 [[User talk:A]] M https://esolangs.org/w/index.php?diff=64889&oldid=64888 * A * (+24) /* Game */ 08:35:52 -!- cpressey has joined. 08:36:03 [[Deadfish Joust]] N https://esolangs.org/w/index.php?oldid=64890 * A * (+1732) Created page with "[[Deadfish Joust]] is a [[deadfish]]-based game, consisting of two contestants who attempt to modify an accumulator to make the accumulator as close to their value as possib..." 08:39:44 -!- Frater_EST has left. 08:40:07 [[ACL]] https://esolangs.org/w/index.php?diff=64891&oldid=64881 * Hanzlu * (+0) 08:41:16 [[User talk:A]] https://esolangs.org/w/index.php?diff=64892&oldid=64889 * A * (-2414) /* Game (code golf in deadfish) */ 08:47:33 [[Talk:Deadfish Joust]] N https://esolangs.org/w/index.php?oldid=64893 * JonoCode9374 * (+208) Created page with "= Contest controller = I might try and make a simple offline controller in python. ~~~~" 08:56:15 [[Talk:ACL]] https://esolangs.org/w/index.php?diff=64894&oldid=64880 * Hanzlu * (+721) /* Python Interpreter */ 08:57:25 [[ACL]] https://esolangs.org/w/index.php?diff=64895&oldid=64891 * Hanzlu * (+40) 08:59:13 Good morning. How is brainfuck not a concatenative language? 09:00:14 Instead of taking a stack to a stack, each function takes (tape, control context) -> (tape, control context) 09:00:59 (I actually see where this breaks down, but it's interesting to think about nonetheless) 09:06:12 cpressey: have you seen https://esolangs.org/wiki/Pure_BF 09:07:22 Taneb: Not sure. Maybe, a long time ago. 09:08:13 So to do anything interesting with control context in a concatenative language, do you need to support storing function values somehow in the state that your functions work on? 09:12:03 I think the answer is "yes" in some weak sense 09:12:26 There is probably a lot of wiggle room in "somehow" 09:12:53 There's also some room in "interesting" 09:15:54 Indeed 09:16:19 And even "concatenative" - I get the impression that a lot of concatenative languages are purely so 09:16:24 *aren't 09:23:21 How about "second-order concatenative" - you have functions (stack -> stack), in monoids, but these monoids are embedded in an "outer" monoid where the functions are ((stack -> stack) -> (stack -> stack)) 09:23:58 Pure BF++ 09:28:27 You could make it "look concatenative" by having the inner monoids seperated by a single | character or something (rather than being enclosed in some kind of brackets, which seems more conventional) 09:28:55 : and ; count as brackets, if you're Forth 09:30:40 [[Talk:ACL]] https://esolangs.org/w/index.php?diff=64896&oldid=64894 * JonoCode9374 * (+349) 09:44:15 [[Talk:ACL]] https://esolangs.org/w/index.php?diff=64897&oldid=64896 * Hanzlu * (+59) 09:47:15 Or maybe there are two disjoint sets of characters, "inner" and "outer". 09:47:22 [[Talk:Deadfish Joust]] M https://esolangs.org/w/index.php?diff=64898&oldid=64893 * A * (+171) 09:47:41 The (stack -> stack) functions also need to... be stacked in a stack or something 09:48:01 Not sure 09:48:07 This might be worth working out 09:48:35 [[Deadfish Joust]] M https://esolangs.org/w/index.php?diff=64899&oldid=64890 * A * (+27) 09:50:28 [[Language list]] M https://esolangs.org/w/index.php?diff=64900&oldid=64796 * A * (+19) /* Y */ 09:51:33 [[Joke language list]] M https://esolangs.org/w/index.php?diff=64901&oldid=64561 * A * (+75) /* General languages */ 09:54:42 [[Deadfish Joust]] M https://esolangs.org/w/index.php?diff=64902&oldid=64899 * A * (+294) 09:57:47 [[Deadfish Joust]] M https://esolangs.org/w/index.php?diff=64903&oldid=64902 * A * (+166) 09:59:27 [[Deadfish Joust]] https://esolangs.org/w/index.php?diff=64904&oldid=64903 * A * (+66) /* Typing */ 10:03:21 [[Deadfish Joust]] https://esolangs.org/w/index.php?diff=64905&oldid=64904 * A * (+17) /* Typing */ 10:04:59 [[User:Hanzlu]] https://esolangs.org/w/index.php?diff=64906&oldid=64876 * Hanzlu * (+215) 10:05:23 -!- FraterEST has joined. 10:05:37 -!- FraterEST has left. 10:09:36 [[ACL]] https://esolangs.org/w/index.php?diff=64907&oldid=64895 * Hanzlu * (+118) 10:20:34 The second-order functions don't need to be stacked, there just needs to be a second-order identity function that can be second-order composed with other second-order functions 10:21:22 cpressey: is this related to higher dimensional category theory? 10:21:35 As soon as you see an "outer" character (representing a second-order function) you take all the first-order functions that you have been collecting so far ("inner" characters) and make a second-order function out of it 10:22:06 Taneb: not to my knowledge 10:22:26 I'm sure someone could *make* it related to that if they tried hard enough 10:23:49 -!- wob_jonas has joined. 10:24:51 ``` card-by-name "$(ping)" 10:24:52 Pongify \ U \ Instant \ Destroy target creature. It can't be regenerated. Its controller creates a 3/3 green Ape creature token. \ PLC-U, C14-U 10:26:51 [[ACL]] https://esolangs.org/w/index.php?diff=64908&oldid=64907 * Hanzlu * (-65) 10:29:35 A monoid is a category with one object. Maybe this is a category with two objects. 10:30:07 That would be my bet, but I don't like category theory so I tend not to think in those terms. 10:33:59 [[Smalllang]] N https://esolangs.org/w/index.php?oldid=64909 * A * (+1381) Created page with "[[Smalllang]] is a joke [[esoteric programming language]] created in order to fullfill [[User:Hanzlu]]'s definition of a usable language, as it tries its best to make itself..." 10:35:41 Hmm, it's kind of like a 2-monoid (by analogy with 2-category) 10:42:12 ``` cd wisdom; find -type f -printf "%s %p\n" | sort -n # shortest wisdoms 10:47:29 https://cemulate.github.io/the-mlab/ is just as good as the nLab as far as I'm concerned. 10:58:39 -!- wob_jonas has quit (Quit: Ping timeout (120 seconds)). 11:03:44 [[Hello world program in esoteric languages]] https://esolangs.org/w/index.php?diff=64910&oldid=64179 * Hanzlu * (+160) 11:05:43 `cwlprits nak 11:05:45 oerjän oerjän 11:05:52 `cwlprits output 11:05:54 oerjän oerjän oerjän olsnër 11:06:01 odd. 11:06:07 `hwrl nak 11:06:09 https://hack.esolangs.org/repo/log/tip/wisdom/nak 11:21:10 [[User:Hanzlu]] https://esolangs.org/w/index.php?diff=64911&oldid=64906 * Hanzlu * (+155) 11:29:47 [[Joke language list]] M https://esolangs.org/w/index.php?diff=64912&oldid=64901 * A * (+50) 11:30:37 [[Smalllang]] https://esolangs.org/w/index.php?diff=64913&oldid=64909 * Hanzlu * (+454) 11:31:18 [[Smalllang]] https://esolangs.org/w/index.php?diff=64914&oldid=64913 * Hanzlu * (-2) 11:32:57 I think the category is just called 2; two objects a, b and a single non-identity arrow a -> b 11:33:46 I *guess* that arrow corresponds to lifting a (S->S) into a ((S->S)->(S->S)) in this case 11:35:13 Unless...? Maybe there are more arrows than these here 11:41:58 cpressey: hmpf. I thought 2 has no arrow at all 11:42:04 (non-identity) 11:42:31 int-e: there seems to be some controversy about that: https://math.stackexchange.com/a/1227142 11:42:41 Not that I care much. I regard category theory as unnecessary obfuscation. 11:43:03 [[Smalllang]] M https://esolangs.org/w/index.php?diff=64915&oldid=64914 * A * (+276) I can still use it to create an infinite loop. (Now I can't.) 11:43:27 (because the only way *I* can make sense of it is to translate everything back into concrete categories) 11:43:59 I definitely prefer thinking in terms of algebraic structures myself 11:44:50 [[Smalllang]] M https://esolangs.org/w/index.php?diff=64916&oldid=64915 * A * (+43) /* Interpreter */ 11:45:07 -!- aloril_ has joined. 11:45:19 and that backtranslation stops working somewhere around natural transformations (probably still just fine) and adjoint functors :P 11:46:59 If I ever need them I know where to look for them 11:47:08 (I will never, ever need them) 11:47:13 (Famous last words) 11:47:30 [[Smalllang]] https://esolangs.org/w/index.php?diff=64917&oldid=64916 * A * (+69) /* Interpreter */ Error handling 11:47:44 As last words go, these have a good chance of being true at that point... 11:48:08 -!- wob_jonas has joined. 11:48:08 [[Smalllang]] M https://esolangs.org/w/index.php?diff=64918&oldid=64917 * A * (+43) /* Interpreter */ 11:48:41 -!- aloril has quit (Ping timeout: 268 seconds). 11:48:41 `grWp wombat 11:48:43 No output. 11:50:09 . o O ( "Air? Where we're going we won't need ai--" ) 11:53:37 -!- aloril_ has quit (Ping timeout: 268 seconds). 11:54:14 [[Talk:Deadfish Joust]] https://esolangs.org/w/index.php?diff=64919&oldid=64898 * A * (+2) /* Contest controller */ This is indeed odd. 11:55:41 I was thinking there might need to be another arrow, because the result of all this concatenating is going to be a function ((S->S)->(S->S)) but you probably want to run it on some input data, which would be an S, not an (S->S). 11:56:22 You'd want to be able to lift and, uh. Forget? 11:56:50 Or maybe you just lift the input instead 11:57:06 -!- aloril_ has joined. 11:57:42 where is this going, all linear languages are concatenative if you build the parser state into the semantics? 11:58:39 int-e: there was some such parody about that, claiming that x86 assembly was concatenative 12:00:36 I think https://catseye.tc/article/List_of_Unfinished_Interesting_Esolangs#paneer is probably related to that 12:01:40 hmm. all you need is a call-with-current-input 12:02:18 So tromp's BLC is a simple candidate. 12:02:28 I wasn't planning to go anywhere near that far with this idea, I just want a second-order concatenative language right now 12:03:18 [[Smalllang]] M https://esolangs.org/w/index.php?diff=64920&oldid=64918 * A * (+29) /* Instructions */ 12:03:47 [[Smalllang]] M https://esolangs.org/w/index.php?diff=64921&oldid=64920 * A * (+0) /* Instructions */ 12:03:58 [[BLC]] N https://esolangs.org/w/index.php?oldid=64922 * Int-e * (+36) add redirect for semi-common abbreviation 12:04:08 I'd still like to see a language that is based on SKI calculus, the way that unlambda is, but uses something like Haskell's IO to do interactive IO 12:05:36 [[Smalllang]] M https://esolangs.org/w/index.php?diff=64923&oldid=64921 * A * (+12) /* Instructions */ 12:06:42 wob_jonas: Would you be willing to settle for it being a DSL embedded in Haskell? 12:07:51 cpressey: I don't know, haskell being typed could be a problem. I'd like some basis of combinators (not necessarily SKI specifically) to be trivial to translate into it 12:08:09 cpressey: The point I had in mind with BLC is that it's specified with a binary stream as input; the program is parsed from that input and the remaining input is passed to that program, so it already has "call with current input" built in. 12:08:10 without getting type errors 12:08:12 I wrote a SKI interpreter in Haskell once but I've never been confident it's correct because I've never found a good collection of tests cases for SKI terms 12:09:01 yeah, nobody writes actual programs for those 12:09:23 perhaps some of the ones from the unlambda quine competition could help, but they use side effects so depend on the order of evaluation 12:09:25 I used to occasionally 12:09:25 (Also, any concrete definition of (a) Kolmogorov complexity will probably have the same feature.) 12:10:01 cpressey: And I know I'm going off a tangent. 12:12:57 int-e: Maybe not really. Like a TM, you don't really *need* to have input. You start off writing the data you want, onto the tape (or in this case, with a function (S->S) that returns a constant S) 12:14:13 That's not really good for information complexity... there's too much inherent redundancy in Turing Machines themselves. 12:14:17 There was another tanget I was thinking about similar to this regarding infinite programs, and maybe Turing machines with fixed-length input tapes are not a bad idea 12:14:39 So you're better off with just a string that you split into program and input. 12:15:26 (Compared to embedding the input into the program, which may blow up depending on the model of computation.) 12:17:11 I mean one of the properties that you want off Kolmogorov complexity is that the formalism you base it on only changes it by O(1). 12:18:21 (Formalism = a concrete model of computation, which should be Turing-complete.) 12:27:22 What's to stop the program from treating the input as another program though 12:37:10 I think my thought was, the finite control of a TM is defined to be finite, so if you map your program to a TM, you know it's finite and that's fine. You can also map your program to a finite string and feed it as input to a TM, *but*... 12:37:56 ...a TM reads its input from its tape, and its tape is *not* finite, so if you somehow put an infinite program there, it would not reject that. 12:38:16 Or I mean, if it does not ever stop reading that input, you can't really blame it. 12:39:00 Sure, that will happen. 12:41:24 I don't really remember what the implications of this that I cared about were, now. 12:51:18 Overall it has to do with "infinite programs" and whether you accept them or not. Is "the decimal expansion of sqrt(2)+sqrt(3)" an infinite program? 12:51:38 It's an algebraic number, I can communicate it finitely 12:51:57 -!- doesthiswork has joined. 12:52:01 If the interpreter wants to compute decimal digits of it to find out what to do next, that's its perogative 12:52:22 it's an infinite string with finite description complexity 12:52:32 int-e: like most TMs 12:52:41 well, "most" 12:52:49 Chaitin's omega notwithstanding 12:52:54 I see a type mismatch 12:53:09 a) TMs are finite. b) TMs are not strings. 12:53:39 Anyway, Chaitin only allows finite programs. 12:53:56 Usually when I write down a TM it's a string 12:54:24 BUt I think there's some confusion here 12:54:52 And I think we're in a corner where it's valuable to be more precise. 12:55:24 OK. You can identify TMs with their finite descriptions. You can also identify them with the (sometimes) infinite string they write on their tape when you run them. 12:56:21 So... the picture I have in mind is this: a) we have a Turing-complete model of computation. b) we have a prefix-free encoding of programs for that model. c) we consider strings p i where p is a program and i is the program's input. 12:57:14 We also want all programs to be encoded so by König's lemma there are infinite strings that do not have a program as a prefix. Those are not infinite programs; they're just garbage :P 12:58:52 (And all this happens over some fixed finite alphabet. {0,1} is a neat choice.) 12:59:14 [[ACL]] https://esolangs.org/w/index.php?diff=64924&oldid=64908 * Hanzlu * (+119) 12:59:28 * int-e is glossing over details like the map from the strings p to programs being effectively computable... 13:00:04 cpressey: how would the latter work? there are different turing machines that write different strings when they get no input 13:00:37 huh... why am I yellow now? 13:01:49 oh I see, I'm yellow in webchat, but still bluish gray in the esolangs.org logs 13:01:57 -!- wob_jonas has changed nick to lob_jonas. 13:02:42 wob_jonas: I only mean "for each TM you can look at the infinite string it produces" - I mean "sqrt(2)+sqrt(3)" and "sqrt(3)+sqrt(2)" generate the same infinite string of digits too 13:03:12 cpressey: yeah, but you said "identify" 13:03:15 Given the infinite string, you don't know which of those finite strings produced it. 13:03:31 lob_jonas: fine, I didn't mean identify, I'm sorry 13:03:42 Yeah, identifying TMs with their output lands you in Rice territory. 13:03:49 wa 13:04:00 "associate"? 13:04:06 ->, not <-> 13:04:25 I don't think it matters because I don't think I'm talking about what int-e is talking about :) 13:04:28 I prefer => or |> or |-> for that 13:04:37 but admittedly some programming languages abuse -> for this 13:04:48 at least Haskell is prudent enough to put a backslash before 13:04:54 :> also works 13:05:44 cpressey: nobody wrote "associate"?? 13:05:55 cpressey: I mean except for you, and now me... 13:06:06 int-e: I was trying to think of a word that would have been better for me to use, than "identify" 13:06:20 ah. 13:06:41 Yeah I probably wouldn't have objected to that :) 13:10:00 In a sense, yhe only infinite programs you need to worry about, are those that are uncomputable, because if they're computable, you can devise a TM to compute them, and write that TM as a finite string, and there's your finite program. 13:11:25 "In a sense" probably includes "If you're not also worrying about Kolmogorov complexity" in its meaning here 13:17:27 `? in a sense 13:17:28 in a sense? ¯\(°​_o)/¯ 13:19:32 I guess in a wisdom context we need to clarify which of the 5 senses we're talking about. 13:20:27 Balance 13:20:35 Right and wrong 13:24:19 `card-by-name Balance 13:24:20 Balance \ 1W \ Sorcery \ Each player chooses a number of lands they control equal to the number of lands controlled by the player who controls the fewest, then sacrifices the rest. Players discard cards and sacrifice creatures the same way. \ A-R, B-R, U-R, RV-R, 4E-R, EMA-M, VMA-M, ME4-R, V09-M \ \ Balance of Power \ 3UU \ Sorcery \ If target opponent has more cards in hand than you, draw cards equal to the difference. \ P1-R, P3K-R, 8ED-R 13:25:55 "Right and wrong" is probably a future split spell 13:31:27 . o O ( "Wrong, instant, 1B, choose one: counter target "Right" spell, or put a -1/-1 counter on target creature." / "Right, instant, 1W: Choose one: counter target "Wrong" spell, or: Put a +1/+1 counter on target creature." -- probably unbalanced, but what do you think of the mutual counter spell idea? ) 13:32:06 [[ACL]] https://esolangs.org/w/index.php?diff=64925&oldid=64924 * Hanzlu * (+48) 13:33:49 (It's not meant to be useful either, just for flavor.) 13:35:03 int-e: unbalanced in what sense? just the +1/+1 counter instant half alone would cost (W/G) alone, the other half would cost (B/R), making it a split card makes it a bit better because it gives you the choice, but not so much as to make it too cheap for 1B and 1W 13:35:26 and I think the Right would have to be the left half, strange as it may sound 13:35:44 lob_jonas: I wasn't making a split card though. 13:35:49 oh 13:35:54 then they're definitely overpriced 13:35:58 `card-by-name Scar 13:35:59 Scar \ (b/r) \ Instant \ Put a -1/-1 counter on target creature. \ SHM-C \ \ Scarab Feast \ B \ Instant \ Exile up to three target cards from a single graveyard. \ Cycling {B} ({B}, Discard this card: Draw a card.) \ AKH-C \ \ Scarab of the Unseen \ 2 \ Artifact \ {T}, Sacrifice Scarab of the Unseen: Return all Auras attached to target permanent you own to their owners' hands. Draw a card at the beginning of the next turn's upkeep. \ AI-U \ \ Scarblade 13:36:35 `card-by-name Battlegrowth 13:36:36 Battlegrowth \ G \ Instant \ Put a +1/+1 counter on target creature. \ MRD-C 13:36:43 wait, isn't there one that costs (W/G)? 13:37:24 anyway 13:37:35 `card-by-name Burst of Strength 13:37:36 Burst of Strength \ G \ Instant \ Put a +1/+1 counter on target creature and untap it. \ GTC-C 13:37:48 just G is clearly not too cheap 13:37:56 lob_jonas: I really wanted 'wrong: counter "right" spell' 'right: counter "wrong" spell' - which means they have to be instants. But the cards need another effect to have any use at all. 13:37:58 probably could be done for (W/G) 13:38:23 int-e: yeah, but I still think those names would be reserved for a split spell unless that's proven impossible 13:38:33 I have no clue about balancing in M:tG; I have never played it seriously and I have not played it in the past 8 years. 13:38:45 such nice short names are in a short supply for M:tG, because it wants to live for a long time 13:39:04 [[Talk:Deadfish Joust]] M https://esolangs.org/w/index.php?diff=64926&oldid=64919 * A * (+152) 13:39:10 the Erase (Not the Urza's Legacy One) card makes fun of that 13:40:09 https://esolangs.org/wiki/Sequential_tag_system is (I guess) the reference point for what I was saying. I think that explanation for why infinite programs are justified is more than a little muddy. 13:40:23 (I also arbitrarily thought that "right" should be a white spell and "wrong" a black one :P) 13:40:54 int-e: well, it certainly makes sense that the white spell puts the +1/+1 counter and the black spell puts the -1/-1 counters 13:41:58 int-e: if you want two opposing spells that counter each other, I'd like to point to the ones from Alpha: 13:42:03 `card-by-name Blue Elemental Blast 13:42:05 Blue Elemental Blast \ U \ Instant \ Choose one -- \ • Counter target red spell. \ • Destroy target red permanent. \ A-C, B-C, U-C, RV-C, 4E-C, A25-U, ME4-U 13:42:05 `card-by-name Red Elemental Blast 13:42:07 Red Elemental Blast \ R \ Instant \ Choose one -- \ • Counter target blue spell. \ • Destroy target blue permanent. \ A-C, B-C, U-C, RV-C, 4E-C, A25-U, ME4-U 13:42:40 there's also White Knight and Black Knight, but they don't counter 13:43:05 lob_jonas: thanks for the example 13:44:01 countering itself doesn't happen often in black and white, which is why this pair is red and blue 13:47:12 [[Deadfish Joust]] https://esolangs.org/w/index.php?diff=64927&oldid=64905 * A * (-41) 13:47:50 [[Deadfish Joust]] M https://esolangs.org/w/index.php?diff=64928&oldid=64927 * A * (+16) 13:50:37 -!- ais523 has joined. 13:52:36 [[Talk:Sequential tag system]] N https://esolangs.org/w/index.php?oldid=64929 * Chris Pressey * (+698) Created page with "== Trying to make this more precise == Here are some subsets of the set of all sequential tag systems: * Sequential tag systems that a cyclic tag system can be translated int..." 13:58:27 [[Deadfish Joust]] M https://esolangs.org/w/index.php?diff=64930&oldid=64928 * A * (-294) /* Instructions in deadfish Joust */ 14:04:29 [[Deadfish Joust]] https://esolangs.org/w/index.php?diff=64931&oldid=64930 * A * (+749) 14:04:42 [[Deadfish Joust]] M https://esolangs.org/w/index.php?diff=64932&oldid=64931 * A * (-2) /* Implementation */ 14:15:20 If you have a language that accepts infinite programs and you don't restrict that set of programs to those that have finite descriptions (as e.g. TMs that generate them) you're... not in a place where it makes sense to write TC proofs anymore. 14:17:49 Some CAs need infinite initial configurations to be shown TC. In practice those configurations always have finite descriptions, as far as I have ever seen 14:18:55 I suspect you want an even stronger constraint than "finite" but again, I don't think I've seen any which need extremely complex initial configurations 14:19:14 Sequential tag systems that are expansions of cyclic tag systems are not very complex at all 14:23:12 I imagine anyone who objects to a TC proof by that method, would also object to the very idea of a language that allows infinite programs 14:23:55 Or at least, if they don't, I'd like to hear more about their philosophical views of computation 14:27:28 ais523: This is what I've been ranting about today. Well, this and second-order concatenative languages 14:29:13 cpressey: I have something of a practical objection: people see TCness proofs based on infinite cyclic initial states and then try to use them to prove other languages TC, when those languages can only simulate finitely-nonblank initial states 14:29:47 I've seen so many proofs that try to prove something TC via implementing rule 110 but with the space only finitely initialised… 14:30:19 Is it proven that rule 100 with finite initialisation is not TC? 14:30:44 that said, there's clearly a boundary between acceptable and unacceptable initial states for infiinite programs, the main controversy is about where to put it 14:30:48 ais523: are those proofs fixable by initializing the infinite tape lazily? 14:31:06 lob_jonas: occasionally there's an obvious way to do it, often thare isn't though 14:31:08 *there 14:35:24 I never liked the rule 110 proof. 14:37:53 (To my mind the repeating pattern /extends/ the behavior of the cellular automaton in a non-trivial way, by encoding some special behavior at the boundary of the (properly) populated cells.) 14:39:14 Lazily initializing new cells when the finite but unbounded state needs to be expanded is a better way at looking at many languages (including CA) than saying they have infinite programs. 14:39:25 Imo. 14:39:43 cpressey: fwiw, I put some of my thoughts on the matter into the form of a language: https://esolangs.org/wiki/Along_and_Across 14:41:21 it strikes me that it's dangerous to ever say "X can't be Turing-complete" without a really good argument, and if various AaA variants were proven to be sub-TC it would help make TCness proofs using certain forms of infinite initial states more acceptable 14:42:06 [[Talk:Your Pillows]] N https://esolangs.org/w/index.php?oldid=64933 * Areallycoolusername * (+229) Created page with "[[User: A]], apart from this language being stack-based, how is this language based off of [[Brace For Impact]]? ~~~~" 14:42:11 infinite initial states lead to some weirdness even in the abstract, though, e.g. they make LBAs TC by giving them access to infinite memory 14:42:20 (but that's true even with a blank state) 14:43:02 Is there any other standard proof technique for sub-TCness besides a) reduce to a known sub-TC language and b) solving the Halting problem? 14:43:43 Because that seems a rather sad state of affairs. 14:43:57 +to be 14:44:07 int-e: I'd argue a language that searches for counterexamples to the Riemann hypothesis and does nothing else is obviously sub-TC, yet doesn't fulfil either of those conditions 14:44:31 that said, I'm not sure why I think that way; despite being obviously sub-TC I'm not convined it's true 14:44:51 I guess the issue is that there's no way to provide it with a program to run, even indirectly/ 14:45:12 ais523: Then it's not even a language? 14:45:26 Again this seems to be outside the space where "Turing complete" even makes sense anymore 14:45:33 ais523: so another technique is to prove that there are only finitely many essentially different programs? 14:45:47 [[Deadfish Joust]] https://esolangs.org/w/index.php?diff=64934&oldid=64932 * A * (+138) 14:45:59 lob_jonas: that's a good way to express my thoughts, thanks 14:46:24 cpressey: I guess esolang design is like art, it's very hard to prove that there's /anything/ that isn't an esolang 14:46:38 neither because it's non-esoteric nor because it isn't a language 14:46:39 as in, we have an easy way to tell which of the finitely many classes any program falls into, while we need not know what the program does 14:46:59 lob_jonas: yes, I like that 14:47:21 although, hmm 14:47:36 Some sort of contrapositive Rice's theorem? 14:47:43 think about the language implemented by a truth-machine: it has two programs, 0 and 1, one of them halts, the other one doesn't 14:48:02 assuming you disregard I/O, given any Turing machine program, it's equivalent to one or the other of those two programs 14:48:13 the problem is, of course, that the compile is uncomputable 14:48:26 ais523: yes, that's why it's important that it's easy to tell which program falls into which of our classes 14:48:35 but I think you need to assume the Church-Turing thesis to be able to say that the language is definitely sub-TC 14:48:51 or, hmm 14:49:04 maybe computational class equivalence is relative to the power of your compiler 14:49:19 I can imagine a language that's TC but you can't compile into it in polynomial time 14:49:56 (An Odd Rewriting System might be one of those!) 14:50:12 ais523: That's what I was talking about the other day 14:50:40 cpressey: oh, there were several different but related issues there and I was confused about which specific one you were looking at 14:50:49 I tend to say "reduction" instead of "compiler" 14:50:52 I was thinking about the >polynomial blowup in program size 14:51:04 and thought that's what you meant too 14:51:10 rather than the complexity of the compiler 14:51:22 ais523: Oh right, that's slightly different 14:51:35 ofc, making the output too large to generate in polytime is an easy way to require a >polytime compiler, but there might be other ways 14:51:41 [[Talk:Your Pillows]] M https://esolangs.org/w/index.php?diff=64935&oldid=64933 * A * (+180) 14:52:41 [[Your Pillows]] M https://esolangs.org/w/index.php?diff=64936&oldid=64879 * A * (-25) 14:53:00 for example, can you have a language where you need to be able to solve the subset sum problem to be able to write arbitrary programs in it? 14:53:09 ais523: Can you make a polynomially-expanding clock in AORS? 14:53:23 Obviously you can make exponential and constant-period ones 14:54:01 [[Your Pillows]] M https://esolangs.org/w/index.php?diff=64937&oldid=64936 * A * (+118) 14:54:23 [[Talk:Your Pillows]] M https://esolangs.org/w/index.php?diff=64938&oldid=64935 * A * (+14) 14:55:31 cpressey: hmm… you can easily create a polynomially-widening bit of code, I can't see an obvious way to make that into a clock though 14:55:38 [[Talk:Your Pillows]] M https://esolangs.org/w/index.php?diff=64939&oldid=64938 * A * (+66) 14:56:25 unless… what if each such section of code were single-use, and triggered a copy of itself (which had since grown a little)? 14:56:31 maybe it is possible 14:58:47 [[Your Pillows]] M https://esolangs.org/w/index.php?diff=64940&oldid=64937 * A * (+0) 14:59:58 the idea would be to start with some code that generates a static tape pattern like abaaaabbaaaaaaaaabbbbaaaaaaaaaaaaaaaabbbbbbbb… (that should be fairly easy, I think); the 'a's grow polynomially, the 'b's exponenntially 15:00:43 [[Talk:Your Pillows]] M https://esolangs.org/w/index.php?diff=64941&oldid=64939 * A * (-28) 15:00:44 when receiving an oddness signal from the left, a 'b' repeats it on the next cycle, then deletes itself if it didn't see such a repeat from its left 15:02:09 I did manage to convince myself that a constant-period clock wouldn't work, because you at some point have more cells than the period, so need to re-use communication channels whos previous values you want to ignore, but the only operation you have is XOR, so you can't. 15:02:13 then we have a second type of oddness signal that the 'a's use to communicate; if they see the first type of signal and it isn't immediately repeated, they all change into an alternative state that sends the second signal every cycle until they didn't see it on their left the previous cycle 15:02:48 oh, we also need a 'c' to the left of the 'b's which generates the first sort of signal once when the second sort stops 15:03:02 So you need to generate "clear channels". At the same time, you don't need to generate an exponential number of them. Only linear in the number of cells, probably, or at worst n^2 15:03:09 that produces a polynomially-growing clock but with exponentially-growing code 15:05:12 ugh, doesn't work directly, the 'a's interfere with each others' signals 15:05:33 you can still make it work but you need the blocks of 'a's to have exponentially-growing width too 15:05:49 and then you might not be able to generate them fast enough 15:07:13 AORS is really unintuitive, there are a lot of operations that seem trivial but then you try to implement them and they don't work 15:07:52 If the string grows expoenentially then it takes exponential time if you measure processing each character, which is probably the way you should measure it 15:08:36 In other news, the computational class example in AaA reminds me of the proof that the emptiness of the intersection of two CFLs is undecidable 15:08:46 But this is a CFL and a regular language 15:09:12 The intersection of a CFL and a regular language is context-free, if I am not mistaken 15:09:18 stupid question. have I ever written a python quine? 15:09:37 lob_jonas: you're likely in a better place to answer that question than anyone esle is 15:09:49 yeah 15:09:54 if it helps, I know that /I've/ written a python quine, but that doesn't really answer the question 15:10:08 I think I haven't, at least not a non-empty one 15:10:13 I'll fix that now 15:11:08 most, maybe all, of my Python quines have been polyglots 15:16:04 ais523: Actually I think AaA is Turing-complete because mu-calculus 15:16:11 if you follow me 15:16:42 I don't know the mu-calculus well enough to follow 15:16:43 You're searching for the smallest integer that fulfils some primitive condition. 15:17:11 in the FSM/FSM version, I'm searching for the smallest integer whose digitis match a particular regex 15:17:48 or, well, I'm regexing consecutive integers to produce a list of results, then trying to determine if those results match a particular regex 15:17:58 Sorry apparently the word "calculus" is not standard for it 15:18:09 https://en.wikipedia.org/wiki/%CE%9C-recursive_function 15:18:51 "Intuitively, minimisation seeks—beginning the search from 0 and proceeding upwards—the smallest argument that causes the function to return zero; if there is no such argument, the search never terminates." 15:19:20 If you add that operator to PR you get RE (i.e. it's Turing-complete) 15:19:35 I don't know the weakest system you could add that operator to and get something TC 15:19:45 [[Brace For Impact]] https://esolangs.org/w/index.php?diff=64942&oldid=64875 * Areallycoolusername * (+1436) 15:19:46 But I don't know of anything requiring it to be as powerful as PR 15:20:10 `python3 -cfor k in 3,1,0,0,1,2,1,0,1,1,2,1,2,1,2,1,3,1,2,1,4,1,2,1,5,1,4,1,1,5:print(('\\','\'',',','for k in 3,1,0,0,1,2,1,0,1,1,2,1,2,1,2,1,3,1,2,1,4,1,2,1,5,1,4,1,1,5:print((',')[k],end=',')')[k],end='') 15:20:13 for k in 3,1,0,0,1,2,1,0,1,1,2,1,2,1,2,1,3,1,2,1,4,1,2,1,5,1,4,1,1,5:print(('\\','\'',',','for k in 3,1,0,0,1,2,1,0,1,1,2,1,2,1,2,1,3,1,2,1,4,1,2,1,5,1,4,1,1,5:print((',')[k],end=',')')[k],end='') 15:21:07 let me make that a bit nicer 15:23:01 `python3 -cfor k in 3,1,0,0,1,2,1,0,1,1,2,1,2,1,2,1,3,1,2,1,4,1,4:print(('\\','\'',',','for k in 3,1,0,0,1,2,1,0,1,1,2,1,2,1,2,1,3,1,2,1,4,1,4:print((',')[k],end=str())')[k],end=str()) 15:23:02 for k in 3,1,0,0,1,2,1,0,1,1,2,1,2,1,2,1,3,1,2,1,4,1,4:print(('\\','\'',',','for k in 3,1,0,0,1,2,1,0,1,1,2,1,2,1,2,1,3,1,2,1,4,1,4:print((',')[k],end=str())')[k],end=str()) 15:23:12 cpressey: I think it was mentioned on the talk page that what you have is basically µ-recursion which only allows one use of the µ operator 15:23:14 `unidecode µ 15:23:14 ​[U+00B5 MICRO SIGN] 15:23:21 wrong µ, sorry, the other one isn't on my keyboard 15:23:41 that means you can have a different computational power inside and outside 15:23:43 well, if a while program only needs one while loop, ... ok, that's hardly the best sort of reasoning 15:23:50 [[Brace For Impact]] https://esolangs.org/w/index.php?diff=64943&oldid=64942 * Areallycoolusername * (+367) 15:24:10 having only FSMs/regular languages inside the µ seems like it's a substantial cut to the power of the language 15:24:15 Oh, so Plokmijnuhby noticed exactly what I noticed 15:24:49 (but has a much cooler name than I do) 15:25:36 You definitely only need one minimization operation to be TC (he said without a shred of proof) 15:25:53 actually, it's not quite the same 15:25:57 You search for the smallest Turing machine that does what you need and you simulate that and you're done 15:26:02 μ ? 15:26:15 μ ! 15:26:38 Moo 15:26:43 the current AaA proof doesn't work in µ-calculus with only one minimization, as you need to put the minimization itself into a loop 15:26:56 it's more like, only one minimization is allowed in the program's /source code/ but you can put control flow around it 15:27:03 `unidecode μ 15:27:04 ​[U+03BC GREEK SMALL LETTER MU] 15:27:11 `unidecode μ 15:27:11 ​[U+03BC GREEK SMALL LETTER MU] 15:27:40 if μ and µ didn't look identical I wouldn't have to unidecode them to see which was which 15:28:40 `? font 15:28:41 ​#esoteric bitmap fonts include: \oren\'s font http://www.orenwatson.be/fontdemo.htm , lifthrasiir's font https://github.com/lifthrasiir/unison/ , b_jonas's font http://www.math.bme.hu/~ambrus/pu/fecupboard20-c.pcf.gz , fizzie's font https://github.com/fis/rfk86/tree/master/web/font , FireFly's fonts http://xen.firefly.nu/up/fonts/ 15:30:03 I guess there's no real reason for them to /look/ different, they're just /semantically/ different (one is pronounced "m", or "mu" if alone, and one is pronounced "micro") 15:30:55 maybe I should stop being lazy and finally upgrade my compose key to RFC 1345, even if it's a little less intuitive than the standard compose key layout 15:32:02 ais523: I think they're only historically different 15:32:47 the opposite as how the t with comma under and the t with cedilla under are now different letters when they used to be the same, the two mus are now the same but we have to support both encodings 15:35:02 and yes, that analogy makes no sense 15:36:27 well, there's a character in CP437 which was intended to be used for both the German ß and the Greek beta… 15:36:41 (and those don't even /look/ the same, just kind of similar, but are definitely semantically different) 15:36:59 but the semantic difference between μ and µ is probably relevant for things like screen readers 15:37:20 (compare "µ-architecture" to "m-architecture", for example) 15:38:21 ais523: sure, because that encoding was originally made for unchangable 256 sized character sets burned into ROM, with fonts that are 14 or 8 pixel high on a monitor, or similarly small on a printer 15:42:12 I once used a typewriter that had no "1" key. It was assumed you'd just use a lowercase "l" for it. 15:43:26 http://nerdlypleasures.blogspot.com/2015/04/ibm-character-fonts.html nice listing of all the original fonts 15:43:56 cpressey: sure, old typewriters were like that, no "1", no "0", no "í", no "ú", no "ű". 15:53:12 I can kind of imagine μ(FA(μ(CFL))) (if that's what that AaA construction is, still pretty fuzzy on that) being Turing-complete 15:53:43 or some construction in the vicinity of that 15:53:53 "FA"? 15:53:59 FSM if you like 15:54:06 Football Association 15:54:08 (Finite Automaton) 15:54:16 -!- Sgeo__ has joined. 15:57:07 -!- Sgeo_ has quit (Ping timeout: 245 seconds). 15:57:23 I was going to do an esolang around something like μ(CFL), by coincidence. Haven't gotten around to it yet 15:57:59 There's always something more interesting on the other side of the fence 15:58:04 Anyway 15:58:11 A la prochaine. 15:58:13 -!- cpressey has quit (Quit: WeeChat 1.4). 16:02:03 `python3 -cfor k in b'2030401010201030104010505':print((chr(39),',','for k in b','2030401010201030104010505',':print((chr(39),',')[k-48],end=str())')[k-48],end=str()) 16:02:07 for k in b'2030401010201030104010505':print((chr(39),',','for k in b','2030401010201030104010505',':print((chr(39),',')[k-48],end=str())')[k-48],end=str()) 16:02:16 this one is longer, but there's something I can do with it 16:03:17 -!- xkapastel has joined. 16:17:13 `python3 -cs='1606261656265636564656563664';[print((s,'s=',';[print((s,',',chr(39))[int(k)],end=',')for k in s]',',',chr(39))[int(k)],end='')for k in s] 16:17:14 s='1606261656265636564656563664';[print((s,'s=',';[print((s,',',chr(39))[int(k)],end=',')for k in s]',',',chr(39))[int(k)],end='')for k in s] 16:20:14 `python3 -cs='150525154525453545453';[print((s,'s=',';[print((s,',',chr(39))[int(k)],end=str())for k in s]',',',chr(39))[int(k)],end=str())for k in s] 16:20:17 s='150525154525453545453';[print((s,'s=',';[print((s,',',chr(39))[int(k)],end=str())for k in s]',',',chr(39))[int(k)],end=str())for k in s] 16:20:19 even better 16:20:46 of course there would probably be much shorter ones if I didn't try this ridiculous indexing thing 16:31:29 `olist 1173 16:31:30 olist 1173: shachaf oerjan Sgeo FireFly boily nortti b_jonas 16:37:37 -!- lob_jonas has quit (Remote host closed the connection). 17:15:01 -!- Phantom_Hoover has joined. 17:25:15 -!- ais523 has quit (Quit: quit). 17:25:58 -!- Sgeo_ has joined. 17:29:38 -!- Sgeo__ has quit (Ping timeout: 245 seconds). 17:38:59 -!- b_jonas has joined. 17:59:47 [[User:Hanzlu]] https://esolangs.org/w/index.php?diff=64944&oldid=64911 * Hanzlu * (+298) 18:00:09 [[User:Hanzlu]] https://esolangs.org/w/index.php?diff=64945&oldid=64944 * Hanzlu * (+4) 18:13:56 -!- kolontaev has joined. 18:49:39 shachaf: the chonky orange cat is back 18:58:34 -!- kolontaev has quit (Quit: leaving). 18:58:35 kmc: yay 18:58:38 cat 19:00:12 `? cat 19:00:17 `whatis cat 19:00:17 Cats are cool, but should be illegal. 19:00:20 cat(1) - concatenate files and print on the standard output \ cat(1p) - concatenate and print files \ CaT(1hackeso) - no description \ cAt(1hackeso) - no description 19:02:28 `cat 19:02:54 `dog 19:02:55 ​/srv/hackeso-code/multibot_cmds/lib/limits: line 5: exec: dog: not found 19:02:58 No output. 19:03:22 `tomfoolery cat 19:03:23 A cat is an animal with four legs. It's nice to pet, especially when it's a baby cat, called a kitten. Or it's the unix "cat" command. It takes a filename (or many) and prints the contents of that (those) file(s). 19:03:55 boringly accurate 19:06:16 ``` perl -pi -e s+tp:+tps+ tmflry/wiki 19:06:17 No output. 19:06:22 `tomfoolery wiki 19:06:23 The wiki is at https//esolangs.org/wiki 19:06:27 argh 19:06:35 ``` perl -pi -e s+tps/+tps:/+ tmflry/wiki 19:06:37 No output. 19:06:40 `tomfoolery wiki 19:06:41 The wiki is at https://esolangs.org/wiki 19:06:50 -!- FreeFull has joined. 19:06:57 I'd edited all the urls in the wisdome earlier, but this one fell aside 19:32:03 `? right 19:32:07 Right is not two wrongs but three lefts. 19:38:45 Right is the direction you should face towards when the baby metroid drains you, in order to be able to stand up slightly faster. 19:53:44 -!- lldd_ has joined. 19:56:10 [[Special:Log/newusers]] create * IAmAnIssu * New user account 19:58:16 Hey, is it feasible to calculate the first few decimal digits of Graham's number? 🤔 19:58:34 Graham's number is of the form 3^3^3^3^... 19:59:07 Calculating the first few digits entails calculating, what is it. 19:59:17 log(3^3^3^3^...) mod log(10), isn't it? 20:00:06 [[Esolang:Introduce yourself]] https://esolangs.org/w/index.php?diff=64946&oldid=64797 * IAmAnIssu * (+146) 20:00:43 [[Esolang:Introduce yourself]] https://esolangs.org/w/index.php?diff=64947&oldid=64946 * IAmAnIssu * (-5) ok then 20:01:20 [[Esolang:Introduce yourself]] https://esolangs.org/w/index.php?diff=64948&oldid=64947 * IAmAnIssu * (+65) I have no idea what I'm doing 20:02:42 -!- Lord_of_Life_ has joined. 20:05:43 -!- Lord_of_Life has quit (Ping timeout: 268 seconds). 20:05:47 -!- Lord_of_Life_ has changed nick to Lord_of_Life. 20:27:47 [[Forget]] N https://esolangs.org/w/index.php?oldid=64949 * IAmAnIssu * (+2326) Created page with "==Forget== '''Forget''' is a stack-based language where pointers are poisonous and the interpreter doesn't do a good job of remembering non-constant values ==Syntax== Instruct..." 20:29:51 [[Forget]] https://esolangs.org/w/index.php?diff=64950&oldid=64949 * IAmAnIssu * (+49) 20:30:45 [[Language list]] https://esolangs.org/w/index.php?diff=64951&oldid=64900 * IAmAnIssu * (+13) 20:31:47 [[Forget]] https://esolangs.org/w/index.php?diff=64952&oldid=64950 * IAmAnIssu * (+7) 20:32:58 [[Forget]] https://esolangs.org/w/index.php?diff=64953&oldid=64952 * IAmAnIssu * (+183) 20:33:13 [[Forget]] https://esolangs.org/w/index.php?diff=64954&oldid=64953 * IAmAnIssu * (+1) 20:33:34 [[User:Areallycoolusername]] https://esolangs.org/w/index.php?diff=64955&oldid=64560 * Areallycoolusername * (+23) 20:37:12 [[Language list]] https://esolangs.org/w/index.php?diff=64956&oldid=64951 * Areallycoolusername * (+23) /* B */ 20:38:13 [[Brace For Impact]] https://esolangs.org/w/index.php?diff=64957&oldid=64943 * Areallycoolusername * (+0) /* Turing complete proof */ 20:45:34 [[Truth-machine]] https://esolangs.org/w/index.php?diff=64958&oldid=64859 * Areallycoolusername * (+136) 20:46:08 [[Truth-machine]] https://esolangs.org/w/index.php?diff=64959&oldid=64958 * Areallycoolusername * (+2) /* Brace For Impact */ 20:46:15 [[Truth-machine]] https://esolangs.org/w/index.php?diff=64960&oldid=64959 * Areallycoolusername * (+1) /* Brace For Impact */ 20:54:32 -!- lldd_ has quit (Quit: Leaving). 21:04:38 -!- Sgeo_ has quit (Ping timeout: 245 seconds). 21:42:12 [[Jussef Swissen]] https://esolangs.org/w/index.php?diff=64961&oldid=64617 * Areallycoolusername * (-20) 21:48:39 [[Brace For Impact]] https://esolangs.org/w/index.php?diff=64962&oldid=64957 * Areallycoolusername * (+104) Actually gave a program 21:50:26 [[Brace For Impact]] https://esolangs.org/w/index.php?diff=64963&oldid=64962 * Areallycoolusername * (+110) /* Turing complete Proof */ 22:03:29 [[Brace For Impact]] https://esolangs.org/w/index.php?diff=64964&oldid=64963 * Areallycoolusername * (+671) 22:03:39 [[Brace For Impact]] https://esolangs.org/w/index.php?diff=64965&oldid=64964 * Areallycoolusername * (+1) /* = Hello World Program */ 22:23:47 -!- Sgeo has joined. 22:30:05 -!- dog_star_ has joined. 22:35:41 -!- fungot` has joined. 22:37:20 -!- dog_star has quit (*.net *.split). 22:37:20 -!- fungot has quit (*.net *.split). 22:39:49 [[User talk:A]] https://esolangs.org/w/index.php?diff=64966&oldid=64892 * Areallycoolusername * (+629) 22:40:15 kmc: chonky orange cats are good luck 22:41:27 yes 22:41:29 probably 22:41:30 aren't all cats 22:43:15 that too 22:49:38 -!- Phantom_Hoover has quit (Ping timeout: 245 seconds). 23:26:40 -!- b_jonas has quit (Quit: leaving). 23:37:47 I wonder if there are any rational functions that are Turing-complete when iterated. 23:38:45 A piecewise affine function R*R -> R*R is Turing-complete when iterated. You can use a real number as a stack plus a bit of finite state, and two stacks and finite state are enough to make a Turing machine. 23:39:24 To be clear, I mean rational functions that are Turing-complete when iterated on the real numbers. 23:39:30 Though the same question for complex numbers is also interesting. 23:42:05 I guess it's almost certainly easier to make a computer by iterating on the complex numbers rather than the real numbers. 23:42:46 Is the Mandelbrot set Turing-complete? Can you convert a Turing machine into a complex number such that the complex number escapes if and only if the Turing machine halts? 2019-08-02: 00:04:41 [[User talk:A]] M https://esolangs.org/w/index.php?diff=64967&oldid=64966 * A * (+166) /* Concern */ 00:14:28 -!- izabera has changed nick to also_uplime. 00:26:09 -!- also_uplime has changed nick to izabera. 00:58:15 -!- FreeFull has quit. 01:05:01 🤔 . o O ( the inverse image of 0 under x -> x^2 has two elements, but both of them are 0. ) 01:28:41 [[Forget]] https://esolangs.org/w/index.php?diff=64968&oldid=64954 * IAmAnIssu * (+389) Added new instructions + cat program 01:37:07 -!- heroux has quit (Ping timeout: 245 seconds). 01:44:13 -!- heroux has joined. 01:44:53 tswett[m]: If you're representing complex numbers by a pair of computable reals, I expect a positive answer, mainly because computable reals are specified in terms of infinite computations. If you have to pick a *rational* complex number (in finite time) then this becomes a potentially interesting problem... 01:46:05 Yeah, here's what I had in mind. 01:46:38 The "machine" consists of a particular rational function with rational complex coefficients. 01:46:55 The input is a rational complex number, and executing the machine consists of repeatedly applying the function to the input. 01:47:40 Basically I'd be happier with saying Q*Q -> Q*Q rather than R*R -> R*R :) 01:48:13 There's a "halting basin" which consists of... let's say it has to consist of an open ball with a rational complex center and rational radius. 01:48:42 The machine halts if and only if the state enters the halting basin at some point. 01:49:06 Uh, is the Mandelbrot set connected? I thought not... 01:49:13 Ah 01:49:19 But that doesn't matter. Sorry. 01:49:26 Is... is that an open problem? 01:49:33 It definitely seems like it's path-connected, but maybe that's not known. 01:49:48 tswett[m]: I have never looked at this formally. 01:51:18 I've just played with fractint ages ago and thought that it looked disconnected with mandelbrot islands everywhere. But that may well be misleading... rendering would miss narrow paths. 01:52:25 But the map x -> x^2 + 1 is not injective, so there's at least a potential of producing islands. 01:52:26 Looks like it's been proved that the Mandelbrot set is connected. 01:52:44 mm fractint 01:53:38 "During the early 1990s the program was the definitive fractal generating program for personal computers." 01:55:16 yep 01:55:27 i remember playing with it at my grandpa's house as a kid 01:55:29 it was fun 01:55:39 DOS program 01:59:34 Ah, I'm misremembering what exactly the Mandelbrot set is. 02:00:21 well, don't listen to the johnathan coulton song 02:00:25 because he defines it wrong :P 02:01:34 I remember coding a mandelbrot set renderer in TI-83 BASIC 02:01:55 it took about half an hour to render a 4 color greyscale image (shown by rapidly switching between stored monochrome images) 02:03:23 I think I read somewhere the display supports 4 level, although this cannot be done with the built-in system. 02:03:44 well the cycling looks a lot better if you do it in assembly 02:03:57 asm games for the TI-83 had greyscale and relatively high framerate graphics 02:04:19 the basic command to recall a stored picture was slow enough that you couldn't really do flicker free greyscale 02:04:19 Yes, definitely it would be faster 02:04:29 I only dipped my toe into TI-83 assembly though 02:04:31 * int-e is wasting CPU cycles on finding smooth numbers... 02:05:04 I bet you could do C as well, using sdcc, but I'm not sure how many people have 02:05:13 for TI-89 the TIGCC toolchain was pretty popular 02:05:18 I have TI-92, although only used the built-in system. It is slow, but at least it has a full keyboard and also a built-in programming environment. 02:05:19 I never quite got it working though :? 02:05:27 I bought a TI-92 at a hamfest recently 02:05:29 for nostalgia reasons 02:05:33 so I might do something with it one day 02:05:41 TI-89/92 basic is much more powerful than TI-83 basic 02:06:35 (challenge: Find a number larger than (10^50-1)/9 = 111...111 (50 ones) that is only divisible by the first 27 primes (2..103) and is as small as you can make it. (If you can find the minimum that would be impressive, but I can't.)) 02:07:27 Yes, although it is still slow. There are things that can be done to improve the speed a bit, though, such as using the sort commands for shuffling (kind of like using "ORDER BY RANDOM()" in SQL) 02:07:34 (This resulted from a question on ##math two days ago and I've already spent quite some effort on this.) 02:08:12 zzo38: interesting 02:11:55 -!- Sgeo has quit (Ping timeout: 258 seconds). 02:14:22 So essentially, find the smallest linear combination of log(2), log(3), log(5), ..., log(103), with nonnegative integer coefficients, which is larger than log(111...111)? 02:15:36 sure if you want to deal with irrational numbers :) 02:17:23 The problem has got to have a name. 02:17:41 (double precision is not enough for this) 02:28:56 (Tbf, as far as I can make up, double precision is just barely not enough. So playing around with that should be perfectly fine.) 02:32:27 Just use arbitrary-precision integers. 02:50:32 -!- Sgeo has joined. 02:56:29 [[Talk:Deadfish Joust]] https://esolangs.org/w/index.php?diff=64969&oldid=64926 * JonoCode9374 * (+308) /* Contest controller */ 02:59:31 [[Talk:Keg]] https://esolangs.org/w/index.php?diff=64970&oldid=64861 * JonoCode9374 * (+43) /* Implicit Input */ new section 03:24:07 [[Keg]] https://esolangs.org/w/index.php?diff=64971&oldid=64211 * JonoCode9374 * (+412) /* Special Bits */ 03:25:41 [[Keg]] https://esolangs.org/w/index.php?diff=64972&oldid=64971 * JonoCode9374 * (+163) /* Implicit Input */ 03:32:21 -!- xkapastel has quit (Quit: Connection closed for inactivity). 04:11:48 -!- xkapastel has joined. 04:23:46 -!- Sgeo has quit (Ping timeout: 246 seconds). 04:37:58 [[Talk:Deadfish Joust]] M https://esolangs.org/w/index.php?diff=64973&oldid=64969 * A * (+123) 04:45:51 [[Talk:Keg]] M https://esolangs.org/w/index.php?diff=64974&oldid=64970 * A * (+245) 04:46:42 [[Talk:Keg]] M https://esolangs.org/w/index.php?diff=64975&oldid=64974 * A * (+1233) /* Backwards compatibility issue and lengthy code issue */ 04:46:51 [[Talk:Keg]] M https://esolangs.org/w/index.php?diff=64976&oldid=64975 * A * (+65) /* Backwards compatibility issue and lengthy code issue */ 04:47:08 [[Talk:Keg]] M https://esolangs.org/w/index.php?diff=64977&oldid=64976 * A * (+5) /* Backwards compatibility issue and lengthy code issue */ 04:48:58 [[Talk:Keg]] M https://esolangs.org/w/index.php?diff=64978&oldid=64977 * A * (+0) /* Backwards compatibility issue and lengthy code issue */ My brain is a lot worse in the day than in the night. 04:53:38 [[Talk:Keg]] M https://esolangs.org/w/index.php?diff=64979&oldid=64978 * A * (+65) /* Backwards compatibility issue and lengthy code issue */ 04:53:51 -!- Sgeo has joined. 04:59:20 [[Keg]] M https://esolangs.org/w/index.php?diff=64980&oldid=64972 * A * (+245) /* Special Bits */ This might be implemented. However, I will see how JonoCode9374 reacts. 05:00:23 [[Keg]] M https://esolangs.org/w/index.php?diff=64981&oldid=64980 * A * (+1) /* No EOI's after inputs */ 05:05:02 -!- doesthiswork has quit (Ping timeout: 245 seconds). 05:40:06 -!- sftp has quit (Excess Flood). 05:40:30 -!- sftp has joined. 05:57:00 `complain 05:57:31 No output. 05:58:37 [[Talk:Keg]] M https://esolangs.org/w/index.php?diff=64982&oldid=64979 * A * (+9) /* Backwards compatibility issue and lengthy code issue */ 06:19:06 [[What Mains Numbers?]] https://esolangs.org/w/index.php?diff=64983&oldid=64866 * A * (+0) /* Implementations */ Cosmetics 07:32:28 [[ACL]] https://esolangs.org/w/index.php?diff=64984&oldid=64925 * Hanzlu * (+33) 07:42:21 -!- xkapastel has quit (Quit: Connection closed for inactivity). 07:50:48 -!- cpressey has joined. 08:04:44 -!- Lord_of_Life has quit (Ping timeout: 272 seconds). 08:07:13 -!- Lord_of_Life has joined. 08:07:38 [[Keg]] M https://esolangs.org/w/index.php?diff=64985&oldid=64981 * A * (-2) /* Cat program */ There is implicit input now. 08:08:46 [[Keg]] M https://esolangs.org/w/index.php?diff=64986&oldid=64985 * A * (-4) /* Example Programs */ Find and add implicit imput if possible. 08:11:14 [[Keg]] M https://esolangs.org/w/index.php?diff=64987&oldid=64986 * A * (-1) /* Truth-machine */ In my PR, Keg also takes one line of input if it tries to duplicate an empty stack. Now I can save 1 byte. 08:16:57 -!- Phantom_Hoover has joined. 08:42:42 Good morning. I think the following default assumptions hold: If I have an esolang and I don't say outright that its programs can be infinite, they can't be. If I do say outright that they can be infinite, but I don't say they need not be computable, they must be computable. 08:44:37 If I have time I'll try to make an esowiki page about infinite programs. 08:52:40 One of the more frustrating things about language design is, you start designing a language, and you get to a point where there are several options, and each option has interesting implications that you would like to explore, but they might go in a different direction than your original idea 08:54:24 Should you ignore them and try to get to your original goal, or should you go down them and end up with something you have no good idea how it will turn out? 09:24:48 [[Pxem]] https://esolangs.org/w/index.php?diff=64988&oldid=64852 * YamTokTpaFa * (+50) /* pxemi.7z and text2pxem.pl */ 09:36:13 [[Golf]] M https://esolangs.org/w/index.php?diff=64989&oldid=57940 * A * (+81) 09:37:45 [[Golf/Feature golf]] M https://esolangs.org/w/index.php?diff=64990&oldid=62309 * A * (+133) 09:42:48 Why should computability be a requirement? 09:43:26 I think a language interpreter can just get an oracle representing a program without caring how it works. 09:44:00 Assumption about what you allow, rather than a requirement. If you want your language to accept uncomputable reals in input you should say so, that's all. 09:46:05 i guess whether it seems unnatural depends on how you specify infinite programs. 09:47:34 [[Pxem]] https://esolangs.org/w/index.php?diff=64991&oldid=64988 * YamTokTpaFa * (+236) /* pxemi.7z and text2pxem.pl */ 09:52:15 If a language accepts uncomputable infinite programs, it doesn't seem to make much sense to ask whether that language is Turing-complete. It can do the triviallest things yet still produce output that a TM never could. 09:56:16 [[Pxem]] https://esolangs.org/w/index.php?diff=64992&oldid=64991 * YamTokTpaFa * (+608) /* pxemi.7z and text2pxem.pl */ 10:18:06 -!- andrewd3 has joined. 10:18:12 hello 10:19:13 Hi andrewd3 10:19:39 were you that guy who implemented deadfish in deadfish cafe {:} 10:20:10 I sure did that thing 10:20:15 ooooo 10:20:20 special meeting 10:20:49 what eso stuff have you done recently 10:22:11 if any 10:22:26 Not terribly much. A string-rewriting language that looks and acts like a concatenative language. 10:22:48 Which I actually started a long time ago, only finished it up this year. 10:22:55 look at that you posted at a palinfdromic time 10:22:56 12:22:21 10:24:17 -!- wob_jonas has joined. 10:24:40 irc or more moder nstuff 10:26:31 vote now on your phones 10:27:02 int-e: "Find a number larger than (10^50-1)/9 that is only divisible by the first 27 primes and is as small as you can make it" => nice, that looks tractable 10:27:05 [[ACL]] M https://esolangs.org/w/index.php?diff=64993&oldid=64984 * A * (+232) /* Example Code */ 10:27:22 andrewd3: I've got Opera Mini on my phone. Very advanced stuff 10:27:34 ye 10:27:43 int-e: can you make smaller versions of that problem for which you can find an exact solution, as testcases? 10:27:48 s/make/define/ 10:28:14 a thing to make this better would be if ais523 exploded from the sky and that guy named urban who made BF would send himself back to esos for a while 10:28:21 (urban works for search.ch now) 10:30:22 eso idea: eso using the commands 123456789A (the digits of bijective base 10) whose source is interpreted as an integer in bijective base 10 10:30:36 and that is how many characters the source needs to be for the program to run as it does 10:30:47 a family of these actually, using different bijective bases 10:31:16 cpressey: languages with infinite inputs => I think we talked a bit about the case of Waterfall Model. The default version is to allow only rational numbers. If you allow any real number in the program, then you can encode any infinite bit sequence in a way that the program can extract (slowly). 10:31:41 the idea could work 10:36:52 another idea: make a language that is one big formula 10:41:11 int-e: hmm, you did scale that well. it is somewhat above what's easy to solve, but very easy to verify, so it makes a good challenge 10:41:19 I'm not familiar with the idea of bijective bases unfortunately 10:41:29 bijective is basically without 0 10:41:37 that's what a bijective base is 10:44:06 [[Incident]] https://esolangs.org/w/index.php?diff=64994&oldid=56758 * B jonas * (+27) [[Category:Pattern-based]] 10:44:49 -!- Phantom_Hoover has quit (Ping timeout: 258 seconds). 10:46:15 doot 10:55:19 [[Talk:Keg]] M https://esolangs.org/w/index.php?diff=64995&oldid=64982 * JonoCode9374 * (+13) /* Keg+ Backwards compatibility issue and Keg lengthy code issue */ 10:55:33 idea: language with the feature to twist a tape 10:59:57 chat dead 11:01:35 what is tape twisting supposed to mean 11:01:53 literally take the tape and twist it 11:01:57 make a half twist 11:02:02 it's a joke language idea i have 11:06:09 how would that be different to just having 2 tapes to switch between? 11:06:25 it wouldn't 11:06:31 joke idea 11:06:34 If you twist too much the tape can snap 11:06:44 yeah, it would just jam the drive 11:06:53 Maybe you can push twists around? 11:07:32 yeah 11:07:40 you can also buy glue and make a mobius strip tape 11:07:44 to work on 11:08:15 when i say "manipulate the tape" i mean "play around with it like you would IRL" 11:09:33 i plan on adding bubble wrap to my language 11:09:35 as a tape 11:11:58 Taneb i don't understand what you mean 11:12:35 x= => =x 11:12:42 pushing twists would be fun for a dual-taped unifunge 11:12:54 yes 11:12:55 do that 11:13:02 you can push twists aroun 11:13:29 however this depends on what tape you're using, if you're using duct tape it'll take quite a bit of work to untwist it 11:13:48 the problem with befunge for this is its verbosity 11:14:00 mmhmm 11:14:06 i don't understand but mmhmm 11:14:07 go on 11:15:13 you need a lot of commands to manipulate a specific cell 11:16:49 -!- xkapastel has joined. 11:18:41 that is bad right? 11:30:41 oo 11:30:47 -_- 11:33:47 If you have multiple tapes and multiple twists and can't push twists through other twists, you have Braid Theory 11:34:11 what's that 11:36:57 dunno, but if you add "theory" to anything, it starts to sound more impressive. I don't know why pseudosciences don't do it more often. 11:37:15 they do make up for it by "quantum" 11:38:01 i recently learned about a set of seamingly magical frequencies that fix DNA errors while listening to them 11:38:07 hillarious 11:38:51 `? seamingly 11:38:52 seamingly? ¯\(°​_o)/¯ 11:38:57 `? sea ming 11:38:58 sea ming? ¯\(°​_o)/¯ 11:39:00 hmm 11:39:22 C-ming 11:39:27 a ming programed in C 11:43:16 Braid Theory is just Knot Theory where your knot has been cut though and the strands are laid flat on a table 11:44:24 that's a first grade subject chris 11:44:26 we all know it 11:52:04 l 11:53:19 maybe it's like a lemming or a sea mink 11:53:38 yes 11:59:15 [[Talk:An Odd Rewriting System]] https://esolangs.org/w/index.php?diff=64996&oldid=64792 * Ais523 non-admin * (+686) 1D-1D-CA = [[2C]] 12:09:25 the problem is, the sea mink is extinct 12:09:47 we do have lemmings though 12:09:50 let's put them to use 12:10:28 wob_jonas joke programming language with lemmings? 12:23:31 -!- andrewd3 has quit (Remote host closed the connection). 12:43:48 Zheng He was a sea ming 13:17:43 [[Talk:Keg]] M https://esolangs.org/w/index.php?diff=64997&oldid=64995 * A * (+265) /* Keg+ Backwards compatibility issue and Keg lengthy code issue */ 13:21:05 -!- doesthiswork has joined. 13:30:09 [[Echo Tag]] https://esolangs.org/w/index.php?diff=64998&oldid=58417 * Ais523 non-admin * (+5738) Turing-completeness proof (this is comparable to the flawed proof I was working on earlier, but fixed the flaw via placing padding in Encoding B so that the position of the tag system mod m is not lost while processing it) 13:31:13 [[Rook]] https://esolangs.org/w/index.php?diff=64999&oldid=63785 * Areallycoolusername * (-9) /* Instructions */ 13:31:23 `? golay 13:31:24 golay? ¯\(°​_o)/¯ 13:33:01 [[Golf/Feature golf]] https://esolangs.org/w/index.php?diff=65000&oldid=64990 * Areallycoolusername * (+31) 13:34:56 cpressey: at least Julia provides the div1 and mod1 functions for computing with 1-based indexes 13:35:34 -!- andrewd12 has joined. 13:35:46 i'm the same andrew from before 13:36:19 andrewd12: the same as andrewd3? you can't roll a 12 on a d3 13:36:47 wob_jonas i'm breaking the laws of reality however i want, mister 13:37:09 i'll make a programming language that uses bubble wrap 13:40:13 [[Talk:Golf/Feature golf]] N https://esolangs.org/w/index.php?oldid=65001 * Areallycoolusername * (+644) Tell User: A how Feature golf needs restrictions. 13:40:40 [[Talk:Golf/Feature golf]] https://esolangs.org/w/index.php?diff=65002&oldid=65001 * Areallycoolusername * (+1) 14:08:36 oof 14:11:27 can anyone explain reversible computing? 14:14:32 n + 2 - 2 = n? 14:14:46 o 14:14:47 thanks 14:15:05 whats up myname 14:15:36 [ [n=.10+?80 14:15:36 wob_jonas: 59 14:15:47 what 14:15:48 [ (n + 2) - 2 14:15:48 wob_jonas: 59 14:15:49 what 14:15:53 [ ((n + 2) - 2) = n 14:15:54 wob_jonas: 1 14:15:58 seems right 14:17:01 wob 14:17:04 have you made esos 14:21:44 -!- cpressey has quit (Quit: WeeChat 1.4). 14:25:50 idea: programming language that i forgot the specifications too 14:26:24 it's called c++ 14:26:54 yeah but only i know the specifications and there is one program and ti has not comments 14:27:27 [[Talk:Golf/Feature golf]] M https://esolangs.org/w/index.php?diff=65003&oldid=65002 * A * (+240) 14:27:46 what's up 14:31:20 [[Talk:Golf/Feature golf]] M https://esolangs.org/w/index.php?diff=65004&oldid=65003 * A * (+353) 14:34:01 gay 14:34:15 [[Golf/Feature golf]] https://esolangs.org/w/index.php?diff=65005&oldid=65000 * A * (+422) Old post added 14:34:33 [[Golf/Feature golf]] M https://esolangs.org/w/index.php?diff=65006&oldid=65005 * A * (+2) /* brainfuck */ W 14:34:39 wat 14:35:00 i dunno 14:35:17 i have a shorter attention span, as in, i expect more active forums 14:36:48 [[Talk:Golf/Feature golf]] M https://esolangs.org/w/index.php?diff=65007&oldid=65004 * A * (+48) 14:38:22 [[Golf/Feature golf]] M https://esolangs.org/w/index.php?diff=65008&oldid=65006 * A * (+73) 14:40:26 [[Golf/Feature golf]] M https://esolangs.org/w/index.php?diff=65009&oldid=65008 * A * (+114) /* Competitive usage */ 14:42:28 [[Talk:Golf/Feature golf]] M https://esolangs.org/w/index.php?diff=65010&oldid=65007 * A * (+307) 14:47:22 wow 14:47:23 progress 14:49:25 [[Swissen Machine]] https://esolangs.org/w/index.php?diff=65011&oldid=64618 * Areallycoolusername * (+21) 14:53:13 [[Golf]] https://esolangs.org/w/index.php?diff=65012&oldid=64989 * Areallycoolusername * (+1) /* See also */ 14:53:33 [[Golf]] https://esolangs.org/w/index.php?diff=65013&oldid=65012 * Areallycoolusername * (-2) /* See also */ 14:57:50 [[Category:Golfing language]] M https://esolangs.org/w/index.php?diff=65014&oldid=53187 * A * (+102) 14:58:30 joosef swassen 14:59:37 I propose that the offical #esoteric 64-byte random number shall be 0x2508FFC710F11E6303996A6F4B6C4AA82D338DB394B15E63AA7A14FF4A57A67B2B1E1E27EC196DD0909721A5E70ADD90304C0E471EBFA5A0FEBBF05C0871D712 . 15:00:03 why that numbert 15:00:26 it's random, so there's no reason. 15:00:34 any other random number would work just as well 15:03:05 how about 15:03:22 0x2500000000000000000000000000000000000000000000000000000000000000000000000871D712 15:03:24 Furthermore, I recommend that the official #esoteric character set of 12 different characters for transmitting messages redundantly through a 7-bit serial line shall be: +,07HOSTafz} 15:03:40 furthermore 15:04:07 That way we can recover any 1-bit error and detect any 2-bit error, and if parity is used on the serial line, then we can also detect 3-bit errors. 15:04:31 i recommend that the official #esoteric character set for transmitting 1 random character per 100 years be aofd>XMC{: 15:06:40 andrew: that doesn't even let us detect one-bit errors 15:07:20 wob_jonas it's random 15:09:46 wait 15:09:47 chat ded 15:09:48 ? 15:14:58 Why do you need to transmit one random character per one 100 years? 15:15:12 i do 15:15:16 don't question it 15:15:54 where's the invite to the esoteric language discord server? 15:15:58 do you know it zzo 15:16:23 I don't know; I prefer IRC 15:16:39 why 15:19:08 ``` grep -REi discord wisdom 15:19:09 IRC is not such a complicated protocol, and does not require that you use only one possible service, and actually has other possibilities too. You can even use IRC without specialized software for it (although it is convenient to have special IRC software, to do auto pong and other stuff) 15:19:09 No output. 15:19:19 ^ there's no such thing in the wisdom database 15:19:37 ayyy zz 15:19:48 your twoducks idea is cool 15:20:33 we 15:21:07 Will you add a NNTP for esolang on the esolangs.org server? 15:21:15 why should there be a discord? there is absolutely no need for seperate channels 15:21:29 what's an NNTP 15:22:27 myname: the irc channel is logged, so if someone wants to mirror its contents to a discord channel, I don't see a problem with it, feel free 15:22:42 there was a discord 15:22:47 but it's gone 15:22:59 i was tryna get to lyricly but couldn't 15:24:28 -!- cpressey has joined. 15:25:04 There was an early teaching version/impl of Haskell called "Gofer", apparenly this was short for "Good for equational reasoning" 15:25:41 do you know more obscure languages c 15:25:45 chris* 15:25:55 I might 15:26:04 languages more obscure than C? 15:26:42 that's a tough one 15:26:42 no 15:26:45 obscure langs in general 15:27:00 Niakwa Programming Language is pretty obscure 15:27:18 I have only seen references to it, never seen it itself 15:27:38 what's the *most obscure* 15:27:42 i'm challenging you here 15:28:17 Do you know how to program in Glulx? 15:28:29 no 15:30:02 There was a research computer called MACHO designed (in the 60's or 70's) at the uni in my hometown. I imagine its instruction set is pretty darn obscure. 15:30:21 These are probably the two obscurest languages I know of 15:30:39 i wanna make a programming language where the data is on a literal tape 15:30:44 and there's a random erro 15:30:52 "YOUR WRITING ON THE TAPE WAS TOO UNINTELIGIBLE" 15:32:03 you can cut up the tape 15:32:03 How does that MACHO computer works? 15:32:11 you can scratch it 15:32:13 and anything else 15:33:06 zzo38: I have (or had) the manual and I started scanning it, years and years ago, but never finished. I don't think the instruction set was very special. 15:33:12 [[256]] N https://esolangs.org/w/index.php?oldid=65015 * Areallycoolusername * (+513) Created page with "'''256''' is a [[Stack]]-based [[esoteric programming language]] made by [[User: Areallycoolusername|Areallycoolusername]]. It was made for Code [[Golf]], and it's a Turing..." 15:33:50 Hm, with a name like "MACHO" I think it must have been the 70's 15:34:21 is zzo particularly famous in the eso community 15:34:24 (if there *is* one) 15:35:01 -!- wob_jonas has quit (Remote host closed the connection). 15:36:47 -!- ais523 has joined. 15:37:04 hi ais 15:37:32 hello 15:38:11 I would have been online earlier – I was reading IRC – but freenode's web IRC thing no longer works at work (they have a new one that uses some sort of fancy connection that's blocked), so now ais523_ can only read, not send 15:38:35 F 15:39:30 Re Gofer, I was going to say, Haskell is good for equational reasoning, which is close to equational logic, which corresponds to universal algebra. I think this means Haskell is a term algebra (approximately speaking)? 15:39:31 how's nethack work 15:39:51 I want to explore this idea, anyway 15:39:59 Isn't this the esoteric computer programming community? 15:40:16 now it isn't 15:42:08 andrewd12: if you're interested in learning about NetHack I suggest asking in a NetHack-related channel 15:42:21 ok 15:42:23 i was just asking 15:42:29 #nethack is the "official" channel but fairly dead nowadays, #hardfought is where most of the discussion tends to be 15:42:54 sorry for wrong channel 15:43:06 (what happened is that the NetHack community was split over a lot of channels with different people in various subsets, and #hardfought ended up with most of the people who mattered and so all the discussion migrated there) 15:43:16 We can't tell you how Nethack works. We can only tell you if Nethack is Turing-complete or now 15:43:18 *not 15:43:22 it's OK to post offtopic things here, you just might not get knowledgeable answers 15:43:27 cpressey: it isn't, much to my annoyance 15:43:39 I don't think it has any way to read arbitrary amounts of memory 15:43:42 I consider this a bug :-D 15:43:43 and so 15:43:47 ais the dragon roared 15:43:56 everyone, to #hardfought soared 15:44:04 he asked "WHY IS IT NOT TURING COMPLETE" 15:44:16 trying to get answers from the Coding Elite 15:44:24 they told him "dude, it's just a game" 15:44:37 "we're in dungeons, not searching for IT fame" 15:44:43 ais realized he'd wastes his life 15:44:57 and backto #esoteric he ventured, in strife 15:45:01 was that a good poem 15:46:38 I don't normally expect poems in here 15:46:53 eh 15:46:58 they've been of varying quality 15:47:00 it was just a thing i wrote on the spot 15:47:15 there was a haiku a while back which was either thought-provoking or terrible depending on your point of view 15:47:26 (not written by me, by another channel regular) 15:47:41 it went something like this: "beautiful summer / fuck fuck fuck fuck fuck fuck fuck / sent from my iphone" 15:47:54 haikus suck, man 15:48:27 this one makes no sense, it's bad 15:48:32 refrigerator 15:53:42 ais523 what about that feather language 15:54:03 don't talk about Feather :-P 15:54:13 why not? 15:54:18 feather's a cool idea 15:54:21 why do we not talk about it 15:54:59 it's literally madness-inducing 15:55:04 it feels like it should work, but it doesn't 16:01:46 -!- cpressey has quit (Quit: A la prochaine.). 16:04:18 i'm making feather? (nthe language name is "feather?) 16:04:22 an approximation of feather 16:06:00 -!- andrewd12 has changed nick to andrewtheircer. 16:23:40 [[User:Hanzlu]] https://esolangs.org/w/index.php?diff=65016&oldid=64945 * Hanzlu * (+362) 16:40:02 -!- andrewtheircer has quit (Remote host closed the connection). 16:40:28 -!- andrewtheircer has joined. 16:57:43 -!- FreeFull has joined. 16:59:52 -!- b_jonas has joined. 17:00:38 ais523: try https://kiwiirc.com/client/irc.freenode.net as an alternate webchat 17:01:37 cpressey: is Nethack Turing-complete or now? 17:02:27 -!- Phantom_Hoover has joined. 17:02:30 "I don't think it has any way to read arbitrary amounts of memory" => um, do you mean like, per input command? 17:07:14 [[ACL]] https://esolangs.org/w/index.php?diff=65017&oldid=64993 * Hanzlu * (+121) 17:07:30 texas 17:08:31 b_jonas: I'm thinking in terms of setting up some sort of self-perpetuating shain reaction 17:08:36 *chain reaction 17:09:38 ais523: yes, but in what sense? can I put a weight on my . key? paste a longer constant command string repeatedly? 17:09:51 or do you just want between two commands? 17:09:59 I was assuming no action from the player, maybe they're a blue jelly with an amulet of unchanging in a boulder fort 17:10:18 that can work too 17:10:31 or trigger a bug in the travel command where it loops 17:11:16 I think there are two difficulties why this rarely or never happens, one is that nethack tries to be balanced in a way that reactions don't get exponential, the other is that there's too much randomness 17:11:29 so it's hard to rely on the same thing happening all the time 17:11:56 ooooo 17:11:58 nethack eso 17:14:07 now I'm trying to imagine a StackFlow implementation in a variant, where you have like ten piles of corpses, a creature zaps a wand of undead turning (this doesn't happen) in a direction depending on the type of that creature, the beam rebounds from the walls (this also doesn't happen), hits the right pile, and revives the corpse on top of that pile 17:16:25 and then the first monster dies, but that's the easy part 17:21:58 yeah, the hard part is that they have to be able to walk to multiple piles and leave specific other corpses as death drops there, before zapping the wand 17:22:21 I guess at that point I could just imagine Waterfall Model instead, but even then it just doesn't work out 17:26:53 or perhaps data is stored by a large cyclic queue of monsters wondering around in a directed loop that involves a trapdoor and a stairs up, and a protagonist who has to keep climbing up and down the stairs 17:32:41 -!- andrewtheircer has quit (Remote host closed the connection). 17:34:10 [ 295.30*70 17:34:10 b_jonas: 20671 17:39:24 [[ACL]] https://esolangs.org/w/index.php?diff=65018&oldid=65017 * Hanzlu * (+1161) 17:41:16 -!- Melvar has quit (Quit: WeeChat 2.4). 17:42:24 `! brachylog 295.30×₇₀ 17:42:25 ​ \ true. 17:42:32 `! brachylog 295.30×₇₀ẉ 17:42:33 20671.0 \ \ true. 17:42:49 right, was checking to see if there'd be a .0 (and indeed, if the number would parse correctly) 17:43:29 `! brachylog 70×↙295.30ẉ 17:43:30 ​ \ false. 17:43:39 aha, I thought that might happen :-D 17:43:57 `! brachylog 295.30×↙70ẉ 17:43:58 20671.0 \ \ true. 17:45:52 also I realized last week where the name "brachylog" comes from. "brachy" means "short", and "log" is an abbreviation for "logic", the same one as used in "prolog" 17:45:58 this should have been obvious 17:46:41 but none of the other golf languages or competitions seem to use "brachy" in their name 17:51:26 [[ACL]] https://esolangs.org/w/index.php?diff=65019&oldid=65018 * Hanzlu * (+1) 18:00:07 [[ACL]] https://esolangs.org/w/index.php?diff=65020&oldid=65019 * Hanzlu * (+123) 18:19:56 the docs of Brachylog are rather unclear 18:26:31 -!- Melvar has joined. 18:42:35 -!- jussgirl has joined. 18:42:41 and the language design is ... odd too, definitely esoteric 18:42:48 but there are a lot of things I don't understand from the docs 18:43:30 -!- jussgirl has left. 19:35:53 -!- xkapastel has quit (Quit: Connection closed for inactivity). 19:52:24 kmc, oh wow there was more actix drama 19:57:18 What's actix? 20:01:40 http server library written in rust 20:02:13 by a dev who habitually switched off rust's safety checks at the drop of a hat and didn't understand how to write unsafe code at all 20:02:31 I can see how that'd lead to drama 20:02:55 -!- Lord_of_Life_ has joined. 20:03:33 yes, because he also had this incredibly defensive mentality towards the whole thing to the point where he'd just close pull requests fixing needlessly unsafe code and tell them to fuck off 20:05:14 but the rust community cult of niceness doesn't let you say that this guy is being an antisocial dick and you shouldn't use his projects, at least without a bunch of white knights saying that you're horrible ungrateful people who are not worthy to persecute this titan of http libraries 20:06:27 -!- Lord_of_Life has quit (Ping timeout: 248 seconds). 20:06:28 -!- Lord_of_Life_ has changed nick to Lord_of_Life. 20:07:02 If you will see to use the projects or don't, to see if the project is good for your use, rather than if the author is bad. 20:07:48 well the thing is that even saying 'this project's code is too unsafe to use with any confidence' is then interpreted as an attack on the developer 20:08:44 That isn't very good, then. It shouldn't be interpreted as an attack on the developer. 20:09:04 no, it isn't very good 20:09:47 what you see emerging is a defence in depth strategy designed to prevent anyone from ever criticising any project 20:10:21 "the code is bad" "you should do something constructive and report issues rather than complaining" 20:10:54 Well, you should indicate what is bad about the code, rather than just "the code is bad" 20:11:16 "the code is bad for these reasons" "it's open source, you should fix it yourself and submit pull requests" 20:11:34 "here's a pull request" "i think the code is fine, closed" 20:12:00 If the author of that code disagree with other people who want it difference anyways, that is why, then you should fork it. 20:12:12 "the code is crappy and the developer won't fix it, don't use it" "wow why are you attacking this developer, don't you know they're working for free" 20:13:19 Yes, the alternative is to don't use it, if you don't want to use. 20:13:32 If you do not want to fork it. 20:16:33 idk what they'll say if you fork but i imagine they'll have a fallback 20:21:34 -!- adu has quit (Remote host closed the connection). 20:38:12 -!- adu has joined. 20:49:08 [[Boat]] https://esolangs.org/w/index.php?diff=65021&oldid=40619 * Hakr14 * (+281) I made your tables look nice. 20:59:34 -!- xkapastel has joined. 21:05:35 [[Talk:256]] N https://esolangs.org/w/index.php?oldid=65022 * A * (+666) Created page with "== People who don't know two golfing languages with different paradigms can not create a good golfing language == Uh-oh. You are trying to create another golfing language, but..." 21:06:29 [[Talk:256]] M https://esolangs.org/w/index.php?diff=65023&oldid=65022 * A * (+55) 21:07:37 [[256]] M https://esolangs.org/w/index.php?diff=65024&oldid=65015 * A * (+2) Typos 21:09:19 [[Talk:256]] M https://esolangs.org/w/index.php?diff=65025&oldid=65023 * A * (+111) 21:12:27 [[User:Hanzlu]] M https://esolangs.org/w/index.php?diff=65026&oldid=65016 * A * (+118) /* Rotating Cell Tape */ 21:14:30 [[User:Hanzlu]] M https://esolangs.org/w/index.php?diff=65027&oldid=65026 * A * (+215) /* Rotating Cell Tape */ 21:16:17 [[Boat]] https://esolangs.org/w/index.php?diff=65028&oldid=65021 * Hakr14 * (+603) I pressed save instead of preview... whoops 21:16:43 -!- doesthiswork has quit (Ping timeout: 245 seconds). 21:19:49 [[User:Hanzlu]] M https://esolangs.org/w/index.php?diff=65029&oldid=65027 * A * (+74) /* Rotating Cell Tape */ 21:24:15 Phantom_Hoover: yeah 21:24:41 they make a big deal about "technical criticism not personal attacks" but then interpret everything as the latter 21:24:55 you're allowed to criticise technical decisions (as long as you're sufficiently long-winded) but not the attitudes or behaviors that lead to them... as though decisions are made in a vacuum 21:27:26 [[Talk:Keg]] M https://esolangs.org/w/index.php?diff=65030&oldid=64997 * A * (-1426) /* Keg+ Backwards compatibility issue and Keg lengthy code issue */ Merged, add new issue. 21:43:29 I'm gonna design a 15.99967-bit CPU. Each register and each memory location will contain an integer in the range from 0 to 65520. 21:44:16 kmc: the obvious thing to do is to have all code contributed anonymously so that personal attacks aren't possible, all you can criticise is the code because you can't know who wrote it 21:44:19 Or equivalently, -32760 to 32760. 21:44:31 but that has problems in a different way, in that it may make people unwilling to contribute 21:45:37 well that used to be more the norm in open source 21:45:48 now people use their real names cause they want to give talks and build their career on it 21:46:06 I typically use my real name for copyright reasons 21:48:04 ais523: Are you sure you will be unwilling to contribute? 21:48:12 [[Talk:256]] https://esolangs.org/w/index.php?diff=65031&oldid=65025 * Areallycoolusername * (+406) 21:48:49 I suppose another possibility is to allow (but not require) anonymous contributions 21:49:01 zzo38: me personally, maybe not 21:49:50 problem is once you use your real name you're also vulnerable to people coming after you for things you said elsewhere on the internet 21:49:55 i've played that game and it sucks 21:50:02 so that's one reason i'm leaving open source 21:53:09 I kept "ais523" separate from my real name for many years but the connection's probably too widely known at this point 21:53:19 I have not had such problem, but, I don't care so much about that anyways. 21:53:45 I still work some open source stuff, mainly my own programs, although I put it into the public domain anyways 21:58:44 [[Keg]] M https://esolangs.org/w/index.php?diff=65032&oldid=64987 * A * (-2) /* Cat program */ 22:00:22 kmc, yeah it's just this culture that presupposes that everyone will try to make personal attacks and that's the only thing that can go wrong 22:00:42 [[Keg]] M https://esolangs.org/w/index.php?diff=65033&oldid=65032 * A * (+9) /* Cat program */ 22:01:23 which surprise surprise is basically the exact general attitude that defensive prima-donnas take whenever their work is questioned 22:01:25 [[256]] https://esolangs.org/w/index.php?diff=65034&oldid=65024 * Areallycoolusername * (+1122) 22:02:35 For my own projects I do allow you to post tickets anonymously if you want to do. 22:05:57 [[Talk:256]] M https://esolangs.org/w/index.php?diff=65035&oldid=65031 * A * (+361) 22:07:52 [[Talk:256]] M https://esolangs.org/w/index.php?diff=65036&oldid=65035 * A * (+61) 22:10:42 [[Talk:256]] M https://esolangs.org/w/index.php?diff=65037&oldid=65036 * A * (+307) /* People who don't know two golfing languages with different paradigms can not create a good(competitive) golfing language */ 22:16:47 [[256]] M https://esolangs.org/w/index.php?diff=65038&oldid=65034 * A * (+185) In order to make me feel relaxed when I am writing the integers function... 22:17:17 Do you know if there is a implementation of SDL1 for SDL2? 22:17:52 Also, is there a implementation of SDL2 on SDL1? 22:19:37 [[Talk:256]] M https://esolangs.org/w/index.php?diff=65039&oldid=65037 * A * (+247) 22:25:17 zzo38: then you could nest them 22:28:10 [[256]] M https://esolangs.org/w/index.php?diff=65040&oldid=65038 * A * (+1) /* Computational class */ 22:30:33 [[256]] M https://esolangs.org/w/index.php?diff=65041&oldid=65040 * A * (+70) /* Computational class */ No it isn't (yet) 22:33:39 [[256]] M https://esolangs.org/w/index.php?diff=65042&oldid=65041 * A * (+352) /* Computational class */ 22:34:17 " I kept "ais523" separate from my real name for many years" => I don't remember that 22:34:29 [[Talk:256]] M https://esolangs.org/w/index.php?diff=65043&oldid=65039 * A * (+37) 22:36:31 -!- doesthiswork has joined. 22:41:30 [[Talk:256]] https://esolangs.org/w/index.php?diff=65044&oldid=65043 * Areallycoolusername * (+186) 22:41:50 [[Talk:256]] https://esolangs.org/w/index.php?diff=65045&oldid=65044 * Areallycoolusername * (+0) 22:42:18 [[256]] https://esolangs.org/w/index.php?diff=65046&oldid=65042 * Areallycoolusername * (+1) 23:31:56 [[Talk:256]] M https://esolangs.org/w/index.php?diff=65047&oldid=65045 * A * (+0) 2019-08-03: 00:11:25 -!- Phantom_Hoover has quit (Ping timeout: 244 seconds). 00:12:55 [[User talk:A]] M https://esolangs.org/w/index.php?diff=65048&oldid=64967 * A * (-501) wob_jonas has mentioned the long forgotten user afz! They said in this string+,07HOSTafz} :https://esolangs.org/logs/2019-08-02.html#lve Right now the wilki is secretly hosted by afz; wob_jonas is probably the only one who remembers afz. 00:28:21 [[User talk:A]] M https://esolangs.org/w/index.php?diff=65049&oldid=65048 * A * (-253) 01:19:10 -!- xkapastel has quit (Quit: Connection closed for inactivity). 01:30:22 [[Talk:Keg]] https://esolangs.org/w/index.php?diff=65050&oldid=65030 * JonoCode9374 * (+420) /* Keg+ Backwards compatibility issue and Keg lengthy code issue */ 02:01:24 Oh God, I just learned about Three-Star Programmer. 02:07:45 So wait. Let's say that your program contains a couple of constants, like A, B, C, and D. 02:08:19 Then *A, *B, *C, and *D are pointers, of course. 02:08:20 What do they point at? Pointers! 02:09:31 Let's see, I'm imagining memory as a bunch of cells on a whiteboard, and four of the cells are permanently labeled as *A, *B, *C, and *D. 02:09:50 But you've also got four Post-It notes, which say **A, **B, **C, and **D. 02:12:35 So how does execution work? 02:12:53 Well, you find **A, dereference it, and increment whatever it points to. Then you do the same for **B, then **C, and so forth. 02:13:35 On the off chance that you ever increment *A, you take the **A Post-It note and move it to the right by one. Likewise for *B and so forth. 02:14:53 Now, eventually, all four of those Post-It notes are going to move all the way past *A, *B, *C and *D, never to return. 02:15:45 But I suppose it doesn't matter, since each time one of them moves on to fresh pasture, *its* target is now 0, which means it'll be able to point at *A or whatever at some point in the future. 02:16:48 [[Talk:Keg]] https://esolangs.org/w/index.php?diff=65051&oldid=65050 * A * (+207) /* Keg+ Backwards compatibility issue and Keg lengthy code issue */ 02:17:50 [[Talk:Keg]] M https://esolangs.org/w/index.php?diff=65052&oldid=65051 * A * (+30) /* Keg+ Backwards compatibility issue and Keg lengthy code issue */ 02:19:24 [[Talk:Keg]] M https://esolangs.org/w/index.php?diff=65053&oldid=65052 * A * (+86) /* Keg+ Backwards compatibility issue and Keg lengthy code issue */ 02:19:35 So yeh. Very interesting. 02:20:57 "The feature that most clearly distinguishes the current generation of advanced microcomputer systems, however, is the ability to address lots of memory. It is this increased memory addressability which has ushered in the new era of microcomputer applications possibilities, such as large spreadsheets, integrated software, multi-user systems, and more. In this regard, the 65816 stands on or above par with any of the other highperformance 02:20:57 microprocessors, such as the 68000, the 8086, or their successors." 02:22:38 [[User talk:A]] M https://esolangs.org/w/index.php?diff=65054&oldid=65049 * A * (-2) tswett[m]: I essentially do not like non Turing-complete languages, but Three Star Programmer is *indeed* very fun. 02:25:52 [[User talk:A]] M https://esolangs.org/w/index.php?diff=65055&oldid=65054 * A * (+2) Sgeo: the 4-bit processor 4004 is overall the most efficient, but I don't know whether it is good at addressing or not. 02:27:52 Yeah! 02:28:04 * Sgeo blinks 02:28:46 I see that I'm not the only one using a bouncer to connect to IRC. 02:29:00 But mine is a little more orthodox than [[User:A]]'s. 02:29:29 ehird, is that you? 02:30:17 [[Talk:Keg]] https://esolangs.org/w/index.php?diff=65056&oldid=65053 * A * (+58) /* Keg+ Backwards compatibility issue and Keg lengthy code issue */ 02:34:47 [[User talk:A]] https://esolangs.org/w/index.php?diff=65057&oldid=65055 * A * (-2) tswett[m]: ehird is gone. 02:45:41 [[Afz]] N https://esolangs.org/w/index.php?oldid=65058 * A * (+326) Created page with "{{lowercase}} [https://esolangs.org/logs/2019-08-02.html#lve Furthermore,] I recommend that the official #esoteric character set of 12 different characters for transmitting me..." 02:47:39 [[Afz]] M https://esolangs.org/w/index.php?diff=65059&oldid=65058 * A * (+269) 02:48:33 What is the most interesting English palindrome that can be made with just the letters AHIMOTUVWXY? 02:54:00 [[Afz]] M https://esolangs.org/w/index.php?diff=65060&oldid=65059 * A * (+701) 02:55:36 [[Afz]] https://esolangs.org/w/index.php?diff=65061&oldid=65060 * A * (-1) kmc:I think it is the word "A". It is one of the few meaningful words that is 1 letter. 02:55:50 * kmc blinks 02:58:44 [[256]] https://esolangs.org/w/index.php?diff=65062&oldid=65046 * Areallycoolusername * (+133) 02:58:45 [[Afz]] M https://esolangs.org/w/index.php?diff=65063&oldid=65061 * A * (+112) 03:03:46 [[Afz]] M https://esolangs.org/w/index.php?diff=65064&oldid=65063 * A * (+70) 03:06:27 [[Afz]] M https://esolangs.org/w/index.php?diff=65065&oldid=65064 * A * (+40) 03:09:40 [[Afz]] M https://esolangs.org/w/index.php?diff=65066&oldid=65065 * A * (+275) 03:11:36 [[Afz]] M https://esolangs.org/w/index.php?diff=65067&oldid=65066 * A * (+172) 03:12:58 [[Afz]] M https://esolangs.org/w/index.php?diff=65068&oldid=65067 * A * (-9) 03:15:19 [[Afz]] M https://esolangs.org/w/index.php?diff=65069&oldid=65068 * A * (+227) 03:16:57 I didn't realise "please do not vandalise pages, even temporarily, so that their edit summaries show up on IRC" was required as a rule 03:17:25 there's a reason you don't try to enumerate all the possible undesirable behaviours, it's because someone is bound to come up with something that isn't on the list yet 03:20:23 Oh A is still responsible for what feels like 90% of all wiki edits :/ 03:20:46 (I guess I'll keep the ignore for a while longer.) 03:21:01 kmc: hah! 03:22:35 HAH 03:23:21 kmc: I rather suspect that there are no really interesting anagrams with those letters in English, but maybe I need a better word list. (The longest ones were "maam" and "toot". You can also have tit for tat. And there are a few more exclamations like "wow", "aha" and also "huh".) 03:23:30 [[Afz]] M https://esolangs.org/w/index.php?diff=65070&oldid=65069 * A * (+61) /* Commands */ 03:29:53 int-e: well, you can use multiple words that aren't individually palindromes :) 03:32:37 `file /usr/share/dict/words 03:32:38 ​/usr/share/dict/words: symbolic link to american-english 03:33:09 `` grep -i ^[AHIMOTUVWXY]+$ /usr/share/dict/words | xargs 03:33:09 No output. 03:33:18 `` grep -i '^[AHIMOTUVWXY]+$' /usr/share/dict/words | xargs 03:33:19 No output. 03:33:46 oh 03:33:49 `` egrep -i '^[AHIMOTUVWXY]+$' /usr/share/dict/words | xargs 03:33:50 A Am Amati Amway Amy At Au Av Ava Axum H Haiti Ham Hathaway Hawaii Hay Hiawatha Ho Hohhot Hui Hutu I Io Iowa It Ito Iva Ivy M MIT Mai Mao Matt Maui Max May Maya Mayo Mia Miami Mimi Mitty Mo Moho Mott Mt Muawiya O Oahu Ohio Omaha Ottawa Otto T TWA Ta Tahiti Tami Tammi Tammy Tao Tatum Th Thai Thoth Ti Tia Tim Timmy Timothy Tito Tm Tom Tommy Toto Toyota Tuamotu Tut Tutu Ty U Utah V Va Vitim Vito W Watt Wii Witt Wm Wu Wyatt Wyo X Y Yahoo Yamaha a ah aha ahoy a 03:34:09 `` egrep -i '^[AHIMOTUVWXY]+$' /usr/share/dict/words | xargs | paste 03:34:11 https://hack.esolangs.org/tmp/paste/paste.31274 03:35:32 `` echo $(< /usr/share/dict/words egrep -i '^[AHIMOTUVWXY]+$' | egrep '^(.)(((.)(((.)(.?\7)?)?\4)?)?\1)?$') 03:35:33 A H I M O T U V W X Y a aha h hah huh i m mom mum o oho t tat tit toot tot u v w wow x y 03:37:08 atoi("iota") seems like a decent coding-based palindrome 03:37:13 at least, it's at least marginally thought-provoking 03:37:26 > reverse ":-)" 03:37:28 C doesn't recognise iota as a number, but it feels like it might be one in some context? 03:37:29 ")-:" 03:39:53 * int-e wonders why "mom" is not on the local word list. 03:40:45 tswett[m]: three-star programmer is really confusing, it gets a bit easier with practice but it's still hard to juggle all the different levels of abstraction around in your head 03:40:46 (Here I get "a aa aha ama amma atta ava awa h hah huh i ihi imi immi m maam mim mum o oho otto t tat tit toot tot tut tyt u umu utu v w waw wow x y yoy" (without -i which just adds more individual letters to the list)) 03:41:10 oh I did -i to avoid having to decapitalise the list of letters I'd copy-pasted ;-) 03:41:38 (otoh it adds many non-words :-P) 03:41:58 ais523: I like atoi("iota") 03:42:10 although... my restricted list only really makes sense with capital letters 03:42:13 (do you see why?) 03:42:16 "atoi" isn't an English word, but it's probably a word in #esoteric context 03:42:24 kmc: oh, I did as soon as you said that 03:42:26 but not before 03:42:37 kmc: is there any significance to this particular list of letters? 03:42:38 it's a pity, "atoi" only works in lowercase 03:42:40 int-e: yes 03:43:23 it's weird that half of them are adjacent at the end of the alphabet 03:43:30 I wonder if there is some complex historical reason for that 03:43:45 are letters near the end of the alphabet likely to be newer, possibly? 03:43:46 I mean W used to be VV or something, so it makes sense those two are together 03:43:50 other than that I have no idea 03:43:56 how many are valid in Greek? 03:44:14 T and U are, VWXY aren't, Z is 03:44:30 (although initially U and V were the same letter, they got split later on; ditto I and J) 03:44:34 zzo38, you like NSF music iirc? 03:44:59 this probably explains why W is pronounced "double-U" but looks like double-V, U and V may have been equivalent at the time 03:45:02 I'm bouncing back and forth between all these CPU architectures and with random music stuff associated with computers that used them 03:45:18 in greek you have a lot more suitable letters 03:45:26 ΑΔΗΘΙΛΜΞΟΠΤΥΦΧΨΩ 03:45:29 most of them actually 03:45:30 And SNES having a separate computer with separate memory just for music 03:45:42 oh right, Greek does have an X 03:46:39 …maybe Greek letters tended to change form as they moved into Latin (but not always), whereas the new letters were new and thus didn't have a chance to change from their original form? 03:46:42 in Russian Cyrillic you have АЖМНОПТФХШ 03:47:14 (also, I'm sure there is a name for this type of palindrome) 03:47:18 (but I don't know what it is) 03:47:20 kmc: slightly more allowing for non-palindromes 03:47:28 I can make a guess at what it is but don't know if I'm write 03:47:30 *right 03:48:57 [[Brainfuck-- interpreter]] https://esolangs.org/w/index.php?diff=65071&oldid=16542 * YamTokTpaFa * (+30) 03:49:27 Sgeo: Yes, I like NSF music and I know how is work NSF music. 03:50:40 [[( )fuck]] https://esolangs.org/w/index.php?diff=65072&oldid=55529 * YamTokTpaFa * (+59) 03:51:32 [[*]] https://esolangs.org/w/index.php?diff=65073&oldid=63918 * YamTokTpaFa * (+24) 03:51:43 -!- FreeFull has quit. 03:52:46 is it possible to create an esolang that's a derivative of itself? 03:53:07 you're describing Feather again, aren't you... 03:53:33 [[++Brainfuck]] https://esolangs.org/w/index.php?diff=65074&oldid=56550 * YamTokTpaFa * (+326) 03:53:44 int-e: I thought of that, but Feather isn't really a Feather derivative 03:53:49 it is implemented in itself, thoguh 03:53:57 but then so are lots of other languages, like C 03:54:00 it has the right kind of circularity though 03:54:09 -!- JonoCode9374 has joined. 03:54:14 [[.box]] https://esolangs.org/w/index.php?diff=65075&oldid=43893 * YamTokTpaFa * (+42) 03:55:06 [[0(nop^)]] https://esolangs.org/w/index.php?diff=65076&oldid=39667 * YamTokTpaFa * (+49) 03:56:29 I guess maybe https://esolangs.org/wiki/Snowflake would become a derivative of itself if there were a working interpreter, and at least one program for it 04:01:27 [[.mOdMoDwOrM]] https://esolangs.org/w/index.php?diff=65077&oldid=38377 * YamTokTpaFa * (-41) pre tags... but how do I categorize this article... 04:03:44 -!- JonoCode9374 has quit (Remote host closed the connection). 04:05:15 [[User talk:Mahagugu]] N https://esolangs.org/w/index.php?oldid=65078 * YamTokTpaFa * (+568) Created page with "==Hello, I saw your articles [[.mOdMoDwOrM]] and [[.m@dpr'a'prozessor]]== If I were to annoy you, I'm sorry. When I was visiting articles on [[Special:UncategorizedPages]], I..." 04:06:32 [[11CORTLANG]] https://esolangs.org/w/index.php?diff=65079&oldid=60502 * YamTokTpaFa * (+49) 04:08:23 [[User talk:Cortex]] https://esolangs.org/w/index.php?diff=65080&oldid=59071 * YamTokTpaFa * (+368) /* Categorization, please. */ new section 04:08:51 [[1argasm]] https://esolangs.org/w/index.php?diff=65081&oldid=56185 * YamTokTpaFa * (+24) 04:09:11 (d/dx)esolangs.org 04:10:22 [[User talk:Zero]] N https://esolangs.org/w/index.php?oldid=65082 * YamTokTpaFa * (+338) Created page with "==Categorization, please== Hello, I happened to visited your article [[1argasm]] on [[Special:UncategorizedPages]], and I categorized into [[:Category:Languages]]. Next time,..." 04:12:58 -!- doesthiswork has quit (Ping timeout: 245 seconds). 04:16:53 [[User talk:Iamcalledbob]] https://esolangs.org/w/index.php?diff=65083&oldid=55684 * YamTokTpaFa * (+314) /* Hey, what's the matter with 1st-Worst? */ new section 04:17:21 [[2.+-]] https://esolangs.org/w/index.php?diff=65084&oldid=55817 * YamTokTpaFa * (+24) 04:17:25 I'm looking for the NSF equivalent of DeepSid and I found a page that's all about that music chip but also inexplicably links to NSFW stuff 04:18:09 I can't tell if it's a spam infection or if this person is legitimately reviewing porn 04:19:27 Or spam infection that had a human realize a way to make it look just a bit more legitimate by referencing gaming 04:19:52 heh 04:19:54 link? 04:20:13 http://www.2a03.org 04:21:12 isn't there some sort of rule against linking to porn on Freenode? :-D 04:21:20 Sgeo: that is... pretty odd 04:21:23 ais523: I hope not, lol 04:21:28 I've violated that rule many times 04:22:49 [[User talk:Ais523]] https://esolangs.org/w/index.php?diff=65085&oldid=64473 * YamTokTpaFa * (+683) /* Could I be a new admin of this wiki? */ new section 04:23:33 ais523: isn't there a rule that says this channel should be called ##esoteric :P 04:24:07 [[]] https://esolangs.org/w/index.php?diff=65086&oldid=30209 * YamTokTpaFa * (+24) 04:24:37 [[]] https://esolangs.org/w/index.php?diff=65087&oldid=51809 * YamTokTpaFa * (+24) 04:24:43 int-e: it depends on whether we have a better claim to anyone else to the word "esoteric" in programming contexts 04:24:45 * int-e wonders how big the largest channel violating that rule is. 04:24:50 I'd argue we do 04:25:04 (I think it was cpressey who came up with the word?) 04:25:41 [[\ () /]] https://esolangs.org/w/index.php?diff=65088&oldid=58317 * YamTokTpaFa * (+42) 04:25:43 (#math got away with it for quite a year or two but was eventually converted.) 04:26:06 ais523: Obviously I'm not going to ask :) 04:27:03 [[User talk:Randairox]] N https://esolangs.org/w/index.php?oldid=65089 * YamTokTpaFa * (+318) Created page with "==Categorizing [[\ () /]]== Hello, I happened to see your article on [[Special:UncategorizedPages]]. Is it [[:Category:Brainfuck derivatives|a derivation of brainfuck]]..." 04:27:35 [[~-Hash]] https://esolangs.org/w/index.php?diff=65090&oldid=38408 * YamTokTpaFa * (+59) 04:28:05 [[`LML]] https://esolangs.org/w/index.php?diff=65091&oldid=54446 * YamTokTpaFa * (+59) 04:28:57 Why don't all the retro music things have something like DeepSID? 04:29:00 <3 DeepSID 04:29:49 [[User talk:Ais523]] https://esolangs.org/w/index.php?diff=65092&oldid=65085 * Ais523 * (+1215) /* Could I be a new admin of this wiki? */ you don't need to be an admin to do that 04:29:53 [[What the fuck is the Internet?]] https://esolangs.org/w/index.php?diff=65093&oldid=53725 * YamTokTpaFa * (+59) 04:30:08 [[Varnand/Python Implementation]] https://esolangs.org/w/index.php?diff=65094&oldid=64504 * YamTokTpaFa * (+30) 04:30:37 You mentioned SNES having a separate computer with separate memory for music, and I also thought of a similar thing, although mine is a bit different, that buffers only one sample ahead on each of four channels (if you want more, you have to do mixing yourself), and then one instruction waits for and acknowledges an event and jumps to the event handler. 04:30:54 [[YesNoMaybeUnknown]] https://esolangs.org/w/index.php?diff=65095&oldid=60094 * YamTokTpaFa * (+24) 04:31:35 (The possible events are a timeout event for each channel, and receiving data.) 04:37:05 [[User:YamTokWae]] https://esolangs.org/w/index.php?diff=65096&oldid=57530 * YamTokTpaFa * (+134) 04:39:12 [[? $51=]] https://esolangs.org/w/index.php?diff=65097&oldid=64602 * YamTokTpaFa * (+9) +WIP and moved CAT into bottom 04:40:04 [[Seabass]] https://esolangs.org/w/index.php?diff=65098&oldid=64724 * YamTokTpaFa * (+49) 04:42:22 can't you say this channel is the eofficial channel of the esolang wiki 04:43:14 `grwp rules 04:43:14 No output. 04:43:19 `quote rules 04:43:20 252) Is anyone in here who knows cricket rules and has experience? What if I told you the baseball rules in a british accent? \ 657) is there any evidence that Jesus knew the rules of tic-tac-toe? \ 1327) ARGH! I just saw something on the web that is publicly available, but I shouldn't have looked at it, and now I can't unsee it. I was naive, I used to imagine that the world was a nicer place. It's the r 04:43:24 I think it would be official channel of esolang wiki. 04:43:55 fungot`: what's with the `? 04:43:55 int-e: you don't with rez... kinda like a " smart" stack copying. it also had the amazing poke to tamper with them. 04:44:26 I think fungot` is its alternate nick 04:44:26 ais523: you can make a new object structure, as far as syncretic abominations go, it is sent to b, f, g) h), but 04:44:45 fungot`: "syncretic" has been said often enough to not be fnorded? 04:44:46 ais523: maybe :p though norway was swedish until 1906, so you can basically add to extend-environment: http://www.shiro.dreamhost.com/ scheme/ vault/ escm.html some 04:44:49 @wn syncretic 04:44:50 *** "syncretic" wn "WordNet (r) 3.0 (2006)" 04:44:50 syncretic 04:44:50 adj 1: relating to a historical tendency for a language to 04:44:50 reduce its use of inflections; "modern English is a 04:44:50 syncretic language" [syn: {syncretic}, {syncretical}, 04:44:52 [3 @more lines] 04:45:06 @more 04:45:06 {syncretistic}, {syncretistical}] 04:45:06 2: of or characterized by syncretism [syn: {syncretic}, 04:45:06 {syncretical}, {syncretistic}, {syncretistical}] 04:45:14 I am not surprised I didn't know that word 04:47:23 @wn syncretism 04:47:25 *** "syncretism" wn "WordNet (r) 3.0 (2006)" 04:47:25 syncretism 04:47:25 n 1: the union (or attempted fusion) of different systems of 04:47:25 thought or belief (especially in religion or philosophy); 04:47:25 "a syncretism of material and immaterial theories" 04:47:27 2: the fusion of originally different inflected forms (resulting 04:47:29 in a reduction in the use of inflections) 04:47:32 aka the tendency of people to speak with their mouth closed? 04:48:09 it's probably more like the way that, e.g., English mostly doesn't have gendered inflections for adjectives even though many of its parent languages do 04:48:17 Can a 65816 be put into emulation mode with its ... bank and page register thingies non-0? 04:48:19 (there's at least one case where it does, "blond" for males, "blonde" for females) 04:49:14 :O 04:49:19 I never knew that! 04:49:25 I never thought about those two words being different 04:49:50 -!- nfd9001 has joined. 04:50:50 "Finally, emulation mode code does not have to be in bank 0, as long as there are no interrupts." 04:54:29 oh yes, easier times 04:55:15 (when you could assess the ramifications of disabling interrupts) 04:55:27 and I mean "simpler" not "easier" 04:57:15 65816 has an "abort" thingy which looks intended to allow for an MMU 04:58:56 is that the SNES CPU? 05:00:25 Almost 05:00:35 Apparently SNES is somethign else that's based on it 05:01:03 https://en.wikipedia.org/wiki/Ricoh_5A22 05:01:17 Huh, apparently it is more different to the 65812 than the 6510 is to 6502 05:02:49 " When running the 65802 in an older machine, such as Apple II c, II e, or II Plus, you will probably 05:02:49 call your 65802 programs from a 6502 operating system or program." 05:03:03 it's "different /from/" 05:04:02 Huh. I was thinking about a 65816 OS hosting 6502 programs, but the other way around sounds like DOS extenders I think 05:05:01 (Although in the 65802 case it wouldn't help use more memory, since it's hardware compatible and so limited to 64k) 05:05:50 [[Pxem]] https://esolangs.org/w/index.php?diff=65099&oldid=64992 * YamTokTpaFa * (+198) /* Instructions */ 05:09:13 [[Pxem]] https://esolangs.org/w/index.php?diff=65100&oldid=65099 * YamTokTpaFa * (-198) Undoing 05:09:25 -!- ais523 has quit (Quit: quit). 05:28:16 I wonder what a CPU intended to be efficient at emulating semi-arbitrary CPU architectures, and possibly multitasking among multiple occurring emulations would look like 05:29:08 Possibly with a simple translation step beforehand. Although now I'm wondering if that's skippable 05:34:51 well that would save you the hassle of instruction decoding 05:35:31 So you can focus on functionality, and keeping track of how the original program locations relate to the new ones. 05:38:19 o.O apparently the manual I was reading is "dangerously wrong" 05:38:33 " 05:38:33 This is a "pure text" version of the Eyes/Lichty book, however it is rife with very dangerous typos (wrong opcodes, etc.) in many areas, and contains a large number of formatting/layout mistakes not present in the original book. Bill Mensch (6502/65C02/65816 architect/designer) confirmed these mistakes, stating WDC is in the process of fixing them. If at all possible, use the newer PDF mentioned above." 05:38:39 https://wiki.nesdev.com/w/index.php/Programming_guide 05:41:59 This may be unexplored territory (though Transmeta comes to mind, but they still only targeted a particular platform) so far our emulation problems have mostly be solved by Moore's law, boosted by just-in-time compilers :P 05:42:08 *been 06:03:22 /topic rife with very dangerous typos 06:04:05 [[2015]] M https://esolangs.org/w/index.php?diff=65101&oldid=46056 * A * (+41) YamTokTpaFa I am going to help you. 06:04:44 [[1st-Worst]] M https://esolangs.org/w/index.php?diff=65102&oldid=55823 * A * (+68) 06:05:03 [[2015]] M https://esolangs.org/w/index.php?diff=65103&oldid=65101 * A * (+28) Whoops 06:05:45 [[2/9 of an esolang]] M https://esolangs.org/w/index.php?diff=65104&oldid=59665 * A * (+68) 06:06:27 -!- int-e has set topic: IOCCC winners are denounced; source code release delayed | Welcome to the international center for esoteric programming language design, development, and deployment! | https://esolangs.org | logs: https://esolangs.org/logs/ http://codu.org/logs/_esoteric/ http://tunes.org/~nef/logs/esoteric/?C=M;O=D. 06:06:55 [[.m@dpr'a'prozessor]] M https://esolangs.org/w/index.php?diff=65105&oldid=38378 * A * (+68) 06:08:07 [[.mOdMoDwOrM]] M https://esolangs.org/w/index.php?diff=65106&oldid=65077 * A * (+63) YamTokTpaFa You simply summarize the article. 06:09:15 [[ASCII]] M https://esolangs.org/w/index.php?diff=65107&oldid=60469 * A * (+22) 06:09:39 [[ASCII art/mandelbrot]] M https://esolangs.org/w/index.php?diff=65108&oldid=43257 * A * (+49) 06:10:58 [[2006 Esolang Contest]] M https://esolangs.org/w/index.php?diff=65109&oldid=16622 * A * (+18) From 2006 (I had to add a category though) 06:11:28 [[2D BF]] M https://esolangs.org/w/index.php?diff=65110&oldid=55819 * A * (+41) 06:12:10 [[2xNeg]] M https://esolangs.org/w/index.php?diff=65111&oldid=52403 * A * (+66) 06:13:03 [[4]] M https://esolangs.org/w/index.php?diff=65112&oldid=58588 * A * (+91) 06:13:49 [[4-list]] M https://esolangs.org/w/index.php?diff=65113&oldid=55998 * A * (+75) 06:14:31 [[5command]] M https://esolangs.org/w/index.php?diff=65114&oldid=39732 * A * (+65) 06:15:26 [[7Basic]] M https://esolangs.org/w/index.php?diff=65115&oldid=44264 * A * (+41) 06:15:56 [[=]] M https://esolangs.org/w/index.php?diff=65116&oldid=55653 * A * (+41) 06:16:34 [[@]] M https://esolangs.org/w/index.php?diff=65117&oldid=52411 * A * (+96) 06:17:41 [[AAEEEEEEEEEI]] M https://esolangs.org/w/index.php?diff=65118&oldid=53635 * A * (+74) 06:18:38 [[ADDI]] https://esolangs.org/w/index.php?diff=65119&oldid=45361 * A * (+68) 06:19:32 [[AFTL]] M https://esolangs.org/w/index.php?diff=65120&oldid=42714 * A * (+94) 06:21:00 [[AIV]] M https://esolangs.org/w/index.php?diff=65121&oldid=45094 * A * (+68) 06:21:32 [[ALL]] M https://esolangs.org/w/index.php?diff=65122&oldid=50921 * A * (+41) 06:22:28 [[ARGENTOS]] M https://esolangs.org/w/index.php?diff=65123&oldid=50219 * A * (+66) I can't understand it. 06:23:12 [[AT]] M https://esolangs.org/w/index.php?diff=65124&oldid=61495 * A * (+68) 06:24:40 [[Aaargh++]] M https://esolangs.org/w/index.php?diff=65125&oldid=33976 * A * (+109) 06:26:04 [[Z80golf]] M https://esolangs.org/w/index.php?diff=65126&oldid=54232 * A * (+71) 07:00:24 [[Keg+ Language Design]] N https://esolangs.org/w/index.php?oldid=65127 * JonoCode9374 * (+7407) Big page of my plans 07:09:39 -!- andrewtheircer has joined. 07:09:43 hello 07:09:44 eggs 07:20:31 I wonder if PEOSIX or EsoAPI pages should link to PSOX >.>. Also I should repoint the links on PSOX page to GitHub 07:24:42 [[PSOX]] https://esolangs.org/w/index.php?diff=65128&oldid=25373 * Sgeo * (-425) Who uses Assembla anymore? 07:34:42 [[ACL]] https://esolangs.org/w/index.php?diff=65129&oldid=65020 * Hanzlu * (-558) 07:34:59 * Sgeo stares at LBYTES and wonder if that's why ehird complained that API authors should know what malloc is. 07:36:23 The PSOX server doesn't have a way to know how much space to allocate 07:36:32 noic 07:38:37 [[Talk:Keg+ Language Design]] N https://esolangs.org/w/index.php?oldid=65130 * A * (+368) Created page with "I see. So Keg+ is harder to golf than Keg, as more parts are mandatory compared to Keg. (For example, the for loop now requires iteration.) However, some other problems might..." 07:41:29 [[Talk:Keg+ Language Design]] M https://esolangs.org/w/index.php?diff=65131&oldid=65130 * A * (+71) 07:42:41 [[Talk:Keg+ Language Design]] https://esolangs.org/w/index.php?diff=65132&oldid=65131 * A * (+146) 07:43:07 [[Talk:Keg+ Language Design]] https://esolangs.org/w/index.php?diff=65133&oldid=65132 * A * (+40) 07:48:37 [[Keg+ Language Design]] M https://esolangs.org/w/index.php?diff=65134&oldid=65127 * A * (+297) /* Completely New */ 07:50:28 [[Talk:Keg+ Language Design]] M https://esolangs.org/w/index.php?diff=65135&oldid=65133 * A * (+59) 07:50:48 [[Talk:Keg+ Language Design]] M https://esolangs.org/w/index.php?diff=65136&oldid=65135 * A * (-71) 07:52:53 REGEX1 = re.compile(r"((?:[^\x00]|\x00{2}(?:.|\Z))*)(\x00.*)?\Z", re.S) 07:53:18 .....I'd like to hope that if I were to write such a regex today, I'd at least give it a better name 08:03:30 [[Talk:Keg+ Language Design]] https://esolangs.org/w/index.php?diff=65137&oldid=65136 * JonoCode9374 * (+361) 08:05:32 -!- Lord_of_Life has quit (Ping timeout: 258 seconds). 08:07:57 -!- Lord_of_Life has joined. 08:08:20 [[Talk:Keg+ Language Design]] M https://esolangs.org/w/index.php?diff=65138&oldid=65137 * A * (+468) 08:08:44 -!- b_jonas has quit (Ping timeout: 272 seconds). 08:09:15 -!- b_jonas has joined. 08:09:33 jo 08:09:48 [[Talk:Keg+ Language Design]] M https://esolangs.org/w/index.php?diff=65139&oldid=65138 * A * (+40) 08:15:58 [[Talk:Andrew's Programming Language]] https://esolangs.org/w/index.php?diff=65140&oldid=12762 * A * (+247) 08:20:46 i'm andrew too 08:24:17 [[Hi-assembly]] M https://esolangs.org/w/index.php?diff=65141&oldid=55958 * A * (+64) 08:25:21 [[Turing (Iamcalledbob)]] M https://esolangs.org/w/index.php?diff=65142&oldid=55853 * A * (+68) 08:29:14 any esoteric idea? 08:30:31 hello 08:30:33 i dont have any just now 08:30:40 hi rain 08:30:46 what esos have you made 08:37:39 [[Talk:Keg+ Language Design]] https://esolangs.org/w/index.php?diff=65143&oldid=65139 * JonoCode9374 * (+1141) 09:05:34 llll 09:07:22 [[User:JonoCode9374]] https://esolangs.org/w/index.php?diff=65144&oldid=64834 * JonoCode9374 * (+1358) Start of a bit of storytelling 09:10:32 idea: eso that is based in minecraft 09:43:52 -!- ProofTechnique has quit (Ping timeout: 252 seconds). 09:44:36 -!- ^[ has quit (Ping timeout: 252 seconds). 09:45:43 -!- ProofTechnique has joined. 09:47:34 -!- ^[ has joined. 09:49:18 hi ^[ 10:48:53 [[Talk:Keg+ Language Design]] M https://esolangs.org/w/index.php?diff=65145&oldid=65143 * A * (+349) 10:53:49 [[ACL]] https://esolangs.org/w/index.php?diff=65146&oldid=65129 * Hanzlu * (+1777) 10:53:53 [[Talk:Keg+ Language Design]] M https://esolangs.org/w/index.php?diff=65147&oldid=65145 * A * (+37) 10:54:36 [[ACL]] https://esolangs.org/w/index.php?diff=65148&oldid=65146 * Hanzlu * (+0) 10:56:20 -!- andrewtheircer has quit (Remote host closed the connection). 11:25:44 -!- FreeFull has joined. 11:43:27 -!- andrewtheircer has joined. 11:43:28 hi 11:44:50 -!- andrewtheircer has left. 11:47:18 -!- JonoCode9374 has joined. 11:47:50 -!- JonoCode9374 has quit (Remote host closed the connection). 11:53:57 [[Talk:ACL]] https://esolangs.org/w/index.php?diff=65149&oldid=64897 * JonoCode9374 * (+193) /* Comments */ new section 11:54:12 redstone 11:57:02 -!- andrewtheircer has joined. 11:57:05 hi 12:22:15 -!- andrewtheircer has quit (Remote host closed the connection). 12:31:53 " I wonder what a CPU intended to be efficient at emulating semi-arbitrary CPU architectures ... would look like" => it would look like an FPGA 12:33:19 "denounced"? 12:35:58 that's it, I'm downloading 12dicts to hackenv so you can use a proper dictionary instead of whatever random nonsense is in /usr 12:36:12 `fetch http://downloads.sourceforge.net/wordlist/12dicts-6.0.2.zip 12:36:18 20 redirections exceeded. 12:36:28 what 12:36:50 oh jesus, it's hosted on sourceforge 12:38:56 ``` mkdir -p share/dict/12dicts/Lemmatized 12:38:57 No output. 12:39:22 ``` echo http://wordlist.aspell.net/12dicts/ > share/dict/12dicts/readme.hackeso 12:39:24 No output. 12:39:42 `edit share/dict/12dicts/Lemmatized/2+2+3lem.txt 12:39:43 https://hack.esolangs.org/edit/share/dict/12dicts/Lemmatized/2%2B2%2B3lem.txt 12:40:37 `fetch share/dict/12dicts/Lemmatized/2+2+3frq.txt https://hack.esolangs.org/get/share/dict/12dicts/Lemmatized/2+2+3frq.txt 12:40:38 2019-08-03 12:40:38 URL:https://hack.esolangs.org/get/share/dict/12dicts/Lemmatized/2+2+3frq.txt [327329/327329] -> "share/dict/12dicts/Lemmatized/2+2+3frq.txt" [1] 12:42:18 `fetch share/dict/12dicts/Lemmatized/2+2+3cmn.txt https://hack.esolangs.org/get/share/dict/12dicts/Lemmatized/2+2+3cmn.txt 12:42:19 2019-08-03 12:42:18 URL:https://hack.esolangs.org/get/share/dict/12dicts/Lemmatized/2+2+3cmn.txt [240505/240505] -> "share/dict/12dicts/Lemmatized/2+2+3cmn.txt" [1] 12:43:36 `fetch share/dict/12dicts/ReadMe.html https://hack.esolangs.org/get/share/dict/12dicts/ReadMe.html 12:43:37 2019-08-03 12:43:37 URL:https://hack.esolangs.org/get/share/dict/12dicts/ReadMe.html [116952/116952] -> "share/dict/12dicts/ReadMe.html" [1] 12:46:16 ``` mkdir -p share/dict/12dicts/American 12:46:17 No output. 12:46:20 `fetch share/dict/12dicts/American/6of12.txt https://hack.esolangs.org/get/share/dict/12dicts/American/6of12.txt 12:46:21 2019-08-03 12:46:21 URL:https://hack.esolangs.org/get/share/dict/12dicts/American/6of12.txt [302206/302206] -> "share/dict/12dicts/American/6of12.txt" [1] 12:46:40 `hurl 12:46:41 https://hack.esolangs.org/repo/ 12:47:17 `fetch share/dict/12dicts/American/2of12.txt https://hack.esolangs.org/get/share/dict/12dicts/American/2of12.txt 12:47:18 2019-08-03 12:47:18 URL:https://hack.esolangs.org/get/share/dict/12dicts/American/2of12.txt [389024/389024] -> "share/dict/12dicts/American/2of12.txt" [1] 12:47:54 `fetch share/dict/12dicts/alllists.html https://hack.esolangs.org/get/share/dict/12dicts/alllists.html 12:47:55 2019-08-03 12:47:54 URL:https://hack.esolangs.org/get/share/dict/12dicts/alllists.html [27214/27214] -> "share/dict/12dicts/alllists.html" [1] 12:50:47 `fetch share/dict/12dicts/American/2of12inf-part0.txt https://hack.esolangs.org/get/share/dict/12dicts/American/2of12inf-part0.txt 12:50:48 2019-08-03 12:50:48 URL:https://hack.esolangs.org/get/share/dict/12dicts/American/2of12inf-part0.txt [455960/455960] -> "share/dict/12dicts/American/2of12inf-part0.txt" [1] 12:51:07 `fetch share/dict/12dicts/American/2of12inf-part1.txt https://hack.esolangs.org/get/share/dict/12dicts/American/2of12inf-part1.txt 12:51:08 2019-08-03 12:51:07 URL:https://hack.esolangs.org/get/share/dict/12dicts/American/2of12inf-part1.txt [343509/343509] -> "share/dict/12dicts/American/2of12inf-part1.txt" [1] 12:51:36 ``` cat share/dict/12dicts/American/2of12inf-part?.txt > share/dict/12dicts/American/2of12inf.txt 12:51:38 No output. 12:52:23 ``` grep -Ei '\<[qwertyuiop]{8,}\>' share/dict/12dicts/American/2of12inf.txt 12:52:24 etiquette \ perpetuity \ pirouette \ portiere \ potpourri \ preppier \ preterit \ preterite \ prettier \ priority \ properer \ property \ proprietor \ propriety \ prototype \ puppeteer \ puppetry \ putterer \ repertoire \ repertory \ reporter \ requiter \ territory \ torturer \ totterer \ twittery \ typewrite \ typewriter \ typewrote 12:52:36 ``` rm -v share/dict/12dicts/American/2of12inf-part?.txt 12:52:38 removed 'share/dict/12dicts/American/2of12inf-part0.txt' \ removed 'share/dict/12dicts/American/2of12inf-part1.txt' 12:53:09 `fetch share/dict/12dicts/American/3esl.txt https://hack.esolangs.org/get/share/dict/12dicts/American/3esl.txt 12:53:10 2019-08-03 12:53:10 URL:https://hack.esolangs.org/get/share/dict/12dicts/American/3esl.txt [196421/196421] -> "share/dict/12dicts/American/3esl.txt" [1] 12:56:18 ok, now what was your original question about palindromes? 12:57:49 english palindromes made of AHIMOTUVWXY 12:59:16 ``` perl -ne '/^([ahimotuvwxy]+)[&#=<^~+]?$/i && lc $1 eq reverse lc $1 and print $1, " "' share/dict/12dicts/American/2of12inf.txt 12:59:16 aha hah huh mom mum oho tat tit toot tot tut wow 12:59:34 int-e: sorry, it was a rethorical question, I was just slow to type up the code 12:59:42 apparently there aren't many 13:00:05 ``` perl -ne '/^([ahimotuvwxyEN]+)[&#=<^~+]?$/i && lc $1 eq reverse lc $1 and print $1, " "' share/dict/12dicts/American/2of12inf.txt # what if we allow a bit more letters? 13:00:10 aha eve ewe eye hah huh minim mom mum noon nun oho tat tenet tit toot tot tut wow 13:00:23 ``` perl -ne '/^([ahimotuvwxyENSLR]+)[&#=<^~+]?$/i && lc $1 eq reverse lc $1 and print $1, " "' share/dict/12dicts/American/2of12inf.txt # even more? 13:00:25 aha ere eve ewe eye hah huh level minim mom mum noon nun oho rotor sees sexes shahs sis solos stats stets tat tenet tit toot tot tut wow 13:01:19 oh wait 13:01:29 ``` perl -ne '/^\s*([ahimotuvwxy]+)[&#=<^~+]?$/i && lc $1 eq reverse lc $1 and print $1, " "' share/dict/12dicts/American/2of12inf.txt 13:01:30 aha hah huh mom mum oho tat tit toot tot tut wow 13:01:33 hmm 13:02:06 oh right, this isn't one of the lemmatized lists, it doesn't have leading whitespace 13:04:24 ``` perl -ne '/^\s*([a-z]+)[&#=<^~+]*$/i && lc $1 eq reverse lc $1 and print $1, " "' share/dict/12dicts/American/2of12inf.txt # there aren't many palyndromic single words even if you allow all letters 13:04:25 aha bib bob boob bub civic dad deed deified did dud eke ere eve ewe eye gag gig hah huh kayak kook level madam minim mom mum noon nun oho pap peep pep pip poop pop pullup pup radar redder refer rotor sagas sees sexes shahs sis solos stats stets tat tenet tit toot tot tut wow 13:04:42 I think I looked for words whose reverse is also a word a month ago or so 13:07:52 "diaper" vs "repaied" was one of the longest pairs 13:12:45 ``` perl -ne '/^([a-z]+)[&#=<^~+]?/ or die "syntax $_; $w=$1; $w{$w}++; 6 <= length$w && $w ne reverse($w) && $w{reverse$w} and print reverse($w)."|$w ";' American/2of12inf.txt 13:12:46 String found where operator expected at -e line 1, at end of line \ (Missing semicolon on previous line?) \ Can't find string terminator '"' anywhere before EOF at -e line 1. 13:12:51 ``` perl -ne '/^([a-z]+)[&#=<^~+]?/ or die "syntax $_"; $w=$1; $w{$w}++; 6 <= length$w && $w ne reverse($w) && $w{reverse$w} and print reverse($w)."|$w ";' American/2of12inf.txt 13:12:52 Can't open American/2of12inf.txt: No such file or directory. 13:12:59 ``` perl -ne '/^([a-z]+)[&#=<^~+]?/ or die "syntax $_"; $w=$1; $w{$w}++; 6 <= length$w && $w ne reverse($w) && $w{reverse$w} and print reverse($w)."|$w ";' share/dict/12dicts/American/2of12inf.txt 13:13:00 animal|lamina deffer|reffed denier|reined eviler|relive diaper|repaid looter|retool deliver|reviled drawer|reward denies|seined retros|sorter recaps|spacer sloops|spools snoops|spoons sleets|steels desserts|stressed sports|strops redraw|warder 13:13:06 those are the long ones 13:13:24 ``` perl -ne '/^([a-z]+)[&#=<^~+]?/ or die; $w=$1; $w{$w}++; 5 == length$w && $w ne reverse($w) && $w{reverse$w} and print reverse($w)."|$w ";' share/dict/12dicts/American/2of12inf.txt 13:13:25 decaf|faced decal|laced devil|lived denim|mined pacer|recap lager|regal leper|repel lever|revel fires|serif keels|sleek peels|sleep pools|sloop snaps|spans deeps|speed snips|spins loops|spool knits|stink loots|stool spots|stops parts|strap ports|strop draws|sward sprat|tarps relit|tiler remit|timer smart|trams debut|tubed rebut|tuber straw|warts 13:14:03 I thought this was in the logs somewhere, but it's not 13:20:17 oh fuck 13:23:11 ``` perl -e 'while(<>) { ($w) = /^([a-z]+)[!%&#=<^~+\r]*$/ or die "syntax $_"; if (reverse($w) eq $w) { print "$w " } }' share/dict/12dicts/American/2of12inf.txt 13:23:12 aha bib bob boob bub civic dad deed deified did dud eke ere eve ewe eye gag gig hah huh kayak kook level madam minim mom mum noon nun oho pap peep pep pip poop pop pullup pup radar redder refer rotor sagas sees sexes shahs sis solos sos stats stets tat tenet tit toot tot tut wow 13:23:21 ``` perl -e 'while(<>) { ($w) = /^([ahimotuvwxy]+)[!%&#=<^~+\r]*$/ or die "syntax $_"; if (reverse($w) eq $w) { print "$w " } }' share/dict/12dicts/American/2of12inf.txt 13:23:22 syntax aardvark 13:23:25 no wait 13:24:01 ``` perl -e 'while(<>) { ($w) = /^([a-z]+)[!%&#=<^~+\r]*$/ or die "syntax $_"; if ($w !~ y/ahimotuvwxy//c && reverse($w) eq $w) { print "$w " } }' share/dict/12dicts/American/2of12inf.txt 13:24:05 aha hah huh mom mum oho tat tit toot tot tut wow 13:24:53 ``` perl -e 'while(<>) { ($w) = /^([a-z]+)[!%&#=<^~+\r]*$/ or die "syntax $_"; $w{$w}++; if ($w !~ y/ahimotuvwxy//c && reverse($w) ne $w && $w{reverse($w)}) { print "$w " } }' share/dict/12dicts/American/2of12inf.txt 13:24:54 ha ma oh tam ti tom um ya yam yaw 13:29:17 -!- doesthiswork has joined. 13:36:46 -!- adu has quit (Quit: adu). 13:55:53 [[Talk:ACL]] https://esolangs.org/w/index.php?diff=65150&oldid=65149 * Hanzlu * (+74) 14:02:22 [[ACL]] https://esolangs.org/w/index.php?diff=65151&oldid=65148 * Hanzlu * (-4) 14:06:29 [[ACL]] https://esolangs.org/w/index.php?diff=65152&oldid=65151 * Hanzlu * (-143) 14:08:37 [[ACL]] https://esolangs.org/w/index.php?diff=65153&oldid=65152 * Hanzlu * (-31) 14:26:27 [[User:YamTokTpaFa/sandbox3]] https://esolangs.org/w/index.php?diff=65154&oldid=63951 * YamTokTpaFa * (-633) Blanked the page 14:27:26 [[Morsefuck]] https://esolangs.org/w/index.php?diff=65155&oldid=54772 * YamTokTpaFa * (+35) 14:28:10 [[ACL]] https://esolangs.org/w/index.php?diff=65156&oldid=65153 * Hanzlu * (-399) 14:28:29 [[ACL]] https://esolangs.org/w/index.php?diff=65157&oldid=65156 * Hanzlu * (+2) 14:30:13 [[Sd]] https://esolangs.org/w/index.php?diff=65158&oldid=50839 * YamTokTpaFa * (+77) 14:30:43 [[Haddock]] M https://esolangs.org/w/index.php?diff=65159&oldid=54433 * YamTokTpaFa * (+17) 14:31:47 [[!Tautologos]] https://esolangs.org/w/index.php?diff=65160&oldid=46734 * YamTokTpaFa * (+28) 14:32:24 [[Jumper]] https://esolangs.org/w/index.php?diff=65161&oldid=43918 * YamTokTpaFa * (+54) 14:35:04 [[ACL]] https://esolangs.org/w/index.php?diff=65162&oldid=65157 * Hanzlu * (-1) 14:35:43 [[User:YamTokTpaFa]] https://esolangs.org/w/index.php?diff=65163&oldid=64853 * YamTokTpaFa * (+282) 14:36:21 [[ACL]] https://esolangs.org/w/index.php?diff=65164&oldid=65162 * Hanzlu * (+1) 14:37:04 [[Template:Infobox proglang]] https://esolangs.org/w/index.php?diff=65165&oldid=40371 * YamTokTpaFa * (+13) 14:41:25 [[Template talk:Infobox proglang]] N https://esolangs.org/w/index.php?oldid=65166 * YamTokTpaFa * (+469) Created page with "== Template improving discussion == First of all I don't think {{{name}}} essential; why not {{{name|{{PAGENAME}}}}}? If you don't specify to..." 14:41:44 [[Structure-free Query Language]] https://esolangs.org/w/index.php?diff=65167&oldid=45208 * YamTokTpaFa * (+42) 14:42:48 [[Unfuck]] https://esolangs.org/w/index.php?diff=65168&oldid=49136 * YamTokTpaFa * (+58) 14:43:09 so much activity 15:01:00 [[ACL]] https://esolangs.org/w/index.php?diff=65169&oldid=65164 * Hanzlu * (+44) 15:04:12 [[Talk:Collatz sequence]] N https://esolangs.org/w/index.php?oldid=65170 * Hanzlu * (+127) Created page with "==Turing-completeness== Does a Collatz sequence program prove Turing-completeness? --[[User:Hanzlu]] 18:04, 3 August 2019 (UTC)" 15:10:13 -!- Phantom_Hoover has joined. 15:23:44 -!- heroux has quit (Ping timeout: 268 seconds). 15:25:11 -!- heroux has joined. 15:39:12 -!- Sgeo has quit (Ping timeout: 245 seconds). 15:48:20 -!- andrewtheircer has joined. 15:48:54 hi 15:49:59 -!- adu has joined. 16:35:50 -!- andrewtheircer has quit (Remote host closed the connection). 17:15:19 [[Talk:Collatz sequence]] https://esolangs.org/w/index.php?diff=65171&oldid=65170 * Ais523 * (+588) generalized Collatz [[Tip]]; the original Collatz sequence itself is probably not Turing-complete, though 17:29:35 Do some SMTP servers tamper with the message ID? 17:31:23 I received a email message with a "X-Android-Message-ID" header, containing the same contents as the "Message-ID" header. I don't know why, or if perhaps the email client just added it to duplicate the message ID. Do you know? 17:46:50 [[ACL]] https://esolangs.org/w/index.php?diff=65172&oldid=65169 * Hanzlu * (-44) 18:18:22 -!- doesthiswork has quit (Ping timeout: 245 seconds). 18:38:25 -!- Sgeo has joined. 18:42:17 -!- xkapastel has joined. 18:46:48 -!- Sgeo_ has joined. 18:49:55 -!- Sgeo has quit (Ping timeout: 246 seconds). 19:01:24 [[ACL]] https://esolangs.org/w/index.php?diff=65173&oldid=65172 * Hanzlu * (+766) 19:01:46 [[ACL]] https://esolangs.org/w/index.php?diff=65174&oldid=65173 * Hanzlu * (+2) 19:07:50 -!- MDude has quit (Quit: Going offline, see ya! (www.adiirc.com)). 19:11:43 -!- Sgeo_ has quit (Ping timeout: 245 seconds). 19:14:33 -!- Sgeo has joined. 20:04:08 -!- Lord_of_Life_ has joined. 20:07:16 -!- Lord_of_Life has quit (Ping timeout: 246 seconds). 20:07:17 -!- Lord_of_Life_ has changed nick to Lord_of_Life. 20:40:24 `perl -eopen$I,"<", "share/dict/12dicts/American/2of12inf.txt"; while(<$I>){ ($w)=/^([a-z]+)[!%\r]*$/ or die; $w{$w}++; $r=$w=~y/a-z/n-za-m/r; $w{$r} and print "$w|$r "; } # there aren't many common english words that are still words when rot13ed 20:40:24 nag|ant nowhere|abjurer nu|ah nun|aha oho|bub one|bar ones|barf onyx|balk or|be ova|bin pent|crag rail|envy reef|errs roof|ebbs she|fur sync|flap tang|gnat try|gel vex|irk 20:42:03 "vex" with "irk" is an interesting pair 20:49:58 the dictionary also reveals that "motherfucking" is one of the longest words in which no letter appears twice 21:05:34 Huh. That website used to not be a shitty blog with porn: https://web.archive.org/web/20040401085825/http://www.2a03.org/index.php 21:15:26 b_jonas: That's a lot more words that rot13 to other words than I would have expected. 21:17:51 tswett[m]: http://www.darthsanddroids.net/episodes/0142.html is slightly relevant 21:25:36 This person sounds like an ahole 21:25:37 "You probably think 64 kilobytes doesn't sound much when a small game now takes 8 gigabytes, but that's 'cos modern games are sloppy, inefficient, fat and lazy - like the basement dwelling losers who wrote them!!! 21:25:37 " 21:31:26 -!- xkapastel has quit (Quit: Connection closed for inactivity). 21:31:35 Other than that and the eye-bleeding style choices, these tutorials look interesting 21:32:05 https://www.chibiakumas.com/z80/ 21:58:18 -!- xkapastel has joined. 22:22:23 -!- MDude has joined. 23:16:36 -!- Phantom_Hoover has quit (Ping timeout: 244 seconds). 23:22:43 according to my dictionary 'tendentiousness' is the longest word that can be typed using only the home row on Dvorak 23:23:14 for QWERTY it's 'alfalfa' 23:24:05 `perl -eopen$I,"<", "share/dict/12dicts/American/2of12inf.txt"; while(<$I>){ ($w)=/^([a-z]+)[!%\r]*$/ or die; if ($w !~ y/aueoidhtns//c) { print "$w "; } } # let's see 23:24:07 obviously, having 5 vowels instead of 1 helps 23:24:07 ad add added addend addenda addends addition additions adds adenine adenines adenoid adenoids adhesion adhesions adieu adieus adios ado ados ads aeon aeons aesthete aesthetes ah aha ahead aid aide aided aides aids an anaesthesia anaesthesias anaesthetist anaesthetists and andante andantes anent anesthesia anesthesias anesthetist anesthetists ani anion anions anise aniseed aniseeds anises anisette anisettes annotate annotated annotates annotation annotation 23:24:16 `perl -eopen$I,"<", "share/dict/12dicts/American/2of12inf.txt"; while(<$I>){ ($w)=/^([a-z]+)[!%\r]*$/ or die; if ($w !~ y/asdfghjkl//c) { print "$w "; } } 23:24:16 ad add adds ads ah aha alas alfalfa alfalfas alga algal all alls as ash ask asks ass dad dads dash fa fad fads fag fags fall falls fas flag flags flak flash flask flasks gad gads gaff gaffs gag gaga gags gal gala galas gall galls gals gas gash glad glads glass ha had hadj hag hags hah hajj halal halals half hall halls has hash jag jags la lad lads lag lags las lash lass sad sag saga sagas sags salad salads salsa salsas sash sass sh shad shads shag shags sh 23:24:27 `perl -eopen$I,"<", "share/dict/12dicts/American/2of12inf.txt"; while(<$I>){ ($w)=/^([a-z]+)[!%\r]*$/ or die; if ($w !~ y/aueoidhtns//c && 12 <= $w) { print "$w "; } } # let's see 23:24:28 No output. 23:24:31 `perl -eopen$I,"<", "share/dict/12dicts/American/2of12inf.txt"; while(<$I>){ ($w)=/^([a-z]+)[!%\r]*$/ or die; if ($w !~ y/aueoidhtns//c && 10 <= $w) { print "$w "; } } # let's see 23:24:32 No output. 23:24:36 `perl -eopen$I,"<", "share/dict/12dicts/American/2of12inf.txt"; while(<$I>){ ($w)=/^([a-z]+)[!%\r]*$/ or die; if ($w !~ y/aueoidhtns//c && 8 <= $w) { print "$w "; } } # let's see 23:24:37 No output. 23:24:39 hmm 23:24:42 `perl -eopen$I,"<", "share/dict/12dicts/American/2of12inf.txt"; while(<$I>){ ($w)=/^([a-z]+)[!%\r]*$/ or die; if ($w !~ y/aueoidhtns//c && 6 <= $w) { print "$w "; } } # let's see 23:24:43 No output. 23:24:51 something's wrong here 23:25:00 `perl -eopen$I,"<", "share/dict/12dicts/American/2of12inf.txt"; while(<$I>){ ($w)=/^([a-z]+)[!%\r]*$/ or die; if ($w !~ y/aueoidhtns//c && 12 <= length$w) { print "$w "; } } # let's see 23:25:00 anaesthesias anaesthetist anaesthetists anesthetists assassinated assassinates assassination assassinations assiduousness assiduousnesses astutenesses attenuations attestations daintinesses destinations destitutions detestations dishonesties heinousnesses hideousnesses hootenannies hotheadedness hotheadednesses inattentions indentations innatenesses insidiousness insidiousnesses insinuations instantaneous instantiated instantiates institutions intentnesses 23:25:06 `perl -eopen$I,"<", "share/dict/12dicts/American/2of12inf.txt"; while(<$I>){ ($w)=/^([a-z]+)[!%\r]*$/ or die; if ($w !~ y/aueoidhtns//c && 14 <= length$w) { print "$w "; } } # let's see 23:25:07 assassinations assiduousnesses hotheadednesses insidiousnesses nauseousnesses sensuousnesses studiousnesses tendentiousness tendentiousnesses unsteadinesses 23:25:19 `perl -eopen$I,"<", "share/dict/12dicts/American/2of12inf.txt"; while(<$I>){ ($w)=/^([a-z]+)[!%\r]*$/ or die; if ($w !~ y/asdfghjkl//c && 8 <= length$w) { print "$w "; } } # let's see 23:25:20 alfalfas 23:26:11 kmc: that sounds right. I don't know what tendentiousness means, but 12dicts agrees that it's a word 23:26:29 I do know that alfalfa is some kind of crop plant 23:26:51 tendentious means 'Having a tendency; written or spoken with a partisan, biased or prejudiced purpose, especially a controversial one.' 23:31:02 `perl -eopen$I,"<", "share/dict/12dicts/American/2of12inf.txt"; while(<$I>){ ($w)=/^([a-z]+)[!%\r]*$/ or die; if ($w !~ y/qwertasdfgzxcvb//c) { push @w,$w; push @k,length$w; } } print "$_ " for @w[sort {$k[$b]<=>$k[$a]} keys@w] # you probably know about the qwerty left hand words 23:31:02 abracadabras aftereffects desegregated desegregates reverberated reverberates stewardesses watercresses abracadabra aftereffect aftertastes asseverated asseverates crabgrasses desegregate effervesced effervesces exacerbated exacerbates exaggerated exaggerates readdressed readdresses reverberate sassafrases stagecrafts statecrafts sweetbreads vertebrates abstracted addressees aftercares aftertaste afterwards aggravated aggravates aggregated aggregates assev 23:31:16 `perl -eopen$I,"<", "share/dict/12dicts/American/2of12inf.txt"; while(<$I>){ ($w)=/^([a-z]+)[!%\r]*$/ or die; if ($w !~ y/qwertasdfgzxcvb//) { push @w,$w; push @k,length$w; } } print "$_ " for @w[sort {$k[$b]<=>$k[$a]} keys@w] # and the right hand ones 23:31:17 polyphony lollipop lollypop monopoly nonunion polonium holmium homonym jollily jumpily killjoy kinkily million minimum mullion opinion pillion plumply pumpkin homily hominy hookup johnny kimono limply linkup minion mukluk muumuu phylum pimply pinion pinyin pinyon pippin pompom pompon poplin pullup punkin unholy unhook uphill hilly hippo hippy hokum holly honky hooky hullo humph hunky ilium imply jimmy jinni jolly jumpy junky kinky knoll kooky lippy loony l 23:32:45 were we doing typing speed tests here? 23:34:59 `perl -eopen$I,"<", "share/dict/12dicts/American/2of12inf.txt"; while(<$I>){ ($w)=/^([a-z]+)[!%\r]*$/ or die; $r="qwertasdfgzxcvb"; if ($w =~ /^[$r]?([^$r][$r])+[^$r]?$/) { push @w,$w; push @k,length$w; } } print "$_ " for @w[sort {$k[$b]<=>$k[$a]} keys@w] # and then there's the alternate hand ones 23:34:59 dismantlement authenticity enchantment entitlement proficiency shantytowns skepticisms antisocial handiworks pantheisms producible proficient protozoans shantytown skepticism amendment aneurisms aneurysms auditoria authentic bodyworks busyworks cockfight cyclamens dirigible dismantle disorient divisible dixieland downright downtowns downturns dyspepsia dyspeptic endowment firmament fishbowls flamencos futurisms handiwork pantheism protozoan rhapsodic right 23:35:12 kmc: no, not really 23:35:15 https://www.livechatinc.com/typing-speed-test/#/ Awesome! You type with the speed of 106 WPM (469 CPM). Your accuracy was 97%. Congratulations! 23:35:24 i'm da bomb 23:35:37 I've seen some nice puzzles for which I've used a dictionary recently 23:35:44 well, within a year really 23:36:03 let me find them 23:37:54 that's on dvorak 23:37:55 Neat! You type with the speed of 50 WPM (220 CPM). Your accuracy was 98%. Good job! 23:37:59 on qwerty 23:38:05 so i'm more than twice as fast on dvorak 23:38:16 which is not surprising since i've been using it ~fulltime for more than 15 years 23:38:24 plus it's just better 23:38:31 what's surprising is that i can still touch type qwerty at all 23:39:01 https://slatestarcodex.com/2018/05/06/ot101-threadversarial-collaboropen/#comment-626175 puzzle where you have to add one letter to the clue word or phrase and permute its letters to get the solution word or phrase (and there's a sequel for it somewhere) 23:41:23 https://puzzling.stackexchange.com/q/79223/ english words with rare infixes 23:42:54 eg. what english word has "rsd" in it as an infix? 23:45:59 ``` grep rsd share/dict/12dicts/Lemmatized/2+2+3frq.txt # let's see 23:45:59 ​(Thursday) 2019-08-04: 01:20:01 [[Talk:Keg+ Language Design]] M https://esolangs.org/w/index.php?diff=65175&oldid=65147 * A * (+227) 01:35:00 -!- MDude has quit (Ping timeout: 272 seconds). 02:21:26 -!- xkapastel has quit (Quit: Connection closed for inactivity). 02:52:44 -!- MDude has joined. 03:00:03 [[User:DoggyDogWhirl]] M https://esolangs.org/w/index.php?diff=65176&oldid=64758 * DoggyDogWhirl * (+121) 03:00:07 [[User:DoggyDogWhirl/One-Dimensional Storage Visualizer]] N https://esolangs.org/w/index.php?oldid=65177 * DoggyDogWhirl * (+4216) 03:16:20 Awesome! You type with the speed of 70 WPM (315 CPM). Your accuracy was 94%. Congratulations! 03:16:51 I sort of stayed a while trying to correct one typo 03:17:31 hi Sgeo 03:17:39 Hi 03:25:24 [[256]] https://esolangs.org/w/index.php?diff=65178&oldid=65062 * Areallycoolusername * (+381) 03:48:14 Well played: http://www.sandraandwoo.com/2019/08/01/1103-raccoons-are-the-champions-my-friends/ (the link in the box is relevant: https://arxiv.org/abs/1904.11679 ) 04:42:39 [[256]] https://esolangs.org/w/index.php?diff=65179&oldid=65178 * Areallycoolusername * (+1188) Undid Turing imcompletness proof by User: A. The page is done now. 04:44:17 [[User talk:A]] https://esolangs.org/w/index.php?diff=65180&oldid=65057 * Areallycoolusername * (+156) 04:50:59 [[User:Areallycoolusername]] https://esolangs.org/w/index.php?diff=65181&oldid=64955 * Areallycoolusername * (+10) /* Full List of languages I Made */ 04:51:45 [[Language list]] https://esolangs.org/w/index.php?diff=65182&oldid=64956 * Areallycoolusername * (+10) /* Non-alphabetic */ 04:54:28 [[Talk:256]] https://esolangs.org/w/index.php?diff=65183&oldid=65047 * Areallycoolusername * (+151) 05:04:22 [[User talk:A]] https://esolangs.org/w/index.php?diff=65184&oldid=65180 * Areallycoolusername * (+165) 05:09:46 [[256]] M https://esolangs.org/w/index.php?diff=65185&oldid=65179 * A * (+219) This is what I did to Keg :) 05:14:52 [[User talk:A]] M https://esolangs.org/w/index.php?diff=65186&oldid=65184 * A * (+402) /* Concern */ 05:16:07 [[User talk:A]] M https://esolangs.org/w/index.php?diff=65187&oldid=65186 * A * (+27) /* Concern */ 05:17:12 [[256]] M https://esolangs.org/w/index.php?diff=65188&oldid=65185 * A * (+17) /* Integers instruction (integers from top of stack down to 0), 25 bytes */ I have underestimated how hard to golf 256 is. 05:18:04 [[256]] https://esolangs.org/w/index.php?diff=65189&oldid=65188 * A * (+68) /* Integers instruction (integers from top of stack down to 0), 25 28 bytes */ 05:20:28 [[256]] https://esolangs.org/w/index.php?diff=65190&oldid=65189 * A * (+30) /* Integers instruction (integers from top of stack down to 0), 25 28 bytes */ Making too much edits 05:22:46 [[Talk:256]] M https://esolangs.org/w/index.php?diff=65191&oldid=65183 * A * (-7) 05:25:31 [[Talk:256]] M https://esolangs.org/w/index.php?diff=65192&oldid=65191 * A * (+186) /* People who don't know two golfing languages with different paradigms can not create a good(competitive) golfing language */ 05:28:39 [[User talk:A]] M https://esolangs.org/w/index.php?diff=65193&oldid=65187 * A * (+95) 05:29:34 [[User talk:A]] M https://esolangs.org/w/index.php?diff=65194&oldid=65193 * A * (+66) 05:30:02 [[User talk:A]] M https://esolangs.org/w/index.php?diff=65195&oldid=65194 * A * (-2) 06:42:25 -!- FreeFull has quit. 06:48:27 mooo 07:13:28 -!- xkapastel has joined. 08:07:40 -!- Lord_of_Life has quit (Ping timeout: 268 seconds). 08:09:04 -!- Lord_of_Life has joined. 08:39:40 -!- andrewtheircer has joined. 08:54:28 -!- andrewtheircer has quit (Remote host closed the connection). 09:04:45 -!- Frater_EST has joined. 09:13:00 -!- Frater_EST has left. 09:18:24 [[Special:Log/newusers]] create * SoYouWantMeToDoSomethingButIWont * New user account 09:23:36 [[Esolang:Introduce yourself]] https://esolangs.org/w/index.php?diff=65196&oldid=64948 * SoYouWantMeToDoSomethingButIWont * (+244) /* Introductions */ 09:42:52 -!- xkapastel has quit (Quit: Connection closed for inactivity). 09:57:36 `mkdir share/dict/12dicts/International 09:57:37 No output. 09:57:40 `fetch share/dict/12dicts/International/5d+2a.txt https://hack.esolangs.org/get/share/dict/12dicts/International/5d+2a.txt 09:57:41 2019-08-04 09:57:41 URL:https://hack.esolangs.org/get/share/dict/12dicts/International/5d+2a.txt [638311/638311] -> "share/dict/12dicts/International/5d+2a.txt" [1] 10:14:47 [[Pxem]] https://esolangs.org/w/index.php?diff=65197&oldid=65100 * YamTokTpaFa * (+62) 10:14:49 [[MetaGlow]] N https://esolangs.org/w/index.php?oldid=65198 * SoYouWantMeToDoSomethingButIWont * (+1172) MetaGlow 10:17:56 [[Language list]] https://esolangs.org/w/index.php?diff=65199&oldid=65182 * SoYouWantMeToDoSomethingButIWont * (+15) /* M */ 10:25:21 -!- Frater_EST has joined. 10:25:46 -!- Frater_EST has left. 10:40:11 `fetch share/dict/12dicts/International/3of6game.txt https://hack.esolangs.org/get/share/dict/12dicts/International/3of6game.txt 10:40:15 2019-08-04 10:40:14 URL:https://hack.esolangs.org/get/share/dict/12dicts/International/3of6game.txt [607396/607396] -> "share/dict/12dicts/International/3of6game.txt" [1] 10:55:30 Has anyone here ever worked out how Jot is supposed to work? 11:12:53 Oh never mind, I think I got it. 11:13:10 [[Special:Log/move]] move * A * moved [[MSM]] to [[Mutating Stack Machine]]: Because I am creating a language of the same name. 11:13:10 [[Special:Log/move]] move * A * moved [[Talk:MSM]] to [[Talk:Mutating Stack Machine]]: Because I am creating a language of the same name. 11:14:50 [[MSM]] https://esolangs.org/w/index.php?diff=65204&oldid=65201 * A * (+147) Disambig 11:17:02 [[Multi-Set Manipulator]] N https://esolangs.org/w/index.php?oldid=65205 * A * (+3322) Stub page of an inconcise language 11:17:58 -!- MDude has quit (Ping timeout: 245 seconds). 11:22:06 -!- Phantom_Hoover has joined. 11:24:27 [[Multi-Set Manipulator]] M https://esolangs.org/w/index.php?diff=65206&oldid=65205 * A * (-797) /* All instructions (in mathematics; this is just copied from the Unicode website) */ Remove some useless symbols that have alternative symbols available 11:27:21 [[Language list]] M https://esolangs.org/w/index.php?diff=65207&oldid=65199 * A * (+28) /* M */ 11:31:26 [[Multi-Set Manipulator]] M https://esolangs.org/w/index.php?diff=65208&oldid=65206 * A * (-27) 11:31:50 [[Multi-Set Manipulator]] M https://esolangs.org/w/index.php?diff=65209&oldid=65208 * A * (+12) /* Examples */ 11:40:31 [[Multi-Set Manipulator]] M https://esolangs.org/w/index.php?diff=65210&oldid=65209 * A * (+23) 11:48:47 [[Multi-Set Manipulator]] M https://esolangs.org/w/index.php?diff=65211&oldid=65210 * A * (+147) 11:50:21 [[Multi-Set Manipulator]] M https://esolangs.org/w/index.php?diff=65212&oldid=65211 * A * (+32) /* All instructions (in mathematics; this is just copied from the Unicode website) */ 11:51:04 [[Multi-Set Manipulator]] M https://esolangs.org/w/index.php?diff=65213&oldid=65212 * A * (+142) /* Examples */ 11:52:00 [[Multi-Set Manipulator]] M https://esolangs.org/w/index.php?diff=65214&oldid=65213 * A * (+12) /* Examples */ 12:06:11 -!- andrewtheircer has joined. 12:18:37 [[Multi-Set Manipulator]] M https://esolangs.org/w/index.php?diff=65215&oldid=65214 * A * (-6) 12:18:55 [[Multi-Set Manipulator]] M https://esolangs.org/w/index.php?diff=65216&oldid=65215 * A * (-13) 12:26:42 -!- andrewtheircer has quit (Remote host closed the connection). 13:01:54 [[Multi-Set Manipulator]] M https://esolangs.org/w/index.php?diff=65217&oldid=65216 * A * (-110) 13:02:28 -!- tromp has quit (Read error: Connection reset by peer). 13:03:13 -!- tromp has joined. 13:17:51 [[ACL]] https://esolangs.org/w/index.php?diff=65218&oldid=65174 * Hanzlu * (+0) 13:35:53 [[User talk:Iamcalledbob]] M https://esolangs.org/w/index.php?diff=65219&oldid=65083 * A * (+301) /* Hey, what's the matter with 1st-Worst? */ 13:39:23 [[Multi-Set Manipulator]] M https://esolangs.org/w/index.php?diff=65220&oldid=65217 * A * (-260) No, because they are invalid mathematical operators. After all, you will never know the length of a multi-set anyway. 13:40:02 [[Pxem]] https://esolangs.org/w/index.php?diff=65221&oldid=65197 * YamTokTpaFa * (+435) 13:41:36 [[Pxem]] https://esolangs.org/w/index.php?diff=65222&oldid=65221 * YamTokTpaFa * (+40) 13:45:15 [[Javagrid]] https://esolangs.org/w/index.php?diff=65223&oldid=53556 * YamTokTpaFa * (+85) 13:45:24 [[Multi-Set Manipulator]] https://esolangs.org/w/index.php?diff=65224&oldid=65220 * A * (+26) /* All instructions (in mathematics; this is just copied from the Unicode website) */ 13:45:39 [[Javagrid]] M https://esolangs.org/w/index.php?diff=65225&oldid=65223 * YamTokTpaFa * (+0) /* External resources */ 13:48:26 [[Multi-Set Manipulator/Subset]] N https://esolangs.org/w/index.php?oldid=65226 * A * (+1073) Created page with "
 All sets in Set Manipulator are multi-sets, although they can occasionally be treated as normal sets.  AB A with all items not in B removed; Intersection AB A with..."
13:53:49  [[Multi-Set Manipulator/Subset]] M https://esolangs.org/w/index.php?diff=65227&oldid=65226 * A * (+313) 
14:01:23  [[Multi-Set Manipulator/Subset]] M https://esolangs.org/w/index.php?diff=65228&oldid=65227 * A * (+525) 
14:03:37  [[Multi-Set Manipulator/Subset]] M https://esolangs.org/w/index.php?diff=65229&oldid=65228 * A * (+130) /* Natural numbers set not using the built-in N */
14:04:38  [[Multi-Set Manipulator]] M https://esolangs.org/w/index.php?diff=65230&oldid=65224 * A * (+87) 
14:07:32  [[Multi-Set Manipulator/Subset]] M https://esolangs.org/w/index.php?diff=65231&oldid=65229 * A * (+157) This can do everything Multi-Set Manipulator can do.
14:07:39  [[Multi-Set Manipulator]] M https://esolangs.org/w/index.php?diff=65232&oldid=65230 * A * (-170) /* Examples */
14:15:41  [[Multi-Set Manipulator/Subset]] M https://esolangs.org/w/index.php?diff=65233&oldid=65231 * A * (+200) Uh-oh, mathematicians *indeed* can access the length of a set.
14:23:13  [[Multi-Set Manipulator/Subset]] M https://esolangs.org/w/index.php?diff=65234&oldid=65233 * A * (+246) 
14:24:23  [[Multi-Set Manipulator/Subset]] M https://esolangs.org/w/index.php?diff=65235&oldid=65234 * A * (+199) 
14:30:18 -!- MDude has joined.
14:31:41  [[Multi-Set Manipulator/Subset]] M https://esolangs.org/w/index.php?diff=65236&oldid=65235 * A * (+477) 
14:35:07  [[Multi-Set Manipulator]] M https://esolangs.org/w/index.php?diff=65237&oldid=65232 * A * (+454) 
14:37:47 -!- atslash has joined.
14:44:14  [[Multi-Set Manipulator/Subset]] M https://esolangs.org/w/index.php?diff=65238&oldid=65236 * A * (+68) 
15:02:40  [[User talk:A]] M https://esolangs.org/w/index.php?diff=65239&oldid=65195 * A * (-7) 
15:03:39  [[User talk:A]] M https://esolangs.org/w/index.php?diff=65240&oldid=65239 * A * (+4) Blaise Pascal created roughly 20 mechanical calculators.
15:06:29  [[Multi-Set Manipulator/Subset]]  https://esolangs.org/w/index.php?diff=65241&oldid=65238 * A * (+4) 
15:12:40  [[Multi-Set Manipulator/Subset]] M https://esolangs.org/w/index.php?diff=65242&oldid=65241 * A * (+270) 
15:12:57  [[Multi-Set Manipulator/Subset]] M https://esolangs.org/w/index.php?diff=65243&oldid=65242 * A * (+22) /* All prime numbers less than I not using the built-in R set */
15:14:01  [[Multi-Set Manipulator/Subset]] M https://esolangs.org/w/index.php?diff=65244&oldid=65243 * A * (-1) /* All prime numbers less than I not using the built-in R set */
15:20:57 -!- MDead has joined.
15:22:43 -!- MDude has quit (Ping timeout: 248 seconds).
15:22:48 -!- MDead has changed nick to MDude.
15:39:57 -!- diverger has joined.
15:46:42 -!- Sgeo has quit (Ping timeout: 245 seconds).
15:49:25 -!- Sgeo has joined.
16:16:59 -!- Phantom_Hoover has quit (Read error: Connection reset by peer).
16:18:37 -!- FreeFull has joined.
17:20:06 -!- xkapastel has joined.
17:47:46 -!- atslash has quit (Quit: This computer has gone to sleep).
19:31:28  [[ACL]]  https://esolangs.org/w/index.php?diff=65245&oldid=65218 * Hanzlu * (+97) 
19:37:08 -!- lldd_ has joined.
19:56:39  slashlearn Schanuel's conjecture//Schanuel's conjecture states that e + pi is irrational.
20:04:15  [[ACL]]  https://esolangs.org/w/index.php?diff=65246&oldid=65245 * Hanzlu * (+61) 
20:06:08 -!- Lord_of_Life_ has joined.
20:08:29 -!- Lord_of_Life has quit (Ping timeout: 244 seconds).
20:08:29 -!- Lord_of_Life_ has changed nick to Lord_of_Life.
21:18:13 -!- howlands has quit (Ping timeout: 246 seconds).
21:32:25  `? cello
21:32:26  ​The high level structure of Cello projects is inspired by /Haskell/, while the syntax and semantics are inspired by /Python/ and /Obj-C/.
21:33:39  `quote 1208
21:33:39  1208)  Funge-98 has half the advantages of a nomic
21:45:37 -!- Sgeo has quit (Ping timeout: 244 seconds).
21:57:54 -!- Sgeo has joined.
21:59:39 -!- lldd_ has quit (Quit: Leaving).
22:28:38 -!- atslash has joined.
23:14:50  Someone told me a idea of somehow having relics (similar to the Catholic saints relics) in Magic: the Gathering, possibly a subtype for artifacts, but I don't know how it is work.
23:15:30  zzo38: well, the flavor had relics for a while
23:16:20  on Zendikar, see Solemn Offering
23:19:00  and there are several cards with "Relic" in the name

2019-08-05:

00:00:35  [[Special:Log/newusers]] create  * Davipb *  New user account
00:04:32  [[Esolang:Introduce yourself]]  https://esolangs.org/w/index.php?diff=65247&oldid=65196 * Davipb * (+158) My introduction
00:07:25  `bobadventureslist http://bobadventures.smackjeeves.com/comics/2834969/20190804/
00:07:25  bobadventureslist http://bobadventures.smackjeeves.com/comics/2834969/20190804/: b_jonas
00:22:51 -!- b_jonas has quit (Quit: leaving).
00:59:55  Do you like Hollerith chording?
01:27:05 -!- FreeFull has quit.
03:14:52  [[Talk:ACL]] M https://esolangs.org/w/index.php?diff=65248&oldid=65150 * A * (+210) 
03:17:40  [[Talk:ACL]] M https://esolangs.org/w/index.php?diff=65249&oldid=65248 * A * (+371) 
03:22:00 -!- doesthiswork has joined.
04:13:51  [[Talk:ACL]]  https://esolangs.org/w/index.php?diff=65250&oldid=65249 * A * (-370) /* C Interpreter */
04:39:49 -!- adu has quit (Quit: adu).
05:05:50  [[Multi-Set Manipulator/Subset]] M https://esolangs.org/w/index.php?diff=65251&oldid=65244 * A * (+33) 
05:11:31 -!- nfd9001 has quit (Ping timeout: 248 seconds).
05:15:18  [[Multi-Set Manipulator/Subset]]  https://esolangs.org/w/index.php?diff=65252&oldid=65251 * A * (-102) 
05:20:16  [[Multi-Set Manipulator/Subset]] M https://esolangs.org/w/index.php?diff=65253&oldid=65252 * A * (+7) /* All prime numbers less than I */
05:21:50 -!- nfd9001 has joined.
05:28:03 -!- doesthiswork has quit (Ping timeout: 248 seconds).
05:29:14 -!- moei has joined.
05:33:54  [[Multi-Set Manipulator/Subset]] M https://esolangs.org/w/index.php?diff=65254&oldid=65253 * A * (+85) 
05:35:09  [[Multi-Set Manipulator/Subset]]  https://esolangs.org/w/index.php?diff=65255&oldid=65254 * A * (-50) 
06:19:48 -!- xkapastel has quit (Quit: Connection closed for inactivity).
06:30:07  [[Prehistory of esoteric programming languages]] M https://esolangs.org/w/index.php?diff=65256&oldid=57231 * A * (+43) /* APL */
06:30:28  [[Prehistory of esoteric programming languages]] M https://esolangs.org/w/index.php?diff=65257&oldid=65256 * A * (+51) /* APL */
06:32:37  [[Prehistory of esoteric programming languages]] M https://esolangs.org/w/index.php?diff=65258&oldid=65257 * A * (+82) /* APL */
06:58:28 -!- x003n has joined.
06:58:49  [[Multi-Set Manipulator/Subset]] M https://esolangs.org/w/index.php?diff=65259&oldid=65255 * A * (+310) 
07:00:56 -!- x003n has left ("Leaving").
07:29:52 -!- Sgeo_ has joined.
07:32:57 -!- Sgeo has quit (Ping timeout: 245 seconds).
07:40:08 -!- andrewtheircer has joined.
07:40:38 -!- nfd9001 has quit (Ping timeout: 272 seconds).
07:42:06  nylon
07:43:58  nylon
07:47:03  truly
07:47:05  nylon
07:47:49  fungot`: help!
07:47:49  int-e: isn't that kind of idea of letting %app %datum and friends in r5. r4 didn't even have modem iirc
07:48:09  finally something that makes sense.
07:48:18 -!- Fatalize has joined.
07:49:18 -!- Fatalize has quit (Remote host closed the connection).
07:54:40 -!- nfd9001 has joined.
08:02:00  nylon
08:07:33 -!- Lord_of_Life has quit (Ping timeout: 245 seconds).
08:11:24 -!- Lord_of_Life has joined.
08:49:31 -!- ieuaeiau has joined.
08:49:59 -!- ieuaeiau has quit (Remote host closed the connection).
09:17:41  trucks
09:17:42  trucks
09:17:44  trucks
09:25:57 -!- andrewtheircer has quit (Remote host closed the connection).
09:27:29 -!- andrewtheircer has joined.
09:27:38  real estate
09:37:20 -!- andrewtheircer has quit (Remote host closed the connection).
09:49:50  [[Multi-Set Manipulator/Subset]] M https://esolangs.org/w/index.php?diff=65260&oldid=65259 * A * (-147) 
09:56:10  [[Multi-Set Manipulator/Subset]] M https://esolangs.org/w/index.php?diff=65261&oldid=65260 * A * (-596) Simpler set syntax
10:00:31  [[Multi-Set Manipulator/Subset]] M https://esolangs.org/w/index.php?diff=65262&oldid=65261 * A * (+173) 
10:02:04  [[Multi-Set Manipulator/Subset]] M https://esolangs.org/w/index.php?diff=65263&oldid=65262 * A * (+15) /* Set-comparison instructions */
10:17:45  [[Multi-Set Manipulator/Smaller]] N https://esolangs.org/w/index.php?oldid=65264 * A * (+2717) Ctrl+C Ctrl+V
10:18:03  [[Multi-Set Manipulator/Smaller]] M https://esolangs.org/w/index.php?diff=65265&oldid=65264 * A * (+0) 
10:21:31  [[Multi-Set Manipulator/Smaller]] M https://esolangs.org/w/index.php?diff=65266&oldid=65265 * A * (-532) 
10:22:17  [[Multi-machine]] M https://esolangs.org/w/index.php?diff=65267&oldid=56744 * A * (+47) 
10:22:28  [[Multi-machine]] M https://esolangs.org/w/index.php?diff=65268&oldid=65267 * A * (-66) 
10:28:13  [[Multi-Set Manipulator/Smaller]] M https://esolangs.org/w/index.php?diff=65269&oldid=65266 * A * (-71) /* Set-manipulational instructions */ Hmm...
10:30:50  [[Multi-Set Manipulator/Smaller]] M https://esolangs.org/w/index.php?diff=65270&oldid=65269 * A * (-104) = reversed operands = reversed operands = reversed operands = reversed operands
10:32:08  [[Multi-Set Manipulator/Smaller]] M https://esolangs.org/w/index.php?diff=65271&oldid=65270 * A * (-24) /* Logical instructions */ I don't see how they are useful
10:46:26 -!- andrewtheircer has joined.
10:46:46  hello
10:47:25  yeeeeeeet
10:49:41  eet
10:53:05 -!- andrewtheircer has quit (Remote host closed the connection).
11:20:03 -!- myname has quit (Ping timeout: 245 seconds).
11:28:47 -!- cpressey has joined.
11:31:07  Good afternoon. I am unhappy to report that making a second-order purely concatenative language does not help it express control. Monoids are sequential, control is branching.
11:32:57 -!- nfd9001 has quit (Ping timeout: 245 seconds).
11:34:21  If the objects under composition aren't functions, but something examinable (extensional?) like lists, then maybe. But in a strict definition of "concatenative" they're always described as functions.
11:36:33 -!- wob_jonas has joined.
11:37:18  perhaps my hon. and learned friend fungot knows a way to make a second order concatenative language?
11:37:18  wob_jonas: i have another feeling. no, i mean the right thing
11:37:34  Conventionally, concatenative languages allow functions to be named. Only the function definitions are monoids. The program as a whole is a... some sort of DAG.
11:38:36  I'm sure fungot knows a way -- the problem is our inability to understand what it means.
11:38:36  cpressey: i mean complex examples ( window managers, so i don't know enough. there should exist an implementation which is fast. especially for allocation of n bytes might be: why do you need
11:45:12  cpressey: http://www.nyu.edu/projects/barker/Iota/zot.html is vaguely related to this problem
11:51:49  Vaguely.
11:52:17  cpressey: (The connection being that it uses CPS to extract a tree structure from a linear representation. It's not quite concatenative as is (that needs another level of CPS) and it's untyped, probably inherently so.)
11:52:38  (Definitely not just second order.)
11:55:11  (Funny how things go. I've encountered Zot yesterday mainly because https://en.wikipedia.org/wiki/Iota_and_Jot#Jot is wrong.)
11:56:11  Oh and I can't correct it. "You are currently unable to edit Wikipedia."
12:01:12 -!- myname has joined.
12:04:26  [[User talk:A]]  https://esolangs.org/w/index.php?diff=65272&oldid=65240 * Areallycoolusername * (+229) Telling User: A how I made another language. WIP
12:04:56  [[User talk:A]]  https://esolangs.org/w/index.php?diff=65273&oldid=65272 * Areallycoolusername * (+117) typo
12:09:30  I'm actually somewhat wrong too.  You can have control structures, they just have to look like this: x;y;while(a){z;q;if(b){r;p;while(c){q;m;n;}}}
12:09:51  You can't "un-nest" after you put one in.
12:10:27  I mean, I think this is how it works out.
12:10:47  cpressey: what if you use the techniques of Lambda: the Gathering, where you can apply a function either from the left or from the right, and you emulate that with second order concatenative?
12:11:37  wob_jonas: I'm not familiar with Lambda: the Gathering.
12:11:53  cpressey: there ought to be a link from the wiki
12:12:09  https://esolangs.org/wiki/Lambda:_the_Gathering
12:16:29  admittedly that one cheats, you can compose functions only because of the mutable slots
12:16:37  you can write to slots and read them
12:16:56  No idea offhand how that would work with this, sorry.
12:29:04  [[Wang program]]  https://esolangs.org/w/index.php?diff=65274&oldid=46766 * YamTokTpaFa * (+11) Why not use ref and references tags?
12:45:16 -!- myname has quit (Ping timeout: 272 seconds).
12:50:55  I think what I've got is TC, so there's no problem there, but it's TC in a "technically TC" rather than in an expressive way. You put a single top-level while around the whole thing, and you can simulate a UTM. Not unlike Burro (and I'm sure others.)
12:51:28  But it's slightly interesting in its own way, so I'll probably continue on it.
12:52:46  "Concatentive with continuations" sounds interesting enough in *its* own way too though.
12:53:17  . o O ( Rust's style for type annotations looks *wrong* to me:  let i: u32 = 4;  rather than  let i : u32 = 4; )
12:53:17  Some people say "concatenative" is just a buzzword. Sometimes I agree with them. I've never really made up my mind on that.
12:54:14  int-e: maybe I'm getting old, the only difference I see is whitespace?
12:54:30  I imagine "concatenative" is like "functional", it means different things to different people
12:55:00  int-e: I think either of those work
12:57:23  wob_jonas: I wrote "style" and I'm under the impression that https://doc.rust-lang.org/book/ch03-02-data-types.html is somewhat authoritative.
12:57:52  cpressey: I'm very white-space sensitive when it comes to programming.
13:03:39 -!- myname has joined.
13:07:47  [[Talk:Nellephant]] N https://esolangs.org/w/index.php?oldid=65275 * Davipb * (+801) Possible cat program
13:08:06  It also says something about how long I haven't touched Pascal.
13:13:41  [[User talk:A]] M https://esolangs.org/w/index.php?diff=65276&oldid=65273 * A * (+228) /* Concern */
13:15:53 -!- myname has quit (Ping timeout: 245 seconds).
13:27:07  In other news, I've learned (after a large amount of hunting around) that, while they are all similar, equational logic is not the same thing as equational propositional logic and is also not the same thing as equivalential calculus.
13:28:02  cpressey: hmm. is there also {equational,equivalential} {algebra,analysis}?
13:30:31  equivalential calculus seems to have almost nothing to do with equational logic... seeing that \equiv is only used between propositions.
13:38:09  Oh well from a classical perspective neither equational propositional logic not equivalential calculus seem very interesting.
13:38:42  [[User talk:A]]  https://esolangs.org/w/index.php?diff=65277&oldid=65276 * A * (+195) /* Concern */
13:41:07  Equational propositional logic seems to have been invented by Gries to make discrete math easier to teach to undergrads. Which is fine, but WP's article on Equational logic conflates it with equational logic.
13:41:32 -!- xkapastel has joined.
13:42:08  *David Gries
13:42:12  Well, equational logic works on terms... which allows a very rich structure, especially if you allow additional equational axioms.
13:42:59  So yeah, the Wikipedia page is quite misleading.
13:43:25  [[User talk:A]] M https://esolangs.org/w/index.php?diff=65278&oldid=65277 * A * (+227) /* Concern */
13:43:44  [[User talk:A]] M https://esolangs.org/w/index.php?diff=65279&oldid=65278 * A * (+158) /* Concern */ Whoops, forgot to sign
13:43:59  http://mathworld.wolfram.com/EquationalLogic.html is much better
13:44:13  (in particular by the inclusion of congruence)
13:44:45  [[Multi-Set Manipulator/Smaller]] M https://esolangs.org/w/index.php?diff=65280&oldid=65271 * A * (-29) /* Built-in Sets */
13:45:18  [[User talk:A]] M https://esolangs.org/w/index.php?diff=65281&oldid=65279 * A * (-78) /* Concern */ So am I
13:45:42  [[User talk:A]] M https://esolangs.org/w/index.php?diff=65282&oldid=65281 * A * (-307) /* Concern */ I also take that much time to write an interpreter.
13:45:46  cpressey: did you see the Wikipedia talk page?
13:46:50  int-e: No, haven't yet. But a lot of my own confusion cleared up after I started reading some course notes on a course on universal algebra. And coincidentally stumbling across equivalential calculus.
13:46:59  too bad nobody seems to have acted on this.
13:47:34  FWIW both equivalential calculus and equational propisitional logic were new to me.
13:48:00  *propositional. Wow, I find this very hard to type :)
13:48:40  [[User talk:A]]  https://esolangs.org/w/index.php?diff=65283&oldid=65282 * Areallycoolusername * (+313) 
13:49:16  cpressey: There is not much on the talk page, except that it points out the same problem of conflating equational logic and equational propositional logic that you've also pointed out.
13:49:20  [[Multi-Set Manipulator/Smaller]] M https://esolangs.org/w/index.php?diff=65284&oldid=65280 * A * (-104) /* Logical instructions */ They are useless for now. Done in https://esolangs.org/wiki/Multi-Set_Manipulator/Subset
13:49:52  int-e: Yeah, if I had read it earlier... oh well
13:49:53  ais523: re https://esolangs.org/logs/2019-07-30.html#lxh virtual addresses on current cpus, there's a draft since 2016 for how x86 can extend to more than 48 bits of virtual address space https://software.intel.com/en-us/download/5-level-paging-and-5-level-ept-white-paper . It's not in any current or near future cpus, but it's at least recognized t
13:49:54  hat they'll probably eventually need to do this.
13:54:02  [[User talk:A]]  https://esolangs.org/w/index.php?diff=65285&oldid=65283 * A * (+78) /* Concern */
13:59:15  [[User talk:A]] M https://esolangs.org/w/index.php?diff=65286&oldid=65285 * A * (+353) /* Concern */
13:59:59  [[User talk:A]] M https://esolangs.org/w/index.php?diff=65287&oldid=65286 * A * (-77) /* Concern */
14:03:26 -!- doesthiswork has joined.
14:04:49  [[User talk:A]] M https://esolangs.org/w/index.php?diff=65288&oldid=65287 * A * (+7) /* Concern */
14:05:54  [[Multi-Set Manipulator/Smaller]] M https://esolangs.org/w/index.php?diff=65289&oldid=65284 * A * (-124) /* Miscellaneous instructions */ -2 operators
14:06:09  int-e: I got into this in the first place because I was looking for a system where it is simple to make deductions. Equating two terms is pretty simple... but it turns out Frege's and Hilbert's systems use only modus ponens, and that's pretty simple too.
14:06:53  I was used to natural deduction, which trades off simplicity of the deductive process, for easier use.
14:07:19  [[User talk:A]] M https://esolangs.org/w/index.php?diff=65290&oldid=65288 * A * (-1138) /* Concern */
14:07:54  So I might try implementing a Hilbert-style proof checker instead of going down the equational route.
14:08:17  [[Talk:256]] M https://esolangs.org/w/index.php?diff=65291&oldid=65192 * A * (-2066) 
14:08:41  [[Talk:256]] M https://esolangs.org/w/index.php?diff=65292&oldid=65291 * A * (-101) 
14:09:40  Hilbert just moves all the complexity into axiom schemata :P
14:10:04  I realize that :) I'm also not sure if these actually take away the complexity of implies-introduction or not.
14:10:12  (these MP-based systems)
14:10:44  If you still have to do "Suppose x. We show that it entails y. Therefore x -> y" to get a new implication, then that complexity is still there
14:11:09  Another trade-off is sequents vs. discharging assumptions...
14:11:31  [[User talk:A]] M https://esolangs.org/w/index.php?diff=65293&oldid=65290 * A * (+211) /* Concern */
14:12:32  which is related to what you just wrote... with sequents, you can infer |- x -> y from x |- y. With assumptions, you'll infer x -> y from a proof of y that used x as an assumption.
14:13:08  (or possibly didn't use that assumption at all).
14:14:18  [[User talk:A]] M https://esolangs.org/w/index.php?diff=65294&oldid=65293 * A * (-27) /* Concern */
14:16:00  [[User talk:A]]  https://esolangs.org/w/index.php?diff=65295&oldid=65294 * A * (+77) /* Concern */
14:16:11 -!- myname has joined.
14:16:40  Oh is *that* what a sequent is? Okay then!
14:17:19  [[User talk:A]]  https://esolangs.org/w/index.php?diff=65296&oldid=65295 * A * (-1) /* Concern */
14:20:06  I think I half-re-invented it without entirely understanding what it was
14:20:16  In its most general form, a sequent is  P_1,...,P_n |- Q_1,...,Q_m, and (classically) means that P_1 /\ ... /\ P_n ==> Q_1 \/ ... \/ Q_n. But the common special case where there is exactly one Q_i is still called a sequent.
14:21:49  (I'm using ==> with a lower precedence than /\ and \/)
14:22:00  [[Multi-Set Manipulator/Smaller]] M https://esolangs.org/w/index.php?diff=65297&oldid=65289 * A * (-113) N{0}Z+; Q-Q-(Q+)-{0}; R-R-(R+)-{0};
14:24:36  [[Multi-Set Manipulator/Smaller]] M https://esolangs.org/w/index.php?diff=65298&oldid=65297 * A * (-47) /* Built-in Sets */ Real numbers are trivial becase there isn't the ... operator anymore in MSM
14:26:39  [[Multi-Set Manipulator/Smaller]] M https://esolangs.org/w/index.php?diff=65299&oldid=65298 * A * (-90) /* Built-in Sets */ But you can't present decimals either.
14:30:02  Sequent calculus is what they always use for type judgments too, isn't it
14:31:07  They tend to use sequents ("judgements") indeed. (I'd be careful with "sequent calculus" because that carries certain inference rules with it, not just the syntax)
14:31:49  `? sequent
14:31:51  sequent? ¯\(°​_o)/¯
14:31:52  `? sequent calculus
14:31:53  sequent calculus? ¯\(°​_o)/¯
14:31:59  Is that what they use for linear logic?
14:32:09  I kind of got that |- and -> meant the same thing, but it has always been a bit fuzzy
14:33:08  Though it's not so easy; the type system judgements often have several kinds of premises (say: types of variables, and values for type variables) and possibly yet another kind on the right-hand side, while (logical) sequents have only propositions.
14:33:45  [[Multi-Set Manipulator/Smaller]] M https://esolangs.org/w/index.php?diff=65300&oldid=65299 * A * (-35) ~A All items that don't belong to A is useless in actual programming; also, it is impossible to implement.
14:34:03  [[Multi-Set Manipulator/Smaller]]  https://esolangs.org/w/index.php?diff=65301&oldid=65300 * A * (+17) 
14:35:00  [[Multi-Set Manipulator/Smaller]] M https://esolangs.org/w/index.php?diff=65302&oldid=65301 * A * (+138) /* Built-in Sets */
14:40:53  [[Multi-Set Manipulator/Smaller]]  https://esolangs.org/w/index.php?diff=65303&oldid=65302 * A * (-7) /* Set-manipulational instructions */ Overly complex.
14:51:30  [[Multi-Set Manipulator/Smaller]]  https://esolangs.org/w/index.php?diff=65304&oldid=65303 * A * (+9) /* Set-manipulational instructions */
14:52:07  wob_jonas: Linear logic seems usually be presented with sequents, but its inventor would seem to promote using "proof nets" instead
14:52:16  It's all very wacky
14:52:24  But useful
14:52:34  Therefore not kooky
14:52:36  Or something
14:52:54  Oh I still don't know what a proof net is.
14:54:17  I guess I don't want to find out today either.
14:54:28  hopefully they're all equivalent syntactic tricks
14:55:01  [[Multi-Set Manipulator/Smaller]] M https://esolangs.org/w/index.php?diff=65305&oldid=65304 * A * (+90) 
15:03:04  [[Multi-Set Manipulator/Smaller]]  https://esolangs.org/w/index.php?diff=65306&oldid=65305 * A * (+0) /* Built-in Sets */
15:03:30  [[Multi-Set Manipulator/Smaller]]  https://esolangs.org/w/index.php?diff=65307&oldid=65306 * A * (+0) 
15:03:44  [[Multi-Set Manipulator/Smaller]] M https://esolangs.org/w/index.php?diff=65308&oldid=65307 * A * (-16) /* Built-in Sets */
15:11:00  Did you know that in en.Wikipedia article titles, only three start with an ascii comma, and all three are redirects?
15:11:09  (That's in the main namespace.)
15:11:17  I did not!
15:11:31  Honestly I'm a little surprised that articles are allowed to begin with a comma
15:11:45  , is this a bot prefix? :P
15:11:56  It is in #nixos and probably other places
15:12:04  Taneb: https://en.wikipedia.org/wiki/, is something obvious :)
15:12:06  ^prefixes
15:12:06  Bot prefixes: fungot ^, HackEso `, EgoBot !, lambdabot @ or ?, thutubot +, metasepia ~, idris-bot ( , jconn ) , j-bot [ .
15:12:08  `prefixes
15:12:10  Bot prefixes: fungot ^, HackEso `, EgoBot !, lambdabot @ or ?, thutubot +, metasepia ~, idris-bot ( , jconn ) , j-bot [ .
15:12:30  Maybe I should bring back pietbot
15:13:06  boily should bring himself back, and then metasepia.
15:13:26  [ +/i.10
15:13:27  Taneb: 45
15:13:29  I can write J!
15:13:48  [ how bad are the J error messages?
15:13:48  int-e: |value error: the
15:13:48  int-e: |   how bad are     the J error messages?
15:14:51  I wonder which of those prefixes are abandonned enough that someone else could potentially usurp it if they provide an even marginally useful use for one
15:15:24  ) is definitely reusable; ISTR it's left in the fungot prefixes only because that command is implemented in underload and it'd be hard for it to print unbalanced parenthesis
15:15:24  wob_jonas: this reminds me of the conversations i ever have trouble sleeping, i'll ride around in buses. tampere might have, can have pccard for even about 30e, recommended.
15:15:46  Hmm, maybe I should have rode around in buses last night when I couldn't sleep
15:15:46  that's cheap
15:15:55  (I instead read Lord of the Rings for a bit)
15:16:14  `? metasepia
15:16:15  metasepia knew the weather at your nearest airport, and also something about ducks.
15:16:16  `? idris-bot
15:16:18  idris-bot? ¯\(°​_o)/¯
15:16:19  `? jconn
15:16:20  jconn? ¯\(°​_o)/¯
15:16:35  Well I still remember idris-bot.
15:16:59  I wonder if that means I should remove right paren from the prefixes wisdom, since that one doesn't have a problem with unbalanced parens
15:17:25  I don't remember thutubot, nor jconn; and boith Egobot and metasepia have not been around in the past 5 years?
15:17:32  boith -> neither
15:17:35  not ->
15:17:42  and -> nor
15:17:48  (too many edits. sorry)
15:17:57  int-e: jconn was an instance of jevalbot, the same bot that j-bot is also an instance of, evaluates J, and its terrible source code written by me
15:18:14  > var"lambdabot listens to greater than too, right?"
15:18:19   lambdabot listens to greater than too, right?
15:18:23  @run "yeah"
15:18:26   "yeah"
15:18:41  @eval "Hi"
15:19:13  @help eval
15:19:13  eval. Do nothing (perversely)
15:19:15  `whatis eval
15:19:16  eval(1p) - construct command by concatenating arguments \ eval(8lambdabot) - no description \ eval(8jevalbot) - evaluate J fret, names in main namespace are persistent
15:20:12  I'm particularly curious about the tilde, because it looks like a nice prefix
15:26:52  hmm, nobody has complained about the POTM yet.
15:26:59 * int-e is disappointed.
15:28:53  `password
15:28:54  oxptjpydghfgkbp
15:28:56  `? password
15:28:57  The password of the month is surprising.
15:29:11  int-e: do people often complain about it?
15:29:19  Taneb: constantly.
15:29:31  That's surprising
15:30:00  I may be exaggerating slightly :P
15:30:36  `potm
15:30:37  ​/srv/hackeso-code/multibot_cmds/lib/limits: line 5: exec: potm: not found
15:30:38  `pom
15:30:39  The Moon is Waxing Crescent (27% of Full)
16:05:56  :O
16:06:00  `ddate
16:06:01  Today is Boomtime, the 71st day of Confusion in the YOLD 3185
16:07:56 -!- wob_jonas has quit (Remote host closed the connection).
16:10:55  I also wrote a JotaCode program for Discordian calendar, too
16:19:17  cool
16:19:26  zzo38: have you read Principia Discordia?
16:20:03  Yes, I have read it
16:24:15  (The code is object #20165 on ifMUD.)
16:27:14 -!- cpressey has quit (Quit: A la prochaine.).
17:11:56 -!- FreeFull has joined.
17:50:28 -!- b_jonas has joined.
18:05:35 -!- nfd9001 has joined.
18:10:57 -!- xkapastel has quit (Quit: Connection closed for inactivity).
18:12:41 -!- xkapastel has joined.
19:15:52  ``` set -e; cd wisdom; printf "%s\n" phantom*hoover # what the...
19:15:53  phantom____________________hoover \ phantom__________hoover \ phantom_______hoover \ phantom___hoover \ phantom__hoover \ phantom_hoover
19:17:33 -!- heroux has quit (Ping timeout: 245 seconds).
19:24:20 -!- heroux has joined.
19:28:33 -!- lldd_ has joined.
19:35:24 -!- nfd has joined.
19:39:04 -!- nfd9001 has quit (Ping timeout: 246 seconds).
19:53:45  [[ACL]]  https://esolangs.org/w/index.php?diff=65309&oldid=65246 * Hanzlu * (-163) 
20:02:35 -!- Phantom_Hoover has joined.
20:07:41 -!- Lord_of_Life_ has joined.
20:10:02 -!- Lord_of_Life has quit (Ping timeout: 245 seconds).
20:10:26 -!- Lord_of_Life_ has changed nick to Lord_of_Life.
20:11:08 -!- john_metcalf has quit (Ping timeout: 272 seconds).
20:35:22 -!- pecan has joined.
20:56:00 -!- lldd_ has quit (Quit: Leaving).
21:21:15  finally! I managed to hit alt-s to open the history menu in firefox. I keep hitting alt-h and then have to correct because alt-h opens the help menu
21:21:27  this might be a first
21:22:17 * kmc claps
21:22:21 * kmc mails b_jonas a cake
21:22:25  thanks
21:22:48  kmc: can you mail me a cake twh
21:23:06  also higan mchiïster
21:23:17  yes
21:23:22  what kind of cake do you guys like
21:23:49  chocolate with soft sponge layers
21:23:57  do you know about Baumkuchen
21:24:03  it's a fancy german cake that's baked on a spit
21:24:08  layering on batter as you go
21:24:10  hence "tree cake"
21:24:14  fancy
21:24:26  a "spit"?
21:24:39  this is both a description of Baumkichen and a description of the kind of cake i like
21:24:40  yes, a horizontal rotating bar
21:24:51  as is often used to cook chickens
21:24:53  oh, my birthday happen recently and i got a cake in the mail
21:24:54  ah
21:24:57  happened
21:24:57  I didn't know "spit" meant that
21:24:59  shachaf: really! happy birthday
21:25:02  and what kind was it?
21:25:29  strawberry ice cream cake
21:25:52  kmc: wow, that was fast! it arrived to shachaf in negative time
21:26:04  unfortuantely i had a fruit fly infestation at the time so leaving the cake out to thaw was a bad idea
21:26:22  by the time i ate it it had flies embedded in it which i tried to remove
21:27:01  oh no
21:27:04  F
21:27:15  you should get some carnivorous plants
21:27:33  much more civilized than herbivorous plants
21:27:45  parasitic epiphytes?
21:48:35  kmc: did you know this fact:
21:48:39  many things are good
22:01:17  Cave of Anti-magic {-} Land ;; Shroud ;; {1UU}, {T}, Discard a card: Counter target spell. ;; {1WW}, {T}, Discard a card: Destroy target enchantment.
22:07:00 -!- salpynx has joined.
22:07:15  shachaf: plausible
22:10:53  zzo38: no no. there's a good reason why that sort of repeatable counterspelling without restrictions doesn't appear on M:tG cards, even with the discard cost.
22:11:15  it doesn't _look_ broken, but I think it would be if they printed it
22:11:16 -!- moei has quit (Quit: Leaving...).
22:11:36  counterspells? i just met 'er!
22:12:04  and it's not like it didn't occur to Wizards, because they have a lot of spellshapers with a similar discard+{T}+mana cost
22:12:07  Maybe it can be improved
22:12:29  Dawnstrider is already bad enough
22:14:22  the enchantment destruction part is probably fine though, see Devout Witness
22:14:50  if you want to get away with the counterspelling, you'll have to ask some restriction on what spell it can target. there's some versions like that.
22:14:57  `card-by-name Diplomatic Es
22:15:05  Diplomatic Escort \ 1U \ Creature -- Human Spellshaper \ 1/1 \ {U}, {T}, Discard a card: Counter target spell or ability that targets a creature. \ MM-U
22:15:31  `card-by-name Hisoka, Minamo Sensei
22:15:31  Hisoka, Minamo Sensei \ 2UU \ Legendary Creature -- Human Wizard \ 1/3 \ {2}{U}, Discard a card: Counter target spell if it has the same converted mana cost as the discarded card. \ CHK-R
22:15:40  although... if they can print this:
22:15:47  `card-by-name Ghost-Lit Warder
22:15:48  Ghost-Lit Warder \ 1U \ Creature -- Spirit \ 1/1 \ {3}{U}, {T}: Counter target spell unless its controller pays {2}. \ Channel -- {3}{U}, Discard Ghost-Lit Warder: Counter target spell unless its controller pays {4}. \ SOK-U
22:15:57  then maybe you can do an unlimited counterspell too somehow
22:16:20  I suspect not the way you just tried though
22:17:44  `card-by-name Stronghold Biol
22:17:45  Stronghold Biologist \ 2U \ Creature -- Human Spellshaper \ 1/1 \ {U}{U}, {T}, Discard a card: Counter target creature spell. \ NE-U
22:17:52  `card-by-name Stronghold Machi
22:17:52  Stronghold Machinist \ 2U \ Creature -- Human Spellshaper \ 1/1 \ {U}{U}, {T}, Discard a card: Counter target noncreature spell. \ NE-U
22:18:03  hmm
22:18:51  the repeated counter that I use is
22:18:54  `card-by-name Disruptive
22:18:55  Disruptive Pitmage \ 2U \ Creature -- Human Wizard \ 1/1 \ {T}: Counter target spell unless its controller pays {1}. \ Morph {U} (You may cast this card face down as a 2/2 creature for {3}. Turn it face up any time for its morph cost.) \ ONS-C \  \ Disruptive Student \ 2U \ Creature -- Human Wizard \ 1/1 \ {T}: Counter target spell unless its controller pays {1}. \ US-C
22:21:38 -!- b_jonas has quit (Quit: leaving).
22:29:20  OK
23:25:28 -!- Phantom_Hoover has quit (Ping timeout: 245 seconds).
23:29:15  int-e: the Wikipedia Jot entry does seem wrong, do you have a particular correction in mind? I can't quite figure out what a clear improvement would be. 11100 = (ι(ι(ιι)) (= K) seems to be what is intended, but (ιι)(ιι) would be an empty string? 
23:30:32  The whole single sentence description of Jot seems like it is flawed, and I'm not sure how to relate it back to the source material, without writing something completely different.

2019-08-06:

00:03:04 -!- MDead has joined.
00:04:50 -!- MDude has quit (Ping timeout: 272 seconds).
00:04:54 -!- MDead has changed nick to MDude.
00:45:01 -!- adu has joined.
01:21:22  I wrote on a paper my ideas about how to make upa better television set.
02:19:15 -!- salpynx has quit (Ping timeout: 260 seconds).
02:29:14  zzo38: oh?
02:29:37 -!- doesthiswork has quit (Ping timeout: 245 seconds).
02:34:01  Some stuff I wrote, such as, there is 4:3 display, and on the right is the buttons, IR receiver, status display, OSD switch, speaker, and also a remote control holder.
02:35:24  On the back, there is the sections of inputs: two Digi-RGB sections (each having Digi-RGB, left audio, right audio, and IMIDI), one composite section (composite, left audio, right audio), one component section (Y, Cr, Cb, left audio, right audio; there is also a mode to use the component section as a second composite section), and RF.
02:35:54  Also on the back is the reset switch, the IMIDI out port, the audio output (if you want to use external speakers), and several dip switches.
02:36:52  Do you think it is good?
02:37:24  seems pretty reasonable
02:37:29  why 4:3?
02:38:16 -!- doesthiswork has joined.
02:38:38  To take up less space, mainly.
02:38:56  If such a TV set is manufactured, it could come in both 4:3 and 16:9 versions, I suppose.
02:42:02  And then there would be the software features, such as caption scrollback, numeric command prefixes (similar to vi), adjustment of colour conversion matrix, etc.
02:46:06 -!- salpynx has joined.
02:50:04 -!- FreeFull has quit.
02:59:48  O, and there is also a ethernet port. This could be used for streaming video/audio, but Gopher and ViewData could possibly also be implemented.
03:02:26  you might be the only person on earth who wants a TV that can browse Gopher using a vi-like interface
03:02:34  but I'm not going to say you're wrong
03:02:38  follow your dreams
03:22:38  Also, I think ViewData was designed for television (according to a photograph I have seen, at least), so it will work well in this way.
04:40:56  [[Multi-Set Manipulator/Subset]] M https://esolangs.org/w/index.php?diff=65310&oldid=65263 * A * (+60) /* Natural numbers set not using the built-in N */
04:50:57  What are all of the control codes for Viewdata anyways?
04:55:05  [[Multi-Set Manipulator/Smaller]] M https://esolangs.org/w/index.php?diff=65311&oldid=65308 * A * (+165) Extend this subset
04:59:51  [[Multi-Set Manipulator/Smaller]] M https://esolangs.org/w/index.php?diff=65312&oldid=65311 * A * (-3) /* Set-comparison instructions */
05:11:02  [[Multi-Set Manipulator/Smaller]] M https://esolangs.org/w/index.php?diff=65313&oldid=65312 * A * (+7) 
05:12:32 -!- doesthiswork has quit (Ping timeout: 245 seconds).
05:40:12  TVim: TV improved
06:10:58  salpynx: It's not just the example that's wrong. The translation of w1 is plain wrong, ever since this edit: https://en.wikipedia.org/w/index.php?title=Iota_and_Jot&diff=757746945&oldid=757746752 (the translation of w0 is correct, but not a simplification over [w0] = [w]SK).
06:15:04  salpynx: Referring to the esolang page on Jot, the whole point of the translation of w1 is that it operates on arguments to the right, combining two of them, so that [F{K}] = [F11100] = [F1110]SK = [F111]SKSK = [F11](SK)SK = [F1](SKS)K = [F](SKSK) = [F]K holds regardless of F.
06:16:59  salpynx: (That's one of the base cases of proving the identity [F{A}] = [F]A that the esolang wiki page mentions.\)
06:20:02  Oh, it seems I can edit today. Different IP :P
06:25:50  salpynx: Yes, I suppose, such thing can be "TV improved", maybe. And then, we will also have VCR/DVD improved.
06:26:22  kmc: higan
06:26:24  singing is tg
06:26:33  this is my fact of the day
06:57:15  [[Multi-Set Manipulator/Smaller]] M https://esolangs.org/w/index.php?diff=65314&oldid=65313 * A * (-19) 
07:10:27  salpynx: So I've edited the page, let's see whether the edit survives Wikipedia's general disdain for "IPs".
07:10:57  [[Multi-Set Manipulator/Smaller]] M https://esolangs.org/w/index.php?diff=65315&oldid=65314 * A * (+7) 
07:13:22  (Meh, these things always take me so long.)
07:33:27 -!- cpressey has joined.
08:08:46 -!- Lord_of_Life has quit (Ping timeout: 258 seconds).
08:11:24 -!- Phantom_Hoover has joined.
08:13:36 -!- Lord_of_Life has joined.
08:42:54  Good morning. How about a stack-based language that is statically typechecked by translating all operations to operations that push and pop type-values to the stack instead, and running that.
08:46:58  You need to be a bit careful if there's any non-trivial control flow
09:00:19 -!- wob_jonas has joined.
09:01:15  True. That's one of the things that makes it kind of interesting though.
09:03:11  If you have while loops, say, you can make sure the body is of type (A:Bool) -> B, with the condition B -> (A:Bool), for example
09:03:14  zzo38: as for that, I wonder, is there some widely supported standard for transmitting raw (uncompressed) digital audio through wires, sort of like DVI but for audio instead of video? and if so, why not? 
09:03:14  it seems to me that everyone uses either analog audio (or even composite) or bluetooth audio.
09:05:16  and this is despite that we've had audio CD equipment for ages
09:06:24  Hmm, my scheme would restrict the language to being a LBA, I think (correspondign to simply typed lambda calculus))
09:27:30 -!- cpressey has quit (Quit: rebooting).
09:45:08  [[Special:Log/newusers]] create  * TheOnlyMrcat *  New user account
09:47:00 -!- andrewtheircer has joined.
09:47:03  hi
09:50:28  [[Esolang:Introduce yourself]]  https://esolangs.org/w/index.php?diff=65316&oldid=65247 * TheOnlyMrcat * (+238) /* Introductions */
09:51:27  `welcome andrewtheircer
09:51:28  andrewtheircer: 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.)
09:51:49  hi
09:52:00  You can say that again!
09:52:34  *cough*
09:52:39  GREETINGS FELLOW HUMANS
09:53:01  hi to you and hi to you, hackeso and shachaf
09:53:49  is it allowed to sing the creeper aw man song here
09:54:47  I believe it's permitted to sing into your microphone while in this channel.
09:54:54  I've certainly done so.
09:54:58  no
09:54:58  like
09:55:12  someone says "creeper" then another person says "aw man"
09:55:17  and then the rest of the lyrics
09:55:46  Taneb: Do you know things about QBF solvers, remind me?
09:56:06  Oh, I think reciting the lyrics into your microphone is also permitted.
09:56:12  well then i'll stop referencing a 7 year old song
09:56:38  Oh man, https://en.wikipedia.org/wiki/Polynomial_hierarchy has Sigma, Pi, and Delta, but no Sigma -| Delta -| Pi adjunction.
09:57:06  That's so confusing. The letter Δ should be banned for this use.
09:57:33  http://bit.do/brainfuckextensionplans check this out
09:58:58  Title: Rick Astley - Never Gonna Give You Up (Video) - YouTube
09:59:10  fuck
09:59:16  my rickroll failed
09:59:34  Please don't try to trick people like that. It's quite rude.
09:59:48  ok
10:00:06  there are two types of people in this world: those who listen to that on purpose
10:00:10  and those who don't
10:02:41  this chat has deceased
10:08:21  onions
10:10:12 -!- andrewtheircer has quit (Remote host closed the connection).
10:10:57 -!- xkapastel has quit (Quit: Connection closed for inactivity).
10:20:05  shachaf: I don not know things about QBF solvers
10:20:50  I barely know anything about anything, quite frankly.
10:20:59  Where can I find out about QBF solvers?
10:22:01  Hmm, I don't know much about QBF solvers.
10:22:15 -!- andrewtheircer has joined.
10:22:19  One good trick is to come to Berkeley and ask edwardk about them.
10:22:23  I would start at http://www.qbflib.org/qbfeval19.php
10:22:27  are you famous sha
10:22:41  in the eso community
10:22:44  I'm the most famous sha of them all.
10:22:45  (I've seen some QBF solver basics.)
10:22:46  Berkeley's all the way in Gloucestershire, though
10:22:50  It's practically on the west coast!
10:22:51  They call me SHA-256.
10:23:10  That's pretty far.
10:23:30  nice
10:23:38  have you made esos before
10:23:40  Hmm, actually they call me SHA-512/256.
10:24:02  Hmm, Berkeley was where vaccination was invented
10:24:25  I thought it was in China or something?
10:24:27  technically the word vaccine comes from antivaxxers of the time as they thought vaccines would turn you into a cow :p
10:24:48  (I guess the 2018 edition is more fruitful for now. But you should learn some tool names, which will lead to corresponding papers, which will be educational.)
10:25:08  what? 
10:25:12  `? vaccine
10:25:12  vaccine? ¯\(°​_o)/¯
10:25:13  `quote
10:25:14  737)  U+2205 [∅] NO LETTER O ALLOWED
10:25:36  so is that where the legends about werecows come from?
10:25:50  ye
10:26:00  `quote
10:26:01  796)  typed racket: anyone using a model m keyboard
10:26:05  Maybe solvers that just support two quantifiers or something are more interesting in practice.
10:26:11  Unlimited quantifiers seems pretty extreme.
10:26:17  do you program y'all
10:26:31  that explains why a mad scientist would become one
10:27:27  idea: eso based on onions
10:28:39  shachaf: the particular class is called 2QBF and has its own track at QBFEVAL..
10:29:05  Makes sense.
10:29:22  2Q2BF
10:29:29  (Since the objective is to *decide* formulas there's no real difference between the \forall\exists and \exists\forall prefixes)
10:30:29  Presumably this is sigma_2 and pi_2 or something.
10:30:30  a
10:30:39  are you a mathematician
10:30:47  Yes. They're just dual of each other.
10:31:56  Are they left and right adjoint to some functor? twh
10:33:00  For that you need to ask somebody who cares about category theory.
10:33:23  My only objection is to this delta thing.
10:33:33  Delta should always mean diagonal or difference.
10:34:15  I suspect \Delta is for "deterministic"
10:34:32  or possibly "decision"
10:34:58  `quote q =
10:34:59  1288)  (btw, "q = 1-p" should be the standard definition of q, IMO)
10:35:11  are you a bot hackeso
10:35:24  you all have very specific ideas on how the use of letters should be restricted
10:35:33  ...what if q is a state of an automaton though...
10:35:40  being a not-mathematician, i don't
10:37:31  That seems fine for a two-state automaton.
10:37:58  shallots
10:38:01  Actually, I guess using delta for diagonal is only a category thing?
10:38:13  What do normal people call f : a -> (a,a)?
10:38:41  shachaf: `dup` is the suggestion recently/currently discussed on the haskell libaries mailing list
10:38:45  @pl \a -> (a,a)
10:38:45  join (,)
10:39:04  *libraries
10:39:35  `diag` is a plausible name, of course.
10:39:36  ​/srv/hackeso-code/multibot_cmds/lib/limits: line 5: exec: diag`: not found
10:40:11  And yes, I would probably use a lower case delta in formal writing, if I needed a name.
10:40:26  Oh, right, people use lowercase delta for it rather than capital.
10:42:47  ayyy
10:43:01  idea: whitespace (the eso) but with added blank characters
10:59:33 -!- cpressey has joined.
11:02:35  hi chris
11:05:16  canned coochie
11:15:42 -!- Phantom_Hoover has quit (Ping timeout: 244 seconds).
11:17:42  !ping
11:59:55  int-e: that looks a lot better (Jot wikipedia edit) thank you! The article is trying to refer everything back to the Barker's iota combinator, and your last sentence does that. I was wondering if there was a simpler example to show w1, but I guess it's not that simple an operation. [w]S & [w]K are useful examples, and the intermediate steps are fol
11:59:56  lowable using the info on the page. Good stuff :)
12:00:08  hi sal
12:00:25  [[ACL]] M https://esolangs.org/w/index.php?diff=65317&oldid=65309 * YamTokTpaFa * (-25) /* History and Turing Completeness */
12:02:08  hi
12:04:57  for opinions on what delta means in maths, how about 4? Some pretty decent mathematicians used that convention quite early on.
12:05:33  salpynx: thanks for the feedback!
12:08:31  I'll keep an eye on the page and defend your IP edit if needed :)
12:10:13 -!- andrewtheircer has quit (Remote host closed the connection).
12:16:28 -!- salpynx has quit (Remote host closed the connection).
12:21:07 -!- nfd has quit (Ping timeout: 246 seconds).
13:41:55 -!- heroux has quit (Ping timeout: 244 seconds).
13:50:40  Oh also
13:50:47  there's something I should say
13:51:19  I spent a weekend in London as a short family vacation. there was something that I found very confusing:
13:53:59  most bus stations had a street level map of its surroundings, which is great, but the problem is, they were all roated such that down on the map was the direction that the sign faced, rather than consistently south.
13:54:19  It drove me crazy because I saw the map oriented randomly in different directions every time. 
13:54:47  It's hard to follow maps that way.
13:54:54  Means you don't need a compass to navigate
13:55:42  I think it's OK when you get used to it
13:56:11  If you get used to it, you no longer need the map signs in the bus stops
13:57:12  the fix is probably to buy a paper city map and ignore the maps on the signs (but still look at the other info on the signs, such as the name of the station and which bus lines stop there and towards where and how often)
13:57:32  I should have probably done that
13:59:44  I think being able to read a map oriented that way is a more transferable ability than you're suggesting
14:00:00  but I don't want to have to
14:00:07  why can't they just put normal maps up?
14:00:24  It's my fault, I should have bought a paper map and used it
14:00:29  What's a "normal map"?
14:01:11  A normal map is like the good maps we used to have 20 years ago, that are no longer possible to buy because not enough people pay for them to be worth economically to make *sigh*
14:01:30  even for Budapest they no longer exist
14:01:48  I am using a combination of a fresh map with the last good map that there was
14:03:26  the latter one is from 2001
14:03:59  or from 2009, I dunno
14:04:03  I'll have to check that at home
14:05:02 -!- Lord_of_Life has quit (Ping timeout: 245 seconds).
14:12:09 -!- Lord_of_Life has joined.
14:27:50 -!- atslash has quit (Quit: This computer has gone to sleep).
14:29:47 -!- andrewtheircer has joined.
14:30:16 -!- heroux has joined.
14:31:09  hi
14:42:08  [[Multi-Set Manipulator/String]] N https://esolangs.org/w/index.php?oldid=65318 * A * (+1589) Created page with "This is a string-based version of [[Multi-Set Manipulator/Subset]], as there are programming difficulties for using lists.  This attempts to make Multi-Set Manipulator a pure..."
14:47:22  [[Multi-Set Manipulator/String]] M https://esolangs.org/w/index.php?diff=65319&oldid=65318 * A * (+75) 
14:51:21  [[User talk:Gamer]] N https://esolangs.org/w/index.php?oldid=65320 * Andrew3335 * (+211) Created page with "It was really fun making that math paper language with you. Sorry if I'm really really late, but thanks for that endeavor. It was my best language so far (dotlang was a befung..."
14:59:39 -!- andrewtheircer has quit (Remote host closed the connection).
15:08:05 -!- wob_jonas has quit (Remote host closed the connection).
15:28:34 -!- xkapastel has joined.
15:32:44 -!- andrewtheircer has joined.
15:33:22  hi
16:00:01 -!- cpressey has quit (Quit: WeeChat 1.4).
16:37:58 -!- atslash has joined.
16:59:59 -!- b_jonas has joined.
17:02:14 -!- Phantom_Hoover has joined.
17:06:53 -!- FreeFull has joined.
17:16:31 -!- MDude has quit (Ping timeout: 246 seconds).
17:45:37  I had idea about something similar to a "do notation" like Haskell but to use with a preprocessor for JavaScript codes. Such as:   const listMonad=(m,f)=>[].concat(...m.map(f)); const x=listMonad*>{ let a=yield [1,2,9]; let b=[3,4,5,7]; return a-b; };
17:48:02  nice
17:48:16  hi zzo
17:50:33  you made recurseme right?
17:52:56  https://stackoverflow.com/questions/57376279/ thoughts abuot this?
17:53:13 -!- andrewtheircer has quit (Remote host closed the connection).
17:53:34 -!- andrewtheircer has joined.
17:53:34  texas
17:57:13 -!- ais523 has joined.
17:57:46  hi ais
17:58:02  andrewtheircer: thoughts
17:58:15  eh
17:58:17  i dunno
17:58:32  i used to be a programmer but now i know nothing
18:02:21  boot
18:07:51  ``` perl -e'while(<>) { if (/^----- ([0-9]+) /) { 13 == $1 and last; } elsif (/^[^ ]/) { m"^[(]?([\-\x27./A-Za-z]+)[!)+*]*\r?$" or die "syntax $_"; push @w,$1; } } print $w[rand@w]," " for 1..21; print "\n";' /hackenv/share/dict/12dicts/Lemmatized/2+2+3frq.txt
18:07:52  partial palm meter breathe near specific agreement beat striking liver qualify western above entity convince subject ranch viewer gas manager extensive
18:08:20  what are you trying to do
18:08:29 -!- andrewtheircer has quit (Remote host closed the connection).
18:08:43  printing random common words
18:09:01 -!- andrewtheircer has joined.
18:09:05  `words 21
18:09:06  ficising creed wportie michtfully cribarabe sain convidentwo vale dra tallatek zygeima acheth eilesita ally iii bcnchover woien devell baram donne ryon
18:09:23  `words 1
18:09:24  biecioul
18:09:24  and random mythic rare words
18:09:29  today's word is objection
18:09:45  how many time travelling esoteric languages've been done
18:21:37 -!- unlimiter has joined.
18:22:44  GARFIELD
18:25:17  check my link andrewtheircer
18:29:48  can't
18:30:40  why
18:30:57  i dunno
18:30:59  i'm actually 14
18:34:36  andrewtheircer: so? that's not an adult site, StackOverflow can be written from the age of 13, read by anyone
18:34:51  i don't actually program then
18:35:01  i friggen don't know the problem
18:35:20 -!- doesthiswork has joined.
18:37:08 -!- ais523 has quit (Quit: quit).
18:37:55 -!- andrewtheircer has quit (Remote host closed the connection).
18:53:26 -!- diverger has quit (Ping timeout: 272 seconds).
18:54:09 -!- diverger has joined.
19:02:17 -!- lldd_ has joined.
19:10:31 -!- sftp has quit (Quit: leaving).
19:32:11  In athletics sport, when do you suppose the traditional approach to high jump with a fixed bar will get replaced by a grid of lights and detectors so that the jumper doesn't have to bet on how high he jumps exactly where and in what directions, the detectors just figure out what the highest line is that he's jumped over? (A bar, lower than usual, can still be there as a guideline for approximately where 
19:32:17  the detectors are.)
19:34:41  There can still be multiple attempts of jumps of course.
19:37:26  that is an interesting idea
19:38:05  I know that major league baseball is going to start using radar to judge whether a ball has gone through the strike zone or not
19:38:16  nice
19:39:40  I wonder if you could do something with long jump and hammer throw too so that it's automatically measured where exactly someone took the last step before the jump or threw from respectively and subtract it
19:39:57  and the umpire will still make a call but is expected to agree with the machine in typical cases
19:40:17  there'd still be some intervals of course, because of technical limitations, in all of those cases, but still it could help
19:40:40  heck, perhaps even for short distance running people would no longer have to start at exactly the same moment
19:40:59  and short distance swimming too
19:45:32  and of course put them in air conditioned buildings so that there's no wind and carefully controlled predictable temperature and air pressure and humidity, and make multiple different categories depending on what accleration the artificial gravitation generator is set to
19:56:02  hehe
19:57:20 -!- sftp has joined.
19:58:13  swimmers have always tried to swim in water of various temperatures, and of course for high level competitions in short distance swimming, they try to set a temperature close to ideal. the Mythbusters even did some attempt to try water with viscosity much higher than usual. but I think nobody experimented with swimming in lower than usual or higher than usual gravity yet.
20:01:08  yeah, it's kind of a hard thing to test, lots of water is kind of a pain to work with
20:01:23  and it shouldn't matter a whole lot, at least if you're submerged
20:01:50  since your density is basically the same as water's
20:02:07  Hooloovo0: sure, although sea water can be denser than normal
20:03:00  true, and a couple of lakes are saltier/denser still
20:05:03  yeah, the Dead Sea most famously, only it's in the Middle East where there are some ... political problems
20:09:25 -!- Lord_of_Life has quit (Ping timeout: 244 seconds).
20:12:29  hmm, it's actually not that different from the great salt lake's salinity https://en.wikipedia.org/wiki/List_of_bodies_of_water_by_salinity
20:12:49 -!- Lord_of_Life has joined.
20:13:53  Hooloovo0: I, um, might be biased and heard more of the former because it's closer to here
20:22:18 -!- lldd_ has quit (Quit: Leaving).
20:28:25  Do you play any Washizu mahjong or dark mahjong or any other kind of Fukumoto variants of mahjong?
20:28:52  I have never played any variant of mahjong including the normal one
20:32:59  Washizu mahjong requires most (but not all) of the tiles to be transparent (so that your opponent can see it too), but dark mahjong can use the ordinary equipment for mahjong.
20:34:04  by transparent, do you mean they're marked on the back too?
20:34:24  can you see them even in the wall/deck from where you're drawing the cards?
20:35:04  b_jonas: That is one way to implement it (I have seen this as a suggestion), but the set I have uses tiles that you can actually see through.
20:35:28  In Washizu mahjong the tiles are drawn from a bag (and you will wear a glove on that hand), so you can't see them before they are drawn.
20:36:23 -!- tromp has quit (Read error: Connection reset by peer).
20:36:59 -!- tromp has joined.
20:37:49  Dark mahjong is you are allowed to discard face-down, but doing so costs 1000 points. Opponent can try to make it face-up by a payment of 2000 points, but if the discarder then bets an additional 4000 points then it remains face-down. However, it is still allowed to call ron on that tile even though you cannot see it! If you do so correctly, then the score for your hand is doubled.
20:37:51  zzo38: I see. I'm just used to cards, not mahjong, which is why I find the idea of transparent strange, although admittedly there is one commercial card game with actually transparent plastic cards (called Swish IIRC)
20:38:05  ah, drawn from a bag, like in Scrabble. makes sense.
20:38:37  (Some rules for dark mahjong are still unclear though, such as how face-down discarding interacts with furiten.)
20:39:46 -!- tromp has quit (Read error: Connection reset by peer).
20:40:30 -!- tromp has joined.
21:45:24 -!- unlimiter has quit (Quit: WeeChat 2.5).
21:53:53 -!- salpynx has joined.
23:13:22 -!- nfd has joined.
23:35:05 -!- MDude has joined.

2019-08-07:

00:04:34 -!- Phantom_Hoover has quit (Ping timeout: 268 seconds).
00:10:28 -!- Lord_of_Life has quit (Excess Flood).
00:11:50 -!- Lord_of_Life has joined.
00:11:58 -!- jix has quit (Ping timeout: 268 seconds).
00:12:08 -!- jix has joined.
00:15:18 -!- atslash has quit (Quit: This computer has gone to sleep).
00:15:32 -!- b_jonas has quit (Quit: leaving).
00:55:43  Sgeo_: Can Sgeolang be ALGOL 68?
00:55:50  That language was so good.
01:01:03 -!- FreeFull has quit.
01:52:29  @metar koak
01:52:29  KOAK 070053Z 30013KT 10SM FEW009 BKN180 20/13 A2990 RMK AO2 SLP123 T02000133
02:41:19  [[Multi-Set Manipulator/String]] M https://esolangs.org/w/index.php?diff=65321&oldid=65319 * A * (+139) 
02:45:09  @metar KSFO
02:45:10  KSFO 070156Z 27015KT 10SM FEW007 SCT180 19/12 A2989 RMK AO2 SLP123 T01890122
02:45:42  The US codes are so easy.
02:45:48  Just add K.
02:49:18  yes
02:49:38  @metar KSJC
02:49:39  KSJC 070153Z 33014KT 10SM FEW050 SCT100 BKN160 23/16 A2988 RMK AO2 SLP117 T02280161 $
03:23:36  [[User talk:A]]  https://esolangs.org/w/index.php?diff=65322&oldid=65296 * Areallycoolusername * (+237) 
04:15:31 -!- doesthiswork has quit (Ping timeout: 248 seconds).
04:15:39  If you spit poison will it last? I would think it might lose its potency after enough time has passed, especially if the floor might absorb it and if it is exposed to the wind.
04:21:55  [[Multi-Set Manipulator/String]] M https://esolangs.org/w/index.php?diff=65323&oldid=65321 * A * (+16) 
04:26:14  it would depend on the poison, I suppose
04:30:16  and, presumably the floor and wind speed
04:35:27  Yes, OK, I suppose so.
04:35:54  What else do you think might affect it?
04:40:08  vapor pressure, temperature, phase of the moon
04:45:02  [[Multi-Set Manipulator/String]] M https://esolangs.org/w/index.php?diff=65324&oldid=65323 * A * (+120) 
04:45:17  [[Multi-Set Manipulator/String]] M https://esolangs.org/w/index.php?diff=65325&oldid=65324 * A * (-36) /* Set-manipulational instructions */
04:48:57  OK
05:02:31  I wish ShaderToy would do a little bit of server-side rendering so it would be possible to browse the list without melting my GPU
05:04:36  [[Multi-Set Manipulator/String]]  https://esolangs.org/w/index.php?diff=65326&oldid=65325 * A * (+443) 
05:07:44  [[Multi-Set Manipulator/String]] M https://esolangs.org/w/index.php?diff=65327&oldid=65326 * A * (-35) 
05:16:15  [[Multi-Set Manipulator/String]] M https://esolangs.org/w/index.php?diff=65328&oldid=65327 * A * (-77) /* Output its own golf score */
05:22:03  [[Multi-Set Manipulator/String]] M https://esolangs.org/w/index.php?diff=65329&oldid=65328 * A * (+49) 
05:29:24 -!- Sgeo_ has quit (Read error: Connection reset by peer).
05:29:49 -!- Sgeo_ has joined.
05:48:45 -!- xkapastel has quit (Quit: Connection closed for inactivity).
06:24:22  I'm trying to track down a copy of the original P-double-prime (𝓟″) paper from 1964, pp.187-194 vol. 3 of the ICC Bulletin. It seems like a digital copy is non-existent. Has anyone here ever seen one?
06:24:39  I'm contemplating making a copy (8 pages) from a physical library https://www.worldcat.org/title/icc-bulletin/oclc/2222680 but it'll be a bit of a long-term mission.
06:26:33  There's a 1979 paper which mentions 𝓟′ which is the original language that 𝓟″ is a context-free improvement on. Also a 𝓟‴ lang (P-triple-prime!) by D. Skordev (1976) is briefly described, and a further development, 𝓟⁰ by the author, Solomon Passy.
06:27:48  I did find copies of Bohm and Jacopini's paper on Flow Diagrams which talks about both 𝓟′ & 𝓟″, and Bohm's 1954 thesis in original French and 2016 English translation, which predates those languages, but relates to digital computing.
06:28:07  The 1964 paper does not appear to be online ... yet
06:31:16  The 1979 paper that describes the extended 𝓟 languages is available https://documents.pub/document/structured-programs-for-turing-machines.html
06:38:58  You could try asking User:R.e.s.
06:40:20  Solomon Passy... never heard of him...
06:45:02  Ah, but Böhm is famous of course.
06:46:27  If it's the right Böhm that is, hmm.
06:46:54  but that seems to be the case... https://en.wikipedia.org/wiki/B%C3%B6hm_tree
06:47:19  (*not* the garbage collector person)
06:51:35  yup, Corado Böhm is the creator of 𝓟″
06:52:50  wow. https://doi.org/10.2307/2270680 ... that's a 3 line review (fully visible in the screenshot) that they offer to let you buy for 30 Euros...
06:53:58  int-e: yes, that kept turning up. It took me a while to realise that the 3 line review was actually the full content for that DOI!
06:56:27  The best info I could find from others who went looking is here https://cs.stackexchange.com/questions/14983/how-to-prove-the-structured-program-theorem but it's not clear that they got to see it.
06:57:05  oh, wow, that's User:R.e.s that shachaf just mentioned?
07:01:11  Anyway I agree that the paper doesn't appear to be available online.
07:06:20  [[MUSYS]] M https://esolangs.org/w/index.php?diff=65330&oldid=63184 * Salpynx * (+69) /* References */  add DOI for the original MUSYS paper
07:08:11  I have found the original paper for this MUSYS language from 1973 which I had been searching for for some time, so I might try to add some more details to the wiki.
07:08:12  I was talking about the esowiki and Wikipedia user.
07:14:18  shacaf: looks like a SE user too, since that username appears on the page I linked to as well
07:19:19  and Solomon Passy seems to be active and more well known in Bulgarian politics, ... and USB charging?? https://en.wikipedia.org/wiki/Solomon_Passy
07:44:36  Oh, that was a worthy and successful initiative indeed. (But I didn't know who was behind it.)
07:45:37  Downside: mobile phones no longer come with chargers. Upside: you can buy mobile phone chargers, and nobody will ask you what mobile phone you have.
07:46:46  Neither of those matches my experience?
07:47:35  (Well they messed it up because while chargers are USB based you still need to know the kind of plug... :P)
07:48:49  And tbh this is all theory to me. I don't have a smartphone.
07:48:49  At least there are USB type-C and Apple Lightning.
07:49:01  And probably still MicroUSB.
07:49:52  In any case I do believe that the situation is far less messy than it was 10 years ago.
07:50:08  I have one charger that charges both my laptop computer and mobile phone.
07:50:12  Very convenient.
07:50:57 -!- atslash has joined.
07:51:22  until you want to charge them both at the same time? hmm
07:51:32  maybe you can plug the phone into the laptop for that
07:52:04  I'd need a second cable.
07:55:01  Yes, sure, and the laptop USB charging/electricity distribution (hmm let's say motherboard) has to be up for it as well.
07:55:25  (I don't really know enough to be more specific than "motherboard" which is bascially all of the computer :P)
07:58:43  [[Special:Log/newusers]] create  * Dtuser1337 *  New user account
08:06:33  [[Esolang:Introduce yourself]]  https://esolangs.org/w/index.php?diff=65331&oldid=65316 * Dtuser1337 * (+326) ;)
08:10:33  [[DDR]]  https://esolangs.org/w/index.php?diff=65332&oldid=64007 * Dtuser1337 * (+60) adding new category
08:11:12  [[Multi-Set Manipulator/String]] M https://esolangs.org/w/index.php?diff=65333&oldid=65329 * A * (-222) 
08:15:26  [[User:Dtuser]] N https://esolangs.org/w/index.php?oldid=65334 * Dtuser1337 * (+39) moved to my new user. (plz dont banish me because i cannot use this (my old) accounts.)
08:17:57 -!- cpressey has joined.
08:21:19 -!- Phantom_Hoover has joined.
08:35:49  [[Stlisp]]  https://esolangs.org/w/index.php?diff=65335&oldid=42087 * Dtuser1337 * (+18) 
09:01:24  So I just heard the phrase "the philosophy of bullshit" and my immediate reaction was that this seems redundant...
09:10:51 -!- MDude has quit (Read error: Connection reset by peer).
09:11:03 -!- MDude has joined.
09:28:18 -!- salpynx has quit (Remote host closed the connection).
09:33:44  That seems unfair.
09:40:10  name one good philosohpy
09:45:43  x
09:49:14 -!- salpynx has joined.
09:50:20  shachaf: https://www.youtube.com/watch?v=S_ommr0Te4A was the context.
09:52:12  shachaf: The thing is, it's really hard to tell philosophy and philosophical bullshit apart. I often can't. Also the categorization will differ from person to person.
10:10:55  At minimum you would seem to need to hold a philosophy in which a distinction can be made between the two, in order to distinguish between the two.
10:11:32  Annoyingly, you can't make someone else also hold such a philosophy.
10:12:11  Additionally, some people just like to argue.
10:13:47  cpressey: I find that last statement offensive.
10:14:18  I find most philosophers very grating.
10:15:02  I mean writings by famous philosophers, not specific humans.
10:15:56  I tend to like philosophy books by Raymond Smullyan, such as _The Tao is Silent_
10:16:00  Is that a philosophy book?
11:11:31 -!- Phantom_Hoover has quit (Ping timeout: 244 seconds).
11:23:53  [[Pointfree programming]]  https://esolangs.org/w/index.php?diff=65336&oldid=57643 * B jonas * (+14) 
11:38:49 -!- salpynx has quit (Remote host closed the connection).
12:02:07 -!- heroux has quit (Ping timeout: 245 seconds).
12:19:33 -!- wob_jonas has joined.
12:19:46  `ehlist http://eheroes.smackjeeves.com/comics/2836328/ready-set-not/
12:19:47  ehlist http://eheroes.smackjeeves.com/comics/2836328/ready-set-not/: b_jonas
13:10:58 -!- heroux has joined.
13:21:39 -!- atslash has quit (Quit: Leaving).
13:21:49 -!- atslash has joined.
13:36:51 -!- doesthiswork has joined.
14:04:48 -!- xkapastel has joined.
14:23:31  [[Tacit programming]] N https://esolangs.org/w/index.php?oldid=65337 * A * (+35) Redirect for synonyms
14:24:05  [[Point-free programming]] N https://esolangs.org/w/index.php?oldid=65338 * A * (+35) Redirect for synonyms
14:29:13  [[Pointfree programming]] M https://esolangs.org/w/index.php?diff=65339&oldid=65336 * A * (+183) Mention some tacit languages not mentioned here yet.
14:31:25  [[Pointfree programming]] M https://esolangs.org/w/index.php?diff=65340&oldid=65339 * A * (-8) Whoops
14:51:30  [[Adjudicated Blind Collaborative Design Esolang Factory]] M https://esolangs.org/w/index.php?diff=65341&oldid=40772 * A * (+63) 
14:51:58  [[Advanced Brainfuck]] M https://esolangs.org/w/index.php?diff=65342&oldid=54735 * A * (+76) 
14:53:01  [[Aeon]] M https://esolangs.org/w/index.php?diff=65343&oldid=39332 * A * (+75) 
14:54:06  [[Al Dente]] M https://esolangs.org/w/index.php?diff=65344&oldid=62990 * A * (+72) 
14:55:23  [[Al Dente]] M https://esolangs.org/w/index.php?diff=65345&oldid=65344 * A * (-31) Give up on categorizing
14:55:58  [[Big Man Computer]] M https://esolangs.org/w/index.php?diff=65346&oldid=39039 * A * (+64) 
14:57:30  [[Chafa]] M https://esolangs.org/w/index.php?diff=65347&oldid=36608 * A * (+63) The zalgo creates a mess
14:58:07  [[Got a match?]] M https://esolangs.org/w/index.php?diff=65348&oldid=63384 * A * (+45) 
14:58:36  [[GreeeeeeeeenText]] M https://esolangs.org/w/index.php?diff=65349&oldid=58839 * A * (+69) 
14:59:27  [[The Genius from Kiev]] M https://esolangs.org/w/index.php?diff=65350&oldid=61360 * A * (+63) 
15:00:13  [[Brain:D]] M https://esolangs.org/w/index.php?diff=65351&oldid=58854 * A * (+76) 
15:01:35  [[DukkTap]] M https://esolangs.org/w/index.php?diff=65352&oldid=58864 * A * (+65) 
15:02:10  [[BOREDOM]] M https://esolangs.org/w/index.php?diff=65353&oldid=60546 * A * (+69) 
15:03:07  [[Caeos]] M https://esolangs.org/w/index.php?diff=65354&oldid=60195 * A * (+68) 
15:04:04  [[NEGATOR]] M https://esolangs.org/w/index.php?diff=65355&oldid=59879 * A * (+65) 
15:04:44  [[EZ]] M https://esolangs.org/w/index.php?diff=65356&oldid=59877 * A * (+72) 
15:05:29  [[ElemScript]] M https://esolangs.org/w/index.php?diff=65357&oldid=59805 * A * (+88) 
15:06:00  [[HuffPuff]]  https://esolangs.org/w/index.php?diff=65358&oldid=59255 * A * (+76) 
15:07:17  [[Quite]] M https://esolangs.org/w/index.php?diff=65359&oldid=59209 * A * (+79) 
15:07:50  [[Ummm...]] M https://esolangs.org/w/index.php?diff=65360&oldid=64878 * A * (+79) 
15:08:25  [[EZ]] M https://esolangs.org/w/index.php?diff=65361&oldid=65356 * A * (-1) 
15:20:03 -!- Vorpal has joined.
15:20:03 -!- Vorpal has quit (Changing host).
15:20:03 -!- Vorpal has joined.
15:20:40  Hi
15:21:47  Hi Vorpal 
15:21:50  hi
15:28:19  wob_jonas: re Lambda: The Gathering, in the concatenative thing I'm working on, I don't "apply from the left" or "apply from the right", but I do "compose before" and "compose after", so that's something I suppose
15:29:31  cpressey: yeah, but like I said, the way LTG cheats is that you get mutable variable slots into which you can store or load functions
15:48:05  "wool" vs "fleece". English is confusing.
15:58:08  Those... are fairly different things, right?
15:59:03  I think they both mean the material used to make textile that originates from sheep or other ungulates.
15:59:22  In different forms
15:59:38  (you can also have wool originating from certain breeds of rabbits)
15:59:39  Can you be more specific? What different forms?
16:00:21 -!- cpressey has quit (Quit: A la prochaine.).
16:00:31  Ok, maybe from any mammal. As opposed to most textiles, that come from cotton, linen, hemp, various parts of other plants, plastics, or a mixture of plastic with cotton.
16:01:02  Wool as a material is assembled from cords of wool, whereas fleece isn't visibly
16:04:03  Taneb: do you mean to say that wool is what you get not from spinning the mammal hairs into thick strands called a yarn or thread and then knitting them into a textile, whereas fleece is the same as felt, which is what you get from just pressing all the hairs together as a flat pane without order until they stick?
16:04:21  Something along those lines
16:04:39  I don't think fleece is the same thing as felt, but it's a lot closer to felt than to wool (the material)
16:04:45  hmm
16:05:05  I'm specifying wool the material because wool is also what I call the hair of sheep and certain other animals
16:16:03 -!- wob_jonas has quit (Remote host closed the connection).
16:28:24 -!- unlimiter has joined.
16:59:02 -!- Phantom_Hoover has joined.
17:05:15 -!- unlimiter has quit (Quit: WeeChat 2.5).
17:06:20 -!- unlimiter has joined.
17:06:29 -!- unlimiter has quit (Client Quit).
17:09:19 -!- unlimiter has joined.
17:09:48 -!- FreeFull has joined.
17:11:27 -!- atslash has quit (Quit: This computer has gone to sleep).
17:14:19 -!- unlimiter has quit (Quit: yes it does).
17:38:23  [[Braincells]] N https://esolangs.org/w/index.php?oldid=65362 * HereToAnnoy * (+82) Created page with "'''Braincells''' is just another [[Brainfuck]] derivative by [[User:HereToAnnoy]]."
17:43:26 -!- b_jonas has joined.
17:46:20 -!- ais523 has joined.
17:47:36  hi ais523
17:48:05  hi b_jonas
17:50:32 -!- b_jonas has quit (Read error: Connection timed out).
17:50:49 -!- b_jonas has joined.
17:54:24  [[Braincells]]  https://esolangs.org/w/index.php?diff=65363&oldid=65362 * HereToAnnoy * (+1154) unfinished, brb
17:55:05 -!- ais523 has quit (Quit: sorry for my connection).
17:55:17 -!- ais523 has joined.
18:18:30 -!- unlimiter has joined.
18:26:19 -!- unlimiter has quit (Quit: THX EVRBDY).
18:47:23 -!- pecan has left.
18:55:01 -!- ais523 has quit (Quit: quit).
19:07:09  [[Adjudicated Blind Collaborative Design Esolang Factory]]  https://esolangs.org/w/index.php?diff=65364&oldid=65341 * Salpynx * (-63) Undo revision 65341 by [[Special:Contributions/A|A]] ([[User talk:A|talk]]) This is not a language.
19:23:26  [[Aeon]] M https://esolangs.org/w/index.php?diff=65365&oldid=65343 * Salpynx * (-23) Fix typo in category and some formatting
19:23:31 -!- nfd9001 has joined.
19:25:32 -!- nfd has quit (Ping timeout: 258 seconds).
19:32:16  [[BOREDOM]] M https://esolangs.org/w/index.php?diff=65366&oldid=65353 * Salpynx * (-23) One language category is probably enough here
19:34:43 -!- diverger has quit (Read error: Connection reset by peer).
19:35:06  [[GreeeeeeeeenText]] M https://esolangs.org/w/index.php?diff=65367&oldid=65349 * Salpynx * (-23) 1
20:09:39 -!- Lord_of_Life_ has joined.
20:12:49 -!- Lord_of_Life has quit (Ping timeout: 246 seconds).
20:12:54 -!- Lord_of_Life_ has changed nick to Lord_of_Life.
20:15:09  So, how would you build a computer out of the "Star Wars" cellular automaton?
20:15:23  It seems perfect for computing. It has stationary elements and it also has spaceships that move at the speed of light.
20:15:42  It's very easy to construct guns in Star Wars.
20:15:45  hasn't somebody built gates for it already?
20:15:55  I dunno, I would hope so?
20:16:53  But I haven't been able to find any information about that.
20:17:27  So I decided to try to start from scratch.
20:18:33  http://www.conwaylife.com/forums/viewtopic.php?f=11&t=283
20:18:45  also http://www.conwaylife.com/forums/viewtopic.php?f=11&t=507
20:19:19  But so far it ain't going too hot.
20:19:36  I think I've seen discussion about it elsewhere but that may have been a similar generations rule
20:20:54  I'm interested in how to go from the gates to the computer
20:21:08  The simplest and most common spaceship in Star Wars is the "bullet." It's just a pair of young cells with a trail of old cells.
20:21:09  Oh shoot, lemme check that out. Thanks!
20:23:51  I already know that. :D
20:26:06  I think it would be cool to go from verilog to logic in CGOL/star wars... it'd be cool if yosys could be hacked to do it
20:26:21  Okay, let's see. I already know that one bullet can destroy another bullet. If they hit each other at a right angle with the right timing, they'll both be destroyed.
20:26:23  That SR latch pattern also has a signal turner, as well as a duplicating signal turner.
20:26:25  It has guns, of course.
20:27:05  I'm still reading the 507 topic
20:27:18  You're also likely to need a way to delay a signal by an odd number of time steps.
20:27:24  And... that's it, that's all you need to build a computer.
20:27:25  someone made an AND gate
20:28:01  Signal duplication, a destructive collision gate, and arbitrary routing gets you a computer.
20:28:13  why do you need to delay by an odd number of steps? why not just work with even periods?
20:30:20  I don't know if you need that or not.
20:30:59  But you might have a situation where, say, bullets can only interact usefully if they're of opposite phases.
20:31:40  Either you need to be able to work entirely with even-phase bullets, or you need some way to transfer information between even-phase bullets and odd-phase bullets.
20:34:56  "say, bullets can only interact usefully if they're of opposite phases" => then you let a gun bullet interact with your signal, and either you get an opposite parity bullet, or you get one after you commute which way the two react
20:36:32  though that could still fail if you can only swap the parity together with negating the signal
20:36:53  I don't know what you can actually do easily in this cellular thingy
20:38:06  I don't even know how those cellular automata work of which I wrote on the wiki
20:38:30  I do know the game of life rule because I wrote a fun golf program to compute it
20:38:48  how did you find star wars? the rule table repository?
20:39:17  nah, that's reverse causation, I knew about game of life way before I started writing such esoteric programs
20:39:21  I made a HighLife program that runs on this LED display I found at a hackerspace at MIT and reverse-engineered
20:39:34  it's been running for 9 years now!
20:39:58  the sign contains an embedded DOS PC and a huge custom ISA card
20:40:37  in order to keep things interesting, it will occasionally spawn a glider at a random location and orientation
20:40:47  this seems to create a good mix of high- and low-activity times
20:41:03  also, the edges wrap around but reversed
20:41:28  so e.g (0,5) is adjacent to (w-1, h-6)
20:41:41  this creates (approximately) the geometry of a projective plane
20:42:05  and the system doesn't lose entropy as fast as it would with empty-cell boundary conditions
20:42:38  is it only one edge that's flipped, or is it both?
20:45:36  both
20:45:47  hm
20:46:27  yeah, both. if it was one edge flipped and one wrapping w/o flip then it would be a Klein bottle
20:46:30  which would probably also work
20:46:32  as would a torus
20:46:36  I just wanted to be fancy
20:46:47  and I think I'd been playing with projective plane in fractal video feedback loops around the same time
20:53:58 -!- salpynx has joined.
21:02:04  https://codegolf.stackexchange.com/q/3434/ specifically says torus, so I didn't have a choice in that, but it doesn't say that the direction of the torus has to be parallel to the cell grid, so I abuse that to make the program shorter
21:03:11  I'm proud of that code
21:03:26  haha
21:03:31  what's the direction of the torus?
21:05:22  kmc: my answer tells that explicitly
21:05:49  "The game board is hard-coded to size 79x23. It is wrapped in a torus: if you leave the board on the bottom, you end up at the top; if you leave on the right side, you end up at the left side but shifted one row down."
21:05:56  ah
21:06:13  that's the easiest to implement
21:06:55  the original version is a cylinder, wrapping around almost horizontally but zeroing above the top and below the bottom, variable size field
21:07:01  the golf version got fixed size because it's golf
21:09:38  I love how TI-BASIC is competitive in code golf competitions like this
21:10:24  why is it
21:11:11  Hooloovo0: How did *I* find Star Wars? I downloaded Mirek's Cellebration way back when.
21:11:12  mostly because all the primitives are tokens and there's a lot of built-in math operators
21:11:36  which are almost all two bytes each
21:13:43  oh, you're allowed to treat it as the binary representation
21:13:44  i see
22:19:28  is there a way to measure entropy , or 'potential energy' in CA configurations? I just watched on of those Star Wars configurations (the one in the large bounding box) waiting for it to settle down. It did at around T=55000
22:20:03  a perfect measure of entropy would be kolmogorov complexity, which is uncomputable
22:20:10  i'm sure there are many heuristic measures that are useful
22:20:22  it felt like you should be able to make some probabilistic statements based on cell density and the kinds of patterns, obviously depending on the particular ruleset
22:20:54  for example you could look for repeats in the history of each cell
22:21:03  count the number of cells that haven't repeated in the past n generations
22:21:09  or if you're doing hashlife, count whole regions
22:23:26  hashlife is tg
22:23:58  some patterns seemed to be more likely 'absorb' energy, and other to 'release' complex patterns... if regions could be classified as one or the other, and the density of the whole thing would influence the likeyhood of one region affecting the other
22:27:20  I'm not aware of any off the top of my head, and I've trolled around conwaylife for a while
22:27:26  err s/trolled/lurked/
22:27:55  Now I'm thinking about studying CA like gasses, making statements about aggregate behaviour using statistics 
22:30:33  there has been some study of simulating gases with CA (search for HPP latice gasses, I think golly has one in its included patterns)
22:30:43  but a lot of CA don't really act like gases at all
22:31:37  yeah most gases don't spontaneously generate wild critters
22:31:41  though I guess hydrogen does
22:31:48  if you have enough mass and time and non-homogeneity
22:32:04  ...
22:32:16  lol
22:32:28  livin' the hash life
22:32:40  i didn't choose the hash life
22:33:37  SHA-420
22:34:20  the 20-round version of SHA-4 should be called SHA-4/20
22:34:22  make it happen
22:34:55  shachaf: and int-e says he didn't choose to be not swedish, and zzo38 says the letters in their name don't mean anything, but all that negativity and denial sounds supicious to me
22:35:14  if you want to convince people that your nick doesn't mean something, I think the best way is to come up with an explanation of what it does mean
22:35:24  but putting a match to hydrogen vs. putting a match to argon ... like you can tell some CA rules will be very inert..
22:35:45  it's actually surprisingly difficult to tell just by the rule string
22:35:56  Rule 0
22:36:13  b_jonas: Hmm? I never claimed my nick doesn't mean anything.
22:36:21  It's obviously the rot13 of "fun puns".
22:36:31  shachaf: no, it's zzo who claimed their nick doesn't mean anything
22:36:44  Oh, zzo38 is also the rot13 of "fun puns".
22:36:44  you just claim you didn't choose it to mean a hash thingy 
22:37:09  No, I was only joking about the algorithm called "hashlife".
22:37:44  I never said anything about my nick.
22:37:53  what... you and zzo38 are _both_ the rot13 of funpuns?
22:38:32  I mean, some of the hackeso commands are a bit rigged, so I could imagine if the rot13 command claimed that zzo38 was the rot13 of funpuns
22:38:35  but _both_?
22:38:43  `` echo shachaf | tr a-z n-za-m
22:38:44  funpuns
22:38:53  ``` rot13 <<<'fun puns'
22:38:54  sha chaf
22:38:55  `` echo zzo38 | tr a-z n-za-m
22:38:56  mmb38
22:39:08  ``cat $(which ```)
22:39:08  ​/srv/hackeso-code/multibot_cmds/lib/limits: line 5: exec: `cat: not found
22:39:15  `` cat $(which ```)
22:39:15  ​/hackenv/bin/`: eval: line 5: unexpected EOF while looking for matching ``' \ /hackenv/bin/`: eval: line 6: syntax error: unexpected end of file
22:39:19  `` cat $(which '```')
22:39:27  gr
22:39:37  `cat bin/```
22:39:38  cat: 'bin/```': No such file or directory
22:39:40  `cat bin/``
22:39:41  ​#!/bin/sh \ export LANG=C; exec bash -O extglob -c "$@" | rnooodl
22:39:49  No output.
22:40:48  the first how many primes did you say? 27?
22:41:03  first 27 primes, ok
22:41:03  `factor 42069
22:41:20  42069: 3 37 379
22:41:23  `factor 42069247365
22:41:24  42069247365: 3 5 2804616491
22:41:39  Hooloovo0: I haven't checked, but I imagine at the extremes there will be 'bad' CA rules that cannot exhibit interesting behaviour, like the trivial "all cells go to 0", and it's in some kind of balanced range where interesting interactions can take over.
22:42:33  is prop 13 a 'bad' CA rule
22:43:10  I guess "all cells go to 0" would be an even worse rule.
22:43:20  Studying trivially rubbish CA's is less interesting than what got me thinking about entropy in Star Wars :)
22:43:30  right, there's been classifications of rules into categories like "dying", "exploding", "expanding" etc, and there's ways to guess what certain rule strings can do
22:43:59  but there's a range where it's pretty unpredictable what adding one death/birth rule will do
22:45:56  https://mathematrec.wordpress.com/2016/09/08/changing-the-rules-part-3/
23:09:38  [ p:11111128263413556049728126571976941130032759962428
23:09:38  b_jonas: |limit error
23:09:38  b_jonas: |       p:1.11111e49
23:09:41  [ p:11111128263413556049728126571976941130032759962428x
23:09:41  b_jonas: |limit error
23:09:41  b_jonas: |       p:11111128263413556049728126571976941130032759962428
23:09:46  [ q:11111128263413556049728126571976941130032759962428x
23:09:47  b_jonas: 2 2 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 17 17 17 17 23 23 23 23 23
23:10:09  int-e: ^ this is a simple first guess, I'm running a longer search
23:11:28  that's a lot of numbers
23:12:15  [ q:11111112020943532694674878126746501120000000000000
23:12:16  b_jonas: 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 5 5 171193786852609
23:12:22  no
23:12:23  [ q:11111112020943532694674878126746501120000000000000x
23:12:24  b_jonas: 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 5 5 5 5 5 5 5 5 5 5 5 5 5 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 11 11 11 11 11 11 11 11 11 11
23:12:27  better
23:16:43  [ q:11111111900997990188240163285841258014887116800000x
23:16:44  b_jonas: 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 5 5 5 5 5 7 7 19 19 23
23:22:23 -!- salpynx has quit (Remote host closed the connection).
23:28:07 -!- doesthiswork has quit (Quit: Leaving).
23:33:16 -!- Phantom__Hoover has joined.
23:36:03 -!- Phantom_Hoover has quit (Ping timeout: 248 seconds).
23:52:26  wait, this is silly, there's a way to make this search much more efficient
23:52:44  [ q:11111111239428571047989046031440000000000000000000x NB. it printed this in the meantime
23:52:45  b_jonas: 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 11 11 11 11 13 13 19
23:57:55 -!- Phantom__Hoover has quit (Ping timeout: 248 seconds).

2019-08-08:

00:07:46  [ `:11111111112779092073579732177590915891200000000000x
00:07:47  b_jonas: `:11111111112779092073579732177590915891200000000000x
00:07:52  [ q:11111111112779092073579732177590915891200000000000x NB. int-e
00:07:53  b_jonas: 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 5 5 5 5 5 5 5 5 5 5 5 7 7 7 7 7 7 7 11 11 11 11 11 11 13 13 13 13 13 13 13 13 13 17 17 19 23 23 23
00:10:15 -!- nfd9001 has quit (Read error: Connection reset by peer).
00:12:01 -!- salpynx has joined.
00:13:24  int-e: ^ that's the best if you use primes no greater than 23
00:13:34  I'm running a longer search now
00:14:00  well, as soon as I fix the bugs in my program
00:14:57  [ q:11111111111269581656547160489766631945078430800000x
00:14:57  b_jonas: 2 2 2 2 2 2 2 3 3 3 3 3 5 5 5 5 5 7 7 7 7 7 7 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 13 13 13 13 13 13 13 13 19 19 19 19 19 19 19 29
00:16:44  int-e: may I ask how good a number you've got, that is, (the the best number you have minus (2**50-1)/9) rounded to two significant digits?
00:17:35  wait, what's the competition?
00:18:23  Hooloovo0: http://esolangs.org/logs/2019-08-02.html#lY
00:20:39  dammit I missed a discussion of TI-8x grayscale
00:21:20  ha, sorry
00:22:32  the display (or at least the controller) doesn't suport any more than black and white, you have to flicker the pixels fast enough that you trick the eye into seeing gray
00:23:40  I too wrote a mandelbrot renderer in BASIC and it took a similarly long amount of time to render
00:23:58  I wonder if you could flash like 8 pictures in BASIC to get flickerless grayscale...
00:24:21  (well, relatively speaking)
00:25:33  also sdcc for the z80 isn't super good
00:26:08  the only compiled language which is half-decent forTI-z80  is AXE
00:29:29  oh come on, stupid program, find a better solution
00:31:10  [ 11111111111269581656547160489766631945078430800000 - (9<.@%~_1+10x^50)
00:31:11  b_jonas: 1.58473e38
00:31:14  Hooloovo0: it wasn't flickerless
00:32:43  [ 0j_2": 11111111111269581656547160489766631945078430800000x - (9<.@%~_1+10x^50)
00:32:43  b_jonas: 1.58e38
00:33:23  ok, I think I'll leave this running for a while
00:35:59  [ q:11111111111161923559652900718659162521362304687500x
00:36:00  b_jonas: 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 7 7 7 7 7 7 11 13 13 13 17 17 17 17 17 17 23 31 59
00:36:21  [ 0j_2": 11111111111161923559652900718659162521362304687500x - (9<.@%~_1+10x^50)
00:36:22  b_jonas: 5.08e37
00:41:48 -!- douglas_ has joined.
00:42:53 -!- douglas_ has quit (Remote host closed the connection).
01:37:46 -!- FreeFull has quit.
01:54:26 -!- xkapastel has quit (Quit: Connection closed for inactivity).
01:57:31  [ q:11111111111111167179461296463398102111816406250000x
01:57:32  b_jonas: 2 2 2 2 3 3 3 3 3 3 3 3 3 3 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 11 11 11 11 13 13 13 13 13 17 19 19 23 23 23 23 23 23 23 23 53 61 73
01:57:35 -!- oerjan has joined.
01:57:55  [ 0j2": 11111111111111167179461296463398102111816406250000x - (9<.@%~_1+10x^50) NB. int-e
01:57:56  b_jonas: 56068350185352286991000705295138889.00
01:58:06  [ 0j_2": 11111111111111167179461296463398102111816406250000x - (9<.@%~_1+10x^50) 
01:58:07  b_jonas: 5.61e34
02:37:11 -!- rodgort has quit (Quit: Leaving).
02:46:42 -!- rodgort has joined.
02:49:42 -!- oerjan has quit (Quit: leaving).
02:57:30 -!- rodgort has quit (Ping timeout: 272 seconds).
02:58:28 -!- rodgort has joined.
03:16:29  what kind of optimization algorithm are you using b_jonas?
03:21:48  [[Adjudicated Blind Collaborative Design Esolang Factory]] M https://esolangs.org/w/index.php?diff=65368&oldid=65364 * A * (+18) At least this is created in 2006.
04:37:59  [[Adjudicated Blind Collaborative Design Esolang Factory]] M https://esolangs.org/w/index.php?diff=65369&oldid=65368 * Salpynx * (-18) Undo revision 65368 by [[Special:Contributions/A|A]] ([[User talk:A|talk]]) Yes, but [[Category:Years]] "All languages should belong to exactly one of these categories, and other articles should not."
06:14:03  b_jonas: that's pretty good
06:14:19  b_jonas: 11111111111111111400018389711831195436675393750000 is the best I've got
06:14:58  What are these numbers?
06:15:20  103-smooth overapproximations of 11111111111111111111111111111111111111111111111111
06:17:13  What is that?
06:17:27  A four-letter word.
06:17:29  I'm looking for clues in the text and not seeing them.
06:17:49  @google "B-smooth"
06:17:50  https://en.wikipedia.org/wiki/Smooth_number
06:18:00  Aha.
06:18:19  Why would you use the word "smooth" to talk about natural numbers? Come on.
06:18:30 * kmc is a smooth operator
06:18:53  shachaf: because we also use the word "round" for natural numbers
06:19:23  i,i kmc^op
06:19:25  and round numbers tend to be smooth
06:19:31  you gotta tell me if you're a c^op
06:19:51  is it opposite day
06:19:57  > 2^5*3^2*5^3*7
06:19:59  no hth
06:20:00   252000
06:20:42  > 2^15*3^10*7^7 -- smooth, not round
06:20:47   1593487871410176
06:22:11  it's not round in base 10 because it doesn't have any 5s
06:22:13  b_jonas: oh, actually 11111111111111111215673466122483207680856045806875 is the best I have.
06:22:52  smooth buddy
06:43:32  I wonder whether an ILP solver would be good at this kind of thing.
06:44:06  I guess probably not very?
06:50:45  I looked into approximate subset sum solvers but they mostly suck
06:50:52  well, all suck
07:08:59  Girl Genius theory: the entire thing's going to be a shaggy dog story, with Agatha, Gil, and Tarvek being unable to claim their titles due to having died in Castle Heterodyne during the Si Vales Valeo procedure
07:09:39  branch and bound is tg
07:09:47  can sat solvers use a trick like that somehow
07:15:48 -!- john_metcalf has joined.
07:22:30  shachaf: Uh, they are?
07:23:00  You only have two values. You cut off branches that are definitely false.
07:23:25  Unit propagation is a combined branch & bound.
07:23:39  It's all so degenerated though that the concept hardly fits.
07:26:47  I guess...
07:26:59  Do SMT solvers use it more directly?
07:27:08  Maybe when used for optimization rather than satisfiability.
07:27:21  Maybe that's pretty far from SAT territory.
07:29:56  I don't know whether the LIA solvers prefer gomory cuts or branch&bound.
07:30:20  (LIA = linear integer arithmetic)
07:31:22  Hmm, maybe lookahead SAT solvers are a bit closer to the kind of thing I was thinking of.
07:31:40  It's not really a bound, though.
07:34:10  [ 0j_2": (9<.@%~_1+10x^50) -~ 11111111111111111400018389711831195436675393750000
07:34:11  b_jonas: 1.30e33
07:34:13  afaiui lookahead is just another heuristic for selecting promising decisions.
07:34:22  nice
07:34:34  [ 0j_2": (9<.@%~_1+10x^50) -~ 11111111111111111215673466122483207680856045806875x
07:34:35  b_jonas: 1.05e32
07:34:37  even better
07:34:43  [ q: 11111111111111111215673466122483207680856045806875x
07:34:43  b_jonas: 3 3 3 3 3 5 5 5 5 7 7 7 7 7 11 11 11 11 13 13 13 13 13 13 13 13 17 19 31 37 37 37 37 43 47 47 47 67 67 97 97 103
07:34:58  Yes, it's a different thing.
07:35:19  I'll try to run this search with different parameters on a faster machine
07:37:47  shachaf: http://esolangs.org/logs/2019-08-02.html#lY
07:38:55  Aha.
07:40:57  b_jonas: http://paste.debian.net/1094920/ has some more results and runtime on a i7-6850K (3.6GHz, single-threaded, written in Haskell, exact arbitrary precision integer arithmetic)
07:42:06  int-e: I don't want to look at spoilers yet
07:42:15  b_jonas: it's only numbers and runtimes
07:43:15  (And spoils the fact that I have tried two different approaches... I don't really think that's a spoiler :) )
07:51:08 -!- b_jonas has quit (Quit: leaving).
08:12:42 -!- Lord_of_Life has quit (Ping timeout: 244 seconds).
08:14:07 -!- Lord_of_Life has joined.
08:14:24 -!- Phantom__Hoover has joined.
08:26:35  Is "rep ret" necessary only when the ret is on an even address?
08:26:43  Also is it necessary at all nowadays or only for old AMD CPUs?
08:26:52  Or maybe I mean odd. Whichever one I mean.
08:29:11  "Continuing in the following generation of AMD CPUs, Bulldozer, we see that any advice regarding ret has disappeared from the optimization guide."
08:29:23  according to http://repzret.org/p/repzret/
08:29:50  Probably not.
08:29:55  Obviously the AMD manuals are the authorative source.
08:31:15  Hmm, I generally only look at the Intel manuals. I guess I should read the AMD ones too.
08:31:23  (Not that I look at the optimization guide hardly ever.)
08:31:45  when are people going to scrap x86 twh hand
08:32:00 -!- cpressey has joined.
08:32:20  maybe when Intel goes out of business.
08:33:39  I imagine Intel could do pretty well at other architectures if it came to it?
08:34:19  but why would they switch away from x86
08:35:00  I think "the world switching away from x86" is more likely than "Intel going out of business"
08:35:13  Though maybe not. Companies can be ephemeral.
08:35:23  I'll believe it when it happens.
08:35:44  The world's most popular operating system is already almost exclusively ARM.
08:38:05  \any architecture with LLVM support is viable these days.
08:38:27  So the popularity of ARM is still no reason for Intel to switch away from x86.
08:38:31  Uh oh.
08:38:39  If I write a compiler should I target LLVM?
08:38:52  probably
08:39:51  Hmm, there were a few things where I wasn't sure LLVM could really do the things I want.
08:39:54  But maybe it's feasible.
08:40:10  x86 is still huge for gaming
08:41:54  Are there any standards like calling conventions or whatever for software that wants to be sure to avoid stack overflow?
08:42:04  For example, a pointer to the end of the stack that it can check.
08:43:31  guard pages?
08:44:41  Presumably programs would like to fail better than a SEGV.
08:45:10  Meh you're so hard to please.
08:45:36  For example to guarantee success before starting a computation rather than crashing in the middle.
08:45:42  This seems pretty basic.
08:45:58  Recursion is the only case where you might need a dynamic check.
08:48:59  Also, are there any clues for why the REX bits are called W R X B?
08:48:59  shachaf: You want to be able to call code from external libraries and you want to be sure to avoid stack overflow?
08:49:08 -!- wob_jonas has joined.
08:49:13  `ping
08:49:14  pong
08:49:28  cpressey: Ideally I'd like this to work across library boundaries, yes.
08:51:27  shachaf: You do seem to be asking a lot
08:53:31  shachaf: I don't know about the ret instructions specifically, but you should look them up in the optimization manuals for your target cpu at "https://software.intel.com/en-us/articles/intel-sdm" and AMD, and in Agner's optimization manuals at "http://www.agner.org/optimize/" if you care
08:54:17  cpressey: I guess my wisdom entry is correct tonight.
08:54:20  shachaf: OK, so I have this computation, and in the middle it loads a shared object and calls the symbol `foo` in it.  You want to guarantee this will not overflow the stack.  You want this guarantee *before starting it*.
08:54:41  That's all I mean by asking a lot
08:54:49  Oh, I see.
08:55:07  cpressey: If all your functions are non-recursive and non-indirect, this can just be in the type of foo.
08:55:27  I guess it's a problem with shared libraries but shared libraries aren't so great in the first place.
08:55:39  If you have control over foo and access to information about it in the compiler, just track the stack size in the compiler, you don't need dynamic checks
08:55:52  If you don't have control over foo, all bets are off
08:56:01  You need something like dynamic checks if you want to support recursion.
08:56:38  OK so you have a general recursive function and you want a guarantee *before calling it* that it will terminate
08:56:38  Besides, you at least need a dynamic check at program startup or something.
08:56:49  No, I want it to be able to fail gracefully.
08:57:04  For example maybe I only want to support bounded recursion where it can decide on the bound up-front.
08:57:59  It's true that I hadn't thought carefully about dynamic libraries, they're kind of tricky because they're all indirect jumps.
08:58:32  Then your "calling convention" is to keep track of the recursion count and "fail gracefully" (however you define that) if the call would mean the count is exceeded
08:58:33  You can have a standard calling convention where dynamic calls are guaranteed 8kB or whatever of stack space, and if they want more than that they can do a dynamic check.
08:58:52  Right. There are a lot of things that are more graceful than SEGV.
08:59:23  shachaf: that would make it tricky to have dynamic calls which make dynamic calls
08:59:24  "why the REX bits are called W R X B" => R for "register" because it extends the field that usually specifies a register operand (though sometimes chooses between instrs), X for "index" because it extends the field that gives the (scaled) index register for memory operands, B for "base" because it may extends the field that gives the base register 
08:59:25  (though may also extend the other register operand for reg-reg instructions), and W for "word" because it can determine word size between 32 and 64 bits
08:59:45 -!- relrod has quit (Ping timeout: 268 seconds).
09:00:00  of course sometimes some of those mnemonics are meaningless, because in some instructions some of the bits are ignored or must be zero
09:00:03  Taneb: Hmm, maybe. How frequent is that?
09:00:13  I don't know
09:00:15  wob_jonas: Aha. Thanks.
09:00:28 -!- relrod has joined.
09:00:30 -!- relrod has quit (Changing host).
09:00:30 -!- relrod has joined.
09:00:34  relrod: helrod
09:01:28  I think dynamic linking is mostly a bad idea for many reasons, but this one can go on the list.
09:01:47  I think dynamic linking is mostly a good idea
09:02:44  imagine having to reinstall every fricking executable on my debian whenever some bug is fixed in one of the frequently used libraries that is currently a shared library
09:03:12  you may still want to link some things statically of course
09:03:33  What if the bug fix requires an API change?
09:04:42  That's quite rare, in my experience
09:06:21  I feel like you're describing an infrequent case with a relatively small benefit, though I don't know.
09:06:28  shachaf: You really have to convince people... C/C++ users foremost... that failing more gracefully than producing a segmentation fault is actually desirable and useful. For that, you have to figure out what that more graceful way would be, especially in the context of C (C++ has exceptions, arguably that makes it easier to do something useful.)
09:06:32  This only really matters for security bugs probably.
09:06:55  int-e: Returning an error?
09:07:08  returning an error from where?
09:07:18  The call that ran out of stack space.
09:07:25  I'm invoking a  void foo()
09:07:35  If foo can fail its return type shouldn't be void.
09:07:59  I don't think you'll convince anybody that way.
09:08:00  If you "fail gracefully" remember to clean up all the resources you allocated... and hope the cleanup code doesn't also need to "fail gracefully"
09:08:16  This sort of thing seems like a basic requirement for reliable software?
09:08:28  Nobody's going to go over millions of lines of code base with void functions and change them.
09:08:36  Oh, I only mean for new programs.
09:08:41  (should write billions)
09:08:52  no, it really depends on what software it is
09:08:56  Existing software can keep using guard pages if you want, I just want my programs to be reliable.
09:09:12  in most cases, in programs I write, most errors don't have to be handled gracefully, I don't have to clean up anything, just print an error message and exit
09:09:30  then I find the very few actual errors that will happen often, and handle those
09:09:30  Well for your own programming language you can define your own ABI.
09:09:43  this is because I mostly write programs for research, not for production
09:09:45  cpressey: I mean, sure, these are problems, but they're problems you already have to solve to write reliable and resilient software.
09:09:55  int-e: I will! I'm just wondering whether this exists anywhere.
09:10:00  (Did you know that LLVM knows about GHC's calling convention?)
09:10:00  so only I run them, and I will edit and rerun them when they hit a case that I don't handle
09:10:13  it would take four times as long if I tried to handle every possible error gracefully
09:10:23  shachaf: Erlang promotes writing reliable and resilient software by *expecting* that processes will sometimes crash
09:10:38  int-e: Here's an example of a bug that came from not having clearly defined stack bounds: https://marcan.st/2017/12/debugging-an-evil-go-runtime-bug/
09:10:47  (I didn't up to a short while ago. I have not checked the details.)
09:10:51  and most of those errors are either detecting internal logic bugs in my program, or warning me that the input has something that I thought it didn't have and so I don't have code to read it properly
09:10:59  That seems far simpler that trying to guess all the ways they might crash and all the cases you need to would need to handle to make them "fail gracefully"
09:11:00  cpressey: But it doesn't expect individual function calls to crash.
09:11:20  Certainly the thing you're talking about is important for building a large resilient system.
09:11:34  But it's not going to be a fractal system where you expect every instruction to potentially fail.
09:11:34  cpressey: exactly, which is why I don't have to do cleanup for the errors in particularly, because I expect they can fail in ways that I don't expect so whatever that causes I have to be able to clean up too
09:11:37  shachaf: Individual function calls can raise an exception, which, if unhandled, causes the process to crash
09:11:52  Exceptions are almost certainly a bad idea for reliable software.
09:12:04  (And probably for other software?)
09:12:16  so I store the data on the file system in such a way that I can recover from the state I can get from a crashed process or power failure
09:12:38  shachaf: only _handling_ an exception is usually a bad idea
09:12:38  shachaf: exceptions solve the API problem presented by functions that cannot return an error condition.
09:12:43  int-e: I did know that they had something though not the exact details. I was under the impression it was some small subset of the GHC calling convention.
09:12:50  raising an "exception" that's actually a fatal error that you can't catch is not a bad idea
09:12:54  it's just strange terminology
09:13:18  int-e: They don't, because if you want your software to be reliable you need to be able to reason about all the ways control flow could go.
09:13:37  So "void foo();" only makes the control flow harder to see.
09:13:46  shachaf: I really don't know details. I was surprised to find that LLVM knows anything about GHC at all.
09:13:58  shachaf: I can always walk into the server room and turn the computer off. How do you reason about that "flow control"?
09:14:06  (It does make sense. But I didn't expect it.)
09:14:15  shachaf: Maybe more to the point, you need a definition of "reliable".
09:14:50  shachaf: Arguably the proper way to handle stack overflows is to enlarge the stack.
09:15:27  int-e: Not forever!
09:15:41  And the proper way to handle OOM is to pause the program until an engineer adds more memory to the computer.
09:15:42  I mean, you could say it's true forever, but now you need to handle out-of-memory errors on every function call.
09:15:55  What if your computer is in space or something?
09:16:51  shachaf: I've heard of aerospace engineering teams being forbidden to use recursive code.
09:16:54  I suppose for embedded systems you basically disallow recursion.
09:17:15  And if you can't recurse, you don't even need a stack, really
09:17:42  Or, at least, you can statically determine how much of it you'll need.
09:18:06  shachaf: hey :P   /late
09:18:13  shachaf: how do you fail gracefully in that context?
09:18:21  Which context?
09:18:26  shachaf: space crafts
09:18:34  Oh, you probably disallow recursion.
09:19:21  I guess you have non-mission-critical stuff which you can afford to process on a best effort basis.
09:20:57  It seems to me like it's easy to turn a system that's reliable and predictable into one that isn't (e.g. by adding useful features), but it's impossible to go the other way.
09:21:50  I certainly think it's reasonable for a program to want to allocate all its memory up front so it can avoid malloc errors.
09:22:02  (Not that that's realistic on Linux.)
09:22:54  shachaf: I was serious when I said you should define "reliable".
09:23:17  It's much easier to hit an explicitly identified target.
09:23:57  That's true.
09:24:13  I don't have a comprehensive definition or anything. I guess there are things like https://en.wikipedia.org/wiki/MISRA_C
09:24:48  It seems easy enough to point out a particular way that software could fail and say that eliminating it would make it more reliable.
09:25:14  shachaf: Are you making up a new language for this, or an existing one, or slightly modifying an existing one?
09:25:59  Let's say making up a new language.
09:26:05  But also wondering about existing systems?
09:32:29  If you're making up a new language then you have a lot more freedom to design it to try to solve some of the problems at the language level.
09:32:54  Neat. Like what?
09:33:40  I'm thinking: End of stack pointer is stored somewhere and available for checking for dynamic cases.
09:33:52  To go back to what you said about bounded recursion, you could make the language only allow bounded recursion, instead of checking if a function exceeds some recursion bound at runtime
09:34:06  Function types are annotated with maximum stack usage, so if the call graph is acyclic everything can be solved statically.
09:34:35  Only allowing bounded recursion seems like a pretty strong constraint.
09:35:12  I mean, especially if it has to be statically bounded (rather than e.g. bounded by an argument).
09:35:22  So you want to allow unbounded recursion but you also want it to be reliable
09:35:53  He wants a Turing Machine... well okay... a RAM machine.
09:36:39  Ah pronouns.
09:36:42  `? shachaf
09:36:43  Queen Shachaf of the Dawn sprø som selleri and cosplays Nepeta Leijon on weekends. He hates bell peppers with a passion. He doesn't know when to stop asking questions. We don't like this.
09:36:55  Queen/He. Okay, mystery solved.
09:37:33  I want to allow programmers to do what they want, and make it easy to do the reasonable thing.
09:38:27  I think dynamic checks are pretty reasonable. Say you have a recursive function to search a tree or something, and you run out of stack space. You return an error. That seems fine to me?
09:38:52  `` dowg | grep Queen
09:38:55  11837:2019-06-17  `` perl -pi -e\'s/Bond\\K/, Queen Elizabeth the first/\' wisdom/p*aneb* \ 9872:2016-12-05  slwd shachaf//s/^/Queen / \ 7390:2016-04-14  le/rn victoria/Queen Victoria is the most victorious queen the world has ever known, even having won at the not dying contest.
09:39:43  what?
09:39:49  was that really me?
09:40:01  oh, I do remember that
09:40:19  it's just strange that I used \K
09:40:34  All the things I'm saying are kind of exploratory, but this is my general attitude. I don't want to make it impossible to avoid these things, I just want the mechanism to be available.
09:41:11  perl -pi -e presumably makes perl generate a position-independent executable
09:41:51  shachaf: presumably, since this is x86_64 so executablesa re position-independent by default
09:44:07  But perl doesn't normally generate an executable in the first place.
09:44:35  well, then it's doubly redundant
09:45:07  I don't know why I'm a queen but I guess I'll take it.
09:45:40  ask boil̈y
09:46:12  `` echo wisdom/p*aneb*
09:46:14  wisdom/people who taneb is not
09:46:28  shachaf: seems you have fungot to thank for that one
09:46:29  `? people who taneb is not
09:46:30  elliott, a rabbi, Mark Zuckerberg, James Bond, Queen Elizabeth the first. Pending approval: Shigeru Miyamoto.
09:46:54  shachaf: https://esolangs.org/logs/2016-12-05.html#lRl
09:46:56  Taneb: Which rabbi are you not?
09:47:35  shachaf: the one from Fiddler on the Roof
09:47:50  Shouldn't you be in bed right now
09:48:08  I never saw that.
09:48:21  But a few days ago I sang some of the songs from it, in Bodega Bay.
09:48:22  Neither have I, but I was once in a production of it
09:48:26  `quote elizabeth
09:48:27  992)  I've also pretended to be Queen Elizabeth the first, but that was a desperate plea for attention
09:48:30  I played the rabbi
09:48:55  `` wc -l quotes
09:48:55  1333 quotes
09:48:57  wob_jonas: I can picture exactly where I was when I pretended to be Queen Elizabeth the first
09:49:01  `quote 1333
09:49:02  1333)  `unidecode ⧸🙼   ​[U+29F8 BIG SOLIDUS] [U+1F67C VERY HEAVY SOLIDUS]   it is with a very heavy solidus that i write to inform you that unicode has too many code points
09:49:38  Does `quote special case numbers? or does it just find all the quotes that mention the number
09:49:43  dunno
09:49:48  `quote 1
09:49:49  1)  EgoBot just opened a chat session with me to say "bork bork bork"
09:50:02  Seems like the former.
09:50:15  ``which quote
09:50:19  ​/srv/hackeso-code/multibot_cmds/lib/limits: line 5: exec: `which: not found
09:50:24  `cbt quote
09:50:26  ​#!/bin/sh \ allquotes | if [ "$1" ]; then \     if expr "$1" + 0 >/dev/null 2>&1; then \         sed "$1q;d" \     else \         grep -P -i -- "$1" \     fi \ else shuf --random-source=/dev/urandom -n 1; fi
09:51:10  What's shuf's normal random-source?
09:51:12  Yeah, that looks like it's special casing numbers
09:51:39  `` allquotes | strace -fo tmp/OUT shuf -n 1
09:51:39  326)  Hmm. I guess it's nearby GRBs that would be problematic?   Sgeo, if by 'problematic' you mean 'what's that in the AAAAAAAAARRRRRGGGGHHHH'.
09:51:41  `url tmp/OUT
09:51:42  https://hack.esolangs.org/tmp/OUT
09:51:58  That looks like urandom.
09:52:14  `1 dobg quote
09:52:18  1/1:9771:2016-11-24  sled bin/quote//s,shuf,shuf --random-source=/dev/urandom, \ 978:2012-12-09  revert \ 977:2012-12-09  cp bin/quote bin/realquote; echo -n $'#!/bin/sh\nsleep 1\nrealquote "$@"\n' > bin/quote \ 0:2012-02-16 Initïal import.
09:52:31  oer
09:52:45  hah. perhaps there was an older version of `shuf` that used /dev/random instead?
09:53:12  Taneb: I heard there are questions that cross your eyes when posed. Is that true?
09:54:31  `quote 2011
09:54:31  No output.
09:54:44  Looking at the logs from that time, oerjan was spreading false rumors about /dev/urandom.
09:54:52  shachaf: I believe so. "Can you cross your eyes?" might make me cross my eyes when posed
09:55:07  `quote 124
09:55:08  124)  I love logic, especially the part where it makes no sense.
09:55:16  yes, it special-cases numbers
09:55:18  `quote 124 
09:55:19  64) Note that quote number 124 is not actually true.
09:56:07  `q 124
09:56:09  124)  I love logic, especially the part where it makes no sense.
09:56:10  `' 124
09:56:12  124)  I love logic, especially the part where it makes no sense.
09:56:13  `" 124
09:56:14  141)  comex: what?   *vorpal   comex: hi, tab-complete completed c to comex instead of Vorpal, dunno why \ 237)  okay see in my head it went, you send from your other number smth like "i'd certainly like to see you in those pink panties again" and she's like "WHAT?!? Sgeo took a pic?!?!?! that FUCKING PIG"
09:56:34  `quotes 124
09:56:34  124)  I love logic, especially the part where it makes no sense.
09:57:45 -!- atslash has joined.
09:58:41  I guess dynamic libraries calling other dynamic libraries is actually reasonably common.
09:59:15  If the whole system was built with this thing in mind, you could maybe do something fancy during relocation.
09:59:20  But that's almost certainly a bad idea.
09:59:35  Instead you should just ban dynamic libraries.
10:00:34  `fetch http://slbkbs.org/tmp/out.a tmp/out.a
10:00:39  http:/slbkbs.org/tmp/out.a: No such file or directory
10:00:45  `fetch tmp/out.a http://slbkbs.org/tmp/out.a
10:00:47  2019-08-08 10:00:46 URL:http://slbkbs.org/tmp/out.a [923/923] -> "tmp/out.a" [1]
10:00:54  `tmp/out.a
10:00:55  ​/srv/hackeso-code/multibot_cmds/lib/limits: line 5: /hackenv/tmp/out.a: Permission denied \ /srv/hackeso-code/multibot_cmds/lib/limits: line 5: exec: /hackenv/tmp/out.a: cannot execute: Permission denied
10:01:00  `` chmod +x tmp/out.a
10:01:02  No output.
10:01:04  `tmp/out.a
10:01:05  finally
10:01:08  finally
10:01:27  that program is so good
10:01:32  `file tmp/out.a
10:01:33  tmp/out.a: ELF 64-bit LSB shared object, x86-64, version 1 (SYSV), dynamically linked, not stripped
10:02:27  shachaf: the system does do a lot of fancy things during relocation already. resolves strong symbols overriding weak symbols, has indirect function symbols that are resolved everywhere the first time they're called, etc
10:03:07  I want to generate a program that uses dynamic libraries, because that's the only way you can make software nowadays apparently.
10:03:17  So I just want it to do the minimum possible.
10:03:34  shachaf: you know you can mix and match stuff, link some libraries statically and some dynamically
10:03:48  Yes. But some things you have to link dynamically.
10:03:54  yep
10:04:36  On Linux I think it's pretty much only OpenGL and Xlib, and their dependencies such as libc.
10:05:20  On Windows system calls are only available via dynamic linking.
10:14:52  By the way, one reason I care about this stack usage thing is that it's relevant for implementing efficient coroutines.
10:18:41  shachaf: you probably already know this, but ais523 is the person to ask about this
10:19:03  That makes sense.
10:19:27  Except for the part where ais523 isn't here right now.
10:24:36  In a desktop context, if a program starts using excessive amounts of stack space, what I'd like to see is the OS staying responsive, so that I can find the process and kill it.
10:25:13  Yes, that's a good OS feature.
10:25:22  It's pretty ridiculous how broken things are.
10:25:23  The program shouldn't be responsible for deciding what "excessive amounts" are, so it's an OS-domain thing.
10:27:27  cpressey: you can set a soft ulimit, in which case the program gets a signal
10:27:49  That seems like a point about memory consumption in general (of which "the stack" should only be a tiny fraction).
10:28:05  Of course stacks are just regular memory.
10:28:14  shachaf: there's a specific setrlimit for stack space
10:29:17  Sure, but you can put your stack pointer wherever you want.
10:30:07  The limit only applies to the "process stack" and not thread stacks anyway, I think.
10:38:34 -!- Phantom__Hoover has quit (Ping timeout: 272 seconds).
10:40:05 -!- john_metcalf has quit (Quit: http://corewar.co.uk).
10:42:27  salpynx: https://en.wikipedia.org/w/index.php?title=Iota_and_Jot&diff=909854762&oldid=909568636 -- I didn't know that "comprised of" was so difficult :-/
10:46:40  I don't know what it means to compose sequences, so that seems less clear to me.
10:49:23  https://en.wikipedia.org/wiki/User:Giraffedata/comprised_of <-- that user is on a vendetta against this usage.
10:50:06  Using that word correctly always sounds wrong to me, so I just avoid it entirely
10:50:28  But the new phrasing isn't accurate either.
10:50:32  "consists" seems better.
10:51:12  It's true that "comprise" is more often used in the reverse sense.
10:52:37 * int-e rephrases to "consisting of"
10:52:45  shachaf: frankly I don't know how it works, but my guess is that it applies to the total of all stacks
10:52:56  It seems not.
10:53:01  the kernel knows which mappings are stacks because they're set to auto-grow downwards
10:53:07  That would certainly be unexpected to me.
10:53:21  What does it mean for stacks to auto-grow downward?
10:53:35  Compared to memory which is mapped and gets faulted in on demand.
10:53:41  Do you mean stack memory gets mapped on demand?
10:53:54  that if you write in a part near the bottom of the stack, its size is extended
10:53:58  but I might be completely wrong here
10:54:15  maybe that applies only to x86_32, where the address space is sparse
10:54:23  s/sparse/tight/
10:54:30  let me see
10:54:48  If it's tight that might mean people map memory near the stack, in which case you're saying the auto-growing stops?
10:55:00  My impression was that a fixed amount like 8MB was mapped at startup and that's that.
10:55:51  shachaf: yes, but the mappings are placed in the address space a semi-smart way so that won't happen often
10:57:10  shachaf: there's a MMAP_GROWSDOWN flag of mmap for autoextending, but it's possible that it's not actually used for stacks
10:57:19  http://man7.org/linux/man-pages/man2/mmap.2.html
10:57:51  "Touching an address in the "guard" page below the mapping will cause the mapping to grow by a page.  This growth can be repeated until the mapping grows to within a page of the high end of the next lower mapping, at which point touching the "guard" page will result in a SIGSEGV signal."
10:57:53  it says
10:58:08  wob_jonas: It's hard to imagine what that would be used for *besides* stacks
10:58:22  cpressey: the manpage explicitly says that it's for stacks
10:58:36  but it's possible that it's not used at all these days, 
10:58:45  or only on certain old architectures
10:58:52  or old types of executables or somethin
10:59:10  but here's the problem:
10:59:23  ``` grep stack /proc/$$/maps
10:59:24  7fbfb9a000-7fbfbbb000 rw-p 00000000 00:00 0                              [stack]
10:59:36  the flags field is 0, so it doesn't actually grow down
11:00:13  do we have a typical libc-based x86_32 executable somewhere on hackeso so we can test how that behaves?
11:01:40  so I'm probably wrong about this
11:03:26  "After some tests on an x84_64 Debian machine, I've found that the stack grows without any system call (according to strace)."
11:03:38  https://unix.stackexchange.com/questions/145557/how-does-stack-allocation-work-in-linux
11:04:30  sure, but does it grow the mapping, or does it just fault in MAP_NORESERVE pages?
11:05:09  ``` perl -e print(0x7fbfb9a000-0x7fbfbbb000)
11:05:09  bash: -c: line 0: syntax error near unexpected token `(' \ bash: -c: line 0: `perl -e print(0x7fbfb9a000-0x7fbfbbb000)'
11:05:16  ``` perl -e 'print(0x7fbfb9a000-0x7fbfbbb000)'
11:05:17  ​-135168
11:05:28  that's definitely not 8 megabytes 
11:07:24  wob_jonas: Thinking about it, it's hard to imagine the kernel implementing MAP_GROWSDOWN in a way that doesn't involve a fault. Well, maybe on some hardware, but...?
11:07:52  I guess it's there to give the kernel the freedom to implement it one way or another, depending on hardware?
11:08:31  It seems like another bizarre way to make things unpredictable.
11:08:33  And, the flag should still be shown in /proc/'s view of it?
11:08:38  Idk
11:08:41  What if someone accidentally maps pages near the current end of the stack?
11:08:51  cpressey: of course it involves a page fault. everything involves a page fault, including allocating mapped pages that weren't used before, or bringing pages in from swap, or just the kernel doing whatever at whim. but the page fault is handled in the kernel, it never raises a signal visible to the process.
11:09:21  the process can technically tell whether a page is mapped, but it should not do that except for performance optimizations or debugging
11:09:32  faulting pages in is mostly invisible in small amounts
11:09:59  obviously it's visible when firefox fills up all my ram and my hard disk starts whirring and the whole system freezes to a halt
11:10:04  but extending the swap a little won't involve that
11:10:09  hmm that is fairly round, 128k plus 4k
11:11:11  shachaf => they won't, because the kernel and libc has heuristics and knobs in sysctl for what address range to map things at, so a single-threaded stack is mapped in places where you can't *accidentally* map something below (you can map something deliberately, but that's your problem),
11:11:41  wob_jonas: Well, trying to answer shachaf's question, "What does it mean for stacks to auto-grow downward? Compared to memory which is mapped and gets faulted in on demand." -- it does get faulted in on demand, by the kernel, transparent to the userland process
11:11:46  wob_jonas: OK, I tested it and it does indeed grow.
11:11:47  for multi-threaded it's the problem of the thread library and you may have to specify a hint for the stack space you need if you are starting LOTS of threads, but then you shouldn't start lots of threads
11:11:55  shachaf: on what architecture?
11:11:59  amd64
11:12:08  I see
11:12:31  anyway, on x86_32 this made sense because the address space was small, and some processes used lots of stack while others used lots of heap
11:12:43  I could imagine a userspace implementation of growing the stack, that the compiler handles via signals or something, but... why?
11:13:16  on x86_64 right now it's less important, because we have significantly less RAM than address space, but this may change in our lifetime
11:13:46  cpressey: yes, you can do such a stupid thing. there is an interface for handling SIGSEGV gracefully, but it's hard to get right and good only for silly tricks
11:13:55  esoteric tricks really
11:14:33  the kernel gives the process all the info about the segfault that it knows in the sa_siginfo or whatever that's called, so the process can know where the fault is
11:14:58  you can implement user-space swapping that way, or unusual garbage collectors
11:15:25  Tbh, I hate memory mapping and signals. As abstractions. They're ugly. They're performant, so I see why they're used, but that doesn't mean I have to think they're pleasant.
11:15:43  but it's a magnitude more dangerous than just the usual cases when you try to do something nontrivial in a signal handler
11:16:06  cpressey: yes, which is why we usually don't do esoteric tricks like this unless they're really needed
11:16:58  int-e: whoa, I thought that edit was a minor phrasing maybe-improvement, but it comes with an essay and it's own project? I'm going to have to read the essay and see if I agree with their point, I have no strong opinion. Correct logic relating to the subject is more important. 
11:17:04  `` echo $'#include \n#include \n#include \nchar buf[1024]; void print_stack() { FILE *f = fopen("/proc/self/maps", "r"); while (fgets(buf, sizeof buf, f) != 0) { if (strstr(buf, "[stack]") != 0) { printf("%s", buf); break; } } fclose(f); } int main(int argc, char **argv) { while (1) { print_stack(); alloca(1024); } return 0; }' >/tmp/f.c;gcc -o /tmp/f /tmp/f.c;/tmp/f>tmp/OUT
11:17:05  we just let the kernel guys handle swapping, whether it's swapping to disk, to compressed RAM, or (sigh) to network
11:17:07  ​/hackenv/bin/`: line 5:    63 Segmentation fault      /tmp/f > tmp/OUT
11:17:11  `url tmp/OUT
11:17:11  https://hack.esolangs.org/tmp/OUT
11:17:38  ``` perl -e 'print(0x7fbf0d2000-0x7fbf8cf000)'
11:17:39  ​-8376320
11:17:58  8675309 bytes is the maximum. Figures.
11:18:07  I'll stick to writing interpreters in Haskell where I can pretend everything is just math. Beautiful, beautiful math. Which I am bad at.
11:18:15  shachaf: I think that may depend on sysctl stuff and perhaps setrlimit
11:18:43  Nope, it's always that number.
11:18:59  cpressey: yeah, that aligns with the general good advise to not optimize prematurely
11:19:12  No it doesn't?
11:19:22  I mean, depends on what you're doing.
11:19:26  cpressey: but this is #esoteric so we sometimes talk about silly optimizations
11:20:29  shachaf: dude, just last evening I made a program to search solutions to int-e's problem in python, even though that means that the integers take like 128 bytes of memory rather than just the 24 or 32 bytes that I would need in C++
11:20:34  the whole thing is sluggish
11:20:39  I should rewrite it in C++
11:20:54  but I did at least get preliminary results, and know what my inner loop is and what I would have to rewrite if I wanted to do it better
11:21:10  wob_jonas: I presume that int-e's problem is something other than "someone edited my Wikipedia edit to not use 'comprised of'"
11:21:31  Taneb: http://esolangs.org/logs/2019-08-02.html#lY
11:22:04  wob_jonas: The arguments you made about 32-bit stack usage don't work together.
11:22:29  shachaf: why?
11:22:44  If it's designed the way it is to save on address space, you might accidentally map something into that area (by using the rest of your address space).
11:23:00  shachaf: no you can't. 
11:23:05  So it could certainly be an accident, in exactly the cases that it's supposed to be helping.
11:23:21  If accidental mappings into that area can't happen, why not just pre-map the whole region?
11:23:28  shachaf: as a simple model, assume that the stack is mapped near the top of the user address space, and everything else is growing from the bottom of it
11:23:58  shachaf: we don't premap because we don't know if you'll have 256 M of stack and 256 M of heap or 2M of stack and 500 M of heap in an 1G address space
11:24:16  wob_jonas: does it have to have all those numbers as prime factors, or just some subset of them?
11:24:40  Just a subset according to https://en.wikipedia.org/wiki/Smooth_number
11:24:53  shachaf: but it's possible that it wasn't because of address space, but because when this was invented, they didn't have MAP_NORESERVE yet
11:25:09  Taneb: just a subset, at least the way I interpreted it
11:25:25  if it was all those numbers, you'd just have to divide the problem by one of each first and get a smaller problem
11:26:26  Taneb: https://esolangs.org/logs/2019-08-08.html#lL is the best I got so far. I'll do a better search, but I'm busy with other things
11:26:47  Taneb: I should indeed be in bed right now.
11:28:20  or maybe they didn't have a way to not allocate the supporting structures that take up like 1/1000 or 1/500 of the memory mapped, which could be a lot on old systems if you have 100 processes with 8M stack mapping each
11:30:30  or maybe it's for some other historical reason that isn't worth to change now 
11:34:47  `? oots
11:34:49  oots? ¯\(°​_o)/¯
11:34:50  `? o
11:34:51  o is a popular comedy fantasy webcomic. It's about a group called the Order of the Stick, as they go about their adventures with minimal competence, and eventually stumble into a plan by an undead sorcerer to conquer the world, and they're out to stop him and conquer their personal problems at the same time. Hopefully not in that order.
11:43:35  tfw an argument breaks out about whether the filename-selecting regex in the config file should be written as /^.*\.(ts|tsx)$/ or as /^.*\.tsx?$/
11:46:45  the answer to that is obvious
11:47:29  `perl -e print(rand(2)<1 ? "it should definitely be written as /^.*\.(ts|tsx)$/" : "it should definitely be written as /^.*\.tsx?$/"
11:47:30  syntax error at -e line 1, at EOF \ Execution of -e aborted due to compilation errors.
11:47:33  `perl -e print(rand(2)<1 ? "it should definitely be written as /^.*\.(ts|tsx)$/" : "it should definitely be written as /^.*\.tsx?$/")
11:47:33  it should definitely be written as /^.*.tsx?
11:47:42  argh
11:47:48  `perl -e print(rand(2)<1 ? "it should definitely be written as /^.*\.(ts|tsx)\$/" : "it should definitely be written as /^.*\.tsx?\$/")
11:47:48  it should definitely be written as /^.*.(ts|tsx)$/
11:48:04  the other way is unclear and hard to read and should never be committed to production code
11:50:08 -!- Melvar has quit (Quit: rebooting).
11:59:52 -!- Melvar has joined.
12:10:08  [ (q: , 0j_2": (9<.@%~_1+10x^50)&-) 11111111111269581656547160489766631945078430800000x
12:10:09  wob_jonas: |domain error
12:10:09  wob_jonas: |       (q:,0j_2":(9<.@%~_1+10^50)&-)11111111111269581656547160489766631945078430800000
12:10:19  [ (0j_2": (9<.@%~_1+10x^50)&-) 11111111111269581656547160489766631945078430800000x
12:10:19  wob_jonas: _1.58e38
12:10:30  [ (q:) 11111111111269581656547160489766631945078430800000x
12:10:30  wob_jonas: 2 2 2 2 2 2 2 3 3 3 3 3 5 5 5 5 5 7 7 7 7 7 7 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 13 13 13 13 13 13 13 13 19 19 19 19 19 19 19 29
12:15:42  ^ int-e: that's the best you can get with prime factors up to 29 by the way
12:16:09  int-e: The "regular language Jot" is a subset of "all sequences of 0 and 1" according to the definition of a formal language, if we understand 'all sequences' to also include the empty string. In this case 'all sequences of 0 and 1' is the whole, and contains Jot (a subset). So 'all.seq.0.1 contains Jot' => 'all.seq.0.1 comprises Jot'. Flip it to t
12:16:10  he passive => "Jot is comprised of all all.seq.0.1"
12:16:25  which is what you wrote originally with "Jot is the regular language comprised of all sequences of 0 and 1"
12:16:41  salpynx: I think it's exactly the set of all sequences of 0 and 1
12:17:23  Jot is a programming language, not a formal language
12:17:28  As I understood it
12:17:53  taneb: yes, that's the technicality that makes both versions equally awkward, but allows my somewhat contrived and cheeky justification to hold ;)
12:18:04  [ (":@q: ,' | ', 0j_2":-&(9<.@%~_1+10x^50)) 11111111111194529560647830327114462838933000000000x
12:18:05  wob_jonas: 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 5 5 5 5 5 5 5 5 5 7 7 7 7 7 7 7 7 7 7 7 7 11 17 17 19 19 19 19 19 19 19 19 19 23 23 23 23 23 29 71 | 8.34e37
12:18:06  Unless all Jot does is accept or reject a program. In which case it's a set of strings, i.e. a formal language
12:18:23  cpressey: yes, it's a programming language
12:18:26  and in that case it's almost certainly not "any sequence of 0 or 1s" because that's not a very interesting language
12:19:02  [ (":@q: ,' | ', 0j_2":-&(9<.@%~_1+10x^50)) 11111111111185248065004566815208736562760436940800x NB. so far this is worse than the lucky one that I got yesterday
12:19:03  wob_jonas: 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 5 5 11 11 11 11 17 17 17 17 17 17 17 17 17 17 19 19 19 19 23 29 29 29 29 31 47 | 7.41e37
12:19:23  I believe the set of syntactically valid jot programs is equal to the set of all sequences of 0 and 1
12:19:24  [ (":@q: ,' | ', 0j_2":-&(9<.@%~_1+10x^50)) 11111111111161923559652900718659162521362304687500x
12:19:25  wob_jonas: 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 7 7 7 7 7 7 11 13 13 13 17 17 17 17 17 17 23 31 59 | 5.08e37
12:19:30  int-e originally wrote "Jot is the regular language", so I was using that as a starting point 
12:19:47  taneb: that is correct
12:19:52  https://esolangs.org/wiki/Jot "Every combination of 0's and 1's is a syntactically valid Jot program, including the null program."
12:20:00  including the empty string
12:23:00  taneb: your point re. them being equal is key, I was using 'subset' to deliberately (and misleadingly) imply 'proper subset', but rely on the technical meaning of S ⊆ S 
12:23:47  I should make this program output the factoring so that I don't have to enter this command here
12:23:56  but then, this command "proves" that I'm not cheating
12:23:59  The tone of the anti-"consists of justification 
12:24:24  made me want to construct some kind of argument to justify it on a technicallity
12:25:08  I think you can extend any programming language to have a syntax where any string of symbols is syntactically correct but results in some uninteresting semantics such as terminating immediately and producing no output
12:25:21  cpressey: in Jot it's actually interesting
12:25:58  there's an xkcd for this, effect an effect #326
12:27:15  [ (":@q: ,' | ', 0j_2":-&(9<.@%~_1+10x^50)) 11111111111140890057058176051913882460557854562500x
12:27:16  wob_jonas: 2 2 3 3 5 5 5 5 5 5 7 7 11 11 11 11 11 11 11 11 13 13 17 19 19 19 19 19 19 19 19 19 19 19 19 19 19 23 23 23 23 29 29 59 59 | 2.98e37
12:27:23  still too big
12:28:37  Saying "There's an xkcd for this" is the modern version of quoting Bible verses.
12:31:45  Taneb: my point was trying to be something about how some languages have this thing called "syntax" and others don't and you can always take "syntax" away if you like.
12:32:39  It's like a front-line triage to eliminate a class of programs we think you won't be interested in running because we haven't defined any particularly interesting meanings for them
12:34:37  cpressey: I think you're right, Jot isn't a formal or regular language, so that's a problem with the sentence. How would you phrase it to indicate that that some regular language all.seq.0.1 describes the syntax of Jot, which I think is the intended meaning
12:36:47  "The syntax of Jot is comprised of the regular language comprised of..."?
12:38:15  "Any sequence of 0's and 1's is a syntactically valid Jot program" ?
12:38:51  there's a news article about this wiki editior: https://medium.com/backchannel/meet-the-ultimate-wikignome-10508842caad I think I shouldn't be trying so hard to counter their pet peeve
12:39:16  I'm deliberately trying to phrase it in a conversational, almost high-school level way
12:40:02  But the smallest change to the page as I see it now might just be "The syntax of Jot is the regular language..."
12:40:05  cpressey: that's constructive. I should go with that :)
12:41:25  is a syntax 'equal to' a formal language?
12:42:12  salpynx: Yes, I think that's fair to say.
12:43:33  ok, I wasn't sure. We are in pedantic territory here, I wanted to be sure.
12:50:03  [ try =: ":@q: ,' | ', 0j_2":-&(9<.@%~_1+10x^50)
12:50:04  wob_jonas: |ok
12:50:08  [ try 11111111111122460609418029716397205124244969250000x
12:50:09  wob_jonas: 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3 5 5 5 5 5 5 11 11 11 13 13 13 17 17 17 17 17 17 17 19 19 19 29 29 29 29 29 29 29 29 29 29 83 97 | 1.13e37
12:55:28  "All sequences of 0 and 1 comprise the regular language that is the syntax of Jot."  {0,1}* ⊇ Jot syntax "The syntax of Jot is the regular language comprised of all sequences of 0 and 1" Jot syntax ⊆ {0,1}*
13:01:52  I'll stop now, and sleep on it before making any wiki edits. I was enjoying the counter-pedantry, not sure these really are good edits. Making the first edit and prompting the wiki user to convert it to the passive 'comprised of' version since Jot is the focus of the article would be funny.
13:02:12  All languages are a bit silly.
13:03:40  Strict natural language grammar only seems valid when the last natural speaker is dead.
13:13:27  > let x = 11111111111111111215673466122483207680856045806875; y = 10^50 `div` 9 in (fromIntegral (x - y) :: Double, fromIntegral x - fromIntegral y :: Double)
13:13:32   (1.045623550113721e32,0.0)
13:14:57 -!- howlands has joined.
13:23:35  [ try 11111111111269581656547160489766631945078430800000x
13:23:35  wob_jonas: 2 2 2 2 2 2 2 3 3 3 3 3 5 5 5 5 5 7 7 7 7 7 7 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 13 13 13 13 13 13 13 13 19 19 19 19 19 19 19 29 | 1.58e38
13:24:04  yeah, I've seen that one already
13:25:09  wob_jonas: this wasn't a new result; it was just an experiment how bad the cancellation with double precision would be :)
13:26:21  11111111111269581656547160489766631945078430800000 is the optimum for the first 11 and 12 primes.
13:26:39  int-e: sure, the one I entered isn't really new either, I just started a search with different parameters while the first one is still running (for an expected three more hours), and it found this while it's still searching the part of the search space that I've already searched fully
13:26:59  it will get in a disjoint part of the search space eventually though
13:27:13  yeah
13:27:54  But I couldn't make my approach for finding the optimum work beyond 15 primes. (I actually ran out of memory (32GB here).)
13:28:13  sure, I'm not looking for the optimum with a given number of primes now
13:28:45  the three hour long search that I'm running could find solutions with 103 in them in theory
13:28:48  (restricting to the first n+m primes was the "first approach" in my paste)
13:32:43  the first search should eventually reproduce the best solution that I found during the night
13:37:09  [ try 11111111111112819215968651733403643249992663040000x
13:37:10  wob_jonas: 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 5 5 5 5 7 7 7 7 7 11 11 11 11 11 11 13 13 13 13 17 17 19 19 23 23 23 23 23 23 29 29 29 47 53 83 | 1.71e36
13:37:20  I'm still afraid that that one was a lucky fluke by the way
13:38:02  feel free to suggest a different target to check that theory :)
13:38:27  no need, I can just modify my search if I want
13:38:32  it still takes lots of time
13:38:47  and my search is still an inefficient single-threaded python3 program
13:39:34  it would probably become much faster if I rewrote it to an efficient C++ program
13:39:45  but I probably won't do that now
13:39:48  what are you using for arithmetic?
13:39:56  python's built-in integers
13:40:06  so... gmp
13:40:09  probably
13:40:23  Pretty sure that's what they use by default.
13:40:24  but note that most of the numbers are 1 or 2 or 3 words long, none longer than 3 words
13:40:34  Sure.
13:40:40  and I'm multiplying numbers so that the product doesn't exceed 3 words
13:41:31  I think the arithmetic isn't the slow part
13:41:38  But you're right; this means that gmp is probably not the bottleneck here; the interpreter overhead should be significant.
13:42:02  but the numbers are larger than fits in a small int and so allocated randomly spreaded in the python heap 
13:42:29  so I have a lot of overhead on memory throughput
13:42:41  or L3 cache throughput 
13:43:16  a proper prorgam would allocate these in a dense array, 32 or 24 or 16 bytes per number
13:43:52  (16 bytes means that I use approximate numbers, which means I need extra code to track the exact values for when I find a hit, but it'd be the most efficient)
13:44:50  [ try 11111111111111167179461296463398102111816406250000x
13:44:50  wob_jonas: 2 2 2 2 3 3 3 3 3 3 3 3 3 3 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 11 11 11 11 13 13 13 13 13 17 19 19 23 23 23 23 23 23 23 23 53 61 73 | 5.61e34
13:44:54  this is the one I found yesterday, right?
13:45:25  yes
13:45:28  yeah
13:45:32  ok, so the search reproduced it
13:46:00  I should have added code to print anything better than say 1e40, to know if this is a fluke
13:46:18  um, anything better than 1e38 rather
13:46:38  the code only prints the best found so far, so I won't know if it finds ten other 1e35 sized solutions
13:47:18  although technically I could modify the main part of the code and continue from where I stopped it, but I don't want to do that now
13:53:21 -!- salpynx has quit (Remote host closed the connection).
14:02:28  [ try 11111111111111158344848599503479968356777700860000x
14:02:28  wob_jonas: 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 5 5 5 5 13 13 13 13 17 17 17 17 17 17 17 17 17 19 19 19 19 19 19 19 19 19 19 31 89 103 | 4.72e34
14:02:49  now that one is new, and the best I've found so far
14:02:57  and, what do you know, 103 is a factor in it
14:03:17  int-e: ^
14:04:27  [[User talk:A]] M https://esolangs.org/w/index.php?diff=65370&oldid=65322 * A * (+2810) /* Blocked */
14:07:05  progress.
14:07:29  [[User talk:A]] M https://esolangs.org/w/index.php?diff=65371&oldid=65370 * A * (-606) /* Minimal J for Beginners */
14:08:33  I wonder if I should try to make the memory access more predictable by really-deep-copying the large array, in the sense that I copy even the biginteger objects too (an unnatural operation on python) to have them reside mostly sequentially in memory
14:11:26  Hmm...
14:11:44  perhaps even 64-bit integers could be enough for the inner loop, and then recheck whenever I get an approximate match
14:11:57  could I implement that in python?
14:12:00  or 64-bit floats?
14:12:15  yeah, 64-bit floats could work
14:13:56  That would solve the problem of the inefficient allocation
14:14:10  of course I'd still need to keep the array of exact numbers, but those would be rarely used
14:17:10  wob_jonas: I almost hate to mention it but... I wonder how suited Julia would be for this
14:17:28  cpressey: yes, it would work too
14:17:39  I don't know how well the problem vectorizes, and it's not like vectorization is automatic
14:17:43  and C++ would work well too
14:19:41  cpressey: I don't know, you can take a stab at trying to solve this if you want
14:20:45  wob_jonas: I didn't quite catch what the precise problem is, do you have a link?
14:21:01  I gather it has something to do with prime factorization :)
14:21:17  http://esolangs.org/logs/2019-08-02.html#lY
14:22:57  I might try to write a more efficient inner loop
14:23:05  but I can't promise anything
14:23:35  factor: ‘11111111111111111111111111111111111111111111111111’ is too large
14:23:37  drat!
14:24:32  cpressey: 78875943472201*182521213001*25601*9091*5051*271*251*41*11
14:25:04  int-e: I tested that it didn't have all small prime factors, but didn't get a full factorization
14:25:35 * int-e used pari/gp
14:25:44  I doubt I will have much time to play with it
14:26:06  your "(10**50-1)/9" was a convincing enough nothing-up-my-sleeve number that I didn't think you'd cheat by choosing a number such that if you add a very small integer it happens to factor up totally
14:26:22  plus you already said what the best solution you had was
14:26:37  wob_jonas: I didn't intend to cheat... I wanted something where it was easy to see progress :)
14:26:43  (look for the first non-1 digit)
14:26:49  exactlyi
14:27:17  I don't find it easy to see progress because I can't count 15 ones by hand
14:27:39  which is why I have the computer print the difference in %e format
14:27:41  wob_jonas: well, I put the numbers in a file, one line each
14:37:07  13328592851757862349726964424185557245693157222400
14:37:25  [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,2,2,2,2,2,2,2,11,13,2,3,2,5,11,23,2]
14:37:33  [ try 13328592851757862349726964424185557245693157222400x
14:37:34  wob_jonas: 2 2 2 2 2 2 2 2 2 2 2 3 3 5 5 7 11 11 11 13 13 17 19 23 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 | 2.22e48
14:37:51  you don't have to use all of the primes
14:38:14  int-e: I know, but I thought it would be a good place to start
14:38:36  I at least fulfilled the letter of the challenge, given my limited time to work on it :)
14:39:00  [ try 11111112137520138469338239234808374004904964760870
14:39:01  int-e: |value error: try
14:39:01  int-e: |       try 1.11111e49
14:39:12  [ try 11111112137520138469338239234808374004904964760870
14:39:12  int-e: |value error: try
14:39:12  int-e: |       try 1.11111e49
14:39:13  [ try 11111112137520138469338239234808374004904964760870x
14:39:14  int-e: |value error: try
14:39:14  int-e: |       try 11111112137520138469338239234808374004904964760870
14:39:21  int-e: you need to load my environment first, by like
14:39:25  j-bot, cd:
14:39:25  wob_jonas, changed to wob_jonas,#esoteric
14:39:34  int-e: try j-bot, load: wob_jonas
14:39:48  j-bot, safe: ,
14:39:56  j-bot, save: ,
14:39:56  wob_jonas, copied ,#esoteric from wob_jonas,#esoteric
14:40:09  oh, per user state
14:40:14  int-e: or you can j-bot, cd: ,
14:40:20  j-bot, load: wob_jonas
14:40:20  int-e, copied int-e,#esoteric from int-e,wob_jonas
14:40:22  int-e: yeah, it was a strange decision
14:40:30  mm
14:40:33  int-e: you can also have multiple sessions in theory
14:41:11  anyway, 11111112137520138469338239234808374004904964760870 is the best possible if all primes <= 103 need to be used.
14:41:13  int-e: sorry, apparently wrong syntax
14:41:27  j-bot, load: int-e,
14:41:27  wob_jonas, copied wob_jonas,#esoteric from int-e,#esoteric
14:41:43  j-bot, clean:
14:41:43  wob_jonas, changed to wob_jonas,#esoteric and cleared it
14:41:52  j-bot, clean: ,
14:41:52  wob_jonas, changed to ,#esoteric and cleared it
14:41:59  [ try =: ":@q: ,' | ', 0j_2":-&(9<.@%~_1+10x^50)
14:41:59  wob_jonas: |ok
14:42:09  (the target is 111...111/p_1*...*p_27 = 463255947, which is very feasible for brute force)
14:42:44  j-bot, pwd:
14:42:44  wob_jonas, working session is ,#esoteric
14:44:55  hmm, the three-hour long program is getting close to done
14:45:26  I won't run a longer version of that, instead I'll have to improve the program
14:48:51  [ try 11111111111115397052046616165917913561809835753472x
14:48:52  wob_jonas: 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 11 11 11 11 17 17 17 17 17 17 19 19 19 19 19 29 41 43 43 47 47 | 4.29e36
14:49:21  not particularly good, but at least it's new
14:53:32  [[User talk:A]] M https://esolangs.org/w/index.php?diff=65372&oldid=65371 * Areallycoolusername * (+199) repo is almost complete
14:53:56  [[User talk:A]] M https://esolangs.org/w/index.php?diff=65373&oldid=65372 * Areallycoolusername * (-2) 
14:54:51  okay, that was stupid
14:55:13  So I tried (10^49-1)/9...
14:55:33  ...I got 1111111111111111140001838971183119543667539375000 which looked eerily similar to 11111111111111111400018389711831195436675393750000
14:56:20  Which is nice in that it indicates a certain robustness of the approach. But other than that this should be utterly unsurprising :)
14:56:51  (lesson: 10 is smooth)
14:57:53  int-e: sure, that's what you get if your search prefers small prime factors, like I do too
14:58:25  although the solution above happens to be not divisible by 5
14:58:26  Well, mine doesn't do that, exactly. but many of the solutions still feature small prime factors :)
14:58:52  I'm so happy that 11111111111111111215673466122483207680856045806875 is not divisible by 2 :)
14:59:06  heh
14:59:48  (I also wouldn't be surprised if it was actually optimal... but I see no way of proving such a thing.)
15:06:15  the three-hour search finished and didn't find anything better
15:20:28 -!- wob_jonas has quit (Remote host closed the connection).
15:22:51 -!- ais523 has joined.
15:33:20  ais523: I thought of some infinite initial conditions in Conway's Game of Life. For example, you could have an infinite barber pole. It doesn't need caps on the ends, it just goes on forever.
15:33:51  you can do that sort of thing in most cellular automata, I think
15:36:03  I don't think there's anything particularly philosophically problematic about them, it's just that I don't know if anyone studies them much
15:37:51  It starts getting problematic when you start considering the infinite configuration which enumerates (and thus contains) all possible finite configurations
15:38:26  If not problematic, then at least kind of weird
15:40:57  One could probably make a philosophical objection that, for a sufficiently complex infinite form, a single tick is doing an infinite amount of computational work
15:41:25  The barber pole is simple and repeatable and you can efficiently predict how any part of it will be at any tick
15:42:06  Anyway, just thoughts I had recently
15:42:41  that reminds me of a design in the Game of Life I made a while back, which contains a rake that moves at the maximum possible speed for a moving object
15:43:17  so that it creates a constant stream of spaceships that, no matter what they do or what mess they create, will never be able to create anything that shoots down the rake producing them
15:44:02  I was wondering if it would be possible to create some sort of infinitely active pattern like that, but what typically happens is that eventually an eater evolves out of the mess and neatly terminates the infinite stream of spaceships
15:53:48  [[Gulp]] N https://esolangs.org/w/index.php?oldid=65374 * Areallycoolusername * (+563) Created page with "'''Gulp''' is an [[esoteric programming language]] made by ][[User: Areallycoolusername|Areallycoolusername]]. It was made for golfing, and it is [[deque]]-based  == Specifics..."
15:54:06  [[Gulp]] M https://esolangs.org/w/index.php?diff=65375&oldid=65374 * Areallycoolusername * (-1) 
15:54:27  by the way since it's CA time in here
15:54:31  [[Gulp]]  https://esolangs.org/w/index.php?diff=65376&oldid=65375 * Areallycoolusername * (-2) 
15:54:40  how much have people studied CAs on arbitrary / random graphs?
15:55:31  [[Language list]]  https://esolangs.org/w/index.php?diff=65377&oldid=65207 * Areallycoolusername * (+11) /* G */
15:55:54  [[User:Areallycoolusername]]  https://esolangs.org/w/index.php?diff=65378&oldid=65181 * Areallycoolusername * (+11) /* Full List of languages I Made */
15:57:10 -!- ais523 has quit (Remote host closed the connection).
15:58:23 -!- ais523 has joined.
15:59:16 -!- cpressey has quit (Quit: WeeChat 1.4).
16:13:32  ais523: "I was wondering if it would be possible to create some sort of infinitely active pattern" - Golly comes with a couple of patterns that are more or less like that.
16:14:10  yes, but it's hard to prove that they're like that and don't end up eventually chasing down and destroying themselves
16:14:16  True.
16:14:47  Anyway, I've been thinking about replicators in CAs.
16:15:26  There's von Neumann's CA with, what, 27 states?
16:15:48  quite a lot, yes
16:16:02  29 states.
16:16:07  So yeah, that's quite a lot. :D
16:16:08  the Game of Life has replicators but in general it seems like a really fragile system
16:16:26  like, a random block or glider somewhere can completely break a complex pattern and there's nothing you can really do about it
16:16:43  Right.
16:17:22  I've seen... three general categories of replicators, I think?
16:17:56  Or, rather, three categories of CAs with replicators.
16:18:17  There are "naturalistic" CAs like Conway's Life, and Star Wars or whatever.
16:18:36  Simple rules, huge and complicated replicators.
16:19:22  There are von Neumann-style CAs. Complicated rules, large and complex replicators, but not quite as bad as the Conway's Life ones.
16:19:46  Then there are Langton's Loops-style CAs. Medium-complexity rules, very simple replicators.
16:22:12  The upside of the naturalistic and VN-style CAs is that you can build universal constructors in both of them.
16:22:27  I don't think Langton's Loops supports universal construction. I don't know if it can even do computation.
16:23:58  Let's see, I'm trying to remember why LL requires a "sheath". You know what I'm talking about?
16:24:20  sort of, my memory of this is pretty vague
16:24:50  Similar to WireWorld, LL has "wires" that signals can go along. But unlike in WireWorld, the wires have to be surrounded on each side by a special state.
16:25:56  [[Braincells]]  https://esolangs.org/w/index.php?diff=65379&oldid=65363 * HereToAnnoy * (+3169) Hopefully the spec is finished, just need execution examples and clarification. WIP
16:26:06  Hmmmm, here's one reason. In WireWorld, there's a particular state which indicates the tail of a pulse. In LL, on the other hand, the state for the tail of a pulse is identical to the background state.
16:26:40  So the "sheath" state is necessary to regenerate the wire in the wake of a pulse.
16:26:44  I wonder why it was designed that way.
16:27:55  maybe it increases the chance of the wires acting sensibly when they collide?
16:28:55  Well, let me look up how construction works in LL.
16:33:19 -!- ais523 has quit (Quit: quit).
16:34:37  I'm reading Langton's paper in which (I think) he describes LL. http://www-users.york.ac.uk/~gt512/BIC/langton84.pdf
16:36:11  He writes that in order for a CA pattern to be considered properly self-replicating (as opposed to being a pattern which merely "gets replicated" by the rule), it ought to contain some "code" which is both used to direct the replication process, and copied into the daughter pattern.
16:36:32  Which is awfully similar to the way that a traditional quine works.
16:36:38  that's a tricky definition to make precise
16:36:47  it's kind of like the question of whether viruses are alive
16:36:51  they need a certain environment to reproduce
16:36:55  but so does every lifeform
16:37:41  [[User:HereToAnnoy]] M https://esolangs.org/w/index.php?diff=65380&oldid=63533 * HereToAnnoy * (+101) Added [[Braincells]] to language list
16:38:49  Right.
16:39:25  I'm also reminded of a definition that someone on the Code Golf Stack Exchange site suggested for a "proper quine".
16:40:15  Which is that the program should contain at least one element which codes some *other* element of the program.
16:41:09  "Replicating cellular automata", like 1357/1357 or whatever it is, obviously don't allow you to create a replicator which satisfies that criterion, since each element of the mother pattern codes itself and only itself.
16:42:22 -!- b_jonas has joined.
16:42:51  I should probably write the inner loop in C or C++, with 64-bit floats
16:43:00  but I don't promise that I'll do it
16:43:28  what's it in now
16:43:57  cpressey: infinite initial condition for game of life can be useful because it lets you send signals at light speed, while otherwise you can only send signals (repeatedly) at half life speed
16:44:07  s/half life/half light/
16:44:23  so yes, people do study that
16:45:13 -!- FreeFull has joined.
16:45:56  tswett[m]: Neumann's CA => http://esolangs.org/wiki/Von_Neumann%27s_29-state_cellular_automaton -- not that there's much info there
16:49:38  How to determine what time zone is used to display the recent changes in a MediaWiki service if not registering an account?
16:49:53  kmc: python, and I only have the bigint version, not one that does the inner loop with doubles and then checks near matches with bigints
16:53:50  zzo38: what page are you viewing on the wiki? 
16:54:41  b_jonas: cython is a really easy way to rewrite an inner loop as native code
16:57:01  Somebody made a hexagonal-neighborhood loop replicator CA, which is an awfully good idea: https://www.youtube.com/watch?v=_kTMO7oEN8U
17:02:03  kmc: nah, I want to write it in C++, which I already know, and know enough to be able to figure out how to optimize it properly
17:02:11  ok
17:02:16  I won't try to learn some new tool for this
17:02:22  well, ctypes is also easy
17:02:27  but I recommend learning cython at some point
17:02:34  you'll get the basics in no time
17:02:42  but again, feel free to take a stab at the original problem too
17:03:15  you pretty much just put c type declarations on your python variables
17:03:36  Lemme see. So, in LL, a 7 signal is the signal which indicates that the arm should be extended by one cell. The sheath is the part that actually responds to the signal. You couldn't have the background state respond to the signal directly, because if you're a background cell and there's a 7 next to you, you don't know whether you're supposed to respond to it or not.
17:03:36  there's no need for anything like that here
17:14:58  b_jonas: The recent changes (but not the esolang wiki; it is a different one)
17:16:28  zzo38: so the Special:RecentChanges page in the default html view?
17:16:45  b_jonas: Yes.
17:17:28  [[Semordnilap]]  https://esolangs.org/w/index.php?diff=65381&oldid=60021 * Orby * (-8) /* See also */
17:25:50  Now I'm trying to figure out why, in Langton's Loops, two consecutive "4" signals are required in order to effect a turn, instead of just one.
17:30:09  zzo38: good question
17:31:37  [[Language list]] M https://esolangs.org/w/index.php?diff=65382&oldid=65377 * HereToAnnoy * (+17) /* B */ Added Braincells to the language list.
17:32:37  zzo38: I don't know a good answer. if api.php is enabled (it is not on Wikia), even for read only, then you can use that to query the recent changes in a different format, but that's not trivial
17:33:18  you can also use api.php to query the default timezone of the wiki, but I'm not sure if that's always the one used on recentchanges for unregistered users or something may override it
17:34:04  zzo38: you can try asking this question in a mediawiki-related channel on freenode, such as #mediawiki
17:36:48 -!- Phantom__Hoover has joined.
17:37:09  perhaps one of the SpecialPages also tells the default timezone? I dunno
17:39:23  https://www.mediawiki.org/wiki/Manual:Timezone says how to set the default timezone and that that's used in Special:RecentChanges, but doesn't say how to query
17:40:00  ah, got it
17:40:45  zzo38: view the page Special:GlobalPreferences#mw-prefsection-rendering and see what timezone it says there
17:41:01  under "Time zone:"
17:41:34  hmm no, that doesn't seem to wokr
17:41:53  not reliably at least
17:42:05  It says it is an invalid special page
17:45:17  zzo38: is the api.php enabled? if so, you can try loading /w/api.php?action=query&prop=info&meta=siteinfo&format=xmlfm&siprop=general|namespaces|namespacealiases|interwikimap|specialpagealiases|magicwords and see what it says in the timezone attribute of //general , but I'm not convinced that that's always right because I think there's multiple timezone settings
17:46:20  but if the api.php is enabled, then it's possible to query the recent changes with it
17:46:31  and you can compare the date there with the date in the html view
17:50:56  zzo38: look at /w/api.php?action=query&generator=recentchanges&list=recentchanges and compare its timestamps with the one in /wiki/Special:RecentChanges
17:51:32  and no, this won't work on wikia, or some other wikis where api.php is not enabled
17:53:14  OK, that works though on what I am trying to access.
17:54:34  good
17:55:12  https://www.mediawiki.org/wiki/API:Main_page has the docs for api.php in case you want to go more completely with that, eg. get the Recent Changes from only there rather than just eyeball the timezone
18:01:39 -!- MDude has quit (Ping timeout: 248 seconds).
18:06:06  [[Fit]] M https://esolangs.org/w/index.php?diff=65383&oldid=62321 * HereToAnnoy * (+743) Reduces from Boolfuck --> turing complete
18:13:20  [[Fit]] M https://esolangs.org/w/index.php?diff=65384&oldid=65383 * HereToAnnoy * (+1) Fixed typo : "(-v)+" ---> "(--v)+"
18:36:11  [[A1]]  https://esolangs.org/w/index.php?diff=65385&oldid=59728 * Orby * (-5) /* See Also */
18:48:35  yo
18:54:01  o/
18:54:50  I wonder if I could come up with a cellular automaton that's kind of "in between" Codd's CA and Langton's Loops.
18:55:48  LL only has two commands: extend forwards and extend left. That's great as long as little square loopy replicators are the only thing you ever want to make.
18:57:04  Codd's CA has lots of commands that do lots of things, but a replicator in that CA is very complicated.
18:59:46  what's this "Codd's CA"?
19:04:06  https://en.wikipedia.org/wiki/Codd%27s_cellular_automaton
19:05:02  I'm trying to think how how LL might be extended to permit, say, a loop with a kink in it.
19:06:02  In LL, replication essentially consists of just executing the program four times. It does exactly the same thing the first three times (extend for a while and then turn left), and something different the last time (extend for a while, then collide, causing various interesting stuff to happen).
19:06:11  tswett[m]: wait, isn't that the same as Langton's loops?
19:06:28  they both have eight states on a square grid and make squares
19:06:43  No, Codd's CA came first. Note that the pictured loop doesn't replicate; it merely extends an arm forever.
19:07:08  hmm
19:07:25  If you tried to make "a Langton's loop" in Codd's CA, you'd find that the program to generate one side of the loop is too long to fit inside of the loop.
19:07:56  ok
19:07:59  Langton takes advantage of the fact that producing one cell of the loop requires a 3-cell instruction, but the program is executed 4 times, and 4 > 3.
19:08:00  there's a lot of loop rules in golly's sample directory
19:09:32  there's also a couple of similar-to-codd rules like devore
19:10:07  Yeah, the Devore rule is pretty much a strict improvement of Codd's rule. It's better in every way and lets you build a much, much smaller replicator.
19:11:40  I'm pondering this "loop with a kink in it" idea. You could do that with something very similar to a Langton's loop, if only you could somehow make it so that certain parts of the program are only executed some of the time.
19:14:48  So now I'm just thinking about how to accomplish that.
19:19:23  You'd want some way to store a finite state, and suppress some of the program some of the time depending on the state.
19:20:50  Hmmmmmmmm. I like the way my thoughts are going. :D
19:24:36  daisy daisy... ah no, that was HAL's mind going.
19:26:47  The mother loop can be totally passive, and merely send the program out over and over again. The construction arm can have a part on it that's a state machine and filter.
19:31:37  [[Post Dominos]]  https://esolangs.org/w/index.php?diff=65386&oldid=60349 * Orby * (-5) /* See also */
19:38:49  we are all merely codons within the mother loop
19:49:48 -!- lldd_ has joined.
20:10:45 -!- Lord_of_Life_ has joined.
20:14:07 -!- Lord_of_Life has quit (Ping timeout: 246 seconds).
20:14:08 -!- Lord_of_Life_ has changed nick to Lord_of_Life.
20:15:54  I think I've figured it out. I can do almost everything with 12 states.
20:21:18  [[Minaac]]  https://esolangs.org/w/index.php?diff=65387&oldid=59930 * TheJebForge * (-120) /* Minaac */
20:23:22 -!- lldd_ has quit (Quit: Leaving).
20:27:32  tswett[m]: implement it in GPU :-)
20:27:49  I'm gonna implement it in Golly. :D
20:43:59  ok
20:49:47  I have no idea how fractran works
21:07:42  a positive natural is a multiset of primes hth
21:25:25  do you mean like 11111111111115397052046616165917913561809835753472 ? is that a multiset too?
21:34:20  `factor 11111111111115397052046616165917913561809835753472
21:34:21  factor: ‘11111111111115397052046616165917913561809835753472’ is too large
21:34:27  Apparently it's too large to be a multiset.
21:36:37  I see
21:37:41  learn BLJ is a move that lets you solve NP-complete problems with no stars and just one key.
21:55:49 -!- b_jonas has quit (Remote host closed the connection).
22:35:40  Retroforth's case statement causes the function that's using it to exit if the condition is met
22:39:17  so, know anything interesting about cellular automata on random graphs?
22:39:30  seems like you could model some social behaviors that way
22:40:46 -!- xkapastel has joined.
22:52:07 -!- Phantom__Hoover has quit (Ping timeout: 245 seconds).
23:02:03  It's the brain.
23:02:20  kmc: Golly. I've never even thought about cellular automata on non-planar graphs.
23:06:01 -!- FreeFull has quit.
23:19:55  well I guess you're about ready then!
23:22:54  i'm ready for fluffy cat whiskers
23:22:57  is that on the menu
23:31:24  maybe
23:42:20  I successfully made a loop that extends itself. Woo.
23:43:35  int i = 0; while(1) { this_block.append("print(%d);", i); i++; }
23:44:04  At some point I should make a new implementation of Braintrust. Except the best language for that is probably either Common Lisp or maybe some ... assembly like thing? And I have no interest in Common Lisp these days
23:44:25  Why not do it in ALGOL 68?
23:44:34  I think ALGOL 68 is quite an interesting language.
23:44:52  It has features not present in many or any modern languages.
23:45:09  And certainly in languages that existed in 1968.
23:45:13  Does ALGOL 68 have functionality to preserve the current state as an executable that will run another function when started?
23:45:42  I imagine think you could dump memory to a file and load it back up later.
23:46:06  https://ccl.clozure.com/manual/chapter4.9.html
23:46:48  Or maybe I could just... directly copy+modify the current executable, if there's specific data in the executable in a predictable location
23:47:05  That seems like a reasonable approach.
23:47:12  `tmp/out.a
23:47:13  finally
23:47:26  `` xxd tmp/out.a > tmp/out.a.xxd
23:47:26  ​/hackenv/bin/`: line 5: xxd: command not found
23:47:58  `` hd tmp/out.a > tmp/out.a.hd
23:47:58  No output.
23:48:01  `url tmp/out.a.hd
23:48:04  https://hack.esolangs.org/tmp/out.a.hd
23:48:04  I'm wondering if that's sort of like cheating, to compile into an interpreter and call it a "compiler"
23:49:24  [[User talk:A]] M https://esolangs.org/w/index.php?diff=65388&oldid=65373 * A * (+287) /* Concern */
23:57:03  Sgeo_: that's one of the futamura projections. a compiler is a curried interpreter
23:57:10  you provide the program and at some point later you provide the program's input
23:57:21  so the question is just how much optimization takes place at the earlier point

2019-08-09:

00:03:01  Now I have left turning and right turning. I've implemented...
00:03:05  A Universal Turning Machine.
00:03:28  It's capable of facing any direction that any turning machine can face.
00:08:14  lol
00:28:55  So, shoot, I might be nearly done implementing my rule. I think I have enough stuff to make an almost-replicator now.
00:52:14  shachaf: What features is that that ALGOL 68 has and is not present in many or any modern languages?
01:55:57  [[User talk:A]]  https://esolangs.org/w/index.php?diff=65389&oldid=65388 * Areallycoolusername * (+313) Ask User: A for info on String Compression
01:57:35  https://en.m.wikipedia.org/wiki/Comparison_of_ALGOL_68_and_C%2B%2B talks about some features
01:57:58  I think distinguishing values from memory locations is pretty unusual.
02:00:57 -!- MDude has joined.
02:05:31 -!- MDude has quit (Ping timeout: 246 seconds).
02:16:31  Some of the features seem like good. Some seem like should be implemented by macros instead, perhaps.
02:37:57 -!- xkapastel has quit (Quit: Connection closed for inactivity).
02:41:54  Is there a implementation of Haskell in JavaScript that can interface Haskell codes with JavaScript codes?
02:49:35  Dang, I successfully built an almost-replicator.
02:50:13  Let's see if I can upload some pictures.
02:50:18  Before replication:
02:50:35 * tswett[m] uploaded an image: image.png (82KB) < https://matrix.org/_matrix/media/v1/download/matrix.org/jCTRLEizSoOEpqnHMyfvfNFQ >
02:51:13  After replication:
02:51:16 * tswett[m] uploaded an image: image.png (137KB) < https://matrix.org/_matrix/media/v1/download/matrix.org/pNIJWOGhAgTGjPJQkIAUumtf >
02:53:04  So, this is essentially a Langton's loop... more or less.
02:53:37  The genome consists of five segments, separated by orange signals.
02:56:04  Segment 1 extends the construction arm and puts filter data along it using teal and cyan signals. Segment 2 simply extends forward a bunch of times using cyan segments. Segment 3 makes a single left turn, then moves forward 5 times. Segment 4 turns left, moves forward 4 times, and turns left again. Segment 5 turns right, moves forward 5 times, and turns right again.
02:58:05  Ummmm, a video would make this a lot clearer. Maybe.
03:06:52 -!- tromp has quit (Read error: Connection reset by peer).
03:07:28 -!- tromp has joined.
03:24:15  Okay, have a very smol animated GIF which shows how it works.
03:24:26 * tswett[m] uploaded an image: radiator2.mc-2.gif (383KB) < https://matrix.org/_matrix/media/v1/download/matrix.org/ubOayEqlZPdhljpZLpbVdZCe >
03:25:49  The first segment writes a data tape along the construction arm. That data tape is then read in order to determine which segments of the program to pass through to the daughter, and which segments to suppress.
03:26:31  Although the mother creates a near-copy of itself, and then sends its complete genome into the daughter, neither the mother nor the daughter is capable of reproducing afterwards.
04:16:59  I am getting the impression that there are multiple versions of Retroforth, mostly unrelated except in name and creator
04:32:26  Do you know about compiling LLVM into new targets?
04:36:43  Awezoome did a Pachelbel Canon in D
04:36:47  *Awezoom
04:37:26  https://modarchive.org/module.php?34369
04:38:47  Canon of the Three Stars?
04:42:10  tswett[m], huh, Mirek's cellebration came with Langton's
04:42:31  it comes with a lot of things
04:43:12  (Or something similar. The website doesn't say Langton's, hmm)
04:45:24  It is Langton's
04:45:44  http://www.mirekw.com/ca/rullex_udll.html#DNA
04:48:22  https://gist.github.com/Sgeo/ead48728917153cb8fe2c2c2221f2e75
04:48:55 -!- MDude has joined.
05:10:25  So, it should be "pretty easy" for me to implement full self-replication in my CA.
05:10:59  I can just imitate exactly what Langton's Loops does.
05:12:23  But I'd also like to try to think of a better way.
05:52:33  [[User talk:A]] M https://esolangs.org/w/index.php?diff=65390&oldid=65389 * A * (+290) /* Concern */
05:53:52 -!- MDude has quit (Quit: Going offline, see ya! (www.adiirc.com)).
06:46:55 -!- cpressey has joined.
06:51:02  Good morning. I am happy to say that I was wrong a few days ago. It does in fact appear possible to build arbitrary control structures directly in a second-order concatenative language.
07:05:57  I should have an esolang around this soon. Maybe not today though.
07:11:45  cpressey: Do you have a viable definition of the concept? I imagine "concatenative" translates to composition of functions, and second-order means that those functions have shape (p -> q) -> (p -> q) for some (non-functional, but perhaps algebraic) types p and q?
07:13:18  int-e: Basically exactly that, yes.
07:13:30  Oh, and p == q.
07:13:38  "Program states to program states"
07:13:59  They happen to be stacks on unbounded integers in the esolang.
07:14:01  *of
07:16:37  I guess I can always replace (p -> q) by ((p,q) -> (p,q)) :)
07:22:52 -!- Sgeo__ has joined.
07:24:00  Hmm, but I guess you have an informal naturality condition in there as well... something that prevents the translation of, say } (end of block) to embed a full interpreter of your language...
07:25:55 -!- Sgeo_ has quit (Ping timeout: 248 seconds).
07:26:47  (Otherwise we can just enter a "recording" program state on encountering the first '{', collect the program source including nested '{','}' pairs, and execute it upong the final '}', possibly in a loop.)
07:30:06  int-e: Yes. Or if the function being composed can be examined, } could examine it and look for the { and copy the contents -- basically equivalent to what you just said.
07:30:45  I guess my use of "directly" is trying to suggest that the program doesn't have to examine itself like this.
07:31:54  (Functions aren't ordinarily considered something you can examine the structure of, but... you could just say you're concatenating a monoid and later on you'll interpret it so for now you could examine it. Or something.)
08:08:25  Grr.  I think I have to downgrade "arbitrary" to "More arbitrary than I thought, but not totally arbitrary"
08:14:02 -!- Lord_of_Life has quit (Ping timeout: 268 seconds).
08:15:34 -!- Lord_of_Life has joined.
08:23:18 -!- Phantom__Hoover has joined.
09:51:38  I agree with shachaf that exceptions can be kind of awful. But handling possible error returns in every single place a function is called (and every place *that* function is called etc) is also awful.
09:51:55  If you think of them as "non-local exits" they don't seem as bad.
09:52:13  Exceptions are an unusual kind of non-local exit because they don't specify where the exit goes to.
09:52:25  Compared to setjmp or continuations or whatever.
09:55:39  You have to think about where they're catched. The type of exception usually suggests some kind of interface, or at least convention, for where it should be catched. But it's very difficult to formalize it, and raising exceptions at every opportunity makes it that much harder.
09:56:07  I mean, seriously, `car` in Scheme can throw.  `[]` in Python can throw.
09:56:12  shachaf: is 'try' like capturing a continuation and then assigning it to a dynamically-scoped variable?
10:02:11  Often (sorry, just ranting here) I catch an exception only to throw a different exception. I've done this enough that in my head I call this the "exception translation antipattern".
10:03:10  kmc: Yes, I think it's a bit like a dynamic vs. lexical scope thing.
10:03:41  cpressey: I started writing a bit about error handling at http://slbkbs.org/tmp/5.error.handling.txt though I never finished it.
10:05:27  Java's attempt to build an effect system around exceptions feels like an attempt to make it more like lexical scope. Thing is, Java programmers tell me they hate it and they just end up using unchecked exceptions instead.
10:05:53  shachaf: Will give it a look, thx
10:06:07  cpressey: Later I found out that Zig has almost the same system I came up with.
10:06:47  Checked exceptions doesn't seem like the same sort of thing.
10:08:08  "If I raise X I want to know that I've been called by someone that is prepared to catch X" sounds, okay maybe not "lexical", but a lot less "dynamic" in scope
10:08:35  "someone", there I go personifying things again. Dijkstra would not approve
10:09:18  What's wrong with personifying things?
10:10:12  Exceptions try to do a lot of things and they don't seem to do any of them that well.
10:10:37  I should try to find the note where he blames a lot of problems in software on people's tendency to anthropomoriphize it
10:10:41  You should never anthropomize computers. They hate it when you do that.
10:11:02  If I write "foo() raises XError { bar(); vaz(); }" and I expect vaz to fail with XError, it becomes invisible to me that bar might also do that.
10:11:22  *antropomorphize
10:11:42  ...
10:11:54  [second correction elided]
10:12:17  do not antwerpomorphize the dutch hth
10:16:18  https://www.cs.utexas.edu/users/EWD/transcriptions/EWD10xx/EWD1036.html
10:16:40  "My next linguistical suggestion is more rigorous. It is to fight the "if-this-guy-wants-to-talk-to-that-guy" syndrome: *never* refer to parts of programs or pieces of equipment in an anthropomorphic terminology, nor allow your students to do so."
10:17:08  why not
10:17:54  What about "if you give me an epsilon I give you a delta"
10:17:58  s/W/w/
10:18:11  I acknowledge that Dijkstra held opinions, I don't necessarily agree with them, nor always understand the reasons for them
10:18:19  shachaf: what if I don't give you an epsilon
10:18:40  Taneb: you have to, sorry
10:18:43  :(
10:18:49  it can be really small
10:18:52  as small as you like
10:19:32  This reminds me, I have an ill-formed question about models of computation that I don't remember whether I asked in here before.
10:19:49  cpressey: meh I think of programs as actors that modify some virtual world... personification is just a tiny step further.
10:20:32  [[Foo machine]] N https://esolangs.org/w/index.php?oldid=65391 * A * (+1670) Created page with "[[Foo machine]] is a hypothetical machine created by [https://codegolf.stackexchange.com/questions/189572/does-this-foo-machine-halt Leo Tenenbaum] in order to demonstrate tha..."
10:20:41  (I also allow "worlds" to be terribly abstract)
10:20:54  There are some facts, like "seemingly impossible functional programs" (equality of total predicates over infinite streams of bits is decidable, etc.) and the fact that integration is computable, that seem pretty mysterious at first when you look at them from the standard perspective.
10:20:58  [[Foo machine]] M https://esolangs.org/w/index.php?diff=65392&oldid=65391 * A * (+4) 
10:21:09  Or even if they don't seem mysterious, the implementation details tend to be fairly convoluted.
10:22:01  In fact the actual idea of the implementation is very simple so it's annoying that it has to be expressed the way it does.
10:22:56  I'd much rather see e.g. the integration thing described as an explicit non-nested dialog between two parties.
10:23:18 -!- wob_jonas has joined.
10:23:28  hi
10:23:40  hello
10:23:50  shachaf: can you give an example of that?
10:23:59  maybe for impossible functional programs
10:24:04  how is that expressed as a dialog?
10:24:05  Something like, we have a single communication channel, and you can send me questions about the function, and I can ask you questions about the arguments, and so on.
10:24:28  these sorts of things are also v. important in complexity theory and cryptography, of course
10:24:32  arthur-merlin classes, etc
10:24:45  kmc: Let's see, what are the existing ways of expressing it?
10:24:46  kmc: http://math.andrej.com/2007/09/28/seemingly-impossible-functional-programs/
10:24:56  oh
10:25:02  I know two ways which are kind of different.
10:25:06  int-e: I've seen the article; I was wondering specifically how to express it as a dialog
10:25:12  but also I don't recall how any of it works at all
10:25:41  OK, I'll give a simpler version of it than the one in that post so we can talk about how it works.
10:26:05  data Conat = Z | S Conat is either a natural number or infinity (disallowing bottoms).
10:27:06  find :: (Conat -> Bool) -> Conat is a function that either returns the smallest conat that matches the predicate, if one exists, or returns infinity.
10:27:44  find pred = if pred Z then Z else S (find (pred . S))
10:28:17  This function works by asking pred Z, pred (S Z), pred (S (S Z)), etc., and outputting a single S each time it gets a no answer.
10:28:29  mm
10:28:52  Then you can use "exists pred = pred (find pred)" to see if any conat matches the predicate.
10:29:26  Since pred is total, this is guaranteed to give an answer, and pred will only ask for some finite prefix of your conat.
10:29:52  pred is total by assumption?
10:30:05  Right, this whole thing only works for total predicates.
10:30:19  shachaf: Is this all lead-up to your ill-formed question?
10:30:27  (Totality is a very strong condition here.)
10:30:28  b/c I'm a bit lost
10:30:53  I mean, now I'm just explaining this thing because it's neat, to discuss other ways of framing it.
10:31:42  You could say, you're my counterparty, and you give me a predicate, call it p. I can ask p questions by passing you a handle to a conat, call it n.
10:31:51  Then you can send me questions about n, and so on.
10:33:03  In the end the dialog between us will look like "<- here's p, -> here's n, <- is n > 0?, -> yes, <- is n > 1?, -> no", etc.
10:33:48  This is a flat thing rather than a sneaky recursive structured thing. "totality" means that you'll only ask me a finite number of questions about n, and I can just look at the questions and see what the largest number you asked about is.
10:34:56  I am sorely tempted to claim all flat things are recursively structured (you just can't usually see the recursion because it's VERY sneaky)
10:35:45  I mean, sure, you can specify things with recursive structure.
10:35:55  I think almost everyone who sees "seemingly impossible functional programs" is confused at first.
10:36:22  there's a wonderful impure way to do the ((Nat -> Bool) -> Bool) -> Nat -> Bool thing... you're given an interrogator (Nat -> Bool) -> Bool that interrogates a subject Nat -> Bool and comes up with a boolean answer in finite time. So you send in subjects that remember the questions they were asked... the first question will always be the same, the second depends on the first, and so on; so you...
10:36:28  ...can reconstruct the whole tree of question this way. The mind-boggling thing is that you can do basically the same thing in a pure function.
10:36:39  One thing I can tell them is, "imagine you pass me a Turing machine that specifies the predicate. Then I pass that machine a Turing machine that specifies a conatural, and I can simulate it to see what it does, and so on"
10:37:01  int-e: I think we were just typing a similar kind of thing there.
10:37:26  This is yet another model of computation.
10:38:21  But I'd like to see something that makes the dialog explicit. There are only two parties, the exists player and the forall player or whatever you call them.
10:38:34  kmc: on random graphs => I was thinking you should use something like the delaunay triangulation of the poisson process ("http://math.bme.hu/~ambrus/pu/randvoronoi.html") to get a planar grid of cells that is isotropic
10:38:34  only you'd probably have to modify it somewhat to make the degree bounded, perhaps by turning it to 3-regular by replacing each node by a loop
10:38:51  If you write "((a -> b) -> c) -> d" it doesn't change the fact that b/d are one player's and a/c are the other's.
10:39:53  shachaf: "I've never even thought about cellular automata on non-planar graphs." => wait really? because Game of Life uses king neighbourhood, and that's not planar
10:40:11  Oh, maybe I meant something stronger than non-planar.
10:40:14  hm, so it's not
10:40:33  what about non-euclidean geometry
10:41:40  Part of the point is, if you say "forall epsilon, exists delta, forall x, ...", the person making the epsilon and x decisions is the same person.
10:42:17  To require them to phrase it in terms of "manufacturing a special sub-person who can make x-choices and passing that sub-person to you" is a complex and bizarre restriction.
10:43:57  I'd say something but tbh I've never understood what corecursion is so I'll not say anything
10:44:15  Ehrenfeucht–Fraïssé games for programming, hmm.
10:44:42  tswett: looks interesting
10:45:15  I think there's a separate programming thing where APIs that are defined in terms of callbacks are sometimes much more awkward than APIs that aren't, because they restrict your flow control to happening in particular ways.
10:45:26  (Rather than just passing events or something.)
10:45:41  Control flow. That one.
10:46:48  cpressey: I think there are probably versions of this that aren't as explicitly about corecursive structures, though maybe it's always implicit in some way.
10:47:06  (I mean, in the sense that functions are codata rather than data, or something.)
10:49:51  Here's one of the things that's usually confusing about seemingly-impossible-functional-programs:
10:50:34  People say "I don't see how it's possible, because I can ask pred infinity, and I can ask pred 0,1,2,3,...,n, but that doesn't tell me anything about pred n+1"
10:51:14  The answer is that you have to pass pred a conatural that's itself expressed in terms of pred. That's the sneaky recursive thing I was referring to.
10:51:41  I... am confuse
10:52:43  By which part?
10:52:45  cpressey: "I catch an exception only to throw a different exception. I've done this enough that in my head I call this the "exception translation antipattern"." => you mean, you make your program print sensible error messages that tell what the user did wrong, rather than some nonsense about where the error was detected like "NullPtrException in me
10:52:45  ssage.java:418", and it's an antipattern because it hurts your job security if other people can use your program?
10:53:38  shachaf "What's wrong with personifying things?" => the computers don't like when you do that
10:53:41  wob_jonas: It's an antipattern only in the sense that different modules define sets of exceptions that are only meaningful to them, and any time an exception crosses those boundaries, you have to "translate" it to make it meaningul
10:53:52  wob_jonas: You know perfectly well that's not what cpressey mean and you're not being helpful or nice when you phrase it like that.
10:53:57  ah yes, int-e already asid that
10:54:34  ...That was probably an overstatement to something that was a harmless joke.
10:54:35  shachaf: By the part where people find this thing about Cantor space any more impossible than, say, the claim that there is no greatest even integer
10:55:18 -!- Phantom__Hoover has quit (Ping timeout: 258 seconds).
10:55:19  I mean, I just universally quantified over an infinite set there in claiming that, pretty spooky huh
10:55:41  You mean you don't see why people are confused?
10:56:05  Well, people are confused about a lot of things.
10:56:30  This is a computational question so I don't the connection to there being no greatest even integer.
10:57:12  A big problem here is that I don't know what a conatural is
10:57:35  Oh, it's an element of the one-point compactification of the naturals, if that helps.
10:57:43  It doesn't.
10:57:49  If not: It's a monotonic function : N -> 2
10:57:52  cpressey: do you know how inductive codata works?
10:58:14  shachaf: there sure are a lot of ways to define the same thing, eh?
10:58:20  Or: It's a Turing machine that either prints some number of 1s and then halts, or keeps printing 1s forever.
10:58:30  "There are only two parties, the exists player and the forall player or whatever you call them." => I heard they were called Adam and Eve, Adam for the forall quantifiers and Eve for the exists quantifiers
10:58:48  ∀dam and ∃ve
10:58:48  shachaf: but it will always print the next 1 within finite time, right?
10:59:04  kmc: No, I don't.
10:59:06  shachaf: yes
10:59:19  kmc: Yes.
10:59:37  cpressey: well do you know what people mean when they say haskell has 'infinite data structures'?
10:59:47  i,i I guess cpressey only learned the counterexamples and not the topology
11:00:23  kmc: Well, I know what they *mean*, but I try not to use that term myself, if that makes sense
11:00:36  cpressey: if you want a better term you could call them codata ;)
11:00:48  Haskell people are often very confusil about which things are data and which things are codata.
11:01:10  in Haskell all 'data' structures are codata
11:01:28  if you write  data Nat = Z | S Nat
11:01:37  then you actually defined conats
11:01:54  because you can construct the value S (S (S (S ... to infinity
11:02:09  I don't see why people are surprised that you can apply one lazy thing to another lazy thing and conclude it will be true for all instances of the thing
11:02:33  "Every integer is either odd or even"
11:02:33  cpressey: Wait, which lazy thing?
11:02:38  shachaf: co-thing
11:02:46  If you prefer that terminology
11:03:02  People are confused because they can't think of an actual algorithm to compute it.
11:03:26  I don't think the algorithm is obvious.
11:03:52  (Or even the fact that it could exist.)
11:04:12  checking whether a total predicate holds for all elements of a set doesn't even sound like an algorithm to me, it sounds like a proof
11:04:20  and proofs are programs, thanks Curry, thanks Howard
11:04:43  Now I'm not even sure whether we're talking about the same thing.
11:05:08  forAll :: (Conat -> Bool) -> Bool is certainly not a proof that Bool is inhabited.
11:05:13  @quote kmc Ints
11:05:13  kmc says: "Haskell is great, because Curry-Howard!  Proving things in the type system.  We can prove that, uh, Ints exist, unless they're ⊥."
11:05:38  OK, well, I'm probably talking nonsense
11:05:50  Still, it doesn't surprise *me*, and I'd like to know why that is
11:06:12  Me too!
11:06:50  The claim is: I can write a program that takes a predicate (over the conaturals, or the Cantor set), and decides whether the predicate holds for every input.
11:07:14  The set is infinite, so you can't just try every input.
11:07:44  You're saying it's not surprising which probably means you have some model for what inputs can be exhaustively searched by an algorithm, and you think these things match that model?
11:09:06  (I mean, obviously it's not surprising to me now because I know how it works, but it was surprising to me until I thought about it carefully.)
11:09:30  shachaf: I used to be a snarky little shit, eh?
11:09:30  I can write a proof that takes a predicate, shows that it holds for a base case, and shows that it holds for succ(x) if it holds for x, and conclude from that that it holds for all x. Does that surprise you?
11:09:34  I mean I still do, but I used to, too.
11:09:51  [[Binerdy]]  https://esolangs.org/w/index.php?diff=65393&oldid=49903 * YamTokTpaFa * (+84) +CATs
11:10:00  What is the difference?
11:10:03  cpressey: Hmm, the claim I'm making holds for the conaturals (with infinity), but it certainly doesn't hold for the naturals.
11:10:21  [[English Binerdy]]  https://esolangs.org/w/index.php?diff=65394&oldid=55887 * YamTokTpaFa * (+72) 
11:10:40  So if the thing you're saying works for the naturals then it's probably not the thing I'm talking about.
11:10:50  shachaf: I'm not thinking about a thing!
11:11:15  OK, maybe I was extrapolating too far. Induction doesn't surprise me.
11:11:26  (Induction on the naturals, I mean.)
11:12:17  [[Darmok]]  https://esolangs.org/w/index.php?diff=65395&oldid=43237 * YamTokTpaFa * (+37) +WIP +CATs
11:12:40  [[Forth]]  https://esolangs.org/w/index.php?diff=65396&oldid=63187 * YamTokTpaFa * (+24) +CAT languages
11:13:07  [[Mishmash]]  https://esolangs.org/w/index.php?diff=65397&oldid=54590 * YamTokTpaFa * (+9) +WIP
11:13:16  Cantor space may be infinite, but it has a finite description. How do you traverse an infinite thing, whether in a proof or in a program? By traversing all cases of its finite description.
11:13:51  That's why it doesn't surprise me.
11:14:05  But N also has a finite description.
11:14:09  [[IBNIZ]]  https://esolangs.org/w/index.php?diff=65398&oldid=40608 * YamTokTpaFa * (+10) 
11:14:13  What, the letter N?
11:14:17  The naturals.
11:14:28  ℕ
11:14:36  Right, that's why I can say things like "Every integer is either odd or even" without testing every integer
11:15:21  OK, but you can't write a program that takes an arbitrary predicate, such as "is either odd or even", and tells you whether every natural satisfies it.
11:15:29  You can prove it for that specific predicate.
11:15:57  shachaf: I can certainly write a program that tries to prove it or refute it...
11:16:08  Yes, and the program might not halt.
11:16:19  Whereas for the Cantor set you can write the program, and it'll always halt and give you the correct answer.
11:16:42  (Assuming the predicate itself is total.)
11:17:11  The program will halt if certain conditions are met.  The predicate must be total.  The infinite set must have some properties that (presumably) being Cantor space gives it.  Not surprising.
11:17:25  [[B-tapemark]]  https://esolangs.org/w/index.php?diff=65399&oldid=38916 * YamTokTpaFa * (+68) 
11:18:02  If there's something surprising, it's that being Cantor space, gives it that property.
11:18:10  [[Pieces]]  https://esolangs.org/w/index.php?diff=65400&oldid=13796 * YamTokTpaFa * (+12) 
11:18:15  I'm sure it doesn't hold for some other spaces.
11:18:19  Yes, that's the surprising thing.
11:18:34  But to me that's something surprising about Cantor space, not the program!
11:18:44  [[Hyperfunge]]  https://esolangs.org/w/index.php?diff=65401&oldid=46445 * YamTokTpaFa * (+23) 
11:18:48  I think "exhaustive search of the Cantor set is possible" is the surprising statement here.
11:19:07  The program shows that it's possible.
11:19:40  For what it's worth I still don't know exactly what the properties that make it possible are.
11:20:13  I know it has to do with compactness, but I'm not sure exactly what the computational content of compactness is, and how it's being used here. I only know how to write it for specific compact spaces.
11:20:43  I feel like "whether this fact is surprising or not" is quite a detour from the original question anyway.
11:21:03  Yeah, I don't know much topology, so I guess I don't officially know if it should surprise me or not?
11:21:41  I'm quite resigned to the fact that there are a lot of topologies with weird properties, so when someone says "Hey! Did you know that you can show X for all of Cantor space" it's not like I'm "REALLY?"
11:22:02  shachaf: What was the original question
11:22:07  The ill-formed one.
11:22:33  shachaf: The one where you wanted to tail-call optimize Arthur and Merlin?
11:23:36  Did I?
11:23:57  The Arthur-Merlin thing seems to be about computationally bounded agents whereas I was just talking about computability for now.
11:24:17  it's about one computationally bound agent, Arthur, and one unbound, Merlin
11:24:20  shachaf: Something like that? You wanted to flatten the conversation between two parties in... one of those things.
11:24:36  Yes, I'm curious about flattened conversations, sure.
11:24:54  although there are twisted versions with more than one Merlins
11:25:01  cpressey: Do you find it surprising that integration of computable functions on computable reals is computable?
11:27:16  shachaf: Ehm. Not sure. The thing that surprises me there is, you have a function and its range is computable reals and you can integrate it at all?
11:27:23  *only the computable reals
11:27:47  Isn't that, like, discontinuous?
11:28:26  It's a bit like saying you have a function on the rationals and you can integrate it. I suck at analysis, but I didn't think that was even valid?
11:28:32  Hmm, you can say it's a function that works on every real.
11:28:46  It can't distinguish the computable ones from the uncomputable ones, of course.
11:29:49  shachaf: I already don't understand why algebraic complex numbers form a field, despite that I was supposedly taught enough Galois theory in the university courses to have to know the proof. 
11:30:01  Computable numbers are way worse than that, they have very surprising properties that are impossible to guess.
11:30:36  And like lots of different definitions that sound similar but are actually different, so you have to be careful what you use in which statement.
11:31:16 * shachaf mumbles something about the effective topos.
11:31:45  I feel like nothing is materially different if you just say "reals" instead. If you have an oracle for an uncomputable real, your computable function will work fine with it.
11:32:00  wob_jonas: Wait, what's hard about those things? Where do you get stuck?
11:32:36  Or are you just saying that you haven't thought about it recently enough to know for sure
11:32:57  Cale: Hale
11:33:02  shachaf: OK, I'll rephrase. I'm surprised that integration of *any* functions is possible *at all*.
11:33:07  Cale: for the computable reals, I definitely haven't tought much about it ever, because it seems so theoretical and I never really needed it
11:33:08  It's like magic
11:33:08  Hellochaf
11:33:14  End of story
11:34:01  I do care a little about the practical side, as in specific algorithms that are either useful in real life or close to useful, but not the abstract stuff 
11:34:03  wob_jonas: To say that computable reals are a field is basically saying that the field operations are computable.
11:34:09  OK, that's reasonable enough.
11:34:50  Cale: yeah, that in particular isn't too hard, but there are other questions you can ask
11:38:42  shachaf: Gabriel's Horn surprises me.
11:39:12  I mean, I don't doubt that integration is a valid concept and all, but, damn.
11:42:05  For the algebraic numbers, I think I understood enough about that at one point (even if I didn't understand all of Galois theory), but has forgotten how it works since.
11:43:08  These days, all that stuff I hear from algebraic geometers on the internet just scares me away.
12:14:27 -!- Vorpal has quit (Ping timeout: 248 seconds).
12:43:31 -!- xkapastel has joined.
13:23:27  I could start talking about codata, but if I start it could just go on forever
13:24:30  I daresay I have distinct finitist and formalist leanings
13:42:29  [[Logical/Interpreter]]  https://esolangs.org/w/index.php?diff=65402&oldid=53265 * YamTokTpaFa * (+30) 
13:43:48  [[QuineLang]]  https://esolangs.org/w/index.php?diff=65403&oldid=59404 * YamTokTpaFa * (+23) 
14:16:21  [[Hello world program in esoteric languages]]  https://esolangs.org/w/index.php?diff=65404&oldid=64910 * A * (+60) /* Grin */
14:16:56  [[Hello world program in esoteric languages]]  https://esolangs.org/w/index.php?diff=65405&oldid=65404 * A * (+28) /* Gulp */
14:30:17 -!- unlimiter has joined.
14:38:50 -!- MDude has joined.
14:43:43 -!- unlimiter has quit (Quit: kthxbye).
14:57:19 -!- Sgeo_ has joined.
14:58:24 -!- cpressey has quit (Quit: A la prochaine.).
15:01:02 -!- Sgeo__ has quit (Ping timeout: 268 seconds).
15:07:23 -!- Sgeo__ has joined.
15:10:36 -!- Sgeo_ has quit (Ping timeout: 258 seconds).
15:19:13 -!- Sgeo has joined.
15:21:46 -!- Sgeo__ has quit (Ping timeout: 246 seconds).
15:23:13  [[Special:Log/newusers]] create  * ZSwifty *  New user account
15:23:22 -!- Sgeo_ has joined.
15:26:44 -!- Sgeo has quit (Ping timeout: 258 seconds).
15:55:54 -!- ais523 has joined.
15:56:11 -!- wob_jonas has quit (Remote host closed the connection).
15:56:21   Java's attempt to build an effect system around exceptions feels like an attempt to make it more like lexical scope. Thing is, Java programmers tell me they hate it and they just end up using unchecked exceptions instead. ← this problem arises in Java almost entirely as a result of checked exceptions that you know statically can never occur, but still exist in the signature
15:59:46  a simple example is «string.getBytes("UTF-8")» which according to the type system can throw a checked exception (because the type system can't see that "UTF-8" is a literal string and thus always names a valid character set), the checked exception would be necessary if the "UTF-8" were a string specified by the user
16:01:14  meanwhile, «string.getBytes(Charset.forName("UTF-8"))» doesn't throw checked exceptions (because for some reason, Charset#forName uses an unchecked exception if the charset name is unrecognised)
16:02:06  and «string.getBytes(StandardCharsets.UTF_8)» is a workaround for the whole mess that only became available fairly recently
16:02:28  I don't think any of this is an argument against checked exceptions, but I do think it's an argument for doing constant-folding before type-checking
16:03:24  fwiw, this issue isn't specific to checked exceptions, it happens with other forms of error handling too
16:03:47  e.g. in Rust you need to explicitly convert errors to panics with «unwrap» in cases where you know they can't possibly happen, and yet that removes some of the static safety guarantees of the language
16:04:34  after programming in Java seriously for months, I ended up in favour of checked exceptions (or at least, explicitly enumerated error cases) and against the way Java treates checked exceptions
16:05:50  that said, I see very little difference between Java and Rust error handling, the only difference is a minor syntactic one (Java propagates exceptions by default and requires try…catch to convert them to return values, Rust treats errors as return values by default and requires ? to propagate them, but in either case the only difference is the syntax at the call site)
16:05:51 -!- Sgeo__ has joined.
16:09:01 -!- Sgeo_ has quit (Ping timeout: 246 seconds).
16:12:33  `grwp squirrel
16:12:35  automatic squirrel feeder:Automatic squirrel feeders are just feeders in the category of automatic squirrels. Taneb invented them. \ bureaucracy:Bureaucracy (from French bureau, "burrow") is a political system in which squirrels rule the nation, and burrow their nuts. \ nutella:Nutella is a nutty substance. Taneb invented it for use in his automatic squirrel feeders. \ squirrel:A squirrel is a small nut-harvesting unit frequently deployed all over the worl
16:13:06  `? squirrel
16:13:07  A squirrel is a small nut-harvesting unit frequently deployed all over the world. They are popular due to their usefulness in distracting dogs.
16:13:24  `? automatic squirrel
16:13:25  automatic squirrel? ¯\(°​_o)/¯
16:15:14  Taneb: I didn't expect to get *two* T-ventions.
16:19:17  int-e: automatic squirrel feeders were the first I believe
16:19:21  I hadn't seen nutella before
16:22:41  Well, I've seen the spread, just not the wisdom entry
16:22:50  I'm not a huge fan
16:23:00  (of the spread, the wisdom entry's OK)
16:23:31 -!- ais523 has quit (Ping timeout: 248 seconds).
16:29:46  [[AutoColdKey]] N https://esolangs.org/w/index.php?oldid=65406 * A * (+210) Midnight creation
16:33:13  [[AutoColdKey]]  https://esolangs.org/w/index.php?diff=65407&oldid=65406 * A * (+123) Now it is a stub.
16:34:52 -!- Sgeo_ has joined.
16:35:45 -!- andrewtheircer has joined.
16:36:16  do
16:37:43 -!- Sgeo__ has quit (Ping timeout: 246 seconds).
16:43:16 -!- xkapastel has quit (Quit: Connection closed for inactivity).
16:44:06  oh
16:45:36 -!- xylochoron[m] has quit (Read error: Connection reset by peer).
16:45:40 -!- wmww has quit (Read error: Connection reset by peer).
16:45:47 -!- ivzem[m] has quit (Remote host closed the connection).
16:45:49 -!- tswett[m] has quit (Write error: Connection reset by peer).
16:47:53  smaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
16:53:55 -!- wmww has joined.
17:07:03  [[EPARM]]  https://esolangs.org/w/index.php?diff=65408&oldid=16949 * YamTokTpaFa * (+24) /* More ideas */ +CAT
17:11:20 -!- xkapastel has joined.
17:12:24 -!- Sgeo_ has quit (Read error: Connection reset by peer).
17:12:50 -!- Sgeo_ has joined.
17:16:13 -!- xylochoron[m] has joined.
17:16:13 -!- tswett[m] has joined.
17:16:22 -!- ivzem[m] has joined.
17:20:43  andrewtheircer: Look if you want to strike up a conversation here, you need to try a little harder. Drop an interesting idea (programming language or computation related preferrably), be articulate, and be prepared to wait minutes to hours for a reply (if any). What you're doing is making you come across stupid and obnoxious.
17:24:39 -!- b_jonas has joined.
17:26:38  `olist 1174
17:26:38  olist 1174: shachaf oerjan Sgeo FireFly boily nortti b_jonas
17:26:50  ok
17:28:22  i heard this idea from another person: an eso where you can change the speed delta but not overwrite it
17:28:32  you can't turn a right angle straight away
17:28:40  you need to tuuuurn slowly until you get to face right
17:29:03  the main storage of this eso *is* the speed delta (velocity)
17:29:14  it's a sort of tape
17:30:26  the initial tape is set to (0,0)(1,0)(0,0) where the first set of 0,0 is position and all the ones after (1,0) are speed delta deltas
17:31:36  there is an integer called the "meta-level" of the delta you are manipulating
17:31:44  the greek letter delta increases it, _ decreases it
17:32:24  to say again: this idea is not mine, it originated from reconcyl#4042 on the esolangs discord
17:33:23  still a p cool idea
17:38:19 -!- Phantom__Hoover has joined.
17:42:31 -!- andrewtheircer has quit (Remote host closed the connection).
17:44:59 -!- unlimiter has joined.
17:49:10 -!- unlimiter has quit (Client Quit).
18:24:29 -!- Sgeo__ has joined.
18:28:15 -!- unlimiter has joined.
18:28:15 -!- Sgeo_ has quit (Ping timeout: 264 seconds).
18:33:15 -!- unlimiter has quit (Quit: WeeChat 2.5).
18:40:51 -!- Sgeo_ has joined.
18:43:47 -!- Sgeo__ has quit (Ping timeout: 245 seconds).
19:26:26  `? morphology
19:26:27  Morphology is the theory that you can never have enough phở. boily invented it.
19:26:37  `? second wisdom
19:26:38  The second wisdom is that wisdom can never be complete or consistent.
19:31:51  `q corollary
19:31:52  57)  ehird: every set can be well-ordered. corollary: every set s has the same diagram used from famous program talisman with fnord windows to cascade, someone i would never capitalize " i"
19:52:19 -!- Phantom__Hoover has quit (Ping timeout: 246 seconds).
20:01:30 -!- Phantom__Hoover has joined.
20:12:43 -!- Lord_of_Life_ has joined.
20:15:21 -!- Lord_of_Life has quit (Ping timeout: 258 seconds).
20:15:36 -!- Lord_of_Life_ has changed nick to Lord_of_Life.
20:16:52  Glulx has a frame pointer, but it points to an address space that you cannot read from or write into.
20:53:15 -!- xkapastel has quit (Quit: Connection closed for inactivity).
20:58:22 -!- FreeFull has joined.
21:00:37 -!- MDead has joined.
21:01:13 -!- MDude has quit (Read error: Connection reset by peer).
21:01:18 -!- MDead has changed nick to MDude.
21:30:10 -!- ivzem[m] has quit (Quit: Idle kick: User has been idle for 23+ days.).
22:05:54 -!- Sgeo_ has quit (Read error: Connection reset by peer).
22:06:22 -!- Sgeo_ has joined.
22:28:40 -!- xkapastel has joined.
22:42:21 -!- Sgeo__ has joined.
22:46:00 -!- Sgeo_ has quit (Ping timeout: 258 seconds).
22:53:33 -!- Xunie has joined.
23:36:46  [[Keg]]  https://esolangs.org/w/index.php?diff=65409&oldid=65033 * JonoCode9374 * (+45) /* External Resources / Reference Implementation */
23:48:59 -!- unlimiter has joined.

2019-08-10:

00:16:21 -!- unlimiter has quit (Quit: WeeChat 2.5).
00:29:20 -!- b_jonas has quit (Quit: leaving).
00:30:11 -!- Phantom__Hoover has quit (Ping timeout: 244 seconds).
01:06:54 -!- unlimiter has joined.
01:08:17 -!- xkapastel has quit (Quit: Connection closed for inactivity).
01:21:31 -!- unlimiter has quit (Quit: WeeChat 2.5).
02:42:40  Fun fact: a bunch of speech-related programs use a timescale where the unit is 0.1 µs (or 100 ns, if you prefer), and I think that might be because it's the largest power of 10 in which both (1s / 8000) and (1s / 16000) are integers (1250 and 625, respectively), meaning at the common speech sampling rates of 8 kHz and 16 kHz sample offsets are integers as well.
03:02:32 -!- FreeFull has quit.
04:00:01 -!- Lord_of_Life has quit (Quit: Laa shay'a waqi'un moutlaq bale kouloun moumkine).
04:01:50 -!- Lord_of_Life has joined.
04:07:20 -!- Sgeo_ has joined.
04:10:28 -!- Sgeo__ has quit (Ping timeout: 245 seconds).
04:34:04  [[Special:Log/newusers]] create  * Calamari2 *  New user account
04:41:35  [[Esolang:Introduce yourself]]  https://esolangs.org/w/index.php?diff=65410&oldid=65331 * Calamari2 * (+220) Add greeting
04:42:36  [[Barely]] M https://esolangs.org/w/index.php?diff=65411&oldid=39230 * Calamari2 * (+12) Fix external links
04:43:09  [[Barely]] M https://esolangs.org/w/index.php?diff=65412&oldid=65411 * Calamari2 * (+0) Typo
04:43:50  [[MinISCule]] M https://esolangs.org/w/index.php?diff=65413&oldid=8428 * Calamari2 * (+12) Fix external links
04:45:09  [[Numberix]] M https://esolangs.org/w/index.php?diff=65414&oldid=43409 * Calamari2 * (+4) Fix external link
04:46:41  [[Hanoi Love]] M https://esolangs.org/w/index.php?diff=65415&oldid=43697 * Calamari2 * (+8) Fix external links
04:47:27  [[Spaghetti]] M https://esolangs.org/w/index.php?diff=65416&oldid=30465 * Calamari2 * (+4) Fix external link
04:47:59  [[Linguine]] M https://esolangs.org/w/index.php?diff=65417&oldid=43471 * Calamari2 * (+12) Fix external links
05:00:57  [[Esolang:Introduce yourself]] M https://esolangs.org/w/index.php?diff=65418&oldid=65410 * Calamari * (+188) 
05:01:52  [[EsoAPI]] M https://esolangs.org/w/index.php?diff=65419&oldid=43465 * Calamari * (+4) Fix external link
05:02:22  [[Bubble]] M https://esolangs.org/w/index.php?diff=65420&oldid=30445 * Calamari * (+4) Fix external link
05:14:31  [[User talk:Calamari]] M https://esolangs.org/w/index.php?diff=65421&oldid=64593 * Calamari * (+158) 
05:37:08  [[Jeffry Johnston]]  https://esolangs.org/w/index.php?diff=65422&oldid=30463 * A * (+22) /* See also */
05:37:20  [[Jeffry Johnston]]  https://esolangs.org/w/index.php?diff=65423&oldid=65422 * A * (+1) /* See also */
05:58:02 -!- MDude has quit (Quit: Going offline, see ya! (www.adiirc.com)).
06:46:22  [[User talk:Areallycoolusername]]  https://esolangs.org/w/index.php?diff=65424&oldid=64480 * JonoCode9374 * (+1497) /* String Compression  */ new section
06:46:59  [[User talk:Areallycoolusername]] M https://esolangs.org/w/index.php?diff=65425&oldid=65424 * JonoCode9374 * (-2) /* String Compression */
07:18:21 -!- Sgeo__ has joined.
07:21:39 -!- Sgeo_ has quit (Ping timeout: 248 seconds).
07:30:20 -!- Sgeo_ has joined.
07:33:22 -!- Sgeo__ has quit (Ping timeout: 246 seconds).
07:37:28 -!- rdococ has left ("Leaving").
08:05:54 -!- Sgeo__ has joined.
08:08:43 -!- Sgeo_ has quit (Ping timeout: 246 seconds).
08:09:29  [[@]]  https://esolangs.org/w/index.php?diff=65426&oldid=65117 * A * (+2526) /* Computational class */
08:14:59 -!- Lord_of_Life has quit (Ping timeout: 248 seconds).
08:18:16 -!- Lord_of_Life has joined.
08:58:26 -!- Sgeo_ has joined.
09:01:17 -!- Sgeo__ has quit (Ping timeout: 245 seconds).
09:01:39 -!- wob_jonas has joined.
09:22:10 -!- andrewtheircer has joined.
09:22:26  hi
09:38:47  [[User talk:Gamer]]  https://esolangs.org/w/index.php?diff=65427&oldid=65320 * Gamer * (+29) 
09:41:43  [[Keg]]  https://esolangs.org/w/index.php?diff=65428&oldid=65409 * A * (-6) /* Truth-machine */ Originally from EdgyNerd, then I golfed it.
09:47:59  [[User talk:Gamer]]  https://esolangs.org/w/index.php?diff=65429&oldid=65427 * Andrew3335 * (+511) 
09:48:30  [[User talk:Gamer]]  https://esolangs.org/w/index.php?diff=65430&oldid=65429 * Andrew3335 * (+6) 
10:45:04  [[TPLHBPTBOTEW]]  https://esolangs.org/w/index.php?diff=65431&oldid=59885 * Gamer * (-96) /* Commands */
10:54:32  [[TPLHBPTBOTEW]]  https://esolangs.org/w/index.php?diff=65432&oldid=65431 * Andrew3335 * (+582) 
10:59:21  [[TPLHBPTBOTEW]]  https://esolangs.org/w/index.php?diff=65433&oldid=65432 * Andrew3335 * (-6) 
11:20:43 -!- andrewtheircer has quit (Remote host closed the connection).
11:43:22 -!- Sgeo__ has joined.
11:47:01 -!- Sgeo_ has quit (Ping timeout: 244 seconds).
12:14:11  [[User talk:Areallycoolusername]] M https://esolangs.org/w/index.php?diff=65434&oldid=65425 * A * (+389) /* String Compression */
12:25:58 -!- APic has quit (Ping timeout: 246 seconds).
12:36:55 -!- APic has joined.
12:40:27  [[Bucket]] M https://esolangs.org/w/index.php?diff=65435&oldid=61797 * A * (-120) Make it look much less scary
12:48:23 -!- Sgeo_ has joined.
12:51:17 -!- Sgeo__ has quit (Ping timeout: 245 seconds).
13:03:18 -!- Phantom__Hoover has joined.
13:03:18 -!- Phantom__Hoover has quit (Read error: Connection reset by peer).
13:17:19  [[User talk:Areallycoolusername]] M https://esolangs.org/w/index.php?diff=65436&oldid=65434 * A * (+261) 
13:31:41  [[Bucket]] M https://esolangs.org/w/index.php?diff=65437&oldid=65435 * A * (+111) /* Implementation in C (provided output instructions just for debugging) */
13:31:56  [[Bucket]] M https://esolangs.org/w/index.php?diff=65438&oldid=65437 * A * (+0) /* Implementation in C (provided output instructions just for debugging) */
14:06:45 -!- FreeFull has joined.
14:53:40  [[User talk:JonoCode9374]]  https://esolangs.org/w/index.php?diff=65439&oldid=64213 * Areallycoolusername * (+229) 
15:04:16 -!- andrewtheircer has joined.
15:04:34  idea: eso supporting infinite computational power, code and input and output
15:06:39 -!- atslash has quit (Quit: Leaving).
15:55:37 -!- MDude has joined.
16:27:54 -!- wob_jonas has quit (Remote host closed the connection).
16:39:21  fun fact: september 13th, 2108 is the earliest date for any smartphone to reach one million hours
16:41:54 -!- AnotherTest has joined.
16:41:56 -!- andrewtheircer has quit (Remote host closed the connection).
16:50:38  `unicode 🤷‍♂️
16:50:39  U+1F937 SHRUG \ UTF-8: f0 9f a4 b7  UTF-16BE: d83edd37  Decimal: 🤷 \ 🤷 \ Category: So (Symbol, Other) \ Bidi: ON (Other Neutrals) \  \ U+200D ZERO WIDTH JOINER \ UTF-8: e2 80 8d  UTF-16BE: 200d  Decimal: ‍ \ ‍ \ Category: Cf (Other, Format) \ Bidi: BN (Boundary Neutral) \  \ U+2642 MALE SIGN \ UTF-8: e2 99 82  UTF-16BE: 2642  Decimal: ♂ \ ♂ \ Category: So (Symbol, Other) \ Bidi: ON (Other Neutrals) \  \ U+FE0F VARIATION SELECTOR-
17:02:52  Is there a NNTP server that allows downloading copies of very old Usenet articles if I know the message ID of the article I wish to download (even if no article number is stored for such messages)? I received a follow-up to a (allegedly) eighteen year old article. (There are actually at least six articles leading up to it, which I have the message IDs of.)
17:06:21  I don't know about a NNTP server, but Google Groups (or rather, its Usenet integration) used to have a way of doing that.
17:06:33  Unfortunately I can't seem to figure out how to do it any more.
17:08:02  Oh, if you know the group the message was in, you can search for that group first, and then when you have a group open the little down arrow from the search box opens an advanced search form with "Message ID" as one of the fields.
17:14:29 -!- xkapastel has joined.
17:27:37  Google Groups is not work on my computer (although I have once found one link that does work, except that it seem to try to hide email addresses), and I do not have or want a account there. Also, the newsgroup it belongs to is probably rec.arts.int-fiction (it is possible, although unlikely, that a follow-up message is posted to a different newsgroup than the original was).
17:28:08  (Also I want to download the message into my local bystand database)
17:56:23  (Also, I have seen URLs linking to stuff on Google Groups, and I think a problem with it is that the URL does not include the message ID. I have seen other web sites also with messages from Usenet, and they don't have the message ID in the URL either, unfortunately.)
18:38:35  The Google Groups URLs don't include message IDs, one likely reason being that it's organized in terms of "topics" (threads) first. But each message has a "show original" option, which shows almost the raw message, including the Message-ID header. The one difference is that email addresses have been redacted.
18:38:48 -!- clog has quit (Ping timeout: 244 seconds).
18:39:07  It's an unfortunately modern-style website, though, so it's no surprise it doesn't work well.
18:41:13  There are some messages from rec.args.int-fiction from 2001 in Google Groups, so it might have the message(s) you're interested in. I don't think there's necessarily a way to get the message data with email addresses intact.
19:01:30  Is there a header that can be added to tell Google (and other archiving services) not to mangle email addresses, in case the author of the message wants it to remain intact?
19:10:23  (One problem is that sometimes there is the possibility that many programs will believe something to be a email address even though actually it isn't.)
19:14:11  Also, is there a way to access the raw message directly by a URL containing the message ID (and anything else it contains remains constant)?
19:17:25 -!- ranzinida has joined.
19:22:33  I think unfortunately the answer is no to both.
19:46:37 -!- Lord_of_Life has quit (Ping timeout: 246 seconds).
19:49:36 -!- Lord_of_Life has joined.
19:54:27  I think I figured out. First, you prefix the message ID without < and > by "http://groups.google.com/groups?selm=", and then it redirects to a URL starting with "https://groups.google.com/forum/#!msg/". Replace that prefix with "https://groups.google.com/forum/message/raw?msg=" and then the message can be accessed.
20:00:14  Actually, I found that it is actually a double redirect.
20:06:43 -!- lldd_ has joined.
20:13:32 -!- Lord_of_Life_ has joined.
20:15:55 -!- Lord_of_Life has quit (Ping timeout: 258 seconds).
20:16:25 -!- Lord_of_Life_ has changed nick to Lord_of_Life.
20:17:03 -!- Phantom_Hoover has joined.
20:17:03 -!- Phantom_Hoover has quit (Changing host).
20:17:03 -!- Phantom_Hoover has joined.
20:26:28 -!- ranzinida has quit (Remote host closed the connection).
20:43:00  One possible work-around to the mangling the email addresses is to add a new header, which contains the information needed to demangle the message.
20:46:12 -!- clog has joined.
20:49:30  Perhaps, to add "Demangle-Head" and "Demangle-Body". For Demangle-Body, it consists of a sequence of tokens separated by white-space. For each at sign in the body of the message, take everything between it and the nearest white-space before it, and add that as a token into the header value.
20:52:12  For Demangle-Head, it is similar, but each token is preceded by a header name and then a colon; if there is a colon with no header name specified, then it is the same as the previously specified header name.
20:52:27 -!- heroux has quit (Ping timeout: 268 seconds).
20:53:47  In this way, if a message is downloaded from Google Groups or any service that performs similar mangling, the original text can be recovered.
21:14:13 -!- AnotherTest has quit (Ping timeout: 245 seconds).
21:19:17 -!- unlimiter has joined.
21:28:44 -!- lldd_ has quit (Quit: Leaving).
21:31:48  [[Bucket]]  https://esolangs.org/w/index.php?diff=65440&oldid=65438 * Salpynx * (+1) 'Derivative' was confusing/incorrect. ('Variant' meaning clarified by the code golf contest)
21:37:18 -!- unlimiter has quit (Quit: I LOVE CATS!!!).
21:56:16  Perhaps, a new THREAD command should be added into NNTP, which searches for follow-ups to the specified message ID, and outputs the list of message IDs.
22:29:59  How long ago is the Earth spinning at (close enough to) the current rate and the other related stuff that the calendar would be usable from? That is what I would have defined the year zero as.
22:58:36 -!- unlimiter has joined.
23:13:28 -!- unlimiter has quit (Quit: mildshjgdoshgomdshqgqdsfghp).
23:44:11 -!- xkapastel has quit (Quit: Connection closed for inactivity).
23:49:03 -!- joast has quit (Quit: Leaving.).
23:58:04  [[Keg]] M https://esolangs.org/w/index.php?diff=65441&oldid=65428 * JonoCode9374 * (+111) /* See also */

2019-08-11:

00:17:12 -!- oerjan has joined.
00:24:52   Girl Genius theory: the entire thing's going to be a shaggy dog story, with Agatha, Gil, and Tarvek being unable to claim their titles due to having died in Castle Heterodyne during the Si Vales Valeo procedure <-- only tarvek really needs to worry.  gil never actually died, and agatha's title is decided by the castle, which already knows and doesn't care.
00:25:55 * oerjan @tells in private, just in case
00:26:01  `dontaskdonttelllist
00:26:03  dontaskdonttelllist: q​u​i​n​t​o​p​i​a​ m​y​n​a​m​e​ i​n​t​-​e​
00:26:07  no Taneb there
00:27:30  also there's the future detective story where agatha definitely rules mechanicsburg.
01:15:26 -!- Phantom_Hoover has quit (Remote host closed the connection).
01:27:31  Is there something like OpenID but that does not require a web browser?
01:34:09  Now I am writing a document of a idea of it
01:48:32 -!- Sgeo_ has changed nick to Sgeo.
02:36:50 -!- mniip_ has joined.
02:41:07 -!- mniip has quit (Ping timeout: 620 seconds).
02:41:55  [[User talk:Calamari]]  https://esolangs.org/w/index.php?diff=65442&oldid=65421 * Areallycoolusername * (+362) Asking Calamari for MS DOS clarification
02:44:08 -!- mniip_ has changed nick to mniip.
03:13:31 -!- xylochoron[m] has quit (*.net *.split).
03:13:34 -!- ^[ has quit (*.net *.split).
03:13:35 -!- lynn has quit (*.net *.split).
03:13:44 -!- ^[ has joined.
03:13:46 -!- lynn has joined.
03:14:47 -!- xylochoron[m] has joined.
03:15:13 -!- j-bot has quit (Ping timeout: 265 seconds).
03:33:48  http://zzo38computer.org/textfile/miscellaneous/openid_no_html
03:44:39  [[User talk:Calamari]]  https://esolangs.org/w/index.php?diff=65443&oldid=65442 * Areallycoolusername * (+42) /* Issues With Page */
03:58:47  Oops! The rec.arts.int-fiction.mbox.zip file I found on archive.org does not quote lines beginning with "From " as it should.
04:07:06  At least it does not contain mangled email addresses, even though the data seems to come from Google.
04:22:03 -!- oerjan has quit (Quit: Nite).
04:31:39  Is it possible for a file in Linux to be both a dynamic library and also a stand-alone executable file, that it can fork/exec itself?
04:51:21 -!- adu has quit (Quit: adu).
05:25:22 -!- Sgeo_ has joined.
05:29:13 -!- Sgeo has quit (Ping timeout: 268 seconds).
06:28:26 -!- xkapastel has joined.
06:45:57 -!- heroux has joined.
06:50:34 -!- heroux has quit (Ping timeout: 246 seconds).
06:52:16  [[User:Gamer]] M https://esolangs.org/w/index.php?diff=65444&oldid=63564 * Gamer * (+2) /* Madbrain (Python 3) */
06:52:55  [[User:Gamer]] M https://esolangs.org/w/index.php?diff=65445&oldid=65444 * Gamer * (+1) /* Madbrain (Python 3) */
06:53:20  [[User:Gamer]]  https://esolangs.org/w/index.php?diff=65446&oldid=65445 * Gamer * (-8) /* Madbrain (Python 3) */
06:54:10  [[User:Gamer]]  https://esolangs.org/w/index.php?diff=65447&oldid=65446 * Gamer * (+6) /* Madbrain (Python 3) */
06:54:34  [[User:Gamer]] M https://esolangs.org/w/index.php?diff=65448&oldid=65447 * Gamer * (-1) /* Madbrain (Python 3) */
06:56:26  Now I wrote a program that provides a NNTP interface for downloading a single message from Google Groups if you know its message ID (the only supported command is ARTICLE with a message ID; you can't select newsgroups or do anything else), which can be used as a protocol extension for bystand. (Bystand has the ability to do NNTP communication with local programs.)
07:01:49  zzo38, write a program to convince Google to uncensor alt.hypertext so I can see Tim Berner-Lee's announcement
07:02:24  https://groups.google.com/forum/#!msg/alt.hypertext/eCTkkOoWTAY/urNMgHnS2gYJ
07:02:29  Unreachable :(
07:03:13  https://www.w3.org/People/Berners-Lee/1991/08/art-6484.txt
07:08:00  Apparently literally anyone can edit MDN https://developer.mozilla.org/en-US/docs/Web/HTTP/Basics_of_HTTP/Evolution_of_HTTP$compare?locale=en-US&to=1569093&from=1551070
07:12:04  I don't know how to convince Google to uncensor alt.hypertext, although if the message is readable anyways by the second URL, then you can read it anyways I think, isn't it?
07:13:55  I only found that second URL now, after I complained about Google's censorship
07:14:29  Or well, their destruction of valuable history
07:16:21  See if the Usenet archives on archive.org include the messages you want, maybe
07:17:02  (But know that some lines are not quoted properly in the mbox file.)
07:19:58  If you want, set up your own NNTP server with a copy of all messages you want to save.
07:21:04  NeXT - how cute
07:23:06  How did it go, "The price makes it a personal computer, the performance makes it a workstation, and the unit sales make it a mainframe."
07:25:46  I don't really know what went wrong though. Not enough software?
07:41:05 -!- AnotherTest has joined.
07:42:28  int-e, what is that about, a specific computer?
07:42:35  Oh I didn't see your first line
07:46:38  Sgeo_: That happens to me all the time. (missing context)
07:47:10  Wow, go really hates unused things.
07:48:30  I get the point but this is really annoying in explorative code.
07:51:47 -!- heroux has joined.
08:16:40 -!- Lord_of_Life has quit (Ping timeout: 272 seconds).
08:17:27 -!- Lord_of_Life has joined.
08:32:17 -!- andrewtheircer has joined.
08:32:21  hi
08:34:55 -!- Sgeo_ has quit (Read error: Connection reset by peer).
08:35:23 -!- Sgeo_ has joined.
08:49:56 -!- andrewtheircer has quit (Remote host closed the connection).
08:51:25 -!- Sgeo_ has quit (Read error: Connection reset by peer).
08:51:50 -!- Sgeo_ has joined.
09:05:41  shachaf: do you think http://paste.debian.net/1095332/ is a sane thing to do?
09:06:26  (btw I'm not sure why they had to abandon the "while" keyword)
09:12:32  To what end?
09:12:56  merging generators of course.
09:15:59  Oh, you're asking whether the implementation is reasonable given the task (spawn a thread that reads from two channels and merges the values into an output channel).
09:17:22  Partly. Partly I'm wondering whether using channels as lazy lists is sane.
09:18:07  (I actually believe it may be sane in terms of incurred overhead, if I also use the buffering feature.)
09:18:33  I think that depends on your use of lazy lists.
09:19:06  Turning [1..n] into a channel to do an iterator thing is surely not reasonable.
09:19:58  Probably some uses could be OK? But they're not really the same thing.
09:26:05  I'm toying with smooth numbers again... so a) they're not all that predictable and b) laziness comes up because I don't really know how far I will need them.
09:27:01  So in a way I'm pondering a trade-off between boilerplate for explicit chunking and convenience.
09:28:00  I feel like introducing preemptive threads to emulate laziness is not a net gain.
09:28:27  But possibly it works for your case.
09:28:34  Since when are you using Go?
09:29:12  Since today? I'm not sure "using" is the right word.
09:33:44  interface{} ... hey, does that mean that they're fully embracing duck-typing?
09:34:29  type Duck interface{ quack() }
09:36:25  Did you know Go does type-checking at runtime to generate vtables?
09:36:34  It does string comparison of interface method names and so on.
09:39:36  Ugh, wonderful.
09:47:02 -!- xkapastel has quit (Quit: Connection closed for inactivity).
09:57:47  Also I'm barely keeping my eyes open so I'll go to sleep.
10:33:22 -!- Sgeo__ has joined.
10:36:56 -!- Sgeo_ has quit (Ping timeout: 268 seconds).
11:27:51 -!- Sgeo_ has joined.
11:31:25 -!- Sgeo__ has quit (Ping timeout: 276 seconds).
12:09:24 -!- Sgeo__ has joined.
12:13:01 -!- Sgeo_ has quit (Ping timeout: 276 seconds).
13:06:33  Oh... let's define an interface... hmmm, interfaces need names... I know! Let's call the interface "Interface"! https://golang.org/pkg/sort/#Interface
13:51:19 -!- Sgeo_ has joined.
13:54:13 -!- Sgeo__ has quit (Ping timeout: 245 seconds).
14:23:33  6 hours later it dawns upon me that Go doesn't have generics... which is... fascinating.
14:25:11  The solution seems to be a) interfaces; b) a perversion of the DRY principle (to wit: "DO repeat yourself") and c) reflection. The `sort` package features all of these.
14:28:03  (sort.Float64s, sort.Ints, sort.Strings are repetitions of boilerplate code; Slice() takes an argument of type  interface{}  which is akin to `void *`, and does some reflection under the hood. And there's the aforementioned "Interface" interface that is used to drive the internal sort methods.)
14:38:40 -!- diverger has joined.
14:59:10 -!- Sgeo_ has quit (Ping timeout: 244 seconds).
15:08:47 -!- Sgeo has joined.
15:10:11  To be fair, for anything outside the sort package the name of the "Interface" interface is "sort.Interface", which isn't *that* silly.
15:10:19  The lack of generics is probably the most talked-about thing of the language.
15:11:11  There's a draft design for Go 2.0 generics, which is not yet a proposal, but a "starting point for discussion".
15:11:11  I now have four code snippets that sort a slice of ints and I like none of them: sort.Ints(ps), sort.IntSlice(ps).Sort(), sort.Sort(sort.IntSlice(ps)), sort.Slice(ps, func (i, j int) bool { return ps[i] < ps[j] })
15:11:43  The "Summary of Go Generics Discussions" document is 22 pages.
15:11:44  Mainly because I don't see *why* I have to tell anybody that it's a slice of ints at that point.
15:12:19  and the sort.Slice() variant is a bit too verbose.
15:14:21  https://go.googlesource.com/proposal/+/master/design/go2draft-generics-overview.md  https://go.googlesource.com/proposal/+/master/design/go2draft-contracts.md
15:14:23  (And the sort.Slice() variant is also not overly type-safe, I can pass anything for 'ps' and get a runtime error if it's not a slice. This is alleviated by the fact that ps is repeated in the comparison function. On the downside, ps is repeated in the comparison function.)
15:16:57  I don't like any of those either, but I think I've used sort.Sort(sort.IntSlice(ps)) generally.
15:17:31 -!- Sgeo has quit (Ping timeout: 268 seconds).
15:19:42  I'm happy that  func SortSlice(data []T, less func(x, y T) bool)  is one of the motivating examples in the first document :)
15:20:44  I think I picked sort.Sort(sort.IntSlice(ps)) so that it'd look consistent with a sort.Sort(foo.OtherKindOfSlice(qs)) call nearby.
15:21:08  (I guess I could've added a Sort() convenience method in OtherKindOfSlice too.)
15:21:45 -!- Sgeo has joined.
15:22:45 -!- Sgeo has quit (Read error: Connection reset by peer).
15:23:02 -!- Sgeo has joined.
15:24:15  Why is it that C provides sort() and bsearch() but no merging function.
15:25:15  (Which I guess is why Go does the same.)
16:17:11 -!- unlimiter has joined.
16:27:28 -!- unlimiter has quit (Quit: flushed).
16:30:41  OUCH. primes := []int{2, 3, 5, 7, 9, 2147483647}
16:33:24  (from the go language specification)
16:33:45  [[PAX16 CPU]] N https://esolangs.org/w/index.php?oldid=65449 * Areallycoolusername * (+888) Created page with "The '''PAX16''' computer, is a computer that runs using the PAX processor, made by  [[User: Areallycoolusername|Areallycoolusername]]. The PAX processor uses an esolang called..."
16:33:58  [[PAX16 CPU]]  https://esolangs.org/w/index.php?diff=65450&oldid=65449 * Areallycoolusername * (-2) /* Specifics */
17:06:45 -!- xkapastel has joined.
17:09:58  [[Deadfish]]  https://esolangs.org/w/index.php?diff=65451&oldid=64612 * Areallycoolusername * (+381) 
17:12:40  [[Deadfish]]  https://esolangs.org/w/index.php?diff=65452&oldid=65451 * Areallycoolusername * (+0) /* Html/Javascript Simplified */
17:18:01  `factor 2147483647
17:18:04  2147483647: 2147483647
17:18:06  Checks out.
17:18:20  Heh, I completely skipped over the 9.
17:19:17  I didn't know Karsten Koch's Blue Valley was a module
17:23:52  fizzie: yeah I do recognize that particular Mersenne prime :)
18:10:31 -!- Phantom_Hoover has joined.
18:16:34 -!- unlimiter has joined.
18:21:56  Do you like my idea of monads in JavaScript? I have just made one mistake, which is, that if you write "return" without writing "return yield" then it is necessary to define the value of the return, such as by writing:  listMonad.return=x=>[x];  If you write "return yield" then it does not need that. (If you want it to use the .return function anyways, then you can add parentheses.)
18:26:29  I don't like it
18:26:47  instead of monads how about delimited continuations
18:27:20  then we don't need to write in do notation
18:43:16  Yes, you could use delimited continuations
18:50:10  Although, one of the points of the idea I wrote is that you can capture a state that you can then rewind later.
18:51:13  (This is not shown in the example I provided)
19:32:55 -!- grumble has quit (Quit: inside we both know what's been going on, we know the game and we're gonna play it).
19:40:00 -!- grumble has joined.
19:50:01 -!- AnotherTest has quit (Ping timeout: 246 seconds).
19:57:39  Also, do you know if there is a MIME type for bbcode?
19:59:32  (It would be helpful if you want to integrate NNTP with some web forum software. I have also seen suggested to use Markdown; this has some advantages, such as easier to read as plain text if you do not have a Markdown renderer, and also there is a MIME type for Markdown defined; however, a lot of web forum software is not using Markdown.)
20:12:26 -!- unlimiter has quit (Quit: took a pill).
20:14:11 -!- Lord_of_Life_ has joined.
20:17:39 -!- Lord_of_Life has quit (Ping timeout: 248 seconds).
20:17:42 -!- Lord_of_Life_ has changed nick to Lord_of_Life.
20:20:03 -!- b_jonas has joined.
20:42:09 -!- xkapastel has quit (Quit: Connection closed for inactivity).
20:51:15  Hmm, more small things... go has no min() and max() functions for integers either.
20:59:38  Yes. Maybe another odd omission somehow copied over from C? 
21:04:02 -!- AnotherTest has joined.
21:17:55 -!- AnotherTest has quit (Ping timeout: 248 seconds).
21:31:48 -!- xkapastel has joined.
21:41:17 -!- atslash has joined.
21:45:15 -!- AnotherTest has joined.
21:52:10 -!- AnotherTest has quit (Ping timeout: 276 seconds).
23:00:11 -!- Phantom_Hoover has quit (Remote host closed the connection).
23:22:15 -!- b_jonas has quit (Remote host closed the connection).

2019-08-12:

00:19:05 -!- FreeFull has quit.
01:43:55 -!- xkapastel has quit (Quit: Connection closed for inactivity).
02:35:02 -!- tromp_ has joined.
02:36:31 -!- tromp has quit (Ping timeout: 252 seconds).
03:00:00 -!- Taneb has quit (Quit: I seem to have stopped.).
03:01:38 -!- Taneb has joined.
04:14:14  My opinion is that unusenet: URIs should be used to reference a article on Usenet and Unusenet. But, as far as I know, no software implements it.
04:45:58  I think that Funge-98 should include the specification for in case you do not have a unique identification for your implementation, to define a handprint value specific for that use (perhaps zero).
04:46:34  I never heard of Unusenet before
04:49:23  Sgeo: It is not well known, but, I invented Unusenet. It is a format for newsgroup hierarchy names which are not part of Usenet, and the specification also mentions a few other things (although the stuff other than the newsgroup hierarchy names is a optional specification).
04:49:53  Any newsgroup name that begins with the two letters "un" followed by one or more digits and then a dot, is Unusenet.
05:09:53  I also starting to write a document for using Glk with Befunge 98.
06:56:21  . o O ( I can't type "buf". It almost always comes out as "bug" at first. )
07:00:05  [[FAKE]] N https://esolangs.org/w/index.php?oldid=65453 * Argv0 * (+3048) Creation of the page
07:03:02  [[Language list]] M https://esolangs.org/w/index.php?diff=65454&oldid=65382 * Argv0 * (+11) Added FAKE
07:13:12  [[Keg]]  https://esolangs.org/w/index.php?diff=65455&oldid=65441 * JonoCode9374 * (+748) /* Command Glossary */
07:34:13  (If you wish to add a NNTP which isn't Usenet, please use Unusenet to assign the newsgroup name rather than assigning it arbitrarily, if possible.)
07:36:50 -!- AnotherTest has joined.
07:37:32  int-e: If only all my bugs were so kind as to identify themselves like that.
07:38:14  zzo38: What if it's a number of digits larger than the number of atoms in the universe?
07:41:06  shachaf: Btw, I like some aspects of Go. The slices are pretty neat. And I may also somewhat like the receiver style OO.
07:43:39  I miss generics and overloaded operators (bignum code looks so ugly...)
07:50:50 -!- Sgeo_ has joined.
07:53:47 -!- Sgeo has quit (Ping timeout: 245 seconds).
08:03:18  I think there are lots of nice things about Go.
08:03:56  I wonder whether to prefer "x.f(y)" over "f(x, y)"
08:04:17  I think the main benefit is that f goes in a special namespace rather than the global one.
08:04:34  Even if you have function overloading those are pretty different.
08:16:49 -!- Lord_of_Life has quit (Ping timeout: 276 seconds).
08:20:04 -!- Lord_of_Life has joined.
08:36:18 -!- AnotherTest_ has joined.
08:36:36 -!- AnotherTest has quit (Ping timeout: 268 seconds).
08:36:36 -!- AnotherTest_ has changed nick to AnotherTest.
08:42:39 -!- AnotherTest has quit (*.net *.split).
08:46:07 -!- AnotherTest has joined.
08:46:27 -!- Sgeo_ has quit (Ping timeout: 248 seconds).
08:50:43 -!- AnotherTest has quit (Ping timeout: 248 seconds).
08:51:49 -!- AnotherTest has joined.
08:56:17 -!- AnotherTest has quit (Ping timeout: 245 seconds).
08:57:35 -!- AnotherTest has joined.
09:01:42 -!- AnotherTest has quit (Ping timeout: 245 seconds).
09:05:51 -!- AnotherTest has joined.
09:16:39  Oh well. My smooth number approximator in Go works.
09:34:09  shachaf: in the end I did not use the goroutines-as-generators idea, the overhead was way too big for what I intended to do
09:34:09 -!- AnotherTest has quit (Ping timeout: 252 seconds).
09:35:58  I thought you said something about not caring about overhead.
09:36:27  well millions of goroutines with 2k stack space each...
09:36:34  ...I ran out of memory
09:36:52  And I tend to care about that.
09:38:58  shachaf: http://paste.debian.net/1095429/ if you're curious (no particular reason why you should be)
09:42:50 -!- wob_jonas has joined.
09:44:49 -!- AnotherTest has joined.
09:45:45  It's about as fast as my Haskell code but it uses far less memory (the comparison is unfair though; the Haskell code does a lot of implicit bookkeeping for producing a lazy list of smooth numbers in increasing order, whereas the Go code embraces mutability instead for a similar effect.)
09:47:25  int-e: yeah, I know, I still have to do a better search
09:47:28  wob_jonas: For fun, 11111111111111111051649690525458095629710973775872 is a decent 103-smooth lower approximation of 10^50/9.
09:47:46  [ try 11111111111111111051649690525458095629710973775872x
09:47:55  oh, a _lower_ approximation
09:47:56  nice
09:48:19  int-e: also, I'll probably spread this task in forums other than #esoteric, because it's a nice one
09:48:25  s/task/challenge
09:50:12  The scientist from https://www.xkcd.com/585/ return, in https://www.questionablecontent.net/view.php?comic=4066 of all places
09:50:16  s/ist/ists/
09:50:38  Anyway this made a surprisingly nice target for learning some Go basics.
09:53:48  int-e: are you writing the search program such that it is parallel over multiple cpu cores, or will be in a future version?
09:55:01  nah
09:55:39 -!- AnotherTest has quit (Quit: ZNC - http://znc.in).
09:55:40  it doesn't need to be multi-threaded for that, you can split the search space and run multiple processes, possibly mmapping a common read-only table
09:55:50 -!- AnotherTest has joined.
09:56:17  There already is a top-level loop that re-runs the same kind of search with slightly different parameters.
09:57:18  int-e: right, but in parallel or only in sequence?
09:57:26  if it's in parallel, then I assume it uses multiple cpu cores
09:57:35  In sequence, and I'm not inclined to change that.
09:57:41  (unless you're like running it on a GPU or multiple hosts or something)
09:57:47  ok
09:58:07  I'll probably run multiple in parallel, because the algorithm I'm using is eash to modify to do that
09:58:11  Even though it would be ridiculously easy, at least locally (just spawn a "goroutine" for each task).
09:59:20  The program is chugging away at 140% CPU usage actually. (Parallel GC, I guess.)
10:00:03 -!- AnotherTest has quit (Ping timeout: 245 seconds).
10:00:17  ah, you're garbage-collecting? ok
10:00:22  Go is. But honestly I don't expect to see any improvement.
10:00:35  oh right, it doesn't know that it doesn't need to gc
10:00:42  or something
10:01:28  (In the 80 minutes that this program is running, it has found 11111111111111111051649690525458095629710973775872 36 times and 11111111111111111215673466122483207680856045806875 4 times. The Haskell version has found 11111111111111111215673466122483207680856045806875 about 80 times.)
10:01:53  (Using way more CPU time, I think I was up to 19 hours.)
10:02:26  wob_jonas: It does need GC actually... plenty of fresh big nums are produced and most of them are discarded
10:03:56  ok
10:05:17 -!- AnotherTest has joined.
10:05:54  (finding the same result over and over indicates that the approach is hitting its limit. So /probably/ we either have an optimum or the optimum is hard to find (there are such hard-to-find smooth numbers, but explaining what they are would give away my approach))
10:08:29  int-e: my current approach searches such solutions that don't have many large prime factors, and it can actually exhaust those and finds every solution exactly once. but what "not too many large prime factors" means depends on how fast I'll make the program, so I can cover a larger space if I make the program faster
10:11:47 -!- AnotherTest has quit (Ping timeout: 248 seconds).
10:11:51  I've been considering other ways to search, but I haven't considered any that finds the same solution multiple times, except from where I restart the program with different parameters
10:12:23 -!- AnotherTest has joined.
10:13:47  I did consider searches that miss some unlucky solutions though
10:14:03  unlucky in ways other than having more than a few large prime factors
10:25:54  Hmm let's give 10^200/9 a try. How bad could it be?
10:27:30  u
10:28:26  (I just want to see whether this also finds the same solutions over and over again.)
11:16:44 -!- AnotherTest has quit (Ping timeout: 272 seconds).
11:37:38 -!- AnotherTest has joined.
11:42:52 -!- AnotherTest has quit (Ping timeout: 276 seconds).
11:54:20 -!- AnotherTest has joined.
11:58:52 -!- AnotherTest has quit (Ping timeout: 268 seconds).
12:01:45  [[Letters++]] N https://esolangs.org/w/index.php?oldid=65456 * Saka * (+2675) Created page with "'''NOTE: WORK IN PROGRESS PAGE. WILL IMPROVE AS TIME GOES ON... hopefully...'''
'''Letters++''' is an esolang created by [[User:Saka]], that is made of, as the name sugges..." 12:09:49 -!- AnotherTest has joined. 12:10:47 [[Letters++]] https://esolangs.org/w/index.php?diff=65457&oldid=65456 * Saka * (+69) 12:13:41 -!- glowcoil has quit (Remote host closed the connection). 12:14:02 -!- glowcoil has joined. 12:14:18 -!- AnotherTest has quit (Ping timeout: 244 seconds). 12:14:29 -!- AnotherTest has joined. 12:20:27 wob_jonas: http://paste.debian.net/1095448/ is where the program is after 2 hours, and it has not repeated itself (much) yet. 12:21:08 (for 10^200/9) 12:27:39 -!- AnotherTest has quit (Ping timeout: 264 seconds). 12:28:09 * int-e should probably stop bragging about this. 12:28:45 int-e: why does that paste have a row of ones? 12:29:23 -!- AnotherTest has joined. 12:29:25 wob_jonas: because that's how I compare to the target number 12:29:30 put it in the middle :) 12:29:36 ah 12:30:02 I instead print their difference in exponential format 12:31:30 like "bestprod=11111111111111158344848599503479968356777700860000, diff=4.723E+34," and there's more after that line that tell about where it is in the search space 12:39:40 [[User:Dtuser1337]] N https://esolangs.org/w/index.php?oldid=65458 * Dtuser1337 * (+11) oof 13:13:51 -!- AnotherTest has quit (Ping timeout: 264 seconds). 13:26:15 I should make the next version print the full factorization 13:47:09 -!- AnotherTest has joined. 13:53:09 -!- AnotherTest has quit (Ping timeout: 250 seconds). 13:55:39 -!- joast has joined. 14:02:15 -!- AnotherTest has joined. 14:12:19 -!- AnotherTest has quit (Ping timeout: 248 seconds). 14:14:39 -!- AnotherTest has joined. 14:22:51 -!- AnotherTest has quit (Ping timeout: 264 seconds). 14:26:25 -!- xkapastel has joined. 14:27:48 -!- AnotherTest has joined. 14:28:34 Forced Fruition is from the Lorwyn set? that makes so much sense actually. I thought it was an older card than that, but it really suits Lorwyn's mood 14:32:15 -!- AnotherTest has quit (Ping timeout: 244 seconds). 14:32:49 -!- AnotherTest has joined. 14:42:34 -!- AnotherTest has quit (Ping timeout: 272 seconds). 14:43:00 [[Powder]] https://esolangs.org/w/index.php?diff=65459&oldid=60758 * Areallycoolusername * (+97) /* Documentation */ 14:43:15 -!- AnotherTest has joined. 14:44:02 [[Powder]] https://esolangs.org/w/index.php?diff=65460&oldid=65459 * Areallycoolusername * (+21) Typo 14:44:55 [[Powder]] https://esolangs.org/w/index.php?diff=65461&oldid=65460 * Areallycoolusername * (-34) /* Documentation */ 14:47:39 -!- AnotherTest has quit (Ping timeout: 252 seconds). 14:49:17 -!- AnotherTest has joined. 14:54:44 [[User talk:A]] https://esolangs.org/w/index.php?diff=65462&oldid=65390 * Areallycoolusername * (+701) Re: A language defined by its implementation 14:55:26 [[User talk:A]] https://esolangs.org/w/index.php?diff=65463&oldid=65462 * Areallycoolusername * (+22) /* Re: Your Comment On My Github Pull Request */ 14:58:39 -!- ARCUN has joined. 14:59:27 -!- AnotherTest has quit (Ping timeout: 264 seconds). 14:59:31 Is Objective-C really worthwhile to learn? I've noticed that it's just C, with some salt 15:00:15 Im not trying to go into IOS development, I just wanted to learn a new language 15:00:50 -!- AnotherTest has joined. 15:02:55 -!- ARCUN has quit (Remote host closed the connection). 15:03:41 -!- ARCUN has joined. 15:11:30 I've realized that almost all programs in c, if the headingovernment is replaced with "#import ", it will most likely result in the same function. 15:12:04 What exactly was Apple thinking when they made a C copy? 15:12:40 Heading* 15:13:29 -!- ARCUN has quit (Remote host closed the connection). 15:23:57 -!- AnotherTest has quit (Ping timeout: 252 seconds). 15:27:13 -!- AnotherTest has joined. 15:31:00 -!- AnotherTest_ has joined. 15:31:11 -!- AnotherTest has quit (Client Quit). 15:31:12 -!- AnotherTest_ has changed nick to AnotherTest. 15:35:27 -!- AnotherTest has quit (Ping timeout: 245 seconds). 15:36:53 -!- wob_jonas has quit (Remote host closed the connection). 15:38:08 -!- AnotherTest has joined. 15:39:24 They were probably thinking "I don't really want to write Java or C++" 15:42:25 learn rust 15:42:44 rust is a bad language 15:42:46 dont use it 15:42:52 how so 15:44:44 rust prevents you from shooting yourself in the foot. i like that in a language. 15:46:01 also, it is an awesome low-level language to write in. we wrote a small OS in university and had a way more comfortable environment than the C people 15:49:10 like, you just redefine panic! and get runtime errors shown with filename and line number. that would be impossible to do in C if you use any third party library 15:49:21 including stdlib 15:51:09 also, writing ones own free is so nice since you don't need anybookkeeping for how many memory you need to free at a given location 15:58:59 -!- AnotherTest has quit (Ping timeout: 248 seconds). 15:59:23 -!- Sgeo has joined. 16:09:55 -!- Sgeo_ has joined. 16:10:14 shachaf: The number of digits after "un" in Unusenet won't be larger than the number of atoms in the universe, because, the number indicated after the letters "un" is either zero or the number of components in a domain name. 16:13:16 -!- Sgeo has quit (Ping timeout: 246 seconds). 16:13:17 -!- AnotherTest has joined. 16:22:32 -!- AnotherTest has quit (Ping timeout: 245 seconds). 16:24:18 -!- AnotherTest has joined. 16:32:38 -!- AnotherTest has quit (Ping timeout: 244 seconds). 16:40:48 -!- b_jonas has joined. 16:51:23 -!- AnotherTest has joined. 17:19:13 [[Brainfuck]] https://esolangs.org/w/index.php?diff=65464&oldid=63754 * Gamer * (-39) 17:20:59 -!- Sgeo__ has joined. 17:24:33 -!- Sgeo_ has quit (Ping timeout: 258 seconds). 17:31:19 [[Compressed Malbolge]] N https://esolangs.org/w/index.php?oldid=65465 * Palaiologos * (+600) Created page with "Compressed Malbolge, made by [[User:Palaiologos]] in 2019, is a compressed variant for [[malbolge unshackled]], designed to fit my large blobs inside [https://codegolf.stackex..." 17:31:47 [[Compressed Malbolge]] https://esolangs.org/w/index.php?diff=65466&oldid=65465 * Palaiologos * (+0) 17:41:01 [[Language list]] https://esolangs.org/w/index.php?diff=65467&oldid=65454 * Palaiologos * (+26) Add Compressed Malbolge 17:44:30 . o O ( 648000 parsec = 0 km? ) 17:50:37 What did they mean by "Apple made a C copy"? Swift? Because if this is about Objective C, Apple didn't create the language... they endorsed it (probably the NeXT folks had some influence). 17:52:50 -!- FreeFull has joined. 17:56:26 also a lot of objc’s weirdness is because it was designed as a *strict* superset of C 18:55:07 -!- zzo38 has quit (Ping timeout: 268 seconds). 19:08:26 -!- Sgeo__ has quit (Read error: Connection reset by peer). 19:08:52 -!- Sgeo__ has joined. 19:18:40 `? moo 19:18:41 Moo is the sound made by a cow as it freezes. 19:39:42 [[User talk:A]] https://esolangs.org/w/index.php?diff=65468&oldid=65463 * Areallycoolusername * (+0) /* Re: Your Comment On My Github Pull Request */ 19:45:17 [[User talk:JonoCode9374]] https://esolangs.org/w/index.php?diff=65469&oldid=65439 * Areallycoolusername * (+198) 20:00:31 -!- Phantom_Hoover has joined. 20:11:59 -!- andrewtheircer has joined. 20:12:03 hi 20:12:41 -!- lldd_ has joined. 20:13:14 hi to you 20:15:23 -!- Lord_of_Life_ has joined. 20:18:25 -!- Lord_of_Life has quit (Ping timeout: 244 seconds). 20:18:39 -!- Lord_of_Life_ has changed nick to Lord_of_Life. 20:19:00 hello lord 20:29:38 -!- AnotherTest has quit (Ping timeout: 272 seconds). 20:45:43 -!- andrewtheircer has quit (Remote host closed the connection). 20:47:52 `? zzo38mtg 20:47:53 http://zzo38computer.org/textfile/miscellaneous/magic_card/cards.txt 20:47:59 `? zzo38card 20:48:00 zzo38cards are at http://zzo38computer.org/textfile/miscellaneous/magic_card/cards.txt 20:48:04 those seem redundant 20:48:12 `forget zzo38mtg 20:48:15 Forget what? 20:49:10 -!- lldd_ has quit (Quit: Leaving). 20:51:59 `forget horn 20:52:00 Forget what? 21:25:56 -!- Sgeo_ has joined. 21:29:48 -!- Sgeo__ has quit (Ping timeout: 272 seconds). 21:33:12 [[User talk:JonoCode9374]] https://esolangs.org/w/index.php?diff=65470&oldid=65469 * JonoCode9374 * (+212) 22:21:25 -!- Sgeo__ has joined. 22:24:29 -!- Sgeo_ has quit (Ping timeout: 244 seconds). 22:43:12 -!- b_jonas has quit (Quit: leaving). 22:48:53 -!- Phantom_Hoover has quit (Quit: Leaving). 23:36:10 -!- xkapastel has quit (Quit: Connection closed for inactivity). 23:37:08 -!- xkapastel has joined. 2019-08-13: 01:28:22 -!- joast has quit (Ping timeout: 245 seconds). 02:18:08 -!- adu has joined. 03:06:10 -!- xkapastel has quit (Quit: Connection closed for inactivity). 04:09:21 -!- Sgeo_ has joined. 04:13:12 -!- Sgeo__ has quit (Ping timeout: 268 seconds). 04:43:55 -!- Sgeo__ has joined. 04:46:49 -!- Sgeo_ has quit (Ping timeout: 246 seconds). 04:50:28 -!- FreeFull has quit. 05:03:31 [[Keg]] https://esolangs.org/w/index.php?diff=65471&oldid=65455 * A * (+36) /* Extended command glossary */ Invented shorter name 05:35:57 -!- GeekDude has quit (Ping timeout: 258 seconds). 05:46:25 -!- GeekDude has joined. 06:06:03 -!- moei has joined. 08:18:48 -!- Lord_of_Life has quit (Ping timeout: 245 seconds). 08:20:16 -!- Lord_of_Life has joined. 08:32:25 -!- john_metcalf has joined. 09:43:56 -!- AnotherTest has joined. 11:38:04 -!- AnotherTest has quit (Ping timeout: 246 seconds). 13:29:36 -!- atriq has joined. 13:30:34 -!- Taneb has quit (Read error: Connection reset by peer). 13:35:04 -!- atriq has changed nick to Taneb. 13:39:58 -!- joast has joined. 13:44:45 [[Hello++++]] https://esolangs.org/w/index.php?diff=65472&oldid=56982 * Gamer * (+32) 13:45:04 [[Hello++++]] M https://esolangs.org/w/index.php?diff=65473&oldid=65472 * Gamer * (+2) /* Interpreters */ 14:18:56 -!- Sgeo__ has quit (Read error: Connection reset by peer). 14:19:24 -!- Sgeo__ has joined. 14:33:50 -!- xkapastel has joined. 14:54:22 -!- Sgeo_ has joined. 14:54:53 -!- cpressey has joined. 14:55:36 Good afternoon. 14:55:51 I've made another esolang. 14:55:52 Hello, cpressey 14:55:57 What is your new esolang. 14:56:01 *? 14:56:02 https://gist.github.com/cpressey/2e0cc1b07b716a7793ba2d674fa8bee9 14:56:12 It's a second-order concatenative language. 14:56:40 It's probably not Turing-complete. 14:57:34 -!- Sgeo__ has quit (Ping timeout: 246 seconds). 15:03:14 cpressey: so the type is ([Int] -> [Int]) -> ([Int] -> [Int])? 15:03:29 * int-e is trying to get the gist without reading the whole thing 15:04:31 int-e: That's correct (unbounded Int to be clear) 15:05:25 > let i = (.) (1:); s = (.) (\(a:b:ss) -> (a-b):ss) in (s . s . i) id [] 15:05:27 *Exception: :3:28-48: Non-exhaustive patterns in lambda 15:05:30 > let i = (.) (1:); s = (.) (\(a:b:ss) -> (a-b):ss) in (s . i . i) id [] 15:05:33 [0] 15:05:50 (that'd be "iis") 15:14:12 -!- wob_jonas has joined. 15:15:31 > (maxBound :: Int) 15:15:33 9223372036854775807 15:16:17 cpressey: is this a release or merely an escape? 15:16:27 cpressey: so... http://paste.debian.net/1095634/ ? 15:18:33 cpressey: I don't understand. why wouldn't second order functions be enough for turing-completeness? you can just have second order functions that implement a while loop. 15:19:47 oh, you want the second order to be a concatenative language too 15:21:04 cpressey: same code, a few more type signatures: http://paste.debian.net/1095635/ 15:21:26 cpressey: could you perhaps translate Blindfolded Arithmetic into such a thing? each ordinary instruction of Blindfolded arithmetic is a plain function that treats a fixed-size top part of the stack as the register file, and you need a single second order function to turn the whole thing into a loop 15:21:36 you'd have to change the exit condition, but that isn't much of a problem 15:22:37 oh I missed the pop operation. 15:23:35 int-e: Your code looks not dissimilar to mine 15:23:58 and I got the while wrong. Hmm. 15:24:36 wob_jonas: The last few paragraphs try to talk about why even that is difficult (how do you select the instruction, if all you have are strictly-singly-nested loops?) 15:24:41 and note that you don't even need the hard part of Blindfolded arithmetic, because you can just have built-in conditinoal functions 15:25:04 cpressey: so here's another version: http://paste.debian.net/1095636/ 15:25:10 cpressey: that's the part that doesn't matter here, because you can have value conditional (not code conditional) instructions built into your language as primitives 15:26:22 basically you translate an ordinary program to an explicit instruction pointer and a big loop that blindly loops around all instructions of the original program, but only stores the results of those instructions if the program counter points to that particular instruction 15:26:26 cpressey: funny how much clearer that makes the language to my brain :P 15:26:50 cpressey: (of course the point isn't so much the code itself as the exercise of writing it) 15:26:56 when the program counter points to somewhere else, you compute the result and ignore it. it's inefficient, but works. 15:28:43 Built-in conditionals might work, but seem a bit like cheating. 15:28:52 Alas, I must be off. A la prochaine. 15:28:54 -!- cpressey has quit (Quit: WeeChat 1.4). 15:29:32 well, if you don't want built-in conditionals, then you have to look at how you can program Blindfolded arithmetic. 15:33:00 -!- wob_jonas has quit (Remote host closed the connection). 16:22:17 -!- john_metcalf has quit (Quit: john_metcalf). 16:39:06 -!- b_jonas has joined. 17:03:15 -!- FreeFull has joined. 17:48:41 [[Special:Log/newusers]] create * Redwolf10105 * New user account 17:50:44 [[Esolang:Introduce yourself]] https://esolangs.org/w/index.php?diff=65474&oldid=65418 * Redwolf10105 * (+161) /* Introductions */ 18:36:34 [[Bootstrapping]] N https://esolangs.org/w/index.php?oldid=65475 * Lucas * (+23) Redirecting to [[Bootstrap]] 18:40:36 [[Bootstrap]] https://esolangs.org/w/index.php?diff=65476&oldid=61778 * Lucas * (+66) Link to [[Wikipedia:C (programming language)|C at Wikipedia]] 18:46:09 -!- user24 has joined. 18:46:43 -!- user24 has quit (Remote host closed the connection). 18:49:50 [[Fusion Tag]] M https://esolangs.org/w/index.php?diff=65477&oldid=57100 * Lucas * (+4) Link to [[bootstrap]] 18:50:12 [[MUMON]] M https://esolangs.org/w/index.php?diff=65478&oldid=12083 * Lucas * (+4) Link to [[bootstrap]] 18:52:02 [[Pipe]] N https://esolangs.org/w/index.php?oldid=65479 * Redwolf10105 * (+5141) Created page with "Pipe is a language designed by Programming Puzzles and Code-Golf user RedwolfPrograms. Nonnegative integers can be stored either in a stack or in a value known as the pipe. Pu..." 19:03:20 -!- xkapastel has quit (Quit: Connection closed for inactivity). 19:20:05 @tell cpressey http://paste.debian.net/1095661/ has an example of a tag system in Wagon. (This generalizes to arbitrary tag systems.) It uses two nested loops. It may be possible to get away with a single loop, actually. 19:20:05 Consider it noted. 19:35:41 [[Special:Log/newusers]] create * CrispyPin * New user account 19:38:48 -!- AnotherTest has joined. 19:42:24 -!- lldd_ has joined. 19:43:22 [[Esolang:Introduce yourself]] https://esolangs.org/w/index.php?diff=65480&oldid=65474 * CrispyPin * (+293) 20:08:07 `smlist 20:08:10 smlist: shachaf monqy elliott mnoqy Cale 20:18:17 yay 20:18:47 -!- Lord_of_Life has quit (Ping timeout: 245 seconds). 20:22:15 -!- xkapastel has joined. 20:23:34 -!- Lord_of_Life has joined. 20:52:59 -!- lldd_ has quit (Quit: Leaving). 20:54:32 -!- AnotherTest has quit (Ping timeout: 272 seconds). 22:08:46 -!- b_jonas has quit (Ping timeout: 246 seconds). 22:10:05 -!- b_jonas has joined. 22:42:42 @tell cpressey One more update for Wagon, now with an actual translation from tag systems and more comments: http://paste.debian.net/1095671/ 22:42:42 Consider it noted. 23:04:38 -!- moei has quit (Quit: Leaving...). 2019-08-14: 00:13:51 -!- FreeFull has quit. 00:25:52 -!- Sgeo_ has quit (Ping timeout: 245 seconds). 00:29:43 [[User talk:A]] https://esolangs.org/w/index.php?diff=65481&oldid=65468 * Areallycoolusername * (+414) 00:31:46 [[User talk:A]] https://esolangs.org/w/index.php?diff=65482&oldid=65481 * Areallycoolusername * (+320) /* Re: Your Comment On My Github Pull Request */ 00:39:33 -!- Sgeo has joined. 00:50:15 -!- ARCUN has joined. 00:50:43 Does anyone know how I can aquire an original Commodore 64? 00:51:41 I assume you're looking for it on the cheap? 00:51:55 Yeah 00:52:15 I'm not really sure... ebay is probably not your best bet for that... not sure what is 00:52:34 it's not like it's an extremely rare machine, though 00:53:20 I might ask cpressey. I bet he would know, as he already has one 00:56:01 -!- ARCUN has quit (Remote host closed the connection). 01:32:30 [[ABC]] M https://esolangs.org/w/index.php?diff=65483&oldid=63966 * Dtuser1337 * (-3) fixing the code in hello world 01:37:19 -!- tromp_ has quit (Ping timeout: 258 seconds). 01:51:56 -!- xkapastel has quit (Quit: Connection closed for inactivity). 02:40:20 [[Deadfish 2]] https://esolangs.org/w/index.php?diff=65484&oldid=63614 * Dtuser1337 * (+15) 02:40:38 [[Deadfish 2]] https://esolangs.org/w/index.php?diff=65485&oldid=65484 * Dtuser1337 * (-15) Undo revision 65484 by [[Special:Contributions/Dtuser1337|Dtuser1337]] ([[User talk:Dtuser1337|talk]]) 02:41:04 [[Deadfish 2]] https://esolangs.org/w/index.php?diff=65486&oldid=65485 * Dtuser1337 * (+23) 02:41:15 [[Deadfish 2]] https://esolangs.org/w/index.php?diff=65487&oldid=65486 * Dtuser1337 * (+1) 02:43:20 [[ABC]] https://esolangs.org/w/index.php?diff=65488&oldid=65483 * Dtuser1337 * (+6) much better, i guess? 02:45:02 [[ABC]] https://esolangs.org/w/index.php?diff=65489&oldid=65488 * Dtuser1337 * (+13) /* Discussions */ 02:49:18 -!- tromp has joined. 02:54:57 [[Deadfish]] https://esolangs.org/w/index.php?diff=65490&oldid=65452 * Dtuser1337 * (-1) /* Lua */ 03:08:30 -!- laerling has quit (Quit: ZNC - https://znc.in). 03:08:47 -!- laerling has joined. 03:11:05 [[Deadfish 2]] https://esolangs.org/w/index.php?diff=65491&oldid=65487 * Dtuser1337 * (+43) 03:12:23 [[ABC]] https://esolangs.org/w/index.php?diff=65492&oldid=65489 * Dtuser1337 * (+43) 04:50:06 -!- Sgeo has quit (Read error: Connection reset by peer). 04:50:34 -!- Sgeo has joined. 07:11:49 -!- tromp has quit (Read error: Connection reset by peer). 07:12:10 -!- tromp has joined. 07:41:02 -!- Sgeo_ has joined. 07:44:12 -!- Sgeo has quit (Ping timeout: 245 seconds). 07:48:07 -!- Sgeo__ has joined. 07:51:43 -!- Sgeo_ has quit (Ping timeout: 245 seconds). 07:56:22 -!- cpressey has joined. 07:58:22 `? concurrency 07:58:24 concurrency? ¯\(°​_o)/¯ 08:02:18 controversial currency? 08:02:27 `? password 08:02:28 The password of the month is surprising. 08:02:42 I would have guess that it's the categorical dual of ncurrency. 08:03:11 that's too categorical for me this early in the morning 08:04:00 `grwp daul 08:04:04 No output. 08:04:05 `grwp dual 08:04:09 block device:Block devices are a concession made in Unix to make raw hard disks and magnetic tape have a similar interface to regular files and terminals. Since magnetic tapes can't write individual bytes, only entire blocks, the interface isn't exactly the same, thus the dreaded dd obs= option was born. \ comonad:Comonads are just monads in the dual category. They are hard to get into. \ elrond:Elrond is a rogue program originally created to police the Ma 08:04:46 Hah I didn't expect "individual". 08:07:40 the password of the month reminds me of a situation i had during apprenticeship. i needed to decide for a password and somebody said "i am going to type anything" and i said "brilliant. out new password will be 'anything'" 08:07:41 `2 grwp dual 08:07:42 2/3:he Matrix, eventually gaining increased individuality and becoming a threat to the Machines themselves. \ nundrum:A nundrum is the categorical dual of a conundrum: a problem whose solution is useless. \ palindrome:A palindrome is a word that remains the same if you take it to the mirror dimension, and then take each individual letter back to the normal dimension separately. \ sober space:Sober spaces are the dual of Stoned spaces. Taneb invented them. 08:07:57 `n 08:07:57 3/3: \ splay:Splay is a painful pastime that is dual to cosplay and the supersymmetric partner of ordinary play. Recuperation, when even possible, may require wearing a stume. 08:11:12 int-e: Do you not even like adjunctions? 08:12:24 `? adjunction 08:12:25 adjunction? ¯\(°​_o)/¯ 08:13:07 `? adjoint 08:13:08 adjoint? ¯\(°​_o)/¯ 08:13:29 `grWp adjunction 08:13:30 No output. 08:13:32 `grWp adjoint 08:13:33 No output. 08:13:56 `1 grWp universal 08:13:58 1/1:pikachu:Pikachu is a universal quantifier for Chu spaces. \ universal property:Universal properties are the best. 08:14:05 The wiki has a link to the IRC channel, which contains its own wiki 08:16:02 What would the existential quantifier for Chu spaces be? 08:17:51 Gesundheit. Because it's a witness to a Chu. 08:18:01 I'll show myself out 08:18:53 one of those is a b_jonaswisdom too 08:18:59 the dome is full of them 08:19:10 -!- Lord_of_Life has quit (Ping timeout: 268 seconds). 08:20:28 Presumably it's //block device// 08:20:34 `cwlprits block device 08:20:36 b_jonäs 08:21:28 -!- Lord_of_Life has joined. 08:37:26 -!- b_jonas has quit (Quit: leaving). 08:44:05 shachaf: I read your writeup about error handling. The thing it reminded me the most of, I guess, is Haskell's Data.Either, especially how can be used as a monad, to make it "flat". 08:46:01 lambdabot: did you nudge cpressey about my Wagon efforts? ;-) 08:48:31 int-e: Ah yes it did. My fault for not knowing how my IRC client works. 08:50:24 int-e: Very cool. I'll have to test it out when I get a moment. 08:52:30 cpressey: Yes, though I feel like monads don't quite deliver on their promise for this sort of thing. 08:52:40 For example monad transformers are a mess. 08:53:44 Haskell functions also don't have an implicit place for "return" to be lexically bound to like e.g. C functions. 08:53:58 So instead it behaves dynamically bound like exceptions. 08:58:11 *brow furrows* I think you want "return" to be dynamically bound, otherwise, you can only call the function from one place? I must be misunderstanding you. 08:59:05 Hmm, I guess the thing I'm talking about is something in between. 08:59:06 we're in a bind and I don't know what it is 08:59:19 It has to do with a thing I haven't figured out yet. 08:59:42 (I don't know what you mean by "dynamically bound" here) 08:59:47 What I mean is: When you see the keyword "return", you can look at the program statically and figure out where it'll jump to. 08:59:51 -!- mniip has quit (Quit: This page is intentionally left blank.). 09:00:13 Or the compiler can do it. 09:00:16 you can? 09:00:40 Can't you? 09:00:49 'return' is as dynamic as you get in C... the function could be called from anywhere. 09:01:01 Oh, I just mean you can see which block it returns from. 09:01:07 -!- mniip has joined. 09:01:19 int foo() { if (...) return 0; ... } -- you can tell that that return returns from foo. 09:01:28 Whereas "Left 0" could be going anywhere. 09:01:37 -!- AnotherTest has joined. 09:01:52 Maybe this isn't really fair to say, though. 09:03:11 Left 0 >> ... will end up inside ... "next", for some value of "next". 09:03:29 shachaf: You can find the set of callpoints it can potentially return to, and you could, for instance, insist that some condition pertains at all those points... this is sometimes called having an effect system. 09:03:54 It's really entirely different from 'return' in C. 09:04:14 which block it returns *from* should be... lexical? 09:04:28 * cpressey tries to imagine a language in which it is not 09:04:37 I agree that it's pretty different, but they were presented as similar? 09:04:43 cpressey: INTERCAL, I suppose 09:05:11 There's the similarity where you can write: "foo = either id id $ do { ...; when p (Left x); ... }" to implement early exit. 09:05:14 cpressey: and maybe aspect-oriented programming as a paradigm? I don't know enough about that. 09:06:15 cpressey: I think the more direct analogy is maybe delimited continuations. 09:06:21 (but arguably even if you don't know where you're coming from and where you'll go next, all imperative programming languages have a notion of "here, right now") 09:07:13 int-e: dear god, an aspect that can splice in a return statement... 09:09:44 Man. I should figure out all my half-coherent language ideas. 09:10:04 -!- Sgeo_ has joined. 09:10:31 shachaf: better you than us ;-) 09:11:02 I should just type them all into the channel and have you figure them out for me. 09:12:22 I thought that was what you were doing already. 09:12:59 Only occasionally. 09:13:06 -!- Sgeo__ has quit (Ping timeout: 258 seconds). 09:36:37 -!- wob_jonas has joined. 09:42:33 -!- WhoaNelly has joined. 09:42:38 cpressey: yeah, in current languages you can do that only by explicit call-ec objects or similar. but I can imagine a language where some of those keywords (return, next/last/redo/retry) use an implicit lexical variable and can refer to the outer named function where the block/lambda was created 09:43:19 but since I mostly program in a goto-less style, this doesn't come up often 09:45:01 you'd also need loop labels and goto labels to generate exit variables that can be bound by closures even if they go to an outer function, but at that point they become full call/cc continuations, because you can jump to them even after the block that contains them has exited 09:45:15 and that may be the main reason why that's not usually implemented\ 09:47:54 I imagine this would most likely happen in a golf language, since they don't care too much about an efficient runtime, they might mix all sorts of paradigms and primitives that you rarely use but always add a lot of overhead to the interpreter, so eg. many slot assignments are always backtrackable just in case you use prolog-style backtracking, eve 09:47:55 rything can be pointed to by weak references, every number could contain a symbolic formula, you have full call/cc everywhere, etc 09:48:22 wob_jonas: This is related to the things we talked about a while ago. 09:48:54 shachaf: Have you ever worked out how to code a conventional try/except-type exception handler in continuation-passing style, as an exercise? 09:49:37 I think I have a good idea of how it'd go? 09:49:53 I have not done it. 09:56:22 Basically, you have a regular continuation and an exception continuation. Every time you try, you extend the exception continuation. Every time you throw, you continue on the exception continuation instead of the regular one. 09:58:41 Oh, sure, that thing. 09:58:54 This is how JavaScript people write their programs by hand anyway. 09:59:35 Presumably this is equivalent to the Either thing? 10:00:00 "... -> (success -> r) -> (failure -> r) -> r" 10:00:20 "... -> (Either success failure -> r) -> r" 10:00:55 Which you can further turn into "... -> Either success failure" if you're using r parametrically. 10:03:08 I think you can compare it to a lot of things, I was thinking of it as more of a good place to start thinking about: how would you make this better? (You seem to want something better.) 10:04:09 Hmm, I think exceptions are probably a bad idea in the first place, so I'm not sure why you'd start there. 10:04:28 I guess writing it by hand is more explicit than exceptions, at least. 10:04:48 You're still writing the moral equivalent of "try" and "throw", aren't you? 10:05:28 I'm not sure what the moral value of "try" and "throw" is. 10:05:41 I think the main goal should be something where it's as easy as possible to read the code and see how control flow can happen. 10:06:07 You have code that can signal an error. You have code that can handle an error. Those are the moral values of "throw" and "try" respectively. 10:06:21 If you don't have those, well. 10:06:23 How can you tell whether code can signal an error? 10:06:45 shachaf: be more specific, what things that who talked about a while ago? 10:06:51 If you can't tell if code has encountered an error or not, you've got worse problems than this! 10:06:56 wob_jonas: Geo and that sort of thing. 10:07:26 I guess the exception answer is "based on types" (checked exceptions) or "anything can signal an error at any time" (unchecked exceptions). 10:07:34 cpressey: no, not an either. you want to non-local exit through all the stack frames that don't catch exceptions 10:07:49 so you'd have a global variable that stores the continuation where you have to jump when you throw 10:08:06 wob_jonas: as I said, I think you can compare it to a lot of things :) 10:08:07 and a try statement sets that global variable but saves its old value 10:08:21 I didn't say it was very similar though :) 10:10:12 Forcing it all into Either is like forcing all your non-local exits into local-exits-and-always-checking-the-exit-code 10:13:51 I feel like if your error handling system is made of indirect jumps it's already too complicated, or something. 10:13:57 using Either is a lot more like shell programming where you say (echo 'hi' && touch foo && cat foo) || echo 'badness' 10:14:28 note that this only works well if you have a dynamic-unwind that you can use to run destructors as the stack is rolled off, otherwise you have to rewrite all destructors (and all python-with statement) into a try 10:14:33 int a try-finally 10:14:54 shachaf: wait, how is geo relevant for that? 10:15:10 wob_jonas: yeah, you have to weave destructors into your exception continuation too 10:15:25 shachaf: no, geo doesn't allow jumping out from inside a lambda block 10:15:36 ooc, what's Geo? 10:15:46 it wouldn't even if it implemented lambdas 10:16:03 geo only allows you to break to the innermost block, and a function would count as such an innermost block 10:16:22 or did we talk about a hypothetical extension that would allow jumping out farther with block labels? hmm 10:16:29 that may have happened, I'll have to look at the logs 10:16:53 cpressey: one of the old toy languages that I once birthed into existence but now I'm ashemed of the details and my excuse is that I was young 10:16:56 see the wiki 10:16:57 https://esolangs.org/wiki/Geo 10:17:03 the other one is scan 10:17:09 wob_jonas: thx 10:17:13 and there's a third one that's lost 10:17:26 and a fourth one which is called psz 10:17:33 I don't mean Geo, just the things I was talking about when we were talking about Geo. 10:17:36 Or something. 10:17:43 shachaf: yeah, it's possible 10:17:54 I think ruby would be particularly well suited for this 10:18:02 at least old ruby, before 1.9 came along 10:18:03 I think the Ruby solution is terrible. 10:18:15 The whole proc vs. lambda thing is such a mess. 10:18:31 Hmm, does Ruby implement function return with exceptions? 10:18:33 sure, I agree, ruby is terrible 10:25:00 Hmm, I should go to sleep. 10:25:14 But in the future I should ask about one of the big things I'm trying to figure out. 10:26:04 gl with that 10:26:24 I would like to go to sleep right now but sadly it is not going to sleep time here 10:26:35 It's not even being asleep time 10:29:52 @time Taneb 10:30:00 @time 10:30:04 Local time for shachaf is Wed Aug 14 03:30:01 2019 10:30:08 11:30 10:30:18 Uh oh. It's way past going to sleep time. 10:30:24 I guess I can't go to sleep now. 10:30:33 You should retroactively be asleep 10:31:19 Good idea. 10:38:26 [[Drive-In Window]] M https://esolangs.org/w/index.php?diff=65493&oldid=61623 * Dtuser1337 * (+0) /* Pre-program delcarations */ 10:39:24 `datei 10:39:24 2019-08-14 10:39:24.695076581 +0000 UTC August 14 Wednesday 2019-W33-3 10:39:37 it's not sleep time, it's work time 10:43:53 Given a function, I would like to get a list of all exceptions that could possibly be raised by that function, and from where, and (ideally) for what reasons. You could devise a static analysis that does this. It'd be more of an analysis tool than a language feature though. 10:45:56 that's very often all exceptions, if the function takes a callback 10:46:30 potentially minus a few 10:46:43 or if it calls a virtual method or otherwise does some dynamic call where you can't determine the target of the call statically 10:47:38 [[Fusion Tag]] https://esolangs.org/w/index.php?diff=65494&oldid=65477 * Ais523 non-admin * (-4) Undo revision 65477 by [[Special:Contributions/Lucas|Lucas]] ([[User talk:Lucas|talk]]): the word's being used here in a slightly different sense to in the linked article, so linking it is here probably more confusing than useful at the moment 10:49:56 [[Bootstrap]] https://esolangs.org/w/index.php?diff=65495&oldid=65476 * Ais523 non-admin * (+10) people generally dislike unmarked external/cross-namespace links here; technically the link is marked by being a slightly different shade of blue, but it's a clue that most people miss 10:51:50 Yeah, I wouldn't expect to get very useful results when running it on foldl... 10:52:58 you could still do something like: exceptions thrown by arguments + exceptions found by static analysis - exceptions handled 10:53:38 but it's not just arguments 10:53:39 where the first term is treated as symbolic. 10:55:02 -!- Sgeo__ has joined. 10:58:23 -!- Sgeo_ has quit (Ping timeout: 245 seconds). 11:11:18 -!- AnotherTest has quit (Ping timeout: 245 seconds). 11:12:37 yeah, not just arguments, anything that you determine you can't statically analyze (but you can report those callsites too). Vaguely interested now, looking at if there are any static analysis frameworks for Python. 11:12:59 I guess there's the ast module 11:16:48 ugh, decorators 11:17:47 well, maybe someday 11:20:00 https://python-ast-explorer.com/ if anyone is interested in what its AST looks like presently. 11:22:44 that rotating logo is oddly satisfying 11:23:33 -!- mniip_ has joined. 11:24:44 ... why does webGL not work ... oh, graphics driver update. hrm :) 11:25:02 -!- mniip has quit (Ping timeout: 600 seconds). 11:25:19 I was going to check whether http://int-e.eu/~bf3/tmp/moebius8.html still works :P 11:32:40 -!- mniip_ has changed nick to mniip. 12:34:26 [[Disan]] https://esolangs.org/w/index.php?diff=65496&oldid=56724 * YamTokTpaFa * (+24) Why, A, why did you make such this page.... 12:34:57 [[Is]] https://esolangs.org/w/index.php?diff=65497&oldid=56401 * YamTokTpaFa * (+24) +CAT languages 12:35:25 [[ParrBF]] https://esolangs.org/w/index.php?diff=65498&oldid=13826 * YamTokTpaFa * (+23) Don't forget +CAT languages 12:42:52 [[Jumpback]] https://esolangs.org/w/index.php?diff=65499&oldid=43383 * YamTokTpaFa * (+24) +CAT languages 13:05:04 -!- john_metcalf has joined. 13:11:22 -!- WhoaNelly has quit (Read error: Connection reset by peer). 13:33:35 -!- Sgeo_ has joined. 13:36:43 -!- Sgeo__ has quit (Ping timeout: 245 seconds). 14:00:44 https://catseye.tc/installation/PL-%7BGOTO%7D running in a web page at last, by the magic of the Haste compile 14:01:03 r 14:30:48 -!- unlimiter has joined. 14:34:38 -!- MDude has quit (Ping timeout: 245 seconds). 14:45:02 -!- unlimiter has quit (Quit: WeeChat 2.5). 14:51:59 [[Special:Log/newusers]] create * Shakil t * New user account 15:40:51 -!- Xunie has quit (Remote host closed the connection). 15:49:03 by the way, ICFP contest results will be available during the long weekend 15:49:35 "the long weekend" sounds like an event in the backstory of a post-apocalypting story 15:49:48 "Ever since the Long Weekend, we have never known peace" 15:51:06 -!- Sgeo__ has joined. 15:54:13 -!- Sgeo_ has quit (Ping timeout: 245 seconds). 15:54:56 mm 15:57:47 Taneb: no, I just call any weekend that is longer than 48 hours as long weekend. they last 49 hours, 72 hours, 73 hours, 96 hours, 97 hours, 120 hours, or even 144 hours. 15:58:51 OK 15:59:03 Since Saturday ends the week and Sunday begins a new week, I object to calling the unit as a whole a "weekend". 15:59:22 I object to weeks that begin on Sunday 15:59:40 49 or 73 hours is only possible near --10-28, and 120 or 144 hours is only possible near --12-25 16:00:13 cpressey: we use Monday as the start of the week, which makes more sense exactly because of this 16:01:10 Well, that's okay then. 16:01:15 wob_jonas: what's the significance of --10-28? 16:01:20 -!- cpressey has quit (Quit: A la prochaine.). 16:01:29 Taneb: dst switch 16:01:37 Ah, yes 16:01:40 yaeh, timezone offset switch 16:01:49 wob_jonas: don't you miss some 24k - 1 variants? 16:01:59 Also Day of the Establishment of an Independent Czecho-Slovak State 16:02:13 (I mean things 71) 16:03:48 int-e: yeah, those are possible too 16:04:42 71 hours, and now 95 hours is possible too 16:27:04 `perl -eprint 8*0.0245 16:27:05 0.196 16:27:28 Dumb idea: IRC client that lets you write comments in the logs 16:27:45 That are displayed but not actually sent 16:28:04 Taneb: irssi already does that, with the /echo command 16:28:17 wob_jonas: aha 16:28:22 useful in macros where you may want to print something other than what you send or receive 16:32:08 doesn't end up in the log, though 16:32:45 that depends on how you set up the log I think 16:32:48 there's some filtering options 16:33:05 you can also send invalid commands to the server if you want 16:33:28 i see 16:33:36 or messages to a channel that is invite-only and only you are joined 16:39:02 -!- Sgeo_ has joined. 16:42:21 -!- Sgeo__ has quit (Ping timeout: 244 seconds). 16:45:45 if you just want to write to a log you can PM yourself 16:48:54 -!- wob_jonas has quit (Remote host closed the connection). 17:08:18 -!- FreeFull has joined. 17:13:25 -!- xkapastel has joined. 17:21:04 -!- Sgeo__ has joined. 17:24:12 -!- Sgeo_ has quit (Ping timeout: 245 seconds). 17:26:03 -!- Sgeo_ has joined. 17:29:12 -!- Sgeo__ has quit (Ping timeout: 245 seconds). 17:52:06 -!- Sgeo_ has quit (Read error: Connection reset by peer). 17:52:34 -!- Sgeo_ has joined. 17:55:02 -!- b_jonas has joined. 18:18:55 `olist 1175 18:18:56 olist 1175: shachaf oerjan Sgeo FireFly boily nortti b_jonas 18:22:06 -!- Sgeo_ has quit (Read error: Connection reset by peer). 18:22:34 -!- Sgeo_ has joined. 18:25:12 [[User talk:A]] https://esolangs.org/w/index.php?diff=65500&oldid=65482 * Areallycoolusername * (+345) 18:32:33 o! 18:45:30 -!- AnotherTest has joined. 19:14:33 -!- Sgeo__ has joined. 19:17:32 -!- Sgeo_ has quit (Ping timeout: 245 seconds). 19:24:04 -!- Sgeo_ has joined. 19:28:15 -!- Sgeo__ has quit (Ping timeout: 268 seconds). 20:18:17 -!- Lord_of_Life_ has joined. 20:20:54 -!- Lord_of_Life has quit (Ping timeout: 244 seconds). 20:21:11 -!- Lord_of_Life_ has changed nick to Lord_of_Life. 21:24:49 -!- atslash has quit (Read error: Connection reset by peer). 21:26:07 -!- atslash has joined. 21:28:44 -!- Phantom_Hoover has joined. 21:30:47 -!- AnotherTest has quit (Ping timeout: 252 seconds). 21:36:40 It's sometimes interesting to experience history backwards. NES Metroid is quite a good port of Super Metroid to a simpler hardware. Super Metroid is huge, so obviously Metroid can't have everything from it, but it does a really good job of showing as much of what we love as possible. Many things in it a really recognizable. 21:38:47 It's a pity they had to cut the MB phase 2 and 3 21:42:04 But apart from that, Tourian is a particularly faithful representation (even if, according to the story, it's a different Tourian than in Super Metroid) 22:00:48 -!- xkapastel has quit (Quit: Connection closed for inactivity). 22:35:19 -!- Phantom_Hoover has quit (Quit: Leaving). 22:56:49 -!- b_jonas has quit (Quit: leaving). 23:16:49 -!- tromp has quit. 23:34:39 -!- tromp has joined. 23:35:27 -!- tromp has quit (Remote host closed the connection). 23:38:33 -!- Sgeo_ has quit (Read error: Connection reset by peer). 23:45:16 -!- Sgeo has joined. 2019-08-15: 00:07:58 http://blog.sigfpe.com/2009/10/buffons-needle-easy-way.html is TG 00:09:45 -!- ais523 has joined. 00:24:05 -!- tromp has joined. 00:27:37 @messages? 00:27:38 Sorry, no messages today. 00:27:44 -!- ais523 has quit (Quit: quit). 00:28:30 * kmc is TG 00:28:51 -!- tromp has quit (Ping timeout: 264 seconds). 00:51:22 [[Disan]] M https://esolangs.org/w/index.php?diff=65501&oldid=65496 * A * (-18) 00:53:56 -!- FreeFull has quit. 01:00:42 -!- tromp has joined. 01:04:55 -!- tromp has quit (Ping timeout: 252 seconds). 01:49:51 -!- ais523 has joined. 01:50:29 wob_jonas: is 48 hours + 1 second a long weekend? (possible due to leap seconds, or do you count the extra second as part of one of the 48 hours?) 01:54:35 -!- tromp has joined. 01:59:21 -!- tromp has quit (Ping timeout: 250 seconds). 02:26:07 -!- ais523 has quit (Quit: quit). 03:42:36 -!- tromp has joined. 03:47:27 -!- tromp has quit (Ping timeout: 264 seconds). 04:38:48 -!- atslash has quit (Quit: This computer has gone to sleep). 04:42:18 -!- atslash has joined. 05:30:52 -!- tromp has joined. 05:36:03 -!- tromp has quit (Ping timeout: 264 seconds). 05:57:22 -!- adu has quit (Quit: adu). 06:21:25 "Must have knowledge of object oriented programming using HTML/CSS, JQuery" 06:21:25 https://jpl.jobs/jobs/2019-10773-Engineering-Technical-Facilities-Part-Time-Internship 06:57:29 -!- tromp has joined. 07:02:03 -!- tromp has quit (Ping timeout: 252 seconds). 07:03:52 -!- tromp has joined. 07:26:21 -!- cpressey has joined. 07:34:09 -!- tromp has quit (Remote host closed the connection). 07:39:20 Still on (my personal spin on) shachaf's error handling thing, I think one problem is languages that raise exceptions at the drop of a hat. "Key not found in map" and "divisor is zero" are not exceptional conditions in the same sense "file not found" or "connection was reset" are. 07:40:18 You can statically insist that the key exists, that the divisor is zero, that the list is not empty, that the pointer is non-null. 07:41:34 cpressey: I could get behind that, yeah. As the name suggests, exceptions /should/ be used for exceptional conditions that a caller cannot be reasonably expected to handle. 07:44:55 I certainly agree that exceptions for those things are scow. 07:45:09 Well, even C raises an exception on division by 0. 07:46:57 A good way to express these static checks is to write tiny proofs that they can't happen. Dependent types lets you do that, but IMO they're difficult to use and they'll never get widespread adoption. Refinement types seem to do much the same thing (in fact might be a kind of dependant typing) but are much more intuitive. 07:47:47 Those seem like good ideas that have never been made that usable as far as I know. 07:48:15 Then again once you have a good exception mechanism I suppose it's unavoidable that they will be used for things like keys not present in a map, and as a general non-local return mechanism as well. 07:48:58 Apparently the next version of Ada will have dependent types. If so, it will make it the only non-experimental *imperative* language to have them, as far as I know. 07:49:17 -!- tromp has joined. 07:49:38 Java's Error/Exception distinction is actually an attempt to distinguish between exceptions-as-exceptional-situations and exceptions-as-part-of-the-interface 07:49:53 Granted, "no one" uses Haskell, "no one" uses SMT solvers 07:50:13 cpressey: oh? 07:50:19 cpressey: news to me on both accounts 07:50:33 (Most Isabelle users use SMT solvers all the time!) 07:50:34 Haskell is a good idea that has never been made usable 07:50:40 (Of course nobody uses Isabelle) 07:50:41 (I'm being facetious) 07:51:07 (This one is actually much closer to the truth. I suspect there are about 100 serious Isabelle users? Maybe I'm wrong.) 07:51:08 For refinement types, my point of reference is Liquid Haskell 07:52:03 int-e: To be fair, there are a lot of systems *like* Isabelle, if you added up all those users, it might make a dent in the statistics. 07:52:09 It's really hard to estimate these things! (Coq is inexplicably far more popular. It's so much harder to use!) 07:52:31 I got the impression Lean is the New Hawtness in this area 07:53:18 And then there's Z3 07:53:31 Z3 is an SMT solver, like CVC4 and Yices? 07:53:38 a name which will forever make my think of Infocom when I read it 07:53:39 Not in the same boat, I thought. 07:54:11 I think Z3 is more SAT than SMT 07:54:25 not entirely sure, tbh 07:54:29 Nah, Z3 is an SMT-solver. 07:54:58 yeah. http://theory.stanford.edu/~nikolaj/programmingz3.html 07:55:03 SMT = Satisfiability modulo theories = DPLL + theory oracle; all the SMT solvers have a SAT solver core. 07:55:49 This is in contrast to first-order theorem provers like Vampire, iProver, E, the old Prover9 and Mace4 ... and a bunch of others I forgot. 07:57:10 What seems to be true is that SMT solvers are slowly acquiring limited first-order logic support (*some* universal quantifiers). But I don't know whether this is practical. 07:57:27 Hmm... so the reason Z3 has bindings to a bunch of regular programming languages is because you're supposed to write the "tactics" in the regular programming language? 07:57:57 I mean, among other reasons I suppose 07:58:04 cpressey: Compilers can use SMT solvers for loop optimizations (in particular elision of bounds checks) 07:58:28 (using the linear integer arithmetic fragment) 07:58:50 right, and Liquid Haskell uses a SMT solver (Z3 or some others) to let you write tiny proofs of the properties of the functions you've written 07:59:53 And for such things it's nice to have an API instead of having to write out thousands of SMT-lib files, to be parsed by the solver, and then reading back the solver's output... 08:00:41 And then there's incremental solving... (basically: you set up common constraints, then add and remove some additional constraints repeatedly) 08:02:00 A bit like superoptimization, except for theorems? 08:02:00 Anyway, lots of stuff going on in that area. 08:03:25 I just think of it as an advanced backtracking technique. Meta-backtracking, if you will. 08:05:34 Hrm... I thought this program was going to run for about 8 hours... it's at 1136 minuts already. 08:05:36 Even without such a general solution, you can fairly easily build a static analysis phase that complains if you say x/y in a context where you don't know y is 0, and so forth. 08:05:46 *not 0 08:06:17 Ah of course static analysis tools are also an important target for SMT solver APIs :) 08:06:34 (Though I guess the compiler example is a special case of that.) 08:07:01 * int-e goes looks up supercompilation. (I have a vague idea, but no definition.) 08:08:00 https://en.wikipedia.org/wiki/Metacompilation is impressively short :P 08:10:23 I know it as "here is a constraint, go try every (short!) permutation of machine instructions to find one that satisfies it" 08:10:36 Often takes longer than 8 hours 08:11:02 https://en.wikipedia.org/wiki/Superoptimization 08:11:23 I guess "supercompilation" is a different thing 08:11:56 Ah!!! I conflated two different terms there. Thanks! 08:12:28 (Totally different concepts.) 08:13:36 cpressey: "often takes longer than 8 hours" <-- I hope that in practice you determine in advance how much time you want to spend on this kind of foolishness and then you take the best result you got in that timeframe? 08:13:57 (I guess you can also optimize as a continuous process and deploy everyt improvement you find) 08:16:33 I can actually see a company like Google doing such things. "We spend 0.001% of our computational power on trying to superoptimize our inner loops. If we manage to improve one of them by 1% that will pay off." (numbers are adjustable.) 08:17:49 int-e: I think, other than for research and entertainment, it is mainly done by compiler developers 08:18:56 I suppose nVidia & co. are also doing such things? 08:19:38 whoa, lots of conversation 08:19:41 (Whenever there's a new game release, a few weeks later there's a graphics driver update, presumably with specially crafted binaries for the most important shaders.) 08:19:41 SMT solvers are TG. 08:20:13 Interesting. I can see how hardware manufacturers might care about it too, but I really don't know 08:20:29 cpressey: I'm speculating, of course. 08:20:50 But consumer graphics cards sell by framerates in popular games. 08:21:17 -!- Lord_of_Life has quit (Ping timeout: 245 seconds). 08:22:13 -!- Lord_of_Life has joined. 08:23:57 it's a shady industry 08:24:31 cpressey: I'm not speculating about the new driver releases... those can be observed in practice. " releases new drivers after release of , solving some minor glitches and improving framerates by 10%" is a fairly common news item in tech news.) 08:25:14 cpressey: I don't know for sure whether they include precompiled shaders, but this would go a long way towards explaining their ridiculous sizes. 08:26:15 It would sure be better if they just gave you an interface that let you optimize your shaders yourself. 08:30:08 "Supported operating systems: Microsoft Windows 98, 98SE, ME, 2000, XP, 2003, Media Center, Vista and Windows 7" ... hmm I think I approve of this list ;-) 08:32:48 Oh wow, I had not seen that yet... nVidia has "Game Ready Drivers" (focusing on "support for the latest games") and "Studio Drivers" ("prioritizes stability and quality for creative workflows") 08:33:35 Anyway, 496MB download. Explain that :) 08:36:53 maybe they forgot to run `strip` 08:40:18 Are programs over 1024 bytes even necessary? 08:40:39 Just imagine the best program out of all 1024-byte programs. 08:40:48 It'd be so good. 08:40:55 I wish I had a halting oracle. 08:41:02 -!- AnotherTest has joined. 08:41:25 shachaf: yes it will halt (you won't prove me wrong) ;-) 08:42:03 But my program was "while (1);" 08:42:21 so what? 08:42:32 what's your uptime? 08:44:21 There's a second part to this... a halting oracle is not what you really want. 08:44:51 What good is a program that halts after 10^10^10^10 operations? And that's a small number in the context of computability... 08:44:57 well, i'd at least like it to halt with what it's doing to Sun 08:45:24 I don't think the program will affect the Sun much at all. :) 08:45:27 Anyway there are plenty of uses to a halting Oracle. 08:46:05 If you have one you can certainly answer the more limited kinds of question you're talking about too. 08:46:08 Sure, you could... determine the truth... of certain mathematical conjectures. 08:46:27 (it's not a proof if it involves an oracle) 08:47:15 But I imagine a halting oracle wouldn't be cheap. 08:47:26 I could probably extract bits of the shortest proof, one at a time? 08:47:45 Maybe it would work like a drug dealer though... you get one question for free. :P 08:48:09 I've asked before what you would do with a single-use halting oracle. 08:48:11 ("you" being the whole of humanity :P) 08:48:39 (Just imagine the fight we would have over which question to ask!) 08:50:38 And imagine the disappointment when we cleverly bundle everything we can think of together in a big conjunction (program that looks for counterexamples to Collatz, Goldbach, Riemann...) and the answer is that the program halts. 08:51:30 shachaf: I don't remember you asking that before. Maybe I missed it, maybe it didn't spark my interest at the time. *shrugs* 08:51:36 Minds are weird! 08:52:37 Maybe I only asked in other places. 08:53:22 I don't want a halting oracle, I want a greater recognition that there are (ideally) two classes of "programs": batch jobs that always halt, and reactive programs that never halt (until the administrator explicitly stops them.) 08:54:09 So many of the programs we use are the reactive kind, but so many of the languages we use assume you're going to write the batch kind 08:54:15 That seems irrelevant to questions about halting oracles. 08:54:30 These are programs that don't halt productively. 08:54:39 I mean, the way in which they don't halt is productive. 08:55:27 I'm in more of an engineering mood than a CS mood this morning I suppose 08:56:13 Oh, then sure. 08:56:24 How do languages assume one or the other? 08:57:05 And it's not a huge practical problem, but, teaching kids to write games in Python or whatever and you have to explain why there is "main" and an "event loop" and this is just distraction 08:57:51 A distraction from what? 08:58:18 "while (true) { get_input(); compute(); show_game(); }" seems like a pretty reasonable description of what you want the computer to do. 08:59:35 cpressey: Hmm, what about initialization? Do you want to do that in awk style, defining a special event for it? BEGIN { ... } 08:59:48 (awk and sed are kind of event based ;-) ) 08:59:59 (in a very awk-ward way, of course.) 09:00:25 @google "sedistic" 09:00:27 https://worldofwarcraft.com/en-us/character/us/hyjal/sedistic 09:00:32 maybe not 09:01:27 shachaf: A distraction from how you design and code the reactive application that is the game. 09:02:08 do people write games in erlang? 09:02:29 Are you saying something other than that there should be higher-level libraries and things for writing games? 09:02:35 int-e: I would totally believe that there are some MMP servers written in Erlang 09:02:37 (am I missing another prominent actor-based programming language?) 09:03:40 shachaf: Well, I'm talking about programming paradigms. One such is put front-and-center in most languages, but it is secondary or basically ignorable in a lot of applications. 09:05:31 while we're throwing out paradigms... am I the only one who thinks FRP is a mismatch with game programming because it's so hard to make the set of actors dynamic? 09:06:07 more precisely, exprssing event flow by arrows 09:07:20 The problem is that I formed this idea when I saw the first articles on arrow-based FRP and it stopped me from ever trying FRP myself... so it's quite possible that it's a misconception. 09:09:28 int-e: Well, all the other actor-based languages I can think of, I can't call prominent. And almost all the uses of "FRP" I hear, have only a tangential relation to the FRP you're talking about :) 09:09:30 (There's a second aspect that's holding me back there... lazy evaluation and real-time are at odds as well.) 09:10:13 int-e: a lot of proponents of FRP hold that arrow-based FRP doesn't count, for what it's worth 09:10:52 (And I have not encountered FRP outside of Haskell, which is probably entirely my own fault.) 09:11:05 It's functional because it's got functions in it, it's reactive because it reacts to events, it's programming because it's a program 09:11:11 Taneb: sounds fair 09:11:18 I conclude that Visual Basic is FRP 09:11:26 cpressey: Excel! 09:12:16 (this is just a refinement of the view that Excel is a functional programming model... it's reactive because cell updates trigger further cell updates) 09:14:05 int-e: Excel is honestly a lot closer to FRP than many JS libraries 09:14:25 cpressey: I think the weakest link here is "P". 09:14:41 (of the three letters FRP) 09:20:33 cpressey: Have you ever played with Squeak? 09:22:18 -!- john_metcalf has quit (Read error: Connection reset by peer). 09:23:10 int-e: Not really. Smalltalk never really excited me. Though I can see how it's probably a bit closer to what I'm talking about here. 09:23:11 (I tried it once... and couldn't get over the fact that you have to work within the Smalltalk VM for everything. I want my external editor...) 09:23:41 (And I want actual source code as well. Not "click on this window representing a class to add a method to it") 09:24:20 Yeah, not really a fan of languages that want to stay inside their own "hermetic" environment 09:24:28 (I tried it once but gave up because something wanted me to middle-click) 09:24:45 (at the time I was on a laptop with no middle click) 09:25:36 cpressey: Which is sad because Smalltalk per se looks kind of cool. 09:26:35 Maybe I should look at Swift. (I saw it's "Objective C minus C", so that should give us Smalltalk again :P) 09:27:16 struct Player { <-- uhm... yeah... nope. 09:28:24 ? 09:28:39 (Just peeking... and it looks a lot closer to Go than I expected from that description (tbf, the description came from Wikipedia).) 09:28:58 shachaf: "nope" as in "not Smalltalk" and also "not minus C". 09:29:15 shachaf: "struct" is a big part of C to me ;) 09:30:09 I don't think Swift is very Smaltalky. 09:30:43 I think Objective C is probably cursed. I will not go into details, unless perhaps you ply me with rum. Ahhrrr. 09:30:56 shachaf: And you're right. 09:31:48 shachaf: 'At WWDC 2014, Apple introduced a new language, Swift, which was characterized as "Objective-C without the C".' is the description I was referring to, from https://en.wikipedia.org/wiki/Objective-C#Apple_development_and_Swift 09:32:02 I once looked into Objective C. I reimplemented NSObject and things to figure out what was going on. 09:32:08 shachaf: And now that I took a closer look I totally disagree with that description. 09:32:08 In... 2012? Man. 09:32:13 Anyway it's a bizarro language. 09:32:28 Aye, Swift would of course inherit the curse. 09:33:36 shachaf: I guess they still have keyword arguments, and methods, and they dropped all the unmanaged, unsafe memory stuff. 09:34:09 'let 🐶🐮 = "dogcow"' 09:34:21 just what I always wanted... smileys as identifiers. yuck. 09:38:19 oh, perhaps shachaf would like this: if let constantName = someOptional { ... } else { ... }, corresponding to case someOptional of Just constantName -> ... | Nothing -> ... 09:39:21 It's related to the thing I want but it seems kind of worse. 09:39:56 Wait, no, I'm thinking of a different Swift feature with a similar syntax. 09:41:03 It seems like a reasonable syntax for a special case of pattern matching? Not particularly better or worse than case. 09:41:35 It seems like a way to overload the term "else" 09:42:38 Why not go all the way and overload "or" 09:42:41 "guard let" is the one I was thinking of that was kind of annoying. 09:43:45 guard let x = y { ...; return ...; } 09:43:52 Uh, guard let x = y else { ...; return ...; } 09:44:08 The else block has to have an exit statement. 09:45:02 I think it would be better if: Instead of requiring an exit, it could provide a substitute value; instead of being part of the "let" syntax, it was just an expression, as in "let x = guard y else { ... }" 09:47:47 I like && and || in Bourne shell for this. 09:48:28 The exit code is only nominally an integer; it's actually some kind of error-type value. 09:51:01 ; should really do what && does (I think there's some flag in modern shells that makes it so.) 09:53:19 oh they do the Java thing where an enum is really more of a tagged union... 09:53:57 That's a Java thing? 09:53:59 and the matching syntax for that is ugly: case .upc(let numberSystem, let manufacturer, let product, let check): 09:54:05 shachaf: I first saw it in Java 09:54:33 Java does that? 09:55:09 I thought Java made you use class inheritance to emulate tagged unions. 09:55:35 Java goes a bit beyond that. An Enum is syntax for a base class (the enum type) and subclasses for each enum element... which can carry their own data and methods. 09:55:59 No, modern Java does that for you. 09:56:43 Do you have an example? 09:56:55 No. 09:57:25 I looked it up and it didn't seem to be that way but I might've looked at the wrong thing. 09:57:27 @google java enums 09:57:28 https://www.w3schools.com/java/java_enums.asp 09:58:08 tdnh 09:58:27 yeah it didn't because it has too little detail 09:58:36 I'm sure you can find something though :P 10:00:20 I looked at a bunch of things before asking. But maybe now I've found an example of the thing you're talking about. 10:00:45 Oh well, I don't care about Java. 10:09:13 shachaf: Hmm I seem to be misremembering the details. https://docs.oracle.com/javase/specs/jls/se12/html/jls-8.html#jls-8.9.1 <-- each enum element has a class body, but I'm not sure whether that's enough to associate arbitrary additional fields to each case. I don't want to try either. The examples I've seen just associate fixed values with each case (planets with weight and size seem to be... 10:09:19 ...popular) 10:10:34 and it's amazingly hard to find the *documentation* of this feature... I had to start with "java syntax reference" because with anything more specific the search results would be swamped with useless secondary sources (tutorials, guides... well-intentioned but they barely scratch the surface) 10:10:53 ... back to Swift. 10:11:31 Why are you looking at all these languages lately? 10:11:44 Did you also come to the conclusion that all languages are terrible? 10:13:24 I've realized that I've never looked at what those languages really are. 10:13:59 I mean, "C-like managed language" is not detailed enough to criticize or embrace a language :P. 10:14:12 Did you hear about this exciting update? https://blogs.dropbox.com/tech/2019/08/the-not-so-hidden-cost-of-sharing-code-between-ios-and-android/ 10:14:24 23:30 So Dropbox's new "mobile strategy" is to write everything twice, once for each platform. 10:14:27 23:31 How did we get to the point where each platform has its own programming language that you have to use? Wasn't this the point of high-level languages in the first place? 10:15:01 shachaf: I'll thank you to stay out of my walled garden 10:15:23 This is how you computers now. 10:15:37 We allowed vendor-lockin for software (in the name of security) is how we got to this point. 10:16:36 There's really no mystery to it. Apple in particular wants this to be expensive. But I don't think Google is far behind, Microsoft has been doing the same thing on an API rather than a language level, for ages. 10:29:52 int-e: While you can have custom fields and methods on an enum constant, you can't readily *access* them, because the enum constant is of the enum type. It's a little like doing `SomeConcreteClass foo = new SomeConcreteClass() { String notSoUseful = "foo"; };`. 10:30:02 int-e: What you *can* do with them is define some abstract methods in the enum type, and then implement them in the constant: https://ideone.com/TlCjqB 10:30:41 The standard example is 8.9.3-3 in https://docs.oracle.com/javase/specs/jls/se12/html/jls-8.html#jls-8.9.3 10:32:21 int-e: Remember Microsoft J++? 10:36:06 cpressey: nope 10:37:12 Well, it's not important, the main point is, yes, this sort of thing has been going on for ages 10:37:37 cpressey: But I do remember C# of course. 10:38:02 -!- zombocoder has joined. 10:39:03 I remember Java 10:39:46 Do you remember ALGOL 68? 10:40:20 cpressey: As I recall it, Java was meant to be platform-independent, so it's in a different category :P 10:40:37 Of course now it's meant to be a money-maker for Oracle. 10:43:23 Do you like Buffon's needle? 10:43:29 Anyway, done with Swift for now. Things that stood out are enums, properties, and extensions. 10:43:40 shachaf: only once it's bent into a circle 10:43:54 I only like it when it's bent into the word "this". 10:44:18 `? this 10:44:19 This is something people on the channel like to talk about. We're often unsure what this is, though. 10:44:54 `learnappend this// Nobody likes this. 10:44:54 ​/srv/hackeso-code/multibot_cmds/lib/limits: line 5: exec: learnappend: not found 10:45:03 Do you like 𝓉𝒽𝒾𝓈? 10:45:10 `learn-append this// Nobody likes this. 10:45:10 ​/srv/hackeso-code/multibot_cmds/lib/limits: line 5: exec: learn-append: not found 10:45:14 meh. 10:45:36 `url bin 10:45:37 https://hack.esolangs.org/repo/file/tip/bin 10:46:21 `learn_append this Nobody likes this. 10:46:24 Can't open wisdom/thi: No such file or directory. \ Learned 'thi': Nobody likes this. 10:46:30 Wow. 10:46:37 `revert 10:46:38 Done. 10:46:45 That's pretty bad. 10:46:50 i recommend le/rn_append hth 10:47:43 `le/rn_append this//Nobody likes this. 10:47:45 Learned 'this': This is something people on the channel like to talk about. We're often unsure what this is, though. Nobody likes this. 10:47:57 `? nobody 10:47:59 Nobody killed the cyclops Polyphemos after he tried to eat a shipful of sailors, and this perceived injustice made Poseidon so mad he swore vengeance at him and the gods couldn't calm him down for ten years. 10:48:14 sounds like a b_jonas entry 10:48:19 Speaking of the cross-platform mobile thing, heard a lot about Flutter again while visiting MTV. I think I'd give it a go if someone forced me (or a tiny team) to build something on "both platforms" (...) with identical features. 10:48:20 `cwlprits nobody 10:48:22 That sounds like something I'd have written 6 years ago 10:48:22 oerjän b_jonäs 10:48:41 `hwrl nobody 10:48:42 https://hack.esolangs.org/repo/log/tip/wisdom/nobody 10:49:47 fizzie: Both platforms: iOS *and* Mac OS. 10:50:24 fizzie: I think the solution will be to write my own UI library. 10:50:59 `mkx learn_append//echo "Usage: le/rn_append keyword//Text you'd like to append." 10:51:00 learn_append 10:51:08 `learn_append 10:51:09 Can't do inplace edit: wisdom/ is not a regular file. \ /hackenv/bin/learn_append: line 5: wisdom/: Is a directory \ Learned '': cat: wisdom/: Is a directory 10:51:18 oh 10:51:25 ``mv learn_append bin 10:51:25 ​/srv/hackeso-code/multibot_cmds/lib/limits: line 5: exec: `mv: not found 10:51:31 `` mv learn_append bin 10:51:32 No output. 10:51:38 `learn_append 10:51:38 Usage: le/rn_append keyword//Text you'd like to append. 10:51:55 Unfortunately this wouldn't have helped with your first two attempts. 10:52:03 I'm not very good at this. 10:52:30 `` ls -l le 10:52:31 total 4 \ lrwxrwxrwx 1 1000 1000 13 Jul 8 2017 rm -> ../bin/forget \ lrwxrwxrwx 1 1000 1000 17 Jul 8 2017 rn -> ../bin/slashlearn \ -rwxr-xr-x 1 1000 1000 225 Apr 7 2018 rn_append 10:52:42 shachaf: Yeah but those didn't end up in the repository history so I regard them as harmless. 10:53:37 seriously? le/rm ? 10:53:45 `doag le/rm 10:53:47 9046:2016-09-16 ` ln -sf ../bin/forget le/rm \ 9044:2016-09-16 mkx le/rm//rm "wisdom/$1" 10:53:50 Figures. 10:54:54 `? what 10:54:55 what? ¯\(°​_o)/¯ 10:55:12 `? sorry 10:55:13 sorry? ¯\(°​_o)/¯ 10:55:17 `? hug 10:55:18 hug? ¯\_/¯\(°​_o)/¯\_/¯ 10:56:37 `? wisdom 10:56:38 wisdom is always factually accurate, except for this entry, and, uh, that other one? It started with, like, an ø? 10:57:30 OK, I'm going to sleep. 10:59:22 -!- zombocoder has quit (Ping timeout: 246 seconds). 11:09:40 [[User:CrispyPin]] N https://esolangs.org/w/index.php?oldid=65502 * CrispyPin * (+123) Created page with "In the beginning the Universe was created. This has made a lot of people very angry and been widely regarded as a bad move." 11:11:53 -!- zombocoder has joined. 11:25:59 -!- zombocoder has quit (Read error: Connection reset by peer). 11:29:53 [[Talk:Rail]] https://esolangs.org/w/index.php?diff=65503&oldid=39735 * CrispyPin * (+338) 11:33:08 -!- limbo_ has quit (Quit: Lost terminal). 11:49:10 -!- zombocoder has joined. 11:55:38 -!- tromp has quit (Read error: Connection reset by peer). 11:58:31 -!- wob_jonas has joined. 11:58:48 -!- tromp has joined. 12:01:24 ais523: yes, I guess if you measure it accurately enough, then 2017-01-01 was a long weekend too because of the leap second 12:06:41 cpressey: yeah, raising an exception for floating point division by zero by default is a stupid decision that some languages including python and perl do for legacy reasons 12:06:57 and the workarounds to do a floating point division without raising an exception aren't even simple there 12:07:52 ``` python3 -cx=0.0;print(3.0/x) 12:07:52 bash: -c: line 0: syntax error near unexpected token `3.0/x' \ bash: -c: line 0: `python3 -cx=0.0;print(3.0/x)' 12:08:01 ``` python3 -c'x=0.0;print(3.0/x)' 12:08:07 Traceback (most recent call last): \ File "", line 1, in \ ZeroDivisionError: float division by zero 12:08:23 ``` python3 -c'import numpy; x=numpy.float64(0.0); print(3.0/x)' 12:08:25 ​-c:1: RuntimeWarning: divide by zero encountered in double_scalars \ inf 12:09:45 it's like two more lines of code to ingore that warning 12:10:20 oh, and 12:11:24 ``` python3 -c'a = dict(); x = a["foo"]' # raising an exception when looking up a key in a dictionary and it's not found, that I can understand 12:11:24 Traceback (most recent call last): \ File "", line 1, in \ KeyError: 'foo' 12:12:01 ``` python3 -c'a = dict(); del a["foo"]' # but python's dict is the only dictionary that's pedantic enough to raise an exception when a key is not found when you're trying to remove it 12:12:05 Traceback (most recent call last): \ File "", line 1, in \ KeyError: 'foo' 12:12:27 ``` python3 -c'a = dict(); a["foo"] = "bar"; x = a["foo"]; del a["foo"]' 12:12:28 No output. 12:15:47 " it's a shady industry" => groan 12:25:49 [[Osis]] N https://esolangs.org/w/index.php?oldid=65504 * A * (+1695) Created page with "[[Osis]] is a stack-based language specialized in sequences. Not only as in the commands, but also as in how it calculates the sequences. With smart memory usage and memoriz..." 12:26:26 [[Osis]] M https://esolangs.org/w/index.php?diff=65505&oldid=65504 * A * (+94) 12:26:39 [[Osis]] https://esolangs.org/w/index.php?diff=65506&oldid=65505 * A * (+9) 12:30:16 [[Trance]] N https://esolangs.org/w/index.php?oldid=65507 * A * (+416) Created page with "[[Trance]] is a useless language that only has replacement commands. ==Syntax==
 1: Replace all inputted 0's to 1's. 0: Replace all inputted 1's to 0's. 
==Computat..." 12:33:59 " ; should really do what && does (I think there's some flag in modern shells that makes it so.)" => set -e; I use it in HackEso one-liners all the time, and it's not particularly modern 12:34:19 ``` set -e; echo one; true; echo two; false; echo three; echo four 12:34:20 one \ two 12:35:07 automatically exit when a command fails, unless it's syntactically in such a position that cares about whether it succeeds (it's not really the semicolon that's special 12:35:09 ) 12:37:41 ohh, TIL about set -e 12:37:45 that's good to know 12:39:48 " int-e: While you can have custom fields and methods on an enum constant, you can't readily *access* them," => yeah, java has learnt the good practices of data hiding from HQ9+ 12:40:00 and encapsulation 12:40:24 s/9[+]/9++/ 13:02:43 -!- xkapastel has joined. 13:06:46 int-e: Uh oh. I got around to testing your Wagon implementation on the test cases in my document and there are... discrepancies. 13:08:14 mm 13:08:32 I tested a few, but I didn't test them all. 13:08:41 int-e: https://gist.github.com/cpressey/9969c27e7a877af15bf81665c96c815f 13:12:52 Oh did I get the order of the subtraction arguments wrong... 13:14:25 yeah I did 13:17:10 That's annoying; it makes negating the top of the stack quite a bit harder. 13:17:36 [[Osis]] M https://esolangs.org/w/index.php?diff=65508&oldid=65506 * A * (-86) 13:17:38 isn't there some way to just rearrange elements near the top? 13:17:59 yes there is but it involves using 'r' a lot. 13:18:05 [[Osis]] M https://esolangs.org/w/index.php?diff=65509&oldid=65508 * A * (+0) /* Command reference */ 13:19:35 [[Osis]] M https://esolangs.org/w/index.php?diff=65510&oldid=65509 * A * (+63) /* Command reference */ 13:19:49 [[Osis]] M https://esolangs.org/w/index.php?diff=65511&oldid=65510 * A * (+0) /* Powers of 2 */ 13:20:54 cpressey: so if you change opS to opS (a : b : ss) = b-a : ss does that fix it? 13:22:06 [[Osis]] M https://esolangs.org/w/index.php?diff=65512&oldid=65511 * A * (-12) 13:24:54 int-e: yes, it does. 13:25:35 [[Osis]] M https://esolangs.org/w/index.php?diff=65513&oldid=65512 * A * (+9) /* Command reference */ 13:25:58 not sure to what extent this affects the fromTag compiler 13:26:13 the helper functions look easy to fix 13:27:17 and there is just one s in the main body of it, from what I can see 13:27:53 I was wondering at some point whether I should add x/X for swap ("eXchange") 13:29:29 [[Osis]] M https://esolangs.org/w/index.php?diff=65514&oldid=65513 * A * (-1) /* Powers of 2 */ 13:30:53 -!- zombocoder has quit (Ping timeout: 245 seconds). 13:31:29 Yeah I'm fixing this... it'll just generate quite a bit more code 13:31:44 "iriisririiisissr" swaps the top two elements of the stack 13:32:06 Oh good 13:32:29 [[Osis]] M https://esolangs.org/w/index.php?diff=65515&oldid=65514 * A * (-26) 13:32:29 or, readable: 1r 0r 1r 2r 13:32:46 Ah ha right, there's another small thing 13:32:48 (where the numbers correspond to pushing that number on the stack) 13:32:56 The doc says the argument to r must be 0 or 1 13:33:09 uhm 13:33:20 I did this because I was too lazy to specify what order the retained elements are pushed back onto the stack 13:33:49 so 2r is technically undefined behaviour 13:34:05 that *will* be annoying. 13:34:25 but let me fix the subtraction thing first. 13:35:10 (I didn't think about that... to me it seemed obvious that the retained elements should just stay where they are) 13:36:41 [[Osis]] M https://esolangs.org/w/index.php?diff=65516&oldid=65515 * A * (+35) 13:36:52 Okay, the subtraction issue is resolved. Now let me think about whether I can reasonably deal with the 'r' thing... 13:38:18 [[Osis]] M https://esolangs.org/w/index.php?diff=65517&oldid=65516 * A * (+34) /* Period [1,2] */ 13:38:32 [[Osis]] M https://esolangs.org/w/index.php?diff=65518&oldid=65517 * A * (+11) /* Command reference */ 13:40:23 You should put a page on the wiki about this Wagon thing, pointing to where it's defined and the implementation and other info 13:48:30 cpressey: Nah, the 'r' thing messes up everything for me. With only 0 and one, you cannot change the adjacency relations of elements on the stack (viewed as a ring with the last element linked to the first). 13:49:38 so all data movement has to happen through arithmetic... which may be possible, but it's bound to be much harder than what I've been doing. 13:50:48 -!- zombocoder has joined. 13:52:12 I should have been clearer and/or done a more proper release. I'm sorry. 13:53:52 ah you can do the in-place swap a = a-b; b = b+a; a = -a-b; 13:54:42 cpressey: nah, no release is completely normal. these things tend to just escape without a release. 13:58:19 [[Wagon]] N https://esolangs.org/w/index.php?oldid=65519 * B jonas * (+433) Created page with "Wagon is a stack-based language created by cpressey in 2019. It's advertised as a "second-order concatenative language". It uses a stack of unbounded size integers and a sma..." 14:07:47 so in a wagon program, all the while loops are nested, like as an ordinary program they would look like *[*[*[...*[*[*]*]*...]*]*]* where the brackets are while loops and each star can be any sequence of ordinary non-looping instructions that act on the stack? 14:08:11 so you can't have two loops that aren't nested but are next to each other, like *[*]*[*]* 14:08:41 [[Language list]] https://esolangs.org/w/index.php?diff=65520&oldid=65467 * B jonas * (+12) 14:10:20 cpressey: Oh well, I think I can make this work, but wow is it tedious ;) 14:23:31 [[Wagon]] https://esolangs.org/w/index.php?diff=65521&oldid=65519 * B jonas * (+64) 14:25:56 cpressey: for example, diriisririisrirsirdiisriririisrirsirdiriisriisiriisrirsirsiisrir swaps the top two elements of the stack 14:26:42 (without using 2r) 14:27:32 scary 14:27:46 so is this why you were talking about super-optimizers? 14:27:53 to find shorter wagon instruction sequences? 14:29:22 no, definitely not 14:29:29 that was just a general SMT discussion 14:35:25 wob_jonas: your statements about *[*[...]*]* and *[*]*[*]* are correct 14:36:30 cpressey: ok, I think that qualifies this as an esolang 14:41:46 cpressey: so instead of 1586 characters, I now have 22826 characters... 14:42:07 ouch 14:42:41 cpressey: but it works again, and never uses r with arguments other than 0 and 1: http://paste.debian.net/1095871/ 14:44:14 (I even got the basic logic to work again, which I was a bit skeptical about at first) 14:47:07 (with a builtin swap it would be 4430 characters; there are 292 swaps in that code now.) 14:47:21 Olé, Olé, Olé! 14:47:52 But who cares... I'm sure this can be optimized quite a bit. 14:56:10 I'll try to put out a more proper release tomorrow. 14:56:17 -!- cpressey has quit (Quit: A la prochaine.). 14:56:55 http://paste.debian.net/1095873/ is a bit better, 15378 characters 15:00:19 -!- zombocoder has quit (Ping timeout: 248 seconds). 15:04:09 -!- zombocoder has joined. 15:04:21 [[Talk:Wagon]] N https://esolangs.org/w/index.php?oldid=65522 * Int-e * (+257) Put link here for future reference. 15:12:19 -!- zombocoder has quit (Read error: Connection reset by peer). 15:18:21 -!- Sgeo_ has joined. 15:21:39 -!- Sgeo has quit (Ping timeout: 248 seconds). 15:29:07 -!- zombocoder has joined. 15:38:51 -!- wob_jonas has quit (Remote host closed the connection). 15:57:17 -!- onon has joined. 16:36:48 -!- Bowserinator has quit (Read error: Connection reset by peer). 16:37:24 -!- probablymoony has joined. 16:38:18 -!- Bowserinator has joined. 16:39:13 -!- moony has quit (Ping timeout: 246 seconds). 17:03:37 -!- FreeFull has joined. 17:08:34 -!- b_jonas has joined. 17:12:02 -!- xkapastel has quit (Quit: Connection closed for inactivity). 17:37:37 -!- sleepnap has joined. 17:40:03 -!- AnotherTest has quit (Quit: ZNC - http://znc.in). 17:40:13 -!- AnotherTest has joined. 17:44:07 -!- AnotherTest has quit (Read error: Connection reset by peer). 17:44:09 -!- AnotherTest_ has joined. 17:44:33 -!- AnotherTest_ has changed nick to AnotherTest. 17:47:07 -!- Phantom_Hoover has joined. 17:47:28 -!- unlimiter has joined. 17:50:50 -!- unlimiter has quit (Client Quit). 18:02:21 -!- unlimiter has joined. 18:11:48 -!- tromp_ has joined. 18:14:09 -!- tromp has quit (Ping timeout: 252 seconds). 18:29:30 -!- zombocoder has quit (Read error: Connection reset by peer). 18:43:24 -!- unlimiter has quit (Quit: thank you all). 19:02:59 -!- jix has quit (Ping timeout: 248 seconds). 19:06:13 -!- Phantom_Hoover has quit (Ping timeout: 246 seconds). 19:07:15 -!- AnotherTest has quit (Ping timeout: 248 seconds). 19:09:51 -!- jix has joined. 19:12:12 -!- AnotherTest has joined. 19:18:23 -!- AnotherTest has quit (Ping timeout: 245 seconds). 19:21:50 -!- sleepnap has quit (Quit: Leaving.). 19:29:51 -!- AnotherTest has joined. 19:30:02 -!- diverger has quit (Ping timeout: 245 seconds). 19:38:50 -!- Phantom_Hoover has joined. 19:56:03 [[Deadfish]] https://esolangs.org/w/index.php?diff=65523&oldid=65490 * Salpynx * (+1) Undo revision 65490 by [[Special:Contributions/Dtuser1337|Dtuser1337]] ([[User talk:Dtuser1337|talk]]) Deadfish resets to 0 only at exactly 256, it's a required 'bug' 19:57:22 -!- Phantom_Hoover has quit (Read error: Connection reset by peer). 19:57:49 -!- Phantom_Hoover has joined. 19:58:23 `ysaclist 19:58:24 ysaclist: boily shachaf 19:58:32 https://www.youtube.com/watch?v=q3Mc0ChHhlk 19:59:06 Cale: You YSAC? 19:59:11 You're not on the list! 19:59:25 I get notified by YouTube about it 20:00:08 You gotta like, subscribe, click the little bell, and let us know what you think in the comments below. 20:02:00 It's kind of obnoxious how every channel has to ask people to click the bell because the assumption is that they don't know how to use YouTube's UI 20:03:17 I don't think that's the assumption. 20:03:28 The assumption is only that if you tell people to do it, they'll do it more than if you don't. 20:04:52 Well, sure, but the problem that caused this is that YouTube's "Home" page doesn't show every video from your subscriptions, and instead shows a bunch of random crap instead. You have to go to "Subscriptions" if you want to see all the videos from the channels you're subscribed to. 20:05:23 The problem is that YouTube hates you and wants you to suffer. 20:05:26 But at least if you have the notification bell clicked, you'll get a notification, and I'm not sure but maybe it helps those videos appear on "Home" as well. 20:05:42 Or rather they don't care about you and want to extract the maximum possible engagement out of you. 20:08:50 shachaf: click on the thumbs up too. if we get four thousand thumbs up on this video, we'll do a special one next week. 20:09:24 👍 20:19:05 -!- Lord_of_Life_ has joined. 20:22:08 -!- Lord_of_Life has quit (Ping timeout: 245 seconds). 20:22:09 -!- Lord_of_Life_ has changed nick to Lord_of_Life. 20:23:16 `unidecode 👍 20:23:17 ​[U+1F44D THUMBS UP SIGN] 20:23:21 of course. 20:23:39 int-e: Are you awake at all times? 20:24:01 I've been awake at all times modulo 24, I think. 20:24:15 (24h that is) 20:32:37 -!- divergence has joined. 21:11:06 -!- sleepnap has joined. 21:16:11 -!- xkapastel has joined. 21:18:47 -!- AnotherTest has quit (Ping timeout: 245 seconds). 21:27:36 -!- unlimiter has joined. 21:34:18 -!- tromp_ has quit (Remote host closed the connection). 21:34:21 -!- adu has joined. 21:38:45 -!- unlimiter has quit (Quit: WeeChat 2.5). 21:53:52 -!- tromp has joined. 21:58:11 -!- tromp has quit (Ping timeout: 252 seconds). 22:00:15 -!- adu has quit (Quit: adu). 22:04:36 -!- b_jonas has quit (Quit: leaving). 22:12:49 [[Black]] M https://esolangs.org/w/index.php?diff=65524&oldid=55554 * ZM * (+4) /* Golly */ Wright's GitHub profile changed 22:18:15 -!- zombocoder has joined. 22:27:43 -!- sleepnap has quit (Quit: Leaving.). 22:32:01 -!- Phantom_Hoover has quit (Quit: Leaving). 22:42:35 -!- sleepnap has joined. 23:07:14 -!- unlimiter has joined. 23:10:03 -!- zombocoder has quit (Ping timeout: 245 seconds). 23:16:40 -!- sleepnap has left. 23:17:32 -!- catern has joined. 23:18:38 -!- FreeFull has quit. 23:19:29 -!- unlimiter has quit (Quit: WeeChat 2.5). 23:28:26 -!- Hooloovo0 has quit (Quit: Temporarily refracted into a free-standing prism.). 23:29:32 -!- unlimiter has joined. 23:31:45 -!- Hooloovo0 has joined. 23:33:09 -!- unlimiter has quit (Client Quit). 23:39:36 -!- tromp has joined. 23:44:03 -!- tromp has quit (Ping timeout: 248 seconds). 2019-08-16: 00:15:52 -!- zzo38 has joined. 00:33:43 -!- oerjan has joined. 00:34:09 -!- tromp has joined. 00:38:25 -!- tromp has quit (Ping timeout: 252 seconds). 00:40:20 -!- tromp has joined. 00:44:37 -!- tromp has quit (Ping timeout: 245 seconds). 01:38:48 -!- Sgeo__ has joined. 01:41:43 -!- Sgeo_ has quit (Ping timeout: 246 seconds). 01:55:34 -!- probablymoony has changed nick to moony. 02:25:06 https://rabbitboots.com/kfx/index.php/ZZT_On_ZZT#Undocumented_features Now I noticed they mentioned you can push | to access the cheat prompt on the title screen in ZZT. I did not know that, but now I know. 02:37:30 -!- Sgeo__ has quit (Read error: Connection reset by peer). 02:43:39 -!- Sgeo has joined. 03:12:02 -!- xkapastel has quit (Quit: Connection closed for inactivity). 05:22:11 -!- oerjan has quit (Quit: Nite). 06:25:56 -!- tromp has joined. 06:28:38 -!- tromp_ has joined. 06:29:35 -!- tromp has quit (Read error: Connection reset by peer). 06:54:12 -!- Sgeo has quit (Ping timeout: 245 seconds). 07:03:18 -!- tromp_ has quit (Remote host closed the connection). 07:10:11 -!- tromp has joined. 07:11:36 -!- tromp_ has joined. 07:14:25 -!- tromp has quit (Ping timeout: 252 seconds). 07:15:53 -!- tromp_ has quit (Ping timeout: 252 seconds). 07:21:47 -!- tromp has joined. 07:27:31 [[Special:Log/newusers]] create * Messersm * New user account 07:34:55 [[Esolang:Introduce yourself]] https://esolangs.org/w/index.php?diff=65525&oldid=65480 * Messersm * (+218) /* Introductions */ 08:04:15 -!- AnotherTest has joined. 08:20:53 -!- Lord_of_Life has quit (Ping timeout: 245 seconds). 08:23:54 -!- Lord_of_Life has joined. 09:01:25 -!- Sgeo has joined. 10:17:53 whoa, it's unknown whether the Post Correspondence problem is decidable with 3 or 4 tiles. 10:26:03 -!- cpressey has joined. 10:32:40 IOCCC winners are denounced; IOCCC switches are debounced 10:35:13 So I have this vanilla term-rewriting language, and a program that can, given a set of rules, check if a given sequence of rewrites is valid or not. 10:35:58 I'm trying to find the shortest distance between this program, and a program that can check if a proof written in propositional logic is valid or not. 10:37:20 You don't need much to turn the one into the other, but you do need a few things, and I want a clear idea of what they are. 10:37:44 First-order logic would be the next step beyond that. 10:39:59 Oh! For anyone who hasn't seen it, this is definitely worth checking out: http://incredible.pm/ 10:40:20 cpressey: so I made a faster Wagon interpreter: https://gist.github.com/int-e/e4ae1f40f8173d67860d8f8e45c433c0#file-ring-hs 10:42:06 [[Talk:Wagon]] M https://esolangs.org/w/index.php?diff=65526&oldid=65522 * Int-e * (+42) /* Computational Class */ --> link 10:42:39 cpressey: that's pretty neat 10:50:42 -!- zombocoder has joined. 11:09:19 int-e: your implementations make mine look like chicken-scratches. I'll try to make and release a Wagon distribution today. But I have to rewrite the part about computational class first. 11:24:03 -!- AnotherTest has quit (Ping timeout: 264 seconds). 11:27:28 -!- divergence has quit (Read error: Connection reset by peer). 11:28:19 -!- zombocoder has quit (Ping timeout: 246 seconds). 11:28:40 Hmm, should I have a look at the cargo cult? 11:29:16 (I mean Rust: https://doc.rust-lang.org/book/ch02-00-guessing-game-tutorial.html) 11:29:23 -!- diverger has joined. 11:44:11 https://github.com/catseye/Wagon 11:45:23 I had some thoughts about how you might simulate a TM more directly in a Wagon-like language. Basically you could say something like: 11:47:10 while(!halt) { write(0,0,0); if(s>1) { if(s>2) { if(s>3) { xor(1,0,1) } xor(0,1,1) } xor(1,1,1) } use() } 11:47:36 where use() takes what's been written by write() and modified by xor() and applies it to the tape 11:48:27 sure, we can do something like that. 11:48:52 use() still represents "a little control" perhaps 11:52:36 <3 runhugs 11:54:06 cpressey: If you look closely at Tag.hs, I have enough building blocks for boolean circuits plus an extensible circular tape. 11:55:43 cpressey: I guess the real challenge with your suggestion is to deal with the variable movement of the TM's head. 11:56:40 [[Wagon]] https://esolangs.org/w/index.php?diff=65527&oldid=65521 * B jonas * (+62) link to the new int-erpreter 11:57:35 int-e: yeah, I was thinking, if you had a slightly different memory model, and an instruction "pop N and add N to position of tape head" - otherwise you need a loop 11:57:52 or an if 11:58:11 b/c you only *need* to handle -1 and 1 11:58:59 cpressey: I believe you /can/ have a variadic shift by invoking "r" with a flag that indicates whether to move or not, often enough. 11:59:17 oh good grief. yes, possibly you can 11:59:44 r is disappointingly powerful, even with only 0 or 1 12:00:01 But it's tricky to get right. (I was happy when I had my new 'landn' operation and that only has two "variable" r operations, the second one undoing the effect of the first.) 12:00:27 -!- zombocoder has joined. 12:02:03 cpressey: so it may be powerful, but it's really awkward to use. 12:07:59 cpressey: And as mentioned yesterday, the restriction to 0 and 1 gutted it to the point where it cannot be used to permute elements on the stack anymore. 12:08:29 Well, that's good! For some value of "good". 12:10:42 re hugs, cpressey == luddite, I have not actually tested it on hugs, but it's in the "standard Haskell-running script" that I've sort of arrived at 12:11:04 https://github.com/catseye/Wagon/blob/master/bin/wagon 12:11:08 cpressey: yeah that's what I thought :) 12:11:27 It makes me happy that I can build Hugs on NetBSD, etc 12:11:28 because I honestly can't remember when I last used hugs. 12:12:09 But I suspect it has been over a decade. 12:13:44 Ha, running Wagon's test suite on Hugs is actually faster than running it with ghci. 12:14:31 2.8 seconds versus 6.2 seconds 12:15:08 0.18 seconds if you compile it with ghc first 12:16:37 I can forgive the ghc team for not making reducing ghci startup time their #1 priority, though. 12:17:06 I can't ;) 12:17:46 (This is /the/ bottleneck for lambdabot's Haskell evaluation. Which is obviously the most important use case in the world.) 12:18:38 It's not ghci exactly; it's mueval, which uses hint, which uses the ghc API in a way similar to, but not quite the same as, ghci does. 12:19:38 This is a terrible idea, but could you not run a sort of "language server daemon" in the backrgound that... yeah 12:20:16 Split lambdabot into a set of microservices 12:21:03 cpressey: I'm worried about trading timeouts for a memory leak. 12:21:54 (ghci is bad at releasing memory... so a I imagine a long-running haskell evaluation server would inherit that property) 12:23:04 -!- wob_jonas has joined. 12:25:08 cpressey: So I have a crazy idea that would involve starting a ghc API session, loading the most important packages, then suspend the RTS, and then fork the process, and proceed with the actual evaluation. But I'm scared of investigating it in detail (the RTS is multi-threaded, and uses pipes internally, and who knows what else) 12:27:00 it could be two-graded, using hugs by default, but if evaluation takes long, switch to compiling with ghc 12:27:11 would lead to funny unexplainable inconsistencies in behavior 12:30:46 s/funny/interesting/ is about as far as I'm willing to go 12:31:04 (in the "interesting times" sense of course) 12:47:02 #ghc points out that there's a forkProcess operation that does a lot of this work; it may just be enough. 13:08:38 [[Wagon]] https://esolangs.org/w/index.php?diff=65528&oldid=65527 * Chris Pressey * (+383) Make the article a little less stub-like. 13:12:56 [[Wagon]] M https://esolangs.org/w/index.php?diff=65529&oldid=65528 * Chris Pressey * (+0) Category name does not contain a hyphen 13:30:25 -!- xkapastel has joined. 13:45:53 -!- zombocoder has quit (Ping timeout: 245 seconds). 13:50:46 . o O ( stubby ) 13:58:43 -!- zombocoder has joined. 14:03:42 . o O ( gRPC ) 14:39:05 -!- cpressey has quit (Quit: A la prochaine.). 14:39:31 -!- zombocoder has quit (Ping timeout: 248 seconds). 14:43:42 -!- atslash has quit (Quit: This computer has gone to sleep). 14:45:53 -!- zombocoder has joined. 14:58:05 -!- atslash has joined. 15:02:32 -!- atslash has quit (Ping timeout: 244 seconds). 15:15:52 -!- heroux has quit (Ping timeout: 268 seconds). 15:16:01 -!- heroux has joined. 15:38:16 -!- sleepnap has joined. 15:47:13 cpressey: I wrote a document for using Glk with Funge-98. 15:48:08 The registry doesn't work (as it says, it is obsolete), so, I will ask here instead. 15:49:16 Also, I think that there should be a handprint value defined for unregistered interpreters. 15:53:33 fungot: What do you think? Presumably you have many opinions regarding Funge-98. 15:53:33 fizzie: on the other hand; i'm probably goign to use it is me, by the way, 15:53:59 -!- fungot` has changed nick to fungot. 15:59:12 [[Brainfuck implementations]] M https://esolangs.org/w/index.php?diff=65530&oldid=64583 * Erwijet * (+261) Added erwijet's flexable brainf.net library 15:59:55 -!- zombocoder has quit (Ping timeout: 246 seconds). 16:00:36 -!- wob_jonas has quit (Remote host closed the connection). 16:12:20 -!- Sgeo_ has joined. 16:14:59 -!- Sgeo has quit (Ping timeout: 248 seconds). 16:43:48 -!- Sgeo_ has quit (Ping timeout: 244 seconds). 17:16:34 -!- xkapastel has quit (Quit: Connection closed for inactivity). 17:36:26 -!- zombocoder has joined. 17:43:06 -!- b_jonas has joined. 17:57:09 -!- zombocoder has quit (Read error: Connection reset by peer). 17:57:10 -!- ais523 has joined. 17:58:07 -!- zombocoder has joined. 18:00:25 what genre of music does my hon. and learned friend fungot listen to? 18:00:25 b_jonas: i just want to use local packages, specify file urls. if you want 18:00:48 fungot: ok, show me 18:00:48 b_jonas: looking at it. relative to s48 that's exactly what i said doesn't make any sense 18:01:26 [[Loose Circular Brainfuck]] N https://esolangs.org/w/index.php?oldid=65531 * Ais523 * (+45) redir 18:04:06 [[Talk:Wagon]] https://esolangs.org/w/index.php?diff=65532&oldid=65526 * Ais523 * (+522) alterrnative Turing-completeness proof: you can implement two-bracket brainfuck 18:26:49 -!- Phantom_Hoover has joined. 18:28:01 -!- FreeFull has joined. 18:39:58 -!- tromp has quit (Remote host closed the connection). 18:40:30 -!- AnotherTest has joined. 18:41:59 -!- xkapastel has joined. 19:12:19 -!- ais523 has quit (Quit: quit). 19:17:27 -!- tromp has joined. 19:22:15 -!- tromp has quit (Ping timeout: 264 seconds). 19:34:04 -!- zombocoder has quit (Ping timeout: 272 seconds). 19:42:33 -!- lldd_ has joined. 19:47:42 -!- adu has joined. 20:05:22 -!- tromp has joined. 20:23:28 -!- Lord_of_Life has quit (Ping timeout: 272 seconds). 20:24:00 -!- Lord_of_Life has joined. 20:32:27 -!- AnotherTest has quit (Ping timeout: 264 seconds). 20:45:35 -!- lldd_ has quit (Quit: Leaving). 21:25:44 How to make Ghostscript to not wait until the window is exposed before it will work? 21:42:51 -!- xkapastel has quit (Quit: Connection closed for inactivity). 21:48:43 -!- sleepnap has quit (Quit: Leaving.). 21:52:04 -!- sleepnap has joined. 21:53:03 -!- sleepnap has quit (Client Quit). 23:08:37 -!- b_jonas has quit (Remote host closed the connection). 23:32:07 -!- Phantom_Hoover has quit (Ping timeout: 245 seconds). 2019-08-17: 00:32:55 I figured out how. If it is written: gs -dNODISPLAY Then it won't print any pages at all, but other stuff still works. 00:37:54 -!- Sgeo has joined. 00:39:11 -!- Sgeo_ has joined. 00:39:54 shachaf, ALGOL 68 or Zig? 00:40:58 I agree. 00:42:28 -!- Sgeo has quit (Ping timeout: 246 seconds). 01:06:30 -!- FreeFull has quit. 01:10:58 -!- tromp has quit (Read error: Connection reset by peer). 01:50:26 > 6 01:50:28 6 01:52:36 So did I mention that I've implemented a programming language? So far, the only thing you can do in it is define uninhabited types. 02:07:43 What programming language is that? 02:08:40 Do you think the idea of a "block of code" as a semi-first-class thing that exists at compile-time makes sense? 02:08:47 Or even a parameterized block. 02:10:30 zzo38: It's one I'm inventing. 02:11:25 I'm calling it Hylisk. 02:14:43 OK 02:15:05 shachaf: I think it can. 02:16:25 Do you know what it'd be like? 02:17:38 It might depend the programming language, I think. 02:18:01 Yes. If I invent a programming language, what would it be like? 02:20:56 I don't know 02:21:28 I think this is like a kind of hygienic macro, maybe. 02:21:43 I guess I should read about hygienic macro systems. 02:22:08 Yes, I also thought so, it is like that (although used in a specific kind of context, if the programming language has more than one kind of context). 02:22:50 I want things like block labels (used for early exit) to be semi-first-class, passable at compiletime. 02:22:58 Do you know of a language that does things like that? 02:23:20 No, I don't know. 02:23:47 Do you like this? 02:24:05 I don't know. 02:29:00 The document for PostScript says the limit for strings is 65535, but Ghostscript documentation says 16777216, but, I tried it and it doesn't seems to accept strings longer than 65535. 02:30:00 Did they change it some version that I don't have? 02:36:37 I don't know. 03:51:31 [[User talk:A]] M https://esolangs.org/w/index.php?diff=65533&oldid=65500 * A * (+1351) /* Re: Your Comment On My Github Pull Request */ 04:02:30 -!- kolontaev has joined. 04:03:22 I'm wondering: does SETI@home uses Fast Fourier Transform to find repeating signals, as simple as this? 04:30:54 -!- arseniiv has joined. 05:36:55 -!- tromp has joined. 05:40:17 -!- Sgeo has joined. 05:41:27 -!- tromp has quit (Ping timeout: 264 seconds). 05:43:12 -!- Sgeo_ has quit (Ping timeout: 258 seconds). 05:53:09 -!- galenasphaug has joined. 05:55:51 Now I wrote the program in Farbfeld Utilities to read a PostScript file. (It just uses the Ghostscript Interpreter API, and then converts the data to farbfeld.) 05:56:37 -!- galenasphaug has quit (Quit: galenasphaug). 05:58:02 -!- clownfishman has joined. 06:00:07 -!- sleepnap has joined. 06:01:34 -!- sleepnap has left. 06:03:18 -!- clownfishman has quit (Quit: clownfishman). 06:04:47 -!- clownfishhuman has joined. 06:05:01 -!- clownfishhuman has quit (Remote host closed the connection). 06:06:28 -!- clownfishhuman has joined. 06:13:23 -!- clownfishhuman has quit (Read error: Connection reset by peer). 06:17:13 -!- clownfishhuman has joined. 06:17:25 -!- clownfishhuman has quit (Remote host closed the connection). 06:19:31 -!- clownfishhuman has joined. 06:20:23 -!- rain2 has quit (Ping timeout: 258 seconds). 06:24:17 -!- clownfishhuman has left ("Good Bye"). 06:29:16 -!- rain1 has joined. 07:24:24 -!- Vorpal has joined. 07:24:59 -!- tromp has joined. 07:29:21 -!- tromp has quit (Ping timeout: 252 seconds). 07:58:05 -!- tromp has joined. 08:23:37 -!- Lord_of_Life has quit (Ping timeout: 244 seconds). 08:25:42 -!- Lord_of_Life has joined. 08:42:26 [[C-INTERCAL]] https://esolangs.org/w/index.php?diff=65534&oldid=59264 * YamTokTpaFa * (+36) 08:45:06 -!- AnotherTest has joined. 08:51:09 -!- zombocoder has joined. 09:48:48 -!- zombocoder has quit (Ping timeout: 245 seconds). 09:50:29 -!- zombocoder has joined. 09:53:54 -!- tromp has quit (Remote host closed the connection). 10:11:52 -!- tromp has joined. 10:12:00 -!- zombocoder has quit (Quit: Leaving.). 10:17:41 -!- Sgeo_ has joined. 10:21:01 -!- Sgeo has quit (Ping timeout: 268 seconds). 10:30:09 -!- heroux_ has joined. 10:30:10 -!- heroux has quit (Read error: No route to host). 10:30:31 -!- heroux_ has changed nick to heroux. 11:02:36 -!- FreeFull has joined. 11:53:48 -!- b_jonas has joined. 11:56:07 tswett[m]: is that because it's a language where you have to do everything during compile time? 12:24:08 -!- tromp has quit (Read error: Connection reset by peer). 12:28:23 -!- tromp has joined. 12:32:59 -!- tromp_ has joined. 12:33:00 -!- tromp has quit (Read error: Connection reset by peer). 13:10:02 b_jonas: how are your smooth numbers coming along? 13:11:06 b_jonas: I'm not sure what you mean. 13:16:12 -!- atslash has joined. 13:31:02 tswett[m]: if you compute everything at runtime in the type system, then you don't actually need instances of the types 13:31:16 int-e: haven't worked on it yet, sorry 13:31:25 Ah. 13:31:35 No, it's because I just haven't implemented values yet. 13:39:03 -!- atslash has quit (Quit: This computer has gone to sleep). 13:49:45 -!- andrewtheircer has joined. 13:49:45 es 13:54:17 hih 15:23:29 -!- andrewtheircer has quit (Remote host closed the connection). 15:41:00 -!- Sgeo has joined. 15:41:58 -!- andrewtheircer has joined. 15:41:58 hi 15:43:48 -!- Sgeo_ has quit (Ping timeout: 245 seconds). 16:12:26 -!- Phantom_Hoover has joined. 16:37:07 [[Commercial]] https://esolangs.org/w/index.php?diff=65535&oldid=52103 * Dtuser1337 * (+52) added mirror link since the original has been deleted 16:52:40 -!- atslash has joined. 16:53:09 -!- FreeFull has quit. 16:57:07 -!- atslash has quit (Ping timeout: 248 seconds). 16:58:07 -!- atslash has joined. 17:01:50 -!- atslash has quit (Max SendQ exceeded). 17:02:23 -!- atslash has joined. 18:13:22 -!- rain1 has quit (Ping timeout: 245 seconds). 18:30:19 [[Drive-In Window]] https://esolangs.org/w/index.php?diff=65536&oldid=65493 * Dtuser1337 * (+72) Now with online interpreter :) 18:40:24 -!- Sgeo_ has joined. 18:41:52 -!- Sgeo has quit (Ping timeout: 246 seconds). 18:50:34 -!- andrewtheircer has quit (Ping timeout: 258 seconds). 18:59:29 -!- MDude has joined. 19:06:31 -!- MDead has joined. 19:06:52 -!- MDude has quit (Ping timeout: 244 seconds). 19:07:01 -!- MDead has changed nick to MDude. 20:15:26 -!- arseniiv has quit (Ping timeout: 272 seconds). 20:16:22 -!- FreeFull has joined. 20:17:38 I made up some Magic: the Gathering card of story of GURPS game I play. Some I put on here, but, I wrote some more on a paper. Now, I can write on the computer, too. 20:18:40 Evil Barber {2UB} Creature - Human Shapeshifter (1/1) ;; {1X}: ~ becomes a copy of target creature with converted mana cost X or target creature card in any graveyard with converted mana cost X, except it is a Shapeshifter in addition to its other types. This effect can be ended as a special action. 20:22:10 -!- Lord_of_Life_ has joined. 20:24:52 -!- Lord_of_Life has quit (Ping timeout: 258 seconds). 20:25:03 -!- Lord_of_Life_ has changed nick to Lord_of_Life. 20:55:14 [[MinISCule]] https://esolangs.org/w/index.php?diff=65537&oldid=65413 * Calamari * (+386) Added additional external references 20:57:51 [[User talk:Calamari]] https://esolangs.org/w/index.php?diff=65538&oldid=65443 * Calamari * (+206) /* Issues With Page */ 21:32:19 -!- AnotherTest has quit (Ping timeout: 250 seconds). 21:40:04 -!- atslash has quit (Quit: Leaving). 21:53:17 -!- andrewtheircer has joined. 21:54:11 hi 22:25:23 -!- adu has quit (Quit: adu). 22:26:27 -!- adu has joined. 22:47:50 Axe of Reuse {2} Artifact - Equipment ;; Equipped creature gets +2/+1 and has vigilance. ;; Equip {4} 22:48:02 Do you like this Magic: the Gathering cards? Do you like to make up the cards too? 22:58:32 dunno, looks ok but I find I have no use for such expensive equipment cards. it's a bit of a pity because Wizards found that Bonesplitter is too powerful, they can't print one like that again, and all they can do with the next equipment is try to race for the remaining slots for decks that need more than 4 equipment. 22:59:31 I found that Vulshok Gauntlets, with its 2 mana cost and 3 equip cost is as expensive as I dare to 23:02:10 OK. What comment of the other one? 23:02:50 plus I seem to recall there was some top tier creature that let you use expensive equipment for free in a way that's more efficient than the original Mirrodin block ones 23:03:04 the shapeshifter? I really can't judge how those work 23:03:44 I only ever see them as causing trouble with the rules, not as cards in real games 23:04:10 It works fine as far as I can tell from reading the rules. 23:04:55 sure, there's no specific rules problem with this card 23:05:09 -!- adu has quit (Quit: adu). 23:17:37 -!- Phantom_Hoover has quit (Read error: Connection reset by peer). 23:23:44 hi 23:44:38 hello 23:44:46 kmc: higan 23:44:55 happy to report that the kittens are extremely good 23:45:07 :O 23:45:09 you got kittens? 23:45:15 the kmettens 23:45:20 :O 23:45:37 hello kmettens 23:45:42 do you like smileys 23:46:01 kitten smilies like |\__/| ? 23:46:40 yes 23:46:47 i have kmetten smileys 23:59:23 `perl -eprint(240/4) 23:59:24 60 2019-08-18: 00:05:27 e 00:32:56 -!- andrewtheircer has quit (Remote host closed the connection). 00:38:16 -!- b_jonas has quit (Ping timeout: 272 seconds). 00:38:42 -!- b_jonas has joined. 01:11:03 -!- b_jonas has quit (Remote host closed the connection). 01:20:51 -!- FreeFull has quit. 01:25:34 -!- ais523 has joined. 01:25:49 ugh, I'm dealing with a really annoying missed optimisation atm 01:25:52 ptrdiff_t notneg(unsigned char b) { if (b <= 0xC0) __builtin_unreachable(); return -(ptrdiff_t)(unsigned char)~b; } 01:29:00 the correct optimisation is «return 1 + (ptrdiff_t)(signed char)b;» but neither gcc nor LLVM finds it (you could also do the increment first) 01:32:37 huh, they don't find it even with a cast to signed char in there, although clang finds it if you put a cast to signed /int/ in there (of course, none of these casts make a difference because ~b has to be a positive number in the 0..30 range) 01:33:16 LLVM allows you to specify the range, but I think only for loading from memory. 01:35:05 I just get annoyed when compilers produce asm that's worse than the asm I'm expecting 01:35:30 (and I'm the sort of person who actually checks that when I write code like -(ptrdiff_t)(unsigned char)~b…) 01:36:17 Is there any command to have a inline LLVM code in a C code? 01:37:03 Also, in Ghostscript, the "forall" command doesn't seems to work properly for strings longer than 800 bytes. (Other commands work (including the "length" command), and it works fine for arrays, but not for strings.) Why does it do that? 01:38:29 there's no standard C method to use inline LLVM; clang could theoretically support it as an extension to __asm__ but I don't think it does 01:40:19 hmm, so my next problem is, should I write it as 1 + (ptrdiff_t)(signed char)b in the original source, even though that's a lot less clear (the operation I'm using is conceptually a combination of a bitwise-complement and a unary minus, the fact that that does the same thing as an increment is just an intentionally engineered coincidence) 01:42:45 ais523: Oddly enough if you write out a lookup table gcc finds a good implementation. 01:44:59 what, if you special-case all 31 possible inputs? :-D 01:45:28 Yes, if you write a switch over the entire range. 01:46:21 (I mean "range of inputs" and not "codomain" or "image", which people refer to as "range" for some reason.) 01:47:05 One possibility is to write a comment. 01:47:55 (Also, which implementation is better might depend on the target computer, maybe?) 01:48:33 What's the context of this function? 01:48:45 decoder for a file format 01:49:13 it stores references to earlier locations in the file as 1, 2, 4, or 8 bytes, I'm writing a separate function for each 01:49:21 And the speed of this operation is relevant? 01:49:25 but the references are bitwise-complemented 01:49:51 the format's designed to be extremely fast, faster to use a memory image of the format than actually parsing it 01:50:12 Hmm, which format is it? 01:50:15 this operation needs to be able to compete with pointer dereferences to do that 01:50:21 it's a format I'm inventing atm 01:50:34 Aha. 01:51:02 (the idea is that the +1 ends up getting inlined into the dereference of the resulting pointer) 01:51:53 I'd store the offsets as with the +1 added if I could, but I can't because 0 is a valid offset and there is a fairly esoteric constraint that the offsets cannot be valid UTF-8 01:52:15 #esoteric is definitely the right channel for this :-D 01:52:31 So that's the reason for the 0xc0. I was vaguely wondering before whether it was related to UTF-8. 01:52:48 What's this for? 01:52:59 Maybe you're being deliberately vague. 01:53:28 not because it's secret, mostly because it's hard to explain 01:53:50 the format's designed for the output of a parser, i.e. the in-memory representation of a parse tree 01:54:10 but to be generic enough to be usable in much the same situations as XML is 01:54:50 but the idea is that the parser output is just an image in memory, it's not something that you parse into a linked tree of structures like you normally do 01:55:26 linked lists are bad performance-wise, and linked trees are very common but probably also beatable in performance for the same reasons, so I wanted to try 01:56:17 XML is often used in cases where it shouldn't be, anyways, I think 01:56:19 That makes sense. 01:56:44 I suspect the gains from a more efficient memory encoding are way bigger than the gains from a couple of extra instructions to dereference a pointer. 01:56:47 zzo38: yes 01:57:00 shachaf: that's what I'm hoping, at leasts 01:57:32 (not just more efficient, but more compact too, meaning it makes better use of the cache; also less malloc overhead) 01:58:39 I think it's plausible that even with a regular parser, you should have only one or a few calls to malloc for the entire tree, which you free all at once. 01:59:04 There isn't much benefit to mallocing individual nodes. 02:00:33 all the parsers I've seen so far malloc individual nodes for the output tree, although I agree there isn't much benefit to it 02:00:46 I think the idea is to let you free parts of the tree individually 02:01:17 I suspect there's no real idea, it's just that people learn that that's how you get memory. 02:01:21 but the normal operation on a tree is to traverse it, and that lets you build a new tree as you go 02:02:14 In some programs you would free one branch of the tree separately from the rest 02:02:16 this program is actually being written in Rust (I translated it into C to test it on gcc), and rust has a #[no_std] annotation that means your program has no support at all from the operating system, it's used for purely algorithmic libraries 02:03:11 that means you don't get memory allocation unless the caller gives you a memory allocation callback, and so I try to avoid allocations out of habit, thinking carefully about if I need them 02:03:19 often, I don't need much more than one or two for the program 02:03:38 I'd like to know more about possible allocation strategies. 02:04:12 I think I've talked about that in here before. 02:04:29 well, the one I'm working on for this program (for the parsers, tree operations, etc.) is a purely linear allocation strategy where everything is written in memory left to right in order, meaning that your algorithms have to be able to manage that 02:05:11 Does this memory go left to right in order of increasing addresses? 02:05:13 many algorithms can't, but for a parser it's fairly hopeful because parsing algorithms and tree-traversal algorithms both naturally work like that 02:05:48 yes, increasing addresses (decreasing is possible I guess but it's sufficiently alien that you normally get less support from the standard library, OS, processor, etc.) 02:06:15 Unless it's the call stack. 02:06:28 writing left to right unfortunately means that reading right to left is sometimes required, but reads on a parse tree are generally more random-access than writes as it is (you're often trying to match both branches of the tree to something) 02:06:36 I like the idiom of having a global (or thread-local) arena that can be used effectively as a stack but with the frames manually managed. 02:06:43 the call stack in x86 is the wrong way up and I am very upset at this 02:07:27 So functions that produce variable-size output that's only needed briefly can just write into there. 02:07:32 E.g. sprintf. 02:07:33 I wrote one program which needs the caller to specify a memory allocation function, although you can just put realloc and it will work, which is normally what would be done, I think. 02:07:39 there's one /really big/ technical advantage to having the call stack the other way round, which is that in x86, overflows beyond the end of a stack-allocated array overwrite the function's return address by default, which is just about the worst possible thing to overwrite 02:08:05 ais523: I've heard that brought up as a security benefit and I don't really buy it. 02:08:18 In some instruction sets the call stack is not addressable 02:08:22 if the call stack goes the other way, the situations in which that happen are much less common, requiring you to be writing to an array of a function which called the current one 02:08:36 that said, having a separate call stack and data stack is a much better idea for multiple reasons 02:08:40 char buf[n]; sprintf(buf, "%s", ...); seems pretty common to me. 02:08:49 Yes, I agree that that makes more sense. 02:09:51 shachaf: well, that example is broken regardless of which way up the stack goes (although with a stack that goes upwards, sprintf would at least be able to detect that something was wrong; it knows where its own return address is in memory, but not where its caller's is) 02:10:14 yea.. that seems like a security /issue/ 02:10:17 I'm not sure if anyone would write sprintf like that, but maybe they would 02:10:18 that's bad 02:10:29 in fact, that's exactly how ROP works 02:10:41 ais523: Or, I mean, char buf[n]; gets(buf); or whatever. 02:11:07 Many of the classic buffer overflow problems involve calling another function so changing the stack direction doesn't help much. 02:11:08 moony: well, ROP is one of the most effective ways to exploit this, but the exploit isn't ROP, it's just that the exploit lets you use ROP 02:11:30 gets should be simple enough to be inlined 02:11:46 also thumbs-up for using rust. If you're trying to allow custom allocators, use what is already provided 02:11:48 I would be pretty surprised if gets was inlined. 02:12:01 Rust seems to be pretty bad at custom allocators or unusual allocation strategies. 02:12:05 -!- botnick has joined. 02:12:20 so would I, mostly because that function is such a bad idea that I doubt much effort has been put into optimising it 02:12:34 I'm not sure if Rust's #[global_allocator] is stable yet, but that makes custom allocators very easy 02:12:49 unusual allocation strategies are IME either very easy or very hard 02:12:57 mmm.. 02:13:06 I think the main reason I think that is that Rust is all about destructors, which muddle deallocation with other code. 02:13:10 i thought rust's allocation choice could be done per function 02:13:11 guess not 02:13:15 i mean 02:13:17 i see why 02:13:46 right, the issue there is not so much allocation but deallocation 02:13:59 shachaf: there is the Drop trait, which can be useful. Could possibly implement a trait that keeps tabs on what allocator was used to make a object 02:13:59 Unfortunately those issues are connected. 02:14:06 although, it wouldn't be too hard to give the various allocators their own portions of address space and use the pointer value to tell them apart 02:14:32 I feel like you just want to do the right thing statically. 02:14:39 btw, separately from this project, I had an idea about a very eso allocation strategy 02:14:45 oooo 02:14:51 If you're adding a bunch of dynamic behavior like that there should be a good reason for it. 02:14:57 the idea was that all the pointers in the entire program would be doubly-linked 02:15:13 like, to point from one object to another, you need to point to a pointer field that points back at you 02:15:20 i think the cache would commit suicide 02:15:40 -!- botnick has quit (Read error: Connection reset by peer). 02:15:43 now, the great thing about this strategy is that you can move objects around in memory at will 02:15:49 i mean 02:15:52 because you already know where all the inbound pointers are and can just update them 02:15:55 that's the strategy a lot of VMs use 02:15:57 like the JVM 02:16:17 yes, I was inspired by compacting garbage collectors, the idea was to do the same thing without a GC 02:16:30 I'm not sure if this is useful, and it probably isn't, which is why I described it as very eso 02:16:51 reducing memory fragmentation could be useful if you keep memory organized at the same time 02:17:01 and do a bit of the memory usage predictor's work for it 02:17:06 Did you see that malloc that merges pages which don't have overlapping allocations? 02:17:07 yes, this is one of those cases where the advantages are clear but the disadvantages are terrifying 02:17:11 shachaf: yes 02:17:34 at first I thought "surely that isn't necessary", but then came up with some pathological programs where it is 02:17:57 I think my current attitude is that if your program is doing zillions of little mallocs and frees everywhere it's probably doing things badly anyway. 02:18:05 ^ 02:18:14 e.g. imagine a program that allocates 100 million 8-byte objects, deallocates 99 out of every 100, then allocates 1 million 800-byte objects 02:18:20 if it comes to that, use a slab allocator for some of those objects 02:18:42 assuming they're all uniform 02:18:56 my thoughts on the matter is that the only difficult case is what happens if a program deallocates a lot of small objects, then needs to allocate large objects that are too large for the remaining spaces 02:19:21 all the other cases are trivial by comparison 02:19:56 I don't think this is a remotely common pattern for long-running interactive applications, but I can see a batch process doing something like that when moving on from one phase of computation to another 02:20:13 I think Dwarf Fortress has an issue with that 02:20:18 albet with larger objects 02:20:20 maybe, if you have a random malloc pattern, there should be some sort of compaction phase whenever your program shifts modes 02:21:01 in The Powder Toy everything is preallocated because malloc pauses are unacceptable 02:21:09 anyway, this is what inspired the "everything is doubly-linked" idea because it's one of the only ways, short of a GC, to solve the problem 02:21:30 (that said, preventing the problem happening in the first place by using a more predictable malloc/free scheme is probably better!) 02:21:57 If you know the max number of objects, then just allocate that, the linux kernel won't mind 02:22:10 moony: are they preallocated /and/ prefaulted? 02:22:38 not prefaulted, but they generally get faulted very early in the app's lifespan so it's not an issue 02:22:41 animalloc doesn't have any pauses other than page faults, and those will happen even with a preallocation strategy unless you prefault all your pages too 02:22:56 could add prefaulting for fun 02:23:11 Did you know that merely reading from an mmapped page in Linux will only fault it in as a CoW zero page rather than giving you your own memory? 02:23:16 moony: it's one line of code 02:23:21 shachaf: yes 02:23:35 ais523: and that is? 02:24:18 actually I'm wrong, I thought madvise could do it on arbitrary memory, but the most aggressive prefault it supports is a request to preload into /cache/ faster 02:24:42 ok nvm it is prefaulted, we run the simulation clear no matter what 02:24:53 mmap can do it with MAP_POPULATE but that requires you to actually be getting the memory from mmap 02:24:54 so the action of wiping the sim should cause prefaulting 02:25:21 as we technically "use" the memory 02:25:43 …why are mmap and madvise not synchronized in what requests they support 02:26:28 ..prolly should work on reducing allocations in the game's graphics 02:26:52 the sim is effectively malloc free 02:26:59 but graphics are pretty CPU hungry too 02:27:59 ..gah 02:28:07 we still haven't squashed the malloc in INST code 02:28:27 OK, I've now implemented the 1, 2, 4, and 8 byte versions of this function 02:28:56 the -~ gets optimized to +1 only in the 8-byte case (presumably because LLVM can't optimize the - movzx ~ sequence when the number is known to be negative) 02:30:56 one interesting thing is that the optimizer implements the comparison with 0xC100000000000000 using a 56-bit shift and a comparison with 0x000000C1; I can believe that all those leading zeroes are actually fastest, but think there miight be a better way 02:31:34 that sounds like it would be faster on Nephelem era CPUs, but not sure about newer things 02:31:44 (Nephelem has some.. weird constraints) 02:32:58 right, I can see why a comparison of the bottom 8 bits with 0xC1 (which would be mathematically correct) might be slower on some processors 02:33:13 I could also see it being smaller code 02:33:20 ^ check if it's smaller 02:33:36 fitting as many instructions in 16 bytes as possible is usually a goal 02:33:38 shift-right is probably 1 instruction, and compare 8 bit is another 02:34:03 and fitting 0xc100000... as an immediate is going to be longer 02:34:38 you'd simply have to replace "cmp $0xc0,%rsi" (7 bytes) with "cmp $0xc0,%sil" (4 bytes) 02:34:54 as Hooloovo0 says, the only difference is the leading zeroes on the immedite 02:34:56 *immediate 02:35:05 there's a subtle difference here 02:35:26 the 32-bit registers and 64-bit ones are different, if i recall right 02:35:27 oh, it's a 32-bit compare? weird 02:35:49 but.. 02:35:50 hm 02:35:53 can i see ASM 02:35:53 Hooloovo0: it's a 64-bit compare using a 32-bit immediate, x86_64 doesn't use 64-bit immediates apart from one instruction 02:36:01 oh, ok 02:36:17 ais523: can you make a quick listing of the ASM here? 02:36:23 mov %rdx,%rsi \ shr $0x38,%rsi \ cmp \ $0xc0,%rsi 02:36:29 err, I added an extra slash 02:36:39 mov %rdx,%rsi \ shr $0x38,%rsi \ cmp $0xc0,%rsi \ ja 2e 02:36:47 (then the value in %rsi is no longer used, nor are the flags) 02:36:52 can't downgrade to a 32-bit register. 02:37:02 moony: %esi is just the bottom half of %rsi 02:37:18 No, they're treated different if i remember right 02:37:36 the complication you're thinking of is that if you ever assign to %esi directly, it gets automatically zero-extended into %rsi 02:37:45 ahg 02:37:47 ah 02:37:54 alright, i'm being a derp 02:38:01 i.e. the /top half/ of %rsi is like a register of its own with its own weird rules 02:38:28 (meanwhile, assigining to %si or %sil does not clear any other part of %rsi, the rule's only for the $e* variant of registers specifically) 02:39:05 I saw a post recently about which amd64 registers aren't special-cased in some way. It's only a few of them. 02:39:05 that last bit i did /not/ know 02:39:06 what 02:39:12 …which is why xchg %ax, %ax is a no-op, because that's a 16-bit write 02:39:23 whose idea was this 02:39:25 Hooloovo0: yes, welcome to x86 02:39:35 shachaf: six of r8..r15 are not special-cased, I think 02:39:36 it's all in the name of (misguided) backwards compatibility 02:39:44 err, r9..r16 02:40:04 I can't remember which two it is that are, it's either 10 and 11, 11 and 12, or 12 and 13 02:40:12 Yes, https://twitter.com/rygorous/status/1162078329706405888 02:40:18 man, fuck computers 02:40:30 ais523: Wait, writing to ax doesn't zero the top half of rax? 02:40:35 shachaf: right 02:40:43 nor eax 02:40:46 this is what I was missing when we had our nop discussion a while back 02:41:24 Hooloovo0: i await the day RISC-V takes over the world with sane design 02:41:26 so 90 is a nop because it's special-cased, even though that instruction would normally decode to xchg eax, eax (this forces you to use a different encoding if you actually want the swap) 02:41:45 but 66 90 is a nop semantically, it swaps ax with itself and that doesn't have side effects 02:42:02 (although it's almost certainly special-cased anyway, that's just for performance reasons) 02:42:03 Oh man. 02:42:13 I feel like I came across this fact once before but I completely forgot about it. 02:42:16 What a mess. 02:42:24 I want RISC-V to take over the world 02:42:44 this is why disassemblers can disassemble 66 90 to xchgw ax, ax without being incorrect 02:43:08 yeah, risc-v is nice 02:43:17 * Hooloovo0 has designed a risc-v cpu 02:44:11 Until now I thought that anything that only wrote to the lower 32 bits automatically zeroed the upper 32 bits. 02:44:13 I want a decently priced linux capable RISC-V board 02:44:15 then i will be happy 02:45:12 fwiw, the special-casing on r12 is almost forgivable, the issue is that some notation is needed to be able to specify not using a register; x86 sacrificed the ability to write an address that requires multiplying the stack pointer by a constant (somewhat understandably) to give the encodings it needed 02:45:38 and r12 is encoded by specifying "stack pointer, except second set of registers" and that would therefore need a special-case decode to allow you to multiply it by a constant 02:46:11 Yes, both r12 and r13 are inheriting restrictions from rsp and rbp. 02:47:55 I came up with a new optimisation idea a while back: the idea is that when you're implementing an array of structures as parallel arrays (e.g. for alignment reasons), you take a pointer into the array with smallest elements 02:48:16 and index into the others by multiplying the /pointer/ by a constant and adding another constant with an appropriately calculated value 02:48:35 (or if the arrays don't have fixed addresses, e.g. in a re-entrant function, another register) 02:48:55 in the non-fixed-address scenario this saves one register over the obvious way of writing things and isn't any longer or slower 02:49:16 although it's really highly illegal in C, you can do it in x86 asm just fine 02:49:19 Hooloovo0: if you think the base x86-64 stuff is insane 02:49:22 mess with SSE 02:49:42 AVX seems to have hit a sweet spot of performance and sanity, IMO 02:49:50 Yea, AVX is ok 02:49:50 then it started going back downhill from AVX2 onwards 02:49:59 AVX-512 ;-; 02:50:07 What was wrong with AVX2? 02:50:13 I've come to the decision to target AVX1 as my baseline instruction set 02:50:23 It gave a lot of integer instructions that were missing in AVX1. 02:50:25 shachaf: nothing massively wrong, it just has some jarring inconsistencies and missing features 02:50:48 also the useless instructions 02:50:52 that only have one use 02:50:56 and are junk for anything else 02:51:00 A while ago I wanted to write vectorized code and I couldn't use AVX. 02:51:07 e.g. there are no instructions to operate on 256-bit values as a whole, only pairs of 128-bit values 02:51:17 you can't shift the top half of a ymm value into the bottom half 02:51:41 which is weird, because you can shift the top half and bottom half of a ymm value separately into the top and bottom halves respectively of a second ymm value 02:51:42 RISC-V's vector extension is looking really good 02:51:47 you seen it, ais523? 02:51:53 no 02:52:13 https://github.com/riscv/riscv-v-spec 02:52:59 it's great 02:53:07 completely vector register width agnostixc 02:53:10 *agnostic 02:53:19 so that old code can utilize larger register sizes easily 02:55:02 should x86 be considered an esolang? 02:55:17 prolly 02:55:23 a esolang that everyone uses 02:56:20 Much less than C++, I think. 03:06:09 What I would want to have is the bitwise operations that MMIX has. There is a bit operation extension for RISC-V, but I think the bit operations of MMIX is better. 03:06:27 (At least, for a 64-bit system, it is better. Perhaps for a 32-bit system maybe it isn't better.) 03:06:34 zzo38: are MAK and EXT (MAKe and EXTract) in that list? 03:06:43 they're both bitfield opts 03:06:45 *ops 03:06:58 really powerful, enough that they can replace shiftleft/shiftright instructions 03:07:36 What are MAK and EXT doing? 03:08:07 (I also like the Muxcomp operation, described in esolang wiki) 03:08:09 * moony pulls up MC88100 desc of them 03:10:10 zzo38: http://bitsavers.trailing-edge.com/components/motorola/88000/MC88100_RISC_Microprocessor_Users_Manual_2ed_1990.pdf pages 3-44, 3-45, 3-46, 3-47, 3-70, and 3-71, 03:10:26 it has diagrams describing operation, alongside text 03:11:27 Do you have the order number of the page? 03:11:55 one sec 03:12:34 MAK is on 125.. 03:13:05 EXT on 99. 03:13:54 that good, zzo38? 03:14:25 I own the physical manual, forgot that the PDF is annoying to navigate 03:15:10 Yes, that is good 03:15:24 (I didn't read all of it yet though) 03:20:59 That MAK and EXT is good. (MMIX doesn't have it, but does have MOR and MXOR and SADD (MOR is very useful), and Muxcomp is even more general to do) 03:21:45 (A problem with Muxcomp though, is that it requires a lot of operands.) 03:23:38 Muxcomp is: Form a 5-bit number from the low bits of each of the first five operands to select which bit of the last operand to copy to the low bit of the result, and then the same for the next bit position, and so on. 03:24:49 (Or six bits for 64-bit registers) 03:26:05 zzo38: doesn't that effectively implement an arbitrary five-input bitwise operator? 03:26:11 with the last operand specifying the truth table? 03:26:20 what do you use MOR for? if it's useful... 03:27:17 ais523: I suppose so, yes. (You can also perform a shift or rotate of the last operand by setting the other operands properly) 03:27:20 MAK and EXT have the advantage of practicality 03:27:43 kolontaev: One use is endian switch (including PDP-endian). 03:27:52 But there are some other uses, too. 03:28:01 zzo38: aha 03:28:41 a while back in here we were discussing how Intel had added INTERCAL's select operator ~ to the x86 instruction set 03:29:34 the paper discussing it mentioned an instruction that's effectively a bitwise keysort; you stable-sort the bits of one operand using the bits of the other operand as keys 03:30:04 that hasn't been implemented but it seems like it could be useful 03:30:12 (a select is basically a bitwise-keysort followed by an AND) 03:30:19 err, preceded by an AND 03:34:36 -!- ARCUN has joined. 03:35:55 cpressey: Do you know where I could get an actual Commodore 64? I need one for a project. 03:36:03 -!- ARCUN has quit (Remote host closed the connection). 03:37:25 uh 03:37:26 huh 03:39:21 ais523: Yes, I think it can be useful 03:42:26 [[Commercial]] https://esolangs.org/w/index.php?diff=65539&oldid=65535 * Dtuser1337 * (+8) Formatting codebase. 03:43:44 MMIX doesn't have a "count trailing zero" instruction, but it can easily be done with two instructions (the SADD instruction is popcount(x AND NOT y)) 03:43:46 [[Commercial]] https://esolangs.org/w/index.php?diff=65540&oldid=65539 * Dtuser1337 * (-6) continue formatting codebase and move category to bottom 03:45:47 [[Commercial]] https://esolangs.org/w/index.php?diff=65541&oldid=65540 * Dtuser1337 * (-52) /* Implementations */ 03:46:20 zzo38: is that (x-1) sadd x? 03:46:45 [[ORK]] https://esolangs.org/w/index.php?diff=65542&oldid=53698 * Dtuser1337 * (+13) /* External resources */ 03:47:35 Yes. 04:54:20 [[Camouflage]] https://esolangs.org/w/index.php?diff=65543&oldid=30836 * Dtuser1337 * (+24) 04:54:49 [[ZOMBIE]] https://esolangs.org/w/index.php?diff=65544&oldid=53713 * Dtuser1337 * (+20) 05:08:36 -!- ais523 has quit (Quit: quit). 06:35:06 -!- nfd9001 has joined. 07:19:01 -!- rain1 has joined. 08:24:12 -!- Lord_of_Life has quit (Ping timeout: 245 seconds). 08:27:28 -!- Lord_of_Life has joined. 08:32:07 -!- AnotherTest has joined. 08:52:51 -!- nfd9001 has quit (Ping timeout: 264 seconds). 08:55:08 -!- nfd9001 has joined. 09:02:01 -!- b_jonas has joined. 09:05:41 ais523: "~b has to be a positive number in the 0..30 range" => I think you mean in the 0..0x3E inclusive range 09:07:43 "should I write it as 1 + (ptrdiff_t)(signed char)b in the original source" => use an ifdef, with the original version inactive and the optimized version active, write a comment that it's an optimization, and then check that the optimized version is compiled the way you want 09:08:03 that said, isn't it possible that this is a case where the optimization doesn't matter? 09:10:58 [[Edition]] N https://esolangs.org/w/index.php?oldid=65545 * A * (+874) Created page with "Edition language Double speak example I"$R. C"F"0@i1@i Explanation I Take input "$ Copy the input's length to clipboard R. Read the current file's content into the..." 09:11:12 "the in-memory representation of a parse tree" => that wasn't my guess 09:12:18 -!- arseniiv has joined. 09:13:41 "having a separate call stack and data stack is a much better idea" => is it still, now that CPUs cache the top of the call stack as an optimization? 09:16:41 ais523: moving objects around but without a gc, "at first I thought "surely that isn't necessary", but then came up with some pathological programs where it is" => in the kernel, trying to free up pages when it has lots of individually allocated small structures fragmented around memory 09:17:26 kernel people are actually working on that, and yes, the disadvantages are terrifying, although I think they're doing it more memory conservingly than doubly linking every individual pointer 09:19:48 hi. Nice it’s calm and wise here as usual :) 09:20:50 (I was without IRC for two weeks and in some reason I’m still unpacking) 09:22:40 "comparison with 0xC100000000000000" => that's because you can't have immediates larger than 32 bits, so it has to be two instructions anyway. that it's a shift of the input is still a bit surprising to me, but apparently that's how you can get it in just two instructions, rather than just three as in loading the constant in two instructions. 09:23:37 may also depend on the context 09:24:23 hm I played a game called Weave where you place tiles on a hexagonal grid, each tile having two points marked on each side and connecting these points by curved segments in some fashion as to make various intertwined paths when many tiles are placed together. Now I suddenly wonder if something can be esonalged from there 09:25:26 "you'd simply have to replace "cmp $0xc0,%rsi" (7 bytes) with "cmp $0xc0,%sil" (4 bytes)" => why? isn't there an encoding of "cmp $0xc0,%rsi" that has a 1-byte immediate? 09:25:57 turns and “knottiness” of paths could be used for semantics, and there are only so many tiles available to make the composition not so trivial 09:27:00 also I think I have already seen those tiles somewhere even before that game, but don’t remember where 09:28:06 and it could be downplayed to square tiles if necessary. If anybody would be interested, I’ll link to that game in G.Play and/or draw examples of tiles 09:28:14 how would gcc even get the assembler to emit the encoding with the 4-byte immediate? 09:31:34 b_jonas: 0xc0 is too big for a one-byte immediate 09:31:52 (because they are sign-extended) 09:32:29 and I thought picking immediate sizes was the assembler's job, not gcc's. 09:33:16 Oh, but choosing operand sizes isn't... that's the point. 09:33:52 int-e: ah ok 09:34:00 And intel only offers the choice between one byte immediates and full byte immediates. 09:34:15 I meant s/full byte/full size/ 09:34:23 int-e: gcc would know what size the instruction has, in fact the whole part where it outputs assembly rather than the object code directly is mostly for human-debuggability I think 09:35:08 I'm not sure that is the case. gcc probably has a good idea how big instructions will be, of course. 09:35:24 But I would hope it doesn't rely on always being correct. 09:46:00 int-e: it certainly dones't have to know for rare slow instructions, because it can handle unknown instructions in asm statements, but for when it generates fast code, it probably knows the instruction size for optimization 09:46:14 (for x86_64) 09:46:40 b_jonas: Sorry, I'll take that as speculation unless you have proof. 09:46:54 unrelated, but http://www.wyrdplay.org/AlanBeale/CAAPR-ref.html is a small English pronunciation dictionary by the author of 12dicts that seems to be well compiled 09:47:36 (For example, a key purpose of things like .align is that the compiler can align code without knowing exactly how big the individual instructions are.) 09:50:56 int-e: again, gcc generally doesn't know how long the emitted instructions from an asm statement are, which is documented in the gcc docs because it also says that gcc assumes an upper bound and what sneaky things you shouldn't do in the asm statement to violate that 09:51:16 int-e: and gcc probably can't tell the length of some jump instructions in the first pass 09:51:40 that said, some of the assembly syntax is probably for humans, not for compilers 09:51:56 like, do you think the compiler needs both decimal and hex integer syntax? 09:52:32 the .align too can be useful to make the assembly output more readable, even in the case when the compiler does happen to know how many bytes it emits 09:52:53 plus .align 16 is shorter than the assembly mnemonic of a 9-byte nop instruction 09:55:31 or looks nicer, rather 09:55:33 shorter doesn't matter 09:56:14 -!- FreeFull has joined. 10:10:54 -!- botnick has joined. 10:11:24 -!- botnick has quit (Read error: Connection reset by peer). 11:11:57 -!- FreeFull has quit. 11:12:37 `card-by-name Hecatomb 11:12:38 Hecatomb \ 1BB \ Enchantment \ When Hecatomb enters the battlefield, sacrifice Hecatomb unless you sacrifice four creatures. \ Tap an untapped Swamp you control: Hecatomb deals 1 damage to any target. \ IA-R, 5E-R, 6E-R, MED-R 11:12:58 ^ It seems a bit underwhelming that they use the word "hecatomb" for the sacrifice of a mere four creatures 11:13:39 `card-by-name Epic Struggle 11:13:39 Epic Struggle \ 2GG \ Enchantment \ At the beginning of your upkeep, if you control twenty or more creatures, you win the game. \ JUD-R 11:17:43 -!- livesex_0699 has joined. 11:17:46 -!- livesex_0699 has left. 11:26:39 (The helix pineaple requires you to pay mana only, not sacrifice creatures.) 12:17:51 -!- andrewtheircer has joined. 12:17:55 hi 12:18:47 idea: programming language only usable from last thursday to next thursday 12:27:33 -!- dog_star_ has changed nick to dog_star. 12:29:12 -!- dog_star has quit. 12:29:33 -!- dog_star has joined. 12:30:07 hi doh 13:03:56 -!- xkapastel has joined. 13:10:41 -!- tromp_ has quit (Remote host closed the connection). 13:36:24 [[~English]] https://esolangs.org/w/index.php?diff=65546&oldid=37171 * Dtuser1337 * (+24) this is a high level language due to how it looked like. 13:36:57 [[Commercial]] https://esolangs.org/w/index.php?diff=65547&oldid=65541 * Dtuser1337 * (+24) 13:37:30 [[Drive-In Window]] https://esolangs.org/w/index.php?diff=65548&oldid=65536 * Dtuser1337 * (+23) 13:42:59 -!- arseniiv_ has joined. 13:42:59 -!- arseniiv has quit (Read error: Connection reset by peer). 13:48:03 -!- Frater_EST has joined. 13:49:46 -!- Frater_EST has left. 13:50:54 -!- tromp has joined. 13:54:17 -!- MDude has quit (Quit: Going offline, see ya! (www.adiirc.com)). 13:55:51 -!- tromp has quit (Ping timeout: 264 seconds). 14:04:21 -!- tromp has joined. 15:34:10 -!- Sgeo__ has joined. 15:37:07 -!- Sgeo_ has quit (Ping timeout: 248 seconds). 16:10:16 -!- xkapastel has quit (Quit: Connection closed for inactivity). 16:51:12 -!- tromp has quit (Remote host closed the connection). 16:53:04 Is thre a metric-only font format in PostScript? 17:01:57 -!- tromp has joined. 17:10:26 -!- xkapastel has joined. 17:13:57 hi zzo 17:14:25 Hello 17:15:54 what is your favorite eso you've made 17:16:00 your crowning achievement in a sense 17:21:20 I don't know. 17:21:38 (I think that I do not make a "crowning achievement") 17:21:47 zzo38: you mean like for overlaying text on a scanned image of a text? I think you could use a vector font where all the glyphs are blank 17:22:22 well then zzo 17:22:22 -!- Sgeo has joined. 17:23:19 are you david madore , b 17:23:24 b_jonas: Actually I mean for use with an output driver that will provide its own glyphs or convert to some other format that will then be processed by something which provides its own glyphs, although it would also work to overlay text on a scanned image of text too 17:23:32 andrewtheircer: No, I am Aaron Black. 17:23:43 well then 17:24:00 -!- Sgeo__ has quit (Ping timeout: 272 seconds). 17:24:02 does everyone know you are aaron black 17:24:38 if not 17:24:40 this is big revel 17:25:07 I don't know, but I think it doesn't really matter so much. I am just known as "zzo38", and will not confuse with other people also named Aaron Black, I think. 17:25:21 zzo38: ok. I'd think a font with blank or dummy vector images would work for that too 17:25:39 nice stuff aaron 17:25:54 also:i was asking b_jonas if they were david madore 17:26:40 andrewtheircer: of course not 17:26:44 b_jonas: Yes, that would work, I suppose 17:26:48 d'oof 17:28:15 zzo38: but maybe otf already has a way to indicate that a font has metrics only. few people know how font formats actually work. maybe oren knows. 17:34:38 it's a low voodoo about font formats 17:36:05 it's not surprising that nobody understand them: there's a lot of historical baggage of evolving technology, and a lot of useful optimization 17:44:06 -!- andrewtheircer has quit (Remote host closed the connection). 17:46:25 -!- tromp has quit (Remote host closed the connection). 17:58:55 -!- tromp has joined. 18:09:09 -!- tromp has quit (Remote host closed the connection). 18:17:12 I am also not David Madore 18:17:16 -!- arseniiv_ has changed nick to arseniiv. 18:39:40 -!- tromp has joined. 18:44:05 -!- tromp has quit (Ping timeout: 244 seconds). 18:54:05 [[PureStack]] https://esolangs.org/w/index.php?diff=65549&oldid=41588 * Dtuser1337 * (+27) 18:55:11 [[Super Stack!]] https://esolangs.org/w/index.php?diff=65550&oldid=37526 * Dtuser1337 * (+24) 18:55:44 [[Super Stack!]] https://esolangs.org/w/index.php?diff=65551&oldid=65550 * Dtuser1337 * (-24) 18:57:48 [[Super Stack!]] https://esolangs.org/w/index.php?diff=65552&oldid=65551 * Dtuser1337 * (+23) 18:59:16 -!- adu has joined. 19:01:28 I think the font formats with METAFONT is good. 19:14:04 [[Emoji]] https://esolangs.org/w/index.php?diff=65553&oldid=46750 * Dtuser1337 * (+104) Adding some categories. 19:19:13 -!- Sgeo has quit (Ping timeout: 244 seconds). 19:21:10 [[Emoji]] https://esolangs.org/w/index.php?diff=65554&oldid=65553 * Dtuser1337 * (+24) Added output only category due to potential no input. 19:22:42 -!- Sgeo has joined. 19:26:39 -!- tromp has joined. 19:27:54 [[Hello world program in esoteric languages]] https://esolangs.org/w/index.php?diff=65555&oldid=65405 * Dtuser1337 * (+39) 19:32:31 [[Hello world program in esoteric languages]] https://esolangs.org/w/index.php?diff=65556&oldid=65555 * Dtuser1337 * (+746) /* Emoji */ 19:38:01 [[Hello world program in esoteric languages]] https://esolangs.org/w/index.php?diff=65557&oldid=65556 * Dtuser1337 * (+91) /* suicide */ 19:39:25 -!- tromp has quit (Remote host closed the connection). 19:40:31 [[Hello world program in esoteric languages]] https://esolangs.org/w/index.php?diff=65558&oldid=65557 * Dtuser1337 * (+152) /* MATL */ 19:40:36 -!- adu has quit (Quit: adu). 19:41:09 -!- FreeFull has joined. 19:54:19 -!- sombrero has joined. 19:55:35 :0 the style has changed 19:56:05 style? 19:56:34 Oh the webchat I guess. IRC is a pure text-based protocol, it has no style. 19:56:48 -!- tromp has joined. 19:56:50 yep the frontend 19:57:38 -!- Sgeo_ has joined. 19:58:41 sombrero: you're the only user of the webchat here, it seems. 19:59:16 ??? 20:00:52 (But I'm not sure, some people are cloaked which hides this information.) In any case, there are many IRC clients. The Freenode webchat frontend is just one of them. 20:01:04 -!- Sgeo has quit (Ping timeout: 272 seconds). 20:01:28 https://en.wikipedia.org/wiki/Comparison_of_Internet_Relay_Chat_clients <-- many 20:01:51 Yes, and I use one I wrote by myself. Others may also use programs not mentioned on Wikipedia, too 20:06:57 -!- tromp has quit (Remote host closed the connection). 20:08:47 :v anyway, i would be very happy if take a look to a compilation of drawing http://vixra.org/abs/1907.0332 and give your criticss, It would be pretty nice if this inspires some good ideas to make new stuff ;) 20:10:26 (esoteric answers and comment are well accepted ;P) 20:17:23 int-e: on freenode, the webchat cloak overrides the other cloaks, so you can't hide it that way 20:18:18 hmm 20:18:42 sorry, apparently that doesn't apply to kiwi (oh I hate that client by the way), only some other webchats 20:18:53 because sombrero's hostname isn't a cloak 20:22:22 -!- tromp has joined. 20:23:24 -!- Lord_of_Life_ has joined. 20:25:52 -!- Lord_of_Life has quit (Ping timeout: 244 seconds). 20:25:53 -!- Lord_of_Life_ has changed nick to Lord_of_Life. 20:33:41 -!- sombrero has quit (Remote host closed the connection). 20:40:34 -!- Phantom_Hoover has joined. 21:21:55 Priests of Sun {1W} Creature - Human Cleric (1/1) ;; {1W}: Target creature gets +0/+1 until end of turn. ;; {T}: Tap target blocking creature. That creature gets +1/+2 until end of turn. 21:22:22 Priests of Worm {1B} Creature - Human Cleric (1/1) ;; {(B/P)}: ~ gains first strike and haste until end of turn. ;; {T}, Sacrifice a non-artifact creature: Add {BB}. 21:39:13 -!- AnotherTest has quit (Ping timeout: 250 seconds). 21:39:25 -!- Phantom_Hoover has quit (Quit: Leaving). 22:02:07 -!- andrewtheircer has joined. 22:06:17 -!- Bowserinator has quit (Ping timeout: 245 seconds). 22:06:28 -!- Bowserinator_ has joined. 22:28:41 -!- Sgeo has joined. 22:29:52 -!- Sgeo_ has quit (Ping timeout: 244 seconds). 22:36:07 -!- Sgeo_ has joined. 22:39:13 -!- Sgeo has quit (Ping timeout: 245 seconds). 22:47:11 Do you like this cards? 22:47:25 who is cards 22:48:26 Magic: the Gathering cards 22:48:47 og 22:48:50 -!- andrewtheircer has quit (Remote host closed the connection). 22:50:04 -!- xkapastel has quit (Quit: Connection closed for inactivity). 23:18:03 -!- nfd9001 has quit (Ping timeout: 264 seconds). 23:18:34 -!- nfd9001 has joined. 23:39:04 -!- tromp_ has joined. 23:40:59 -!- tromp has quit (Ping timeout: 250 seconds). 23:44:31 @tell sombrero what are polysigns mentioned in the abstract of the thing you linked? 23:44:32 Consider it noted. 23:45:15 -!- ais523 has joined. 23:45:23 -!- FreeFull has quit. 23:46:48 b_jonas: the kernel uses intrusive lists a lot so it may be that a large proportion of the pointers are already doubly linked, that makes doubly-linking all of them a little less insane 23:47:52 "you'd simply have to replace "cmp $0xc0,%rsi" (7 bytes) with "cmp $0xc0,%sil" (4 bytes)" => why? isn't there an encoding of "cmp $0xc0,%rsi" that has a 1-byte immediate? ← no, there isn't, 1-byte immediates only exist as offsets of memory addresses (which is why lea is useful) and on byte instructions 23:48:09 at least, on instructions like cmp that use a fairly normal encoding 23:49:13 -!- arseniiv has quit (Ping timeout: 245 seconds). 23:49:22 ais523: they do exist on ordinary word instructions like cmp, but int-e says that they're signed so it won't work here -- I haven't checked that, it's really hard to figure out from intel manuals which things are sign extended and which ones are zero extended 23:50:03 incidentally, it crosses my mind that you could go down to three bytes by using bl/cl/dl rather than sil, or even two bytes if al were available 23:50:18 b_jonas: ah, OK 23:50:21 I think it's often the case that instead of pointers you want to use some alternative like indices, if you have a lot of them. That already allows for some kinds of relocation. 23:50:28 there's a simple rule for this, one-byte immediates in x86 are /always/ signed 23:51:00 they also exist for the shortcut %eax arithmetic instructions, but annoyingly not for mov, despite that a word mov with one-byte immediate would be often very convenient 23:51:02 so the only time they're treated as unsigned is if the instruction treats its operand as unsigned /and/ it only has a 1-byte operand, in which case it gets sign-extended to its own length and then treated as unsigned 23:51:40 ais523: including one-byte offsets for memory operands? 23:51:47 b_jonas: yes 23:51:52 ok 23:52:00 this is why the x86_64 ABI has a redzone, it's to make use of the positive offsets on SP 23:52:17 ok 23:52:54 anyway, a signed immediate /would/ work here, you'd simply need to do a signed shift rather than an unsigned shift 23:53:20 hmm 23:53:39 or, hmm, maybe not 23:53:55 because with the signed interpretation, you're checking for values between 0 and a negative constant 23:53:59 which isn't all at one end of the range 23:54:10 ugh 23:58:12 I just realized that it's funny how you first say that x86 doesn't have one-byte immediates for word instructions, then said that they're all signed 23:58:53 that's the way that memory works, I think 23:59:10 Insert complaint about x86's insanity here. 23:59:35 don't lawyers have a phrase "in the alternative" for describing situations like this? 23:59:41 but yes, it is signed 2019-08-19: 00:00:08 UTC rollover. 00:00:36 well, you could say that you forgot that the 8-byte immediates are available for the general encoding of the arithmetic, as opposed to the shortcut accumulator destination encoding 00:01:40 fwiw, I think modern processors in general are insane because of register renaming 00:02:04 compilers go to all this effort to pack their nicely SSAed programs into a set of registers, which is an NP-complete problem 00:02:17 then the processor goes to a lot more effort to unpack all thhe register names back into SSA and disregard the actual registers 00:03:05 The Mill people describe their belt system as "hardware SSA". 00:03:41 yes, it's pretty similar, but also somewhat limiting I think 00:03:57 I prefer doing things the other way round, where each instruction says where the data should be routed to, rather than where the data came from 00:04:22 because that allows you to pipeline high-latency instructions, which is half the reason for the register renaming in the first place 00:05:33 I wish I had a better x86 REPL thing. 00:05:46 I could probably write something reasonably easily. 00:06:00 asm repl, that's an interesting idea 00:06:31 I remember debug.com, arguably that counts, but it was a bit weird in how it worrked 00:08:03 Are there any good debuggers for Linux? 00:08:12 what do you mean by "good"? 00:08:33 gdb is easily good enough for what I want, but may well not count as "good" 00:08:39 Hmm, I'm not sure. It's probably mostly a UI thing? 00:08:51 ddd is a GUI version of gdb, but is incredibly dated 00:08:53 I can figure out the things I want with gdb but it often takes a lot of overhead. 00:09:10 there are also a lot of IDEs that run on Linux, of course; probably most of them do 00:09:17 People say Microsoft's debugger is good, but I haven't used it. 00:09:49 well, it's integrated with Visual Studio, which IMO automatically makes anything insane 00:10:17 I've barely used Visual Studio. I don't know much about it. 00:10:44 ais523: yes, and that's made even more insane by how the intel x86 optimization manual says that the longer nop instructions use execution units and a gp register from the register file, so the compiler sometimes has to figure out which register a nop instruction should reference 00:10:47 shachaf: the last-but-one time I attempted to install Visual Studio, I ended up needing to entirely reinstall Windows 00:10:59 The debugging APIs in Windows are certainly better than ptrace. 00:11:13 aww, I like ptrace 00:11:25 although it's a bit slow in terms of how many system calls are needed 00:11:26 it's strange, you'd think they solve that in the decoder, but no 00:11:38 ptrace does approximately the minimum possible. 00:11:50 b_jonas: fwiw, I think there should be two different .align pseudoinstructions 00:11:59 I don't remember all the things Windows does but they generally seem useful. 00:12:00 one which uses NOP padding, and the other of which uses ud2 00:12:07 For example, Win32 VirtualAllocEx lets you allocate memory in another process's address space. 00:12:26 shachaf: ugh, that seems outright dangerous 00:12:35 what if the other process is using a different allocator to the expected allocator? 00:12:39 When you're debugging a process? 00:12:48 VirtualAllocEx is the equivalent of mmap. 00:12:48 the ptrace equivalent is to force the other process to call malloc, which seems safer 00:13:07 In general I think many Windows system calls let you specify a process handle. 00:13:27 How do you even do a system call, when you attach to some unknown process? 00:14:01 You at least need to find a syscall instruction, which could mean waiting for the process to do a system call, searching its address space for a syscall instruction, or writing one into its address space. 00:14:35 it's documented what you do if the ptrace is stopping at a syscall instruction, you just rewind the IP two bytes 00:14:46 if the process isn't stopped at a system call, though, you have to change the IP to point at one 00:14:49 But you need it to be in an executable page, which is often read-only. ptrace lets you write to read-only mappings, but if a file is mapped into memory, it'll secretly convert it to a private mapping from a shared mapping. 00:14:58 (there is a system call instruction in the vDSO, that's the one I use for Web of Lies) 00:15:17 That's true, maybe finding the vdso page is your best bet. 00:15:26 (Unless the debugee unmapped it?) 00:15:36 well, you just use /proc/*/maps to find where it is 00:15:51 I guess writing a debugger for hostile programs that don't want to be debugged is quite different from writing one for your own programs. 00:15:57 unmapping the vDSO is interesting, I didn't think of that 00:16:24 also, ptrace doesn't work recursively, which means that you can make yourself almost debugger-immune simply by ptracing yourself or a bunch of child processes 00:16:32 (for a debugger to hide from that, it needs to /simulate/ all the ptrace calls itself) 00:17:17 ais523: I don't think padding with repeated UD2 is a good idea. it encodes to db 0x0F,0x0B| and if you happen to jump to that with the odd alignment, it reads the bytes 0x0B,0x0F which is a perfectly valid two-byte instruction 00:17:33 ah right 00:17:49 does x86 have an instruction sequence that's invalid from any offset? 00:18:09 other than the last byte, possibly, as there are no guaranteed one-byte illegal instructions 00:18:43 Why do you want an illegal isntruction? 00:19:39 ais523: there are like sixteen one-byte instructions that are currently illegal in x86_64, but they're all just reserved, not guaranteed to be illegal forever 00:19:40 because the padding isn't meant to be executed 00:19:53 Why not 0xCC? 00:20:35 yes, padding with 0xCC is probably the best 00:20:39 Or 0xF4 if you're not in ring 0. 00:21:20 I guess I should start using octal instead of hexadecimal. 00:21:29 LOCK LOCK LOCK … LOCK NOP is illegal at any offset other than the last 00:21:57 So int3 is 0314 and hlt is 0364. 00:22:09 (once you have more than 15 lock prefixes it becomes illegal for a different reason, but that's OK) 00:22:41 (more than 14?) 00:22:49 max length of an instruction is 16 I think 00:23:05 Wait, really? I thought it was 15. 00:23:11 …wait, why is LOCK NOP even illegal? NOP is a sort of XCHG instruction, which is one of the few that /can/ be locked 00:23:38 oh, because there are two registers, LOCK requires memory to be mentioned 00:23:41 It makes sense for reg-reg xchg to be illegal. 00:23:43 Right. 00:24:40 while messing around with atomics I discovered that x86 has an XADD instruction 00:24:56 which is (r, m) = (m, r+m) 00:25:17 notable mostly because it's lockable and has pretty useful semantics for a lockable instruction 00:25:42 Hmm, I didn't know that. 00:26:28 I think it can be useful sometimes, yes. 00:26:29 XADD can also be used to perform the fibbonaci sequence in very little space 00:26:32 which is a thing 00:26:43 just two registers, I assume 00:26:56 Yes, I thought that too 00:27:35 yup, 2 registers fib. 00:27:55 technically 3 00:28:00 now the fun part is: can you do it with /one/ register? 00:28:01 but 3rd is for loop if you want it to actually halt 00:28:02 But it's not as efficient as repeated squaring, I suppose. 00:28:43 one loop iteration, that is 00:28:44 ais523: quickly thought over the various ways to do addition on x86. My guess is no 00:28:58 moony: it'd have to be a vector register I think 00:29:03 Two unbounded registers are enough for any computation. 00:29:16 I was thinking of vectors too 00:29:20 Man, I wish I had a computer with even one unbounded register. 00:29:38 ais523: do you need it modulo 2**32, or just the first fifty or so terms? 00:29:38 you do. it's called RAM. (/s) 00:29:47 mod r/s 00:29:59 if the latter, then you can do a compare conditional jump thing to do it in one register 00:30:18 and possibly even some smart hash lookup table thing 00:30:28 but if you need it forever, then it gets harder 00:30:50 I think you could use one 64-bit register to compute it mod 2**32: 00:30:54 actually no 00:31:02 fib with a 1 byte value should be doable in 1 reg 00:31:08 as long as you can have a constant in memory 00:31:21 because upper lower halves 00:31:25 Why the PostScript binary format does not include dictionaries? 00:31:30 b_jonas: I was thinking 32-bit integers, or even floats 00:31:40 multiply it by a constant 0x00000001_00000000, then swap the upper and lower parts using rotate 00:32:27 no, I mean 00:32:36 multiply it by 0x00000001_00000001 00:32:37 duh 00:33:17 I think you could do that even without a constant memory operand, because 0x00000001_00000001 is composite 00:33:53 multiply by 641 then multiply by 6700417 then rotate right by 32 00:33:57 start from 1 00:34:15 low 32 bytes gives the fibonacci number 00:35:11 I'm wondering about a language feature which is sort of the opposite of the ones I've been talking about wanting recently. 00:35:20 https://www.perlmonks.com/?node_id=715414 is slightly releavnt 00:35:39 I want a type which can have values that are either known at runtime or at compiletime, and can mostly be treated uniformly. 00:35:56 For example an array's length might either be known statically or be a field on a struct. 00:36:00 oh yeah, that also works 00:36:31 You might like to be able to write code that works uniformly in both cases. 00:36:35 actually AVX is almost certainly enough, you can treat %xmm1 or whatever as four floats, then vhaddps gives you the ability to add and vpermilps lets you move them around inside the register 00:36:40 ais523: in each step, multiply by phi*2**32, add 2**31, then shift right by 32 00:36:59 So you'd have a "field" on the struct which just refers to a constant compiletime value, or something. 00:36:59 also works with floats: multiply by phi, round to integer 00:37:06 this doesn't work with ints because vpermd can't take input from an immediate for some reason 00:37:08 round to nearest 00:37:10 Are there languages that do that? 00:37:28 can only give the series starting from the second 1 though 00:37:39 shachaf: Rust does several things which are incredibly similar to that 00:37:55 but might not quite have the syntax you want 00:37:58 Hmm, do you have an example? 00:38:38 you can say print!("{}", obj.field()); and depending on the type of obj, that can either get a value of a field or else compile down to a constant 00:39:14 in this case the function containing that would have a type parameter describing the type of obj so that the compilier knew which implementation to use 00:39:43 Another version of this might be a function that can either take an argument at compiletime or at runtime. (In the former case it could be specialized for that argument.) 00:40:27 several of the more modern C-replacements (although not Rust, I think) have syntax in which you just write a function and can use it at compile-time if everything it does is safe then 00:40:47 I guess if you have a length() "method" in your language, and you monomorphize polymorphic functions, that more or less accomplishes the same thing, with enough optimizations. 00:40:54 fwiw, even gcc compiling C will generate specialised functions if the code implies that they might be useful, at a sufficiently high optimisation level 00:41:29 shachaf: right; one weird thing in Rust is that it's idiomatic to rely on this actually happening 00:41:46 ais523: yeah, but that's another of those optimizations that are hard to get right in the compiler 00:41:47 That sounds like something straight out of C++. 00:41:48 e.g. arrays have a compile-time known length but you'd normally write .len() to get at their length anyway 00:42:09 because Rust monomorphises whenever you don't explicitly tell it not to 00:42:24 C++ people are all about generating ridiculously inefficient code with recursive nested structs that the compiler can optimize to something efficient. 00:42:29 the compiler would have to try to inline every call, recursively, to figure out which sets of inlinings result in a simplificatoins 00:42:35 shachaf: yes, that's very Rust as well 00:42:41 Right. 00:42:48 I think that's not that great an approach. 00:42:52 just inlining single calls isn't enough, because sometimes everything is hidden behind several layers of functions 00:42:54 with the exception that Rust relies a bit less on the optimiser for it 00:43:04 the language semantics are such that the optimisation is more or less forced 00:44:52 Imagine you could say struct Arr { T* data; if length < 0 { int len; } else { compiletime int len = length; } };, or something. 00:45:00 Uh, I mean "T *data;". 00:45:38 Of course there are more things about an array that you might want to be either compiletime or runtime. 00:45:49 For example you could track strides for a multidimensional array. 00:46:10 -!- nfd has joined. 00:46:48 shachaf: sure, Eigen does that with array lengths, and I think some other libraries do too 00:47:12 In general I feel like there are so many different arrayish types you might want, which is kind of annoying. 00:47:21 well, the Rust way to do that would be to write [T; 10] for a fixed ten-element array and [T] (which is a different type) for an array of unknown length, but it's trivial to write a function that's generic over both of those 00:47:48 (e.g. by specifying the type of your argument as Into<&[T]>) 00:48:19 For example: Array with static length; array with dynamic length; array with dynamic length and (static or dynamic?) capacity, which can't grow past that capacity; array with dynamic length and dynamic capacity that can be grown with an allocator (do you store the allocator too?) 00:48:38 I have come to the conclusion that it's generally incorrect for a method to require a specific type from its arguments, rather than a description of what the type needs to support 00:49:01 but that description doesn't have to be duck typing, something like Rust's traits or Haskell's typeclasses probably works better 00:49:51 -!- nfd9001 has quit (Ping timeout: 264 seconds). 00:50:09 Rust has three arrayish things, [T; len] (compiletime fixed length); [T] (runtime fixed length); Vec (growable) 00:50:22 (more than three but yeah) 00:50:25 I think doing too much monomorphizing everywhere isn't that great either. 00:50:27 that said, I think the "growable up to a fixed capacity" would be useful, but I don't think it's in the standard library 00:50:34 b_jonas: three really well-known ones 00:50:41 For example you get a lot generated code, which isn't great. 00:50:42 what sort of minor arrayish things does it have? 00:50:43 -!- nfd has quit (Ping timeout: 248 seconds). 00:51:09 yeah, those are mentioned on the front page of the standard library documentation 00:51:12 ais523: Vec is only growable with a call to a global allocator, right? 00:51:22 shachaf: right 00:51:27 In general I'd like my libraries not to depend on things like a global allocator. 00:51:51 at https://doc.rust-lang.org/nightly/std/index.html#containers-and-collections that is 00:52:12 shachaf: sure, but if you want a growable type, what should it grow into? 00:52:33 Well, that's one reason I want "growable up to a fixed capacity". 00:52:34 do you want one that uses a buffer you give it? 00:52:40 oh, or that 00:52:52 hmm yes, I don't know if the library has such a type 00:52:54 You could tell your caller that you need more space. 00:52:58 you could define one though 00:53:09 ugh, I've been trying to remove doc.rust-lang.org from my browser history 00:53:24 mm? why? 00:53:25 I shouldn't have clicked that link 00:53:30 moony: well, I often develop Rust offline 00:53:33 ais523: use the forget feature 00:53:34 ah 00:53:39 so I have a local copy of the Rust documentation 00:53:41 I do all my browsing in incognito mode by default so nothing goes in my history. 00:53:42 b_jonas: I did, it's just a pain 00:54:15 actually, the really annoying thing is that I can't use file:/// URLs for Rust documentation any more, because the page crashes if you don't have cookies/localstorage enabled 00:54:27 ais523: There's also the separate distinction of whether a type "owns" the memory it's referring to or not. 00:54:28 and I don't think file:/// supports that 00:54:35 so I'm now running a local webserver just for the Rust documentation 00:54:37 ais523: `rustup doc` 00:54:42 does that not work 00:54:51 moony: in what way? 00:54:53 ais523: ouch 00:55:14 b_jonas: it's not that ouch, I've had a local webserver running on here for years because I couldn't figure out how to get rid of it 00:55:14 I guess Rust is full of ways to handle that. 00:55:17 now it at least has some purpose 00:55:23 (it's only accessible on localhost, at least) 00:55:28 sure, but 00:55:28 But I think e.g. Box<> assumes you're using the global allocator? 00:55:53 shachaf: pretty much the entirety of Rust is about whether types own their memory or not 00:56:09 shachaf: yes, or at least its destructor does 00:56:12 many methods have to be written three times for the three possible ownership relationships 00:56:26 Box<> is basically the main API for accessing the global allocator 00:56:28 that and Vec<> 00:56:39 so them being tied to the global allocator really isn't surprising 00:56:40 and there's not much point using it without 00:56:42 And yet they don't seem to have great support for a lot of allocation strategies. 00:56:49 you could have a MyLocalBox or whatever for a different allocator 00:56:57 I guess. 00:57:13 basically nothing in Rust's standard library assumes you're using a Box, it's always done with traits 00:57:39 there are standard trait combinations to use to say "this is a custom pointer-like thing" and then it can be used in all the same contexts that Box can 00:57:53 Last I tried Rust much Box was called ~, I think (or maybe @?). 00:58:04 it was called ~ 00:58:05 I think @ was for garbage-collected or maybe reference-counted cells. 00:58:36 nowadays ~ is called Box and @ was split into Rc and Arc (a Gc was planned but they never got around to it) 00:58:47 the Rc/Arc difference is that Arc is thread-safe but slower 00:59:57 (Rc can be used in multithreaded programs but Rust won't let you send one between threads, it's confined to a single thread) 01:00:38 shachaf: that's what cpressey said too ("https://esolangs.org/logs/2019-07-23.html#l2c") 01:00:41 Pervasive reference-counting doesn't seem like a great allocation strategy to me. 01:01:12 b_jonas: No, I'm not annoyed by the language changing as long as I'm not using it. 01:01:28 I'd rather they make it better rather than try to ensure backwards compatibility. 01:02:18 shachaf: pervasive reference-counting is one of the reasons that Perl is probably unrecoverable from a performance point of view 01:02:47 I found out fairly recently (in the last few days) that Python uses pervasive reference-counting + a cycle-breaker, which seems even worse somehow (especially in a language which could easily use its own VM) 01:03:07 ais523: what does "use its own VM" even mean? 01:03:16 b_jonas: like Java has the JVM 01:03:27 OCaml's allocation strategy is really interesting and apparently not widely used 01:04:05 ais523: in Java's case that means that the programs are compiled down to an executable that the VM can run, and you don't need the compiler, only the VM, to run the program 01:04:06 everything is 32-bit aligned, every 32-bit chunk has a tag bit saying whether or not it's a pointer 01:04:17 but how is that relevant for what you've said above? 01:04:32 ais523: I think this was changed at one point, but for a long time Python objects that had a reference cycle and destructors were just not collected. 01:04:34 this means that exact garbage collection is possible (not just conservative) and doesn't need to know anything about the structure of memory apart from the tag bits 01:05:08 b_jonas: well, the JVM is an example of something that can implement exact reference counting, and even things like compaction, because it has full control over the structure of all the memory stored there 01:05:25 in Java you can swap out GC algorithms without changing the performance of the program 01:05:27 ais523: doesn't it also mean that you can't easily have an array of numbers in a dynamically allocated thingy though? 01:05:37 and I don't think reference-counting + cycle-breaker can possibly be superior to a GC 01:05:54 b_jonas: OCaml numbers are only 31 bits wide so that there's room for the tag bits 01:06:09 ints, at least 01:06:14 ais523: right, so you can't have an array of proper numbers, only of OCaml numbers 01:06:21 OCaml has to do fairly insane things to make floats work with this, which is a major downside 01:06:41 What's a cycle-breaker? 01:07:03 shachaf: something that detects a situation in which a nonzero reference count exists only because of objects recursively referencing each other 01:07:10 and not because the objects are actually referenced 01:07:15 and frees all the objects in the cycle 01:07:38 Fix the Rust documentation so that it does not use cookies/localstorage. A documentation page shouldn't require that anyways. 01:07:39 shachaf: a would-be-thief that decides that if he can't have your bicycle, then you can't either 01:08:13 I mean, how does it work other than effectively doing general GC? 01:08:34 shachaf: that's why I think it's ridiculous; it's basically most of the way to a general GC with all the disadvantages of an Rc 01:10:21 that said, python can work with a pure Gc, and I think the python implementations that run in the jvm do that; and if you know that no dependency of your code needs the gc, then you can run cpython with just the refcounting, disabling the gc 01:11:41 you can use destructors and/or weak references to make the pure refcounting work 01:12:20 https://docs.python.org/3/library/gc.html#gc.disable 01:12:35 (don't click on that if you want to use a local copy of the docs) 01:12:51 I don't think I have a local copy of the Python docs 01:13:01 maybe I should, but I hardly program in Python 01:13:26 If you program in a language all the time, you probably don't need the documentation. 01:13:50 anyway, I had an idea wrt the OCaml way of doing things: for each type, identify the ratio of pointers to non-pointers in it (in terms of bytes), and allocate each type with a given ratio in its own arena 01:14:22 /but/, you allocate the pointer and non-pointer parts in separate arenas too (the addresses of the two parts are mathematically related because of the constant ratio) 01:14:56 now, you have all the pointers in memory blocks of their own, so that you can GC them really easily, and don't need to waste any bits on tagging things 01:16:28 another benefit of this is that it statically guarantees that all pointers are correctly aligned, without needing to waste any bytes on padding 01:16:58 I'm not sure what the cache effect would be, there are reasons to think it would help but also reasons to think it would hinder 01:18:21 `? flower 01:18:22 flower. what IS a flower? 01:18:51 actually, this is almost strictly better than the OCaml approach (which is already pretty good), the only downside is related to unions and other sum types 01:19:02 which are, of course, heavily used in OCaml, so that might be a problem 01:19:35 unless, hmm, perhaps sum types could be references and the tag is stored in your choice of arena to point the pointer into 01:21:12 OCaml is the sort of language that really wants a GC, because it heavily relies on immutable value types that it wants to avoid copying, /but/ also contains mutable data 01:22:09 (I think that languages which mutate a lot normally benefit from manual memory management, and with languages which don't mutate at all, reference counting is a more attractive possibility than it would be otherwise) 01:24:00 I think languages should mutate a lot when they can, but they always seem to focus on backwards compatibility. 01:24:16 This is why you should never release your software. 01:24:38 -!- Sgeo_ has quit (Ping timeout: 245 seconds). 01:25:07 I'm increasingly of the conclusion the transistor was a mistake. 01:25:19 hikhq 01:25:25 hichaf 01:26:28 do you want to design my language for me twh 01:26:31 -!- Sgeo has joined. 01:26:57 also do you want to see pictures of cute kittens 01:26:59 shachaf: Rust is instructive in that but I'm not sure in what direction 01:27:05 Between work and general life demands I'm doing well to keep up on developments in programming languages, really 01:27:12 Also, of course I do. Cute kittens are great. 01:27:22 lots of people got upset that it changed so much before being stabilised, but OTOH it ended up really benefitting from the time 01:27:54 I do think it's beneficial to really work on a project's specification before the first release, though, making sure it's perfect 01:28:52 There's still some things in the Rust stdlib that I think are kinda questionable... 01:29:58 What things is that? 01:30:23 Allocation failure is generally an unreported and unhandlable error. 01:30:45 Which, yes, I know is more _ergonomic_, but it means you have limited options for handling that error condition. 01:30:53 I think it'd be a pretty reasonable world for every sufficiently large company and so on to use its own programming language, rather than everyone standardizing on a few. 01:31:52 pikhq: my experience with allocation failures is that almost every attempt I've seen to handle them is either equivalent to a crash, or more user-hostile than a crash would be 01:31:55 Unfortunately there's a lot of nonsense involved in making programming languages which probably shouldn't be necessary. And also cross-language interoperability is often very bad. 01:32:19 And it feels a touch silly in a language that offers decent error handling approaches, and doesn't have semantics necessitating always-crash behavior 01:32:20 arguably /every/ attempt 01:32:34 ais523: For many programs, that is indeed the correct decision. 01:32:36 Perhaps most. 01:33:12 In Rust it grates because Rust is trying to handle problem spaces where that might _not_ be the best decision. 01:33:21 pikhq: in programs where you'd want to do something else, you probably need safety against other sorts of crashes too, or even power failure 01:34:16 (also, my guess is that allocation failure in Rust is a panic, which is just about possible to handle, and I'm guessing that programs that care about allocation failure recovery care about panic recovery too) 01:34:38 I believe there is an outstanding RFC for _making_ it a panic. 01:34:57 oh, it isn't atm? presumably that's due to a fear that destructors might allocate memory 01:35:13 And yeah, having allocation failure be a panic is probably a reasonable strategy for a lot of programs. 01:35:16 I think it would be obviously incorrect to make it anything less than a panic 01:35:43 especially as it's almost impossible, on most computers, to reach the point of memory exhaustion 01:35:53 memory is a shared resource, so the computer just runs slower and slower and slower as it gets shorter on memory 01:36:12 the point of true memory exhaustion doesn't actually get reached because the user has started force-quitting things and even doing hard power offs before then 01:36:18 On my computer if a program uses too much memory, it just makes the kernel kill some other random program. 01:36:18 Pretty frequently the hypothetical ideal allocation failure behavior is for a given task to abort, not for the program as a whole to. 01:36:28 (but of course that's harder to achieve) 01:36:30 so an actual memory exhaustion only happens when it's a quota that got exhausted rather than physical memory 01:36:51 Are destructors a good idea? I can't tell. 01:36:58 shachaf: On Windows on the other hand, the kernel just reports memory exhaustion. 01:36:58 (my life got a lot better when I realised that I could just set a per-program RAM usage quota) 01:37:14 It has strict commit charge tracking. 01:37:36 (though it's still hard to really get this to come into play, because the swap file scales in size) 01:37:57 It's kind of bizarre that Linux still uses swap partitions instead of files. 01:38:24 To be honest, probably the most common case where allocation is going to report failure is exhaustion of address space on 32-bit systems. 01:38:38 And that one's pretty easy to hit. 01:39:07 Easier still to have an attempt to allocate that would exhaust address space, while still having plenty after the allocation failed. 01:39:18 shachaf: re destructors: my belief is no, except when it's syntactic sugar for something else (as is often the case with RAII), but for a slightly strange reason: if you have the sort of object that benefits from a destructor, you probably need to be tracking/organising all the references to the object anyway to be able to use it in a semantically correct way, in which case calling the destructor manually would be trivial 01:39:48 re: swap: Linux can use swap files just fine, people are just used to setting up partitions 01:39:59 Can it suspend-to-disk to a swap file? 01:40:09 That's my main reason for having a swap partition. 01:40:47 I wouldn't be surprised if using a swap file ends up having a performance penalty over a swap partition, just because the Linux swap code is pretty poo. 01:41:07 I also don't know why swapoff takes half an hour. 01:41:10 Also maybe the file is fragmented 01:41:15 Not that swapping is _ever_ going to be fast, but Linux seems to do it a page at a time, synchronously. 01:41:26 (fwiw, I set my current laptop up with no swap, neither partition nor file, and have so far not regretted that decision at all) 01:41:27 I guess the reason is what pikhq just said. 01:42:29 even then, you still get swapping-like behaviour at times of high memory pressure, but the kernel isn't swapping data out to disk, but rather unloading pages from memory that happen to equal the corresponding page on disk 01:43:01 I think there are two main uses for destructors, which RAII wants to unify: 01:43:28 One is objects on the stack, where things get auto-cleaned-up at the end of a scope. 01:43:58 This is convenient but I think something like Python's "with" or Go's "defer" might address it better. It's mostly a control flow thing, not an object thing. 01:44:24 does Java's try-with-resources fall into the same category? 01:44:37 The other is objects that contain other objects that contain other objects that have destructors, or something. 01:45:09 (the semantics: you write try (expression) {}, and when control leaves the {} for any reason at all, the ".close()" method is called don the expression; this includes exceptions and all control flow structures, in addition to just falling off the end naturally) 01:45:12 Where the whole tree is automatically traversed for you when you destruct the outermost object. 01:45:41 That sounds plausible? 01:46:13 of course, things like System.exit() can beat the try-with-resources and prevent .close() from running, but the semantics are that the process can't continue until your destructor has run 01:46:20 I guess there's also the special case where you e.g. use a lock-acquiring-object and then tail-call another function and give it that object. 01:46:32 That's probably not handled with a thing like "with". 01:47:08 semantically the only issue is that it wouldn't be a tail-call any more 01:47:29 I mean the case where you pass ownership of the lock-object to the other function. 01:47:40 So it can presumably destruct it at any point. 01:48:03 hmm… isn't the lock-object basically just a continuation? 01:48:21 Why? 01:48:36 I guess it's more like a callback 01:50:59 anyway, I have one very strong opinion about memory management, which is: for immutable types that never change, programming languages (possibly unless they're /very/ low level) should provide an API which from the programmer's point of view looks like the objects are copied everywhere and never have multiple references, and should optimise it behind the scenes (which may involve garbage collection or reference counting of a single copy or whatever), 01:51:01 but should /never/ allow such objects to mix with any sort of memory allocation scheme that's explicitly controlled by the programmer 01:51:45 Why? 01:52:48 because the two cases are basically entirely different in terms of how you need to optimise them, and trying to treat them the same way makes both of them much more difficult 01:53:25 in particular, the programmer should never need to track immutable things, you can pass them around at will without any semantic issues, forget about them, whatever 01:53:47 things that can be mutated are both rarer, and need a lot more care, typically you'll have some very regimented rules for using them already 01:54:13 Maybe your "/very/ low level" boundary is different from mine. 01:54:46 for example, in NetHack, keeping track of the memory management for every string in the program is a lot of ridiculous effort, especially when you want to be able to pass the same string to multiple functions or to the same function multiple times 01:54:52 so a garbage collector for strings would be really nice 01:55:27 OTOH, a garbage collector for in-game items, monsters, etc. would just be semantically wrong, because you want those things to stick around until you explicitly destroy them, and the destruction has a lot of /logic/ impacts that need consideration by the programmer 01:55:31 Is there a driver to use with Ghostscript to write to a DVI file? 01:56:06 e.g. if the monster is holding an item, do you want to destroy that too? what if it's a plot-critical item that simply cannot be destroyed? you need to know where the monster "should have been" to place the item in the right location after hte monster is gone 01:56:36 so things like monsters are part of the game logic and managing their memory is trivial because you need to manage their state in just as much detail, and the memory management is easy to tack onto that 01:57:55 (I've also concluded that there's actually a third category here, things like "the internal state of an algorithm" that are mutable but self-contained and used only temporarily, but those are nearly always either stack-allocated or effectively-stack-allocated) 01:59:16 I guess you could make exceptions for, say, treesort, which could in theory be stack-allocated but nearly always isn't 01:59:18 (Also, is it possible to add drivers to Ghostscript without recompiling?) 02:00:20 Why would treesort not be stack-allocated? 02:00:31 Or allocated in some kind of temporary memory. 02:00:37 the tree you're building is a recursive data structure the same size as the original list 02:01:03 trying to express a stack-allocation of that, especially if the list is coming from a streaming source and you don't know how large it is, is incredibly difficult in most languages 02:01:30 Well, you can allocate in some temporary arena or something with effecitvely stack semantics. 02:01:46 using a recursive function to do the stack allocation using its own call frames would work, but is inefficient due to the return addresses cluttering up the stack 02:02:07 Mergesort also allocates a linear amount of memory. 02:02:10 so you'd either need an alloca-alike or else a temporary arena 02:02:22 could you do something fancy with tail recursion? 02:02:37 Tail recursion is pretty pointless if you have iteration. 02:02:53 Just write while (true). 02:03:44 By the way: I realized that "if" evaluates its argument exactly once, at the time it's executed, so it's a lot like a function parameterized on a block. 02:03:56 But "while" re-evaluates its argument so it's not very function-like. 02:03:58 hmm, I guess? 02:04:21 Is "while" an exception among control flow keywords? 02:05:23 could you do something fancy with tail recursion? ← I was actually just thinking that, and did some experiments; my conclusion is yes in theory, but no using the x86_64 calling convention 02:05:43 Actually, my real question is: If my function has user-definable control flow constructs, should they be functions, which is enough to support "if", and if so how should they handle "while"? 02:06:29 you'd need a calling convention in which the called function cleaned up the section of the stack between stack and base pointer for the caller 02:06:51 this calling convention is trivial to define but I don't see any benefit except in this one massively specific case, so I doubt it'd ever be used 02:07:33 shachaf: the mathematical solution is call-by-name, and the practical solution most languages use for that is to take a callback parameter, meaning that your language is genereally call-by-value but you call-by-name just this one small part 02:07:53 ais523: There might be more benefit in non-recursive tail calls? But probably you should just manage the memory more epxplicitly if you're doing that. 02:08:16 so, e.g., in C, the prototype for while would look liike while(bool(*condition)(), void(*body)()) 02:08:33 because it's a function pointer not a value, the function you're calling can run it multiple times if it wants to 02:08:36 Except that presumably you're thinking of a closure and not a function pointer. 02:08:48 it would normally be a closure in practice 02:09:01 doesn't have to be, though, it could just be a function constant 02:09:14 Anyway, I'd want this for an efficient language, where the predicate argument is guaranteed to be inlined at compiletime. 02:09:53 If you have a notion of passing multiple blocks to a function, you could just write "while {p} {body}", which maybe wouldn't be so bad. 02:10:08 I think the user defined control structures should be macros and not functions, and operate at compile time. 02:10:09 heh, well I designed Verity a while back: intended for efficiency, call-by-name, callbacks are guaranteed to be inlined (in fact, absolutely everything is guaranteed to be inlined, which in turn means that the language doesn't support recursion) 02:10:25 or, well, it does actually support recursion but it does so using a recursion combinator 02:10:35 (The macro expansion will then put in all of the correct code to make it work properly at run time) 02:10:56 it doesn't support recursion via having a function call itself because that would just inline it 02:11:15 zzo38: I'd like them to be something between macros and functions. 02:11:21 shachaf: hmm, I think that might be valid syntax in Perl (once you change "while" to something that isn't a keyword) 02:11:26 Maybe this just means hygienic macros, but I think it's a bit more than that. 02:11:40 For example, I'd like a block to optionally take parameters. 02:11:49 So you might write "for(xs) {\x; ... }" 02:12:08 That's not just an AST, exactly, it's a compiletime object that can be called. 02:12:31 Yes, that makes sense, it could be hygienic macros that you can add blocks to take parameters. So, you can have anonymous macros perhaps? 02:12:55 I guess you could, though it doesn't seem that useful. 02:13:18 I think may would be useful. 02:13:24 It's possible. 02:14:02 ais523: impossible to reach memory exhaustion => unless you deliberately put a memory limit to catch it early, whether by setrlimit or through the memory allocator function itself 02:14:02 So my old language idea is, you have an operator that captures "the rest of block" and passes it as an argument to an expression. 02:14:23 So instead of writing "if(p) { body }", you can write "{ if(p)`; body }" 02:14:42 but I do agree that it's usually not worth to handle an out of memory condition other than guaranteeing that it will crash properly rather than randomly corrupt memory 02:14:53 b_jonas: yes, this is why I have a setrlimit on every program I start from the command line by default nowadays 02:15:08 And also instead of writing "for(xs) {\x; ... }", you can write "{ x := for(xs)`; ... }" 02:15:16 (to catch fast memory leaks in programs I write, which I'd nearly always be running from the command line) 02:15:57 If you're using this idea, you could maybe have "while" pass a special block that breaks from the loop when you pass it false. Then you could have "{ while`(p); body }". 02:16:11 I don't really like this, though, it seems pretty complicated. 02:16:33 shachaf: last time we discussed this, I think we had a debate about if it was a monad or not 02:16:44 my current thoughts on this is that it works very well for if-like things but much less well for while-like things 02:16:50 What about for-like things? 02:17:15 unsure, but currently leaning towards working 02:17:39 I think it works quite well for "{ loop`; ... }" and "{ x := for(xs)`; ... }" 02:17:56 I think this is nicer than almost any "for" construct in any language. 02:18:26 For example I don't think anyone has a nice way to express "{ x := for(ns)` + 1; ... }" 02:18:28 fwiw, I think "each" is a good name for it in this context 02:18:38 Sure, "each" is good. 02:19:18 this also generalises to "any" loops pretty well, but those aren't in common use (maybe they should be) 02:19:19 You can also write "{ x := for(xs)`; y := for(ys)`; if(x < y)`; ... }" and get something like list comprehensions. 02:19:29 What are "any" loops? 02:19:36 the loop exits unless there's an exception in the loop body 02:19:47 if there is an exception it just moves onto the next loop iteration 02:19:53 How do you express the exception? 02:20:22 normally it would be some sort of assertion failure, these loops are normally only used in declarative languages 02:20:32 You can also write "{ x := for(for(xss)`)`; ... } 02:20:40 but I've found myself writing them in, e.g., Java 02:20:54 I've hardly seen loops like this, or maybe I just haven't recognized them. 02:21:10 where they're an ugly sort of "for (a : …) try { … ; break } catch (Exception ex) {} 02:21:12 " 02:21:22 Oh man, no way. 02:21:40 you basically use them when you have multiple approaches that might potentially work, and just want to find one that works 02:21:51 I think just writing a break at the last line of your loop is simple enough. 02:21:55 oh, that's not quite right, because if /every/ iteration fails you want to throw an exception 02:22:15 ideally that's a combination of all the others, but I haven't yet seen a language that does that 02:22:35 Probably related to Python-style for-else. 02:22:37 "could not communicate by TCP because the socket is closed, nor via carrier pigeon because no pigeons were available" 02:22:50 I keep forgetting how for-else works 02:23:03 I used to think it was bizarre but now I think it's very natural. 02:23:13 is it that the else block only runs if the loop has no iterations? 02:23:15 Though possibly it's even more natural to express it directly with my language idea. 02:23:32 The else block runs if the loop exits via the condition, instead of a break. 02:23:59 aha, I do like that 02:24:02 the terminology is insane though 02:24:14 but the semantics are useful 02:24:33 oddly, I think it's the "break" I disagree with here rather than the "else" 02:24:44 because "break" is indicating "found"/"success" which the word "break" doesn't really imply 02:24:54 In my language thing, you can label blocks with, say, @, and the label lets you exit them. 02:24:56 (likewise, "continue" is indicating failure) 02:25:05 perhaps "done" is a good name for "break" 02:25:24 "I keep forgetting how for-else works" => isn't that because there are at least two unrelated things with a name similar to them? 02:25:44 So "{ x := for(xs)`; ... }" actually means somthing like: { break := @`; x := for(xs)`; continue := @`; ... } 02:27:20 ais523: I'd prefer "break" or "last" (especially if you have the full quadruplet "retry/redo/next/last"), because "done" is already used in a conflicting sense in sh 02:27:26 So if you wrote "for (xs) { body } else { notfound }" explicitly, it would be something like: { done := @`; { x := for(xs)`; continue := @`; ... }; notfound } 02:28:04 Who cares about sh? The only good thing about sh syntax is the way it handles variables. 02:30:23 b_jonas: what does retry do? 02:31:25 ais523: jumps to right before the start of the loop. not the start of the loop body, the start of the whole loop 02:33:06 neat, that's a possibility I hadn't thought of 02:33:21 now I sort-of want a control flow operator to go back to the previous loop iteration 02:33:47 ais523: jumps to right before the start of the loop. not the start of the loop body, the start of the whole loop 02:34:08 I think you sent the wrong line? 02:34:13 yes, sorry 02:34:40 What's redo? 02:35:05 * moony tries to wrap head around this 02:35:37 shachaf: repeats the current loop iteration 02:35:55 so it's basically a goto to the start of the block, without increasing the loop counter or anything like that 02:36:30 I've used it a few times but it doesn't seem massively useful 02:36:56 I like the way both break and continue are forward jumps, and only the loop construct itself does a backward jump. 02:37:22 I implemented Z-machine in C, JavaScript, and Glulx; now I do in PostScript. Later, I could try other stuff, such as PC, and Famicom (which I have started to do some time ago but haven't finished it), and possibly others too. What others will you implement Z-machine on? 02:37:28 it's debatable where continue jumps to 02:37:52 I'm not sure it's observable whether it's a forwards or backwards jump (and at the asm level, backwards is normally more efficient unless the loop entry has been unrolled) 02:38:04 The C standard defines it as a forward jump. 02:38:17 I also think that's a much more sensible definition. 02:38:40 Yes, forward jump is sense, and then the optimizer could alter it 02:39:21 Let me see if I can label all the points in a loop to support these behaviors. 02:39:43 in BF, is ] a conditional or unconditional jump? 02:39:53 { @break; forever`; @retry; { @thing; forever`; @redo; x := for(xs)`; { @continue; BODY; }; thing; }; break; } 02:39:59 (you can even make the argument that ] is conditional but [ is unconditional) 02:40:45 what does thing do? I'm still getting used to this notation 02:41:17 It exits the loop when you haven't used redo. 02:41:43 There's probably a better way to express this. 02:43:20 I can see what that operation doesn't have a standard name :-D 02:43:56 in a more normal notation, the labels go here: retry: while(condition) { redo: BODY; continue:; } break:; 02:44:53 I like break-from-named-block much more than goto for control flow. 02:45:15 It probably doesn't clarify things here, though. 02:45:35 (I think this is a good argument for retry/redo being confusing.) 02:46:26 I prefer goto rather than named continue/break. 02:46:54 I prefer named continue/break 02:46:58 goto has too many ways to be evil 02:47:43 I even wonder whether you should just not have continue/break and be explicit about writing the labels when you want them. 02:48:28 moony: Well, so does any other feature, I think. 02:48:30 hmm, the only situation in which I find myself tempted to use goto, and it clearly isn't a standin for a missing control structure, is when you have lots of if statements with the same body but they're scattered around the function so you can't combine the conditions, and they're too tightly tied to local variables to extract into a function 02:48:38 you can use temporary booleans for that instead but I think the goto is clearer 02:48:58 Yes, and I think there are also other situations where goto is clearer. 02:48:59 ais523: This sounds like a use case for the "blocks" I was describing earlier. 02:49:04 shachaf: I think the issue is that the loops are too generically named 02:49:43 I have once written how to convert a program with goto so that it only uses labeled continue/break, which, for example can be used with JavaScript. 02:49:50 something like Python's for-else has a clearly defined intended use, Haskell's map also has a clearly defined intended use, but both operations become a for loop in most languages even though they function very differently 02:50:17 things like continue and break have unclear semantics because the loops they're short-circuiting/exiting have varying semantics 02:50:59 With your goto notation, for (x in xs) { BODY } else { ELSE } is "for (x in xs) { BODY; continue: }; ELSE; break: " 02:51:41 yes 02:51:56 and a label before the ELSE should probably be called "fail" 02:53:43 Man, { x := for(xs)`; if(valid(x))`; switch(x)`; { case(A)`; ... }; { case(B)`; ... } } 02:53:46 So flat. 02:54:21 for (x in xs) { if (valid(x)) { switch(x) { Case A: ...; Case B: ... } } } 02:55:35 hmm, that's semantically correct but isn't it basically an if/else chain? 02:55:54 The switch part? Sure. 02:55:58 the original purpose of a switch was to hint to a compiler that it might want to make a jump table 02:56:13 but I guess that nowadays, maybe switches are just syntactic sugar for the if/else chain 02:59:24 Anyway I don't believe in exceptions so you'd need some other way to express "any". 02:59:52 I think it might reasonable to say that the loop breaks by default and you can explicitly tell it to continue instead. 03:00:16 But it seems infrequent enough that you can probably just write out the control flow yourself? 03:00:24 well, I'm using "exception" in a general sense, it's any situation where the code says "OK, this won't work" 03:00:39 Sure. 03:00:39 I think people normally just use "continue" for failures and "break" for successes 03:00:50 then an any loop is just a regular for loop 03:00:57 Maybe you can require an "else" clause for "any" loops. 03:18:56 -!- ais523 has quit (Quit: quit). 04:03:47 -!- Lord_of_Life has quit (Ping timeout: 245 seconds). 04:09:42 -!- Lord_of_Life has joined. 04:11:20 -!- kolontaev has quit (Quit: leaving). 04:24:20 [[ADxc]] N https://esolangs.org/w/index.php?oldid=65559 * A * (+467) Created page with "==Example== Suppose your snippets were AD, xc, 123, and ;l. Then: * AD should produce 1 * [[ADxc]] should produce 2 * ADxc123 should produce 3 * and ADxc123;l should produce..." 05:22:59 [[JUMP]] https://esolangs.org/w/index.php?diff=65560&oldid=41105 * Dtuser1337 * (+66) Adding some category. 05:24:15 [[Tarpit]] https://esolangs.org/w/index.php?diff=65561&oldid=40466 * Dtuser1337 * (+22) 05:28:18 [[JUMP]] https://esolangs.org/w/index.php?diff=65562&oldid=65560 * Dtuser1337 * (+34) Woosh 05:31:33 [[Truth-machine]] https://esolangs.org/w/index.php?diff=65563&oldid=64960 * Dtuser1337 * (+84) /* Jug */ 05:32:33 [[Truth-machine]] https://esolangs.org/w/index.php?diff=65564&oldid=65563 * Dtuser1337 * (+2) /* JUMP */ 06:16:02 [[Truth-machine]] https://esolangs.org/w/index.php?diff=65565&oldid=65564 * Dtuser1337 * (+207) My implementation of truth machine in emoji-gramming. 06:27:39 [[Turth-machine]] https://esolangs.org/w/index.php?diff=65566&oldid=63931 * Dtuser1337 * (+80) formatting codebase and adding categories. 06:30:17 [[Hello world program in esoteric languages]] https://esolangs.org/w/index.php?diff=65567&oldid=65558 * Dtuser1337 * (+43) /* Trigger */ 06:31:41 [[Truth-machine]] https://esolangs.org/w/index.php?diff=65568&oldid=65565 * Dtuser1337 * (-6) /* Turth-machine */ 06:35:56 [[Turth-machine]] https://esolangs.org/w/index.php?diff=65569&oldid=65566 * Dtuser1337 * (+45) 07:03:59 [[Capuirequiem]] https://esolangs.org/w/index.php?diff=65570&oldid=58513 * Dtuser1337 * (-1) /* External resources */ 07:05:09 [[RETURN]] https://esolangs.org/w/index.php?diff=65571&oldid=38078 * Dtuser1337 * (+13) /* External resources */ 07:06:53 [[Nil]] https://esolangs.org/w/index.php?diff=65572&oldid=52918 * Dtuser1337 * (+1) /* External resources */ 07:11:10 -!- Sgeo_ has joined. 07:14:56 -!- Sgeo has quit (Ping timeout: 272 seconds). 07:15:52 [[CopyPasta Language]] https://esolangs.org/w/index.php?diff=65573&oldid=56021 * Dtuser1337 * (+13) 07:53:24 -!- AnotherTest has joined. 08:25:27 -!- Lord_of_Life has quit (Ping timeout: 245 seconds). 08:26:12 -!- Sgeo__ has joined. 08:27:41 -!- Lord_of_Life has joined. 08:29:51 -!- Sgeo_ has quit (Ping timeout: 268 seconds). 09:09:16 -!- arseniiv has joined. 09:53:49 yes, that's how I think of it. imagine added labels like A: for (init; cond; step) { B: body; C: } D: 09:54:07 then retry/goto jumps to A, redo jumps to B, next/continue jumps to C, last/break jumps to D 10:43:43 ah, these polysigns are simply amateur algebra (bordering crackpottery), bleh. We take a vector space spanned by e[0], …, e[n−1], add a product e[i] e[j] = e[(i + j) mod n] and factor it all so e1 + … + en = 0. Why don’t people read good math textbooks and speak the consensus language 10:44:46 Polysigns? 10:45:32 though an analysis paper by Hagen von Eitzen doesn’t go in this straightforward way so IDK, maybe one can’t factor an algebra this way 10:46:58 Taneb: a person named sombrero posted a link on some images hosted on vixra ≈yesterday. I didn’t look at them but I saw that word in the abstract and went investigating what it is 10:47:27 unfortunately, my expectations were confirmed 10:48:16 (amateur math with crackpotish philosophical claims) 10:48:42 and also an old one: the analysis paper is 2009 10:49:08 b_jonas: Where that expands further to A: init; while (cond) { B: body; C: step; } D: presumably 10:49:26 shachaf: yes 10:49:35 linear algebra is sufficient to do many many things people try to invent 10:50:05 (of course it’s a trivial statement here) 10:50:18 (but not somewhere there) 10:50:21 shachaf: well actually more like A: { init; while (cond) { B: body; C: step; } } D: if you care about the scope of the variables declared in init 10:52:18 One of the nice things about my system is that many things gets correctly scoped by default. 10:52:48 Instead of Go-style "if x := e; p(x) { ... }" you can just write "{ x := e; if(p(x))`; ... }" 10:52:52 get 10:53:16 (ah, now I see the author uses a R[x] as a base because its multiplication is almost right) 10:54:07 shachaf: "if x:= e; p(x) { ... }" is actual syntax? 10:54:40 that looks odd to me because in ruby (and julia too) the semicolon would end the condition and start the loop body, but I guess it makes sense because sh works that way too 10:54:50 It's syntax in Go, yes. 10:55:11 the sh syntax for while loops allows you to put multiple statements in the condition too, which means you can put the test anywhere in the middle of the loop, you don't need a separate do-while loop or if-break 10:55:21 I think something like "if (auto x = e; p(x)) { ... }" is syntax in recent C++ too. 10:55:45 shachaf: dunno, I can't follow that 10:56:17 in perl you can write { my $x = e; p(x) or last; body } 10:56:29 It just declares something that's only in the scope of the if. 10:58:30 Presumably it means the same as { x := e; if (p(x)) { ... } } 11:00:20 -!- heroux has quit (Ping timeout: 248 seconds). 11:07:55 -!- heroux has joined. 11:12:52 Hmm, this looks like a good preamble for a SMETANA program to me :) Step 1. Swap step 1 with step 2. Step 2. Go to step 1. 11:18:54 Imagine an alternate universe where English didn't become a lingua franca, so there are entire libraries where all the identifiers are in German, ones where all of them are Russian, ones where all of them are in French, 11:19:19 but you sometimes end up with names mixing words from different languages because the concept has a name popularized by an earlier library, 11:19:39 and perhaps the oldest libraries with the worst names, like ncurses in our world, would even be all in latin. 11:20:17 It's ironic that you're calling English a "lingua franca" in that description. 11:20:35 and then some libraries with English names would appear too. 11:21:10 and you'd have to learn the basics of three or four different languages to understand source code, which was basically the status of scientific research in the 1960s 11:22:40 fenestram_crea 11:23:46 yes, you'd probably have to know not only the root words, but also conjugation in latin, french, italian, german, and russian to be able to guess the spelling of identifiers if you want to write code 11:24:01 Sounds fun, we should make this happen 11:24:39 Taneb: sure, but do it in a modern way, where latin is excluded but instead we have chinese identifiers too 11:25:07 I mean using latin directly is excluded, we can still have the french and italian and portugeese identifiers of course 11:25:16 (and englihs) 11:28:17 Hmm, a lot of libraries are American, so would naturally be written in English 11:28:24 Or maybe Spanish or Navajo or something 11:29:09 and we may have some short identifiers that are ambiguous because they mean something different depending on what language you're reading them in 11:29:16 I wonder if we can engineer such a situation in common keywords 11:30:37 `? zodiac 11:30:38 zodiac? ¯\(°​_o)/¯ 11:30:39 `? signs 11:30:41 signs? ¯\(°​_o)/¯ 11:30:42 `? signs of the zodiac 11:30:43 signs of the zodiac? ¯\(°​_o)/¯ 11:31:34 Oh I just realized that SMETANA may just be powerful enough to write a quine in. (But I'm targeting SMETANA To Infinity! for now.) 11:32:28 Well, if we steal the output instruction from S2I that is. 11:32:39 No output, no quine... :) 11:32:57 What if you just put the quine in memory? 11:33:05 For example, in the text section. 11:33:42 shachaf: Maybe you should refresh your memory (no pun intended) on what SMETANA is. 11:35:17 tha handle transform tool in gimp 2.10 is such a blessing, it was so hard to do proper alignments of multiple pictures with affine or perspective transforms before that 11:35:34 (SMETANA suffers from being a finite state machine; all data has to be encoded somehow in the program itself as written. So you need some serious compression to allow the program to contain a representation of itself, which stretches the term "quine" beyond the limits I'm willing to allow.) 11:37:22 how does it stretch the term "quine"? 11:37:23 shachaf: Of course we could define other output conventions without extending the language... like looking at the trace and mapping certain predetermined addresses to characters. 11:37:38 int-e: I didn't even know about SMETANA until I looked it up 25 minutes ago. 11:38:17 But I was making a general joke that is equally bad in any language. 11:38:50 (The joke is, define "output" to be some region of memory. At program startup, the program is loaded into memory, and therefore you can define that region to be the output and call it a quine.) 11:39:27 b_jonas: Well, I don't know how to delineate decompression and a BASIC-style 'LIST' function that makes quines trivial. 11:40:08 @time 11:40:12 Local time for shachaf is Mon Aug 19 04:40:08 2019 11:40:28 it's getting worse 11:40:38 [ fungot, is j-bot here? 11:40:39 b_jonas: not very quickly, and it has a non-real-time gc, but that's just what the user expected type character, got ' ( 1 2 3) 11:42:57 fungot's almost making sense again (though I guess that last part is closer to Lisp than to J?) 11:42:58 int-e: lms that doesn't violate her fnord, either. probably still aren't. is slib standard? 11:43:30 oh well, the moment of clarity has passed 11:46:28 fungot: Was that Lisp or J? 11:46:28 shachaf: ( define ( get-move-console) count)). the funge-98 standard is also written in scheme 11:46:44 fungot: the reason why people don't take you seriously is that you aren't using the One True Style for formatting your code. don't put whitespace after the left parenthesis or after the quote 11:46:44 b_jonas: goes where no other music fnord or has been in jail. we went to another bar. then we only need to cons stuff onto the top of 12:07:52 peksy arthropods, thinking that I invited them just because I left food open on the counter 12:08:26 if you want food, buy your own, darn it 12:10:45 -!- j-bot has joined. 12:10:49 [ 'hi' 12:10:50 FireFly: hi 12:11:38 nice, thanks 12:16:45 -!- andrewtheircer has joined. 12:30:12 is there a strongly typed golf language where, if your code isn't well-typed, it tries to put extra stuff like parenthesis and other extra stuff into your code until it's well-typed, so if you use the type system well, you can omit a lot of things from the parse tree? 12:30:28 would need a good built-in library and good heuristics for what to insert 12:31:00 and might be harder to program in than Jelly 12:33:30 also, is there a golf language that is basically the same as haskell but with a much more golfier syntax? 12:33:46 I don't think blsq counts as such 12:36:09 i dunno either, jonas 12:52:53 oh, I get it! if a C compiler environment isn't made for hard realtime programs, then the library defines the PRIoMAX macro to "llo", meaning that the maximum priority that your threads will be able to run is very low 12:57:40 ``` gcc -O -Wall -o /tmp/a -x c - <<<$'#include\n#include\n int main(void){ printf("maximum thread priority: %s\\n", PRIoMAX); return 0; }' && /tmp/a 12:57:41 maximum thread priority: lo 12:57:49 that's slight better, it's only low, not very low 13:15:24 -!- andrewtheircer has quit (Quit: Ping timeout (120 seconds)). 13:15:48 -!- arseniiv_ has joined. 13:17:33 -!- andrewtheircer has joined. 13:17:34 -!- arseniiv has quit (Ping timeout: 246 seconds). 13:19:50 oop 13:54:05 [[Special:Log/newusers]] create * Mid * New user account 14:16:34 apparently the We The Robots comics has ended the long hiatus, except it's not at the old address "http://www.chrisharding.net/wetherobots/" but at "http://www.wetherobots.com/" now 14:16:40 I haven't noticed until now 14:16:46 this is what happens when you break urls 14:29:55 -!- sleepnap has joined. 14:30:57 [[ABCD]] https://esolangs.org/w/index.php?diff=65574&oldid=46025 * Dtuser1337 * (+18) 14:39:34 question. is it possible to make a terminfo entry for irc that tells how to output colors and bold and italic with the mirc codes, and if so, will gcc output colored error messages in HackEso? 14:40:04 I don't know if gcc's colored error messages respects that 14:40:54 I made a terminfo entry once, but only by editing a single value in an existing entry 14:44:18 I should check the ncurses sources in case it already has such an entry though 14:54:45 whoa... are the terminfo thingies no longer distributed with ncurses? where do they come from then? 15:01:57 I'll check what debian thinks 15:04:46 the compiled entries come from the ncurses-term package, now how do I find what the source package is for that? 15:06:01 and the source package is apparently ncurses 15:06:53 ah 15:06:58 it is in ncurses 15:07:00 in one giant file 15:07:13 called ncurses-6.1/misc/terminfo.src 15:08:02 now the question is, can terminal libraries handle that the same code toggles bold on and off? 15:08:14 and also the way how you can't put a digit after a color code? 15:08:46 if not, we need a filter after it, which would be ugly 15:09:13 I guess for the latter, I can just force put two bold codes after a color code 15:09:21 and for the former, just hope it works 15:17:32 -!- xkapastel has joined. 15:19:35 that debian package ncurses-term, by the way, contains the _additional_ compiled terminfo entries, the decades of legacy terminals that nobody uses anymore 15:23:09 Imagine if people started adding footnotes* to their IRC messages 15:23:12 * like this one# 15:23:33 nice 15:23:39 it's actually split around the directory tree too, so the important terminfo entries are in /lib/terminfo , the rest are in /usr/share/terminfo , in case you're mounting usr late 15:23:53 `? footnote 1 15:23:54 May contain nuts. 15:23:59 can i add meta footnotes* 15:24:01 may contain nuts 15:26:22 `? footnote 1 15:26:23 May contain nuts. 15:32:32 fungot, do you have a calendar? has SGDQ 2019 started yet? 15:32:32 b_jonas: wtf is that? that problem haunts me. i don't think 15:32:39 uh ok 15:50:55 oh 16:03:19 -!- joast has quit (Quit: Leaving.). 16:03:58 -!- joast has joined. 16:52:42 fungot: I take it you don't watch speedruns then? 16:52:42 fizzie: if i remove the fan, heatsink, installation instructions and finally the body is ( are) returned. this expression type is used at a german bank for financial simulations. but that's a mere one character :) i'm not complaining 16:52:58 fungot, 45 minutes is how many hours? 16:52:59 b_jonas: you could just select another transport module system in the works to start off by reading sicp or htdp. 16:53:19 fungot: don't remove the fan and heatsink! the cpu will overheat 16:53:19 b_jonas: is that what you mean 16:53:31 yes 16:57:57 unfulfilling 17:04:13 -!- Phantom_Hoover has joined. 17:19:09 `footnote 1 17:19:09 May contain nuts. 17:20:24 `? password 17:20:25 The password of the month is surprising. 17:21:15 -!- Sgeo has joined. 17:24:12 -!- Sgeo__ has quit (Ping timeout: 272 seconds). 17:30:29 e 17:38:36 -!- FreeFull has joined. 17:53:49 -!- andrewtheircer has quit (Remote host closed the connection). 18:02:45 -!- arseniiv_ has changed nick to arseniiv. 18:09:56 Taneb: I¹ proved² the Riemann hypothesis³ false⁴ 18:10:30 but the page is too short for the footnote section so no one will know what I meant 18:10:50 mwahaha 18:12:41 though one footnote can be crammed into the margin (¹ I — Roman numeral 1) 18:12:55 s/into/onto 18:12:56 . o O ( "I proved the Riemann hypothesis" [is] false. ) 18:13:31 int-e: ah yes, newspaper heading grammer 18:13:48 Oh. We can claim that this is a portmanteau. 18:14:04 (hypothesis and is -> hypothesis) 18:14:33 `grWp portmanteau 18:14:35 friend:friend is a portmanteau of fritter and rend \ ism:Isms are philosophies, religions or ideologies that have branched off from older ones, such as Leninism or Buddhism. Etymologically "ism" is a backformation from portmanteaus on "schism". \ portmanteau:«Portmanteau» is the French spelling of “port man toe”. 18:35:37 `? shoehorn 18:35:38 shoehorn? ¯\(°​_o)/¯ 18:35:45 `? bottleneck 18:35:46 bottleneck? ¯\(°​_o)/¯ 18:39:37 int-e: :D but is omission of this kind grammatical? 18:40:10 (hypothesis and is -> hypothesis) => ah, quite clever 18:40:47 one can even claim that hypotheses < hypothesises :D 18:41:21 or not, it seems different phonetically? 18:41:38 arseniiv: FWIW I initially intended to provide a footnote 4 that would redefine "false", but didn't find any nice formulation... 18:42:15 why, false is true 18:42:49 though this is not nice at all 18:43:37 I had in mind conflating unprovedness, unprovability and proved negation 18:44:09 arseniiv: https://www.youtube.com/watch?v=8keZbZL2ero is somehow relevant 18:44:11 but decided to let it vague (v) for a time 18:48:29 int-e: hehe 18:55:55 -!- Melvar has quit (Quit: WeeChat 2.4). 19:26:05 -!- ais523 has joined. 19:26:18 -!- ais523 has quit (Client Quit). 19:26:31 -!- ais523 has joined. 19:26:55 is there a strongly typed golf language where, if your code isn't well-typed, it tries to put extra stuff like parenthesis and other extra stuff into your code until it's well-typed, so if you use the type system well, you can omit a lot of things from the parse tree? also, is there a golf language that is basically the same as haskell but with a much more golfier syntax? ← yes to both, and it's the same language: Husk 19:27:21 ooh, let me look 19:27:37 hmm, there doesn't seem to be an article on the wiki 19:29:58 CGCC users rarely bother with creating wiki articles for their golflangs :-( 19:30:14 they normally just link to the github repo to let people know wha the language is 19:30:27 https://github.com/barbuz/Husk in this case 19:30:38 -!- Sgeo_ has joined. 19:31:04 [[Husk]] N https://esolangs.org/w/index.php?oldid=65575 * B jonas * (+158) stub 19:31:33 [[Language list]] https://esolangs.org/w/index.php?diff=65576&oldid=65520 * B jonas * (+11) Husk 19:32:16 oh no, not yet another golf language with its own custom eight-bit character set 19:33:02 most golf languages do that 19:33:09 because control codes are /really/ hard to read and type 19:33:34 (a golf language I'm sporadically working on has its own /six/-bit character set, which has the advantage that I can make it a subset of ASCII) 19:33:48 -!- Sgeo has quit (Ping timeout: 245 seconds). 19:34:34 I guess it's still better than if the golf language has a tricky variable length compression, so reading and writing it is more difficult than just translating characters 19:34:48 like a hufmann encoding or even worse 19:34:51 with shift codes 19:35:28 of course Jelly's compressed string modes are sort of like that 19:45:06 -!- heroux has quit (Ping timeout: 268 seconds). 19:46:59 -!- adu has joined. 19:47:12 interesting 19:51:39 -!- heroux has joined. 20:03:32 ais523: thanks for an interesting language! 20:04:02 though golflangs make my head spin, there are so many details because of need to compress 20:04:31 nondeterministic typing there is cool 20:05:20 (hopefully it’s implemented in such a way as to not blow up combinatorily) 20:08:09 I’d type overloaded multimethods using union typing, but am I right it’s not easily added to Hindley—Milner-like inference? 20:08:16 it might blow up at compile time but that's probably forgivable, golflang programs are short 20:09:12 -!- Melvar has joined. 20:10:01 I wonder if there's a golf language that has a built-in that gets the OEIS sequence from its index, and to compute its terms, tries to automatically run code in the OEIS entry, so requires Maple and Mathematica plus ten gigabytes of other software to run. 20:10:22 -!- sleepnap has quit (Quit: Leaving.). 20:10:28 b_jonas: (rofl) 20:10:52 -!- sleepnap has joined. 20:11:23 and of course you download a snapshot of the OEIS at the time you build the compiler, so that it doesn't cheat by looking info up on the internet that may be newer than the language 20:13:25 -!- sleepnap has quit (Client Quit). 20:19:13 -!- Melvar has quit (Ping timeout: 245 seconds). 20:19:37 -!- Melvar has joined. 20:21:10 b_jonas: I think someone tried that once but failed 20:21:47 a better approach would probably be to encourage people to submit OEIS programs in a standard machine code; WebAssembly comes to mind 20:21:48 yeah, this does seem like an interesting language 20:22:11 ais523: does WebAssembly have bigints? 20:22:32 it's a machine code, so not natively in the same sense that x86 doesn't have native bigints 20:22:38 but you can run GMP or the like on it easily enough 20:23:03 ais523: I mean as a standard library that's usually accessible or something, not as a "built-in" 20:23:27 WebAssembly doesn't have standard libraries, you're supposed to compile your own language's standard library onto it 20:23:31 so that you don't have to bundle a copy of the bigint multiplication routine with the code of every quickly growing sequence 20:23:57 a typical WebAssembly program is shipped with a decent proportion of libc 20:23:58 (though I presume you'd allow a single object file that implements multiple OEIS sequences) 20:24:17 I guess object files might make more sense than executables, in that case 20:25:24 [[Husk]] https://esolangs.org/w/index.php?diff=65577&oldid=65575 * B jonas * (+465) 20:25:46 it could be executables, that's not the difference I care about here 20:25:56 just that there are bunches of OEIS sequences that are closely related 20:26:08 so it would be redundant to copy the code to each one 20:26:32 -!- Lord_of_Life_ has joined. 20:27:39 -!- Lord_of_Life has quit (Ping timeout: 268 seconds). 20:29:27 -!- Lord_of_Life_ has changed nick to Lord_of_Life. 20:36:44 -!- ais523 has quit (Ping timeout: 272 seconds). 21:08:56 -!- ais523 has joined. 21:10:27 well, executables are self-contained, but object files don't have to be 21:11:58 I wrote a program to generate ELF executables but it seems to me object files might actually be trickier 21:12:26 Hmm, maybe just differently tricky. 21:13:02 The tricky thing is that you need a bunch of information in sections for the linker to interpret. But it can handle relocations and so on for you, I suppose. 21:13:46 shachaf: do you also emit basic debug information like the code span of each function? 21:13:56 Not yet. 21:14:17 I guess that is sort of redundant because gdb can guess the function from the function symbols, without the debug info 21:14:30 (Because the program just emits some fixed handwritten x86 code.) 21:14:57 I do emit function information, I think. But the only function is _start. 21:15:35 `` objdump -d tmp/out.a 21:15:36 ​ \ tmp/out.a: file format elf64-x86-64 \ \ \ Disassembly of section .text: \ \ 0000000000000178 <_start>: \ 178:48 31 ed xor %rbp,%rbp \ 17b:49 89 d2 mov %rdx,%r10 \ 17e:48 b8 66 69 6e 61 6c movabs $0xa796c6c616e6966,%rax \ 185:6c 79 0a \ 188:50 push %rax \ 189:b8 01 00 00 00 mov $0x1,%eax \ 18e:bf 01 00 00 00 mov $0x1,%edi \ 193:48 89 e6 mov 21:15:55 nice 21:16:00 what sort of calling convention is that? :-D 21:16:10 I'm used to seeing functions starting out by messing around with sp and bp 21:16:13 but zeroing bp is weird 21:16:20 I'm guessing it's just being used as a general-purpose register? 21:16:29 That's standard in the amd64 ABI. 21:16:39 To mark the outermost stack frame. 21:16:43 aha 21:17:05 couldn't the outermost stack frame actually need it as a base pointer, though? 21:17:56 I think _start normally calls another entry point almost immediately. 21:17:57 oh, that string says "finally" 21:18:17 I initially misread it as "fitally", I'm not as good at converting hex to ascii in my head as I'd like 21:18:58 hmm… do you have an opinion on caller-saved versus callee-saved registers? 21:19:17 `perl -eprint pack"q",0xa796c6c616e6966 # let's ask a computer to do that, just to check 21:19:18 finally 21:19:18 I don't remember. 21:19:41 I don't have a strong opinion, at least. Maybe I had one in the past. 21:20:27 I think someone who knows more about register renaming and things than I do should give me an opinion. 21:27:45 -!- asdfbot has joined. 21:29:15 I think it's reasonable for _start to be special in this way because it's not actually a function. 21:29:41 =rasm xor rax, rax 21:29:49 =rasm2 xor rax, rax 21:29:49 4831c0 21:29:54 * moony happy 21:30:25 Intel style?! 21:30:31 yes 21:30:54 =rasm2 -s att xor %rax, %rax 21:30:54 Unknown argument: s 21:30:54 21:30:54 Use --help for options 21:31:06 =rasm2 -satt xor %rax, %rax 21:31:06 Unknown arguments: s, t 21:31:06 21:31:06 Use --help for options 21:31:11 ): 21:31:24 Which order should I write the operands in in my assembler? 21:31:34 radare2 on hackeso when 21:31:42 shachaf: use NASM syntax, it's better than either intel or att 21:31:47 ^ 21:31:55 Isn't it pretty Intely? 21:32:00 it's intel-like yes 21:32:03 att sucks 21:32:03 that is if this is an assembler for x86 21:32:58 Presumably I want to target a bunch of platforms 21:33:11 At least x86 and ARM 21:33:23 Maybe WebAssembly? 21:33:34 shachaf: https://github.com/asmotor/asmotor contribute to this instead then 21:34:31 -!- LBPHacker has joined. 21:34:38 -!- BWBellairs has joined. 21:34:41 good day 21:34:43 `welcome LBPHacker 21:34:44 you should probably use xor %eax,%eax though, because it encodes shorter 21:34:44 LBPHacker: 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.) 21:34:45 blame moony for everything I do here :P 21:34:52 ): 21:35:44 Why contribute to that instead? 21:35:55 good, multi-CPU assembler. 21:36:09 more assemblers is just more competing standards right now 21:36:29 see http://yasm.tortall.net/ for x86 21:37:03 or invent your own syntax that looks similar to the others but is incompatible in subtle ways that are hard to debug 21:37:22 -!- sleepnap has joined. 21:37:24 I primarily wanted a library rather than something with a parser anyway 21:37:37 ah 21:37:45 uh 21:37:48 capstone not work? 21:38:10 I don't know? 21:38:19 oh, right, capstone's a disassembler 21:38:38 http://www.keystone-engine.org/ 21:39:04 that's it's assembler counterpart 21:39:19 for disassembling, you can try Agner's disassembler 21:39:39 or http://www.capstone-engine.org/ as i mentioned 21:41:27 There's only one application I previously wanted a general disassembler library for, and it was kind of ridiculous. 21:42:12 did it involve malware research or kernel debugging? 21:42:44 No, the goal was to make a variant of strace that traces I/O to memory mapped files precisely. 21:42:56 ouch 21:43:00 yes, that is ridiculous 21:43:36 In order to trace exactly which bytes were read from or written to, you need to disassemble the instruction. 21:44:41 I think there are some debuggers that have this feature. 21:44:41 that, or mprotect all of the mapped pages to 0 permissions after every access, and catch the segfault and see what the siginfo says 21:45:17 That's the approach I'm proposing. 21:45:17 wait, can't intel's built-in debug faults already tell what's read and written, and doesn't the kernel expose that in siginfo? 21:45:34 Certainly not stepping through every instruction, that seems way too slow. 21:45:50 But when you get the SEGV you need to figure out exactly which octets were read or written. 21:45:52 * ais523 has been reading the x86_64 ABI 21:46:02 it gives advice on how to implement exabyte-size functions 21:46:10 I wonder what circumstances would require you to write one of those 21:46:24 I can not imagine a sane one 21:46:53 hmm 21:47:02 why do me and ais523 have the same name color in weechat 21:47:22 we're alphabetical miles apart 21:47:35 I don't know how all that x86 stuff works 21:47:48 b_jonas: it works via a generator that runs on hot garbage 21:48:06 ais523: a compiler may have to, when it's forced to compile firefox 21:48:27 i mean 21:48:33 maybe you unroll a massive loop? 21:49:12 LBPHacker: help i need ideas for why one would use a exabyte sized functions 21:49:38 I still have trouble imagining exabytes of data, although there are probably some companies who store that much nowadays 21:49:38 hwhat 21:49:41 though I think they don't have functions larger than gigabyte sized 21:49:42 but exabytes of /code/? 21:49:45 ^ 21:50:06 I guess when you're writing an ABI you need to take all eventualities into account 21:50:48 ais523: right, so that twenty years later, when the required hardware is available, different groups of people don't start inventing incompatible exensions 21:50:59 ais523: I doubt there's any company that stores an exabyte of data on one machine. 21:51:23 not even in memory? 21:51:29 my guess is that nobody does but I'm not sure 21:51:30 I wonder what happens if you give GCC infinite (to the max x86-64 allows) RAM and have it compile a exabyte sized function 21:51:43 ais523: the most we can store per machine right now is about 1PB i think 21:52:10 so 1024 machines per exabyte 21:52:18 there are definitely use cases in which you want as much in-memory storage as possible in one machine and don't care if it's lost to a crash 21:52:39 moony: even a petabyte is a lot, yeah 21:53:02 you'd need 32 hard disks, each one 32 terabytes size, or something 21:53:12 moony: I'm missing a lot of context here but iirc x86-64 supports an address space of 2**52 21:53:12 ais523: the most RAM per machine right now is 8TB, assuming a AMD EPYC based server. 21:53:19 ais523: such as video games, sure 21:53:28 moony: so not even in the petabyte range 21:53:33 or trying to break cryptography stuff by building huge tables 21:53:42 and this is asof just a few days ago btw 21:53:44 or are we talking possibly out of memory 21:53:56 before the latest EPYC units were released, it was a max of 4TB per machine 21:54:15 LBPHacker: possibly out of memory i bet 21:54:15 or rather 21:54:20 memory paging/swapping/whatever 21:54:32 LBPHacker: I disagree, https://esolangs.org/logs/2019-08-05.html#luc 21:54:44 oh 5-level 21:54:47 fun 21:54:59 LBPHacker: it's the 5-level one that would support 52 bits I think 21:55:12 the current cpus support only up to 48 bits 21:55:39 well I mean I remember 9+9+9+9+12, which is the 4-level 21:55:41 moony: what's the most fast solid state storage you can have in a machine? 21:55:47 uh 21:55:50 how many address pins your cpu has is another matter :P 21:55:58 I dunno, i know some servers with 48+ NVME slots 21:56:00 oh 21:56:02 ok reee I'm dumb 21:56:06 36+12 21:56:11 even if your CPU is short on address pins you could always use… bank switching! 21:56:12 see this is why I don't do addition 21:56:36 although it tends not to play very nicely with the concept of an operating system 21:56:48 b_jonas: with a modern EPYC system, I think it'd max out at 128 NVMe devices, assuming you somehow utilized all 128 PCIe lanes from both CPUs 21:57:18 LBPHacker: I gave up on arithmetic years ago, when I debugged a segfault for hours, then found that I allocated 8092 bytes instead of 8192 21:57:20 (Yes, EPYC servers are currently the most capable. Perfect.) 21:57:34 these days I'd let the computer figure out the size from a multiplication or shift 21:57:41 lol. yes, that is why I don't do decimal either 21:57:58 uh 21:58:00 hmm 21:58:07 moony: and how large can those NBMe devices be? 21:58:07 how many SATA devices can you have per PCIe lane 21:58:15 Or write 0x2000 21:58:34 shachaf: yes, that too, though sometimes I mess that up too 21:58:59 moony: also how many ways is the largest possible NUMA in a machine? 21:59:29 uh 21:59:49 I dunno NUMA 22:00:44 haha, the PLT uses one format for the first 102261125 entries and changes to a different format from the 102261126th onwards 22:00:54 computer hardware is getting ridiculously powerful. good thing I have my programmable calculator, with 2 kilobytes of RAM, battery-backed to make it persistent, in the shelf 22:00:55 I think EPYC zen 2 server processors are one NUMA P each\ 22:01:00 s/shelf/drawer/ 22:01:07 I wonder how many programs a) care about the PLT format at all and b) are unaware of that detail 22:01:21 b_jonas: 128 cores per server \o/ 22:02:11 128 cores, with slots for 4 accelerator cards 22:02:16 or was it 8 22:02:28 (the reason is that there's some shared code between the entries that they normally reach via a jump, but you can't write the jump instruction when you're too far from the start of the PLT) 22:02:50 moony: nice. have you ever written a program for those that spawns 128 parallel processes to speed up something, but some library you call in them tries to be automatically smart and spawns 128 parallel threads in each of them? 22:03:03 pffft 22:03:21 If I generate an amd64 program, should I just not use a PLT? 22:03:30 that's happened to me on 12 cores only, I haven't seen a 128 core machine 22:03:37 2-way NUMA too 22:03:42 b_jonas: 128 core machines are on the market as of a few days ago 22:03:46 shachaf: I'm sceptical about the value of the PLT and GOT 22:03:46 they're 2-way as well 22:03:52 Also, should I take Microsoft's approach and say "x64" instead of "x86-64" or "amd64"? It's shorter. 22:03:59 go ahead 22:04:07 shachaf: no 22:04:08 ais523: Hmm, what's the alternative to the GOT in ELF files? 22:04:13 x64 probably refers to an unrelated CPU 22:04:18 b_jonas: they're also impressively cheap, 7k for the highest end 64-core CPU from AMD 22:04:26 and it absolutely kills in terms of performance 22:04:43 nice 22:04:51 somethingsomething50kfor56coresfromintel 22:04:55 shachaf: well, the GOT basically lets you find addresses that aren't compile-time constants, but doing arithmetic on %rip can also do that if you know that the entire program has moved the same amount 22:05:04 I'd like a powerful computer, but not that powerful 22:05:11 so it'd only be useful when connecting between two parts of the program that are ASLRed by different amounts 22:05:30 b_jonas: AMD has 16-core processors for desktop for about $800 i think, coming to market real soon 22:05:46 ais523: Right, but isn't every library loaded at a random address? 22:06:39 shachaf: yes, but there isn't a whole lot of actual communication done between libraries through, e.g., shared global constants 22:07:26 But what about calls to library functions? 22:07:31 so I'm not sure that I see any particular difference between absolute and position-independent code; you need the dynamic linker to update function calls in one library to point to the other anyway 22:07:58 the purpose of the PLT is pretty much just so that you can avoid editing the .text segment, which forces you to use a private rather than shared map 22:08:09 Right, so the PLT seems kind of pointless. 22:08:24 But isn't the GOT the alternative that doesn't edit .text? 22:08:39 the GOT and PLT are very similar 22:09:09 the difference is that GOT is general-purpose and the PLT is just wrappers for function calls 22:09:23 (this lets you give a location in the PLT when you need to give someone a function pointer for a callback) 22:09:45 LBPHacker: exascale R316 when 22:09:53 uwot 22:09:56 that said, position-independent code doesn't move while it's running, so if you need to give someone a function pointer, you could probably just lea it yourself and pass them the resulting absolute address 22:10:01 why do we have to have these interesting conversations during the night when I have to get up early the next day? the sleep cycle of this channel is messe dup 22:10:11 hi i'm american 22:10:14 Maybe I'm saying GOT when I mean something else. 22:10:15 it's just the afternoon here 22:10:28 GOT sounds an awful lot like GDT 22:10:39 What's the way you're proposing to call a dynamically linked function? 22:10:42 I know GDT, but not GOT.. 22:11:13 moony: you are, yes 22:12:11 I think you should have something like "movq some_offset(%rip), %rax; callq %rax", where that offset is an offset into a segment the dynamic linker populates with the correct address at load time. 22:12:47 Or maybe that's not what I think? 22:14:29 shachaf: my suggestion is callq 0(%rip) in the executable, the dynamic linker edits the 0 to the actual distance when the executable is loaded 22:14:54 that works well for executable → library calls as long as they're both in the first 31 bits (they typically will be) 22:15:08 But that requires editing .text such that it can't be shared, right? 22:15:12 it doesn't work as well for library → library calls, though, because you'd ideally want to be able to store the libraries in a shared mapping 22:15:22 right, that prevents a shared .text 22:15:23 Maybe you're saying that's irrelevant. 22:15:32 I consider it insufficiently relevant 22:15:48 One thing I like being able to do is load a new copy of a .so at runtime repeatedly. 22:16:04 I guess that's still possible with that approach. 22:16:17 But it might require a page to be W|X. 22:16:21 but if it's a problem, the next step would be to have a separate section that groups together jumps to functions, do calls by calling that section, and have the dynamic linker edit the jump targets 22:16:43 I was going to say that sounds like the PLT, but I guess the PLT has an extra level of indirection. 22:17:00 indeed 22:17:07 I don't understand why it has that extra level 22:17:23 I think it's to allow lazy loading. 22:17:45 I think lazy loading is probably a bad idea, though. 22:18:23 -!- AnotherTest has quit (Ping timeout: 245 seconds). 22:18:23 the remaning hard case is when one library (or the executable) refers to a global variable in another library (or the executable) 22:18:35 my preferred solution to this would be simply to ban it :-D 22:18:47 Hmm, I use this in the aforementioned use case. 22:19:27 Specifically my program is made of two parts, a loader binary and an application .so. 22:19:29 in cases like this, getter/setter methods would normally be a better API 22:19:58 The .so refers to some global variables defined in the loader to share state across reloads. 22:20:08 I suppose the loader could just pass it a pointer. 22:21:04 ooh, I think I know why the PLT might be useful: it's to avoid invalidating function pointers into a library after it's reloaded 22:21:34 I think those are invalidated anyway. 22:21:47 I guess they have to be 22:21:48 Well, I'm loading the library with dlopen. 22:21:54 So the PLT is irrelevant. 22:22:05 (In the loader->library direction.) 22:27:15 -!- arseniiv has quit (Ping timeout: 248 seconds). 22:27:25 anyway, my current hobby is being annoyed at compiler optimisers 22:27:37 One annoying thing about structuring the program this way is that the .so can't use any global variables (that survive across reloads). 22:27:54 Most of the global variables I'm importing from the loader really belong in the library anyway. 22:28:21 unsigned short f(unsigned long long *p) { unsigned long long rp = *p; if ((rp & 0xFF00000000000000LLU) != 0x8000000000000000LLU) return 0; return (unsigned short)((rp ^ 0x8000000000000000LLU) >> 48); } 22:28:33 ^ that is the test function that I've been working on optimising 22:28:53 I feel like, if you want to make your programs fast, optimizing compilers are rarely the right place to look. 22:29:22 this compiles to 45 bytes with gcc -Os, 34 bytes with clang -Os 22:29:48 I got it down to 13 bytes of hand-written asm 22:30:04 Oh man. That's a lot of bytes. 22:30:07 the reason I'm annoyed is that I want to be able to write clear code and rely on compiler optimisations 22:30:52 I had a go at trying to generate good asm via repeatedly hand-optimising the C file 22:31:18 that got it down to 24 bytes on clang and 17 on gcc, but at the cost of requiring -fno-strict-aliasing 22:31:51 * ais523 has an idea 22:32:01 " haha, the PLT uses one format for the first 102261125 entries and changes to a different format from the 102261126th onwards" => I wonder if I should addquote that 22:32:48 helps on clang, at least 22:33:05 you can hit an LLVM optimiser idiom and get back to strictly conforming C, which is nice 22:33:06 getter/setter methods? why not a function that returns the address of the variable instead? 22:33:31 I guess that works in most cases 22:33:44 I like getter/setter because it abstracts away the way in which the variable is stored internally 22:34:09 but many of the cases you'd need that, e.g. if you need to move the variable to thread-local-storage, still let you take references to it 22:34:20 `` printf "%x" 102261125 22:34:21 6186185 22:34:59 ais523: isn't the extra indirection so that you can take a function pointer to a function in another library, and equality-compare it in C to the same function pointer taken from a third library, and make them return equal? 22:35:06 the extra indirection in the PLT that is 22:35:26 oh, could be 22:35:27 How does the PLT let you do that? 22:35:41 ais523: you have made sure that you aren't using a too old compiler or an MS compiler, right? 22:36:06 shachaf: ^ this is a really good example of my belief that immutable things should be treated as indistinguishable from values, with any references managed behind the scenes 22:36:52 reference-== on immutable things is not a useful operation (except possibly as an optimisation hint) and if you accidentally expose it in your language semantics, a lot of contortions are needed to avoid breaking programs that rely on it 22:37:02 ais523: for a thread-local variable, you call the function again each time you're not sure you're in the same thread. that's how errno works. 22:37:18 in retrospect, errno was a mistake 22:37:23 but it took a while for that to become apparent 22:37:32 errno is a big mistake 22:37:39 ``` gcc -E - <<<$'#include\nerrno' | tail 22:37:40 ​# 25 "/usr/include/x86_64-linux-gnu/bits/errno.h" 2 3 4 \ # 50 "/usr/include/x86_64-linux-gnu/bits/errno.h" 3 4 \ \ # 50 "/usr/include/x86_64-linux-gnu/bits/errno.h" 3 4 \ extern int *__errno_location (void) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__const__)); \ # 36 "/usr/include/errno.h" 2 3 4 \ # 58 "/usr/include/errno.h" 3 4 \ \ # 2 "" 2 \ (*__errno_location ()) 22:38:00 that "leaf" in the header file is curious 22:38:04 moony: yes, and C99 at least partly gets rid of it by allowing such fast functions as sqrt to not necessarily set it 22:38:12 when would a function need to know that it's /calling/ a leaf functiion 22:38:12 and floor 22:38:47 hmm, apparently it means "this function will never call a callback function, nor longjmp" 22:39:09 which does seem potentially useful as an optimisation hint 22:42:03 ok, not floor, sorry 22:42:07 but sqrt 22:42:20 So when foo is a dynamiclly linked function and it's used as a function pointer, what does that pointer point to? 22:43:15 shachaf: I don't know. it might not even work the way I explained, maybe it points to different places depending on which library you're naming the function pointer. I never tested it. 22:43:16 Apparently it's not the PLT entry. 22:44:17 I made a test program but now I gotta figure out what it's actually doing. 22:45:08 A PLT entry isn't even generated when you get a function pointer. Only when you call the function directly. 22:45:30 Which is pretty bizarre because "calling the function directly" nominally happens through a function pointer, in C. 22:46:34 shachaf: does it really? I thought the function (reference) just decays to a function pointer when used as such, just like how an array decays to a pointer 22:46:47 and when you call it, that doesn't happen 22:47:21 That's what the C standard says. 22:47:44 not that that's an observable reference, and in any case, this is something that can and will be optimized 22:47:49 When I get back to the computer I'll test it more directly. 22:48:20 ok 22:48:59 but still, I think compilers will likely optimize it, because direct function calls are pretty common 22:49:10 Hmm, maybe it is observable, for the reason you said (making function pointers equal across libraries). 22:49:39 Since each library has its own PLT. 22:50:37 shachaf: does C even guarantee the thing about making function pointers equal? 22:52:12 I'm not sure you are even allowed to compare two function pointers without invoking undefined behavior unless one of them is a null pointer 22:52:35 ah no, you probably can 22:52:57 for equal comparisons, you don't get UB 22:53:21 but I don't know if two function pointers to the same pointer are guaranteed to be equal, even within a compilation unit 22:53:25 you can compare for equality, but not for < and > 22:53:44 ais523: right, but what result do you get? 22:54:02 does f == f have to return true if f is a function? 22:54:03 who knows, this is C we're talking about :-D 22:54:06 yeah 22:54:19 Yes, with optimizations it turns into a PLT call in gcc. 22:55:03 I think you can do equal comparisons on function pointers only because some apis treat null pointers in a special way 22:55:20 shachaf: nice 22:55:27 -!- b_jonas has quit (Quit: leaving). 22:56:05 Yes, the function pointer comes from the GOT. 23:00:57 Ugh, dynamic linking is so complicated. 23:02:08 -!- Phantom_Hoover has quit (Ping timeout: 245 seconds). 23:09:40 I'm kind of annoyed that when you lookify up something about dynamic linking or ELF files or whatever most of the search results are about random programs that print error messages involving those things rather than anything about how those things actually work. 23:16:18 yea... 23:17:10 At least writing an emitter is probably way better than writing a loader (which needs to handle all the old things no one uses anymore). 23:17:15 -!- xkapastel has quit (Quit: Connection closed for inactivity). 23:19:13 I'm confused by the last paragraph in https://www.airs.com/blog/archives/549 23:19:21 "It is possible to design a statically linked PIE, in which the program relocates itself at startup time." 23:19:31 Why does the program need to relocate itself? Doesn't the kernel do that? 23:35:18 -!- sleepnap has quit (Quit: Leaving.). 23:36:56 I'd have to look to check, but I think this is "relocation" in the sense of "processing ELF symbol relocations", not in the sense of "mapping into memory" 23:37:34 Because a static PIE binary is more-or-less a shared object that happens to have an entry point and no external dependencies. 23:37:58 Why would ELF symbol relocations be relevant for a statically linked executable? 23:39:34 The executable's GOT and PLT needs populated. 23:40:15 What, are you from Pittsburgh now? 23:40:29 I don't see why a statically linked executable would have a GOT or PLT. 23:41:06 Because you're implemented a static PIE binary by emitting, essentially, a shared object. That happens to have an entry point. 23:41:43 Yes, but that's just a technicality due to the kernel only randomizing ET_DYN files. 23:41:58 There's no need to emit a DYNAMIC segment. 23:43:58 Trying to remember exactly how musl does static PIE binary support... 23:45:00 movzwl -0x2(%rdi,%rax,1),%ecx \ mov %ecx,%edx \ xor $0x8060,%edx \ movzwl %dx,%edx 23:45:02 oh come on 23:45:12 that last movzwl is just some really obvious dead code 23:45:37 the top 16 bits of %edx didn't stop being 0 just because you XORed the bottom 16 23:47:18 I need to stop taking it personally when compilers generate ridiculous code, but still, that one really hurts 23:48:17 meanwhile, clang optimised (x ^ 0x807F) >= 0x00A0 into (x ^ 0x8060) >= 0x00A0 which doesn't really change anything but is amusing 23:49:29 Looks like musl's implementation is that it links in the dynamic linker to static PIE binaries. 23:50:18 Or, rather, a portion of it. 23:50:30 Why? 23:50:56 https://git.musl-libc.org/cgit/musl/tree/ldso/dlstart.c It's this portion. 23:51:24 Just the startup code for the dynamic linker, not the full thing. 23:52:25 Oh, it's doing very very little. 23:52:34 Not even really processing relocations. 23:55:02 later on there's also the beautiful "xor %r8d,%r8d \ movzbl %r8b,%eax" (with, AFAICT %r8 dying immediately afterwards) 23:55:30 *with, AFAICT, 23:59:39 -!- tromp_ has quit (Remote host closed the connection). 2019-08-20: 00:23:13 -!- FreeFull has quit. 00:26:56 -!- sleepnap has joined. 00:28:52 -!- tromp has joined. 00:28:58 -!- sleepnap1 has joined. 00:31:14 -!- sleepnap has quit (Ping timeout: 244 seconds). 00:33:15 -!- tromp has quit (Ping timeout: 252 seconds). 00:52:25 -!- ais523 has quit (Quit: quit). 01:01:38 -!- sleepnap1 has quit (Quit: Leaving.). 02:37:32 -!- heroux has quit (Ping timeout: 245 seconds). 02:37:44 -!- heroux has joined. 03:50:08 -!- Sgeo__ has joined. 03:52:58 -!- Sgeo_ has quit (Ping timeout: 245 seconds). 05:33:23 -!- tromp has joined. 05:33:39 -!- uplime has quit (Quit: ZNC 1.7.3 - https://znc.in). 05:34:08 -!- uplime has joined. 05:37:57 -!- tromp has quit (Ping timeout: 252 seconds). 06:45:19 -!- tromp has joined. 07:01:01 $ a=b b=a; echo $((a)) 07:01:03 bash: b: expression recursion level exceeded (error token is "b") 07:38:51 -!- xkapastel has joined. 07:58:56 -!- AnotherTest has joined. 08:12:32 -!- Phantom_Hoover has joined. 08:27:58 -!- Lord_of_Life has quit (Ping timeout: 272 seconds). 08:28:55 -!- Lord_of_Life has joined. 08:37:04 -!- Phantom_Hoover has quit (Quit: Leaving). 09:13:46 -!- onon has left ("†"). 09:44:24 I've just realised that the idea I had for writing a text editor is, rougly speaking, Smalltalk 09:52:17 -!- cpressey has joined. 09:56:31 Good morning. I've been reading the R7RS. It's been making me laugh. 09:58:32 I don't mean to say that it is laughable; overall, I like Scheme. 09:58:40 what funny abut it 09:59:02 think R7RS could be better but course corrected well 09:59:59 Mainly, it's amusing when they leave so much wiggle room. 10:00:14 For example, a Scheme implementation is allowed to use symbols outside Unicode if it wants. 10:00:22 They say this explicitly. 10:01:25 oh yeah 10:01:33 they don't even specify stuff about filesystem paths for importing files 10:01:53 in case someone wants an SQL database backed complaint r7rs implementation 10:01:59 the result is you cannot portably do a multiple file project 10:04:56 https://rain-1.github.io/scheme-srfi-1.html 10:06:47 rain1: Is it ironic that *none* of those look like https://srfi.schemers.org/srfi-55/srfi-55.html ? 10:07:24 wow i didnt even realize that 10:07:28 i should add that 10:07:43 (require-extension (srfi 1)) might work in one or more of those 10:07:43 but yeah this is the mess we're in 10:07:51 and everybody is wondering why nobody uses scheme 10:12:17 I still prefer it over Common Lisp and Clojure (but I'm probably not typical). I'd like it even more if mutability was forbidden. I thought there was a SRFI for this, but I went looking for it again and I couldn't find it. 10:12:47 I would remove the call/cc and similar operators 10:12:53 I think it's become clear that they aren't useful 10:16:00 Scheme (and Haskell) have a lot of features in them that are mainly to support PL research and education... I'd put call/cc in that bucket. 10:16:31 For learning about continuations, it's cool. Will I ever actually *use* it...? Probably not. 10:48:39 continuations are easy 10:48:45 delimited continuations are weird 10:49:06 All programming constructions are weird 10:49:08 (bla bla shift bla bla reset bla bla) 10:49:51 Taneb: that was an opinion, of course 10:49:58 Yes 10:50:05 Or maybe a statement that I grokked the former but not the latter. 10:50:42 Whereas what I said was a contrarian but defensible statement made partially in jest 10:57:33 All continuations are delimited, though. 10:57:47 -!- xkapastel has quit (Quit: Connection closed for inactivity). 10:57:58 Therefore continuations are easy and weird 10:59:01 I have the start of a CPS concatenative language but I had to use a nonstandard definition of function composition to get it 10:59:23 cpressey: cpresshey 10:59:50 -!- arseniiv has joined. 11:00:05 I'm mystified by this, actually: 11:00:30 * I feel like I understand undelimited continuations 11:00:41 * I feel like I don't understand delimited continuations 11:00:49 * All continuations are delimited 11:01:24 Actually, see "A theory of regulation." in https://www.bloomberg.com/opinion/articles/2017-01-24/metrics-fees-and-regulations 11:01:55 Thing I didn't expect after your list of bullet points about continuations: a link to Bloomberg.com 11:02:26 I only realized that I was quoting that article after I finished writing the bullet points. 11:03:15 shachaf: I'm confused by the shift/reset syntax, and how it translates to the common functional (a -> r) -> r idea. 11:04:08 Maybe I just haven't read the right paper(s) yet. 11:04:51 Haskell Cont continuations are delimited by runCont. 11:05:36 As I said, I'm mainly confused by shift & reset. 11:06:08 I suspect "delimited" refers to something that's not actually the continuation per se -- but I don't really know. 11:06:37 Well, whole program continuations are silly. 11:07:28 Oh, my pseudo-continuation thing has a delimiter, normally written {}. 11:07:34 To carve out a context from a program you need a point where the context starts, and a hole, "delimiting" it from two sides. 11:08:26 When you write { ...foo`...; ... }, foo gets "{\x; ...x...; ... }" as an argument. 11:08:48 Rather than the entire rest of the program. 11:11:27 In the classic Scheme shift-reset thing, shift is a binder, right? 11:11:31 int-e: shift/reset confuses me too. This or previous year I have seen something more natural but I don’t remember if it was purely about delimited continuations or something other 11:12:58 hm how algebraic effects relate to continuations? At least syntactic ideas about the former are more understandable for me 11:13:25 s/about/related to 11:14:20 that handling case-like construct and data-like definition of an effect 11:14:25 Oh, I think I understand shift/reset now. 11:15:05 -!- atslash has joined. 11:15:19 IMO shift takes on itself too much, and that effect syntax takes from it some control to the “reset” side 11:15:27 AFAIR 11:16:08 and then suddenly it starts to resemble control constructs from imperative languages, e. g. try/catch 11:17:53 oh also I had read something that made me think I understood shift/reset, but now I remember it only vaguely 11:21:20 int-e: OK, I now understand shift-reset and can work the examples. 11:21:31 It seems pretty simple. 11:22:38 I'm not sure why shift is called shift, and why it doesn't take a lambda. 11:32:09 The shift/reset in http://pllab.is.ocha.ac.jp/~asai/cw2011tutorial/main-e.pdf seem a bit more reasonable. 11:55:07 -!- adu has quit (Quit: adu). 12:03:47 okay... next question... why? 12:04:03 fungot: why? 12:04:03 int-e: i hope something good came in the mail 12:04:33 That's a better answer than I hoped for. But it's still not very satisfying. 12:05:38 So "delimited" means that instead of one thing called call/cc you have two things called shift and reset 12:06:21 shachaf: there's a subtlety around the behavior of ; inside reset though... 12:06:47 Here's a stack. No, there's no stack now. Okay, now there's a stack again, but it's a different stack. 12:06:49 shachaf: reset (foo; shift ...) doesn't capture the 'foo' part. 12:07:35 shachaf: otherwise the tree walking wouldn't make sense (I think) 12:09:19 cpressey: Yeah I guess that explains it operationally, more or less... shift = "capture the stack between here and the latest reset on the heap, and return a closure that, when invoked, puts it back on the stack". 12:13:45 int-e: if it explains anything operationally, it was by accident 12:14:15 it was more about... well, hard to say. I am prattling. 12:15:48 Oh was I finding patterns in the noise... mistaking them for communication? I believe that's a common mistake for humans :) 12:15:56 (So maybe I'm human? Who knew...) 12:19:43 I'll chalk it up to coincidence. I was perhaps trying to answer "why?" 12:20:23 This is all so dysfuncational! 12:21:28 Do I really want continuations that have been made more useful by making them delimited continuations? Isn't the point kind of to make it *less* useful? To make it easier to analyze, etc. 12:21:47 If I wanted useful, I'd just not deal with continuations at all. 12:22:26 I rather suspect that continuations were meant to be useful. 12:22:27 I guess there is some kind of control structure that delimited continuations can capture, that "regular" ones can't, but I haven't seen what it is 12:23:35 doesn't interest me enough to justify me hunting it down unfortunately 12:24:03 I wonder about the history. 12:24:16 This may have been an accident. 12:27:03 I dunno, I kind of stopped paying listening to academics after I heard Wadler compare monads to a solution to Descartes' mind-body problem. 12:27:06 (Made-up history: 1. We want exception-like behavior, a bit like setjmp/longjmp, but memory-safe! Let's make something that captures the current state of the stack so we can resume at this point later. Let's name it call/cc. 2. call/cc is slow because it has to capture all of the current stack... let's add a mechanism to limit the amount of stack we safe! (reset / shift=call/cc up to last... 12:27:12 ...reset). 3. Hmm, what can we use this new primitive for? 4. 100 papers. ) 12:27:21 *paying attention to 12:27:59 -!- PaniniTheDevelop has joined. 12:28:01 int-e: I believe continuations, the concept, started in denotational semantics. 12:28:10 hello! 12:28:20 So if it's "We want to write a function that describes exception-like behaviour" then yes 12:28:36 cpressey: let's focus on steps 2-4 :) 12:30:25 ("1. God gave us call/cc." - Let's pretend I wrote that instead ;) ) 12:30:28 int-e: https://cs.indiana.edu/~dyb/pubs/monadicDC.pdf refers to a 1987 paper called "Beyond continuations" that 12:30:50 help 12:30:55 PaniniTheDevelop: hi 12:31:01 `relcome PaniniTheDevelop 12:31:02 ​PaniniTheDevelop: 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.) 12:31:10 i cant register 12:31:18 PaniniTheDevelop: ask on #freenode 12:31:53 just 12:32:03 i dont know befunge 12:32:14 (oh. register where?) 12:32:22 on the wiki 12:33:13 sorry, I somehow assumed the IRC server 12:33:51 okay... 12:34:02 `bf 64+"!dlroW ,olleH">:#,_@ 12:34:05 No output. 12:34:16 hrm 12:34:40 i think its brainfck 12:37:58 `ibin/befunge 64+"!dlroW ,olleH">:#,_@ 12:37:59 Hello, World! 12:38:22 Now what was the official way to do that... 12:38:25 9857727254>\#+:#*9-#\_$.@ 12:38:30 `help interp 12:38:31 ​`interp? ¯\(°​_o)/¯ 12:38:42 help with this 12:38:56 the `ibin/befunge was important 12:40:25 `! befunge 9857727254>\#+:#*9-#\_$.@ 12:40:26 197596799 12:41:21 `? `! 12:41:22 ​`! emulates the ! command of our former bot EgoBot. You write `! then the name of the language then a program, and it runs the program you give and returns the result. We used to use it to test out esoprograms in-channel all the time, but the set of included esolangs is fairly old now and so it's rarely used. 12:41:40 thanks 12:41:53 [[Special:Log/newusers]] create * PaniniTheDeveloper * New user account 12:42:12 yaaay 12:42:23 One more hoop to jump through. 12:42:30 what 12:45:50 It will ask you to introduce yourself at some point... I don't know whether it tells you immediately after creating the account or when you attempt to edit a page though. (Maybe both, but perhaps only the latter.) 12:47:15 Anyway, we're all sorry for those hoops but we did suffer from a lot of spam in the past (including some that figured out how to solve the befunge captcha, either automatically or perhaps by employing humans that are rewarded simply for creating an account successfully.) 12:51:36 If the latter, it is probably the only instance ever of people being paid to code in Befunge. 12:52:06 Anyway I didn't realize there was a captcha at all 12:54:37 cpressey: I imagine the reward to be more along the lines of being allowed to download a couple of pornographic videos. 12:55:26 or maybe a "stress-test" of the network connection of "a friend". 12:57:19 oh dear 13:01:44 I should stress that I don't know. I'm extrapolating from https://krebsonsecurity.com/ mostly. 13:21:38 -!- PaniniTheDevelop has quit (Remote host closed the connection). 14:09:28 [[Emoji]] M https://esolangs.org/w/index.php?diff=65578&oldid=65554 * Dtuser1337 * (-35) removing unnecessary newlines. 14:09:54 [[Emoji]] https://esolangs.org/w/index.php?diff=65579&oldid=65578 * Dtuser1337 * (+35) Undo revision 65578 by [[Special:Contributions/Dtuser1337|Dtuser1337]] ([[User talk:Dtuser1337|talk]]) Oops 14:11:46 [[Emoji]] M https://esolangs.org/w/index.php?diff=65580&oldid=65579 * Dtuser1337 * (+1) trying out new thing. 14:17:22 I think delimited continuations are easier 14:17:28 for one thing you can algebraically axiomatize them 14:17:52 (2004) Axioms for Delimited Continuations in the CPS Hierarchy - Yukiyoshi Kameyama 14:18:49 if you wanted to define orthogonal language constructs in terms of continuations you need multiple-prompt continuations to separate them though 14:39:47 ("1. God gave us call/cc." - Let's pretend I wrote that instead ;) ) => no, God gave us the integers, he couldn’t have given us two different things at once, it would be cheating 14:40:30 if you’re right, call/cc = integers 14:40:36 call/succ 14:42:15 but what about call/pred then? I know Kronecker probably meant only nonnegative/positive integers, but it’s more fun if we’d take them all 14:42:32 oh one time I was bored and tried to make Peano-like axioms for Z 14:42:52 it ended up too verbose 14:49:35 arseniiv: I thought he gave use more tablets full of commandments but Moses was too lazy to carry them down the mountain? 14:49:56 maybe 14:50:01 they are heavy 14:50:17 should've used paper 14:50:40 arseniiv: hmm, 0 is in Z, succ is a bijection from Z -> Z such that succ(x) != x 14:51:48 Induction's the tricky one, as always 14:51:55 * int-e tries to find context 14:52:08 ah. "I was bored and tried to make Peano-like axioms" 14:52:47 I added prev and tried to make sure pred succ = succ pred = id 14:52:59 If K is a set such that 0 is in K and for every integer n, n being in K implies that succ(n) and succ^-1(n) is in K, then K contains every integer 14:53:28 arseniiv: I was trying to be sneaky and rely on pred existing due to succ being bijective 14:53:28 Taneb: yeah, I wrote it in that way, though using pred instead of succ^−1 14:53:32 Z is the monoid given by the presentation 14:53:53 (that's ) 14:54:12 int-e: that’s cheating 14:54:28 arseniiv: we can translate that back into peano style, surely. 14:54:54 It just won't be nearly as nice as Peano's axioms... unfortunately. 14:55:19 though all said, I like the definition of N as a free monoid on one generator :) 14:55:42 then we can add multiplication more or less naturally 14:56:12 In reality I like Z as a quotient of N x N (with (a,b) = (c,d) whenever a + d = b + c) 14:56:52 yeah it’s a nice construction and works for more things, I forgot what it’s named in general 14:57:37 Just like Q is the quotient of (Z x (Z - {0})) w.r.t (a,b) = (c,d) <--> a*d = b*c) 14:58:15 a + 0 = a, a + succ(b) = succ(a + b), a + succ^-1(b) = succ^-1(a + b), exercize: show that this is consistent 14:58:51 Taneb: what do you mean by succ^-1? 14:58:57 is ^-1 just a constructor 14:59:18 or maybe succ^-1 is a single constructor 14:59:24 Taneb: I'd be happier if you used `pred` and axioms for the interaction of succ and pred 15:01:00 int-e: I define succ to be a bijection, and succ^-1 is the inverse function of succ, which you can call pred if you like 15:02:12 so putting that equationally, you have pred(succ(x)) = x and succ(pred(x)) = x. 15:02:48 oh ok i get it 15:02:55 BTW 15:03:07 http://minikanren.org/workshop/2019/minikanren19-final4.pdf I like this 15:04:07 fortuntately, the rewrite rules +(x, 0) -> x, +(x, s(y)) -> s(+(x,y)), +(x, p(y)) -> p(+(x,y)), s(p(x)) -> x, p(s(x)) -> x are terminating and confluent, and there are distinct normal forms (e.g., 0 and s(0)), so the system is consistent. (Exercise: Figure out what having distinct normal forms has to do with "consistency") 15:05:34 what theorem is that 15:05:52 I am probably missing something, but, how is this not group theory 15:05:56 I guess its some fundamental result from term rewriting theory 15:07:26 (Solution to exercise: Since we're specifying an algebraic structure by equations alone, there's always a model that consists of a single element. So the natural analogue of "consistency" is not "has a model", but "has a non-trivial model", which means a model with more than one element.) 15:07:55 This /is/ related to standard consitency formulated in terms of booleans: we don't want to have false = true. 15:16:27 cpressey: "how is this not group theory" -- term rewriting is closer to universal algebra (you can have an arbitrary number of functions of arbitrary arity, and you can talk about presentations of such structures (given by equations between terms that may contain variables, like that s(p(x)) = x above) and stuff like that. And then you can ask questions like whether two terms (0 and s(0)) are... 15:16:33 ...the same. To that end, one can try to "complete" the system, by which checking whether t = u amounts to reducing t and u to a normal form with respect to a complete (terminating and confluent) system, and then comparing those normal forms syntactically.). 15:17:55 https://en.wikipedia.org/wiki/Knuth%E2%80%93Bendix_completion_algorithm is not the best Wikipedia article ever... but it might serve as a starting point nonetheless. Note that the seminal paper is titled "Simple Word Problems in Universal Algebras", so the universal algebra angle was there from the very beginning. 15:19:00 OK, well, yes, ok 15:19:13 Eh bien, gut, ok, yes, ok 15:19:26 Sorry, I've worked in this field for 8 years. Some things stick :P 15:20:34 Is it not the case that "Peano-like axioms for Z" would be roughly the same as "Axioms for (infinite, ordered) groups" 15:21:16 Hmm, ordered. 15:21:24 abelian would've been my first instinct 15:21:44 abelian, right, that too 15:21:52 But s() induces an order, I'm sure 15:22:16 until it runs into a cycle (and cycle avoidance is the main challenge here) 15:22:25 I sure hope it induces an order, or I've wandered into an episode of The Twilight Zone 15:22:51 modulo 3 you have 0 < 1 < 2 < 0 < 1 < 2 < 0 < 1 ... 15:23:06 That's not much of an order, if you ask me. 15:23:26 Who ordered this? 15:23:27 Anyway, that's what derailed *my* train of thought. 15:23:51 And at least it's still a quasi-order. 15:24:53 and even a... https://en.wikipedia.org/wiki/Well-quasi-ordering 15:25:19 -!- xkapastel has joined. 15:25:27 I think I see what you're getting at 15:30:33 * cpressey tries to think of how to extend the Peano axioms to ensure that the set is infinite 15:31:32 I think the peano axioms do imply the set is infinite 15:31:43 by induction 15:32:09 (the axiom schema, not the proof method) 15:32:35 Because succ is injective and there's no natural n such that succ(n) = 0 15:32:36 couldn't you just assume you had a finite model then add one to the biggest number 15:34:08 I'm completely lost then. That's okay. 15:34:46 I'm not sure where the modulo 3 thing came from. 15:35:12 Me neither 15:35:29 well if you had a finite model 15:35:36 take the biggest element 15:35:44 the assumption is that S(biggest) is not in that set 15:36:03 if it was in the set, then you have S(biggest) = something so theres a loop, kind of like modular arithmetic 15:36:09 rain1: I don't think that that's where cpressey is lost 15:40:14 I don't really know anything about model theory so I have no intuitions here, but if you have axioms for infinite ordered groups, I would expect that there is no finite model that would satisfy them 15:40:17 I could be totally wrong 15:40:47 On the other hand I can see how you could have a finite model satisying axioms for abelian groups, that doesn't sound wrong to me 15:41:03 And that's where modulo 3 could come in, I can see that 15:41:36 cpressey: oh well I'm having a totally different wtf moment about this: https://www.gq.com/story/war-against-sneaker-bots 15:45:44 int-e: it's amazing the things that happen in this world 15:48:55 or, to quote Brian Krebs, 'For readers unfamiliar with this term, “shoe botting” or “sneaker bots” refers to the use of automated bot programs and services that aid in the rapid acquisition of limited-release, highly sought-after designer shoes that can then be resold at a profit on secondary markets.' 15:49:24 Taneb: And disturbing. 15:57:40 -!- Sgeo_ has joined. 16:00:52 -!- Sgeo__ has quit (Ping timeout: 245 seconds). 16:03:34 What they don't tell you is that the shoes are highly sought-after because, properly applied, they will eradicate 80% of the world's diseases 16:05:15 . o O ( Instead of dozens of different causes, everybody will die from shoe poisoning from this point onward. ) 16:06:37 -!- sebbu2 has joined. 16:08:04 cpressey: I'm only half kidding. I have a genuine problem with applying percentages to causes of death when we're dealing with a 100% mortality rate in the long run. 16:09:12 -!- Vorpal has quit (Ping timeout: 245 seconds). 16:10:25 -!- sebbu has quit (Ping timeout: 268 seconds). 16:11:03 I remember seeing some headline that eating cheese reduces death rate from all causes 16:11:14 The obvious jokes were made 16:14:31 -!- Vorpal has joined. 16:14:31 -!- Vorpal has quit (Changing host). 16:14:31 -!- Vorpal has joined. 16:37:03 What they don't tell you is that the shoes are highly sought-after because they cause the wearer to become invisible and able to sneak up on dragons and slay them and take their treasure. 16:37:21 And the reason they don't tell you these things, is because they're not true. 16:41:58 -!- sebbu has joined. 16:45:43 -!- sebbu2 has quit (Ping timeout: 246 seconds). 16:46:07 -!- sebbu2 has joined. 16:48:48 -!- sebbu has quit (Ping timeout: 245 seconds). 16:48:53 -!- sebbu2 has changed nick to sebbu. 17:00:04 Hmm. Four languages called "Robin" on Github, and only one of them's mine. 17:00:12 -!- cpressey has quit (Quit: A la prochaine.). 17:21:24 -!- Phantom_Hoover has joined. 17:31:55 -!- b_jonas has joined. 17:34:09 * moony lurks 17:35:05 -!- xkapastel has quit (Quit: Connection closed for inactivity). 17:35:37 fungot, has SGDQ started yet? 17:35:38 b_jonas: is it 1974? what's for supper? can i program as if it was much thanks to oerjan)). how do you duplicate the list d e k f g c h i j w p r 17:36:06 `olist 1176 17:36:09 olist 1176: shachaf oerjan Sgeo FireFly boily nortti b_jonas 17:38:01 " Why would ELF symbol relocations be relevant for a statically linked executable?" => the program will refer to symbols in vdso 17:54:27 " Here's a stack. No, there's no stack now. Okay, now there's a stack again, but it's a different stack." => right, a cactus stack, because if you capture a continuation and leak it, it keeps a reference to the stack frame (and all stack frames below) even though you've exited those already 17:54:50 all hail the cactus stack 17:55:19 pointy and prickly and stabs whoever dares touch it 17:58:28 fungot, has SGDQ started yet? 17:58:28 rain1: i got it set up a return address) to each function, correct?) 18:04:45 int-e: that may be the history, but it also happens to allow cooperative context switching between execution threads, which is sort of nice to show how powerful that primitive is 18:05:58 alternately maybe it started because someone wrote a lisp an interpreter that stored the stack frames individually allocated in a linked list on the heap, and then noticed that now his interpreter is so inefficient that they can implement call/cc without making it too much worse 18:07:00 `! befunge 64+"!dlroW ,olleH">:#,_@ 18:07:01 Hello, World! 18:07:07 int-e: ^ the official way 18:07:09 `? `! 18:07:10 ​`! emulates the ! command of our former bot EgoBot. You write `! then the name of the language then a program, and it runs the program you give and returns the result. We used to use it to test out esoprograms in-channel all the time, but the set of included esolangs is fairly old now and so it's rarely used. 18:08:33 fungot: r7rs 18:08:34 rain1: well i guess i could 18:08:51 fungot: rust 18:08:51 moony: so i've always tied another on top of scheme, i don't know how 18:10:52 heh, analyzing the axioms 18:13:17 " ... I have a genuine problem with applying percentages to causes of death when we're dealing with a 100% mortality rate in the long run." => the mortality rates are usually given in deaths per year though, so they don't add up to 100%, they add up to about 1/70 year^-1 18:24:26 fungot: is the weather warm at wherever you are too? I guess you're in a server room with nice heat conditioning. 18:24:28 b_jonas: ( map ' ( 1 2 4 8 16... 2n, the difference between what?! what good is a kaiser roll without a little 18:25:15 today's the last hot day though 18:25:26 -!- Sgeo_ has quit (Ping timeout: 258 seconds). 18:26:33 it will be less hot during the week 18:30:08 -!- moony has changed nick to nogoawayiciloo. 18:30:18 -!- nogoawayiciloo has changed nick to moony. 18:38:30 -!- FreeFull has joined. 18:41:23 -!- moony has quit (Quit: Bye!). 18:41:40 -!- asdfbot has quit (Ping timeout: 272 seconds). 18:42:14 -!- moony has joined. 18:44:55 -!- Sgeo has joined. 19:15:27 int-e: It doesn't? It seems to in the (reset (begin ...)) example on Wikipedia. 19:18:21 int-e: In my variant, {} is the delimiter, and { a; b; c; } means { a; { b; c; } }, but I don't think regular shift/reset does that. 19:25:46 I need to take higher math classes sooner, so i can understand some of the stuff talked about in here :P 19:31:41 moony: I'm not sure it would let you understand the crazy stuff on this channel, but I do support the idea of taking math classes 19:32:14 b_jonas: fair. And I would take the classes anyways 19:32:19 i like math 19:32:33 right 19:32:44 it's worth for things other than understanding #esoteric 19:33:03 Mathematical Anti Telharsic Harfatum Septomin 19:34:26 it'd help a bit 19:34:26 because things like set theory 19:38:17 why set theory in particular? 19:40:35 let this = Goodstein's theorem in Do you like this? 19:51:43 -!- Vorpal has quit (Ping timeout: 245 seconds). 19:56:46 -!- Vorpal has joined. 19:56:46 -!- Vorpal has quit (Changing host). 19:56:46 -!- Vorpal has joined. 20:01:32 whoa, https://bitbucket.org/blog/sunsetting-mercurial-support-in-bitbucket 20:27:21 -!- Lord_of_Life_ has joined. 20:28:21 -!- Lord_of_Life has quit (Ping timeout: 244 seconds). 20:30:04 b_jonas: I see it a lot, and think it could be useful for software optimization, as well 20:30:16 -!- Lord_of_Life_ has changed nick to Lord_of_Life. 20:32:09 int-e: Oh, maybe you're right. I wish I could test this. 21:02:41 -!- b_jonas has quit (Quit: leaving). 21:23:32 -!- moony has changed nick to asdfbot2. 21:28:01 -!- asdfbot2 has quit (Quit: Bye!). 21:28:23 -!- moony has joined. 21:39:06 -!- AnotherTest has quit (Ping timeout: 268 seconds). 21:50:42 -!- xkapastel has joined. 21:56:25 -!- ais523 has joined. 21:56:48 I'm currently trying to learn the theorem prover / SAT solver Z3 21:58:16 Oh, I was trying to use Z3 the other day. 21:58:24 it produces some pretty esoteric answers sometimes 21:58:33 SMT solvers are TG 21:58:45 for example, if you ask it "find an integer x such that x * x > 3", it pretty consistently produces the answer -8 21:58:56 which is a valid answer to the question, but not one I would have thought of 22:00:23 `! brachylog A×↙A>3∧Aw 22:00:26 2 \ true. 22:00:39 Brachylog's answer to the same question is more expected 22:07:02 Hmm, when you link against a .o, does dead coffee elimination on functions you don't use typically happen? 22:07:08 Dead code elimination 22:07:32 It seems like that would put a bunch of restrictions on the .o 22:07:55 shachaf: depends 22:08:02 Or maybe this is why people use .a instead of .o files, because it can only be done on the file level? 22:08:20 for C/C++ using GCC/Clang, it only happens if you use -fLTO, which adds a lot of link-time data that can be used for dead code elimination, among other optimizations 22:08:45 Man. That sounds mega complicated. 22:09:10 I want to write my own linker for my own program but I still want to use C libraries. 22:09:14 it's compilerspecific 22:09:17 so 22:09:20 yea.. 22:09:32 But .o files are a standard format. 22:09:48 Probably some kind of .note.gnu.whatever section 22:09:54 What's the situation on Windows? 22:09:55 yea, prolly 22:09:59 Windows? 22:10:08 Windows is dominated by MSVC, which is closed source 22:10:10 have fun 22:10:21 lld links on Windows 22:10:31 And the PE format is pretty well documented 22:12:01 i mean 22:12:07 i dunno 22:12:10 i don't really use windows 22:13:59 Neither do I. 22:15:48 shachaf: by default, you get no dead code elimination with .o but do get dead code elimination with .a (in the sense that an entire file in the archive won't be used if nothing in it is referenced) 22:16:55 the way LTO is implemented is normally a fairly good approximation to "let's just do all the actual work of the compile during the link" 22:17:12 of course some of it is done during the compile step, but it moves a number of compile steps to happen at link-time instead 22:17:26 this needs a very configurable linker so that you can ask it to call back into the compiler 22:20:04 Wow, that sounds horrible. 22:20:22 Why does it need to call back into the compiler? 22:22:13 to do the rest of the optimisation 22:22:31 Is it things like cross-module inlining? 22:22:59 That sounds so complicated. 22:24:41 it's basically cross-module everything, a typical LTO is the equivalent of just dumping your entire program (and its libraries) into one file with #include and optimising that 22:25:45 Then why not just do whole-program compilation? 22:26:10 that's pretty much what's happening, I think 22:26:24 but -fLTO is stronger than -fwhole-program because it looks in the libraries for things to optimise in too 22:26:47 also, you do get incremental builds to some extent 22:26:59 because there is a lot of work the compiler has to do before it even starts to optimise the program 22:27:11 and many optimisations are done first on a single procedure before being extended to being interprocedural 22:27:14 The problem is that I want to write my program in a non-gcc language. 22:27:32 But I want to use some libraries written in C. 22:29:46 it's probably best to not LTO against them, in that case 22:29:55 unless your compiler and theirs have a common backend 22:30:08 I'm not aware of any LTOers which try to parse asm, although it's an interesting idea 22:30:25 generally speaking optimisations want a higher-level source format anyway so that they know what UB they're allowed to exploit 22:30:26 Isn't the basic idea of a linker that it supports linking code written in multiple languages? 22:30:34 That's the only reason you need a linker or object files. 22:31:03 no, the main reason you need a linker is for updating separately compiled files so that they reference each other 22:31:12 that's useful even within a single language 22:31:28 many linkers do support multiple source languages, typically by only working at the asm level anyway 22:31:36 GCC and LLVM both use a intermediate language for LTO 22:31:43 LLVM uses it's IR, as expected 22:31:46 but I was once paid to write a linker, and that linker was specific to a single language 22:31:48 GCC uses GIMPLE 22:32:21 its main purpose was to generate glue code to allow different compilation units to call functions defined in each other 22:32:57 But splitting a program into multiple translation units is an implementation detail of a compiler. 22:33:03 You could just do whole program compilation. 22:34:37 the main reason not to is because the separate translation units make incremental builds much easier to implement 22:35:04 (obviously, implementing incremental builds with whole-program compilation isn't impossible, but building a file at a time is a really easy way to do them and it's what's normally done in practice) 22:35:17 I'm not sure how much incremental builds matter. 22:35:33 …do you never work on large programs? 22:35:59 even on something like NetHack, which isn't even large, there are at least tens of seconds difference between an incremental build and a full rebuild 22:36:16 I mean that I find the argument that compilers should be way faster and then incrementality doesn't matter so much pretty compelling. 22:36:34 Hmm, I bet NetHack would compile faster if it was in one translation unit. 22:36:55 it would, there are a lot of headers that are recursively included in everything 22:36:57 We have [REDACTED] lines of code in [REDACTED], and incremental builds are pretty [REDACTED] for it. 22:37:28 Certainly [REDACTED] benefits from incremental builds. 22:37:51 But it's probably written in C++ or something. 22:38:23 I sort-of would prefer to go the other way, I think compilers should consider spending more effort than they do a) proving the input program correct and b) optimising it 22:39:09 Well, a very fast debug-only build should be available. 22:40:21 At one point Chromium started combining its translation units into larger chunks (I think ~30 files each maybe?) to make compilation faster. 22:40:48 The trouble with (some) C++ code is that all the code is in headers, so each translation includes the entire program. 22:42:39 Heh, the Chrome build instructions start with: "Are you a Google employee? See go/building-chrome instead." 22:43:34 I mean, the Chromium build instructions. 22:44:28 -!- ais523 has quit (Remote host closed the connection). 22:45:41 -!- ais523 has joined. 22:45:51 I think they've been switching build systems every now and then. I guess it's still GN+Ninja though. 22:46:05 But it definitely was GYP before, and I think something else before that. 22:48:22 I'm trying to build NetHack now to compare build times. 22:48:44 But the build instructions are convoluted so I still haven't figured it out. 22:49:32 shachaf: for NetHack 3.4.3, try this patch: https://bilious.alt.org/?452 22:49:53 it automates all the manual steps of the build 22:50:10 I'm trying 3.6.2 22:50:29 that has a different build system 22:50:40 but it's a bit easier to use than 3.4.3's once you have an appropriate hints file 22:50:48 ais523: Hmm, instead of application/octet-stream you should serve your .patch fail as text/plain so it opens in browsers. 22:51:07 that isn't my website 22:51:09 just my patch 22:51:35 Ah. 22:51:52 Oh, I was only looking for executable files in the hints directory, with tab completion. So I thought there was only one for Mac OS. 22:52:33 the one for Linux mostly works apart from the directories I think 22:52:47 oh, hmm, apparently bilious is downloading it /from/ my website 22:53:18 text/plain is the wrong MIME type for a diff, though (and there are security reasons not to use text/plain for /anything/ online, blame Microsoft) 22:53:39 ais523: what's MS do 22:54:18 moony: some versions of IE interpret text/plain as text/html if they think the file looks sufficiently HTMLlish 22:54:27 this allows XSS attacks against plaintext files 22:54:29 pffffft 22:54:48 (last time this conversation came up, someone successfully XSS-attacked oerjan via a plaintext log file) 22:54:59 (so it's not just a theoretical issue) 22:55:03 log for #esoteric, that is 22:57:10 There were some workarounds though. Like, X-Content-Type-Options=nosniff on IE >= 8.0, which is... well, it's something. 22:57:42 Well, I really don't like application/octet-stream because no browser shows a preview option. 22:57:44 -!- FreeFull has quit. 22:57:51 note to self: put demo for this madness on hellomouse.net 22:57:54 the workaround we were always told to use on Wikipedia was to serve as text/css 22:57:55 This is really a problem with browsers, but all browsers have this behavior. 22:58:19 fwiw, when I followed the link it opened in my text editor, with syntax highlighting 22:58:24 ais523: I think that works on older versions of IE than just the header. 22:58:32 but I suspect that's a consequence of some configuration I did in the past 22:59:01 "on Wikipedia" here = to prevent people XSS-attacking Wikipedia itself 22:59:08 I'm sending "Content-Type: text/plain" + "X-Content-Type-Options: nosniff" from hack.esolangs.org/tmp/... URLs. 22:59:39 I guess that should probably be served from a different second-level domain than the wiki, actually. 22:59:56 But I don't want to pay for esolangsusercontent.com or some such. 23:01:07 are the wiki cookies marked HTTP-only? 23:01:17 that would probably be enough as far as mitigations go 23:01:42 I'd test this but I'm not particularly inclined to fire up IE on the live internet 23:01:55 especially as the version of IE that I have installed is IE6 23:02:35 I think at least some of them are. 23:02:46 Man, NetHack has all sorts of problems. 23:02:54 "Set-Cookie: esolang_wiki_session=[redacted]; path=/; secure; HttpOnly" 23:02:55 Like multiple incompatible definitions of "struct monst". 23:04:44 that's a new one for me 23:05:04 Putting everything into one translation unit will show all sorts of odd things. 23:05:21 Some of them are sort of reasonable, like #defines for common words without #undefs. 23:05:38 oh, I see 23:05:49 objects.h gets compiled twice, the first time uses a dummy definition for struct monst 23:05:53 *objects.c 23:07:43 objects.c is compiled twice? Oh no. 23:08:24 several of the files that are compiled are generated from other compiled files at build time 23:13:26 -!- Phantom_Hoover has quit (Quit: Leaving). 23:20:51 what's the name for the version of boolean satisfaction where you can put as many forall quantifiers as you like at the start, but don't get other quantifiers or quantifiers anywhere else? 23:21:06 e.g. "find x, y, such that forall a, b, c, f(a,b,c,x,y) is true" 23:22:47 Someone told me the name of that recently but I've forgotten it. 23:28:39 Without -O, NetHack builds in <5 seconds on my machine. 23:28:42 [[Blackspace]] N https://esolangs.org/w/index.php?oldid=65581 * A * (+219) Created page with "[[Blackspace]] is an [[esoteric programming language]] completely based on the old-fashioned control characters. Currently this page is a placeholder. [[Category:2019]] Cat..." 23:28:42 -!- Sgeo has quit (Read error: Connection reset by peer). 23:29:05 -!- Sgeo has joined. 23:29:19 [[Husk]] M https://esolangs.org/w/index.php?diff=65582&oldid=65577 * A * (+30) 23:33:12 (This is unrelated to the one-translation-unit thing, which isn't working very well in this code base.) 23:33:50 Also a big problem is that you can only get parallelization in most compilers by breaking up your code into multiple translation units. 23:38:45 I thought that but forgot to say it in-channel 23:40:36 Me too. 23:47:40 -!- atslash has quit (Quit: This computer has gone to sleep). 23:49:54 Is -O even relevant to a program like NetHack? 23:52:04 yes, we need to do optimisation rounds every now and then 23:52:38 vanilla NetHack was designed for very old computers where it ran very slowly, so a lot of optimisation was needed for that and means that we can afford to be sloppy when running old parts of the code on modern computers 23:53:05 but NetHack derivatives like NH4 take advantage of the speed of modern computers to do things like continuously saving the game (the save code is pretty slow) 23:53:31 also, reading code compiled at -O0 hurts to look at 23:53:50 it often doesn't even really use registers, everything gets loaded from memory for one instruction then put right back into memory 23:54:31 yes, -O0 bad 23:54:42 also 23:54:58 there can be programs that behave differently because of how unoptimized -O0 is 23:55:10 and languages like Rust kinda depend on -O1 or better to even make good code 23:55:20 But if you're recompiling for development (which is the case where you want incremental builds) you presumably don't care about that so much. 23:55:33 Yes, Rust has certainly taken that part of the C++ philosophy. 23:56:25 i.e. take Rust futures 23:56:28 if they weren't optimized 23:56:36 a single Future object could reach 100s of KBs large 23:56:39 shachaf: I consider the generation of suboptimal asm to be a bug 23:56:46 ^ 23:56:56 in either the compilier or the source code, but the source code is normally easier to fix 23:57:08 But generating optimal assembly is uncomputable. 23:57:10 I'll write a piece of the program, then look at the generated asm to see if it's fast enough or if I need to do better 23:57:24 shachaf: depends on what the program is doing 23:57:42 in many cases you just have a finite-state machine, optimising that is very computable 23:57:50 I think part of the difficulty in generating optimal asm is, yknow, x86 itself 23:57:50 Something like a computer game, even NetHack, is more like a real-time system. 23:57:57 why do you think I'm learning Z3? :-D 23:58:14 It's a bug if it's too slow but if you don't miss your deadlines it's fine. 23:58:25 ais523: compiler for a FSM language that generates nearly optimal ASM when 23:58:26 shachaf: I actually really disagree with this 23:58:38 I am upset at all the electricity that's being wasted in parts of the cycles that could be idle 23:58:53 moony: I'm really seriously considering it atm 23:59:07 i mean, that'd be amazing for some problems 23:59:19 ais523: I bet more cycles are being used to display NetHack in a GUI terminal than on computing NetHack. 23:59:25 actually, Z3 is sufficiently high level that I think you could express it in only a few hundred lines or so of Z3 + a program wrapping it 23:59:52 whether Z3 could actually run the resulting program with any sort of efficiency would be the real question 23:59:54 ais523: good luck handling the insanity that is per-processor behavior and SSE 2019-08-21: 00:00:02 Agner's docs be with you 00:00:22 moony: well, I was planning to a) optimise for size, because that's objective; b) at least initially concentrate only on the integer registers 00:00:28 (not even memory) 00:00:47 At any rate, if you're talking about repeated recompilation during development, you should include the cost of the optimizing compiler in your wasted cycles. 00:01:11 yes, there's an argument for using only limited optimisation during development 00:01:12 If you're building a program to ship to many people, it makes sense to spend more time optimizing it. But that's a tiny fraction of your builds. 00:01:15 that's pretty much what -Og is for 00:01:37 and -Og's generated code is far from terrible, given the tradeoffs it has to make 00:08:04 ais523: have fun handling instructions like the multiply instruction 00:08:32 moony: in what way? 00:08:41 output registers are fixed 00:08:57 that doesn't make it harder, just more tedious 00:09:03 I guess that's what you meant by "have fun" 00:09:08 yes 00:09:10 that's what i ment 00:09:15 it's annoying and tedious :P 00:09:15 (actually, from Z3's point of view it makes things easier due to having fewer possibilities to try) 00:09:50 Oh man: https://mightyapp.com/ 00:10:18 What a mega-optimization. 00:10:23 pfffft 00:10:45 what they don't mention: 00:10:50 *streaming* 00:11:05 maybe use firefox instead, heard it's faster 00:12:06 No, that's the secret sauce optimization superpower. 00:12:41 Web software wasn't in the cloud enough, so now you have a second layer of cloud. 00:13:19 *steals link* 00:13:26 *runs off to hellomouse to share* 00:34:09 I wonder if that mightyapp thing is a joke 00:34:14 I don't think there's enough information to tell 00:34:25 and I can believe both that it's meant as a joke, and that it's meant seriously 00:35:19 It's certainly a joke, but I don't think it's meant as one. 00:35:22 I'm leaning towards joke, on the basis that a) the name is wrong and b) there aren't any terms of service or the like, which a company seriously setting something like this up would almost invariably have 00:35:53 i hope it's a joke. it's certainly funny 00:35:57 also, the "request access" link goes to a different domain 00:36:16 so this has been set up on a really low budget by someone without programming expertise, which seems at odds with the claims they're making 00:36:33 so that makes it most likely that it's a prank, and second most likely that it's a scam, I think 00:36:41 mmmm 00:36:43 "an actual product we intend to commercialise and have the skill to make" is a distant third 00:37:45 the ironic thing is, a product like that genuinely /could/ make most pages load faster, I suspect 00:38:48 HTML is /way/ too complex 00:38:54 HTML replacement when 00:38:59 -!- iczero has joined. 00:39:56 -!- xkapastel has quit (Quit: Connection closed for inactivity). 00:40:58 `welcome iczero 00:40:59 iczero: 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.) 00:44:20 [[Malbolge]] https://esolangs.org/w/index.php?diff=65583&oldid=64726 * A * (+218) /* External resources */ 00:44:35 [[Malbolge]] M https://esolangs.org/w/index.php?diff=65584&oldid=65583 * A * (-1) /* External resources */ typo 00:50:53 -!- arseniiv has quit (Ping timeout: 245 seconds). 00:55:27 -!- adu has joined. 01:06:23 [[Malbolge programming]] M https://esolangs.org/w/index.php?diff=65585&oldid=52491 * A * (+181) 01:07:39 [[Malbolge programming]] https://esolangs.org/w/index.php?diff=65586&oldid=65585 * Ais523 * (-67) /* External resources */ you kind-of have to read the instructions to learn the language, a denormalizer isn't going to do much to help (especially as it affects data as well as code) 01:15:01 -!- adu has quit (Quit: adu). 02:58:44 -!- moony has quit (Ping timeout: 252 seconds). 03:00:34 -!- iczero has quit (Ping timeout: 252 seconds). 03:00:41 -!- Bowserinator_ has quit (Ping timeout: 250 seconds). 03:09:47 -!- Bowserinator has joined. 03:10:18 -!- moony has joined. 03:10:30 -!- iczero has joined. 03:11:57 -!- ais523 has quit (Quit: quit). 04:21:03 -!- Sgeo_ has joined. 04:23:49 -!- Sgeo has quit (Ping timeout: 258 seconds). 04:29:24 [[Malbolge]] M https://esolangs.org/w/index.php?diff=65587&oldid=65584 * MilkyWay90 * (+1) 05:37:05 -!- atslash has joined. 06:17:52 -!- atslash has quit (Ping timeout: 244 seconds). 06:41:54 -!- diginet has quit (Quit: diginet has quit!). 06:43:57 -!- b_jonas has joined. 06:45:48 " Isn't the basic idea of a linker that it supports linking code written in multiple languages?" => yes, so g++ can invoke gold in a way that it can link C, fortran and C++ together; ghc can invoke a linker such that it can link C and haskell together, and rustc can link rust and c together. If you want to link any two of C++, haskell and rust, you still can, but you have to guess all the magic 06:45:54 linker incantations required. 06:46:03 [[Truth-machine]] M https://esolangs.org/w/index.php?diff=65588&oldid=65568 * A * (+283) /* Malbolge */ Normalized using my normalization tool 06:46:11 It's pretty sad really, especially the haskell part. 06:47:28 " I mean that I find the argument that compilers should be way faster" => the people who say that are the ones with sour grape because they don't have a good optimizing compiler 06:49:34 " Well, a very fast debug-only build should be available." => still no. debug build should be somewhat faster, but it should still optimize. debug build is -O, production build is -O2. that debug builds used to be fast a decade ago itself was an artifact of that compilers were worse at optimizing and producing debug info for the optimized file that a debugger can read. that's no longer a 06:49:40 limitation, compilers got better in everything. 06:52:24 " the workaround we were always told to use on Wikipedia was to serve as text/css" => interesting 06:54:32 " Man, NetHack has all sorts of problems." => there are (or used to be) tables in C files generated by a program built at compile time, where the program that generates it includes a header that has macros that refer to the table in the generated output. 06:55:06 those unclear dependency orders were what really made me angry about its code organization 06:58:54 " moony: well, I was planning to a) optimise for size," => I suggest that you optimize for the number of instructions instead, then size for equal number of instructions 07:00:37 " yes, there's an argument for using only limited optimisation during development / that's pretty much what -Og is for" => no, AFAIK -O is for limited optimization during development, -Og is a close variant of that that specifically won't do optimizations that would confuse a runtime debugger (provided you use a new enough version of gdb) 07:00:59 s/runtime/interactive/ 07:05:56 If compilers got better in everything why are they way slow? 07:08:20 shachaf: they're not slow. I can compile anything much faster than I used to be able to on a current machine than how much it took me on an ancient machine with gcc 2.95 07:08:51 at least, they didn't slow down so much, so with faster hardware, it is effectively faster 07:08:58 -!- b_jonas has quit (Remote host closed the connection). 07:12:31 tcc is way faster than gcc 07:12:42 -!- cpressey has joined. 07:13:55 Good morning. I disagree with the statement "All continuations are delimited". 07:15:01 If you accept a model where a computation can run without end, such as (I dunno) Turing machines, then I think you have to accept there are continuations without end too. 07:16:29 Even on a real computer, when the OS starts a program, it passes it a continuation (conceptually at least), and when that program "terminates", all it's doing, is continuing that continuation. 07:20:50 I have a good feel for how delimited continuations work now but I'd like an implementation to test some things with. 07:20:53 Is there one? 07:22:42 shachaf: I have such a language bookmarked, need to find it. It uses prompt/control I think 07:22:54 Does Racket or something have it? 07:23:15 shachaf: https://github.com/manuel/wat-js 07:23:25 That is not a promising URL. 07:24:05 That's all I got. 07:24:13 I'm not really into these thigns. 07:25:02 meanwhile a duckduckgo search for "racket delimited continuations" returns a hit on the Racket docs 07:25:06 I guess it's just that the implementation is in JavaScript or something? 07:25:30 I did look at the Racket documentation but I couldn't quickly figure out a way to make it work, or whether shift/reset is included at all. 07:26:04 One thing that I'd like to have along with delimited continuations is something like destructors or Go's "defer", code that runs when you exit a scope. 07:26:09 Looks like it's got call/prompt 07:26:31 Maybe I just need to figure out the right #lang incantation. 07:27:13 shachaf: https://docs.racket-lang.org/reference/cont.html lists shift and reset and cupto and prompt and allllll the things 07:27:53 re destructors, I think you'd use dynamic-wind for conventional continuations 07:29:06 Hmm, so they do. 07:29:14 I guess I just needed (require racket/control) 07:32:24 OK, some of my questions have been answered. 07:34:05 I guess it's even better than I thought in most respects. 07:34:36 Can you do the thing I want? I want a thing that creates an early exit point that can be used later. 07:34:58 Something like (reset (let ((exit ...)) (...whatever, which may include more resets... (exit x)))) 07:42:16 -!- xkapastel has joined. 07:47:51 -!- AnotherTest has joined. 07:54:51 Maybe the answer is that I should be using a prompt tag instead of shift/reset. 07:59:32 -!- wob_jonas has joined. 07:59:40 -!- wob_jonas has changed nick to lob_jonas. 08:00:00 That said, the programs that we can compile have gotten huge, which is part of why compilation can be slow. 08:02:56 -!- atslash has joined. 08:04:01 shachaf: if you want an exit point, which is a much simpler special case of a continuation to which you can only go out in the stack, not in again once you exited the frame where you created it, then try call/ec, see "https://docs.racket-lang.org/reference/cont.html?q=call%2Fec#%28def._%28%28lib._racket%2Fprivate%2Fletstx-scheme..rkt%29._call%2Fec% 08:04:02 29%29" 08:04:35 it's like longjmp because it can jump out from deep inside a function call, but not back once the setjmp exited 08:04:43 Yes, I saw it. 08:05:26 What I actually want is neither of them. 08:05:29 except it differs from longjmp because it still handles dynamic-wind destructors 08:05:46 you want something in between, delimited? 08:07:32 you could create a weak cell or ephemeron or whatever those are called these days, where the weak key points to a dummy object that you create in the stack frame to which you want to delimit the continuation, and the value holds the continuation itself. then you can't invoke the continuation through this once the delimiting stack frame has exited. 08:07:38 Well, what I actually want is evaluated entirely at compiletime, for one. 08:07:50 I don't want any continuations or even indirect jumps at runtime. 08:07:53 not only you can't invoke it, it can be garbage collected some time after the stack frame exits 08:08:02 oh... that's different 08:08:12 But the semantics might be similar in other ways. 08:09:17 so you want something like a goto/comefrom? 08:09:50 only it can see the label in an outer function that created the closure, lexically? 08:10:35 Maybe? 08:11:08 and do you want it to be able to re-enter a stack frame too, not just exit? 08:11:26 I think maybe prompt-at is something like what I want. But it seems to want you to make your own tag for some reason? I must be misunderstanding it. 08:11:26 even through a closure that you leak out? nah, that'd be difficult 08:11:36 There should be no closures since it all happens at compiletime. 08:11:49 Continuations are like the least compile-time thing I can think of 08:12:53 That's why I didn't want to model my feature as continuations, at first. 08:13:04 But I think it might just be the right thing unfortunately. 08:14:41 If it's just the right thing, why is it unfortunate? You speak in riddles. 08:16:48 I can do part of what I want with the shift/reset in http://hackage.haskell.org/package/CC-delcont-0.2.1.0/docs/Control-Monad-CC.html , at least 08:17:02 Oh, it's unfortuantely because delimited continuations are super-mega-complicated 08:17:05 s/ly// 08:17:08 May I suggest you write some test cases for the feature, so that you at least have a clear idea what it... does? 08:17:19 Sure, I've talked about some of this before. 08:17:29 Not talk, though, test case 08:18:10 Hmm, that would be easier if I knew what it was exactly. But then I wouldn't need to learn from continuations. 08:18:25 The test cases are to help you know what it is exactly 08:19:38 I have a 2000 line file full of various examples trying various things. 08:19:51 One thing. Many test cases for one thing. 08:20:28 Most of the file is about this one feature. 08:21:26 I'm a bit confused by what you're asking. You want coherent working test cases for this thing, but the problem is that I'm confused about what this thing is. 08:22:08 Maybe I can try it anyway. 08:23:09 How would you identify this thing? "In this instance I would expect it to do this, in this other instance I would expect it to... (etc)" These are test cases. 08:23:36 https://github.com/rain-1/continuations-study-group/blob/master/scripts/2010-asai-kitani-eval11-numbers.ml 08:24:05 there is a compiler and interpreter that implements lambda calculus with delimited continuations 08:28:37 -!- Lord_of_Life has quit (Ping timeout: 246 seconds). 08:32:15 -!- Lord_of_Life has joined. 08:33:18 [[Alphabetti spaghetti]] https://esolangs.org/w/index.php?diff=65589&oldid=46644 * Stasoid * (+120) /* Interpreter */ 08:41:23 cpressey: http://slbkbs.org/tmp/2019-08-21-cpressey-test-cases.txt is something. 08:41:37 These aren't actually test cases because I don't know what these lambdas actually are. 08:44:47 shachaf: That is at least clearer. 08:46:24 -!- andrewtheircer has joined. 08:46:24 h 08:46:41 e 08:47:15 actually the spelling of queue makes sense 08:47:18 Q-ue-ue 08:49:32 how about the spelling of deque? 08:50:18 or that of cue? 08:51:04 cue - ck (c sound) - ue 08:51:09 ck-u-e 08:51:12 it makes sense 08:57:33 got it? 08:59:14 shachaf: This is my "compile time" interpretation: ` is syntactic sugar (or rather the lack of it) for ;. @ is a label just after the block it's used in. defer is remembered when it's seen, but code isn't generated for it, until a jump out of the block. 09:00:23 I agree on the latter two. 09:00:23 is this related to esolangs or 09:00:28 I'm not sure what you mean by the first one? 09:02:48 for (xs, \x -> { BODY }) <==> { x := for(xs)`; BODY } 09:03:00 looks like you could transform that syntactically? 09:03:13 defer is special because it inserts the code at every exit (once at the block's }, and once for uses of @, I suppose). 09:03:22 Yes, it's certainly intended to be a syntactic transformation. 09:03:51 { x := for(xs); y := for(ys); BODY } turns into for(xs, \x -> for(ys, \y -> { BODY })) 09:04:02 ok, I have to afk for a bit, but it doesn't look like you need to think much about continuations for this 09:04:03 Er, I forgot the two `s in the left side. 09:04:08 you can use staging to make things happen at compile time 09:04:33 And { x := for(for(xss)`)`; BODY } turns into for(xss, \xs -> for(xs, \x -> { BODY })) and so on. 09:04:36 delimited continuations + staging is a powerful technique 09:04:58 http://okmij.org/ftp/meta-programming/calculi.html#circle-shift 09:05:01 I agree that this is just a syntactic transformation, that's kind of the point. 09:05:25 One question here is, what is "for", and what's the type of "exit", and what are these lambdas? 09:05:36 test 09:06:36 -!- tromp has quit (Remote host closed the connection). 09:20:29 "for" is something like a function, but evaluated/inlined at compiletime. 09:21:07 "exit" is also a thing like that, and so is the argument to "for". 09:21:52 These are very similar to regular delimited continuations, except for the demand that they only exist at compiletime. So you can't pass "exit" or one of these lambdas as an argument to a regular function. 09:22:57 Do you know of a language that has that kind of thing? 09:23:54 -!- tromp has joined. 09:25:41 shachaf: how about... the language you're eventually going to create to test this thing? 09:27:21 shachaf: I think one reason you don't really need continuations for this is because you don't actually retry anything with these operators. 09:27:31 "Continuations" at compile-time are "labels". 09:27:35 Roughly speaking. 09:27:39 afk again. 09:27:47 fun fact: a town in west virginia requested foreign aid from the USSR to repair a bridge 09:28:25 cpressey: Retry? 09:29:28 I agree about continuations at compile-time. 09:29:51 This is why I said for a long time that I don't really want continuations because what I want is much simpler. 09:36:04 lob_jonas: Yes, that sounds like a good one. 10:02:11 -!- arseniiv has joined. 10:16:21 hi 10:17:02 -!- lob_jonas has quit (Quit: Ping timeout (120 seconds)). 10:19:38 -!- andrewtheircer has quit (Remote host closed the connection). 10:51:02 shachaf: I should probably let you sleep, but: when you capture a continuation, sometimes it's to continue it more than once (e.g. backtracking) but you're not doing that here. 10:53:14 "for" looks like a function that takes a function, to me. If you want to say, it must be an anonymous function which lexically follows the "for", so you can optimize/analyze it better, you can do that. 10:57:53 For the life of me @ looks a lot like setjmp/longjmp. You also want some static guarantees (you can't pass the value of @ around) but those are additional; the basic mechanism is that. 11:01:36 Your additional lexical constraints might be misleading you into thinking it's an essentially lexical mechanism, but I don't think it is. 11:01:38 I'll stop now. 11:04:32 -!- xkapastel has quit (Quit: Connection closed for inactivity). 11:06:31 @time shachaf 11:06:32 Local time for shachaf is Wed Aug 21 04:06:31 2019 11:18:57 -!- lob_jonas has joined. 11:19:04 ouch 11:31:17 lob_jonas: whassup 11:32:43 cpressey: I just got scheduled for dental root canal operation. The first time in my life. I was sort of mentally prepared for that. But 11:33:32 the root canal specialist surgeon said that he's looked at the X-ray and my tooth looked nasty so I'll need three appointments for this tooth. 11:33:53 I was already scared of this operation, but now I'm more scared. 11:42:14 lob_jonas: I had a root canal once. It took multiple appointments, and in the end they couldn't save the tooth anyway. It wasn't fun, and there was some pain. But it's also not amongst my worst memories (I rarely think of it.) 11:42:45 It's also the sort of thing where it's a finite amount of time, and you can remind yourself of that during it. 11:44:35 cpressey: yes, the point of a root canal is that you only get them when they've given up on the tooth already, it can't be saved (or so the denist believes), so they turn it to an undead tooth with some metalic golem core surrounded by the empty shell of what used to be the tooth. 11:45:15 also I hear the experience with it has a high variance, it's terrible for some people but acceptible for others. 11:45:54 which makes sense because I had three wisdom teeth extracted, and they all behaved differently 11:46:19 (the first one was terrible, the second one was trivial, the third one was ok but the gum healed ugly) 11:51:27 -!- PaniniTheDevelop has joined. 11:51:35 nah 12:33:03 -!- PaniniTheDevelop has quit (Remote host closed the connection). 12:47:57 -!- xkapastel has joined. 12:56:43 -!- lob_jonas has quit (Quit: Ping timeout (120 seconds)). 13:54:59 [[FAKE]] M https://esolangs.org/w/index.php?diff=65590&oldid=65453 * Argv0 * (+61) Typos and grammar corrections 14:09:50 -!- PaniniTheDevelop has joined. 14:15:01 -!- mich181189 has quit (Ping timeout: 250 seconds). 14:15:12 -!- mich181189 has joined. 14:15:45 -!- Lymee has joined. 14:15:50 -!- ProofTechnique has quit (Ping timeout: 250 seconds). 14:16:22 -!- sparr has quit (Ping timeout: 250 seconds). 14:16:43 -!- Lymia has quit (Ping timeout: 250 seconds). 14:16:44 -!- Lymee has changed nick to Lymia. 14:18:06 -!- ski has quit (Ping timeout: 268 seconds). 14:18:24 -!- zzo38 has quit (Ping timeout: 272 seconds). 14:18:36 -!- ProofTechnique has joined. 14:18:41 -!- ski has joined. 14:21:10 Hmm, is there a thing like linear types that is linear kinds? 14:28:55 hello 14:30:34 -!- sparr has joined. 14:35:43 [[ROT-13]] N https://esolangs.org/w/index.php?oldid=65591 * A * (+335) Created page with "[[ROT-13]] is an extension of the [[ROT13]] encoder/decoder. ==Alphabetic characters== They are simply rotated using this following lookup table:
 ABCD...WXYZ NOPQ...JKLM..."
14:36:14  new page
14:39:56 -!- PaniniTheDevelop has quit (Remote host closed the connection).
14:41:17  [[Esolang:Introduce yourself]]  https://esolangs.org/w/index.php?diff=65592&oldid=65525 * PaniniTheDeveloper * (+253) /* Introductions */
14:47:05  hello
15:11:13 -!- tromp has quit (Remote host closed the connection).
15:32:02 -!- tromp has joined.
15:51:26 -!- adu has joined.
15:58:37 -!- cpressey has quit (Quit: A la prochaine.).
16:36:23 -!- tromp_ has joined.
16:38:35 -!- tromp has quit (Ping timeout: 252 seconds).
17:12:05 -!- b_jonas has joined.
17:21:23 -!- PaniniTheDevelop has joined.
17:24:57 -!- FreeFull has joined.
17:28:29 -!- Phantom_Hoover has joined.
17:37:31  [[Esolang:Sandbox]]  https://esolangs.org/w/index.php?diff=65593&oldid=62912 * PaniniTheDeveloper * (+64) 
17:38:44  [[Esolang:Sandbox]]  https://esolangs.org/w/index.php?diff=65594&oldid=65593 * PaniniTheDeveloper * (-39) 
17:38:48  Taneb: sure, kinds are just like a type system but one level up
17:39:12  in a linear kind system you could do   data Foo a = Bar a   but not  data Foo a = Bar a a  or  data Foo a = Bar
17:39:18  you have to use the type variable 'a' exactly once
17:39:25  [[Esolang:Sandbox]] M https://esolangs.org/w/index.php?diff=65595&oldid=65594 * PaniniTheDeveloper * (-25) 
17:39:32  whether that is useful, I do not know
18:39:43  cpressey: Joke's on you, I was already asleep.
18:39:49  Joke's on me, cpressey isn't here.
18:40:57  In lens things we talked about "linear functors" and "affine functors" and so on.
19:22:29  and what does that mean
19:23:55  They're like the things you said.
19:24:47  You can write a Lens' (Foo a) a for your first Foo and a Traversal (Foo a) a for the second Foo and so on.
19:25:21  data Maybe a = Nothing | Just a is an example of an affine functor, since it's of the form "Ax + B"
19:26:33  I guess every linear functor is going to be of the form "(E,a)" for some E, like a 1D vector space.
19:47:08  [[Esolang:Introduce yourself]] M https://esolangs.org/w/index.php?diff=65596&oldid=65592 * PaniniTheDeveloper * (+0) 
19:49:45  [[Esolang:Introduce yourself]] M https://esolangs.org/w/index.php?diff=65597&oldid=65596 * PaniniTheDeveloper * (+0) Undo revision 65596 by [[Special:Contributions/PaniniTheDeveloper|PaniniTheDeveloper]] ([[User talk:PaniniTheDeveloper|talk]])
19:50:16 -!- PaniniTheDevelop has quit (Remote host closed the connection).
20:09:13 -!- Sgeo_ has quit (Read error: Connection reset by peer).
20:09:38 -!- Sgeo_ has joined.
20:14:19 -!- b_jonas has quit (Quit: leaving).
20:26:35 -!- Lord_of_Life_ has joined.
20:29:51 -!- Lord_of_Life has quit (Ping timeout: 244 seconds).
20:29:57 -!- Lord_of_Life_ has changed nick to Lord_of_Life.
20:47:43 -!- xkapastel has quit (Quit: Connection closed for inactivity).
20:59:07 -!- xkapastel has joined.
21:53:27 -!- AnotherTest has quit (Ping timeout: 264 seconds).
22:27:46 -!- FreeFull has quit.
22:51:16 -!- arseniiv has quit (Ping timeout: 248 seconds).
22:57:10 -!- Phantom_Hoover has quit (Quit: Leaving).
23:37:43 -!- xkapastel has quit (Quit: Connection closed for inactivity).

2019-08-22:

01:05:33  [[Deadfish]]  https://esolangs.org/w/index.php?diff=65598&oldid=65523 * Areallycoolusername * (+456) /* Ruby */
01:06:04  [[Deadfish]]  https://esolangs.org/w/index.php?diff=65599&oldid=65598 * Areallycoolusername * (+6) /* Ruby */
01:12:33 -!- esowiki has joined.
01:12:41 -!- j-bot has joined.
01:12:41 -!- jix has joined.
01:12:41 -!- shachaf has joined.
01:12:42 -!- dingwat has quit (Changing host).
01:12:42 -!- dingwat has joined.
01:12:43 -!- ProofTechnique has quit (Changing host).
01:12:43 -!- ProofTechnique has joined.
01:12:45 -!- tswett[m] has quit (Changing host).
01:12:45 -!- tswett[m] has joined.
01:12:52 -!- adu has joined.
01:12:52 -!- joast has joined.
01:12:52 -!- mniip has joined.
01:12:52 -!- howlands has joined.
01:12:52 -!- HackEso has joined.
01:12:52 -!- erdic has joined.
01:12:52 -!- paul2520 has joined.
01:12:54 -!- atslash has joined.
01:12:55 -!- diverger has joined.
01:12:55 -!- myname has joined.
01:12:55 -!- haavard has joined.
01:12:55 -!- hakatashi has joined.
01:12:55 -!- ocharles has joined.
01:12:55 -!- rickbutton has joined.
01:12:56 -!- mich181189 has quit (Changing host).
01:12:56 -!- mich181189 has joined.
01:13:26 -!- Melvar has joined.
01:13:26 -!- rain1 has joined.
01:13:26 -!- economicsbat has joined.
01:13:50 -!- ski has joined.
01:13:50 -!- sebbu has joined.
01:13:50 -!- catern has joined.
01:13:50 -!- Taneb has joined.
01:13:50 -!- APic has joined.
01:13:50 -!- rodgort has joined.
01:13:50 -!- sftp has joined.
01:13:50 -!- \oren\ has joined.
01:13:50 -!- olsner has joined.
01:13:50 -!- aji has joined.
01:13:50 -!- fizzie has joined.
01:14:06 -!- ski has quit (Max SendQ exceeded).
01:14:06 -!- APic has quit (Max SendQ exceeded).
01:14:20 -!- ski has joined.
01:14:23 -!- APic has joined.
01:14:55 -!- tswett[m] has quit (Ping timeout: 249 seconds).
01:15:48 -!- j-bot has quit (Ping timeout: 242 seconds).
01:15:48 -!- xylochoron[m] has quit (Ping timeout: 248 seconds).
01:21:07 -!- wmww has joined.
01:21:46 -!- Cale has joined.
01:21:47 -!- Effilry has joined.
01:21:48 -!- uplime has joined.
01:22:00 -!- moony has joined.
01:22:08 -!- Soni has joined.
01:23:22 -!- BWBellairs has joined.
01:23:42 -!- Effilry has changed nick to FireFly.
01:28:14 -!- xylochoron[m] has joined.
01:29:16 -!- tswett[m] has joined.
01:30:34 -!- 07IACCY0P has quit (Changing host).
01:30:34 -!- 07IACCY0P has joined.
01:30:38 -!- 07IACCY0P has changed nick to relrod.
01:50:00  [[User talk:A]]  https://esolangs.org/w/index.php?diff=65600&oldid=65533 * A * (+3176) 
02:15:02 -!- j-bot has joined.
02:35:45  [[User talk:A]]  https://esolangs.org/w/index.php?diff=65601&oldid=65600 * Areallycoolusername * (+134) Questioning what looks like a bot shell
02:40:23 -!- Hooloovo0 has quit (Quit: Temporarily refracted into a free-standing prism.).
02:44:43 -!- Hooloovo0 has joined.
03:06:25 -!- oerjan has joined.
03:17:51 * oerjan looks at five days of logs and skips and jumps
03:31:47 -!- mich181189 has quit.
03:32:01 -!- mich181189 has joined.
03:47:10 -!- clog has quit (Ping timeout: 268 seconds).
03:50:12 -!- clog has joined.
04:00:02 -!- Lord_of_Life has quit (Quit: Laa shay'a waqi'un moutlaq bale kouloun moumkine).
04:02:21 -!- Lord_of_Life has joined.
04:31:17 -!- Vorpal has quit (Ping timeout: 245 seconds).
04:49:00 -!- Vorpal has joined.
04:49:00 -!- Vorpal has quit (Changing host).
04:49:00 -!- Vorpal has joined.
08:09:31  Five days of skips and jumps is a lot of skips and jumps
08:19:13  well i mostly only skipped between mentions of my name so - not many.
08:19:17 -!- AnotherTest has joined.
08:21:32  [[User talk:Areallycoolusername]] M https://esolangs.org/w/index.php?diff=65602&oldid=65436 * A * (+3413) Reply
08:22:47  [[User talk:A]] M https://esolangs.org/w/index.php?diff=65603&oldid=65601 * A * (+3386) 
08:29:01  oerjan: how have you been?
08:29:30 -!- wob_jonas has joined.
08:29:38 -!- Lord_of_Life has quit (Ping timeout: 272 seconds).
08:29:51  oerjan: there's an olist in it, but you probably don't skip over that
08:30:09  indeed, since it contains my nick
08:31:02 -!- Lord_of_Life has joined.
08:33:22 -!- cpressey has joined.
08:37:03  Taneb: do linear kinds ensure that a type is only used once?
08:39:43  cpressey: that's what kmc suggested
08:41:09  It's hard to read every line of the log
08:49:05  ^
08:49:19  `welcome oerjan
08:49:20  oerjan: 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.)
09:32:08 -!- oerjan has quit (Quit: Later).
10:07:18 -!- arseniiv has joined.
11:25:20 -!- sebbu has quit (Quit: reboot).
11:28:51  apparently the Hungarian word "meztelen" has four different variations: "meztelen, mezítelen, mezítlen, mezitelen". 
12:02:33 -!- cpressey has quit (Ping timeout: 245 seconds).
12:04:01 -!- cpressey has joined.
13:30:08 -!- moei has joined.
14:14:43 -!- atslash has quit (Ping timeout: 258 seconds).
14:15:23 -!- atslash has joined.
14:21:06 -!- atslash has quit (Ping timeout: 268 seconds).
14:22:10 -!- atslash has joined.
14:42:51  [[Brainfuck]]  https://esolangs.org/w/index.php?diff=65604&oldid=65464 * PaniniTheDeveloper * (+25) 
14:43:36 -!- PaniniTheDevelop has joined.
14:44:52 -!- lifthrasiir has quit (Ping timeout: 248 seconds).
14:45:07 -!- lifthrasiir has joined.
14:47:07  [[Brainfuck]]  https://esolangs.org/w/index.php?diff=65605&oldid=65604 * PaniniTheDeveloper * (-12) 
15:05:08 -!- Sgeo_ has quit (Ping timeout: 248 seconds).
15:19:09 -!- wob_jonas has quit (Remote host closed the connection).
15:25:09 -!- PaniniTheDevelop has quit (Remote host closed the connection).
15:41:41 -!- sebbu has joined.
15:56:53 -!- cpressey has quit (Quit: A la prochaine.).
16:08:29 -!- arseniiv has quit (Read error: Connection reset by peer).
16:08:39 -!- arseniiv has joined.
16:17:04 -!- xkapastel has joined.
16:49:22 -!- FreeFull has joined.
16:59:04 -!- arseniiv has quit (Quit: gone completely :o).
18:14:22 -!- b_jonas has joined.
18:36:48 -!- Phantom_Hoover has joined.
19:23:57 -!- rain2 has joined.
19:26:18 -!- rain1 has quit (Ping timeout: 245 seconds).
19:30:12 -!- xkapastel has quit (Quit: Connection closed for inactivity).
19:45:48  hey all
20:06:17  b_hellonas
20:06:21  `? membership
20:06:22  membership? ¯\(°​_o)/¯
20:06:24  `? member
20:06:25  I'm sorry, #esoteric has regulars, not members. Who told you about members? There are definitely no members here, and you wouldn't be allowed to know about them, anyway.
20:06:49  `grwp cult
20:06:50  homestuck:Homestuck is a cult religion for disaffected teens. Gamzee drives the bus. Best summarized by http://www.mspaintadventures.com/storyfiles/hs2/05743.gif \ iditarod:The Iditarod is a race so incredibly difficult that it has a prize for coming in last place. \ pineapple:Pineapple is a hybrid species descended from a cultivar of spinach and wild ivy, making it a class 6 vegetable. \ promise problem:A promise problem is one that happens because you pr
20:07:39  `2 grwp cult
20:07:40  2/3:ou promise too much. Their reduction to NP is p. difficult. \ subtle:The 'b' sound is pronounced in 'subtle', it's just difficult to hear. \ tea:Tea is concentrated fuel made by distilling occult herbs in a silver alambic. Americans attempted to reduce its potency by dumping some in the Ocean. \ tg:TG is short for Turing-Gödel, the highest possible level of difficulty for a multiplayer game. At this level, it's undecidable whether you can manage to h
20:08:09  `n
20:08:11  3/3:alt before losing or not.
20:08:38  it's interesting that it miscounted by 5 initially?
20:09:11  You mean that `2 miscounted by 5?
20:10:05  Yes. But maybe there's been a hostmask change between now and when `2/`1/`n were last tweaked.
20:13:15  Maybe there's some way it can be made more resilient.
20:13:34 -!- erisd has joined.
20:14:31  best not to touch it
20:14:39  at least it didn't lose any characters :)
20:28:37 -!- Lord_of_Life_ has joined.
20:31:00 -!- Lord_of_Life has quit (Ping timeout: 248 seconds).
20:31:31 -!- Lord_of_Life_ has changed nick to Lord_of_Life.
20:33:33  [[User talk:A]]  https://esolangs.org/w/index.php?diff=65606&oldid=65603 * Ais523 * (-6444) rm likely copyright infringement
20:43:46 -!- erisd has quit (Remote host closed the connection).
20:49:31  kmc: did you see that bolete
20:50:59  lol, some of those wisdoms are actually good, not like the ones I write
20:51:23  no
20:53:11  kmc: http://bolete.org/
20:53:27  <3
21:04:12  huh
21:24:21 -!- AnotherTest has quit (Ping timeout: 250 seconds).
21:39:03 -!- ARCUN has joined.
21:40:01  So Linux has ELF, Windows has PE, and Mac has Mach-o. Would it be possible to create a new executable file format for a new OS?
21:42:04 -!- ARCUN has left.
21:51:19  Is that A again?
21:58:43 -!- ARCUN has joined.
21:59:40  shachaf: No, this is Areallycoolusername. I just put an acronym since my username is too long.
21:59:53 -!- ARCUN has quit (Remote host closed the connection).
22:00:58  [[BFC]] M https://esolangs.org/w/index.php?diff=65607&oldid=58053 * ZM * (+4) Adding backlink to main BF article for convenience
22:01:21  Why do you both do the thing where you join, write one message into the chat, and leave?
22:01:41  Gratuitous joins/quits are annoying.
22:39:28 -!- ARCUN has joined.
22:41:45  shachaf: This is because there is no telling whether you'll get a response a few minutes after your message has been sent. So instead of waiting for a potentially long amount of time, I quit, and check back on the logs to see if anyone has responded. 
22:43:30 -!- Sgeo has joined.
22:45:20  I recommend just staying in the channel.
22:45:55  You don't need to stare at the channel while you wait for an answer, if your computer supports multi-tasking.
22:46:57  Anyway, it would certainly be possible to make your own format. There are plenty of them out there already: https://en.wikipedia.org/wiki/Comparison_of_executable_file_formats
22:48:26  You could just use ELF, which is supported by many systems and fairly simple.
22:49:22  I was thinking of a format that is automatically made whenever you make a program, so you dont have to run a command to get an executable. 
22:49:50  What does that have to do with which format you use?
22:54:43  No matter the format, you usually have to run a command that turns a program into a runnable executable.
22:55:09  What if you make a format that is automatically made after making a program 
22:55:32  It's easier on the OS I'm trying to make
22:57:21  "automatically made" isn't a statement about the format but about the process of making.
23:02:10  I know that the halting problem is uncomputable, but is it possible to prove that a function is a Finite State Machine?
23:04:12  Sure? It's also possible to prove that a program halts.
23:04:14 -!- Phantom_Hoover has quit (Quit: Leaving).
23:05:01  ?
23:05:03 -!- ARCUN has quit (Ping timeout: 260 seconds).
23:06:32  shachaf: Elaborate?
23:06:59 -!- moei has quit (Quit: Leaving...).
23:10:46  ):
23:16:25 -!- FreeFull has quit.
23:22:22  It's possible to prove that a specific program halts, for example by running it until it halts.
23:22:43  Did you mean a decision procedure?
23:24:36  Yes, a decision procedure.
23:26:59  to test if a function is a FSM
23:27:06  or a lower class automata is that's not possible
23:29:03  I think you'll need to specify what you mean a bit more, but it sounds like the answer is no.
23:30:19  Is a given function of a program a Finite State machine. Yea, don't think it is. 
23:30:30  wait
23:30:32  oh
23:30:34 * moony derp, didn't elaborate
23:31:49  moony: you can define a subset of programs that are "obviously" FSMs and can be checked to be such
23:31:56  for example by requiring all data structures have an explicit bound
23:32:51  Mmm. Alright
23:32:53  but if your language allows unbounded state, then determining whether a given program actually has a bound on how much state it uses should be undecidable
23:33:11  that should be an easy reduction from the halting problem
23:34:13 -!- b_jonas has quit (Remote host closed the connection).
23:34:18  kmc: Thanks. Perfect reliability wasn't a requirement anyways, so just using tests to spot various "obvious" FSMs should be enough
23:34:26  In particular every program that halts is a finite state machine, and halting is decidable for finite state machines.
23:34:52  mhm
23:35:40  Could also augment in checks to catch common unhalting issues
23:35:51  (as a flag, as there'd be overhead from these kinds of checks)
23:42:20 -!- ais523 has joined.
23:43:25  wow, there's one huge advantage to programming an SMT solver: when you want to test that your function does what you expect, you can simply write the properties it's supposed to have and the SMT solver proves that your function has those properties
23:44:13  I think all programming languages should work like this
23:44:38  yes
23:44:49  that's also why quickcheck is so great, although of course it's not exhaustive
23:45:08  it still gets you a huge test suite for very little effort
23:45:28  ais523: You can even ask it to synthesize a function for you!
23:45:51  Well, not quite trivially.
23:46:18  i had a dream of a language where you can put arbitrary predicates on types (refinement types) and it will prove what it can at compile time, and quickcheck the rest, and then optionally check at runtime as well
23:46:19  shachaf: how? even a nontrivial method, I'd be very interested in
23:47:02  I actually don't have the answer to your question, but my friend keeps telling me about the program synthesis things he was doing with SMT solvers.
23:49:29  Here's the overall structure of this website:   ...  
... ...
23:49:43 I think this was the project: http://pl.eecs.berkeley.edu/projects/chlorophyll/ 23:52:16 fizzie: I'm wondering where that tag ends 23:52:34 this structure is so illogical that I don't think the normal inference rules would help 23:53:32 shachaf: hmm, so pretty close to what I'm doing, just optimised for potato rather than x86 23:54:01 that is madness 23:54:08 you can parse it and then dump the DOM 23:54:41 oh, btw, after answering a couple of Malbolge questions on StackOverflow I had ideas for a worse version of it 23:55:10 but am not certain a) if it's TC, or b) letting people see the spec is remotely a good idea 23:55:26 somebody set up us the DOM 23:55:41 (the possibilities if it becomes public are that it's ignored, in which case it's neutral as to whether it was released or not, or that people try to program in it, which may be a bad thing) 23:57:38 ais523: Isn't a self-closing tag in HTML? 23:59:56 oh, could be 2019-08-23: 00:00:04 where does the data go, then? 00:00:20 Sorry, I omitted that part, should've put some ... in there. 00:00:33 Both of the DOCTYPEs are XHTML 1.0 Transitional, by the way. 00:00:43 it's more fun if inner document is inside the input 00:03:25 hmm… if you're going to nest HTML like that there should logically be a to show where the inner document ends 00:03:40 also, if this is /X/HTML, the browser should refuse to display iit 00:05:26 -!- tromp_ has quit (Remote host closed the connection). 00:06:38 -!- zzo38 has joined. 00:24:55 ais523: you know anything about VSDGs? 00:27:03 I don't know what the acronym stands for, which leads me to suspect not 00:27:41 Wikipedia doesn't know either 00:27:46 Value State Dependence Graph. https://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-705.pdf 00:27:53 Fun little paper/ 00:27:59 good concept 00:33:42 My opinion of PostScript is that it isn't a very good protocol or document format, but it is a OK programming language. 00:39:02 ais523: was asking because I thought it'd be something you'd be interested in. (I'm considering trying something with it myself) 00:41:04 moony: I internally think of programming at a very high level, so things like the difference between VSDG and SSA-PDG are hard for me to notice 00:41:30 I was considering using a subset of SMT2 (the input language to Z3 and friends) as a compiler IR, on the basis that it'd make proving the correctness of optimisations easy 00:41:54 neat 00:42:21 and that's VSDGish in the sense that although the source language can express unnecessary ordering constraints, the SMT solver can't see them once the program has been loaded 00:42:35 so I didn't really notice they existed 00:43:31 (another example of this sort of mental block: after working with concurrent programming for several years, I generally forget that in most processors and languages, the order in which you assign to two variables can be relevant even if you don't explicitly order them) 00:43:41 -!- tromp has joined. 00:44:28 ooh right: the compiler I wrote for work uses a VSDG-based internal representation, I only just realised 00:45:20 only its target platform is hardware, which is basically VSDG in its own right, the only difference is that you need to give explicit timing rules for when the wavefront moves 00:45:44 (but you're trying to parallelise as much as possible and not sequentialise unless you really have to, otherwise you might as well just use a CPU) 00:46:57 the other difference is that we had control flow combinators that could introduce loops in the graph 00:48:39 -!- tromp has quit (Ping timeout: 264 seconds). 01:03:11 -!- tromp has joined. 01:05:12 mm 01:06:25 neat 01:07:47 -!- tromp has quit (Ping timeout: 252 seconds). 01:16:29 -!- iovoid has joined. 01:20:50 -!- Sgeo_ has joined. 01:23:55 the great thing about the hardware compiler is that the sort of optimisation that would normally be considered a "peephole optimisation" is, ironically, higher-level rather than lower-level than working closer to the source code 01:24:01 -!- Sgeo has quit (Ping timeout: 268 seconds). 01:24:27 because it's a finer-grained representation than typical source is, and there are no ordering constraints unless they're needed for correctness 01:25:26 ugh, this VSDG thesis uses «printf("%i",(x++)+(x++));» as an example of code with unspecified behaviour, but the behaviour is actually undefined 01:25:36 in particular there's no guarantee that it prints either 0 or 1, like the author expected 01:26:47 Yeah, you're mutating the same l-value twice with no sequence point. 01:26:50 «printf("%i %i", x++, x++);» would have been a better example (I believe this is required to print either "0 1" or "1 0" but no requirement on which) 01:27:01 Yep. 01:27:02 `! c printf("%i %i", x++, x++); 01:27:04 Does not compile. 01:27:14 I think it might be implementation-defined? 01:27:14 did we fix that thing yet? 01:27:38 Though actually, could just be unspecified. 01:27:54 `` echo 'int main(void) { printf("%i %i", x++, x++); }' | gcc -Wall -x c -o /tmp/a.out /dev/stdin; /tmp/a.out 01:27:55 ​[01m[K/dev/stdin:[m[K In function ‘[01m[Kmain[m[K’: \ [01m[K/dev/stdin:1:18:[m[K [01;35m[Kwarning: [m[Kimplicit declaration of function ‘[01m[Kprintf[m[K’ [[01;35m[K-Wimplicit-function-declaration[m[K] \ [01m[K/dev/stdin:1:18:[m[K [01;35m[Kwarning: [m[Kincompatible implicit declaration of built-in function ‘[01m[Kprintf[m[K’ \ [01m[K/dev/stdin:1:18:[m[K [01;36m[Knote: [m[Kinclude ‘[01m[K `` echo 'int main(void) { printf("%i %i", x++, x++); }' | gcc -x c -o /tmp/a.out /dev/stdin; /tmp/a.out 01:28:11 ​[01m[K/dev/stdin:[m[K In function ‘[01m[Kmain[m[K’: \ [01m[K/dev/stdin:1:18:[m[K [01;35m[Kwarning: [m[Kimplicit declaration of function ‘[01m[Kprintf[m[K’ [[01;35m[K-Wimplicit-function-declaration[m[K] \ [01m[K/dev/stdin:1:18:[m[K [01;35m[Kwarning: [m[Kincompatible implicit declaration of built-in function ‘[01m[Kprintf[m[K’ \ [01m[K/dev/stdin:1:18:[m[K [01;36m[Knote: [m[Kinclude ‘[01m[K ais523: I wrote http://slbkbs.org/tmp/2019-08-21-test-cases.txt ; I don't remember whether we talked about all the things in that document. 01:28:37 `` echo -e '#include \nint main(void) { printf("%i %i", x++, x++); }' | gcc -x c -Wall -o /tmp/a.out /dev/stdin; /tmp/a.out 01:28:38 ​[01m[K/dev/stdin:[m[K In function ‘[01m[Kmain[m[K’: \ [01m[K/dev/stdin:2:34:[m[K [01;31m[Kerror: [m[K‘[01m[Kx[m[K’ undeclared (first use in this function) \ [01m[K/dev/stdin:2:34:[m[K [01;36m[Knote: [m[Keach undeclared identifier is reported only once for each function it appears in \ /hackenv/bin/`: line 5: /tmp/a.out: No such file or directory 01:28:39 ``echo 'int printf(); int main(void) { printf("%i %i", x++, x++); }' | gcc -x c -o /tmp/a.out /dev/stdin; /tmp/a.out 01:28:40 ​/srv/hackeso-code/multibot_cmds/lib/limits: line 5: exec: `echo: not found 01:28:51 `` echo -e '#include \nint main(void) { int x = 0; printf("%i %i", x++, x++); }' | gcc -x c -Wall -o /tmp/a.out /dev/stdin; /tmp/a.out 01:28:52 ​[01m[K/dev/stdin:[m[K In function ‘[01m[Kmain[m[K’: \ [01m[K/dev/stdin:2:51:[m[K [01;35m[Kwarning: [m[Koperation on ‘[01m[Kx[m[K’ may be undefined [[01;35m[K-Wsequence-point[m[K] \ 1 0 01:29:01 ooh, gcc things it is UB 01:29:06 *thinks 01:29:21 I'm not sure it's right, though 01:29:32 Huh, is the ',' in an argument list not a sequence point? 01:29:36 I thought it was 01:29:36 I would've assumed it was. 01:30:45 apparently the function call is a sequence point, but there isn't a sequence point between the arguments 01:31:05 `` echo -e '#include \nint main(void) { int x = 0; printf("%i %i", x++, x++); }' | gcc -x c -Wall -fno-diagnostics-color -o /tmp/a.out /dev/stdin; /tmp/a.out 01:31:07 ​/dev/stdin: In function ‘main’: \ /dev/stdin:2:51: warning: operation on ‘x’ may be undefined [-Wsequence-point] \ 1 0 01:31:22 `` echo -e '#include \nint main(void) { int x = 0; printf("%i", x++) + printf("%i", x++); }' | gcc -x c -Wall -fno-diagnostics-color -o /tmp/a.out /dev/stdin; /tmp/a.out 01:31:23 ​/dev/stdin: In function ‘main’: \ /dev/stdin:2:63: warning: operation on ‘x’ may be undefined [-Wsequence-point] \ /dev/stdin:2:47: warning: value computed is not used [-Wunused-value] \ 01 01:33:56 Aaah 01:36:33 I'm reading the standard to try to determine whether that's UB or not 01:37:00 each x++ has to run either before or after the other printf, but there's no such requirement on running before or after the /argument calculation to/ the other printf 01:37:19 (n1570.pdf 6.5.2.2.10) 01:38:46 that said, I can't find the part of the standard that makes "modify twice between sequence points" UB 01:38:54 I know it exists, or used to, I just can't find it 01:42:18 6.5p2 "If a side effect on a scalar object is unsequenced relative to either a different side effect on the same scalar object or a value computation using the value of the same scalar object, the behavior is undefined." 01:42:22 wow, it is indeed UB 01:42:40 the language has been very tightened up since the earlier C standards 01:42:55 `` echo -e '#include \nint main(void) { int x = 0; printf("%i", x++) + printf("%i", x++); return 0; }' | gcc --std=c89 -x c -Wall -fno-diagnostics-color -o /tmp/a.out /dev/stdin; /tmp/a.out 01:42:56 ​/dev/stdin: In function ‘main’: \ /dev/stdin:2:63: warning: operation on ‘x’ may be undefined [-Wsequence-point] \ /dev/stdin:2:47: warning: value computed is not used [-Wunused-value] \ 01 01:43:45 for contrast, the language from C99: "Between the previous and next sequence point an object shall have its stored value modified at most once by the evaluation of an expression." 01:44:40 and 6.5.2.2p10: "The order of evaluation of the function designator, the actual arguments, and subexpressions within the actual arguments is unspecified, but there is a sequence point before the actual call." 01:45:34 "previous and next" is pretty unclear in this case! 01:58:34 -!- tromp has joined. 01:59:57 Is having a pregenerated memory layout that contains pointers a good reason to disable ASLR? 02:01:03 I think it depends on how important that pregenerated memory layout it is, and what sort of attack surface your program has 02:03:34 -!- tromp has quit (Ping timeout: 276 seconds). 02:03:35 Go disables ASLR on their binaries (by default?) because they say the language is memory-safe so it's irrelevant and harder to debug. 02:04:27 doesn't that make it more likely to be vulnerable to meltdown/spectre-type exploits? 02:05:15 That seems possible? 02:05:23 even if you assume the memory safety is perfect, and so is the memory safety of all the language's dependencies (if any; IIRC go doesn't use libc, so possiibly it doesn't use anything else either) 02:05:31 I hear it's often possible to use tricks to get information about memory layout so ASLR isn't that great anyway. 02:05:47 well, it depends on how fine-grained it is, I guess 02:06:18 Programs with long loading times would be the candidates for this. 02:06:35 animalloc (the experimental malloc impl I wrote a while back) makes ASLR fairly useless because it has one random base address per program execution and everything malloc'ed is in a deterministic place relative to that 02:06:38 I hear emacs used to support loading from a core file instead of from scratch, to make load times faster. 02:07:06 but it's still better than being off entirely 02:07:06 Doesn't it still have unexec? 02:07:17 That's what it's called. 02:07:20 https://github.com/typester/emacs/blob/master/src/unexec.c Ah-yup 02:07:25 OTOH, I can imagine a malloc implementation that randomizes the address on every call 02:07:27 Oh, wait, that's ancient bull 02:07:49 a.out format executable 02:07:57 do those even work on modern Linux? I guess they do 02:08:12 Not by default, I think. 02:08:15 Your distro might not compile in support for it. 02:08:21 Computer games are a clear candidate for this sort of thing (maybe particularly on consoles?). But I don't know what occupies most of their load time. 02:08:32 Still, Linux _itself_ has been fantastic at maintaining ABI support. 02:08:44 It's userspace that's been pretty bad at it. 02:08:46 It could be loading assets, which have no pointers and therefore can just load things without pointers into memory. 02:08:55 shachaf: in-game load times, the main bottleneck is sending data to the GPU, I think 02:09:06 pikhq: If only the kernel ABI was all you needed! 02:09:09 it's pretty much being sent a memory image /already/, with no real computations 02:09:15 I mean game startup time. 02:09:35 most games are pretty good about the CPU-related parts of startup time, IME 02:09:45 probably not all of them though 02:09:50 shachaf: I mean, you _could_ static link everything. 02:09:58 Can you? 02:10:06 if there's a long loading screen right at the start, it's probably because it needs some large assets in the GPU to display the title screen 02:10:09 I want to make graphical programs which means I want to use something like OpenGL. 02:10:13 Though if you want to use GL, you are in for a _rough_ time. 02:10:24 By rough you just mean impossible, right? 02:10:29 either that or because it's prefaulting the files it uses from disk into memory 02:10:38 The only official ABI for portable hardware-accelerated graphics is dynamic linking. 02:10:41 shachaf: Yeah, basically. 02:11:18 wouldn't a statically linked graphical application potentially be limited to one type of GPU anyway? 02:11:36 there's no obvious reason why a dynamically-linked-in graphics library would be portable 02:12:08 The fact that the entire GPU interface lives in userspace is fucking awful, but there we are. 02:12:20 OpenGL is a mostly portable API for multiple GPUs. 02:12:32 pikhq: I think it's better than, say, drawing scrollbars in kernel code 02:12:39 (okay, not the _entire_, but a sizable chunk of it is) 02:12:47 ais523: I mean yes, but that's the other extreme, ain't it? 02:12:55 shachaf: yes, but couldn't two different libraries implement that API, each specialised for a particular card? 02:13:03 "bad thing X isn't as bad as other random bad thing Y" isn't really an argument for thing X. 02:13:09 pikhq: yes, but IIRC Windows actually does that, or at least used to 02:13:27 so presumably we have to find a tradeoff point in between 02:13:53 The reasonable approach is the kernel provides an abstract interface for the hardware. 02:13:54 ais523: Sure? Those are the different dynamic implementations of libGL.so. 02:14:07 Like it does for every other device. 02:14:21 Nobody has to dynamically link in a hard drive driver. 02:14:48 The hard drive doesn't run software written in a secret instruction set that you only get a compiler into. 02:15:22 right, you don't even get a compiler for its secret instruction set 02:15:41 but that's typically mostly irrelevant because the hard drive implements a standardised API so you don't need to mess around with the CPU on there 02:15:53 shachaf: Which is itself just absurd IMO. 02:15:55 (some people have got interesting code running on hard drives, though) 02:15:56 But that's how it evolved. 02:16:26 pikhq: I can see potential worries about forwards compatibility, but the real reason is likely to be different 02:16:33 And in Unix, it's not like the GPU devs showed up and decided to do it like this. Oh no. Even ancient X had the driver in userspace. 02:16:58 like, if GPU machine code were public, people might write programs in it directly and then the company would have trouble selling new graphics cards 02:17:04 pikhq: How do you mean? 02:17:10 CPU microcode is probably secret at least partly for this reason 02:17:44 shachaf: I mean that prior to DRM (the Linux API), X11 mmapped /dev/mem and had access to IO ports. 02:18:07 Which meant that X11 was portable to basically every kernel! 02:18:22 pikhq: the latter makes a lot of sense, imagine doing a system call every time you wanted to send a byte to the GPU 02:18:25 ... because it was effectively as privileged as the kernel 02:18:28 The X11 server, but clients had a standard protocol to send drawing commands to. 02:18:36 True. 02:18:44 So from the perspective of someone writing a program it was just part of the platform API. That seems OK. 02:18:56 (Except the protocol presumably didn't allow for very efficient graphics.) 02:19:05 a different split would probably involve some sort of X11 renderer that ran in the kernel 02:19:18 Or a kernel generic framebuffer driver. 02:19:25 Similar to fbdev, with more features. 02:20:09 Though the reason _that_ didn't take off is because back in the day, 2D hardware had a lot of random acceleration features, and it would be very hard to produce a good API that exposed them usefully. 02:20:10 but modern GPU libraries don't want a framebuffer 02:20:15 There are a few other standard ABIs that are only available via dynamic linking, like DNS and user lookup. 02:20:25 But for the most part you can reimplement those yourself with a bit of work. 02:20:33 a framebuffer that implies you're doing all your rendering in software 02:20:35 shachaf: musl supports user lookup without it dynamic linking. :) 02:20:39 s/that // 02:21:03 pikhq: what about when PAM is in use? 02:21:13 musl speaks the glibc nscache protocol. 02:21:23 ais523: Oh, yes, for PAM you're still stuck. 02:23:06 Man. 02:23:12 Time to scrap all of Linux userspace. 02:24:19 And unfortunately, I think PAM wouldn't let you even in _theory_ do a static linked implementation that talks to a daemon that handles the dynamic linking for you. 02:24:24 Given that GPU manufacturers aren't cooperative, what's the best graphics API an operating system could provide? 02:24:51 it'd have to be very extensible, I think 02:25:05 GPUs keep inventing new features that aren't in any API that existed at the time 02:26:18 And designing brand new APIs to support them. 02:26:45 Not that I can blame them; GL isn't a great fit to GPUs anymore. But even so. 02:27:42 So it still sounds like my answer is that I have to do dynamic linking. 02:27:47 I guess one potentially useful extreme would be something like GLSL but a bit more powerful, used to express /everything/ 02:28:09 although that'd be putting a lot of trust in the compiler to recognise what you were trying to do and optimise it 02:28:53 shachaf: What you could maybe do is limit what the dynamic library is allowed to do. 02:29:17 Like, if you forced that .so to have _no_ dependencies? 02:29:48 But libGL depends on libc and whatever else. 02:29:59 Yes, and that's why it's a problem for ABI compat. 02:30:05 pikhq: what problem is that trying to solve? (fwiw, I'm not clear on which problem shachaf is trying to solve with static linking; there's more than one problem it could potentially solve) 02:30:21 ais523: Long-term ABI stability. 02:30:41 Oh, maybe you're answering the "what could a platform do in general" question, rather than the "what can I do right now" question. 02:30:42 Force libGL to have a fixed ABI and no interaction with things that could possibly change. 02:30:52 Oh, yes, that's what I'm answering. 02:31:36 shachaf: as for "what can I do right now", depending on what sort of performance you need you might be able to invent your own very simple graphics protocol + a renderer for it 02:31:37 Sure, minimal dependencies would be better, of course. 02:31:39 shachaf: For now? You're kinda in a rough place; you're more or less forced into relying on Linux's moderately unstable userspace ABI. 02:31:50 e.g. you could just place rendered bitmaps in a particular location in shared memory 02:32:02 if you don't care about compatibility with X, you could even use the Linux framebuffer! 02:32:11 If possible, yes, define your own simple graphics protocol and a renderer if you want to ship a static binary that's long-term usable. 02:32:19 ais523: I use a 3840x2160 resolution so software renderers get slow pretty quickly. 02:32:36 In fact, that's probably your single best bet if you want to ship a Linux binary that'll still be useful in 20 years. 02:32:43 I just want software that's simple and reliable and straightforward to run. 02:33:51 Build software against symbols that are defined in the LSB, and static link in all other dependencies, I guess. 02:34:10 Not a great answer, but that's at least an ABI that's likely to be supported for some time. 02:34:20 (also really limiting) 02:34:31 shachaf: fwiw, my experience with programs that try to provide bundled dependencies has been that they usually end up breaking and can be fixed by forcing my OS's packaged versions of those dependencies rather than the program's bundled versions 02:34:50 and of course there's the issue of security updates too 02:35:33 What sort of dependencies are you talking about? 02:35:40 Problem is, if you don't bundle dependencies you're at serious risk of ABI breakage. 02:35:47 shachaf: the most recent time this happened it was zlib 02:36:06 Because the Linux userspace is only somewhat concerned with ABI stability. 02:36:21 How do you "force your OS's versions" of a statically linked library? 02:36:46 You don't, unless they're being aggressively LGPL-compliant. :) 02:36:59 shachaf: LD_PRELOAD works, but normally the shipped dependencies have been linked in dynamically anyway which makes it even easier 02:37:04 Typically on Linux, if you're bundling dependencies you're bundling .so files. 02:37:11 also the last time this happened I had the program's source available so I just modified it 02:37:21 pikhq: LGPL is bad for many reasons, but one of those reasons is encouraging dynamic linking. 02:37:48 (there was some insanity in the build process; I remember that reimplementing sqrt() myself rather than using the library version turned out to be the easiest solution) 02:38:02 _Really_, if you're targetting Linux, the answer for having code that's easy to run that's still useful in years to come is to ship binaries that work on currently common distros, and offer source that's reasonably portable so it can still be built 10 years later. 02:38:24 I'm presumably targeting every common platform. 02:38:45 Well, on Windows this is an easy question to answer. 02:38:52 Ship a binary. It'll outlive you. 02:39:09 pikhq: I'm not convinced, I've had plenty of experience with Windows binaries breaking on later versions of Windows 02:39:25 I've had programs written against Windows 3.1 break on Windows 98, for example 02:39:33 Okay, granted I'm overselling it. 02:39:39 eventually I got exasperated enough to look for any alternative, and ended up moving to SunOS and later Linux 02:39:43 Really, it will _probably_ work, but there's cases where it won't. 02:39:52 I remember Windows XP could still run binaries from Windows 2. 02:40:04 Past a certain point Windows' ABI compat is best-effort. 02:40:13 shachaf: 32-bit Win10 probably still can. 02:40:31 then my rewritten version for Windows 98 "broke" on Windows XP (it was still runnable but it ran so much more slowly as to be unusable) 02:43:09 …maybe something like WebAssembly is a good way to produce a long-lived executable? 02:43:33 being designed to be portable over anything else is also more likely to leave it stable to old programs, and ported to new OSes 02:43:43 but it basically has no kernel API to speak of 02:44:04 People are now talking about using WebAssembly to deploy code to their own servers and it seems horrible to me. 02:45:33 I actually think WebAssembly is going to be a pretty important technology, maybe not for everything, but for a wide range of applications 02:47:34 shachaf: People be using waaay worse stuff already. 02:48:44 I can imagine people doing something that's k8s-like, except with WebAssembly instead of containers, and with the scheduler actually migrating process states rather than just killing things. 02:49:09 Perhaps with it effectively running as a kernel, rather than having an underlying OS that mostly is irrelevant. 02:49:43 Yes, people are doing bad things, but that's not an excuse for other bad things. 02:49:54 Docker-style containers are scow. 02:52:29 Conceptually, I don't think so. 02:52:36 Basically every implementation detail is, though. 02:52:37 fwiw, I just looked through my old executables and found one written in 2004; it works just fine in Wine 02:55:56 http://nethack4.org/pastebin/BACKGAM.EXE if anyone's interested in trying it out on Windows (the delay was me running it through local ClamAV, followed by VirusTotal, to make sure it wasn't infected) 02:56:07 presumably they still have viruses from 2004 in their definitions :-) 02:56:47 Win10 says "This app can't run on your PC." 02:57:04 Disappointing, but at least that's a very clear error message. 02:58:06 $ file BACKGAM.EXE 02:58:07 BACKGAM.EXE: MS-DOS executable, NE for MS Windows 3.x 02:58:48 I'm on 64-bit Windows, so there's that. 02:59:09 whoa, not even PE? 02:59:10 I'm not sure what file's output even means 02:59:20 is that a specific sort of PE? or something older 02:59:35 the first two bytes are MZ so it's probably PE 02:59:42 That's an older binary file format. 02:59:45 "New Executable". 03:00:28 It was the successor to the MZ file format, used by Win16 and OS/2. 03:01:15 The MZ bytes are because NE _also_ supports a DOS MZ stub. 03:02:05 -!- ais523 has quit (Quit: sorry for my connection). 03:02:21 -!- ais523 has joined. 03:02:46 presumably it's a 16-bit executable, then 03:02:46 Are there any technical advantages to ELF or PE? 03:03:12 there are big technical advantages to arbitrary section support, which I'm not sure ELF's predecessors had 03:03:36 I am pretty sure PE does not support that. 03:03:38 do you mean ELF vs. PE, as opposed to ELF and PE compared to their predecessors? 03:03:43 I meant ELF vs. PE. 03:04:03 PE is a Windows variant of COFF. 03:04:13 COFF is the binary format ELF was built to improve upon. 03:05:08 Among other things, PE isn't really built to handle relocations in the way that ELF does... 03:05:20 How do you mean? 03:05:21 You can do relocations, yes, but they're all textrels. 03:05:33 PE relocations are weird 03:05:51 Does that mean modifying the text section? 03:05:56 On x86, each DLL is built for a given base address, and if it has to be located somewhere else you get a process-specific copy in memory. 03:06:13 before ASLR the default was for each individual executable and library to choose a preferred base address and relocations would only happen if they overlapped 03:06:23 but if they did there would be a need to relocate everything 03:06:28 On x86_64, the code's just intrinsically PIC, so this doesn't happen 03:06:37 like, every address in the code needs changing 03:08:20 hmm, after reading up a bit on PE, I have decided it is insane 03:08:58 ELF has been adopted by most operating systems, not just Linux (although Mac OS X uses its own thing) 03:09:28 ELF, while somewhat more complex, isn't a bad format, and it's suitably general that it is likely to just work for your use cases. 03:09:43 PE does support arbitrary sectiions, though 03:09:56 PE supports specifying your desired stack size, which ELF doesn't seem to. 03:10:06 But it seems there may be a GNU extension (which Linux ignores so it's irrelevant). 03:10:18 https://en.wikipedia.org/wiki/Comparison_of_executable_file_formats seems useful 03:10:39 Oh, huh. 03:11:40 Oh, I should've thought to look there. 03:11:48 PE files can contain an icon! That's a big advantage. 03:13:07 I don't see a reason an executable program should be more than one file by default. 03:13:16 Including .so files with your program just seems ridiculous. 03:13:54 I do like the Windows resource mechanism, although only for the purpose of providing metadata for use by other programs (typically shells and the GUI equivalent of shells) 03:14:07 Windows uses the same general mechanism for lots of purposes, some of which are insane 03:14:26 I know someone who includes information about command line arguments in an ELF section. 03:14:28 "this is my icon" seems like a reasonable use though 03:14:50 shachaf: I think there should be a machine-readable command line arguments standard 03:15:05 I agree. 03:17:08 fwiw, the icon system on Ubuntu (and presumably other distributions?) appears to allow the desktop theme to override icons 03:17:33 which is mostly used for generic icons like "text editor" that multiple programs are allowed to use 03:18:31 I think the program shouldn't need icons, and just the text is good enough mostly 03:19:43 Yeah, that's Freedesktop behavior I think. 03:20:12 "ownership" of programs seems to be very different on different OSes 03:20:31 for example, Windows < 8 used to organize programs on the Start menu by manufacturer 03:20:49 and they're probably still organised that way in Program Files 03:21:18 whereas the FHS suggests chopping them up into pieces, storing each file in a directory appropriate to its purpose 03:21:49 The FHS is also assuming most of the FS hierarchy is owned by the OS. 03:22:16 If it's a completely third-party program it's supposed to be in /opt/foo, where it's owned by the program, or in /usr/local, where it's owned by the system administrator. 03:23:28 ooh, that's a good way to express the difference betwen /opt and /usr/local 03:24:06 this implies that packages should aim for /usr if being uploaded to the OS package manager, and /opt if being sideloaded, right? 03:24:21 (with /usr/local being for things that were built manually) 03:25:55 I think so, yeah. 03:26:22 <\oren\> http://orenwatson.be/v0tgil.htm#vocabpics 03:27:02 I'm confused. Is that supposed to be a phonetic spelling? 03:27:39 Oh, this isn't an English thing, never mind. 03:27:45 <\oren\> it's vötgil, a IAL that's so bad it's hilarious 03:28:15 <\oren\> and therefore, I have started learning and using it and making resources about it 03:28:31 whoa, https://en.wikipedia.org/wiki/ALGOL_58 03:28:40 I didn't know there was such a thing as ALGOL 58. 03:29:10 Have you considered the following novel thesis: 03:29:15 Good things are better than bad things. 03:29:20 <\oren\> When was the first actual compiler for ALGOL made 03:29:31 \oren\: This is... not a good language. 03:30:00 "Every word in Vötgil has exactly three letters" 03:30:06 <\oren\> wait till u see the grammar 03:30:09 Ah, I _see_, you're doing Toki Pona only less well 03:30:49 <\oren\> nah the grammar has infinite recursion,unlike toki pona 03:31:14 Wow, that grammar is actually pretty shit 03:32:16 <\oren\> also it differs from toki pona in having lots of words for manmade objects 03:32:32 And in not having much of a point, good or bad 03:32:49 (I mean, Toki Pona is silly, but at least it has a reason for being the way it is) 03:33:00 and Minecraft support? or does Toki Pona have that too? 03:33:15 Like, it looks like it's coming from someone who only knows English, but thinks they're gonna be clever by being overly simplistic about it. 03:33:24 <\oren\> I think there is a mincraft localizationfor toki pona 03:33:57 Hah, caaaalled it. The vocab is all supposed to be English-cognate. 03:34:09 <\oren\> well, the funny thing is, it looks like english up until you interpret eisenmann literally 03:34:35 <\oren\> he says, e.g. a descriptor always goes before the word it describes 03:34:45 <\oren\> so you have to say the bird red is 03:36:08 <\oren\> and a preposition goies between the words it modifies 03:36:37 <\oren\> which means a preposition has to attach to the verb, *before* the direct object 03:37:06 lol 03:37:49 So, either the grammar works nothing like he intends, or he is just bad at describing the grammar in a clear way. 03:37:56 <\oren\> I make with wood a house 03:38:03 wow that grammar is bad 03:38:42 <\oren\> the grammar is based on me interpreting eisenmann literally and paying no attention to his example sentences 03:38:59 That is at least the more interesting version. 03:39:07 Because his examples seem to suggest "lol it's English" 03:39:13 <\oren\> because if I went by his examples it would just be english 03:39:38 <\oren\> he's since moved on to breadspeak 03:39:52 <\oren\> (yes, that's the name of his current conlang) 03:40:19 something seems odd about a conlang whose vocabulary is so English-inspired 03:41:20 <\oren\> I mean,volapük was also full of clipped english words 03:41:43 <\oren\> with some german ones like klig (war) 03:41:50 Esperanto is a kind of consensus-Indo-European, which makes more sense 03:43:41 Though consensus-Indo-European as viewed by a Russian speaker, which is a bit weird phonotactically. 03:44:22 <\oren\> Another interesting thing is vötgil has morpemic roots for such meanings as "foot" "pound" "dollar" "mile" and "gallon" 03:45:31 * ais523 is wondering if it would be possible for a conlang to actually be a con, as in confidence trick 03:46:02 What, like Interlingua? 03:47:11 -!- tromp has joined. 03:51:19 -!- tromp has quit (Ping timeout: 250 seconds). 04:59:03 -!- ais523 has quit (Quit: quit). 05:26:05 Does your text section have to be called .text? 05:32:08 As far as i'm aware, i don't think so? Why not test 05:33:34 -!- oerjan has joined. 05:35:03 -!- tromp has joined. 05:36:19 Well, it's certainly not true for executing ELF files, since sections are ignored entirely. 05:36:30 I was wondering whether there's some situation where some linkers expect it. 05:40:01 -!- tromp has quit (Ping timeout: 276 seconds). 05:53:47 it's interesting that it miscounted by 5 initially? <-- that's because you didn't use `1 initially, so there was no 1/3: in it 05:56:25 iow, `1 and `2 share the same chopping into lines, `2 just starts displaying the second one. 05:58:26 `cat bin/2 05:58:26 ​\` "$@" |& sport 2 06:12:46 Hmm. 06:12:57 Shouldn't `2 handle that case? 06:34:00 -!- tromp has joined. 06:41:50 if it did, then it would break if you cycle back to line 1 because now it's longer than the cutoff 06:42:21 It could break that line into two lines and then show line 3. 06:42:30 That's certainly not confusil. 06:42:36 CERTAINLY 07:13:10 -!- tromp has quit (Remote host closed the connection). 07:28:59 -!- tromp has joined. 08:31:00 -!- Lord_of_Life has quit (Ping timeout: 248 seconds). 08:32:48 -!- Lord_of_Life has joined. 08:43:14 -!- AnotherTest has joined. 08:48:07 -!- tromp has quit (Remote host closed the connection). 08:56:23 -!- tromp has joined. 09:29:41 -!- oerjan has quit (Quit: Later). 09:51:20 -!- wob_jonas has joined. 09:51:52 -!- tromp has quit (Remote host closed the connection). 10:01:28 -!- tromp has joined. 10:01:30 ais523: right, and that UB rule of C is why we can't write the statement of 3SP as just "a[a[a[x++" in C, 10:01:46 as just "a[a[a[x]]]++" in C, 10:01:57 and this impacts some other simple one-instruction languages too. 10:04:25 ais523: no, a.out is no longer supported by the linux kernel. this is recent enough that you may be running an old enough kernel in which you can compile an a.out executable, but the harder part may be to install a libc that works with it. 10:04:41 I don't think I've ever seen an a.out executable alive, I only read about them in history books. 10:07:01 video game loading times => I think if the loading time matters in first place, then the game is loading something wrong, eg. having long repeated unskippable cutscenes such that speedrunners reset the game rather than wait for the cutscene, or frequent crashes or freezes or hardlocks that you can recover only by restarting the game 10:09:33 pikhq: the hard drive driver is in the kernel because the kernel needs it to boot, and the file system driver is in the kernel because people demand swapping into files so we can't swap the file system driver out "https://esolangs.org/logs/2019-08.html#lqVb", plus also to limit permissions of file access, so that a process can't just read and write 10:09:33 every file it wants to. 10:10:10 for a GPU, I'd prefer if most of the driver was in userspace, with only as much in kernel space as required so that the prorgam can't do something malicious, and that if the program crashes, the kernel can reset the gpu to a usable state 10:10:55 that still means some nontrivial driver in the kernel, but I would prefer if all other things were in userspace libraries installed by my distribution. 10:12:21 and note that even for the file system, mkfs and fsck and tune2fs and fdisk are still in userspace 10:13:26 writing the two file systems plus two fs extensions that you burn onto CD or DVD, plus all the knowledge about writing audio CDs, those are also all in userspace 10:14:07 the kernel knows how to read file systems from a CD or DVD because we want to boot rescue systems from them and possibly even run live systems from them 10:17:13 " There are a few other standard ABIs that are only available via dynamic linking, like DNS and user lookup." => yes. and do you know which part of glibc had a critical buffer overflow bug? the one that parses numerical ip addresses. so if you had DNS lookup statically linked into executables, then all my old executables would still be vul 10:17:14 nerable even after I have debian update glibc with the security patch. that, or I'd have to have debian update every fricking executable that has DNS lookup inside it, which is a lot these days. 10:17:43 there's a good reason that those nontrivial parts of glibc, which don't need to be inlined or anything, those are in a dynamic library. they should be. 10:19:02 and debian is right to put only one copy of every library on my machine, as a dynamic library, as much as possible, not just to conserve disk space, but to be able to automatically update those dynamic libraries with ABI-compatible updates, and they'll work immediately after exec, even for prorgams that I've compiled myself. 10:20:16 and I've seen DNS lookup reimplemented, yes, and in that particular case it can even make sense because libc doesn't provide a non-blocking interface, but there are broken reimplementations that don't interpret your config files the way they should, in which case you get subtly broken and hard to debug problems in any non-default configuration 10:22:03 also, I would like to keep the kernel small so that I don't have to pay for features I don't use in locked kernel memory, because not every addition can be put into a swappable module, and people keep breaking the swappability 10:22:35 we used to have kernels that were just one megabyte long, I'd like that back 10:22:58 (one megabyte long with full reiserfs support) 10:23:47 glibc is a mess and every time I have to read the code for anything in it I'm sad. 10:23:52 " and of course there's the issue of security updates too" => excatly 10:24:07 Still not as sad as when I have to read anything in /usr/include/c++/, of course. 10:24:12 shachaf: yes, it is, I'm not saying you should put everything in glibc, more like that you should put everything in good userspace libraries 10:24:33 shachaf: why? do you get underscore sickness? 10:24:41 Underscores are only a small part of it. 10:24:55 If there were good userspace libraries I'd be more sympathetic to that advice. 10:25:06 don't worry, it will get worse when the macros will have to work around that ((void)a,b) can now call an overloaded operator if b is a fancy type 10:26:06 Why are you saying not to worry because it'll get worse? 10:26:12 I'd prefer for it to get better. 10:27:57 " …maybe something like WebAssembly ... being designed to be portable over anything else" => didn't they promise that about Java too? each of the past versions of Java that is? 10:29:12 WebAssembly is surely a better prospect than the JVM because its memory model is an array of bytes instead of a heap of garbage-collected Java objects. 10:30:57 " Including .so files with your program just seems ridiculous" => that's because more than one program can use the same .so, and also I can update a .so without updating the main program or backwards 10:33:36 I hate Toki Pona 10:33:57 I think it's because of the LGPL or because of everything being bad and people just doing whatever. 10:36:39 -!- cpressey has joined. 10:39:47 shachaf: I don't think it's because of LGPL that libc is bad 10:42:26 People get things to work and don't care that the result is ugly because, well, they work. 10:42:54 cpressey: sure, I know, I work with computers too, I know how it goes 10:42:56 This is by no means unique to software. 10:43:24 the next project is always urgent, there's never time or motivation to clean up the previous one to work properly 10:43:59 cpressey: sure, but I don't want to know how every other industry works. I want to be able to drink beer and eat sausage, which is why I don't go to the factories where those are made. 10:44:10 Why people think they need more and more new versions of C, though -- that, I'm not sure of. 10:44:54 Aha. At least C18 was basically a bugfix update. This makes me relatively happy. 10:45:47 C2x looks like a trainwreck though. 10:45:50 cpressey: the original C was tailored for the computers that existed back then. C99 made it official that the sqrt function, which calls *one* instruction, doesn't have to update the thread-specific errno. It and C11 also add a bit more modern floating-point maths stuff like that, which I think is good. 10:46:30 They also added clear threading semantics, which didn't exist before, plus threading and mutex+condvar and atomic primitives to have yet one more standard of those. That part is still fine. 10:47:31 That they also added variable size arrays was probably a mistake. The designated initializers was probably a reality check because the linux kernel team decided that they will be using it and aren't letting it go, so it was best to just standardize it rather than leave it as a gcc extension. It's not like msvc cares about the C standard anyway. 10:47:58 I don't know anything about C18. 10:49:06 I'm only going by what I saw when glancing at Wikipedia articles. 10:49:46 Oh yeah, they also added those msvc-specific "safe" library function thingies in the standard, where if you use memcpy you get a warning, and instead you have to pass the size argument twice to be sure it doesn't run over the buffer size or something. 10:50:46 That's also nonsense, but again, msvc implements it by default anyway and MS will force their own coders to that standard, everyone else can still use the normal functions and suppress their warnings, so it's not like it matters what the C standard says. 10:51:26 It's really the tricky threading and pointer semantics and that sort of thing where the C standard matters, because that's what people will look up there. 10:52:19 For some extra functions or missing functions, the compilers or libraries can always say that they don't implement that, but if everyone used different pointer aliasing semantics or different threading rules, that would be a chaos. 10:53:03 What C needs most is better static analysis, to actually prevent the buffer overruns and use-after-free's and so forth. 10:53:29 cpressey: I don't think that's the task of C. that's the task of higher level languages like rust. 10:54:19 Erm well, then you could say, what the world needs is to stop using C so much. 10:54:44 cpressey: no, some people can use C just fine without making their code full of stupid bugs 10:54:51 not me, but some programmers can 10:55:08 all the linux kernel people mostly manage it too 10:55:49 -!- xkapastel has joined. 10:55:53 you don't want to force everyone to have to prove to the compiler that their code is right, because sometimes they (eg. the linux kernel guys) need to optimize something so much that they really can't write a machine-readable proof 10:56:23 most of the time, when I write code, I don't mind the bounds-checked and memory safe operations, even if they're slower 10:56:50 for the few cases when I do need to optimize the code, I can override those checks, in rust as well as anything, or write the inner loop in C or C++ 10:57:04 I'm of the opinion that if you need to optimize it *that* much, you probably should just use assembler anyway 10:57:20 but if someone mostly wants to write code where he doesn't want to write proofs, then it's fine if they want to use C 10:57:27 I don't recommend it to most people, but some people do manage it fine 10:58:12 -!- tromp has quit (Remote host closed the connection). 10:58:23 cpressey: I disagree, there is an intermediate stage where the compiler can produce the right code if I use the right (possibly nonportable and likely machine-specific) incantations 10:58:41 but sure, sometimes you want to write the code directly in assembler, as ais523 says 10:59:05 still, to even be able to interface the assembler code with your high-level code safely, you need a language with an unsafe interface, like C or similar 10:59:22 wob_jonas: No, people ship .so files with their executables because of the LGPL. 10:59:42 it would be really inconvenient to do the boundary part if all you had was mandatory memory-safe high-level languages and machine code 10:59:43 cpressey: They work but they don't work well. 11:00:02 you'd effectively need to define the rules of C, perhaps without the compiler and concrete syntax, to do it 11:00:08 to even describe the interfaces 11:00:35 and note that gcc can do inline assembly where stuff is passed to assembly code through specific registers, and even condition flags now 11:00:40 which really isn't trivial 11:01:01 (the gcc syntax is a bit awkward, but if you deal with writing your own assembly code, you can learn it too) 11:01:07 `? =ccc 11:01:09 ​=ccc? ¯\(°​_o)/¯ 11:01:42 `? =@ccc 11:01:43 ​=@ccc is a great innovation in gcc 6, kept top secret, where inline asm statements can return a value in the carry flag on x86_64. See https://gcc.gnu.org/gcc-6/changes.html which keeps this secret, https://gcc.gnu.org/onlinedocs/gcc-6.1.0/gcc/Extended-Asm.html , https://marc.info/?l=linux-kernel&m=143786977730804 . 11:02:05 ^ that's one of the secret incantations, the other is the syntax to pass a variable to inline asm in a specific register 11:03:44 but more specifically, some of the time I want to write loops of explicitly vectorized code, or code with unsafe memory accesses, but I don't want to deal with the register assignment or scheduling part, in which case a C or C++ compiler with machine-specific code orks better for me than writing any assembler 11:04:08 I have done this in my previous job for image processing stuff 11:05:20 and if you know what you're doing and willing to take the risk of premature optimization or pessimizing your code, then sure, write assembler code if you want 11:05:30 I may also meet a case when I need to 11:09:53 Right, everyone who isn't in a position where they need to hand-vectorize code to meet their performance requirements needs to stop using C. 11:10:35 cpressey: I was using C++, and not portable one either 11:10:57 one that basically tells which AVX instruction to use 11:11:16 and optimized for the AVX instruction set 11:13:12 hopefully soon I'll be able to write that directly in rust 11:13:33 they already have a decent backend for the compiler 11:13:49 and they added some of the x86-specific stuff 11:14:27 not as good as C++ for that sort of thing yet, but improving 11:14:41 (it just needs a fucking printf) 11:17:01 -!- tromp has joined. 11:17:22 "you don't want to force everyone to have to prove to the compiler that their code is right" -- No, actually, as the person who is going to *use* the software, I kind of *do* want that 11:18:33 cpressey: most of the software I write is throwaway one used for research that nobody else will run on their machine 11:18:48 I care about that use 11:19:16 and care about the kernel and image editor and video compressor and other programs doing all their nonsense efficiently too 11:19:22 i love that rust ships with a complainer 11:19:47 not the browser, or the tax filing software, mind you 11:19:58 myname: perl does too, it's an old idea 11:20:02 doesn't usually help much 11:20:14 well, depends on which complainer you mean 11:20:18 perl ships with only one of them 11:20:34 rustc of course ;) 11:20:38 cpressey: ah but are you willing to pay a reasonable price for that? 11:20:40 do you mean the one that gives the long explanation for error messages, or the lint-like tool? 11:21:15 mainly the type- and memory-checker 11:21:19 love it 11:21:32 myname: sorry, I mean the former is rustc --explain, the latter is clippy 11:21:45 but apparently you just mean that rustc gives decent error messages 11:21:46 cpressey: For the time being, I think proving code correct is one to two (decimal) orders of magnitude more time consuming that just writing it. 11:21:59 don't worry, it will no longer be able to keep it up once they make the generic system powerful enough 11:22:08 the two features are exclusive 11:22:11 wob_jonas: i mean that rust enforces you to write clean code by design 11:22:28 (And more difficult too) 11:23:07 myname: no, it doesn't enforce. it lets you write clean code if you want to, but also lets you override the safety checks if you're willing to learn about all the UB rules and magic low-level stuff (MaybeUninit, UnsafeCell, etc), which are very different from the C++ ones 11:23:16 that's what I like in it 11:23:25 python is sort of like that too by the way 11:24:20 the fricking indents are still putting me off about python, but I've determined that it's possible to extend its syntax to allow normal braced code, in a compatible way. I should implement it, install it to my machine so I can do proper python one-liners from the shell command line, 11:24:34 install it to HackEso, document it, and submit it to the python guys to perhaps get it adapted officially. 11:25:08 I mostly ignored python because the indents bothered me so much, but now that I took a look at it, I see it's become a good language (admittedly it took some time, just like with rust and C++) 11:25:42 i hate the errors i make in python 11:26:20 like, "foo"+bar with bar beint a number will throw an error. i kinda get that, but i hate when it happens 11:27:11 wouldn't it be grand if there was a type checker to catch those... 11:27:20 int-e: tests are also more time-consuming to write than code (though perhaps not a full OoM). In the absence of a proof, I'll settle for tests. 11:27:53 It's when there's no proof and no tests I start to really worry, because that means there might not even be a specification 11:27:55 int-e: that's my point. a type-checker would be great. or just auto-converting to a string, maybe with a message in stderr 11:28:05 and with no specification, what are you even doing 11:28:05 cpressey: Yeah I'm afraid tests will remain state of the art for some time still. 11:28:11 but no, python decides to play along until it doesn't 11:28:54 int-e: Well, if you can prove some important, smallish properties of the code, that's a start. Type systems, basically, are that, aren't they. 11:29:29 is prooving code in production really something people do? 11:29:50 myname: Yes. 11:29:51 cpressey: (simple, HM-alike) type systems are a sweet spot because for the most part you just have to write down the assertions and can leave proofs to the compiler. 11:30:31 cpressey: interesting.have to have a look if there are useful frameworks for that 11:30:34 myname: Amazon something something AWS, Microsoft something something USB stack, I'd have to find the references 11:30:38 cpressey: but there's also such a thing as too many tests. have you ever manged to run the ghc testsuite or the gcc testsuite? 11:30:53 cpressey: Dependent type systems leave that sweet spot behind (type inference doesn't work anymore) so I'm rather skeptical of those. 11:31:02 I haven't. I tried, but they take a very long amount of time to run. 11:31:34 int-e: Liquid Types are a sweet spot between dependent types and HM :) 11:31:42 i assume haskell to be relatively easy to proof first order properties for 11:32:22 i don't know where to even start for something like java without a full-blown model checker 11:32:27 some software does it well, where it has a smaller testsuite and a full testsuite. in some sense gcc does that too, with its three-stage compile: it compares the second and third stage binaries to each other, ignoring a few bytes that are allowed to differ, and they must be identical. 11:32:37 cpressey: hmm new keyword for me 11:32:56 or possibly buzzword, need to see about that 11:33:05 int-e: https://wiki.haskell.org/Liquid_Haskell 11:33:35 what's that... 11:34:38 ok 11:36:15 -!- tromp has quit (Remote host closed the connection). 11:36:35 Meh, it mentions "stack". :-P 11:36:43 int-e: I agree "Liquid Types" is a horribly-hip-sounding name. 11:37:02 Short for "logically qualified types" I believe 11:38:04 https://www.microsoft.com/en-us/research/video/liquid-types/ agrees 11:38:30 myname: The emphasis in industry is usually on reactive systems, so, model-checking state-machine-like descriptions is popular (TLA+ and Microsoft's P language come to mind) 11:39:42 okay, should be fairly easy there 11:40:13 "What Are 10 Examples of Liquids?" - "liquid types" is not the perfect search term. 12:06:26 I want to wait until there is more to read on one of two files I have open. C: use select(). Haskell: you must write Concurrent Haskell program now, oh and make sure to use STM because MVars have race conditions 12:08:29 ?! 12:08:29 Maybe you meant: v @ ? . 12:08:40 "MVars have race conditions"? 12:09:15 cpressey: Maybe you mean deadlocks? 12:09:19 do you have any specific questions? 12:09:34 "They are appropriate for building synchronization primitives and performing simple interthread communication; however they are very simple and susceptible to race conditions, deadlocks or uncaught exceptions." 12:09:51 I don't get the race conditions angle. 12:09:56 if you use them wrong, sure 12:10:19 The other two, yes, they are true. 12:10:24 All of Control.Concurrent seems to read like this. "We have these but you shouldn't use them, really" 12:11:43 You have to think about lock dependencies with MVars. 12:11:59 -!- tromp has joined. 12:12:20 (Assuming you use MVars as locks. MVars are also mailboxes, message queues of length 1.) 12:12:55 you also have to think of deadlocks when you use them as queues 12:13:13 MVars are *simple*. STM is a huge black box. 12:13:13 travelport has a full-blown api for quite some time where the documentation just says "this is not supported by any of our data backends" 12:13:20 wob_jonas: sure 12:14:37 All I need is select(). There used to be an hSelect, they got rid of it. There's a package on hackage which is an FFI to select which is probably the best I can do. 12:15:15 cpressey: So, again, I agree with that quote, except for the race conditions part, which to me suggests a completely broken MVar implementation. 12:15:28 do you have any opinion about eta/frege? 12:17:10 -!- tromp has quit (Ping timeout: 276 seconds). 12:18:11 cpressey: Or maybe I do have an idea. It used to be the case that "readMVar" could block (namely, if you use the MVar as a 1-slot queue, so there can be several pending writers.); maybe "race condition" alludes to that kind of phenomenon... 12:19:20 * int-e sighs 12:20:08 or people just write bad code with MVars, which has race conditions that put their own high-level data in a corrupt state 12:20:25 (Concrete scenarios rather than keywords would help. The keywords are just scary and cannot be filled with content unless you spend a lot time thinking up scenarios... or happen to know them already.) 12:20:44 yeah, specific questions are better 12:20:54 myname: I'm not generally a fan of languages that are slight variations on other languages. 12:20:55 especially with code samples and expected output and stuff like that 12:21:06 Do we have real-life stories of STM livelocks? 12:21:38 Or maybe just a scenario where the rts spends 99% of the time in managing the STM transactions, so nothing productive happens? 12:22:06 cpressey: valid point, but both are not really aimed to be slight variations afaik 12:22:17 Or is STM so complicated that it's only used by people who know what they're doing... and who, in particular, keep their transactions short so that this is a non-issue? 12:23:07 myname: I'm thinking more of Fay and Elm which are only "Haskell-like". I got the impression Frege was "not actually Haskell" too, but it might be the wrong impression. (Eta's website make my browser complain about phishing risks or something) 12:23:58 "Frege is a Haskell for the JVM." ... What does it mean to be "a Haskell"? 12:24:16 cpressey: In any case I'm perfectly happy to use MVars in simple cases, like waiting for a worker thread to finish, or managing exclusive access to a mutable data structure. 12:24:19 If it was "Frege is a Haskell compiler for the JVM" that would be fine 12:25:27 cpressey: Maybe you should learn you a Haskell for the greater good! 12:25:50 (typing this is painful) 12:29:04 both attempt to compile haskell for the jvm with different approaches 12:29:17 frege does overload the dot operator, for example 12:29:29 like, foo.bar is different from foo . bar 12:29:59 I guess I could just take a semi-non-trivial Haskell program and try to run it in Frege and see if it complains or not. 12:31:29 int-e: I would believe that STM scares off everyone who is not already rather expert at writing concurrent code, yes 12:40:59 -!- arseniiv has joined. 12:52:06 -!- Vorpal has quit (Ping timeout: 258 seconds). 13:23:02 I'll probably just use Control.Concurrent.Chan when it comes to it, it should be fine (single reader, multiple writers, nondeterminancy is okay). 13:26:36 cpressey: Yeah the only problem with Chan is that it doesn't prioritize the reader when the channel gets full (a key difference to channels in Erlang). 13:27:51 STM doesn't solve that one, and bounded channels are comparatively crude. 13:33:17 int-e: I don't see any mention of what it means for a channel to become full, in the Chan docs 13:34:41 In fact it mentioned the word "unbounded" 13:34:53 Yes. Which hides a problem... 13:35:31 ...namely, if your reader cannot keep up with the producers, you have a (kind of) memory leak at your hands. 13:35:56 Ehm. Technically yes. In practice, this is unavoidable though, right? 13:36:23 Sure but you can be more clever about it, if your scheduler knows about channels. 13:37:02 In some cases, the producer can block, or detect the problem and drop frames 13:37:03 I'm not saying it's a big problem. Just something to be aware of in a corner of your mind if you rely on channels heavily :) 13:38:02 Sure. 13:38:20 (And something that I found surprising when I first heard about it.) 13:38:49 (And that's the main reason I bring it up. It could be a pretty nasty surprise.) 14:39:28 -!- ais523 has joined. 14:40:39 wob_jonas: wait, how is a[a[a[x]]]++ UB? the increment has to happen after all the array dereferences 14:41:31 ais523: isn't it an UB if it increments a[x] or a[a[x]] because the indexes coincide? 14:41:52 hmm wait, maybe it's not 14:42:08 no, because the dereference is sequenced before the increment as the increment uses its output 14:42:15 that needs a language lawyer, I think 14:44:33 cpressey: in terms of "just write your code in asm", I'm often tempted, but ideally I want to write a high-level description of the code so that it's portable and easy for a human to see it's correct, but want it to compile down to efficient asm on at least one commonly used platform 14:44:46 I mean this is in an area where I can hardly imagine a compiler going wrong, but I have no clue what the UB rules say about this. 14:44:53 let me look this up, maybe this applied only to my language where the main loop included a[a[1]++]-=a[a[1]++], which was an UB because it sometimes had to write into a[1] with the -= operator 14:45:20 but I think the post and preincrement has or had extra UB rules more strict than for other assignments 14:45:29 (it just needs a fucking printf) ← there's print!(), which isn't quite the same; are you doing one of the few things where the difference matters? 14:45:32 so that they can be rearranged by the optimizer 14:45:54 wob_jonas: /that/ example is UB because the ++s aren't sequenced with respect to each other 14:47:21 cpressey: For the time being, I think proving code correct is one to two (decimal) orders of magnitude more time consuming that just writing it. ← I've heard 1 order for enough testing to be fairly confident it's correct, 2 orders for an actual proof that it's correct, 3 orders for a proof that it's correct that can be machine-verified to not contain a fallacy 14:47:42 I've actually written code in the last form, it taking 1000 times longer than expected seems about right 14:48:19 (the programs being verified were very simple and would normally take less than a minute to write) 14:48:42 I think I include some amount of debugging and testing in the "just coding" category already. 14:49:14 yes, but you can have a project that's heavily tested and yet still be confident that it's wrong 14:49:15 And sure, the factor is worse for programs that you already know how to write :P 14:49:20 because the spec implies a lot of hidden complexity 14:49:45 "compile all C programs correctly", for example, is a nice simple spec at the surface level, but when you dereference the reference to the C standard, suddenly it's hard to be confident that your spec is correct 14:50:06 Because, ironically, you will *not* know in detail *why* they are correct; you'll be replicating an internalized pattern instead. 14:50:34 anyway, this is why I think declarative languages are so valuable: the program /is/ the spec, so the only way the program can be wrong is if the spec is wrong or if you translated the spec into code incorrectly 14:51:08 ais523: I think that's also kind of a weakness though. You can't check a program against itself. 14:51:12 (I have also written formally verified code. It wasn't trivial, and I think a factor of 100 is pretty much what we got.) 14:51:24 machine-checkable. 14:51:51 (Well ok you CAN, but it's a tautology.) 14:51:55 cpressey: I guess you'd need to get two different people to write the /specification/ and see if the programs matched 14:52:03 which would be useful, because buggy specifications are very common 14:52:15 I did a thought experiment about FizzBuzz recently 14:52:26 ais523: Basically yes, it's kind of like coding theory. 3 specifications would be ideal, you could go with majority-rules 14:52:29 Oh, target language makes a difference... we exported code to Haskell in the end, and purity helps. 14:52:45 (Kind of expensive though) 14:52:49 If you want mutable data structures, things get worse. 14:53:35 you start with a specification like "for all the numbers from 1 to an input n, output 'Fizz' if the number is divisible by 3, 'Buzz' if the number is divisible by 5, the number itself if it's divisible by neither 3 nor 5, and a newline unconditionally" 14:53:56 "the program /is/ the spec" <-- in many cases that's only true if you don't care about performance... 14:54:17 then you start thinking about issues like, "OK, where does this output go? What file format is it in? Is this meant to be readable by humans or computers? What about internationalization?" 14:54:47 "say there's an error halfway through the fizzbuzz, do we delete the output so far? leave it there and make the program resumable somehow?" 14:55:02 "how do we parallelise this?" 14:55:12 int-e: I see that as a deficiency in the languages more than anything else 14:55:13 ais523: ok, I think you're right about the 3SP case, that one is fine to be written as a[a[a[x]]]++, even if the indexes may coincide 14:55:47 and so are other cases where there's only one assignment and that's the outermost expression 14:56:15 ais523: Well, you can definitely give a specification which doesn't entail any particular efficient implementation strategy; how should such a language pick one? 14:56:30 at least according to the C11 rules 14:56:39 I mean, ideally, yeah, you could give it hints in comments or something, but - far from an easy problem 14:57:02 ais523: Uh, I disagree, at least given our current imperfect state of compilers. I want, as a programmer, control over the algorithm used to solve a task. 14:57:44 So that will be part of the program... 14:57:54 cpressey: I don't think it's impossible that computers will eventually be better at that than humans 14:58:06 Maybe in an ideal world where we could solve the halting problem my attitude would be different ;-) 14:58:33 one thing I noticed a while back is that if you just run all possible algorithms in parallel (assuming finitely many), and terminate when one ends, you get the best possible big-O performance (and a terrible constant factor) 14:58:46 Yeah that's a classic. 14:58:49 and thought this might actually be viable in a golfing language 14:59:21 It usually comes up in the following form: "We can write a TM that solves SAT in polynomial time iff NP \subset P" 15:00:10 (the point with NP being that we can check in polynomial time whether we've succeeded) 15:00:20 by generating programs and executing them in parallel until one of them comes up with a valid solution, then you don't care how it was made 15:00:46 also I'm pretty sure you don't mean \subset there, you probably mean either = or \subseteq 15:00:50 (which is something you need, really; "all possible algorithms" need to be filtered for correct algorithms for your task at hand, somehow) 15:00:56 (which are equivalent in this case because P \subseteq NP) 15:01:24 Yes I mean \subseteq. 15:01:49 I wanted to write NP (= P :P 15:02:22 * ais523 suddenly realises that (= and =) as operators would not be ambiguous in a C-like language, although )= would be 15:02:36 (which Isabelle/jEdit expands to ⊆.) 15:02:46 err, LALR(1)-ambiguous, that is; )= might be unambiguous if you have a generael parser 15:03:54 . o O ( a =( b && c )= d <-- it would be horrible nontheless ) 15:04:14 *nonetheless 15:04:18 Still waiting for the esolang that uses Earley or CKY to find all possible parses and interpret them all in parallel 15:04:19 int-e: you wrote =( not )=, which is what the unambiguity relies on 15:04:45 cpressey: that's probably only interesting if this is somehow the only way to gain TCness 15:04:59 ais523: did I :) 15:05:13 anyway... let's drop this 15:05:23 it's a tangent of a tangent anyway 15:05:33 (not speaking geometrically) 15:05:34 isn't that what the channel's about? :-) 15:05:57 geometrically, a tangent to a line is the line itself, and tangents are lines, so you can't stack them more than one level 15:06:34 indeed. hence the qualification. 15:06:58 anyway, I had ideas about a declarative golfing language which makes a guess about what order to run the commands in 15:07:34 basically by knowing what the computational complexity of each possible flow pattern for each command is, then trying to avoid bad complexities 15:08:08 this isn't perfect because the program might have a quadratic or even exponential blowup in data size, but it's going to do a lot better than most existing declarative languages if I ever get around to writing it 15:08:51 finding the path of least complexity sounds rather complex by itself 15:09:20 yes, but that's O(whatever) in the size of the program, not the size of the data it processes 15:09:45 this explains where the controversy over the computational complexity of regex-with-backreferences comes from 15:09:58 you can find articles online saying it's NP-complete, but I think it's in NL 15:10:03 cpressey: Hmm. "Insulting instruction in step $rs.\n" <-- do you recognize this? 15:10:15 int-e: SMETANA? 15:10:28 smetana.pl, rather 15:10:45 and the reason is that running an unknown regex-with-backreferences runs in NP time (you can encode 3SAT in it), but with any known regex, you can compile it to run in NL time with respect to the length of the string it's running on 15:10:57 cpressey: right 15:11:02 cpressey: you're good :) 15:11:24 Very few of the languages I've designed have used the term "step" 15:11:31 So that was a big hint. 15:11:47 a very long time ago, I started writing an esolang-based text adventure 15:12:04 it had a set of stairs where the steps were SMETANA commands, and swapped around as you tried to climb them 15:12:31 (but you could go up or down, making it into a puzzle) 15:13:47 ais523: regex-with-backreferences is CFL, isn't it? 15:14:31 "ais523 suddenly realises that (= and =) as operators would not be ambiguous in a C-like language" => the latter would be ambiguous in C++, where you can write (mytype::operator=) as an expression 15:14:40 cpressey: no, it's more powerful; it can solve a^n x a^n x a^n which a CFL can't 15:15:34 this feels morally equivalent to a^n b^n c^n, but regex-with-backreferences can't solve that due to the weird nature of backreferences 15:15:39 cpressey: I'm really playing with https://esolangs.org/wiki/SMETANA_To_Infinity! but I was wondering about the precise differences between that an your original :) (It turns out that the original is case sensitive, really insists on the order of statements, but is less space sensitive than S2I.) 15:16:20 "makes a guess about what order to run the commands in / basically by knowing what the computational complexity" => there are libraries where if you multiply more than two matrices, then it looks at their sizes, and multiplies them in a way that it's (hopefully) the fastest. something similar happens in SQL with complex statements, especially joins 15:16:20 . 15:16:33 hmm, mini-opinion poll: if a language is generally whitespace-sensitive and has semantically meaningful newlines, should it insist on its input file ending with a newline? 15:16:59 codegolf.stackexchange.com persuaded me to allow omission of the final newline in BuzzFizz, but I'm not sure that's correct 15:18:23 This is non-technical, but I hate it when cat-ing a text file messes up my next prompt, so I like final newlines. 15:18:25 that said, "text files must end with a newline" is an archaic rule that very few people seem to care about nowadays 15:18:35 (Yes I could use a different prompt, but that's besides the point.) 15:18:42 ais523: do you want to handle including a file into another file, or processing more than one input file (eg. given as multiple command-line arguments)? 15:19:05 fwiw, I think shells should add a new newline if the prompt wouldn't start at column 1, but you can't do that by configuring a typical shell, you'd have to patch it 15:19:29 wob_jonas: not in the case of BuzzFizz, it's a fairly constrained esolang; but I guess I'm also interested in a more general answer 15:19:37 #include normally has a newline after it anyway, though 15:19:40 if you are handling only one file, then definitely don't insist on it ending on a newline. if you handle multiple, then it's probably best to not require it, and consider file boundaries as boundary of line too, but I'm less certain and may depend on the syntax 15:20:02 Page feed is underrated, that's all I'll say 15:20:17 "should add a new newline if the prompt wouldn't start at column 1" => you sure can, you just have to put the right thing into PS1 15:20:23 cpressey: you mean formfeed? or is this a new control character I'm unaware of? 15:20:53 I'm still disappointed that people don't use nextlines as their newline character, but I can see why that happened (in most encodings, a nextline is two bytes long, which is a major drawback) 15:20:53 ais523: in practice it's probably least controversial to just treat the end-of-file as a newline unless immediately preceded by a newline. 15:21:08 #include normally has a newline after it anyway, though => the C syntax does, sure, but the TeX \includefile is weirder 15:21:19 wob_jonas: I can't think of a terminal control code that would have that effect non-interactively 15:21:25 on control characters: one time I was enamored by US, RS, GS and FS (an alternative to CSV) 15:22:07 or hmm… what about a cursor-right of the terminal width - 1, then outputting a space, then a goto-start-of-line? depending on how wrapping worked in the terminal, that might work 15:22:18 even then you need to know the terminal width to do it, though 15:22:39 arseniiv: I can see RS and FS as a CSV alternative 15:22:45 what do the other two do, though?# 15:23:04 ais523: uh, "\b\r\n" sort of, but I'm not sure it works in the first line 15:23:35 more robust would be printing as many spaces as the width of the terminal, then a "\r", but you need to know the width of the terminal for that 15:23:36 \b\r\n is equivalent to \r\n on just about everything, I think 15:24:00 just tested gnome-terminal 15:24:02 ais523: hmm, I don't remember how that worked 15:24:37 ais523: yeah, cursor-right with an arg count might work better 15:24:42 ais523: if I named them correctly, US (unit separator) should be the tightest one and FS (file separator) the least binding one; RS is record separator and GS is group separator, I thought it meant groups of records, let me look up a link… 15:24:42 no wait 15:24:46 'as many spaces as the width of the terminal, then a "\r"' does work, just tested that 15:24:47 I dunno 15:25:11 arseniiv: oh, file separator not f ield separator 15:25:15 so US and RS, then 15:25:33 arseniiv: \x1F is for the biggest blocks, \x1C is for the smallest blocks, in sequence for the two between, forget their names 15:25:40 I'm upset at people not caring about the C1 control codes 15:25:59 there's a Unicode encoding, UTF-1, that's designed to allow them all to be given literally 15:26:03 * cpressey nods gravely 15:26:05 but it's not very popular 15:26:17 ais523: wob_jonas: found it: https://en.wikipedia.org/wiki/Delimiter#ASCII_delimited_text thought wob_jonas has said it already 15:26:49 NO 15:26:55 arseniiv: no, I got them backwards 15:26:56 I'm stupid 15:27:03 it's backwards from how it should be 15:27:14 \x1C is for the largest blocks and \x1F for the smallest 15:27:25 that always annoys me so I should have remembered 15:27:30 sorry 15:27:31 I was mixing them up once I think too 15:27:57 wob_jonas: it suddenly struck me that Perl's $; is logically a unit separator character, but it's actually file separator that's used as the default value 15:28:07 I guess that makes clashes less likely, but it's also less semantically correct 15:28:37 hmm 15:29:40 also you may laugh but I once thought that UTF-1 (by some dark magic) is a 1-bit encoding 15:30:57 that doesn't seem particularly implausible? 15:31:04 UTF-8, UTF-16, UTF-32 and UTF-7 all contributed to this, yeah 15:31:20 though I think I hadn’t known the last one then 15:31:23 you'd just find some arbitrary-width numeric encoding (e.g. Fibonacci encoding), use it to encode all the codepoints, and concatenate 15:31:46 there's also a UTF-5 15:32:06 (also a UTF-6 but, confusingly, it's a 5-bit encoding) 15:32:25 and UTF-9 which was an April Fools RFC 15:33:00 The use of UTF-32 under quoted-printable is highly impractical 15:34:15 huh, UTF-1 is actually more efficient in space usage than UTF-8 up to and including U+38E2D 15:34:19 UTF-5 and UTF-6? I hadn't heared of those 15:34:44 basically because it doesn't limit continuation bytes to a particular range, they can be ASCII or extra start bytes 15:35:27 err, printable ASCII 15:36:24 control codes, both C0 and C1, are encoded as unambiguously as possible because UTF-1 was intended for use with decoders that used control code sequences to switch between encodings and/or as metadata for themselves 15:36:25 e.g. terminals 15:37:25 * ais523 suddenly realises that literally encoded C1 control codes are never prefixes of valid UTF-8 codes, so you could in theory write a terminal that supported them in all locations except mid-UTF-8-character 15:37:36 ais523: which one is the standard (perhaps ECMA) that gives the full general grammar for terminal-style escape codes? I know some of the basics, but not the full grammar for it 15:37:51 Ecma-48 15:38:29 although it's confusing to read because it gives character codes in decimal-coded-hexadecimal 15:38:59 it refers to Ecma-35 for encoding handling, though, and Ecma-35 compatibility is why things like UTF-1 were invented 15:39:11 ais523: alternately make the terminal take utf-8 encoded C1 codes (when it's generally reading utf-8 input, obviously), which also works except in the middle of utf-8 characters 15:40:00 wob_jonas: I was planning to do that anyway 15:40:09 but it's not particularly useful because C1 codes can be encoded using C0 codes 15:40:18 (for the benefit of 7-bit terminals) 15:40:23 and that only makes them a byte longer 15:40:39 this is the technique that's almost universally used nowadays to send C1 codes to terminals, as it's no longer than the UTF-8 encoding would be 15:40:52 sure 15:42:16 it's why ESC [ is so common in terminal control codes used practically, because ESC [ is the C0 encoding of the C1 control code CSI 15:42:49 yeah 15:46:59 ooh, I /finally/ understand the distinction between presentation and data cursor movement commands 15:47:08 it's to do with right-to-left languages 15:47:23 the presentation cursor movement commands move, e.g., "left" or "right" 15:47:37 the data cursor movement commands move, e.g., "forwards" or "backwards" through the text 15:47:49 so the correspondence between them is different when over LTR text and when over RTL text 15:48:52 -!- ais523 has quit (Quit: sorry for my connection). 15:49:05 -!- ais523 has joined. 15:52:29 ok, chapter 5.4 in ECMA 48 is relevant. 15:54:03 oh god 15:54:06 it's control codes hour 15:54:11 any good esolangs based on ECMA-48? 15:54:39 arguably Ecma-48 /is/ an esolang 15:54:44 apart from that, probably not 15:55:33 kmc: keyboard codes that the terminals emit for various combinations of settings and keys and modifiers 15:56:19 kmc: do you know why, in vim, if you press escape to exit insert mode then press O to open a new line in insert mode, it doesn't immediately react? 15:56:44 the combination works, but only updates the screen at the next keypress 15:57:06 this puzzled me for a while 15:57:17 afk for an horu 15:57:21 -!- wob_jonas has quit (Remote host closed the connection). 15:59:35 because keys like the arrow keys that don't correspond to ASCII often send control codes starting with ESC O, and vim is trying to disambiguate 15:59:51 libuncursed does the same thing, but with a timeout, and the timeout is very short nowadays so it's hard to notice 16:00:55 yeah 16:01:12 this is also why you can get control code junk in your irssi session if you're using mosh and it reconnects after a long drop 16:01:21 mosh will dump a bunch of control codes at irssi all at once 16:01:40 and irssi paste detection will interpret that as a literal paste 16:01:47 why it thinks i want to paste control characters, I do not know 16:02:01 maybe mosh should have an option to slow it dow 16:02:01 n 16:02:32 oh 16:02:54 (I believe this is occasionally happening with plain ssh as well) 16:03:13 on laggy connections (yes those still exist) 16:03:46 ugh, the "this is a paste" control code should have been standardised so that paste detection doesn't have to be done based on timing 16:03:57 int-e: I know, I use one 16:30:24 -!- cpressey has quit (Quit: A la prochaine.). 16:30:52 -!- tromp has joined. 16:41:13 -!- tromp has quit (Remote host closed the connection). 16:45:05 -!- tromp has joined. 16:55:00 -!- FreeFull has joined. 17:06:33 -!- tromp has quit (Remote host closed the connection). 17:14:06 -!- tromp has joined. 17:23:12 Oh, is _that_ why that happens 17:23:48 Ugh, the terminal interface sucks. 17:32:18 One big scow about mosh is how I can press some keys while not connected to the network and it buffers them forever. 17:32:29 And there's no ay to clear the buffer. 17:33:32 pikhq: yeah that's terrible 17:33:37 shachaf: yeah 17:33:54 terminals are one of those "why have we still not come up with a better way to do this" things 17:34:02 but I guess the benefits are not worth the legacy breakage 17:34:10 Terminal software is scow in the first place. 17:34:16 GUIs are TG (in theory) 17:34:17 after all, things mostly work now. it's not cutting edge 17:34:24 shachaf: I believe in text for input, GUI for output 17:34:28 in most cases 17:34:34 or hybrid 17:34:50 Well, you were talking about irssi 17:35:12 It's just ridiculous that the idea of pasting text with a newline that somehow turns into sending a message is even a thing that has to be worked around. 17:35:33 in-band signaling is certainly scow 17:35:48 yeah 17:38:16 Of course GUI software has its own issues. 17:39:49 everything is bad 17:40:51 <\oren\> I mean you could make a IRC program where you press ctrl-S to send or somehting 17:42:33 What about an IRC program where you press enter to send but when you paste text containing a newline character it doesn't trigger that? 17:42:55 Oh, another thing about terminal programs is that there are a bunch of keys you just can't detect correct. 17:43:08 <\oren\> That might be possible 17:43:23 <\oren\> On most systems in raw mode, enter is \r 17:43:52 <\oren\> so assuming pasted newline is \n 17:44:03 <\oren\> you could distinguish them 17:44:55 And if your text contains \r? 17:45:27 These are workarounds for a thing that shouldn't even need workingaround. 17:45:29 <\oren\> then you're fucked. there's no out of band signals in ssh afaict 17:46:03 <\oren\> direct keyboard acess remotely is a bad idea anyway IMO 17:46:42 -!- tromp has quit (Remote host closed the connection). 17:49:47 `ysaclist 17:49:47 ysaclist: boily shachaf 17:55:55 -!- tromp has joined. 17:59:07 -!- b_jonas has joined. 17:59:42 Ugh, the terminal interface sucks. ← it has precisely one problem, which is that the Esc key sends the Esc character code, which is a prefix of some other character codes 17:59:54 no, there are a lot of other problems with terminals 18:00:16 termios is a whole mess 18:00:17 this wouldn't be a problem if people expected to use Esc as a way of typing terminal control code sequences, but people normally think of it as a key on its own, thus an ambiguity 18:00:30 and there's ISO-2022 locking control codes, which are terrible 18:00:49 "the "this is a paste" control code should have been standardised" => it is. there are at least two different such codes standardized. 18:00:58 the great thing about standards 18:01:02 oh, I guess being able to /type/ XON/XOFF is a problem too 18:01:42 \oren\: there are plenty of signals that are /meant/ to be out of band, the issue is that you can type them anyway 18:03:39 ais523: anyway, I knew about the \eO thing, the vim behavior puzzled me because all I noticed is that sometimes the O command behaves like that, and didn't notice that it's when the previous keypress was \e 18:04:28 come to think of it, perhaps the underlying issue is UNIX's conflation of text and binary files 18:04:52 C0 and C1 codes in text files are supposed to have a specific, standardised meaning (and in theory, the text file should contain specific byte sequences to identify itself as using them) 18:05:10 whereas in a binary file, bytes with bits 5, 6, and 7 clear could mean anything 18:05:34 no! I like all those things. and I like that control-M and enter type the same thing and I don't have to teach each terminal program individually that they are the same, and if I didn't like it, then I'd chnage the bindings of the terminal 18:06:06 and I like being able to use the same programs for all sorts of files 18:07:00 kmc: Are you still using Microsoft® Windows®? 18:07:50 I reinstalled Windows 7 this week. 18:08:19 (Hmm, is that a smart thing to say on a publicly logged channel...) 18:09:21 int-e: not particularly dumb, the windows-specific malware can tell it directly anyway, it needn't look on irc for that info 18:09:25 "If Windows 10 has taught us one thing, it is that we hate updates." 18:10:03 shachaf: yes 18:10:08 ™ 18:10:35 The real reason is that it's the last cloud-free Windows. And it's just for games. 18:13:26 -!- tromp has quit (Remote host closed the connection). 18:22:06 -!- tromp has joined. 18:30:46 I boot to Windows once every few months which means does a trillion updates each time. 18:30:51 -!- Hooloovo0 has quit (Remote host closed the connection). 18:31:10 I don't really understand why it takes so long to update. 18:38:49 -!- Hooloovo0 has joined. 18:53:38 shachaf: IIRC at least some versions of the Windows update algorithm are not O(n) 18:53:44 but Microsoft didn't notice for ages because the constant factor was small 18:54:11 -!- ais523 has quit (Quit: quit). 19:19:45 -!- tromp has quit (Remote host closed the connection). 19:25:39 [ 4^6 19:25:40 b_jonas: 4096 19:48:06 On ifMUD there is a @paste command in case you are making a multi line paste. (Another alternative would be to use other software with xclip to add a prefix to each line.) 19:49:49 (However, there is then @endpaste and @quit both of which override the paste mode.) 19:50:11 . 19:51:49 . 19:52:45 -!- tromp has joined. 19:55:25 whats up 19:57:29 -!- tromp has quit (Ping timeout: 252 seconds). 20:01:00 -!- tromp has joined. 20:01:32 "it has precisely one problem, which is that the Esc key sends the Esc character code, which is a prefix of some other character codes" I also think that is what is sometimes the problem, and would not be the problem if people expected to use Esc as a way of typing terminal control code sequences. 20:01:59 but nobody ever would do that 20:02:15 (One thing to do would be for escape to have a longer code when application keyboard mode is enabled.) 20:03:25 The problem is the meaning of [ in Vim, I think. 20:04:12 kmc: zzo38 would! 20:04:28 yes 20:04:33 "but nobody ever would do that" is on the list of famous last words. 20:05:23 true 20:05:59 If you're proposing alternate designs for terminal interaction you've already lost. 20:06:26 The main reason to use terminals that work the way they do is compatibility with 1970. 20:06:32 I think it is fine how the escape works; rather, some programs try to do it something else, that is a problem. 20:08:21 The command [D list all defines, but instead if it could mean, move cursor left and reenter previous mode (if escape is pushed in command mode then it will set command mode as the previous mode and remain in command mode), then maybe it will work. 20:24:51 zzo38: I don't think so. IMO for vi, the main problem is what the escape key does in insert mode. I generally use control-C to exit insert mode, which is not quite equivalent but mostly is. you could have control-C be completely equivalent (and some other key do what control-C does now) and not use escape at all. 20:25:01 then escape would be used only to introduce control sequences. 20:26:59 Yes, that would be another way to fix it. 20:29:11 -!- Lord_of_Life_ has joined. 20:32:04 -!- Lord_of_Life has quit (Ping timeout: 248 seconds). 20:32:10 -!- Lord_of_Life_ has changed nick to Lord_of_Life. 20:36:00 Guess what, I just pasted a command into my shell and it had a newline at the end so it got run! 20:36:20 That was certainly my intended behavior, and not a misfeature or bad UI. 20:41:58 -!- arseniiv has quit (Ping timeout: 272 seconds). 20:43:26 Man, I tried to compile a Rust program and it downloaded over 100 dependencies. 20:49:17 Also the directory size is 1.8G 20:53:39 I've been writing Go for fun lately. It's got modules now. 20:54:00 Godules. 21:02:32 -!- tromp has quit (Remote host closed the connection). 21:02:42 Oh man, I said "orientation" instead of "direction". 21:02:50 v. embarrassing 21:04:30 -!- atslash has quit (Quit: This computer has gone to sleep). 21:13:03 -!- ais523 has joined. 21:27:51 I think I have a SMETANA to Infinity! pre-quine... (pre-quine = program that generates a quine as its output) 21:28:48 So all quines are pre-quines? Why are pre-quines interesting? 21:29:02 int-e: scary 21:29:03 Because you can be somewhat sloppy in generating them. 21:29:27 smetana to infinity sounds like a hard language to make a quine in 21:29:40 shachaf: In this case, the final quine will have 5-digit labels (so starting from 00001) but the pre-quine doesn't, it starts at 1. 21:29:43 I mean there probably exists a quine, but to actually construct one is hard 21:30:45 int-e: about how long is it? 21:31:04 Did you ever play Zork: Grand Inquisitor? 21:31:21 b_jonas: 1.3MB for the pre-quine... it's still computing the final one. It's... slow. 21:31:53 b_jonas: There's lots of room for improvement. 21:31:56 sure 21:32:11 tell us when you've verified it (by running twice and comparing) 21:34:02 -!- tromp has joined. 21:34:33 b_jonas: I wonder if anyone ever managed to say a fungot quine 21:34:34 b_jonas: hello ski :) ( actually i don't think you could like rephrase it? do you normally see? 21:34:52 one that doesn't use hat commands that is 21:35:01 ^help 21:35:02 ^ ; ^def ; ^show [command]; lang=bf/ul, code=text/str:N; ^str 0-9 get/set/add [text]; ^style [style]; ^bool 21:35:31 because it would be easier to write one with ^ul 21:36:31 https://esolangs.org/wiki/Underload#Quine lists some quines that give a starting point 21:36:40 slow: It'll execute 2,460,020,224 swaps to process 35072 bits of data (twice). 21:37:30 Judging by the progress so far it'll take an hour or two, and then about the same time again to verify. Fun! 21:38:46 -!- tromp has quit (Ping timeout: 276 seconds). 21:45:34 Underload is normally my goto language for botquines, if they support it 21:45:35 -!- xkapastel has quit (Quit: Connection closed for inactivity). 21:45:44 ^ul ((^ul )SaS(:^)S):^ 21:45:44 ^ul ((^ul )SaS(:^)S):^ 21:45:59 because it's really easy to write quines in it 21:57:04 -!- ais523 has quit (Ping timeout: 244 seconds). 21:59:44 fungot: Please repeat this sentence, including the prefix "fungot:". 21:59:45 fizzie: you could look into chicken. csc gets a lot randomer soon. away for a while google had a paper on an experimental sun pipeline i was looking fro a short cut. 21:59:47 Aw. 22:00:52 fizzie: Please repeat this sentence, including the prefix "fizzie:". 22:01:12 fizzie: Please repeat this sentence, including the prefix "fizzie:". 22:01:29 fizzie: Please repeat this sentence, including the prefix "fizzie:". 22:04:43 -!- AnotherTest has quit (Ping timeout: 252 seconds). 22:24:00 I suppose all quines would be pre-quines, but, not all pre-quines are quines. Is that it? 22:25:40 what's a pre-quine 22:26:53 zzo38: That's what I suppose also. 22:27:09 A pre-quine is apparently a program that outputs a quine. 22:28:22 i see 22:28:29 well then a quine is certainly a pre-quine 22:28:42 -!- tromp has joined. 22:28:45 and you can make a quine into a not-quine pre-quine by prepending a nop or something 22:28:49 so yes what zzo38 said is true 22:29:04 are there interesting things to be said about pre-quines? 22:29:46 I don't know. My guess is that it might depend on the programming language in use, but generally not. 22:32:57 -!- tromp has quit (Ping timeout: 252 seconds). 22:33:37 Are there interesting esolangs where you don't have the property that you can easily make a program longer/different with something like a nop? 22:35:30 I don't know. 23:07:57 b_jonas: 101 minutes. I think I'll use an alternate method of confirmation (namely, drop all those extra 0s that the quine generator put in and compare... which looks fine!) 23:09:11 http://int-e.eu/~bf3/tmp/quine.s2i :) 23:10:52 I have a good programming language. It's called md5sum. 23:10:56 You should write a quine in it. 23:11:44 > exp (-1) 23:11:46 0.36787944117144233 23:12:01 shachaf: a priory that's the chance that such a quine even exists. 23:16:28 shachaf: Oh for a fixed file name. If you can vary the file name the chances get better :) 23:16:46 I was just typing that. 23:16:48 -!- adu has quit (Quit: adu). 23:20:04 I thought by taking from standard input? 2019-08-24: 01:29:58 zzo38: we can't be sure that an md5sum quine exists for that particular case. 01:31:28 This is all theoretical anyway. 01:47:21 -!- Sgeo_ has quit (Read error: Connection reset by peer). 01:54:09 shachaf: Ah that was the chance that no such quine exists. Math is hard. 01:56:21 b_jonas: progress: wc quine.s2i --> 15577 123672 574944 quine.s2i (down from 36687 291488 1354436) 01:56:56 and it takes less than 20 minutes to run now too. :) 01:56:58 good night 02:01:16 -!- unlimiter has joined. 02:08:37 -!- Sgeo has joined. 02:12:55 [[Blackspace]] M https://esolangs.org/w/index.php?diff=65608&oldid=65581 * A * (+579) 02:20:12 -!- unlimiter has quit (Quit: WeeChat 2.5). 03:19:26 -!- adu has joined. 03:31:06 Now I wrote this instruction set document: https://arin.ga/3RKb8w 03:39:06 zzo38: what exactly is this arch for 03:40:14 Nothing; I just made it up because I thought to write something 03:42:34 :P 05:00:01 Do you have any other comments or just ":P"? 05:07:36 Nope, not really 05:11:08 OK 05:15:31 -!- adu has quit (Quit: adu). 05:37:59 -!- tromp has joined. 05:48:35 -!- tromp has quit (Remote host closed the connection). 06:14:35 [[Blackspace]] M https://esolangs.org/w/index.php?diff=65609&oldid=65608 * A * (+103) 06:19:34 [[Blackspace]] M https://esolangs.org/w/index.php?diff=65610&oldid=65609 * A * (+74) 06:21:38 [[Blackspace]] M https://esolangs.org/w/index.php?diff=65611&oldid=65610 * A * (-1) 06:27:32 -!- tromp has joined. 06:29:24 -!- tromp has quit (Remote host closed the connection). 06:29:38 -!- tromp has joined. 06:47:51 -!- tromp has quit (Remote host closed the connection). 06:51:33 -!- tromp has joined. 07:00:56 [[Blackspace]] https://esolangs.org/w/index.php?diff=65612&oldid=65611 * A * (+50) 07:01:51 -!- tromp has quit (Remote host closed the connection). 07:05:56 [[Blackspace]] M https://esolangs.org/w/index.php?diff=65613&oldid=65612 * A * (+72) 07:40:58 -!- tromp has joined. 07:45:43 -!- tromp has quit (Ping timeout: 250 seconds). 07:48:33 [[Blackspace]] M https://esolangs.org/w/index.php?diff=65614&oldid=65613 * A * (+19) 08:04:21 -!- AnotherTest has joined. 08:31:54 -!- Lord_of_Life has quit (Ping timeout: 268 seconds). 08:34:05 -!- Lord_of_Life has joined. 08:38:27 int-e: great 09:11:48 [[Blackspace]] https://esolangs.org/w/index.php?diff=65615&oldid=65614 * A * (+136) 09:18:04 [[Truth-machine]] M https://esolangs.org/w/index.php?diff=65616&oldid=65588 * Dtuser1337 * (+0) /* Emoji-gramming */ formatting variable just in case. 09:19:15 [[Blackspace]] M https://esolangs.org/w/index.php?diff=65617&oldid=65615 * A * (+181) 09:30:17 b_jonas: still working on that, 9520 lines now, and I have one significant idea left... 09:32:04 (getting below 10k is nice because it shortens the labels) 09:33:44 cool 09:36:03 (I'm really writing Haskell code, of course.) 09:36:46 I have a code generation monad and `mdo`s everywhere... 09:37:35 heh 09:40:27 http://paste.debian.net/1097189/ is the non-creative part, just the monad and pretty-printing, and support for strings. 09:44:00 mdo? Golly. 09:44:56 shachaf: it's great for dealing with forward references!@ 09:45:00 s/@// 09:45:34 mdo goto x; char 'z'; x <- lab <* char 'x'; return () 09:49:15 i,i { Label x = new_label(); goto(x); ...; set_label(x); ... } 09:50:27 yes that's probably what I'd do without lazy evaluation. 09:51:17 I wonder what a nicer way to express that without laziness is. 09:51:29 shachaf: note also that this is one of those use cases where performance really hardly matters. If I get my quine in a second I'm happy. 10:44:50 [[Blackspace]] M https://esolangs.org/w/index.php?diff=65618&oldid=65617 * A * (+42) 11:00:42 shachaf: write it as { x:; ...; come_from(x); ... } then there's no forward reference 11:19:17 Okay, I'm seriously reaching the point of diminishing returns. (Or the point of no return, who knows.) 11:20:17 So I'll stop here, at 8940 lines. 11:30:06 how fast does it run? 11:37:27 b_jonas: https://gist.github.com/int-e/57eefc6cce29ed47ddaaca13a0774533 11:37:37 it takes less than 6 minutes now 11:37:50 So still slow, but much better than where I started :) 11:38:10 user 5m45.328s 11:40:30 (a faster interpreter would help too) 11:41:01 > 100 / (36687/9130)^2 11:41:03 6.193229241204714 11:41:12 roughly quadratic :) 11:41:34 > 100 / (36687/8940)^2 11:41:36 5.938142812200899 11:58:49 b_jonas: I actually developed full boolean operations for SMETANA (representing booleans by pairs of operations... the second one is there so that they can be negated) but for the quine I got rid of most of that infrastructure. 12:36:10 [[SMETANA To Infinity!]] https://esolangs.org/w/index.php?diff=65619&oldid=64372 * Int-e * (+262) link to quine 12:58:38 [[User talk:Areallycoolusername]] https://esolangs.org/w/index.php?diff=65620&oldid=65602 * A * (-389) My brain went stupid. 13:04:52 -!- xkapastel has joined. 13:06:07 -!- tromp has joined. 13:10:23 -!- tromp has quit (Ping timeout: 252 seconds). 14:03:01 Can you recommend me a firefox plugin where I can set rules to rewrite urls when I follow a link, to load a different page instead? This is something that perhaps ais523 would like too, with his local copy of rust documentation. 14:03:42 I need it for the url of top-level pages only, not for frames/images/stylesheets 14:04:42 I use moz-rewrite, which can also rewrite request and response headers too 14:05:02 zzo38: thanks, I'll try that 14:32:28 -!- atslash has joined. 14:53:03 zzo38: is that a firefox add-on? my firefox browser doesn't seem to find it under that name 14:54:03 -!- tromp has joined. 14:58:37 -!- tromp has quit (Ping timeout: 250 seconds). 15:03:05 -!- unlimiter has joined. 15:06:42 It is Firefox add-on 15:28:07 -!- unlimiter has quit (Quit: WeeChat 2.5). 15:57:27 [[SMETANA]] https://esolangs.org/w/index.php?diff=65621&oldid=49752 * Int-e * (+34) /* Computational class */ SMETANA can iterate, putting it into the LBA class rather than mere decision trees. 16:06:04 -!- unlimiter has joined. 16:13:28 -!- unlimiter has quit (Quit: WeeChat 2.5). 16:25:57 [[Talk:SMETANA]] https://esolangs.org/w/index.php?diff=65622&oldid=8203 * Int-e * (+2388) Boolean-oriented programming in SMETANA 16:27:46 [[Talk:SMETANA]] M https://esolangs.org/w/index.php?diff=65623&oldid=65622 * Int-e * (-3) /* Basic Programming */ formatting (should have previewed) 16:28:09 Okay, I think I'm done with SMETANA / SMETANA To Infinity! 16:41:33 -!- tromp has joined. 16:43:05 -!- tromp_ has joined. 16:46:00 -!- tromp has quit (Ping timeout: 252 seconds). 16:47:27 -!- tromp_ has quit (Ping timeout: 252 seconds). 16:50:40 -!- Phantom_Hoover has joined. 17:25:00 -!- ais523 has joined. 17:25:48 Are there interesting esolangs where you don't have the property that you can easily make a program longer/different with something like a nop? ← languages like the I/D machine and cyclic tag, adding a byte anywhere normally implies restructuring the rest of the program to accommodate it (but there are fairly well-established techniques for doing so) 17:26:07 assuming you treat comments as either not permitted or not NOPs 17:28:35 ais523: isn't that only if you don't originally plan for that and don't put enough padding statements? 17:28:49 -!- tromp has joined. 17:29:48 b_jonas: in the case of the I/D machine there are only a few places you /can/ safely put padding 17:31:11 -!- arseniiv has joined. 17:32:43 hmm yeah, for the I/D machine that's tricky 17:35:00 -!- ais523 has quit (Ping timeout: 248 seconds). 17:36:12 I think the problem with JSON is that you can't put comments or trailing commas. It would also be good to allow unquoted keys (in addition to quoted keys), though. (There are also some types not available in JSON, such as integers (JavaScript now has it, with a "n" suffix to indicate a integer), and type annotations (the parser in use would have to know what to do with it, otherwise it is an error).) 17:39:06 Why would JSON support comments. It's not for human consumption! 17:39:35 -!- ais523 has joined. 17:41:26 It is useful if you want to write it manually, which sometimes would be. (A converter is possible, but that still doesn't support integers.) 17:47:20 -!- tromp has quit (Remote host closed the connection). 17:52:25 -!- callforjudgement has joined. 17:53:35 -!- ais523 has quit (Ping timeout: 258 seconds). 17:53:47 -!- tromp has joined. 17:55:53 -!- Phantom_Hoover has quit (Ping timeout: 245 seconds). 18:02:11 zzo38: sometimes you can put comments in fields that the reading program will ignore 18:02:19 -!- callforjudgement has quit (Ping timeout: 268 seconds). 18:04:03 not that I want to advertise JSON 18:04:42 it's another of those things like XML where it would never occur to me to use it on my own initiative. I've only parsed JSON when there was already another party up that produced it. 18:12:42 -!- Phantom_Hoover has joined. 18:35:47 -!- Sgeo_ has joined. 18:39:00 -!- Sgeo has quit (Ping timeout: 248 seconds). 18:48:54 int-e: Because the lack of concessions JSON makes to non-machine use are to blame for people using YAML? :) 18:49:09 eww that's even worse 18:49:13 -!- rain2 has quit (Ping timeout: 246 seconds). 18:49:14 ^ 18:50:14 .oO(am I allowed to say that? jevalbot uses a config file in YAML format. but I wrote that ages ago and I'm no longer maintaining it.) 18:50:44 Nah, I think you are. YAML is pretty miserable as a config file format. 18:50:49 I don't think I've had all that much exposure to YAML 18:50:52 And that's a major use of it. 18:51:11 int-e: It's one of those formats that initially looks simple, but has dragons within. 18:51:36 I've touched a travis.yml file, I suppose. It wasn't so bad to write. I don't want to know about parsing. 18:52:11 https://en.wikipedia.org/wiki/YAML#Advanced_components 18:52:47 pikhq: Yeah I was happier not knowing that. 18:52:48 pikhq: I don't see what else you'd want to use it other than as a config file format. it's basically designed for that, because you can write it in various forms so it's hard to read. 18:52:58 Anyway, I'm not sure that JSON is to blame specifically. 18:53:08 It would be possible maybe to use a subset of YAML, maybe 18:53:23 b_jonas: It's designed as a config file format, but it's also way too powerful as one. 18:53:24 I would more generally blame XML (which has been used as a configuration file format...) 18:54:33 Also, what is good for configuration format can also depend on the program being configured; sometimes is helpful to have more than one file. 18:54:54 luckily that's not too common. I can only recall one software that uses XML as a config file format: fontconfig. 18:55:03 But honestly I have not given much thought to configuration file formats. I guess I find the [section] key=value format simple and sufficient for many uses 18:55:17 JSON and INI are also used, and also a variant of INI without section headings, and also X resource manager format. 18:55:23 int-e: You'd probably like TOML 18:55:51 int-e: Do you mean INI format? 18:56:05 It's not the _easiest_, but it's reasonable enough. 18:56:15 pikhq: doesn't look too bad 18:58:19 I do see XML used for a lot of stuff that XML isn't so good for. 18:58:35 (For most things, XML is not good for, I think.) 18:59:23 IMO the main problem with INI is it's not especially well-specified as a format. 19:00:15 Of course, if it's suitable for your purposes there's nothing stopping you from just _saying_ exactly what your program thinks an "INI file" is. 19:01:11 ais523: The context I was wondering about that in originally was something like making the busy beaver function not monotonic. 19:07:47 zzo38: yeah I meant INI format 19:08:48 pikhq: agree about underspecification of INI. When someone needs arrays or hierarchical sections, there’s only lore, and no guarantee there are no conflicting traditions 19:11:32 so in the very basic cases it’s okay, but I’m glad TOML is getting some traction (I heard about it in Ceylon community some time ago, it was being implemented for something in one of its tools) 19:18:02 zzo38: for one thing, AFAIR XML is a giant of a format. Though I don’t know how it compares to something like YAML, by the way what do you people think about YAML? It should be a great deal to parse, maybe even harder than XML?,, 19:18:40 I don't know. 19:18:45 ah 19:19:20 XML is much less hard to parse if you don't expand entities (which most parsers do anyway to ignore security bugs) and ignore xml namespaces (which you can mostly do if you don't care about accepting some false positives with incorrect namespaces) 19:20:03 it was actually being talked about prior to my entrance 19:20:31 (ah and the previous one are about YAML) 19:22:26 -!- xkapastel has quit (Quit: Connection closed for inactivity). 19:22:49 There are many other format, and which one will be good can depend different thing. I think sometimes X resource manager format can be good 19:26:43 also one day I thought about an extended SGML-like format in which you can write something like this: 19:26:44 << if <[ cond ]> then <[ block1 ]> else <[ block2 ]> if >> where cond, block1 and block2 can be “tags” too and usual tag arguments can still be given too, though they can maybe now be obsoleted 19:30:24 I think I used other delimiters than << <[ ]> >> but can’t remember which ones exactly 19:31:00 that time they looked meaningfully sensible 19:31:58 also it can be simply then< b1 >else< b2 >if> but that would be hard to read 19:33:41 "that time they looked meaningfully sensible" => so did "((!!ifdef " when I made Olvashato. it does look rather stupid in retrospect. 19:36:22 on a complete tangent, sometimes I want to read “destiny” as “density” 19:43:08 i,i probability destiny function 19:47:31 . o O ( you're headed for a great destiny ) 19:48:48 arseniiv: it's not all that easy to come up with contexts where both words make sense :) 19:48:49 `perl -eopen$I,"<","share/dict/12dicts/Lemmatized/2+2+3frq.txt"or die; while(<$I>){ if(/^[^- ]/) { ($w) = m"^[(]*([\x27.\-/A-Za-z]+)[!*)]*$" or die "syn: $_"; ($a,$b)=$w=~/^(?=(.)).*(.)\.?$/ or die; $k=lc($a.$b.join("",sort $w=~/./g)); if(6<=length$w && $k{$k}) { print "$k{$k}:$w\n" } $k{$k}//=$w; } } # arseniiv: 19:48:50 expect:except \ conversation:conservation \ reserve:reverse \ aboard:abroad \ caller:cellar \ density:destiny \ bedroom:boredom \ casual:causal \ converse:conserve \ gateway:getaway \ median:maiden \ marital:martial \ preserve:perverse \ patrol:portal \ tribune:turbine \ barely:barley \ carving:craving \ eternity:entirety \ insect:incest \ mental:mantel \ parental:paternal \ parental:prenatal \ resource:recourse \ silver:sliver \ bowler:blower \ clobber:co 19:49:35 what's this, anagrams where first and last letter agree? 19:49:59 yes 19:50:04 and at least 6 letters long 19:50:41 `perl -eopen$I,"<","share/dict/12dicts/Lemmatized/2+2+3frq.txt"or die; while(<$I>){ if(/^[^- ]/) { ($w) = m"^[(]*([\x27.\-/A-Za-z]+)[!*)]*$" or die "syn: $_"; ($a,$b)=$w=~/^(?=(.)).*(.)\.?$/ or die; $k=lc($a.$b.join("",sort $w=~/./g)); if(length($w)<6 && $k{$k}) { print "$k{$k}:$w\n" } $k{$k}//=$w; } } # these are the shorter ones 19:50:42 there:three \ from:form \ board:broad \ trail:trial \ could:cloud \ bread:beard \ diary:dairy \ stake:skate \ crab:carb \ calm:clam \ carve:crave \ rogue:rouge \ stain:satin \ slate:stale \ wrap:warp \ bolt:blot \ barn:bran \ coral:carol \ crap:carp \ clot:colt \ grab:garb \ lion:loin \ panel:penal \ slit:silt \ smile:slime \ trap:tarp \ trot:tort \ unite:untie \ adobe:abode \ bulge:bugle \ crony:corny \ fart:frat \ forth:froth \ liar:lair \ prep:perp \ pl 19:51:22 b_jonas: oh a great food for thought 19:51:48 I’m glad I started a fruitful conservation 19:52:02 `perl -eopen$I,"<","share/dict/12dicts/Lemmatized/2+2+3frq.txt"or die; while(<$I>){ if(/^[^- ]/) { ($w) = m"^[(]*([\x27.\-/A-Za-z]+)[!*)]*$" or die "syn: $_"; ($a,$b)=$w=~/^(?=(.)).*(.)\.?$/ or die; $k=lc($a.$b.join("",sort $w=~/./g)); if(length($w)<6 && $k{$k} && 24<=%_c++) { print "$k{$k}:$w\n" } $k{$k}//=$w; } } 19:52:04 Can't modify hash dereference in postincrement (++) at -e line 1, near "%_c++" \ Execution of -e aborted due to compilation errors. 19:52:12 `perl -eopen$I,"<","share/dict/12dicts/Lemmatized/2+2+3frq.txt"or die; while(<$I>){ if(/^[^- ]/) { ($w) = m"^[(]*([\x27.\-/A-Za-z]+)[!*)]*$" or die "syn: $_"; ($a,$b)=$w=~/^(?=(.)).*(.)\.?$/ or die; $k=lc($a.$b.join("",sort $w=~/./g)); if(length($w)<6 && $k{$k} && 24<=$_c++) { print "$k{$k}:$w\n" } $k{$k}//=$w; } } 19:52:12 oh carp 19:52:13 smile:slime \ trap:tarp \ trot:tort \ unite:untie \ adobe:abode \ bulge:bugle \ crony:corny \ fart:frat \ forth:froth \ liar:lair \ prep:perp \ ploy:poly \ slide:sidle \ salt:slat \ spine:snipe \ cold:clod \ curd:crud \ flier:filer \ grid:gird \ gutsy:gusty \ slave:salve \ tenor:toner \ scrap:scarp \ today:toady \ brain:bairn \ meaty:matey \ stair:sitar \ bard:brad \ pasty:patsy \ sole:sloe 19:52:21 `perl -eopen$I,"<","share/dict/12dicts/Lemmatized/2+2+3frq.txt"or die; while(<$I>){ if(/^[^- ]/) { ($w) = m"^[(]*([\x27.\-/A-Za-z]+)[!*)]*$" or die "syn: $_"; ($a,$b)=$w=~/^(?=(.)).*(.)\.?$/ or die; $k=lc($a.$b.join("",sort $w=~/./g)); if(6<=length($w) && $k{$k} && 24<=$_c++) { print "$k{$k}:$w\n" } $k{$k}//=$w; } } 19:52:22 bowler:blower \ clobber:cobbler \ complaint:compliant \ cruelty:cutlery \ filtration:flirtation \ farmer:framer \ infarction:infraction \ relive:revile \ barely:bleary \ blotter:bottler \ binary:brainy \ brasserie:brassiere \ cavern:craven \ coroner:crooner \ crusty:curtsy \ lentil:lintel \ perfect:prefect \ reunite:retinue \ specter:scepter \ singer:signer \ stripe:sprite \ spotlight:stoplight \ unrelated:unaltered \ brocade:barcode \ grenade:grandee \ ga 19:56:35 hm by the way anybody knows of some interjection/imitation word dictionaries for English in text form? It’s hard for non-native (I think many here would understand) to use usual dictionaries to master them 19:57:00 [[Special:Log/newusers]] create * InfiniteDonuts * New user account 19:57:04 arseniiv: I think those are used in Japanese only 19:57:47 when I happen to describe a bunch of my recordings at Freesound.org, I often struggle to find good tags and write something useful in the description 19:58:06 b_jonas: why? how? 20:00:04 maybe something like Urban dictionary has them all and even more, but I’m still at a loss about a techique how to use it effectively so I don’t use it at all 20:00:51 [[Esolang:Introduce yourself]] https://esolangs.org/w/index.php?diff=65624&oldid=65597 * InfiniteDonuts * (+257) 20:01:51 (as it would at least need filtering, both of definitions and by “word alignment”) 20:01:54 InfiniteDonuts <- that's a lot of holes 20:03:05 [[User:InfiniteDonuts]] N https://esolangs.org/w/index.php?oldid=65625 * InfiniteDonuts * (+235) Created page with "Hi! I am InfiniteDonuts. I joined Esolang because one of my favorite things to code are strange, hilarious or difficult esoteric programming languages. I have so far created..." 20:03:32 hm donuts allow one to encode sufficiently complex structures to make an esolang? 20:04:32 having a donut inside of a donut, can one (un)wind the first around the hole of the second? 20:08:17 arseniiv: if you're very good at food sculpture, you could probably program Efghij by sculpting imitations of objects from donuts 20:08:46 :D 20:08:51 you'll have to bake the donuts unusually structurally stable though 20:09:57 b_jonas: or move into a low gravity environment 20:10:06 hmm 20:10:12 [[Flop]] N https://esolangs.org/w/index.php?oldid=65626 * InfiniteDonuts * (+223) Created page with "Flop is a 2-dimensional esoteric programming language created by ~~~~InfiniteDonuts. Flop is probably Turing-complete." 20:10:39 int-e: but then it becomes less enjoyable to eat the program 20:10:51 [[Flop]] https://esolangs.org/w/index.php?diff=65627&oldid=65626 * InfiniteDonuts * (-78) 20:10:53 what's the point of using donuts if you can't eat them in the end? 20:12:57 b_jonas: oh my goodness what a language 20:13:34 b_jonas: why, one can eat them in low gravity, why not? 20:13:35 [[Flop]] https://esolangs.org/w/index.php?diff=65628&oldid=65627 * InfiniteDonuts * (+234) 20:13:45 they aren’t liquid after all 20:13:59 arseniiv: you can, I'm not saying it's impossible, it just gets less convenient or less enjoyable 20:14:21 [[Flop]] https://esolangs.org/w/index.php?diff=65629&oldid=65628 * InfiniteDonuts * (+29) 20:16:13 though low gravity is cheating 20:17:19 it just gets less convenient or less enjoyable => maybe the first but why the second? what can be more enjoyable than free falling and eating a lot of structurally unstable donuts 20:17:23 :o 20:17:48 yum yum 20:18:03 though donuts are the devil as I had said a while ago 20:18:24 -!- atslash has quit (Quit: This computer has gone to sleep). 20:23:58 [[Special:Log/newusers]] create * Majestic53 * New user account 20:30:42 -!- Lord_of_Life_ has joined. 20:32:57 -!- Lord_of_Life has quit (Ping timeout: 245 seconds). 20:33:34 -!- Lord_of_Life_ has changed nick to Lord_of_Life. 20:34:47 [[Esolang:Introduce yourself]] https://esolangs.org/w/index.php?diff=65630&oldid=65624 * Majestic53 * (+247) 20:37:35 [[BytePusher]] https://esolangs.org/w/index.php?diff=65631&oldid=60981 * Majestic53 * (+106) 20:46:48 -!- Sgeo__ has joined. 20:49:38 -!- Sgeo_ has quit (Ping timeout: 245 seconds). 21:06:14 -!- arseniiv has quit (Ping timeout: 272 seconds). 21:20:10 -!- tromp has quit (Remote host closed the connection). 21:47:33 -!- tromp has joined. 21:54:22 -!- AnotherTest has quit (Ping timeout: 246 seconds). 22:00:58 -!- tromp has quit (Remote host closed the connection). 22:34:15 -!- tromp has joined. 22:35:16 donuts!! 22:35:20 I ate a chocolate donut today 22:35:28 as my wife said "nothing says I love you and care about you like a donut" 22:38:43 -!- tromp has quit (Ping timeout: 252 seconds). 22:42:04 -!- Sgeo has joined. 22:44:38 -!- Sgeo__ has quit (Ping timeout: 245 seconds). 23:03:08 -!- Sgeo_ has joined. 23:06:12 -!- Sgeo has quit (Ping timeout: 248 seconds). 23:15:18 -!- xkapastel has joined. 23:27:59 Currently, bystand can post each message to only one server. I intend I can add the possibility to post to multiple servers, in case you are posting to multiple newsgroups, some of which are not Usenet. However, it seems would be more difficult to keep track of it in case one posting is successful but posting to a different server failed. 23:29:12 -!- Phantom_Hoover has quit (Ping timeout: 245 seconds). 23:33:20 Do you have suggestions about this? 23:33:54 dunno if I mentioned yet, but the ICFP contest results are out 23:34:16 OK. Do you have the link of the details? 23:34:52 https://icfpcontest2019.github.io/ and https://icfpcontest2019.github.io/assets/icfpc19-report.pdf 2019-08-25: 00:08:01 -!- kolontaev has joined. 00:08:03 Hi all. What parser is easier to write from scratch: top-down parser (LL) or LR (like what Yacc generates)? 00:12:54 I have done both, but, I don't know. 00:13:20 LL recursive descent is probably the most straightforward. 00:13:48 Bjarne Stroustrup in his books writes LL parser for calculator, right? 00:14:07 He do so because it's simpler? 00:14:36 If your compiler doesn't do tail-call elimination, how should you write a recursive descent parser? 00:14:52 If you're writing it entirely by hand, it really is the obvious straight-forward approach to doing a parser. 00:15:24 Though with some downsides, e.g. you can only recurse as much as your stack will let you. 00:15:38 (this is particularly a problem if you don't have TCO) 00:15:55 How bad is it to manually write the state machine? 00:16:02 I feel like it could be pretty bad but maybe it doesn't have to be. 00:16:06 Depends on the language, honestly. 00:16:14 Generally kinda unpleasant though. 00:16:40 shachaf: is state machine to be implemented for both LL and LR parsers, for a simple calculator? 00:17:08 write a yacc grammar, use ayacc to compile it 00:17:29 or just write the parser by hand 00:17:32 it's a calculator 00:17:57 Oh, for a calculator? Yeah, a hand-rolled recursive descent parser isn't even that bad to write. 00:18:04 thanks! 00:18:05 And will honestly be perfectly sufficient. 00:18:25 You could also use other parser generators, such as Lemon, if you don't like yacc and ayacc 00:18:41 oh, I'm not that good yet 00:19:05 You're certainly not going to get that good by using yacc. 00:19:38 shachaf: what is wrong with it? Too old-school? 00:20:10 I mean, if you don't know how to do the thing by hand, and you want to know, you should learn how to do that first. 00:20:19 Even if you use a parser generator or something later. 00:20:53 shachaf: true 00:30:20 -!- Sgeo_ has quit (Ping timeout: 258 seconds). 00:33:21 -!- ais523 has joined. 00:33:47 kolontaev: IIRC LR parsers end up the same as the LL parser in cases where the grammar actually is LL 00:35:11 ais523: OK 00:35:38 um... what do you mean by "the same"? 00:35:58 b_jonas: well, the basic difference is that with LR, you don't have to decide what you're parsing immediately as long as you know what comes next 00:36:16 so you parse what's in front, then use that information to determine what the thing you just parsed was 00:36:23 right 00:36:38 but if the grammar is LL then there's only one possibility, so the LR parser can be optimised into the LL parser via constant folding 00:37:07 the state machine is different but if you're open-coding it as functions rather than using an interpreter, it comes to the same thing 00:37:18 what is "open-coding" 00:37:20 ? 00:37:55 ah 00:38:37 kolontaev: when you have a state machine but you just translate it into a higher-level language ignoring the fact that it's a state machine, you just write out what it does 00:38:46 rather than using some sort of state machine interpreter 00:38:54 ais523: I see, thanks 00:39:46 ayacc, my own implementation of yacc, generates open-coded output (or at least tries to) 00:40:24 ais523: is this any better than state-machine? 00:40:40 it's a different way of writing the same thing; I think it /can/ be better, but isn't always 00:41:26 ais523: maybe it can be good for architectures with expensive memory accesses... :) 00:42:23 well, I'd expect an open-coded parser to be more friendly to the branch predictor, but potentially to cause more pressure on L1 cache 00:42:53 ais523: L1-code cache? 00:43:05 yes 00:43:12 ais523: I see, thanks 00:43:29 ais523: none of which probably matters because the tree parser is almost never the bottleneck 00:44:36 b_jonas: isn't the lexer the normal bottleneck to a non-optimising compile of a low-level language? 00:44:43 purely because it has more data to deal with than any of the other parts of the compile 00:44:47 (also it has to read from disk) 00:45:24 ais523: reading and writing the disk may be the bottleneck, but that doesn't have much to do with the lexer and parser I think 00:45:38 I'm increasingly thinking it makes sense to combine the lexer and parser (after all, they're both state machines) 00:45:54 Lexer and parser? I just met 'er! 00:45:55 in which case, the technique used to implement the combined lexer/parser may well be very relevant 00:46:34 am I right I can implement lexer using yacc/EBNF forms? And to get rid of lexer? (Which would be weird, of course.) 00:46:39 I'd like a language with really good coroutine support that lets you implement state machines easily and clearly. 00:46:54 I don't think you can combine them. you get unbounded lookaheads if your input is the individual characters of an identifier. (or 255 tokens of lookahead if you limit your identifiers to 255 characters) 00:46:54 kolontaev: yacc requires a lexer of some sort, but it can be as simple as getchar() 00:47:16 ais523: yes, if lexer is just getchar(), I can do everything in yacc, right? 00:47:20 kolontaev: yes 00:47:56 b_jonas: only if you need to know what's beyond the identifier to disambiguate, otherwise you only need to look ahead the length of the longest keyword 00:48:23 % expr: product | product '+' expr { $$ = $1 + $3 } product: atom | product '*' atom { $$ = $1 * $3 } atom: '1' { $$ = 1 } | '(' expr ')' { $$ = $2 } 00:48:29 s/%/%\n/ 00:48:39 that's an example grammar I'm using to test out generated parsers 00:48:52 hmm 00:49:02 the code ayacc generates for it looks like this: http://nethack4.org/pastebin/example-ayacc-output.c 00:49:30 it actually contains the parser twice, once in debugging mode, once in non-debugging mode, because all the "are we in debugging mode?" checks really get in the way 00:49:57 so look at yype_start_expr onwards to see what an open-coded parser can look like 00:50:24 it should be possible to do better, all the faffing around with yyvalid is needed to comply with POSIX rules on lexer/parser interaction 00:50:40 but normally you don't care about those, so that code could all be optimised out 00:50:45 ais523: isn't close to how Bjarne Stroustrup his LL-calculator? 00:51:07 ais523: isn't close to how Bjarne Stroustrup makes his LL-calculator? 00:51:14 Do you have any good examples of "solving a problem by reducing it to a seemingly-harder more general problem"? 00:51:16 well, the generated code is pretty close to what a hand-coded LL-parser would look likee 00:51:22 ais523: aha, I see 00:51:39 shachaf: all the relatively powerful esolangs that we implement things like The Waterfall Model in to prove them TC 00:51:51 in that case, the more general problem probably /is/ harder, it just happens to have already been solved 00:52:30 shachaf: yes 00:52:42 ais523: Sure, but that's not the same. 00:53:37 shachaf: https://mathoverflow.net/a/92259/ 00:54:06 One good example is Buffon's needle problem. 00:55:47 oh yeah, some of those reductions to prove turing-completeness may count 00:58:31 -!- FreeFull has quit. 01:11:23 Buffon's noodle is too good. 01:12:25 what's that 01:12:44 Someone gave me another example: Can you cover a 2^n by 2^n chess board with one of the center squares removed with L-shaped tri-minoes? 01:13:16 kmc: http://blog.sigfpe.com/2009/10/buffons-needle-easy-way.html 01:16:58 shachaf: well, you obviously can for a 4×4 board 01:17:07 which bothers me a bit, that sort of question is normally only asked when the answer is "no" 01:17:54 you even more obviously can for 2×2 01:18:07 ais523: you can do it for a 8x8 too 01:18:15 and a 1x1 board too 01:19:14 1×1 doesn't really fit IMO, there will normally be 4 centre squares but a 1×1 board only has 1 centre square 01:19:22 so the operationn of removing one of the centre squares works differently 01:19:53 can you do it for a ½ by ½ board? my guess is no, regardless of what square you try to remove you'll be left with -¾ of a square, which isn't divisible by 3 01:20:31 Of course n is a natural number. 01:22:37 here's a nice inductive solution: you can solve a 2×2 board with one *corner* removed; if you can solve an n×n board with one corner removed, you can solve a 2n×2n board with one corner removed (via replicating the solution four times, three times with the missing corner in a centre and once with the missing corner in a corner, then placing the L-shaped piece in the centre) 01:23:05 then all you have to do is reverse one quadrant of the solutions generated this way to get the missing square in the centre rather than a corner 01:23:21 Yep, that's the solution I came up with. 01:23:28 so it's possible for all powers of 2 from 2¹×2¹ upwards 01:23:38 ais523: oh nice. that's not how I'd have done it, but it works 01:23:41 I don't see that solution as reducing the problem to a harder one, though 01:23:48 The "easier more general problem" is to solve a board with an arbitrary square removed, rather than one of the center squares. 01:24:03 the "missing corner" problem is easier because you can just induce directly, rather than needing to go via an intermediate step 01:24:53 once you can see how to do it with a missing corner, you can then see how to do it with any specific square missing, but I didn't think of that until you pointed out the "arbitrary square removed" version 01:26:33 The "arbitrary square" solution is the same as the missing corner solution. 01:26:45 yes, just the inductive hypothesis is different 01:26:54 Yep. 01:27:13 ooh 01:27:53 recursion on power of two sized squares suddenly reminds me of that math contest problem that I solved 01:30:22 more fun: if you can solve an a×a board and a b×b board, you can also solve an ab×ab board 01:30:37 (same proof, different inductive hypothesis) 01:30:46 darn it, that means I'm officially supposed to be good at this. but I'm not, I was just lucky with that one] 01:30:53 3×3 is not solvable but 5×5 is 01:31:00 so 10×10 must be 01:31:39 or, hmm, you can omit the centre square in 5×5 but you'd need to prove an arbitrary square is omissible 01:32:21 and I'm not sure the corners can be 01:32:22 [[Teg]] M https://esolangs.org/w/index.php?diff=65632&oldid=61553 * A * (-4) /* 99 bottles of beer */ 01:45:02 -!- xkapastel has quit (Quit: Connection closed for inactivity). 01:56:02 there's this style of precedence parser that's like an LL parser but with a precedence value passed around, 02:18:05 I found that the S4 and S3 signals on the 8086 processor are used to determine which segment register is in use. 02:19:27 signals? like external pins? 02:20:06 Yes. 02:54:55 zzo38: what pins? 02:55:29 zzo38: S0..S7? 02:55:53 kolontaev: Yes, although I mean specifically the S4 and S3 02:56:06 zzo38: ah, googled: http://ece-research.unm.edu/jimp/310/slides/8086_chipset.html 02:59:06 zzo38: heh, maybe you can connect different physical memory banks for each segment register... 02:59:37 zzo38: like 1Mb for each of 4 segment registers? 03:00:34 Yes, that is what I thought; I don't know if any computer is actually wired like that though 03:08:08 many retrocomputing geeks dwells here: http://www.classiccmp.org/cctalk.html they may know... 03:08:43 also #classiccmp 03:09:07 Hooloovo0: oh thanks 03:09:16 Hooloovo0: didn't know 03:09:37 old PC stuff is in #oldx86hardware but low level 8086 questions are probably more at home in classiccmp 03:10:13 I think they should do NNTP instead of a mailing list like that (or as an additional interface to the mailing list). 03:13:16 zzo38: NNTP is pretty old-school. And you need a client for it. While mail is still used by many people around. 03:17:45 Still, it would make it easier and more convenient to manage (both posting and reading), I think. 03:18:11 (Also, I wrote a new NNTP client software recently, and a bit less recently, also a NNTP server software.) 03:20:07 zzo38: it wasn't you who run gopher server couple of years ago?.. 03:21:42 I still have a gopher server. (Although some other people have set up a gopher server, too.) 03:21:56 zzo38: oh 03:38:21 -!- adu has joined. 04:09:50 [[User talk:A]] M https://esolangs.org/w/index.php?diff=65633&oldid=65606 * A * (+257) 04:10:10 [[User talk:A]] M https://esolangs.org/w/index.php?diff=65634&oldid=65633 * A * (+10) /* Golfed "Are there any mods here"? */ 04:25:59 -!- Sgeo has joined. 05:18:39 If you distribute Usenet archives or mailing list archives as mbox files, then please ensure that any lines with "From " at the beginning are properly quoted. Do so by: sed 's/^>*From />&/' 05:20:09 (I have downloaded one that does not do any such quoting. And, some email software also uses improper quoting, such as 's/^From />&/' instead of 's/^>*From />&/'.) 05:21:42 (Either that, or don't use mbox format.) 06:02:24 -!- kolontaev has quit (Quit: leaving). 07:25:22 -!- tromp has joined. 07:46:23 -!- rain1 has joined. 08:06:38 -!- AnotherTest has joined. 08:16:18 -!- ais523 has quit (Quit: quit). 08:33:30 -!- Lord_of_Life_ has joined. 08:34:17 -!- Lord_of_Life has quit (Ping timeout: 268 seconds). 08:36:23 -!- Lord_of_Life_ has changed nick to Lord_of_Life. 09:12:22 -!- atslash has joined. 09:16:57 -!- atslash has quit (Ping timeout: 244 seconds). 09:17:14 -!- atslash has joined. 09:28:29 -!- atslash has quit (Quit: Leaving). 09:30:46 -!- tromp has quit (Remote host closed the connection). 09:31:06 -!- atslash has joined. 09:34:38 -!- iczero has quit (Remote host closed the connection). 09:35:36 -!- iczero has joined. 09:44:59 -!- tromp has joined. 10:01:38 -!- tromp has quit (Remote host closed the connection). 10:02:24 -!- tromp has joined. 10:25:17 -!- shikhin has quit (Quit: Quittin'.). 10:26:30 -!- shikhin has joined. 11:07:15 -!- tromp has quit (Remote host closed the connection). 11:11:25 -!- tromp has joined. 11:11:52 -!- FreeFull has joined. 11:15:56 -!- kolontaev has joined. 11:21:51 ``` perl -ne '/^([a-z].*bit\b)/ and print "${1}coin\n"' share/dict/12dicts/Lemmatized/2+2+3cmn.txt 11:21:52 ambitcoin \ cohabitcoin \ debitcoin \ exhibitcoin \ gambitcoin \ habitcoin \ inhabitcoin \ inhibitcoin \ orbitcoin \ prohibitcoin \ rabbitcoin \ tidbitcoin \ two-bitcoin 11:30:20 -!- Phantom_Hoover has joined. 11:33:20 -!- arseniiv has joined. 11:43:39 -!- kolontaev has quit (Quit: leaving). 12:00:05 I'm going to hate these two weeks 12:23:28 [[User talk:A]] M https://esolangs.org/w/index.php?diff=65635&oldid=65634 * A * (+265) /* Golfed "Are there any mods here"? */ 12:30:45 -!- tromp has quit (Remote host closed the connection). 14:01:55 -!- xkapastel has joined. 14:19:02 -!- tromp has joined. 14:50:55 -!- tromp_ has joined. 14:53:58 -!- tromp has quit (Ping timeout: 276 seconds). 17:09:54 `? week 17:09:55 week? ¯\(°​_o)/¯ 17:12:09 . o O ( In America, the week starts on the seventh day. ) 17:14:50 no, more like two weeks 17:28:14 Week starts on the seventh day? 17:32:33 shachaf: in America only 17:34:18 I'm confusil. 17:34:31 Which day is that? 17:34:56 And in Gregorian chant, the scale starts on the fifth note. 17:39:22 shachaf: either Sunday or Saturday, depending on which numbering you take 17:42:42 But it sounds like int-e thinks that (a) the week starts on Monday and (b) people in America think the week starts on Sunday. 17:42:47 Both of which are false. 17:46:32 once I saw somewhere that week seems to start on Sunday somewhere that calendar was made for 17:47:08 in retrospect it would be not so consistent with the word weekend 17:48:00 it would then need to be something like weekborder or weekrim 17:48:58 weektip 17:50:22 hm it seems in at least both English and Russian “end”/“конец” mean not only a final point of something in time but also any furthest spatial points of something 17:51:00 The week certainly starts on Sunday. 17:51:11 so it could hypothetically be applied to the starting moment also. It should look very strange though 17:51:12 int-e should know that, as a German speaker. 17:51:34 In Hebrew, Sun-Fri are named "firstday", "secondday", etc. 17:51:54 And the weekend is Fri-Sat so it all works out. 17:51:56 also it would be strange to say something like “beginning” to designate furthest spatial points 17:52:26 a peculiar thing, I bet there is a linguistic theory to explain it 17:58:33 The Germanic days of week are the Germanic gods, except Saturday. But in some languages they use Lyeday instead, which is also Germanic. But, if you replace "Saturday" with "Lyeday" and then abbreviate Thursday by Thorn instead of T, then you can have different alphabets of the days of the week. 17:58:43 (with no duplicates) 17:59:31 [[Flop]] https://esolangs.org/w/index.php?diff=65636&oldid=65629 * InfiniteDonuts * (+1343) 18:01:47 I still vote for if you want to abbreviate the days of the week, call them W-1, W-2, W-3, W-4, W-5, W-6, W-7; and if you want to abbreviate months, call them 01, 02, 03, 04, 05, 06, 07, 08, 09, 10, 11, 12 18:02:36 and until we make those exclusive, I wish calendars show both the month number and the traditional month name, rather than just one of them, because it's the job of a calendar to track that, not mine 18:02:47 I still always get confused about what the name of month 08, 09, and 10 are 18:02:50 [[Flop]] https://esolangs.org/w/index.php?diff=65637&oldid=65636 * InfiniteDonuts * (+126) 18:02:55 I got the rest of them down more or less 18:02:58 `datei 18:02:59 2019-08-25 18:02:59.099879507 +0000 UTC August 25 Sunday 2019-W34-7 18:03:14 it's W-7 and month 08 today 18:04:42 [[Flop]] https://esolangs.org/w/index.php?diff=65638&oldid=65637 * InfiniteDonuts * (+3) 18:06:02 [[Flop]] https://esolangs.org/w/index.php?diff=65639&oldid=65638 * InfiniteDonuts * (+13) 18:06:21 I do often use numbers for the months, but not for day of week (which I use the three letter abbreviation). 18:07:57 [[Flop]] https://esolangs.org/w/index.php?diff=65640&oldid=65639 * InfiniteDonuts * (+73) 18:09:48 [[Flop]] https://esolangs.org/w/index.php?diff=65641&oldid=65640 * InfiniteDonuts * (+346) 18:10:50 [[Language list]] https://esolangs.org/w/index.php?diff=65642&oldid=65576 * InfiniteDonuts * (+11) Added Flop! 18:12:34 [[Hello world program in esoteric languages]] https://esolangs.org/w/index.php?diff=65643&oldid=65567 * InfiniteDonuts * (+318) 18:12:48 zzo38: But German for Wednesday is "Mittwoch" which I thought means "midweek". 18:12:59 b_jonas: I presume Hungarian month names aren’t Roman-induced? (Russian ones are, so it’s a blessing and maybe also a curse, though I was to slow-minded to point out an irregularity between october, november, december and 8, 9, 10 when I learnt their latin roots) 18:13:09 shachaf: it does 18:14:23 [[Flop]] https://esolangs.org/w/index.php?diff=65644&oldid=65641 * InfiniteDonuts * (+1) 18:14:51 [[Flop]] https://esolangs.org/w/index.php?diff=65645&oldid=65644 * InfiniteDonuts * (+0) 18:15:20 we start weeks at monday, nontheless 18:15:39 it's more like the middle of working week as middle of the actual week 18:16:24 i still prefer it over the american system where the week starts of mid weekend 18:16:26 shachaf: oh nice, there’s analogous среда in Russian. Contemporarily it doesn’t easily parse as середина “the middle”, that what it should have meant a time ago, though it’s not yet that opaque. Though in wordplay and other matters it’s more often conflated with среда “environment” 18:17:02 shachaf: Maybe in German it is; I don't know German. But, I didn't say in German, but in Germanic, which is differently. 18:19:09 There are also two Germanic names for Tuesday, and German uses the other one from English, it look like. 18:19:13 I know that in many Slavic languages which remained their traditional month names, they are in part incompatible between different languages, likely due to different climate, so leaves fall in one country at one month and in the other one at some other month 18:19:53 in german, there are two different words for saturday 18:20:53 the second and more unuusual one is roughly translated as sun-noon 18:21:12 Yes, I looked on Wikipedia, and neither of them seem to match either of the Germanic names. 18:29:08 Do you like x^2-2bx+c=0? 18:32:04 arseniiv: don't we already have that somewhere in the logs? in the Hungarian names for the d-o-w, Wednesday, Thursday and Friday are derived from the slavic names which in turn come from the numbering where Wednesday is number three, and Tuesday is numbered but not slavic but finno-ugric numeral. 18:32:20 I think this came up somewhere already, feel free to search the channel logs 18:32:33 shachaf: me personally maybe yes. In school when we were taught different formulae to solve quadratic equation I was angry for the case of even b, now I think it’s more natural one and other ones should be forgotten. Though that time it was taught not so coherent and maybe I was angry for a reason 18:33:04 b_jonas: ah 18:33:45 arseniiv: also https://www.tondering.dk/claus/cal/week.php 18:34:18 oh wait, you are asking about the Month names? 18:34:24 that's different 18:35:56 the month names of the gregorian calendar in Hungarian are more or less the same as the English and French ones, only spelled partly saner and partly less sane 18:36:28 (month 06 and 07 are the less sane part; 05 is the saner part) 18:36:33 b_jonas: hm for a split second I thought it was a page about weekdays in different languages and I remembered Janko Gorenc (I don’t know if he’s known here but almost every conlanger should know him as he makes himself known very actively, or was for some time, he’s collecting numerals, and even not as consistently as could then be used by anybody — no declension, no grammatical things at all, only 1…10 etc.) 18:37:04 oh wait, you are asking about the Month names? => yes 18:38:01 numerals? like https://www.omniglot.com/language/numbers/index.htm 18:38:53 b_jonas: I see, június and július. Here’s the same: июнь июль 18:39:34 but aside from those, the English and French ones are way worse in summary 18:39:38 there’s even a flat joke about an immigrant asking what’s the right one, июнь or июль 18:39:44 who calls a month "May"? 18:41:16 the french ones are typical french ambiguous short stuff: "mars, avril, mai, juin, juillet, août" 18:41:51 numerals? like https://www.omniglot.com/language/numbers/index.htm => hm, I hoped Simon wouldn’t make the same mistake 18:41:57 no wonder when they made the revolution calendar, they invented entirely new and long and nice-sounding names to compensate 18:42:34 English doesn't use Germanic days of month anymore either (although they did in Old English). 18:42:44 surely I maybe would be able to remember what 5 is in some language, but how should I construct 555? 18:43:14 arseniiv: the omniglot pages do include larger numbers (for many languages at least) 18:43:36 but obviously it's not a full reference 18:43:43 you can look up numbers in a dictionary if you want 18:43:51 omniglot isn't meant to be one 18:44:53 besides, numbers in Hungarian are easy, they only have six extra forms of declensions that ordinary nouns or adjectives don't have, and there's no fancy exceptional names for 11 or 12, it's all totally decimal except for that 10 and 20 have forms unrelated to 1 and 2 18:45:56 omniglot isn't meant to be one => I mean it would be nice to include a relevant grammar fragment if there are basic numerals already 18:46:46 they only have six extra forms of declensions that ordinary nouns or adjectives don't have => hm interesting 18:47:10 (how could it come to be?..) 18:48:00 ah maybe I misread what it should mean 18:48:09 that part is serious. "kilenc" is the base cardinal form, meaning nine, the other forms are "kilencedik", "kilenced", "kilencedike", "kilencszer", "kilencedszer", "kilencrét". there are more, but you get them from these forms by ordinary noun declension suffixes. 18:48:29 "kilencedik" is the ordinal, meaning ninth 18:48:38 ah maybe I got it as intended then 18:50:49 any noun declension will occur, because numerals can behave as ordinary adjectives, and adjectives can get declined as a noun as long as they're not used as a prefix epiteth of a noun phrase 18:52:17 Russian has inherited some mess about cardinal numerals but it is no extra cases, it’s just that some numerals decline as nouns, other decline as adjectives and there are some others also, and this is completely transparent to native speakers, it’s only partly strange when one starts to learn linguistics at large, not even at a school level 18:52:34 and since "kilencedik" and "kilenced" behave as nouns, they will occur in any noun declension too, plus "kilencedike" will occur in a few of them 18:53:25 and this is true for other numbers too, even apart from "kilenced" having a certain fixed noun meaning that is obsolete now, meaning a tax that commoners payed to their landlords or something like that 18:53:56 it was a ninth part? 18:54:41 yes, out of the remaining nine tenth after they payed one tenth as tithe to the church. or backwards, I can't follow which is which. 18:55:13 mhm 19:10:04 -!- adu has quit (Quit: adu). 19:11:04 -!- xkapastel has quit (Quit: Connection closed for inactivity). 19:31:20 oi 19:31:23 I detect Hungarian 19:32:08 as a side note, I love this channel so far 19:34:39 LBPHacker: just Hungarian? there were far more than it 19:34:56 arseniiv: yeah I'm reading the logs now 19:35:15 how can you not detect sweet cyrillic letters I carefully typed on my keyboard :P 19:35:24 but Hungarian is one word my eyes are *very* trained to spot 19:35:43 strange :) 19:55:29 you could use computers to spot words. they're good at it. 19:59:20 `words --hungarian 10 19:59:20 Unknown option: hungarian 19:59:22 Aw. 19:59:26 `words --finnish 10 19:59:27 arvomioksesi oikseni henkohattaan luulevanamme lähestyvyydyt pysyvemmistä komentuelliksemme ahdosta soletettävälimiin plastaskemiksempaili 20:00:20 fizzie: there used to be some wisdom entries with hungarian text, but I don't think any of them remained 20:00:26 I think I deleted all of them 20:29:14 b_jonas: why?.. 20:29:34 `5 w 20:29:36 1/1:lion//Lions are the catamorphisms of the animal world. They get eaten by poets in stone dens. \ lifthrasiir//lifthrasiir is shunned by the rest of his country for being no good at League of Legends. \ learning//Learning is disco, baby. \ ghoti//“Ghoti” is a very fishy spelling. \ at//At is a daemon for procrastinating commands. 20:29:45 though if that were me, I’d deleted my own too maybe 20:30:11 Hmm. 20:30:12 `5 20:30:17 1/2:206) who's walter bright and why is he so bright locks: he's to D what I'm to ooc locks: guilty \ 916) DIE oh hey elliott \ 1117) nowadays I tend not to have a physical form at all though Interesting.............??? \ 1095) `addquote \item `addquote two quotes about quotes about django I guess the worst part is that I appear in all three ha 20:30:19 `n 20:30:20 2/2:ckego quotes about django \\ elliott\_: another quote? you're not helping \texttt{:/} ← and three giraffes. \ 1142) Homeopathic encryption: add 9 parts NULs to 1 part of data, shake well into three directions, repeat the process 30 to 100 times. 20:32:13 -!- Lord_of_Life_ has joined. 20:34:12 -!- Lord_of_Life has quit (Ping timeout: 245 seconds). 20:35:06 -!- Lord_of_Life_ has changed nick to Lord_of_Life. 20:43:29 oh wait, one does remain: 20:43:34 `? b_jonas 20:43:35 b_jonas egy nagyon titokzatos személy. Hollétéről egyelőre nem ismertek. He is often too busy with appeasing the M:tG gods to make any sense. 20:43:51 that one does have hungarian words, and I wasn't even the one who created it 20:44:55 arseniiv: I created lots of silly wisdoms, then later deleted many of them 20:45:12 wisdom/b_jonas is probably the only one that contains hungarian words that I didn't create 20:47:19 hungarian words that I didn't create => I parse it that way now 20:48:03 it implies you created some Hungarian words, probably every other one :D 20:48:50 well, it's pretty likely that I created some Hungarian words, though probably not the ones in the wisdoms 20:49:02 and it may be just one wisdom, wisdom/ha 20:49:09 I thought there were a few other ones, but maybe no 21:02:32 -!- arseniiv has quit (Read error: Connection reset by peer). 21:03:00 -!- arseniiv has joined. 21:43:32 -!- tromp_ has quit (Remote host closed the connection). 21:45:28 -!- AnotherTest has quit (Ping timeout: 245 seconds). 21:59:14 -!- tromp has joined. 22:04:16 -!- tromp has quit (Ping timeout: 264 seconds). 23:12:09 -!- FreeFull has quit. 23:14:53 -!- atslash has quit (Quit: This computer has gone to sleep). 23:19:33 -!- b_jonas has quit (Quit: leaving). 23:26:23 -!- tromp has joined. 23:27:49 `? ha 23:27:50 ha? ¯\(°​_o)/¯ 23:30:42 -!- tromp has quit (Ping timeout: 252 seconds). 23:45:21 -!- MDude has joined. 23:58:21 -!- Phantom_Hoover has quit (Quit: Leaving). 2019-08-26: 00:36:20 -!- xkapastel has joined. 01:00:53 -!- arseniiv has quit (Ping timeout: 245 seconds). 01:06:36 -!- tromp has joined. 01:11:27 -!- tromp has quit (Ping timeout: 264 seconds). 01:39:00 "X-Clacks-Overhead is a non-standardised HTTP header..." I have seen it in NNTP too (when downloading a message from the aioe.org help desk newsgroup). 02:45:27 -!- xkapastel has quit (Quit: Connection closed for inactivity). 02:54:50 -!- tromp has joined. 02:59:13 -!- tromp has quit (Ping timeout: 250 seconds). 03:15:10 -!- diginet has joined. 03:57:49 I have a book of philosophy of mathematics and logic. In one chapter they mention set theory with intuitionistic logic and Uniformity Principle. 03:57:55 Do you know of that? 04:24:28 -!- MDude has quit (Ping timeout: 244 seconds). 04:43:23 -!- tromp has joined. 04:48:03 -!- tromp has quit (Ping timeout: 264 seconds). 04:52:21 -!- arseniiv has joined. 05:14:31 -!- MDude has joined. 05:41:54 Also they say that a set that is neither finite nor infinite is a "Dedekind set", but I cannot find that on Wikipedia. 05:45:48 What is Uniformity Principle? 05:47:10 Do you like identity-based encryption? 05:49:14 How is identity-based encryption working? 05:50:19 Uniformity Principle is defined as: Whenever an extensional binary relation R links every set of natural numbers X to some natural number n, there is some n that gets related to R by all such sets X. 05:50:50 forall X. exists n. R(X,n) -> exists n. forall X. R(X,n) 05:51:01 This is the description I heard: 05:51:04 (This is with intuitionistic logic, not classical logic.) 05:51:32 -!- sprocklem has quit (Read error: Connection reset by peer). 05:51:34 You can use any string as a public key and encrypt things with it, and a central authority can issue private keys that can be used to decrypt. 05:51:48 For example you could encrypt to a username. 05:53:30 I think it isn't so good probably 05:53:40 -!- arseniiv has quit (Ping timeout: 248 seconds). 05:54:35 I think it's pretty neat that it's possible. 06:02:03 Another thing you can do is "attribute-based encryption". 06:31:34 -!- tromp has joined. 06:34:21 -!- tromp has quit (Remote host closed the connection). 06:34:33 -!- tromp has joined. 06:39:34 [[ ]] https://esolangs.org/w/index.php?diff=65646&oldid=62052 * Dtuser1337 * (+18) Adding the year. 06:41:13 -!- sprocklem has joined. 06:45:30 [[Microscript]] M https://esolangs.org/w/index.php?diff=65647&oldid=45776 * Dtuser1337 * (-13) /* Commands */ seems like the tag dosent work when in
 tag.
06:46:05  This defines the set of truth values as pairing propositions p with {x:x=0 and p} to make a set of sets. In conventional mathematics this is {{},{0}}, but with the kind described in this book with intuitionistic and uniformity, such a set is neither finite nor infinite.
06:46:26 -!- tromp has quit (Remote host closed the connection).
06:47:25  It also has, that a set being nonempty is different from a set being inhabited.
06:47:32 -!- tromp has joined.
06:48:02  [[Jumper]]  https://esolangs.org/w/index.php?diff=65648&oldid=65161 * Dtuser1337 * (+18) Woosh
06:52:05  [[Jolf]]  https://esolangs.org/w/index.php?diff=65649&oldid=47253 * Dtuser1337 * (+18) Yare yare daze
06:52:16  zzo38: Is "inhabited" just stronger than nonempty because it names a specific inhabitant?
06:52:51  zzo38: Do you like this? https://home.sandiego.edu/~shulman/papers/lcm-bloomington-talk.pdf
06:52:56 -!- nfd9001 has joined.
06:54:43  shachaf: It is stronger because it is intuitionistic logic, where (exists x. not phi) does not follow logically from (not forall x. phi).
06:55:18  Right.
06:55:25  That's what I meant.
06:55:38  O, OK.
06:55:40  I think those slides make a pretty compelling case for using linear logic for this sort of thing.
07:03:50  hi
07:10:43  Does page ten have "n > n" but should it be "n > N"?
07:15:10  Yes.
07:15:43  how they doing
07:30:04 -!- AnotherTest has joined.
08:05:39 -!- wob_jonas has joined.
08:07:05  " You can use any string as a public key and encrypt things with it, and a central authority can issue private keys that can be used to decrypt." => sure. the central authority fixes an algorithm to generate a random private/public keypair with a reproducible random generator seeded with the super-secret key of the central authority plus t
08:07:06  he identity.  
08:07:36  there are only two problems: the central authority has to verify somehow who gets to own each identity, and the central authority has to make sure that the root key isn't stolen or lost.
08:17:59  wob_jonas: You can encrypt without asking the central authority.
08:18:10  The public key is just an arbitrary string.
08:18:16  shachaf: oh, that's harder
08:18:39  can you also decrypt without asking the central authority?
08:19:05  You get a decryption key from them.
08:19:39  do you just encrypt everything with the central authority's public key and they decrypt the messages (or their block cypher keys at least) for you?
08:20:11  No, you don't need to give them the message itself.
08:21:04  sure, you only need to give the encrypted block cypher key
08:21:16  that's shorter than the message usually
08:21:32  it's of a fixed size even if the message has a whole video
08:22:14  They give you a single decryption key that you can use to decrypt any message that was encrypted with your name by anyone.
08:22:20  but then, how do you keep the message secret, unless there's a second layer of encryption or something? send it by snail mail?
08:22:34  shachaf: now that sounds more impossible
08:27:03  https://en.wikipedia.org/wiki/ID-based_encryption talks about it apparently.
08:29:19 -!- atslash has joined.
08:34:40 -!- Lord_of_Life has quit (Ping timeout: 258 seconds).
08:36:27 -!- Lord_of_Life has joined.
09:12:51  so, um, dumb question but does https://esolangs.org/wiki/Flop qualify as a Brainfuck-like? 
09:14:30  it has a separate code and data memory, has a single head pointing into the data memory, can increment or decrement or zero-test the value under the data head but not much more
09:15:00  but has more general control flow than brainfuck
09:15:50  or maybe the data memory and code memory are supposed to be the same array, like in befunge
09:17:01  not easy to tell anything from the description because it has no interpreter and no nontrivial programs
11:09:09 -!- atslash has quit (Ping timeout: 258 seconds).
11:09:21 -!- atslash has joined.
11:19:08  https://www.youtube.com/channel/UCiyuYC0D4-AO0AonCfMifPQ has some nice classical music
11:29:59  Oh what a brilliant idea... let's display ads (in the console) when installing packages. How about running a crypto miner for half an hour before allowing your package to be installed?
11:32:37  wait, what?
11:33:35  if you make ads in terminal, i want at least some animation and mouse interaction
11:35:25  https://github.com/standard/standard/issues/1381 is the experiment in question
11:36:28  argh
11:36:39  The irony is that this really hilights a security problem.
11:37:03  display ads when installing packages => sure, installers for some commercial packages do that
11:37:16  Maybe I should open a ticket asking how much he wants for planting a backdoor.
11:37:16  int-e: npm already has so much of those, one more or less won't matter
11:37:30  running a crypto miner for half an hour => I wouldn't exclude it, the installer also takes half a day to complete
11:37:32  (That should be an attractive funding source!)
11:40:38  (The source also mentions https://github.com/kethinov/no-cli-ads ... which is the corresponding ad-blocker.)
11:40:51  (Let the games begin!)
11:43:12  Oh well. I received a U2F token in the mail and installation was almost painless (one configuration file for udev and things worked...)
11:47:36  forken would be an interesting dick move
11:50:01  is "forken" denglish?
11:50:57  sorry, to fork
11:51:08  anyway, forking is a way to relieve the pain of the maintainer, so it is a solution to the problem as stated. (Framed properly: "I'm tired of maintaining this software for free.")
11:52:28  not maintaining, just making an adless-standard fork that automatically merges standard overnight
13:20:03 -!- arseniiv has joined.
13:31:17 -!- xkapastel has joined.
13:59:41  [[Flop]]  https://esolangs.org/w/index.php?diff=65650&oldid=65645 * InfiniteDonuts * (+103) 
14:00:17  [[SNUSP]]  https://esolangs.org/w/index.php?diff=65651&oldid=53706 * InfiniteDonuts * (+39) 
14:01:12  [[PATH]]  https://esolangs.org/w/index.php?diff=65652&oldid=33608 * InfiniteDonuts * (+45) 
14:01:40  [[PATH]]  https://esolangs.org/w/index.php?diff=65653&oldid=65652 * InfiniteDonuts * (+9) 
14:02:42  [[User:InfiniteDonuts]]  https://esolangs.org/w/index.php?diff=65654&oldid=65625 * InfiniteDonuts * (-24) 
14:06:17 -!- Melvar has quit (Quit: WeeChat 2.4).
14:49:38 -!- atslash has quit (Ping timeout: 244 seconds).
14:50:21 -!- atslash has joined.
15:02:16  npm has some switches to control installation, you could perhaps use --ignore-scripts to skip the ads maybe
15:03:23  (I don't know if it works; I haven't tried it, but if the ads are loaded in that way then it might)
15:12:25  (And, it seems to be, as far as I can tell. It has a "funding" package as a dependency; the "funding" package executes itself as soon as it is installed.)
15:15:54  well that seems a bit pointless
15:16:20  (if you don't trust the author/maintainer with their installation script, why would you trust them with their other code?
15:17:28  Yes, that makes sense, although it is a simple way to skip the installation scripts for whatever reason (including, that you may wish to review the code before running the scripts, or add additional steps in between, or whatever else you might want).
15:32:27  I think Rogers system is better than Magnuson system.
15:34:26 -!- Melvar has joined.
15:35:23 -!- Sgeo has quit (Ping timeout: 268 seconds).
15:49:33  "Another common way of expressing the base is writing it as a decimal subscript after the number that is being represented (this notation is used in this article)." I have also seen the base spelled out in words as the subscript, but it can be long. Also I have seen some documents use a hexadecimal subscript (in the same document with decimal subscripts!).
15:49:45  So, I propose to use subscripts with roman numbers instead.
15:55:02  What do you think of this?
16:02:34  I would avoid roman numerals if at all possible
16:02:43  they're really hard to use for numbers >~10
16:05:10 -!- Phantom_Hoover has joined.
16:13:29  zzo38: in totally ambiguous scenarios, I’d propose writing the base in unary. Ironically, unary doesn’t belong to the family of numerations to which decimal or binary do
16:14:37  though it’s not enough, I’d write all the digits too maybe (and then unary is unnecessary), like 1001011_(01)
16:14:59  arseniiv: That is going to be even more long than using words, I think.
16:19:39   Also they say that a set that is neither finite nor infinite is a "Dedekind set", but I cannot find that on Wikipedia. => seems like a terminological confusion. There are several definitions of (in)finiteness of a set, varying in strength when no presuppositions like the axiom of choice are made. When the latter is present, though, Dedekind (in)finite is equivalent to “usual” (in)finite. This can be useful: https://en.wikipedia.org/wiki/Fin
16:19:39  ite_set#Other_concepts_of_finiteness
16:22:03  ah, this is in intuitionistic concept, then I don’t know how it relates
16:22:43   arseniiv: That is going to be even more long than using words, I think. => agree for ten, disagree for two :)
16:23:01  oh my link is broken
16:23:10  https://en.wikipedia.org/wiki/Finite_set#Other_concepts_of_finiteness
16:24:00  hopefully it still could be useful. They couldn’t name those sets Dedekind without any connection to Dedekind finiteness
16:26:09  Yes, it is shorter than words in case of two, but, often you will use larger numbers for the base. If it is roman numbers then is as much as unary in case of two
16:33:22 -!- FreeFull has joined.
16:37:00 -!- b_jonas has joined.
16:53:23  [[Flop]]  https://esolangs.org/w/index.php?diff=65655&oldid=65650 * B jonas * (+24) 
16:55:52  `olist 1177
16:55:53  olist 1177: shachaf oerjan Sgeo FireFly boily nortti b_jonas
17:49:38 -!- MDude has quit (Ping timeout: 245 seconds).
17:50:27 -!- MDude has joined.
18:12:19  [[Hello world program in esoteric languages]]  https://esolangs.org/w/index.php?diff=65656&oldid=65643 * InfiniteDonuts * (+86) 
18:17:39  [[Flop]]  https://esolangs.org/w/index.php?diff=65657&oldid=65655 * InfiniteDonuts * (+258) 
18:20:23  [[Flop]]  https://esolangs.org/w/index.php?diff=65658&oldid=65657 * InfiniteDonuts * (+147) 
18:21:23  [[Flop]]  https://esolangs.org/w/index.php?diff=65659&oldid=65658 * InfiniteDonuts * (+6) 
18:30:54  [[Flop]]  https://esolangs.org/w/index.php?diff=65660&oldid=65659 * InfiniteDonuts * (+164) 
18:32:43  [[Flop]]  https://esolangs.org/w/index.php?diff=65661&oldid=65660 * InfiniteDonuts * (+16) /* A Brief Tutorial */
18:33:58  [[Flop]]  https://esolangs.org/w/index.php?diff=65662&oldid=65661 * InfiniteDonuts * (-18) /* Sample Programs */
18:55:27 -!- nfd9001 has quit (Ping timeout: 245 seconds).
19:31:02 -!- xkapastel has quit (Quit: Connection closed for inactivity).
19:37:59 -!- ivzem[m] has joined.
20:11:11  [[Funge-98]]  https://esolangs.org/w/index.php?diff=65663&oldid=59451 * Quuxplusone * (+21) documentation of 'p' had the arguments in the wrong order
20:14:47  [[Funge-98]]  https://esolangs.org/w/index.php?diff=65664&oldid=65663 * Quuxplusone * (+36) /* Instructions */ fix description of % and / for clarity
20:21:20  [[Funge-98]]  https://esolangs.org/w/index.php?diff=65665&oldid=65664 * Quuxplusone * (+170) /* Instructions */ add "greater", and asciibetize the table
20:31:27 -!- Phantom__Hoover has joined.
20:32:45 -!- Phantom___Hoover has joined.
20:33:04 -!- Lord_of_Life_ has joined.
20:34:38 -!- Phantom_Hoover has quit (Ping timeout: 245 seconds).
20:35:28 -!- Lord_of_Life has quit (Ping timeout: 245 seconds).
20:35:48 -!- Phantom__Hoover has quit (Ping timeout: 244 seconds).
20:35:55 -!- Lord_of_Life_ has changed nick to Lord_of_Life.
20:47:19  [[Flop]]  https://esolangs.org/w/index.php?diff=65666&oldid=65662 * InfiniteDonuts * (-10) 
21:09:58  [[Befunge]]  https://esolangs.org/w/index.php?diff=65667&oldid=62225 * Quuxplusone * (-4692) Remove VB.NET code. Esolang isn't a source code repository for interpreters, afaik. Put that code on GitHub or something.
21:10:29 -!- omegasome has joined.
21:10:39 -!- omegasome has changed nick to hppavilion[1].
21:10:47  Hi, #esoteric. Haven't been here in a while.
21:10:58  I mainly connected because: It's my first day of college!
21:11:45  Also, I can't get to slashnet to join #xkcd and I don't know if irc.slashnet.org is down or if it's the uni's wifi or what
21:11:58  Hm, http://irc.slashnet.org:80/ works for me
21:14:16 -!- hppavilion[1] has quit (Client Quit).
21:14:38 -!- hppavilion[1] has joined.
21:18:51  hi hppavilion[1]! I was wondering if we lost you, you haven't been here for months
21:19:15 -!- hppavilion[2] has joined.
21:19:22  b_jonas: Longer, probably
21:19:37  You had for a while, but I think I'm gonna re-add this channel as an autojoin
21:19:46  might be about a year by now
21:20:59  Also, I just bound hexchat to my vpn () so slashnet works
21:21:42  You know what's sorta crazy that I realized early this morning?
21:22:01  If I were born a few decades ago, today would could the first time in my life I'd have internet access.
21:22:32 -!- hppavilion[1] has quit (Ping timeout: 245 seconds).
21:22:40  `? rogue one
21:22:41  Any regular who gives the slightest Rogue One spoiler shall be hunted down in real life and have their intestines removed through their eye sockets. Members would not be exempt if they existed, which they don't.
21:22:57  hppavilion[2]: ^ I wanted to ask if that's still true
21:23:04  Awwwww, you remembered!
21:23:05  we didn't dare remove it
21:23:05  Possibly
21:23:20  b_jonas: It isn't, but the spoiler rule DOES apply to other movies
21:23:48  I *may* have contemplated hiring a hitman on that NFL player who tweeted out an Endgame spoiler.
21:24:42 -!- Camto[m] has joined.
21:26:00  Does it apply to The Empire Strikes Back?
21:27:58  movies only? does it apply to tv series, webcomics, novels, short stories?
21:30:04 -!- AnotherTest has quit (Ping timeout: 272 seconds).
21:34:25 -!- nfd9001 has joined.
21:34:37 -!- atslash has quit (Ping timeout: 245 seconds).
21:37:40 -!- atslash has joined.
21:39:02  I think we should rearrange the wisdoms then if Rogue One isn't particularly the target
21:41:13  ``` set -e; slashlearn "spoiler//Don't give movie spoilers on channel. If you do, hppavilion may hire a hitman to hunt you down in real life and torture you in refined ways."; forget rogue one
21:41:16  rm: cannot remove 'wisdom/rogue': No such file or directory \ rm: cannot remove 'wisdom/one': No such file or directory \ Learned 'spoiler': Don't give movie spoilers on channel. If you do, hppavilion may hire a hitman to hunt you down in real life and torture you in refined ways.
21:41:22  ``` set -e; slashlearn "spoiler//Don't give movie spoilers on channel. If you do, hppavilion may hire a hitman to hunt you down in real life and torture you in refined ways."; forget "rogue one"
21:41:24  Relearned 'spoiler': Don't give movie spoilers on channel. If you do, hppavilion may hire a hitman to hunt you down in real life and torture you in refined ways.Forget what?
21:41:27  `? spoilers
21:41:28  Don't give movie spoilers on channel. If you do, hppavilion may hire a hitman to hunt you down in real life and torture you in refined ways.
21:41:32  `? rogue one
21:41:33  rogue one? ¯\(°​_o)/¯
21:41:41  `? hppavilion
21:41:42  hppavilion is the generator including, but not limited to, hppavilion[1], hppavilion[2], and hppavilion[42]. hppavilion is of length 37-42i-28j+4k-28ij+38ik+62jk+20ijk. A common alternative definition is the set of all items yielded by the general case of the generator. Not to be confused with hppavilion^k or hppavilion_m.
21:42:10  `? hppavilion1
21:42:12  `? hppavilion[1]
21:42:13  higgledy piggledy / hp pavilion / doesn't like jokes that are / written in text; // uncontroversially, / one in a million is / roughly the chance they won't / be left perplexed
21:42:14  hppavilion[1] se describe en las notas al pie. ¿Porqué no los dos? Nadie lo sabe. No es tan cluecless. Él aspira a ser más incomprensible que esta sabiduría.
21:42:41  Is that supposed to be a quaternion?
21:43:18  should we mention that he hates movie spoilers in one of those?
21:44:41  ``` perl -pi -e's"(jokes)"movie spoilers or $1"' wisdom/hppavilion1
21:46:09  No output.
21:47:02  What kind of higgledy piggledy is that?
21:47:06  `dowg hppavilion[1]
21:47:08  9631:2016-11-06  learn_append hppavilion[1] \xc3\x89l aspira a ser m\xc3\xa1s incomprensible que esta sabidur\xc3\xada. \ 8609:2016-06-26  learn_append hppavilion[1] No es tan cluecless. \ 6238:2015-11-23  undo 6237 \ 6237:2015-11-22  le/rn hppavilion[1]/HP pays $3.5m a year to name an arena in San Jose after him. \ 5917:2015-08-22  learn hppavilion[1] se describe en las notas al pie. \xc2\xbfPorqu\xc3\xa9
21:47:21  `dowg hppavilion1
21:47:23  11916:2019-08-26  `` perl -pi -e\'s"(jokes)"movie spoilers or $1"\' wisdom/hppavilion1 \ 5743:2015-06-25  revert \ 5742:2015-06-25  learn hppavilion1 is ZombieCheney \ 5607:2015-06-18  ` sed -i -e \'s/\\w\\+ \\w\\+ //\' -e \'s/leave them/be left/\' wisdom/hppavilion1 \ 5606:2015-06-18  learn hppavilion1 is higgledy piggledy / hp pavilion / doesn\'t like jokes that are / written in text; // 
21:47:52  . o O ( lol )
21:47:56  `? hppavilion1
21:47:57  higgledy piggledy / hp pavilion / doesn't like movie spoilers or jokes that are / written in text; // uncontroversially, / one in a million is / roughly the chance they won't / be left perplexed
21:48:03  Hello, shachaf!
21:48:11  Are you serious?
21:48:16  Yes!
21:48:22  What perfect rhythm.
21:49:38  shachaf: And re. ESB: While the tides of battle in the Great Spoiler War have clearly let lay that sufficiently old movies are fair game, I sometimes lay awake at night, fondly picturing a world where even the ending of Citizen Kane is protected for future generations
21:51:49  if a movie can be spoiled with a single sentence it probably isn't a good movie hth
22:09:13 -!- nfd9001 has quit (Ping timeout: 276 seconds).
22:12:33 -!- hppavilion[2] has quit (Ping timeout: 245 seconds).
22:16:46 -!- nfd9001 has joined.
22:22:52 -!- nfd9001 has quit (Ping timeout: 276 seconds).
22:26:36 -!- nfd9001 has joined.
22:37:10 -!- nfd9001 has quit (Ping timeout: 276 seconds).
22:43:21 -!- Sgeo has joined.
22:45:56 -!- arseniiv has quit (Ping timeout: 248 seconds).
22:49:13 -!- atslash has quit (Ping timeout: 245 seconds).
22:49:37 -!- atslash has joined.
22:55:29 -!- FreeFull has quit.
23:21:35 -!- Phantom___Hoover has quit (Ping timeout: 268 seconds).
23:28:37  shachaf: I can think of some really good movies that have a big exciting twist, but I'm not sure it really spoils enjoyment of the movie to know what's coming
23:28:45  I think people have studied it and concluded it usually doesn't
23:30:12  I think my statement was probably too strong, depending on what you mean by "spoil"
23:43:34 -!- b_jonas has quit (Quit: leaving).

2019-08-27:

00:04:30  `quote invisible
00:04:31  35)  With enough crappiness a display can show you invisible pink unicorns. \ 995)  "May you live in INVISIBLE TIMES." --Old Chinese proverb. (It can look confusing when written with the proper Unicode.)
00:55:00 -!- adu has joined.
01:24:17 -!- ARCUN has joined.
01:24:43  I just got Cygwin. 
01:24:53  what fun things can I do?
01:25:30  I'm asking, as I currently don't have an active project.
01:25:52  You could write a compiler for my programming language.
01:26:04  what is it?
01:27:14  I'm not sure yet.
01:27:26  Is there a reason to use Cygwin nowadays with WSL?
01:28:14  I'm using it, since I don't have a PC of my own. I run it on a flashdrive
01:28:24  Its so far pretty good
01:28:50  If did have a PC, though, I'd be using WSL instead
01:28:53  Aha.
01:29:48  When you finish your lang, tell me on my talk page
01:30:01  I don't have a wiki account.
01:30:14  Make oen then
01:30:16  My language is going to be so good, if I make it.
01:30:19  one*
01:30:55  I'd like to see it in action when you complete it
01:31:06  You could write some fancy software.
01:31:20  Maybe you can make a good debugger for me.
01:32:43  Well, that'll happen when you make a wiki account and tell me about it
01:32:47  Good Night
01:32:51 -!- ARCUN has left.
01:46:15 -!- nfd9001 has joined.
02:02:40 -!- Sgeo_ has joined.
02:04:52 -!- Sgeo has quit (Ping timeout: 248 seconds).
02:24:06 -!- adu has quit (Quit: adu).
03:19:06  [[Ojc]] N https://esolangs.org/w/index.php?oldid=65668 * A * (+215) Created page with "[[Ojc]] (standing for O[b]j[e]c[t]) is an [[object-oriented]] language designed to be very concise. It is influenced by both Smalltalk and Simula. [[Category:Languages]] Cat..."
03:29:10 -!- nfd9001 has quit (Ping timeout: 272 seconds).
03:36:36 -!- MDude has quit (Ping timeout: 248 seconds).
03:56:23  [[Ojc]] M https://esolangs.org/w/index.php?diff=65669&oldid=65668 * A * (+2283) No Simula, since I can't learn it.
03:57:50 -!- Sgeo__ has joined.
04:01:08 -!- Sgeo_ has quit (Ping timeout: 248 seconds).
04:31:45  [[Ojc]] M https://esolangs.org/w/index.php?diff=65670&oldid=65669 * A * (+1049) Examples
04:31:57  `quote
04:31:58  417)  Capitalism is a cancer. But I'm a smoker, anyway, so...
04:37:28  [[Ojc]] M https://esolangs.org/w/index.php?diff=65671&oldid=65670 * A * (+1467) /* Doing math */
04:37:55  [[Ojc]]  https://esolangs.org/w/index.php?diff=65672&oldid=65671 * A * (-6) /* Doing math */ Typo
04:59:54  [[Ojc]] M https://esolangs.org/w/index.php?diff=65673&oldid=65672 * A * (+5602) /* Math in Ojc */
05:28:51  [[Ojc]]  https://esolangs.org/w/index.php?diff=65674&oldid=65673 * A * (+1392) /* Sets */
05:30:31 -!- nfd9001 has joined.
05:30:40 -!- sebbu2 has joined.
05:33:48 -!- sebbu has quit (Ping timeout: 245 seconds).
05:38:49  Is the "top-level scope" in a file really like a regular scope or do languages just trick you to make it look like one?
05:39:15  It seems pretty different.
05:41:04  Pretty sure it's regular in Tcl.
05:41:08  But Tcl is a weirdo.
05:41:16  Tcl is indeed a weirdo.
05:42:04  OK, one property of regular scopes is typically that "{ a; b; c; }" means the same as "{ a; { b; c; } }", and if b is a declaration, it's only visible inside the inner block.
05:42:21  I guess that's actually still true in C.
05:43:09  But say you have a thing that reads multiple files and lets declarations refer to each other -- then that's not true anymore.
05:43:14  Definitions are being exported.
05:43:45  I want to have things that modify a scope, as in "const { int x = 1; int y = 2; }" instead of "const int x = 1; const int y = 2;". But I want those declarations to go into the same scope as the regular declarations.
05:43:53  (const is maybe not the best example but you get the idea.)
05:44:28  It's possible that "exported" declarations should be marked explicitly rather than just looking like regular variable declarations?
05:54:21  I'm starting to suspect that nVidia's notion of stereoscopy is limited and I should write my own.
05:54:51  you wouldn't copy a stereo
05:58:50  [[Ojc]] M https://esolangs.org/w/index.php?diff=65675&oldid=65674 * A * (+4753) /* Sets */
05:59:26  [[Ojc]] M https://esolangs.org/w/index.php?diff=65676&oldid=65675 * A * (-1486) /* Dictionaries */
05:59:48  [[Ojc]] M https://esolangs.org/w/index.php?diff=65677&oldid=65676 * A * (+1488) /* Sets */
06:20:05  btc is weird... why do you split inputs like this? https://bitinfocharts.com/bitcoin/block/530048/183hmJGRuTEi2YDCWy5iozY8rZtFwVgahM
06:25:29  Is there something special about that transaction?
06:25:50  It's padded. All the inputs come from the same address.
06:26:00  I think I accidentally defined a homogenous coordinate system
06:26:22  nVidia has an equation PsInput.x += Separation*(〖PsInput〗_w-Convergence)
06:26:46  I decided I wanted to be able to represent PsInput.x += some_constant, which that equation doesn't allow
06:26:51  So why would you pad transactions... to slow down the overall transaction rate maybe? This was at a local BTC price peak, too. I don't know.
06:27:01  So x += realSep * w - virtualSep * Convergence
06:27:19  When realSep = 0, then the equation cannot be converted to the nVidia form
06:27:38  (is equation the right word here? It feels wrong. Formula?)
06:28:14  * when realSep = 0 and virtualSep and Convergence are non-9
06:28:17  non-0
06:28:48  Anyway, enough time wasted on this. (I started looking into this because I tried to understand this peak: https://www.blockchain.com/charts/output-volume?timespan=30days
06:30:31  ... bit as far as I can see this is just many transactions siphoning off tiny amounts from a single rich address (output of transaction = balance of input). So basically how a bitcoin exchange might operate.)
06:31:01  int-e: I saw that, but I meant why you were looking at it in the first place, or whether this is common.
06:31:04  But meh I really shouldn't waste time on this.
06:32:53  I don't know whether this kind of padding is a common tactic, I don't even know what exactly it's supposed to achieve.
06:33:22  It's a curiosity, really. Odd enough to make me wonder, not important enough to make me care.
06:58:02  [[Ojc]] M https://esolangs.org/w/index.php?diff=65678&oldid=65677 * A * (+1809) /* Classes */
06:59:45  [[User:JonoCode9374]]  https://esolangs.org/w/index.php?diff=65679&oldid=65144 * JonoCode9374 * (+10) /* Languages I've Inspired (feel free to add anything I've missed) */
07:08:23 -!- wob_jonas has quit (Ping timeout: 245 seconds).
07:15:51 -!- Sgeo_ has joined.
07:19:34 -!- Sgeo__ has quit (Ping timeout: 244 seconds).
08:05:22 -!- AnotherTest has joined.
08:21:10 -!- cpressey has joined.
08:23:32  Good morning. I wonder how well Haskell's $ operator would work in an S-expression-based language.
08:24:42  So instead of (f (g x)) you'd write ($ f (g x))
08:24:54  That's an improvement.
08:25:16  I was thinking you'd write (f $ g x)
08:25:34  I should've lowercased that because it was very much not serious.
08:27:49  [[Flop]]  https://esolangs.org/w/index.php?diff=65680&oldid=65666 * B jonas * (+119) 
08:28:41 -!- wob_jonas has joined.
08:32:22  shachaf: Your error handling thing reminds me of "lexical exceptions", though I don't remember if it's something I saw somewhere, or something I made up once
08:32:46  In "lexical exceptions" you're only allowed to throw X in a location that is lexically enclosed by a catch X
08:33:36  [[Talk:Ojc]] N https://esolangs.org/w/index.php?oldid=65681 * JonoCode9374 * (+262) Lps
08:34:13 -!- Lord_of_Life has quit (Ping timeout: 245 seconds).
08:34:20  That doesn't make them totally static, for example if you have local functions, you could write a recursive function inside that lexical block, and throw inside it
08:34:40  Is X an exception type or something lexically bound?
08:35:19  I am sorely tempted to tell you it is a lexically bound exception type
08:35:46  It's some kind of exception type, sure.
08:35:46  I think I'm asking what sort of identifier X is, or where it comes from.
08:36:36  When you throw, you almost always throw a newly-created value, whether it is a value of type "exception" (as it usually is), or not
08:36:51  Throwing existing values is... not something I've seen done.
08:37:12 -!- heroux has quit (Ping timeout: 268 seconds).
08:37:27 -!- heroux has joined.
08:37:28  Maybe you make up a new exception value, out of some local variables you have - that's common.
08:37:34  I'm confused about what binds the values.
08:37:55  I don't know what you mean by that.
08:38:12 -!- Lord_of_Life has joined.
08:38:31  Maybe you can write a more specific example?
08:39:56  try { raise KeyError(12); } catch KeyError(n) { print(n); }  <-- is ok
08:40:12  OK, I see.
08:40:20  try { foo(); /* which raises KeyError */ } catch KeyError(n) { print(n); }  <-- is not ok, is not lexical
08:40:51  cpressey: so you only have lexical gotos?
08:41:32  btw, I hate that the opposite of "catch" is "throw" but the opposite of "raise" is "lower", and I usually end up saying "raise" and "catch" even though they're not opposites
08:41:39  I was wondering whether you meant something like "try { raise foo; } catch foo { ... }" where the identifier "foo" is bound by the catch.
08:43:29  wob_jonas: I guess so, but as I noted, they're still dynamic w.r.t. the stack, if you have e.g. a local recursive function in that lexical block
08:43:33  cpressey: I recommend "raise" and "except" then, as in python3
08:43:51  Can you give a recursive function example?
08:44:19  I don't really understand what you mean.
08:44:47  try { var f = function(m) { if m < 100 then f(m+1) else raise KeyError(13); } catch ...
08:44:48  Oh, I see, you mean you *define* a function inside a try.
08:44:59  Right, I'd just figured out what you meant.
08:45:50  but what happens if you copy f and leak it out of that scope? do you get a full call/cc?
08:46:45  wob_jonas: I guess it raises an exception that will never be caught. I guess you could also try to prevent it from leaking out.
08:47:08  This seems like a bizarre combination.
08:47:27  Well, I think this must be something I made up, rather than something I encountered somewhere.
09:24:28 -!- arseniiv has joined.
09:29:41  wob_jonas: I guess making the exception thrown by the escaped function, get caught by the lexical catch handler, would be a sensible way to handle it too (given that approximately none of this is very sensible)
09:30:21  cpressey: in that case what you have is a call/cc
09:30:25  [[Talk:Ojc]] M https://esolangs.org/w/index.php?diff=65682&oldid=65681 * A * (+528) 
09:31:10  [[Talk:Ojc]] M https://esolangs.org/w/index.php?diff=65683&oldid=65682 * A * (+81) Link to tutorial
09:32:58  [[Ojc]] M https://esolangs.org/w/index.php?diff=65684&oldid=65678 * A * (+195) /* Tutorial */
09:34:03  [[Special:Log/move]] move  * A *  moved [[Ojc]] to [[Salt]]: Because Ojc is not interesting
09:34:04  [[Special:Log/move]] move  * A *  moved [[Talk:Ojc]] to [[Talk:Salt]]: Because Ojc is not interesting
09:34:49  [[Salt]] M https://esolangs.org/w/index.php?diff=65689&oldid=65685 * A * (+4) 
09:35:29  [[Talk:Salt]] M https://esolangs.org/w/index.php?diff=65690&oldid=65687 * A * (-3) 
09:37:36  [[Salt]] M https://esolangs.org/w/index.php?diff=65691&oldid=65689 * A * (+17) /* Documenting the class */ A mess
09:38:15  [[Salt]] M https://esolangs.org/w/index.php?diff=65692&oldid=65691 * A * (-33) Smalltalk->Salt
09:39:40  [[Talk:Salt]] M https://esolangs.org/w/index.php?diff=65693&oldid=65690 * A * (+435) 
09:45:29  wob_jonas: yes, and that feels slightly too "powerful" for what this was intended to achieve, probably, but who knows.
09:46:01  cpressey: you can always have a restriction of call/cc, such as call/ec
09:46:31  or something between
09:47:49  an explicitly bounded continuation where you tell how long you have to save the state
09:48:11  I'd like to know how linear continuations work.
09:51:59 -!- CountArthurStron has joined.
09:52:54 -!- CountArthurStron has quit (Client Quit).
09:53:10 -!- ArthurStrong has joined.
09:56:28  I have a language which is too "normal" to be an esolang, but is too weird to be a "normal" language.
09:56:46  apl?
09:57:32  myname: Point taken.
09:57:44  cpressey: if in doubt, make an entry about it on esolangs.org, but don't definitely claim that it's an esolang
09:57:57  we have a few such entries already
09:58:20  I've made so many esolangs that the languages I've made that aren't particularly esoteric will probably be considered esolangs by many
09:58:24 -!- ArthurStrong has quit (Quit: leaving).
09:58:40  Ah well
09:58:43  details!
09:59:26 -!- ArthurStrong has joined.
09:59:54  Do you think C++ is an esolang?
10:00:30  I think C++ is certainly a programming language that is esoteric
10:00:38  Whether it's an esoteric programming language is another matter
10:01:01  so almost every programming language is esoteric, right? especially modern ones
10:01:16  I think C++ is the way it is for nearly the same reasons esolangs are the way they are.
10:01:50  People enjoy doing things under odd constraints that make them hard but achievable.
10:01:53  myname: https://github.com/catseye/Robin/tree/develop-0.3  (I'm trying to get the next version of released)
10:02:24 -!- ArthurStrong has quit (Client Quit).
10:02:39 -!- ArthurStrong has joined.
10:03:59  [[Salt]] M https://esolangs.org/w/index.php?diff=65694&oldid=65692 * A * (+5853) 
10:10:41  [[Salt]] M https://esolangs.org/w/index.php?diff=65695&oldid=65694 * A * (-6) I should not make a Smalltalk-based language yet before I learn Smalltalk.
10:11:28  [[Talk:Salt]] M https://esolangs.org/w/index.php?diff=65696&oldid=65693 * A * (+90) 
10:27:48 -!- Sgeo__ has joined.
10:29:40  [[Hello world program in esoteric languages]] M https://esolangs.org/w/index.php?diff=65697&oldid=65656 * A * (+29) /* SADOL */
10:31:17 -!- Sgeo_ has quit (Ping timeout: 268 seconds).
10:41:10  I think it's too freaky to be a "normal" language, even if it's not an esolang. So I think, things like trying to add Haskell's infix $ operator to it, are fair game.
10:41:35  Should probably just try hand-converting some Scheme code to use it first just to see what it looks like though.
10:48:31  `? password
10:48:32  The password of the month is surprising.
10:58:23 -!- xkapastel has joined.
11:01:10  . o O ( cpressey doesn't believe in type signatures )
11:03:03  oh I've found a few.
11:05:09  https://gist.github.com/cpressey/030883cadaf9a12a802cd6c95affc01e
11:06:22  It *does* reduce the number of parens, just like it does in Haskell. Whether it does so nicely, or not, I don't know.
11:06:32  cpressey: now I want to get rid of the outermost parentheses as well
11:06:56  int-e: That's hard.
11:06:59  (and `if` is a bit awkward
11:07:00  )
11:07:51  int-e: Why don't I believe in type signatures?
11:07:55  I've used ghc's BlockArguments for if-then-else last weekend... https://gist.github.com/int-e/57eefc6cce29ed47ddaaca13a0774533#file-quine-hs-L319-L329
11:08:03  cpressey: because your code uses them so sparingly
11:08:23  cpressey: whereas I, almost religiously, put signatures on all top-level bindings.
11:08:34  partly as documentation, partly to localize type errors
11:09:49  int-e: If I thought of these modules as public, I would probably try harder to do that. But this is largely experimental stuff.
11:09:57  (The latter was the driving factor historically. I just got tired of working on modifying a function and getting a type error in a different function as a result.)
11:10:14  cpressey: I think some older lisps (of the common lisp side, not the scheme side) had this syntax extension where you can use square brackets as well as round parens, and a close square bracket closes all round paren that was open since the matching open square bracket
11:10:41  cpressey: is your dollar sign syntax the same, except you write round parenthesis instead of square brackets and a dollar sign instead of a left round parenthesis?
11:11:00  because if so, then the bracket thing is more general
11:11:28  but has basically the same power
11:11:33  just possibly more convenience
11:12:15  cpressey: anyway indentation is the best bracket-avoiding mechanism. ;)
11:13:07  wob_jonas: I don't like the "this one close paren closes all open parens" approach because the parens are unbalanced.
11:14:59  int-e: re ifThenElse, I was wondering on the weekend if Haskell's `if` couldn't just be defined as a function :: Boolean -> a -> a
11:15:19  `then` and `else` are good syntax though, justifies the sugar
11:15:20  ​/srv/hackeso-code/multibot_cmds/lib/limits: line 5: exec: then`: not found
11:16:00  cpressey: there are advocates of that idea, but if-then-else is common enough and the alternative would have more parentheses and worse (usually type) errors.
11:17:47  cpressey: the main downside, I guess, is that the syntax really only works for booleans; it can't be overloaded for a DSL.
11:19:16  cpressey: sure, in a *lazy* language you can define it as a function, only in haskell you have to call it something different from "if" because that name is taken by a keyword
11:20:04  but I'm used to strict languages, where it can't be defined as a plain function
11:20:06  (A secondary issue is that I never really know how to layout if-then-else, especially inside do blocks. I do something, but it never feels right and I'm not sure how consistent I am... might be worth checking.)
11:20:16  wob_jonas: my point was they didn't need to define that keyword, they could've made `if` a function defined in the prelude
11:20:27  cpressey: sure
11:20:53  int-e: I have the same issue, I usually avoid it and use `case` instead
11:20:57  I think the function is there in the libraries under some other name
11:21:24  :t Data.Bool.bool -- almost
11:21:25  a -> a -> Bool -> a
11:21:57  @hoogle Bool -> a -> a -> a
11:21:58  Data.Bool.HT if' :: Bool -> a -> a -> a
11:21:58  Data.Bool.HT ifThenElse :: Bool -> a -> a -> a
11:21:58  NumericPrelude ifThenElse :: () => Bool -> a -> a -> a
11:23:01  "utility-ht-0.0.1", okay
11:23:28  I was going to ask isn't if' the canonical name for that.
11:23:50  @hoogle if'
11:23:51  Data.Bool.HT if' :: Bool -> a -> a -> a
11:23:51  Control.Conditional if' :: ToBool bool => bool -> a -> a -> a
11:23:51  Data.ProtoLens.Compiler.Combinators if' :: Exp -> Exp -> Exp -> Exp
11:23:54  @hoogle a -> a -> Bool -> a
11:23:55  Data.Bool bool :: a -> a -> Bool -> a
11:23:55  Data.Bool.Compat bool :: () => a -> a -> Bool -> a
11:23:56  Control.Error.Util bool :: a -> a -> Bool -> a
11:24:04  @more
11:24:29  @pl if b then t else f
11:24:29  if' b t f
11:24:30  Apparently HT stands for... Henning Thielemann?
11:24:49  just define bools like (\xy.x) and (\xy.y), that eliminates the need of an if altogether
11:24:49  Sounds conceivable
11:24:55  fizzie: @pl is the only reason I can think of that this name would be "canonical".
11:25:04  cpressey: Yes.
11:25:05  myname: that's hard in the original Haskell type system
11:25:18  int-e: Well, my definition of "canonical" here is "I've heard of it with that name".
11:25:43  fizzie: That's not the canonical definition of "canonical". ;-)
11:27:25  (Though if you've heard it somewhere that may support the idea that it is indeed canonical. But it might also be an idiosyncracy of your source, and not enshrined in any canon that everybody subscribes to.)
11:28:23  ("Everybody" is, of course, referring to a certain subculture or clique. :P)
11:31:31  It may be that the reordered "bool :: a -> a -> Bool -> a" is more useful as a function anyway.
11:32:20  :t maybe
11:32:21  b -> (a -> b) -> Maybe a -> b
11:33:07  @pl if x then y else z
11:33:08  if' x y z
11:33:17  @pl bool x y z
11:33:17  bool x y z
11:33:54  @hoogle Maybe a -> a -> a
11:33:55  Test.Framework.Providers.API orElse :: Maybe a -> a -> a
11:33:55  Control.Error.Util (?:) :: Maybe a -> a -> a
11:33:55  Universum.Monad.Maybe (?:) :: Maybe a -> a -> a
11:34:35  @hoogle a -> Maybe a -> a
11:34:36  Data.Maybe fromMaybe :: a -> Maybe a -> a
11:34:36  System.Directory.Internal.Prelude fromMaybe :: () => a -> Maybe a -> a
11:34:36  Distribution.Compat.Prelude.Internal fromMaybe :: () => a -> Maybe a -> a
11:34:41  I should learn more Haskell.
11:35:11  @unpl if'
11:35:12  if'
11:35:22  @unpl if' x y z
11:35:22  if' x y z
11:35:36  @unpl if' True y z
11:35:37  if' True y z
11:35:40  hmm
11:35:47  does this really know about if' ?
11:36:49  @run if' True x y
11:36:51   error:
11:36:51       • Variable not in scope: if' :: Bool -> Expr -> Expr -> t
11:36:51       • Perhaps you meant ‘f'’ (imported from Debug.SimpleReflect)
11:37:01  @run bool x y True
11:37:03   y
11:37:20  @pl \y z x -> bool x y z
11:37:20  flip . flip bool
11:38:28 -!- nfd9001 has quit (Ping timeout: 258 seconds).
11:39:04  @pl \c a b -> bool a b c
11:39:04  flip (flip . bool)
11:40:13  I don't even know enough Haskell syntax to write a `case` on one line
11:40:22  @pl \a b c -> if c then a else b
11:40:22  flip . flip if'
11:40:25  ah
11:40:51  Maybe it just knows enough about if' to translate if/then/else into it.
11:40:54  cpressey: it's like case expr of { pat0 => expr0; pat1 => expr1; }
11:41:21  I think
11:41:26  I'm not sure, I don't remember haskell syntax
11:41:48  > case otherwise of False -> "oops"; True -> "okay!"
11:41:50   "okay!"
11:41:54  > case otherwise of { False -> "oops"; True -> "okay!" }
11:41:56   "okay!"
11:42:16  ah with a single arrow
11:42:21  sorry
11:42:50  => in case is the mark of an ML programmer?
11:44:21  OK. I think it is just that @pl does not parse the syntax.
11:44:46  cpressey: how would you make \b f t -> if b then f else t  point-free?
11:45:06  @pl would just not work with the syntax.
11:45:24  @pl \b f t -> if b then f else t
11:45:25  if'
11:45:41  @pl \b f t -> if b then f else t -- @pl parses all of Haskell syntax, didn't you know?
11:45:41  if'
11:45:56  It really doesn't.
11:45:59  @pl \b f t -> if b then f else t {- such as block comments -}
11:45:59  if'
11:46:08  Well, it doesn't parse case.
11:46:21  and that thing with the minus sign that I saw the last time
11:46:22  @pl \xs -> case xs of [] -> not; x:xs -> supported
11:46:22  (line 1, column 24):
11:46:23  unexpected '>'
11:46:23  expecting operator
11:47:03  @pl f x | odd x = 1 | otherwise = 2
11:47:03  (line 1, column 14):
11:47:03  unexpected " "
11:47:13  > @pl f x = if odd x then 1 else 2
11:47:15   :1:1: error: parse error on input ‘@’
11:47:20  @pl f x = if odd x then 1 else 2
11:47:20  f = flip (flip if' 1 . odd) 2
11:48:10  @pl is an awful hack, really.
11:49:12  int-e: I'm not qualified to say how one could write `if'` point-free.
11:52:05  My inclination would be to write it in CPS. Which doesn't help?
11:53:06  You need a destructor for Bool. Something like if' or bool. ;-)
11:53:49  Or maybe a way of sectioning anything.
11:54:03  (if then else) b t f = (if b then t else f) ;-)
11:54:15  > (,2,) 1 3
11:54:17   (1,2,3)
11:56:06  "You need something else to complete it, something like if' itself" sounds a bit like my thought process was, yeah
11:57:31  @type (,2,)
11:57:33  Num t1 => t2 -> t3 -> (t2, t1, t3)
11:58:21  Sometimes Haskell reminds me of PL/I
11:58:43  "If some sequence of characters has a reasonable interpretation, the language will make that interpretation"
12:01:30  sounds also a lot like irp
12:03:38  > (2,) 1 3
12:03:40   error:
12:03:40       • Couldn't match expected type ‘Integer -> t’
12:03:41                     with actual type ‘(Integer, Integer)’
12:04:01  > (1,2,3) : (,Int,) Int Int
12:04:03   error:
12:04:03       • Data constructor not in scope: Int
12:04:03       • Perhaps you meant one of these:
12:04:06  > (1,2,3) :: (,Int,) Int Int
12:04:08   :1:14: error: parse error on input ‘Int’
12:04:14  hmm, doesn't work as a type?
12:09:15  well, a lot of things don't work as types
12:09:25  if-then-else, case expressions...
12:09:28  lambdas
12:09:48  in fact, since sections are lambdas, sections cannot really be expected to work on the type level
12:39:41 -!- MDude has joined.
12:40:51   You need a destructor for Bool. Something like if' or bool. ;-) => yeah, why isn’t it standard yet?
12:42:16  ah or is it?
12:42:27  I was confused, don’t mind that
12:43:03  I mean I revoke my question
12:47:40  . o O ( retract, withdraw )
12:49:11  `? brevity
12:49:12  syn. "shortness"
12:53:57  So... "nub" is the very essence of brevity.
12:57:53 -!- Sgeo_ has joined.
13:00:11  int-e: yeah I wrote that and then it occurred I could write “I take back”
13:01:18 -!- Sgeo__ has quit (Ping timeout: 245 seconds).
13:32:27 -!- sebbu2 has changed nick to sebbu.
13:55:45  [[Flop]]  https://esolangs.org/w/index.php?diff=65698&oldid=65680 * InfiniteDonuts * (+229) 
14:32:38  For whatever it's worth, version 0.3 of Robin has been released. Already I know things I want to change for 0.4. But at least it is a little better than 0.2 was. https://github.com/catseye/Robin
14:36:31  cpressey: is this the questionable esoteric language that you've mentioned?
14:39:42  wob_jonas: yes
14:40:54  version 0.2 was in 2014, btw, so this is, like, a long-overdue update of something I haven't touched in 5 years, basically
15:20:27  [[SIMPLE (preprocessor)]] N https://esolangs.org/w/index.php?oldid=65699 * B jonas * (+1395) Created page with "'''SIMPLE''' is a text preprocessor created by [[David Madore]] in 1998, inspired by m4.    SIMPLE has special syntax to expand a function parameter with each of its tokens qu..."
15:21:07  [[SIMPLE]]  https://esolangs.org/w/index.php?diff=65700&oldid=8359 * B jonas * (+71) 
15:21:59  [[Language list]]  https://esolangs.org/w/index.php?diff=65701&oldid=65642 * B jonas * (+28) [[SIMPLE (preprocessor)]]
15:23:52  [[David Madore]]  https://esolangs.org/w/index.php?diff=65702&oldid=59714 * B jonas * (+28) 
15:28:50 -!- wob_jonas has quit (Remote host closed the connection).
15:32:13 -!- ArthurStrong has quit (Quit: leaving).
15:58:29 -!- cpressey has quit (Quit: A la prochaine.).
16:15:03  rats live on no evil star, huh
16:15:49  arseniiv: won't lovers revolt now?
16:17:05  Taneb: don’t know how well-known that palyndrome is, I took it from cpressey’s generated text :D
16:18:04  ah, seemingly it is more or less known
16:18:55  in poems and stories and music albums
16:22:45  [[Functional()]]  https://esolangs.org/w/index.php?diff=65703&oldid=57492 * Hakerh400 * (-16) Update interpreter link
16:25:47  [[Bitwise Trance]]  https://esolangs.org/w/index.php?diff=65704&oldid=59794 * Hakerh400 * (-3) Update interpreter link
16:25:55  arseniiv: I stole it from the song "Bob" by Al Yankovic
16:26:41  [[BitBounce]]  https://esolangs.org/w/index.php?diff=65705&oldid=60020 * Hakerh400 * (+2) Update interpreter link
16:28:44  that’s weird 
16:29:15  Yes
16:29:43  [[Functasy]]  https://esolangs.org/w/index.php?diff=65706&oldid=60557 * Hakerh400 * (+93) Update interpreter link
16:30:30  [[Examinable Invocation Vector]]  https://esolangs.org/w/index.php?diff=65707&oldid=62375 * Hakerh400 * (-188) Update interpreter link
16:31:01  [[Realm]]  https://esolangs.org/w/index.php?diff=65708&oldid=64710 * Hakerh400 * (-164) Update interpreter link
16:41:18 -!- b_jonas has joined.
16:41:27  I just saw something funny
16:41:42  water was trapped between the two panes of the double-layered window of the bus
16:41:49  was a few centimeters high
16:41:56  it made nice waves as the bus accelerated
16:42:30 -!- FreeFull has joined.
17:11:05  [[SIMPLE (preprocessor)]]  https://esolangs.org/w/index.php?diff=65709&oldid=65699 * B jonas * (+54) 
17:45:04 -!- Phantom_Hoover has joined.
18:01:17  [ 0.45 * 50 75
18:01:18  b_jonas: 22.5 33.75
18:15:31  what language is [
18:15:31  Whoah
18:15:39 * APic just thought, wtf, ##Esoteric is invite only
18:15:45  Then i realized it has one Hash less
18:15:46  😸
18:19:37  we are Officially Esoteric™
18:21:03  [[Special:Log/newusers]] create  * Antirapistrapistclub *  New user account
18:22:22  *nod*
18:22:55  [[Esolang:Introduce yourself]]  https://esolangs.org/w/index.php?diff=65710&oldid=65630 * Antirapistrapistclub * (+419) 
18:23:11  [[User:Antirapistrapistclub]] N https://esolangs.org/w/index.php?oldid=65711 * Antirapistrapistclub * (+0) Created blank page
18:23:20  [[User talk:Antirapistrapistclub]] N https://esolangs.org/w/index.php?oldid=65712 * Antirapistrapistclub * (+0) Created blank page
18:24:57  Ominous nick...
18:25:27  blank pages don't sound good
18:26:59  That could just mean that they don't like their user name/talk page links to be red.
18:32:26  Phantom_Hoover: J
18:32:41  Phantom_Hoover: [ is not the name of the language, it's the shortcut invocation for the bot
18:32:51  j-bot, jeval: 0.45 * 50 75
18:32:51  b_jonas: 22.5 33.75
18:33:53  oh, I see
18:35:10  and > is also not the name of a language, but it's a shortcut to evaluate things in a different language
18:35:40  > fmap (* 0.45) [50, 75]
18:35:42   [22.5,33.75]
18:37:43  [[Flop]]  https://esolangs.org/w/index.php?diff=65713&oldid=65698 * InfiniteDonuts * (+69) /* Cat */
18:38:01  [[Flop]]  https://esolangs.org/w/index.php?diff=65714&oldid=65713 * InfiniteDonuts * (-1) /* Infinite Loop */
18:42:14  cpressey: the definitions in https://github.com/catseye/Robin/blob/master/stdlib/cmp.robin#L147 don't seem right
18:42:41  either that or the documentation for what those functions are supposed to do 
19:15:29 -!- Melvar has quit (Quit: WeeChat 2.4).
19:31:29 -!- laerling has left ("Leaving").
19:32:33 -!- Phantom_Hoover has quit (Ping timeout: 245 seconds).
19:36:55  [[Special:Log/newusers]] create  * Zektay77 *  New user account
19:37:04  @tell cpressey (hello) in your Robin description on Github, you said PicoLisp has macros; one of my friends says it isn’t true. I personally don’t know anything about it and then I can tell him something if you wish
19:37:05  Consider it noted.
19:38:09  [[Esolang:Introduce yourself]]  https://esolangs.org/w/index.php?diff=65715&oldid=65710 * Zektay77 * (+87) /* Introductions */
19:38:37  [[Esolang:Introduce yourself]]  https://esolangs.org/w/index.php?diff=65716&oldid=65715 * Zektay77 * (+85) /* Introductions */
19:52:45 -!- Phantom_Hoover has joined.
19:54:57  Should I use 0x8B or 0x89 for encoding reg-reg mov on x86?
19:57:56 -!- Melvar has joined.
19:58:23  Or more generally if there are redundant encodings like that with "foo r/m,r" and "foo r,r/m" is there a reason to prefer one?
20:09:02  [[Esolang:Introduce yourself]]  https://esolangs.org/w/index.php?diff=65717&oldid=65716 * Mid * (+139) /* Introductions */
20:15:45 -!- unlimiter has joined.
20:21:37  shachaf: dunno, check (recent versions of) the intel optimization manual, the amd optimization manual, the optimization manual for your specific processor generation, and Agner's manuals
20:21:43  I think it doesn't matter
20:33:57 -!- Lord_of_Life_ has joined.
20:36:40 -!- Lord_of_Life has quit (Ping timeout: 258 seconds).
20:36:49 -!- Lord_of_Life_ has changed nick to Lord_of_Life.
20:57:25 -!- xkapastel has quit (Quit: Connection closed for inactivity).
21:23:37 -!- sftp has quit (Excess Flood).
21:24:09 -!- sftp has joined.
21:31:54 -!- flux98 has joined.
21:31:56 -!- flux98 has left.
21:34:13 -!- unlimiter has quit (Quit: WeeChat 2.5).
21:43:07 -!- xkapastel has joined.
21:51:43 -!- b_jonas has quit (Quit: leaving).
21:53:01 -!- Melvar has quit (Ping timeout: 246 seconds).
21:53:26 -!- Melvar has joined.
21:55:19 -!- AnotherTest has quit (Ping timeout: 276 seconds).
23:10:43 -!- Phantom_Hoover has quit (Ping timeout: 246 seconds).
23:33:32 -!- FreeFull has quit.

2019-08-28:

00:14:04  [[Special:Log/newusers]] create  * Toel F *  New user account
00:36:43 -!- arseniiv has quit (Ping timeout: 245 seconds).
00:40:56 -!- tromp_ has joined.
00:42:43 -!- tromp has quit (Ping timeout: 252 seconds).
00:57:32 -!- MDude has quit (Ping timeout: 245 seconds).
01:36:33  [[Special:Log/newusers]] create  * SoundOfScripting *  New user account
01:41:07  [[Esolang:Introduce yourself]]  https://esolangs.org/w/index.php?diff=65718&oldid=65717 * SoundOfScripting * (+303) Followed instructions.
01:42:14  [[User:SoundOfScripting]] N https://esolangs.org/w/index.php?oldid=65719 * SoundOfScripting * (+1067) Created page with "This is the page of the terrible language designer [https://www.esolangs.org/wiki/User:SoundOfScripting User:SoundOfScripting]. I like to make esolangs, even if they are not p..."
01:43:27  [[User:HereToAnnoy]]  https://esolangs.org/w/index.php?diff=65720&oldid=65380 * SoundOfScripting * (-992) Alternatively, delete this page.
01:44:18  [[Arrows]] M https://esolangs.org/w/index.php?diff=65721&oldid=57337 * SoundOfScripting * (+5) Changed to User:SoundOfScripting
01:44:42  [[TheSingularity]] M https://esolangs.org/w/index.php?diff=65722&oldid=55647 * SoundOfScripting * (+5) Changed to User:SoundOfScripting
01:46:40  [[WCDA]] M https://esolangs.org/w/index.php?diff=65723&oldid=53754 * SoundOfScripting * (+57) Changed to User:SoundOfScripting
01:47:36  [[Focus]] M https://esolangs.org/w/index.php?diff=65724&oldid=55649 * SoundOfScripting * (-60) Changed to User:SoundOfScripting
01:48:15  [[TwoFiftyFive]] M https://esolangs.org/w/index.php?diff=65725&oldid=53836 * SoundOfScripting * (+5) Sorry for the eidit spam! Just a handful more pages. ======= Changed to User:SoundOfScripting
01:48:44  [[Tables]] M https://esolangs.org/w/index.php?diff=65726&oldid=53826 * SoundOfScripting * (+5) Changed to User:SoundOfScripting
01:49:21  [[Neg]] M https://esolangs.org/w/index.php?diff=65727&oldid=55788 * SoundOfScripting * (+5) maybe I'm just dumb and I could've changed my username
01:49:43  [[GetWhen]] M https://esolangs.org/w/index.php?diff=65728&oldid=55798 * SoundOfScripting * (+5) Changed to User:SoundOfScripting
01:51:23  [[User:Language]] M https://esolangs.org/w/index.php?diff=65729&oldid=56602 * SoundOfScripting * (+45) Changed to User:SoundOfScripting
01:52:37  [[D.U.C.K.]] M https://esolangs.org/w/index.php?diff=65730&oldid=60740 * SoundOfScripting * (+5) Changed to User:SoundOfScripting
01:52:59  [[Braincells]] M https://esolangs.org/w/index.php?diff=65731&oldid=65379 * SoundOfScripting * (+5) Last one! Changed to User:SoundOfScripting
02:00:51 -!- xkapastel has quit (Quit: Connection closed for inactivity).
05:29:19 -!- ArthurStrong has joined.
06:08:08  [[BitBounce]] M https://esolangs.org/w/index.php?diff=65732&oldid=65705 * Hakerh400 * (-1) 
06:52:46 -!- tromp_ has quit (Read error: Connection reset by peer).
06:53:07 -!- tromp has joined.
06:59:17 -!- tromp has quit (Ping timeout: 252 seconds).
07:12:45 -!- nfd9001 has joined.
07:13:14 -!- tromp has joined.
07:17:59 -!- tromp has quit (Ping timeout: 252 seconds).
07:30:57 -!- tromp has joined.
07:31:54 -!- tromp_ has joined.
07:35:13 -!- tromp has quit (Ping timeout: 252 seconds).
08:11:42 -!- clog has quit (Ping timeout: 244 seconds).
08:15:08 -!- Phantom_Hoover has joined.
08:15:21  [[Spin]]  https://esolangs.org/w/index.php?diff=65733&oldid=33886 * Dtuser1337 * (+18) Adding a year category.
08:24:58  [[Spin]]  https://esolangs.org/w/index.php?diff=65734&oldid=65733 * Dtuser1337 * (+140) Adding examples.
08:35:48 -!- Lord_of_Life has quit (Ping timeout: 248 seconds).
08:38:24 -!- Lord_of_Life has joined.
08:54:32 -!- cpressey has joined.
08:55:03 -!- AnotherTest has joined.
08:55:22  Good morning. Idea for the day: design an esoteric parsing combinator library.
08:55:38  Maybe based on Fokker's X combinator. Except for parsing, of course.
08:56:58  Good morning.
08:57:15  I feel like I should know a whole bunch more about parsing.
09:07:52  Recursive descent parsing is easy and fun, but only works on some grammars. If you write a RDP manually you can manually add code to do non-context-free things like track a symbol table or generate code.
09:08:49  There are algorithms that will return all possible parses for general context-free grammars. They're not as efficient, most programming languages don't need them, but they're also fun in their way.
09:09:11  I don't know what a PEG is, I should probably find out some day.
09:12:16  Table-based parsing of LR-type grammars I find not-fun and have basically ignored all my life.
10:03:41  The LR-grammar parsing stuff is very esoteric, though, and should not be ignored. Maybe someone could make an esolang where it works like shift/reduce parsing, except it's not just a parser, it's a Turing-complete language.
10:10:52 -!- clog has joined.
10:13:08  Not that different from a push-down automaton, really, I guess
10:13:21  This reminds me of the mostly unrelated topic of alternating finite automata.
10:13:45  I wanted to figure out whether they're a realistic implementation strategy for regular expressions.
10:14:52  It sounds realistic in the sense that you could implement it. Whether there would be any advantages to doing so or not, I don't know.
10:16:22  I think it's conventional to convert NFAs to DFAs, but you can also execute NFAs directly. Which is more efficient in the modern era probably depends on cache configuration and all that gory stuff.
10:24:02 -!- MDude has joined.
10:42:51  s/conventional/traditional/
10:50:29  The advantage would be support for intersection and complement.
10:56:17 -!- Phantom_Hoover has quit (Ping timeout: 245 seconds).
11:02:43  I assume you mean, improved support... I think most regex implementations aren't oriented at optimizing the compilation-to-FA step.
11:03:03  You only need to compile the RE once, and typically use it more than once
11:03:21  Also, you should probably sleep
11:08:00  https://github.com/kragen/peg-bootstrap/blob/master/peg.md
11:08:05  this is my favorite page to learn about PEG
11:39:07 -!- xkapastel has joined.
12:05:57  The Wikipedia article is also not bad (as they go).  My understanding is, someone looked at how CFGs actually get implemented (as RDPs) and turned that back into a grammar formalism.
12:06:21  Expedient yes; mathematically satisfying, not really
12:11:41 -!- AnotherTest has quit (Ping timeout: 252 seconds).
12:15:34  Oh, that kind of RDP. (Google finds something entirely different.)
12:23:27 -!- arseniiv has joined.
12:24:03  [[Special:Log/newusers]] create  * Thecatlover1996 *  New user account
12:25:01  Remote Drocedure Pall
12:28:22  [[Esolang:Introduce yourself]]  https://esolangs.org/w/index.php?diff=65735&oldid=65718 * Thecatlover1996 * (+242) /* Introductions */
12:28:27  [[Brainfuck]]  https://esolangs.org/w/index.php?diff=65736&oldid=65605 * Thecatlover1996 * (+50) /* Language overview */ Tape has length 30,000
12:58:54 -!- ArthurStrong has quit (Quit: leaving).
12:59:10  [[Brainfuck]]  https://esolangs.org/w/index.php?diff=65737&oldid=65736 * Ais523 non-admin * (+168) /* Language overview */ clarify the nature of the tape
13:00:50  [[Brainfuck]]  https://esolangs.org/w/index.php?diff=65738&oldid=65737 * Ais523 non-admin * (+106) /* Computational class */ clarify that BF requires an unbounded tape or unbounded values to be TC
13:03:10  [[Special:Log/newusers]] create  * Trickbrain26 *  New user account
13:12:32  [[C-]] M https://esolangs.org/w/index.php?diff=65739&oldid=42106 * Ais523 non-admin * (-4) unpipe link to Wikipedia
13:19:32  [[Esolang:Introduce yourself]]  https://esolangs.org/w/index.php?diff=65740&oldid=65735 * Trickbrain26 * (+140) /* Introductions */
13:38:50 -!- AnotherTest has joined.
13:41:42  hpy
13:49:24 -!- Vorpal has joined.
13:49:24 -!- Vorpal has quit (Changing host).
13:49:24 -!- Vorpal has joined.
13:52:12  [[Flop]]  https://esolangs.org/w/index.php?diff=65741&oldid=65714 * InfiniteDonuts * (+116) 
13:53:41  [[Flop]]  https://esolangs.org/w/index.php?diff=65742&oldid=65741 * InfiniteDonuts * (-66) /* A Brief Tutorial */
13:54:04  [[Flop]]  https://esolangs.org/w/index.php?diff=65743&oldid=65742 * InfiniteDonuts * (-15) /* Introduction */
13:54:28  [[Flop]] M https://esolangs.org/w/index.php?diff=65744&oldid=65743 * InfiniteDonuts * (+0) /* A Brief Tutorial */
13:57:34  [[Flop]]  https://esolangs.org/w/index.php?diff=65745&oldid=65744 * InfiniteDonuts * (-136) 
13:57:57  [[Flop]] M https://esolangs.org/w/index.php?diff=65746&oldid=65745 * InfiniteDonuts * (+9) /* Introduction */
14:00:33  [[Flop]]  https://esolangs.org/w/index.php?diff=65747&oldid=65746 * InfiniteDonuts * (-99) 
14:01:35  [[Flop]] M https://esolangs.org/w/index.php?diff=65748&oldid=65747 * InfiniteDonuts * (+0) /* A Brief Tutorial */
14:13:29  perhaps Stephen Wolfram's ideas presented in "A New Kind of Science" can provide useful insight for your endeavour
14:22:42  [[User:Orby]]  https://esolangs.org/w/index.php?diff=65749&oldid=60360 * Orby * (+12) 
14:39:37 -!- heroux has quit (Ping timeout: 245 seconds).
14:40:29 -!- heroux has joined.
15:34:38  [[Flop]] M https://esolangs.org/w/index.php?diff=65750&oldid=65748 * InfiniteDonuts * (-2900) 
15:34:57  [[PATH]]  https://esolangs.org/w/index.php?diff=65751&oldid=65653 * InfiniteDonuts * (-54) /* Variations */
15:35:11  [[SNUSP]]  https://esolangs.org/w/index.php?diff=65752&oldid=65651 * InfiniteDonuts * (-39) /* See also */
15:35:41 -!- ais523 has joined.
15:36:09  cpressey: have you seen recursive ascent parsers? it's basically the open-coded version of LR, but much easier to understand than the table-driven version
15:37:01 -!- arseniiv has quit (Read error: Connection reset by peer).
15:37:59  the basic idea is that whenever you have a grammar ambiguity that can't immediately be resolved with your lookahead symbols but can be resolved later, you call a function that can parse either of the two things you want to be able to parse, and returns which of the two it parsed
15:38:30  (occasionally you'll need multiple functions that disambiguate in different ways depending on what comes next, but that's rare)
15:43:45  No, I haven't
15:48:07  You could also fall back to something like CYK for the non-LL parts (overkill, of course)
15:48:13  Unfortunately must be off.
15:48:17 -!- cpressey has quit (Quit: A la prochaine.).
15:49:30 -!- arseniiv has joined.
15:50:15  just use s-expressinos
15:52:51  for what? the language you're parsing? that doesn't work too well if you don't control the format
15:53:06  even when you do, s-expressions tend to have some amount of variety in what constants they support
15:53:43  I've been working with SMT2 recently, whose syntax is a proper subset of Common Lisp's (although the semantics are quite different), and it can be hard to find off-the-shelf parsers for it even though it's just s-expressions
15:53:57  due to things like #x1234 as a hexadecimal number
15:54:11  that's a frustrating problem
15:54:35  i feel like lisp and s-expressions has more potential but kind of flopped because of issues like the one you state
15:55:04  lisp is basically designed to be manipulated by lisp code, it isn't really designed to be manipulated by code in arbitrary other languages
15:58:14  i would design READ to be based on a list of regexes
15:58:22  for the tokens
16:02:16  (there's also the problem that SMT2 is very strongly typed, so, e.g., #x00 and #x0000 are constants of different type, the former is 8 bits wide, the latter 16 bits wide; this is something a generic parser is unlikely to tell you about)
16:03:06  ah yes you would definitely need a custom reader for that
16:13:42  in general I think the idea of a generic parser that handles a wide range of languages wouldn't really work, languages' semantics often ends up being mirrored in the syntax
16:15:54 * ais523 tries to imagine what a sexpy version of Incident would look like
16:15:56  I don't think it works
16:27:02 -!- ais523 has quit (Remote host closed the connection).
16:28:03 -!- ais523 has joined.
16:34:03 -!- ais523 has quit (Remote host closed the connection).
16:35:17 -!- ais523 has joined.
16:43:44 -!- Lord_of_Life_ has joined.
16:46:28 -!- Lord_of_Life has quit (Ping timeout: 258 seconds).
16:46:41 -!- Lord_of_Life_ has changed nick to Lord_of_Life.
17:25:40 -!- Phantom_Hoover has joined.
17:27:22  [[Hello world program in esoteric languages]]  https://esolangs.org/w/index.php?diff=65753&oldid=65697 * Dtuser1337 * (+110) /* Macmac */  new lang and removing newline as a shortcut.
17:33:14 -!- b_jonas has joined.
17:35:47  [[Hello world program in esoteric languages]]  https://esolangs.org/w/index.php?diff=65754&oldid=65753 * InfiniteDonuts * (-404) 
17:38:52  hi all
17:39:41  hi
18:01:30  [[User talk:Language]] M https://esolangs.org/w/index.php?diff=65755&oldid=60717 * Dtuser1337 * (+1) Moving category to the bottom
18:04:46 -!- FreeFull has joined.
18:05:18  hello b_jonas 
18:05:20  what's new?
18:07:12  [[A]]  https://esolangs.org/w/index.php?diff=65756&oldid=60788 * Dtuser1337 * (+23) Rerorerorerorero
18:11:39  [[RISBF]]  https://esolangs.org/w/index.php?diff=65757&oldid=56849 * Dtuser1337 * (+18) I Love You Kitchen Gun :D
18:32:14  chkdsk eats memory like crazy :o
18:32:25  it has to
18:32:45  well, depending on what parameters you start it with, obviously
18:32:53  because it has to hold the entire filesystem metadata in memory?
18:33:09  but it has to check for, like, blocks that are marked as occupied but to which nothing points, or inconsistent forwards-backwards pointers or cycles
18:33:13  which could be anywhere in the file system
18:33:15  (b_jonas: /F /R /X /I /C)
18:33:24  arseniiv: oh, this is on Windows?
18:33:29  yeah
18:33:39  makes sense, it's not called chkdsk on unixen
18:33:42  it's called fsck
18:35:27  though I bet it could understand something like -f -r -x but I just copied the forms given in the help message
18:36:05  it’s quite scary when low on memory
18:36:33  apps crash, the screen turned black for some time for an unknown reason
18:37:04  I don't run apps
18:37:13  I don't use a smartphone
18:37:20  I only run programs, and put my files into directories
18:37:51  :D I mean, various software for entertaining purposes like skype or streamWriter
18:38:42  (don’t ask me why skype is here. I don’t know either)
18:39:03  well I do use skype
18:39:11  but only the windows version, not the mobile phone version
18:39:22  I use it because it lets me call some co-workers and relatives
18:40:22  I meant the first one here, though I had to install the second to be able to chat with people for chatting who with the first skype remains
18:40:41  I don't understand that
18:40:47  what?
18:40:54  install the mobile version to do what?
18:41:31  basically to do what I do with the first one
18:41:45  though I wanted to test the grammar a bit
18:43:21  we had tested several different messengers out there these times and hadn’t migrate properly to any of them yet, so it’s skype for a while
18:43:51  the people I know use like four different ones
18:44:00  though it visibly degraded as a group chat software
18:45:46  it upgraded in several regards, but many bugs were introduced, and sufficiently much of functionality, removed
18:46:47  I know. you can no longer just invite another person by skype username. you have to do a search, which searches in all fields, and then choose the person with the given skype username, and you can't even easily tell the skype username, only the displayed name, you have to get some hidden properties box to find it out.
18:48:15  you could probably DOS a user by registering thirty users with the same displayed name and avatar picture (and changing those to follow that person), because nobody would be able to invite them then
18:48:28  and also I want to complain about widespread lack of support of composite fonts. It’s a pretty simple concept in light of modern font rendering libraries, and still does it appear so rarely in the software with multilingual potential like chat things not based on web browsers
18:49:13  b_jonas: oh
18:49:36  anything I say about skype might be imprecise of course, because it may have changed ten updates ago
19:07:07 -!- tromp_ has quit (Remote host closed the connection).
19:33:37 -!- xkapastel has quit (Quit: Connection closed for inactivity).
19:42:45 -!- ais523 has quit (Quit: quit).
19:44:45 -!- tromp has joined.
19:49:17 -!- tromp has quit (Ping timeout: 252 seconds).
19:51:15 -!- tromp has joined.
19:52:51 -!- tromp_ has joined.
19:55:31 -!- tromp has quit (Ping timeout: 252 seconds).
19:57:21 -!- tromp_ has quit (Ping timeout: 252 seconds).
19:59:31 -!- arseniiv_ has joined.
20:00:53 -!- arseniiv has quit (Ping timeout: 245 seconds).
20:11:42 -!- aloril_ has quit (Ping timeout: 245 seconds).
20:35:23 -!- Lord_of_Life_ has joined.
20:38:32 -!- Lord_of_Life has quit (Ping timeout: 272 seconds).
20:39:50 -!- Lord_of_Life_ has changed nick to Lord_of_Life.
20:41:27 -!- xkapastel has joined.
20:42:02 -!- Vorpal has quit (Remote host closed the connection).
20:47:58 -!- Vorpal has joined.
20:50:05  [[Brainfuck]]  https://esolangs.org/w/index.php?diff=65758&oldid=65738 * PaniniTheDeveloper * (+5) 
20:50:10 -!- aloril has joined.
20:58:41  [[Befunge]]  https://esolangs.org/w/index.php?diff=65759&oldid=65667 * PaniniTheDeveloper * (+80) 
21:00:28 -!- Cale has quit (Ping timeout: 276 seconds).
21:04:08 -!- hppavilion[1] has joined.
21:12:21 -!- Cale has joined.
21:25:01  I read a neat problem just now: given a small segment of a conic, how do you distinguish is it a circle, an ellipse, a parabola or a hyperbola?
21:25:07 -!- arseniiv_ has changed nick to arseniiv.
21:26:42  maybe someone not knowing it prior, would be interested to solve it for themselves or openly. I have already spoilered myself into a part of the solution so I don’t count
21:31:08  arseniiv: should I tell the solution, or would you just like to figure it out yourself?
21:35:15 -!- AnotherTest has quit (Ping timeout: 252 seconds).
21:35:41  as you wish; I see at least two avenues: using foci and something related or drawing a cartesian coordinate system, taking coordinates of several points and then calculating some invariants. I don’t remember particularities of either except one thing about optics
21:36:41  hopefully we won’t spoil it for anybody interested
21:36:57  b_jonas: ^
21:37:05  arseniiv: what I'd do is to just the sort of brute force way, which is to compute the parameters of the quadratic form of the conic from five points on the arc. 
21:37:28  so the second way then
21:37:37  there's a nice easy but not very well known way to do that efficiently that is described in the yellow geometry book that I bought only this year, which I can tell if you want.
21:38:02  something determinant-y?
21:38:23  it would probably be possible to do something more geometric, that is, going most of the way with a straightedge construction to find points on the involution that the conic implies on the ideal line, 
21:38:55  but I don't think that helps, because that's the sort of theoretical construction that you either couldn't do in real life, or only engineers could do in real life and I'm not an engineer
21:39:15  arseniiv: something matrix-y, yes
21:40:26  I am aligned more to the second, algebraic/computational way here, too. I’m profound in forgetting essential theorems of synthetic geometry needed for the first path
21:40:41 -!- tromp has joined.
21:40:47  this is one that you can't forget once you learn about it, it's a beautiful method
21:40:58  it's a pity I hadn't learned it earlier
21:41:27  b_jonas: like, some 5th-order matrix? or less, 3rd order, something from projective linear algebra?
21:41:52  yes, you have to solve a rank 5 linear equation
21:43:08  hm, with a row for every point?
21:43:34  take the 6x5 matrix where each row is [x0**2, x1**2, x2**2, 2*x0*x1, 2*x0*x2, 2*x1*x2] where [x0, x1, x2] is a coordinate for a point, one row per point
21:44:30  oh, homogeneous coordinates, makes sense
21:45:06  and what is the right part and what are unknowns here?
21:46:26  it's 6x5, so you solve for a nonzero vector orthogonal to each row
21:46:53  if that vector is [a00, a11, a22, a01, a02, a12], then its components give the quadratic form
21:47:51  this works because [a00, a11, a22, a01, a02, a12]^T*[x0**2, x1**2, x2**2, 2*x0*x1, 2*x0*x2, 2*x1*x2] is exactly the equation of the conic
21:48:04  = 0 obviously
21:49:01  hm neat
21:49:30  so once you have that, just check the sign of the determinant of [a00,a10;a01,a11] to tell if it's a hyperbola
21:50:08  this one even lets you make this more numerically stable if you take more than five points
21:50:35  oh! this part is great
21:50:41  that is, if you have a lot of sample points but each one has some error
21:50:57  hyperbole is totally on topic for this channel.
21:52:19  and then, I guess, we can take four points and deduce something like “the most  quadratic form” using least squares to solve the underdetermined system
21:52:54  I would like to note that it gets much harder to find the conic if you have three points and two tangents. Apart from degenerate cases, there are always exactly four real solutions or no real solutions. It was REALLY not obvious to me why there can't be exactly two solutions.
21:52:55  (or three points, but that would be more boring probably)
21:53:49  int-e: how about parables?
21:54:12  and I presume ellipsis is…
21:54:36  (hopefully we wouldn’t talk in circles)
21:54:51  Four points and one tangent is easier. Apart from degenerate cases, there are zero or two possible conics; there's an easy way to test which one of those is the case; and a not too hard way to solve the conic, though harder than for five points. 
21:55:38  The yellow book actually describes the case of computing a conic from four points and one tangent, but it doesn't even mention the more tricky case of three points and two tangents. 
21:55:48  I only know about that one from the wob.
21:56:05  If you want me to spoil some of that later, you can ask me.
21:56:05  (from what?)
21:56:15  okay!
21:56:17  arseniiv: parables seem to be rare. Ellipses on the other hand...
21:56:38  `quote parable
21:56:39  1060)  ah yes, like the parable of jesus feeding the masses with expired jell-o
21:56:49  b_jonas: though currently I’m not interesting in going on a tangent
21:56:54  `grWp parable
21:56:56  No output.
21:56:59  roflwut
21:57:05  The yellow book is Richter Gerbert: "Perspectives on Projective Geometry", Springer (2019). It was one of the best purchases I've done this year.
21:57:25  b_jonas: is that a pun
21:57:42  int-e: is what a pun?
21:57:57  perspective in connection with projective geometry
21:58:05  yes, the book title is a pun
21:59:29  The other three geometry reference books on my shelf next to this one tell very little of this stuff, though they do tell some other useful info.
21:59:43  I guess there's a certain pun potential in "purchase", but it's not realized in your statement.
22:00:05  The Hajós does tell some of the basics, like about the equation of comics in general and classifying them.
22:00:40  int-e: well yes, I rarely make English puns
22:02:44  my hon. and learned friend fungot, has SGDQ 2019 started yet?
22:02:44  b_jonas: unless it uses recursion or something. " i'll let you know
22:02:55  oh thanks, that'll be great
22:03:06  some of the games may have recursion
22:04:11 -!- tromp has quit (Remote host closed the connection).
22:04:14  anyway, good night to all
22:04:16 -!- b_jonas has quit (Quit: leaving).
22:04:32  fungot: maybe you also do know when my chkdsk will finish, too?
22:04:32  arseniiv: the package name, obviously. ( wondering why i thought it was c, i don't see
22:05:06  hm they too make puns, about seeing C, but none about chkdsk
22:06:04  mmm chkdsk
22:06:34  (chkdsk should just fsck off)
22:06:44  (it's not good, but it's a pun)
22:07:25 -!- hppavilion[1] has quit (Ping timeout: 268 seconds).
22:17:31 -!- tromp has joined.
22:18:11  int-e: lol
22:19:43  ah, I was going to suggest a thing and then forgot it
22:20:05  hyperbolic good, parabolic good and elliptic good!
22:20:20  or evil
22:21:06  or maybe the other way: lawful ellipse, chaotic ellipse and what is the other… neutral ellipse
22:24:42  hm speaking of what, I’ve seen a 3×3 table of planar geometries in a geometric book. One axis was how angles behave (elliptic, parabolic, hyperbolic) and the other was the more known one, whether the quadratic form is ++ euclidean, +0 “galilean” (how is it called?) or +− pseudoeuclidean
22:25:06  those are the only ones with some properties, I don’t remember which ones
22:25:37  for instance, they are all constant-curvature
22:26:10  oh wait I mixed something up
22:26:46  how the angles behave is precisely what is the signature of the quadratic form, it was some other property
22:29:02  for example, euclidean-0 should be the usual euclidean plane, euclidean-+ should be the elliptic plane and euclidean-− should be the hyperbolic plane
22:30:01  yes it should be the sign of the constant curvature, though I don’t remember if it was defined in this way, and certainly the curvature wasn’t defined there for a general case
22:30:15  okay I’m done
22:32:53  [[User:SoundOfScripting]] M https://esolangs.org/w/index.php?diff=65760&oldid=65719 * SoundOfScripting * (-21) Okay now I can be dormant again.
22:37:47 -!- hppavilion[1] has joined.
22:48:14 -!- FreeFull has quit.
23:25:58 -!- tromp has quit (Remote host closed the connection).
23:54:45 -!- Phantom_Hoover has quit (Quit: Leaving).
23:59:01 -!- tromp has joined.

2019-08-29:

00:03:23 -!- tromp has quit (Ping timeout: 252 seconds).
00:10:08 -!- hppavilion[1] has quit (Ping timeout: 268 seconds).
00:20:17 -!- xkapastel has quit (Quit: Connection closed for inactivity).
00:28:12  [[Talk:Zahlen]] N https://esolangs.org/w/index.php?oldid=65761 * A * (+276) Created page with "==Questions== What is the difference between a set and a list in Zahlen, and how to push logical/set/list values onto the stack? --~~~~"
00:32:11 -!- xkapastel has joined.
00:42:17  [[Hello world program in esoteric languages]] M https://esolangs.org/w/index.php?diff=65762&oldid=65754 * Dtuser1337 * (+1) /* Log */  Nani!? I added space???
00:45:56  [[Unicat]]  https://esolangs.org/w/index.php?diff=65763&oldid=44887 * Dtuser1337 * (+18) 
00:48:51  [[Blackspace]] M https://esolangs.org/w/index.php?diff=65764&oldid=65618 * A * (+290) 
00:49:37  [[Talk:Zahlen]] M https://esolangs.org/w/index.php?diff=65765&oldid=65761 * A * (-56) 
00:56:52 -!- arseniiv has quit (Quit: gone completely :o).
01:08:17 -!- HackEso has quit (Remote host closed the connection).
01:08:55 -!- HackEso has joined.
01:30:32 -!- tromp has joined.
01:30:45  [[User:Trickbrain26]] N https://esolangs.org/w/index.php?oldid=65766 * Trickbrain26 * (+16) Created page with "I love Esolangs:"
01:32:55  [[User:Trickbrain26]]  https://esolangs.org/w/index.php?diff=65767&oldid=65766 * Trickbrain26 * (+55) 
01:35:25 -!- tromp has quit (Ping timeout: 276 seconds).
01:52:01 -!- Sgeo has joined.
01:53:48 -!- Sgeo_ has quit (Ping timeout: 245 seconds).
02:38:28 -!- nfd9001 has quit (Ping timeout: 276 seconds).
02:40:17 -!- xkapastel has quit (Quit: Connection closed for inactivity).
03:16:05  [[Zahlen]] M https://esolangs.org/w/index.php?diff=65768&oldid=60322 * A * (+1096) /* Miscellaneous operators */
03:16:40  [[Zahlen]] M https://esolangs.org/w/index.php?diff=65769&oldid=65768 * A * (+30) /* Examples */
03:18:35 -!- adu has joined.
03:18:43 -!- tromp has joined.
03:23:13 -!- tromp has quit (Ping timeout: 252 seconds).
03:35:10  [[Zahlen]] M https://esolangs.org/w/index.php?diff=65770&oldid=65769 * A * (+332) /* Digital root calculator */ Average
04:30:27  [[Pyth]] M https://esolangs.org/w/index.php?diff=65771&oldid=54848 * A * (+124) 
04:39:30 -!- iczero has changed nick to webpack.
05:55:57  [[Special:Log/newusers]] create  * CarlosLuna *  New user account
06:02:28  [[Esolang:Introduce yourself]] M https://esolangs.org/w/index.php?diff=65772&oldid=65740 * CarlosLuna * (+363) /* Introductions */
06:05:09  [[Zahlen]]  https://esolangs.org/w/index.php?diff=65773&oldid=65770 * A * (+132) /* Examples */
06:06:34  [[Zahlen]] M https://esolangs.org/w/index.php?diff=65774&oldid=65773 * A * (+42) /* Examples */
06:08:53  [[///]]  https://esolangs.org/w/index.php?diff=65775&oldid=52040 * CarlosLuna * (+86) /* Implementation */
06:19:23 -!- nfd9001 has joined.
07:07:26 -!- ArthurStrong has joined.
07:11:44 -!- cpressey has joined.
07:39:25 -!- tromp has joined.
08:09:36 -!- AnotherTest has joined.
08:32:03 -!- tromp has quit (Remote host closed the connection).
08:36:21 -!- AnotherTest has quit (Ping timeout: 252 seconds).
08:38:53 -!- Lord_of_Life has quit (Ping timeout: 268 seconds).
08:39:31 -!- Lord_of_Life has joined.
08:46:13 -!- tromp has joined.
08:55:21 -!- AnotherTest has joined.
09:52:34  [[Salt]] M https://esolangs.org/w/index.php?diff=65776&oldid=65695 * A * (-22290) It's all trash, I'm gonna redo it.
10:00:42 -!- wob_jonas has joined.
10:02:15  can't
10:02:18  `? can't
10:02:21  can't is the most frequent word whose pronunciation varies between /ɑː/ and /æ/ depending on dialect. A list is: advance after answer ask aunt brass can't cast castle chance class command dance demand disaster draft enhance example fast glass graph grass half last laugh mask master nasty pass past path plant rather sample shan't staff task vast
10:04:41  `learn can't is the most frequent word whose pronunciation varies between /ɑː/ and /æ/ depending on dialect. A list is: advance, advantage, after, answer, ask, aunt, branch, can't, cast, castle, chance, class, craft, command, contrast, dance, demand, disaster, draft, enhance, example, fast, glass, glance, grant, graph, grass, half, last, laugh, mas
10:04:42  k, master, nasty, pass, past, path, photograph, plant, rather, sample, shan't, staff, task, vast
10:04:44  Relearned 'can't': can't is the most frequent word whose pronunciation varies between /ɑː/ and /æ/ depending on dialect. A list is: advance, advantage, after, answer, ask, aunt, branch, can't, cast, castle, chance, class, craft, command, contrast, dance, demand, disaster, draft, enhance, example, fast, glass, glance, grant, graph, grass, half, last, laugh, mas
10:04:48  `learn can't is the most frequent word whose pronunciation varies between /ɑː/ and /æ/ depending on dialect. A list is: advance, advantage, after, answer, ask, aunt, branch, can't, cast, castle, chance, class, craft, command, contrast, dance, demand, disaster, draft, enhance, example, fast, glass, glance, grant, graph, grass, half, last, laugh, mas
10:04:49  k, master, nasty, pass, past, path, photograph, plant, rather, sample, shan't, staff, task, vast.
10:04:49  Relearned 'can't': can't is the most frequent word whose pronunciation varies between /ɑː/ and /æ/ depending on dialect. A list is: advance, advantage, after, answer, ask, aunt, branch, can't, cast, castle, chance, class, craft, command, contrast, dance, demand, disaster, draft, enhance, example, fast, glass, glance, grant, graph, grass, half, last, laugh, mas
10:04:52  `? can't
10:04:53  can't is the most frequent word whose pronunciation varies between /ɑː/ and /æ/ depending on dialect. A list is: advance, advantage, after, answer, ask, aunt, branch, can't, cast, castle, chance, class, craft, command, contrast, dance, demand, disaster, draft, enhance, example, fast, glass, glance, grant, graph, grass, half, last, laugh, mas
10:04:57  hmm, too long
10:05:59  `learn can't is the most frequent word whose pronunciation varies between /ɑː/ and /æ/ depending on dialect. A list is: advance, advantage, after, answer, ask, aunt, branch, can't, cast, chance, class, craft, command, contrast, dance, demand, disaster, draft, enhance, example, fast, glass, glance, grant, graph, grass, half, last, laugh, mask, maste
10:05:59  r, pass, past, path, photograph, plant, rather, sample, shan't, staff, task, vast.
10:06:04  still way too long
10:06:06  Relearned 'can't': can't is the most frequent word whose pronunciation varies between /ɑː/ and /æ/ depending on dialect. A list is: advance, advantage, after, answer, ask, aunt, branch, can't, cast, chance, class, craft, command, contrast, dance, demand, disaster, draft, enhance, example, fast, glass, glance, grant, graph, grass, half, last, laugh, mask, maste
10:06:43  help
10:07:11  half a screen of HackEso spam
10:08:02  `learn can't is the most frequent word whose pronunciation varies between /ɑː/ and /æ/ depending on dialect. A list is: advance, advantage, after, answer, ask, aunt, branch, can't, cast, chance, class, craft, command, contrast, dance, demand, draft, enhance, example, fast, glass, glance, grant, half, last, laugh, mask, master, pass, past, path, pho
10:08:02  tograph, plant, rather, sample, shan't, staff, task.
10:08:12  Relearned 'can't': can't is the most frequent word whose pronunciation varies between /ɑː/ and /æ/ depending on dialect. A list is: advance, advantage, after, answer, ask, aunt, branch, can't, cast, chance, class, craft, command, contrast, dance, demand, draft, enhance, example, fast, glass, glance, grant, half, last, laugh, mask, master, pass, past, path, pho
10:08:19  nah, still way too long
10:08:43  can't you figure out what the right length is and then just type that one line in
10:08:49  this is a denial of service attack on me
10:09:05  shachaf: then you or oerjan will complain that I edit entries outside the channel... ok wait
10:12:00  `? can't
10:12:02  can't is the most frequent word whose pronunciation varies between /ɑː/ and /æ/ depending on dialect. A list is: after, answer, ask, class, dance, example, fast, glass, half, last, laugh, pass, past, plant, rather, staff.
10:12:56  sorry, you're right about the smap
10:12:57  spam
10:27:04 -!- arseniiv has joined.
11:26:56  `? cannot
11:26:57  cannot? ¯\(°​_o)/¯
11:41:54  `? spam
11:41:55  Spam is a delicious meat product. See http://www.spamjamhawaii.com/
11:42:10  `? Turing
11:42:11  Turing is what you are doing when you Tur.
11:43:27  `? Curry
11:43:28  Curry? ¯\(°​_o)/¯
11:43:32  `? Haskell
11:43:33  Unbound implicit parameter (?haskell::Wisdom) \   arising from a use of implicit parameter `?haskell'
11:43:48  `? Church
11:43:49  Church invented a sane model of computation, but Turing was better with marketing, so now theoretical computer science defines everything based on obsolate hardware like tape recorders.
11:43:58  `? Post
11:43:59  Post? ¯\(°​_o)/¯
11:44:25  `? Emil
11:44:26  Emil? ¯\(°​_o)/¯
11:45:30  `? Kleene
11:45:31  Kleene? ¯\(°​_o)/¯
11:47:38  `? randomness
11:47:39  randomness? ¯\(°​_o)/¯
11:47:41  `? random
11:47:42  random? ¯\(°​_o)/¯
11:47:56  `? arity
11:47:57  arity? ¯\(°​_o)/¯
11:47:59  `? tuple
11:48:00  tuple? ¯\(°​_o)/¯
11:49:07  `? Scheme
11:49:08  Scheme? ¯\(°​_o)/¯
11:49:12  `? Lisp
11:49:13  Lisp? ¯\(°​_o)/¯
11:49:24  `? entropy
11:49:25  entropy? ¯\(°​_o)/¯
11:50:25  `? GitHub
11:50:28  GitHub? ¯\(°​_o)/¯
11:51:06  `? monotonicity
11:51:07  monotonicity? ¯\(°​_o)/¯
11:52:00  `? IRC
11:52:04  IRC is short for "Internet Relay Chat". It is named so because all the servers are constructed from relays.
11:52:29  `? transducer
11:52:30  transducer? ¯\(°​_o)/¯
11:52:50  `? tty
11:52:51  tty? ¯\(°​_o)/¯
11:53:01  cpressey, you're here
11:53:25  cpressey: the definitions in https://github.com/catseye/Robin/blob/master/stdlib/cmp.robin#L147 don't seem right
11:53:28  Yes, I've decided to make my presence known by generating pages of HackEso spam
11:54:12 -!- Vorpal has quit (Ping timeout: 245 seconds).
11:54:37  wob_jonas: feel free to suggest another test case
11:59:30  very very pedantically, I think they should have different names (gte? gt? lte? lt?) but I'm sure that's not what you're referring to
11:59:49  cpressey: I don't have a problem with the names
11:59:57  cpressey: is it supposed to be a signed integer comparison?
12:00:12  and how do I input negative integers in Robin S-expressions?
12:01:07  wob_jonas: yes, and (subtract 0 10) is how you can say -10
12:01:25  cpressey: can't I just directly input -10 ? would be so much easier
12:01:31  oh well
12:01:35  Robin is not into "easier"
12:03:37  anyway, then (assert (> 6 4)) (assert (> 1610612736 (subtract 0 1610612736)))
12:04:12  (assert (equal? #f (> (subtract 0 1610612736) 1610612736)))
12:05:46  I don't complain about the name because the names similar to what lisps have, so they fit your general naming scheme
12:08:30  There may be problems with large numbers.
12:09:15  cpressey: then either fix that or document that
12:10:07  wob_jonas: I'm working on 0.4 now, I'll put it in the queue. Thanks for the report.
12:10:32  (display (subtract 1610612736 (subtract 0 1610612736))) ; it says -1073741824
12:11:29 -!- Sgeo_ has joined.
12:12:10  ^ that seems correct
12:14:38 -!- Sgeo has quit (Ping timeout: 245 seconds).
12:15:27  > (1610612736 :: Int32) - ((0 :: Int32) - (1610612736 :: Int32))
12:15:29   -1073741824
12:18:20  I guess it could compare sign first, + > -, then only if signs the same do the subtract
12:19:48 -!- ArthurStrong has left.
12:22:14  `? unsigned
12:22:15  unsigned? ¯\(°​_o)/¯
12:24:26  `? signed
12:24:27  signed? ¯\(°​_o)/¯
12:24:41  `grwp sign
12:24:43  absolute value:The absolute value of a number, also known as its cosign, is its distance from zero regardless of direction. It shouldn't be negative, but Sgeo is trying to break maths. \ ciol:ciol is a language designed by moon_, it started as a scheme to annoy colleagues by making a programming language that has insults as commands. \ color:Color is a phenomenon from outer space designed to
12:24:46  `? char
12:24:47  Char is a prominent component of charcoal.
12:25:09  `? long
12:25:10  Long is the Chinese word for dragon.
12:33:26  `? float
12:33:27  float? ¯\(°​_o)/¯
12:45:24 -!- adu has quit (Quit: adu).
13:16:00  `? short
13:16:01  short? ¯\(°​_o)/¯
13:16:04  `? volatile
13:16:08  volatile? ¯\(°​_o)/¯
13:16:15  `? register
13:16:16  register? ¯\(°​_o)/¯
13:16:27  `? const
13:16:28  const? ¯\(°​_o)/¯
13:17:41  what's this game? whoever gets the longest streak of wisdom-non-entries wins?
13:39:40  `? int-e
13:39:40  int-e är inte svensk. Hen kommer att spränga solen. Hen står för sig själv. Hen gillar inte färger, men han gillar dissonans. Er hat ein Hipster-Spiel gekauft.
13:45:53  `? wisdom
13:45:54  wisdom is always factually accurate, except for this entry, and, uh, that other one? It started with, like, an ø?
13:55:16 -!- wmww has quit (Ping timeout: 248 seconds).
13:55:25 -!- wmww has joined.
13:55:49 -!- ivzem[m] has quit (Ping timeout: 248 seconds).
13:55:49 -!- tswett[m] has quit (Ping timeout: 248 seconds).
13:56:24 -!- ivzem[m] has joined.
13:56:42 -!- ineiros has quit (Ping timeout: 245 seconds).
13:57:12 -!- fungot has quit (Ping timeout: 252 seconds).
13:58:40 -!- ineiros has joined.
14:01:03 -!- tswett[m] has joined.
14:03:18 -!- fungot has joined.
14:13:30  wob_jonas: https://github.com/catseye/Robin/blob/develop-0.4/stdlib/cmp.robin
14:14:30  If you can find another hole in it, I will take that as a sign that I should start learning to use QuickCheck.
14:16:59  You should of course do that anyway, QuickCheck is pretty great.
14:19:21  I should.
14:26:16  `? color
14:26:17  ​Color is a phenomenon from outer space designed to drive humanity insane and bring forth the new age of Cthulhu.
14:26:40  ctholor
14:28:01  cpressey: that's still not good
14:28:09  let me get you the failing case
14:30:15  cpressey: (assert (> 0 (subtract (subtract 0 1073741824) 1073741824)))
14:31:38  sigh, ok, zero
14:32:12  (who cares about zero. it's not even a real number. nobody will use it in real calculations. real calculations involve real numbers.)
14:33:48  Well, I guess I'll be setting up QuickCheck tomorrow, although how (or if) I'm going to integrate it with this language, I don't know
14:34:08  can't you call into this language from Haskell?
14:34:48  I'm not sure if QuickCheck really helps here though
14:34:52  The first version had unbounded Integers, where none of this would be an issue, but then I was like "Oh I want this to conceivably be simple to implement in assembly" like an idiot
14:36:26  I can certainly test it from Haskell, but I'd somewhat rather not have the tests be written in Haskell
14:36:36  cpressey: then add arithmetic primitives. they don't really make the interpreter more complex, nor make the language harder to learn. the number of primitives isn't really the important thing you want to optimize for.
14:37:21  The number of primitives is exactly what this language optimizes for.
14:37:35  I could just stop working on it.
14:38:12  :-(
14:58:19 -!- cpressey has quit (Quit: A la prochaine.).
15:29:11 -!- webpack has changed nick to iczero.
15:33:46 -!- atslash has quit (Quit: Leaving).
15:42:05 -!- atslash has joined.
16:04:15  `? can't
16:04:17  can't is the most frequent word whose pronunciation varies between /ɑː/ and /æ/ depending on dialect. A list is: after, ask, last, answer, class, half, pass, past, path, rather, dance, example, fast, glass, laugh, plant, staff, advance, advantage, branch, cast, chance, contrast, demand, glance, grant, master, photograph, sample, task, aunt, basket, bath, command, disaster, draft, draught, enhance, grass, laughter, mask, vast.
16:04:21  better
16:28:56 -!- ais523 has joined.
16:29:20  wob_jonas: ?? my parents have different accents and would disagree as to the pronunciation of almost all those words, but agree on "can't"
16:29:30  does anyone actually pronounce it as "cant"?
16:35:29  ais523: yes, both pronunciations exist. see file:///D:/ambrus/a/refe/dict/alan-pron/CAAPR-ref.html which gives /ɑː/ as the british and /æ/ as the american pronunciation for all these words; https://english.stackexchange.com/q/276763/ ; https://en.wiktionary.org/wiki/can%27t  
16:35:42  ais523: but not everyone pronounces all these words with the same vowel
16:37:05  oh, I see, US versus British English
16:37:20  almost all those words vary between dialects within British English, but "can't" is much more consistent
16:37:25  ais523: I once asked, if someone pronounces both "can" with a /æ/, then how do they distinguish between "can't dance" and "can dance". one person replied that they always pronounce "can" the verb with an unstressed vowel
16:37:26  so it seems weird putting them on the same list
16:37:41  ais523: it's not quite just US versus british. some british people use one vowel, some the other
16:37:52  there's a split within british pronunciation
16:38:02  wob_jonas: on most of those words, just not (as far as I know) on "can't"
16:38:20  hmm
16:38:24  fwiw, even if "can" and "can't" use the same vowel, you can tell them apart by the presense of the "t"
16:38:29  which is not silent or anything
16:38:30  possible
16:38:51  ais523: that's why I'm giving an example with a "t" or "d" following it, as in "can't dance"
16:39:02  in which case the extra "t" is hard to hear
16:39:34  you'd have to leave a gap between the words, English does a lot of flowing one word into the next but t…d is one situation where you really can't
16:40:55  ais523: that sounds nice in theory, but when I actually listen to English, some speakers don't seem to put a pause, which sometimes makes "can't" followed by a "t" or "d" confusing to me
16:41:28  well, it's hard to come up with generic rules for pronouncing English
16:41:38  people will do their own thing no matter what, and some accents are more or less unintelligible
16:41:49  it's possible that "can't" works differently from the other words, I just don't notice that because I don't follow all these accents
16:41:59  generally speaking, for pretty much any word, you can find someone who pronounces any given vowel in it as pretty much any other vowell
16:42:05  (this is an exaggeration but not much of one)
16:42:19  yeah
16:42:58  afk, I have to shed my wo
16:43:04 -!- wob_jonas has quit (Remote host closed the connection).
16:43:25 -!- ais523 has quit (Quit: quit).
17:04:45 -!- FreeFull has joined.
17:07:59  [[Talk:TwoFiftyFive]] M https://esolangs.org/w/index.php?diff=65777&oldid=53835 * SoundOfScripting * (+15) changed signature
17:22:04 -!- Phantom_Hoover has joined.
17:40:35 -!- Sgeo_ has quit (Read error: Connection reset by peer).
17:41:00 -!- Sgeo_ has joined.
17:42:11 -!- b_jonas has joined.
18:06:47  It's the pronunciation of the 'a' which lets you tell apart "can dance" from "can't dance" even if the latter is slurred together.
18:07:23  i think they're identical for me?
18:09:45  If I'm pronouncing things slowly, the a's are identical, but when I'm speaking very quickly, the 'a' in "can" becomes just ə or elided altogether.
18:10:03  But that doesn't happen with "can't"
18:24:23  mm maybe
18:24:27  hard fo me to tell
18:24:31  when i'm paying attention
18:32:17  kmc: you can't tell or you can tell?
18:32:47  :P
18:36:30  ais523: how does the word "shan't" behave then?
18:38:13  [[List of ideas]]  https://esolangs.org/w/index.php?diff=65778&oldid=61782 * InfiniteDonuts * (+47) /* Music */
19:17:16 -!- nfd9001 has quit (Read error: Connection reset by peer).
19:17:40 -!- nfd9001 has joined.
20:32:05 -!- ais523 has joined.
20:32:20  b_jonas: "shan't" has almost died out, I think
20:32:47  the word "shall" is mostly only used in formal contexts nowadays, and eliding it with "not" would only happen in informal speech, so as a result the word is rarely used at all
20:33:00  my best guess is that it works like "can't" but I haven't heard people say it enough to be sure
20:33:01  "Shan't" shan't be pronounced lest you sound like an old fart.
20:33:06  I was once told that "shan't" was very slangy, similar to "ain't".
20:33:36  shachaf: right, this is a bad combination (a very informal phrase containing a word that's only used in formal settings)
20:33:53  "shouldn't" or "mustn't" would be way more common in informal speech nowadays
20:33:56  (or "can't" used incorrectly)
20:34:18  "Thou shan't pass!" just doesn't sound intimidating enough...
20:34:47  surely it should be "thou shalt not pass"?
20:34:57  although hardly anyone can remember how to conjugate "thou" + verb nowadays
20:35:52  ais523: I'm assuming that it would still be contracted to "shan't" for lack of alternatives.
20:36:12  maybe it wouldn't be contracted because there isn't a viable contraction?
20:36:24  Somebody should look this up.
20:36:30  But it won't be me ;-)
20:36:37  I guess the normal grammar rules would give "thou shan'st", but that has the letters in the wrong order
20:36:54  I looked up the conjugation of "shall" after "thou", it does indeed conjugate to "shalt"
20:37:11  So what did they use in the movie, hmm.
20:37:11  Where does the s come from?
20:37:59  shachaf: most "thou" conjugations end -st
20:38:08  "Du gehst." <-- German still has the "st".
20:38:13  but there are a few exceptions, such as "shall" going to "shalt" not "shallst"
20:38:35  Most? I can only think of a few.
20:39:22 -!- Lord_of_Life has quit (Ping timeout: 272 seconds).
20:39:26  Wikipedia lists only six that don't; I'm not sure if that's meant to be an exhaustive list or not
20:39:32  but implies that the vast majority of verbs do
20:39:39  in both present and perfect tense
20:40:05  wait, no, it lists six irregular forms
20:40:10  but some of those /also/ end -st
20:40:55  the regular form is to add -st or -est
20:41:05  Ah, you're right, I was only thinking of the irregular forms for some reason.
20:42:01 -!- ais523 has quit (Quit: sorry for my connection).
20:42:14 -!- ais523 has joined.
20:42:18 -!- Lord_of_Life has joined.
20:42:24  Oh well. The movie has "You shall not pass." What about the book?
20:47:28  ais523: ok, I'll just ignore shan't then
20:48:04  The book has "You cannot pass!"
20:48:31  Spoken, not cried out loud.
20:48:56  I wonder how the "thou shall not pass" phrasing ended up in public consciousness, then? (I remember it specifically as containing a misconjugated verb, but maybe others remember differently/)
20:49:29  that said, "he"/"she"/"it" still exist in modern English, and their conjugations changed from -th to -s at some point
20:49:37  so maybe "thou"'s has also changed
20:49:48  I do sometimes use "shall", but yes, it's rare. I don't think I use "shan't" except in quoting someone else using it (Harry Potter and the PS says, IIRC, in the first chapter, that Dudley has learnt a new word, "shan't". let me check that.)
20:49:54  ais523: movies stick
20:50:07  int-e: but apparently it wasn't in the movie either
20:50:37  b_jonas: it's the sort of word that petulant children might have used in the past
20:50:45  yes, that's what HP says
20:50:45  ais523: https://www.youtube.com/watch?v=mJZZNHekEQw certainly fooled me then
20:51:00  although nowadays you'd expect "won't" instead (modern children are unlikely to learn "shan't" as a word…)
20:51:09  ais523: right, that chapter plays in about 1980
20:51:22   Oh well. The movie has "You shall not pass." What about the book?
20:51:25  hmm
20:51:39  ais523: "cannot" IIRC.. let me check
20:51:52  maybe there's more than one English version of the movie?
20:51:53  b_jonas: I did check, fwiw.
20:51:55  this would be far from unheard of
20:52:14  ais523: https://scifi.stackexchange.com/questions/35262/where-did-you-shall-not-pass-come-from says both the movie and the book says "cannot" (Gandalf)
20:52:23  ais523: maybe
20:52:24  the first Harry Potter book (and thus the corresponding film) has different names in American and British English…
20:52:59  ais523: wait, the film has different names too? really?
20:53:43  b_jonas: not matching the book would surely be a marketing disaster
20:54:08  Would it?
20:55:07  shachaf: maybe ais523 is speaking in jest
20:55:35  I think it'd be survivable but that the people actually marketing it wouldn't want to risk it
20:55:44  ais523: the books were already famous by the time the first movie was released, and "Harry Potter" is enough for recognizability
20:55:50  but let me check
20:56:19  ais523: you're right, the film has different titles too
20:56:22  interesting
20:56:27   Harry Potter and the Philosopher's Stone (released in the United States, India and Pakistan as Harry Potter and the Sorcerer's Stone)
20:56:29  was its dubbing changed too?
20:56:38  my guess is that they recorded the relevant lines multiple times
20:56:41  Ask me about names in the Neverending Story. :P
20:56:52  it wouldn't have been a noticeable amount of extra work for the actors
20:57:11  int-e: Did you read _Jim Knopf_?
20:57:28  What about _Momo_?
20:57:49  (Bastian = Bastian. Atreju = Atreyu. Xayide = Xayeede. Engywuck = Engywook. Fuchur = Falkor. It makes sense, but it did surprise me a lot when I first saw these...)
20:58:10  shachaf: I have not read Jim Knopf. I only know Momo in german.
20:58:47  You haven't read Jim Knopf?!
20:58:57  Did you see the recent movie? I have it on Blu-Ray.
20:59:06  no
20:59:07  Unfortunately I don't have a Blu-Ray reader so I haven't seen it.
20:59:43  (And which of those three books is "the recent movie" based on?)
21:00:18   Because the American title was different, all scenes that mention the philosopher's stone by name had to be re-shot, once with the actors saying "philosopher's" and once with "sorcerer's".
21:00:44  Jim Knopf.
21:00:56  ais523: I was told that most big budget popular movies have separate dubbings for continental french and canadian french, as well as for european portugese and brazilian portugese; but I thought most of them don't have multiple english dubs.
21:01:03  https://www.imdb.com/title/tt3072732/
21:01:30  it's different in text of course, which is easier to change, eg. it's cheap for some software to have separate american vs british english text
21:01:34  b_jonas: that's mostly just because it'd be a waste, Brits are used to seeing American English in films
21:01:57  ais523: yeah, but the HP movies have mostly british characters
21:02:11  the situation with computer games is weird, many computer game manufacturers have separate European and American translation teams
21:02:13  what happens with films like that?
21:02:27  so often you get separate British English and American English translations
21:03:02  but sometimes the American English translation is reused to save time, e.g. if they want to get a release out in the UK more quickly
21:03:02  video games are different, because they're made with most of the dialog in japanese originally, as opposed to films where most of the dialog is in english originally
21:03:14  this leads to translation inconsistencies between a game and its sequel sometimes
21:03:15  ...
21:03:23  (because one is the British English version, one is the American English version)
21:03:25  ais523: are those translations of the text of the video game, or of the voice acting or dubbing of the video game?
21:03:38  b_jonas: you should make that into a wisdom entry
21:03:47  b_jonas: normally text
21:03:53  I don't play a whole lot of games that have voice acting
21:04:02  (it says more about the video games that you play than about video games in general)
21:04:37  int-e: well, two out of the three largest console manufacturers are Japanese, and this thus affects all their first-party games
21:04:45 * int-e plays a lot of contemporary click&point adventures, and most of those have voice acting
21:05:05  Are there a lot of contemporary click⅋point adventures?
21:05:13  int-e, ais523: yes, the bias comes from how I see people play a lot of nintendo games
21:05:14  ais523: Hmm. You may have a point there. I'm focused on the PC platform.
21:05:42  even though nintendo games are less popular here in europe (still quite popular, mind you), I see them a lot on the internet
21:05:59  shachaf: there are a lot of contemporary point&click adventures
21:06:15  shachaf: I don't think any of them use linear logic of the kind you alluded to
21:06:18  What are a few? I thought they were pretty rare nowadays.
21:06:51  (unless you get into game mechanics where items sometimes get used up? hmm. there's an opportunity to overthink this here, certainly.)
21:06:53  shachaf: how do you typo an upside-down ampersand? I have a huge number of characters on my keyboard but don't know how to type that one
21:07:32  I don't think that was a typo
21:07:36  I don't, but I like to imagine a world in which I do.
21:07:57  First I pressed  & &, and it didn't do anything, but I was kind of hoping it would.
21:08:11  that's the first thing I tried too :-D
21:08:13  So then I just inserted it.
21:08:20  shachaf: two ampersands? why not an ampersand and a grave accent?
21:08:35  one minute of searching in gucharmap: ⅋
21:08:35  b_jonas: it's by analogy with ¿ and ¡
21:09:03  RFC 1345, the most complete repository of compose sequences I know of (although it disagrees with X on some issues), doesn't have a compose sequence for ⅋
21:09:17  I have the best Unicode searcher. It's very convenient.
21:09:18  `unidecode ⅋
21:09:19  ​[U+214B TURNED AMPERSAND]
21:10:23  I guess that my taste in games is focused heavily on gameplay over other factors, also I can't easily download large games or run those with DRM on my computer (because DRM normally requires an Internet connection)
21:10:42  these considerations combined mean that voice acting is very unlikely to be present in a game I play
21:11:06  that said, there is some amount of voice acting in some games I play, but it typically implies that I'll own a physical version (and it may well be a console game)
21:11:50  …the other impressive thing about RFC 1345 is that it is about non-ASCII character sets and compose sequences, yet is written entirely in ASCII
21:12:04  I think the main reason for defining all the compose sequences was to make it possible to readably write the rest of the document
21:12:20  http://www.faqs.org/rfcs/rfc1345.html doesn't seem to mention the upside down ampersand
21:12:36  ah yes, ais523 looked it up already
21:15:17  Hmm, my Unicode selector is already the best, but it's kind of cobbled together out of multiple pieces which isn't ideal.
21:15:29  I should write an even better Unicode selector thing.
21:15:39  …actually no, this isn't ASCII, is it? it's /actually/ ISO646
21:15:47  if it were ASCII it'd be able to use things like square brackets literally
21:16:13  The trouble is that rendering Unicode text is really hard.
21:17:36  There's pretty much only one free library for Unicode text layout, and it has some problems.
21:17:54  And also the author/maintainer seems to be a jerk about any criticisms of it.
21:18:39  hmm, theoretically libuncursed2 is planned to do Unicode text /layout/ (although not rendering, it just works out where to put the characters)
21:19:09  Well, layout is the hard part.
21:19:58  As far as I can tell there's no specification for how to do it or anything like that.
21:20:31  Librarie that do it just get a bunch of language-specific implementations from people who speak particular languages.
21:20:40  the main complexities are a) grapheme clustering, which definitely is specified; b) bidirectional layout, which I think is specified but haven't checked
21:20:49  What's libuncursed2?
21:20:52  but libuncursed2 is monospace only
21:21:03  it's a curses replacement that I was working on, then stopped
21:21:28  Oh, monospace-only is probably easier.
21:21:30  (so was libuncursed1, for that matter; libuncursed2 is meant to have a less ridiculous API, though, whereas libuncursed1's was almost curses-compatible)
21:21:41  I want to lay out general text.
21:22:16  I just want a library that implements the necessary algorithms and doesn't insist on taking over the world with regard to memory management or whatever.
21:22:23  shachaf: pango is probably one of the very few libraries that tries to tackle all its complexity, yes
21:22:26  I can't tell why harfbuzz wants to reference-count everything as its only API.
21:22:31  Pango just uses harfbuzz, right?
21:22:36  I don't know
21:22:43  it might
21:22:48  I don't know what it uses underneath, I just use its api
21:23:01  I know it has dependencies
21:23:22  it has to do lots of magic about accessing fonts installed on the system
21:23:35  Ugh, I don't want magic.
21:24:02  well, it has lots of user-configurable knobs, so I think you can turn whatever magic you don't want off
21:24:19  but I don't see how you want to do general text layout without magic, unless you know a lot about every script there is in unicode
21:24:20  I want to be able to put glyphs in a font atlas thing and have them rendered on the GPU anyway.
21:24:33  or every script there is in existing fonts, rather
21:24:52  Presumably given a particular string I can figure out which glyphs are necessary for rendering it.
21:25:03  shachaf: no, that's pango's job
21:25:10  figuring out which glyphs to render and where exactly
21:25:12  and a bit more
21:25:37  then you can use pango with multiple different frontends that actually draw the glyphs there if you want to render them, including on GPU
21:25:52  I also want libraries that don't ever call malloc.
21:25:59  That seems like a pretty reasonable request.
21:26:17  that... may be hard in this case
21:26:32  um
21:26:43 -!- AnotherTest has quit (Ping timeout: 245 seconds).
21:26:53  you want the same library to do both, right? help with text layout and never call malloc that is
21:27:26  I don't want any library to call malloc. That doesn't seem that unreasonable.
21:27:28  you can probably make a version that calls your own malloc-like functions if you really need to
21:28:04  I definitely don't want libraries to do reference counting. That's just ridiculous.
21:28:05  though it might be hard because you may have to go down to all dependencies including gobject
21:28:26  shachaf: again, that will be hard with the current status of these libraries
21:29:03  and for rendering layout, that seems an unreasonable requirement to me. surely you want them to cache the information they learned out about fonts and stuff, and they need refcounting for that
21:29:45  libuncursed, at least, inherently needs memory from somewhere; what would be your suggested API for that?
21:30:09  (note that the intended API uses nothing but Unicode strings and 32-bit integers to make it easy to wrap from arbitrary languages)
21:30:21  Hmm, I could pass in some amount of memory that it requests.
21:30:22  calling malloc seems like the obvious method
21:31:07  The main thing I want is a clear understanding of the memory usage and allocation profile of my program.
21:31:20  I for one am fine with libraries like this doing malloc and some reference counting
21:32:03  shachaf: is it OK if all the routines that can allocate memory have a name clearly indicating that?
21:32:17  shachaf: you can still do that with malloc, you can probably replace malloc
21:33:00  That would be better, and it would also be better if I can pass in an allocator rather than it calling the global malloc.
21:33:22  sure, there are some functions where I want to make sure that they don't malloc, but for anything like text layout or rendering, using malloc is fine for me, 
21:33:42  assuming it can clean up after itself of course, doesn't leak memory like crazy
21:38:19  also for english pronunciation, article http://www.madore.org/~david/weblog/d.2019-08-29.2618.html is fresh out from the press
21:38:36  huh, it's written in English?
21:38:45  I guess that makes sense given its topic
21:39:21  ais523: David alwasy writes some articles in English, it's just less common than it used to be in the early years of his blog
21:39:30  (the blog is very old, so some change is not surprising)
21:40:24  but http://www.madore.org/~david/weblog/d.2015-03-20.2284.html is new and also in English
21:41:40  "always writes some articles in English" is a modal logic thing?
21:41:48  "always eventually", I guess.
21:43:18  hmm yeah, http://www.madore.org/~david/weblog/d.2013-09-29.2161.html is in french and is about english language
21:43:51 -!- ais523 has quit (Quit: sorry for my connection).
21:44:03 -!- ais523 has joined.
21:46:00  and these days David keeps writing more and more stuff on Twitter rather than on the blog, and some of that is always in English too
21:54:58  my own answers: warn=worn; fairy≠ferry; spear it≠spirit; fire≠far; law=lore; ant?=aunt ("aunt" varies); full≠fool; sun=son; horse=hoarse; pain=pane; hire?=higher (both vary); threw=through; luck≠look; would=wood; poor≠pure; brewed=brood; steering≠stirring; shed≠shared; morning=mourning; tower≠tyre ("tire" doesn't exist in en_GB); farm≠form; sat≠set; dolly≠Dali; hit≠heat; bury=berry; putt≠put; nose=knows; tower≠tar; 
21:54:59  earn=urn; [h]urry≠[f]urry; [n]earer≠[m]irror; stow≠store; poor=pour; hairy≠Harry; fir=fur; for=four; surely≠Shirley; cot≠caught; meet=meat; cap≠cup
21:56:05  does "tire" not exists even as an uncommon verb?
21:56:18  b_jonas: oh yes, I missed the verb possibility
21:56:38  it's mostly only used as "tired" but does exist as a verb on its own
21:57:22  as in "I tire of this farce!" when Jabba drops Oola into the Rancor pit in Darths & Droids http://www.darthsanddroids.net/episodes/1210.html
21:57:42  b_jonas: If the library wants to do caching that seems fine, but surely it should have a lower-level interface where I can control the caching?
21:58:19  shachaf: I don't know the details. you can probably control at least as much to be able to ask to purge the cashes
21:58:25  s/cash/cach/
21:58:57  you can check the manual at https://developer.gnome.org/pango/unstable/ if you want, or a local copy
21:59:38  Ugh, I definitely don't want to use glib.
21:59:45  Every time I've tried to use a glib thing it's been miserable.
22:00:13  shachaf: I think pango itself doesn't use glib, only cairo does
22:00:19  pango uses gobject, which is sort of related
22:00:23  but I'm not sure of this
22:00:42  in practice I use pango+cairo together (pango has an easy api for that), so it uses glib
22:00:50  but only internally, it doesn't expose that
22:01:24  nor does pango expose gobject I think
22:01:53  it doesn't bother me this way
22:02:00  it would bother me if it was exposed of course
22:03:38  eg. pango uses the type int to give width, not gint
22:20:57  ais523: my three wrong answers for the poll (despite that no answers are wrong) are for horse, son, and mourning
22:21:13  I still don't understand how "o" works in English pronunciation
22:21:20  most of the time I pronounce it randomly
22:21:49  it usually matches the vowel in "pot" but sometimes it just means something else, seemingly at random
22:26:08  "oo" and "ou" confuse me, because I always try to pronounce them as long u (or sometimes short U for ou) when stressed
22:26:34  but there are a lot of words where it's pronounce as some of the o vowels, but I can never remember which ones
22:26:57  I do know that "poor" and "pour" are strange, and I pronounce those inconsistently
22:27:20  and I do know some frequent words like "four" have long o
22:27:39  but still in many words, it confuses me, and that's what got me in "mourning"
22:28:33  oh! you must have tried to pronounce it like "hour"
22:28:45  I was trying to figure out what the other viable reading of the word was
22:28:47  I also know that "your" and "you're" has long o, despite that you has U
22:29:11  a good guideline is that an r after a vowel almost always affects how the vowel is pronounced
22:29:13  as for "horse", I thought it has a _short_ o, and I'm still surprised that it doesn't
22:29:19  although the r itself may end up silent
22:29:40  "horse" doesn't really have an "o" at all, the vowel is "or"
22:30:19  and there are probably exceptions to how "or" is pronounced because there are exceptions to everything, but it's one of the more reliably pronounced out of the various English vowel spellings
22:30:23  "tour"
22:30:58  "t" + "or"
22:31:17  "our" is ambiguous, it can either be pronounced like "or" or else more like "ower"
22:31:40  "son" is the worse, because I have heared that word enough, so I should have known how it's pronounce
22:32:11  for "horse" I can say that I just don't care about them so I don't listen to texts that talk about horses
22:32:20  I think it's a reasonable excuse
22:32:40  well, from my point of view "son" is irregular so it's easy to imagine someone guessing that wrong
22:32:55  yes, lots of words are irregular, that's sort of the problem
22:33:05  but "horse" is regular (apart from the e at the end) so that's more of a surprise
22:33:21  (I think the e at the end is needed because "hors" is an imported French word and thus has a silent s)
22:35:03 -!- FreeFull has quit.
22:36:29  hungarian is so much easier, because there used to be fewer words with irregular spelling. these days there are somewhat more because some people aren't willing to write a lot of english words in their english spelling even long after they're definitely naturalized. "ímél" is the most annoying to me, because so many people still write it as "email" or "e-mail"
22:36:32 -!- xkapastel has joined.
22:36:43  but "fájl" vs "file" is older
22:37:10  luckily people get "fájl" right more often because they see it in the localized windows UI menubars
22:38:59  I thought Hungarian respelled all loanwords in Hungarian spelling according to their pronunciation?
22:39:15  among the words that aren't neologisms, the more famous ones that have irregular spelling or may have irregular spelling in some dialects are "kisebb", "egy", "köpeny", "szőlő", "tízes", "húszas", and there's a few more than I forgot
22:39:43  although áj is a bit of a weird way to spell English long i
22:39:44  plus there are a few interjections that don't follow the normal phonology rules so their transcription is odd 
22:41:19  ais523: loanwords are supposed to be respelled if they've become a regular part of the language and they're not proper nouns; but they are kept in the original spelling while they're rare and just ad-hoc borrowed, as long as it's borrowed from a language usually written in latin script (including serbian)
22:42:38  ais523: I don't find "áj" weird for spelling the english long i. it corresponds closely to the sound. 
22:43:07  I guess I find it hard to understand what j does in Hungarian
22:46:46  ais523: in this case I think of it as a semi-vowel that forms a glide with the previous vowel. hungarian has those only _after_ a vowel, not before, which is why people with hungarian accents like me pronounce some english w-words strange.
22:47:45  there's an analogous u semi-vowel in hungarian too, but it's pretty rare, basically only occurs in the word "autó" and related words, and even then the pronunciation is variable, plus transcribed ancient greek words with a vowel + u
22:48:06  (vowel other than omikron) + u
22:48:35  IIRC Hungarian "ly" is a sound that doesn't exist in English
22:48:47  "ly" is pronounced the same as "j"
22:49:11  so I don't see how that would work
22:50:10  (except in a few old family names that spell "i" as "y", such as Thököly)
22:50:29  as Hungarian "j" or English "j"?
22:50:49  I thought English "j" was close to Hungarian "gy" (not identical, but close enough to be mutually intelligible)
22:51:13  as in Hungarian "j"
22:51:25  Hungarian "j" and Hungarian "ly" are pronounced the same
22:51:45  and it's basically the same sound as the english "y" when it's a consonant, such as in "yet" and "yellow"
22:51:54  hmm, that's a bit of a surprise
22:51:59  how do you know which one to spell words with?
22:52:23  rote memorization, just like in english?
22:52:23  except it often occurs after a vowel but before a consonant, in which case English usually doesn't spell it as "y"
22:52:29  yes, rote memorization
22:52:43  my banes were "muszáj" and "papagáj"
22:53:51  there are a few rules that help: grammatical suffixes never have "ly" but often have "j", and "ly" doesn't occur at the start of a word excet in "lyuk" and its derivatives
22:53:57   except it often occurs after a vowel but before a consonant, in which case English usually doesn't spell it as "y" ← because that would modify the vowel rather than being a consonant
22:54:06  there are also hints in that "ly" is rarer than "j", and "ly" is rare before a consonant
22:55:53  but you do have to learn a long list of words with "ly" and "j" in school, eg. common ones like "folyik, lyuk", and rare ones that teachers like eg. "gólya, sirály, karvaly, papagáj" (four birds), "gálya, bója", 
22:56:15  and even obscure words like "zsöllye" which I never heard or read anyone use except in the context of learning the spelling
22:59:05  "zsöllye" means the ordinary seats in a theatre, as opposed to the seats in boxes, but everyone just calls them "szék" which means chair
22:59:20  why would you need a special word for them?
22:59:49  special words for types of birds, that I can understand
23:00:13  there are way more than the four I listed that we had to learn
23:22:33  I guess "bója" is a third one that I can call my bane, besides "muszáj" and "papagáj". all three sound like they should be spelled with "ly", but they aren't
23:23:33  but these days I think I know all three of them, and all other words
23:25:10  "j" vs "ly" in all other words that is, not the spelling of all other words in general
23:30:06  also all newly created words use "j" except where the "ly" is taken from a word they're derived from, so "ly" is a finite list, though there are obscure obsolate words on that list that I may not know
23:30:08 -!- Phantom_Hoover has quit (Quit: Leaving).
23:31:11  I know even _some_ obscure words with "ly" that I never use and aren't even sure in the meaning, like "csobolyó" and "süly" and "kesely"
23:36:57 -!- b_jonas has quit (Quit: leaving).
23:38:05  ais523: What about the smaller case of one function that returns variable-size data?
23:38:21  I think there are many options other than a malloc call and most of them are better.
23:38:44  IIRC the API was designed so that all possible string-returning functions return data that exists literally as part of the executable, so it's just pointers to static strings
23:39:05  that's a pretty major restriction but for something like libuncursed2 it may be doable
23:39:50  Which API?
23:39:53  I mean in general.
23:40:13  libuncursed2's
23:40:23  in general there is probably no good cross-language solution
23:40:48  Sure. Say in C.
23:41:28  count-and-copy is a solution that is capable of being good in some circumstances and is likely to be portable cross-language
23:41:49  (you call to ask how much space to reserve, then provide memory of that size for the called function to copy the return value into)
23:42:06  but for some functions it doesn't work as you have to do the same calculations twice
23:42:06  That can result in some duplicated work unfortunately.
23:42:10  Right.
23:42:25  One thing you can do is turn your function into a coroutine/state machine that can suspend when it needs more memory.
23:42:35  This is kind of similar to a malloc call (but more flexible).
23:43:53  You could pass a large buffer into the function and have it tell you how much it used.
23:44:33  I was going to say "that doesn't work because you need memory to record your current state to be able to return it"
23:44:47  then I realised that it suspends mid-calculation as soon as it runs out of memory
23:45:07  Right, you give it a "stack frame" struct that it can record its current state in.
23:45:32  this is actually a really interesting idea, and I'm not sure it's been tried before?
23:45:43  coroutines + memory allocation as two problems that are each used to solve the other
23:48:54 -!- iczero has changed nick to webpack.
23:51:12  Say you're implementing sprintf, which returns a variable-size output.
23:51:41  The normal thing to do is to call it twice to get the length the first time.
23:52:17  But if you're implementing printf using sprintf, you don't even want to allocate a full-size buffer. You want to sprintf to a fixed-size buffer until it's full, then flush it, and repeat until you're done.
23:52:41  so ideally you want a coroutine that yields a stream of characters
23:52:45  The coroutine formulation seems the most natural for that sort of thing. It's not even about allocation in that case because you never want the full string in memory.
23:53:07  oh wow
23:53:15  I think you really have hit on an important discovery here
23:53:20  I think yielding a character at a time isn't really what you want (except maybe conceptually).
23:53:41  You just want to give it a buffer and have it fill the buffer as much as it can based on its current state.
23:53:55  well, "yield…stream" would ideally have some sort of buffering, but maybe it could exist at a higher level somehow?
23:54:02  rather than being built into the source code of the functions in question
23:55:17  Hmm, these are details you can figure out in some reasonable way. The main point is the way flow control should happen.
23:55:27  Control flow!
23:55:31  I always get it wrong.
23:56:52  shachaf: ironically, this actually /is/ a flow control problem (in the sense of working out how much should be buffered before sending it)

2019-08-30:

00:00:39  It would be nice if languages helped you write this kind of coroutine.
00:00:52  Of course you can do it yourself easily enough in a case like this.
00:01:25  async (of async/await) does something quite similar to this, but not quite the same as it doesn't handle the memory allocation
00:01:48  What do you mean?
00:02:04  (Also which language's async/await? There are many languages that assign slightly different meanings to those names.)
00:02:25  well, the general idea of what async does is that it makes a function into a state machine that can be suspended
00:02:56  although it's tied to await to choose the timing of that
00:03:14  I guess generators more generally are the general case of that
00:03:16  await is about one state machine waiting for another state machine, right?
00:03:56 -!- Sgeo_ has quit (Ping timeout: 272 seconds).
00:03:59  sort-of, it basically continues the other state machine while suspending itself, and continues itself if that state machine returns, or blocks if that state machine blocks
00:04:15  so allocating memory in this scenario is basically "await memory"
00:05:18  I think malloc is probably one of the less interesting/more extreme use cases of this sort of thing.
00:05:27  Anyway in the simple version of this allocation is just handled explicitly by the caller.
00:05:30  What would it be like?
00:05:48  no, I mean, say you need more memory
00:05:59  you do "await memory" which basically tries to allocate memory from the slice of memory you already have
00:06:11  if you don't have enough that causes a yield, with "not enough memory" as the reason
00:06:15  then the caller can resize the slice and continue from there
00:06:34  if you do have enough, then the allocation (i.e. used-length from capacity) succeeds, so you continue
00:07:16  Sure, that's an option.
00:08:52  A simple API would be something like
00:09:22  char buf[100]; SprintfState state; sprintf_init(&state, "test %d %s\n", 123, some_string); while (!state.done) { sprintf_chunk(&state); write(1, buf, state.chunk_size); }
00:10:15  not quite, you never told sprintf_init where the buffer was
00:10:25  but that's easily fixable I think
00:10:26  Oh, right, that's another argument.
00:10:39  It would either be part of sprintf_chunk or sprintf_init
00:10:42  Probably sprintf_chunk
00:11:02  Certainly sprintf_chunk
00:12:19  It'd just be sprintf_chunk(&state, buf, sizeof buf); in this case, since it never needs to refer to old memory or anything like that.
00:12:38  Hmm, this post -- https://gist.github.com/pervognsen/d57cdc165e79a21637fe5a721375afba -- and the one it links to talk about these state-machine-style APIs.
00:12:46  I was thinking of a much more radical API than this
00:13:08  yes, your API doesn't work because of this:
00:13:24  Sure, I was trying to think of the simplest case where this is useful.
00:13:24  char buf[100]; SprintfState state; sprintf_init(&state, "%s", "some really really really … really long string");
00:13:33  string needs to go into state, but it has a fixed size
00:13:41  Why does string need to go into state?
00:13:53  Only the maximum number of varargs needs to fit in state.
00:13:55  it's the only out parameter of sprintf_init
00:14:22  or are you assuming that the caller-provided string remains allocated from sprintf_init to sprintf_chunk?
00:14:25  But state only needs to store a pointer to its arguments.
00:14:30  Yes, I'm assuming that.
00:14:45  oh, OK; that's kind-of a mentally abhorrent assumption to me
00:15:04  because it's a memory usage assumption that a) isn't documented, and b) might not be true from all calling languages
00:15:12  Really? It seems pretty reasonable to me.
00:15:19  You can enforce it with a language like Rust if you want.
00:15:34  it took me a moment to check if it was even expressible in Rust
00:15:38  I would certainly document it if I was writing documentation for this.
00:16:20  What's the more radical API you were thinking of?
00:16:30  it is, but SprintfState needs to be generic over a lifetime parameter that says how long the parameters to sprintf_init are alive for
00:16:40 -!- sparr has quit (Changing host).
00:16:40 -!- sparr has joined.
00:17:40  I think copying the erally really long string is surely more abhorrent than ensuring its lifetime is correct.
00:17:43  OK, so my idea was that you have a buffer that can be any size you like, you give that to sprintf_init and it stores as much as it can in the buffer, internal state, output characters, everything
00:18:14  if it doesn't have enough memory to do what it wants to do it stops and returns an out-of-memory, you can then realloc the buffer to be larger and rerun, it'll continue from where it left off
00:18:41  you can also dump out the characters written so far (one at a time, as many as possible, or whatever), perhaps shrinking the amount of state that's in use
00:18:47  If you think of this as a coroutine, it makes sense: A routine's arguments are presumably guaranteed to stay alive until the function returns. A coroutine's "arguments" (the arguments to _init) can reasonably be subject to the same assumption.
00:18:58  the basic idea is just that you tell it to go as far as possible, then it tells you when it stopped
00:19:08  presumably you'd have to give the same arguments with every call in this API
00:20:11  If you do that you'll presumably have to copy the string out of the internal buffer into the place you want it when you're done?
00:20:46  well, yes, but that's the same as in your example (you're copying out of buf after calling sprintf_chunk)
00:21:07  Well, I can just give it a buf that points where I want.
00:21:31  the only real difference between your and my versions is that buf and state are the same variable and state can thus steal from buf to record as much as it needs to
00:21:40  In this case it's stack-allocated but there's no reason for that in general.
00:21:58  For example if stdout is buffered I can pass my output buffer directly to sprintf_chunk.
00:22:27  hmm… perhaps this suggests some general model involving coroutines communicating with streams
00:22:28  Or if I'm writing to a C++ std::string or whatever else I can just pass a pointer to that memory. Then if I need to resize it I can pass a pointer to the new memory to keep writing.
00:22:46  it feels like fputs (i.e. the buffered version of write) is a coroutine in its own right
00:23:07  In the sense that it does a blocking write or something else?
00:23:22  in the sense that it gathers up input into an internal state buffer
00:23:37  across repeated calls
00:24:13  I guess.
00:24:23  Ugh, I always forget that fputs doesn't include a \n
00:24:34  that's why I said fputs not puts :-)
00:25:10 -!- webpack has changed nick to iczero.
00:25:46  Hmm, I should just write a sprintf with this API.
00:26:00  It's obviously much better than the regular API, which is pretty bad.
00:26:19  I should go to bed, have to go to work early tomorrow
00:26:21  night everyone
00:26:24  (There's no way to implement printf out of sprintf or vice versa, without arbitrary allocation.)
00:26:28 -!- ais523 has quit (Quit: quit).
00:26:31  Good nais523.
00:30:15  Now I wrote on a paper, a Scrabble variant, which is Go-Scrabble, which is using Go stones in addition to Scrabble.
00:34:21  ais523: I think the kind of API you're talking about is more reasonable in other cases where you have more computation going on.
00:34:51  Maybe I'd characterize it as passing an arena to your coroutine.
00:39:21 -!- Sgeo has joined.
00:41:52 -!- Sgeo_ has joined.
00:44:37 -!- Sgeo has quit (Ping timeout: 245 seconds).
00:50:10  [[Salt]] M https://esolangs.org/w/index.php?diff=65779&oldid=65776 * A * (+438) 
00:54:40  `5 w
00:54:42  1/2:tall//A Tall proof is a proof with a small hole, which can only be filled by another Tall proof. \ eol//EOL stands for End Of Lawn. It's often found past the wabe. oerjan requests your presence there immediately. \ hovercraft//a-é-ro-g-liss-e-ur. If you mention eels, you'll get smacked with one of them in a most unappropriate manner. \ fisdom//Fisdom is the domination by the federal inspection station. \ operation//Operation is the opposite
00:54:46  `n
00:54:47  2/2: of cooperation.
00:55:27  `cwlprits eol
00:55:29  shachäf Zarutiän Zarutiän Zarutiän
01:00:25  [[Salt]] M https://esolangs.org/w/index.php?diff=65780&oldid=65779 * A * (+605) /* Arrays */
01:17:55 -!- arseniiv has quit (Ping timeout: 246 seconds).
02:13:55 -!- xkapastel has quit (Quit: Connection closed for inactivity).
02:38:11  [[Salt]] M https://esolangs.org/w/index.php?diff=65781&oldid=65780 * JonoCode9374 * (+0) /* Sets */ fixed a formatting error
04:12:26  [[Truth-machine]]  https://esolangs.org/w/index.php?diff=65782&oldid=65616 * Dtuser1337 * (+190) /* Madbrain */ mailbox truth machine by me.
04:38:18  `quote kmc
04:38:18  579)  COCKS [...]  truly cocks \ 609)  You should get kmc in this channel. kmc has good quotes.   `quote kmc   686)  COCKS [...]  truly cocks   Well, in theory. \ 679)  damn i should make a quasiquoter for inline FORTRAN \ 682)  has there been any work towards designing programming languages specifically for stoned people \ 712)  the problem with PHP is that anyone halfway competent giv
04:38:26  `quote kmc
04:38:27  579)  COCKS [...]  truly cocks \ 609)  You should get kmc in this channel. kmc has good quotes.   `quote kmc   686)  COCKS [...]  truly cocks   Well, in theory. \ 679)  damn i should make a quasiquoter for inline FORTRAN \ 682)  has there been any work towards designing programming languages specifically for stoned people \ 712)  the problem with PHP is that anyone halfway competent giv
04:38:31  boring
04:38:35  `quote shachaf 
04:38:35  839)  GreyKnight, shachaf is like a high-level Forth \ 1059) <@elliott> well, I think if you don't think figuring out who the opposite of shachaf is requires thought, then you don't know shachaf very well
04:39:10  ....what was the context for that?
04:40:04  Apparently I tried to autocomplete Factor, which as we all know begins with s.
04:45:07  hi Sgeo_ 
04:45:31  Hi
04:51:06  kmc: himc
04:52:06  earlier i was going to send you a link to https://www.youtube.com/watch?v=_gKhM8gqbD8 although i don't remember why
05:00:51  lol wow
05:08:18  isn't it the cutest though
05:08:25  other than cats obviously
06:10:59  yeah
06:11:01  we saw a cat today
06:11:08  on the way back from thai food
06:11:09  standing in someone's driveway
06:11:22  did you know the government of thailand made a smartphone app that will tell you where the nearest thai restaurant is
06:11:36  they have a huge program to promote thai cuisine
06:13:52  cats are tg
06:14:15  my friend showed me a bunch of cute cat pictures he took the other day
06:14:17  it was great
06:19:18  [[Salt]] M https://esolangs.org/w/index.php?diff=65783&oldid=65781 * A * (+271) 
06:23:04  [[Salt]] M https://esolangs.org/w/index.php?diff=65784&oldid=65783 * A * (+182) /* Miscellaneous */
06:52:25 -!- pikhq_ has joined.
06:55:02 -!- pikhq has quit (Ping timeout: 252 seconds).
07:05:27 -!- AnotherTest has joined.
07:56:06 -!- tromp has quit (Remote host closed the connection).
08:03:24 -!- tromp has joined.
08:13:27 -!- tromp has quit.
08:13:45 -!- tromp has joined.
08:19:43  kmc: "void SHA1_str(Str str, U8 output[static SHA1_HASH_BYTES]);"
08:19:46  p. fancy use of static, huh
08:28:12  [[Salt]] M https://esolangs.org/w/index.php?diff=65785&oldid=65784 * A * (+77) Dumb 11-line transpiler
08:38:13 -!- Lord_of_Life has quit (Ping timeout: 246 seconds).
08:41:16 -!- Lord_of_Life has joined.
08:42:58 -!- wob_jonas has joined.
08:44:29  shachaf, ais523: re memory allocation with coroutines, this is usually done with memory alloc callbacks instead of coroutines. many libraries allow you to set a callback to allocate more memory, and some even allow you to pass a cookie to it so it can be a closure different for each state.
08:44:54  for writing to streams, a callback to do the underlying write (flush) or read (fill) from buffer is mostly already what happens:
08:45:29  [[Bitwise Trance]]  https://esolangs.org/w/index.php?diff=65786&oldid=65704 * Hakerh400 * (-109) That sentence did not make much sense. In the "I/O format" paragraph it says that the program can be terminated from outside based on the output and it does not affect the computational class
08:45:40  C++ streams explicitly work that way, and C FILE effectively works that way these days, possibly with optimizations for common cases, though only glibc exposes the interface to make a FILE with custom read/write functions
08:47:04  the streams usually don't allocate extra memory, but either write to a file or a fixed-size buffer, but there are versions like asprintf that do allocate
08:48:19  mind you, in many cases you use sprintf to format a number in formats other than %f, in which case you can give a bound for the number of characters output, similarly with strftime with numeric formats, so sometimes using a fixed size buffer is reasonable
08:48:52  it's just that when you get the buffer size wrong, you get programs that mysteriously fail in months that have a long name, or some such
08:49:51  the exception is kernel interfaces, because those usually don't want to call back the user, so those are indeed implemented as coroutines that stop when they passed as much data to the process that it's allocated
08:50:29  the most common case is the read call, to which you give a buffer, and you can call it again if the kernel has more input for you
08:51:02 -!- Sgeo__ has joined.
08:51:04  Isn't the interface I specified more general and easier than an allocation callback?
08:51:10  but there's also other stuff like readlink and getsockopt where the kernel can tell you how long buffer you need, though often you can guess correctly
08:51:33  in particular, for readlink, lstat _usually_ tells you how much of a buffer you need, but that fails for /proc files
08:51:41  shachaf: usually no
08:52:12  shachaf: some functions like interpreters are complicated, and may need to allocate way deep in the call stack
08:52:20  Oh, sure.
08:52:21  so arranging to save the state and return in that case is hard
08:52:38  the kernel has to do it anyway for syscalls, like I said
08:52:54  I meant easier to use, not easier to implement.
08:52:58  and some network interfaces have to as well
08:54:23  shachaf: even that is not clear to me. with something like the lua interpreter or the gmp/mpir arbitrary precision integer functions, it's more convenient to set the allocation function once rather than to have to check the return value of almost every call and call it again if it's out of memory
08:54:40 -!- Sgeo_ has quit (Ping timeout: 272 seconds).
08:54:59  I don't think you should try to have exactly the same interface for a programming language interpreter and sprintf.
08:55:05  That's kind of silly.
08:55:17  shachaf: well sure
08:57:29  a more typical case when coroutines may help is where you're communicating through network through a protocol that requires lots of back and forth stuff, which you do often want to write as a state machine that returns each time it wants to select
08:57:33  which is how libcurl works
08:59:56  I'm also interested in how compiler support can help you make these things.
09:00:22  Anyway I wonder whether there's an implementation of sprintf specifically that behaves the way I said?
09:00:44  You can't implement either printf or sprintf in terms of the other one efficiently, which is unfortunate.
09:02:41  Hmm, does anyone use glibc obstacks?
09:02:52  shachaf: behaves as a state machine that can continue the same sprintf call? I don't think there's one, but it would be sort of unnecessary: you just do separate parts of sprintf individually anyway, and for a single one, redoing the work like you need with snprintf now is not much extra overhead to what printf already has
09:03:24  shachaf: no, but subversion uses apache's own implementation from libapr that is similar to them
09:03:27  If you have a large string output with sprintf, you need a large allocation as well.
09:03:40  Whereas printf can just use a constant-size buffer.
09:03:53  allocates everything in whatever they call the equivalent of obstacks, and then free everything at once later
09:04:02  Yes, it's probably right that you should just have your own implementation rather than relying on glibc.
09:04:12  I wrote my own and it's only a few lines anyway.
09:04:20  they can't use obstacks from glibc because glibc is rather nonportable to non-linux systems
09:04:54  I brought this up because I thought obstack had a printf function, but maybe it doesn't.
09:05:24  shachaf: either it has one, or if not, you can make one with the custom stream glibc interface, I don't recall which
09:05:37  I don't recall what APR has instead
09:05:51  let me see
09:06:42  https://www.gnu.org/software/libc/manual/html_mono/libc.html#Custom-Streams  glibc C FILE streams with custom read/write callbacks; C++ streams and rust streams and python streams and perl streams have their own variants (perl has like three different mechanisms I think)
09:07:39  https://www.gnu.org/software/libc/manual/html_mono/libc.html#Dynamic-Output  has obstack_printf 
09:08:00  Oh, right.
09:09:32  glibc scanf has an "a" modifier that does malloc, as in "%as" or "%a[...]", which is why I think it's a mistake for C99 to have specified "%a" as equivalent to "%g" in scanf, because the glibc use is way older,
09:09:54  so in practice you can't actually use "%a" on glibc because glibc interprets it the old way, but I don't think anyone uses it anyway
09:10:09  it's just silly of C99, they are usually more careful avoiding clashes
09:10:32  it's different with clashes where neither clearly precedes the other of course, such as the two uses of "clog" 
09:11:43  "remove" also clashes, but that's the same problem that the Unhinged Erase card parodies, we basically have only a few synonyms (remove, erase, delete) and a ton of functions that you try to name that way
09:12:13  One of the nice things about Xlib is that it knows three property formats: 8, which is chars, 16, which is shorts, and 32, which is longs.
09:12:34  Even if your long is 64-bit, you get an actual_format integer equal to 32.
09:17:15  I know very little about Xlib, and don't expect to have to learn more either, luckily
09:17:26  I just use higher-level libraries or programs abstracting it way deep
09:17:43  there was one case when I wanted to find out whether a certain functionality is available from Xlib, but I found a workaround instead
09:18:30  namely asking the X server to change the current virtual terminal to a different one (from the one where X lives), which X can do because it does so for keyboard shortcuts, and it's one ioctl for them anyway, but I wanted to know how to ask it to do so programmatically
09:34:34 -!- Sgeo_ has joined.
09:38:12 -!- Sgeo__ has quit (Ping timeout: 248 seconds).
09:41:32  [[Talk:Uyjhmn n]] M https://esolangs.org/w/index.php?diff=65787&oldid=61934 * Dtuser1337 * (-12) OH NOOOOOOOOOO!!! THIS MUST BE THE WORK OF AN ENEMY STAND! D:
09:45:59  [[Uyjhmn n]]  https://esolangs.org/w/index.php?diff=65788&oldid=54422 * Dtuser1337 * (+66) Adding category because truttle1 forgot to add categories.
09:50:59  [[User:Dtuser1337/sandbox]] N https://esolangs.org/w/index.php?oldid=65789 * Dtuser1337 * (+106) Created page with "this is my sandbox page in which i use to draft some w.i.p stuff and experiment with these. ==some stuff=="
09:51:34 -!- Sgeo__ has joined.
09:54:45 -!- Sgeo_ has quit (Ping timeout: 258 seconds).
09:56:23  [[Talk:AAAAAAAAAAAAAA!!!!]]  https://esolangs.org/w/index.php?diff=65790&oldid=14574 * YamTokTpaFa * (+249) /* I'd like to implement, but isn't it pretty difficult to implement its parse? */ new section
10:06:09  [[Salt]] M https://esolangs.org/w/index.php?diff=65791&oldid=65785 * A * (+273) /* Sets */
10:14:05 -!- Frater_EST has joined.
10:14:51  [[Point]] M https://esolangs.org/w/index.php?diff=65792&oldid=62914 * Dtuser1337 * (-1) /* Point */
10:16:09  [[Point]] M https://esolangs.org/w/index.php?diff=65793&oldid=65792 * Dtuser1337 * (-1) moving the infobox to the top, yare yare daze.
10:16:57  [[Esolang:Sandbox]]  https://esolangs.org/w/index.php?diff=65794&oldid=65595 * Dtuser1337 * (-4137) Do i have any reason to blank this page!?
10:21:00  [[Esolang:Sandbox]]  https://esolangs.org/w/index.php?diff=65795&oldid=65794 * Dtuser1337 * (+5646) testing the ASCII art. joseph joestar picture and quotes are used.
10:21:51  [[Esolang:Sandbox]]  https://esolangs.org/w/index.php?diff=65796&oldid=65795 * Dtuser1337 * (+907) 
10:22:18  [[Esolang:Sandbox]] M https://esolangs.org/w/index.php?diff=65797&oldid=65796 * Dtuser1337 * (-6553) blanking. Arigato, Gyro.
10:23:44 -!- ineiros has quit (*.net *.split).
10:23:45 -!- sprocklem has quit (*.net *.split).
10:23:45 -!- Hooloovo0 has quit (*.net *.split).
10:23:45 -!- Guest77811 has quit (*.net *.split).
10:23:45 -!- GeekDude has quit (*.net *.split).
10:23:45 -!- LBPHacker has quit (*.net *.split).
10:23:49 -!- HackEso has quit (*.net *.split).
10:23:49 -!- Melvar has quit (*.net *.split).
10:23:49 -!- zzo38 has quit (*.net *.split).
10:23:49 -!- lifthrasiir has quit (*.net *.split).
10:23:49 -!- jix has quit (*.net *.split).
10:23:50 -!- shachaf has quit (*.net *.split).
10:24:04 -!- LBPHacker has joined.
10:24:20  [[User:Dtuser1337/sandbox]]  https://esolangs.org/w/index.php?diff=65798&oldid=65789 * Dtuser1337 * (+19) /* some stuff */
10:24:27 -!- Melvar has joined.
10:24:48 -!- HackEso has joined.
10:25:36 -!- GeekDude has joined.
10:25:39 -!- GeekDude has changed nick to Guest24768.
10:25:45 -!- sftp has quit (Excess Flood).
10:26:06  [[Point]]  https://esolangs.org/w/index.php?diff=65799&oldid=65793 * Dtuser1337 * (+18) NANI!? A year category!?!?
10:26:24 -!- sftp_ has joined.
10:27:06 -!- Hooloovo0 has joined.
10:27:15 -!- sftp_ has changed nick to sftp.
10:28:19 -!- lifthrasiir has joined.
10:28:54 -!- ineiros has joined.
10:29:22 -!- jix has joined.
10:29:23 -!- quintopia has joined.
10:29:34 -!- sprocklem has joined.
10:29:52 -!- shachaf has joined.
10:29:59  [[User:Dtuser1337/sandbox]]  https://esolangs.org/w/index.php?diff=65800&oldid=65798 * Dtuser1337 * (+109) Yare yare daze
10:30:13  [[User:Dtuser1337/sandbox]]  https://esolangs.org/w/index.php?diff=65801&oldid=65800 * Dtuser1337 * (+1) 
10:30:46 -!- xkapastel has joined.
10:35:42  I heard that Objective C implements "blocks" with operating system support for some reason.
10:35:53  Is that true? What's the thing they need it for?
10:36:46  huh
10:38:13  are they connected to some user-space threading mechanism?
10:39:04  If not I don't really see why OS support would be needed... or helpful. But who knows what Apple's doing.
10:40:28  It could be something comparatively trivial like a hot zone.
10:42:31  . o O ( I've heard that INTERCAL implements 'come from' with OS support... )
10:42:56  It's so easy to make up rumors.
10:43:26  It's certainly possible I misunderstood.
10:45:07  Meh the thing with these claims is that they require serious research to refute, unlikely as they seem.
10:46:22  shachaf: do you mean like by allocating executable areas or using an executable stacks to make closure stubs?
10:47:04  I don't know.
10:47:50  int-e: the intercal one is easier to believe
10:48:11  it's an esoteric language, so it may have esoteric implementation strategies
10:48:23  I was wondering whether someone would already know, not asking people to do research for me, of course.
10:49:39  I do know a few things that are surprisingly implemented with OS support:
10:50:08  one of libcoro's backend uses sigaltstack to set up stacks for newly created contexts in a somewhat portable way;
10:51:14  Windows has some neat OS support for userspace threading (though I think it doesn't go far enough).
10:51:45  It lets you transfer control to your scheduler when a thread blocks on a system call or page fault.
10:52:21  there is OS support to implement some atomic stuff, in the form of asking the OS set set some user-space flag if the OS context switches the process when some other user-space flag says that you're in some critical instruction sequence; this helps for single-processor systems on certain old processors that don't have cpu-supported atomic instructio
10:52:22  ns,
10:52:34  but these days I think they found a new modern use for it, I don't really recall what
10:57:06  shachaf: Sorry for all the negativity though. I'm mostly trying to convince myself that I shouldn't spend time going down this particular rabbit hole.
10:58:19  I thought I saw this claim repeated a bunch of times in the past but now I can't find any references to it.
10:58:54  Maybe it's the multi-core scheduling ("Dispatch") that I'm thinking of, though that seems like a different feature.
10:59:39  It's just too open-ended a question. There's a wide range of "OS support" ranging from a trivial system call (say something that fuses two other system calls that happen to occur together a lot) to special scheduler and memory system support for who-knows-what.
11:00:41  Your best bet is to find somebody who knows and I'm not that person :)
11:00:44  I know! I'm not asking you to invent or research plausible answers.
11:00:50  I wasn't even asking you at all.
11:01:09  I thought maybe typing the question in this channel would be a way to find somebody who knows.
11:01:27  Yeah, as I tried to explain, I'm susceptible to going down those trails... wasting a lot of time.
11:01:41  My fault really, not yours. You're just a fairly effective trigger.
11:02:51  (Without trying to be, I believe.)
11:02:58  Aha, I see.
11:04:43  Anyway I'm in the int-e fan club.
11:28:06 -!- cpressey has joined.
11:35:31 -!- Sgeo_ has joined.
11:37:33  shachaf: speaking of wasting time, did you ever finish any of those pillars in The Witless?
11:38:09  (I've had the misfortune of starting that game up again last weekend. But no, no completed pillar yet.)
11:39:13 -!- Sgeo__ has quit (Ping timeout: 245 seconds).
11:52:44 -!- Frater_EST has quit (Ping timeout: 244 seconds).
12:18:24  Functors adhere to a set of equational laws, so I have to imagine that they're algebraic structures in the sense of universal algebra. I also have to imagine that if I ask #haskell if they're ever studied this way, category theory will immediately come up, and won't go away.
12:19:19  cpressey: category theory may come up if you ask here as well
12:19:25  `? monad
12:19:26  Monads are just monoids in the category of endofunctors.
12:23:17 -!- ais523 has joined.
12:23:49  C-INTERCAL doesn't make use of any particular OS support, and I don't think CLC-INTERCAL does either (and am more certain that J-INTERCAL doesn't)
12:25:23  cpressey: functors are one of the building blocks of category theory; arguably the entire reason category theory was invented was to rigorously define "natural transformation" and those have functors as inputs and outputs, thus functors are kind-of a big deal in category theory
12:26:05  futexes are a good example of something that benefits from OS support, but they're only really of use in multithreaded programs
12:26:07  but what's the relationship to haskell Functors?
12:26:29  :k Functor
12:26:31  (* -> *) -> Constraint
12:26:47  I'm not sure how Haskell functors work
12:27:05  @src Functor
12:27:06  class Functor f where
12:27:06      fmap :: (a -> b) -> f a -> f b
12:27:08  @info Functor
12:27:09  Functor
12:28:42  if you pass a category-theoretic functor through curry-howard, you basically end up with a function f from types to types, that lets you map from an expression that takes type A and has a free variable list of type B, to an expressioin that takes type f(A) andd has a free variable list of type f(B)
12:28:58  the Haskell definition seems very close to that, it's just using lambdas rather than free variables
12:29:32  (the only reason the category-theoretic definition uses free variables is that there's no guarantee that function types actually exist in any given category, and in fact the input and output of a functor can belong to different categories)
12:33:14  hmm… different categories correspond to different programming languages under curry-howard
12:33:31  so that means that in theory, an fmap should be able to lift a function from one programming language into another
12:33:55  you can imagine a Haskell Functor such that f a is a Haskell type when a is, say, a Perl type
12:34:00  then fmap takes a Perl function and compiles it into the corresponding Haskell function
12:34:42 -!- ais523 has quit (Remote host closed the connection).
12:34:55 -!- ais523 has joined.
12:34:57  `? monad
12:34:59  Monads are just monoids in the category of endofunctors.
12:35:46 -!- hppavilion[1] has joined.
12:40:25  If I look at it purely algebraically, a functor is a unary operation on a monoid that preserves identity and distributes over composition.
12:42:21  So, like, ... toupper(string) is a functor?
12:43:06  toupper("H" .. "i") = toupper("H") .. toupper("i")
12:44:36  and of course, toupper("") = ""
12:45:23  [[Esolang:Community portal]]  https://esolangs.org/w/index.php?diff=65802&oldid=63833 * LyricLy * (+0) 
12:48:22  By the same token, monads must be algebraic structures of some kind, but their laws involve more machinery, so I thought I'd take a stab at functors first.
12:50:03 -!- hppavilion[1] has quit (Ping timeout: 245 seconds).
12:50:13  cpressey: something that confuses me when doing this, and confuses a lot of other people too, is that there are more levels of abstraction here than intuitively seems reasonable and it's easy to pick the wrong one
12:51:06  toupper isn't a functor because functors act at the type level (they operate on types, and lift functions between those types in a map-like way)
12:51:12  whereas toupper is a function that acts at the value level
12:51:24  the reason it's confusing is that all these various levels of abstraction look much the same, despite having subtle differences
12:53:02  I get annoyed doing category theory because my intuition nearly always ends up picking the wrong level of abstraction
12:53:18  There are no "types" in universal algebra, though.
12:53:38  I mean, there can be, you can introduce "sorts", but you're not required to.
12:54:03  Nothing in the algebraic definition of a functor seems to require sorts.
12:56:11  how do you declare what's a valid input to your functor, then?
12:56:15  toupper(6) isn't valid
12:57:02  If you're working with group theory, how do you declare what's a valid element of your group?
12:57:03  what? toupper(6) is totally valid, and its result is usually 6, depending on the locale
12:57:29  cpressey: this is the sort of problem that category theory is actually designed to solve
12:57:53  it takes all these "how do we define the domain of this?" problems and makes them explicit
12:58:09  so in the case of groups as seen by category theory, a group is a category with one object
12:58:15  wait... toupper acts on a string? no way, that directly contradicts to the C standard. it acts on a character.
12:58:24  wob_jonas: cpressey's toupper apparently does
12:59:13  the objects in category theory basically act as types for the arrows
12:59:19  so category theory says that in group theory, all values have the same type
12:59:22  (which makes sense)
12:59:53  ais523: I'm completely confused. I can't see how it's a "problem" to be solved.
13:00:04  anyway, functors can act on any type that exists in the language, by definition; I guess toupper on a group of strings under concatenation therefore actually is a functor, because there's only one type to map and it supports that type
13:01:58  Pick a monoid, you can define a functor on that monoid. In the toupper example, I picked a monoid of strings. Didn't give details, assumed people would understand strings, like you'd find in formal language theory and such.
13:01:59  cpressey: I guess my issue here is the "on a monoid" within "If I look at it purely algebraically, a functor is a unary operation on a monoid that preserves identity and distributes over composition."
13:02:09  functor are more general than that, you can define them even on things that aren't monoids
13:02:14  *functors
13:02:29  ``` set -e; >tmp/a.c echo $'#include\n#include\n''int main(void) { printf("toupper(8) = %d\n", toupper(8)); return 0; }'; gcc -Wall -O -o tmp/a.out tmp/a.c; tmp/a.out
13:02:30  toupper(8) = 8
13:02:48  ais523: You might be able to define them on semigroups. That seems to be hair-splitting a bit though?
13:03:04  You do need to define them on something that has a concept of composition.
13:03:08  cpressey: it's not hair-splitting at all; Functor in Haskell us /usually/ defined on things that are much more general than either monoids or semigroups
13:03:29  e.g. List is a functor in Haskell
13:03:37  ais523: A list is a monoid
13:04:03  cpressey: a specific /type/ of list is a monoid
13:04:14  but you can't do, say, [1] ++ ["a"]
13:04:36  List, the actual concept devoid of any specific/concrete element type, is a functor
13:05:36  ais523: Every kind of list you can define in Haskell is a monoid.
13:06:39  yes, but that isn't relelvant here; your definition of "a functor is a unary operation on a monoid that preserves identity and distributes over composition." doesn't apply to any specific type of list because the type of list is a monoid in its own right, not a unary operation on a monoid
13:07:36  perhaps less confusing as an example: Haskell's Maybe is a functor, but as far as I can tell it isn't a monoid and neither is a typical concrete type of Maybe such as Maybe Bool
13:08:19  ais523: How is fmap defined for Maybe?
13:08:53  cpressey: fmap f Nothing = Nothing; fmap f (Just x) = Just (f x)
13:10:28  (this operation is actually called "map" in both Java's and Rust's versions of Maybe)
13:12:23 -!- arseniiv has joined.
13:13:10  ais523: OK, I don't know what to say. I don't agree that what I'm talking about has anything to do with Haskell, but your objections seem to be based on that my statements don't make sense in the context of Haskell
13:13:35  @src Maybe Functor
13:13:35  Source not found. It can only be attributed to human error.
13:13:38  @src Functor Maybe
13:13:38  Source not found. Have you considered trying to match wits with a rutabaga?
13:13:42  @src fmap Maybe
13:13:42  Source not found. Sorry about this, I know it's a bit silly.
13:13:45  @src Maybe fmap
13:13:46  fmap _ Nothing  = Nothing
13:13:46  fmap f (Just a) = Just (f a)
13:14:33  cpressey: I don't think your definition of a functor is remotely related to my definition of a functor
13:14:45  it may be an extreme special case but it's missing the general case
13:14:56  and the general case requires category theory to define
13:15:26  I'll note that Haskell's Maybe *is* a Semigroup
13:15:32  Haskell doesn't actually get all that close to the general case, but its version is more general than yours and so it makes for easy examples
13:15:51  My version doesn't have types, and this makes it *less* general somehow?
13:16:43  If my version is less general, it's because I went with monoid instead of semigroup. I'm happy to backpedal on that.
13:16:47  cpressey: yes, because you're requiring everything that your functors apply to everything that exists in the universe of discussion, which is a major restriction
13:17:46  the existence of types makes things more general because it allows functors to specify how they behave when multiple different types are in use
13:17:59  "Types are useful when you have types"
13:19:04  I don't know, are you assuming I'm talking about programming? I'm not.
13:19:18  um
13:19:30  no, I'm using programming terminology though because I assumed that category-theoretic terminology wouldn't be understood
13:19:50  to the extent that things other than programming are interesting, types are useful outside of programming too
13:22:23  hmm… if we restrict ourself to one category and one object, we end up with a semigroup (as you say), and then the category-theoretical definition of "functor" collapses to "function on semigroup elements that preserves identity and preserves composition", which is your definition
13:22:27  without types, you end up trying to less-than compare a set of points to a 3xn matrix of complex numbers, or water your 
13:22:35  or microwave a kitten,
13:22:54  and you won't notice that you shouldn't do those things until you get a runtime exception such as the cat dying
13:23:04  wob_jonas: I don't think microwaving a kitten is a type error, it's a bad idea for other reasons though
13:23:21  hmm
13:24:14  cpressey: let me see if I can explain why functors are more general than the semigroup definition: suppose you have two /different/, unrelated, semigroups; but it's possible to define a map from one to the other which preserves identity and preserves composition
13:24:33  that's still a functor
13:24:55  (there are two generalisations from your definition to the full category-theoretical definition; Haskell generalises it in one dimension, the above example is the generalisation along the other dimensioin)
13:25:01  can you give a more concrete example for that?
13:25:25  wob_jonas: the simplest example is the degenerate map which maps everything from the first semigroup to the identity element of the second semigroup
13:26:05  ok but... that doesn't really answer cpressey's question
13:26:49  wob_jonas: I'm trying to answer the question "My version doesn't have types, and this makes it *less* general somehow?", by explaining one way in which the category-theoretical definition is more general than cpressey's is
13:27:22  you can think of more useful examples, e.g. there's a functor from the integers-plus-addition to the (integers mod 7)-plus-addition
13:27:25  that simply takes the value mod 7
13:27:40  preserves identity, preserves composition, it's useful to have a name for this sort of operation
13:27:56  isn't that called a monomorphism?
13:27:59  no
13:28:02  a homomorphism
13:28:07  make it a homomorphism
13:28:15  but I thought functor was something other than that
13:29:00  wob_jonas: well, yes, a functor is more general
13:29:07  or, hmm
13:29:12  I don't mean more general
13:29:14  a homomorphism /between semigroups/ is a type of functor
13:29:18  this isn't true for things other than semigroups, though
13:29:23  I thought homomorphisms just weren't functors
13:29:44  but I don't think I understand what a functor is
13:30:32  let's see… in a category, you have objects and arrows (with each object having an identity arrow, and arrows composing)
13:31:01  for example, in the category representing a semigroup, there's only one object, its identity arrow is the semigroup's identity, and more generally arrows are elements
13:31:44  ais523: I am still at a loss why your "more general" definition of functor, rejects that toupper() is a functor, while my "less general" defintion accepts that toupper() is a functor, as well as accepting all of your examples are functors as well.
13:31:57  but aren't the categories with arrows between supposed to be a generalization of algebraic structures with homomorphisms between?
13:32:11  a functor is a map between categories from objects to objects and arrows to arrows that preserves identity and composition
13:32:12  what is a "category representing a semigroup" then?
13:33:01  cpressey: it turns out that it doesn't reject that toupper is a functor, as long as your source and target categories are very limited (specifically they both have to be the semigroup category of strings under concatenation)
13:33:11  wob_jonas: a category with one object is equivalent to a semigroup
13:33:36  cpressey: I just hadn't realised you were considering such a limited universeof objects
13:33:39  ais523: Yeah, *I'm not thinking in category theory terms*.
13:34:04  hmm
13:34:30  so there's one object, plus an arrow for each element of the semigroup, and the arrows compose by the semigroup operation?
13:34:38  wob_jonas: right
13:35:00  so that's like the object with the internal morphisms
13:35:05  that makes sense
13:35:22  hmm no
13:35:23  not quite
13:35:40  but ok
13:35:48  cpressey: in this case I guess you have a valid definition of a special case of a functor (specifically, the case when you're only considering a single semigroup); and if you were working in other settings, the same more general definition could be used to provide a special-case definition for those settings too
13:36:25  ais523: I think that is more or less how abstract algebra works? The thing I said about group theory, remember.
13:36:55  There is usually no assumption that there are multiple kinds of objects you have to distinguish
13:37:15   Algebraic structures, with their associated homomorphisms, form mathematical categories. Category theory is a formalism that allows a unified way for expressing properties and constructions that are similar for various structures. 
13:37:38  And therefore we *must* analyze them with the tools of category theory
13:37:43  No thanks.
13:38:02  it's more, category theory is the tool that mathematicians use to specify how the various algebraic structures of abstract algebra relate to each other
13:39:39  It is *the* paradigm, can't escape it, huh.
13:39:47  my experience with category theory is that it's more or less impossible to do anything in abstract algebra that doesn't have a category-theoretical interpretation, and that is typically the most general possible interpretation; whether you actually want to think on that level or not is up to you, and it often isn't useful to do so
13:40:04  it's mostly only useful when you use it to take a proof from one area of mathematics and use it to prove a theorem in another
13:41:33  I hope I didn't give the impression that that was what I was aiming to do, because it wasn't.
13:43:44 -!- Frater_EST has joined.
13:44:06  well, I thought you were interested in learning about what functors were in general
13:45:20  "Functors adhere to a set of equational laws, so I have to imagine that they're algebraic structures in the sense of universal algebra. I also have to imagine that if I ask #haskell if they're ever studied this way, category theory will immediately come up, and won't go away."
13:45:39  in particular, I had no way of knowing that you were thinking of the definition as specialised to semigroups as the specific definition you were concentrating on, as opposed to merely being an example of the general definition
13:45:54  [[MUSYS]]  https://esolangs.org/w/index.php?diff=65803&oldid=65330 * Salpynx * (+189) Some new examples for an old language. I've started working on a simulator.
13:46:01  I'm not sure how you got "in general" from "in universal algebra".
13:46:33  Or even what "in general" means, in this context, to you.
13:47:00  I didn't realise you were considering a special case; "functor", to me, refers only to the general case
13:47:15  there's nothing in your statement that suggests that you have a specific special case of functors in mind
13:47:29  This is rather frustrating.
13:47:38  and the mention of #haskell increased the chance that you were thinking of a definition that's at least as general as Haskell's
13:48:19  fmap id = id; fmap (f . g) = (fmap f) . (fmap g)
13:49:24  I pointed out toupper() conforms to these laws; you said it's not a functor; then later you admitted, okay, it can be a functor.
13:49:40  there are /three/ Functor laws in Haskell
13:50:18  Better update https://wiki.haskell.org/Functor then
13:50:19  it doesn't comply with the third, which is fmap :: forall a b. (a -> b) -> f a -> f b
13:51:14  it's just that Haskell enforces that one by the compiler rather than making the user check that it applies manually, so it doesn't have to be written in a comment
13:52:18  now, the reason toupper is a functor on the semigroup of strings, even though it isn't a functor in Haskell, is that the semigroup of strings only has one type – strings – and we have f String = String and forall a b. a = String && b = String
13:52:55  but in Haskell, "f" has to be a type constructor and there's no type constructor f for which f String = String, also it's not true that forall a. a = String because Haskell has other types
13:53:43  Haskell has types. It sure does.
13:54:09  It has kinds, too!
13:55:05  I'm tempted to go correct that wiki page anyway; Haskell's Functor is not a general representation of mathematical functors, it is specialised to the case in which the type-level mapping is a type-level constructor (rather than a type-level function that isn't a type constructor)
13:56:32  (it's also specialised to categories whose objects are Haskell types, but given that it's being imlpemented in Haskell, that's forgivable)
14:04:27  cpressey: sorry if I annoyed you by the way; I'm really tired at the moment and that makes it harder for me to predict how my actions will affect other people emotionally
14:07:21 -!- Sgeo_ has quit (Read error: Connection reset by peer).
14:08:27 -!- Sgeo has joined.
14:32:44 -!- Frater_EST has left.
14:34:04  ais523: but isn't that limitation solved in a ghc extension, as in type families?
14:34:24 -!- wob_jonas has quit (Remote host closed the connection).
14:54:06 -!- ais523 has quit (Quit: quit).
15:15:32  [[User:YamTokTpaFa]]  https://esolangs.org/w/index.php?diff=65804&oldid=65163 * YamTokTpaFa * (+106) 
15:16:30  [[ArrowFuck]]  https://esolangs.org/w/index.php?diff=65805&oldid=62003 * YamTokTpaFa * (+60) +CATs
15:31:01 -!- cpressey has quit (Quit: WeeChat 1.4).
15:44:18  [[Special:Log/newusers]] create  * Ntrupin *  New user account
15:45:44 -!- zzo38 has joined.
15:55:04  [[Special:Log/newusers]] create  * EdgyNerd *  New user account
16:01:00 -!- b_jonas has joined.
16:21:04 -!- tromp has quit (Remote host closed the connection).
16:22:53 -!- tromp has joined.
16:26:25 -!- Phantom_Hoover has joined.
17:08:46 -!- FreeFull has joined.
17:14:17 -!- tromp has quit (Remote host closed the connection).
17:25:06 -!- tromp has joined.
17:31:43 -!- palaiologos has joined.
17:34:20 -!- palaiologos has quit (Remote host closed the connection).
17:34:35 -!- kspalaiologos has joined.
17:41:05 -!- kspalaiologos has quit (Remote host closed the connection).
17:56:38 -!- tromp has quit (Remote host closed the connection).
18:25:44 -!- tromp has joined.
18:42:26 -!- tromp has quit (Remote host closed the connection).
18:42:50 -!- tromp has joined.
18:51:27 -!- choochter has joined.
18:57:49 -!- choochter has quit (Quit: Leaving).
19:00:42  int-e: I haven't played that game in a long time.
19:00:52  I don't think I completed any pillars? I don't remember.
19:13:32 -!- tromp has quit (Remote host closed the connection).
19:39:48 -!- MDude has quit (Ping timeout: 244 seconds).
19:48:26 -!- tromp has joined.
19:52:31  Wow, long conversation about functors.
19:52:44  It looks like mostly people talking past each other?
19:53:05 -!- tromp has quit (Ping timeout: 250 seconds).
19:55:21  A monoid homomorphism is clearly a special case of a functor, and so is Haskell's Functor class.
19:55:41  What's all the argumentationing about?
20:02:23  Maybe *is* a functor, but it's a functor "on" Haskell functions, in the usage above.
20:02:53  The reason the "on a monoid" isn't general enough is that Haskell functions aren't a monoid because you have different types so you can't compose any arbitrary functions.
20:03:59  Whereas «[1] ++ ["a"]» is a red herring because that's not the functor operation that's being discussed ([Int] and [String] are both monoids, separately, and there are no type issues there).
20:04:13  I don't know whether cpressey logreads.
20:13:33 * kmc is back from surgery and feeling good.
20:16:05 -!- tromp has joined.
20:18:09  higan mchelloister
20:18:20 -!- tromp_ has joined.
20:19:17  hi
20:19:54  hichaf ben-kikello
20:20:37 -!- tromp has quit (Ping timeout: 252 seconds).
20:22:49 -!- tromp_ has quit (Ping timeout: 252 seconds).
20:37:23 -!- Lord_of_Life_ has joined.
20:39:40 -!- tromp has joined.
20:40:03 -!- Lord_of_Life has quit (Ping timeout: 245 seconds).
20:40:16 -!- Lord_of_Life_ has changed nick to Lord_of_Life.
21:32:12  kmc: congrats on surgery
21:33:31  ty
21:37:37 -!- AnotherTest has quit (Ping timeout: 252 seconds).
21:39:15 -!- xkapastel has quit (Quit: Connection closed for inactivity).
21:50:21  kmc is now a surgically-enhanced superhuman
21:51:46  something like that
21:52:52  do you do double damage now
21:52:53  https://www.supermegacomics.com/index.php?i=333
22:01:11  hmm glowing blue and quad damage
22:35:03 -!- FreeFull has quit.
23:45:46 -!- arseniiv has quit (Ping timeout: 246 seconds).

2019-08-31:

00:14:15 -!- Phantom_Hoover has quit (Read error: Connection reset by peer).
00:27:50 -!- Sgeo has quit (Read error: Connection reset by peer).
00:29:50 -!- Sgeo has joined.
01:04:18 -!- ais523 has joined.
01:13:20 -!- ais523 has quit (Remote host closed the connection).
01:14:33 -!- ais523 has joined.
02:31:54 -!- adu has joined.
02:34:52 -!- atslash has quit (Quit: This computer has gone to sleep).
03:01:55  I thought of a block format for encrypted communications, which could detect tampering and a few other stuff. Each variable size block has a header of four bytes, and then the data of that block. It is possible to transmit only part of a block at once and not the entire block. Also, this is separate from the block used in a block cipher.
03:03:02  The header would be:  [1] Checksum of all previous block data  [2] Sequence number  [3] Meaningless data  [4] Block data length
03:04:35  However, right at the beginning instead you will have a special block, which has a data length, random data of that length, and the verification code (which is digitally signed).
03:37:07 -!- hakatashi has quit (Remote host closed the connection).
03:37:30 -!- hakatashi has joined.
03:52:46 -!- ais523 has quit (Quit: quiit).
04:07:29 -!- adu has quit (Quit: adu).
04:32:57  [[User:Dtuser1337/sandbox]]  https://esolangs.org/w/index.php?diff=65806&oldid=65801 * Dtuser1337 * (+176) 
04:35:29  [[User:Dtuser1337/sandbox]]  https://esolangs.org/w/index.php?diff=65807&oldid=65806 * Dtuser1337 * (+10) 
04:37:56  [[User:Dtuser1337/sandbox]]  https://esolangs.org/w/index.php?diff=65808&oldid=65807 * Dtuser1337 * (+24) /* Beginning of the Sandbox line */
04:42:39  [[User:Dtuser1337/sandbox]]  https://esolangs.org/w/index.php?diff=65809&oldid=65808 * Dtuser1337 * (+19) /* commands */
04:44:22  [[User:Dtuser1337/sandbox]]  https://esolangs.org/w/index.php?diff=65810&oldid=65809 * Dtuser1337 * (+6) /* commands */
04:51:51  [[User:Dtuser1337/sandbox]]  https://esolangs.org/w/index.php?diff=65811&oldid=65810 * Dtuser1337 * (+1198) /* Beginning of the Sandbox line */
07:19:10 -!- tromp has quit (Read error: Connection reset by peer).
07:27:52  [[User:Dtuser1337/sandbox]]  https://esolangs.org/w/index.php?diff=65812&oldid=65811 * Dtuser1337 * (+45) /* commands */
07:30:59  [[User:Dtuser1337/sandbox]]  https://esolangs.org/w/index.php?diff=65813&oldid=65812 * Dtuser1337 * (+8) /* commands */
07:32:14  [[User:Dtuser1337/sandbox]]  https://esolangs.org/w/index.php?diff=65814&oldid=65813 * Dtuser1337 * (+35) /* commands */
07:33:27  [[User:Dtuser1337/sandbox]]  https://esolangs.org/w/index.php?diff=65815&oldid=65814 * Dtuser1337 * (+9) /* commands */
07:40:53  [[User:Dtuser1337/sandbox]]  https://esolangs.org/w/index.php?diff=65816&oldid=65815 * Dtuser1337 * (+151) /* commands */
07:41:07  [[User:Dtuser1337/sandbox]]  https://esolangs.org/w/index.php?diff=65817&oldid=65816 * Dtuser1337 * (+1) /* commands */
07:49:28  [[User:Dtuser1337/sandbox]]  https://esolangs.org/w/index.php?diff=65818&oldid=65817 * Dtuser1337 * (+49) /* commands */
07:59:34 -!- tromp has joined.
08:04:15 -!- tromp has quit (Ping timeout: 252 seconds).
08:05:11  [[User:Dtuser1337/sandbox]]  https://esolangs.org/w/index.php?diff=65819&oldid=65818 * Dtuser1337 * (+304) /* commands */
08:27:00 -!- AnotherTest has joined.
08:40:03 -!- Lord_of_Life has quit (Ping timeout: 245 seconds).
08:42:26 -!- Lord_of_Life has joined.
09:01:20 -!- FreeFull has joined.
09:21:41 -!- Frater_EST has joined.
09:24:02 -!- FraterEST has joined.
09:26:59 -!- Frater_EST has quit (Ping timeout: 244 seconds).
09:27:14  [[Esolang:Sandbox]] M https://esolangs.org/w/index.php?diff=65820&oldid=65797 * Dtuser1337 * (+29) Kono dio da!
09:28:14  [[User:Dtuser1337/sandbox]]  https://esolangs.org/w/index.php?diff=65821&oldid=65819 * Dtuser1337 * (+19) /* examples */
09:28:22 -!- FraterEST has quit (Ping timeout: 245 seconds).
09:34:17  [[User:Dtuser1337/sandbox]]  https://esolangs.org/w/index.php?diff=65822&oldid=65821 * Dtuser1337 * (+142) 
09:48:57  [[User:Dtuser1337/sandbox]]  https://esolangs.org/w/index.php?diff=65823&oldid=65822 * Dtuser1337 * (+141) /* commands */
09:54:06  [[Madbrain]]  https://esolangs.org/w/index.php?diff=65824&oldid=58616 * Gamer * (-10) /* Hello, World! */
09:58:13 -!- Frater_EST has joined.
10:01:25  [[Brainfuck implementations]] M https://esolangs.org/w/index.php?diff=65825&oldid=65530 * A * (-7) /* Normal implementations */
10:03:34  [[Ecndpcaalrlp]] M https://esolangs.org/w/index.php?diff=65826&oldid=61359 * A * (+2) /* Implementation */ Delete my GH repositories
10:04:59  [[Madbrain]]  https://esolangs.org/w/index.php?diff=65827&oldid=65824 * Gamer * (+0) /* Hello, World! */
10:05:00  [[User:Dtuser1337/sandbox]]  https://esolangs.org/w/index.php?diff=65828&oldid=65823 * Dtuser1337 * (+101) /* commands */
10:05:20  [[Madbrain]]  https://esolangs.org/w/index.php?diff=65829&oldid=65827 * Gamer * (+0) /* Hello, World! */
10:07:05  [[User:Dtuser1337/sandbox]]  https://esolangs.org/w/index.php?diff=65830&oldid=65828 * Dtuser1337 * (+77) 
10:08:06  [[User:Dtuser1337/sandbox]]  https://esolangs.org/w/index.php?diff=65831&oldid=65830 * Dtuser1337 * (+25) /* commands */
10:10:58  [[User:Dtuser1337/sandbox]]  https://esolangs.org/w/index.php?diff=65832&oldid=65831 * Dtuser1337 * (+15) /* conditional functions */
10:13:05  [[Special:Log/move]] move  * Dtuser1337 *  moved [[User:Dtuser1337/sandbox]] to [[User:Dtuser1337/Sandbox]]: Making these "S" uppercase
10:16:18  [[Esolang talk:Sandbox]] M https://esolangs.org/w/index.php?diff=65835&oldid=44559 * Dtuser1337 * (-46) Blanking without reason.
10:27:22  [[Madbrain]]  https://esolangs.org/w/index.php?diff=65836&oldid=65829 * Gamer * (-56) /* Hello, World! */
10:33:36  [[Madbrain]]  https://esolangs.org/w/index.php?diff=65837&oldid=65836 * Gamer * (+2) /* Implementation (Python) */
10:35:28 -!- Lord_of_Life has quit (Read error: Connection reset by peer).
10:36:49 -!- Lord_of_Life has joined.
10:55:43 -!- arseniiv has joined.
11:01:53  [[Piet++]]  https://esolangs.org/w/index.php?diff=65838&oldid=58418 * Dtuser1337 * (+27) I used my stand [Za Hando] to add a new category :D
11:21:08  [[Salt]] M https://esolangs.org/w/index.php?diff=65839&oldid=65791 * A * (+167) 
11:54:13 -!- Frater_EST has quit (Ping timeout: 245 seconds).
12:36:30  the hideous daystar is confusing my thermometer. it says that it's 62°C outdoors, which is definitely false
12:36:52  but there's nowhere I can place it here such that it never gets in direct sunshine
12:37:04  the apartment doesn't have windows facing in other directions
12:45:24  Re https://esolangs.org/logs/2019-08-29.html#lqf , yes, the dubbing of the Harry Potter movie is changed between the british and american releases to adjust for "Sorcerer's" vs "Philosopher's" in the dialogs. https://www.youtube.com/watch?v=dAniYhY_a24
12:46:04 -!- tromp has joined.
12:50:37 -!- tromp has quit (Ping timeout: 252 seconds).
12:55:06 -!- atslash has joined.
13:05:01 -!- Frater_EST has joined.
13:10:26 -!- atslash has quit (Quit: This computer has gone to sleep).
13:14:09  [[User:Dtuser1337/Sandbox]]  https://esolangs.org/w/index.php?diff=65840&oldid=65833 * Dtuser1337 * (+87) /* commands */
13:17:03  [[User:Dtuser1337/Sandbox]]  https://esolangs.org/w/index.php?diff=65841&oldid=65840 * Dtuser1337 * (+15) /* conditional functions */
13:20:43  [[User:Dtuser1337/Sandbox]]  https://esolangs.org/w/index.php?diff=65842&oldid=65841 * Dtuser1337 * (+133) /* commands */
13:32:33  [[User:Dtuser1337/Sandbox]]  https://esolangs.org/w/index.php?diff=65843&oldid=65842 * Dtuser1337 * (+77) /* commands */
14:17:59  [[Esolang:Sandbox]] M https://esolangs.org/w/index.php?diff=65844&oldid=65820 * A * (+25) 
14:18:29  [[Esolang talk:Sandbox]] M https://esolangs.org/w/index.php?diff=65845&oldid=65835 * A * (+49) Talk page is also a sandbox
14:34:34 -!- tromp has joined.
14:39:09 -!- tromp has quit (Ping timeout: 252 seconds).
14:40:35  [[Salt]] M https://esolangs.org/w/index.php?diff=65846&oldid=65839 * A * (-749) 
14:42:33  [[Salt]]  https://esolangs.org/w/index.php?diff=65847&oldid=65846 * A * (+38) 
14:43:01 -!- Frater_EST has quit (Remote host closed the connection).
15:21:33 -!- tromp has joined.
15:43:53 -!- AnotherTest has quit (Quit: ZNC - http://znc.in).
15:44:11 -!- AnotherTest has joined.
15:47:32 -!- Sgeo has quit (Ping timeout: 245 seconds).
16:07:25 -!- tromp has quit (Remote host closed the connection).
16:23:46 -!- Phantom_Hoover has joined.
16:23:46 -!- Phantom_Hoover has quit (Changing host).
16:23:46 -!- Phantom_Hoover has joined.
16:24:18 -!- Melvar has quit (Ping timeout: 268 seconds).
16:40:04 -!- atslash has joined.
16:46:41 -!- tromp has joined.
16:48:57 -!- tromp has quit (Remote host closed the connection).
16:49:13 -!- tromp has joined.
17:04:20 -!- Melvar has joined.
17:08:23 -!- tromp has quit (Remote host closed the connection).
17:41:14  b_jonas: ow… At least the thermometer doesn’t overflow
17:41:49 -!- tromp has joined.
17:43:45 -!- tromp has quit (Remote host closed the connection).
17:43:59 -!- tromp has joined.
17:44:01  and we here have an unusually cold weather, it should be 7…12° tomorrow. I’d hoped for twenties still, it’s mid-September when it should be becoming sufficiently chiller (and then, only worse)
17:44:34  (and it will, hopefully there would be a handful of warm days still, but not this week?)
17:44:36  [[Brainfuck implementations]]  https://esolangs.org/w/index.php?diff=65848&oldid=65825 * Total Vacuum * (+91) 
17:45:00  °C
17:45:11  .
18:04:10 -!- Lord_of_Life has quit (Ping timeout: 244 seconds).
18:21:28 -!- tromp has quit (Remote host closed the connection).
18:42:28 -!- tromp has joined.
18:59:20 -!- Lord_of_Life has joined.
19:07:10 -!- Phantom_Hoover has quit (Remote host closed the connection).
19:10:46 -!- Phantom_Hoover has joined.
19:19:58  One possible substitute for adding a driver in Ghostscript might be to make a "pseudo-driver" by writing PostScript codes to override some of the operators for making output.
19:32:00 -!- AnotherTest has quit (Ping timeout: 244 seconds).
20:01:13 -!- Sgeo has joined.
20:40:12 -!- Lord_of_Life_ has joined.
20:41:13 -!- Lord_of_Life has quit (Ping timeout: 246 seconds).
20:43:07 -!- Lord_of_Life_ has changed nick to Lord_of_Life.
20:45:22 -!- atslash has quit (Ping timeout: 244 seconds).
20:45:48 -!- atslash has joined.
20:57:44  "RESOLVED:  ARB_vertex_program.  DirectX 8 refers to its similar
20:57:44        functionality as "vertex shaders".  This is a confusing term because
20:57:44        shaders are usually assumed to operate at the fragment or pixel level,
20:57:44        not the vertex level."
20:58:31  i always heard them called vertex shaders in opengl
20:59:34  Yes. I think this is an extension from before that was a thing, introducing the concept to OpenGL to the first time
21:00:11  https://www.khronos.org/registry/OpenGL/extensions/ARB/ARB_vertex_program.txt
21:00:30  ...there's also an incompatible extension called EXT_vertex_shader that this competed with
21:09:07  I'm looking at WineD3D's OpenGL calls and being utterly perplexed that it's using this
21:13:25 -!- atslash has quit (Ping timeout: 246 seconds).
21:14:07 -!- atslash has joined.
21:18:05  What is the PostScript XUID organization code for UUID?
21:19:48 -!- xkapastel has joined.
22:15:08 -!- Lykaina has joined.
22:15:28  is this code esoteric enough?
22:15:48  d l r o w  o l l e H 
22:16:10  What programming language is it?
22:16:16  my own
22:16:25  oops
22:17:10  d l r o w  o l l e H           
22:19:22  is that the riight number of "character outputs"?
22:19:27  It look like it can be a stack based program language maybe. (But, if you want to write on wiki then you can.)
22:20:10  i don't
22:20:20  OK
22:20:44  just discussing it
22:21:14  OK
22:24:10  Lykaina: is that like unlambda ```````````.H.e.l.l.o. .w.o.r.l.di but backwards?
22:25:41  not sure
22:26:15  [[PLEASE]]  https://esolangs.org/w/index.php?diff=65849&oldid=55992 * Rdebath * (+14) Turing-Completeness unknown
22:40:20  [[Deadfish]]  https://esolangs.org/w/index.php?diff=65850&oldid=65599 * Zzo38 * (+297) PostScript
22:42:06 -!- Lykaina has quit (Quit: leaving).
22:46:18 -!- arseniiv has quit (Ping timeout: 245 seconds).
22:54:45 -!- MDude has joined.
23:21:49 -!- tromp has quit (Remote host closed the connection).
23:59:59 -!- tromp has joined.