Mo7art/Stack2Graph_VD_haskell · Datasets at Hugging Face

chunk_id large_stringlengths 7 11 ⌀	question_id large_stringlengths 4 8	language large_stringclasses 1 value	chunk_index int64 0 6 ⌀	chunk_text large_stringlengths 127 3.8k ⌀	sparse_text large_stringlengths 120 5.55k	dense_vector listlengths 3.58k 3.58k ⌀	sparse_indices listlengths 2 238 ⌀	sparse_values listlengths 2 238 ⌀	export_source large_stringclasses 1 value
69666548_c0	69666548	haskell	0	Title: apply a function n times to the n-th item in a list in haskell Problem title: apply a function n times to the n-th item in a list in haskell Tags: recursion, haskell, higher-order-functions Problem: apply a function n times to the n-th item in a list in haskell I want a higher-order function, g, that will apply ...	apply a function n times to the n-th item in a list in haskell apply a function n times to the n-th item in a list in haskell recursion haskell higher-order-functions apply a function n times to the n-th item in a list in haskell I want a higher-order function, g, that will apply another function, f, to a list of integ...	[ -0.0146484375, 0.00604248046875, 0.004119873046875, -0.0361328125, 0.01275634765625, 0.00080108642578125, -0.002593994140625, -0.00531005859375, 0.008056640625, -0.0224609375, 0.019287109375, -0.01361083984375, 0.00055694580078125, 0.009521484375, 0.000942230224609375, -0.0061950683593...	[ 59911, 32354, 653, 20028, 47, 9, 927, 35735, 23, 5303, 1556, 142508, 195625, 1830, 77546, 80596, 137175, 3444, 706, 1221, 15700, 1238, 892, 26255, 6044, 3714, 831, 22288, 1884, 5809, 2843, 70141, 7440, 14012, 3871, 4527, 18, 5351, 50717, ...	[ 0.169189453125, 0.206298828125, 0.148681640625, 0.218994140625, 0.0771484375, 0.029693603515625, 0.134765625, 0.1387939453125, 0.0521240234375, 0.144775390625, 0.1500244140625, 0.2196044921875, 0.16650390625, 0.1007080078125, 0.113037109375, 0.157470703125, 0.1563720703125, 0.12902...	embed
2448683_c0	2448683	haskell	0	Title: Haskell parsec parsing a string of items Problem title: Haskell parsec parsing a string of items Tags: haskell, parsec Problem: Haskell parsec parsing a string of items I have a list that I need to parse where the all but the last element needs to be parsed by one parser, and the last element needs to be parsed ...	Haskell parsec parsing a string of items Haskell parsec parsing a string of items haskell parsec Haskell p1b parse1 parser1 parse2 parser2 AParse Haskell parsec parsing a string of items I have a list that I need to parse where the all but the last element needs to be parsed by one parser, and the last element needs to...	[ -0.011962890625, 0.0267333984375, -0.01220703125, 0.0439453125, -0.0089111328125, 0.039306640625, -0.004669189453125, -0.014404296875, 0.025146484375, -0.005706787109375, 0.01336669921875, -0.0045166015625, 0.0234375, 0.00885009765625, -0.0196533203125, -0.01043701171875, -0.00677490...	[ 20625, 142508, 366, 39797, 6953, 79315, 111, 55769, 1556, 915, 275, 184, 418, 2189, 304, 28004, 5303, 3871, 1284, 4568, 12830, 27117, 5281, 1632, 15700, 37842, 2967, 831, 18588, 107730, 11343, 64194, 31358, 33720, 3917, 5154, 59911, 47, 268...	[ 0.14599609375, 0.2208251953125, 0.1839599609375, 0.2454833984375, 0.05877685546875, 0.19921875, 0.045013427734375, 0.206787109375, 0.1302490234375, 0.006256103515625, 0.05157470703125, 0.172607421875, 0.10711669921875, 0.1573486328125, 0.13427734375, 0.1488037109375, 0.137451171875, ...	embed
50931355_c0	50931355	haskell	0	Title: How can I test a program reading from stdin in GHCi? Problem title: How can I test a program reading from stdin in GHCi? Tags: interactive, ghci, haskell, testing, io Problem: How can I test a program reading from stdin in GHCi? My program has a bug I want to see within GHCi: $ ./my-program < ./my-data Prelude.f...	How can I test a program reading from stdin in GHCi? How can I test a program reading from stdin in GHCi? interactive ghci haskell testing io stdin System.IO How GHCi Prelude.foldl1 Prelude ReadMode my-program.hs How can I test a program reading from stdin in GHCi? My program has a bug I want to see within GHCi: I trie...	[ -0.0206298828125, -0.00994873046875, 0.00506591796875, 0.00567626953125, -0.001922607421875, 0.0081787109375, 0.0225830078125, -0.00982666015625, -0.00543212890625, -0.05078125, 0.004486083984375, -0.0087890625, -0.020263671875, 0.004730224609375, 0.0191650390625, -0.00909423828125, ...	[ 11249, 831, 87, 3034, 1528, 16454, 1295, 6138, 3035, 23, 527, 73265, 14, 212398, 31380, 318, 1556, 142508, 134234, 22995, 12353, 17780, 1914, 822, 112, 42822, 141, 418, 4764, 9083, 759, 18749, 127, 54608, 1957, 28032, 151134, 2046, 93232, ...	[ 0.043731689453125, 0.057281494140625, 0.054412841796875, 0.2279052734375, 0.18701171875, 0.1746826171875, 0.1146240234375, 0.1619873046875, 0.1937255859375, 0.08453369140625, 0.08587646484375, 0.1370849609375, 0.1893310546875, 0.09326171875, 0.119873046875, 0.1650390625, 0.0932617187...	embed
20131059_c0	20131059	haskell	0	Title: Length l1 +1 => what is one for? Problem title: Length l1 +1 => what is one for? Tags: haskell Problem: Length l1 +1 => what is one for? agrupa :: String -> [(Char,Int)] agrupa [ ] = [ ] agrupa (x:xs) = let (l1, l2) = span' (==x) xs in (x, (length l1) + 1) : agrupa l2 span' :: (a->Bool) -> [a] -> ([a],[a])...	Length l1 +1 => what is one for? Length l1 +1 => what is one for? haskell Length Char x:xs Bool Length l1 +1 => what is one for? this function gets a string and gives us how many of each character are there? my question is related to the 1 in (length l1) + 1 why do we need it? I'd really appreciate if you explain...	[ 0.0026702880859375, 0.024658203125, -0.0172119140625, 0.02880859375, -0.0064697265625, 0.00147247314453125, 0.0037994384765625, -0.01519775390625, 0.01214599609375, -0.0281982421875, -0.0098876953125, -0.00118255615234375, 0.00311279296875, 0.04296875, -0.017578125, 0.0023345947265625,...	[ 77554, 927, 96, 418, 57157, 2203, 5386, 2367, 83, 1632, 100, 1556, 142508, 21656, 1022, 425, 7, 2460, 929, 903, 32354, 62163, 79315, 76199, 1821, 3642, 5941, 12638, 62816, 2685, 9655, 62548, 70, 106, 23, 23986, 17727, 997, 15400, 54, 64...	[ 0.15380859375, 0.1351318359375, 0.1429443359375, 0.1768798828125, 0.220947265625, 0.0177764892578125, 0.0880126953125, 0.08978271484375, 0.0897216796875, 0.1484375, 0.165771484375, 0.1392822265625, 0.24365234375, 0.1614990234375, 0.003448486328125, 0.0266265869140625, 0.0008850097656...	embed
7998458_c0	7998458	haskell	0	Title: Why does this simple use of the State monad cause a stack overflow? Problem title: Why does this simple use of the State monad cause a stack overflow? Tags: monads, stack-overflow, haskell, state-monad Problem: Why does this simple use of the State monad cause a stack overflow? I was playing around with the Stat...	Why does this simple use of the State monad cause a stack overflow? Why does this simple use of the State monad cause a stack overflow? monads stack-overflow haskell state-monad Control.Monad.State.Lazy Why State mapM_ Why does this simple use of the State monad cause a stack overflow? I was playing around with the Sta...	[ -0.00335693359375, -0.00860595703125, 0.006439208984375, -0.01214599609375, -0.0022735595703125, -0.00011920928955078125, -0.0181884765625, -0.00872802734375, 0.00994873046875, -0.049072265625, 0.0186767578125, 0.0107421875, 0.00469970703125, 0.0164794921875, 0.01458740234375, -0.00387...	[ 44084, 14602, 903, 8781, 4527, 22836, 2667, 712, 22304, 10, 177261, 645, 118664, 7, 5465, 1556, 142508, 11341, 3796, 27131, 46674, 135206, 2729, 3285, 22288, 594, 454, 75169, 10932, 3714, 2367, 216806, 70, 63847, 18151, 1884, 2967, 66211, 5...	[ 0.146728515625, 0.0419921875, 0.05145263671875, 0.142822265625, 0.0963134765625, 0.206787109375, 0.1373291015625, 0.1905517578125, 0.1663818359375, 0.05242919921875, 0.198974609375, 0.1241455078125, 0.26513671875, 0.0406494140625, 0.103759765625, 0.08038330078125, 0.1822509765625, ...	embed
30619750_c0	30619750	haskell	0	Title: Haskell-style type families Problem title: Haskell-style type families Tags: type-families, idris, haskell Problem: Haskell-style type families In Haskell, I might write a typeclass with a type declaration to create a type family, like so: class ListLike k where type Elem :: * -> * fromList :: [Elem k] -> k And ...	Haskell-style type families Haskell-style type families type-families idris haskell Haskell-style ListLike Elem Bytestring Char Haskell-style type families In Haskell, I might write a typeclass with a type declaration to create a type family, like so: And then write instances like this: I'm aware that you can create ty...	[ 0.0145263671875, 0.0027313232421875, -0.0142822265625, 0.00048065185546875, -0.0142822265625, 0.006378173828125, 0.006744384765625, -0.0142822265625, -0.01953125, -0.015869140625, -0.01055908203125, -0.0140380859375, -0.01165771484375, 0.0019378662109375, -0.0184326171875, 0.005859375,...	[ 20625, 142508, 40946, 10644, 87143, 69128, 3447, 3679, 1556, 32036, 156607, 195, 3311, 67, 91693, 21656, 13648, 33022, 67413, 678, 21635, 28282, 14449, 1884, 221, 110527, 903, 107419, 831, 136, 67919, 32354, 23, 181545, 70, 150624, 160404, 20...	[ 0.09832763671875, 0.2159423828125, 0.1500244140625, 0.2095947265625, 0.1981201171875, 0.134765625, 0.0234375, 0.12158203125, 0.0860595703125, 0.06915283203125, 0.1483154296875, 0.0582275390625, 0.0305328369140625, 0.029449462890625, 0.09783935546875, 0.05810546875, 0.0728759765625, ...	embed
55026330_c0	55026330	haskell	0	Title: Include sprites into binary -- Gloss library Problem title: Include sprites into binary -- Gloss library Tags: gloss, haskell Problem: Include sprites into binary -- Gloss library I am trying to make a flappy bird game in Haskell and I'd like to know if there's a way to "compile" the .bmp files into the binary? ...	Include sprites into binary -- Gloss library Include sprites into binary -- Gloss library gloss haskell Include Gloss gloss-1.13.0.1 bg0Pic bg0.bmp Include sprites into binary -- Gloss library I am trying to make a flappy bird game in Haskell and I'd like to know if there's a way to "compile" the .bmp files into the bi...	[ -0.009033203125, 0.017822265625, 0.0054931640625, 0.0167236328125, -0.010986328125, 0.0244140625, 0.01251220703125, -0.0157470703125, -0.006439208984375, -0.0302734375, 0.0125732421875, 0.00250244140625, 0.01324462890625, 0.022705078125, 0.017333984375, 0.00665283203125, -0.005157470...	[ 8942, 822, 40988, 1636, 3934, 2394, 6635, 46173, 7, 35773, 207244, 1556, 142508, 5759, 2681, 102014, 11821, 2389, 683, 1771, 275, 2676, 1294, 31577, 3249, 13034, 66433, 263, 71, 6712, 20625, 3917, 58875, 1340, 5, 102158, 12008, 71924, 2886,...	[ 0.07305908203125, 0.118896484375, 0.2371826171875, 0.138916015625, 0.115478515625, 0.19775390625, 0.1630859375, 0.156982421875, 0.1297607421875, 0.1656494140625, 0.232177734375, 0.094970703125, 0.2393798828125, 0.015411376953125, 0.1080322265625, 0.13037109375, 0.032623291015625, 0...	embed
6270324_c0	6270324	haskell	0	Title: In Haskell, how do you trim whitespace from the beginning and end of a string? Problem title: In Haskell, how do you trim whitespace from the beginning and end of a string? Tags: haskell, trim, string, removing-whitespace Problem: In Haskell, how do you trim whitespace from the beginning and end of a string? How...	In Haskell, how do you trim whitespace from the beginning and end of a string? In Haskell, how do you trim whitespace from the beginning and end of a string? haskell trim string removing-whitespace the qualified Haskell Data.Text T.strip In Haskell, how do you trim whitespace from the beginning and end of a string? How...	[ 0.00836181640625, 0.0157470703125, -0.00634765625, 0.0245361328125, -0.0189208984375, 0.0018463134765625, 0.0084228515625, 0.0107421875, 0.012451171875, -0.01361083984375, -0.007568359375, -0.00970458984375, -0.010009765625, 0.01007080078125, -0.00185394287109375, 0.00494384765625, 0...	[ 360, 20625, 142508, 3642, 85247, 35011, 65421, 1295, 86595, 136, 3564, 79315, 111, 1556, 49146, 6496, 148477, 217225, 11809, 174379, 384, 59623, 11249, 4034, 34735, 15659, 16765, 191607, 12921, 23351, 5180, 1884, 7722, 20, 61887, 814, 63033, ...	[ 0.059814453125, 0.12646484375, 0.2349853515625, 0.06182861328125, 0.247314453125, 0.1959228515625, 0.266357421875, 0.065185546875, 0.160400390625, 0.115478515625, 0.165771484375, 0.2371826171875, 0.0173492431640625, 0.1043701171875, 0.103759765625, 0.060638427734375, 0.1622314453125,...	embed
22891947_c0	22891947	haskell	0	Title: haskell newbie whats wrong with this CLI bmiTell function Problem title: haskell newbie whats wrong with this CLI bmiTell function Tags: haskell Problem: haskell newbie whats wrong with this CLI bmiTell function I get parse error on following bmiTell why is that? Prelude> :{ Prelude\| let bmiTell :: Double -> Dou...	haskell newbie whats wrong with this CLI bmiTell function haskell newbie whats wrong with this CLI bmiTell function haskell CLI Prelude Double You Pffft Lose haskell newbie whats wrong with this CLI bmiTell function I get parse error on following bmiTell why is that?	[ -0.01300048828125, 0.00173187255859375, 0.0020294189453125, 0.0242919921875, 0.00433349609375, 0.03515625, 0.00095367431640625, -0.0223388671875, 0.00830078125, 0.02490234375, -0.0084228515625, -0.00092315673828125, 0.0191650390625, -0.0167236328125, 0.0169677734375, 0.01495361328125, ...	[ 1556, 142508, 3525, 9014, 2367, 7, 44691, 678, 903, 10927, 876, 266, 618, 6796, 32354, 1914, 822, 112, 107172, 2583, 87360, 125927, 3731, 13, 2046, 366, 184, 18499, 25632, 15400, 83, 450 ]	[ 0.1290283203125, 0.234375, 0.13330078125, 0.1900634765625, 0.03692626953125, 0.010589599609375, 0.180419921875, 0.0889892578125, 0.1141357421875, 0.16015625, 0.0985107421875, 0.2008056640625, 0.1571044921875, 0.2587890625, 0.17626953125, 0.0987548828125, 0.1826171875, 0.04122924804...	embed
23796836_c0	23796836	haskell	0	Title: Couldn't match expected type IO Problem title: Couldn't match expected type IO Tags: haskell, tree Problem: Couldn't match expected type IO -- Binary Search tree data Tree a = Empty \| Node a (Tree a) (Tree a) deriving (Eq, Ord, Show) leaf :: a -> Tree a leaf x = Node x Empty Empty insert :: (Ord a) => ...	Couldn't match expected type IO Couldn't match expected type IO haskell tree Couldn Binary Search Tree Empty Node Ord Show Couldn't match expected type IO Error message:	[ 0, -0.007415771484375, 0.0036468505859375, 0.003997802734375, 0.007476806640625, 0.01470947265625, -0.0299072265625, -0.034912109375, -0.010498046875, -0.0189208984375, 0.004791259765625, -0.0390625, -0.0031585693359375, -0.01202392578125, 0.010986328125, 0.005828857421875, 0.0170898...	[ 191147, 19, 3768, 18, 14858, 84751, 10644, 17780, 1556, 142508, 53201, 54092, 1294, 33086, 101344, 31678, 939, 438, 112, 35379, 17367, 212059, 26008 ]	[ 0.0919189453125, 0.01666259765625, 0.06414794921875, 0.0819091796875, 0.1832275390625, 0.1358642578125, 0.1531982421875, 0.1796875, 0.107666015625, 0.1781005859375, 0.1798095703125, 0.1431884765625, 0.032196044921875, 0.1435546875, 0.1810302734375, 0.1318359375, 0.034881591796875, ...	embed
64942087_c0	64942087	haskell	0	Title: Checking for all Elements in a Set in Haskell using syntactic sugar Problem title: Checking for all Elements in a Set in Haskell using syntactic sugar Tags: unique, haskell, syntax, list, list-comprehension Problem: Checking for all Elements in a Set in Haskell using syntactic sugar I try to remove the Integer d...	Checking for all Elements in a Set in Haskell using syntactic sugar Checking for all Elements in a Set in Haskell using syntactic sugar unique haskell syntax list list-comprehension syntactic Checking Elements Set Haskell Checking for all Elements in a Set in Haskell using syntactic sugar I try to remove the Integer du...	[ -0.0169677734375, 0.00836181640625, 0.00872802734375, -0.01031494140625, 0.002227783203125, 0.002471923828125, 0.01019287109375, 0.0002498626708984375, 0, 0.003875732421875, -0.004058837890625, 0.016357421875, 0.01953125, -0.0026397705078125, -0.0233154296875, 0.00811767578125, 0.002...	[ 38679, 214, 100, 756, 48325, 19943, 20625, 142508, 17368, 6002, 102, 49086, 101087, 36998, 1556, 86531, 5303, 3220, 23, 9790, 87388, 44401, 171763, 1636, 32036, 111, 71713, 360, 18, 142027, 110, 23351, 67, 7722, 151575, 1884, 37842, 14373, ...	[ 0.20361328125, 0.0557861328125, 0.1134033203125, 0.10791015625, 0.189697265625, 0.17578125, 0.129150390625, 0.23486328125, 0.017974853515625, 0.1014404296875, 0.1357421875, 0.1019287109375, 0.2183837890625, 0.1407470703125, 0.101318359375, 0.096435546875, 0.0947265625, 0.0214233398...	embed
58487027_c0	58487027	haskell	0	Title: How to fix indentation? Haskell: parse error on input `\|' Problem title: How to fix indentation? Haskell: parse error on input `\|' Tags: haskell Problem: How to fix indentation? Haskell: parse error on input `\|' So I am getting the error: error: parse error on input `\|' \| x == 'a' = True The code itsel...	How to fix indentation? Haskell: parse error on input `\|' How to fix indentation? Haskell: parse error on input `\|' haskell AssignmentHelp.Cipher How Haskell SubstitutionCiphers Cipher Boolean x:xs How to fix indentation? Haskell: parse error on input `\|' So I am getting the error: The code itself is: I tried...	[ -0.005645751953125, 0.01336669921875, 0.01043701171875, 0.021728515625, 0.0194091796875, 0.0047607421875, -0.0103759765625, -0.0068359375, 0.0235595703125, -0.00054168701171875, -0.00124359130859375, 0.00994873046875, 0.00628662109375, 0.018798828125, -0.00286865234375, -0.016357421875...	[ 11249, 47, 30022, 18597, 22062, 32, 20625, 142508, 12, 366, 184, 18499, 98, 107730, 9473, 58745, 54764, 3768, 1556, 31304, 60785, 254, 94266, 8273, 13480, 73783, 34677, 1022, 425, 20949, 18151, 68034, 83, 37842, 75939, 67842, 12921, 48322, ...	[ 0.073486328125, 0.04705810546875, 0.1849365234375, 0.2041015625, 0.2042236328125, 0.013397216796875, 0.142578125, 0.2489013671875, 0.012054443359375, 0.1536865234375, 0.13916015625, 0.20703125, 0.05889892578125, 0.2017822265625, 0.1619873046875, 0.1785888671875, 0.000244140625, 0.1...	embed
34629132_c0	34629132	haskell	0	Title: How `sequenceA` works Problem title: How `sequenceA` works Tags: haskell, applicative Problem: How `sequenceA` works I'm new to Haskell and trying to understand how does this work? sequenceA [(+3),(+2),(+1)] 3 I have started from the definition sequenceA :: (Applicative f) => [f a] -> f [a] sequenceA [] = pure [...	How `sequenceA` works How `sequenceA` works haskell applicative How Applicative x:xs How `sequenceA` works I'm new to Haskell and trying to understand how does this work? I have started from the definition And then unfolded recursion into this But here i don't understand for which applicative functor operator <*> will ...	[ 0.007080078125, 0.02001953125, -0.0006103515625, 0.041259765625, 0.0068359375, -0.0016326904296875, 0.00433349609375, 0.02099609375, 0.0279541015625, -0.01318359375, 0.0194091796875, 0.00077056884765625, 0.0103759765625, 0.058349609375, 0.014404296875, -0.02734375, 0.01019287109375, ...	[ 11249, 184, 944, 3956, 284, 43240, 1135, 1556, 142508, 41816, 4935, 5659, 11048, 1022, 12, 425, 7, 9473, 3525, 20625, 31577, 28219, 3642, 14602, 4488, 80934, 42822, 195625, 1830, 3688, 2301, 18, 100, 7477, 18770, 39933, 1639, 1221, 35839, ...	[ 0.10565185546875, 0.1070556640625, 0.1669921875, 0.17333984375, 0.2177734375, 0.181396484375, 0.0230712890625, 0.1204833984375, 0.2099609375, 0.1646728515625, 0.1383056640625, 0.1324462890625, 0.16650390625, 0.053985595703125, 0.059661865234375, 0.08477783203125, 0.032470703125, 0....	embed
24271129_c0	24271129	haskell	0	Title: Difference between $ and () Problem title: Difference between $ and () Tags: functional-programming, haskell Problem: Difference between $ and () I started learning Haskell and I encountered a problem I can't just understand. I've got a method used to find value from a list of key-value list (from this page ): l...	Difference between $ and () Difference between $ and () functional-programming haskell Difference Difference between $ and () I started learning Haskell and I encountered a problem I can't just understand. I've got a method used to find value from a list of key-value list (from this page ): I tried fiddling with a bit ...	[ 0.0005340576171875, 0.007171630859375, 0.011474609375, -0.015380859375, 0.004669189453125, 0.0189208984375, -0.010009765625, 0.0208740234375, 0.01458740234375, -0.0206298828125, 0.006683349609375, -0.000370025634765625, -0.001434326171875, 0.003997802734375, -0.0101318359375, 0.0118408...	[ 803, 18234, 6620, 17721, 3650, 136, 15, 16, 123309, 28966, 1556, 142508, 26859, 52080, 20625, 190647, 2967, 831, 28219, 55300, 11814, 7413, 34292, 1295, 5303, 22799, 27494, 37842, 4028, 4785, 2046, 31351, 111, 24092, 22027, 18, 3853, 366, 1...	[ 0.122314453125, 0.2103271484375, 0.08685302734375, 0.155517578125, 0.26806640625, 0.135009765625, 0.1138916015625, 0.04571533203125, 0.1572265625, 0.106689453125, 0.130859375, 0.2286376953125, 0.002960205078125, 0.04937744140625, 0.119873046875, 0.0262908935546875, 0.0615234375, 0....	embed
37701551_c1	37701551	haskell	1	String,String)] zip' xs = zip xs (tail xs) and zip'' :: ([a], [b]) -> [(a, b)] zip'' = \(a,b)->zip a b then ff =zip'' >>= zip' while compiling the code I got an error in the function ff that type do not align. let me re-write the bind signature Monad m => m a -> (a -> m b) -> m b applying ff ["c", "cac", "cb", "bcc", "...	String,String)] zip' xs = zip xs (tail xs) and zip'' :: ([a], [b]) -> [(a, b)] zip'' = \(a,b)->zip a b then ff =zip'' >>= zip' while compiling the code I got an error in the function ff that type do not align. let me re-write the bind signature Monad m => m a -> (a -> m b) -> m b applying ff ["c", "cac", "cb", "bcc", "...	[ 0.0010528564453125, 0.00921630859375, -0.01092529296875, 0.01708984375, 0.00848388671875, 0.00738525390625, -0.00970458984375, -0.024169921875, 0.032470703125, 0.0006561279296875, 0.005645751953125, -0.0147705078125, 0.01239013671875, 0.00982666015625, -0.02880859375, 0.01080322265625,...	[ 23351, 214, 71713, 68330, 25, 1022, 7, 2203, 46741, 136, 4765, 11, 275, 33079, 876, 50836, 26472, 9969, 18151, 18499, 32354, 10644, 54, 959, 143420, 456, 68557, 138256, 60331, 71, 347, 59911, 238, 408, 10060, 402, 217064, 51776, 5303, 306...	[ 0.1676025390625, 0.0963134765625, 0.10491943359375, 0.254638671875, 0.17626953125, 0.11572265625, 0.0888671875, 0.0286407470703125, 0.184814453125, 0.0150146484375, 0.1871337890625, 0.01312255859375, 0.058929443359375, 0.06781005859375, 0.124267578125, 0.193359375, 0.1712646484375, ...	embed
59824578_c0	59824578	haskell	0	Title: Count number of odd digits in Integer Haskell Problem title: Count number of odd digits in Integer Haskell Tags: integer, haskell, int, function Problem: Count number of odd digits in Integer Haskell I'm trying to make program which counts the number of odd digits in integer using Haskell. I have ran into proble...	Count number of odd digits in Integer Haskell Count number of odd digits in Integer Haskell integer haskell int function Count Integer Haskell Count number of odd digits in Integer Haskell I'm trying to make program which counts the number of odd digits in integer using Haskell. I have ran into problem with checking lo...	[ -0.0216064453125, 0.00933837890625, 0.00250244140625, -0.0277099609375, 0.00872802734375, 0.03466796875, -0.01361083984375, 0.00933837890625, 0.0017242431640625, -0.025390625, -0.0032958984375, -0.03662109375, 0.01019287109375, 0.02294921875, 0.0113525390625, -0.0003662109375, 0.0117...	[ 108210, 14012, 111, 70270, 153939, 7, 23, 44401, 20625, 142508, 892, 1505, 1556, 18, 32354, 31577, 1528, 54529, 17368, 13028, 3934, 2967, 175199, 51713, 26255, 33342, 1884, 903, 3095, 4263, 27781, 122216, 132993, 11663, 5608, 30646, 34292, 20...	[ 0.17236328125, 0.1177978515625, 0.04669189453125, 0.2393798828125, 0.205078125, 0.05853271484375, 0.079833984375, 0.2235107421875, 0.1766357421875, 0.2353515625, 0.12646484375, 0.1146240234375, 0.13916015625, 0.0814208984375, 0.1005859375, 0.02423095703125, 0.12939453125, 0.1339111...	embed
39173846_c0	39173846	haskell	0	Title: Haskell MonadError Problem title: Haskell MonadError Tags: error-handling, monads, haskell Problem: Haskell MonadError I was looking at a tutorial on monads in haskell i came across this type class: class (Monad m) => MonadError e m \| m -> e where throwError :: e -> m a catchError :: m a -> (e -> m a) -> m a I w...	Haskell MonadError Haskell MonadError error-handling monads haskell MonadError throwError catchError Haskell Monad Either Left Haskell MonadError I was looking at a tutorial on monads in haskell i came across this type class: I was wondering why the type parameters are e then m, i would have thought it would be m then ...	[ 0.0005950927734375, 0.007080078125, -0.00017070770263671875, -0.000125885009765625, -0.004486083984375, 0.007171630859375, -0.0240478515625, -0.021728515625, -0.004638671875, -0.002960205078125, 0.0030670166015625, -0.0419921875, 0.006805419921875, -0.0223388671875, 0.005523681640625, ...	[ 20625, 142508, 60331, 71, 18468, 31611, 18499, 54885, 2667, 712, 1556, 104250, 105556, 636, 2480, 57143, 36880, 10644, 18507, 149016, 15400, 171859, 621, 28, 7068, 347, 2806, 17569, 110527, 64549, 748, 40101, 21449, 5117, 21635, 101089, 297 ]	[ 0.11279296875, 0.236572265625, 0.186279296875, 0.084228515625, 0.095703125, 0.029754638671875, 0.147216796875, 0.10400390625, 0.1058349609375, 0.1522216796875, 0.116455078125, 0.0880126953125, 0.08538818359375, 0.0188446044921875, 0.1072998046875, 0.05877685546875, 0.00543212890625, ...	embed
50128894_c1	50128894	haskell	1	, 1)] [(b, 1)]) \| ^^^^^^^^ src\View.hs:70:43: error: * Couldn't match type `[(Coord, Integer)]' with `(Double, Double)' Expected type: Point Actual type: [(Coord, Integer)] * In the second argument of `Rectangle', namely `[(b, 1)]' In the expression: (Rectangle [(a, 1)] [(b, 1)]) In an equation for `rectangleRaster': r...	, 1)] [(b, 1)]) \| ^^^^^^^^ src\View.hs:70:43: error: * Couldn't match type `[(Coord, Integer)]' with `(Double, Double)' Expected type: Point Actual type: [(Coord, Integer)] * In the second argument of `Rectangle', namely `[(b, 1)]' In the expression: (Rectangle [(a, 1)] [(b, 1)]) In an equation for `rectangleRaster': r...	[ -0.01104736328125, 0.00836181640625, 0.01544189453125, -0.003021240234375, 0.01275634765625, 0.0191650390625, -0.03759765625, -0.0185546875, 0.004119873046875, 0.006622314453125, -0.002685546875, -0.0179443359375, 0.005645751953125, -0.03466796875, -0.0157470703125, -0.0086669921875, ...	[ 4, 4879, 268, 275, 58745, 16377, 15729, 19437, 100474, 127, 7, 5757, 33210, 18499, 191147, 18, 14858, 10644, 10625, 6651, 44401, 678, 8331, 34, 2661, 107172, 60075, 13, 41097, 100582, 17932, 10750, 1052, 24762, 109217, 125195, 11, 5490, 173...	[ 0.0207061767578125, 0.1141357421875, 0.01544189453125, 0.1011962890625, 0.0205841064453125, 0.0113525390625, 0.0204925537109375, 0.1124267578125, 0.254638671875, 0.08734130859375, 0.00152587890625, 0.09686279296875, 0.125732421875, 0.1728515625, 0.13134765625, 0.084716796875, 0.20092...	embed
20388293_c0	20388293	haskell	0	Title: Haskell generics with unique ids Problem title: Haskell generics with unique ids Tags: haskell, generics, functional-programming, types Problem: Haskell generics with unique ids I've been using Uniplate for a while, but I find the lack ability to identify a node to make things more difficult for me. Is there a g...	Haskell generics with unique ids Haskell generics with unique ids haskell generics functional-programming types Haskell Data Haskell generics with unique ids I've been using Uniplate for a while, but I find the lack ability to identify a node to make things more difficult for me. Is there a generics implementation that...	[ -0.010498046875, 0.005279541015625, 0.01318359375, -0.01544189453125, 0.009033203125, 0.0036773681640625, 0.0038909912109375, -0.013671875, 0.00335693359375, -0.050048828125, -0.00921630859375, -0.02490234375, 0.0012969970703125, 0.006683349609375, -0.025390625, -0.006011962890625, 0...	[ 20625, 142508, 189534, 7, 678, 36998, 3447, 1556, 123309, 28966, 52895, 11809, 17368, 11789, 92558, 12960, 7413, 92635, 81273, 47, 135812, 110, 112, 3249, 1286, 34844, 2685, 208124, 114864, 89931, 27781, 61687, 2806, 41206, 6044 ]	[ 0.1148681640625, 0.2181396484375, 0.265625, 0.100341796875, 0.0704345703125, 0.2161865234375, 0.20458984375, 0.1175537109375, 0.1439208984375, 0.098388671875, 0.124755859375, 0.0892333984375, 0.015869140625, 0.07867431640625, 0.2269287109375, 0.02984619140625, 0.059417724609375, 0....	embed
9856293_c0	9856293	haskell	0	Title: Looking for a generic `bisect` function Problem title: Looking for a generic `bisect` function Tags: haskell Problem: Looking for a generic `bisect` function I am looking for a bisect operation in Haskell similar to Python's bisect_left() and friends. The input would be a lower bound, an upper bound, a non-decre...	Looking for a generic `bisect` function Looking for a generic `bisect` function haskell Looking bisect_left search_term Ord Looking for a generic `bisect` function I am looking for a bisect operation in Haskell similar to Python's bisect_left() and friends. The input would be a lower bound, an upper bound, a non-decrea...	[ -0.026611328125, 0.0106201171875, 0.03271484375, -0.02197265625, -0.0191650390625, 0.0111083984375, 0.01446533203125, -0.029296875, 0.0115966796875, -0.0081787109375, 0.00634765625, -0.000667572021484375, -0.00347900390625, 0.0198974609375, -0.00799560546875, -0.0224609375, 0.0107421...	[ 157268, 100, 189534, 6454, 24762, 32354, 1556, 142508, 2464, 133, 2480, 33938, 32166, 35379, 16487, 41018, 20625, 21373, 145581, 23902, 107730, 2806, 92319, 99091, 1407, 56, 351, 50718, 1283, 143045, 10, 2740, 18, 103607, 11, 8110, 61924, 756...	[ 0.0860595703125, 0.060302734375, 0.23974609375, 0.15234375, 0.25390625, 0.192138671875, 0.125244140625, 0.2396240234375, 0.1378173828125, 0.0611572265625, 0.126220703125, 0.2012939453125, 0.147705078125, 0.1776123046875, 0.059234619140625, 0.1602783203125, 0.1248779296875, 0.028411...	embed
33049458_c0	33049458	haskell	0	Title: Why is `[1, "a"] :: [forall a. Show a => a]` not allowed? Problem title: Why is `[1, "a"] :: [forall a. Show a => a]` not allowed? Tags: existential-type, haskell, higher-rank-types, polymorphism, typeclass Problem: Why is `[1, "a"] :: [forall a. Show a => a]` not allowed? In my (might ...	Why is `[1, "a"] :: [forall a. Show a => a]` not allowed? Why is `[1, "a"] :: [forall a. Show a => a]` not allowed? existential-type haskell higher-rank-types polymorphism typeclass Why Show ExistentialQuantification Why is `[1, "a"] :: [forall a. Show a => a]` not allowed? In my (might incorr...	[ -0.00439453125, 0.003997802734375, -0.00933837890625, 0.0030975341796875, -0.00848388671875, -0.00860595703125, 0.01123046875, -0.003021240234375, 0.01708984375, -0.014892578125, 0.0054931640625, -0.026123046875, 0.01220703125, 0.008056640625, -0.0196533203125, -0.023681640625, 0.008...	[ 44084, 83, 9473, 418, 41502, 11, 1230, 1984, 5584, 10, 17367, 2203, 5386, 959, 107003, 2472, 99707, 15403, 50986, 1556, 142508, 36467, 35874, 178851, 10644, 67413, 122688, 118, 289, 173495, 18, 41274, 1065, 4, 44357, 6626, 5303, 183234, 681...	[ 0.1312255859375, 0.020660400390625, 0.0369873046875, 0.099609375, 0.040802001953125, 0.1392822265625, 0.04437255859375, 0.10546875, 0.12548828125, 0.1317138671875, 0.2003173828125, 0.010833740234375, 0.0723876953125, 0.09912109375, 0.173095703125, 0.04931640625, 0.14404296875, 0.02...	embed
60908984_c0	60908984	haskell	0	Title: GHCI swears on "=" symbol Problem title: GHCI swears on "=" symbol Tags: haskell Problem: GHCI swears on "=" symbol The purpose was to sort the list of tuples (names) by tuple's 2nd element. module Learn where import Data.List names = [("Ian", "Curtis"),("Bernard","Sumner"),("Peter","Hook"),(...	GHCI swears on "=" symbol GHCI swears on "=" symbol haskell Data.List GHCI Learn Ian Curtis Bernard Sumner Peter Hook Stephen Morris name1 name2 lastName1 lastName2 GHCI swears on "=" symbol The purpose was to sort the list of tuples (names) by tuple's 2nd element. then I would call GHCI doesnt want...	[ 0.00811767578125, 0.0067138671875, 0.00225830078125, -0.02197265625, -0.0064697265625, 0.0069580078125, 0.0020599365234375, 0.01385498046875, 0.0059814453125, 0.00494384765625, 0.0208740234375, -0.00616455078125, 0.01611328125, -0.00171661376953125, 0.001312255859375, -0.00248718261718...	[ 41877, 17304, 52113, 21816, 98, 74, 1369, 1230, 26582, 1556, 142508, 11809, 5, 154663, 134031, 104870, 17065, 1814, 56159, 36335, 1679, 7948, 2291, 685, 56174, 119537, 9351, 304, 4568, 163612, 44, 22422, 60042, 509, 12096, 5303, 111, 370, 9...	[ 0.184814453125, 0.2474365234375, 0.2099609375, 0.1077880859375, 0.1807861328125, 0.0203857421875, 0.1282958984375, 0.0185699462890625, 0.26611328125, 0.131591796875, 0.22216796875, 0.1171875, 0.005950927734375, 0.147705078125, 0.100341796875, 0.08447265625, 0.007598876953125, 0.120...	embed
64322905_c0	64322905	haskell	0	Title: Arguments not needed when using foldl in haskell? Problem title: Arguments not needed when using foldl in haskell? Tags: foldleft, arguments, haskell Problem: Arguments not needed when using foldl in haskell? What I don't get is how it is possible to use foldl in this way in haskell. I do not understand how the ...	Arguments not needed when using foldl in haskell? Arguments not needed when using foldl in haskell? foldleft arguments haskell foldl Arguments Arguments not needed when using foldl in haskell? What I don't get is how it is possible to use foldl in this way in haskell. I do not understand how the argument ( in this case...	[ 0.0028228759765625, 0.006103515625, 0.0164794921875, 0.01080322265625, -0.0074462890625, 0.01165771484375, -0.0029754638671875, -0.00836181640625, -0.000339508056640625, -0.0203857421875, 0.01080322265625, -0.045654296875, -0.00469970703125, 0.0233154296875, 0.00640869140625, -0.030273...	[ 112140, 7, 959, 44841, 17368, 18344, 20469, 23, 1556, 142508, 19298, 2480, 10750, 2301, 18, 2046, 7722, 4527, 903, 3917, 28219, 5303, 175100, 645, 165164, 27781, 151575, 1884 ]	[ 0.2371826171875, 0.027801513671875, 0.0777587890625, 0.1358642578125, 0.0631103515625, 0.1417236328125, 0.210205078125, 0.0239715576171875, 0.10498046875, 0.196044921875, 0.041595458984375, 0.1268310546875, 0.2171630859375, 0.001861572265625, 0.0128173828125, 0.031158447265625, 0.063...	embed
11296157_c0	11296157	haskell	0	Title: How has Haskell changed? Problem title: How has Haskell changed? Tags: haskell Problem: How has Haskell changed? When I first learned Haskell, Haskell '98 was the official published language specification. Today, that specification is Haskell 2010. (I have to admit, I have a really hard time remembering what the...	How has Haskell changed? How has Haskell changed? haskell How Haskell How has Haskell changed? When I first learned Haskell, Haskell '98 was the official published language specification. Today, that specification is Haskell 2010. (I have to admit, I have a really hard time remembering what the heck the differences act...	[ 0.01239013671875, 0.0086669921875, 0.018798828125, 0.02294921875, 0.00927734375, 0.0086669921875, -0.0172119140625, -0.0142822265625, 0.009765625, 0.032958984375, -0.009033203125, -0.0208740234375, -0.01446533203125, 0.013671875, 0.00579833984375, 0.007568359375, -0.006988525390625, ...	[ 11249, 1556, 20625, 142508, 98816, 32, 14847, 5117, 97384, 16665, 509, 51521, 91376, 46876, 29458, 2320, 38396, 15431, 36456, 6183, 7941, 1733, 37629, 764, 2594, 60212, 20653, 14240, 2809, 10932, 4989, 242122, 149016, 31901, 13036, 4331, 65572,...	[ 0.1529541015625, 0.201416015625, 0.1962890625, 0.29443359375, 0.2403564453125, 0.014739990234375, 0.00396728515625, 0.1112060546875, 0.1549072265625, 0.2310791015625, 0.01739501953125, 0.1580810546875, 0.1142578125, 0.1959228515625, 0.1798095703125, 0.07421875, 0.09912109375, 0.186...	embed
27387853_c0	27387853	haskell	0	Title: How can I produce a fixed length of numbers that sum up a given number in Haskell Problem title: How can I produce a fixed length of numbers that sum up a given number in Haskell Tags: haskell Problem: How can I produce a fixed length of numbers that sum up a given number in Haskell I'm new to haskell world and ...	How can I produce a fixed length of numbers that sum up a given number in Haskell How can I produce a fixed length of numbers that sum up a given number in Haskell haskell How Haskell How can I produce a fixed length of numbers that sum up a given number in Haskell I'm new to haskell world and wanted to know, given any...	[ -0.0228271484375, 0.0230712890625, -0.00335693359375, 0.0242919921875, -0.01519775390625, 0.016845703125, -0.01806640625, 0.00982666015625, 0.01611328125, -0.019775390625, -0.021728515625, -0.032470703125, 0.0125732421875, 0.0218505859375, -0.01080322265625, -0.002044677734375, 0.003...	[ 11249, 831, 27489, 188347, 140909, 101935, 450, 10554, 1257, 34475, 14012, 23, 20625, 142508, 87, 111, 1556, 10, 3525, 8999, 3714, 2499, 24491, 892, 153939, 17721, 106, 15205, 3642, 7413, 162515, 3934, 1505, 17368, 62952, 201, 6626, 33636, ...	[ 0.0906982421875, 0.0992431640625, 0.2259521484375, 0.263427734375, 0.20166015625, 0.2069091796875, 0.0546875, 0.223388671875, 0.1519775390625, 0.0980224609375, 0.1427001953125, 0.059906005859375, 0.153564453125, 0.2509765625, 0.05218505859375, 0.0416259765625, 0.1324462890625, 0.00...	embed
43010618_c0	43010618	haskell	0	Title: IO error when executing runhaskell Problem title: IO error when executing runhaskell Tags: haskell Problem: IO error when executing runhaskell I'm trying to execute a main method within one of my classes in haskell. When I run the command runhaskell mod12PA.hs I get an error and I can't figure out why. Here's th...	IO error when executing runhaskell IO error when executing runhaskell haskell stdin mod12PA.hs SVG Enter Points Variable mod12PA IO error when executing runhaskell I'm trying to execute a main method within one of my classes in haskell. When I run the command runhaskell mod12PA.hs I get an error and I can't figure out ...	[ -0.0087890625, 0.00872802734375, -0.003021240234375, 0.01190185546875, 0.006744384765625, 0.03076171875, -0.002288818359375, -0.017822265625, -0.0130615234375, -0.025390625, 0.00927734375, -0.034912109375, 0.0166015625, -0.0224609375, 0.0022430419921875, -0.0074462890625, 0.000329971...	[ 17780, 18499, 3229, 71924, 214, 11675, 10557, 142508, 1556, 6138, 3035, 2811, 1530, 12236, 127, 79855, 60816, 41097, 84572, 31577, 5201, 55300, 28032, 61112, 14847, 75101, 831, 26366, 15400, 11853, 18151 ]	[ 0.25390625, 0.20947265625, 0.068359375, 0.187255859375, 0.03533935546875, 0.146728515625, 0.156494140625, 0.26904296875, 0.1466064453125, 0.08770751953125, 0.1400146484375, 0.1961669921875, 0.1578369140625, 0.2159423828125, 0.1336669921875, 0.199951171875, 0.1158447265625, 0.164062...	embed
44964917_c0	44964917	haskell	0	Title: How to communicate among two callbacks? Problem title: How to communicate among two callbacks? Tags: haskell Problem: How to communicate among two callbacks? AS an introduction to the language, I am writing a simple sound recorder, using sdl2 and wave SDL is successfully calling my audio callback. Trouble is, I ...	How to communicate among two callbacks? How to communicate among two callbacks? haskell How AudioFormat IOVector Handle How to communicate among two callbacks? AS an introduction to the language, I am writing a simple sound recorder, using sdl2 and wave SDL is successfully calling my audio callback. Trouble is, I have ...	[ -0.006072998046875, 0.0033416748046875, -0.0257568359375, 0.025146484375, -0.007781982421875, 0.0140380859375, -0.0118408203125, -0.007598876953125, 0.0002727508544921875, -0.02392578125, 0.00823974609375, -0.0341796875, 0.01007080078125, 0.0196533203125, -0.01165771484375, -0.01843261...	[ 11249, 47, 127219, 67, 54940, 6626, 11782, 12620, 7, 1556, 142508, 32134, 102973, 257, 87, 31719, 13, 18770, 10639, 133, 39864, 46876, 32562, 8781, 45730, 17164, 56, 17368, 91, 20469, 304, 259, 272, 159, 27502, 65771, 159029, 18215, 119671,...	[ 0.1181640625, 0.0791015625, 0.2161865234375, 0.10009765625, 0.211181640625, 0.2000732421875, 0.2010498046875, 0.263671875, 0.0249786376953125, 0.1397705078125, 0.2103271484375, 0.1519775390625, 0.18017578125, 0.04052734375, 0.1207275390625, 0.11083984375, 0.1419677734375, 0.1625976...	embed
10645137_c0	10645137	haskell	0	Title: Haskell: Num instance of non-concrete type Problem title: Haskell: Num instance of non-concrete type Tags: typeclass, instance, types, haskell Problem: Haskell: Num instance of non-concrete type data Vector a = Vector a a a deriving (Eq, Show) instance Functor Vector where fmap f (Vector x y z) = Vector (f x) (f...	Haskell: Num instance of non-concrete type Haskell: Num instance of non-concrete type typeclass instance types haskell Haskell Num Vector Show Functor Integer Float Double Haskell: Num instance of non-concrete type So far so good. Doesn't work. I tried many different variations on that first line but GHC keeps complain...	[ -0.0050048828125, 0.00823974609375, 0.01092529296875, 0.003631591796875, -0.000286102294921875, 0.0218505859375, -0.00689697265625, -0.01177978515625, 0.004150390625, -0.00823974609375, -0.0390625, -0.03857421875, 0.007293701171875, 0.00799560546875, -0.0306396484375, 0.00299072265625,...	[ 20625, 142508, 52782, 110527, 351, 2271, 7612, 10644, 12, 111, 67, 67413, 52895, 1556, 2609, 18770, 17367, 28670, 44401, 38699, 257, 107172, 2060, 4127, 101790, 18, 4488, 37842, 5941, 12921, 143834, 5117, 13315, 527, 73265, 13695, 186992, 344...	[ 0.15185546875, 0.26318359375, 0.295166015625, 0.2841796875, 0.2015380859375, 0.053863525390625, 0.179931640625, 0.184814453125, 0.0203094482421875, 0.048919677734375, 0.0604248046875, 0.1204833984375, 0.14404296875, 0.136474609375, 0.2171630859375, 0.235595703125, 0.1280517578125, ...	embed
34652000_c0	34652000	haskell	0	Title: How to clean leftover files from a cabal build? Problem title: How to clean leftover files from a cabal build? Tags: cabal, haskell Problem: How to clean leftover files from a cabal build? I'm a complete noob at developer stuff. I've recently had to install Gitit https://github.com/jgm/gitit using cabal as they ...	How to clean leftover files from a cabal build? How to clean leftover files from a cabal build? cabal haskell a How github.com Directory DIR x86_64-windows-ghc-7.10.3 x86_64-windows-ghc-7.10.3-packages.conf.d File How to clean leftover files from a cabal build? I'm a complete noob at developer stuff. I've recently had ...	[ 0.00408935546875, 0.01531982421875, 0.0084228515625, 0.01806640625, -0.01519775390625, 0.007049560546875, 0.00762939453125, -0.0093994140625, 0.015869140625, 0.0341796875, -0.017333984375, -0.02392578125, 0.0064697265625, 0.0162353515625, -0.0224609375, -0.0035552978515625, -0.003280...	[ 11249, 47, 46622, 25737, 5465, 102158, 1295, 109524, 45367, 10, 1556, 142508, 62270, 32102, 277, 31068, 53, 123237, 15276, 13307, 229792, 9486, 238, 16709, 10179, 363, 27495, 29102, 70547, 5, 71, 42724, 28484, 110, 3522, 106001, 20600, 5174, ...	[ 0.08331298828125, 0.06268310546875, 0.2490234375, 0.1861572265625, 0.22314453125, 0.2069091796875, 0.1251220703125, 0.274658203125, 0.2025146484375, 0.0270843505859375, 0.10791015625, 0.197509765625, 0.1473388671875, 0.2159423828125, 0.04595947265625, 0.1131591796875, 0.0323181152343...	embed
15102689_c0	15102689	haskell	0	Title: Finding out lambda calculus/haskell type of some example Problem title: Finding out lambda calculus/haskell type of some example Tags: lambda-calculus, haskell, lambda Problem: Finding out lambda calculus/haskell type of some example Suppose that the function gets as its input two variables of different types (e...	Finding out lambda calculus/haskell type of some example Finding out lambda calculus/haskell type of some example lambda-calculus haskell lambda Finding Char Finding out lambda calculus/haskell type of some example Suppose that the function gets as its input two variables of different types (e.g. one variable is int in...	[ 0.017822265625, -0.00099945068359375, 0.0062255859375, 0.0198974609375, -0.00087738037109375, 0.0162353515625, 0.01324462890625, -0.0023193359375, -0.0162353515625, -0.00054931640625, 0.0113525390625, -0.041259765625, -0.00007152557373046875, 0.00579833984375, -0.0086669921875, 0.00177...	[ 26040, 1810, 21, 6492, 85, 44805, 223, 64, 10557, 142508, 10644, 27781, 3060, 6827, 94739, 1556, 21656, 32354, 62163, 107730, 6626, 77336, 12921, 52895, 23, 18, 46876, 313, 21441, 30646, 1632, 360, 18151, 20625, 139124, 84068, 33079, 2806, ...	[ 0.06329345703125, 0.04925537109375, 0.059112548828125, 0.1810302734375, 0.1143798828125, 0.2125244140625, 0.1302490234375, 0.03704833984375, 0.1226806640625, 0.25634765625, 0.2174072265625, 0.201904296875, 0.0010986328125, 0.117919921875, 0.1456298828125, 0.118408203125, 0.1566162109...	embed
16810446_c0	16810446	haskell	0	Title: Is there a Fibonacci heap based priority queue for Haskell? Problem title: Is there a Fibonacci heap based priority queue for Haskell? Tags: fibonacci-heap, haskell, priority-queue Problem: Is there a Fibonacci heap based priority queue for Haskell? Is there a Fibonacci heap/priority queue available for Haskell?...	Is there a Fibonacci heap based priority queue for Haskell? Is there a Fibonacci heap based priority queue for Haskell? fibonacci-heap haskell priority-queue Fibonacci Haskell Is there a Fibonacci heap based priority queue for Haskell? Is there a Fibonacci heap/priority queue available for Haskell? (Or even an asymptot...	[ 0.01470947265625, 0.00162506103515625, 0.00148773193359375, -0.01092529296875, -0.0023040771484375, 0.005706787109375, -0.004058837890625, -0.033203125, -0.00439453125, -0.01171875, 0.007171630859375, -0.00970458984375, 0.022705078125, 0.003265380859375, 0.00775146484375, 0.00069808959...	[ 2071, 2685, 10, 3698, 20990, 52544, 764, 2631, 35509, 25343, 53, 41, 13388, 100, 20625, 142508, 809, 1106, 1556, 944, 207184, 939, 19882, 2676, 21737, 11522, 208124, 40407, 201141, 51042, 1733, 17305, 6423, 26040, 9222, 24105, 180, 27750, 1...	[ 0.03125, 0.088134765625, 0.05279541015625, 0.125244140625, 0.182373046875, 0.1910400390625, 0.1646728515625, 0.178955078125, 0.15283203125, 0.2083740234375, 0.095703125, 0.16455078125, 0.1629638671875, 0.040283203125, 0.1495361328125, 0.2685546875, 0.064208984375, 0.13818359375, ...	embed
52218662_c0	52218662	haskell	0	Title: Parse Json Rose Tree with Haskell Aeson Problem title: Parse Json Rose Tree with Haskell Aeson Tags: haskell, json, aeson Problem: Parse Json Rose Tree with Haskell Aeson I'm trying to parse recursive JSON data, something like this: { "node": "a", "children": [ { "node": "b", "children": [ { "node": "c", "childr...	Parse Json Rose Tree with Haskell Aeson Parse Json Rose Tree with Haskell Aeson haskell json aeson Parse Json Rose Tree Haskell Aeson Node Text Nothing Parse Json Rose Tree with Haskell Aeson I'm trying to parse recursive JSON data, something like this: Now I want to implement an instance of FromJSON, so that I can dec...	[ 0.00156402587890625, 0.003173828125, -0.0201416015625, 0.0228271484375, -0.021728515625, 0.0162353515625, 0.00738525390625, -0.0037078857421875, -0.0064697265625, -0.0196533203125, -0.0189208984375, 0.0103759765625, 0.0010223388671875, 0.00799560546875, 0.0107421875, -0.0103759765625, ...	[ 2392, 184, 821, 1681, 24009, 101344, 678, 20625, 142508, 62, 90, 191, 1556, 1647, 10, 438, 112, 24129, 182747, 31577, 366, 195625, 5844, 58627, 2053, 1884, 903, 3444, 29479, 110527, 28090, 1375, 8, 40899, 3934, 45646, 25632, 110, 29786, 2...	[ 0.1375732421875, 0.05535888671875, 0.1346435546875, 0.1859130859375, 0.18603515625, 0.2332763671875, 0.087646484375, 0.1083984375, 0.181640625, 0.099853515625, 0.1109619140625, 0.1552734375, 0.09466552734375, 0.052154541015625, 0.02777099609375, 0.069091796875, 0.06451416015625, 0....	embed
46920723_c0	46920723	haskell	0	Title: Keeping a value during a recursive function Problem title: Keeping a value during a recursive function Tags: recursion, haskell Problem: Keeping a value during a recursive function In Haskell, I'm trying to solve a problem where I need to have a function that receives a list of integers and returns the biggest p...	Keeping a value during a recursive function Keeping a value during a recursive function recursion haskell Keeping x1:x2:xs Keeping a value during a recursive function In Haskell, I'm trying to solve a problem where I need to have a function that receives a list of integers and returns the biggest product of two adjacen...	[ -0.0181884765625, 0.0159912109375, -0.0096435546875, 0.00665283203125, -0.0084228515625, 0.0048828125, -0.0027618408203125, 0.000865936279296875, 0.021484375, -0.0247802734375, 0.026611328125, 0.0208740234375, 0.000522613525390625, 0.00732421875, 0.0162353515625, 0.006500244140625, 0...	[ 83041, 214, 34292, 20271, 195625, 5844, 32354, 1830, 1556, 142508, 1022, 82825, 425, 304, 12, 7, 20625, 31577, 86869, 2967, 3871, 53299, 5303, 892, 26255, 30646, 129058, 12996, 6626, 123594, 16797, 101935, 89536, 1238, 104629, 125157, 2806, 4...	[ 0.2244873046875, 0.0089111328125, 0.22021484375, 0.1689453125, 0.23046875, 0.15673828125, 0.2000732421875, 0.1158447265625, 0.1317138671875, 0.2335205078125, 0.091064453125, 0.106689453125, 0.1226806640625, 0.1300048828125, 0.0170135498046875, 0.03546142578125, 0.12548828125, 0.038...	embed
66641316_c0	66641316	haskell	0	Title: Data type parametrized by constant in Haskell Problem title: Data type parametrized by constant in Haskell Tags: data-kinds, dependent-type, haskell, parameterized-types, types Problem: Data type parametrized by constant in Haskell I would like to define a data type in Haskell which is parametrized by an Int con...	Data type parametrized by constant in Haskell Data type parametrized by constant in Haskell data-kinds dependent-type haskell parameterized-types types Data Haskell Data type parametrized by constant in Haskell I would like to define a data type in Haskell which is parametrized by an Int constant along the lines: data ...	[ 0.00244140625, 0.0135498046875, 0.0101318359375, -0.01483154296875, 0.018310546875, -0.005279541015625, -0.01495361328125, -0.0062255859375, -0.00823974609375, -0.0296630859375, -0.002777099609375, -0.046142578125, 0.00604248046875, 0.010498046875, -0.020263671875, 0.006866455078125, ...	[ 11809, 10644, 39850, 29367, 390, 53697, 20625, 142508, 23, 2053, 68347, 108750, 50986, 1556, 171859, 52895, 1884, 61924, 83, 360, 18, 33233, 124519, 2396, 19, 1984, 2203, 653, 4153, 4210, 351, 174796, 18151, 32354, 6528, 173072, 66044, 765, ...	[ 0.1490478515625, 0.24755859375, 0.222900390625, 0.07763671875, 0.0650634765625, 0.22216796875, 0.14794921875, 0.234619140625, 0.03167724609375, 0.182373046875, 0.1007080078125, 0.1536865234375, 0.22265625, 0.126708984375, 0.1842041015625, 0.16259765625, 0.031951904296875, 0.1621093...	embed
57782279_c1	57782279	haskell	1	looks good: $ stack ide targets RestaurantReservation:lib RestaurantReservation:exe:RestaurantReservation RestaurantReservation:test:RestaurantReservation-test This used to work on Windows 10 before I repaved the machine, but now it doesn't. Since it worked before re-installation, I'm hoping that there's some environm...	looks good: $ stack ide targets RestaurantReservation:lib RestaurantReservation:exe:RestaurantReservation RestaurantReservation:test:RestaurantReservation-test This used to work on Windows 10 before I repaved the machine, but now it doesn't. Since it worked before re-installation, I'm hoping that there's some environm...	[ -0.006591796875, 0.00396728515625, 0.00860595703125, 0.0169677734375, 0.00384521484375, 0.0206298828125, -0.0269775390625, -0.024169921875, 0.00104522705078125, 0.031494140625, 0.000385284423828125, -0.00927734375, -0.0108642578125, 0.0113525390625, 0.00167083740234375, -0.017211914062...	[ 33342, 4127, 3650, 177261, 5415, 30388, 7, 28660, 65756, 5612, 1363, 46480, 590, 14952, 6954, 11814, 4488, 3773, 209, 8108, 10958, 11, 36279, 5036, 22027, 18, 79786, 456, 105348, 156377, 65998, 53550, 77488, 123309, 4420, 34735, 3249, 144483,...	[ 0.1448974609375, 0.1182861328125, 0.162841796875, 0.204345703125, 0.2005615234375, 0.29833984375, 0.1068115234375, 0.1767578125, 0.1507568359375, 0.1378173828125, 0.004180908203125, 0.086669921875, 0.029144287109375, 0.057098388671875, 0.15185546875, 0.0513916015625, 0.1103515625, ...	embed
43577758_c0	43577758	haskell	0	Title: Trying to convert a list of data records to a hashmap Problem title: Trying to convert a list of data records to a hashmap Tags: haskell Problem: Trying to convert a list of data records to a hashmap Here is the code: import Data.HashMap.Lazy as H data Connections = Connections { connectionName :: String , cfgPr...	Trying to convert a list of data records to a hashmap Trying to convert a list of data records to a hashmap haskell Data.HashMap.Lazy Trying Connections Object Show Generic HashMap H.fromList Trying to convert a list of data records to a hashmap Here is the code: OK, I know that "loadConn" is probably not even close. I...	[ -0.01336669921875, -0.01470947265625, -0.0054931640625, 0.008544921875, -0.0052490234375, 0.00250244140625, -0.01141357421875, 0.003509521484375, 0.0054931640625, -0.032470703125, -0.01104736328125, -0.0233154296875, 0.0233154296875, 0.0128173828125, -0.0230712890625, -0.01336669921875...	[ 40858, 96760, 5303, 2053, 115923, 47, 256, 80425, 254, 10, 111, 1556, 142508, 11809, 6495, 1495, 166179, 2729, 3285, 62448, 134549, 17367, 88342, 162087, 572, 161063, 154663, 18151, 63033, 11935, 19, 31895, 959, 3853, 20903, 117507, 12921, 25...	[ 0.07879638671875, 0.124755859375, 0.1258544921875, 0.1158447265625, 0.1771240234375, 0.056671142578125, 0.1531982421875, 0.1632080078125, 0.1883544921875, 0.01812744140625, 0.04736328125, 0.1414794921875, 0.207763671875, 0.0543212890625, 0.136962890625, 0.0162353515625, 0.15319824218...	embed
67495088_c0	67495088	haskell	0	Title: Haskell function that substitutes a DNA base Problem title: Haskell function that substitutes a DNA base Tags: haskell, bioinformatics Problem: Haskell function that substitutes a DNA base I am trying to create a function in Haskell that substitutes a DNA base with another base. This is what my function is. When...	Haskell function that substitutes a DNA base Haskell function that substitutes a DNA base haskell bioinformatics Haskell DNA AGCT c:cs p12tests ACT AAT ACA GCT AGT ACG CCT ACC TCT ATT Haskell function that substitutes a DNA base I am trying to create a function in Haskell that substitutes a DNA base with another base. ...	[ -0.0191650390625, 0.0098876953125, 0.0228271484375, 0.0106201171875, 0.024169921875, -0.0025634765625, -0.01434326171875, 0.0028228759765625, 0.010009765625, 0.01251220703125, 0.00201416015625, 0.00714111328125, -0.0050048828125, 0.015869140625, -0.0186767578125, 0.0194091796875, 0.0...	[ 20625, 142508, 32354, 450, 161740, 90, 27583, 3647, 1556, 3530, 77033, 24639, 43379, 501, 12, 4439, 915, 1530, 6954, 84161, 127673, 6, 85955, 37315, 56367, 13709, 13739, 31577, 28282, 678, 15700, 2367, 759, 14847, 11675, 3034, 4, 2046, 2222...	[ 0.1710205078125, 0.26708984375, 0.2232666015625, 0.048583984375, 0.2003173828125, 0.048309326171875, 0.2008056640625, 0.1968994140625, 0.147705078125, 0.038299560546875, 0.08795166015625, 0.05328369140625, 0.1485595703125, 0.0225067138671875, 0.0531005859375, 0.057342529296875, 0.013...	embed
69656808_c0	69656808	haskell	0	Title: Pattern matching haskell Problem title: Pattern matching haskell Tags: haskell, pattern-matching Problem: Pattern matching haskell I would be really glad, if someone could get me a hint how pattern matching should work in haskell. I have already spent hours with watching different tutorials but i don't get it. I...	Pattern matching haskell Pattern matching haskell haskell pattern-matching Pattern Assignment EmptyA Assign Integer Show Pattern matching haskell I would be really glad, if someone could get me a hint how pattern matching should work in haskell. I have already spent hours with watching different tutorials but i don't g...	[ -0.0198974609375, 0.006072998046875, 0.01275634765625, 0.0247802734375, 0.000774383544921875, 0.00191497802734375, -0.0118408203125, -0.000392913818359375, 0.021240234375, 0.00762939453125, 0.0224609375, -0.0196533203125, -0.0142822265625, 0.00555419921875, -0.00127410888671875, -0.009...	[ 9876, 22766, 14858, 214, 1556, 142508, 103510, 98753, 1301, 31304, 31678, 939, 284, 44401, 17367, 2806, 6183, 9525, 5809, 5122, 3642, 5608, 4488, 23, 21974, 100244, 57143, 2301, 18, 2046, 2053, 10644, 674, 25632, 110527, 3444, 33022, 32354, ...	[ 0.1795654296875, 0.1597900390625, 0.234130859375, 0.117431640625, 0.15625, 0.207763671875, 0.2310791015625, 0.215087890625, 0.04876708984375, 0.185546875, 0.1021728515625, 0.10302734375, 0.10888671875, 0.11474609375, 0.06695556640625, 0.01287841796875, 0.00775146484375, 0.034393310...	embed
3116165_c0	3116165	haskell	0	Title: Function Composition VS Function Application Problem title: Function Composition VS Function Application Tags: function-composition, function, haskell Problem: Function Composition VS Function Application Do anyone can give example of function composition? This is the definition of function composition operator?...	Function Composition VS Function Application Function Composition VS Function Application function-composition function haskell Composition Application Function Composition VS Function Application Do anyone can give example of function composition? This is the definition of function composition operator? This shows tha...	[ 0, 0.004180908203125, 0.01953125, 0.0301513671875, -0.00128936767578125, 0.0201416015625, 0.0011749267578125, 0.013671875, 0.0125732421875, -0.00098419189453125, 0.00531005859375, -0.00982666015625, 0.0068359375, 0.0263671875, -0.004425048828125, -0.01263427734375, 0.02978515625, 0...	[ 28670, 10763, 3288, 40322, 44160, 104921, 32354, 277, 1556, 142508, 35672, 831, 8337, 27781, 166577, 3293, 83, 80934, 39933, 45831, 51776, 6626, 30646, 37629, 36510, 62775, 175457, 25299, 14135, 33079, 923, 62548, 91084, 37515, 128239, 38415, 1...	[ 0.1712646484375, 0.1439208984375, 0.1971435546875, 0.224853515625, 0.2027587890625, 0.244384765625, 0.237548828125, 0.1640625, 0.116943359375, 0.2220458984375, 0.02593994140625, 0.010955810546875, 0.003326416015625, 0.1483154296875, 0.287353515625, 0.0018310546875, 0.1123046875, 0....	embed
13877220_c0	13877220	haskell	0	Title: Flexible attribute handling with xml-conduit Problem title: Flexible attribute handling with xml-conduit Tags: yesod, haskell Problem: Flexible attribute handling with xml-conduit I would like to use xml-conduit for parsing some very large XML files since it seems to be the only XML library for Haskell that can ...	Flexible attribute handling with xml-conduit Flexible attribute handling with xml-conduit yesod haskell Flexible AttrParser Flexible attribute handling with xml-conduit I would like to use xml-conduit for parsing some very large XML files since it seems to be the only XML library for Haskell that can use Text . Unfortu...	[ -0.00072479248046875, 0.005096435546875, -0.0206298828125, -0.01531982421875, -0.007354736328125, 0.010009765625, -0.00099945068359375, 0.0098876953125, 0.006805419921875, 0.0054931640625, -0.00274658203125, -0.0211181640625, -0.00067901611328125, 0.0191650390625, -0.01129150390625, 0....	[ 180842, 2661, 150380, 13, 45064, 678, 131492, 9, 2271, 112061, 2422, 23722, 1556, 142508, 9208, 42, 28636, 2189, 1884, 4527, 100, 366, 6953, 4552, 21334, 92537, 102158, 4734, 35773, 20625, 831, 24129, 185397, 11435, 5915, 77630, 2101, 3871, ...	[ 0.2147216796875, 0.1280517578125, 0.21435546875, 0.024322509765625, 0.1505126953125, 0.0509033203125, 0.238037109375, 0.0416259765625, 0.1123046875, 0.225830078125, 0.1142578125, 0.155517578125, 0.0830078125, 0.2166748046875, 0.110595703125, 0.12255859375, 0.17431640625, 0.15551757...	embed
73786958_c0	73786958	haskell	0	Title: Input ',' cannot test two lists Problem title: Input ',' cannot test two lists Tags: haskell Problem: Input ',' cannot test two lists inter :: [Integer] -> [Integer] -> [Integer] inter s1 s2 = [s \| s <- s2, s `elem` s1] inter [5, 6, 3, 1], [5, 2, 1, 3] main = return() I am not sure of how to ...	Input ',' cannot test two lists Input ',' cannot test two lists haskell /home/runner/University-Labs/.ghci Prelude Input Integer GHCi www.haskell.org Loaded University-Labs Compiling Main Main.hs Main.hs:4:19 Failed Variable Perhaps Leaving Input ',' cannot test two lists I am not sure of how to tes...	[ -0.003662109375, 0.003021240234375, 0.00121307373046875, 0.005340576171875, -0.0009765625, 0.023681640625, -0.004302978515625, -0.006439208984375, -0.01239013671875, -0.00909423828125, 0.00439453125, -0.01068115234375, 0.0031585693359375, 0.00640869140625, -0.0166015625, -0.01391601562...	[ 360, 7077, 3768, 4, 54764, 53418, 3034, 6626, 5303, 1556, 142508, 29552, 142117, 65305, 2481, 97381, 9486, 318, 1914, 822, 44401, 527, 73265, 14, 5, 10557, 1478, 2091, 712, 12535, 15612, 12321, 127, 617, 23988, 190355, 84572, 2886, 181799, ...	[ 0.143798828125, 0.169189453125, 0.1287841796875, 0.08099365234375, 0.023284912109375, 0.2086181640625, 0.227294921875, 0.2098388671875, 0.218994140625, 0.1348876953125, 0.238037109375, 0.0423583984375, 0.18994140625, 0.040863037109375, 0.03900146484375, 0.17724609375, 0.10595703125, ...	embed
43282641_c0	43282641	haskell	0	Title: How to make a nullary data constructor in Haskell return True for null Problem title: How to make a nullary data constructor in Haskell return True for null Tags: haskell, null Problem: How to make a nullary data constructor in Haskell return True for null I have an algebraic data type, say data Tree a = Node a ...	How to make a nullary data constructor in Haskell return True for null How to make a nullary data constructor in Haskell return True for null haskell null a How Haskell Tree Node Empty Foldable Nothing How to make a nullary data constructor in Haskell return True for null I have an algebraic data type, say data Tree a ...	[ 0.017578125, -0.005767822265625, 0.0218505859375, 0.0152587890625, 0.00494384765625, 0.0220947265625, 0.00689697265625, -0.0322265625, -0.00823974609375, -0.0198974609375, -0.0181884765625, -0.0264892578125, 0.0014495849609375, 0.025390625, 0.0096435546875, -0.023193359375, 0.0158691...	[ 11249, 3249, 9229, 1294, 2053, 64549, 748, 20625, 142508, 30646, 87599, 100, 56574, 1556, 101344, 438, 112, 31678, 939, 30077, 71, 2886, 182747, 23, 429, 2844, 10644, 10, 62731, 3444, 110, 22225, 120262, 5036, 25632, 18499 ]	[ 0.002716064453125, 0.06658935546875, 0.1798095703125, 0.1717529296875, 0.1390380859375, 0.1505126953125, 0.1312255859375, 0.1328125, 0.2200927734375, 0.1622314453125, 0.181640625, 0.12255859375, 0.251708984375, 0.1124267578125, 0.14697265625, 0.101806640625, 0.0811767578125, 0.1462...	embed
47094491_c0	47094491	haskell	0	Title: `Variable not in scope` in simple a function Problem title: `Variable not in scope` in simple a function Tags: haskell Problem: `Variable not in scope` in simple a function Consider the next piece of code - pvp::Board->Int-> IO () pvp board player = do player1choice <- prompt $ ("Player " ++ (show (player + 1)) ...	`Variable not in scope` in simple a function `Variable not in scope` in simple a function haskell Variable pvp::Board player1choice Player Nothing Invalid Just Valid Maybe `Variable not in scope` in simple a function Consider the next piece of code - For case newboard of , i get error: Variable not in scope: newboard :...	[ -0.019287109375, -0.010009765625, -0.00130462646484375, 0.0224609375, 0.02392578125, 0.00567626953125, 0.006256103515625, 0.021484375, 0.00897216796875, -0.00933837890625, 0.01275634765625, -0.0021209716796875, 0.00946044921875, 0.000530242919921875, 0.01239013671875, -0.0146484375, ...	[ 81827, 14, 2886, 959, 23, 70820, 8781, 10, 32354, 1556, 142508, 84572, 132059, 254, 12647, 5861, 58585, 3089, 60560, 182747, 7013, 25447, 83425, 137399, 11737, 18151, 7225, 3525, 24351, 111, 18499, 1984, 2389, 31635 ]	[ 0.1741943359375, 0.143310546875, 0.1778564453125, 0.1800537109375, 0.1561279296875, 0.225341796875, 0.1949462890625, 0.090576171875, 0.1807861328125, 0.123291015625, 0.2188720703125, 0.23291015625, 0.1033935546875, 0.038330078125, 0.044952392578125, 0.1285400390625, 0.138916015625, ...	embed
47475486_c1	47475486	haskell	1	expect #=> RecordAccess (RecordAccess (Id record_1) (Id field_1)) (Id field_2) I looked at chainl1 , but the type of the chaining parser is a -> a -> a , and that doesn't match the type of LValue that reflects the grammar. I also looked at many ; however I don't have a constant prefix for each term - the left recursio...	expect #=> RecordAccess (RecordAccess (Id record_1) (Id field_1)) (Id field_2) I looked at chainl1 , but the type of the chaining parser is a -> a -> a , and that doesn't match the type of LValue that reflects the grammar. I also looked at many ; however I don't have a constant prefix for each term - the left recursio...	[ -0.004119873046875, -0.0031280517578125, -0.00689697265625, 0.020751953125, 0.00433349609375, 0.01007080078125, -0.019775390625, -0.01019287109375, 0.00921630859375, -0.0380859375, 0.007080078125, 0.027587890625, 0.00518798828125, -0.01483154296875, 0.0072021484375, 0.01708984375, -0...	[ 41206, 468, 54877, 39450, 26531, 32271, 71, 17164, 115187, 44457, 10461, 54811, 121293, 141, 418, 10644, 1608, 14653, 366, 2189, 10, 33079, 18, 14858, 46233, 50770, 44961, 122092, 147, 5941, 765, 53697, 183114, 12638, 13579, 25737, 195625, 18...	[ 0.2276611328125, 0.04595947265625, 0.1776123046875, 0.0777587890625, 0.1802978515625, 0.140625, 0.0313720703125, 0.173583984375, 0.0858154296875, 0.1292724609375, 0.0265350341796875, 0.026641845703125, 0.175048828125, 0.116455078125, 0.08154296875, 0.1605224609375, 0.1243896484375, ...	embed
58886200_c0	58886200	haskell	0	Title: How can I make a type that can be either a String or an Integer? Problem title: How can I make a type that can be either a String or an Integer? Tags: haskell Problem: How can I make a type that can be either a String or an Integer? I'm trying to make a type that can represent either an operator ("+", "-", "*", ...	How can I make a type that can be either a String or an Integer? How can I make a type that can be either a String or an Integer? haskell How Integer PostfixToken Bool Couldn How can I make a type that can be either a String or an Integer? I'm trying to make a type that can represent either an operator ("+", "-", "*", ...	[ 0.00058746337890625, -0.011474609375, -0.016845703125, 0.02392578125, 0.0028076171875, 0.00543212890625, -0.01422119140625, 0.00457763671875, 0.008056640625, -0.005279541015625, 0.00909423828125, -0.029052734375, -0.004608154296875, -0.0045166015625, -0.010009765625, 0.00274658203125, ...	[ 11249, 831, 3249, 10644, 23351, 214, 707, 44401, 450, 186, 40101, 1556, 142508, 2795, 55923, 7763, 1098, 2460, 929, 191147, 19, 87, 31577, 33636, 39933, 1328, 9, 1639, 6264, 2208, 116, 138, 201, 1305, 125195, 154993, 32562, 8473, 1176, 32...	[ 0.06658935546875, 0.1202392578125, 0.144775390625, 0.279052734375, 0.185546875, 0.109619140625, 0.044921875, 0.2308349609375, 0.013214111328125, 0.0411376953125, 0.022003173828125, 0.1112060546875, 0.2122802734375, 0.082763671875, 0.1722412109375, 0.070556640625, 0.1522216796875, 0...	embed
59121370_c0	59121370	haskell	0	Title: CPS Coroutines: Why does this example require exhaust? Problem title: CPS Coroutines: Why does this example require exhaust? Tags: continuations, monads, haskell, coroutine Problem: CPS Coroutines: Why does this example require exhaust? I am trying to figure out the coroutines example from the CPS chapter from w...	CPS Coroutines: Why does this example require exhaust? CPS Coroutines: Why does this example require exhaust? continuations monads haskell coroutine exhaust CPS Coroutines Why CPS Coroutines: Why does this example require exhaust? I am trying to figure out the coroutines example from the CPS chapter from wikibooks/Hask...	[ -0.00421142578125, -0.0032806396484375, 0.0018157958984375, -0.005645751953125, -0.0152587890625, 0.00421142578125, 0.0106201171875, -0.007171630859375, 0.004791259765625, -0.025390625, 0.0084228515625, 0.0225830078125, -0.00787353515625, 0.005889892578125, 0.025390625, -0.007171630859...	[ 9059, 5631, 6056, 12741, 44084, 14602, 903, 27781, 64209, 146353, 313, 9454, 2667, 712, 1556, 142508, 88909, 34, 10325, 26366, 48635, 90, 81415, 6495, 53418, 28219, 15400, 11675, 50886, 1212, 618, 32354, 144570, 16093, 1639, 3564, 15549, 1369...	[ 0.1976318359375, 0.069580078125, 0.1602783203125, 0.1290283203125, 0.146240234375, 0.0222320556640625, 0.0307769775390625, 0.190673828125, 0.152099609375, 0.269775390625, 0.030181884765625, 0.12646484375, 0.0401611328125, 0.04669189453125, 0.06011962890625, 0.167236328125, 0.07287597...	embed
33501429_c0	33501429	haskell	0	Title: Adding custom datatype in Yesod Problem title: Adding custom datatype in Yesod Tags: yesod, organization, haskell Problem: Adding custom datatype in Yesod I'm using the scaffolded yesod template and want to add a new type for monetary values. Ideally this should be done in one file called Money.hs for example. B...	Adding custom datatype in Yesod Adding custom datatype in Yesod yesod organization haskell Adding Yesod Field Handler Money ToHtml Adding custom datatype in Yesod I'm using the scaffolded yesod template and want to add a new type for monetary values. Ideally this should be done in one file called Money.hs for example. ...	[ 0.00274658203125, 0.01287841796875, -0.006500244140625, 0.02099609375, -0.0286865234375, 0.0220947265625, 0.00543212890625, 0.004852294921875, -0.00060272216796875, -0.0419921875, 0.01708984375, -0.0235595703125, -0.031494140625, -0.00537109375, 0.0029754638671875, -0.0078125, 0.0100...	[ 62, 59725, 114122, 2053, 50986, 32635, 2199, 2422, 23722, 53702, 1556, 142508, 117657, 10639, 603, 81669, 717, 841, 18, 7237, 23, 2407, 42822, 110934, 15190, 3525, 10644, 147794, 53, 142424, 41143, 1632, 11435, 5, 127, 187830, 24927, 32807, ...	[ 0.0870361328125, 0.05242919921875, 0.2261962890625, 0.095458984375, 0.283203125, 0.1507568359375, 0.249755859375, 0.11328125, 0.2244873046875, 0.1585693359375, 0.07861328125, 0.172607421875, 0.1510009765625, 0.1356201171875, 0.151123046875, 0.2066650390625, 0.1246337890625, 0.02522...	embed
36450443_c0	36450443	haskell	0	Title: Non-exhaustive pattern in my function head' Problem title: Non-exhaustive pattern in my function head' Tags: haskell Problem: Non-exhaustive pattern in my function head' transpose' :: [[a]] -> [[a]] transpose' [[]] = [] transpose' [[], _] = [] transpose' rows = (map head' rows) : transpose' (map tail' ...	Non-exhaustive pattern in my function head' Non-exhaustive pattern in my function head' haskell Non-exhaustive x:_ _:xs matMult3 Num Non-exhaustive pattern in my function head' Anyone got any ideas as to why this could be throwing up a non-exhaustive? I feel like there is something missing but I'm too new to ...	[ -0.0030059814453125, 0.0179443359375, 0.01434326171875, 0.0064697265625, 0.001922607421875, 0.01031494140625, -0.00811767578125, -0.0235595703125, 0.00701904296875, -0.006195068359375, 0.012939453125, 0.01324462890625, 0.01397705078125, -0.00421142578125, -0.0166015625, -0.002014160156...	[ 3775, 3355, 18391, 4935, 103510, 23, 759, 32354, 10336, 3768, 1556, 142508, 1022, 101, 425, 2589, 50657, 363, 52782, 25647, 15400, 903, 5809, 104250, 1257, 351, 12319, 83, 9844, 132283, 5792, 68034, 3714, 15970, 128169, 13648, 67660 ]	[ 0.1883544921875, 0.03607177734375, 0.1329345703125, 0.109130859375, 0.2080078125, 0.025787353515625, 0.07916259765625, 0.1431884765625, 0.17138671875, 0.054290771484375, 0.1478271484375, 0.2242431640625, 0.0518798828125, 0.00738525390625, 0.055572509765625, 0.089111328125, 0.11511230...	embed
16006778_c0	16006778	haskell	0	Title: Anyone have idea about the function of following code? (Haskell) Problem title: Anyone have idea about the function of following code? (Haskell) Tags: case, function, haskell Problem: Anyone have idea about the function of following code? (Haskell) Anyone have idea about the function of the following codes? here...	Anyone have idea about the function of following code? (Haskell) Anyone have idea about the function of following code? (Haskell) case function haskell Anyone Haskell Cases Case_A Case_B Case_C Case_D test_list list_left list_right x:xs y:ys Anyone have idea about the function of following code? (Haskell) Anyone have i...	[ -0.005645751953125, 0.007049560546875, 0.007568359375, 0.00445556640625, 0.015380859375, -0.0069580078125, 0.006134033203125, 0.0017547607421875, 0.0166015625, 0.0125732421875, -0.0003795623779296875, -0.00921630859375, 0.0020599365234375, 0.009765625, 0.00262451171875, -0.001289367675...	[ 28541, 3630, 765, 6528, 1672, 70, 32354, 111, 25632, 18151, 6495, 7, 142508, 7225, 1556, 20625, 43731, 284, 571, 441, 397, 3034, 6562, 5303, 2480, 54969, 425, 113, 4778, 3688, 40469, 1884, 47, 14192, 163, 2367, 83, 442, 107097 ]	[ 0.024749755859375, 0.091796875, 0.059417724609375, 0.1358642578125, 0.0618896484375, 0.012969970703125, 0.218505859375, 0.1170654296875, 0.140380859375, 0.1861572265625, 0.06573486328125, 0.015045166015625, 0.1834716796875, 0.1900634765625, 0.1109619140625, 0.081787109375, 0.16918945...	embed
21948905_c0	21948905	haskell	0	Title: Cont Monad breaks laziness in Haskell Problem title: Cont Monad breaks laziness in Haskell Tags: continuations, monads, haskell Problem: Cont Monad breaks laziness in Haskell I was trying the Cont monad, and discovers the following problem. First construct a infinite list and lift all the elements to a Cont mona...	Cont Monad breaks laziness in Haskell Cont Monad breaks laziness in Haskell continuations monads haskell Cont Monad Haskell Cont Monad breaks laziness in Haskell I was trying the Cont monad, and discovers the following problem. First construct a infinite list and lift all the elements to a Cont monad Use sequence opera...	[ -0.0021209716796875, 0.01202392578125, -0.00616455078125, -0.0010986328125, 0.010009765625, -0.0157470703125, 0.000514984130859375, -0.015869140625, -0.01483154296875, -0.047119140625, -0.00174713134765625, 0.01513671875, 0.0084228515625, 0.02587890625, 0.021728515625, -0.0008468627929...	[ 1657, 18, 60331, 71, 36356, 21, 708, 7432, 20625, 142508, 23, 9454, 2667, 712, 1556, 31577, 103882, 2967, 23972, 64549, 54241, 5303, 60520, 80854, 40, 944, 41018, 2046, 9790, 11675, 678, 10336, 123867, 40956, 71062, 8306, 35839, 18151, 3334...	[ 0.1636962890625, 0.1563720703125, 0.192138671875, 0.1470947265625, 0.12548828125, 0.11376953125, 0.1243896484375, 0.050872802734375, 0.1185302734375, 0.23046875, 0.0155792236328125, 0.14208984375, 0.1409912109375, 0.158203125, 0.08935546875, 0.0577392578125, 0.0164947509765625, 0.0...	embed
74259165_c0	74259165	haskell	0	Title: Haskell Chat Server Tutorial on haskell.org Not Working Problem title: Haskell Chat Server Tutorial on haskell.org Not Working Tags: tcp, haskell, sockets Problem: Haskell Chat Server Tutorial on haskell.org Not Working I'm trying to follow the tutorial to create a chat server on haskell.org , but I keep getting...	Haskell Chat Server Tutorial on haskell.org Not Working Haskell Chat Server Tutorial on haskell.org Not Working tcp haskell sockets Haskell Chat Server Tutorial haskell.org Not Working Main.hs:19:32 Variable iNADDR_ANY HostAddress SockAddrInet Haskell Chat Server Tutorial on haskell.org Not Working I'm trying to follow...	[ -0.010009765625, 0.01416015625, 0.01373291015625, 0.031005859375, 0.0023345947265625, 0.01092529296875, -0.01239013671875, -0.01373291015625, -0.0123291015625, -0.0296630859375, -0.016845703125, -0.0419921875, 0.01177978515625, 0.00634765625, -0.004547119140625, 0.01251220703125, 0.0...	[ 20625, 142508, 18032, 22687, 183447, 1556, 1478, 11205, 27985, 121422, 221, 27853, 214, 29902, 84572, 2886, 17, 149300, 23498, 93333, 100932, 161007, 1061, 2594, 7569, 126, 28960, 57143, 28282, 3245, 10723, 13695, 18499, 31089, 42548, 27771, 62...	[ 0.12548828125, 0.192626953125, 0.18701171875, 0.1458740234375, 0.1728515625, 0.1248779296875, 0.1390380859375, 0.101806640625, 0.1204833984375, 0.08148193359375, 0.05694580078125, 0.1429443359375, 0.0186004638671875, 0.05340576171875, 0.1322021484375, 0.04473876953125, 0.031494140625...	embed
32656293_c0	32656293	haskell	0	Title: What is a purely functional data structure for fast nearest neighbor search on n-dimensional space? Problem title: What is a purely functional data structure for fast nearest neighbor search on n-dimensional space? Tags: functional-programming, data-structures, haskell Problem: What is a purely functional data s...	What is a purely functional data structure for fast nearest neighbor search on n-dimensional space? What is a purely functional data structure for fast nearest neighbor search on n-dimensional space? functional-programming data-structures haskell What Vector Struct What is a purely functional data structure for fast ne...	[ 0.0186767578125, 0.0167236328125, -0.02783203125, -0.0230712890625, 0.0133056640625, 0.011474609375, 0.01348876953125, -0.032470703125, -0.004852294921875, -0.0177001953125, -0.01165771484375, -0.020751953125, -0.01348876953125, -0.006256103515625, -0.01611328125, 0.0177001953125, 0....	[ 4865, 83, 34166, 538, 123309, 2053, 45646, 100, 4271, 43573, 525, 208244, 33938, 98, 653, 157955, 32628, 10, 28966, 137656, 1556, 142508, 2609, 18770, 63667, 15390, 16487, 678, 61687, 3060, 143834, 101904, 241860, 49146, 136, 41, 12830, 450 ]	[ 0.07208251953125, 0.0440673828125, 0.15625, 0.13623046875, 0.241943359375, 0.155517578125, 0.261962890625, 0.05950927734375, 0.138427734375, 0.16455078125, 0.1417236328125, 0.216552734375, 0.195556640625, 0.0587158203125, 0.110107421875, 0.127685546875, 0.1339111328125, 0.025711059...	embed
56311510_c0	56311510	haskell	0	Title: What does type signature for `undefined` mean in Haskell? Problem title: What does type signature for `undefined` mean in Haskell? Tags: forall, haskell, undefined, types, type-signature Problem: What does type signature for `undefined` mean in Haskell? I am a beginner in Haskell and I am taken aback by the unde...	What does type signature for `undefined` mean in Haskell? What does type signature for `undefined` mean in Haskell? forall haskell undefined types type-signature What Haskell RuntimeRep TYPE HasCallStack What does type signature for `undefined` mean in Haskell? I am a beginner in Haskell and I am taken aback by the und...	[ 0.00384521484375, 0.01043701171875, -0.0030975341796875, 0.00775146484375, -0.0186767578125, -0.0019073486328125, -0.0033416748046875, 0.0008392333984375, -0.002105712890625, -0.01409912109375, -0.02099609375, -0.05908203125, 0.01025390625, 0.01123046875, -0.012451171875, 0.02209472656...	[ 4865, 10644, 138256, 100, 59437, 5983, 297, 29459, 23, 20625, 142508, 5584, 1556, 9232, 52895, 137432, 6032, 4332, 254, 95267, 21907, 441, 42378, 2594, 14602, 1135, 1679, 12620, 32354, 8781, 52922, 4588, 73342, 2367, 903 ]	[ 0.04937744140625, 0.2332763671875, 0.243408203125, 0.045501708984375, 0.132080078125, 0.2066650390625, 0.16748046875, 0.1051025390625, 0.025421142578125, 0.0838623046875, 0.207763671875, 0.0743408203125, 0.07080078125, 0.0999755859375, 0.17724609375, 0.170166015625, 0.0396728515625, ...	embed
60672588_c1	60672588	haskell	1	.hs, dist/build/Linear/Metric.o ) [ 5 of 22] Compiling Linear.V ( src/Linear/V.hs, dist/build/Linear/V.o ) [ 6 of 22] Compiling Linear.V0 ( src/Linear/V0.hs, dist/build/Linear/V0.o ) Code signals: Cannot, Resolving, Configuring, linear-1.21, Building, Failed, Build, linear-1.21.log, Entering, cabal-tmp-19434, Compiling...	.hs, dist/build/Linear/Metric.o ) [ 5 of 22] Compiling Linear.V ( src/Linear/V.hs, dist/build/Linear/V.o ) [ 6 of 22] Compiling Linear.V0 ( src/Linear/V0.hs, dist/build/Linear/V0.o ) Code signals: Cannot, Resolving, Configuring, linear-1.21, Building, Failed, Build, linear-1.21.log, Entering, cabal-tmp-19434, Compiling...	[ 0.000629425048828125, 0.003570556640625, -0.0032806396484375, -0.00982666015625, 0.0216064453125, -0.01165771484375, -0.013671875, -0.006866455078125, 0.0113525390625, -0.0128173828125, -0.006988525390625, -0.0177001953125, -0.0036468505859375, 0.00921630859375, -0.0091552734375, 0.018...	[ 5, 127, 7, 45, 271, 177149, 93232, 147, 6696, 62233, 31, 190, 111, 1039, 15612, 49725, 16777, 856, 19437, 305, 2389, 28864, 26073, 4171, 10869, 132944, 59994, 192617, 5759, 3117, 104919, 190355, 121137, 4867, 357, 33558, 109524, 2676, 8363,...	[ 0.074951171875, 0.1158447265625, 0.0723876953125, 0.07208251953125, 0.131591796875, 0.1732177734375, 0.2059326171875, 0.220703125, 0.1646728515625, 0.1824951171875, 0.1566162109375, 0.07623291015625, 0.014495849609375, 0.1256103515625, 0.165771484375, 0.1468505859375, 0.2154541015625...	embed
35709737_c0	35709737	haskell	0	Title: Is it possible to derive recursion principles generically? Problem title: Is it possible to derive recursion principles generically? Tags: generic-programming, haskell Problem: Is it possible to derive recursion principles generically? In Idris, there's some magical machinery to automatically create (dependent) ...	Is it possible to derive recursion principles generically? Is it possible to derive recursion principles generically? generic-programming haskell Foo Yes Perhaps Is it possible to derive recursion principles generically? In Idris, there's some magical machinery to automatically create (dependent) eliminators for user-d...	[ -0.009765625, 0.01226806640625, -0.0027923583984375, 0.00439453125, 0.01611328125, 0.013427734375, -0.006439208984375, -0.003662109375, 0.0179443359375, -0.03515625, -0.01214599609375, -0.020263671875, -0.016357421875, 0.00099945068359375, 0.009521484375, -0.0216064453125, -0.0030212...	[ 2071, 442, 7722, 47, 122, 5844, 195625, 1830, 24702, 1577, 11212, 71407, 189534, 28966, 1556, 142508, 9572, 31, 32635, 181799, 181545, 49846, 289, 36279, 1294, 191082, 28282, 181063, 27169, 22230, 38937, 112, 5983, 52895, 149016, 54, 40715, 1...	[ 0.035186767578125, 0.02435302734375, 0.17919921875, 0.048126220703125, 0.140625, 0.14404296875, 0.239501953125, 0.123779296875, 0.1917724609375, 0.083984375, 0.168701171875, 0.1060791015625, 0.1854248046875, 0.1112060546875, 0.1002197265625, 0.203369140625, 0.10565185546875, 0.0326...	embed
14624376_c1	14624376	haskell	1	r (\k -> M.insertWith' (+) k 1) M.empty . filter (not . isStopWord) . T.words wordList = do files <- mapM TI.readFile =<< textFiles return $ mapReduce rseq histogram rseq reduce files where reduce = M.unions main = do list <- wordList print $ M.size list As for the text files, I'm using pdfs converted to text files so ...	r (\k -> M.insertWith' (+) k 1) M.empty . filter (not . isStopWord) . T.words wordList = do files <- mapM TI.readFile =<< textFiles return $ mapReduce rseq histogram rseq reduce files where reduce = M.unions main = do list <- wordList print $ M.size list As for the text files, I'm using pdfs converted to text files so ...	[ -0.00799560546875, 0.01129150390625, -0.017822265625, 0.0074462890625, 0.00341796875, -0.002838134765625, 0.00634765625, -0.01025390625, -0.00677490234375, -0.060546875, 0.0068359375, 0.0068359375, 0.021484375, 0.01336669921875, 0.02783203125, 0.008544921875, -0.00146484375, -0.005...	[ 1690, 41872, 92, 33079, 276, 73, 33657, 194583, 22183, 472, 4879, 33548, 939, 46312, 83, 156095, 164805, 384, 47416, 2565, 154663, 54, 102158, 22288, 594, 26906, 39116, 174350, 7986, 30646, 3650, 4332, 106357, 864, 1919, 18, 83814, 34390, 8...	[ 0.133544921875, 0.022857666015625, 0.10430908203125, 0.0188446044921875, 0.10626220703125, 0.0631103515625, 0.166015625, 0.2103271484375, 0.1510009765625, 0.06573486328125, 0.032440185546875, 0.1611328125, 0.115478515625, 0.2371826171875, 0.058349609375, 0.1517333984375, 0.1915283203...	embed
51792841_c0	51792841	haskell	0	Title: Pattern Matching for a new data Problem title: Pattern Matching for a new data Tags: haskell, pattern-matching Problem: Pattern Matching for a new data I created a new type with some functions data Gate = MakeGate (Bool -> Bool -> Bool) andGate = MakeGate (&&) orGate = MakeGate (\|\|) Now I want to add this type t...	Pattern Matching for a new data Pattern Matching for a new data haskell pattern-matching Pattern Matching Gate MakeGate Bool Pattern Matching for a new data I created a new type with some functions Now I want to add this type to a new instance of Eq with pattern matching, but I actually get alot of error messages. What...	[ 0.0115966796875, 0.017822265625, 0.0036468505859375, -0.003997802734375, 0.01025390625, 0.01446533203125, -0.01263427734375, 0.0113525390625, 0.000377655029296875, 0.006805419921875, -0.005859375, -0.0167236328125, 0.0067138671875, -0.005645751953125, -0.0020599365234375, -0.0063171386...	[ 9876, 22766, 67407, 214, 100, 3525, 2053, 1556, 142508, 103510, 98753, 132936, 26176, 17067, 67, 2460, 929, 75935, 10644, 32354, 15190, 903, 10, 110527, 241, 864, 678, 14858, 20653, 144, 818, 18499, 89914, 212059, 48205, 4588, 10625, 52366, ...	[ 0.1761474609375, 0.1700439453125, 0.219482421875, 0.095947265625, 0.0254669189453125, 0.09869384765625, 0.1427001953125, 0.1285400390625, 0.1942138671875, 0.231201171875, 0.1983642578125, 0.154541015625, 0.0855712890625, 0.09130859375, 0.0169219970703125, 0.087890625, 0.1763916015625...	embed
20344389_c0	20344389	haskell	0	Title: Composing a Storable by its parts Problem title: Composing a Storable by its parts Tags: haskell Problem: Composing a Storable by its parts I want to compose a Foreign.Storable into two parts.... import Foreign data FullData type1 type2 = FullData {first::type1, second::type2} instance (Storable type1, Storable ...	Composing a Storable by its parts Composing a Storable by its parts haskell Foreign a the Composing Storable FullData type1 type2 first::type1 second::type2 undefined::type1 undefined::type2 undefined::FullData Char storableTest.hs:13:44 Could storableTest.hs:12:10-74 Possible Note Defined storableTest.hs:12:10 Bool Fo...	[ 0.000774383544921875, -0.0038909912109375, -0.007232666015625, 0.0233154296875, -0.00927734375, 0.03271484375, -0.00457763671875, -0.00119781494140625, 0.007476806640625, 0.01397705078125, 0.007171630859375, 0.007354736328125, 0.025390625, 0.0146484375, -0.0036163330078125, 0.000038862...	[ 15612, 232, 23604, 2886, 390, 6863, 63920, 214, 10, 1556, 142508, 184293, 9312, 137989, 10644, 418, 304, 5117, 50986, 17932, 9232, 5983, 121962, 21656, 3082, 111337, 127, 22618, 32705, 191147, 20927, 15110, 16360, 115861, 18622, 262, 2460, 92...	[ 0.1405029296875, 0.16455078125, 0.21923828125, 0.2235107421875, 0.141357421875, 0.09332275390625, 0.2164306640625, 0.0135498046875, 0.034912109375, 0.1182861328125, 0.2076416015625, 0.26123046875, 0.1224365234375, 0.146728515625, 0.1448974609375, 0.03045654296875, 0.09088134765625, ...	embed
46018501_c0	46018501	haskell	0	Title: Which application is executed first? Problem title: Which application is executed first? Tags: haskell Problem: Which application is executed first? I have following instance of Traversable: instance Traversable (Three' a) where traverse f (Three' x y z) = Three' x <$> f y <> f z the infix operator <$> and <> ...	Which application is executed first? Which application is executed first? haskell Which Traversable Three ExercisesTraversable Functor Defined Data.Functor Applicative GHC.Base Which application is executed first? I have following instance of Traversable: the infix operator <$> and <*> has the same precedence and namel...	[ 0.007171630859375, -0.0032501220703125, -0.00726318359375, 0.0308837890625, -0.000667572021484375, -0.0011444091796875, 0.004364013671875, -0.01251220703125, 0.01904296875, -0.033935546875, 0.0196533203125, 0.002166748046875, 0.0011444091796875, 0.00537109375, 0.0003223419189453125, 0....	[ 130078, 38415, 83, 71924, 297, 5117, 32, 1556, 142508, 4937, 7864, 2886, 129335, 155534, 5908, 28542, 28670, 18770, 262, 5983, 11809, 97249, 5659, 11048, 4935, 527, 73265, 63473, 25632, 110527, 23, 55923, 39933, 4369, 136, 1639, 5701, 107671,...	[ 0.07379150390625, 0.2357177734375, 0.0653076171875, 0.233154296875, 0.1431884765625, 0.170166015625, 0.0261077880859375, 0.1397705078125, 0.228515625, 0.1414794921875, 0.1907958984375, 0.2215576171875, 0.142578125, 0.1441650390625, 0.040740966796875, 0.09698486328125, 0.094970703125,...	embed
48756758_c0	48756758	haskell	0	Title: foldr and foldl function applied on div function in Haskell Problem title: foldr and foldl function applied on div function in Haskell Tags: haskell Problem: foldr and foldl function applied on div function in Haskell I am really confused on how foldr and foldl works. Like for example using like this on the list...	foldr and foldl function applied on div function in Haskell foldr and foldl function applied on div function in Haskell haskell Haskell foldr and foldl function applied on div function in Haskell I am really confused on how foldr and foldl works. Like for example using like this on the list [1,2,3] And this makes sense...	[ -0.00634765625, -0.0001659393310546875, 0.012939453125, -0.01458740234375, -0.015380859375, 0.01220703125, -0.0125732421875, -0.00579833984375, -0.0026092529296875, -0.025634765625, 0.0057373046875, -0.0306396484375, -0.0081787109375, 0.01190185546875, 0.005706787109375, -0.01599121093...	[ 18344, 7569, 136, 20469, 32354, 190659, 98, 18221, 20625, 142508, 1556, 23, 6183, 55681, 5281, 3642, 43240, 17368, 1884, 903, 5303, 68252, 155761, 30482, 10422, 12638, 152, 91995, 997, 24092, 201505, 5423, 390, 757, 10644, 25632, 6626, 124519...	[ 0.1854248046875, 0.2421875, 0.1322021484375, 0.221435546875, 0.178466796875, 0.1204833984375, 0.012359619140625, 0.20263671875, 0.131591796875, 0.2471923828125, 0.1187744140625, 0.00860595703125, 0.04119873046875, 0.0731201171875, 0.016754150390625, 0.03729248046875, 0.1500244140625,...	embed
9159970_c0	9159970	haskell	0	Title: Boolean selection of list Problem title: Boolean selection of list Tags: haskell Problem: Boolean selection of list Suppose we want those elements of list x for which the corresponding element of list y is strictly positive. Any of the three solutions below work: let x = [1..4] let y = [1, -1, 2, -2] [ snd both ...	Boolean selection of list Boolean selection of list haskell Boolean Bool Boolean selection of list Suppose we want those elements of list x for which the corresponding element of list y is strictly positive. Any of the three solutions below work: or or however, what prompted this was that in the R language this can be ...	[ -0.0166015625, 0.018310546875, 0.015869140625, 0.0152587890625, -0.01019287109375, 0.0106201171875, -0.00046539306640625, 0.01251220703125, 0.00927734375, 0.0301513671875, -0.0089111328125, -0.00762939453125, -0.03369140625, 0.002410888671875, -0.0029296875, 0.0054931640625, 0.015441...	[ 73783, 34677, 132216, 111, 5303, 1556, 142508, 2460, 929, 121691, 3444, 8382, 80854, 1022, 100, 3129, 42518, 12830, 113, 83, 81113, 24491, 17262, 51347, 35064, 4488, 105876, 627, 46876, 903, 831, 59121, 94928, 1884, 5045, 16610, 56, 372, 30...	[ 0.1278076171875, 0.225341796875, 0.20654296875, 0.044830322265625, 0.1971435546875, 0.1448974609375, 0.25537109375, 0.103515625, 0.22412109375, 0.011566162109375, 0.1375732421875, 0.059539794921875, 0.1373291015625, 0.0430908203125, 0.065185546875, 0.010955810546875, 0.1129150390625,...	embed
30673231_c0	30673231	haskell	0	Title: Automatic instance derivation using newtype Problem title: Automatic instance derivation using newtype Tags: haskell Problem: Automatic instance derivation using newtype (Related question Even more generalized newtype deriving ) I like wrap types {-# LANGUAGE GeneralizedNewtypeDeriving #-} newtype Foo = Foo { un...	Automatic instance derivation using newtype Automatic instance derivation using newtype haskell newtype Automatic LANGUAGE GeneralizedNewtypeDeriving Foo Ord Enum Real Num Read Integral Show Automatic instance derivation using newtype (Related question Even more generalized newtype deriving ) I like wrap types to preve...	[ 0.00015735626220703125, -0.006011962890625, 0.0028533935546875, -0.002838134765625, -0.00164794921875, 0.029296875, -0.003173828125, -0.00811767578125, 0.0032806396484375, -0.01806640625, -0.01080322265625, -0.00872802734375, 0.01416015625, 0.0030975341796875, -0.0361328125, -0.0178222...	[ 51719, 1771, 110527, 30057, 1363, 17368, 3525, 50986, 1556, 142508, 3358, 98064, 9082, 46568, 47731, 14, 6496, 9572, 31, 35379, 316, 5120, 52782, 4764, 204681, 17367, 4537, 16406, 1884, 137565, 52895, 47, 56282, 7722, 122, 5844, 191082, 756, ...	[ 0.207763671875, 0.06671142578125, 0.23681640625, 0.207763671875, 0.019927978515625, 0.06573486328125, 0.119140625, 0.306640625, 0.0919189453125, 0.21533203125, 0.012969970703125, 0.09521484375, 0.05938720703125, 0.051727294921875, 0.10589599609375, 0.037994384765625, 0.0618896484375,...	embed
13661595_c0	13661595	haskell	0	Title: Are Snaplets advisable for larger apps or can you just build directly on top of snap-core? Problem title: Are Snaplets advisable for larger apps or can you just build directly on top of snap-core? Tags: haskell-snap-framework, haskell Problem: Are Snaplets advisable for larger apps or can you just build directly...	Are Snaplets advisable for larger apps or can you just build directly on top of snap-core? Are Snaplets advisable for larger apps or can you just build directly on top of snap-core? haskell-snap-framework haskell Snaplets Are Snaplets advisable for larger apps or can you just build directly on top of snap-core? I plan ...	[ -0.007293701171875, 0.0115966796875, -0.00823974609375, 0.0130615234375, -0.029541015625, 0.003692626953125, 0.0101318359375, -0.016357421875, 0.0191650390625, 0.004058837890625, 0.0159912109375, 0.00762939453125, -0.01519775390625, -0.00469970703125, 0.01513671875, -0.006744384765625,...	[ 121190, 1974, 7, 606, 1824, 2886, 100, 150679, 49966, 707, 831, 45367, 105237, 2663, 111, 76685, 30854, 9, 1556, 142508, 10957, 160328, 18244, 15901, 1660, 1774, 32562, 1467, 9007, 678, 47593, 5045, 1286, 80560, 2472, 163, 96, 47754, 76104,...	[ 0.2421875, 0.269287109375, 0.09521484375, 0.06494140625, 0.1319580078125, 0.0904541015625, 0.05389404296875, 0.163330078125, 0.1824951171875, 0.01611328125, 0.0567626953125, 0.155029296875, 0.135498046875, 0.1317138671875, 0.029998779296875, 0.224609375, 0.208984375, 0.020568847656...	embed
16797802_c0	16797802	haskell	0	Title: Is it possible to use extended precision (80-bit) floating point arithmetic in GHC/Haskell? Problem title: Is it possible to use extended precision (80-bit) floating point arithmetic in GHC/Haskell? Tags: extended-precision, haskell, ghc, floating-point, floating-point-precision Problem: Is it possible to use ex...	Is it possible to use extended precision (80-bit) floating point arithmetic in GHC/Haskell? Is it possible to use extended precision (80-bit) floating point arithmetic in GHC/Haskell? extended-precision haskell ghc floating-point floating-point-precision GHC Haskell Double Is it possible to use extended precision (80-b...	[ 0.018310546875, -0.002899169921875, 0.021484375, -0.00133514404296875, 0.0167236328125, 0.01519775390625, -0.0244140625, -0.0079345703125, -0.01422119140625, 0.002166748046875, 0.0174560546875, -0.006072998046875, -0.0010833740234375, -0.018310546875, -0.0068359375, 0.0167236328125, ...	[ 2071, 7722, 4527, 65042, 297, 22619, 1830, 4836, 3137, 21917, 26518, 6275, 187, 8962, 282, 527, 73265, 64, 6495, 7, 142508, 442, 9523, 23, 51606, 6889, 1556, 31380, 238, 38496, 20625, 107172, 5570, 41929, 18645, 174653, 101935, 95134, 17368...	[ 0.023101806640625, 0.154052734375, 0.1256103515625, 0.167724609375, 0.08099365234375, 0.20263671875, 0.0650634765625, 0.2242431640625, 0.14697265625, 0.1561279296875, 0.0882568359375, 0.1129150390625, 0.0200958251953125, 0.1365966796875, 0.08551025390625, 0.09619140625, 0.20654296875...	embed
26745663_c0	26745663	haskell	0	Title: Activate highlight code in haskell mode Problem title: Activate highlight code in haskell mode Tags: haskell-mode, haskell, emacs Problem: Activate highlight code in haskell mode I installed haskell-mode in order to have highlighted code when editing *.hs files. I have added the following line to my init.el file...	Activate highlight code in haskell mode Activate highlight code in haskell mode haskell-mode haskell emacs Activate haskell-package.el Activate highlight code in haskell mode I installed haskell-mode in order to have highlighted code when editing *.hs files. I have added the following line to my init.el file: As it can...	[ -0.01007080078125, -0.016845703125, 0.015625, 0.0002460479736328125, 0.013916015625, 0.0242919921875, 0.0002841949462890625, 0.00946044921875, -0.01708984375, -0.0072021484375, -0.0033416748046875, -0.01165771484375, -0.02001953125, -0.00396728515625, -0.0115966796875, -0.0136108398437...	[ 42902, 2182, 127308, 18151, 23, 1556, 142508, 13736, 61170, 352, 2263, 29102, 583, 20600, 765, 27211, 127, 102158, 49814, 25632, 13315, 217, 11435, 28219, 23009, 15769, 32102, 10557, 13691, 3371, 86531, 84396, 177476, 5608, 11192, 150, 3674, ...	[ 0.1922607421875, 0.03741455078125, 0.28955078125, 0.220703125, 0.06915283203125, 0.1624755859375, 0.21533203125, 0.166015625, 0.1590576171875, 0.046875, 0.068359375, 0.101318359375, 0.1209716796875, 0.07867431640625, 0.02374267578125, 0.105712890625, 0.081298828125, 0.065185546875,...	embed
46674485_c0	46674485	haskell	0	Title: I am getting different results when running my Haskell code interactively using ghci and when loading it as a module Problem title: I am getting different results when running my Haskell code interactively using ghci and when loading it as a module Tags: ghc, exponential, ghci, haskell Problem: I am getting diff...	I am getting different results when running my Haskell code interactively using ghci and when loading it as a module I am getting different results when running my Haskell code interactively using ghci and when loading it as a module ghc exponential ghci haskell ghci Haskell I am getting different results when running ...	[ 0.00537109375, -0.0038604736328125, 0.005096435546875, 0.0098876953125, 0.0002880096435546875, 0.01507568359375, 0.004119873046875, -0.0004329681396484375, 0.01104736328125, -0.0185546875, -0.00872802734375, -0.017578125, 0.0013427734375, -0.0017547607421875, -0.000835418701171875, -0....	[ 444, 20949, 12921, 50339, 3229, 51042, 20625, 142508, 18151, 212398, 17368, 31380, 318, 72367, 237, 10, 88996, 238, 78643, 80973, 1556, 442, 28864, 1295, 127, 11435, 30957, 2203, 702, 9285, 19236, 363, 472, 25837, 118552, 4046, 347, 7621, 1...	[ 0.013580322265625, 0.07110595703125, 0.188720703125, 0.15771484375, 0.040496826171875, 0.134033203125, 0.1468505859375, 0.2452392578125, 0.1961669921875, 0.1978759765625, 0.0362548828125, 0.1578369140625, 0.1971435546875, 0.148193359375, 0.0838623046875, 0.00177001953125, 0.206420898...	embed
10258081_c0	10258081	haskell	0	Title: not match expected type Problem title: not match expected type Tags: haskell Problem: not match expected type How can I solve this error and make my code work ? My data type : data ID x = ID ( ( x, Mark ), [ ID x ] ) data Mark = Marked \| Unmarked Show instance: instance Show a => Show ( ID a ) where show t = go ...	not match expected type not match expected type haskell Mark Marked Unmarked Show Couldn Char Dictionary.hs:117:23 Expected Inferred Failed not match expected type How can I solve this error and make my code work ? My data type : Show instance: Error:	[ 0.006988525390625, -0.0034942626953125, 0.004119873046875, 0.0279541015625, 0.00341796875, -0.00726318359375, -0.00084686279296875, -0.01153564453125, 0.0155029296875, 0.0078125, 0.003082275390625, -0.0206298828125, 0.00775146484375, -0.0038909912109375, -0.0101318359375, 0.00193786621...	[ 959, 14858, 84751, 10644, 1556, 142508, 7880, 992, 79466, 17367, 191147, 19, 21656, 147638, 127, 115250, 24864, 60075, 13, 89829, 360, 2875, 2822, 190355, 297, 831, 86869, 903, 18499, 3249, 759, 18151, 4488, 2053, 110527, 212059 ]	[ 0.1519775390625, 0.2415771484375, 0.215576171875, 0.21337890625, 0.13134765625, 0.1968994140625, 0.10943603515625, 0.032928466796875, 0.142333984375, 0.1614990234375, 0.15380859375, 0.06610107421875, 0.10211181640625, 0.127685546875, 0.017974853515625, 0.09857177734375, 0.07421875, ...	embed
18583416_c1	18583416	haskell	1	any input. So I was wondering if anyone have an elegant way to solve this problem? Thanks. Addendum: Example p = string "P" q = (++) <$> try (string "xy") <*> string "z" Test input on (hypothetical) parser s , had it worked the way I wanted: xyz (accept) xyz P (accept; P remains unparsed) xyz Px (accept; Px remains un...	any input. So I was wondering if anyone have an elegant way to solve this problem? Thanks. Addendum: Example p = string "P" q = (++) <$> try (string "xy") <*> string "z" Test input on (hypothetical) parser s , had it worked the way I wanted: xyz (accept) xyz P (accept; P remains unparsed) xyz Px (accept; Px remains un...	[ -0.01171875, 0.05224609375, 0.00982666015625, 0.041015625, -0.022216796875, 0.015625, -0.00274658203125, -0.027587890625, -0.00182342529296875, -0.00555419921875, 0.017578125, 0.0172119140625, -0.01202392578125, 0.01068115234375, -0.00732421875, 0.01275634765625, 0.0035400390625, 0...	[ 2499, 107730, 149016, 35672, 765, 27650, 3917, 86869, 903, 2967, 23013, 89536, 915, 2203, 79315, 683, 8096, 37223, 4369, 9790, 91693, 50878, 18939, 1639, 169, 8647, 771, 2347, 366, 2189, 91, 79786, 36663, 32189, 19462, 436, 47143, 51, 2500,...	[ 0.11181640625, 0.214111328125, 0.046356201171875, 0.036376953125, 0.016082763671875, 0.1529541015625, 0.035980224609375, 0.130859375, 0.054779052734375, 0.1397705078125, 0.025238037109375, 0.08642578125, 0.11376953125, 0.07305908203125, 0.1995849609375, 0.113525390625, 0.194702148437...	embed
72072547_c0	72072547	haskell	0	Title: How can I "save" a variable when repeating a function? Problem title: How can I "save" a variable when repeating a function? Tags: functional-programming, haskell, repeat Problem: How can I "save" a variable when repeating a function? Right now I'm trying to make a program that gives the sum ...	How can I "save" a variable when repeating a function? How can I "save" a variable when repeating a function? functional-programming haskell repeat System.Exit How EXIT_PROGRAM ExitSuccess How can I "save" a variable when repeating a function? Right now I'm trying to make a program that gives the su...	[ -0.00994873046875, 0.0191650390625, -0.0089111328125, 0.031005859375, 0.0032501220703125, 0.0196533203125, -0.007781982421875, 0.0028533935546875, 0.0115966796875, -0.04296875, -0.00010442733764648438, 0.004669189453125, -0.025634765625, 0.0108642578125, 0.0196533203125, 0.007507324218...	[ 11249, 831, 87, 108999, 10, 77336, 3229, 119140, 214, 32354, 123309, 28966, 1556, 142508, 12353, 19279, 29426, 6371, 47970, 724, 35812, 5443, 217, 14168, 238, 26531, 58, 5036, 31577, 1528, 76199, 10554, 756, 101935, 30957, 4911, 2060, 82424, ...	[ 0.08233642578125, 0.0821533203125, 0.040924072265625, 0.241455078125, 0.056396484375, 0.278076171875, 0.1087646484375, 0.27587890625, 0.114501953125, 0.1849365234375, 0.1195068359375, 0.0802001953125, 0.116943359375, 0.2086181640625, 0.1026611328125, 0.079833984375, 0.1041259765625, ...	embed
69430041_c0	69430041	haskell	0	Title: Haskell error when using the isNothing function in Maybe Problem title: Haskell error when using the isNothing function in Maybe Tags: functional-programming, haskell Problem: Haskell error when using the isNothing function in Maybe I am trying to use isNothing in my code in Haskell, and it is giving me the erro...	Haskell error when using the isNothing function in Maybe Haskell error when using the isNothing function in Maybe functional-programming haskell the Prelude Haskell Maybe Variable Bool Perhaps Nothing Just Haskell error when using the isNothing function in Maybe I am trying to use isNothing in my code in Haskell, and i...	[ -0.00531005859375, -0.012939453125, 0.0162353515625, -0.01092529296875, 0.007415771484375, 0.006072998046875, -0.005401611328125, -0.0125732421875, -0.00150299072265625, -0.0260009765625, -0.017822265625, -0.0196533203125, -0.0040283203125, -0.00537109375, 0.0137939453125, -0.022583007...	[ 20625, 142508, 18499, 17368, 83, 5021, 64113, 32354, 83425, 123309, 28966, 1556, 1914, 822, 112, 84572, 2886, 2460, 929, 181799, 182747, 23, 31577, 4527, 18151, 13315, 28960, 43240, 5885, 91995, 34292, 678, 69112, 96362, 959, 20697 ]	[ 0.1395263671875, 0.243408203125, 0.1856689453125, 0.10479736328125, 0.1768798828125, 0.173583984375, 0.2164306640625, 0.1641845703125, 0.287353515625, 0.1221923828125, 0.0682373046875, 0.136474609375, 0.055145263671875, 0.1632080078125, 0.0943603515625, 0.1077880859375, 0.03170776367...	embed
30541686_c0	30541686	haskell	0	Title: Iterate over a list until the resulting list is an empty list Problem title: Iterate over a list until the resulting list is an empty list Tags: io-monad, haskell Problem: Iterate over a list until the resulting list is an empty list I'm trying to see if I can do something like this: Say I have a list: [1, 8, 90...	Iterate over a list until the resulting list is an empty list Iterate over a list until the resulting list is an empty list io-monad haskell Iterate Iterate over a list until the resulting list is an empty list I'm trying to see if I can do something like this: Say I have a list: [1, 8, 90, 100, 82] Now, what I would l...	[ -0.013427734375, 0.0025634765625, 0.00970458984375, 0.0113525390625, -0.00958251953125, 0.009765625, 0.0011749267578125, -0.0179443359375, 0.00732421875, -0.01373291015625, 0.0004825592041015625, -0.01123046875, 0.006317138671875, 0.0040283203125, -0.00225830078125, 0.004913330078125, ...	[ 87, 8560, 67, 645, 5303, 24189, 16750, 214, 83, 142, 201505, 22995, 3796, 712, 1556, 142508, 31577, 1957, 831, 54, 1884, 903, 25916, 765, 68252, 382, 2510, 805, 15751, 2806, 198343, 28412, 47143, 820, 111, 2046, 7068, 7279, 3917, 23, 20...	[ 0.054931640625, 0.25341796875, 0.1251220703125, 0.1888427734375, 0.2001953125, 0.1549072265625, 0.1005859375, 0.06170654296875, 0.1092529296875, 0.0672607421875, 0.2222900390625, 0.174072265625, 0.10260009765625, 0.1182861328125, 0.128173828125, 0.257080078125, 0.058441162109375, 0...	embed
23061500_c0	23061500	haskell	0	Title: Extracting from a function in Haskell Problem title: Extracting from a function in Haskell Tags: store, extract, integer, function, haskell Problem: Extracting from a function in Haskell I have the following data types type Store = Loc -> Z type Loc = Z type Z = Integer where the basic idea is that a Store maps ...	Extracting from a function in Haskell Extracting from a function in Haskell store extract integer function haskell a Extracting Haskell Store Loc Integer Extracting from a function in Haskell I have the following data types where the basic idea is that a Store maps a Location to an integer. And each Location is represe...	[ 0.005279541015625, -0.01251220703125, 0.005828857421875, 0.0228271484375, 0.0157470703125, 0.0181884765625, -0.00799560546875, -0.006072998046875, 0.00885009765625, -0.01495361328125, -0.0098876953125, -0.006103515625, -0.0120849609375, -0.003662109375, 0.00885009765625, -0.00772094726...	[ 31501, 238, 1916, 1295, 32354, 23, 20625, 142508, 4343, 125663, 892, 1505, 1556, 14934, 88784, 44401, 25632, 2053, 52895, 62822, 6528, 22288, 90788, 47, 12638, 33636, 10002, 42485, 234311, 66211, 15363, 33079, 567, 3871, 51776, 30646, 1660, 2...	[ 0.1861572265625, 0.07525634765625, 0.03857421875, 0.103515625, 0.2000732421875, 0.091552734375, 0.1494140625, 0.244140625, 0.2042236328125, 0.2283935546875, 0.1480712890625, 0.135498046875, 0.1435546875, 0.1856689453125, 0.1842041015625, 0.1864013671875, 0.009429931640625, 0.069274...	embed
50191905_c0	50191905	haskell	0	Title: Read a list of INT type from the console and print out only even numbers out of the given list Using list comprehension Problem title: Read a list of INT type from the console and print out only even numbers out of the given list Using list comprehension Tags: haskell, list-comprehension Problem: Read a list of ...	Read a list of INT type from the console and print out only even numbers out of the given list Using list comprehension Read a list of INT type from the console and print out only even numbers out of the given list Using list comprehension haskell list-comprehension the Read Using Read a list of INT type from the conso...	[ -0.0283203125, 0.001739501953125, 0.01409912109375, -0.00390625, 0.0133056640625, 0.037841796875, 0.006927490234375, 0.027587890625, 0.00482177734375, -0.0089111328125, -0.01202392578125, -0.037353515625, 0.024658203125, -0.000560760498046875, 0.00029754638671875, 0.0177001953125, 0....	[ 4764, 5303, 59537, 10644, 1295, 130250, 28412, 1810, 4734, 3853, 101935, 34475, 345, 6953, 46683, 3220, 111, 1556, 142508, 277, 4692, 3525, 123309, 56037, 678, 20625, 52080, 66211, 31577, 33022, 32354, 765 ]	[ 0.1973876953125, 0.191162109375, 0.2108154296875, 0.177001953125, 0.1195068359375, 0.223876953125, 0.18896484375, 0.09649658203125, 0.1197509765625, 0.1934814453125, 0.152099609375, 0.085693359375, 0.050506591796875, 0.0208587646484375, 0.1514892578125, 0.169921875, 0.0103759765625, ...	embed
28927716_c0	28927716	haskell	0	Title: org-babel for haskell not works of eval haskell block Problem title: org-babel for haskell not works of eval haskell block Tags: haskell, org-mode, emacs, org-babel Problem: org-babel for haskell not works of eval haskell block I am use org-mode blogging, I use org-babel to evaluate the code as following : #+BEG...	org-babel for haskell not works of eval haskell block org-babel for haskell not works of eval haskell block haskell org-mode emacs org-babel Data.Function BEGIN_SRC END_SRC RESULTS Not org-babel for haskell not works of eval haskell block I am use org-mode blogging, I use org-babel to evaluate the code as following : I...	[ 0.01385498046875, -0.003814697265625, 0.02685546875, 0.002532958984375, 0.00007581710815429688, 0.006744384765625, -0.0084228515625, -0.01361083984375, -0.0157470703125, -0.0218505859375, -0.0089111328125, -0.0021514892578125, -0.001861572265625, -0.01611328125, 0.00323486328125, -0.01...	[ 30910, 9, 402, 4063, 100, 1556, 142508, 959, 43240, 111, 28, 1405, 46389, 61170, 352, 2263, 11809, 97249, 108526, 25740, 39015, 218849, 11205, 127990, 151575, 18151, 4527, 53498, 10557, 13736, 4034, 56002, 75935, 61924, 32354, 105237, 3884, 7...	[ 0.259033203125, 0.0301513671875, 0.12548828125, 0.21923828125, 0.0947265625, 0.1192626953125, 0.200927734375, 0.05523681640625, 0.121826171875, 0.0694580078125, 0.066162109375, 0.2322998046875, 0.166015625, 0.137939453125, 0.013641357421875, 0.049652099609375, 0.0543212890625, 0.08...	embed
75922457_c1	75922457	haskell	1	-- cardinal (names from "To Mock a Mockingbird") p = (,) f x y z = x + 10y + 100z g x y = x + 10*y {- p(fxyz)(gvw) = ?xyzvw, with ? in terms of p, f, g and known birds (p(fxyz))(gvw) B(B(p(fxyz)))gvw CBg(B(p(fxyz)))vw B(CBg)B(p(fxyz))vw B(B(CBg)B)p(fxyz)vw B(B(B(CBg)B)p)(fxy)zvw B(B(B(B(CBg)B)p))(fx)yzvw B(B(B(B(B(C...	-- cardinal (names from "To Mock a Mockingbird") p = (,) f x y z = x + 10y + 100z g x y = x + 10*y {- p(fxyz)(gvw) = ?xyzvw, with ? in terms of p, f, g and known birds (p(fxyz))(gvw) B(B(p(fxyz)))gvw CBg(B(p(fxyz)))vw B(CBg)B(p(fxyz))vw B(B(CBg)B)p(fxyz)vw B(B(B(CBg)B)p)(fxy)zvw B(B(B(B(CBg)B)p))(fx)yzvw B(B(B(B(B(C...	[ -0.011474609375, 0.0189208984375, -0.01226806640625, 0.043212890625, 0.01251220703125, 0.01104736328125, -0.0038604736328125, -0.002899169921875, 0.0272216796875, -0.0037384033203125, 0.00156402587890625, -0.00860595703125, 0.00958251953125, -0.00634765625, -0.0206298828125, -0.0177001...	[ 4210, 200103, 15, 11627, 7, 1295, 44, 7763, 2501, 2594, 10, 41324, 91157, 18939, 915, 2203, 4, 16, 1238, 1022, 113, 97, 997, 209, 1639, 53, 805, 169, 706, 10666, 9, 132, 420, 50878, 51421, 177, 334, 705, 72932, 434, 678, 69407, 136,...	[ 0.12548828125, 0.327392578125, 0.0538330078125, 0.1959228515625, 0.105712890625, 0.101806640625, 0.032958984375, 0.1788330078125, 0.208740234375, 0.2376708984375, 0.1204833984375, 0.2138671875, 0.275390625, 0.044219970703125, 0.1881103515625, 0.1807861328125, 0.046875, 0.0274200439...	embed
42144467_c0	42144467	haskell	0	Title: Is this type family injective? Problem title: Is this type family injective? Tags: haskell, type-families Problem: Is this type family injective? I have type family for N-ary function from n arguments of type t to value of type o : type family NAry (n :: Nat) (t :: Type) (o :: Type) = (r :: Type) \| r -> n t o wh...	Is this type family injective? Is this type family injective? haskell type-families the NAry Nat Type Is this type family injective? I have type family for N-ary function from n arguments of type t to value of type o : I think this family ought to be injective by I can't prove it to GHC:	[ -0.0027618408203125, -0.00848388671875, 0.007293701171875, 0.013671875, -0.031005859375, -0.01385498046875, 0.00830078125, 0.0113525390625, 0.01226806640625, 0.0123291015625, -0.00390625, -0.033203125, 0.0024261474609375, 0.0198974609375, -0.000598907470703125, -0.00482177734375, 0.0...	[ 2071, 903, 10644, 14449, 115049, 5844, 1556, 142508, 69128, 70, 3076, 1294, 68875, 60457, 765, 541, 6635, 32354, 1295, 653, 10750, 808, 47, 34292, 36, 5351, 46526, 186, 390, 831, 18, 23534, 73265 ]	[ 0.08660888671875, 0.1221923828125, 0.207275390625, 0.181884765625, 0.1978759765625, 0.1900634765625, 0.1038818359375, 0.21044921875, 0.1580810546875, 0.0274810791015625, 0.08746337890625, 0.1163330078125, 0.150390625, 0.1724853515625, 0.021240234375, 0.08056640625, 0.1744384765625, ...	embed
69715705_c0	69715705	haskell	0	Title: How do you install profiling libraries in Haskell? Problem title: How do you install profiling libraries in Haskell? Tags: cabal, haskell, profiling Problem: How do you install profiling libraries in Haskell? After running ghc --make -prof -fprof-auto -rtsopts encode.hs I'm getting this error: Failed to load int...	How do you install profiling libraries in Haskell? How do you install profiling libraries in Haskell? cabal haskell profiling How Haskell encode.hs Failed Data.Text Perhaps text-1.2.5.0 Use How do you install profiling libraries in Haskell? After running I'm getting this error: I've tried this: As suggested here: https...	[ 0.009033203125, -0.01141357421875, 0.0076904296875, 0.005126953125, -0.02783203125, 0.004638671875, -0.006561279296875, -0.00653076171875, -0.01275634765625, 0.00811767578125, 0.0079345703125, -0.052490234375, 0.00116729736328125, -0.00927734375, 0.0089111328125, 0.003387451171875, 0...	[ 11249, 20600, 9468, 214, 35773, 10484, 20625, 142508, 23, 109524, 1556, 22, 40899, 127, 7, 190355, 297, 11809, 174379, 181799, 7986, 48400, 187461, 51042, 903, 18499, 37842, 42459, 61754, 10557, 9486, 238, 22364, 102014, 7693, 223, 64527, 583...	[ 0.0204925537109375, 0.1944580078125, 0.2802734375, 0.167236328125, 0.2076416015625, 0.1192626953125, 0.160400390625, 0.251708984375, 0.04296875, 0.182373046875, 0.130126953125, 0.05419921875, 0.1793212890625, 0.1124267578125, 0.016845703125, 0.1424560546875, 0.059967041015625, 0.09...	embed
70158413_c0	70158413	haskell	0	Title: Include a closed source Haskell package in an open source Haskell package without leaking its code Problem title: Include a closed source Haskell package in an open source Haskell package without leaking its code Tags: package, haskell, hackage Problem: Include a closed source Haskell package in an open source H...	Include a closed source Haskell package in an open source Haskell package without leaking its code Include a closed source Haskell package in an open source Haskell package without leaking its code package haskell hackage Include Haskell System.Process.callCommand Include a closed source Haskell package in an open sour...	[ 0.0027618408203125, 0.00482177734375, 0.000720977783203125, 0.005035400390625, -0.00090789794921875, 0.0142822265625, 0.0036773681640625, 0.00396728515625, 0.00051116943359375, -0.0302734375, -0.006927490234375, -0.01348876953125, -0.006011962890625, 0.048828125, 0.00927734375, 0.00239...	[ 8942, 822, 155738, 31344, 20625, 142508, 98169, 23, 9803, 15490, 95, 11, 6863, 18151, 1556, 85526, 4588, 12353, 26531, 85763, 10770, 12018, 20697, 3444, 4527, 180639, 5665, 42548, 3917, 9969, 1340, 2394, 11782, 1829, 24500, 15700, 15917, 9384...	[ 0.09808349609375, 0.1309814453125, 0.156982421875, 0.1231689453125, 0.1507568359375, 0.25048828125, 0.231201171875, 0.0108642578125, 0.1241455078125, 0.09552001953125, 0.115966796875, 0.09283447265625, 0.015228271484375, 0.144287109375, 0.139404296875, 0.1785888671875, 0.105529785156...	embed
63670698_c0	63670698	haskell	0	Title: ghc.exe could not execute ld.exe while installing zlib Problem title: ghc.exe could not execute ld.exe while installing zlib Tags: cabal, haskell, installation, zlib Problem: ghc.exe could not execute ld.exe while installing zlib Im using Windows 10 cabal-install version 3.2.0.0 GHC version 8.10.2 While trying t...	ghc.exe could not execute ld.exe while installing zlib ghc.exe could not execute ld.exe while installing zlib cabal haskell installation zlib ghc.exe ld.exe Building zlib-0.6.2.2 Compiling Codec.Compression.Zlib.Stream Codec Compression Zlib Stream.hs Stream.o GitLabRunner ghc.exe could not execute ld.exe while install...	[ 0.021240234375, 0.01068115234375, 0.0098876953125, -0.01324462890625, -0.017578125, 0.000667572021484375, -0.01611328125, -0.0189208984375, -0.02099609375, 0.013916015625, 0.007415771484375, -0.0023345947265625, 0.02392578125, 0.0022125244140625, 0.003753662109375, 0.0322265625, 0.00...	[ 31380, 238, 46480, 5809, 959, 71924, 96, 71, 5, 12960, 20600, 97, 5612, 109524, 1556, 142508, 59720, 104919, 122887, 70147, 15612, 28864, 10770, 48448, 1511, 115061, 3288, 567, 127, 31, 217, 97381, 163321, 3370, 3773, 209, 80383, 55054, 999...	[ 0.147705078125, 0.1595458984375, 0.2039794921875, 0.0660400390625, 0.0870361328125, 0.173583984375, 0.07318115234375, 0.145751953125, 0.002227783203125, 0.063720703125, 0.12451171875, 0.114990234375, 0.25244140625, 0.2115478515625, 0.06109619140625, 0.1766357421875, 0.0633544921875, ...	embed
39689887_c0	39689887	haskell	0	Title: How to compose functions operating with ReaderT and Either? Problem title: How to compose functions operating with ReaderT and Either? Tags: monad-transformers, haskell, functor, monads Problem: How to compose functions operating with ReaderT and Either? Is it possible to rewrite the following function as a one-...	How to compose functions operating with ReaderT and Either? How to compose functions operating with ReaderT and Either? monad-transformers haskell functor monads TenantCreationError How ReaderT Either NewTenant AppM Tenant Left Right AppConfig TenantId How to compose functions operating with ReaderT and Either? Is it p...	[ -0.013671875, -0.006439208984375, -0.0052490234375, -0.014404296875, -0.000370025634765625, -0.01031494140625, -0.003448486328125, -0.0145263671875, 0.0003204345703125, -0.02294921875, 0.0064697265625, 0.0302734375, 0.0240478515625, -0.0181884765625, -0.0030364990234375, -0.02990722656...	[ 11249, 47, 150350, 32354, 172852, 678, 122636, 618, 136, 4565, 9319, 7, 2667, 712, 215175, 1314, 1556, 142508, 7477, 18770, 5531, 1236, 63784, 18468, 31611, 2356, 87286, 5659, 594, 90911, 83671, 7722, 456, 434, 18781, 25632, 1632, 79852 ]	[ 0.0521240234375, 0.05181884765625, 0.2144775390625, 0.2081298828125, 0.1180419921875, 0.08447265625, 0.2122802734375, 0.203125, 0.0714111328125, 0.06201171875, 0.2071533203125, 0.0252227783203125, 0.09002685546875, 0.1351318359375, 0.183837890625, 0.039886474609375, 0.090576171875, ...	embed
44142605_c0	44142605	haskell	0	Title: How to use the Reader Monad with (Int -> Int)? Problem title: How to use the Reader Monad with (Int -> Int)? Tags: reader-monad, haskell, monads Problem: How to use the Reader Monad with (Int -> Int)? I would like to learn, how to use the Reader Monad. Unfortunately only a small amount of example code is a...	How to use the Reader Monad with (Int -> Int)? How to use the Reader Monad with (Int -> Int)? reader-monad haskell monads How Reader Monad IntRead ReaderT How to use the Reader Monad with (Int -> Int)? I would like to learn, how to use the Reader Monad. Unfortunately only a small amount of example code is availab...	[ -0.005645751953125, -0.0054931640625, 0.0135498046875, 0.00848388671875, -0.01025390625, 0.0005340576171875, -0.000743865966796875, -0.0284423828125, -0.007598876953125, -0.045166015625, 0.0111083984375, 0.0076904296875, -0.005279541015625, -0.00775146484375, 0.016357421875, -0.0397949...	[ 11249, 47, 4527, 122636, 60331, 71, 678, 4153, 18, 20, 1230, 5386, 360, 70, 155255, 3796, 712, 1556, 142508, 2667, 31345, 618, 33079, 30698, 3642, 19336, 41170, 27781, 18151, 19882, 1884, 28282, 65998, 136, 456, 3996, 142424, 621, 61924, ...	[ 0.1036376953125, 0.04034423828125, 0.1688232421875, 0.29638671875, 0.20361328125, 0.1961669921875, 0.1192626953125, 0.1346435546875, 0.2091064453125, 0.047088623046875, 0.05670166015625, 0.163330078125, 0.1351318359375, 0.03668212890625, 0.2418212890625, 0.1072998046875, 0.1448974609...	embed
30899782_c2	30899782	haskell	2	000000 1,600,100,336 bytes allocated in the heap 1,477,564,464 bytes copied during GC 400,027,984 bytes maximum residency (14 sample(s)) 70,377,336 bytes maximum slop 911 MB total memory in use (0 MB lost due to fragmentation) Tot time (elapsed) Avg pause Max pause Gen 0 3067 colls, 3067 par 1.05s 0.68s 0.0002s 0.0021s...	000000 1,600,100,336 bytes allocated in the heap 1,477,564,464 bytes copied during GC 400,027,984 bytes maximum residency (14 sample(s)) 70,377,336 bytes maximum slop 911 MB total memory in use (0 MB lost due to fragmentation) Tot time (elapsed) Avg pause Max pause Gen 0 3067 colls, 3067 par 1.05s 0.68s 0.0002s 0.0021s...	[ 0.0118408203125, 0.009521484375, 0.0003662109375, 0.0128173828125, 0.0152587890625, -0.000408172607421875, -0.02392578125, 0.0002956390380859375, 0.0096435546875, -0.00628662109375, 0.010498046875, -0.00372314453125, 0.01324462890625, 0.0167236328125, -0.0026702880859375, 0.00946044921...	[ 6, 197094, 106, 10715, 4, 3559, 363, 8659, 390, 1636, 144, 116292, 297, 23, 70, 764, 2631, 59084, 14546, 176830, 160775, 71200, 71, 20271, 69657, 4082, 9550, 13903, 38132, 45606, 2408, 26205, 121413, 7, 16, 2358, 128919, 25193, 254, 12013...	[ 0.0927734375, 0.3017578125, 0.07769775390625, 0.1763916015625, 0.0211029052734375, 0.153564453125, 0.060577392578125, 0.1829833984375, 0.193359375, 0.1298828125, 0.1683349609375, 0.227783203125, 0.12451171875, 0.1239013671875, 0.06787109375, 0.227783203125, 0.2568359375, 0.07141113...	embed
5939862_c0	5939862	haskell	0	Title: Lazily evaluate monadic functions in Haskell Problem title: Lazily evaluate monadic functions in Haskell Tags: haskell, monads, lazy-evaluation Problem: Lazily evaluate monadic functions in Haskell I can't seem to figure out a workaround for this issue i'm having. I have something like this: getFilePathForDay ::...	Lazily evaluate monadic functions in Haskell Lazily evaluate monadic functions in Haskell haskell monads lazy-evaluation Lazily Haskell Day Maybe FilePath Lazily evaluate monadic functions in Haskell I can't seem to figure out a workaround for this issue i'm having. I have something like this: I am trying to get x amou...	[ 0.00677490234375, 0.002471923828125, 0.00494384765625, 0.004058837890625, -0.0206298828125, 0.0128173828125, 0.00726318359375, -0.00701904296875, 0.00787353515625, -0.01806640625, -0.0079345703125, -0.00762939453125, -0.01055908203125, 0.0196533203125, 0, -0.003570556640625, -0.01501...	[ 239, 708, 538, 151575, 2667, 11, 18403, 32354, 20625, 142508, 1556, 712, 21, 3285, 159258, 10013, 83425, 42724, 683, 10519, 26366, 67688, 31089, 19441, 1884, 903, 31577, 2046, 1022, 41170, 35604, 11435, 60875, 7440, 14012, 13312, 3444, 1284, ...	[ 0.1226806640625, 0.1502685546875, 0.12060546875, 0.1612548828125, 0.1234130859375, 0.08740234375, 0.113525390625, 0.1568603515625, 0.1317138671875, 0.2587890625, 0.113037109375, 0.1392822265625, 0.1077880859375, 0.1793212890625, 0.170654296875, 0.170166015625, 0.0777587890625, 0.13...	embed
10004442_c1	10004442	haskell	1	Map = [("writeServerName", writeServerName) ,("writeServeralias", writeServerAlias) ,("writeDocRoot", writeDocRoot) ,("writeLogLevel", writeErrorLog) ,("writeErrorPipe", writeErrorPipe) ,("writeVhostOpen", writeVhostOpen)] In the file which actually writes the hosts, that file is imported. I have an association list ca...	Map = [("writeServerName", writeServerName) ,("writeServeralias", writeServerAlias) ,("writeDocRoot", writeDocRoot) ,("writeLogLevel", writeErrorLog) ,("writeErrorPipe", writeErrorPipe) ,("writeVhostOpen", writeVhostOpen)] In the file which actually writes the hosts, that file is imported. I have an association list ca...	[ -0.00958251953125, -0.01043701171875, -0.000835418701171875, -0.003814697265625, 0.0015106201171875, -0.0040283203125, -0.0140380859375, -0.015869140625, 0.013427734375, 0.00921630859375, 0.01226806640625, 0.0223388671875, 0.0201416015625, 0.0020599365234375, 0.002960205078125, 0.01000...	[ 42719, 2203, 434, 18781, 193348, 163612, 33022, 41763, 55725, 162, 8331, 12724, 818, 113972, 2601, 31611, 48672, 683, 856, 40294, 103264, 11435, 20653, 70, 27980, 76242, 765, 125413, 5303, 93147, 40226, 8473, 1176, 34292, 450, 2806, 914, 9319...	[ 0.277099609375, 0.043548583984375, 0.046539306640625, 0.09881591796875, 0.1763916015625, 0.048828125, 0.203369140625, 0.1119384765625, 0.048004150390625, 0.043670654296875, 0.006805419921875, 0.08892822265625, 0.040679931640625, 0.056427001953125, 0.049957275390625, 0.003570556640625, ...	embed
38193391_c0	38193391	haskell	0	Title: Maximum Size Square of All 1's in Haskell Problem title: Maximum Size Square of All 1's in Haskell Tags: algorithm, functional-programming, haskell Problem: Maximum Size Square of All 1's in Haskell if I have a matrix m = 0 0 1 1 0 0 1 1 1 0 1 0 1 1 1 1 1 1 1 1 0 1 1 1 1 How do I find the the largest n...	Maximum Size Square of All 1's in Haskell Maximum Size Square of All 1's in Haskell algorithm functional-programming haskell Maximum Size Square All Haskell Maximum Size Square of All 1's in Haskell if I have a matrix How do I find the the largest nXn sub matrix of m that is just 1's? This seems an OK problem...	[ 0.0172119140625, 0.0167236328125, 0.0036773681640625, -0.01080322265625, 0.0035247802734375, 0.0184326171875, -0.0106201171875, 0.00775146484375, 0.0076904296875, -0.01318359375, 0.006622314453125, -0.0027618408203125, 0.00909423828125, -0.00921630859375, -0.0079345703125, 0.0134277343...	[ 46540, 316, 80378, 68305, 111, 3164, 106, 3768, 20625, 142508, 234873, 123309, 28966, 1556, 765, 50944, 7413, 70, 142105, 653, 1542, 19, 1614, 425, 347, 1660, 2967, 222530, 46876, 118664, 33636, 35166, 103136, 7108, 138, 363 ]	[ 0.1597900390625, 0.0396728515625, 0.1754150390625, 0.1678466796875, 0.040374755859375, 0.126220703125, 0.1156005859375, 0.04656982421875, 0.1270751953125, 0.216796875, 0.09222412109375, 0.0947265625, 0.05352783203125, 0.0958251953125, 0.018585205078125, 0.154296875, 0.11669921875, ...	embed
51905250_c0	51905250	haskell	0	Title: Haskell implementation of De-convolution (Richardson lucy) Problem title: Haskell implementation of De-convolution (Richardson lucy) Tags: image-processing, haskell, deconvolution Problem: Haskell implementation of De-convolution (Richardson lucy) I'm trying to implement an algorithm of de-convolution in Haskell...	Haskell implementation of De-convolution (Richardson lucy) Haskell implementation of De-convolution (Richardson lucy) image-processing haskell deconvolution Haskell De-convolution Richardson Haskell implementation of De-convolution (Richardson lucy) I'm trying to implement an algorithm of de-convolution in Haskell and ...	[ -0.01116943359375, 0.0164794921875, -0.00115203857421875, 0.0244140625, 0.0123291015625, 0.0263671875, -0.0103759765625, -0.00628662109375, -0.0024261474609375, -0.01251220703125, 0.01165771484375, -0.013427734375, 0.0198974609375, 0.03466796875, -0.01031494140625, 0.005523681640625, ...	[ 20625, 142508, 208124, 111, 262, 9, 2271, 137089, 15, 23267, 9254, 71, 1681, 3480, 2408, 16, 29569, 63923, 1556, 8, 22758, 31577, 29479, 234873, 23, 69427, 7413, 8781, 42, 1632, 3501, 131931, 144573, 2589, 6114, 64, 6493, 50828, 51, 2886,...	[ 0.1781005859375, 0.29296875, 0.202392578125, 0.0113525390625, 0.27978515625, 0.09033203125, 0.11474609375, 0.2462158203125, 0.0153961181640625, 0.06341552734375, 0.0650634765625, 0.058319091796875, 0.173828125, 0.1229248046875, 0.1617431640625, 0.0147552490234375, 0.171630859375, 0...	embed
7603186_c1	7603186	haskell	1	2.16572\gl ib-0.12.1\dist\setup\Main.o ) Linking C:\Users\User\AppData\Local\Temp\glib-0.12.16572\glib-0.12.1\dist\setup\ setup.exe ... Warning: .drectve `-aligncomm:___gmp_junk,2' unrecognized cabal: Error: some packages failed to install: glib-0.12.1 failed during the configure step. The exception was: C:\Users\User\...	2.16572\gl ib-0.12.1\dist\setup\Main.o ) Linking C:\Users\User\AppData\Local\Temp\glib-0.12.16572\glib-0.12.1\dist\setup\ setup.exe ... Warning: .drectve `-aligncomm:___gmp_junk,2' unrecognized cabal: Error: some packages failed to install: glib-0.12.1 failed during the configure step. The exception was: C:\Users\User\...	[ 0.00007963180541992188, -0.0037384033203125, 0.006927490234375, 0.00127410888671875, -0.004425048828125, 0.01422119140625, -0.00003266334533691406, -0.00555419921875, -0.009521484375, 0.03369140625, -0.01446533203125, -0.0185546875, 0.004669189453125, 0.0020751953125, -0.004638671875, ...	[ 787, 2485, 177917, 11016, 2566, 102014, 68107, 46295, 3509, 2037, 168793, 31, 12779, 214, 1062, 7, 1314, 2189, 39179, 137989, 203758, 159065, 5612, 15654, 169581, 5, 46480, 5550, 592, 173247, 272, 143420, 277, 39, 2676, 34002, 304, 115558, ...	[ 0.02447509765625, 0.1341552734375, 0.2169189453125, 0.1461181640625, 0.14794921875, 0.146484375, 0.231689453125, 0.1282958984375, 0.121337890625, 0.1495361328125, 0.1375732421875, 0.164306640625, 0.170654296875, 0.08917236328125, 0.0672607421875, 0.086669921875, 0.00604248046875, 0...	embed
6878193_c1	6878193	haskell	1	' 1 . (This might happen, for example, if we're memoizing a function which is being called recursively over some large data structure with a lot of structural sharing.) If we've already computed our memoized function on that exact object before, we can already know the answer, even without looking at the object itself!...	' 1 . (This might happen, for example, if we're memoizing a function which is being called recursively over some large data structure with a lot of structural sharing.) If we've already computed our memoized function on that exact object before, we can already know the answer, even without looking at the object itself!...	[ -0.006195068359375, -0.0152587890625, 0.0240478515625, 0.0128173828125, 0.015869140625, 0.01080322265625, 0.000705718994140625, 0.01129150390625, 0.030029296875, -0.020751953125, 0.0108642578125, -0.0137939453125, 0.01312255859375, 0.00933837890625, 0.0186767578125, -0.01080322265625, ...	[ 242, 106, 5, 73243, 13648, 53383, 27781, 163, 432, 84382, 32354, 35839, 195625, 5844, 645, 2053, 45646, 5915, 118990, 53371, 4263, 642, 272, 21771, 375, 7077, 297, 2446, 29367, 98, 24763, 36746, 8108, 831, 3714, 35166, 3853, 15490, 16487, ...	[ 0.043914794921875, 0.02392578125, 0.01934814453125, 0.004608154296875, 0.037261962890625, 0.05743408203125, 0.00140380859375, 0.2122802734375, 0.24951171875, 0.210693359375, 0.1549072265625, 0.0826416015625, 0.136474609375, 0.07037353515625, 0.026763916015625, 0.1121826171875, 0.1094...	embed
5684049_c0	5684049	haskell	0	Title: Is there some way to define an Enum in haskell that wraps around? Problem title: Is there some way to define an Enum in haskell that wraps around? Tags: haskell Problem: Is there some way to define an Enum in haskell that wraps around? Consider I was designing a Monopoly game: data Board = GO \| A1 \| CC1 \| A2 \| T...	Is there some way to define an Enum in haskell that wraps around? Is there some way to define an Enum in haskell that wraps around? haskell Enum Board CC1 CH1 JAIL CC2 CH2 G2J CC3 CH3 Show Exception Is there some way to define an Enum in haskell that wraps around? Consider I was designing a Monopoly game: I want: But i...	[ -0.0201416015625, -0.01251220703125, -0.0069580078125, 0.0172119140625, 0.005157470703125, -0.01080322265625, -0.0020294189453125, -0.00872802734375, -0.006103515625, -0.004669189453125, 0.0010528564453125, 0.0087890625, 0.007598876953125, 0.0076904296875, 0.00311279296875, -0.00124359...	[ 3060, 3917, 61924, 357, 316, 23, 1556, 142508, 450, 137565, 7, 10932, 62554, 21581, 14045, 9846, 16444, 1375, 363, 17367, 5443, 63928, 142, 137399, 4331, 77879, 135545, 6712, 3444, 64457, 10644, 67413, 36510, 189085, 1363 ]	[ 0.03240966796875, 0.06768798828125, 0.19921875, 0.146240234375, 0.2474365234375, 0.02801513671875, 0.129638671875, 0.228515625, 0.0435791015625, 0.184814453125, 0.0733642578125, 0.1767578125, 0.125732421875, 0.0084228515625, 0.027435302734375, 0.0906982421875, 0.0902099609375, 0.05...	embed
12822808_c0	12822808	haskell	0	Title: How do you derive Show for type defined in someone else's library? Problem title: How do you derive Show for type defined in someone else's library? Tags: typeclass, haskell Problem: How do you derive Show for type defined in someone else's library? I'm using a Haskell library for OAuth and the author ...	How do you derive Show for type defined in someone else's library? How do you derive Show for type defined in someone else's library? typeclass haskell How Show How do you derive Show for type defined in someone else's library? I'm using a Haskell library for OAuth and the author didn't derive Show for a type...	[ 0.00555419921875, 0.015869140625, -0.000522613525390625, 0.0174560546875, 0.004302978515625, -0.020751953125, 0.00634765625, 0.0013427734375, 0.0016937255859375, -0.00799560546875, -0.0198974609375, -0.029296875, 0.0147705078125, 0.01953125, -0.007354736328125, -0.01068115234375, -0....	[ 11249, 122, 5844, 17367, 100, 10644, 61924, 37076, 3768, 35773, 1294, 23, 22008, 67413, 1556, 142508, 54, 20625, 180, 67362, 927, 42179, 18, 17368, 28412, 1810, 8, 978, 1884, 442, 3917, 50782, 32354, 71200, 17164, 44457, 717, 1098, 28997, ...	[ 0.09051513671875, 0.14013671875, 0.17578125, 0.30712890625, 0.0836181640625, 0.2191162109375, 0.1396484375, 0.06805419921875, 0.006439208984375, 0.1614990234375, 0.081787109375, 0.06793212890625, 0.035125732421875, 0.14501953125, 0.090087890625, 0.1917724609375, 0.0264434814453125, ...	embed
53251440_c0	53251440	haskell	0	Title: Haskell Pattern matching in a Function Problem title: Haskell Pattern matching in a Function Tags: haskell Problem: Haskell Pattern matching in a Function The two-argument function check returns True exactly when both Boolean operands have the same value. Otherwise it returns False. I should implement it using :...	Haskell Pattern matching in a Function Haskell Pattern matching in a Function haskell Haskell Pattern Bool Haskell Pattern matching in a Function The two-argument function check returns True exactly when both Boolean operands have the same value. Otherwise it returns False. I should implement it using : 1)- Conditional...	[ 0.002288818359375, 0.00799560546875, 0.0098876953125, 0.004302978515625, 0.00897216796875, 0.00958251953125, -0.027099609375, 0.004119873046875, 0.00396728515625, 0.02685546875, 0.00860595703125, -0.0023956298828125, -0.0087890625, -0.01318359375, 0.01385498046875, 0.00799560546875, ...	[ 20625, 142508, 9876, 22766, 14858, 214, 23, 28670, 10763, 1556, 2460, 929, 6626, 155937, 32354, 12765, 30646, 87599, 66161, 3229, 15044, 73783, 34677, 6264, 2208, 765, 5701, 34292, 90825, 22225, 184, 29479, 17368, 4879, 46347, 125195, 78292, ...	[ 0.1544189453125, 0.231201171875, 0.1964111328125, 0.218505859375, 0.257568359375, 0.116943359375, 0.03643798828125, 0.14404296875, 0.007843017578125, 0.139892578125, 0.0904541015625, 0.1904296875, 0.1806640625, 0.2271728515625, 0.132080078125, 0.22265625, 0.1466064453125, 0.1636962...	embed
8360030_c0	8360030	haskell	0	Title: hierarchical data types Problem title: hierarchical data types Tags: haskell Problem: hierarchical data types I would like to define data types hierarchically, such as: data Cat = BigCat \| SmallCat data Animal = Cat \| Dog And then write a function that will take Animals as arguments, and write it with pattern ma...	hierarchical data types hierarchical data types haskell Cat BigCat SmallCat Animal Dog bigger::Animal Bool hierarchical data types I would like to define data types hierarchically, such as: And then write a function that will take Animals as arguments, and write it with pattern matching like this: The compiler complain...	[ 0.00084686279296875, 0.006866455078125, -0.0164794921875, 0.0172119140625, -0.005584716796875, -0.01806640625, -0.005767822265625, -0.00811767578125, -0.0166015625, -0.007415771484375, -0.00144195556640625, -0.0281982421875, 0.0014495849609375, -0.006866455078125, 0.011962890625, -0.00...	[ 1791, 54689, 6827, 2053, 52895, 1556, 142508, 18826, 14195, 76775, 105508, 82821, 41129, 167785, 93, 2749, 2460, 929, 1884, 61924, 59438, 33022, 32354, 5646, 7, 237, 10750, 103510, 14858, 9969, 34759, 186992, 18, 3444, 10644, 143726, 59121, 1...	[ 0.1507568359375, 0.1727294921875, 0.045257568359375, 0.1595458984375, 0.23095703125, 0.15576171875, 0.25048828125, 0.186279296875, 0.0904541015625, 0.1923828125, 0.09307861328125, 0.19384765625, 0.132080078125, 0.1236572265625, 0.0994873046875, 0.0755615234375, 0.05572509765625, 0....	embed
67456386_c0	67456386	haskell	0	Title: Dispatch on union types in Haskell Problem title: Dispatch on union types in Haskell Tags: haskell, types, typeclass Problem: Dispatch on union types in Haskell I'm trying to write a function that is polymorphic on a String or Num argument in Haskell. I've written some pseudocode that doesn't compile: numDigits ...	Dispatch on union types in Haskell Dispatch on union types in Haskell haskell types typeclass Dispatch Haskell Should Dispatch on union types in Haskell I'm trying to write a function that is polymorphic on a String or Num argument in Haskell. I've written some pseudocode that doesn't compile: Note isString and isNum a...	[ -0.0062255859375, 0.0150146484375, -0.0021514892578125, 0.0020751953125, -0.018798828125, 0.000423431396484375, 0.0033721923828125, -0.005584716796875, -0.00341796875, -0.0179443359375, 0.0033416748046875, -0.038818359375, -0.00262451171875, 0.00286865234375, -0.01385498046875, -0.0177...	[ 6206, 4453, 206, 98, 69941, 52895, 20625, 142508, 23, 1556, 10644, 67413, 151117, 31577, 33022, 32354, 35874, 178851, 1771, 23351, 214, 707, 52782, 10750, 59121, 74189, 40899, 22027, 18, 9969, 1340, 83, 71713, 136, 839, 316, 959, 2773, 1660...	[ 0.12060546875, 0.173828125, 0.1219482421875, 0.1165771484375, 0.2330322265625, 0.224365234375, 0.1319580078125, 0.24755859375, 0.043243408203125, 0.1044921875, 0.1827392578125, 0.21484375, 0.0977783203125, 0.010955810546875, 0.054718017578125, 0.1240234375, 0.115966796875, 0.187744...	embed
6883200_c0	6883200	haskell	0	Title: Haskell - add typeclass? Problem title: Haskell - add typeclass? Tags: typeclass, haskell, operator-overloading Problem: Haskell - add typeclass? Consider the following example: data Dot = Dot Double Double data Vector = Vector Double Double First, i would like to overload + operator for Vector addition. If i wa...	Haskell - add typeclass? Haskell - add typeclass? typeclass haskell operator-overloading Haskell Dot Double Vector Add Haskell - add typeclass? Consider the following example: First, i would like to overload + operator for Vector addition. If i wanted to overload equality( == ) operator, i would write it like: But I ca...	[ -0.000782012939453125, 0.0281982421875, 0.001861572265625, 0.033447265625, 0.006317138671875, 0.01055908203125, -0.0042724609375, -0.0054931640625, -0.01708984375, -0.0272216796875, -0.011474609375, -0.046875, 0.00634765625, -0.00567626953125, -0.042236328125, -0.011474609375, -0.010...	[ 20625, 142508, 20, 15190, 10644, 67413, 32, 1556, 39933, 5465, 63033, 214, 84929, 107172, 2609, 18770, 29117, 27781, 1884, 645, 997, 66044, 36663, 28, 161789, 69112, 2806, 33022, 7413, 186, 68991, 678, 41018, 28484, 5303, 3714, 10846, 57143, ...	[ 0.1339111328125, 0.250244140625, 0.05853271484375, 0.1600341796875, 0.1966552734375, 0.275634765625, 0.03643798828125, 0.114990234375, 0.194091796875, 0.107177734375, 0.190185546875, 0.006683349609375, 0.183349609375, 0.1475830078125, 0.159423828125, 0.1683349609375, 0.1151123046875,...	embed
70147390_c0	70147390	haskell	0	Title: How can I return a lambda with guards and double recursion? Problem title: How can I return a lambda with guards and double recursion? Tags: return-type, recursion, lambda, haskell, function Problem: How can I return a lambda with guards and double recursion? I made this function in Python: def calc(a): return l...	How can I return a lambda with guards and double recursion? How can I return a lambda with guards and double recursion? return-type recursion lambda haskell function How How can I return a lambda with guards and double recursion? I made this function in Python: So you can make a calculation like this: And the result wi...	[ -0.010498046875, -0.0024261474609375, 0.0030975341796875, -0.00799560546875, 0.0224609375, -0.0113525390625, -0.0029449462890625, -0.0033111572265625, 0.0167236328125, -0.031982421875, 0.0062255859375, -0.0390625, -0.00921630859375, -0.003631591796875, 0.01123046875, 0.0008430480957031...	[ 11249, 831, 30646, 21, 6492, 85, 678, 56050, 7, 136, 41929, 195625, 1830, 50986, 1556, 142508, 32354, 7228, 145581, 3249, 74481, 1884, 903, 16750, 190, 6165, 20625, 30698, 1124, 366, 184, 18499, 18151, 33342 ]	[ 0.0484619140625, 0.05499267578125, 0.224609375, 0.092529296875, 0.21533203125, 0.189208984375, 0.09521484375, 0.25244140625, 0.113037109375, 0.06414794921875, 0.1683349609375, 0.213134765625, 0.084716796875, 0.171142578125, 0.10076904296875, 0.2203369140625, 0.142578125, 0.00338745...	embed
31590560_c0	31590560	haskell	0	Title: Typeclasses 101: GHC too "eager" to derive instance? Problem title: Typeclasses 101: GHC too "eager" to derive instance? Tags: instances, haskell Problem: Typeclasses 101: GHC too "eager" to derive instance? Given the following code: class C a where foo :: a -> a f :: (C a) => a -> a f = id p...	Typeclasses 101: GHC too "eager" to derive instance? Typeclasses 101: GHC too "eager" to derive instance? instances haskell a Typeclasses GHC Typeclasses 101: GHC too "eager" to derive instance? Given the following code: Now, if I try to invoke p f, GHC complains: I find that somewhat surprising, si...	[ 0.017333984375, 0.0052490234375, 0.0093994140625, 0.00482177734375, 0.013916015625, 0.01153564453125, 0.003631591796875, -0.001861572265625, -0.01171875, -0.02294921875, -0.0166015625, 0.00177001953125, -0.0048828125, -0.000797271728515625, -0.00180816650390625, -0.0164794921875, 0.0...	[ 60457, 67413, 21027, 12, 527, 73265, 5792, 41502, 13, 33730, 122, 5844, 110527, 90, 47, 32, 1556, 142508, 77878, 25632, 18151, 14240, 9790, 23, 23253, 915, 1238, 186992, 7413, 208806, 212615, 4734, 26946, 142, 11, 3129, 10644, 313, 31635, ...	[ 0.18798828125, 0.2257080078125, 0.2022705078125, 0.0184783935546875, 0.1202392578125, 0.2388916015625, 0.141357421875, 0.00982666015625, 0.09765625, 0.2191162109375, 0.107666015625, 0.10791015625, 0.2259521484375, 0.029815673828125, 0.051422119140625, 0.005767822265625, 0.11584472656...	embed
25955495_c0	25955495	haskell	0	Title: Yesod tutorial compile error: Not in scope: ‘runResourceT’ Problem title: Yesod tutorial compile error: Not in scope: ‘runResourceT’ Tags: yesod, haskell Problem: Yesod tutorial compile error: Not in scope: ‘runResourceT’ experts I'm following the Yesod tutorial on fpcomplete (part 3) https://www.fpcomplete.com/...	Yesod tutorial compile error: Not in scope: ‘runResourceT’ Yesod tutorial compile error: Not in scope: ‘runResourceT’ yesod haskell Yesod Not Yesod tutorial compile error: Not in scope: ‘runResourceT’ experts I'm following the Yesod tutorial on fpcomplete (part 3) https://www.fpcomplete.com/school/advanced-haskell/buil...	[ -0.01513671875, 0.01953125, 0.002532958984375, 0.0021209716796875, -0.009033203125, 0.017333984375, -0.00872802734375, -0.007720947265625, -0.01507568359375, -0.048095703125, -0.00823974609375, 0.000011026859283447266, 0.00109100341796875, 0.006744384765625, 0.0184326171875, 0.00625610...	[ 32635, 2199, 57143, 9969, 1340, 18499, 11205, 23, 70820, 16428, 4332, 60427, 618, 2422, 23722, 1556, 142508, 78688, 25632, 277, 131801, 17365, 8439, 48738, 157000, 10557, 146049, 29822, 40294, 22584, 1033, 363, 179933, 13452, 10639, 603, 55376,...	[ 0.1964111328125, 0.247802734375, 0.2110595703125, 0.161376953125, 0.1317138671875, 0.1734619140625, 0.185546875, 0.114013671875, 0.23876953125, 0.1678466796875, 0.1063232421875, 0.1976318359375, 0.18603515625, 0.1048583984375, 0.2069091796875, 0.10040283203125, 0.178466796875, 0.17...	embed
19819557_c0	19819557	haskell	0	Title: Specializing a function for distinctly typed parameters Problem title: Specializing a function for distinctly typed parameters Tags: functional-dependencies, haskell Problem: Specializing a function for distinctly typed parameters I'd like to write a function bar :: Foo a -> Foo b -> Foo c , such that if a and b...	Specializing a function for distinctly typed parameters Specializing a function for distinctly typed parameters functional-dependencies haskell Specializing Foo Bar Specializing a function for distinctly typed parameters I'd like to write a function bar :: Foo a -> Foo b -> Foo c , such that if a and b is the same type...	[ 0.021728515625, -0.00714111328125, -0.01287841796875, -0.01904296875, 0.0025634765625, 0.005828857421875, -0.0169677734375, -0.007049560546875, 0.0172119140625, 0.033447265625, -0.0198974609375, -0.01458740234375, 0.00872802734375, 0.0036468505859375, -0.02294921875, -0.00946044921875,...	[ 25132, 84382, 32354, 100, 117781, 538, 10644, 71, 171859, 123309, 105254, 13, 1556, 142508, 9572, 31, 3253, 1884, 33022, 1909, 1984, 10, 33079, 876, 501, 6044, 450, 2174, 136, 83, 5701, 7068, 111, 120262, 15, 92610, 42548, 117538, 4358, 8...	[ 0.225341796875, 0.115966796875, 0.2125244140625, 0.0997314453125, 0.197509765625, 0.04779052734375, 0.21240234375, 0.0660400390625, 0.1962890625, 0.1395263671875, 0.1175537109375, 0.014434814453125, 0.110107421875, 0.2003173828125, 0.150390625, 0.1287841796875, 0.2071533203125, 0.0...	embed
42988226_c0	42988226	haskell	0	Title: Haskell: test if list length < 4 Problem title: Haskell: test if list length < 4 Tags: haskell Problem: Haskell: test if list length < 4 I have the following haskell function that returns Nothing if the String is shorter than 4 characters: stringToMove :: String -> Maybe Move stringToMove [] = Nothing stri...	Haskell: test if list length < 4 Haskell: test if list length < 4 haskell Haskell Nothing Maybe Move l1:n1:l2:n2:rest Just Haskell: test if list length < 4 I have the following haskell function that returns Nothing if the String is shorter than 4 characters: I could test on length string , but as far as I read, t...	[ -0.0196533203125, 0.0181884765625, 0.00104522705078125, 0.0172119140625, -0.0030517578125, 0.00506591796875, 0.017822265625, 0.0016021728515625, 0.0089111328125, 0.00970458984375, -0.01312255859375, -0.0189208984375, -0.002471923828125, -0.0145263671875, -0.01043701171875, -0.001594543...	[ 20625, 142508, 3034, 2174, 5303, 140909, 1277, 201, 1556, 182747, 83425, 135828, 96, 82825, 304, 56644, 4426, 32354, 30646, 23351, 214, 83, 16610, 56, 3501, 124850, 79315, 959, 3917, 32562, 903, 4989, 756, 151575, 27650, 119140, 12638, 13315 ...	[ 0.13134765625, 0.215087890625, 0.1995849609375, 0.118408203125, 0.185791015625, 0.1527099609375, 0.0274505615234375, 0.193115234375, 0.1268310546875, 0.2113037109375, 0.1544189453125, 0.1910400390625, 0.01434326171875, 0.0195159912109375, 0.017303466796875, 0.1695556640625, 0.0961914...	embed
69412062_c0	69412062	haskell	0	Title: How do I disable `-Werror` only when compiling as a library? Problem title: How do I disable `-Werror` only when compiling as a library? Tags: haskell-stack, haskell Problem: How do I disable `-Werror` only when compiling as a library? I have ghc-options: - -Wall - -Werror in my package.yaml and it builds fine f...	How do I disable `-Werror` only when compiling as a library? How do I disable `-Werror` only when compiling as a library? haskell-stack haskell How Werror Wall package.yaml Wwarn How do I disable `-Werror` only when compiling as a library? I have in my package.yaml and it builds fine for GHC 8.6. But when using the pro...	[ -0.006683349609375, -0.01385498046875, -0.009521484375, -0.013427734375, -0.00927734375, -0.00183868408203125, -0.038818359375, 0.0037689208984375, 0.0078125, 0.017578125, -0.012451171875, -0.037841796875, 0.0223388671875, 0.015625, 0.0032958984375, -0.0069580078125, 0.00239562988281...	[ 11249, 2837, 2886, 9, 1456, 188800, 4734, 3229, 9969, 49725, 237, 35773, 1294, 1556, 142508, 590, 2594, 601, 23706, 98169, 14520, 141, 4205, 19, 9473, 45367, 5885, 527, 73265, 382, 43652, 17368, 13452, 483, 18151, 37382, 18499, 51, 7432, ...	[ 0.1309814453125, 0.1282958984375, 0.2188720703125, 0.07220458984375, 0.1051025390625, 0.33544921875, 0.10552978515625, 0.0865478515625, 0.16162109375, 0.157470703125, 0.1148681640625, 0.180908203125, 0.08612060546875, 0.077880859375, 0.2030029296875, 0.0574951171875, 0.07373046875, ...	embed

69666548_c0

69666548

haskell

0

Title: apply a function n times to the n-th item in a list in haskell Problem title: apply a function n times to the n-th item in a list in haskell Tags: recursion, haskell, higher-order-functions Problem: apply a function n times to the n-th item in a list in haskell I want a higher-order function, g, that will apply ...

apply a function n times to the n-th item in a list in haskell apply a function n times to the n-th item in a list in haskell recursion haskell higher-order-functions apply a function n times to the n-th item in a list in haskell I want a higher-order function, g, that will apply another function, f, to a list of integ...

[ -0.0146484375, 0.00604248046875, 0.004119873046875, -0.0361328125, 0.01275634765625, 0.00080108642578125, -0.002593994140625, -0.00531005859375, 0.008056640625, -0.0224609375, 0.019287109375, -0.01361083984375, 0.00055694580078125, 0.009521484375, 0.000942230224609375, -0.0061950683593...

[ 59911, 32354, 653, 20028, 47, 9, 927, 35735, 23, 5303, 1556, 142508, 195625, 1830, 77546, 80596, 137175, 3444, 706, 1221, 15700, 1238, 892, 26255, 6044, 3714, 831, 22288, 1884, 5809, 2843, 70141, 7440, 14012, 3871, 4527, 18, 5351, 50717, ...

[ 0.169189453125, 0.206298828125, 0.148681640625, 0.218994140625, 0.0771484375, 0.029693603515625, 0.134765625, 0.1387939453125, 0.0521240234375, 0.144775390625, 0.1500244140625, 0.2196044921875, 0.16650390625, 0.1007080078125, 0.113037109375, 0.157470703125, 0.1563720703125, 0.12902...

embed

2448683_c0

2448683

haskell

0

Title: Haskell parsec parsing a string of items Problem title: Haskell parsec parsing a string of items Tags: haskell, parsec Problem: Haskell parsec parsing a string of items I have a list that I need to parse where the all but the last element needs to be parsed by one parser, and the last element needs to be parsed ...

Haskell parsec parsing a string of items Haskell parsec parsing a string of items haskell parsec Haskell p1b parse1 parser1 parse2 parser2 AParse Haskell parsec parsing a string of items I have a list that I need to parse where the all but the last element needs to be parsed by one parser, and the last element needs to...

[ -0.011962890625, 0.0267333984375, -0.01220703125, 0.0439453125, -0.0089111328125, 0.039306640625, -0.004669189453125, -0.014404296875, 0.025146484375, -0.005706787109375, 0.01336669921875, -0.0045166015625, 0.0234375, 0.00885009765625, -0.0196533203125, -0.01043701171875, -0.00677490...

[ 20625, 142508, 366, 39797, 6953, 79315, 111, 55769, 1556, 915, 275, 184, 418, 2189, 304, 28004, 5303, 3871, 1284, 4568, 12830, 27117, 5281, 1632, 15700, 37842, 2967, 831, 18588, 107730, 11343, 64194, 31358, 33720, 3917, 5154, 59911, 47, 268...

[ 0.14599609375, 0.2208251953125, 0.1839599609375, 0.2454833984375, 0.05877685546875, 0.19921875, 0.045013427734375, 0.206787109375, 0.1302490234375, 0.006256103515625, 0.05157470703125, 0.172607421875, 0.10711669921875, 0.1573486328125, 0.13427734375, 0.1488037109375, 0.137451171875, ...

embed

50931355_c0

50931355

haskell

0

Title: How can I test a program reading from stdin in GHCi? Problem title: How can I test a program reading from stdin in GHCi? Tags: interactive, ghci, haskell, testing, io Problem: How can I test a program reading from stdin in GHCi? My program has a bug I want to see within GHCi: $ ./my-program < ./my-data Prelude.f...

How can I test a program reading from stdin in GHCi? How can I test a program reading from stdin in GHCi? interactive ghci haskell testing io stdin System.IO How GHCi Prelude.foldl1 Prelude ReadMode my-program.hs How can I test a program reading from stdin in GHCi? My program has a bug I want to see within GHCi: I trie...

[ -0.0206298828125, -0.00994873046875, 0.00506591796875, 0.00567626953125, -0.001922607421875, 0.0081787109375, 0.0225830078125, -0.00982666015625, -0.00543212890625, -0.05078125, 0.004486083984375, -0.0087890625, -0.020263671875, 0.004730224609375, 0.0191650390625, -0.00909423828125, ...

[ 11249, 831, 87, 3034, 1528, 16454, 1295, 6138, 3035, 23, 527, 73265, 14, 212398, 31380, 318, 1556, 142508, 134234, 22995, 12353, 17780, 1914, 822, 112, 42822, 141, 418, 4764, 9083, 759, 18749, 127, 54608, 1957, 28032, 151134, 2046, 93232, ...

[ 0.043731689453125, 0.057281494140625, 0.054412841796875, 0.2279052734375, 0.18701171875, 0.1746826171875, 0.1146240234375, 0.1619873046875, 0.1937255859375, 0.08453369140625, 0.08587646484375, 0.1370849609375, 0.1893310546875, 0.09326171875, 0.119873046875, 0.1650390625, 0.0932617187...

embed

20131059_c0

20131059

haskell

0

Title: Length l1 +1 => what is one for? Problem title: Length l1 +1 => what is one for? Tags: haskell Problem: Length l1 +1 => what is one for? agrupa :: String -> [(Char,Int)] agrupa [ ] = [ ] agrupa (x:xs) = let (l1, l2) = span' (==x) xs in (x, (length l1) + 1) : agrupa l2 span' :: (a->Bool) -> [a] -> ([a],[a])...

Length l1 +1 => what is one for? Length l1 +1 => what is one for? haskell Length Char x:xs Bool Length l1 +1 => what is one for? this function gets a string and gives us how many of each character are there? my question is related to the 1 in (length l1) + 1 why do we need it? I'd really appreciate if you explain...

[ 0.0026702880859375, 0.024658203125, -0.0172119140625, 0.02880859375, -0.0064697265625, 0.00147247314453125, 0.0037994384765625, -0.01519775390625, 0.01214599609375, -0.0281982421875, -0.0098876953125, -0.00118255615234375, 0.00311279296875, 0.04296875, -0.017578125, 0.0023345947265625,...

[ 77554, 927, 96, 418, 57157, 2203, 5386, 2367, 83, 1632, 100, 1556, 142508, 21656, 1022, 425, 7, 2460, 929, 903, 32354, 62163, 79315, 76199, 1821, 3642, 5941, 12638, 62816, 2685, 9655, 62548, 70, 106, 23, 23986, 17727, 997, 15400, 54, 64...

[ 0.15380859375, 0.1351318359375, 0.1429443359375, 0.1768798828125, 0.220947265625, 0.0177764892578125, 0.0880126953125, 0.08978271484375, 0.0897216796875, 0.1484375, 0.165771484375, 0.1392822265625, 0.24365234375, 0.1614990234375, 0.003448486328125, 0.0266265869140625, 0.0008850097656...

embed

7998458_c0

7998458

haskell

0

Title: Why does this simple use of the State monad cause a stack overflow? Problem title: Why does this simple use of the State monad cause a stack overflow? Tags: monads, stack-overflow, haskell, state-monad Problem: Why does this simple use of the State monad cause a stack overflow? I was playing around with the Stat...

Why does this simple use of the State monad cause a stack overflow? Why does this simple use of the State monad cause a stack overflow? monads stack-overflow haskell state-monad Control.Monad.State.Lazy Why State mapM_ Why does this simple use of the State monad cause a stack overflow? I was playing around with the Sta...

[ -0.00335693359375, -0.00860595703125, 0.006439208984375, -0.01214599609375, -0.0022735595703125, -0.00011920928955078125, -0.0181884765625, -0.00872802734375, 0.00994873046875, -0.049072265625, 0.0186767578125, 0.0107421875, 0.00469970703125, 0.0164794921875, 0.01458740234375, -0.00387...

[ 44084, 14602, 903, 8781, 4527, 22836, 2667, 712, 22304, 10, 177261, 645, 118664, 7, 5465, 1556, 142508, 11341, 3796, 27131, 46674, 135206, 2729, 3285, 22288, 594, 454, 75169, 10932, 3714, 2367, 216806, 70, 63847, 18151, 1884, 2967, 66211, 5...

[ 0.146728515625, 0.0419921875, 0.05145263671875, 0.142822265625, 0.0963134765625, 0.206787109375, 0.1373291015625, 0.1905517578125, 0.1663818359375, 0.05242919921875, 0.198974609375, 0.1241455078125, 0.26513671875, 0.0406494140625, 0.103759765625, 0.08038330078125, 0.1822509765625, ...

embed

30619750_c0

30619750

haskell

0

Title: Haskell-style type families Problem title: Haskell-style type families Tags: type-families, idris, haskell Problem: Haskell-style type families In Haskell, I might write a typeclass with a type declaration to create a type family, like so: class ListLike k where type Elem :: * -> * fromList :: [Elem k] -> k And ...

Haskell-style type families Haskell-style type families type-families idris haskell Haskell-style ListLike Elem Bytestring Char Haskell-style type families In Haskell, I might write a typeclass with a type declaration to create a type family, like so: And then write instances like this: I'm aware that you can create ty...

[ 0.0145263671875, 0.0027313232421875, -0.0142822265625, 0.00048065185546875, -0.0142822265625, 0.006378173828125, 0.006744384765625, -0.0142822265625, -0.01953125, -0.015869140625, -0.01055908203125, -0.0140380859375, -0.01165771484375, 0.0019378662109375, -0.0184326171875, 0.005859375,...

[ 20625, 142508, 40946, 10644, 87143, 69128, 3447, 3679, 1556, 32036, 156607, 195, 3311, 67, 91693, 21656, 13648, 33022, 67413, 678, 21635, 28282, 14449, 1884, 221, 110527, 903, 107419, 831, 136, 67919, 32354, 23, 181545, 70, 150624, 160404, 20...

[ 0.09832763671875, 0.2159423828125, 0.1500244140625, 0.2095947265625, 0.1981201171875, 0.134765625, 0.0234375, 0.12158203125, 0.0860595703125, 0.06915283203125, 0.1483154296875, 0.0582275390625, 0.0305328369140625, 0.029449462890625, 0.09783935546875, 0.05810546875, 0.0728759765625, ...

embed

55026330_c0

55026330

haskell

0

Title: Include sprites into binary -- Gloss library Problem title: Include sprites into binary -- Gloss library Tags: gloss, haskell Problem: Include sprites into binary -- Gloss library I am trying to make a flappy bird game in Haskell and I'd like to know if there's a way to "compile" the .bmp files into the binary? ...

Include sprites into binary -- Gloss library Include sprites into binary -- Gloss library gloss haskell Include Gloss gloss-1.13.0.1 bg0Pic bg0.bmp Include sprites into binary -- Gloss library I am trying to make a flappy bird game in Haskell and I'd like to know if there's a way to "compile" the .bmp files into the bi...

[ -0.009033203125, 0.017822265625, 0.0054931640625, 0.0167236328125, -0.010986328125, 0.0244140625, 0.01251220703125, -0.0157470703125, -0.006439208984375, -0.0302734375, 0.0125732421875, 0.00250244140625, 0.01324462890625, 0.022705078125, 0.017333984375, 0.00665283203125, -0.005157470...

[ 8942, 822, 40988, 1636, 3934, 2394, 6635, 46173, 7, 35773, 207244, 1556, 142508, 5759, 2681, 102014, 11821, 2389, 683, 1771, 275, 2676, 1294, 31577, 3249, 13034, 66433, 263, 71, 6712, 20625, 3917, 58875, 1340, 5, 102158, 12008, 71924, 2886,...

[ 0.07305908203125, 0.118896484375, 0.2371826171875, 0.138916015625, 0.115478515625, 0.19775390625, 0.1630859375, 0.156982421875, 0.1297607421875, 0.1656494140625, 0.232177734375, 0.094970703125, 0.2393798828125, 0.015411376953125, 0.1080322265625, 0.13037109375, 0.032623291015625, 0...

embed

6270324_c0

6270324

haskell

0

Title: In Haskell, how do you trim whitespace from the beginning and end of a string? Problem title: In Haskell, how do you trim whitespace from the beginning and end of a string? Tags: haskell, trim, string, removing-whitespace Problem: In Haskell, how do you trim whitespace from the beginning and end of a string? How...

In Haskell, how do you trim whitespace from the beginning and end of a string? In Haskell, how do you trim whitespace from the beginning and end of a string? haskell trim string removing-whitespace the qualified Haskell Data.Text T.strip In Haskell, how do you trim whitespace from the beginning and end of a string? How...

[ 0.00836181640625, 0.0157470703125, -0.00634765625, 0.0245361328125, -0.0189208984375, 0.0018463134765625, 0.0084228515625, 0.0107421875, 0.012451171875, -0.01361083984375, -0.007568359375, -0.00970458984375, -0.010009765625, 0.01007080078125, -0.00185394287109375, 0.00494384765625, 0...

[ 360, 20625, 142508, 3642, 85247, 35011, 65421, 1295, 86595, 136, 3564, 79315, 111, 1556, 49146, 6496, 148477, 217225, 11809, 174379, 384, 59623, 11249, 4034, 34735, 15659, 16765, 191607, 12921, 23351, 5180, 1884, 7722, 20, 61887, 814, 63033, ...

[ 0.059814453125, 0.12646484375, 0.2349853515625, 0.06182861328125, 0.247314453125, 0.1959228515625, 0.266357421875, 0.065185546875, 0.160400390625, 0.115478515625, 0.165771484375, 0.2371826171875, 0.0173492431640625, 0.1043701171875, 0.103759765625, 0.060638427734375, 0.1622314453125,...

embed

22891947_c0

22891947

haskell

0

Title: haskell newbie whats wrong with this CLI bmiTell function Problem title: haskell newbie whats wrong with this CLI bmiTell function Tags: haskell Problem: haskell newbie whats wrong with this CLI bmiTell function I get parse error on following bmiTell why is that? Prelude> :{ Prelude| let bmiTell :: Double -> Dou...

haskell newbie whats wrong with this CLI bmiTell function haskell newbie whats wrong with this CLI bmiTell function haskell CLI Prelude Double You Pffft Lose haskell newbie whats wrong with this CLI bmiTell function I get parse error on following bmiTell why is that?

[ -0.01300048828125, 0.00173187255859375, 0.0020294189453125, 0.0242919921875, 0.00433349609375, 0.03515625, 0.00095367431640625, -0.0223388671875, 0.00830078125, 0.02490234375, -0.0084228515625, -0.00092315673828125, 0.0191650390625, -0.0167236328125, 0.0169677734375, 0.01495361328125, ...

[ 1556, 142508, 3525, 9014, 2367, 7, 44691, 678, 903, 10927, 876, 266, 618, 6796, 32354, 1914, 822, 112, 107172, 2583, 87360, 125927, 3731, 13, 2046, 366, 184, 18499, 25632, 15400, 83, 450 ]

[ 0.1290283203125, 0.234375, 0.13330078125, 0.1900634765625, 0.03692626953125, 0.010589599609375, 0.180419921875, 0.0889892578125, 0.1141357421875, 0.16015625, 0.0985107421875, 0.2008056640625, 0.1571044921875, 0.2587890625, 0.17626953125, 0.0987548828125, 0.1826171875, 0.04122924804...

embed

23796836_c0

23796836

haskell

0

Title: Couldn't match expected type IO Problem title: Couldn't match expected type IO Tags: haskell, tree Problem: Couldn't match expected type IO -- Binary Search tree data Tree a = Empty | Node a (Tree a) (Tree a) deriving (Eq, Ord, Show) leaf :: a -> Tree a leaf x = Node x Empty Empty insert :: (Ord a) => ...

Couldn't match expected type IO Couldn't match expected type IO haskell tree Couldn Binary Search Tree Empty Node Ord Show Couldn't match expected type IO Error message:

[ 0, -0.007415771484375, 0.0036468505859375, 0.003997802734375, 0.007476806640625, 0.01470947265625, -0.0299072265625, -0.034912109375, -0.010498046875, -0.0189208984375, 0.004791259765625, -0.0390625, -0.0031585693359375, -0.01202392578125, 0.010986328125, 0.005828857421875, 0.0170898...

[ 191147, 19, 3768, 18, 14858, 84751, 10644, 17780, 1556, 142508, 53201, 54092, 1294, 33086, 101344, 31678, 939, 438, 112, 35379, 17367, 212059, 26008 ]

[ 0.0919189453125, 0.01666259765625, 0.06414794921875, 0.0819091796875, 0.1832275390625, 0.1358642578125, 0.1531982421875, 0.1796875, 0.107666015625, 0.1781005859375, 0.1798095703125, 0.1431884765625, 0.032196044921875, 0.1435546875, 0.1810302734375, 0.1318359375, 0.034881591796875, ...

embed

64942087_c0

64942087

haskell

0

Title: Checking for all Elements in a Set in Haskell using syntactic sugar Problem title: Checking for all Elements in a Set in Haskell using syntactic sugar Tags: unique, haskell, syntax, list, list-comprehension Problem: Checking for all Elements in a Set in Haskell using syntactic sugar I try to remove the Integer d...

Checking for all Elements in a Set in Haskell using syntactic sugar Checking for all Elements in a Set in Haskell using syntactic sugar unique haskell syntax list list-comprehension syntactic Checking Elements Set Haskell Checking for all Elements in a Set in Haskell using syntactic sugar I try to remove the Integer du...

[ -0.0169677734375, 0.00836181640625, 0.00872802734375, -0.01031494140625, 0.002227783203125, 0.002471923828125, 0.01019287109375, 0.0002498626708984375, 0, 0.003875732421875, -0.004058837890625, 0.016357421875, 0.01953125, -0.0026397705078125, -0.0233154296875, 0.00811767578125, 0.002...

[ 38679, 214, 100, 756, 48325, 19943, 20625, 142508, 17368, 6002, 102, 49086, 101087, 36998, 1556, 86531, 5303, 3220, 23, 9790, 87388, 44401, 171763, 1636, 32036, 111, 71713, 360, 18, 142027, 110, 23351, 67, 7722, 151575, 1884, 37842, 14373, ...

[ 0.20361328125, 0.0557861328125, 0.1134033203125, 0.10791015625, 0.189697265625, 0.17578125, 0.129150390625, 0.23486328125, 0.017974853515625, 0.1014404296875, 0.1357421875, 0.1019287109375, 0.2183837890625, 0.1407470703125, 0.101318359375, 0.096435546875, 0.0947265625, 0.0214233398...

embed

58487027_c0

58487027

haskell

0

Title: How to fix indentation? Haskell: parse error on input `|' Problem title: How to fix indentation? Haskell: parse error on input `|' Tags: haskell Problem: How to fix indentation? Haskell: parse error on input `|' So I am getting the error: error: parse error on input `|' | x == 'a' = True The code itsel...

How to fix indentation? Haskell: parse error on input `|' How to fix indentation? Haskell: parse error on input `|' haskell AssignmentHelp.Cipher How Haskell SubstitutionCiphers Cipher Boolean x:xs How to fix indentation? Haskell: parse error on input `|' So I am getting the error: The code itself is: I tried...

[ -0.005645751953125, 0.01336669921875, 0.01043701171875, 0.021728515625, 0.0194091796875, 0.0047607421875, -0.0103759765625, -0.0068359375, 0.0235595703125, -0.00054168701171875, -0.00124359130859375, 0.00994873046875, 0.00628662109375, 0.018798828125, -0.00286865234375, -0.016357421875...

[ 11249, 47, 30022, 18597, 22062, 32, 20625, 142508, 12, 366, 184, 18499, 98, 107730, 9473, 58745, 54764, 3768, 1556, 31304, 60785, 254, 94266, 8273, 13480, 73783, 34677, 1022, 425, 20949, 18151, 68034, 83, 37842, 75939, 67842, 12921, 48322, ...

[ 0.073486328125, 0.04705810546875, 0.1849365234375, 0.2041015625, 0.2042236328125, 0.013397216796875, 0.142578125, 0.2489013671875, 0.012054443359375, 0.1536865234375, 0.13916015625, 0.20703125, 0.05889892578125, 0.2017822265625, 0.1619873046875, 0.1785888671875, 0.000244140625, 0.1...

embed

34629132_c0

34629132

haskell

0

Title: How `sequenceA` works Problem title: How `sequenceA` works Tags: haskell, applicative Problem: How `sequenceA` works I'm new to Haskell and trying to understand how does this work? sequenceA [(+3),(+2),(+1)] 3 I have started from the definition sequenceA :: (Applicative f) => [f a] -> f [a] sequenceA [] = pure [...

How `sequenceA` works How `sequenceA` works haskell applicative How Applicative x:xs How `sequenceA` works I'm new to Haskell and trying to understand how does this work? I have started from the definition And then unfolded recursion into this But here i don't understand for which applicative functor operator <*> will ...

[ 0.007080078125, 0.02001953125, -0.0006103515625, 0.041259765625, 0.0068359375, -0.0016326904296875, 0.00433349609375, 0.02099609375, 0.0279541015625, -0.01318359375, 0.0194091796875, 0.00077056884765625, 0.0103759765625, 0.058349609375, 0.014404296875, -0.02734375, 0.01019287109375, ...

[ 11249, 184, 944, 3956, 284, 43240, 1135, 1556, 142508, 41816, 4935, 5659, 11048, 1022, 12, 425, 7, 9473, 3525, 20625, 31577, 28219, 3642, 14602, 4488, 80934, 42822, 195625, 1830, 3688, 2301, 18, 100, 7477, 18770, 39933, 1639, 1221, 35839, ...

[ 0.10565185546875, 0.1070556640625, 0.1669921875, 0.17333984375, 0.2177734375, 0.181396484375, 0.0230712890625, 0.1204833984375, 0.2099609375, 0.1646728515625, 0.1383056640625, 0.1324462890625, 0.16650390625, 0.053985595703125, 0.059661865234375, 0.08477783203125, 0.032470703125, 0....

embed

24271129_c0

24271129

haskell

0

Title: Difference between $ and () Problem title: Difference between $ and () Tags: functional-programming, haskell Problem: Difference between $ and () I started learning Haskell and I encountered a problem I can't just understand. I've got a method used to find value from a list of key-value list (from this page ): l...

Difference between $ and () Difference between $ and () functional-programming haskell Difference Difference between $ and () I started learning Haskell and I encountered a problem I can't just understand. I've got a method used to find value from a list of key-value list (from this page ): I tried fiddling with a bit ...

[ 0.0005340576171875, 0.007171630859375, 0.011474609375, -0.015380859375, 0.004669189453125, 0.0189208984375, -0.010009765625, 0.0208740234375, 0.01458740234375, -0.0206298828125, 0.006683349609375, -0.000370025634765625, -0.001434326171875, 0.003997802734375, -0.0101318359375, 0.0118408...

[ 803, 18234, 6620, 17721, 3650, 136, 15, 16, 123309, 28966, 1556, 142508, 26859, 52080, 20625, 190647, 2967, 831, 28219, 55300, 11814, 7413, 34292, 1295, 5303, 22799, 27494, 37842, 4028, 4785, 2046, 31351, 111, 24092, 22027, 18, 3853, 366, 1...

[ 0.122314453125, 0.2103271484375, 0.08685302734375, 0.155517578125, 0.26806640625, 0.135009765625, 0.1138916015625, 0.04571533203125, 0.1572265625, 0.106689453125, 0.130859375, 0.2286376953125, 0.002960205078125, 0.04937744140625, 0.119873046875, 0.0262908935546875, 0.0615234375, 0....

embed

37701551_c1

37701551

haskell

1

String,String)] zip' xs = zip xs (tail xs) and zip'' :: ([a], [b]) -> [(a, b)] zip'' = \(a,b)->zip a b then ff =zip'' >>= zip' while compiling the code I got an error in the function ff that type do not align. let me re-write the bind signature Monad m => m a -> (a -> m b) -> m b applying ff ["c", "cac", "cb", "bcc", "...

[ 0.0010528564453125, 0.00921630859375, -0.01092529296875, 0.01708984375, 0.00848388671875, 0.00738525390625, -0.00970458984375, -0.024169921875, 0.032470703125, 0.0006561279296875, 0.005645751953125, -0.0147705078125, 0.01239013671875, 0.00982666015625, -0.02880859375, 0.01080322265625,...

[ 23351, 214, 71713, 68330, 25, 1022, 7, 2203, 46741, 136, 4765, 11, 275, 33079, 876, 50836, 26472, 9969, 18151, 18499, 32354, 10644, 54, 959, 143420, 456, 68557, 138256, 60331, 71, 347, 59911, 238, 408, 10060, 402, 217064, 51776, 5303, 306...

[ 0.1676025390625, 0.0963134765625, 0.10491943359375, 0.254638671875, 0.17626953125, 0.11572265625, 0.0888671875, 0.0286407470703125, 0.184814453125, 0.0150146484375, 0.1871337890625, 0.01312255859375, 0.058929443359375, 0.06781005859375, 0.124267578125, 0.193359375, 0.1712646484375, ...

embed

59824578_c0

59824578

haskell

0

Title: Count number of odd digits in Integer Haskell Problem title: Count number of odd digits in Integer Haskell Tags: integer, haskell, int, function Problem: Count number of odd digits in Integer Haskell I'm trying to make program which counts the number of odd digits in integer using Haskell. I have ran into proble...

Count number of odd digits in Integer Haskell Count number of odd digits in Integer Haskell integer haskell int function Count Integer Haskell Count number of odd digits in Integer Haskell I'm trying to make program which counts the number of odd digits in integer using Haskell. I have ran into problem with checking lo...

[ -0.0216064453125, 0.00933837890625, 0.00250244140625, -0.0277099609375, 0.00872802734375, 0.03466796875, -0.01361083984375, 0.00933837890625, 0.0017242431640625, -0.025390625, -0.0032958984375, -0.03662109375, 0.01019287109375, 0.02294921875, 0.0113525390625, -0.0003662109375, 0.0117...

[ 108210, 14012, 111, 70270, 153939, 7, 23, 44401, 20625, 142508, 892, 1505, 1556, 18, 32354, 31577, 1528, 54529, 17368, 13028, 3934, 2967, 175199, 51713, 26255, 33342, 1884, 903, 3095, 4263, 27781, 122216, 132993, 11663, 5608, 30646, 34292, 20...

[ 0.17236328125, 0.1177978515625, 0.04669189453125, 0.2393798828125, 0.205078125, 0.05853271484375, 0.079833984375, 0.2235107421875, 0.1766357421875, 0.2353515625, 0.12646484375, 0.1146240234375, 0.13916015625, 0.0814208984375, 0.1005859375, 0.02423095703125, 0.12939453125, 0.1339111...

embed

39173846_c0

39173846

haskell

0

Title: Haskell MonadError Problem title: Haskell MonadError Tags: error-handling, monads, haskell Problem: Haskell MonadError I was looking at a tutorial on monads in haskell i came across this type class: class (Monad m) => MonadError e m | m -> e where throwError :: e -> m a catchError :: m a -> (e -> m a) -> m a I w...

Haskell MonadError Haskell MonadError error-handling monads haskell MonadError throwError catchError Haskell Monad Either Left Haskell MonadError I was looking at a tutorial on monads in haskell i came across this type class: I was wondering why the type parameters are e then m, i would have thought it would be m then ...

[ 0.0005950927734375, 0.007080078125, -0.00017070770263671875, -0.000125885009765625, -0.004486083984375, 0.007171630859375, -0.0240478515625, -0.021728515625, -0.004638671875, -0.002960205078125, 0.0030670166015625, -0.0419921875, 0.006805419921875, -0.0223388671875, 0.005523681640625, ...

[ 20625, 142508, 60331, 71, 18468, 31611, 18499, 54885, 2667, 712, 1556, 104250, 105556, 636, 2480, 57143, 36880, 10644, 18507, 149016, 15400, 171859, 621, 28, 7068, 347, 2806, 17569, 110527, 64549, 748, 40101, 21449, 5117, 21635, 101089, 297 ]

[ 0.11279296875, 0.236572265625, 0.186279296875, 0.084228515625, 0.095703125, 0.029754638671875, 0.147216796875, 0.10400390625, 0.1058349609375, 0.1522216796875, 0.116455078125, 0.0880126953125, 0.08538818359375, 0.0188446044921875, 0.1072998046875, 0.05877685546875, 0.00543212890625, ...

embed

50128894_c1

50128894

haskell

1

, 1)] [(b, 1)]) | ^^^^^^^^ src\View.hs:70:43: error: * Couldn't match type `[(Coord, Integer)]' with `(Double, Double)' Expected type: Point Actual type: [(Coord, Integer)] * In the second argument of `Rectangle', namely `[(b, 1)]' In the expression: (Rectangle [(a, 1)] [(b, 1)]) In an equation for `rectangleRaster': r...

[ -0.01104736328125, 0.00836181640625, 0.01544189453125, -0.003021240234375, 0.01275634765625, 0.0191650390625, -0.03759765625, -0.0185546875, 0.004119873046875, 0.006622314453125, -0.002685546875, -0.0179443359375, 0.005645751953125, -0.03466796875, -0.0157470703125, -0.0086669921875, ...

[ 4, 4879, 268, 275, 58745, 16377, 15729, 19437, 100474, 127, 7, 5757, 33210, 18499, 191147, 18, 14858, 10644, 10625, 6651, 44401, 678, 8331, 34, 2661, 107172, 60075, 13, 41097, 100582, 17932, 10750, 1052, 24762, 109217, 125195, 11, 5490, 173...

[ 0.0207061767578125, 0.1141357421875, 0.01544189453125, 0.1011962890625, 0.0205841064453125, 0.0113525390625, 0.0204925537109375, 0.1124267578125, 0.254638671875, 0.08734130859375, 0.00152587890625, 0.09686279296875, 0.125732421875, 0.1728515625, 0.13134765625, 0.084716796875, 0.20092...

embed

20388293_c0

20388293

haskell

0

Title: Haskell generics with unique ids Problem title: Haskell generics with unique ids Tags: haskell, generics, functional-programming, types Problem: Haskell generics with unique ids I've been using Uniplate for a while, but I find the lack ability to identify a node to make things more difficult for me. Is there a g...

Haskell generics with unique ids Haskell generics with unique ids haskell generics functional-programming types Haskell Data Haskell generics with unique ids I've been using Uniplate for a while, but I find the lack ability to identify a node to make things more difficult for me. Is there a generics implementation that...

[ -0.010498046875, 0.005279541015625, 0.01318359375, -0.01544189453125, 0.009033203125, 0.0036773681640625, 0.0038909912109375, -0.013671875, 0.00335693359375, -0.050048828125, -0.00921630859375, -0.02490234375, 0.0012969970703125, 0.006683349609375, -0.025390625, -0.006011962890625, 0...

[ 20625, 142508, 189534, 7, 678, 36998, 3447, 1556, 123309, 28966, 52895, 11809, 17368, 11789, 92558, 12960, 7413, 92635, 81273, 47, 135812, 110, 112, 3249, 1286, 34844, 2685, 208124, 114864, 89931, 27781, 61687, 2806, 41206, 6044 ]

[ 0.1148681640625, 0.2181396484375, 0.265625, 0.100341796875, 0.0704345703125, 0.2161865234375, 0.20458984375, 0.1175537109375, 0.1439208984375, 0.098388671875, 0.124755859375, 0.0892333984375, 0.015869140625, 0.07867431640625, 0.2269287109375, 0.02984619140625, 0.059417724609375, 0....

embed

9856293_c0

9856293

haskell

0

Title: Looking for a generic `bisect` function Problem title: Looking for a generic `bisect` function Tags: haskell Problem: Looking for a generic `bisect` function I am looking for a bisect operation in Haskell similar to Python's bisect_left() and friends. The input would be a lower bound, an upper bound, a non-decre...

Looking for a generic `bisect` function Looking for a generic `bisect` function haskell Looking bisect_left search_term Ord Looking for a generic `bisect` function I am looking for a bisect operation in Haskell similar to Python's bisect_left() and friends. The input would be a lower bound, an upper bound, a non-decrea...

[ -0.026611328125, 0.0106201171875, 0.03271484375, -0.02197265625, -0.0191650390625, 0.0111083984375, 0.01446533203125, -0.029296875, 0.0115966796875, -0.0081787109375, 0.00634765625, -0.000667572021484375, -0.00347900390625, 0.0198974609375, -0.00799560546875, -0.0224609375, 0.0107421...

[ 157268, 100, 189534, 6454, 24762, 32354, 1556, 142508, 2464, 133, 2480, 33938, 32166, 35379, 16487, 41018, 20625, 21373, 145581, 23902, 107730, 2806, 92319, 99091, 1407, 56, 351, 50718, 1283, 143045, 10, 2740, 18, 103607, 11, 8110, 61924, 756...

[ 0.0860595703125, 0.060302734375, 0.23974609375, 0.15234375, 0.25390625, 0.192138671875, 0.125244140625, 0.2396240234375, 0.1378173828125, 0.0611572265625, 0.126220703125, 0.2012939453125, 0.147705078125, 0.1776123046875, 0.059234619140625, 0.1602783203125, 0.1248779296875, 0.028411...

embed

33049458_c0

33049458

haskell

0

Title: Why is `[1, "a"] :: [forall a. Show a => a]` not allowed? Problem title: Why is `[1, "a"] :: [forall a. Show a => a]` not allowed? Tags: existential-type, haskell, higher-rank-types, polymorphism, typeclass Problem: Why is `[1, "a"] :: [forall a. Show a => a]` not allowed? In my (might ...

Why is `[1, "a"] :: [forall a. Show a => a]` not allowed? Why is `[1, "a"] :: [forall a. Show a => a]` not allowed? existential-type haskell higher-rank-types polymorphism typeclass Why Show ExistentialQuantification Why is `[1, "a"] :: [forall a. Show a => a]` not allowed? In my (might incorr...

[ -0.00439453125, 0.003997802734375, -0.00933837890625, 0.0030975341796875, -0.00848388671875, -0.00860595703125, 0.01123046875, -0.003021240234375, 0.01708984375, -0.014892578125, 0.0054931640625, -0.026123046875, 0.01220703125, 0.008056640625, -0.0196533203125, -0.023681640625, 0.008...

[ 44084, 83, 9473, 418, 41502, 11, 1230, 1984, 5584, 10, 17367, 2203, 5386, 959, 107003, 2472, 99707, 15403, 50986, 1556, 142508, 36467, 35874, 178851, 10644, 67413, 122688, 118, 289, 173495, 18, 41274, 1065, 4, 44357, 6626, 5303, 183234, 681...

[ 0.1312255859375, 0.020660400390625, 0.0369873046875, 0.099609375, 0.040802001953125, 0.1392822265625, 0.04437255859375, 0.10546875, 0.12548828125, 0.1317138671875, 0.2003173828125, 0.010833740234375, 0.0723876953125, 0.09912109375, 0.173095703125, 0.04931640625, 0.14404296875, 0.02...

embed

60908984_c0

60908984

haskell

0

Title: GHCI swears on "=" symbol Problem title: GHCI swears on "=" symbol Tags: haskell Problem: GHCI swears on "=" symbol The purpose was to sort the list of tuples (names) by tuple's 2nd element. module Learn where import Data.List names = [("Ian", "Curtis"),("Bernard","Sumner"),("Peter","Hook"),(...

GHCI swears on "=" symbol GHCI swears on "=" symbol haskell Data.List GHCI Learn Ian Curtis Bernard Sumner Peter Hook Stephen Morris name1 name2 lastName1 lastName2 GHCI swears on "=" symbol The purpose was to sort the list of tuples (names) by tuple's 2nd element. then I would call GHCI doesnt want...

[ 0.00811767578125, 0.0067138671875, 0.00225830078125, -0.02197265625, -0.0064697265625, 0.0069580078125, 0.0020599365234375, 0.01385498046875, 0.0059814453125, 0.00494384765625, 0.0208740234375, -0.00616455078125, 0.01611328125, -0.00171661376953125, 0.001312255859375, -0.00248718261718...

[ 41877, 17304, 52113, 21816, 98, 74, 1369, 1230, 26582, 1556, 142508, 11809, 5, 154663, 134031, 104870, 17065, 1814, 56159, 36335, 1679, 7948, 2291, 685, 56174, 119537, 9351, 304, 4568, 163612, 44, 22422, 60042, 509, 12096, 5303, 111, 370, 9...

[ 0.184814453125, 0.2474365234375, 0.2099609375, 0.1077880859375, 0.1807861328125, 0.0203857421875, 0.1282958984375, 0.0185699462890625, 0.26611328125, 0.131591796875, 0.22216796875, 0.1171875, 0.005950927734375, 0.147705078125, 0.100341796875, 0.08447265625, 0.007598876953125, 0.120...

embed

64322905_c0

64322905

haskell

0

Title: Arguments not needed when using foldl in haskell? Problem title: Arguments not needed when using foldl in haskell? Tags: foldleft, arguments, haskell Problem: Arguments not needed when using foldl in haskell? What I don't get is how it is possible to use foldl in this way in haskell. I do not understand how the ...

Arguments not needed when using foldl in haskell? Arguments not needed when using foldl in haskell? foldleft arguments haskell foldl Arguments Arguments not needed when using foldl in haskell? What I don't get is how it is possible to use foldl in this way in haskell. I do not understand how the argument ( in this case...

[ 0.0028228759765625, 0.006103515625, 0.0164794921875, 0.01080322265625, -0.0074462890625, 0.01165771484375, -0.0029754638671875, -0.00836181640625, -0.000339508056640625, -0.0203857421875, 0.01080322265625, -0.045654296875, -0.00469970703125, 0.0233154296875, 0.00640869140625, -0.030273...

[ 112140, 7, 959, 44841, 17368, 18344, 20469, 23, 1556, 142508, 19298, 2480, 10750, 2301, 18, 2046, 7722, 4527, 903, 3917, 28219, 5303, 175100, 645, 165164, 27781, 151575, 1884 ]

[ 0.2371826171875, 0.027801513671875, 0.0777587890625, 0.1358642578125, 0.0631103515625, 0.1417236328125, 0.210205078125, 0.0239715576171875, 0.10498046875, 0.196044921875, 0.041595458984375, 0.1268310546875, 0.2171630859375, 0.001861572265625, 0.0128173828125, 0.031158447265625, 0.063...

embed

11296157_c0

11296157

haskell

0

Title: How has Haskell changed? Problem title: How has Haskell changed? Tags: haskell Problem: How has Haskell changed? When I first learned Haskell, Haskell '98 was the official published language specification. Today, that specification is Haskell 2010. (I have to admit, I have a really hard time remembering what the...

How has Haskell changed? How has Haskell changed? haskell How Haskell How has Haskell changed? When I first learned Haskell, Haskell '98 was the official published language specification. Today, that specification is Haskell 2010. (I have to admit, I have a really hard time remembering what the heck the differences act...

[ 0.01239013671875, 0.0086669921875, 0.018798828125, 0.02294921875, 0.00927734375, 0.0086669921875, -0.0172119140625, -0.0142822265625, 0.009765625, 0.032958984375, -0.009033203125, -0.0208740234375, -0.01446533203125, 0.013671875, 0.00579833984375, 0.007568359375, -0.006988525390625, ...

[ 11249, 1556, 20625, 142508, 98816, 32, 14847, 5117, 97384, 16665, 509, 51521, 91376, 46876, 29458, 2320, 38396, 15431, 36456, 6183, 7941, 1733, 37629, 764, 2594, 60212, 20653, 14240, 2809, 10932, 4989, 242122, 149016, 31901, 13036, 4331, 65572,...

[ 0.1529541015625, 0.201416015625, 0.1962890625, 0.29443359375, 0.2403564453125, 0.014739990234375, 0.00396728515625, 0.1112060546875, 0.1549072265625, 0.2310791015625, 0.01739501953125, 0.1580810546875, 0.1142578125, 0.1959228515625, 0.1798095703125, 0.07421875, 0.09912109375, 0.186...

embed

27387853_c0

27387853

haskell

0

Title: How can I produce a fixed length of numbers that sum up a given number in Haskell Problem title: How can I produce a fixed length of numbers that sum up a given number in Haskell Tags: haskell Problem: How can I produce a fixed length of numbers that sum up a given number in Haskell I'm new to haskell world and ...

How can I produce a fixed length of numbers that sum up a given number in Haskell How can I produce a fixed length of numbers that sum up a given number in Haskell haskell How Haskell How can I produce a fixed length of numbers that sum up a given number in Haskell I'm new to haskell world and wanted to know, given any...

[ -0.0228271484375, 0.0230712890625, -0.00335693359375, 0.0242919921875, -0.01519775390625, 0.016845703125, -0.01806640625, 0.00982666015625, 0.01611328125, -0.019775390625, -0.021728515625, -0.032470703125, 0.0125732421875, 0.0218505859375, -0.01080322265625, -0.002044677734375, 0.003...

[ 11249, 831, 27489, 188347, 140909, 101935, 450, 10554, 1257, 34475, 14012, 23, 20625, 142508, 87, 111, 1556, 10, 3525, 8999, 3714, 2499, 24491, 892, 153939, 17721, 106, 15205, 3642, 7413, 162515, 3934, 1505, 17368, 62952, 201, 6626, 33636, ...

[ 0.0906982421875, 0.0992431640625, 0.2259521484375, 0.263427734375, 0.20166015625, 0.2069091796875, 0.0546875, 0.223388671875, 0.1519775390625, 0.0980224609375, 0.1427001953125, 0.059906005859375, 0.153564453125, 0.2509765625, 0.05218505859375, 0.0416259765625, 0.1324462890625, 0.00...

embed

43010618_c0

43010618

haskell

0

Title: IO error when executing runhaskell Problem title: IO error when executing runhaskell Tags: haskell Problem: IO error when executing runhaskell I'm trying to execute a main method within one of my classes in haskell. When I run the command runhaskell mod12PA.hs I get an error and I can't figure out why. Here's th...

IO error when executing runhaskell IO error when executing runhaskell haskell stdin mod12PA.hs SVG Enter Points Variable mod12PA IO error when executing runhaskell I'm trying to execute a main method within one of my classes in haskell. When I run the command runhaskell mod12PA.hs I get an error and I can't figure out ...

[ -0.0087890625, 0.00872802734375, -0.003021240234375, 0.01190185546875, 0.006744384765625, 0.03076171875, -0.002288818359375, -0.017822265625, -0.0130615234375, -0.025390625, 0.00927734375, -0.034912109375, 0.0166015625, -0.0224609375, 0.0022430419921875, -0.0074462890625, 0.000329971...

[ 17780, 18499, 3229, 71924, 214, 11675, 10557, 142508, 1556, 6138, 3035, 2811, 1530, 12236, 127, 79855, 60816, 41097, 84572, 31577, 5201, 55300, 28032, 61112, 14847, 75101, 831, 26366, 15400, 11853, 18151 ]

[ 0.25390625, 0.20947265625, 0.068359375, 0.187255859375, 0.03533935546875, 0.146728515625, 0.156494140625, 0.26904296875, 0.1466064453125, 0.08770751953125, 0.1400146484375, 0.1961669921875, 0.1578369140625, 0.2159423828125, 0.1336669921875, 0.199951171875, 0.1158447265625, 0.164062...

embed

44964917_c0

44964917

haskell

0

Title: How to communicate among two callbacks? Problem title: How to communicate among two callbacks? Tags: haskell Problem: How to communicate among two callbacks? AS an introduction to the language, I am writing a simple sound recorder, using sdl2 and wave SDL is successfully calling my audio callback. Trouble is, I ...

How to communicate among two callbacks? How to communicate among two callbacks? haskell How AudioFormat IOVector Handle How to communicate among two callbacks? AS an introduction to the language, I am writing a simple sound recorder, using sdl2 and wave SDL is successfully calling my audio callback. Trouble is, I have ...

[ -0.006072998046875, 0.0033416748046875, -0.0257568359375, 0.025146484375, -0.007781982421875, 0.0140380859375, -0.0118408203125, -0.007598876953125, 0.0002727508544921875, -0.02392578125, 0.00823974609375, -0.0341796875, 0.01007080078125, 0.0196533203125, -0.01165771484375, -0.01843261...

[ 11249, 47, 127219, 67, 54940, 6626, 11782, 12620, 7, 1556, 142508, 32134, 102973, 257, 87, 31719, 13, 18770, 10639, 133, 39864, 46876, 32562, 8781, 45730, 17164, 56, 17368, 91, 20469, 304, 259, 272, 159, 27502, 65771, 159029, 18215, 119671,...

[ 0.1181640625, 0.0791015625, 0.2161865234375, 0.10009765625, 0.211181640625, 0.2000732421875, 0.2010498046875, 0.263671875, 0.0249786376953125, 0.1397705078125, 0.2103271484375, 0.1519775390625, 0.18017578125, 0.04052734375, 0.1207275390625, 0.11083984375, 0.1419677734375, 0.1625976...

embed

10645137_c0

10645137

haskell

0

Title: Haskell: Num instance of non-concrete type Problem title: Haskell: Num instance of non-concrete type Tags: typeclass, instance, types, haskell Problem: Haskell: Num instance of non-concrete type data Vector a = Vector a a a deriving (Eq, Show) instance Functor Vector where fmap f (Vector x y z) = Vector (f x) (f...

Haskell: Num instance of non-concrete type Haskell: Num instance of non-concrete type typeclass instance types haskell Haskell Num Vector Show Functor Integer Float Double Haskell: Num instance of non-concrete type So far so good. Doesn't work. I tried many different variations on that first line but GHC keeps complain...

[ -0.0050048828125, 0.00823974609375, 0.01092529296875, 0.003631591796875, -0.000286102294921875, 0.0218505859375, -0.00689697265625, -0.01177978515625, 0.004150390625, -0.00823974609375, -0.0390625, -0.03857421875, 0.007293701171875, 0.00799560546875, -0.0306396484375, 0.00299072265625,...

[ 20625, 142508, 52782, 110527, 351, 2271, 7612, 10644, 12, 111, 67, 67413, 52895, 1556, 2609, 18770, 17367, 28670, 44401, 38699, 257, 107172, 2060, 4127, 101790, 18, 4488, 37842, 5941, 12921, 143834, 5117, 13315, 527, 73265, 13695, 186992, 344...

[ 0.15185546875, 0.26318359375, 0.295166015625, 0.2841796875, 0.2015380859375, 0.053863525390625, 0.179931640625, 0.184814453125, 0.0203094482421875, 0.048919677734375, 0.0604248046875, 0.1204833984375, 0.14404296875, 0.136474609375, 0.2171630859375, 0.235595703125, 0.1280517578125, ...

embed

34652000_c0

34652000

haskell

0

Title: How to clean leftover files from a cabal build? Problem title: How to clean leftover files from a cabal build? Tags: cabal, haskell Problem: How to clean leftover files from a cabal build? I'm a complete noob at developer stuff. I've recently had to install Gitit https://github.com/jgm/gitit using cabal as they ...

How to clean leftover files from a cabal build? How to clean leftover files from a cabal build? cabal haskell a How github.com Directory DIR x86_64-windows-ghc-7.10.3 x86_64-windows-ghc-7.10.3-packages.conf.d File How to clean leftover files from a cabal build? I'm a complete noob at developer stuff. I've recently had ...

[ 0.00408935546875, 0.01531982421875, 0.0084228515625, 0.01806640625, -0.01519775390625, 0.007049560546875, 0.00762939453125, -0.0093994140625, 0.015869140625, 0.0341796875, -0.017333984375, -0.02392578125, 0.0064697265625, 0.0162353515625, -0.0224609375, -0.0035552978515625, -0.003280...

[ 11249, 47, 46622, 25737, 5465, 102158, 1295, 109524, 45367, 10, 1556, 142508, 62270, 32102, 277, 31068, 53, 123237, 15276, 13307, 229792, 9486, 238, 16709, 10179, 363, 27495, 29102, 70547, 5, 71, 42724, 28484, 110, 3522, 106001, 20600, 5174, ...

[ 0.08331298828125, 0.06268310546875, 0.2490234375, 0.1861572265625, 0.22314453125, 0.2069091796875, 0.1251220703125, 0.274658203125, 0.2025146484375, 0.0270843505859375, 0.10791015625, 0.197509765625, 0.1473388671875, 0.2159423828125, 0.04595947265625, 0.1131591796875, 0.0323181152343...

embed

15102689_c0

15102689

haskell

0

Title: Finding out lambda calculus/haskell type of some example Problem title: Finding out lambda calculus/haskell type of some example Tags: lambda-calculus, haskell, lambda Problem: Finding out lambda calculus/haskell type of some example Suppose that the function gets as its input two variables of different types (e...

Finding out lambda calculus/haskell type of some example Finding out lambda calculus/haskell type of some example lambda-calculus haskell lambda Finding Char Finding out lambda calculus/haskell type of some example Suppose that the function gets as its input two variables of different types (e.g. one variable is int in...

[ 0.017822265625, -0.00099945068359375, 0.0062255859375, 0.0198974609375, -0.00087738037109375, 0.0162353515625, 0.01324462890625, -0.0023193359375, -0.0162353515625, -0.00054931640625, 0.0113525390625, -0.041259765625, -0.00007152557373046875, 0.00579833984375, -0.0086669921875, 0.00177...

[ 26040, 1810, 21, 6492, 85, 44805, 223, 64, 10557, 142508, 10644, 27781, 3060, 6827, 94739, 1556, 21656, 32354, 62163, 107730, 6626, 77336, 12921, 52895, 23, 18, 46876, 313, 21441, 30646, 1632, 360, 18151, 20625, 139124, 84068, 33079, 2806, ...

[ 0.06329345703125, 0.04925537109375, 0.059112548828125, 0.1810302734375, 0.1143798828125, 0.2125244140625, 0.1302490234375, 0.03704833984375, 0.1226806640625, 0.25634765625, 0.2174072265625, 0.201904296875, 0.0010986328125, 0.117919921875, 0.1456298828125, 0.118408203125, 0.1566162109...

embed

16810446_c0

16810446

haskell

0

Title: Is there a Fibonacci heap based priority queue for Haskell? Problem title: Is there a Fibonacci heap based priority queue for Haskell? Tags: fibonacci-heap, haskell, priority-queue Problem: Is there a Fibonacci heap based priority queue for Haskell? Is there a Fibonacci heap/priority queue available for Haskell?...

Is there a Fibonacci heap based priority queue for Haskell? Is there a Fibonacci heap based priority queue for Haskell? fibonacci-heap haskell priority-queue Fibonacci Haskell Is there a Fibonacci heap based priority queue for Haskell? Is there a Fibonacci heap/priority queue available for Haskell? (Or even an asymptot...

[ 0.01470947265625, 0.00162506103515625, 0.00148773193359375, -0.01092529296875, -0.0023040771484375, 0.005706787109375, -0.004058837890625, -0.033203125, -0.00439453125, -0.01171875, 0.007171630859375, -0.00970458984375, 0.022705078125, 0.003265380859375, 0.00775146484375, 0.00069808959...

[ 2071, 2685, 10, 3698, 20990, 52544, 764, 2631, 35509, 25343, 53, 41, 13388, 100, 20625, 142508, 809, 1106, 1556, 944, 207184, 939, 19882, 2676, 21737, 11522, 208124, 40407, 201141, 51042, 1733, 17305, 6423, 26040, 9222, 24105, 180, 27750, 1...

[ 0.03125, 0.088134765625, 0.05279541015625, 0.125244140625, 0.182373046875, 0.1910400390625, 0.1646728515625, 0.178955078125, 0.15283203125, 0.2083740234375, 0.095703125, 0.16455078125, 0.1629638671875, 0.040283203125, 0.1495361328125, 0.2685546875, 0.064208984375, 0.13818359375, ...

embed

52218662_c0

52218662

haskell

0

Title: Parse Json Rose Tree with Haskell Aeson Problem title: Parse Json Rose Tree with Haskell Aeson Tags: haskell, json, aeson Problem: Parse Json Rose Tree with Haskell Aeson I'm trying to parse recursive JSON data, something like this: { "node": "a", "children": [ { "node": "b", "children": [ { "node": "c", "childr...

Parse Json Rose Tree with Haskell Aeson Parse Json Rose Tree with Haskell Aeson haskell json aeson Parse Json Rose Tree Haskell Aeson Node Text Nothing Parse Json Rose Tree with Haskell Aeson I'm trying to parse recursive JSON data, something like this: Now I want to implement an instance of FromJSON, so that I can dec...

[ 0.00156402587890625, 0.003173828125, -0.0201416015625, 0.0228271484375, -0.021728515625, 0.0162353515625, 0.00738525390625, -0.0037078857421875, -0.0064697265625, -0.0196533203125, -0.0189208984375, 0.0103759765625, 0.0010223388671875, 0.00799560546875, 0.0107421875, -0.0103759765625, ...

[ 2392, 184, 821, 1681, 24009, 101344, 678, 20625, 142508, 62, 90, 191, 1556, 1647, 10, 438, 112, 24129, 182747, 31577, 366, 195625, 5844, 58627, 2053, 1884, 903, 3444, 29479, 110527, 28090, 1375, 8, 40899, 3934, 45646, 25632, 110, 29786, 2...

[ 0.1375732421875, 0.05535888671875, 0.1346435546875, 0.1859130859375, 0.18603515625, 0.2332763671875, 0.087646484375, 0.1083984375, 0.181640625, 0.099853515625, 0.1109619140625, 0.1552734375, 0.09466552734375, 0.052154541015625, 0.02777099609375, 0.069091796875, 0.06451416015625, 0....

embed

46920723_c0

46920723

haskell

0

Title: Keeping a value during a recursive function Problem title: Keeping a value during a recursive function Tags: recursion, haskell Problem: Keeping a value during a recursive function In Haskell, I'm trying to solve a problem where I need to have a function that receives a list of integers and returns the biggest p...

Keeping a value during a recursive function Keeping a value during a recursive function recursion haskell Keeping x1:x2:xs Keeping a value during a recursive function In Haskell, I'm trying to solve a problem where I need to have a function that receives a list of integers and returns the biggest product of two adjacen...

[ -0.0181884765625, 0.0159912109375, -0.0096435546875, 0.00665283203125, -0.0084228515625, 0.0048828125, -0.0027618408203125, 0.000865936279296875, 0.021484375, -0.0247802734375, 0.026611328125, 0.0208740234375, 0.000522613525390625, 0.00732421875, 0.0162353515625, 0.006500244140625, 0...

[ 83041, 214, 34292, 20271, 195625, 5844, 32354, 1830, 1556, 142508, 1022, 82825, 425, 304, 12, 7, 20625, 31577, 86869, 2967, 3871, 53299, 5303, 892, 26255, 30646, 129058, 12996, 6626, 123594, 16797, 101935, 89536, 1238, 104629, 125157, 2806, 4...

[ 0.2244873046875, 0.0089111328125, 0.22021484375, 0.1689453125, 0.23046875, 0.15673828125, 0.2000732421875, 0.1158447265625, 0.1317138671875, 0.2335205078125, 0.091064453125, 0.106689453125, 0.1226806640625, 0.1300048828125, 0.0170135498046875, 0.03546142578125, 0.12548828125, 0.038...

embed

66641316_c0

66641316

haskell

0

Title: Data type parametrized by constant in Haskell Problem title: Data type parametrized by constant in Haskell Tags: data-kinds, dependent-type, haskell, parameterized-types, types Problem: Data type parametrized by constant in Haskell I would like to define a data type in Haskell which is parametrized by an Int con...

Data type parametrized by constant in Haskell Data type parametrized by constant in Haskell data-kinds dependent-type haskell parameterized-types types Data Haskell Data type parametrized by constant in Haskell I would like to define a data type in Haskell which is parametrized by an Int constant along the lines: data ...

[ 0.00244140625, 0.0135498046875, 0.0101318359375, -0.01483154296875, 0.018310546875, -0.005279541015625, -0.01495361328125, -0.0062255859375, -0.00823974609375, -0.0296630859375, -0.002777099609375, -0.046142578125, 0.00604248046875, 0.010498046875, -0.020263671875, 0.006866455078125, ...

[ 11809, 10644, 39850, 29367, 390, 53697, 20625, 142508, 23, 2053, 68347, 108750, 50986, 1556, 171859, 52895, 1884, 61924, 83, 360, 18, 33233, 124519, 2396, 19, 1984, 2203, 653, 4153, 4210, 351, 174796, 18151, 32354, 6528, 173072, 66044, 765, ...

[ 0.1490478515625, 0.24755859375, 0.222900390625, 0.07763671875, 0.0650634765625, 0.22216796875, 0.14794921875, 0.234619140625, 0.03167724609375, 0.182373046875, 0.1007080078125, 0.1536865234375, 0.22265625, 0.126708984375, 0.1842041015625, 0.16259765625, 0.031951904296875, 0.1621093...

embed

57782279_c1

57782279

haskell

1

looks good: $ stack ide targets RestaurantReservation:lib RestaurantReservation:exe:RestaurantReservation RestaurantReservation:test:RestaurantReservation-test This used to work on Windows 10 before I repaved the machine, but now it doesn't. Since it worked before re-installation, I'm hoping that there's some environm...

[ -0.006591796875, 0.00396728515625, 0.00860595703125, 0.0169677734375, 0.00384521484375, 0.0206298828125, -0.0269775390625, -0.024169921875, 0.00104522705078125, 0.031494140625, 0.000385284423828125, -0.00927734375, -0.0108642578125, 0.0113525390625, 0.00167083740234375, -0.017211914062...

[ 33342, 4127, 3650, 177261, 5415, 30388, 7, 28660, 65756, 5612, 1363, 46480, 590, 14952, 6954, 11814, 4488, 3773, 209, 8108, 10958, 11, 36279, 5036, 22027, 18, 79786, 456, 105348, 156377, 65998, 53550, 77488, 123309, 4420, 34735, 3249, 144483,...

[ 0.1448974609375, 0.1182861328125, 0.162841796875, 0.204345703125, 0.2005615234375, 0.29833984375, 0.1068115234375, 0.1767578125, 0.1507568359375, 0.1378173828125, 0.004180908203125, 0.086669921875, 0.029144287109375, 0.057098388671875, 0.15185546875, 0.0513916015625, 0.1103515625, ...

embed

43577758_c0

43577758

haskell

0

Title: Trying to convert a list of data records to a hashmap Problem title: Trying to convert a list of data records to a hashmap Tags: haskell Problem: Trying to convert a list of data records to a hashmap Here is the code: import Data.HashMap.Lazy as H data Connections = Connections { connectionName :: String , cfgPr...

Trying to convert a list of data records to a hashmap Trying to convert a list of data records to a hashmap haskell Data.HashMap.Lazy Trying Connections Object Show Generic HashMap H.fromList Trying to convert a list of data records to a hashmap Here is the code: OK, I know that "loadConn" is probably not even close. I...

[ -0.01336669921875, -0.01470947265625, -0.0054931640625, 0.008544921875, -0.0052490234375, 0.00250244140625, -0.01141357421875, 0.003509521484375, 0.0054931640625, -0.032470703125, -0.01104736328125, -0.0233154296875, 0.0233154296875, 0.0128173828125, -0.0230712890625, -0.01336669921875...

[ 40858, 96760, 5303, 2053, 115923, 47, 256, 80425, 254, 10, 111, 1556, 142508, 11809, 6495, 1495, 166179, 2729, 3285, 62448, 134549, 17367, 88342, 162087, 572, 161063, 154663, 18151, 63033, 11935, 19, 31895, 959, 3853, 20903, 117507, 12921, 25...

[ 0.07879638671875, 0.124755859375, 0.1258544921875, 0.1158447265625, 0.1771240234375, 0.056671142578125, 0.1531982421875, 0.1632080078125, 0.1883544921875, 0.01812744140625, 0.04736328125, 0.1414794921875, 0.207763671875, 0.0543212890625, 0.136962890625, 0.0162353515625, 0.15319824218...

embed

67495088_c0

67495088

haskell

0

Title: Haskell function that substitutes a DNA base Problem title: Haskell function that substitutes a DNA base Tags: haskell, bioinformatics Problem: Haskell function that substitutes a DNA base I am trying to create a function in Haskell that substitutes a DNA base with another base. This is what my function is. When...

Haskell function that substitutes a DNA base Haskell function that substitutes a DNA base haskell bioinformatics Haskell DNA AGCT c:cs p12tests ACT AAT ACA GCT AGT ACG CCT ACC TCT ATT Haskell function that substitutes a DNA base I am trying to create a function in Haskell that substitutes a DNA base with another base. ...

[ -0.0191650390625, 0.0098876953125, 0.0228271484375, 0.0106201171875, 0.024169921875, -0.0025634765625, -0.01434326171875, 0.0028228759765625, 0.010009765625, 0.01251220703125, 0.00201416015625, 0.00714111328125, -0.0050048828125, 0.015869140625, -0.0186767578125, 0.0194091796875, 0.0...

[ 20625, 142508, 32354, 450, 161740, 90, 27583, 3647, 1556, 3530, 77033, 24639, 43379, 501, 12, 4439, 915, 1530, 6954, 84161, 127673, 6, 85955, 37315, 56367, 13709, 13739, 31577, 28282, 678, 15700, 2367, 759, 14847, 11675, 3034, 4, 2046, 2222...

[ 0.1710205078125, 0.26708984375, 0.2232666015625, 0.048583984375, 0.2003173828125, 0.048309326171875, 0.2008056640625, 0.1968994140625, 0.147705078125, 0.038299560546875, 0.08795166015625, 0.05328369140625, 0.1485595703125, 0.0225067138671875, 0.0531005859375, 0.057342529296875, 0.013...

embed

69656808_c0

69656808

haskell

0

Title: Pattern matching haskell Problem title: Pattern matching haskell Tags: haskell, pattern-matching Problem: Pattern matching haskell I would be really glad, if someone could get me a hint how pattern matching should work in haskell. I have already spent hours with watching different tutorials but i don't get it. I...

Pattern matching haskell Pattern matching haskell haskell pattern-matching Pattern Assignment EmptyA Assign Integer Show Pattern matching haskell I would be really glad, if someone could get me a hint how pattern matching should work in haskell. I have already spent hours with watching different tutorials but i don't g...

[ -0.0198974609375, 0.006072998046875, 0.01275634765625, 0.0247802734375, 0.000774383544921875, 0.00191497802734375, -0.0118408203125, -0.000392913818359375, 0.021240234375, 0.00762939453125, 0.0224609375, -0.0196533203125, -0.0142822265625, 0.00555419921875, -0.00127410888671875, -0.009...

[ 9876, 22766, 14858, 214, 1556, 142508, 103510, 98753, 1301, 31304, 31678, 939, 284, 44401, 17367, 2806, 6183, 9525, 5809, 5122, 3642, 5608, 4488, 23, 21974, 100244, 57143, 2301, 18, 2046, 2053, 10644, 674, 25632, 110527, 3444, 33022, 32354, ...

[ 0.1795654296875, 0.1597900390625, 0.234130859375, 0.117431640625, 0.15625, 0.207763671875, 0.2310791015625, 0.215087890625, 0.04876708984375, 0.185546875, 0.1021728515625, 0.10302734375, 0.10888671875, 0.11474609375, 0.06695556640625, 0.01287841796875, 0.00775146484375, 0.034393310...

embed

3116165_c0

3116165

haskell

0

Title: Function Composition VS Function Application Problem title: Function Composition VS Function Application Tags: function-composition, function, haskell Problem: Function Composition VS Function Application Do anyone can give example of function composition? This is the definition of function composition operator?...

Function Composition VS Function Application Function Composition VS Function Application function-composition function haskell Composition Application Function Composition VS Function Application Do anyone can give example of function composition? This is the definition of function composition operator? This shows tha...

[ 0, 0.004180908203125, 0.01953125, 0.0301513671875, -0.00128936767578125, 0.0201416015625, 0.0011749267578125, 0.013671875, 0.0125732421875, -0.00098419189453125, 0.00531005859375, -0.00982666015625, 0.0068359375, 0.0263671875, -0.004425048828125, -0.01263427734375, 0.02978515625, 0...

[ 28670, 10763, 3288, 40322, 44160, 104921, 32354, 277, 1556, 142508, 35672, 831, 8337, 27781, 166577, 3293, 83, 80934, 39933, 45831, 51776, 6626, 30646, 37629, 36510, 62775, 175457, 25299, 14135, 33079, 923, 62548, 91084, 37515, 128239, 38415, 1...

[ 0.1712646484375, 0.1439208984375, 0.1971435546875, 0.224853515625, 0.2027587890625, 0.244384765625, 0.237548828125, 0.1640625, 0.116943359375, 0.2220458984375, 0.02593994140625, 0.010955810546875, 0.003326416015625, 0.1483154296875, 0.287353515625, 0.0018310546875, 0.1123046875, 0....

embed

13877220_c0

13877220

haskell

0

Title: Flexible attribute handling with xml-conduit Problem title: Flexible attribute handling with xml-conduit Tags: yesod, haskell Problem: Flexible attribute handling with xml-conduit I would like to use xml-conduit for parsing some very large XML files since it seems to be the only XML library for Haskell that can ...

Flexible attribute handling with xml-conduit Flexible attribute handling with xml-conduit yesod haskell Flexible AttrParser Flexible attribute handling with xml-conduit I would like to use xml-conduit for parsing some very large XML files since it seems to be the only XML library for Haskell that can use Text . Unfortu...

[ -0.00072479248046875, 0.005096435546875, -0.0206298828125, -0.01531982421875, -0.007354736328125, 0.010009765625, -0.00099945068359375, 0.0098876953125, 0.006805419921875, 0.0054931640625, -0.00274658203125, -0.0211181640625, -0.00067901611328125, 0.0191650390625, -0.01129150390625, 0....

[ 180842, 2661, 150380, 13, 45064, 678, 131492, 9, 2271, 112061, 2422, 23722, 1556, 142508, 9208, 42, 28636, 2189, 1884, 4527, 100, 366, 6953, 4552, 21334, 92537, 102158, 4734, 35773, 20625, 831, 24129, 185397, 11435, 5915, 77630, 2101, 3871, ...

[ 0.2147216796875, 0.1280517578125, 0.21435546875, 0.024322509765625, 0.1505126953125, 0.0509033203125, 0.238037109375, 0.0416259765625, 0.1123046875, 0.225830078125, 0.1142578125, 0.155517578125, 0.0830078125, 0.2166748046875, 0.110595703125, 0.12255859375, 0.17431640625, 0.15551757...

embed

73786958_c0

73786958

haskell

0

Title: Input ',' cannot test two lists Problem title: Input ',' cannot test two lists Tags: haskell Problem: Input ',' cannot test two lists inter :: [Integer] -> [Integer] -> [Integer] inter s1 s2 = [s | s <- s2, s `elem` s1] inter [5, 6, 3, 1], [5, 2, 1, 3] main = return() I am not sure of how to ...

Input ',' cannot test two lists Input ',' cannot test two lists haskell /home/runner/University-Labs/.ghci Prelude Input Integer GHCi www.haskell.org Loaded University-Labs Compiling Main Main.hs Main.hs:4:19 Failed Variable Perhaps Leaving Input ',' cannot test two lists I am not sure of how to tes...

[ -0.003662109375, 0.003021240234375, 0.00121307373046875, 0.005340576171875, -0.0009765625, 0.023681640625, -0.004302978515625, -0.006439208984375, -0.01239013671875, -0.00909423828125, 0.00439453125, -0.01068115234375, 0.0031585693359375, 0.00640869140625, -0.0166015625, -0.01391601562...

[ 360, 7077, 3768, 4, 54764, 53418, 3034, 6626, 5303, 1556, 142508, 29552, 142117, 65305, 2481, 97381, 9486, 318, 1914, 822, 44401, 527, 73265, 14, 5, 10557, 1478, 2091, 712, 12535, 15612, 12321, 127, 617, 23988, 190355, 84572, 2886, 181799, ...

[ 0.143798828125, 0.169189453125, 0.1287841796875, 0.08099365234375, 0.023284912109375, 0.2086181640625, 0.227294921875, 0.2098388671875, 0.218994140625, 0.1348876953125, 0.238037109375, 0.0423583984375, 0.18994140625, 0.040863037109375, 0.03900146484375, 0.17724609375, 0.10595703125, ...

embed

43282641_c0

43282641

haskell

0

Title: How to make a nullary data constructor in Haskell return True for null Problem title: How to make a nullary data constructor in Haskell return True for null Tags: haskell, null Problem: How to make a nullary data constructor in Haskell return True for null I have an algebraic data type, say data Tree a = Node a ...

How to make a nullary data constructor in Haskell return True for null How to make a nullary data constructor in Haskell return True for null haskell null a How Haskell Tree Node Empty Foldable Nothing How to make a nullary data constructor in Haskell return True for null I have an algebraic data type, say data Tree a ...

[ 0.017578125, -0.005767822265625, 0.0218505859375, 0.0152587890625, 0.00494384765625, 0.0220947265625, 0.00689697265625, -0.0322265625, -0.00823974609375, -0.0198974609375, -0.0181884765625, -0.0264892578125, 0.0014495849609375, 0.025390625, 0.0096435546875, -0.023193359375, 0.0158691...

[ 11249, 3249, 9229, 1294, 2053, 64549, 748, 20625, 142508, 30646, 87599, 100, 56574, 1556, 101344, 438, 112, 31678, 939, 30077, 71, 2886, 182747, 23, 429, 2844, 10644, 10, 62731, 3444, 110, 22225, 120262, 5036, 25632, 18499 ]

[ 0.002716064453125, 0.06658935546875, 0.1798095703125, 0.1717529296875, 0.1390380859375, 0.1505126953125, 0.1312255859375, 0.1328125, 0.2200927734375, 0.1622314453125, 0.181640625, 0.12255859375, 0.251708984375, 0.1124267578125, 0.14697265625, 0.101806640625, 0.0811767578125, 0.1462...

embed

47094491_c0

47094491

haskell

0

Title: `Variable not in scope` in simple a function Problem title: `Variable not in scope` in simple a function Tags: haskell Problem: `Variable not in scope` in simple a function Consider the next piece of code - pvp::Board->Int-> IO () pvp board player = do player1choice <- prompt $ ("Player " ++ (show (player + 1)) ...

`Variable not in scope` in simple a function `Variable not in scope` in simple a function haskell Variable pvp::Board player1choice Player Nothing Invalid Just Valid Maybe `Variable not in scope` in simple a function Consider the next piece of code - For case newboard of , i get error: Variable not in scope: newboard :...

[ -0.019287109375, -0.010009765625, -0.00130462646484375, 0.0224609375, 0.02392578125, 0.00567626953125, 0.006256103515625, 0.021484375, 0.00897216796875, -0.00933837890625, 0.01275634765625, -0.0021209716796875, 0.00946044921875, 0.000530242919921875, 0.01239013671875, -0.0146484375, ...

[ 81827, 14, 2886, 959, 23, 70820, 8781, 10, 32354, 1556, 142508, 84572, 132059, 254, 12647, 5861, 58585, 3089, 60560, 182747, 7013, 25447, 83425, 137399, 11737, 18151, 7225, 3525, 24351, 111, 18499, 1984, 2389, 31635 ]

[ 0.1741943359375, 0.143310546875, 0.1778564453125, 0.1800537109375, 0.1561279296875, 0.225341796875, 0.1949462890625, 0.090576171875, 0.1807861328125, 0.123291015625, 0.2188720703125, 0.23291015625, 0.1033935546875, 0.038330078125, 0.044952392578125, 0.1285400390625, 0.138916015625, ...

embed

47475486_c1

47475486

haskell

1

expect #=> RecordAccess (RecordAccess (Id record_1) (Id field_1)) (Id field_2) I looked at chainl1 , but the type of the chaining parser is a -> a -> a , and that doesn't match the type of LValue that reflects the grammar. I also looked at many ; however I don't have a constant prefix for each term - the left recursio...

[ -0.004119873046875, -0.0031280517578125, -0.00689697265625, 0.020751953125, 0.00433349609375, 0.01007080078125, -0.019775390625, -0.01019287109375, 0.00921630859375, -0.0380859375, 0.007080078125, 0.027587890625, 0.00518798828125, -0.01483154296875, 0.0072021484375, 0.01708984375, -0...

[ 41206, 468, 54877, 39450, 26531, 32271, 71, 17164, 115187, 44457, 10461, 54811, 121293, 141, 418, 10644, 1608, 14653, 366, 2189, 10, 33079, 18, 14858, 46233, 50770, 44961, 122092, 147, 5941, 765, 53697, 183114, 12638, 13579, 25737, 195625, 18...

[ 0.2276611328125, 0.04595947265625, 0.1776123046875, 0.0777587890625, 0.1802978515625, 0.140625, 0.0313720703125, 0.173583984375, 0.0858154296875, 0.1292724609375, 0.0265350341796875, 0.026641845703125, 0.175048828125, 0.116455078125, 0.08154296875, 0.1605224609375, 0.1243896484375, ...

embed

58886200_c0

58886200

haskell

0

Title: How can I make a type that can be either a String or an Integer? Problem title: How can I make a type that can be either a String or an Integer? Tags: haskell Problem: How can I make a type that can be either a String or an Integer? I'm trying to make a type that can represent either an operator ("+", "-", "*", ...

How can I make a type that can be either a String or an Integer? How can I make a type that can be either a String or an Integer? haskell How Integer PostfixToken Bool Couldn How can I make a type that can be either a String or an Integer? I'm trying to make a type that can represent either an operator ("+", "-", "*", ...

[ 0.00058746337890625, -0.011474609375, -0.016845703125, 0.02392578125, 0.0028076171875, 0.00543212890625, -0.01422119140625, 0.00457763671875, 0.008056640625, -0.005279541015625, 0.00909423828125, -0.029052734375, -0.004608154296875, -0.0045166015625, -0.010009765625, 0.00274658203125, ...

[ 11249, 831, 3249, 10644, 23351, 214, 707, 44401, 450, 186, 40101, 1556, 142508, 2795, 55923, 7763, 1098, 2460, 929, 191147, 19, 87, 31577, 33636, 39933, 1328, 9, 1639, 6264, 2208, 116, 138, 201, 1305, 125195, 154993, 32562, 8473, 1176, 32...

[ 0.06658935546875, 0.1202392578125, 0.144775390625, 0.279052734375, 0.185546875, 0.109619140625, 0.044921875, 0.2308349609375, 0.013214111328125, 0.0411376953125, 0.022003173828125, 0.1112060546875, 0.2122802734375, 0.082763671875, 0.1722412109375, 0.070556640625, 0.1522216796875, 0...

embed

59121370_c0

59121370

haskell

0

Title: CPS Coroutines: Why does this example require exhaust? Problem title: CPS Coroutines: Why does this example require exhaust? Tags: continuations, monads, haskell, coroutine Problem: CPS Coroutines: Why does this example require exhaust? I am trying to figure out the coroutines example from the CPS chapter from w...

CPS Coroutines: Why does this example require exhaust? CPS Coroutines: Why does this example require exhaust? continuations monads haskell coroutine exhaust CPS Coroutines Why CPS Coroutines: Why does this example require exhaust? I am trying to figure out the coroutines example from the CPS chapter from wikibooks/Hask...

[ -0.00421142578125, -0.0032806396484375, 0.0018157958984375, -0.005645751953125, -0.0152587890625, 0.00421142578125, 0.0106201171875, -0.007171630859375, 0.004791259765625, -0.025390625, 0.0084228515625, 0.0225830078125, -0.00787353515625, 0.005889892578125, 0.025390625, -0.007171630859...

[ 9059, 5631, 6056, 12741, 44084, 14602, 903, 27781, 64209, 146353, 313, 9454, 2667, 712, 1556, 142508, 88909, 34, 10325, 26366, 48635, 90, 81415, 6495, 53418, 28219, 15400, 11675, 50886, 1212, 618, 32354, 144570, 16093, 1639, 3564, 15549, 1369...

[ 0.1976318359375, 0.069580078125, 0.1602783203125, 0.1290283203125, 0.146240234375, 0.0222320556640625, 0.0307769775390625, 0.190673828125, 0.152099609375, 0.269775390625, 0.030181884765625, 0.12646484375, 0.0401611328125, 0.04669189453125, 0.06011962890625, 0.167236328125, 0.07287597...

embed

33501429_c0

33501429

haskell

0

Title: Adding custom datatype in Yesod Problem title: Adding custom datatype in Yesod Tags: yesod, organization, haskell Problem: Adding custom datatype in Yesod I'm using the scaffolded yesod template and want to add a new type for monetary values. Ideally this should be done in one file called Money.hs for example. B...

Adding custom datatype in Yesod Adding custom datatype in Yesod yesod organization haskell Adding Yesod Field Handler Money ToHtml Adding custom datatype in Yesod I'm using the scaffolded yesod template and want to add a new type for monetary values. Ideally this should be done in one file called Money.hs for example. ...

[ 0.00274658203125, 0.01287841796875, -0.006500244140625, 0.02099609375, -0.0286865234375, 0.0220947265625, 0.00543212890625, 0.004852294921875, -0.00060272216796875, -0.0419921875, 0.01708984375, -0.0235595703125, -0.031494140625, -0.00537109375, 0.0029754638671875, -0.0078125, 0.0100...

[ 62, 59725, 114122, 2053, 50986, 32635, 2199, 2422, 23722, 53702, 1556, 142508, 117657, 10639, 603, 81669, 717, 841, 18, 7237, 23, 2407, 42822, 110934, 15190, 3525, 10644, 147794, 53, 142424, 41143, 1632, 11435, 5, 127, 187830, 24927, 32807, ...

[ 0.0870361328125, 0.05242919921875, 0.2261962890625, 0.095458984375, 0.283203125, 0.1507568359375, 0.249755859375, 0.11328125, 0.2244873046875, 0.1585693359375, 0.07861328125, 0.172607421875, 0.1510009765625, 0.1356201171875, 0.151123046875, 0.2066650390625, 0.1246337890625, 0.02522...

embed

36450443_c0

36450443

haskell

0

Title: Non-exhaustive pattern in my function head' Problem title: Non-exhaustive pattern in my function head' Tags: haskell Problem: Non-exhaustive pattern in my function head' transpose' :: [[a]] -> [[a]] transpose' [[]] = [] transpose' [[], _] = [] transpose' rows = (map head' rows) : transpose' (map tail' ...

Non-exhaustive pattern in my function head' Non-exhaustive pattern in my function head' haskell Non-exhaustive x:_ _:xs matMult3 Num Non-exhaustive pattern in my function head' Anyone got any ideas as to why this could be throwing up a non-exhaustive? I feel like there is something missing but I'm too new to ...

[ -0.0030059814453125, 0.0179443359375, 0.01434326171875, 0.0064697265625, 0.001922607421875, 0.01031494140625, -0.00811767578125, -0.0235595703125, 0.00701904296875, -0.006195068359375, 0.012939453125, 0.01324462890625, 0.01397705078125, -0.00421142578125, -0.0166015625, -0.002014160156...

[ 3775, 3355, 18391, 4935, 103510, 23, 759, 32354, 10336, 3768, 1556, 142508, 1022, 101, 425, 2589, 50657, 363, 52782, 25647, 15400, 903, 5809, 104250, 1257, 351, 12319, 83, 9844, 132283, 5792, 68034, 3714, 15970, 128169, 13648, 67660 ]

[ 0.1883544921875, 0.03607177734375, 0.1329345703125, 0.109130859375, 0.2080078125, 0.025787353515625, 0.07916259765625, 0.1431884765625, 0.17138671875, 0.054290771484375, 0.1478271484375, 0.2242431640625, 0.0518798828125, 0.00738525390625, 0.055572509765625, 0.089111328125, 0.11511230...

embed

16006778_c0

16006778

haskell

0

Title: Anyone have idea about the function of following code? (Haskell) Problem title: Anyone have idea about the function of following code? (Haskell) Tags: case, function, haskell Problem: Anyone have idea about the function of following code? (Haskell) Anyone have idea about the function of the following codes? here...

Anyone have idea about the function of following code? (Haskell) Anyone have idea about the function of following code? (Haskell) case function haskell Anyone Haskell Cases Case_A Case_B Case_C Case_D test_list list_left list_right x:xs y:ys Anyone have idea about the function of following code? (Haskell) Anyone have i...

[ -0.005645751953125, 0.007049560546875, 0.007568359375, 0.00445556640625, 0.015380859375, -0.0069580078125, 0.006134033203125, 0.0017547607421875, 0.0166015625, 0.0125732421875, -0.0003795623779296875, -0.00921630859375, 0.0020599365234375, 0.009765625, 0.00262451171875, -0.001289367675...

[ 28541, 3630, 765, 6528, 1672, 70, 32354, 111, 25632, 18151, 6495, 7, 142508, 7225, 1556, 20625, 43731, 284, 571, 441, 397, 3034, 6562, 5303, 2480, 54969, 425, 113, 4778, 3688, 40469, 1884, 47, 14192, 163, 2367, 83, 442, 107097 ]

[ 0.024749755859375, 0.091796875, 0.059417724609375, 0.1358642578125, 0.0618896484375, 0.012969970703125, 0.218505859375, 0.1170654296875, 0.140380859375, 0.1861572265625, 0.06573486328125, 0.015045166015625, 0.1834716796875, 0.1900634765625, 0.1109619140625, 0.081787109375, 0.16918945...

embed

21948905_c0

21948905

haskell

0

Title: Cont Monad breaks laziness in Haskell Problem title: Cont Monad breaks laziness in Haskell Tags: continuations, monads, haskell Problem: Cont Monad breaks laziness in Haskell I was trying the Cont monad, and discovers the following problem. First construct a infinite list and lift all the elements to a Cont mona...

Cont Monad breaks laziness in Haskell Cont Monad breaks laziness in Haskell continuations monads haskell Cont Monad Haskell Cont Monad breaks laziness in Haskell I was trying the Cont monad, and discovers the following problem. First construct a infinite list and lift all the elements to a Cont monad Use sequence opera...

[ -0.0021209716796875, 0.01202392578125, -0.00616455078125, -0.0010986328125, 0.010009765625, -0.0157470703125, 0.000514984130859375, -0.015869140625, -0.01483154296875, -0.047119140625, -0.00174713134765625, 0.01513671875, 0.0084228515625, 0.02587890625, 0.021728515625, -0.0008468627929...

[ 1657, 18, 60331, 71, 36356, 21, 708, 7432, 20625, 142508, 23, 9454, 2667, 712, 1556, 31577, 103882, 2967, 23972, 64549, 54241, 5303, 60520, 80854, 40, 944, 41018, 2046, 9790, 11675, 678, 10336, 123867, 40956, 71062, 8306, 35839, 18151, 3334...

[ 0.1636962890625, 0.1563720703125, 0.192138671875, 0.1470947265625, 0.12548828125, 0.11376953125, 0.1243896484375, 0.050872802734375, 0.1185302734375, 0.23046875, 0.0155792236328125, 0.14208984375, 0.1409912109375, 0.158203125, 0.08935546875, 0.0577392578125, 0.0164947509765625, 0.0...

embed

74259165_c0

74259165

haskell

0

Title: Haskell Chat Server Tutorial on haskell.org Not Working Problem title: Haskell Chat Server Tutorial on haskell.org Not Working Tags: tcp, haskell, sockets Problem: Haskell Chat Server Tutorial on haskell.org Not Working I'm trying to follow the tutorial to create a chat server on haskell.org , but I keep getting...

Haskell Chat Server Tutorial on haskell.org Not Working Haskell Chat Server Tutorial on haskell.org Not Working tcp haskell sockets Haskell Chat Server Tutorial haskell.org Not Working Main.hs:19:32 Variable iNADDR_ANY HostAddress SockAddrInet Haskell Chat Server Tutorial on haskell.org Not Working I'm trying to follow...

[ -0.010009765625, 0.01416015625, 0.01373291015625, 0.031005859375, 0.0023345947265625, 0.01092529296875, -0.01239013671875, -0.01373291015625, -0.0123291015625, -0.0296630859375, -0.016845703125, -0.0419921875, 0.01177978515625, 0.00634765625, -0.004547119140625, 0.01251220703125, 0.0...

[ 20625, 142508, 18032, 22687, 183447, 1556, 1478, 11205, 27985, 121422, 221, 27853, 214, 29902, 84572, 2886, 17, 149300, 23498, 93333, 100932, 161007, 1061, 2594, 7569, 126, 28960, 57143, 28282, 3245, 10723, 13695, 18499, 31089, 42548, 27771, 62...

[ 0.12548828125, 0.192626953125, 0.18701171875, 0.1458740234375, 0.1728515625, 0.1248779296875, 0.1390380859375, 0.101806640625, 0.1204833984375, 0.08148193359375, 0.05694580078125, 0.1429443359375, 0.0186004638671875, 0.05340576171875, 0.1322021484375, 0.04473876953125, 0.031494140625...

embed

32656293_c0

32656293

haskell

0

Title: What is a purely functional data structure for fast nearest neighbor search on n-dimensional space? Problem title: What is a purely functional data structure for fast nearest neighbor search on n-dimensional space? Tags: functional-programming, data-structures, haskell Problem: What is a purely functional data s...

What is a purely functional data structure for fast nearest neighbor search on n-dimensional space? What is a purely functional data structure for fast nearest neighbor search on n-dimensional space? functional-programming data-structures haskell What Vector Struct What is a purely functional data structure for fast ne...

[ 0.0186767578125, 0.0167236328125, -0.02783203125, -0.0230712890625, 0.0133056640625, 0.011474609375, 0.01348876953125, -0.032470703125, -0.004852294921875, -0.0177001953125, -0.01165771484375, -0.020751953125, -0.01348876953125, -0.006256103515625, -0.01611328125, 0.0177001953125, 0....

[ 4865, 83, 34166, 538, 123309, 2053, 45646, 100, 4271, 43573, 525, 208244, 33938, 98, 653, 157955, 32628, 10, 28966, 137656, 1556, 142508, 2609, 18770, 63667, 15390, 16487, 678, 61687, 3060, 143834, 101904, 241860, 49146, 136, 41, 12830, 450 ]

[ 0.07208251953125, 0.0440673828125, 0.15625, 0.13623046875, 0.241943359375, 0.155517578125, 0.261962890625, 0.05950927734375, 0.138427734375, 0.16455078125, 0.1417236328125, 0.216552734375, 0.195556640625, 0.0587158203125, 0.110107421875, 0.127685546875, 0.1339111328125, 0.025711059...

embed

56311510_c0

56311510

haskell

0

Title: What does type signature for `undefined` mean in Haskell? Problem title: What does type signature for `undefined` mean in Haskell? Tags: forall, haskell, undefined, types, type-signature Problem: What does type signature for `undefined` mean in Haskell? I am a beginner in Haskell and I am taken aback by the unde...

What does type signature for `undefined` mean in Haskell? What does type signature for `undefined` mean in Haskell? forall haskell undefined types type-signature What Haskell RuntimeRep TYPE HasCallStack What does type signature for `undefined` mean in Haskell? I am a beginner in Haskell and I am taken aback by the und...

[ 0.00384521484375, 0.01043701171875, -0.0030975341796875, 0.00775146484375, -0.0186767578125, -0.0019073486328125, -0.0033416748046875, 0.0008392333984375, -0.002105712890625, -0.01409912109375, -0.02099609375, -0.05908203125, 0.01025390625, 0.01123046875, -0.012451171875, 0.02209472656...

[ 4865, 10644, 138256, 100, 59437, 5983, 297, 29459, 23, 20625, 142508, 5584, 1556, 9232, 52895, 137432, 6032, 4332, 254, 95267, 21907, 441, 42378, 2594, 14602, 1135, 1679, 12620, 32354, 8781, 52922, 4588, 73342, 2367, 903 ]

[ 0.04937744140625, 0.2332763671875, 0.243408203125, 0.045501708984375, 0.132080078125, 0.2066650390625, 0.16748046875, 0.1051025390625, 0.025421142578125, 0.0838623046875, 0.207763671875, 0.0743408203125, 0.07080078125, 0.0999755859375, 0.17724609375, 0.170166015625, 0.0396728515625, ...

embed

60672588_c1

60672588

haskell

1

.hs, dist/build/Linear/Metric.o ) [ 5 of 22] Compiling Linear.V ( src/Linear/V.hs, dist/build/Linear/V.o ) [ 6 of 22] Compiling Linear.V0 ( src/Linear/V0.hs, dist/build/Linear/V0.o ) Code signals: Cannot, Resolving, Configuring, linear-1.21, Building, Failed, Build, linear-1.21.log, Entering, cabal-tmp-19434, Compiling...

[ 0.000629425048828125, 0.003570556640625, -0.0032806396484375, -0.00982666015625, 0.0216064453125, -0.01165771484375, -0.013671875, -0.006866455078125, 0.0113525390625, -0.0128173828125, -0.006988525390625, -0.0177001953125, -0.0036468505859375, 0.00921630859375, -0.0091552734375, 0.018...

[ 5, 127, 7, 45, 271, 177149, 93232, 147, 6696, 62233, 31, 190, 111, 1039, 15612, 49725, 16777, 856, 19437, 305, 2389, 28864, 26073, 4171, 10869, 132944, 59994, 192617, 5759, 3117, 104919, 190355, 121137, 4867, 357, 33558, 109524, 2676, 8363,...

[ 0.074951171875, 0.1158447265625, 0.0723876953125, 0.07208251953125, 0.131591796875, 0.1732177734375, 0.2059326171875, 0.220703125, 0.1646728515625, 0.1824951171875, 0.1566162109375, 0.07623291015625, 0.014495849609375, 0.1256103515625, 0.165771484375, 0.1468505859375, 0.2154541015625...

embed

35709737_c0

35709737

haskell

0

Title: Is it possible to derive recursion principles generically? Problem title: Is it possible to derive recursion principles generically? Tags: generic-programming, haskell Problem: Is it possible to derive recursion principles generically? In Idris, there's some magical machinery to automatically create (dependent) ...

Is it possible to derive recursion principles generically? Is it possible to derive recursion principles generically? generic-programming haskell Foo Yes Perhaps Is it possible to derive recursion principles generically? In Idris, there's some magical machinery to automatically create (dependent) eliminators for user-d...

[ -0.009765625, 0.01226806640625, -0.0027923583984375, 0.00439453125, 0.01611328125, 0.013427734375, -0.006439208984375, -0.003662109375, 0.0179443359375, -0.03515625, -0.01214599609375, -0.020263671875, -0.016357421875, 0.00099945068359375, 0.009521484375, -0.0216064453125, -0.0030212...

[ 2071, 442, 7722, 47, 122, 5844, 195625, 1830, 24702, 1577, 11212, 71407, 189534, 28966, 1556, 142508, 9572, 31, 32635, 181799, 181545, 49846, 289, 36279, 1294, 191082, 28282, 181063, 27169, 22230, 38937, 112, 5983, 52895, 149016, 54, 40715, 1...

[ 0.035186767578125, 0.02435302734375, 0.17919921875, 0.048126220703125, 0.140625, 0.14404296875, 0.239501953125, 0.123779296875, 0.1917724609375, 0.083984375, 0.168701171875, 0.1060791015625, 0.1854248046875, 0.1112060546875, 0.1002197265625, 0.203369140625, 0.10565185546875, 0.0326...

embed

14624376_c1

14624376

haskell

1

r (\k -> M.insertWith' (+) k 1) M.empty . filter (not . isStopWord) . T.words wordList = do files <- mapM TI.readFile =<< textFiles return $ mapReduce rseq histogram rseq reduce files where reduce = M.unions main = do list <- wordList print $ M.size list As for the text files, I'm using pdfs converted to text files so ...

[ -0.00799560546875, 0.01129150390625, -0.017822265625, 0.0074462890625, 0.00341796875, -0.002838134765625, 0.00634765625, -0.01025390625, -0.00677490234375, -0.060546875, 0.0068359375, 0.0068359375, 0.021484375, 0.01336669921875, 0.02783203125, 0.008544921875, -0.00146484375, -0.005...

[ 1690, 41872, 92, 33079, 276, 73, 33657, 194583, 22183, 472, 4879, 33548, 939, 46312, 83, 156095, 164805, 384, 47416, 2565, 154663, 54, 102158, 22288, 594, 26906, 39116, 174350, 7986, 30646, 3650, 4332, 106357, 864, 1919, 18, 83814, 34390, 8...

[ 0.133544921875, 0.022857666015625, 0.10430908203125, 0.0188446044921875, 0.10626220703125, 0.0631103515625, 0.166015625, 0.2103271484375, 0.1510009765625, 0.06573486328125, 0.032440185546875, 0.1611328125, 0.115478515625, 0.2371826171875, 0.058349609375, 0.1517333984375, 0.1915283203...

embed

51792841_c0

51792841

haskell

0

Title: Pattern Matching for a new data Problem title: Pattern Matching for a new data Tags: haskell, pattern-matching Problem: Pattern Matching for a new data I created a new type with some functions data Gate = MakeGate (Bool -> Bool -> Bool) andGate = MakeGate (&&) orGate = MakeGate (||) Now I want to add this type t...

Pattern Matching for a new data Pattern Matching for a new data haskell pattern-matching Pattern Matching Gate MakeGate Bool Pattern Matching for a new data I created a new type with some functions Now I want to add this type to a new instance of Eq with pattern matching, but I actually get alot of error messages. What...

[ 0.0115966796875, 0.017822265625, 0.0036468505859375, -0.003997802734375, 0.01025390625, 0.01446533203125, -0.01263427734375, 0.0113525390625, 0.000377655029296875, 0.006805419921875, -0.005859375, -0.0167236328125, 0.0067138671875, -0.005645751953125, -0.0020599365234375, -0.0063171386...

[ 9876, 22766, 67407, 214, 100, 3525, 2053, 1556, 142508, 103510, 98753, 132936, 26176, 17067, 67, 2460, 929, 75935, 10644, 32354, 15190, 903, 10, 110527, 241, 864, 678, 14858, 20653, 144, 818, 18499, 89914, 212059, 48205, 4588, 10625, 52366, ...

[ 0.1761474609375, 0.1700439453125, 0.219482421875, 0.095947265625, 0.0254669189453125, 0.09869384765625, 0.1427001953125, 0.1285400390625, 0.1942138671875, 0.231201171875, 0.1983642578125, 0.154541015625, 0.0855712890625, 0.09130859375, 0.0169219970703125, 0.087890625, 0.1763916015625...

embed

20344389_c0

20344389

haskell

0

Title: Composing a Storable by its parts Problem title: Composing a Storable by its parts Tags: haskell Problem: Composing a Storable by its parts I want to compose a Foreign.Storable into two parts.... import Foreign data FullData type1 type2 = FullData {first::type1, second::type2} instance (Storable type1, Storable ...

Composing a Storable by its parts Composing a Storable by its parts haskell Foreign a the Composing Storable FullData type1 type2 first::type1 second::type2 undefined::type1 undefined::type2 undefined::FullData Char storableTest.hs:13:44 Could storableTest.hs:12:10-74 Possible Note Defined storableTest.hs:12:10 Bool Fo...

[ 0.000774383544921875, -0.0038909912109375, -0.007232666015625, 0.0233154296875, -0.00927734375, 0.03271484375, -0.00457763671875, -0.00119781494140625, 0.007476806640625, 0.01397705078125, 0.007171630859375, 0.007354736328125, 0.025390625, 0.0146484375, -0.0036163330078125, 0.000038862...

[ 15612, 232, 23604, 2886, 390, 6863, 63920, 214, 10, 1556, 142508, 184293, 9312, 137989, 10644, 418, 304, 5117, 50986, 17932, 9232, 5983, 121962, 21656, 3082, 111337, 127, 22618, 32705, 191147, 20927, 15110, 16360, 115861, 18622, 262, 2460, 92...

[ 0.1405029296875, 0.16455078125, 0.21923828125, 0.2235107421875, 0.141357421875, 0.09332275390625, 0.2164306640625, 0.0135498046875, 0.034912109375, 0.1182861328125, 0.2076416015625, 0.26123046875, 0.1224365234375, 0.146728515625, 0.1448974609375, 0.03045654296875, 0.09088134765625, ...

embed

46018501_c0

46018501

haskell

0

Title: Which application is executed first? Problem title: Which application is executed first? Tags: haskell Problem: Which application is executed first? I have following instance of Traversable: instance Traversable (Three' a) where traverse f (Three' x y z) = Three' x <$> f y <*> f z the infix operator <$> and <*> ...

Which application is executed first? Which application is executed first? haskell Which Traversable Three ExercisesTraversable Functor Defined Data.Functor Applicative GHC.Base Which application is executed first? I have following instance of Traversable: the infix operator <$> and <*> has the same precedence and namel...

[ 0.007171630859375, -0.0032501220703125, -0.00726318359375, 0.0308837890625, -0.000667572021484375, -0.0011444091796875, 0.004364013671875, -0.01251220703125, 0.01904296875, -0.033935546875, 0.0196533203125, 0.002166748046875, 0.0011444091796875, 0.00537109375, 0.0003223419189453125, 0....

[ 130078, 38415, 83, 71924, 297, 5117, 32, 1556, 142508, 4937, 7864, 2886, 129335, 155534, 5908, 28542, 28670, 18770, 262, 5983, 11809, 97249, 5659, 11048, 4935, 527, 73265, 63473, 25632, 110527, 23, 55923, 39933, 4369, 136, 1639, 5701, 107671,...

[ 0.07379150390625, 0.2357177734375, 0.0653076171875, 0.233154296875, 0.1431884765625, 0.170166015625, 0.0261077880859375, 0.1397705078125, 0.228515625, 0.1414794921875, 0.1907958984375, 0.2215576171875, 0.142578125, 0.1441650390625, 0.040740966796875, 0.09698486328125, 0.094970703125,...

embed

48756758_c0

48756758

haskell

0

Title: foldr and foldl function applied on div function in Haskell Problem title: foldr and foldl function applied on div function in Haskell Tags: haskell Problem: foldr and foldl function applied on div function in Haskell I am really confused on how foldr and foldl works. Like for example using like this on the list...

foldr and foldl function applied on div function in Haskell foldr and foldl function applied on div function in Haskell haskell Haskell foldr and foldl function applied on div function in Haskell I am really confused on how foldr and foldl works. Like for example using like this on the list [1,2,3] And this makes sense...

[ -0.00634765625, -0.0001659393310546875, 0.012939453125, -0.01458740234375, -0.015380859375, 0.01220703125, -0.0125732421875, -0.00579833984375, -0.0026092529296875, -0.025634765625, 0.0057373046875, -0.0306396484375, -0.0081787109375, 0.01190185546875, 0.005706787109375, -0.01599121093...

[ 18344, 7569, 136, 20469, 32354, 190659, 98, 18221, 20625, 142508, 1556, 23, 6183, 55681, 5281, 3642, 43240, 17368, 1884, 903, 5303, 68252, 155761, 30482, 10422, 12638, 152, 91995, 997, 24092, 201505, 5423, 390, 757, 10644, 25632, 6626, 124519...

[ 0.1854248046875, 0.2421875, 0.1322021484375, 0.221435546875, 0.178466796875, 0.1204833984375, 0.012359619140625, 0.20263671875, 0.131591796875, 0.2471923828125, 0.1187744140625, 0.00860595703125, 0.04119873046875, 0.0731201171875, 0.016754150390625, 0.03729248046875, 0.1500244140625,...

embed

9159970_c0

9159970

haskell

0

Title: Boolean selection of list Problem title: Boolean selection of list Tags: haskell Problem: Boolean selection of list Suppose we want those elements of list x for which the corresponding element of list y is strictly positive. Any of the three solutions below work: let x = [1..4] let y = [1, -1, 2, -2] [ snd both ...

Boolean selection of list Boolean selection of list haskell Boolean Bool Boolean selection of list Suppose we want those elements of list x for which the corresponding element of list y is strictly positive. Any of the three solutions below work: or or however, what prompted this was that in the R language this can be ...

[ -0.0166015625, 0.018310546875, 0.015869140625, 0.0152587890625, -0.01019287109375, 0.0106201171875, -0.00046539306640625, 0.01251220703125, 0.00927734375, 0.0301513671875, -0.0089111328125, -0.00762939453125, -0.03369140625, 0.002410888671875, -0.0029296875, 0.0054931640625, 0.015441...

[ 73783, 34677, 132216, 111, 5303, 1556, 142508, 2460, 929, 121691, 3444, 8382, 80854, 1022, 100, 3129, 42518, 12830, 113, 83, 81113, 24491, 17262, 51347, 35064, 4488, 105876, 627, 46876, 903, 831, 59121, 94928, 1884, 5045, 16610, 56, 372, 30...

[ 0.1278076171875, 0.225341796875, 0.20654296875, 0.044830322265625, 0.1971435546875, 0.1448974609375, 0.25537109375, 0.103515625, 0.22412109375, 0.011566162109375, 0.1375732421875, 0.059539794921875, 0.1373291015625, 0.0430908203125, 0.065185546875, 0.010955810546875, 0.1129150390625,...

embed

30673231_c0

30673231

haskell

0

Title: Automatic instance derivation using newtype Problem title: Automatic instance derivation using newtype Tags: haskell Problem: Automatic instance derivation using newtype (Related question Even more generalized newtype deriving ) I like wrap types {-# LANGUAGE GeneralizedNewtypeDeriving #-} newtype Foo = Foo { un...

Automatic instance derivation using newtype Automatic instance derivation using newtype haskell newtype Automatic LANGUAGE GeneralizedNewtypeDeriving Foo Ord Enum Real Num Read Integral Show Automatic instance derivation using newtype (Related question Even more generalized newtype deriving ) I like wrap types to preve...

[ 0.00015735626220703125, -0.006011962890625, 0.0028533935546875, -0.002838134765625, -0.00164794921875, 0.029296875, -0.003173828125, -0.00811767578125, 0.0032806396484375, -0.01806640625, -0.01080322265625, -0.00872802734375, 0.01416015625, 0.0030975341796875, -0.0361328125, -0.0178222...

[ 51719, 1771, 110527, 30057, 1363, 17368, 3525, 50986, 1556, 142508, 3358, 98064, 9082, 46568, 47731, 14, 6496, 9572, 31, 35379, 316, 5120, 52782, 4764, 204681, 17367, 4537, 16406, 1884, 137565, 52895, 47, 56282, 7722, 122, 5844, 191082, 756, ...

[ 0.207763671875, 0.06671142578125, 0.23681640625, 0.207763671875, 0.019927978515625, 0.06573486328125, 0.119140625, 0.306640625, 0.0919189453125, 0.21533203125, 0.012969970703125, 0.09521484375, 0.05938720703125, 0.051727294921875, 0.10589599609375, 0.037994384765625, 0.0618896484375,...

embed

13661595_c0

13661595

haskell

0

Title: Are Snaplets advisable for larger apps or can you just build directly on top of snap-core? Problem title: Are Snaplets advisable for larger apps or can you just build directly on top of snap-core? Tags: haskell-snap-framework, haskell Problem: Are Snaplets advisable for larger apps or can you just build directly...

Are Snaplets advisable for larger apps or can you just build directly on top of snap-core? Are Snaplets advisable for larger apps or can you just build directly on top of snap-core? haskell-snap-framework haskell Snaplets Are Snaplets advisable for larger apps or can you just build directly on top of snap-core? I plan ...

[ -0.007293701171875, 0.0115966796875, -0.00823974609375, 0.0130615234375, -0.029541015625, 0.003692626953125, 0.0101318359375, -0.016357421875, 0.0191650390625, 0.004058837890625, 0.0159912109375, 0.00762939453125, -0.01519775390625, -0.00469970703125, 0.01513671875, -0.006744384765625,...

[ 121190, 1974, 7, 606, 1824, 2886, 100, 150679, 49966, 707, 831, 45367, 105237, 2663, 111, 76685, 30854, 9, 1556, 142508, 10957, 160328, 18244, 15901, 1660, 1774, 32562, 1467, 9007, 678, 47593, 5045, 1286, 80560, 2472, 163, 96, 47754, 76104,...

[ 0.2421875, 0.269287109375, 0.09521484375, 0.06494140625, 0.1319580078125, 0.0904541015625, 0.05389404296875, 0.163330078125, 0.1824951171875, 0.01611328125, 0.0567626953125, 0.155029296875, 0.135498046875, 0.1317138671875, 0.029998779296875, 0.224609375, 0.208984375, 0.020568847656...

embed

16797802_c0

16797802

haskell

0

Title: Is it possible to use extended precision (80-bit) floating point arithmetic in GHC/Haskell? Problem title: Is it possible to use extended precision (80-bit) floating point arithmetic in GHC/Haskell? Tags: extended-precision, haskell, ghc, floating-point, floating-point-precision Problem: Is it possible to use ex...

Is it possible to use extended precision (80-bit) floating point arithmetic in GHC/Haskell? Is it possible to use extended precision (80-bit) floating point arithmetic in GHC/Haskell? extended-precision haskell ghc floating-point floating-point-precision GHC Haskell Double Is it possible to use extended precision (80-b...

[ 0.018310546875, -0.002899169921875, 0.021484375, -0.00133514404296875, 0.0167236328125, 0.01519775390625, -0.0244140625, -0.0079345703125, -0.01422119140625, 0.002166748046875, 0.0174560546875, -0.006072998046875, -0.0010833740234375, -0.018310546875, -0.0068359375, 0.0167236328125, ...

[ 2071, 7722, 4527, 65042, 297, 22619, 1830, 4836, 3137, 21917, 26518, 6275, 187, 8962, 282, 527, 73265, 64, 6495, 7, 142508, 442, 9523, 23, 51606, 6889, 1556, 31380, 238, 38496, 20625, 107172, 5570, 41929, 18645, 174653, 101935, 95134, 17368...

[ 0.023101806640625, 0.154052734375, 0.1256103515625, 0.167724609375, 0.08099365234375, 0.20263671875, 0.0650634765625, 0.2242431640625, 0.14697265625, 0.1561279296875, 0.0882568359375, 0.1129150390625, 0.0200958251953125, 0.1365966796875, 0.08551025390625, 0.09619140625, 0.20654296875...

embed

26745663_c0

26745663

haskell

0

Title: Activate highlight code in haskell mode Problem title: Activate highlight code in haskell mode Tags: haskell-mode, haskell, emacs Problem: Activate highlight code in haskell mode I installed haskell-mode in order to have highlighted code when editing *.hs files. I have added the following line to my init.el file...

Activate highlight code in haskell mode Activate highlight code in haskell mode haskell-mode haskell emacs Activate haskell-package.el Activate highlight code in haskell mode I installed haskell-mode in order to have highlighted code when editing *.hs files. I have added the following line to my init.el file: As it can...

[ -0.01007080078125, -0.016845703125, 0.015625, 0.0002460479736328125, 0.013916015625, 0.0242919921875, 0.0002841949462890625, 0.00946044921875, -0.01708984375, -0.0072021484375, -0.0033416748046875, -0.01165771484375, -0.02001953125, -0.00396728515625, -0.0115966796875, -0.0136108398437...

[ 42902, 2182, 127308, 18151, 23, 1556, 142508, 13736, 61170, 352, 2263, 29102, 583, 20600, 765, 27211, 127, 102158, 49814, 25632, 13315, 217, 11435, 28219, 23009, 15769, 32102, 10557, 13691, 3371, 86531, 84396, 177476, 5608, 11192, 150, 3674, ...

[ 0.1922607421875, 0.03741455078125, 0.28955078125, 0.220703125, 0.06915283203125, 0.1624755859375, 0.21533203125, 0.166015625, 0.1590576171875, 0.046875, 0.068359375, 0.101318359375, 0.1209716796875, 0.07867431640625, 0.02374267578125, 0.105712890625, 0.081298828125, 0.065185546875,...

embed

46674485_c0

46674485

haskell

0

Title: I am getting different results when running my Haskell code interactively using ghci and when loading it as a module Problem title: I am getting different results when running my Haskell code interactively using ghci and when loading it as a module Tags: ghc, exponential, ghci, haskell Problem: I am getting diff...

I am getting different results when running my Haskell code interactively using ghci and when loading it as a module I am getting different results when running my Haskell code interactively using ghci and when loading it as a module ghc exponential ghci haskell ghci Haskell I am getting different results when running ...

[ 0.00537109375, -0.0038604736328125, 0.005096435546875, 0.0098876953125, 0.0002880096435546875, 0.01507568359375, 0.004119873046875, -0.0004329681396484375, 0.01104736328125, -0.0185546875, -0.00872802734375, -0.017578125, 0.0013427734375, -0.0017547607421875, -0.000835418701171875, -0....

[ 444, 20949, 12921, 50339, 3229, 51042, 20625, 142508, 18151, 212398, 17368, 31380, 318, 72367, 237, 10, 88996, 238, 78643, 80973, 1556, 442, 28864, 1295, 127, 11435, 30957, 2203, 702, 9285, 19236, 363, 472, 25837, 118552, 4046, 347, 7621, 1...

[ 0.013580322265625, 0.07110595703125, 0.188720703125, 0.15771484375, 0.040496826171875, 0.134033203125, 0.1468505859375, 0.2452392578125, 0.1961669921875, 0.1978759765625, 0.0362548828125, 0.1578369140625, 0.1971435546875, 0.148193359375, 0.0838623046875, 0.00177001953125, 0.206420898...

embed

10258081_c0

10258081

haskell

0

Title: not match expected type Problem title: not match expected type Tags: haskell Problem: not match expected type How can I solve this error and make my code work ? My data type : data ID x = ID ( ( x, Mark ), [ ID x ] ) data Mark = Marked | Unmarked Show instance: instance Show a => Show ( ID a ) where show t = go ...

not match expected type not match expected type haskell Mark Marked Unmarked Show Couldn Char Dictionary.hs:117:23 Expected Inferred Failed not match expected type How can I solve this error and make my code work ? My data type : Show instance: Error:

[ 0.006988525390625, -0.0034942626953125, 0.004119873046875, 0.0279541015625, 0.00341796875, -0.00726318359375, -0.00084686279296875, -0.01153564453125, 0.0155029296875, 0.0078125, 0.003082275390625, -0.0206298828125, 0.00775146484375, -0.0038909912109375, -0.0101318359375, 0.00193786621...

[ 959, 14858, 84751, 10644, 1556, 142508, 7880, 992, 79466, 17367, 191147, 19, 21656, 147638, 127, 115250, 24864, 60075, 13, 89829, 360, 2875, 2822, 190355, 297, 831, 86869, 903, 18499, 3249, 759, 18151, 4488, 2053, 110527, 212059 ]

[ 0.1519775390625, 0.2415771484375, 0.215576171875, 0.21337890625, 0.13134765625, 0.1968994140625, 0.10943603515625, 0.032928466796875, 0.142333984375, 0.1614990234375, 0.15380859375, 0.06610107421875, 0.10211181640625, 0.127685546875, 0.017974853515625, 0.09857177734375, 0.07421875, ...

embed

18583416_c1

18583416

haskell

1

any input. So I was wondering if anyone have an elegant way to solve this problem? Thanks. Addendum: Example p = string "P" q = (++) <$> try (string "xy") <*> string "z" Test input on (hypothetical) parser s , had it worked the way I wanted: xyz (accept) xyz P (accept; P remains unparsed) xyz Px (accept; Px remains un...

[ -0.01171875, 0.05224609375, 0.00982666015625, 0.041015625, -0.022216796875, 0.015625, -0.00274658203125, -0.027587890625, -0.00182342529296875, -0.00555419921875, 0.017578125, 0.0172119140625, -0.01202392578125, 0.01068115234375, -0.00732421875, 0.01275634765625, 0.0035400390625, 0...

[ 2499, 107730, 149016, 35672, 765, 27650, 3917, 86869, 903, 2967, 23013, 89536, 915, 2203, 79315, 683, 8096, 37223, 4369, 9790, 91693, 50878, 18939, 1639, 169, 8647, 771, 2347, 366, 2189, 91, 79786, 36663, 32189, 19462, 436, 47143, 51, 2500,...

[ 0.11181640625, 0.214111328125, 0.046356201171875, 0.036376953125, 0.016082763671875, 0.1529541015625, 0.035980224609375, 0.130859375, 0.054779052734375, 0.1397705078125, 0.025238037109375, 0.08642578125, 0.11376953125, 0.07305908203125, 0.1995849609375, 0.113525390625, 0.194702148437...

embed

72072547_c0

72072547

haskell

0

Title: How can I "save" a variable when repeating a function? Problem title: How can I "save" a variable when repeating a function? Tags: functional-programming, haskell, repeat Problem: How can I "save" a variable when repeating a function? Right now I'm trying to make a program that gives the sum ...

How can I "save" a variable when repeating a function? How can I "save" a variable when repeating a function? functional-programming haskell repeat System.Exit How EXIT_PROGRAM ExitSuccess How can I "save" a variable when repeating a function? Right now I'm trying to make a program that gives the su...

[ -0.00994873046875, 0.0191650390625, -0.0089111328125, 0.031005859375, 0.0032501220703125, 0.0196533203125, -0.007781982421875, 0.0028533935546875, 0.0115966796875, -0.04296875, -0.00010442733764648438, 0.004669189453125, -0.025634765625, 0.0108642578125, 0.0196533203125, 0.007507324218...

[ 11249, 831, 87, 108999, 10, 77336, 3229, 119140, 214, 32354, 123309, 28966, 1556, 142508, 12353, 19279, 29426, 6371, 47970, 724, 35812, 5443, 217, 14168, 238, 26531, 58, 5036, 31577, 1528, 76199, 10554, 756, 101935, 30957, 4911, 2060, 82424, ...

[ 0.08233642578125, 0.0821533203125, 0.040924072265625, 0.241455078125, 0.056396484375, 0.278076171875, 0.1087646484375, 0.27587890625, 0.114501953125, 0.1849365234375, 0.1195068359375, 0.0802001953125, 0.116943359375, 0.2086181640625, 0.1026611328125, 0.079833984375, 0.1041259765625, ...

embed

69430041_c0

69430041

haskell

0

Title: Haskell error when using the isNothing function in Maybe Problem title: Haskell error when using the isNothing function in Maybe Tags: functional-programming, haskell Problem: Haskell error when using the isNothing function in Maybe I am trying to use isNothing in my code in Haskell, and it is giving me the erro...

Haskell error when using the isNothing function in Maybe Haskell error when using the isNothing function in Maybe functional-programming haskell the Prelude Haskell Maybe Variable Bool Perhaps Nothing Just Haskell error when using the isNothing function in Maybe I am trying to use isNothing in my code in Haskell, and i...

[ -0.00531005859375, -0.012939453125, 0.0162353515625, -0.01092529296875, 0.007415771484375, 0.006072998046875, -0.005401611328125, -0.0125732421875, -0.00150299072265625, -0.0260009765625, -0.017822265625, -0.0196533203125, -0.0040283203125, -0.00537109375, 0.0137939453125, -0.022583007...

[ 20625, 142508, 18499, 17368, 83, 5021, 64113, 32354, 83425, 123309, 28966, 1556, 1914, 822, 112, 84572, 2886, 2460, 929, 181799, 182747, 23, 31577, 4527, 18151, 13315, 28960, 43240, 5885, 91995, 34292, 678, 69112, 96362, 959, 20697 ]

[ 0.1395263671875, 0.243408203125, 0.1856689453125, 0.10479736328125, 0.1768798828125, 0.173583984375, 0.2164306640625, 0.1641845703125, 0.287353515625, 0.1221923828125, 0.0682373046875, 0.136474609375, 0.055145263671875, 0.1632080078125, 0.0943603515625, 0.1077880859375, 0.03170776367...

embed

30541686_c0

30541686

haskell

0

Title: Iterate over a list until the resulting list is an empty list Problem title: Iterate over a list until the resulting list is an empty list Tags: io-monad, haskell Problem: Iterate over a list until the resulting list is an empty list I'm trying to see if I can do something like this: Say I have a list: [1, 8, 90...

Iterate over a list until the resulting list is an empty list Iterate over a list until the resulting list is an empty list io-monad haskell Iterate Iterate over a list until the resulting list is an empty list I'm trying to see if I can do something like this: Say I have a list: [1, 8, 90, 100, 82] Now, what I would l...

[ -0.013427734375, 0.0025634765625, 0.00970458984375, 0.0113525390625, -0.00958251953125, 0.009765625, 0.0011749267578125, -0.0179443359375, 0.00732421875, -0.01373291015625, 0.0004825592041015625, -0.01123046875, 0.006317138671875, 0.0040283203125, -0.00225830078125, 0.004913330078125, ...

[ 87, 8560, 67, 645, 5303, 24189, 16750, 214, 83, 142, 201505, 22995, 3796, 712, 1556, 142508, 31577, 1957, 831, 54, 1884, 903, 25916, 765, 68252, 382, 2510, 805, 15751, 2806, 198343, 28412, 47143, 820, 111, 2046, 7068, 7279, 3917, 23, 20...

[ 0.054931640625, 0.25341796875, 0.1251220703125, 0.1888427734375, 0.2001953125, 0.1549072265625, 0.1005859375, 0.06170654296875, 0.1092529296875, 0.0672607421875, 0.2222900390625, 0.174072265625, 0.10260009765625, 0.1182861328125, 0.128173828125, 0.257080078125, 0.058441162109375, 0...

embed

23061500_c0

23061500

haskell

0

Title: Extracting from a function in Haskell Problem title: Extracting from a function in Haskell Tags: store, extract, integer, function, haskell Problem: Extracting from a function in Haskell I have the following data types type Store = Loc -> Z type Loc = Z type Z = Integer where the basic idea is that a Store maps ...

Extracting from a function in Haskell Extracting from a function in Haskell store extract integer function haskell a Extracting Haskell Store Loc Integer Extracting from a function in Haskell I have the following data types where the basic idea is that a Store maps a Location to an integer. And each Location is represe...

[ 0.005279541015625, -0.01251220703125, 0.005828857421875, 0.0228271484375, 0.0157470703125, 0.0181884765625, -0.00799560546875, -0.006072998046875, 0.00885009765625, -0.01495361328125, -0.0098876953125, -0.006103515625, -0.0120849609375, -0.003662109375, 0.00885009765625, -0.00772094726...

[ 31501, 238, 1916, 1295, 32354, 23, 20625, 142508, 4343, 125663, 892, 1505, 1556, 14934, 88784, 44401, 25632, 2053, 52895, 62822, 6528, 22288, 90788, 47, 12638, 33636, 10002, 42485, 234311, 66211, 15363, 33079, 567, 3871, 51776, 30646, 1660, 2...

[ 0.1861572265625, 0.07525634765625, 0.03857421875, 0.103515625, 0.2000732421875, 0.091552734375, 0.1494140625, 0.244140625, 0.2042236328125, 0.2283935546875, 0.1480712890625, 0.135498046875, 0.1435546875, 0.1856689453125, 0.1842041015625, 0.1864013671875, 0.009429931640625, 0.069274...

embed

50191905_c0

50191905

haskell

0

Title: Read a list of INT type from the console and print out only even numbers out of the given list Using list comprehension Problem title: Read a list of INT type from the console and print out only even numbers out of the given list Using list comprehension Tags: haskell, list-comprehension Problem: Read a list of ...

Read a list of INT type from the console and print out only even numbers out of the given list Using list comprehension Read a list of INT type from the console and print out only even numbers out of the given list Using list comprehension haskell list-comprehension the Read Using Read a list of INT type from the conso...

[ -0.0283203125, 0.001739501953125, 0.01409912109375, -0.00390625, 0.0133056640625, 0.037841796875, 0.006927490234375, 0.027587890625, 0.00482177734375, -0.0089111328125, -0.01202392578125, -0.037353515625, 0.024658203125, -0.000560760498046875, 0.00029754638671875, 0.0177001953125, 0....

[ 4764, 5303, 59537, 10644, 1295, 130250, 28412, 1810, 4734, 3853, 101935, 34475, 345, 6953, 46683, 3220, 111, 1556, 142508, 277, 4692, 3525, 123309, 56037, 678, 20625, 52080, 66211, 31577, 33022, 32354, 765 ]

[ 0.1973876953125, 0.191162109375, 0.2108154296875, 0.177001953125, 0.1195068359375, 0.223876953125, 0.18896484375, 0.09649658203125, 0.1197509765625, 0.1934814453125, 0.152099609375, 0.085693359375, 0.050506591796875, 0.0208587646484375, 0.1514892578125, 0.169921875, 0.0103759765625, ...

embed

28927716_c0

28927716

haskell

0

Title: org-babel for haskell not works of eval haskell block Problem title: org-babel for haskell not works of eval haskell block Tags: haskell, org-mode, emacs, org-babel Problem: org-babel for haskell not works of eval haskell block I am use org-mode blogging, I use org-babel to evaluate the code as following : #+BEG...

org-babel for haskell not works of eval haskell block org-babel for haskell not works of eval haskell block haskell org-mode emacs org-babel Data.Function BEGIN_SRC END_SRC RESULTS Not org-babel for haskell not works of eval haskell block I am use org-mode blogging, I use org-babel to evaluate the code as following : I...

[ 0.01385498046875, -0.003814697265625, 0.02685546875, 0.002532958984375, 0.00007581710815429688, 0.006744384765625, -0.0084228515625, -0.01361083984375, -0.0157470703125, -0.0218505859375, -0.0089111328125, -0.0021514892578125, -0.001861572265625, -0.01611328125, 0.00323486328125, -0.01...

[ 30910, 9, 402, 4063, 100, 1556, 142508, 959, 43240, 111, 28, 1405, 46389, 61170, 352, 2263, 11809, 97249, 108526, 25740, 39015, 218849, 11205, 127990, 151575, 18151, 4527, 53498, 10557, 13736, 4034, 56002, 75935, 61924, 32354, 105237, 3884, 7...

[ 0.259033203125, 0.0301513671875, 0.12548828125, 0.21923828125, 0.0947265625, 0.1192626953125, 0.200927734375, 0.05523681640625, 0.121826171875, 0.0694580078125, 0.066162109375, 0.2322998046875, 0.166015625, 0.137939453125, 0.013641357421875, 0.049652099609375, 0.0543212890625, 0.08...

embed

75922457_c1

75922457

haskell

1

-- cardinal (names from "To Mock a Mockingbird") p = (,) f x y z = x + 10*y + 100*z g x y = x + 10*y {- p(fxyz)(gvw) = ?xyzvw, with ? in terms of p, f, g and known birds (p(fxyz))(gvw) B(B(p(fxyz)))gvw CBg(B(p(fxyz)))vw B(CBg)B(p(fxyz))vw B(B(CBg)B)p(fxyz)vw B(B(B(CBg)B)p)(fxy)zvw B(B(B(B(CBg)B)p))(fx)yzvw B(B(B(B(B(C...

[ -0.011474609375, 0.0189208984375, -0.01226806640625, 0.043212890625, 0.01251220703125, 0.01104736328125, -0.0038604736328125, -0.002899169921875, 0.0272216796875, -0.0037384033203125, 0.00156402587890625, -0.00860595703125, 0.00958251953125, -0.00634765625, -0.0206298828125, -0.0177001...

[ 4210, 200103, 15, 11627, 7, 1295, 44, 7763, 2501, 2594, 10, 41324, 91157, 18939, 915, 2203, 4, 16, 1238, 1022, 113, 97, 997, 209, 1639, 53, 805, 169, 706, 10666, 9, 132, 420, 50878, 51421, 177, 334, 705, 72932, 434, 678, 69407, 136,...

[ 0.12548828125, 0.327392578125, 0.0538330078125, 0.1959228515625, 0.105712890625, 0.101806640625, 0.032958984375, 0.1788330078125, 0.208740234375, 0.2376708984375, 0.1204833984375, 0.2138671875, 0.275390625, 0.044219970703125, 0.1881103515625, 0.1807861328125, 0.046875, 0.0274200439...

embed

42144467_c0

42144467

haskell

0

Title: Is this type family injective? Problem title: Is this type family injective? Tags: haskell, type-families Problem: Is this type family injective? I have type family for N-ary function from n arguments of type t to value of type o : type family NAry (n :: Nat) (t :: Type) (o :: Type) = (r :: Type) | r -> n t o wh...

Is this type family injective? Is this type family injective? haskell type-families the NAry Nat Type Is this type family injective? I have type family for N-ary function from n arguments of type t to value of type o : I think this family ought to be injective by I can't prove it to GHC:

[ -0.0027618408203125, -0.00848388671875, 0.007293701171875, 0.013671875, -0.031005859375, -0.01385498046875, 0.00830078125, 0.0113525390625, 0.01226806640625, 0.0123291015625, -0.00390625, -0.033203125, 0.0024261474609375, 0.0198974609375, -0.000598907470703125, -0.00482177734375, 0.0...

[ 2071, 903, 10644, 14449, 115049, 5844, 1556, 142508, 69128, 70, 3076, 1294, 68875, 60457, 765, 541, 6635, 32354, 1295, 653, 10750, 808, 47, 34292, 36, 5351, 46526, 186, 390, 831, 18, 23534, 73265 ]

[ 0.08660888671875, 0.1221923828125, 0.207275390625, 0.181884765625, 0.1978759765625, 0.1900634765625, 0.1038818359375, 0.21044921875, 0.1580810546875, 0.0274810791015625, 0.08746337890625, 0.1163330078125, 0.150390625, 0.1724853515625, 0.021240234375, 0.08056640625, 0.1744384765625, ...

embed

69715705_c0

69715705

haskell

0

Title: How do you install profiling libraries in Haskell? Problem title: How do you install profiling libraries in Haskell? Tags: cabal, haskell, profiling Problem: How do you install profiling libraries in Haskell? After running ghc --make -prof -fprof-auto -rtsopts encode.hs I'm getting this error: Failed to load int...

How do you install profiling libraries in Haskell? How do you install profiling libraries in Haskell? cabal haskell profiling How Haskell encode.hs Failed Data.Text Perhaps text-1.2.5.0 Use How do you install profiling libraries in Haskell? After running I'm getting this error: I've tried this: As suggested here: https...

[ 0.009033203125, -0.01141357421875, 0.0076904296875, 0.005126953125, -0.02783203125, 0.004638671875, -0.006561279296875, -0.00653076171875, -0.01275634765625, 0.00811767578125, 0.0079345703125, -0.052490234375, 0.00116729736328125, -0.00927734375, 0.0089111328125, 0.003387451171875, 0...

[ 11249, 20600, 9468, 214, 35773, 10484, 20625, 142508, 23, 109524, 1556, 22, 40899, 127, 7, 190355, 297, 11809, 174379, 181799, 7986, 48400, 187461, 51042, 903, 18499, 37842, 42459, 61754, 10557, 9486, 238, 22364, 102014, 7693, 223, 64527, 583...

[ 0.0204925537109375, 0.1944580078125, 0.2802734375, 0.167236328125, 0.2076416015625, 0.1192626953125, 0.160400390625, 0.251708984375, 0.04296875, 0.182373046875, 0.130126953125, 0.05419921875, 0.1793212890625, 0.1124267578125, 0.016845703125, 0.1424560546875, 0.059967041015625, 0.09...

embed

70158413_c0

70158413

haskell

0

Title: Include a closed source Haskell package in an open source Haskell package without leaking its code Problem title: Include a closed source Haskell package in an open source Haskell package without leaking its code Tags: package, haskell, hackage Problem: Include a closed source Haskell package in an open source H...

Include a closed source Haskell package in an open source Haskell package without leaking its code Include a closed source Haskell package in an open source Haskell package without leaking its code package haskell hackage Include Haskell System.Process.callCommand Include a closed source Haskell package in an open sour...

[ 0.0027618408203125, 0.00482177734375, 0.000720977783203125, 0.005035400390625, -0.00090789794921875, 0.0142822265625, 0.0036773681640625, 0.00396728515625, 0.00051116943359375, -0.0302734375, -0.006927490234375, -0.01348876953125, -0.006011962890625, 0.048828125, 0.00927734375, 0.00239...

[ 8942, 822, 155738, 31344, 20625, 142508, 98169, 23, 9803, 15490, 95, 11, 6863, 18151, 1556, 85526, 4588, 12353, 26531, 85763, 10770, 12018, 20697, 3444, 4527, 180639, 5665, 42548, 3917, 9969, 1340, 2394, 11782, 1829, 24500, 15700, 15917, 9384...

[ 0.09808349609375, 0.1309814453125, 0.156982421875, 0.1231689453125, 0.1507568359375, 0.25048828125, 0.231201171875, 0.0108642578125, 0.1241455078125, 0.09552001953125, 0.115966796875, 0.09283447265625, 0.015228271484375, 0.144287109375, 0.139404296875, 0.1785888671875, 0.105529785156...

embed

63670698_c0

63670698

haskell

0

Title: ghc.exe could not execute ld.exe while installing zlib Problem title: ghc.exe could not execute ld.exe while installing zlib Tags: cabal, haskell, installation, zlib Problem: ghc.exe could not execute ld.exe while installing zlib Im using Windows 10 cabal-install version 3.2.0.0 GHC version 8.10.2 While trying t...

ghc.exe could not execute ld.exe while installing zlib ghc.exe could not execute ld.exe while installing zlib cabal haskell installation zlib ghc.exe ld.exe Building zlib-0.6.2.2 Compiling Codec.Compression.Zlib.Stream Codec Compression Zlib Stream.hs Stream.o GitLabRunner ghc.exe could not execute ld.exe while install...

[ 0.021240234375, 0.01068115234375, 0.0098876953125, -0.01324462890625, -0.017578125, 0.000667572021484375, -0.01611328125, -0.0189208984375, -0.02099609375, 0.013916015625, 0.007415771484375, -0.0023345947265625, 0.02392578125, 0.0022125244140625, 0.003753662109375, 0.0322265625, 0.00...

[ 31380, 238, 46480, 5809, 959, 71924, 96, 71, 5, 12960, 20600, 97, 5612, 109524, 1556, 142508, 59720, 104919, 122887, 70147, 15612, 28864, 10770, 48448, 1511, 115061, 3288, 567, 127, 31, 217, 97381, 163321, 3370, 3773, 209, 80383, 55054, 999...

[ 0.147705078125, 0.1595458984375, 0.2039794921875, 0.0660400390625, 0.0870361328125, 0.173583984375, 0.07318115234375, 0.145751953125, 0.002227783203125, 0.063720703125, 0.12451171875, 0.114990234375, 0.25244140625, 0.2115478515625, 0.06109619140625, 0.1766357421875, 0.0633544921875, ...

embed

39689887_c0

39689887

haskell

0

Title: How to compose functions operating with ReaderT and Either? Problem title: How to compose functions operating with ReaderT and Either? Tags: monad-transformers, haskell, functor, monads Problem: How to compose functions operating with ReaderT and Either? Is it possible to rewrite the following function as a one-...

How to compose functions operating with ReaderT and Either? How to compose functions operating with ReaderT and Either? monad-transformers haskell functor monads TenantCreationError How ReaderT Either NewTenant AppM Tenant Left Right AppConfig TenantId How to compose functions operating with ReaderT and Either? Is it p...

[ -0.013671875, -0.006439208984375, -0.0052490234375, -0.014404296875, -0.000370025634765625, -0.01031494140625, -0.003448486328125, -0.0145263671875, 0.0003204345703125, -0.02294921875, 0.0064697265625, 0.0302734375, 0.0240478515625, -0.0181884765625, -0.0030364990234375, -0.02990722656...

[ 11249, 47, 150350, 32354, 172852, 678, 122636, 618, 136, 4565, 9319, 7, 2667, 712, 215175, 1314, 1556, 142508, 7477, 18770, 5531, 1236, 63784, 18468, 31611, 2356, 87286, 5659, 594, 90911, 83671, 7722, 456, 434, 18781, 25632, 1632, 79852 ]

[ 0.0521240234375, 0.05181884765625, 0.2144775390625, 0.2081298828125, 0.1180419921875, 0.08447265625, 0.2122802734375, 0.203125, 0.0714111328125, 0.06201171875, 0.2071533203125, 0.0252227783203125, 0.09002685546875, 0.1351318359375, 0.183837890625, 0.039886474609375, 0.090576171875, ...

embed

44142605_c0

44142605

haskell

0

Title: How to use the Reader Monad with (Int -> Int)? Problem title: How to use the Reader Monad with (Int -> Int)? Tags: reader-monad, haskell, monads Problem: How to use the Reader Monad with (Int -> Int)? I would like to learn, how to use the Reader Monad. Unfortunately only a small amount of example code is a...

How to use the Reader Monad with (Int -> Int)? How to use the Reader Monad with (Int -> Int)? reader-monad haskell monads How Reader Monad IntRead ReaderT How to use the Reader Monad with (Int -> Int)? I would like to learn, how to use the Reader Monad. Unfortunately only a small amount of example code is availab...

[ -0.005645751953125, -0.0054931640625, 0.0135498046875, 0.00848388671875, -0.01025390625, 0.0005340576171875, -0.000743865966796875, -0.0284423828125, -0.007598876953125, -0.045166015625, 0.0111083984375, 0.0076904296875, -0.005279541015625, -0.00775146484375, 0.016357421875, -0.0397949...

[ 11249, 47, 4527, 122636, 60331, 71, 678, 4153, 18, 20, 1230, 5386, 360, 70, 155255, 3796, 712, 1556, 142508, 2667, 31345, 618, 33079, 30698, 3642, 19336, 41170, 27781, 18151, 19882, 1884, 28282, 65998, 136, 456, 3996, 142424, 621, 61924, ...

[ 0.1036376953125, 0.04034423828125, 0.1688232421875, 0.29638671875, 0.20361328125, 0.1961669921875, 0.1192626953125, 0.1346435546875, 0.2091064453125, 0.047088623046875, 0.05670166015625, 0.163330078125, 0.1351318359375, 0.03668212890625, 0.2418212890625, 0.1072998046875, 0.1448974609...

embed

30899782_c2

30899782

haskell

2

000000 1,600,100,336 bytes allocated in the heap 1,477,564,464 bytes copied during GC 400,027,984 bytes maximum residency (14 sample(s)) 70,377,336 bytes maximum slop 911 MB total memory in use (0 MB lost due to fragmentation) Tot time (elapsed) Avg pause Max pause Gen 0 3067 colls, 3067 par 1.05s 0.68s 0.0002s 0.0021s...

[ 0.0118408203125, 0.009521484375, 0.0003662109375, 0.0128173828125, 0.0152587890625, -0.000408172607421875, -0.02392578125, 0.0002956390380859375, 0.0096435546875, -0.00628662109375, 0.010498046875, -0.00372314453125, 0.01324462890625, 0.0167236328125, -0.0026702880859375, 0.00946044921...

[ 6, 197094, 106, 10715, 4, 3559, 363, 8659, 390, 1636, 144, 116292, 297, 23, 70, 764, 2631, 59084, 14546, 176830, 160775, 71200, 71, 20271, 69657, 4082, 9550, 13903, 38132, 45606, 2408, 26205, 121413, 7, 16, 2358, 128919, 25193, 254, 12013...

[ 0.0927734375, 0.3017578125, 0.07769775390625, 0.1763916015625, 0.0211029052734375, 0.153564453125, 0.060577392578125, 0.1829833984375, 0.193359375, 0.1298828125, 0.1683349609375, 0.227783203125, 0.12451171875, 0.1239013671875, 0.06787109375, 0.227783203125, 0.2568359375, 0.07141113...

embed

5939862_c0

5939862

haskell

0

Title: Lazily evaluate monadic functions in Haskell Problem title: Lazily evaluate monadic functions in Haskell Tags: haskell, monads, lazy-evaluation Problem: Lazily evaluate monadic functions in Haskell I can't seem to figure out a workaround for this issue i'm having. I have something like this: getFilePathForDay ::...

Lazily evaluate monadic functions in Haskell Lazily evaluate monadic functions in Haskell haskell monads lazy-evaluation Lazily Haskell Day Maybe FilePath Lazily evaluate monadic functions in Haskell I can't seem to figure out a workaround for this issue i'm having. I have something like this: I am trying to get x amou...

[ 0.00677490234375, 0.002471923828125, 0.00494384765625, 0.004058837890625, -0.0206298828125, 0.0128173828125, 0.00726318359375, -0.00701904296875, 0.00787353515625, -0.01806640625, -0.0079345703125, -0.00762939453125, -0.01055908203125, 0.0196533203125, 0, -0.003570556640625, -0.01501...

[ 239, 708, 538, 151575, 2667, 11, 18403, 32354, 20625, 142508, 1556, 712, 21, 3285, 159258, 10013, 83425, 42724, 683, 10519, 26366, 67688, 31089, 19441, 1884, 903, 31577, 2046, 1022, 41170, 35604, 11435, 60875, 7440, 14012, 13312, 3444, 1284, ...

[ 0.1226806640625, 0.1502685546875, 0.12060546875, 0.1612548828125, 0.1234130859375, 0.08740234375, 0.113525390625, 0.1568603515625, 0.1317138671875, 0.2587890625, 0.113037109375, 0.1392822265625, 0.1077880859375, 0.1793212890625, 0.170654296875, 0.170166015625, 0.0777587890625, 0.13...

embed

10004442_c1

10004442

haskell

1

Map = [("writeServerName", writeServerName) ,("writeServeralias", writeServerAlias) ,("writeDocRoot", writeDocRoot) ,("writeLogLevel", writeErrorLog) ,("writeErrorPipe", writeErrorPipe) ,("writeVhostOpen", writeVhostOpen)] In the file which actually writes the hosts, that file is imported. I have an association list ca...

[ -0.00958251953125, -0.01043701171875, -0.000835418701171875, -0.003814697265625, 0.0015106201171875, -0.0040283203125, -0.0140380859375, -0.015869140625, 0.013427734375, 0.00921630859375, 0.01226806640625, 0.0223388671875, 0.0201416015625, 0.0020599365234375, 0.002960205078125, 0.01000...

[ 42719, 2203, 434, 18781, 193348, 163612, 33022, 41763, 55725, 162, 8331, 12724, 818, 113972, 2601, 31611, 48672, 683, 856, 40294, 103264, 11435, 20653, 70, 27980, 76242, 765, 125413, 5303, 93147, 40226, 8473, 1176, 34292, 450, 2806, 914, 9319...

[ 0.277099609375, 0.043548583984375, 0.046539306640625, 0.09881591796875, 0.1763916015625, 0.048828125, 0.203369140625, 0.1119384765625, 0.048004150390625, 0.043670654296875, 0.006805419921875, 0.08892822265625, 0.040679931640625, 0.056427001953125, 0.049957275390625, 0.003570556640625, ...

embed

38193391_c0

38193391

haskell

0

Title: Maximum Size Square of All 1's in Haskell Problem title: Maximum Size Square of All 1's in Haskell Tags: algorithm, functional-programming, haskell Problem: Maximum Size Square of All 1's in Haskell if I have a matrix m = 0 0 1 1 0 0 1 1 1 0 1 0 1 1 1 1 1 1 1 1 0 1 1 1 1 How do I find the the largest n...

Maximum Size Square of All 1's in Haskell Maximum Size Square of All 1's in Haskell algorithm functional-programming haskell Maximum Size Square All Haskell Maximum Size Square of All 1's in Haskell if I have a matrix How do I find the the largest nXn sub matrix of m that is just 1's? This seems an OK problem...

[ 0.0172119140625, 0.0167236328125, 0.0036773681640625, -0.01080322265625, 0.0035247802734375, 0.0184326171875, -0.0106201171875, 0.00775146484375, 0.0076904296875, -0.01318359375, 0.006622314453125, -0.0027618408203125, 0.00909423828125, -0.00921630859375, -0.0079345703125, 0.0134277343...

[ 46540, 316, 80378, 68305, 111, 3164, 106, 3768, 20625, 142508, 234873, 123309, 28966, 1556, 765, 50944, 7413, 70, 142105, 653, 1542, 19, 1614, 425, 347, 1660, 2967, 222530, 46876, 118664, 33636, 35166, 103136, 7108, 138, 363 ]

[ 0.1597900390625, 0.0396728515625, 0.1754150390625, 0.1678466796875, 0.040374755859375, 0.126220703125, 0.1156005859375, 0.04656982421875, 0.1270751953125, 0.216796875, 0.09222412109375, 0.0947265625, 0.05352783203125, 0.0958251953125, 0.018585205078125, 0.154296875, 0.11669921875, ...

embed

51905250_c0

51905250

haskell

0

Title: Haskell implementation of De-convolution (Richardson lucy) Problem title: Haskell implementation of De-convolution (Richardson lucy) Tags: image-processing, haskell, deconvolution Problem: Haskell implementation of De-convolution (Richardson lucy) I'm trying to implement an algorithm of de-convolution in Haskell...

Haskell implementation of De-convolution (Richardson lucy) Haskell implementation of De-convolution (Richardson lucy) image-processing haskell deconvolution Haskell De-convolution Richardson Haskell implementation of De-convolution (Richardson lucy) I'm trying to implement an algorithm of de-convolution in Haskell and ...

[ -0.01116943359375, 0.0164794921875, -0.00115203857421875, 0.0244140625, 0.0123291015625, 0.0263671875, -0.0103759765625, -0.00628662109375, -0.0024261474609375, -0.01251220703125, 0.01165771484375, -0.013427734375, 0.0198974609375, 0.03466796875, -0.01031494140625, 0.005523681640625, ...

[ 20625, 142508, 208124, 111, 262, 9, 2271, 137089, 15, 23267, 9254, 71, 1681, 3480, 2408, 16, 29569, 63923, 1556, 8, 22758, 31577, 29479, 234873, 23, 69427, 7413, 8781, 42, 1632, 3501, 131931, 144573, 2589, 6114, 64, 6493, 50828, 51, 2886,...

[ 0.1781005859375, 0.29296875, 0.202392578125, 0.0113525390625, 0.27978515625, 0.09033203125, 0.11474609375, 0.2462158203125, 0.0153961181640625, 0.06341552734375, 0.0650634765625, 0.058319091796875, 0.173828125, 0.1229248046875, 0.1617431640625, 0.0147552490234375, 0.171630859375, 0...

embed

7603186_c1

7603186

haskell

1

2.16572\gl ib-0.12.1\dist\setup\Main.o ) Linking C:\Users\User\AppData\Local\Temp\glib-0.12.16572\glib-0.12.1\dist\setup\ setup.exe ... Warning: .drectve `-aligncomm:___gmp_junk,2' unrecognized cabal: Error: some packages failed to install: glib-0.12.1 failed during the configure step. The exception was: C:\Users\User\...

[ 0.00007963180541992188, -0.0037384033203125, 0.006927490234375, 0.00127410888671875, -0.004425048828125, 0.01422119140625, -0.00003266334533691406, -0.00555419921875, -0.009521484375, 0.03369140625, -0.01446533203125, -0.0185546875, 0.004669189453125, 0.0020751953125, -0.004638671875, ...

[ 787, 2485, 177917, 11016, 2566, 102014, 68107, 46295, 3509, 2037, 168793, 31, 12779, 214, 1062, 7, 1314, 2189, 39179, 137989, 203758, 159065, 5612, 15654, 169581, 5, 46480, 5550, 592, 173247, 272, 143420, 277, 39, 2676, 34002, 304, 115558, ...

[ 0.02447509765625, 0.1341552734375, 0.2169189453125, 0.1461181640625, 0.14794921875, 0.146484375, 0.231689453125, 0.1282958984375, 0.121337890625, 0.1495361328125, 0.1375732421875, 0.164306640625, 0.170654296875, 0.08917236328125, 0.0672607421875, 0.086669921875, 0.00604248046875, 0...

embed

6878193_c1

6878193

haskell

1

' 1 . (This might happen, for example, if we're memoizing a function which is being called recursively over some large data structure with a lot of structural sharing.) If we've already computed our memoized function on that exact object before, we can already know the answer, even without looking at the object itself!...

[ -0.006195068359375, -0.0152587890625, 0.0240478515625, 0.0128173828125, 0.015869140625, 0.01080322265625, 0.000705718994140625, 0.01129150390625, 0.030029296875, -0.020751953125, 0.0108642578125, -0.0137939453125, 0.01312255859375, 0.00933837890625, 0.0186767578125, -0.01080322265625, ...

[ 242, 106, 5, 73243, 13648, 53383, 27781, 163, 432, 84382, 32354, 35839, 195625, 5844, 645, 2053, 45646, 5915, 118990, 53371, 4263, 642, 272, 21771, 375, 7077, 297, 2446, 29367, 98, 24763, 36746, 8108, 831, 3714, 35166, 3853, 15490, 16487, ...

[ 0.043914794921875, 0.02392578125, 0.01934814453125, 0.004608154296875, 0.037261962890625, 0.05743408203125, 0.00140380859375, 0.2122802734375, 0.24951171875, 0.210693359375, 0.1549072265625, 0.0826416015625, 0.136474609375, 0.07037353515625, 0.026763916015625, 0.1121826171875, 0.1094...

embed

5684049_c0

5684049

haskell

0

Title: Is there some way to define an Enum in haskell that wraps around? Problem title: Is there some way to define an Enum in haskell that wraps around? Tags: haskell Problem: Is there some way to define an Enum in haskell that wraps around? Consider I was designing a Monopoly game: data Board = GO | A1 | CC1 | A2 | T...

Is there some way to define an Enum in haskell that wraps around? Is there some way to define an Enum in haskell that wraps around? haskell Enum Board CC1 CH1 JAIL CC2 CH2 G2J CC3 CH3 Show Exception Is there some way to define an Enum in haskell that wraps around? Consider I was designing a Monopoly game: I want: But i...

[ -0.0201416015625, -0.01251220703125, -0.0069580078125, 0.0172119140625, 0.005157470703125, -0.01080322265625, -0.0020294189453125, -0.00872802734375, -0.006103515625, -0.004669189453125, 0.0010528564453125, 0.0087890625, 0.007598876953125, 0.0076904296875, 0.00311279296875, -0.00124359...

[ 3060, 3917, 61924, 357, 316, 23, 1556, 142508, 450, 137565, 7, 10932, 62554, 21581, 14045, 9846, 16444, 1375, 363, 17367, 5443, 63928, 142, 137399, 4331, 77879, 135545, 6712, 3444, 64457, 10644, 67413, 36510, 189085, 1363 ]

[ 0.03240966796875, 0.06768798828125, 0.19921875, 0.146240234375, 0.2474365234375, 0.02801513671875, 0.129638671875, 0.228515625, 0.0435791015625, 0.184814453125, 0.0733642578125, 0.1767578125, 0.125732421875, 0.0084228515625, 0.027435302734375, 0.0906982421875, 0.0902099609375, 0.05...

embed

12822808_c0

12822808

haskell

0

Title: How do you derive Show for type defined in someone else's library? Problem title: How do you derive Show for type defined in someone else's library? Tags: typeclass, haskell Problem: How do you derive Show for type defined in someone else's library? I'm using a Haskell library for OAuth and the author ...

How do you derive Show for type defined in someone else's library? How do you derive Show for type defined in someone else's library? typeclass haskell How Show How do you derive Show for type defined in someone else's library? I'm using a Haskell library for OAuth and the author didn't derive Show for a type...

[ 0.00555419921875, 0.015869140625, -0.000522613525390625, 0.0174560546875, 0.004302978515625, -0.020751953125, 0.00634765625, 0.0013427734375, 0.0016937255859375, -0.00799560546875, -0.0198974609375, -0.029296875, 0.0147705078125, 0.01953125, -0.007354736328125, -0.01068115234375, -0....

[ 11249, 122, 5844, 17367, 100, 10644, 61924, 37076, 3768, 35773, 1294, 23, 22008, 67413, 1556, 142508, 54, 20625, 180, 67362, 927, 42179, 18, 17368, 28412, 1810, 8, 978, 1884, 442, 3917, 50782, 32354, 71200, 17164, 44457, 717, 1098, 28997, ...

[ 0.09051513671875, 0.14013671875, 0.17578125, 0.30712890625, 0.0836181640625, 0.2191162109375, 0.1396484375, 0.06805419921875, 0.006439208984375, 0.1614990234375, 0.081787109375, 0.06793212890625, 0.035125732421875, 0.14501953125, 0.090087890625, 0.1917724609375, 0.0264434814453125, ...

embed

53251440_c0

53251440

haskell

0

Title: Haskell Pattern matching in a Function Problem title: Haskell Pattern matching in a Function Tags: haskell Problem: Haskell Pattern matching in a Function The two-argument function check returns True exactly when both Boolean operands have the same value. Otherwise it returns False. I should implement it using :...

Haskell Pattern matching in a Function Haskell Pattern matching in a Function haskell Haskell Pattern Bool Haskell Pattern matching in a Function The two-argument function check returns True exactly when both Boolean operands have the same value. Otherwise it returns False. I should implement it using : 1)- Conditional...

[ 0.002288818359375, 0.00799560546875, 0.0098876953125, 0.004302978515625, 0.00897216796875, 0.00958251953125, -0.027099609375, 0.004119873046875, 0.00396728515625, 0.02685546875, 0.00860595703125, -0.0023956298828125, -0.0087890625, -0.01318359375, 0.01385498046875, 0.00799560546875, ...

[ 20625, 142508, 9876, 22766, 14858, 214, 23, 28670, 10763, 1556, 2460, 929, 6626, 155937, 32354, 12765, 30646, 87599, 66161, 3229, 15044, 73783, 34677, 6264, 2208, 765, 5701, 34292, 90825, 22225, 184, 29479, 17368, 4879, 46347, 125195, 78292, ...

[ 0.1544189453125, 0.231201171875, 0.1964111328125, 0.218505859375, 0.257568359375, 0.116943359375, 0.03643798828125, 0.14404296875, 0.007843017578125, 0.139892578125, 0.0904541015625, 0.1904296875, 0.1806640625, 0.2271728515625, 0.132080078125, 0.22265625, 0.1466064453125, 0.1636962...

embed

8360030_c0

8360030

haskell

0

Title: hierarchical data types Problem title: hierarchical data types Tags: haskell Problem: hierarchical data types I would like to define data types hierarchically, such as: data Cat = BigCat | SmallCat data Animal = Cat | Dog And then write a function that will take Animals as arguments, and write it with pattern ma...

hierarchical data types hierarchical data types haskell Cat BigCat SmallCat Animal Dog bigger::Animal Bool hierarchical data types I would like to define data types hierarchically, such as: And then write a function that will take Animals as arguments, and write it with pattern matching like this: The compiler complain...

[ 0.00084686279296875, 0.006866455078125, -0.0164794921875, 0.0172119140625, -0.005584716796875, -0.01806640625, -0.005767822265625, -0.00811767578125, -0.0166015625, -0.007415771484375, -0.00144195556640625, -0.0281982421875, 0.0014495849609375, -0.006866455078125, 0.011962890625, -0.00...

[ 1791, 54689, 6827, 2053, 52895, 1556, 142508, 18826, 14195, 76775, 105508, 82821, 41129, 167785, 93, 2749, 2460, 929, 1884, 61924, 59438, 33022, 32354, 5646, 7, 237, 10750, 103510, 14858, 9969, 34759, 186992, 18, 3444, 10644, 143726, 59121, 1...

[ 0.1507568359375, 0.1727294921875, 0.045257568359375, 0.1595458984375, 0.23095703125, 0.15576171875, 0.25048828125, 0.186279296875, 0.0904541015625, 0.1923828125, 0.09307861328125, 0.19384765625, 0.132080078125, 0.1236572265625, 0.0994873046875, 0.0755615234375, 0.05572509765625, 0....

embed

67456386_c0

67456386

haskell

0

Title: Dispatch on union types in Haskell Problem title: Dispatch on union types in Haskell Tags: haskell, types, typeclass Problem: Dispatch on union types in Haskell I'm trying to write a function that is polymorphic on a String or Num argument in Haskell. I've written some pseudocode that doesn't compile: numDigits ...

Dispatch on union types in Haskell Dispatch on union types in Haskell haskell types typeclass Dispatch Haskell Should Dispatch on union types in Haskell I'm trying to write a function that is polymorphic on a String or Num argument in Haskell. I've written some pseudocode that doesn't compile: Note isString and isNum a...

[ -0.0062255859375, 0.0150146484375, -0.0021514892578125, 0.0020751953125, -0.018798828125, 0.000423431396484375, 0.0033721923828125, -0.005584716796875, -0.00341796875, -0.0179443359375, 0.0033416748046875, -0.038818359375, -0.00262451171875, 0.00286865234375, -0.01385498046875, -0.0177...

[ 6206, 4453, 206, 98, 69941, 52895, 20625, 142508, 23, 1556, 10644, 67413, 151117, 31577, 33022, 32354, 35874, 178851, 1771, 23351, 214, 707, 52782, 10750, 59121, 74189, 40899, 22027, 18, 9969, 1340, 83, 71713, 136, 839, 316, 959, 2773, 1660...

[ 0.12060546875, 0.173828125, 0.1219482421875, 0.1165771484375, 0.2330322265625, 0.224365234375, 0.1319580078125, 0.24755859375, 0.043243408203125, 0.1044921875, 0.1827392578125, 0.21484375, 0.0977783203125, 0.010955810546875, 0.054718017578125, 0.1240234375, 0.115966796875, 0.187744...

embed

6883200_c0

6883200

haskell

0

Title: Haskell - add typeclass? Problem title: Haskell - add typeclass? Tags: typeclass, haskell, operator-overloading Problem: Haskell - add typeclass? Consider the following example: data Dot = Dot Double Double data Vector = Vector Double Double First, i would like to overload + operator for Vector addition. If i wa...

Haskell - add typeclass? Haskell - add typeclass? typeclass haskell operator-overloading Haskell Dot Double Vector Add Haskell - add typeclass? Consider the following example: First, i would like to overload + operator for Vector addition. If i wanted to overload equality( == ) operator, i would write it like: But I ca...

[ -0.000782012939453125, 0.0281982421875, 0.001861572265625, 0.033447265625, 0.006317138671875, 0.01055908203125, -0.0042724609375, -0.0054931640625, -0.01708984375, -0.0272216796875, -0.011474609375, -0.046875, 0.00634765625, -0.00567626953125, -0.042236328125, -0.011474609375, -0.010...

[ 20625, 142508, 20, 15190, 10644, 67413, 32, 1556, 39933, 5465, 63033, 214, 84929, 107172, 2609, 18770, 29117, 27781, 1884, 645, 997, 66044, 36663, 28, 161789, 69112, 2806, 33022, 7413, 186, 68991, 678, 41018, 28484, 5303, 3714, 10846, 57143, ...

[ 0.1339111328125, 0.250244140625, 0.05853271484375, 0.1600341796875, 0.1966552734375, 0.275634765625, 0.03643798828125, 0.114990234375, 0.194091796875, 0.107177734375, 0.190185546875, 0.006683349609375, 0.183349609375, 0.1475830078125, 0.159423828125, 0.1683349609375, 0.1151123046875,...

embed

70147390_c0

70147390

haskell

0

Title: How can I return a lambda with guards and double recursion? Problem title: How can I return a lambda with guards and double recursion? Tags: return-type, recursion, lambda, haskell, function Problem: How can I return a lambda with guards and double recursion? I made this function in Python: def calc(a): return l...

How can I return a lambda with guards and double recursion? How can I return a lambda with guards and double recursion? return-type recursion lambda haskell function How How can I return a lambda with guards and double recursion? I made this function in Python: So you can make a calculation like this: And the result wi...

[ -0.010498046875, -0.0024261474609375, 0.0030975341796875, -0.00799560546875, 0.0224609375, -0.0113525390625, -0.0029449462890625, -0.0033111572265625, 0.0167236328125, -0.031982421875, 0.0062255859375, -0.0390625, -0.00921630859375, -0.003631591796875, 0.01123046875, 0.0008430480957031...

[ 11249, 831, 30646, 21, 6492, 85, 678, 56050, 7, 136, 41929, 195625, 1830, 50986, 1556, 142508, 32354, 7228, 145581, 3249, 74481, 1884, 903, 16750, 190, 6165, 20625, 30698, 1124, 366, 184, 18499, 18151, 33342 ]

[ 0.0484619140625, 0.05499267578125, 0.224609375, 0.092529296875, 0.21533203125, 0.189208984375, 0.09521484375, 0.25244140625, 0.113037109375, 0.06414794921875, 0.1683349609375, 0.213134765625, 0.084716796875, 0.171142578125, 0.10076904296875, 0.2203369140625, 0.142578125, 0.00338745...

embed

31590560_c0

31590560

haskell

0

Title: Typeclasses 101: GHC too "eager" to derive instance? Problem title: Typeclasses 101: GHC too "eager" to derive instance? Tags: instances, haskell Problem: Typeclasses 101: GHC too "eager" to derive instance? Given the following code: class C a where foo :: a -> a f :: (C a) => a -> a f = id p...

Typeclasses 101: GHC too "eager" to derive instance? Typeclasses 101: GHC too "eager" to derive instance? instances haskell a Typeclasses GHC Typeclasses 101: GHC too "eager" to derive instance? Given the following code: Now, if I try to invoke p f, GHC complains: I find that somewhat surprising, si...

[ 0.017333984375, 0.0052490234375, 0.0093994140625, 0.00482177734375, 0.013916015625, 0.01153564453125, 0.003631591796875, -0.001861572265625, -0.01171875, -0.02294921875, -0.0166015625, 0.00177001953125, -0.0048828125, -0.000797271728515625, -0.00180816650390625, -0.0164794921875, 0.0...

[ 60457, 67413, 21027, 12, 527, 73265, 5792, 41502, 13, 33730, 122, 5844, 110527, 90, 47, 32, 1556, 142508, 77878, 25632, 18151, 14240, 9790, 23, 23253, 915, 1238, 186992, 7413, 208806, 212615, 4734, 26946, 142, 11, 3129, 10644, 313, 31635, ...

[ 0.18798828125, 0.2257080078125, 0.2022705078125, 0.0184783935546875, 0.1202392578125, 0.2388916015625, 0.141357421875, 0.00982666015625, 0.09765625, 0.2191162109375, 0.107666015625, 0.10791015625, 0.2259521484375, 0.029815673828125, 0.051422119140625, 0.005767822265625, 0.11584472656...

embed

25955495_c0

25955495

haskell

0

Title: Yesod tutorial compile error: Not in scope: ‘runResourceT’ Problem title: Yesod tutorial compile error: Not in scope: ‘runResourceT’ Tags: yesod, haskell Problem: Yesod tutorial compile error: Not in scope: ‘runResourceT’ experts I'm following the Yesod tutorial on fpcomplete (part 3) https://www.fpcomplete.com/...

Yesod tutorial compile error: Not in scope: ‘runResourceT’ Yesod tutorial compile error: Not in scope: ‘runResourceT’ yesod haskell Yesod Not Yesod tutorial compile error: Not in scope: ‘runResourceT’ experts I'm following the Yesod tutorial on fpcomplete (part 3) https://www.fpcomplete.com/school/advanced-haskell/buil...

[ -0.01513671875, 0.01953125, 0.002532958984375, 0.0021209716796875, -0.009033203125, 0.017333984375, -0.00872802734375, -0.007720947265625, -0.01507568359375, -0.048095703125, -0.00823974609375, 0.000011026859283447266, 0.00109100341796875, 0.006744384765625, 0.0184326171875, 0.00625610...

[ 32635, 2199, 57143, 9969, 1340, 18499, 11205, 23, 70820, 16428, 4332, 60427, 618, 2422, 23722, 1556, 142508, 78688, 25632, 277, 131801, 17365, 8439, 48738, 157000, 10557, 146049, 29822, 40294, 22584, 1033, 363, 179933, 13452, 10639, 603, 55376,...

[ 0.1964111328125, 0.247802734375, 0.2110595703125, 0.161376953125, 0.1317138671875, 0.1734619140625, 0.185546875, 0.114013671875, 0.23876953125, 0.1678466796875, 0.1063232421875, 0.1976318359375, 0.18603515625, 0.1048583984375, 0.2069091796875, 0.10040283203125, 0.178466796875, 0.17...

embed

19819557_c0

19819557

haskell

0

Title: Specializing a function for distinctly typed parameters Problem title: Specializing a function for distinctly typed parameters Tags: functional-dependencies, haskell Problem: Specializing a function for distinctly typed parameters I'd like to write a function bar :: Foo a -> Foo b -> Foo c , such that if a and b...

Specializing a function for distinctly typed parameters Specializing a function for distinctly typed parameters functional-dependencies haskell Specializing Foo Bar Specializing a function for distinctly typed parameters I'd like to write a function bar :: Foo a -> Foo b -> Foo c , such that if a and b is the same type...

[ 0.021728515625, -0.00714111328125, -0.01287841796875, -0.01904296875, 0.0025634765625, 0.005828857421875, -0.0169677734375, -0.007049560546875, 0.0172119140625, 0.033447265625, -0.0198974609375, -0.01458740234375, 0.00872802734375, 0.0036468505859375, -0.02294921875, -0.00946044921875,...

[ 25132, 84382, 32354, 100, 117781, 538, 10644, 71, 171859, 123309, 105254, 13, 1556, 142508, 9572, 31, 3253, 1884, 33022, 1909, 1984, 10, 33079, 876, 501, 6044, 450, 2174, 136, 83, 5701, 7068, 111, 120262, 15, 92610, 42548, 117538, 4358, 8...

[ 0.225341796875, 0.115966796875, 0.2125244140625, 0.0997314453125, 0.197509765625, 0.04779052734375, 0.21240234375, 0.0660400390625, 0.1962890625, 0.1395263671875, 0.1175537109375, 0.014434814453125, 0.110107421875, 0.2003173828125, 0.150390625, 0.1287841796875, 0.2071533203125, 0.0...

embed

42988226_c0

42988226

haskell

0

Title: Haskell: test if list length < 4 Problem title: Haskell: test if list length < 4 Tags: haskell Problem: Haskell: test if list length < 4 I have the following haskell function that returns Nothing if the String is shorter than 4 characters: stringToMove :: String -> Maybe Move stringToMove [] = Nothing stri...

Haskell: test if list length < 4 Haskell: test if list length < 4 haskell Haskell Nothing Maybe Move l1:n1:l2:n2:rest Just Haskell: test if list length < 4 I have the following haskell function that returns Nothing if the String is shorter than 4 characters: I could test on length string , but as far as I read, t...

[ -0.0196533203125, 0.0181884765625, 0.00104522705078125, 0.0172119140625, -0.0030517578125, 0.00506591796875, 0.017822265625, 0.0016021728515625, 0.0089111328125, 0.00970458984375, -0.01312255859375, -0.0189208984375, -0.002471923828125, -0.0145263671875, -0.01043701171875, -0.001594543...

[ 20625, 142508, 3034, 2174, 5303, 140909, 1277, 201, 1556, 182747, 83425, 135828, 96, 82825, 304, 56644, 4426, 32354, 30646, 23351, 214, 83, 16610, 56, 3501, 124850, 79315, 959, 3917, 32562, 903, 4989, 756, 151575, 27650, 119140, 12638, 13315 ...

[ 0.13134765625, 0.215087890625, 0.1995849609375, 0.118408203125, 0.185791015625, 0.1527099609375, 0.0274505615234375, 0.193115234375, 0.1268310546875, 0.2113037109375, 0.1544189453125, 0.1910400390625, 0.01434326171875, 0.0195159912109375, 0.017303466796875, 0.1695556640625, 0.0961914...

embed

69412062_c0

69412062

haskell

0

Title: How do I disable `-Werror` only when compiling as a library? Problem title: How do I disable `-Werror` only when compiling as a library? Tags: haskell-stack, haskell Problem: How do I disable `-Werror` only when compiling as a library? I have ghc-options: - -Wall - -Werror in my package.yaml and it builds fine f...

How do I disable `-Werror` only when compiling as a library? How do I disable `-Werror` only when compiling as a library? haskell-stack haskell How Werror Wall package.yaml Wwarn How do I disable `-Werror` only when compiling as a library? I have in my package.yaml and it builds fine for GHC 8.6. But when using the pro...

[ -0.006683349609375, -0.01385498046875, -0.009521484375, -0.013427734375, -0.00927734375, -0.00183868408203125, -0.038818359375, 0.0037689208984375, 0.0078125, 0.017578125, -0.012451171875, -0.037841796875, 0.0223388671875, 0.015625, 0.0032958984375, -0.0069580078125, 0.00239562988281...

[ 11249, 2837, 2886, 9, 1456, 188800, 4734, 3229, 9969, 49725, 237, 35773, 1294, 1556, 142508, 590, 2594, 601, 23706, 98169, 14520, 141, 4205, 19, 9473, 45367, 5885, 527, 73265, 382, 43652, 17368, 13452, 483, 18151, 37382, 18499, 51, 7432, ...

[ 0.1309814453125, 0.1282958984375, 0.2188720703125, 0.07220458984375, 0.1051025390625, 0.33544921875, 0.10552978515625, 0.0865478515625, 0.16162109375, 0.157470703125, 0.1148681640625, 0.180908203125, 0.08612060546875, 0.077880859375, 0.2030029296875, 0.0574951171875, 0.07373046875, ...

embed