00:01:19 !delinterp wacro 00:01:19 Interpreter wacro deleted. 00:01:23 !addinterp wacro perl http://pastebin.com/RazAC34W 00:01:24 Interpreter wacro installed. 00:01:26 !wacro 00:01:26 Bareword found where operator expected at /tmp/input.30875 line 4, near ""Content-Type" content" 00:01:27 fail 00:01:31 use sprunge 00:01:31 !wacro 4 5 00:01:32 Bareword found where operator expected at /tmp/input.30938 line 4, near ""Content-Type" content" 00:01:35 lol wat. 00:01:36 oh rite 00:01:40 didn't use the raw link lol 00:01:43 nope 00:01:43 !delinterp wacro 00:01:44 Interpreter wacro deleted. 00:01:44 thats html too 00:01:48 oh hm maybe not 00:01:51 i guess they fixed that 00:01:54 it has \r\n i think??? 00:01:59 i mean the raw pastebin thing 00:02:01 yes 00:02:01 just use sprunge 00:02:04 doesnt matter really 00:02:09 isn't that a feature of HTTP in general? 00:02:11 \r\n sads me 00:02:28 !addinterp wacro perl http://pastebin.com/raw.php?i=RazAC34W 00:02:28 Interpreter wacro installed. 00:02:30 !wacro 00:02:31 FCU 00:02:34 !wacro 4 5 00:02:35 OTPP 00:02:38 !wacro 10 00:02:39 CPLPFMLAMS 00:02:45 ...I didn't put a limit. 00:02:51 !wacro 50 00:02:51 LHNSRCBCVCBAMBHZSCAHITDTDHJGMSCDCPUGTCHHTTWUDOHESG 00:02:54 !wacro 999 00:02:55 CAMPABNGDCYNACDJSSKDCUCJBREMMRRTLMSCPGSAITOMRSFGSMCVGABSCDCTSTNHOGDARGSDTBTIPMCWRRREBMILARSDSCRTFPGYAPPBBJJFCBEBEFMOHPMDRMBAAGCLETPSBCDVLSFCMSLFGULSHSSWTSMCRIAPCMPSNDSGCIGMOQOPVPUHCLTAHIOPDTOLMMJMCGAPBPBNTMMFBWLRMWSCICMMNISRHTFCCFHMPLOCBWPSSDRPLLPMBMDSMAECCSITGMRCSSRGBTCMTAPGLPVPAMTILTDTMGDDANFWDPCAMTESJHPLTPOMUORDMERMSGPQCXMFRCMCAMOSCWFAHRIHRCBBCCVPTENCBDETEECSSBDSQHLGWCISADISDTRPHGFRBMSSMNGSAHPSDVITWDWIIRRSFRACMAAQBUTDTGFQSAPOPIHBRTGMSFDUMCLPVAGTPALBBRBSCTAHPUB 00:02:58 so yeah 00:02:59 snazzey 00:03:00 * CakeProphet fixes that. 00:03:16 let's see how many letters is that Wikimedia association. 00:03:20 !wacro abcdef 00:03:21 Argument "abcdef" isn't numeric in range (or flop) at /tmp/input.31529 line 47, <> line 1. 00:03:45 "or flop" 00:03:52 yep. 00:04:12 though it would be pretty spiffy if it knew what context .. was being used in for error messages. 00:05:27 you know what would be spiffy? 00:05:30 if contexts weren't a thing 00:05:33 yeah I went there 00:05:45 contexts are awesome and totally not an issue ever. 00:06:13 "oh no is this return value going to be interpreted in scalar or list context???" doesn't matter. 00:07:29 but you can find out with wantarray if you want to provide different logic. 00:08:04 !perl sub test(){wantarray} print test 00:08:05 1 00:08:21 !perl sub test(){wantarray} print (test*3) 00:08:22 0 00:08:37 :( 00:09:34 I don't really see what's bad about that, but to each their own. 00:10:26 so yeah, next step: try to make it generate pronouncable acronyms. 00:12:06 !delinterp wacro 00:12:06 Interpreter wacro deleted. 00:12:12 !addinterp wacro perl http://pastebin.com/raw.php?i=s2SVjFMB 00:12:12 Interpreter wacro installed. 00:12:17 !wacro 50 1000 00:12:18 Can't return outside a subroutine at /tmp/input.32648 line 46, <> line 1. 00:12:27 oh rite should've debugged. 00:12:29 !wacro 00:12:30 PGID 00:12:48 pgid 00:12:48 ...er what. I used return in a map 00:12:51 that is totally a thing I can do. 00:12:54 !wacro 00:12:55 PBLBZ 00:12:58 pblbz 00:13:04 ...wat? 00:13:10 !wacro 00:13:11 UFABPTL 00:13:13 ufabptl 00:13:20 what are you doing. 00:13:36 these are bad :( 00:13:41 make them better :( 00:13:46 pgid was almost okay 00:13:57 look okay it is a very simple program. 00:14:00 I don't know what you're expecting. 00:14:13 !acro 00:14:17 KOFKXKMEAI 00:14:19 that's bad too 00:14:27 !acro 00:14:31 WCRQ 00:14:34 :( 00:15:25 !delinterp wacro 00:15:25 Interpreter wacro deleted. 00:15:28 that sounds like a radio station in america 00:15:42 !addinterp wacro perl http://pastebin.com/raw.php?i=Ec8RSQtM 00:15:43 Interpreter wacro installed. 00:15:47 !wacro 00:15:47 -!- yorick_ has joined. 00:15:48 FSIG 00:15:50 elliott: an east coast radio station to be exact. 00:15:54 fsig 00:15:59 !wacro 999 00:16:00 CMMTASBCMAUOTTPWDTAMABSMAPSCESYPSUCDRJITCPDFCPTLMVRPSAFEIMSCPRRRNIFCAPSVDTNPSLMDKJSDMPCCRBIBSIEAIMSAFMDPWRCSPIBEWCSEWLGSFRJWALDRDSBRJGGCCMPPHWRCERIESSTSLSRLCOLBSBCSJLAWIDIIPNAWSCHMSTSSSDTPCTNCPRVSLLJAPEOSPMBPTCMCCMRCGBVLEDLPATKCBHFGADMKSRSSNCLIBGFOHMORFSBHIPYMPPRBCPBSSBSCSASPJCTGCKRSCSNCFFALWTPPPPBHJCRORMMRVSFBFCBBSMMSPBPBJBTPMOMGGOHMHNBCARHPMTCCRCARVTBMVTACJDTBPGKFBABSIPMTSKNHIDABACKDWTNPSLSTBPMDDSOBKSBSFIMTBAIDOGPBFWDPTRGPSVRLUSCMBEBJBLDOFTATTFHUPTCBRMCDSMGAWAS 00:16:00 though KOFKXKMEAI could be a west coast radio station. 00:16:03 wacro 00:16:08 ...wat I thought I fixed that. 00:16:36 !wacro 25 50 00:16:37 SAOSOGCVFPHSSRCSFPESPMVISCCCBSNPEPCFESFRC 00:16:40 !wacro 999 999 00:16:41 TYHSTBLRLFSDZPLTATPCSSMOSBSRRCMGQBFPSRJBPSLGBPFSBVDGAZTTSPVCALPBTGBDTBSPURCBBETMRBSHIGIBHGRCTMSCDLGWAVSJVWPUPPWIRDNVBAGFPMITUPECCHGBBTALTCTPILPWJDSDLTCNGABGRLWDDOGFVCOWHADCBFHMSBOCAPFHDBTLWIJMETNIASUCDMHMLOFPAAFSSFIRRSCCETFBHIBBAGIDCVRMSRAEMTODPMGEARFFSLCHSDAIAGSCOOBMQEPORCDCTDGCESDDABHSCMPWMPCACPCCOHBHJPPIABWHTTATWGRPLILSWDLBFQVMWABUDIPSLIBGLSDRGSSTCJPSSRBIMPGTMSLZTPNCSFPLPMISWORWRGTRNTMELABSFTHCPZHDRPCSDSLPAPSSBTAMMRMLFSGTCCAHOUMFAIBCSMBAFPKHLPPAGSDGVDPFMAMRDAD 00:16:50 ... 00:16:55 what does the second one do does it a range 00:16:59 betwen th eifrst and second 00:17:02 yes. 00:17:04 -!- yorick has quit (Ping timeout: 264 seconds). 00:17:18 well it's broken right now actually. 00:17:19 http://en.wikipedia.org/wiki/WCRQ 00:17:20 one sec. 00:17:23 today's best hits 00:17:28 http://en.wikipedia.org/wiki/Arab,_Alabama 00:17:35 Two other proper names for the town were sent to the US Postal Service for consideration: "Ink" and "Bird." 00:19:22 !delinterp wacro 00:19:22 Interpreter wacro deleted. 00:19:27 !addinterp wacro perl http://pastebin.com/raw.php?i=mvP0STSg 00:19:28 Interpreter wacro installed. 00:19:32 !wacro 9999 00:19:33 !wacro 5000 9999 00:19:33 TSOKCFUMCTBDAWTWSTFBATTTG 00:19:33 CPICBMSAGBEAFMSTRKCECBPHB 00:19:41 limit is 25 00:19:45 !wacro 25 999 00:19:46 KUSRSDPIBSAIHMPSRDTDADLTF 00:19:56 !wacro 9999999999999999999999999999999 00:19:56 SVMSPAERHBWFGAPRVAWDSCMGJ 00:19:59 !wacro 25 00:20:00 VNLBBANEEWABMSWGGCMTDDSSI 00:20:06 !wacro -1 00:20:07 Argument "" isn't numeric in numeric gt (>) at /tmp/input.2229 line 46, <> line 1. 00:20:10 !wacro 0 00:20:19 obviously. :P 00:20:19 !wacro abcdef 00:20:20 Argument "abcdef" isn't numeric in numeric gt (>) at /tmp/input.2341 line 46, <> line 1. 00:20:27 !wacro 1.2 00:20:28 TU 00:20:31 tu 00:20:39 stop making them better. 00:20:41 that is not better. 00:20:45 acronyms are abbreviations for things. 00:21:00 17:22:38 Execution of /tmp/input.23630 aborted due to compilation errors. 00:21:03 17:22:38 00:21:08 presumably from the !wacro 0 00:21:18 try it 00:21:22 !wacro 0 00:21:29 nope. 00:21:38 didn't you get the dcc chat request? 00:21:42 !wacro 0 00:21:43 maybe it takes some time 00:21:44 nope 00:21:58 0 would just make nothing happen. 00:22:04 then how did that happen???? 00:22:15 probably an earlier one? 00:22:18 !perl -1 00:22:21 lol 00:22:22 but which 00:22:24 !wacro -1 00:22:24 Argument "" isn't numeric in numeric gt (>) at /tmp/input.2662 line 46, <> line 1. 00:22:46 well so far these are all runtime errors so... 00:22:54 !wacro 2 3 4 00:22:55 CG 00:23:04 yeah it ignores anything above 2 args. 00:23:09 !wacro 1 00:23:10 V 00:23:12 v 00:23:19 ... 00:23:42 feel free to remove the "uc" at the bottom of my code. 00:23:49 and make your own acronym generator command. 00:24:02 v 00:24:03 just for you. because you're weird and like them to be lowercase. 00:24:14 !wacro 5 00:24:14 SLSEA 00:24:59 okay so basically I have a markov chain of sorts. 00:25:11 Is there Haskell parsing program that I can add stuff into? 00:25:45 where the previous characters determine which random selection function is used. 00:26:32 zzo38: ? 00:27:01 monqy: ?? 00:27:04 ?????? 00:27:16 parsing program? add stuff into? help 00:28:07 parsec? 00:28:08 -!- yretssin has changed nick to Nisstyre. 00:28:11 Such as, adding stuff to support new syntax and macros and various other thing, including to be able to check stuff doing during compiling to check for duplicate definitions, combine things together, and so on 00:28:34 CakeProphet: Parsec is a general parsing program I have used it, but I mean one specifically parsing Haskell codes 00:28:57 you could use any kind of general purpose language for that. 00:28:59 zzo38: haskell-src-exts, haskell-src-meta, and friends? 00:29:09 monqy: OK, let me see 00:29:11 to just translate unprocessed file to Haskell source. 00:29:14 zzo38: dunno how extensible they are 00:29:43 zzo38: but they're for haskell source manipulation and friends 00:29:54 GHC, ghci, and lambdabot all have Haskell parsers that you could borrow code from. 00:30:52 How would I find the haskell-src-exts and haskell-src-meta? And which files in GHC and ghci would I use? Can I write codes to extend existing GHC/ghci? 00:31:17 http://hackage.haskell.org/package/haskell-src-exts-1.11.1 00:31:19 http://hackage.haskell.org/package/haskell-src-exts http://hackage.haskell.org/package/haskell-src-meta 00:31:24 I've heard Google is pretty good for that sort of thing. 00:31:32 i used hoogle 00:31:58 haskell-src-exts has a parseFile function that you would probably find useful for this. 00:32:21 there's lots of stuff 00:32:26 and the module Language.Haskell.Exts.Build has functions to construct Haskell source trees 00:32:53 there's also stuff to output template haskell i think 00:32:58 for use in quasiquoters, friends 00:33:30 haskell-src-meta at least has some TH examples 00:35:49 that's what haskell-src-meta is for i think 00:36:10 i didn't know if it was also for other things 00:36:54 so yeah Markov chain = good way to generate acronyms. 00:36:55 I can find a lot of information about haskell-src-exts but haskell-src-meta has not much information 00:37:11 haskell-src-meta has examples 00:37:16 I dunno about haskell-src-ext 00:37:16 s 00:40:19 !perl sub test(){}sub test2(){} print (\test)==(\test) 00:40:56 !perl sub test(){}sub test2(){} $x=\test; print $x==$x 00:40:56 1 00:41:12 lolwat 00:42:23 !perl sub test(){}sub test2(){} $x=\test;$y=$x; print $x==$y 00:42:23 1 00:42:51 for some reason two different subrefs pointing to the same thing are not equal. 00:43:23 !perl sub test(){}sub test2(){} print (\&test)==(\&test) 00:43:24 CODE(0x7fbbb0d05aa8) 00:43:30 >_> 00:44:01 !perl sub test(){}sub test2(){} print (\&test==\&test) 00:44:02 1 00:44:05 oh ojay. 00:44:08 *k 00:48:10 Is it possible to write syntax extensions to GHC? Some of the -X options provide their own syntax extensions but is it possible to write external ones? 00:49:25 where by external you mean? doesn't have to be compiled into ghc? 00:49:32 Yes 00:49:36 I don't know the specifics 00:50:52 I also think Template Haskell is not powerful enough to make up an entire module or to read an entire module, there are some things it doesn't do 01:00:40 What I would want to do, is for example, you can define your own reserved words which are always error, and you can catch errors including all information including what is around it and what is expected here, and other kind of error, etc. And then you can tell it to replace that and other things with something else 01:02:00 For example, I would like to be able to make it eliminate duplicate definitions and combine definitions, for example to change data Color = Red | Green; data Color = Green | Blue; into data Color = Red | Green | Blue; 01:03:26 Are there Haskell interpreter modules that can be included with another program? 01:05:02 yes, like whatever lambdabot does? 01:05:12 I don't know what lambdabot does 01:07:15 Not very well, anyways 01:07:36 what do you do in this case: data T a b = Z | A a b | C b a; data T a b = Z | A a b b | C a b 01:08:04 zzo38: mueval 01:08:05 CakeProphet: Generate an error message because the definitions of constructor A and C do not match 01:08:08 zzo38: http://hackage.haskell.org/package/mueval 01:08:13 zzo38: mueval is terrible though. 01:08:18 zzo38: For more flexibility, see http://hackage.haskell.org/package/hint, which mueval is built upon 01:09:39 CakeProphet: (An error message, which can of course, be caught like other errors and decide what to do, even if an error caused it to do this and then it is a second error which can also be caught afterward) 01:10:13 But this should be allowed: data T a b = A a b; data T b a = A b a; 01:10:33 I appear to have started a flame war in #scala 01:11:21 good job sgeo, hero to all 01:11:25 what's it about 01:11:46 Haskell's lack of enterprise stuff and whether "enterprise" stuff is useful 01:12:31 wqhat's enterpreise stuffe 01:12:37 what 01:12:41 -!- rodgort has quit (Quit: ERC Version 5.3 (IRC client for Emacs)). 01:12:50 drdozer> no, you don't. If the boss says you're writing a component that's exposed through SOAP and talks to other components exposed through SOAP, with colaborators implementing their SOAP end-points in .NET, Java and Python, that's what you do 01:13:28 http://hackage.haskell.org/package/shoap? 01:13:33 i'lkl never survive in the real wordle 01:14:17 these compoents are filthy 01:14:20 they need a good scrubbing 01:14:25 -!- rodgort has joined. 01:17:52 http://codu.org/tmp/wol3-2011-08-23.ogg Have some musix 01:18:42 I have ideas, to invent Meta Haskell, it is usable in addition to Template Haskell. The syntax stolen by Meta Haskell is $${ and $$( and $$ with a word after that is no space between. But it is not allowed to be part of a "symbols" word. And then you have $$include which is like #include in C, $$setflag $$clearflag $$ifflag $$ifnflag which is like #define #undef #ifdef #undef except they are not macros and not used anywhere else, 01:19:43 `addquote Maybe I should try to learn Scala instead of Ruby I will boil your veins. Which is less bad? Probably Scala, but I don't want you learning languages. 01:19:45 618) Maybe I should try to learn Scala instead of Ruby I will boil your veins. Which is less bad? Probably Scala, but I don't want you learning languages. 01:20:01 poor sgeo 01:20:11 has sgeo learned haskell yet 01:20:26 no 01:20:34 $$reserve and $$reserveLayout to make new reserved words, it parse program into tokens, you can insert your own stuff to do, and then parse to syntax tree telling what kind of declaration and so on which you can also insert your own stuff and catch errors and stuff, and then you can make it do stuff with that result, and add postprocessor afterward 01:22:42 has Patashu learned Haskell yet? 01:22:59 Is there anything that can be used to do the things I describe? 01:23:38 there's already an extension to use CPP 01:23:51 .. 01:24:29 I've heard Perl has a pretty good regexes and stuff. >_> 01:24:42 I know there is, but it doesn't do the other things I have described and it has some other problems too, since CPP is not designed for use with Haskell anyways 01:25:49 @CakeProphet: Not enough to use it 01:25:49 Unknown command, try @list 01:26:19 huh weird, Wikipedia doesn't say whether Perl is strongly typed or weakly typed. 01:26:47 I'd say it's weakly typed, sort of. 01:26:52 For example, CPP certainly cannot do $$( $${ $$reserve $$reserveLayout 01:27:16 CakeProphet: it's most certainly weakly typed 01:28:07 Has anyone ever made a CPPPP joke 01:28:25 cpreprocessorpreprocessor? 01:28:29 cpluspluspreprocessor? 01:28:30 monqy: yeah but it's strongly typed when it doesn't make sense to be weakly typed in its type system. 01:28:32 The former 01:28:39 !perl print "abc" > "123" 01:28:56 oh, nevermind, that was a warning. 01:29:02 !perl use warnings; print "abc" > "123" 01:29:02 Argument "abc" isn't numeric in numeric gt (>) at /tmp/input.7685 line 1. 01:29:03 Well, I have use features of Enhanced CWEB for extra preprocessing of C codes 01:29:03 in conclusion perls dumb 01:29:21 but it's a different kind of weak typing than C 01:29:28 it's not at a byte-level. 01:30:01 it's all contexty. 01:30:22 i never said it wasn't 01:30:31 right I was thinking aloud. 01:30:45 elliott: omg writing bots is so much suck :( 01:31:06 Gregor: by bot do you mean rezzo warrior or like... IRC bot? 01:31:08 or? 01:31:09 Gregor: Have you tried using my library 01:31:14 CakeProphet: Rezzo 01:31:24 elliott: Haskell is for dorks! 01:31:32 Gregor: Dorks who write bots 01:31:49 elliott: IIRC, you haven't actually accomplished anything :P 01:32:07 Rezzo? 01:32:20 Gregor: tantrum.hs 01:32:24 Gregor: But I was working on the queue stuff last 01:32:42 Can the "hint" program work with Template Haskell? Can it allow you to catch errors and then it can continue where it left off with the changes you made so it is not error? 01:35:12 Gregor: but C is THE BEST LANGUAGE THERE IS FOR ALL PURPOSES EVER 01:35:17 surely this should be easy. 01:35:38 CakeProphet: Just because it's the best language doesn't mean that it's obvious what a bot should do at all :P 01:36:00 imagine yourself as an agent. 01:36:03 should make things easier. 01:36:10 map out your decision process. 01:36:25 lol 01:36:33 :> 01:37:41 I'd say the trickiest part is navigating around walls 01:37:44 or deciding to break through them. 01:38:53 Gregor: Well, you could code a pathfinding algorithm to start with 01:39:08 That assigns appropriate higher costs to wires that need to be destroyed 01:39:50 it wouldn't be terribly helpful at the start though 01:39:55 since you have no idea where anything is at all. 01:40:34 but it would be safe to assume that breaking through a wall is probably going to let you go in the direction you want to go faster than walking all the way around. 01:40:44 at least initially. 01:40:51 when trekking somewhere unknown. 01:41:40 but if you're just wandering around going around the walls would allow you to cover more total distance. 01:42:37 Yeah, the very first thing you need to do is wander aimlessly. 01:43:09 Gregor: How about write a bot that tries to see the entire world 01:43:14 (With hardcoded world-size) 01:43:16 And merge this into a worldview structure 01:45:41 are you given starting coordinates? 01:45:54 CakeProphet: Irrelevant. 01:46:20 might not be. also, smaller world might be better. 01:46:58 Dude ... your starting coordinates are entirely irrelevant. 01:47:03 World size isn't :) 01:47:18 it tells you which boundary you're closest to. 01:47:25 unless it wraps or something. 01:47:59 It's a torus. 01:48:14 which is a fancy way of saying it wraps around right? 01:48:30 In both dimensions 01:54:11 !perl my ($x,$y,$z,$a)= 0..3; ($x,$y,$z,$a) = ($y,$z,$a,$x); print $x,$y,$z,$q 01:54:12 123 01:54:26 !perl my ($x,$y,$z,$a)= 1..4; ($x,$y,$z,$a) = ($y,$z,$a,$x); print $x,$y,$z,$q 01:54:27 234 01:54:43 !perl my ($x,$y,$z,$a)= 1..4; ($x,$y,$z,$a) = ($y,$z,$a,$x); print $x,$y,$z,$a 01:54:43 2341 01:54:45 lulz 02:05:35 ....what. 02:05:39 why did they zip an mp3 02:06:43 more compression 02:07:33 It's the only common archival format on Windows. 02:07:41 Well, unless you count RAR, I suppose. 02:15:47 uuuugh this intro to software engineering class is going to be so bad. 02:16:19 CakeProphet: That's the nature of SE. 02:16:28 CakeProphet: Enjoy learning the terrible UML. 02:18:06 favorite words for professor: "system" "solution" "complexity" "testing" 02:18:45 what's intro to software engineering hehehehehee 02:19:26 it's a class that claims to give you real world experience about designing large-scale software projects. 02:19:30 but in fact teaches you nothing. 02:20:17 Unfortunately, that's a bit hard to teach in an academic setting. 02:20:43 It could probably be *done*, but not in the way that professors would like. 02:25:17 I want to have a Haskell command "more" that is followed by a capitalized word and optionally parameters, ussable in place of any of the following: A statement in a do-block. Where a constructor is expected in a data type declaration. A declaration of a class member. A name in an import or export list for a module. A case in a case expression. 02:25:56 what would it do? you might be able to implement it with quasiquoters 02:26:14 maybe not the name in an import or export list part 02:26:26 For example: hoge = do { putStr "x"; more Hoge; return 17; }; more Hoge = putStr "zzz"; more Hoge = doSomething; 02:26:48 Do you understand what it would mean from this example? 02:27:06 no 02:27:19 Actually sorry, it should be like this: hoge = do { putStr "x"; more Hoge; return 17; }; Hoge = putStr "zzz"; Hoge = doSomething; 02:27:37 what would it do 02:27:49 more Hoge becomes everything assigned to Hoge? 02:27:51 Or this: data Color = more Colors deriving Eq; Colors = Red; Colors = Green; Colors = Blue; 02:27:58 Patashu: Yes. 02:29:51 To give an example with paramters: data T t = Z | more TTT t; TTT a = Once a; TTT b = Twice b b; 02:29:51 zzoskell 02:30:44 That is one of my ideas. 02:31:09 the audio quality of this classroom recording is terrible. 02:31:25 but the class is scheduled at the same time as another class, so I have to listen to these. 02:37:16 And in case of do-statements with <- you could have: do { x <- work; x <- stop x; stop x; } which would be like do { x <- work; y <- stop x; stop y; } (after "more"-expansion) 02:41:42 Um. Doesn't that already work? 02:41:49 pikhq_: I don't know; I have not tried it. 02:42:04 It should based on how the do notation transform works... 02:42:16 Yes it works already 02:42:18 I tried it now 02:42:21 That's the same as: work >>= \x-> stop x >>= \x-> stop x 02:42:39 Which is of course the same as: work >>= stop >>= stop 02:44:54 I tried using GHCi and yes it does already work that way. 02:46:57 zzo38: The problem with "more" for extending "data"-types is that every function defined on an ADT has to either have a blanket handling of unhandled constructors, or else be incomplete... 02:47:06 What I would like to have is that we can have Meta Haskell which allows you to make up things such as "more" command rather than having it built-in, therefore you can make up a lot of other stuff too 02:47:11 That is, every function must be written with all the constructors that will be added in the future in mind 02:47:16 Which makes it much less useful than it could be 02:47:20 This is essentially the Expression Problem 02:47:39 This may interesting you a bit: http://personal.cis.strath.ac.uk/~conor/pub/she/higpig.html 02:47:50 From the she Haskell preprocessor that adds a few interesting features, some related to dependent types 02:47:52