00:04:52 -!- copumpkin has quit (Quit: Computer has gone to sleep.). 00:10:31 Grrrr wget 00:10:38 * Sgeo wants wget to ignore robots.txt >.> 00:11:20 you wicked spammer 00:11:46 wget has a lot of options look to see if it has the one you want 00:12:12 * Sgeo found something online about it 00:12:21 I don't see this version of wget's --wait thingy 00:19:25 patch wget problem solved 00:19:54 There is no problem 00:20:04 I think --wait just wasn't listed in --help, or I didn't see it 00:20:31 And there is an option to disable checking robots.txt 00:21:54 -e robots=off 00:23:40 Yes 00:23:54 * Sgeo is using it to great effect >.> 00:26:29 Is there an option to change the name of the file to check (other than robots.txt), or to change which entry it searches for in robots.txt? 00:26:59 -!- copumpkin has joined. 00:29:22 I'm not sure what the use of that would be 00:29:39 Or, um, the first option anyway 00:30:19 It's pretty much a standard, if not an official one. About as useless to make an option to change as making a browser that sends RETRIEVE/SEND instead of GET/POST 00:31:16 more of that mustafar/dwarf fortress discussion http://www.irregularwebcomic.net/draakslair/viewtopic.php?t=6110 00:33:29 -!- Patashu has joined. 02:39:10 -!- myndzi\ has quit (Ping timeout: 240 seconds). 03:05:02 -!- nys has quit (Quit: f00f). 03:10:58 hello friends. 03:11:37 I looked in the haskell-src-exts files. The ParseSyntax.hs file (as well as many of the other files) do something, stuff added needs to be added in multiple places manually. For example, PExp needs to also define ann, amap, fmap, etc. But most of that is just the same way. It might seem (to me, at least) a better way using TH-splices generating more-declarations. 03:13:17 I don't know what it seems to you. 03:34:50 The code accumulation in Strathclyde Haskell Enhancement is a very crude idea with code accumulation feature, but it seems insufficient tome (it is also designed for layout mode). That one does not do ordering, removal of duplicates, cooperating with Template Haskell, and a bunch of other stuff. 03:35:40 anyone familiar with xpath? 03:35:53 I'm wondering if the | can be used to search for elements by multiple criteria 03:36:29 -!- CakeProphet has quit (Quit: Reconnecting). 03:36:46 -!- CakeProphet has joined. 03:36:47 -!- CakeProphet has quit (Changing host). 03:36:47 -!- CakeProphet has joined. 03:38:00 //a[@class=...|@href=...|@name=...|@id=...] 03:39:46 Why doesn't "hint" have a function for loading a module from a string instead of from a file? 03:41:06 -!- MDude has changed nick to MSleep. 03:41:25 zzo38: because it is really crappy. 03:41:48 for my IRC bot I worked around this by just writing the string to file and adding the module bits. 03:41:48 Then how to do it better? 03:41:55 mueval has that capability but mueval is also bad. 03:42:42 And you must also send expressions to be evaluated as strings, there is no command to interpret a Q Exp instead? 03:43:01 What program has that one? 03:43:37 Which are better programs? 03:47:45 I have no idea. 03:47:52 lambdabots code is not bad. 03:47:53 -!- augur has quit (Remote host closed the connection). 04:18:06 What kind of data can be compressed well with run length encoding multiple times? What kind of data should you run length encode and then use Huffman coding on the result? 04:19:11 -!- Patashu has quit (Ping timeout: 258 seconds). 04:31:50 multiple time run length encoding sounds unlikely to improve things 04:32:43 that's essentially look-and-say transformation, which quickly starts growing exponentially 04:33:35 Yes I know that is what it is. Doing it a lot will likely grow large. 04:34:20 But maybe some data works better doing RLE twice instead of once, or something like that. Maybe you want to combine multiple units into one unit or split units in some cases. 04:37:20 well in order for the second step to give any further compression, you'd want to collect character c in blocks of length c 04:38:42 or for the first block in a series, perhaps of length equal to the previous character 04:38:42 Yes, it is true; but, what if it is variant RLE where the character is implied? For example, you always alternate black and white so you do not need to indicate that 04:39:14 ah yes. but then the second step would be of a different kind. 04:39:29 Yes it would be different kind 04:39:53 since the RLE coding itself does not preserve that property 04:40:43 but yes, if you had frequently blocks of black and white that had the same length, then that would work 04:42:16 Maybe you have "001001001001001001001001" and you should do the encoding to (2,1) and 8(2,1) if such patterns are common in whatever data you are dealing with. 04:42:40 * CakeProphet is the best programmer in the world. 04:42:42 I know all of the codes. 04:42:58 hm 04:43:09 CakeProphet: Are you sure? I think nobody knows *all* of the codes 04:43:28 oh he does. he just cannot remember which is which. 04:43:29 And even if you did I am unsure if that would make you the best programmer in the world 04:43:35 famous babel library problem. 04:44:17 oerjan: yes I often get minute details of different languages confused. 04:44:37 for example: I have accidentaly wrote "using Control.Monad" in Haskell. 04:44:45 after some C# programming. 04:46:33 and after some intense Perl scripting, I find myself wanting to type $ in front of everything. 04:47:07 for example: in Python I will accidentally type $ instead of % in a string when sprintf'ing it. (sprintf'ing something sounds pretty dirty) 04:47:41 > sin $2 04:47:42 0.9092974268256817 04:47:50 heh. 04:47:53 I have Sokoban encoding, that is first RLE of wall/nonwall alternating, next RLE of target/nontarget skipping all walls, next is a more complicated encoding for the crates. (Characters are implied) Some numbers occur much more often than others, usually low numbers occur more than high numbers. 04:48:14 oerjan: I will now code Haskell in that style from now on. 04:48:23 CakeProphet: O KAY 04:48:41 I composed a Huffman tree by hand but I made a mistake. 04:48:44 > let x = 2 in sin $x 04:48:45 0.9092974268256817 04:48:57 bashkell 04:49:13 CakeProphet: Template Haskell it would do different $ immediately followed by words 04:49:28 Can you make polyglot program now? 04:49:39 not with that "feature" no 04:49:52 polyglots are essentially done by taking advantage of strings and comments. 04:49:58 Perl is particularly well-suited for this. 04:50:12 you can include Perl in almost any polyglot with ease. 04:50:18 it's a little awkward since you cannot do $x = 2 in haskell 04:50:19 Or, make a Haskell program that does different things, all valid, but still somewhat useful, depending on which language extensions are enabled. 04:50:56 oerjan: right and you can't do let or in in Perl unless you define subroutines with some kind of hacked meaning. 04:51:39 zzo38: most common extensions wouldn't do that since they usually inroduce some kind of construct or syntax that didn't exist before. overloaded strings could be used for that purpose though. 04:52:03 zzo38: heh the extensions which add keywords or syntax, perhaps 04:52:39 rec and ? perhaps 04:53:14 > let f ?x = 2 in f ?3 04:53:16 : Parse error in pattern 04:53:17 the easiest way to polyglot Haskell is to use literate Haskell. 04:53:18 > let f ?x = 2 in f ? 3 04:53:19 : Parse error in pattern 04:53:40 zzo38: also I am slightly drunk so, no, probably can't write a polyglot right now. 04:53:42 -!- Patashu has joined. 04:53:43 CakeProphet: i meant for zzo38's distinguishing by haskell extension idea 04:53:56 oerjan: right 04:54:07 You can define # as an operator and then do stuff with the magic hash mode and CPP stuff, and it does differently when these are enabled or disabled. 04:54:13 not sure how ? could be used though 04:54:21 zzo38: ah right 04:54:23 doesn't it require an explicit type signature or...? 04:54:35 no 04:54:40 > let ?x = 2 in ?x 04:54:41 2 04:54:42 ah okay 04:55:13 what DOES require an explicit type signature other than record fields? 04:55:26 but it's not quite clear how to get something which parses both with ? as operator and as implicit parameter prefix 04:55:29 type defintions, and the like 04:55:45 Do classes require an explicit type signature? 04:55:47 CakeProphet: polymorphic recursion 04:55:59 higher rank types 04:56:09 * CakeProphet has really figured out higher rank types yet. 04:56:14 zzo38: not to _use_ them in functions, no 04:56:22 basically it means there is a forall in the type, right? 04:56:31 very basically... 04:56:34 in the type, and not at the front 04:56:35 What I meant is, in definition of classes 04:56:39 oerjan: right 04:56:55 zzo38: for the methods, yes 04:56:59 oerjan: so for example, a type with an embedded existential is a rank-2 type, yes? 04:57:31 but class A a is legal by itself i think, a class with no methods 04:57:50 ah, that's interesting. Basically a set of types. 04:58:22 CakeProphet: i think they are different extensions but you can sometimes convert between using existentials and using higher rank 04:58:54 yes they're different extensions but they both permit the forall syntax. 04:59:10 in different places yes 04:59:56 basically the syntax for existential types are based on the fact that its _constructors_ has a higher rank type 05:00:11 er, or at least polymorphic 05:00:29 I actually understand how the Perl community has taken influence from Haskell. I believe I've heard people (not on this channel) that it's strange. 05:00:38 data SomeShow = forall a. Show a => SomeShow a 05:00:42 +mention 05:01:01 then SomeShow :: forall a. Show a => SomeShow 05:01:04 oerjan: ah, okay. 05:01:32 so does RankNTypes permit existentials? 05:01:33 er 05:01:40 *then SomeShow :: forall a. Show a => a -> SomeShow 05:02:10 i don't _think_ there's any automatic implication anyway, look it up in the user guide :P 05:02:16 *any way 05:02:32 *either way 05:02:45 also how do language extensions work with importing? 05:03:04 modules can ignore the language extensions that other modules use. They do not need to explicitly support them, right? 05:03:38 i don't think they need to. it might depend on what is imported. 05:03:53 right if the API requires a syntax extension to be used properl 05:04:01 y. like fclabels uses TH. 05:05:05 of course, if a dependency uses a language extension then the compiler must support that language extension as well. 05:12:39 -!- zzo38 has quit (Remote host closed the connection). 05:14:14 01:14 < bob2> oh wait, takewhile 05:14:14 01:14 < bob2> I finally understand what it is for 05:14:17 #python 05:15:14 apropos taking influence from haskell :P 05:16:51 itertools, functools, and a very limited list comprehension syntax is probably the only influence Python has from Haskell. 05:19:28 -!- augur has joined. 05:19:50 -!- augur has quit (Read error: Connection reset by peer). 05:20:23 -!- augur has joined. 05:21:45 Not sure if what I did was a good idea or just really really stupid 05:24:09 well there's only one way to find out. make that into a fry meme picture and post to reddit. 05:25:43 < jtannenbaum> and put a dang comment at the end so people know what you're doing, it's tough to read either way 05:26:03 in regards to: list(itertools.product(*[range(x) for x in (2,3,4)])) 05:26:08 -- #python 05:26:50 what's the * for 05:27:04 "flattens" a list into function arguments 05:27:21 f(*[a,b,c]) = f(a,b,c) 05:27:35 also works with tuples and other iterators. 05:27:51 mhm 05:28:00 ** is used to translate dictionaries to named arguments. 05:28:07 It's not possible to go to an eye doctor to preemptively ask if you just infected your eye, is it? 05:28:25 it is possible to do that, yes. 05:28:29 not sure if it'll help though. 05:29:04 ask a doctor. :P 05:54:27 -!- oerjan has quit (Quit: Good night). 06:10:25 Sgeo: what did you do? (the thing that was either good or really really stupid?) 06:11:00 Poking around my eye to try to deal with an eyelash 06:11:04 After my dad told me not to 06:11:18 I did wash my hands and air-dried them, but not entirely sure if I was vigilant enough about that 06:11:27 I may have done a bit of poking around before washing 06:11:36 I did successfully deal with the eyelash 06:11:54 oh, that should be fine, just blink furiously for a while so you re-lubricate your eye 06:12:57 My finger, while I don't think it touched eyeball, did touch skin that probably did touch eyeball 06:14:25 oh no, you touched skin that touches your eyeball? it'd be fine if it was the eyeball directly, but now you're definitely going to die 06:14:45 what's so bad about touching eyeballs? 06:14:56 it scares Sgeo? :) 06:15:26 My dad thought that my eye could get infected like that 06:15:50 (By touching the eyeball if my hands weren't really really really clean) 06:16:07 oh, then my eyes must be really sick by now 06:20:48 -!- augur has quit (Remote host closed the connection). 07:10:01 -!- azaq23 has joined. 07:25:32 > (`replicateM` "abc") =<< [0..] 07:25:33 ["","a","b","c","aa","ab","ac","ba","bb","bc","ca","cb","cc","aaa","aab","a... 07:33:58 so if I wrote a language that compiles to Core 07:34:09 would that give me access to Haskell bindings? 07:34:13 Core? 07:35:12 one of GHC's intermediate languages. 07:38:25 -!- nooga has joined. 08:15:28 -!- copumpkin has quit (Ping timeout: 240 seconds). 08:15:52 -!- copumpkin has joined. 08:16:03 -!- myndzi has joined. 08:43:49 -!- FireFly has joined. 08:43:57 -!- FireFly has quit (Changing host). 08:43:57 -!- FireFly has joined. 08:46:12 -!- Tritonio has joined. 09:09:28 Sgeo: i recommend you stir your emotions with a moving song or video causing you to cry 09:09:41 haha. 09:14:24 (to greensleeves) There once was a cat who had come to my home, and it's life had only just begun. 09:14:49 It played on the carpet with balls of string, while a small family watched it do it's thing. 09:16:20 It jumped on the fridge and slept there all day, or climbed along fences all carefree and gay. 09:22:49 im moved 09:27:17 I moved. 09:39:19 the point was to move sgeo :P 09:39:25 heheh 09:48:18 > nub . permutations $ "sgeo" 09:48:20 ["sgeo","gseo","egso","geso","esgo","sego","oegs","eogs","egos","oges","goe... 09:48:37 nub? why would there be any duplicates? 09:48:53 I'm a cautious guy. 09:49:46 > let permuts = permutations "sgeo" in length $ nub $ permuts == length permuts 09:49:47 Couldn't match expected type `[[GHC.Types.Char]]' 09:49:47 against inferred ... 09:49:51 you would want nub there if it were any string with duplicate characters... so I kind of just use it out of habit. 09:49:57 yes I understand it's the same in this case. 09:50:11 > let permuts = permutations "sgeo" in length . nub $ permuts == length permuts 09:50:12 Couldn't match expected type `[[GHC.Types.Char]]' 09:50:12 against inferred ... 09:50:22 Grah 09:50:23 Sgeo: what are you trying to do? 09:50:38 oh, I see 09:50:42 Sgeo: problem is most likely related to precedence of $ and == 09:50:42 Have lambdabot tell me if length with and without nub is the same 09:50:50 right 09:51:03 > let permuts = permutations "sgeo" in (length $ nub $ permuts) == (length permuts) 09:51:04 True 09:51:23 > let permuts = permutations "sgeo" in (length . nub $ permuts) == (length permuts) 09:51:25 True 09:51:37 Hmm, makes sense 09:52:02 > let permuts = permutations "lambdabot" in (length . nub $ permuts) == (length permuts) 09:52:06 mueval-core: Time limit exceeded 09:52:12 > let permuts = permutations "aa" in (length . nub $ permuts) == (length permuts) 09:52:41 > let permuts = permutations "baby" in (length . nub $ permuts) == (length permuts) 09:52:42 False 09:52:57 #esoteric: conducting groundbreaking research in combinatorics. 09:55:18 > permutations "zzz" 09:55:19 ["zzz","zzz","zzz","zzz","zzz","zzz"] 09:55:34 * Sgeo goes to publish a paper 09:55:43 > join . permutations . "zzz" 09:55:44 Couldn't match expected type `[a]' 09:55:44 against inferred type `GHC.Types... 09:55:46 > join . permutations $ "zzz" 09:55:48 "zzzzzzzzzzzzzzzzzz" 09:55:49 > ((==) <*> nub) (permutations "sgeo") 09:55:50 True 09:55:53 > ((==) <*> nub) (permutations "baby") 09:55:54 False 09:56:01 What's <*> 09:56:07 :t (<*>) 09:56:07 S 09:56:08 forall (f :: * -> *) a b. (Applicative f) => f (a -> b) -> f a -> f b 09:56:11 Oh it's that thing isn't it? 09:56:26 I have no idea what it''s doing there 09:56:28 and yeah for the ((->) a) instance it's S 09:56:29 for functions <*> is ap is the S combinator. 09:56:32 * Sgeo needs sleep 09:57:04 And knowledge of what the S combinator does 09:57:14 \fgx.fx(gx) 09:57:18 f <*> g x = f x (g x) 09:57:19 yes 09:57:20 that 09:58:20 oh right I forgot to do length on them 09:58:21 oops 09:58:39 probably more efficient to do it this way though. 09:58:39 anyway I checked if they were identical rather than merely of the same length 09:58:50 CakeProphet: nope 09:59:11 more efficient to do the lengths, I'd imagine, since you don't have to do comparisons on all the elements 09:59:42 are comparisons more expensive that accumulated addition? also, the false case would be short-circuiting on the shorter list. 09:59:52 whereas with length you traverse the entire list. 10:00:15 er, not on the shorter list 10:00:19 just short circuiting on the false case. 10:00:57 so that gives better average time. :P 10:01:04 I guess if the'd be different really early on and the lists are really long it'd be best to do straight comparison yeah 10:01:19 the thing about comparisons is it depends on the Eq instance 10:01:26 right 10:01:29 could be a 2-d list for example 10:01:32 but not in this case. 10:01:36 er... wait 10:01:37 lol 10:01:41 yes in this case 10:01:42 yep 10:02:13 so yeah length is faster on the true case. 10:02:43 just comparison is maybe faster on the false case. 10:02:45 >_> 10:03:34 > [1..] == [] 10:03:36 False 10:03:38 > [1..] == [1..] 10:03:42 mueval-core: Time limit exceeded 10:03:52 > (((==) `on` length) <*> nub) (permutations "sgeo") 10:03:53 True 10:03:55 > (((==) `on` length) <*> nub) (permutations "baby") 10:03:56 False 10:03:58 oh wait no 10:04:01 mesed that one up 10:04:03 confused myself 10:04:12 wait no 10:04:16 did not mess 10:04:21 double confused ;_; 10:04:25 you want the ap to be on length I would think. 10:04:36 ?? 10:04:37 :t on 10:04:38 forall b c a. (b -> b -> c) -> (a -> b) -> a -> a -> c 10:04:54 oh nevermind 10:05:03 no that's correct. 10:05:51 I want a whole suite of preposition functions. 10:06:14 like what 10:06:15 on, in, around, about, for, with, without 10:06:33 but what would they do 10:06:43 what they say duh. 10:07:00 ok 10:07:25 -!- azaq23 has quit (Ping timeout: 260 seconds). 10:07:27 obviously [] `around` [1,2,3] is [[1,2,3]] 10:07:31 >_> 10:10:54 -!- Wamanuz has quit (Remote host closed the connection). 10:11:23 -!- Wamanuz has joined. 10:11:24 typeclass Match a b where { (===) :: a -> b -> Bool } 10:11:27 *class 10:11:47 now you can have the clusterfuck that is Perl's ~~ (aka "smart match") operator 10:11:57 in the form of like 10 instance declarations. 10:12:44 also can you do things like this in an instance declaration 10:13:03 instance (Eq a) => Match a a where (===) = (==) 10:13:30 with one of those typeclass extensions? 10:14:54 I'd find it more elegant to have an isomorphism (or something more general in a good way not a stupid way) typeclass and define (===) in terms of its operations and (==) 10:14:59 elegant and useful 10:15:26 that is not how Perl's smart matching works. :P 10:15:38 it's DWIS equality. :P 10:15:47 er DWIM 10:16:08 perl the most elegant language 10:16:09 so there's not really a generalization. 10:16:30 nor a haskell implementation 10:16:41 CakeProphet: MultiParamTypeClasses for Match, FlexibleInstances for that instance (because it uses 'a' twice) 10:16:44 I just showed you how it could be done. 10:18:01 I guess yours accounts for cases wherein an isomorphism doesn't exist but you still want thinks to be considered equal, but this is operation is dumb and nobody should want it ever 10:18:24 I mostly use it because it provides a quick way to test list membership in Perl 10:18:34 (1,2,3,4) ~~ 2 is true 10:18:54 ew 10:18:55 so 10:19:05 instance Match [a] a where ... 10:19:12 instance Match a [a] where ... 10:19:35 `elem` sure is a lot of typing 10:19:39 /home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: elem`: not found 10:19:47 also you'd need an Eq a => in there 10:19:51 monqy: yeah because I totally think this is a viable thing in Haskell 10:19:58 or equivalent 10:20:00 and not just a thought experiment on how I would implement such a thing. 10:20:32 if I were you I'd probably go about implementing it in something along the lines of syb, such as not to have to define instances for every pair of types 10:21:16 also regexes do regex matching stuff 10:21:53 I think list ~~ list is intersection for some reason 10:23:58 so that means it couldn't return Bool 10:24:20 it would need to return some kind of special data type or Either if there's only two kinds of result 10:24:36 or Dynamic. :P 10:25:10 intersection? not set equality? sure isnt doing what id mean...... 10:25:30 -!- Phantom_Hoover has joined. 10:25:49 or you could include the result type as a third typeclass param. 10:25:55 for great fun. 10:26:11 should just name it TripleArgumentFunction instead of Match 10:26:23 where by set equality I mean something like ((==) `on` Data.Set.fromList) or ((==) `on` Data.List.Ordered.nub . sort) or something like that 10:26:23 er TwoArgumentFunction rather 10:26:47 at least I think there's a package that provides Data.List.Ordered 10:27:28 Data.List.Ordered.nub = map head . group 10:28:11 her is the Grand Smart Matching table: http://perldoc.perl.org/perlsyn.html#Smart-matching-in-detail 10:29:49 so list ~~ list is true if all elements ~~ to true with the element of the same index in the other list. 10:30:13 that works too I guess 10:31:05 obviously it's a very straightforward operator. 10:32:25 array ~~ function is like all in Haskell 10:34:41 CakeProphet, ~~ is the terrifying, ill-defined operator in Perl, right? 10:36:20 well, it has a definition, but yes it's somewhat terrifying. 10:36:35 it is defined by a huge table of which pairs of types results in what. 10:36:46 most of it makes some kind of intuitive sense. 10:38:09 it has a definition, but it's not a good one 10:38:11 hence ill-defined 10:38:58 where by good I mean "not just a bunch of stupid special cases" 10:41:44 also none of them are technically special 10:41:46 just... cases. :P 10:42:16 they are all special like snowflakes they are special snowflakes 10:42:44 Ruby's === isn't particularly like ~~, is it? 10:43:11 === is the switch-case operator 10:43:19 similar but I don't think it's identical 10:43:42 well, ~~ is also the switch-case operator in Perl so... 10:43:48 yeah it's derived from that. 10:44:12 but I do not know how it works exactly. 10:45:14 most of what ~~ does is already pretty short code so it's kind of pointless other than it provides a somewhat nice switch-case mechanism. 10:47:37 hash ~~ array intersects the hash keys with the array elements 10:47:51 I guess that's kind of useful. 11:13:18 http://www.garshol.priv.no/download/text/perl.html 11:13:36 a very lengthy article about why Perl is bad, written by someone who obviously has very little experience with Perl. 11:14:41 and then starts talking about why Python is awesome 11:16:12 i like how he uses a paul graham quote in introducing python 11:16:56 I don't think you get to complain about manipulating complex data structures in Perl if you can't even do it properly. 11:17:11 though perhaps that's part of his argument. that stupid people can't figure it out. 11:20:07 -!- monqy has quit (Quit: hello). 11:41:49 -!- azaq23 has joined. 11:46:04 -!- Lymee has quit (Read error: Operation timed out). 11:57:55 Anyone know what the contact legs on chips are made from? 12:05:38 -!- Tritonio has quit (Read error: Connection reset by peer). 12:09:53 all i can find is that the contacts on RAM are gold-plated. possibly aluminum or tin. 12:10:38 something that either doesnt corrode or coated with same 12:12:58 Argh, I went for steel. 12:56:14 -!- Necrosporus has joined. 12:58:26 -!- Necrosporus has quit (Quit: Leaving). 13:02:16 -!- Necrosporus has joined. 13:03:43 http://paste.org.ru/?lu3vtb 13:03:57 Do you like it? What' sthat at your opinion? 13:04:33 -!- loje has joined. 13:10:09 -!- loje has quit (Ping timeout: 240 seconds). 14:20:16 -!- Patashu has quit (Ping timeout: 240 seconds). 14:20:22 :t (.)(.) 14:20:22 forall a b (f :: * -> *) (f1 :: * -> *). (Functor f, Functor f1) => f1 (a -> b) -> f1 (f a -> f b) 14:20:40 :t (.) 14:20:41 forall a b (f :: * -> *). (Functor f) => (a -> b) -> f a -> f b 14:20:51 That... what. 14:20:57 @type (.) 14:20:58 forall a b (f :: * -> *). (Functor f) => (a -> b) -> f a -> f b 14:21:13 That's fmap... 14:21:31 -!- copumpkin has quit (Quit: Computer has gone to sleep.). 14:23:11 fmap is a generalization of (Prelude..) and Cale decided that lambdabot should have (.) be generalized as well 14:23:35 For this, and other reasons, lambdabot's Haskell dialect is generally known as Caleskell. 14:23:44 ?ty (++) -- Another example 14:23:45 forall m. (Monoid m) => m -> m -> m 14:24:49 fmap is a generalisation of .? 14:25:37 (Prelude..) is fmap but limited to the (a->) functor 14:25:47 Yeah, I was coming to that conclusion. 14:25:54 > fmap (+1) (*2) 3 14:25:55 7 14:26:08 > (Prelude..) (+1) (*2) 3 14:26:09 Not in scope: `Prelude..' 14:26:15 Bah. 14:26:18 ?ty (Prelude..) 14:26:20 forall b c a. (b -> c) -> (a -> b) -> a -> c 14:26:26 > (Prelude.(.)) (+1) (*2) 3 14:26:33 > (Prelude.(.)) (+1) (*2) 3 14:26:33 Not in scope: data constructor `Prelude' 14:26:34 The syntax is (Prelude..) 14:26:58 I guess it's just missing a qualified import of Prelude 14:27:05 Or then it's using a modified Prelude. 14:46:30 -!- copumpkin has joined. 14:58:39 -!- MSleep has changed nick to MDude. 15:33:26 -!- Phantom_Hoover has quit (Ping timeout: 245 seconds). 15:54:23 -!- nooga has quit (Ping timeout: 264 seconds). 16:14:06 -!- pumpkin has joined. 16:14:33 -!- copumpkin has quit (Ping timeout: 240 seconds). 16:22:59 -!- Phantom_Hoover has joined. 16:30:31 -!- pumpkin has changed nick to copumpkin. 17:34:52 -!- Wamanuz has quit (Read error: Operation timed out). 17:35:26 -!- Wamanuz has joined. 17:47:05 -!- elliott has joined. 17:49:29 hi 17:49:29 elliott: You have 11 new messages. '/msg lambdabot @messages' to read them. 17:49:35 help 17:51:11 thank you...everyone... i think ... 17:55:02 elliott, says the one who has, on multiple occasions, left 20+ messages in my lambdabot inbox. 17:55:22