2014-04-22 20:41:06 +0200 <nschoe> mm_freak, http://lpaste.net/103088 : is that the same thing that is happening here ?
2014-04-22 20:40:17 +0200 <nschoe> http://lpaste.net/103088
2014-04-22 20:11:52 +0200 <nschoe> Hi fellow Haskellers, I'm reading Simon Marlow's book about Concurrency in Haskell and I'm having troubles understanding and grasping the asynchronous exceptions. I think I understood the main differences between the two, but when I was playing around with some basic tests, I could not explain this difference : http://lpaste.net/103087 . I simply fork a thread to perform some dumb printing and the I have the main thread throwTo some exception to
2014-04-22 19:06:15 +0200 <mm_freak> fizruk: http://lpaste.net/103085
2014-04-22 17:02:05 +0200 <remib> In this code http://lpaste.net/4174714134471901184 . First I hadn't written the type signature for show. ghci told me "No instance for (Show a) arrising ...". Then I added the signature and it now tells "Illegal type signature...". I guess the error comes from expecting the type "a" to being an instance of "Show". What should I do then ?
2014-04-22 13:49:48 +0200 <vermeille> allsystemsarego: http://lpaste.net/103072 HERE IT IS
2014-04-22 13:46:23 +0200 <vermeille> allsystemsarego: http://lpaste.net/103072
2014-04-22 13:36:16 +0200 <Axman6> allsystemsarego: http://lpaste.net/103070 some edits to show (hopefully) more idiomatic code
2014-04-22 13:22:27 +0200 <allsystemsarego> Hi all, I have a Haskell program that works, can you point out how to make it more idiomatic? http://lpaste.net/103070
2014-04-22 10:13:39 +0200 <Dongyancai> Hello, I'm learning Haskell, and found this: http://lpaste.net/103064 . Is there any rules here? and is there any reason for this?
2014-04-22 08:42:41 +0200 <Arcsech> pavonia: Here's the -v3 log: http://lpaste.net/103062
2014-04-22 08:22:48 +0200 <Arcsech> Does anybody know what Cabal means by this? http://lpaste.net/103060
2014-04-22 06:29:27 +0200 <bulletbill22> http://lpaste.net/103059
2014-04-22 04:14:06 +0200 <Rusk101> I'm so close guys and gals, I can taste it. If anybody has a few minutes. Please let me know why my solvePoly function wont work, but will compile. (memory loss)? http://lpaste.net/103058
2014-04-21 23:11:02 +0200 <bitemyapp> shake-n-bake sandboxes that worked with dependencies in lpaste a la fpcomplete for helping people would be nice.
2014-04-21 20:13:32 +0200 <pjdelport> lechip: Here's a version that puts it together: http://lpaste.net/103037
2014-04-21 20:05:27 +0200 <lechip> nope, ended up in the same spot as before, I'm sorry but I only got more confused, i got this http://lpaste.net/103038
2014-04-21 20:01:29 +0200 <rusk101> anybody with a little help? How can I use scanl to write the algorithm for the last function? http://lpaste.net/103040
2014-04-21 19:53:51 +0200 <rusk101> I got a problem building this last function. Can anybody take a look? It's at the bottom. http://lpaste.net/103040
2014-04-21 19:34:29 +0200 <lechip> pjdelport: I got this http://lpaste.net/103037
2014-04-21 19:33:29 +0200 <Athas> Does this combinator have a standard name? http://lpaste.net/103036
2014-04-21 19:08:21 +0200 <lechip> pjdelport: http://lpaste.net/5211583419422605312
2014-04-21 19:07:25 +0200 <pjdelport> lechip: Want to paste what you have so far on http://lpaste.net/new/haskell ?
2014-04-21 13:25:50 +0200 <grayling_> Can anyone expain to me why this prime algoritm gets almost exponentially more time consuming as the number range grows? http://lpaste.net/103021
2014-04-21 05:00:08 +0200 <Welkin> also, if there are improvements I can make to this code: http://lpaste.net/103015
2014-04-21 04:51:51 +0200 <Welkin> like this: http://lpaste.net/103015
2014-04-21 04:38:26 +0200 <geekosaur> http://lpaste.net/92725
2014-04-21 03:16:54 +0200 <shackleford> Hey guys. So, I decided to give write yourself a scheme a try, and spiced it up with a REPL to test out my parser. My problem occurs in my main, found here: http://lpaste.net/103013. I'd like for the "> " to appear as a prompt to the user for their input, but it prints with the evaluated expression. Anyone know what I'm doing incorrectly?
2014-04-21 00:26:26 +0200 <mmmm> SwashBuckla: http://lpaste.net/101413
2014-04-20 23:34:53 +0200 <SwashBuckla> I have since found a workaround: http://lpaste.net/103010
2014-04-20 23:34:44 +0200 <SwashBuckla> A while back, I was struggling with this: http://lpaste.net/102897
2014-04-20 22:35:58 +0200 <klrr_> why do i get "finset.hs:10:4: parse error on input `fZ'" when i try compile this? http://lpaste.net/103007
2014-04-20 22:01:10 +0200 <aloiscochard> generic continous shell script: http://lpaste.net/103005 /cc Wizek
2014-04-20 20:45:46 +0200 <mzero> please paste your code in the pastebin: s: http://lpaste.net/new/haskell
2014-04-20 20:33:03 +0200 <jesyspa> I'm using the Bound package and would like to allow abstraction for some types and prohibit it for others. I came up with this http://lpaste.net/103004 solution, but it fails due to the kind being infinite. Is there a (better) way to do this?