00:00:02 Ooh. 00:00:09 @src replicateM_ 00:00:09 replicateM_ n x = sequence_ (replicate n x) 00:01:03 > let f m n = error $ show m ++ ' ' : show n in sortBy f [1..10] 00:01:08 mueval-core: Time limit exceeded 00:01:15 wtf 00:01:42 > let f m n = error $ show m ++ ' ' : show n in sortBy f [1..10] 00:01:45 *Exception: 1 2 00:02:02 > let f 1 2 = LT; f m n = error $ show m ++ ' ' : show n in sortBy f [1..10] 00:02:05 *Exception: 3 4 00:02:59 > let f x y | (x,y) `elem` zip [1,3] [2,4] = compare x y; f m n = error $ show m ++ ' ' : show n in sortBy f [1..10] 00:03:01 *Exception: 1 3 00:03:14 > let f x y | (x,y) `elem` zip [1,3,1] [2,4,3] = compare x y; f m n = error $ show m ++ ' ' : show n in sortBy f [1..10] 00:03:16 *Exception: 5 6 00:03:57 > let f x y | (x,y) `elem` zip [1,3,1,5] [2,4,3,6] = compare x y; f m n = error $ show m ++ ' ' : show n in sortBy f [1..10] 00:04:00 *Exception: 7 8 00:04:27 > let f x y | (x,y) `elem` zip [1,3,1,5,7,5] [2,4,3,6,8,7] = compare x y; f m n = error $ show m ++ ' ' : show n in sortBy f [1..10] 00:04:30 *Exception: 1 5 00:10:10 -!- copumpkin has joined. 00:11:14 > sortBy (\x y -> case (ord x - ord y) `mod` 3 of 0 -> EQ; 1 -> GT; 2 -> LT) "copumpkin cobrigade" 00:11:16 "adn becoucoripmpgki" 00:12:17 http://qntm.org/tetris 00:12:24 interesting there are several common substrings to without the co 00:12:28 oerjan: I see 00:12:28 copumpkin: You have 1 new message. '/msg lambdabot @messages' to read it. 00:13:39 in fact just a k and i moved 00:38:34 > error (error "yo") 00:38:36 *Exception: yo 00:41:14 Today, Anki expects me to recall 51 Finnish words and learn an additional 20. 00:41:17 I am screwed. :P 00:41:31 > error $! error "yo" 00:41:32 *Exception: yo 00:41:58 oops 00:42:14 > error undefined 00:42:16 *Exception: *Exception: Prelude.undefined 00:42:21 that's a good one 00:42:33 tama mika on? se on bussi 00:42:43 i wonder why error (error "yo") doesn't give two... 00:43:02 > error $ ' ':error "yo" 00:43:03 *Exception: *Exception: yo 00:43:11 thats my finnish vocab. i believe it means "what is that? that is bus" 00:43:22 > error $ error "yo" 00:43:23 *Exception: *Exception: yo 00:43:24 > fix (error .) "yo" 00:43:25 or something similar 00:43:26 "*Exception: *Exception: *Exception: *Exception: *Exception: *Exception: *E... 00:43:27 wat 00:43:46 > error (error "yo") 00:43:47 *Exception: yo 00:43:56 clearly this is something subtle... 00:44:08 @src ($) 00:44:08 f $ x = f x 00:44:17 > error (error (error "yo")) 00:44:19 *Exception: yo 00:44:45 > error $ error $ error $ "yo" 00:44:46 *Exception: *Exception: *Exception: yo 00:44:52 if there were a rewriting rule, i'd expect it to trigger with $ as well 00:45:25 -!- copumpkin has quit (Ping timeout: 252 seconds). 00:45:49 -!- copumpkin has joined. 00:46:14 copumpkin: shachaf: do any of you have any idea why this differs? 00:46:20 ? 00:46:23 I just got disconnected 00:46:42 oerjan: That's kind of weird. 00:46:47 copumpkin: lambdabot gives different printout for error (error "yo") and error $ error "yo" 00:46:47 > error (error "yo") 00:46:48 *Exception: yo 00:46:53 > error $ error "yo" 00:46:54 *Exception: *Exception: yo 00:47:03 yeah, someone brought that up a while ago 00:47:05 > error (error (error "yo")) 00:47:05 *Exception: yo 00:47:05 > error $ error $ error $ "yo" 00:47:05 *Exception: *Exception: *Exception: yo 00:47:10 Isn't ($) lazy? 00:47:16 > error `id` error "foo" 00:47:16 I can't remember why it is, but I think there was discussion about it on haskell-cafe 00:47:17 *Exception: *Exception: foo 00:47:21 it's some sort of bug somewhere 00:47:38 > id error (error "foo") 00:47:39 *Exception: *Exception: foo 00:47:44 elliott: they _should_ be identical. i'd be extremely surprised it f $ x isn't rewritten to be identical to f x inside ghc 00:47:46 > error (error "foo") 00:47:47 *Exception: foo 00:48:02 > (let x = error in x) (error "foo") 00:48:03 *Exception: foo 00:48:13 > (let x = error in x `seq` x) (error "foo") 00:48:14 *Exception: foo 00:48:19 > (let x = error in id x) (error "foo") 00:48:20 *Exception: *Exception: foo 00:48:26 Exciting. 00:51:00 found it: http://www.haskell.org/pipermail/haskell-cafe/2011-February/088905.html 00:54:56 So GHC knows that error is strict, but not that id error is? 00:55:00 Makes sense, I guess. 00:55:22 "But in version (B), 00:55:22 the demand analyzer only knows that ($) is strict in its first 00:55:23 argument -- it's not strict in its second." 00:55:30 > id error (error "foo") 00:55:31 *Exception: *Exception: foo 00:55:33 > error (error "foo") 00:55:34 *Exception: foo 00:56:13 "If ($) were getting inlined, the code would look the same coming into 00:56:14 demand analysis in both cases, so you wouldn't see a difference. So 00:56:14 I'm guessing you're compiling with -O0. 00:56:14 " 00:58:01 -funroll-loops 00:59:17 -funroll-all-loops 00:59:33 -funroll-in-the-hay 01:10:57 soittaa 01:41:39 -!- FireFly has quit (Quit: swatted to death). 01:45:12 -!- tswett has quit (Ping timeout: 246 seconds). 01:46:22 -!- tswett has joined. 01:47:46 `addquote I'm having nostalgia for when we could see the glass from the floor 01:47:47 520) I'm having nostalgia for when we could see the glass from the floor 01:48:52 is there context 01:59:27 -!- cheater__ has joined. 02:02:52 -!- cheater_ has quit (Ping timeout: 240 seconds). 02:04:52 monqy: minecraft 02:04:56 also technically a jok 02:04:57 e 02:40:57 " thats my finnish vocab. i believe it means "what is that? that is bus" <<< i would translate it as "thïs whät is? it is a bus." 02:41:10 close enough :> 02:41:32 certainly 02:41:43 wahahaha 02:42:26 certainly understandable 02:42:48 yeah.. somehow that phrase stuck 02:43:13 a similar sentence that means something would be "mikä tämä on? se on bussi" 02:43:36 ah.. i wouldn't know how to create such a character 02:43:40 what is this? it is a bus. 02:45:02 so im studying some haskell .. very beginner stuff 02:45:10 i don't know how not to know how to make such a character, so i certainly have some sympathy 02:45:39 erm 02:45:54 oh haskell 02:46:04 not finnish 02:46:05 ... 02:46:09 i have just learned fst (1,'a') and snd ("abc",2) 02:46:14 i was about to ask why the fuck everyone's learning it 02:46:20 but okay haskell 02:46:22 then i'll just ask 02:46:27 why the fuck is everyone learning it? 02:46:45 the reasons should be obvious 02:46:53 oklopol: on beesti languagi 02:47:10 xD 02:47:47 my friend who i left behind in an old chatroom would be very happy to hear i know any haskell words 02:48:01 "besti" is occasionally used i think 02:48:31 i think that the toughest part to learn is pronunciation 02:48:40 > fst . fst . fst . fst $ (((("fst!",1),2),3),4) 02:48:42 "fst!" 02:48:53 whoa.. slow down 02:48:56 >.< 02:49:01 * oerjan cackles evilly 02:49:23 itidus20: how deep expressions have you learned to evaluate so far? 02:49:39 i'm sorry, obscure haskell demonstrations are obligatory on this channel 02:49:56 (not that that was particularly obscure for haskell) 02:49:56 that 4 was roughly my limit i think 02:49:58 an exercize was: Exercise 3.2 Use a combination of fst and snd to extract the character out of the tuple 02:49:59 ((1,’a’),"foo"). -- which i did 02:50:17 lol.. rocket science 02:50:19 snd . fst 02:50:28 oh.. the thing is the book doesn't have the dot 02:50:38 hmm this brings back grave memories 02:50:38 i have a hunch he may not have learned . and $ yet :P 02:51:00 itidus20: that's fine you can use parentheses instead 02:51:09 well anyway biggest penis = snd (fst penis) 02:51:16 the k and r book wasn't referencing certain characetrs when someone tried to show me 02:51:30 so that is a deep concern 02:51:43 ^s/referencing/showing 02:51:47 ah. 02:51:59 gulp 02:52:21 but is probably safe 02:52:25 itidus20: well haskell mostly uses just plain ascii, although there is a flag for using unicode for some stuff if you want things to look more like typeset math 02:52:53 uh.. im gonna assume the book simply didn't introduce the . yet 02:52:59 itidus20: almost certainly 02:53:07 however.. yeah that reminds me that my k and r book.. had missing chars 02:53:23 or maybe they just used \circ instead 02:53:32 > fst (fst (fst (fst (((("fst!",1),2),3),4)))) 02:53:33 "fst!" 02:53:41 better? :) 02:55:35 wurk -> 02:55:36 i see 02:56:55 > snd(snd (1,(2,3))) 02:56:56 itidus20: if f and g are functions, (g . f) is a new function that first applies f, and then applies g to the result. main use of this of course being obfuscation. 02:56:56 3 02:57:14 * oerjan swats oklopol -----### 02:57:20 oklo: im not listening.. :P im not taking the combinatrics approach 02:57:36 i 02:57:36 err 02:57:55 i mean i will if it ever gets there but yeah 02:58:04 you don't get that definition? 02:58:15 oklopol: you don't get that he might not get it? 02:58:25 oerjan: you don't get that i don't get that he might not get it? 02:58:31 wait 02:58:33 you totally got that. 02:58:37 yes i do. 02:58:38 i have no math background.. i encountered a curious ebook though which seems to be good at people like me 02:59:09 but worse than no math background my brain is wired in a strange way 02:59:16 itidus20: is it that Learn You a Haskell book? it's frequently recommended although i learned haskell before that... 02:59:42 Yet Another Haskell Tutorial by some guy Hal Daume 02:59:46 ah. 03:00:09 that's a bit older i think. 03:00:18 I don't think very well. But I do think. 03:00:48 :D 03:00:53 okay i really have to 03:01:32 > prtStrLn "bye" 03:01:33 Not in scope: `prtStrLn' 03:01:39 ok sweet 03:01:58 :-s 03:02:00 itidus20: lambdabot only does expression printing, not output functions 03:02:06 cool 03:02:10 you might try EgoBot instead 03:02:17 !haskell putStrLn "bye" 03:02:19 bye 03:02:38 on the other hand, lambdabot has many more functions imported by default 03:02:40 so i got hugs 03:03:05 itidus20: these days the recommendation is the haskell platform 03:03:23 hugs is sadly completely unmaintained now 03:03:46 although i used it for a long time 03:03:57 if i get anywheer i will keep it in mind 03:04:30 oh.. unrelated.. i have a curious function i would like to define 03:04:46 someone was explaining the game of pennymatching to me yesterday 03:04:53 Using Hugs these days is a bit like using GCC 1 for your C development. 03:05:37 itidus20: oh also when you asked the thing about characters i checked your client version and you seem to be on windows. so (1) there's a character map which you can use to get strange characters (2) if you use hugs you probably want to use winhugs 03:06:44 i have winhugs yeah. haskell book is ok. but once upon a time the k&r book had some troubles leaving out certain chars. ill have to check up one day if it has them 03:07:18 so about pennymatching.. one curious thing is that the rules are identical for each player 03:07:44 so they don't have to be defined for each player, only for a generic player. 03:08:16 (im weird) 03:08:26 sounds like nim-type games 03:08:38 oh.. pennymatching is very very simple. 03:09:07 2 players choose a binary digit (such as heads or tails) in private and then compare. 03:09:27 if they are the same then player 1 wins. if they differ then player 2 wins 03:09:41 someone described it to me yesterday 03:09:51 heh ok that's probabilistic so not really nim-like 03:10:31 looks like a simple mixed strategy game 03:11:16 so, as i started to overanalyze it, i realized that of the four outcomes: 00,01,10,11 that theres no other possible win condition except "one of the players wins by getting 00 or 11" 03:11:43 er what 03:11:56 i though you said player to wins on 01 and 10 03:11:59 *two 03:12:03 well each player supplies a binary digit to the game 03:12:33 and.. of the 2 players.. one of them wins on 00/11 and one of them wins on 01/10 03:12:56 the rule about which player wins on which is arbitrary 03:13:10 itidus20: oh also when you asked the thing about characters i checked your client version and you seem to be on windows. so (1) there's a character map which you can use to get strange characters (2) if you use hugs you probably want to use winhugs 03:13:15 what characters are strange for haskell? 03:13:21 none 03:13:24 as far as i know 03:13:27 i was asking oerjan :P 03:13:33 oh haha ok 03:13:44 elliott: well he was pointing out he couldn't make finnish Ã¤, i think 03:13:56 cut and pastes: ä 03:14:00 hehe 03:16:41 so when i started to analyze this pennymatching what i found is that in order to have a fair game, whatever player 1 does, player 2 must have a 50% chance of winning 03:17:19 i don't know how to formalize the idea exactly.. but it's fascinating since the idea of fairness is recursive between the 2 players 03:18:30 option A = 50% chance. option B = 50% chance. 03:19:17 i should try drawing it for myself in paint 03:22:47 -!- azaq23 has quit (Ping timeout: 250 seconds). 03:22:56 -!- azaq23 has joined. 03:23:14 itidus20: i think it depends on your definition of fair. you might also make it >= 50% i think 03:23:33 uh like.. if you go heads, you have 50% chance of winning because they also have 50% chance of winning *pulls out hair* 03:23:34 hm wait 03:23:52 hehe 03:24:10 there may not be any way in this game of making it > 50% for any option 03:24:18 its simple enough 03:24:48 > 50 for heads: always win (for fairness: for tails: always lose) 03:24:49 Not in scope: `for'Not in scope: `heads'Not in scope: `always'Not in scope:... 03:24:56 i mean, it wouldn't necessarily by unfair if A had a choice that guaranteed that A loses 03:24:56 a vanilla coinflip 03:24:59 if you say that a player wins on 10/11 and the other player wins on 01/00 03:25:15 oerjan: true.. not if they didn't know the rule 03:25:25 but there wouldn't then be enough options with just heads and tails to make it fair the other way around 03:25:43 i think 03:25:57 but it could work if there were more than two options 03:26:01 i worded it in a very obfuscated way 03:26:26 but what fascinated me most of all is the recursive way of defining a 50% chance of winning between the 2 players 03:27:12 i lack the math skill to see sense in it 03:27:24 its surely something trivial 03:29:44 blah. 03:30:41 itidus20: you probably are calculating what's called a nash equilibrium. see http://en.wikipedia.org/wiki/Strategy_(game_theory)#Mixed_strategy it even has a link to Penny Matching 03:30:54 thanks 03:32:35 -!- BeholdMyGlory has quit (Remote host closed the connection). 03:56:52 -!- copumpkin has changed nick to contrapumpkin. 04:02:33 -!- contrapumpkin has changed nick to yoda. 04:02:46 -!- yoda has changed nick to coyoda. 04:03:00 yoda, opposite category is in, hm? 04:04:58 -!- coyoda has changed nick to YodaLemma. 04:07:17 -!- canaima17242 has joined. 04:07:56 holaa 04:08:33 -!- canaima17242 has quit (Quit: Leaving.). 04:09:14 -!- YodaLemma has changed nick to copumpkin. 04:56:46 -!- Sgeo__ has changed nick to Sgeo|DiesAtBadTi. 05:20:39 -!- zzo38 has joined. 05:23:50 zzo38: hmm, is the Unispace specification stable? 05:25:13 i feel it is still vague about multiple labels and INTERCAL operators 05:25:36 lifthrasiir: Some people (including you) can change it if you want to. Including to make it less vague, or discussion those things on the Talk page, or add other Unicode space characters, etc 05:26:43 okay, but as always i wanted to implement it in esotope and the stability of the language is paramount ;) 05:27:39 i appreciate the choice made by Migomipo who separated Migol 09 and 11, for example 05:31:04 It isn't completely stable yet, it is just some ideas I wrote. Feel free to update whatever is unclear or incomplete on that wiki article for Unispace. 05:41:56 Holy crap. There is a lake of sulfuric acid. 05:42:39 A naturally occuring lake of *sulfuric acid*. 05:43:00 ah yeah 05:43:06 thats not that difficult 05:43:35 Still. Fuck. 05:43:43 happens around volcanos especially 05:43:53 ever watched dantes peak? 05:44:17 No. 05:44:26 But, yeah, it makes sense how it can occur. 05:44:53 Volcanic gas very high in sulfur bubbling into a lake â€” bam, sulfuric acid lake. 05:45:22 which specific one are you talking about? 05:45:41 Ijen. 05:45:45 pH of 0.5. 05:48:13 ew mining sulfur by hand 05:48:27 nobody needs that job 05:48:51 And even less so sans gas mask. 05:50:13 under no conditions 05:52:56 There's different levels of "fuck no", though. 05:53:32 sure 05:53:35 fine 05:53:57 but all of them are above a threshold of taking action 05:54:47 Of course, there's *much* better ways of getting sulfur, making the whole proposition sickening and pointless. 05:55:44 Though, TBH, most of those really hazardous things that people in undeveloped nations end up doing are either pointless or much better done via machines. 05:56:08 what are we waiting for? 05:56:23 lets go put that sugar refinery out of business! 05:56:38 Well, there's this nasty problem with economic inequities... 05:56:43 those poor guys need to be unemployed 05:57:36 And it's very, very nontrivial to bootstrap an economy. 05:59:06 who needs to bootstrap an economy? we just bring in our own people and equipment, pay fair tax on export and use of the land... 05:59:32 eventually theyll take over the operation themselves cuz thats just how things go 05:59:44 but for now, it cant hurt them really 06:01:27 Or, knowing humanity's propensity for dickishness, we'll just settle in and create an oppressed underclass that eventually rises up and then has no idea how to run shit, causing things to go to shit. 06:03:17 wtf? create? theres already one! otherwise there wouldnt be people carrying sulfur out of a volcano for $13/day 06:04:06 That's not the *underclass* in that society. 06:04:13 You may now be frightened. 06:05:19 so you agree we wouldnt really be hurting them to build some infrastructure there? 06:05:43 Well. No. My only issue is that there's a decent chance the people involved in doing so will be royal dicks. 06:06:39 i was saying we should be those people 06:06:46 pretty sure i'm not a dick :) 06:06:53 Oh, we personally? No argument. :P 06:07:17 Though I'm afraid that at the moment, they're paid higher wages than I. 06:07:23 haha 06:07:41 (fuck you, Bush.) 06:08:51 not long ago i heard a few fuck reagans 06:09:01 Why did you get dead yesterday? 06:09:01 Also fuck Reagan. 06:09:03 He started it. 06:09:08 so it seems we shall have a good oldfashioned consie president orgy soon 06:09:45 And why didn't you write that book tomorrow? 06:11:08 who are you talking to zzo38? 06:12:07 You, in case you are on this channel. 06:13:06 -!- oerjan has quit (Quit: Good night). 06:13:07 oh 06:13:59 well ask again last week and maybe I'll havd an answer for you by the day i am laid to rest 06:14:42 OK, I will try. But maybe I can't. 06:15:15 -!- copumpkin has quit (Read error: Operation timed out). 06:15:49 well, if i never try to find out how your attempt went, then you can both succeed and fail 06:17:06 -!- copumpkin has joined. 06:24:06 I read book once, it says Jesus is laughing and none of the things they described in the Bible actually existed, they are mythology meant to make up ideas and philosophy and parables and those things, and it makes Gnostic Christianity still valid. 06:25:57 (In the past, it was, and still is in the present, my opinion, that the proper meaning of religion, it doesn't matter whether or not the events described in the Bible actually happened or not.) 06:28:29 Do they exist any of the mana symbols and other symbols for Magic: the Gathering, and energy card symbols for Pokemon card, and Fanucci suit symbols, and so on, in METAFONT? 06:28:57 RE: MTG symbols. No, but there should be. 06:30:10 Yes I think it would be good idea. Would you know who knows how to do it with a good job? 06:37:41 There is at least one (probably several) TTF of (some) MTG symbols, it might be possible to do some manual convertatation, or at least use it as a starting point. (Though I have no clue how good it is; I just saw one somewhere.) 06:39:10 Don't know about how one would do those multicolored hybrid symbols in METAFONT; isn't it quite strictly monochromatic? 06:40:38 Yes it is monochromatic (although you can use specials if needed). It doesn't need colored; you can do it in monochrome so that it works on monochrome printers. The background circle is the colored part and it would be a separate circle symbol, inserted whenever needed for color symbols on color printers. 06:41:44 But there are those two-color ones, like http://wiki.mtgsalvation.com/images/4/4b/Manaur.gif -- though I guess you could have the two halves as separate symbols. 06:42:28 Yes you can have the two halves as separate symbols. 06:42:52 -!- CakeProphet has joined. 06:42:53 -!- CakeProphet has quit (Changing host). 06:42:53 -!- CakeProphet has joined. 06:43:04 (You could use ImageMagick colors, PostScript colors, PDF colors, or what I prefer is CMYKX color specials (where X is like K but used for monochrome printers, while CMYK is for color printers)) 06:44:30 I think separate symbols would work. Each half of circle is one symbol which is colored when printing. And the mana symbols can just be the smaller ones than normal and then put in place. 06:47:52 -!- Taneb has joined. 06:48:05 http://www.mezzacotta.net/garfield/?comic=141 I do believe that the text beneath is the best bit about this one. 06:48:24 * pikhq is a-archive-binging sqrt(-$garfield) 06:48:56 Morning! 06:49:26 The other way is to convert the images used in MSE directly to GF format for the specified resolutions. 06:49:39 > sqrt 3.14159 06:49:41 1.7724531023414978 06:50:59 > sqrt -3.14159 06:51:01 Overlapping instances for GHC.Show.Show (a -> a) 06:51:01 arising from a use of `... 06:52:01 orosu 06:52:14 > sqrt (-pi) 06:52:15 NaN 06:52:19 woot 06:52:23 There you have the floating-point version. 06:52:28 thanks 06:52:49 > sqrt -3.14159 06:52:50 need parens 06:52:53 around the negative number 06:52:59 nods 06:53:20 Otherwise it's (-) sqrt 3.14159, which is of course a type error. 06:53:37 ahh 06:53:45 hmm 06:53:51 so you can't have a negative function 06:54:10 Unary minus is a bit of a hack in Haskell. 06:54:32 (TBH, it's a bit of a hack in pretty much every language with both it and binary minus, but that's beside the point) 06:54:35 well.. mathematical theory probably hasn't explored the implication of a negative function 06:55:05 but since a function isn't really a number im just being dumb 06:55:16 Well, I suppose you could do a variant of Church numerals, thereby getting you functions as numbers. 06:55:18 :) 06:55:28 Actually, without "variant of". 06:55:46 You only need to do extra legwork if you want it to do negatives or something. 06:56:32 hummm 06:56:37 don't mind me 06:57:56 > sqrt $ (-pi) :+ 0 06:57:57 0.0 :+ 1.7724538509055159 06:58:02 sometimes i find my own words to be a thicket, because i have seen how calculated peoples words can be after they start reading about manipulative psychology 06:58:27 How was it with lambdabot, how does it have all the modules (all of them) available by default? 06:58:29 almost every sentence can be evil if the intent behind it is evil 06:58:46 What does :+ do? Is it for specifying complex numbers? 06:58:55 It's the complex number constructor, yes. 06:59:11 itidus20: That is difficult to know if it is correct or whatever it is 06:59:46 you mean sqrt (-pi) ? 07:00:01 Does the intent behind a sentence make it evil? I don't know. 07:00:12 or do you mean followers of general semantics 07:00:24 and all such nonsense 07:00:52 -!- CakeProphet has quit (Ping timeout: 255 seconds). 07:00:53 That is the philosophical ideas of evil and such. 07:01:43 it has come to my attention that rather than using words to express feelings, people these days are interested in using communication as a weapon 07:02:21 being entirely two faced thinking noone knows what they are doing 07:02:42 Floating-point vs mathâ„¢: floating-point wins again: 07:02:43 > (-pi) :+ 0 == mkPolar pi pi 07:02:44 False 07:02:45 i don't mean here i just mean in general 07:02:47 > magnitude $ ((-pi) :+ 0) - (mkPolar pi pi) 07:02:48