00:03:52 hmm, it looks like I have the last-but-one version of a few of the files (I configured Emacs to save the last-but-one version of each file I edit in an entirely separate directory tree, to help recover from issues where I accidentally delete an entire directory tree) 00:03:54 but not all of them 00:05:13 I don't understand Nomyx's claim "This is the first complete implementation of a Nomic game on a computer. " 00:05:14 actually, maybe all of them 00:05:18 What about PerlNomic? 00:05:27 and Schemenomic 00:05:50 Sgeo: historical ignorance hth 00:06:21 -!- tromp_ has joined. 00:07:16 would be nice to get the actual latest verison though 00:07:19 ais523: If you have issues like that regularly you have a problem hth 00:07:36 izabera: apparently I don't have a full version on my most recent computer 00:07:46 Sgeo: Lying and false advertising hth 00:07:53 hppavilion[1]: I don't, I back things up regularly; /but/ gcc-bf wasn't included in some of my older backups because disks were smaller back then 00:08:28 we're talking about a project that was last worked on in 2008 00:09:50 and it just wouldn't fit onto the backup disk at the same time as everything else (because for some reason I didn't just backup the diffs against gcc) 00:20:55 -!- augur_ has changed nick to augur. 00:25:42 -!- bb010g has joined. 00:29:14 -!- tromp_ has quit (Remote host closed the connection). 00:34:47 The server my standard fungot load script is trying to use seems to not be answering. 00:35:47 -!- fungot has joined. 00:41:10 fizzie: There's fungot 00:41:10 hppavilion[1]: and when the loop ended 00:41:22 Very deep. 00:41:34 fungot: Y-Y-yes? What happened to her? Did the out-of-memory monster get her? 00:41:34 hppavilion[1]: i'm also running bfbot.) .b.) does not evaluate anything after the... in ( ( fnord 3) is not 00:42:58 A Funge bot running a brainfuck bot inside it. 00:43:06 That's bizarre. 00:43:09 fungot: You're bizarre. 00:43:09 fizzie: every time the fnord came, we thought the government took him out after all. 00:43:19 Bizarre and politically active. 00:51:41 -!- jaboja has joined. 00:56:03 -!- tromp_ has joined. 01:01:34 fungot: o hai! 01:01:34 boily: my complaint of " why don't i unask the question, a moment. 01:08:01 iijm, or has fungot gotten less coherent recently? 01:08:01 hppavilion[1]: for example to be similar to al* petrofsky's proposal for srfis a few years ago 01:08:15 hppavilion[1]: probably a ^style thing 01:08:19 ^style 01:08:19 Available: agora alice c64 ct darwin discworld enron europarl ff7 fisher fungot homestuck ic irc* iwcs jargon lovecraft nethack oots pa qwantz sms speeches ss wp youtube 01:08:27 ^style europarl 01:08:27 Selected style: europarl (European Parliament speeches during approx. 1996-2006) 01:08:33 fungot: are you more coherent like this? 01:08:35 ais523: since sweden is not taking this disquiet felt by the various levels of government. it is better than a bad treaty. instead we should be in all of the political problems are resolved and people become more interested in the best position to do so, and then cram everything it wants into its own decision-making process, the status envisaged would also be a condition which must be protected when it is a proposal for a decis 01:12:01 olsner: Sweden does not take disquiet felts. how does that make you feel? 01:12:33 frankly it's a disgrace, but I feel like the problem is out of my hands 01:13:27 no respect for other people's yurt 01:15:46 * oerjan wonders if the pun was too subtle 01:17:01 there was a pun? 01:17:05 * boily pokes shachaf 01:17:13 ouch 01:17:19 shachaf: care to explain please? 01:17:20 more of a mapole than a poke if you ask me 01:17:37 I already mapoled you by accident once. 01:19:22 seriously, just look up "yurt" hth 01:19:40 * oerjan weeps over the dissected body 01:20:08 “A traditional yurt [...] tent [...] felt...” 01:20:16 * boily automapoles himself 01:20:20 -!- hppavilion[1] has quit (Ping timeout: 256 seconds). 01:20:39 fascinating 01:21:38 <\oren\> 今ボアリは! 01:22:18 コンボレンは! 01:24:47 [wiki] [[Talk:NRSRSSOMN]] N https://esolangs.org/w/index.php?oldid=46385 * 50.161.94.113 * (+47) Created page with "What about a NRSRSSOMN-3 with [] instead of ()?" 01:31:20 -!- lynn has quit (Ping timeout: 250 seconds). 01:45:11 -!- jaboja has quit (Remote host closed the connection). 01:57:40 -!- boily has quit (Quit: EQUILATERAL CHICKEN). 02:11:11 -!- heroux_ has joined. 02:11:13 -!- mihow has quit (Quit: mihow). 02:14:26 -!- Sgeo has quit (Ping timeout: 240 seconds). 02:15:30 -!- myname has quit (*.net *.split). 02:15:30 -!- heroux has quit (*.net *.split). 02:15:31 -!- coppro has quit (*.net *.split). 02:15:34 -!- heroux_ has changed nick to heroux. 02:16:11 -!- coppro has joined. 02:16:43 -!- myname has joined. 02:18:54 -!- Sgeo has joined. 02:23:12 -!- Alcest has joined. 02:31:47 -!- Phantom_Hoover has quit (Read error: Connection reset by peer). 02:48:38 -!- Sprocklem has joined. 02:53:46 -!- ais523 has quit (Ping timeout: 240 seconds). 03:12:26 [wiki] [[CASTLE]] https://esolangs.org/w/index.php?diff=46386&oldid=45957 * Quintopia * (+361) /* Examples */ 03:12:52 [wiki] [[CASTLE]] M https://esolangs.org/w/index.php?diff=46387&oldid=46386 * Quintopia * (-2) /* Examples */ 03:13:30 [wiki] [[CASTLE]] M https://esolangs.org/w/index.php?diff=46388&oldid=46387 * Quintopia * (+0) /* Examples */ 03:19:46 -!- hppavilion[1] has joined. 03:20:22 -!- shikhin_ has changed nick to shikhin. 03:25:45 Fueue⁂'s example program works :) 03:26:04 + 20 5 print 03:28:37 [wiki] [[CASTLE]] https://esolangs.org/w/index.php?diff=46389&oldid=46388 * Quintopia * (-15) /* Examples */ 03:31:59 [wiki] [[CASTLE]] https://esolangs.org/w/index.php?diff=46390&oldid=46389 * Quintopia * (+0) /* Examples */ 03:41:57 `unidecode ⁂ 03:42:03 ​[U+2042 ASTERISM] 03:42:21 hppavilion[1]: now port my bf interpreter hth 04:07:43 https://en.wikipedia.org/wiki/Panda_%28plant%29 04:07:59 oerjan: Port what to where? Fueue⁂? 04:10:45 https://en.wikipedia.org/wiki/Category:Individual_giant_pandas 04:11:13 You know your species is in trouble when it has something like that 04:16:02 https://en.wikipedia.org/wiki/Panda_cow 04:16:56 https://en.wikipedia.org/wiki/Pandas_%28software%29 04:17:37 https://en.wikipedia.org/wiki/Giant_panda#Uses_and_human_interaction 04:17:40 "Uses" 04:21:21 I like pandas suddenly 04:21:45 But not as much as walruses 04:23:07 walruses, the pandas of the sea 04:23:32 oerjan: Port what to where? Fueue⁂? <-- of course 04:23:33 Pretty much 04:27:32 oerjan: Why YOUR brainfuck interpreter? 04:31:42 well you're welcome to write your own BF interpreter in Fueue to port hth 04:32:30 oerjan: Oh, your BF interpreter was written IN fueue? 04:32:45 of course. it's on the wiki page. 04:32:50 Oh 04:32:59 tdh(etydhm) 04:33:33 Somebody should make a non-primitive-recursive acronym 04:33:41 even though you ... 04:34:13 you didn't break the rule against making d mean don't/didn't, did you 04:34:41 (hidden negatives in acronyms are scow) 04:34:48 Yes, yes they are 04:35:03 shachaf: Does your client go off whenever somebody says "scow" 04:35:39 he's a teeny bit idle, me thinks 04:35:46 "Computational Class" in the Fueue article isn't very well-placed 04:35:53 wat 04:36:08 oerjan: Because it's right under your BF interpreter, thus stealing the proof's thunder 04:37:18 well i wrote both so who cares 04:37:38 the proof is probably easier to understand 04:38:12 oerjan: Ah, true, true 04:38:38 and was a prerequisite for understanding how to write the interpreter 04:38:41 -!- Sgeo_ has joined. 04:39:58 Ah 04:40:16 the CPS idea, as well as how to synchronize things 04:40:18 oerjan: I remember somebody saying there was a big argument on the wiki over whether or not a quineless language would be TC 04:40:31 yes 04:40:32 -!- Sgeo has quit (Ping timeout: 276 seconds). 04:40:37 imo it can. 04:41:02 Well sure. Who says the language has any sort of IO capabilities? 04:41:14 because TC doesn't say anything about output needing to be easy to control 04:41:32 A language which cannot output any valid strings which are in that language can still be TC, but certainly won't have quines. 04:41:59 pikhq_: Yes, I agree 04:42:20 oerjan: I was wondering if you knew exactly where that argument was xD 04:42:24 however, if you can translate any IO-using program with the same alphabet to your language, _then_ it must have a quine. 04:42:33 I'm feeling like reading some people being wrong 04:43:25 pikhq_: A language written only using non-unicode characters? 04:43:42 Then, of course, you have the picture-based language 04:43:49 How is THAT Expected to quine? 04:44:10 BTW, the example program for fueue*** is + 20 5 print 04:47:37 dammit, i know the page but it has a unicode name so i don't know how to search for it 04:48:29 http://esolangs.org/wiki/User_talk:Smjg 04:48:58 oh that one too 04:50:22 I figured out a way to represent a C-like language with Regex, I think 04:50:57 Though now that I think about it, nesting may be an... wait, no it isn't 04:52:55 Well, it can half-recognize it, at least 04:54:36 The idea was to use `...` (quotes) instead of matched brackets 04:54:37 depends on your regexes, i think 04:54:54 And nested things are done with backslashes 04:55:25 ...have you looked at /// 04:55:27 CHALLENGE: Write a TC language with an FSM parser 04:55:35 oerjan: Occasionally 04:55:38 you've been here long enough that you must have 04:55:44 It's my favorite URL 04:55:45 oerjan: "Regular expression', surely, not PCRE. :) 04:56:28 does P stand for perl or posix 04:56:30 I would like to see a high-level language based on string substitution ;) 04:56:40 oerjan: P'' 04:56:44 hth 04:58:43 hppavilion[1]: https://esolangs.org/wiki/Jot 04:59:07 oerjan: Yes? 04:59:41 I'm thinking more like Thue or /// 04:59:55 it's parser is trivial hth 05:00:03 i suppose /// too 05:00:36 although sometimes the program halts due to non-matching / 05:01:07 -!- Melvar` has joined. 05:01:08 hm right, Thue probably too... 05:01:28 Ah 05:01:46 oerjan: TC language with a decision tree parser >:) 05:01:48 all of them have no nesting in the grammar afair 05:02:14 (Yes, yes, I know. Almost certainly impossible) 05:02:43 hppavilion[1]: no, it's actually trivial but it's on the page i was trying to find earlier... 05:02:57 Wait, really? 05:03:36 -!- Melvar has quit (Ping timeout: 256 seconds). 05:03:40 I mean I guess the language with the instruction `bf` (interpret brainfuck) has a DT parser... 05:03:58 Debatably 05:04:07 Depends on if you count reparsing 05:04:09 Coparsing? 05:04:22 `unicode SCRIPT CAPITAL L 05:04:28 I know. 05:04:31 ​ℒ 05:04:53 I visited that page recently 05:04:53 https://esolangs.org/wiki/%E2%84%92 hth 05:05:46 obviously, the one legal program can be parsed with a decision tree 05:06:22 Damn 05:06:25 Anything lower? 05:06:38 I guess the = machine is lower 05:06:42 SKEPTICAL 05:06:46 But still L-complete 05:08:29 oerjan: I suppose the only thing lower than the = machine is the NOPE machien 05:08:32 *machine 05:08:54 OKAY 05:09:41 oerjan: What do you think would be ideal for a high-level Thue? 05:13:20 i think that's an oxymoron. 05:14:29 or maybe that SNOBOL thing i've heard a little about. 05:15:11 i mean, if it's string-based with no structure, how can it be high-level 05:15:36 and if it has structure, then you've got TCL 05:15:40 oerjan: Well, a high-level string substitution-based language 05:15:46 That isn't sed 05:16:21 i suppose you could use a CF-grammar... 05:16:45 to recognize what do substitute. 05:16:57 *to 05:18:01 still feels oxymoronic 05:20:49 oerjan: U callin me a moron, m8? 05:21:29 IMHO, wikipedia shouldn't have citations on mathematics articles. 05:21:40 At least, not in the explanation of what it's all about 05:21:41 U so moronic you don't deserve the oxygen, is wat i'm saying 05:22:00 aND NOW THERE'S A CAT IN THEW AY OF MY SCREEN 05:22:22 Oh, caps lock 05:22:27 inline citations are the Law (TM) 05:22:43 although not so much in the intro. 05:23:00 oerjan: But wikipedia shouldn't NEED citations in mathematics. Math is true whether you cite it or not. 05:23:12 Unless, y'know, the proof is really really long 05:23:14 * oerjan is finally starting to learn how to make them 05:23:21 Like, wikipedia-sized 05:23:42 hppavilion[1]: [citation needed] 05:24:04 -!- Melvar` has quit (Read error: Connection reset by peer). 05:24:12 * oerjan cuts off the oxygen supply to hppavilion[1]'s part of the channel 05:24:16 oerjan: Hitler was a bad person^[citation needed]^[citation needed]^[citation needed]^[citation needed]... 05:24:25 `? #esoteric 05:24:30 ​#esoteric is the only channel that exists. monqy is its centroïd. It's about 30 m (100 ft) across. 05:24:39 -!- Melvar` has joined. 05:24:49 Is it really big enough for air ducts and airtight chambers? 05:26:27 `le/rn #programming/No such channel. See `? #esoteric 05:26:34 Learned «#programming» 05:27:08 hppavilion[1]: https://en.wikipedia.org/wiki/Wikipedia:You_don%27t_need_to_cite_that_the_sky_is_blue 05:27:39 [citation needed] 05:28:11 "Ideally, common sense would always be applied but Wiki-history shows this is unrealistic." 05:28:46 https://en.wikipedia.org/w/index.php?title=Finger&diff=prev&oldid=166357603 05:29:17 oerjan: Somebody needs to blanket that article with [citation needed]s 05:29:26 `? citation 05:29:28 citation? ¯\(°​_o)/¯ 05:29:34 `le/rn citation/needed 05:29:39 Learned «citation» 05:29:56 `tomfoolery #esoteric 05:29:58 I must confess, I know not of what you are speaking. 05:30:15 https://en.wikipedia.org/wiki/Wikipedia:You_do_need_to_cite_that_the_sky_is_blue 05:30:32 hppavilion[1]: No, why would it? 05:30:45 shachaf: ? 05:30:49 What are you referring to? 05:31:00 scow 05:31:03 Ah 05:31:06 -!- Melvar`` has joined. 05:31:06 Not sure 05:31:19 My thing alerts me whenever someone says "walrus" 05:31:21 *client 05:31:44 `misle/rn #esoteric/#esoteric is the channel you are currently on, unless HackEgo's spreading. We mostly chat about esolangs, or at least in theory. 05:31:47 Was lied to about «#esoteric» 05:31:52 -!- Melvar` has quit (Ping timeout: 250 seconds). 05:31:53 `? #esoteric 05:31:54 ​#esoteric is the only channel that exists. monqy is its centroïd. It's about 30 m (100 ft) across. 05:32:01 `tomfoolery #esoteric 05:32:02 ​#esoteric is the channel you are currently on, unless HackEgo's spreading. We mostly chat about esolangs, or at least in theory. 05:32:48 `cat bin/? 05:32:49 ​#!/bin/sh \ topic=$(echo "$1" | lowercase | sed "s/noo\+dl/nooodl/;s/ *$//") \ topic1=$(echo "$topic" | sed "s/s$//") \ cd wisdom \ if [ \( "$topic1" = "ngevd" \) -a \( -e ngevd \) ]; \ then cat /dev/urandom; \ elif [ -e "$topic" ]; \ then cat "$topic" | rnooodl; \ elif [ -e "$topic1" ]; \ then cat "$topic1" | rnooodl; \ 05:33:05 hm right 05:33:30 `? tom 05:33:31 tom? ¯\(°​_o)/¯ 05:33:37 `tomfoolery to 05:33:38 I must confess, I know not of what you are speaking. 05:33:40 `tomfoolery tom 05:33:41 I must confess, I know not of what you are speaking. 05:34:05 `ls tmflry 05:34:06 c++ \ C++ \ cat \ esolang \ esolangs \ #esoteric \ fs \ hth \ mapole \ `mislearn \ random number \ the meaning of life \ tomfoolery \ wisdom 05:34:25 `tomfoolery cat 05:34:26 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). 05:35:15 `? cat 05:35:16 Cats are cool, but should be illegal. 05:35:29 I thought Cat was the category of categories and functors. 05:35:44 perhaps `le/rn cat/Cats are cool, but should be illelaksjfa;oiesjfaseoiu;AKJDFOAIELKAJOEIU203RUIVMM 05:35:58 Look. 05:36:07 wisdom isn't a database of lies 05:36:08 Looking 05:36:18 Whether something is true is irrelevant. 05:36:26 shachaf: Yes, it is, that's why we created `tomfoolery 05:38:44 -!- bb010g has quit (Quit: Connection closed for inactivity). 05:41:35 "If the alternate proposition merits inclusion in the article under other policies and guidelines it should of course be included, but it should in no way be given greater prominence because it is sourced." 05:41:40 --WIKIPEDIA 05:41:49 , 20SOMETHING 05:55:10 -!- hppavilion[1] has quit (Ping timeout: 256 seconds). 06:18:46 so annoying, even googling llvm-bf leads to stuff like https://github.com/nojb/llvm-bf aka brainfuck compilers, not compilers to brainfuck........ 06:20:08 -!- Melvar has joined. 06:22:34 -!- Melvar`` has quit (Ping timeout: 252 seconds). 06:43:31 There is http://www.xanxys.net/hs2bf/ 06:43:47 there's still a problem though 06:44:00 they compiled an alien language to brainfuck 06:45:30 it's p. close to haskell hth 06:45:59 haskell is eye-gouging 06:46:10 -!- tjt263_ has quit (Read error: Connection reset by peer). 06:46:29 * izabera can't learn that 06:47:34 i,i gains kell until end of turn 06:47:42 -!- tjt263_ has joined. 06:48:34 -!- perrier_ has quit (Remote host closed the connection). 06:49:20 Anyway if you don't like Haskell you can use one of its intermediate languages. 06:51:21 -!- perrier_ has joined. 06:53:30 ok let me learn a haskell... 06:54:27 how hard can it be 06:54:35 and btw haskell qualifies as esoteric 07:00:09 <\oren\> nah, there's a a secret syntax allowing you to write it like an imperative language 07:00:24 ;-; liar 07:00:28 -!- lynn has joined. 07:01:20 <\oren\> http://learnyouahaskell.com/input-and-output 07:01:35 <\oren\> scroll down ad see the "do" block. 07:01:49 wait i was still here http://learnyouahaskell.com/starting-out 07:02:12 * oerjan swats \oren\ for sabotaging the assimilation process -----### 07:02:13 * izabera slow reader 07:02:29 -!- tjt263_ has quit (Read error: Connection reset by peer). 07:02:57 what does prelude mean? 07:03:13 Prelude is the default imported module 07:04:07 -!- tjt263_ has joined. 07:04:42 ok so /= is != because we want to be weird so we change != to /= 07:05:14 nah haskell just inherits from a different tradition 07:05:40 of languages that want to be weird so they change != to /= 07:06:37 != is the weird one 07:06:38 How exciting! 07:07:00 What's with "!"? Why does that mean "not"? 07:07:04 != 07:07:04 How exciting! 07:08:16 <\oren\> @hoogle itoa 07:08:17 Graphics.Rendering.OpenGL.GL.PixelRectangles.PixelMap IToA :: PixelMapTarget 07:08:17 Network.HTTP.Base uriToAuthorityString :: URI -> String 07:08:23 <\oren\> idiots 07:08:26 back in 1989 C wasn't the universal syntax it is now 07:08:33 <\oren\> why is there no itoa 07:08:43 > show 10 07:08:45 "10" 07:08:57 <\oren\> @hoogle Int -> String 07:08:58 Test.QuickCheck.Text number :: Int -> String -> String 07:08:58 Test.QuickCheck.Text short :: Int -> String -> String 07:08:58 Language.Haskell.Pretty prettyPrint :: Pretty a => a -> String 07:09:01 because there's a more general function. 07:09:18 :t showIntAtBase 07:09:20 (Integral a, Show a) => a -> (Int -> Char) -> a -> ShowS 07:09:25 :t show 07:09:27 <\oren\> @hoogle String -> Maybe Int 07:09:27 Show a => a -> String 07:09:28 Network.BSD ifNameToIndex :: String -> IO (Maybe Int) 07:09:28 Test.HUnit.Base Label :: String -> Node 07:09:28 Network.CGI.Protocol maybeRead :: Read a => String -> Maybe a 07:09:55 <\oren\> @hoogle String -> Int 07:09:55 Test.HUnit.Base Label :: String -> Node 07:09:55 Test.QuickCheck.Test labelPercentage :: String -> State -> Int 07:09:55 Prelude error :: [Char] -> a 07:10:02 -!- tromp_ has quit (Remote host closed the connection). 07:10:16 <\oren\> whar is mai scanf? 07:12:01 > read "10" :: Int 07:12:03 10 07:12:39 <\oren\> @t read 07:12:40 Maybe you meant: tell thank you thanks thesaurus thx tic-tac-toe ticker time todo todo-add todo-delete type v @ ? . 07:12:52 <\oren\> :t read 07:12:53 Read a => String -> a 07:13:00 <\oren\> cool 07:13:49 <\oren\> > read Int "10" 07:13:51 Not in scope: data constructor ‘Int’ 07:13:51 Perhaps you meant one of these: 07:13:51 ‘In’ (imported from Lambdabot.Plugin.Haskell.Eval.Trusted), 07:14:27 <\oren\> @lambdabot you liar 07:14:27 Unknown command, try @list 07:15:00 <\oren\> > Read Int "10" 07:15:02 Not in scope: data constructor ‘Read’ 07:15:02 Perhaps you meant one of these: 07:15:02 variable ‘read’ (imported from Prelude), 07:15:14 <\oren\> > (Read Int) "10" 07:15:16 Not in scope: data constructor ‘Read’ 07:15:17 Perhaps you meant one of these: 07:15:17 variable ‘read’ (imported from Prelude), 07:15:41 <\oren\> rrgh how do i pass a type into read 07:16:18 <\oren\> > read 10 07:16:21 Could not deduce (Num String) arising from the literal ‘10’ 07:16:21 from the context (Read a) 07:16:21 bound by the inferred type of it :: Read a => a 07:16:24 <\oren\> > read "10" 07:16:27 *Exception: Prelude.read: no parse 07:16:42 <\oren\> wait what 07:16:51 seeing an experienced programmer struggling with this is pretty depressing 07:16:57 <\oren\> > read "10" :: Int 07:16:59 10 07:17:01 <\oren\> OH 07:17:09 <\oren\> :: isn't a comment marker 07:17:34 <\oren\> it's how you pass a type to something 07:17:58 <\oren\> > read :: Int "10" 07:17:59 ‘Int’ is applied to too many type arguments 07:18:00 In an expression type signature: Int "10" 07:18:00 In the expression: read :: Int "10" 07:18:13 <\oren\> > (read :: Int) "10" 07:18:15 Couldn't match expected type ‘[Char] -> t’ with actual type ‘Int’ 07:18:15 The function ‘read :: Int’ is applied to one argument, 07:18:15 but its type ‘Int’ has none 07:18:48 <\oren\> > (read :: (String -> Int)) "10" 07:18:51 10 07:18:54 <\oren\> AHA 07:19:41 <\oren\> so I'll just readInt = read :: (String -> Int) 07:19:54 <\oren\> > readInt = read :: (String -> Int) 07:19:57 :1:9: parse error on input ‘=’ 07:20:05 <\oren\> > readInt <- read :: (String -> Int) 07:20:07 : 07:20:07 not an expression: ‘readInt <- read :: (String -> Int)’ 07:20:20 <\oren\> GRR 07:20:32 \oren\: @let if you want it persistently, otherwise let { ... } in 07:21:04 <\oren\> > let { readInt = read :: (String -> Int) } in {readInt "10"} 07:21:06 :1:1: 07:21:06 parse error in let binding: missing expression after 'in' 07:21:20 <\oren\> > let { readInt = read :: (String -> Int) } in readInt "10" 07:21:22 10 07:21:33 yes, although there should be a semicolon before the close brace 07:21:37 but it's optional 07:22:40 even the braces are optional 07:23:08 yes, but that's evil 07:23:14 and can lead to ambiguities and stuff 07:23:19 don't leave them off 07:23:23 not with let ... in ... 07:23:48 i almost never need braces for one-liners 07:23:52 <\oren\> If i do `` return read s '' from a function declared to return an Int, will it know automatically? 07:24:18 does ghci use readline? 07:24:21 it's a matter of style, but I hate the Haskell indenting rules, so I always write the braces 07:24:22 except that's not what you use return for in haskell 07:24:34 izabera: oh, good question, that reminds me, 07:24:34 izabera: it uses a readline clone called haskeline 07:24:51 for gnuplot on windows, how do you ask it not to use readline even if it's started interactively? 07:24:59 which is BSD licensed or such 07:25:10 (or whatever readline-like library it uses) 07:25:17 (maybe editline) 07:25:36 wait, I should ask #gnuplot 07:25:40 bsd3 it seems http://hackage.haskell.org/package/haskeline 07:25:50 * izabera glad it supports vi bindings 07:26:44 Maybe I should redirect its stdin. 07:27:43 like cat | gnuplot 07:27:46 I'll try that 07:27:59 didn't you say windows? 07:29:39 -!- atehwa has joined. 07:30:00 izabera: oh by coincidence i just found this tip http://trac.haskell.org/haskeline/wiki/UsingTmux 07:30:09 er 07:30:19 just in case you're also using tmux 07:30:29 wasn't using tmux right now but thanks :p 07:31:04 > drop (1 `drop` [1,2] !! 0) "abcde" -- behold my haskell mastery 07:31:06 "cde" 07:31:15 \oren\: return in haskell is deceptively named for people used to other languages. 07:31:26 izabera: fancy 07:31:47 ikr 07:35:37 does 'a'..'z' use my current locale or is it always ascii? 07:35:43 -!- tjt263_ has quit (Read error: Connection reset by peer). 07:35:46 > 1 `drop` [1,2] !! 0 `drop` "abcde" 07:35:48 "cde" 07:35:51 izabera: always ascii 07:35:56 disappointed 07:36:43 > 'è' 07:36:45 '\232' 07:36:46 ew 07:36:59 > var "è" 07:37:01 è 07:37:44 how is having always the same result disappointing? 07:37:55 izabera: quoted chars and strings are in portable format. 07:37:57 -!- tjt263_ has joined. 07:38:14 (as _should_ everything given by show) 07:38:56 however, putStr will use locale, i think. 07:38:59 > '乐' 07:39:01 '\20048' 07:39:06 that's awful.. 07:39:09 (that isn't available in lambdabot though) 07:39:42 izabera: try putStr "\20048" in GHCi 07:39:56 that's not the point 07:40:05 what is? 07:40:31 nothing -.- 07:40:47 well 07:41:31 i see, you are very open towards things you do not know 07:41:47 izabera: it would be dangerous for the meaning of expressions to change with locale, because laziness means they might not be evaluated when you think 07:42:19 also, it wouldn't be purd 07:42:19 myname: i'm open, otherwise i wouldn't be reading this thing 07:42:33 so what if you used setEncoding in between (although that takes a file handle anyway) 07:42:37 um 07:42:44 @hoogle hSetEncoding 07:42:46 System.IO hSetEncoding :: Handle -> TextEncoding -> IO () 07:42:46 GHC.IO.Handle hSetEncoding :: Handle -> TextEncoding -> IO () 07:42:52 what is @hoogle? 07:43:02 haskell api search by type 07:43:07 (also name) 07:43:11 is that an official name? 07:43:19 yes. 07:43:19 it is 07:43:32 <\oren\> oerjan: can I define a monad in which it does the correc thing? 07:43:48 ah the dwim monad 07:43:55 \oren\: in which what does what? 07:43:55 what is the "correct" thing? 07:44:10 <\oren\> in which "return" returns from the funtion 07:44:31 how is that the correct thing? 07:44:35 izabera: there's also hayoo :P 07:44:52 <\oren\> myname: uh. how could it not be 07:45:11 because monad laws say otherwise 07:45:53 <\oren\> monad laws don't overrule 60 years of programming convention 07:46:05 obviously, they do 07:46:13 \oren\: use "pure" instead of "return" hth 07:46:25 <\oren\> not if I write a monad in which it doesn't 07:46:44 everyone agrees return was a stupid name for the thing 07:46:51 in afterthought 07:48:40 > cycle "die lambdabot die" 07:48:42 "die lambdabot diedie lambdabot diedie lambdabot diedie lambdabot diedie lam... 07:48:54 didn't die 07:49:22 it's not that stupid 07:49:43 lambdabot cuts off its output twice in the process 07:49:57 hm let's check... 07:50:28 @@ @run length @show @run repeat 'a' 07:50:33 81 07:50:37 wat 07:51:00 hm i thought it cut off to 80 only at final output 07:51:12 > [ mod x 10 | x <- [1..] ] 07:51:13 [1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8... 07:51:17 @@ @run length @run show $ repeat 'a' 07:51:21 :1:88: 07:51:21 lexical error in string/character literal at character '\n' 07:51:26 darn 07:51:37 of course duh 07:51:40 > length (repeat 1) 07:51:45 mueval: ExitFailure 1 07:51:48 this kills my ghci 07:51:54 can't even ^C to stop it 07:51:57 izabera: yeah that's an infinite loop 07:52:22 try twice 07:52:22 <\oren\> so basically what i want to make is a monad where `` do { return a; return b } '' returns a, and doen't evaluate b 07:52:36 somebody here posted a fancy anonymous fibonacci function 07:53:15 may be possible 07:53:52 just hold the return value in some kind of state that yields nothing if it is set or something like that 07:54:07 izabera: you've hit a rare weakness in GHC's thread preemption model 07:54:23 if a calculation does not allocate memory at all, it cannot be interrupted 07:54:56 there's a flag to insert extra "yields" in case that's a problem. 07:55:21 :D 07:55:49 how does it not allocate memory? is length tail recursive? 07:56:08 there are however very few calculations that infloop while never allocating, so it's rarely worth it (it slows down execution in general) 07:56:17 cool, i hit a rare weakness after 30 minutes of haskell -_- 07:56:33 finding it while fumbling isnkt that hard 07:56:41 finding it while seriously coding is 07:56:47 myname: yes, length is tail recursive and merges with repeat 1 to optimize into a register-only loop 07:57:00 -!- lynn has quit (Ping timeout: 256 seconds). 07:57:04 well, ghci doesn't do much optimization 07:57:16 oh right 07:57:26 myname: that's what fuzzers are for 07:57:39 so length is like foldl (\x -> 1+) 0? 07:57:47 repeat 1 actually makes a cyclic list in memory. and then length's tail recursion takes care of the rest. 07:58:07 (the optimization to a tight loop is for compiled ghc) 07:58:16 @src length 07:58:16 Source not found. It can only be attributed to human error. 07:58:20 darn 07:58:53 myname: something equivalent to that yeah 07:58:59 <\oren\> wait, what happens if I try to save repeat 1 in a state, then modify the nth element? 07:59:12 do that 07:59:27 it should evaluate to n elements 07:59:35 although things got a bit haywire in GHC 7.10's Foldable rearrangement. it's possible it's actually foldr before it's rewritten. 08:00:17 huh? how does it just rearrange that? these have their own weaknesses and strengths 08:03:13 \oren\: you cannot get do { return a; return b } to return a if a and b have different types. this holds by the types of the functions no matter how much you ignore the monad laws. QED. 08:06:35 <\oren\> why would they have different types? 08:06:42 vi mode in haskeline sucks....... 08:06:53 <\oren\> obviously a function always returns the same type 08:08:20 <\oren\> *yadda yadda, 60 years convention, remember our honorable ancestors who wrote in FORTRAN on punched cards... 08:08:55 <\oren\> in my case literally my ancestors 08:09:25 myname: i think i may be misremembering something. 08:10:31 -!- tromp_ has joined. 08:11:05 <\oren\> `? fortran 08:11:13 fortran? ¯\(°​_o)/¯ 08:11:30 how do i run putStr for all the elements in a list? 08:11:44 > (do return 1; return "hi") :: Maybe _ 08:11:46 Found hole ‘_’ with type: [Char] 08:11:46 To use the inferred type, enable PartialTypeSignatures 08:11:46 In an expression type signature: Maybe _ 08:11:55 bah 08:12:03 > mapM putStr "hello" 08:12:05 Couldn't match type ‘Char’ with ‘[Char]’ 08:12:05 Expected type: [String] 08:12:05 Actual type: [Char] 08:12:10 damn 08:12:17 @ask int-e WHY U NO ENABLE PartialTypeSignatures 08:12:17 Consider it noted. 08:12:34 > [ if x `mod` 15 == 0 then "FizzBuzz" else if x `mod` 3 == 0 then "Fizz" else if x `mod` 5 == 0 then "Buzz" else show x | x <- [1..100] ] 08:12:36 ["1","2","Fizz","4","Buzz","Fizz","7","8","Fizz","Buzz","11","Fizz","13","14... 08:12:39 > mapM putStr . map show [1, 2, 3, 4, 5] 08:12:41 Couldn't match expected type ‘a -> t String’ 08:12:41 with actual type ‘[String]’ 08:12:41 Possible cause: ‘map’ is applied to too many arguments 08:12:42 -!- tjt263_ has quit (Read error: Connection reset by peer). 08:12:50 gna 08:12:57 > (do return 1; return "hi") ++ [] 08:12:59 ["hi"] 08:13:01 > mapM putStr $ map show [1, 2, 3, 4, 5] 08:13:04 08:13:11 *MWAHAHAHA* 08:13:15 -.- 08:13:40 i don't really understand what's going on but i find it scary that you can't do this 08:13:49 izabera: there is actually a nice blogpost about fizzbuzz in haskell 08:13:53 <\oren\> `le/rn FORTRAN/FORTRAN was a language in 1957, in which our noble, honourable ancestors wrote programs on punched cards and paper tape. 08:13:58 Learned «fortran» 08:14:06 izabera: i can do this in more than one line 08:14:17 but where's the fun in that 08:14:36 -!- tjt263_ has joined. 08:14:40 izabera: mapM_ putStr 08:14:46 does haskell have eval? 08:14:46 ah! 08:14:58 > mapM_ putStr $ map show [1, 2, 3, 4, 5] 08:15:00 08:15:04 myname had it essentially right (mapM is just slightly less efficient), but lambdabot doesn't do IO actions 08:15:11 ah 08:15:20 it's lambdabots fault 08:15:29 also 08:15:33 how do mapM and mapM_ differ? 08:15:39 > mapM_ print [1, 2, 3, 4, 5] 08:15:41 08:15:45 myname: mapM collects the results 08:15:59 <\oren\> myname: one is a linux syscall 08:16:09 interesting 08:16:18 so there's a list of ()s wasting memory. 08:16:23 -!- tromp_ has quit (Ping timeout: 264 seconds). 08:16:26 izabera: what do you need eval for? 08:16:34 izabera: just pass a function 08:17:14 <\oren\> how does lambdabot do it? 08:17:43 <\oren\> @source 08:17:43 Unknown command, try @list 08:17:51 <\oren\> @list 08:17:51 What module? Try @listmodules for some ideas. 08:17:57 <\oren\> bah 08:18:30 haha 08:18:44 i'm not sure how lambdabot handles eval, it's pretty old, but these days i think the hint package may be the easiest way. 08:19:14 hint is a wrapper around the ghc-api, which allows you to call GHC from inside a haskell program. 08:20:00 (the ghc-api is _really_ crufty, it's basically a "wrap up and expose anything people might need" package) 08:20:23 afaik. i wouldn't dare to try it myself. 08:21:11 izabera: so, there's no built-in eval, but you can get the equivalent by installing hint. 08:21:17 you could implement read for a -> b 08:21:27 it's usually extremely overkill, mind you. 08:21:57 there is a reason eval is considered evil in most languages 08:23:55 Except Kernel Lisp 08:24:28 wouldn't you need monads for eval? 08:25:36 myname: well sure 08:28:19 i think the ghc-api basically runs in a GHC monad. 08:29:16 interesting 08:29:30 which contains IO inside, as well as various state. 08:29:59 anyway, good night 08:30:05 -!- oerjan has quit (Quit: ZZZ). 08:44:59 I hate how svn doesn't have an interface to explicitly add a file to a working copy but set its parent to a particular versioned file in the repo. 08:45:54 -!- Melvar` has joined. 08:47:38 You have to emulate it by renaming the file temporarily, copying the versioned file, then renaming the file back to replace the copy. 08:50:02 -!- perrier__ has joined. 08:52:01 -!- glowcoil_ has joined. 08:52:30 -!- perrier_ has quit (*.net *.split). 08:52:30 -!- Melvar has quit (*.net *.split). 08:52:31 -!- glowcoil has quit (*.net *.split). 08:52:31 -!- ^v has quit (*.net *.split). 08:53:01 -!- glowcoil_ has changed nick to glowcoil. 08:54:19 -!- ^v has joined. 08:57:38 -!- J_Arcane has quit (Ping timeout: 256 seconds). 09:03:47 <\oren\> ARGH Wikipedia sucks! 09:04:15 <\oren\> All I wanted to know was what is a "critical theorist"? 09:06:27 <\oren\> then again, I'm finding more and more wikipedia articles which contain no information understandable by non-experts 09:06:48 <\oren\> but I thought that the problem was limited to math articles 09:21:42 [wiki] [[Talk:Zero Instruction Set Computer]] https://esolangs.org/w/index.php?diff=46391&oldid=46383 * Rdebath * (+822) /* This seems to be a weird definition of "Zero" */ new section 09:22:03 i agree 09:23:50 [wiki] [[Talk:Zero Instruction Set Computer]] https://esolangs.org/w/index.php?diff=46392&oldid=46391 * Rdebath * (+128) /* This seems to be a weird definition of "Zero" */ 09:23:55 can you ask rdebath to come here? 09:25:45 -!- jaboja has joined. 09:26:05 [wiki] [[Talk:Zero Instruction Set Computer]] https://esolangs.org/w/index.php?diff=46393&oldid=46392 * Orenwatson * (+200) 09:26:34 <\oren\> there 09:26:49 thanks 09:26:51 <.< 09:39:37 -!- lynn has joined. 09:42:42 Well, in a multi-ISC you need opcodes to distinguish instructions. In an OISC you can elide the opcode since it's always the same; you just have arguments. In a ZISC you can elide both the opcodes and arguments--there's no "instructions" left 09:43:05 -!- mroman has joined. 09:43:29 fnard 09:43:43 although in a way it's the same thing as an OISC, just another perspective 09:43:46 -!- AnotherTest has joined. 09:45:27 I mean, I suppose if you wanted you could treat a multi-ISC as an OISC as well by having the one instruction be "branch on opcode, if x do ..., if y do ..., ..." 09:45:35 the "one" instruction 09:46:51 yeah or DO a, b, c 09:46:56 where a tells what operation to carry out 09:47:50 so I'm more curious about how many arguments you need 09:48:21 subleq needs three arguments 09:50:27 WHY ISN'T HE HERE YET 09:51:01 unless lynn or AnotherTest are rdebath 09:51:19 in which case hi 09:51:23 well in any case hi 09:56:50 have you considered creating an account on the wiki instead 09:57:38 that's too impersonal 10:31:48 <\oren\> someone should make a better C standerd library 10:32:54 what's the problem with the current one? 10:34:00 It forces you to write in C 10:34:13 oh 10:34:17 <\oren\> it's too small 10:34:34 <\oren\> and lacks a proper string type 10:35:11 <\oren\> or a lot of array handling stuff (qsort and bsearch notwithstanding) 10:36:01 <\oren\> or for that matter diretory tree handling 10:36:58 <\oren\> and lacks any support for data structures other than flat arrays 10:37:43 \oren\, I think to some extent you are using C for the wrong reasons 10:39:08 <\oren\> well all of the things above have lots of implementations in C 10:39:35 <\oren\> it's just every project has to reinvent it 10:40:06 <\oren\> i think it's time for at the very least 10:40:44 <\oren\> struct STR {int len; char *dat}; 10:40:54 <\oren\> to be in the standard library 10:42:38 <\oren\> or something. the std commitee can decide how to implement this stuff, but it's time for it to not be reinvented over and over 10:46:16 <\oren\> hmm 10:47:09 <\oren\> struct STR_STRUCT {size_t len; char *dat}; typedef struct STR_STRUCT STR; 10:52:40 there are better ways 10:53:22 https://github.com/antirez/sds 10:57:10 <\oren\> evil 10:57:15 <\oren\> i like it 10:58:05 <\oren\> but if the c std comittee is doing it they can create a new printf format spec like "%S" or something so that would not be needed 10:58:55 you'd have to change all of string.h 10:59:15 also i believe %S is taken 10:59:19 for wide characters 10:59:45 <\oren\> not really 11:00:03 <\oren\> strlen doesn't take a STR it takes a char* 11:00:10 <\oren\> so if you did 11:00:26 well i mean you'd have to add a STR- version to all the functions in string.h 11:00:35 <\oren\> yes 11:00:58 <\oren\> but you'd have to do that anyway 11:01:06 <\oren\> to take advantage of the new length 11:11:52 -!- tromp_ has joined. 11:16:10 -!- tromp_ has quit (Ping timeout: 240 seconds). 11:26:15 -!- LexiciScriptor has joined. 11:39:36 -!- boily has joined. 11:49:59 @metar CYUL 11:50:00 CYUL 111141Z 26012KT 4SM -SN BKN014 OVC028 M12/M15 A2972 RMK SC6SC2 SLP069 12:02:06 -!- heroux has quit (Ping timeout: 240 seconds). 12:10:27 -!- jaboja has quit (Remote host closed the connection). 12:21:02 -!- boily has quit (Quit: DISPLAY CHICKEN). 12:31:47 -!- lynn has quit (Ping timeout: 276 seconds). 12:40:34 Does anyone know a friendly algorithm for computing the convex hull of a set of gaussian integers 12:41:23 Taneb: a 2-d convex hull of points? do you want an algorithm, or implementation? 12:41:45 I can give sources for either 12:42:43 b_jonas, the former 12:44:42 Would you believe this is for a language which may be esoteric 12:56:54 -!- Sprocklem has quit (Ping timeout: 250 seconds). 12:58:21 -!- Sprocklem has joined. 13:06:23 -!- heroux has joined. 13:13:52 -!- mtve has joined. 13:15:03 -!- LexiciScriptor has quit (Quit: LexiciScriptor). 13:19:24 -!- p34k has joined. 13:32:05 -!- lynn has joined. 13:33:10 Taneb: for algorithms, I suggest you look at the Cormen--Leiserson--Rivest--Stein Introduction to algorithms book. I believe it talks about 2d convex hull at one point. 13:33:35 Taneb: if that's not enough, then get a more detailed geometric algorithms book. 13:34:04 -!- variable has joined. 13:47:26 -!- tromp_ has joined. 13:58:06 -!- jaboja has joined. 14:09:11 -!- heroux has quit (Ping timeout: 264 seconds). 14:11:17 -!- variable has quit (Quit: 1 found in /dev/zero). 14:18:01 -!- `^_^v has joined. 14:22:26 `wisdom 14:22:33 `quote 14:22:49 668) I had a dream last night where I got hit by a van but the van had a brain uploader in it and I was uploaded and I angsted because I was stuck spending eternity with singularitarians? 14:22:49 ​`? `?/Yes, you're very clever 14:23:17 oh they got out of order 14:25:44 WHAT THE FUCK IS THIS WITH WINDOWS PROGRAMS HAVING ABOUT DIALOGS THAT IMMEDIATELY DISAPPEAR IF YOU CHANGE TO ANOTHER WINDOW OR CLICK ANYWHERE, SO THERE'S NO WAY TO WRITE DOWN THEIR LONG VERSION NUMBER STRINGS? 14:26:20 why can't they just have a simple ordinary about dialog that tells the name and version of the software in an ordinary message box, whose text is, by the way, copy-pastable 14:26:26 seriously? 14:27:28 just use `strings` on the executable ;-) 14:27:50 -!- heroux has joined. 14:28:21 does taking a screenshot work? 14:28:53 "this way we get fewer bug reports" 14:29:03 int-e: dunno, I think it also disappears if I press a key. 14:38:18 b_jonas, thanks 14:38:55 b_jonas, can you take a photograph? 14:39:08 b_jonas, I think one of my flatmates has a copy of that! 14:45:32 -!- bender|_ has joined. 14:46:08 -!- bender|_ has quit (Changing host). 14:46:08 -!- bender|_ has joined. 14:46:40 -!- bender|_ has changed nick to bender. 15:06:26 -!- heroux has quit (Ping timeout: 250 seconds). 15:06:44 -!- tjt263__ has joined. 15:06:52 -!- tjt263_ has quit (Ping timeout: 250 seconds). 15:06:59 -!- heroux has joined. 15:13:12 -!- J_Arcane has joined. 15:21:27 If I've written a language called COMPLEX, what should the file extension be? 15:24:15 .1+i 15:24:41 FireFly, might use something along those lines 15:24:48 But I'm using the X+YJ convention 15:26:42 -!- lynn has quit (Ping timeout: 252 seconds). 15:26:44 is + legal on windows? 15:29:33 mroman, idk, I'm on Linux 15:29:44 I think this qualifies as an esolang, I'll write up a description later 15:31:02 Sure, .1+J works too 15:31:46 Speaking of complex literals, J in its perverseness to infix everything uses e.g. 4j3 for a literal representing 4+3i 15:32:50 FireFly, I've gone for .1+1J 15:32:52 which is a bit of an interesting approach I think. It'd work in many languages and follows the same conventions as other number literals (starts with a digit, contains digits, letters and periods) 15:51:25 -!- Melvar` has changed nick to Melvar. 15:52:15 -!- rodgort has quit (Ping timeout: 240 seconds). 15:52:55 -!- kline has quit (Ping timeout: 240 seconds). 15:53:00 -!- fractal has quit (Ping timeout: 256 seconds). 15:55:40 -!- carado has quit (Ping timeout: 252 seconds). 15:55:59 -!- heroux has quit (Ping timeout: 264 seconds). 15:57:07 -!- heroux has joined. 16:00:05 -!- kline has joined. 16:00:07 -!- nycs has joined. 16:00:56 -!- `^_^v has quit (Ping timeout: 256 seconds). 16:02:26 -!- tjt263__ has quit (Ping timeout: 240 seconds). 16:05:38 -!- rodgort has joined. 16:06:21 -!- mroman has quit (Quit: Lost terminal). 16:06:22 -!- `^_^ has joined. 16:08:04 -!- nycs has quit (Ping timeout: 248 seconds). 16:10:46 -!- carado has joined. 16:22:35 -!- heroux has quit (Ping timeout: 240 seconds). 16:23:08 -!- heroux has joined. 16:23:20 -!- oren has joined. 16:23:45 apparently boost is not allowed anymore 16:23:59 (at my workplace) 16:25:04 -!- sebbu has quit (Ping timeout: 272 seconds). 16:25:16 -!- nycs has joined. 16:27:26 -!- `^_^ has quit (Ping timeout: 245 seconds). 16:28:33 why? 16:34:50 WTF... 16:35:01 is this 7z version completely broken wrt tar files? 16:35:09 this tar file is definitely not old, I made it myself, yet it can't read it 16:35:40 sounds like you made it by hand tar'ing your files 16:35:48 -!- fractal has joined. 16:36:06 apparently boost isn't backward compatible to wmbedded computers 16:36:22 boost is huge 16:36:24 or... uh... sideways compatible? 16:36:41 izabera: oh... well so is our codebase 16:36:42 even stl is frowned upon 16:37:01 oren: make it smaller >:O 16:37:05 whatcha waiting for 16:37:08 oren: maybe they didn't realize that boost is made of like a hundred different packages, each of them different, and some of them are definitely compatible with embedded computers 16:37:16 whereas some aren't 16:38:12 whew no 16:38:15 it's not broken 16:38:18 -!- ocharles_ has quit (Ping timeout: 250 seconds). 16:38:18 only the interface is broken 16:38:22 shows it wrong 16:38:25 but still finds the files 16:38:54 -!- heroux has quit (Ping timeout: 256 seconds). 16:38:55 -!- bender has quit (Ping timeout: 240 seconds). 16:39:01 sorry for false alarm 16:39:10 -!- glowcoil has quit (Ping timeout: 250 seconds). 16:41:31 -!- sebbu has joined. 16:41:35 -!- ocharles_ has joined. 16:41:45 -!- glowcoil has joined. 16:46:13 https://arin.ga/iDqTEk here is a program in COMPLEX 16:49:44 Bonus points if you can work out what it does (it's not particularly obtuse) 16:50:11 -!- heroux has joined. 16:52:08 -!- lynn has joined. 17:00:26 -!- J_Arcane has quit (Ping timeout: 256 seconds). 17:01:26 -!- heroux has quit (Ping timeout: 240 seconds). 17:06:49 -!- zadock has joined. 17:10:36 -!- oren has quit (Quit: Page closed). 17:12:19 It's a linear 2D language 17:13:27 hmm 17:20:31 I'm going to guess the convex hull question was related to this. 17:28:25 -!- spiette has joined. 17:38:00 -!- heroux has joined. 17:39:17 -!- jaboja64 has joined. 17:43:00 -!- jaboja has quit (Ping timeout: 248 seconds). 17:47:23 You'd both be right in those assumptions 17:51:53 Just had a nice chat with a researcher in the field of unconventional computing 17:52:06 She seems a bit obsessed with computing things on the inside of black holes 17:59:59 -!- Vorpal has quit (Quit: ZNC - http://znc.sourceforge.net). 18:05:26 -!- heroux has quit (Ping timeout: 240 seconds). 18:15:50 -!- bb010g has joined. 18:15:55 -!- zadock has quit (Quit: Leaving). 18:19:54 [wiki] [[MATL]] https://esolangs.org/w/index.php?diff=46394&oldid=46337 * Luis Mendo * (+8) /* Fibonacci sequence */ 18:21:35 -!- heroux has joined. 18:25:49 -!- hppavilion[1] has joined. 18:27:26 -!- heroux has quit (Ping timeout: 240 seconds). 18:28:03 -!- ent0nces has joined. 18:31:56 -!- heroux has joined. 18:32:07 -!- contrapumpkin has changed nick to copumpkin. 18:34:14 -!- ent0nces has quit. 18:34:29 Unconventional computing is basically the scientific side of esolangs? 18:34:44 -!- ent0nces has joined. 18:36:29 -!- ent0nces has quit (Client Quit). 18:40:13 -!- ent0nces_ has joined. 18:44:08 -!- ent0nces_ has quit (Client Quit). 18:44:12 * izabera thought esolangs where the scientific side of esolangs 18:44:43 were* 18:50:07 -!- ais523 has joined. 18:51:30 -!- Phantom_Hoover has joined. 19:04:13 I think unconventional computing is usually more concerned with things that could theoretically be implemented in hardware. 19:04:29 As oppossed to hardware which only exists as a model for the purpose of theory. 19:04:42 subleq could 19:05:46 Yeah, a dedicated suqleq architecture sounds like unconventional computing. 19:05:51 *subleq 19:16:23 -!- heroux has quit (Ping timeout: 264 seconds). 19:29:39 -!- heroux has joined. 19:29:44 -!- hppavilion[1] has quit (Ping timeout: 276 seconds). 19:31:10 -!- hppavilion[1] has joined. 19:39:20 -!- heroux has quit (Ping timeout: 252 seconds). 19:42:27 -!- Vorpal has joined. 19:42:33 -!- heroux has joined. 19:43:29 Hellu 19:44:03 I still think we should have an official LISP 19:45:11 Vorpal: do you still happen to have a copy of gcc-bf, by any chance? 19:45:12 ais523: hm? 19:45:14 What was that? 19:45:18 I don't remember 19:45:38 Vorpal: gcc backend targeting a language that compiles to brainfuck 19:45:46 Vorpal: What else would it be? 19:45:58 ais523: you made that, right? 19:46:00 for a version of gcc that's now really old 19:46:02 yes 19:46:19 but it's one of the few things I didn't back up because it was so large, and for some reason I didn't think of just backing up the diff against gcc 19:46:22 ais523: If I have it, it is in some super old backup somewhere, I may have time to look during the weekend, definitely not now though 19:46:28 fair enough 19:46:29 it's not urgent 19:46:51 ais523: I think that is probably two linux installs ago 19:49:17 ais523: #esoteric official LISP. Yea or nay? 19:49:45 hppavilion[1]: you'll never get the whole channel to standardise on a language 19:49:56 ais523: Just the people who care 19:50:11 And no one is expected to use it 19:50:11 hppavilion[1]: it should be a mix of liskell and scheme 19:50:23 Vorpal: Perhaps 19:50:35 hppavilion[1]: oh and some erlang concepts thrown in 19:50:43 Like runtime reloading of modules 19:50:44 Vorpal: Sure. 19:51:04 The only one of those I've ever seen any code in is Scheme (and /maybe/ erlang) 19:51:08 Never even heard of liskell 19:51:24 hppavilion[1]: it is haskell with LISP syntax 19:51:31 hppavilion[1]: and distributed fault tolerance built into the standard implementation. Which I assume you will write? 19:51:32 Ah 19:51:37 Vorpal: Yes 19:51:42 Vorpal: Or at least a prototype 19:51:46 heh 19:51:52 hppavilion[1]: JITing? 19:52:23 Vorpal: Perhaps 19:53:35 -!- heroux has quit (Ping timeout: 264 seconds). 20:06:07 Useful feature of #EsoLISP: `(call-drop)`, which discards the top value on the call stack 20:08:03 -!- heroux has joined. 20:08:24 hppavilion[1]: not very functional 20:09:38 does it also have call-dup? 20:09:56 Vorpal: It prevents the call stack from getting too cluttered 20:10:19 Vorpal: You call it right before unfounded recursion 20:10:37 So that the call stack doesn't overflow 20:13:37 -!- MoALTz has quit (Read error: Connection reset by peer). 20:14:24 -!- MoALTz has joined. 20:17:03 a non functional language is disfunctional? 20:23:41 Maybe you could compute in a language by only manipulating the call stack? 20:23:47 No other memory 20:24:11 -!- heroux has quit (Ping timeout: 264 seconds). 20:25:01 -!- Vorpal has quit (Quit: ZNC - http://znc.sourceforge.net). 20:25:34 -!- hppavilion[1] has quit (Ping timeout: 256 seconds). 20:38:45 -!- bb010g has quit (Quit: Connection closed for inactivity). 20:47:54 `welcome Vorpal 20:48:08 long time nor pal 20:50:38 Vorpal: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: . (For the other kind of esoterica, try #esoteric on EFnet or DALnet.) 20:50:51 @tell Vorpal Maybe you could compute in a language by only manipulating the call stack? ← that can be PDA-complete quite easily (see Splinter), but can't be TC without some method to access elements arbitrarily far down the stack 20:50:51 Consider it noted. 20:50:54 found a game where humans can beat computers https://www.youtube.com/watch?v=rX8PpddIm68 20:51:30 -!- heroux has joined. 20:52:54 Some guy with a bad haircut once said "A computer once beat me at chess but it was no match for me at kickboxing" 20:54:04 humans currently beat computers at BF Joust 20:54:47 It has not received quite as much research attention as Chess and Go, though. 20:56:00 indeed 20:59:00 -!- heroux has quit (Ping timeout: 256 seconds). 21:00:19 -!- `^_^v has joined. 21:01:16 -!- heroux has joined. 21:01:19 my computer can beat up your computer at bfjoust 21:02:28 -!- nycs has quit (Ping timeout: 248 seconds). 21:06:04 -!- tromp_ has quit (Remote host closed the connection). 21:06:26 -!- jaboja64 has quit (Ping timeout: 240 seconds). 21:09:10 -!- Vorpal has joined. 21:14:00 -!- tromp_ has joined. 21:21:51 -!- `^_^v has quit (Quit: This computer has gone to sleep). 21:22:25 -!- `^_^v has joined. 21:27:49 -!- jaboja64 has joined. 21:35:35 -!- heroux has quit (Ping timeout: 264 seconds). 21:41:12 -!- mihow has joined. 21:44:07 -!- heroux has joined. 21:54:41 -!- heroux has quit (Ping timeout: 276 seconds). 22:07:37 -!- heroux has joined. 22:07:58 -!- Sprocklem_ has joined. 22:09:48 -!- Sprocklem has quit (Ping timeout: 250 seconds). 22:13:33 how do you pronounce SIGCHLD ? 22:13:46 like child or children? 22:13:53 or neither? 22:14:29 neither 22:14:41 I put a schwa between the ch and ld 22:14:59 as it's the closest way to pronounce it to the spelling (you can't pronounce it with no vowel there at all, really) 22:15:35 ok 22:15:51 let's continue with this very interesting topic 22:15:57 how do you pronounce execvpe? 22:16:46 exec-vee-pee-ee? 22:17:00 strpbrk 22:17:05 strcspn 22:17:19 zsh 22:17:56 damn it's almost like these names aren't meant to be spelled out loud 22:17:58 yes, I spell out the VPE in execvpe 22:18:05 also the whole of zsh 22:18:13 I'd say "z shell" 22:18:26 strpbrk and strcspn I try to pronounce as two syllables each 22:18:43 (knowing some method to pronounce names of commands is important because I type phonetically) 22:19:16 rep movsb 22:19:26 -!- hppavilion[1] has joined. 22:19:28 I just realized how we can generalize bit shifts to a non-integer shift number. Maybe. 22:19:50 how would that work? 22:20:29 Observing that n< I think exponentiation is waaay ahead of you 22:20:54 n<<0 = n (n*2**0 = n*1) 22:20:59 i is imaginary not real hth 22:21:06 shachaf: Sure, sure. 22:21:35 this didn't end up being as esoteric as i hoped 22:21:36 And I suppose that works with complexes too, though it doesn't shift the bits very nicely (because complexes, of course, need a different encoding) 22:21:45 izabera: I know. It kind of sucks, doesn't it. 22:22:46 One day I'd like to understand the reals. 22:22:49 izabera: If you want eso, maybe we should invent bitshifting n<>i where instead n is a real (or even complex!) without just shifting around floating point 22:23:27 Which should actually be trivial too, ntitai, the eso part will be finding the encoding 22:24:40 izabera: That's the new goal. Given that n< `? ntitai 22:24:48 ntitai? ¯\(°​_o)/¯ 22:24:58 shachaf: Now that I think about it. I was in a hurry and forgot that that isn't an acronym 22:25:08 `le/rn ntitai/not that i'm truly against it 22:25:12 Learned «ntitai» 22:25:26 `misle/rn ntitai/Now that I think about it 22:25:29 Was lied to about «ntitai» 22:25:56 `misle/rn ntitai/new tool in titanium and iron 22:25:59 Was lied to about «ntitai» 22:26:01 izabera: No 22:26:05 `misle/rn ntitai/Now that I think about it 22:26:08 Was lied to about «ntitai» 22:26:13 izabera: misle/rn is only for accurate facts 22:26:26 izabera: It's a tool we invented for people who really have no clue what we're talking about 22:26:37 Because wisdom isn't very helpful (try `? hth) 22:26:47 `? hth 22:26:48 hth is help received from a hairy toe. It is not at all hambiguitous. 22:26:57 (Took me MONTHS to figure out/extract what hth means) 22:27:12 months of desperate googling 22:27:22 izabera: Yes. Nonstop. 22:27:23 http://www.urbandictionary.com/define.php?term=HTH 22:27:41 I'm at school and I doubt the filter will like urban dictionary 22:27:47 (fuckin 22:27:58 ' Child Protection Act) 22:28:23 izabera: So really, do you have any clue what the encoding for the reals is? It might just be fixpoint, I suppose 22:28:39 Yeah, that sounds about right ntitai 22:28:53 `? misle 22:28:54 misle? ¯\(°​_o)/¯ 22:28:56 (infinite fixpoint) 22:28:59 the past tense of misled 22:29:03 no, the present tense 22:29:24 shachaf: I think that's "mislead" 22:29:32 killjoy 22:29:37 izabera: Yes. 22:29:38 i think it's "misle" 22:29:45 do you want to fight over it 22:30:10 * izabera will now pronounce misled as misseld to match misle as the present tense 22:30:11 izabera: What are bitwise connective equivalent to? Is there some convenient definition of x^y f.e. using convenient operations? 22:30:35 It's pronounced "my-zzle". 22:30:48 s/convenient o/more conventional o/ 22:30:50 thanks 22:33:36 izabera: Ah, found it 22:33:43 It uses summation and stuff, but that works 22:33:47 -!- heroux has quit (Ping timeout: 264 seconds). 22:33:50 what is it? 22:34:30 izabera: Very complicated 22:34:30 https://en.wikipedia.org/wiki/Bitwise_operation#Mathematical_equivalents 22:36:17 -!- heroux has joined. 22:40:27 -!- spiette has quit (Quit: :qa!). 22:45:29 -!- Treio has joined. 22:50:45 -!- AnotherTest has quit (Quit: ZNC - http://znc.in). 22:57:58 -!- `^_^v has quit (Quit: This computer has gone to sleep). 23:00:58 -!- hppavilion[1] has quit (Ping timeout: 276 seconds). 23:12:44 -!- lynn has quit (Ping timeout: 256 seconds). 23:15:11 -!- J_Arcane has joined. 23:15:17 -!- Treio has quit (Ping timeout: 276 seconds). 23:23:37 -!- oerjan has joined. 23:25:02 -!- heroux has quit (Ping timeout: 276 seconds). 23:25:16 -!- heroux has joined. 23:38:00 -!- hppavilion[1] has joined. 23:39:39 @tell \oren\ <\oren\> All I wanted to know was what is a "critical theorist"? <-- critical theory is iirc postmodernism, and one of the endeavors that are more incomprehensible than math, largely due to being 90% nonsense hth 23:39:39 Consider it noted. 23:42:00 can you ask rdebath to come here? <-- good luck, i don't think he ever has. 23:42:09 :C 23:43:27 on the other hand registering a wiki account is _almost_ painless save for this small blood sample 23:44:39 hm wait, did fizzie ever reenable registration after the recent spam attack... 23:45:09 yeah that's totally the reason i'm not registering 23:45:33 in which case you may have to ask him for the unsolvable captcha. 23:46:41 <\oren\> hppavilion[1]: wait, you're in high school? 23:46:50 \oren\: Why do you ask? 23:47:10 <\oren\> well, holy crap i'm old 23:47:10 Whether I am or not depends on the reason for the question. 23:47:14 hm i think the captcha must be solvable, there are heaps of hits in the spam filter 23:47:43 \oren\: no, i'm old. hth. 23:47:45 \oren\: Oh, I guess it's pretty obvious 23:47:46 xD 23:47:53 (Dammit, logs) 23:48:09 http://www.uebersetzung.at/twister/media/nor0001.mp3 oerjan 23:48:29 argh mp3 23:48:43 come on 23:48:49 fire up a decent browser 23:48:59 ah a tongue twister 23:49:18 <\oren\> hppavilion[1]: I don't bother with logs I just leave irssi on for literally moths on end 23:49:26 \oren\: Ah, that works too 23:51:04 <\oren\> $ ps -eo pid,comm,etime | grep irssi \ 4505 irssi 42-19:23:08 23:51:24 <\oren\> 42 days! 23:53:16 izabera: You shall not call Kalle Kalle. Even if Kalle's mother calls Kalle Kalle, you shall not call Kalle Kalle, because Kalle is really named Karl hth 23:53:52 are those male names? 23:53:56 yes 23:54:25 Karl -> Charles / Carlo 23:54:45 i'm positive i could have figured that out myself 23:55:53 i believe Karl may be the original (Germanic) form. 23:56:25 <\oren\> no, it's carol: charlemagne was originally carolus magnus 23:57:07 * oerjan swats \oren\ for nonsense -----### 23:57:43 http://www.uebersetzung.at/twister/no.htm 23:57:47 carolus is the latinized form. he was frankish, not roman. 23:57:49 their italian page has no audio