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
35023606_c0	35023606	haskell	0	Title: How to implement a simple Subtractable type class Problem title: How to implement a simple Subtractable type class Tags: typeclass, haskell Problem: How to implement a simple Subtractable type class I want to make a type class for subtractable types such that The value type implements Ord . There is a subtract f...	How to implement a simple Subtractable type class How to implement a simple Subtractable type class typeclass haskell How Subtractable Ord UTCTime Double Num Delta NominalDiffTime How to implement a simple Subtractable type class I want to make a type class for subtractable types such that The value type implements Ord...	[ -0.0069580078125, -0.020751953125, 0.015869140625, 0.00946044921875, -0.019775390625, 0.00933837890625, -0.0380859375, 0.002227783203125, 0.004364013671875, 0.0067138671875, -0.0181884765625, -0.043701171875, 0.0013580322265625, 0.0228271484375, -0.0191650390625, -0.00335693359375, -...	[ 11249, 29479, 8781, 8273, 39989, 22819, 10644, 18507, 47, 67413, 1556, 142508, 35379, 99577, 70059, 107172, 52782, 56588, 1249, 32920, 3444, 3249, 1614, 52895, 34292, 18, 32354, 8060, 136, 360, 1543, 129927, 31344, 40703, 438, 289, 5701, 7133...	[ 0.062255859375, 0.2191162109375, 0.1966552734375, 0.123046875, 0.1904296875, 0.1619873046875, 0.2115478515625, 0.2274169921875, 0.017059326171875, 0.2061767578125, 0.1044921875, 0.209716796875, 0.174072265625, 0.1220703125, 0.1844482421875, 0.1119384765625, 0.1890869140625, 0.18884...	embed
36241024_c0	36241024	haskell	0	Title: Where is (or why not exist) one `Indexed` type class more generic than `Data.Array`? Problem title: Where is (or why not exist) one `Indexed` type class more generic than `Data.Array`? Tags: haskell, typeclass, indexing Problem: Where is (or why not exist) one `Indexed` type class more generic than `Data.Array`?...	Where is (or why not exist) one `Indexed` type class more generic than `Data.Array`? Where is (or why not exist) one `Indexed` type class more generic than `Data.Array`? haskell typeclass indexing Where Indexed Data.Array T.Text Char T.length T.index Data.Text Data.ByteString Where is (or why not exist) one `Indexed` t...	[ -0.00872802734375, 0.006866455078125, 0.01507568359375, 0, 0.000946044921875, -0.013671875, -0.002960205078125, -0.0024871826171875, 0.029541015625, -0.01116943359375, -0.0020751953125, -0.0185546875, -0.0016326904296875, -0.009033203125, -0.006439208984375, -0.018310546875, 0.007476...	[ 78662, 15400, 32316, 1632, 4153, 39659, 297, 10644, 18507, 1286, 189534, 3501, 137989, 7614, 7092, 1556, 142508, 67413, 63262, 214, 31471, 11809, 384, 174379, 21656, 23986, 4711, 75358, 67, 71713, 959, 16487, 17368, 87, 425, 2499, 2886, 36716...	[ 0.0670166015625, 0.038360595703125, 0.1123046875, 0.0538330078125, 0.059173583984375, 0.213134765625, 0.124267578125, 0.163818359375, 0.21875, 0.1121826171875, 0.22607421875, 0.044830322265625, 0.0999755859375, 0.0560302734375, 0.15185546875, 0.0870361328125, 0.1973876953125, 0.138...	embed
16201041_c0	16201041	haskell	0	Title: Haskell Return Doesn't Match Expected Problem title: Haskell Return Doesn't Match Expected Tags: return-type, return, haskell Problem: Haskell Return Doesn't Match Expected Could someone tell me why the following code doesn't work? test :: String test = do return ("Hi") I've been struggling to make the...	Haskell Return Doesn't Match Expected Haskell Return Doesn't Match Expected return-type return haskell Haskell Doesn Match Expected Test.hs:5:21 Couldn Char Haskell Return Doesn't Match Expected Could someone tell me why the following code doesn't work? I've been struggling to make the do statement work for a...	[ -0.0091552734375, 0.00408935546875, 0.00933837890625, 0.01904296875, 0.006011962890625, 0.0125732421875, 0.003509521484375, -0.005279541015625, 0.00445556640625, 0.0302734375, 0.00787353515625, -0.038330078125, 0.00323486328125, -0.0002956390380859375, -0.0140380859375, 0.0068054199218...	[ 20625, 142508, 173340, 101790, 19, 3768, 18, 67407, 60075, 13, 89829, 30646, 50986, 1556, 8647, 25619, 191147, 21656, 15400, 25632, 18151, 22027, 4488, 237875, 54, 63805, 12960, 1608, 2967, 46526, 53697, 22021, 10554, 18499, 28641, 1957, 164789...	[ 0.1270751953125, 0.219970703125, 0.226806640625, 0.049530029296875, 0.000213623046875, 0.0577392578125, 0.09765625, 0.1915283203125, 0.1014404296875, 0.108642578125, 0.0255584716796875, 0.204833984375, 0.1619873046875, 0.10107421875, 0.11083984375, 0.0229949951171875, 0.0629272460937...	embed
23851543_c0	23851543	haskell	0	Title: convert double to GLfloat in Haskell Problem title: convert double to GLfloat in Haskell Tags: double, haskell, opengl, floating-point-conversion Problem: convert double to GLfloat in Haskell I want to convert a Double to a GLfloat. I want to use it for comparations. xM <- newIORef 0.0 zM <- newIORef 0.0 mobs <-...	convert double to GLfloat in Haskell convert double to GLfloat in Haskell double haskell opengl floating-point-conversion GHC.Float GLfloat Haskell mapM_ Dead Warning d2f GLdouble convert double to GLfloat in Haskell I want to convert a Double to a GLfloat. I want to use it for comparations. mobs is fulled with a metho...	[ 0.00225830078125, -0.00433349609375, -0.0024871826171875, -0.01153564453125, 0.033447265625, 0.0142822265625, -0.0234375, -0.0189208984375, 0.00131988525390625, -0.0035247802734375, 0.003448486328125, -0.0164794921875, 0.005828857421875, -0.0260009765625, -0.0022735595703125, 0.0103149...	[ 96760, 41929, 47, 90799, 52347, 257, 23, 20625, 142508, 1556, 9803, 11016, 21917, 26518, 38496, 2271, 46354, 527, 73265, 919, 365, 22288, 594, 51952, 5550, 592, 104, 304, 420, 21555, 2661, 3444, 107172, 10, 4527, 31898, 81158, 7, 4393, 67...	[ 0.181396484375, 0.239501953125, 0.1309814453125, 0.185791015625, 0.260986328125, 0.175048828125, 0.07366943359375, 0.15087890625, 0.253173828125, 0.1197509765625, 0.1192626953125, 0.216796875, 0.1927490234375, 0.0977783203125, 0.16259765625, 0.076171875, 0.14453125, 0.0892333984375...	embed
47251628_c0	47251628	haskell	0	Title: How to write this as a recursive Haskell function? Problem title: How to write this as a recursive Haskell function? Tags: haskell, recursion, syntax, sum Problem: How to write this as a recursive Haskell function? I'll illustrate what I want to do using Python (I want to write this in Haskell). I have this func...	How to write this as a recursive Haskell function? How to write this as a recursive Haskell function? haskell recursion syntax sum How Haskell d-1 input_line How to write this as a recursive Haskell function? I'll illustrate what I want to do using Python (I want to write this in Haskell). I have this function: Which i...	[ -0.0322265625, 0.000530242919921875, -0.0029296875, 0.00084686279296875, -0.01202392578125, -0.00008630752563476562, 0.0059814453125, -0.00830078125, -0.0047607421875, -0.01904296875, 0.01287841796875, -0.0302734375, -0.0157470703125, 0.01422119140625, 0.004302978515625, -0.00083160400...	[ 11249, 47, 33022, 903, 237, 195625, 5844, 20625, 142508, 32354, 1556, 1830, 6002, 86531, 10554, 104, 5759, 107730, 2256, 58755, 17368, 145581, 198343, 40956, 214, 1295, 33000, 653, 55128, 166, 58838, 142424, 20028, 74912, 64, 71, 3444, 54, ...	[ 0.09906005859375, 0.136962890625, 0.18408203125, 0.09075927734375, 0.1087646484375, 0.2308349609375, 0.156982421875, 0.145263671875, 0.2381591796875, 0.20263671875, 0.133056640625, 0.09661865234375, 0.029754638671875, 0.059326171875, 0.201416015625, 0.1776123046875, 0.2008056640625, ...	embed
65460456_c0	65460456	haskell	0	Title: Are Haskell guards evaluated sequentially? Problem title: Are Haskell guards evaluated sequentially? Tags: haskell Problem: Are Haskell guards evaluated sequentially? What is the order in which Haskell guards are evaluated? Say that I have a function which returns a Bool: someFunc :: Bool -> Bool -> Bool someFun...	Are Haskell guards evaluated sequentially? Are Haskell guards evaluated sequentially? haskell Haskell Bool val1 action1 val2 action2 action3 Are Haskell guards evaluated sequentially? What is the order in which Haskell guards are evaluated? Say that I have a function which returns a Bool: I think it was with Monads and...	[ -0.00016021728515625, 0.0018310546875, 0.0218505859375, -0.00144195556640625, 0.0130615234375, -0.000858306884765625, -0.01141357421875, -0.0157470703125, -0.0076904296875, 0.028076171875, 0.006744384765625, -0.00537109375, -0.0054931640625, 0.00020313262939453125, -0.004669189453125, ...	[ 20625, 142508, 56050, 7, 151575, 297, 243228, 25958, 1556, 2460, 929, 3502, 22631, 304, 363, 12989, 32354, 30646, 60331, 6468, 984, 157, 61972, 68018, 959, 74481, 8108, 5117, 63805, 22225, 17932, 87599, 103876, 876, 184, 62775, 11343, 16401, ...	[ 0.1278076171875, 0.2342529296875, 0.2493896484375, 0.0841064453125, 0.1734619140625, 0.057373046875, 0.1689453125, 0.06036376953125, 0.101318359375, 0.07135009765625, 0.1719970703125, 0.1141357421875, 0.09326171875, 0.07159423828125, 0.045867919921875, 0.1351318359375, 0.116455078125...	embed
56218986_c1	56218986	haskell	1	10 \| main = display window backgroundColor (grid++units) \| ^^^^ /home/georg/Desktop/THM/6_semester/funktionale_programmierung/my/app/Main.hs:10:40: error: • Couldn't match expected type ‘Picture’ with actual type ‘[a0]’ • In the third argument of ‘display’, namely ‘(grid ++ units)’ In the expression: display window ba...	10 \| main = display window backgroundColor (grid++units) \| ^^^^ /home/georg/Desktop/THM/6_semester/funktionale_programmierung/my/app/Main.hs:10:40: error: • Couldn't match expected type ‘Picture’ with actual type ‘[a0]’ • In the third argument of ‘display’, namely ‘(grid ++ units)’ In the expression: display window ba...	[ -0.00628662109375, 0.016845703125, 0.00115203857421875, 0.018310546875, -0.0142822265625, -0.002838134765625, -0.002105712890625, -0.01385498046875, -0.0038299560546875, -0.00286865234375, 0.006072998046875, -0.01123046875, 0.0177001953125, 0.0076904296875, -0.0111083984375, 0.00150299...	[ 209, 58745, 5201, 2203, 44116, 76896, 76615, 10625, 1484, 120067, 37223, 309, 14481, 16377, 15729, 29552, 1478, 4657, 1042, 13784, 23415, 594, 20155, 184, 33787, 64558, 1935, 28966, 13976, 1176, 9007, 168793, 127, 15110, 22932, 18499, 768, 19...	[ 0.1915283203125, 0.014312744140625, 0.23486328125, 0.078125, 0.1849365234375, 0.1788330078125, 0.25, 0.103515625, 0.185546875, 0.2127685546875, 0.2259521484375, 0.1123046875, 0.0738525390625, 0.049591064453125, 0.0367431640625, 0.0926513671875, 0.1512451171875, 0.10302734375, 0.0...	embed
64140299_c1	64140299	haskell	1	it had an Either type), I could simply do something like this: List<Either<String, ?>> list = asList(foo, bar); And it would have worked just fine, type safe and whatnot. Is there a type variable wildcard in Haskell corresponding to ? in Java? If not, how do you deal with such cases where you don't care about a certai...	it had an Either type), I could simply do something like this: List<Either<String, ?>> list = asList(foo, bar); And it would have worked just fine, type safe and whatnot. Is there a type variable wildcard in Haskell corresponding to ? in Java? If not, how do you deal with such cases where you don't care about a certai...	[ -0.00046539306640625, -0.0062255859375, -0.003387451171875, -0.01904296875, -0.01263427734375, 0.011474609375, -0.0091552734375, -0.018798828125, 0.0169677734375, 0.015869140625, 0.012451171875, -0.03857421875, 0.0157470703125, -0.022216796875, -0.032958984375, -0.01171875, -0.006317...	[ 442, 1902, 4565, 9319, 10644, 5809, 42856, 54, 1884, 903, 32036, 647, 14, 71713, 214, 705, 5303, 237, 154663, 132, 3584, 31, 1909, 765, 79786, 1660, 5885, 46002, 2071, 2685, 77336, 56409, 38931, 20625, 142508, 42518, 23, 41925, 35142, 604...	[ 0.006988525390625, 0.0621337890625, 0.08740234375, 0.2166748046875, 0.2198486328125, 0.033203125, 0.06597900390625, 0.018035888671875, 0.02716064453125, 0.0213623046875, 0.1483154296875, 0.03265380859375, 0.07080078125, 0.1187744140625, 0.0274658203125, 0.14697265625, 0.1829833984375...	embed
1292212_c0	1292212	haskell	0	Title: how to solve "stack space overflow" in haskell Problem title: how to solve "stack space overflow" in haskell Tags: haskell, lazy-evaluation, recursion Problem: how to solve "stack space overflow" in haskell Running the following program will print "space overflow: current size 8388608 bytes."...	how to solve "stack space overflow" in haskell how to solve "stack space overflow" in haskell haskell lazy-evaluation recursion Data.List Main euler27 tuple_list how to solve "stack space overflow" in haskell Running the following program will print "space overflow: current size 8388608 bytes." I ha...	[ -0.01806640625, 0.019775390625, -0.0021514892578125, 0.005706787109375, 0.00160980224609375, 0.0107421875, -0.019775390625, -0.01318359375, 0.0238037109375, -0.039306640625, 0.0186767578125, -0.0006866455078125, -0.002349853515625, -0.00457763671875, 0.0146484375, -0.0198974609375, 0...	[ 3642, 47, 86869, 590, 2594, 32628, 645, 118664, 23, 1556, 142508, 21, 3285, 159258, 195625, 1830, 11809, 154663, 12321, 1175, 603, 3768, 370, 8705, 6562, 44, 28398, 25632, 1528, 1221, 28412, 65421, 43581, 13267, 382, 122545, 170285, 390, 16...	[ 0.076416015625, 0.07421875, 0.2181396484375, 0.16162109375, 0.1588134765625, 0.2283935546875, 0.149169921875, 0.265869140625, 0.0621337890625, 0.1488037109375, 0.2333984375, 0.094970703125, 0.179931640625, 0.1500244140625, 0.1400146484375, 0.0157470703125, 0.083984375, 0.1169433593...	embed
8593710_c0	8593710	haskell	0	Title: Cubesumming in haskell Problem title: Cubesumming in haskell Tags: haskell Problem: Cubesumming in haskell Haskell has the sum function sum :: Num a => [a] -> a Which can be nicely composed to sum a matrix by sum . map sum :: Num a => [[a]] -> a Going deeper, however, such as summing a cube, creates the restrict...	Cubesumming in haskell Cubesumming in haskell haskell Cubesumming Num Cubesumming in haskell Haskell has the sum function Which can be nicely composed to sum a matrix by Going deeper, however, such as summing a cube, creates the restriction Num [a] Which, if you think about it, is natural. So with the former attempt to...	[ 0.01165771484375, -0.00159454345703125, 0.0208740234375, 0.01611328125, 0.01361083984375, 0.000888824462890625, 0.004913330078125, -0.00128173828125, 0.01190185546875, -0.0162353515625, -0.009765625, -0.02880859375, 0.00238037109375, -0.00982666015625, -0.0194091796875, 0.0087890625, ...	[ 3003, 7438, 34, 58838, 1556, 142508, 23, 52782, 20625, 10554, 32354, 831, 26267, 150350, 47, 50944, 425, 390, 53894, 56, 49903, 166, 314, 372, 28282, 185190, 11, 6083, 81887, 61924, 1010, 102310, 2577, 12921, 60875, 29334, 87427, 13893, 729...	[ 0.15966796875, 0.110595703125, 0.164794921875, 0.1519775390625, 0.123046875, 0.2425537109375, 0.036865234375, 0.1722412109375, 0.12158203125, 0.2152099609375, 0.1505126953125, 0.0252227783203125, 0.04425048828125, 0.1005859375, 0.00946044921875, 0.1383056640625, 0.00592041015625, 0...	embed
58074459_c0	58074459	haskell	0	Title: Why does shrinking stop once one of the terms is fully shrunk Problem title: Why does shrinking stop once one of the terms is fully shrunk Tags: haskell, quickcheck Problem: Why does shrinking stop once one of the terms is fully shrunk I'm looking at the comments in shrink : It is tempting to write the last line...	Why does shrinking stop once one of the terms is fully shrunk Why does shrinking stop once one of the terms is fully shrunk haskell quickcheck Why Branch Why does shrinking stop once one of the terms is fully shrunk I'm looking at the comments in shrink : I'm a bit puzzled about this, I thought that the problem with th...	[ -0.006103515625, 0.01397705078125, 0.0081787109375, 0.0103759765625, -0.0038909912109375, 0.0137939453125, -0.0106201171875, -0.0250244140625, 0.018798828125, 0.01495361328125, 0.0126953125, 0.02099609375, 0.0031890869140625, 0.01141357421875, -0.00147247314453125, 0.014404296875, 0....	[ 44084, 90978, 73, 6048, 7279, 24145, 1632, 69407, 89554, 3678, 1556, 142508, 63773, 78292, 21110, 14602, 24626, 7547, 35838, 2967, 35971, 129912, 3378, 12996, 153224, 4432, 13648, 15400, 17262, 80934, 9969, 6743, 162515, 96, 1690, 41206 ]	[ 0.1279296875, 0.1605224609375, 0.1500244140625, 0.1317138671875, 0.1905517578125, 0.072265625, 0.0875244140625, 0.1968994140625, 0.1173095703125, 0.170654296875, 0.10302734375, 0.1845703125, 0.069091796875, 0.1766357421875, 0.0728759765625, 0.003631591796875, 0.00250244140625, 0.09...	embed
61377224_c1	61377224	haskell	1	trying to figure the basics out.) BIPs.hs:161:31: error: * Couldn't match type `Stm' with `(Stm, Env)' Expected type: Map String (Stm, Env) Actual type: Map String Stm * In the `proc' field of a record In the expression: env {proc = (insert p s) (proc env)} In an equation for env'': env'' = env {proc = (insert p s) (p...	trying to figure the basics out.) BIPs.hs:161:31: error: * Couldn't match type `Stm' with `(Stm, Env)' Expected type: Map String (Stm, Env) Actual type: Map String Stm * In the `proc' field of a record In the expression: env {proc = (insert p s) (proc env)} In an equation for env'': env'' = env {proc = (insert p s) (p...	[ -0.0296630859375, -0.00003933906555175781, -0.01806640625, 0.00677490234375, -0.004669189453125, 0.0135498046875, -0.034912109375, -0.0220947265625, 0.0032806396484375, -0.0191650390625, -0.00750732421875, 0.0185546875, -0.004180908203125, -0.015869140625, 0.016357421875, 0.02038574218...	[ 31577, 26366, 62822, 1810, 335, 10931, 7, 127, 151525, 27321, 18499, 191147, 18, 14858, 10644, 37455, 39, 678, 357, 334, 60075, 13, 42719, 23351, 214, 100582, 2907, 360, 3454, 238, 44457, 111, 17164, 125195, 22, 33657, 915, 91, 5490, 9076...	[ 0.1246337890625, 0.1123046875, 0.1590576171875, 0.06048583984375, 0.1025390625, 0.190673828125, 0.0860595703125, 0.0867919921875, 0.151123046875, 0.1451416015625, 0.1695556640625, 0.1162109375, 0.088623046875, 0.2147216796875, 0.2265625, 0.1649169921875, 0.180908203125, 0.071777343...	embed
36445088_c1	36445088	haskell	1	mat -> Intersection -> l -> Color And so I define my Objects in the following way. I looked up and I tend to use RankNTypes (I think I made a mistake here) data Object = forall . geo mat (Geometry geo, Material mat) => Object geo mat Then I found I could not go on if I plan to implement the following function. raytrac...	mat -> Intersection -> l -> Color And so I define my Objects in the following way. I looked up and I tend to use RankNTypes (I think I made a mistake here) data Object = forall . geo mat (Geometry geo, Material mat) => Object geo mat Then I found I could not go on if I plan to implement the following function. raytrac...	[ -0.00811767578125, -0.01043701171875, -0.007598876953125, 0.0029144287109375, -0.007415771484375, 0.00262451171875, -0.018310546875, 0.00103759765625, 0.003173828125, -0.0263671875, 0.01080322265625, 0.0086669921875, 0.00653076171875, -0.031982421875, 0.00125885009765625, -0.0128784179...	[ 2589, 5337, 7, 58994, 96, 51193, 61924, 759, 134549, 25632, 3917, 17660, 4527, 134405, 839, 196707, 121742, 2053, 100, 5584, 20787, 10429, 87739, 23994, 959, 1774, 29479, 32354, 62656, 39989, 13, 187694, 118244, 51626, 31681, 75161, 44851, 36...	[ 0.254638671875, 0.121337890625, 0.143310546875, 0.1318359375, 0.0816650390625, 0.169677734375, 0.2066650390625, 0.031982421875, 0.241943359375, 0.01727294921875, 0.0194854736328125, 0.038299560546875, 0.010101318359375, 0.208251953125, 0.051483154296875, 0.2239990234375, 0.0546264648...	embed
16111855_c0	16111855	haskell	0	Title: Scanl in Haskell Problem title: Scanl in Haskell Tags: haskell, list Problem: Scanl in Haskell scanl (\exp y -> scanl (\x -> if (isLetter x) then update exp (Literal x) "" else if x=='+' then update exp Epsilon "+" else if x=='' then update exp Epsilon "" else update exp Epsilon "\|") y) Epsilon q I have a list...	Scanl in Haskell Scanl in Haskell haskell list Scanl Haskell Literal Epsilon Reg Char Then Star Scanl in Haskell I have a list of [Char] and I want to transform them into my data type but I am having some problems with it. I have somenthing like this ["a+b","c*d"] and I want the result of when I apply scanl on "a+b" to...	[ -0.01519775390625, -0.00634765625, 0.0026092529296875, 0.041748046875, -0.0045166015625, 0.02001953125, -0.022705078125, 0.0059814453125, 0.010986328125, -0.01318359375, 0.0174560546875, 0.0035400390625, -0.005157470703125, -0.006805419921875, -0.0115966796875, -0.0024871826171875, 0...	[ 65533, 141, 23, 20625, 142508, 1556, 5303, 135940, 15759, 4759, 11678, 21656, 4612, 84068, 3444, 27198, 3934, 2053, 10644, 19441, 44402, 1884, 903, 11, 1328, 275, 1639, 71, 16750, 59911, 44954, 98, 47, 47143, 4527, 17932, 4358, 31577, 58745...	[ 0.2186279296875, 0.218017578125, 0.076416015625, 0.148193359375, 0.25048828125, 0.13671875, 0.16748046875, 0.08319091796875, 0.10986328125, 0.13037109375, 0.1383056640625, 0.1578369140625, 0.1650390625, 0.16455078125, 0.0670166015625, 0.1717529296875, 0.06488037109375, 0.0994262695...	embed
51944931_c0	51944931	haskell	0	Title: Simulate a path-dependent type in Haskell Problem title: Simulate a path-dependent type in Haskell Tags: haskell, path-dependent-type, type-level-computation, types Problem: Simulate a path-dependent type in Haskell Here is a simplified example of what I want to do. Let's say you have a HList of pairs: let hlist...	Simulate a path-dependent type in Haskell Simulate a path-dependent type in Haskell haskell path-dependent-type type-level-computation types Simulate Haskell HList HCons HNil Simulate a path-dependent type in Haskell Here is a simplified example of what I want to do. Let's say you have a HList of pairs: Now I want to w...	[ -0.0062255859375, 0.000331878662109375, -0.0076904296875, 0.00640869140625, 0.0027008056640625, -0.00927734375, -0.0128173828125, 0.00714111328125, 0.011474609375, -0.0252685546875, -0.00299072265625, -0.00125885009765625, -0.007476806640625, 0.00421142578125, 0.006103515625, -0.005554...	[ 144814, 60875, 181063, 10644, 20625, 142508, 1556, 50986, 67919, 7077, 52895, 572, 154663, 81118, 5245, 79059, 379, 112892, 27781, 80836, 3444, 33022, 32354, 91995, 43512, 756, 19770, 678, 5117, 27494, 5701, 1884, 23351, 214, 22799, 418, 34292,...	[ 0.2237548828125, 0.189453125, 0.20263671875, 0.19775390625, 0.130859375, 0.2218017578125, 0.119384765625, 0.154541015625, 0.07000732421875, 0.019989013671875, 0.21337890625, 0.1143798828125, 0.2047119140625, 0.023162841796875, 0.06390380859375, 0.00115966796875, 0.0548095703125, 0....	embed
53734686_c0	53734686	haskell	0	Title: Getting the first duplicate element of a circular list Problem title: Getting the first duplicate element of a circular list Tags: haskell, lazy-evaluation Problem: Getting the first duplicate element of a circular list I am trying to get the first duplicate element from a circular list. e.g. [1,-2, 3, 2, 3, 4, ...	Getting the first duplicate element of a circular list Getting the first duplicate element of a circular list haskell lazy-evaluation Getting Just Ord Maybe Nothing x:xs Set.empty Set.member Set.insert Getting the first duplicate element of a circular list I am trying to get the first duplicate element from a circular ...	[ -0.0113525390625, -0.00616455078125, -0.0001888275146484375, -0.00421142578125, -0.005462646484375, -0.000606536865234375, 0.0135498046875, 0.0042724609375, 0.00628662109375, -0.0283203125, -0.013916015625, 0.05029296875, 0.0166015625, 0.00445556640625, -0.00128936767578125, 0.01855468...	[ 210732, 5117, 171763, 67, 12830, 115339, 5303, 1556, 142508, 21, 3285, 159258, 9563, 35379, 83425, 182747, 19943, 33548, 27417, 33657, 31577, 2046, 1295, 81, 82825, 304, 41206, 418, 136, 27489, 5701, 16750, 1284, 2301, 18, 1884, 3714, 15400, ...	[ 0.1141357421875, 0.1583251953125, 0.2227783203125, 0.1427001953125, 0.1649169921875, 0.20263671875, 0.1865234375, 0.07659912109375, 0.175537109375, 0.0164031982421875, 0.1279296875, 0.1190185546875, 0.04010009765625, 0.153076171875, 0.104736328125, 0.0904541015625, 0.0833740234375, ...	embed
20222744_c1	20222744	haskell	1	00000 00000000 0000635c 22 CONTENTS, ALLOC, LOAD, DATA 3 .rdata 00000080 00000000 00000000 00006380 22 CONTENTS, ALLOC, LOAD, READONLY, DATA 4 .rdata$zzz 00000020 00000000 00000000 00006400 22 CONTENTS, ALLOC, LOAD, READONLY, DATA 5 .bss 00000000 00000000 00000000 00000000 22 ALLOC But of course the compiled ve...	00000 00000000 0000635c 22 CONTENTS, ALLOC, LOAD, DATA 3 .rdata 00000080 00000000 00000000 00006380 22 CONTENTS, ALLOC, LOAD, READONLY, DATA 4 .rdata$zzz 00000020 00000000 00000000 00006400 22 CONTENTS, ALLOC, LOAD, READONLY, DATA 5 .bss 00000000 00000000 00000000 00000000 22 ALLOC But of course the compiled ve...	[ 0.01141357421875, 0.0172119140625, -0.0240478515625, 0.01507568359375, -0.017333984375, 0.024169921875, -0.01409912109375, 0.03369140625, 0.0023040771484375, 0.0103759765625, -0.0003566741943359375, -0.0361328125, 0.02294921875, -0.0118408203125, 0.0062255859375, 0.0037384033203125, ...	[ 181155, 2445, 28568, 166000, 238, 116, 25442, 304, 14452, 21170, 12763, 9804, 124448, 22215, 12351, 391, 17758, 138, 42, 10135, 197094, 4836, 9016, 84701, 188300, 15513, 19917, 201, 6, 5, 177033, 1549, 4, 190, 16145, 7, 111, 70, 375, 5974...	[ 0.1802978515625, 0.0771484375, 0.12451171875, 0.1917724609375, 0.09063720703125, 0.00994873046875, 0.0256500244140625, 0.0611572265625, 0.0767822265625, 0.1396484375, 0.0517578125, 0.1107177734375, 0.2125244140625, 0.078857421875, 0.0213623046875, 0.010345458984375, 0.06512451171875,...	embed
20846924_c0	20846924	haskell	0	Title: Is it possible to have a IF condition inside a Haskell Sqlite3 trigger? Problem title: Is it possible to have a IF condition inside a Haskell Sqlite3 trigger? Tags: sqlite, haskell, triggers, if-statement Problem: Is it possible to have a IF condition inside a Haskell Sqlite3 trigger? Is it possible to modify th...	Is it possible to have a IF condition inside a Haskell Sqlite3 trigger? Is it possible to have a IF condition inside a Haskell Sqlite3 trigger? sqlite haskell triggers if-statement Haskell Sqlite3 calculateNoOfStocksTraded::String Database.HDBC.Sqlite3.Connection CREATE TRIGGER AFTER INSERT EACH ROW BEGIN UPDATE SET SE...	[ -0.01422119140625, 0.0233154296875, -0.003387451171875, 0.0086669921875, 0.0252685546875, -0.005859375, 0.01446533203125, 0.00634765625, 0.0179443359375, -0.007659912109375, 0.00457763671875, -0.02880859375, -0.007049560546875, -0.027099609375, 0.005523681640625, 0.00970458984375, -0...	[ 2071, 7722, 765, 10, 55449, 35431, 46132, 20625, 142508, 159, 95255, 67, 363, 185553, 1556, 2174, 61340, 74481, 5021, 132887, 184425, 28542, 187781, 16291, 24318, 235603, 175151, 94536, 724, 56599, 64083, 56263, 19452, 161521, 128565, 144832, 1...	[ 0.0178375244140625, 0.168701171875, 0.044586181640625, 0.017364501953125, 0.2425537109375, 0.2342529296875, 0.1510009765625, 0.115234375, 0.2108154296875, 0.0299835205078125, 0.1878662109375, 0.1668701171875, 0.192626953125, 0.26708984375, 0.0787353515625, 0.2149658203125, 0.08819580...	embed
21185901_c0	21185901	haskell	0	Title: Get smallest Int out of [Int] without using predefined functions or arithmetic operators except <=, ==, Problem title: Get smallest Int out of [Int] without using predefined functions or arithmetic operators except <=, ==, Tags: haskell Problem: Get smallest Int out of [Int] without using predefined functi...	Get smallest Int out of [Int] without using predefined functions or arithmetic operators except <=, ==, Get smallest Int out of [Int] without using predefined functions or arithmetic operators except <=, ==, haskell predefined Get x:xs Get smallest Int out of [Int] without using predefined functions or arithmetic...	[ -0.0322265625, -0.0101318359375, 0.0263671875, -0.00604248046875, -0.0233154296875, 0.0177001953125, 0.025634765625, -0.01806640625, 0.0279541015625, 0.00897216796875, 0.0157470703125, 0.001922607421875, -0.01324462890625, 0.0186767578125, -0.00921630859375, 0.0208740234375, 0.005645...	[ 20779, 19336, 525, 360, 18, 1810, 111, 378, 4153, 15490, 17368, 1653, 13, 5983, 32354, 8962, 39933, 40494, 1369, 69112, 9523, 1556, 142508, 1022, 12, 425, 4426, 66211, 29479, 30646, 70, 4734, 107003, 4527, 268, 152, 225490, 110, 201505, 5...	[ 0.1090087890625, 0.2012939453125, 0.207763671875, 0.146240234375, 0.1285400390625, 0.1475830078125, 0.0694580078125, 0.021026611328125, 0.12255859375, 0.0892333984375, 0.0143280029296875, 0.09326171875, 0.06292724609375, 0.157958984375, 0.1396484375, 0.058624267578125, 0.183959960937...	embed
75408832_c1	75408832	haskell	1	Var operation , which up to the documentation is due to the channel being empty. I guess getContents' actually never terminates. Last but most importantly, the behaviour is different depending on the compilation parameters: ghc -threaded main.hs && ./main +RTS -N2 wont print anything and will hang until ^C is pressed (...	Var operation , which up to the documentation is due to the channel being empty. I guess getContents' actually never terminates. Last but most importantly, the behaviour is different depending on the compilation parameters: ghc -threaded main.hs && ./main +RTS -N2 wont print anything and will hang until ^C is pressed (...	[ -0.0159912109375, 0.0037994384765625, -0.00131988525390625, 0.0004291534423828125, -0.005828857421875, 0.00628662109375, 0.01019287109375, -0.006744384765625, -0.017578125, -0.049560546875, 0.0064697265625, -0.00909423828125, -0.000308990478515625, -0.010498046875, 0.01495361328125, -0...	[ 3323, 41018, 209806, 4743, 86723, 201505, 2046, 11935, 25352, 7, 25, 20653, 8306, 121011, 90, 224833, 12921, 96819, 98352, 171859, 31380, 238, 39116, 5201, 127, 24931, 997, 20503, 294, 839, 304, 28412, 23937, 10756, 24189, 441, 30501, 363, ...	[ 0.31005859375, 0.194580078125, 0.0723876953125, 0.011688232421875, 0.1546630859375, 0.1246337890625, 0.1888427734375, 0.16845703125, 0.275146484375, 0.111328125, 0.032073974609375, 0.022979736328125, 0.0670166015625, 0.1622314453125, 0.03765869140625, 0.151123046875, 0.09417724609375...	embed
41683174_c1	41683174	haskell	1	parable -- -- in order to define a partial order we need a definition of (<=) data PartialOrdering = POLessThan \| POGreaterThan \| POEqual \| POIncomparable deriving (Eq, Show) class PartialOrder a where lessThanEq :: a -> a -> Bool instance PartialOrder PartialOrdering where lessThanEq POIncomparable _ = False lessThanE...	parable -- -- in order to define a partial order we need a definition of (<=) data PartialOrdering = POLessThan \| POGreaterThan \| POEqual \| POIncomparable deriving (Eq, Show) class PartialOrder a where lessThanEq :: a -> a -> Bool instance PartialOrder PartialOrdering where lessThanEq POIncomparable _ = False lessThanE...	[ 0.0024566650390625, 0.0089111328125, 0.0023040771484375, 0.0159912109375, 0.01116943359375, 0.0101318359375, -0.004150390625, -0.05224609375, 0.0024261474609375, 0.031982421875, -0.007659912109375, -0.0062255859375, 0.0157470703125, 0.001739501953125, -0.01544189453125, -0.008972167968...	[ 121, 2661, 4210, 12989, 47, 61924, 10, 2878, 289, 642, 3871, 80934, 111, 16093, 1369, 2053, 9148, 143045, 4209, 64353, 90, 1121, 58745, 8574, 91127, 46429, 71723, 4153, 277, 2500, 2886, 16406, 864, 17367, 18507, 56, 40715, 33079, 2460, 92...	[ 0.191162109375, 0.2196044921875, 0.04736328125, 0.275390625, 0.035888671875, 0.2198486328125, 0.06439208984375, 0.2352294921875, 0.166748046875, 0.00738525390625, 0.07373046875, 0.177490234375, 0.009246826171875, 0.1102294921875, 0.180419921875, 0.171630859375, 0.218994140625, 0.25...	embed
33057111_c0	33057111	haskell	0	Title: pure code and impure code? I/O data type related Problem title: pure code and impure code? I/O data type related Tags: functional-programming, haskell Problem: pure code and impure code? I/O data type related name <- getLine The following paragraph is about how the line works. Can someone explain to me what this...	pure code and impure code? I/O data type related pure code and impure code? I/O data type related functional-programming haskell pure code and impure code? I/O data type related The following paragraph is about how the line works. Can someone explain to me what this means? Thank you in advance.	[ 0.00238037109375, 0.0142822265625, 0.0191650390625, 0.0311279296875, 0.01611328125, 0.00909423828125, 0.019287109375, 0.003997802734375, 0.01068115234375, -0.0050048828125, 0.0072021484375, -0.02880859375, -0.0128173828125, -0.00157928466796875, -0.00665283203125, 0.000843048095703125,...	[ 34166, 18151, 136, 21980, 3408, 32, 87, 64, 670, 2053, 10644, 62548, 123309, 28966, 1556, 142508, 25632, 151268, 1672, 3642, 70, 13315, 43240, 4171, 22008, 73342, 47, 163, 2367, 903, 26950, 129745, 5 ]	[ 0.212158203125, 0.216064453125, 0.117919921875, 0.1541748046875, 0.1949462890625, 0.007419586181640625, 0.044158935546875, 0.17431640625, 0.1400146484375, 0.08953857421875, 0.1341552734375, 0.09051513671875, 0.09844970703125, 0.058135986328125, 0.1231689453125, 0.217529296875, 0.1105...	embed
61038246_c1	61038246	haskell	1	id However, as soon as I want to do both, it breaks: class (FunctorB b) => DistributiveB (b :: (Type -> Type) -> Type) where bdistribute :: (Distributive f) => f (b g) -> b (Compose f g) bdistribute x = bmap (\f -> Compose $ fmap f . bsequence' <$> x) bshape default bdistribute :: forall f g . CanDeriveDistributiveB b...	id However, as soon as I want to do both, it breaks: class (FunctorB b) => DistributiveB (b :: (Type -> Type) -> Type) where bdistribute :: (Distributive f) => f (b g) -> b (Compose f g) bdistribute x = bmap (\f -> Compose $ fmap f . bsequence' <$> x) bshape default bdistribute :: forall f g . CanDeriveDistributiveB b...	[ 0.000946044921875, -0.00176239013671875, -0.00885009765625, -0.008544921875, -0.004852294921875, 0.01287841796875, -0.0101318359375, -0.01165771484375, 0.009033203125, 0.0172119140625, -0.0203857421875, -0.00579833984375, 0.0283203125, 0.0096435546875, -0.01806640625, 0.002716064453125...	[ 3447, 33306, 33662, 3444, 54, 15044, 442, 36356, 7, 18507, 97249, 18770, 571, 876, 44357, 75571, 4935, 275, 196707, 60457, 3827, 191145, 397, 1419, 28177, 1238, 706, 10770, 78381, 1022, 62346, 15612, 944, 2420, 1081, 114977, 5584, 4171, 477...	[ 0.1796875, 0.018310546875, 0.0325927734375, 0.044830322265625, 0.033721923828125, 0.1336669921875, 0.017364501953125, 0.1787109375, 0.037750244140625, 0.1861572265625, 0.1168212890625, 0.1019287109375, 0.1951904296875, 0.166748046875, 0.00604248046875, 0.232421875, 0.1649169921875, ...	embed
21496129_c0	21496129	haskell	0	Title: Avoiding case expression ladder without monad transformers Problem title: Avoiding case expression ladder without monad transformers Tags: monad-transformers, haskell, coding-style Problem: Avoiding case expression ladder without monad transformers In Real World Haskell monads are introduced as a way to avoid th...	Avoiding case expression ladder without monad transformers Avoiding case expression ladder without monad transformers monad-transformers haskell coding-style Avoiding Maybe Either Nothing Just Left Right s3:_ Avoiding case expression ladder without monad transformers In Real World Haskell monads are introduced as a way...	[ -0.035400390625, 0.00238037109375, -0.002777099609375, -0.013916015625, 0.01544189453125, -0.030029296875, 0.0003185272216796875, 0.002105712890625, 0.00537109375, -0.031494140625, 0.026611328125, -0.0157470703125, -0.00799560546875, -0.01397705078125, 0.01953125, -0.005279541015625, ...	[ 84361, 86675, 7225, 125195, 21, 70764, 15490, 2667, 712, 27198, 1314, 215175, 1556, 142508, 552, 6238, 40946, 83425, 4565, 9319, 182747, 9563, 636, 2480, 90911, 363, 5120, 6661, 20625, 7, 65508, 3917, 47, 71864, 18151, 95685, 214, 5773, 710...	[ 0.1448974609375, 0.009307861328125, 0.2109375, 0.2230224609375, 0.09722900390625, 0.2335205078125, 0.0826416015625, 0.130615234375, 0.1923828125, 0.2293701171875, 0.1259765625, 0.1978759765625, 0.0933837890625, 0.24462890625, 0.117919921875, 0.039520263671875, 0.1297607421875, 0.21...	embed
47976107_c0	47976107	haskell	0	Title: Haskell, regex, TDFA: match (and remove) quoted substrings Problem title: Haskell, regex, TDFA: match (and remove) quoted substrings Tags: haskell, regex Problem: Haskell, regex, TDFA: match (and remove) quoted substrings There is a regular expression matching quoted substrings: "/\"(?:[^\"\\]\|\\.)*\"/" (origina...	Haskell, regex, TDFA: match (and remove) quoted substrings Haskell, regex, TDFA: match (and remove) quoted substrings haskell regex Haskell TDFA Exception Explict Text.Regex.TDFA.String Haskell, regex, TDFA: match (and remove) quoted substrings There is a regular expression matching quoted substrings: "/\"(?:[^\"\\]\|\\...	[ -0.0020294189453125, 0.029296875, 0.005218505859375, 0.0194091796875, -0.010986328125, 0.006134033203125, 0.00141143798828125, 0.0091552734375, 0.005889892578125, -0.00836181640625, -0.005401611328125, 0.013916015625, -0.0054931640625, -0.00872802734375, 0.010986328125, 0.01611328125, ...	[ 20625, 142508, 6835, 3355, 117295, 14676, 14858, 2940, 87388, 66747, 71, 1614, 91693, 1556, 63928, 55992, 24129, 54601, 100045, 71713, 20324, 125195, 214, 64, 41872, 8353, 13273, 1639, 124524, 248, 1957, 11853, 8647, 35046, 43240, 17106, 6002, ...	[ 0.1112060546875, 0.2568359375, 0.1043701171875, 0.2071533203125, 0.09521484375, 0.2137451171875, 0.2410888671875, 0.1129150390625, 0.2288818359375, 0.216064453125, 0.124755859375, 0.19580078125, 0.252197265625, 0.05914306640625, 0.1011962890625, 0.0926513671875, 0.08306884765625, 0...	embed
67118307_c0	67118307	haskell	0	Title: How do you get Haskell to check SQL at compile time? Problem title: How do you get Haskell to check SQL at compile time? Tags: haskell, hasql, postgresql, sql Problem: How do you get Haskell to check SQL at compile time? I know it can be done, but I'm having trouble getting it working. I'm still finding my feet ...	How do you get Haskell to check SQL at compile time? How do you get Haskell to check SQL at compile time? haskell hasql postgresql sql How Haskell SQL How do you get Haskell to check SQL at compile time? I know it can be done, but I'm having trouble getting it working. I'm still finding my feet with Haskell. I tried us...	[ -0.00124359130859375, -0.003173828125, 0.00106048583984375, 0.0198974609375, -0.00933837890625, 0.01190185546875, -0.0272216796875, -0.0103759765625, -0.0157470703125, -0.026123046875, 0.004364013671875, -0.0291748046875, 0.01031494140625, -0.007415771484375, -0.0162353515625, 0.008728...	[ 11249, 2046, 20625, 142508, 47, 12765, 80866, 99, 9969, 1340, 1733, 1556, 99247, 1305, 17562, 91, 54, 3714, 831, 16940, 19441, 63134, 20949, 20697, 7464, 90791, 759, 74261, 678, 37842, 17368, 50986, 68746, 18, 22, 2886, 19559, 172, 31583, ...	[ 0.0721435546875, 0.104736328125, 0.152099609375, 0.2685546875, 0.08563232421875, 0.24072265625, 0.2685546875, 0.120849609375, 0.176513671875, 0.203125, 0.1463623046875, 0.1329345703125, 0.2119140625, 0.039337158203125, 0.1552734375, 0.021942138671875, 0.003082275390625, 0.018325805...	embed
16714627_c0	16714627	haskell	0	Title: Haskell how to use Language.Haskell.Interpreter to read config file? Problem title: Haskell how to use Language.Haskell.Interpreter to read config file? Tags: interpreter, hint, configuration-files, haskell Problem: Haskell how to use Language.Haskell.Interpreter to read config file? How do I use the Language.Ha...	Haskell how to use Language.Haskell.Interpreter to read config file? Haskell how to use Language.Haskell.Interpreter to read config file? interpreter hint configuration-files haskell Haskell Language.Haskell.Interpreter user1 indata.file outdata.file Haskell how to use Language.Haskell.Interpreter to read config file? ...	[ 0.00958251953125, -0.021240234375, 0.0008087158203125, 0.0205078125, -0.00848388671875, 0.0126953125, 0.0101318359375, 0.011474609375, 0.0068359375, -0.03466796875, -0.0233154296875, -0.0162353515625, -0.0174560546875, -0.0361328125, 0.0057373046875, -0.02587890625, -0.0169677734375,...	[ 20625, 142508, 3642, 4527, 83658, 6495, 44851, 56359, 56, 12301, 153837, 11435, 47, 7, 29481, 5122, 18, 180346, 29822, 1556, 38937, 418, 10135, 1810, 11249, 34475, 95486, 142424, 61475, 77336, 1528, 1884, 3444, 42518, 42485, 163846, 55681, 17...	[ 0.1072998046875, 0.2021484375, 0.044189453125, 0.10357666015625, 0.11572265625, 0.058349609375, 0.131591796875, 0.1915283203125, 0.1478271484375, 0.1688232421875, 0.2216796875, 0.1468505859375, 0.0268707275390625, 0.0154571533203125, 0.1658935546875, 0.10302734375, 0.006072998046875,...	embed
20136559_c0	20136559	haskell	0	Title: How to check whether instance exists for a polymorphic type with Template Haskell? Problem title: How to check whether instance exists for a polymorphic type with Template Haskell? Tags: haskell, template-haskell Problem: How to check whether instance exists for a polymorphic type with Template Haskell? Suppose,...	How to check whether instance exists for a polymorphic type with Template Haskell? How to check whether instance exists for a polymorphic type with Template Haskell? haskell template-haskell How Template Haskell Show ListT AppT VarT Not GHC.Show.Show ForallT PlainTV ClassP How to check whether instance exists for a pol...	[ -0.0017852783203125, -0.006622314453125, 0.005340576171875, 0.007415771484375, -0.008544921875, 0.011962890625, 0.0245361328125, -0.01513671875, 0.0181884765625, -0.0269775390625, -0.000507354736328125, -0.0269775390625, 0.0169677734375, 0.0033721923828125, -0.0036163330078125, -0.0179...	[ 11249, 12765, 36766, 110527, 32316, 7, 100, 35874, 178851, 1771, 10644, 678, 196631, 20625, 142508, 47, 1556, 110934, 10557, 17367, 32036, 618, 5659, 3323, 11205, 527, 73265, 168660, 5584, 8950, 5343, 35014, 683, 11, 14602, 25632, 18499, 4263...	[ 0.0289764404296875, 0.1954345703125, 0.1197509765625, 0.2734375, 0.190673828125, 0.07403564453125, 0.06787109375, 0.1861572265625, 0.1844482421875, 0.040679931640625, 0.1845703125, 0.0711669921875, 0.257080078125, 0.1328125, 0.23876953125, 0.01519775390625, 0.09222412109375, 0.2231...	embed
20379112_c1	20379112	haskell	1	of neighborhoods. BFSNode corresponds to a node in the BFS tree which belongs to either a new vertex which is visited for the first time, or to an old vertex which already has been visited and which is therefore referred by its unique number. Note that the parsing process works fine and consumes very few memory. My ai...	of neighborhoods. BFSNode corresponds to a node in the BFS tree which belongs to either a new vertex which is visited for the first time, or to an old vertex which already has been visited and which is therefore referred by its unique number. Note that the parsing process works fine and consumes very few memory. My ai...	[ 0.003936767578125, 0.019287109375, -0.0008544921875, 0.004852294921875, 0.007110595703125, 0.0291748046875, -0.00830078125, -0.0087890625, 0.0035552978515625, -0.00994873046875, -0.007598876953125, -0.019775390625, 0.002899169921875, 0.0026397705078125, -0.005279541015625, -0.010498046...	[ 111, 205277, 7, 335, 36381, 5021, 112, 42518, 110, 53201, 10617, 3525, 493, 24371, 36997, 5117, 1733, 10332, 21771, 1556, 15005, 36998, 14012, 366, 6953, 9433, 43240, 5885, 18588, 4552, 10846, 98323, 2646, 464, 96760, 79858, 7077, 3934, 205...	[ 0.05755615234375, 0.20263671875, 0.0721435546875, 0.130859375, 0.2587890625, 0.250244140625, 0.2060546875, 0.1339111328125, 0.1749267578125, 0.1751708984375, 0.11328125, 0.06231689453125, 0.078125, 0.1412353515625, 0.154052734375, 0.07568359375, 0.05804443359375, 0.0648193359375, ...	embed
22284406_c0	22284406	haskell	0	Title: How to do (role-based) access control in Yesod? Problem title: How to do (role-based) access control in Yesod? Tags: authorization, haskell, yesod, rbac, access-control Problem: How to do (role-based) access control in Yesod? I'm wondering what the best approach for adding roles to users / permissions to Handler...	How to do (role-based) access control in Yesod? How to do (role-based) access control in Yesod? authorization haskell yesod rbac access-control How Yesod Handler How to do (role-based) access control in Yesod? I'm wondering what the best approach for adding roles to users / permissions to Handler s or resources in Yeso...	[ 0.001220703125, 0.025634765625, 0.00469970703125, -0.005126953125, -0.020263671875, 0.00860595703125, -0.00238037109375, -0.0150146484375, 0, -0.0152587890625, 0.0272216796875, -0.00665283203125, -0.026611328125, 0.02099609375, -0.017822265625, 0.001708984375, -0.003021240234375, 0...	[ 11249, 47, 54, 516, 133, 77007, 17203, 6226, 23, 32635, 2199, 42179, 47691, 1556, 142508, 2422, 23722, 49369, 81988, 10639, 603, 149016, 2965, 51515, 154107, 31486, 72095, 248, 168081, 65514, 41928, 4927, 21962, 10644, 16751, 56282, 94708, 74...	[ 0.1097412109375, 0.044830322265625, 0.08935546875, 0.1400146484375, 0.1614990234375, 0.1834716796875, 0.1973876953125, 0.2454833984375, 0.0894775390625, 0.1834716796875, 0.258056640625, 0.116943359375, 0.1326904296875, 0.08349609375, 0.1922607421875, 0.1591796875, 0.2060546875, 0.1...	embed
8155929_c1	8155929	haskell	1	. Actually It's not too bad, because at the moment the Haskell code is only 3 times slower. Using GHC-7.2.1 and compiling as such: ghc -O2 -Odph -fllvm -optlo-O3 -optlo-loop-reduce -optlo-loop-deletion the Haskell code uses 60s. on an input of ~1GB, while the C-version uses 21-22s. But there are some things I find odd:...	. Actually It's not too bad, because at the moment the Haskell code is only 3 times slower. Using GHC-7.2.1 and compiling as such: ghc -O2 -Odph -fllvm -optlo-O3 -optlo-loop-reduce -optlo-loop-deletion the Haskell code uses 60s. on an input of ~1GB, while the C-version uses 21-22s. But there are some things I find odd:...	[ -0.007537841796875, 0.016357421875, 0.0042724609375, -0.01397705078125, 0.001068115234375, 0.00799560546875, -0.005462646484375, -0.0194091796875, 0.0084228515625, -0.04931640625, 0.001556396484375, 0.01519775390625, 0.02392578125, 0.028564453125, -0.0146484375, -0.006500244140625, 0...	[ 5, 192728, 959, 5792, 6494, 3095, 20625, 142508, 18151, 83, 4734, 138, 20028, 72803, 56, 345, 527, 73265, 16709, 68107, 9969, 31380, 238, 670, 304, 71115, 11727, 20, 3723, 39, 2146, 365, 363, 28354, 107, 106357, 8520, 1363, 4527, 1496, ...	[ 0.0140838623046875, 0.101318359375, 0.03509521484375, 0.0195159912109375, 0.1015625, 0.075439453125, 0.145751953125, 0.273681640625, 0.1884765625, 0.0244140625, 0.03277587890625, 0.053558349609375, 0.1214599609375, 0.1712646484375, 0.1083984375, 0.00933837890625, 0.05438232421875, ...	embed
69998831_c0	69998831	haskell	0	Title: What is the best way to fetch keys in a data type? Problem title: What is the best way to fetch keys in a data type? Tags: haskell Problem: What is the best way to fetch keys in a data type? I need to get all the keys in a given object this is how I managed to do it. {-# LANGUAGE DeriveGeneric #-} import System....	What is the best way to fetch keys in a data type? What is the best way to fetch keys in a data type? haskell System.Environment Data.Aeson Data.Foldable GHC.Generics qualified What LANGUAGE DeriveGeneric Data.HashMap.Strict Hashmap Person age::Int Generic Show ToJSON Maybe Object Just Hashmap.keys What is the best way...	[ 0.004638671875, -0.0026092529296875, 0.0033111572265625, 0.000766754150390625, -0.0030975341796875, -0.005950927734375, -0.0030059814453125, 0.004486083984375, -0.0155029296875, -0.0390625, 0.01275634765625, -0.01055908203125, 0.017822265625, 0.00189208984375, 0.00714111328125, -0.0072...	[ 4865, 83, 2965, 3917, 47, 7647, 206, 22799, 7, 23, 2053, 10644, 70, 1556, 142508, 12353, 1900, 11809, 90, 191, 18345, 2886, 527, 73265, 135932, 12259, 217225, 3358, 98064, 1310, 5844, 6495, 166179, 62233, 162087, 62346, 15270, 32070, 88342,...	[ 0.0164337158203125, 0.013916015625, 0.142333984375, 0.0936279296875, 0.03448486328125, 0.170654296875, 0.1280517578125, 0.240478515625, 0.1180419921875, 0.07501220703125, 0.1207275390625, 0.2152099609375, 0.012451171875, 0.1124267578125, 0.2149658203125, 0.0853271484375, 0.0140380859...	embed
12476999_c0	12476999	haskell	0	Title: Haskell parser to AST Problem title: Haskell parser to AST Tags: parsing, haskell, abstract-syntax-tree Problem: Haskell parser to AST As an exercise to learn Haskell (and torture myself), I am considering writing a configurable Haskell code beautifier. It will support a configuration file written in JSON or YAM...	Haskell parser to AST Haskell parser to AST parsing haskell abstract-syntax-tree Haskell AST Haskell parser to AST As an exercise to learn Haskell (and torture myself), I am considering writing a configurable Haskell code beautifier. It will support a configuration file written in JSON or YAML (or something better?) th...	[ -0.007354736328125, 0.005279541015625, 0.017578125, -0.0031280517578125, 0.002716064453125, 0.01806640625, -0.016845703125, -0.0108642578125, -0.01190185546875, -0.0184326171875, 0.01416015625, -0.0174560546875, -0.00567626953125, 0.0123291015625, -0.00147247314453125, 0.00102233886718...	[ 20625, 142508, 366, 2189, 47, 48963, 6953, 1556, 164789, 12654, 86531, 62600, 81979, 30698, 134357, 13, 35978, 179635, 32562, 56231, 18151, 44551, 18, 85789, 8060, 180346, 11435, 59121, 821, 58627, 707, 3320, 39456, 11522, 58735, 44126, 12096, ...	[ 0.161865234375, 0.236328125, 0.1719970703125, 0.191650390625, 0.1307373046875, 0.22265625, 0.04132080078125, 0.128173828125, 0.2098388671875, 0.07305908203125, 0.164306640625, 0.172607421875, 0.05364990234375, 0.0333251953125, 0.1446533203125, 0.02850341796875, 0.0538330078125, 0.0...	embed
35375051_c0	35375051	haskell	0	Title: Haskell how to get code from Hackage into project? Cabal install project failed Problem title: Haskell how to get code from Hackage into project? Cabal install project failed Tags: debugging, hackage, haskell Problem: Haskell how to get code from Hackage into project? Cabal install project failed I created a pro...	Haskell how to get code from Hackage into project? Cabal install project failed Haskell how to get code from Hackage into project? Cabal install project failed debugging hackage haskell Hackage Haskell Cabal Main.hs There Haskell how to get code from Hackage into project? Cabal install project failed I created a projec...	[ -0.002349853515625, 0.0205078125, 0.01177978515625, 0.031005859375, 0, 0.0026702880859375, 0.00946044921875, 0.00885009765625, -0.010986328125, -0.01483154296875, -0.005889892578125, -0.05322265625, -0.01214599609375, 0.005889892578125, 0.0079345703125, 0.000637054443359375, -0.01623...	[ 20625, 142508, 3642, 2046, 18151, 1295, 52922, 4588, 3934, 13452, 30438, 289, 20600, 165523, 8, 978, 85526, 1556, 12321, 5, 127, 8622, 47, 75935, 24927, 23009, 43658, 3166, 28412, 112, 21407, 99929, 867, 19437, 78303, 109524, 3444, 19048, 4...	[ 0.1280517578125, 0.226318359375, 0.06048583984375, 0.1527099609375, 0.2568359375, 0.15283203125, 0.19775390625, 0.2049560546875, 0.1729736328125, 0.2047119140625, 0.186279296875, 0.144287109375, 0.1231689453125, 0.2086181640625, 0.04608154296875, 0.142333984375, 0.175537109375, 0.0...	embed
20352717_c1	20352717	haskell	1	" QuickCheck, and using it in the wrong way here. EDIT: unfortunately, the sized function does not seem to eliminate the problem here. It ends up with the same result (see comment to J. Abrahamson's answer.) EDIT II: I ended up "fixing" my problem by avoiding the recursive step, and avoiding conjoin . We just make a li...	" QuickCheck, and using it in the wrong way here. EDIT: unfortunately, the sized function does not seem to eliminate the problem here. It ends up with the same result (see comment to J. Abrahamson's answer.) EDIT II: I ended up "fixing" my problem by avoiding the recursive step, and avoiding conjoin . We just make a li...	[ 0.000385284423828125, -0.0079345703125, 0.0027008056640625, -0.0098876953125, -0.000850677490234375, -0.00665283203125, -0.01080322265625, -0.0245361328125, 0.004730224609375, -0.006866455078125, -0.00482177734375, 0.0059814453125, 0.01385498046875, 0.0045166015625, 0.0113525390625, -0...	[ 89038, 202567, 17368, 442, 44691, 3917, 3688, 13267, 71, 32354, 27169, 2967, 58480, 55923, 214, 71864, 195625, 5844, 29954, 158, 513, 73, 5303, 756, 110, 988, 53201, 3034, 11001, 157, 112, 57266, 79786, 5885, 86595, 98, 5021, 247341, 101344...	[ 0.1749267578125, 0.308349609375, 0.07861328125, 0.003265380859375, 0.0875244140625, 0.04620361328125, 0.006134033203125, 0.1695556640625, 0.1268310546875, 0.1304931640625, 0.047821044921875, 0.095947265625, 0.0146942138671875, 0.1121826171875, 0.004486083984375, 0.072509765625, 0.141...	embed
22074680_c0	22074680	haskell	0	Title: What's the most efficient way to represent red-black trees? Problem title: What's the most efficient way to represent red-black trees? Tags: haskell Problem: What's the most efficient way to represent red-black trees? Okasaki uses (essentially) data Color = R \| B data RB a = L \| T {-# UNPACK #-}!Color ...	What's the most efficient way to represent red-black trees? What's the most efficient way to represent red-black trees? haskell What Color UNPACK What's the most efficient way to represent red-black trees? Okasaki uses (essentially) I know that in C, the color is typically handled in a more fiddly way to save...	[ 0.000736236572265625, 0.0025177001953125, -0.0031890869140625, 0.01409912109375, -0.01177978515625, 0.0172119140625, -0.0247802734375, -0.0030364990234375, 0.0125732421875, 0.0091552734375, 0.003814697265625, -0.0179443359375, 0.01220703125, 0.00811767578125, -0.0140380859375, 0.015991...	[ 3768, 2684, 93766, 3917, 47, 33636, 4842, 9, 151675, 1360, 90, 1556, 142508, 4865, 51193, 8274, 98701, 605, 180, 64036, 301, 4527, 23, 313, 10576, 205794, 34831, 1286, 809, 4028, 30098, 32628, 27226, 4785, 6275, 56, 110, 22, 40899, 7722, ...	[ 0.0615234375, 0.1199951171875, 0.220703125, 0.08984375, 0.01641845703125, 0.2286376953125, 0.1419677734375, 0.046875, 0.197509765625, 0.1778564453125, 0.07635498046875, 0.1268310546875, 0.25146484375, 0.0210723876953125, 0.1802978515625, 0.10736083984375, 0.2064208984375, 0.1231689...	embed
7494950_c1	7494950	haskell	1	String -> Handler RepHtml getEntryR slug = do Blog entries <- getYesod case filter (\e -> entrySlug e == slug) entries of [] -> notFound (entry:_) -> do let nav = reverse $ map toNav entries let tempArgs = TemplateArgs { templateTitle = toHtml $ entryTitle entry , templateContent = toHtml $ entryContent entry , templa...	String -> Handler RepHtml getEntryR slug = do Blog entries <- getYesod case filter (\e -> entrySlug e == slug) entries of [] -> notFound (entry:_) -> do let nav = reverse $ map toNav entries let tempArgs = TemplateArgs { templateTitle = toHtml $ entryTitle entry , templateContent = toHtml $ entryContent entry , templa...	[ 0.017578125, 0.00080108642578125, 0.005767822265625, -0.00506591796875, -0.02392578125, 0.0211181640625, -0.00958251953125, -0.0225830078125, 0.0274658203125, -0.04052734375, -0.036376953125, -0.00860595703125, -0.01251220703125, -0.001495361328125, 0.0263671875, 0.0189208984375, -0....	[ 23351, 214, 33079, 10639, 603, 33742, 841, 18, 7237, 2046, 7768, 15123, 1052, 13584, 177, 2203, 54, 5061, 112820, 91480, 2199, 7225, 46312, 13, 42805, 35159, 28, 69112, 111, 959, 27591, 7030, 33, 2633, 2430, 39531, 184, 22288, 47, 160349,...	[ 0.1741943359375, 0.07177734375, 0.0433349609375, 0.2178955078125, 0.289306640625, 0.1998291015625, 0.1165771484375, 0.1280517578125, 0.1923828125, 0.09930419921875, 0.0849609375, 0.170166015625, 0.179931640625, 0.1837158203125, 0.141845703125, 0.0150146484375, 0.0303955078125, 0.16...	embed
65671417_c2	65671417	haskell	2	the files known Code signals: JITSymbolError, its, these, nixpkgs, nixpkgsSrc, Trouble, ORC, JIT, github.com, llvm-hs.git, llvm-hs-examples.git, shell.nix, ModuleID, source_filename, i32, Eager, Result, self.llvm_9, Fetch, haskell.nix, default.nix, builtins.fetchTarball, ef6ca0f431fe3830c25cb2d185367245c1cce894.tar.gz...	the files known Code signals: JITSymbolError, its, these, nixpkgs, nixpkgsSrc, Trouble, ORC, JIT, github.com, llvm-hs.git, llvm-hs-examples.git, shell.nix, ModuleID, source_filename, i32, Eager, Result, self.llvm_9, Fetch, haskell.nix, default.nix, builtins.fetchTarball, ef6ca0f431fe3830c25cb2d185367245c1cce894.tar.gz...	[ 0.0233154296875, -0.01904296875, -0.00457763671875, 0.0023040771484375, -0.0081787109375, 0.01239013671875, 0.0074462890625, -0.008056640625, -0.00531005859375, 0.017822265625, 0.003082275390625, -0.023681640625, 0.0087890625, 0.0174560546875, 0.00933837890625, 0.0206298828125, -0.01...	[ 70, 102158, 51529, 28864, 26073, 7, 821, 119119, 53, 36846, 18468, 31611, 6863, 6097, 300, 425, 38988, 9405, 19437, 119671, 2661, 180, 25740, 6371, 62270, 32102, 277, 3723, 39, 127, 15769, 3355, 302, 99726, 128019, 93, 63014, 7146, 31344, ...	[ 0.121826171875, 0.262451171875, 0.253173828125, 0.2388916015625, 0.25830078125, 0.0782470703125, 0.1861572265625, 0.1348876953125, 0.11279296875, 0.22607421875, 0.128173828125, 0.1279296875, 0.162109375, 0.1551513671875, 0.0738525390625, 0.0653076171875, 0.112060546875, 0.148803710...	embed
67543282_c0	67543282	haskell	0	Title: Can't refactor code in a do block, IO return type doesn't match Problem title: Can't refactor code in a do block, IO return type doesn't match Tags: haskell Problem: Can't refactor code in a do block, IO return type doesn't match This was the original code putBoard :: Board -> IO () putBoard ...	Can't refactor code in a do block, IO return type doesn't match Can't refactor code in a do block, IO return type doesn't match haskell Can Board Couldn Expected Actual Can't refactor code in a do block, IO return type doesn't match This was the original code I wanted to rewrite it as but I get Why ...	[ 0.0002460479736328125, -0.00787353515625, 0.0159912109375, 0.01068115234375, -0.012451171875, -0.00982666015625, -0.01434326171875, -0.002166748046875, 0.004119873046875, 0.01361083984375, 0.00173187255859375, -0.02294921875, 0.01031494140625, -0.005828857421875, -0.0203857421875, 0.00...	[ 4171, 3768, 18, 456, 144810, 18151, 23, 54, 46389, 17780, 30646, 10644, 22027, 14858, 1556, 142508, 62554, 191147, 60075, 13, 100582, 7311, 36663, 434, 18781, 237, 1284, 44084, 83, 65395, 19, 15, 124962, 71 ]	[ 0.0660400390625, 0.066162109375, 0.045654296875, 0.1373291015625, 0.278076171875, 0.1588134765625, 0.0433349609375, 0.1328125, 0.19921875, 0.17333984375, 0.193115234375, 0.1732177734375, 0.03887939453125, 0.1484375, 0.09503173828125, 0.189208984375, 0.12890625, 0.07366943359375, ...	embed
29870082_c0	29870082	haskell	0	Title: Implementing show for multi-line content in Haskell Problem title: Implementing show for multi-line content in Haskell Tags: debugging, typeclass, haskell, logging, formatting Problem: Implementing show for multi-line content in Haskell I have a small matrix type in Haskell that is that is most appropriately dis...	Implementing show for multi-line content in Haskell Implementing show for multi-line content in Haskell debugging typeclass haskell logging formatting Implementing Haskell Implementing show for multi-line content in Haskell I have a small matrix type in Haskell that is that is most appropriately displayed across multip...	[ -0.0145263671875, 0.00885009765625, 0.0115966796875, 0.021728515625, 0.006500244140625, 0.004669189453125, 0.00927734375, 0.000362396240234375, 0.012939453125, 0.03515625, -0.0098876953125, -0.02490234375, -0.005096435546875, 0.01190185546875, -0.00921630859375, 0.004852294921875, -0...	[ 153941, 7639, 100, 6024, 2256, 10941, 20625, 142508, 8, 978, 10644, 67413, 1556, 459, 36659, 9384, 19336, 50944, 425, 2684, 95307, 44116, 36880, 48716, 124519, 43581, 208124, 5170, 1884, 903, 43240, 5299, 10002, 20441, 86681, 31380, 318, 2176...	[ 0.206787109375, 0.24951171875, 0.07379150390625, 0.1944580078125, 0.2060546875, 0.240234375, 0.156982421875, 0.2320556640625, 0.0927734375, 0.119140625, 0.135498046875, 0.139892578125, 0.1251220703125, 0.0616455078125, 0.011505126953125, 0.188232421875, 0.06243896484375, 0.16101074...	embed
52884045_c0	52884045	haskell	0	Title: Tuple + custom data type Comprehension list Problem title: Tuple + custom data type Comprehension list Tags: haskell Problem: Tuple + custom data type Comprehension list I wonder if I can do comprehension list with Tuple + custom data type. So my simple code is that data T1 = Te {tea::String,tea1::String} derivi...	Tuple + custom data type Comprehension list Tuple + custom data type Comprehension list haskell Tuple Comprehension tea::String tea1::String Show Read Te2 Other tea1 Tuple + custom data type Comprehension list I wonder if I can do comprehension list with Tuple + custom data type. So my simple code is that I have got an...	[ 0.0089111328125, -0.0084228515625, 0.003387451171875, 0.014404296875, 0.00860595703125, -0.012451171875, -0.01153564453125, 0.027099609375, 0.021484375, -0.000644683837890625, -0.007080078125, 0.0037689208984375, 0.0262451171875, 0.00518798828125, -0.02197265625, -0.005157470703125, ...	[ 1371, 8705, 997, 114122, 2053, 10644, 142158, 3220, 6889, 5303, 1556, 142508, 26156, 71713, 82825, 17367, 4764, 1413, 304, 64511, 418, 32195, 831, 54, 46683, 678, 5, 8781, 18151, 18499, 1295, 6, 115992, 84751, 1884, 384, 120, 65423, 1297, ...	[ 0.1593017578125, 0.22998046875, 0.1334228515625, 0.201171875, 0.1409912109375, 0.18359375, 0.1527099609375, 0.19287109375, 0.1077880859375, 0.2022705078125, 0.122802734375, 0.19384765625, 0.18994140625, 0.1129150390625, 0.06646728515625, 0.0831298828125, 0.124755859375, 0.125122070...	embed
30893339_c0	30893339	haskell	0	Title: Idiomatic list construction Problem title: Idiomatic list construction Tags: idioms, list, haskell, functional-programming Problem: Idiomatic list construction I'm very new to Haskell and functional programming in general, so I don't really know how to make this code idiomatic: type Coord = Double data Point = P...	Idiomatic list construction Idiomatic list construction idioms list haskell functional-programming Idiomatic Coord Double Point Show Polyline Add p:line Idiomatic list construction I'm very new to Haskell and functional programming in general, so I don't really know how to make this code idiomatic: My problem is in the...	[ 0.000640869140625, -0.002960205078125, -0.0019683837890625, 0.011474609375, -0.0023956298828125, 0.0177001953125, 0.006500244140625, 0.004302978515625, 0.005828857421875, -0.04638671875, 0.0277099609375, -0.048583984375, 0.0031585693359375, -0.0026397705078125, -0.0240478515625, 0.0128...	[ 87, 5670, 47148, 5303, 50961, 13373, 28016, 1556, 142508, 123309, 28966, 1311, 6651, 107172, 41097, 17367, 63306, 2256, 29117, 915, 12, 4552, 3525, 20625, 56037, 449, 3714, 3642, 3249, 18151, 49666, 9523, 2967, 64549, 93232, 32354, 4263, 3444...	[ 0.01104736328125, 0.16845703125, 0.1558837890625, 0.20556640625, 0.174072265625, 0.162109375, 0.1170654296875, 0.1009521484375, 0.2171630859375, 0.138427734375, 0.0980224609375, 0.0623779296875, 0.1873779296875, 0.105712890625, 0.1636962890625, 0.1123046875, 0.1607666015625, 0.2145...	embed
56779523_c0	56779523	haskell	0	Title: How do I fold nodes of an XML element using lens? Problem title: How do I fold nodes of an XML element using lens? Tags: xml, haskell, haskell-lens Problem: How do I fold nodes of an XML element using lens? I'm using xml-lens package to process XML. Given an Element , I want to perform concatMap -like computatio...	How do I fold nodes of an XML element using lens? How do I fold nodes of an XML element using lens? xml haskell haskell-lens lens How XML Element Node NodeElement How do I fold nodes of an XML element using lens? I'm using xml-lens package to process XML. Given an Element , I want to perform concatMap -like computation...	[ -0.0184326171875, -0.0184326171875, -0.00154876708984375, -0.00732421875, -0.00909423828125, 0.014404296875, -0.02490234375, -0.0181884765625, 0.006988525390625, -0.026123046875, 0.004150390625, -0.0096435546875, -0.01031494140625, -0.006988525390625, 0.004974365234375, -0.029541015625...	[ 11249, 42822, 110, 988, 92537, 12830, 17368, 3098, 7, 54, 111, 131492, 1556, 142508, 1977, 48325, 438, 112, 647, 19929, 87, 98169, 3444, 51339, 158, 4460, 166179, 5062, 181135, 5021, 44457, 40407, 35431, 27489, 1286, 64549, 11001, 1507, 530...	[ 0.057403564453125, 0.253662109375, 0.16015625, 0.171875, 0.2464599609375, 0.1865234375, 0.07159423828125, 0.2025146484375, 0.1201171875, 0.0057373046875, 0.007904052734375, 0.186767578125, 0.045562744140625, 0.1416015625, 0.1641845703125, 0.1722412109375, 0.130615234375, 0.11169433...	embed
61645696_c0	61645696	haskell	0	Title: Backtraking with list Monad in Haskell Problem title: Backtraking with list Monad in Haskell Tags: monads, list, haskell, decomposition Problem: Backtraking with list Monad in Haskell I'm trying to solve a decomposition problem with backtracking and list Monad in Haskell. Here is the problem statement: given a p...	Backtraking with list Monad in Haskell Backtraking with list Monad in Haskell monads list haskell decomposition Control.Monad Backtraking Monad Haskell test1 test2 Backtraking with list Monad in Haskell I'm trying to solve a decomposition problem with backtracking and list Monad in Haskell. Here is the problem statemen...	[ -0.024658203125, 0.01611328125, 0.0125732421875, 0.015625, 0.00077056884765625, 0.01953125, -0.00074005126953125, 0.0113525390625, 0.01287841796875, -0.0341796875, 0.0029144287109375, -0.00238037109375, 0.0126953125, 0.0201416015625, 0.00133514404296875, -0.0003871917724609375, 0.001...	[ 26828, 1517, 6048, 678, 5303, 60331, 71, 23, 20625, 142508, 2667, 712, 1556, 8, 277, 40322, 27131, 46674, 3034, 418, 304, 31577, 86869, 2967, 4420, 125728, 214, 136, 11853, 63805, 34475, 24491, 892, 1505, 653, 7413, 756, 148390, 26255, 37...	[ 0.2052001953125, 0.21826171875, 0.0943603515625, 0.0765380859375, 0.231201171875, 0.20849609375, 0.1602783203125, 0.050506591796875, 0.1533203125, 0.2470703125, 0.1044921875, 0.14111328125, 0.1279296875, 0.1453857421875, 0.1378173828125, 0.1168212890625, 0.18310546875, 0.1280517578...	embed
10243942_c0	10243942	haskell	0	Title: Type annotation in a typeclass' default value causes a "could not deduce" type error Problem title: Type annotation in a typeclass' default value causes a "could not deduce" type error Tags: haskell, type-inference, typeclass Problem: Type annotation in a typeclass' default value ca...	Type annotation in a typeclass' default value causes a "could not deduce" type error Type annotation in a typeclass' default value causes a "could not deduce" type error haskell type-inference typeclass a the Type Could Type annotation in a typeclass' default value causes a "could not dedu...	[ 0.0145263671875, 0.00994873046875, 0.0035858154296875, 0.0224609375, 0.012451171875, -0.0220947265625, -0.032958984375, 0.007049560546875, -0.0009613037109375, -0.00170135498046875, -0.02294921875, -0.0181884765625, 0.0135498046875, 0.0322265625, 0.001373291015625, -0.004791259765625, ...	[ 60457, 8668, 22062, 23, 10644, 67413, 3768, 114977, 34292, 113660, 587, 52366, 959, 8, 106357, 18499, 1556, 142508, 69988, 10, 191147, 125296, 25632, 18151, 35782, 9969, 1340, 527, 73265, 37202, 51, 2082, 756, 70, 25, 80934, 335, 5701, 7334...	[ 0.2418212890625, 0.183349609375, 0.119384765625, 0.03369140625, 0.1856689453125, 0.1998291015625, 0.059783935546875, 0.2095947265625, 0.113037109375, 0.0838623046875, 0.0213623046875, 0.12060546875, 0.1295166015625, 0.1370849609375, 0.1895751953125, 0.1632080078125, 0.07080078125, ...	embed
8688719_c0	8688719	haskell	0	Title: In Haskell, performance and where binding Problem title: In Haskell, performance and where binding Tags: haskell Problem: In Haskell, performance and where binding I am just learning Haskell and wrote two programs from a tutorial site, such that maximumnowhere :: (Ord a) => [a] -> a maximumnowhere [] = error "em...	In Haskell, performance and where binding In Haskell, performance and where binding haskell Haskell Ord x:xs In Haskell, performance and where binding I am just learning Haskell and wrote two programs from a tutorial site, such that and I thought these two programs are fairly equivalent, cause I thought, the where bind...	[ -0.015625, 0.0228271484375, 0.0054931640625, -0.0279541015625, 0.005157470703125, 0.01806640625, -0.002410888671875, -0.002655029296875, 0.0230712890625, -0.0205078125, 0.010009765625, -0.00946044921875, 0.019287109375, -0.0174560546875, 0.0203857421875, 0.0027923583984375, 0.0024108...	[ 360, 20625, 142508, 23718, 136, 7440, 128239, 1556, 35379, 1022, 12, 425, 52080, 54397, 6626, 103391, 57143, 17569, 180663, 183234, 70, 91995, 77336, 678, 10941, 11675, 31380, 318, 509, 3917, 72803, 56, 10298, 140909, 645, 11653, 58696, 60212...	[ 0.0517578125, 0.153564453125, 0.2464599609375, 0.2279052734375, 0.0823974609375, 0.2103271484375, 0.264892578125, 0.14013671875, 0.1748046875, 0.09228515625, 0.0283050537109375, 0.10791015625, 0.032928466796875, 0.010589599609375, 0.05279541015625, 0.13232421875, 0.053619384765625, ...	embed
11144393_c1	11144393	haskell	1	(tail lst) --Pairing letters and creating a map of tuples containing frequency related characters msg = zip (oneChar $ lSort $ grp $ msgSort $ alphaSort $ map toUpper $ codedMsg) mostFreqLtr msg2 = DMap.fromList msg --replace coded list with analyzed list replaceChars lst \| null lst = [] \| isAlpha (head lst) = DMap.lo...	(tail lst) --Pairing letters and creating a map of tuples containing frequency related characters msg = zip (oneChar $ lSort $ grp $ msgSort $ alphaSort $ map toUpper $ codedMsg) mostFreqLtr msg2 = DMap.fromList msg --replace coded list with analyzed list replaceChars lst \| null lst = [] \| isAlpha (head lst) = DMap.lo...	[ 0.0087890625, -0.0018463134765625, -0.00311279296875, 0.01275634765625, 0.0218505859375, 0.00119781494140625, -0.0103759765625, -0.003173828125, 0, 0.0211181640625, 0.00677490234375, -0.00860595703125, 0.0115966796875, -0.00579833984375, -0.007781982421875, -0.0026397705078125, 0.004...	[ 46741, 96, 271, 4210, 8335, 14, 2852, 120820, 105233, 22288, 370, 99726, 70541, 12478, 944, 27771, 62548, 124850, 68163, 177, 2203, 68330, 3630, 84068, 158240, 4452, 254, 144, 14612, 47, 8079, 18151, 7, 2684, 107, 864, 4448, 304, 391, 166...	[ 0.2349853515625, 0.00823974609375, 0.141845703125, 0.0045166015625, 0.148681640625, 0.1397705078125, 0.061004638671875, 0.1680908203125, 0.0989990234375, 0.2186279296875, 0.0938720703125, 0.2203369140625, 0.045684814453125, 0.192626953125, 0.139892578125, 0.04437255859375, 0.11437988...	embed
12218863_c0	12218863	haskell	0	Title: Slightly complex [String] -> [UTCTime] Problem title: Slightly complex [String] -> [UTCTime] Tags: haskell Problem: Slightly complex [String] -> [UTCTime] I have a list of strings, the strings are either a unixtime or an increment from that unixtime eg. listOfTimes :: [String] listOfTimes = ["u1345469400",...	Slightly complex [String] -> [UTCTime] Slightly complex [String] -> [UTCTime] haskell Slightly UTCTime u1345469400 u1346427334 Char Integer Slightly complex [String] -> [UTCTime] I have a list of strings, the strings are either a unixtime or an increment from that unixtime eg. I have written functions which take ...	[ -0.00445556640625, 0.0035247802734375, 0.00579833984375, -0.00469970703125, -0.00152587890625, 0.00494384765625, 0.01129150390625, -0.0167236328125, -0.000812530517578125, -0.0272216796875, 0.000301361083984375, -0.0185546875, 0.030517578125, 0.0252685546875, -0.0191650390625, -0.00173...	[ 159, 20016, 538, 27140, 71713, 214, 5386, 45962, 70059, 1556, 142508, 99577, 75, 2681, 4633, 169531, 10700, 160775, 3768, 124618, 21656, 44401, 33079, 87, 765, 5303, 111, 79315, 7, 40101, 51, 4084, 6032, 6, 158661, 1295, 30046, 59121, 32354...	[ 0.038665771484375, 0.2529296875, 0.1380615234375, 0.283203125, 0.1375732421875, 0.049224853515625, 0.1318359375, 0.200439453125, 0.25732421875, 0.1446533203125, 0.258544921875, 0.1719970703125, 0.08056640625, 0.0587158203125, 0.1290283203125, 0.127685546875, 0.1522216796875, 0.0844...	embed
38160099_c0	38160099	haskell	0	Title: Haskell sorting Map (via List) won't work Problem title: Haskell sorting Map (via List) won't work Tags: haskell, sorting Problem: Haskell sorting Map (via List) won't work I already read a lot of question and answers to the topic, but I can't find my mistake. Hope someone of you can help me out. My sc...	Haskell sorting Map (via List) won't work Haskell sorting Map (via List) won't work haskell sorting Haskell Map List Integer Map.empty Map.toList Map.fromList Data.List.sortBy Map.insert Ord Ordering Haskell sorting Map (via List) won't work I already read a lot of question and answers to the topic, but I can...	[ 0.00121307373046875, -0.0027008056640625, 0.006256103515625, -0.015380859375, -0.032958984375, -0.00156402587890625, -0.0010223388671875, -0.01025390625, 0.003021240234375, 0.01708984375, 0.0277099609375, 0.01385498046875, -0.00628662109375, 0.00457763671875, 0.00189208984375, -0.01098...	[ 20625, 142508, 12096, 214, 42719, 3459, 32036, 23742, 3768, 18, 4488, 1556, 44401, 33548, 188, 154663, 161063, 62351, 75358, 73, 33657, 35379, 81206, 5915, 121742, 75359, 4358, 106117, 20779, 5303, 3395, 41170, 1810, 40907, 10588, 167375, 19336...	[ 0.1435546875, 0.2445068359375, 0.2052001953125, 0.0867919921875, 0.23681640625, 0.164306640625, 0.224365234375, 0.091552734375, 0.07122802734375, 0.10205078125, 0.143310546875, 0.1368408203125, 0.1253662109375, 0.104248046875, 0.08721923828125, 0.1263427734375, 0.050933837890625, 0...	embed
31488861_c0	31488861	haskell	0	Title: Re-export qualified - how to solve it nowadays, any solution? Problem title: Re-export qualified - how to solve it nowadays, any solution? Tags: module, haskell Problem: Re-export qualified - how to solve it nowadays, any solution? I have exactly the same issue as described in this question Re-export qualified? ...	Re-export qualified - how to solve it nowadays, any solution? Re-export qualified - how to solve it nowadays, any solution? module haskell Foo.A Foo.B Re-export Foo Re-export qualified - how to solve it nowadays, any solution? I have exactly the same issue as described in this question Re-export qualified? It was asked...	[ -0.00396728515625, -0.00787353515625, 0.0086669921875, 0.0252685546875, 0.0042724609375, 0.004241943359375, 0.00171661376953125, -0.000537872314453125, -0.004180908203125, 0.02294921875, -0.005645751953125, 0.0169677734375, 0.0196533203125, 0.013671875, 0.001220703125, -0.01513671875, ...	[ 853, 9, 180758, 217225, 3642, 47, 86869, 442, 134523, 5636, 2499, 29806, 88996, 1556, 142508, 9572, 31, 284, 571, 66161, 31089, 37170, 190, 5369, 6650, 13648, 65572, 16792, 16916, 18226, 7, 166996, 449, 161521, 831, 87794, 32354, 5775, 1263...	[ 0.203125, 0.054901123046875, 0.2939453125, 0.253662109375, 0.075439453125, 0.04022216796875, 0.1796875, 0.112548828125, 0.1072998046875, 0.1124267578125, 0.05975341796875, 0.13330078125, 0.1639404296875, 0.13427734375, 0.22998046875, 0.2042236328125, 0.147705078125, 0.080810546875,...	embed
59944028_c0	59944028	haskell	0	Title: How to define Show for heterogenous lists in Haskell Problem title: How to define Show for heterogenous lists in Haskell Tags: gadt, haskell Problem: How to define Show for heterogenous lists in Haskell I'm researching into what Haskell can offer on it's way to dependent types by reading Thinking with types . He...	How to define Show for heterogenous lists in Haskell How to define Show for heterogenous lists in Haskell gadt haskell ys How Show Haskell Thinking HList Type HNil Ord Occurs ts2 Expected Char Actual ts1 Relevant Lib.hs:43:25 Lib.hs:43:20 How to define Show for heterogenous lists in Haskell I'm researching into what Ha...	[ -0.0140380859375, -0.00811767578125, 0.00445556640625, -0.0076904296875, -0.0074462890625, -0.006011962890625, -0.00170135498046875, -0.01434326171875, 0.01904296875, 0.01251220703125, -0.027099609375, -0.04736328125, 0.0252685546875, 0.01263427734375, -0.00189208984375, 0.002349853515...	[ 61924, 17367, 100, 77099, 61065, 223, 5303, 20625, 142508, 914, 13384, 1556, 113, 87062, 572, 154663, 60457, 379, 35379, 48650, 61636, 304, 60075, 21656, 100582, 133, 127, 33210, 21224, 108750, 52895, 16454, 678, 225, 1357, 23749, 41072, 1849...	[ 0.1829833984375, 0.28076171875, 0.05926513671875, 0.1956787109375, 0.1859130859375, 0.050811767578125, 0.1876220703125, 0.1173095703125, 0.2056884765625, 0.0643310546875, 0.11767578125, 0.0997314453125, 0.0789794921875, 0.113525390625, 0.09942626953125, 0.2066650390625, 0.1328125, ...	embed
11195758_c0	11195758	haskell	0	Title: Haskell code formatting Problem title: Haskell code formatting Tags: haskell, coding-style Problem: Haskell code formatting Haskell have indentation based style for blocks. I know two styles but I can't decide what style is better. (Forgive me a really stupid example function) 1st - pretty: funcA :: Integer -> I...	Haskell code formatting Haskell code formatting haskell coding-style Haskell Integer Haskell code formatting Haskell have indentation based style for blocks. I know two styles but I can't decide what style is better. (Forgive me a really stupid example function) 1st - pretty: This style looks great, but it is very frag...	[ -0.002960205078125, -0.01080322265625, 0.0291748046875, 0.0194091796875, 0.00118255615234375, 0.0038604736328125, 0.015380859375, -0.000614166259765625, -0.003570556640625, 0.00921630859375, 0.00811767578125, -0.01361083984375, -0.01458740234375, -0.005950927734375, 0.0047607421875, -0...	[ 20625, 142508, 18151, 9384, 1916, 1556, 552, 6238, 40946, 44401, 765, 18597, 22062, 35509, 20623, 100, 46389, 7, 3714, 6626, 831, 28288, 2367, 11522, 6183, 110833, 27781, 32354, 271, 28875, 3293, 33342, 6782, 1284, 4552, 119371, 13, 456, 14...	[ 0.1522216796875, 0.2626953125, 0.2008056640625, 0.1915283203125, 0.03936767578125, 0.139892578125, 0.125732421875, 0.06390380859375, 0.2142333984375, 0.2022705078125, 0.046844482421875, 0.197021484375, 0.1834716796875, 0.165771484375, 0.2354736328125, 0.057098388671875, 0.20361328125...	embed
21206008_c0	21206008	haskell	0	Title: Installing vector pkg using cabal fails Problem title: Installing vector pkg using cabal fails Tags: haskell, cabal Problem: Installing vector pkg using cabal fails I try to install vector package using cabal install vector but it fails giving the error here: http://hastebin.com/miwunadefo.vbs My cabal version i...	Installing vector pkg using cabal fails Installing vector pkg using cabal fails haskell cabal cabal version Installing Glorious Glasgow Haskell Compilation System Configured Applications Xcode.app Contents Developer Apple LLVM clang-500.2.79 Target x86_64-apple-darwin12.5.0 Thread Installing vector pkg using cabal fail...	[ 0.008544921875, 0.0255126953125, 0.00347900390625, 0.007476806640625, -0.00119781494140625, -0.01177978515625, -0.0218505859375, -0.0184326171875, -0.0213623046875, -0.0012969970703125, -0.00921630859375, -0.045166015625, -0.006805419921875, -0.0033111572265625, -0.014892578125, 0.0222...	[ 107951, 173, 18770, 915, 8517, 17368, 109524, 35782, 1556, 142508, 11389, 46173, 93905, 181787, 20625, 15612, 14, 12353, 59994, 104921, 1193, 40899, 9007, 70870, 152774, 4129, 99954, 47599, 3066, 121993, 22377, 160017, 15276, 13307, 9494, 1530, ...	[ 0.1646728515625, 0.1920166015625, 0.2022705078125, 0.03094482421875, 0.1966552734375, 0.08447265625, 0.24951171875, 0.1763916015625, 0.089599609375, 0.2142333984375, 0.089111328125, 0.051605224609375, 0.0733642578125, 0.154052734375, 0.0904541015625, 0.075439453125, 0.0380859375, 0...	embed
30472022_c0	30472022	haskell	0	Title: find nth element from the last in a list using recursion Problem title: find nth element from the last in a list using recursion Tags: tail-recursion, recursion, haskell, c Problem: find nth element from the last in a list using recursion we can solve this problem in, say C, using a static variable, like in the ...	find nth element from the last in a list using recursion find nth element from the last in a list using recursion tail-recursion recursion haskell c the recursion NTH ELEM LAST STUFF find nth element from the last in a list using recursion we can solve this problem in, say C, using a static variable, like in the snippe...	[ -0.0155029296875, 0.02001953125, 0.00970458984375, -0.014892578125, 0.0135498046875, 0.0140380859375, 0.000766754150390625, 0.00128173828125, 0.01434326171875, -0.037841796875, 0.01519775390625, -0.0546875, -0.003387451171875, -0.00531005859375, 0.0106201171875, -0.008056640625, 0.01...	[ 7413, 653, 927, 12830, 1295, 70, 4568, 23, 5303, 17368, 195625, 1830, 46741, 107, 48650, 1556, 142508, 501, 541, 23415, 241, 100191, 172905, 94432, 30110, 10, 86869, 2967, 313, 201939, 77336, 32354, 11782, 9520, 156566, 20625, 29479, 123309, ...	[ 0.152587890625, 0.206298828125, 0.2261962890625, 0.237060546875, 0.1873779296875, 0.07958984375, 0.24267578125, 0.093505859375, 0.181396484375, 0.0992431640625, 0.234130859375, 0.1304931640625, 0.1982421875, 0.031524658203125, 0.15966796875, 0.0909423828125, 0.1939697265625, 0.0678...	embed
60999355_c0	60999355	haskell	0	Title: xml-conduit: How to Modify a Document? Problem title: xml-conduit: How to Modify a Document? Tags: xml-conduit, xml, haskell Problem: xml-conduit: How to Modify a Document? The xml-conduit tutorial (the only one in existence, and perhaps the only Haskell XML library with a tutorial) shows how to create or read a...	xml-conduit: How to Modify a Document? xml-conduit: How to Modify a Document? xml-conduit xml haskell How Modify Document Title Paragraph xml-conduit: How to Modify a Document? The xml-conduit tutorial (the only one in existence, and perhaps the only Haskell XML library with a tutorial) shows how to create or read an X...	[ -0.009765625, 0.0257568359375, 0.005218505859375, -0.005859375, 0.01116943359375, -0.0137939453125, -0.0194091796875, -0.01385498046875, 0.0185546875, -0.00750732421875, -0.004608154296875, -0.0208740234375, 0.00072479248046875, -0.003936767578125, 0.035400390625, -0.01220703125, -0....	[ 131492, 9, 2271, 112061, 12, 11249, 47, 16269, 40383, 43101, 10, 1556, 142508, 48962, 1720, 41382, 57143, 4734, 116311, 95134, 20625, 92537, 35773, 678, 45831, 3642, 28282, 707, 12301, 12937, 1284, 959, 2811, 1632, 3917, 16031, 6044, 41018, ...	[ 0.2435302734375, 0.0313720703125, 0.11376953125, 0.21826171875, 0.0161895751953125, 0.123291015625, 0.04595947265625, 0.20361328125, 0.193359375, 0.2286376953125, 0.013702392578125, 0.1201171875, 0.2071533203125, 0.1982421875, 0.1131591796875, 0.107177734375, 0.1873779296875, 0.078...	embed
1361307_c0	1361307	haskell	0	Title: Which Haskell XML library to use? Problem title: Which Haskell XML library to use? Tags: comparison, xml, haskell Problem: Which Haskell XML library to use? I see that there is a few of XML processing libraries in Haskell. HaXml seems to be the most popular (according to dons ) HXT seems to be the most advanced ...	Which Haskell XML library to use? Which Haskell XML library to use? comparison xml haskell Which Haskell XML Which Haskell XML library to use? I see that there is a few of XML processing libraries in Haskell. HaXml seems to be the most popular (according to dons ) HXT seems to be the most advanced (but also the most di...	[ -0.0023193359375, 0.0081787109375, 0.01422119140625, 0.005584716796875, 0.01055908203125, 0.00518798828125, -0.021240234375, -0.0004329681396484375, 0.0002079010009765625, 0.0218505859375, -0.000217437744140625, -0.05224609375, 0.01129150390625, -0.0009918212890625, -0.00677490234375, ...	[ 130078, 20625, 142508, 92537, 35773, 1294, 47, 4527, 225490, 131492, 1556, 10846, 9433, 214, 10484, 1391, 1542, 7237, 37202, 2684, 5700, 572, 70981, 175961, 34844, 30698, 45458, 118201, 62822, 366, 2189, 39456, 32997, 69141, 31, 2037, 7909, 2...	[ 0.092529296875, 0.161865234375, 0.24169921875, 0.28173828125, 0.2457275390625, 0.156005859375, 0.0546875, 0.1448974609375, 0.12255859375, 0.249755859375, 0.1343994140625, 0.02801513671875, 0.0806884765625, 0.0101318359375, 0.0924072265625, 0.14794921875, 0.1160888671875, 0.21752929...	embed
34514511_c0	34514511	haskell	0	Title: Understanding recursive lazy lists Problem title: Understanding recursive lazy lists Tags: haskell Problem: Understanding recursive lazy lists I'm trying to get comfortable with the following snippet from the Haskell wiki : primesPE = 2 : oddprimes where oddprimes = sieve [3,5..] 9 oddprimes sieve (x:xs) q ps@ ~...	Understanding recursive lazy lists Understanding recursive lazy lists haskell Understanding x:xs p:t y:ys Understanding recursive lazy lists I'm trying to get comfortable with the following snippet from the Haskell wiki : I'm getting tripped up on the recursive definition of oddprimes and the usage of minus on infinite...	[ -0.005950927734375, 0.03759765625, 0.022216796875, 0.01141357421875, 0.0128173828125, 0.011962890625, 0.01116943359375, 0.006134033203125, 0.026611328125, 0.005126953125, 0.0203857421875, 0.00106048583984375, 0.019775390625, 0.009033203125, 0.0037841796875, 0.010009765625, 0.02551269...	[ 9626, 144057, 195625, 5844, 21, 3285, 5303, 1556, 142508, 1022, 12, 425, 7, 915, 18, 4778, 104577, 20625, 34356, 80934, 70270, 114654, 127689, 26948, 54241, 32354, 20594, 221, 28219, 3642, 9969, 34759, 71924, 903, 18151, 11249, 14602, 959, ...	[ 0.0823974609375, 0.07635498046875, 0.1959228515625, 0.107421875, 0.1314697265625, 0.2030029296875, 0.1988525390625, 0.10693359375, 0.2281494140625, 0.007965087890625, 0.0139617919921875, 0.0333251953125, 0.0516357421875, 0.0254364013671875, 0.02960205078125, 0.07342529296875, 0.08654...	embed
35813257_c0	35813257	haskell	0	Title: Ambiguity of types in Haskell Problem title: Ambiguity of types in Haskell Tags: haskell Problem: Ambiguity of types in Haskell _foldr :: (a -> b -> b) -> b -> [a] -> b _foldr op z [] = z _foldr op z (x:xs) = x `op` _foldr op z xs Hi, let's consider above code. After: ghci> _foldr + 0 [1] I got error: No instanc...	Ambiguity of types in Haskell Ambiguity of types in Haskell haskell the Ambiguity Haskell _foldr x:xs Num Possible Note Double Defined GHC.Float Float Integral GHC.Real.Ratio GHC.Real Ambiguity of types in Haskell Hi, let's consider above code. After: I got error: Basically I understand what it means and I suppose that...	[ -0.01239013671875, -0.0147705078125, 0.00009298324584960938, -0.00107574462890625, -0.0106201171875, 0.00482177734375, -0.01287841796875, 0.0247802734375, -0.01025390625, 0.000591278076171875, -0.009521484375, -0.04296875, -0.00274658203125, 0.006317138671875, 0.003814697265625, 0.0013...	[ 10250, 12282, 2481, 111, 52895, 20625, 142508, 23, 1556, 42822, 42, 1022, 12, 425, 52782, 115861, 2661, 18622, 107172, 262, 5983, 527, 73265, 365, 38699, 204681, 68996, 1052, 28645, 16916, 36917, 18151, 24372, 18499, 12506, 87, 28219, 2367, ...	[ 0.1798095703125, 0.2142333984375, 0.0753173828125, 0.06243896484375, 0.21435546875, 0.157958984375, 0.2406005859375, 0.04827880859375, 0.146484375, 0.1170654296875, 0.04730224609375, 0.038299560546875, 0.0259552001953125, 0.0648193359375, 0.1085205078125, 0.1298828125, 0.029953002929...	embed
29950573_c0	29950573	haskell	0	Title: Type Inference in Haskell v. Scala Problem title: Type Inference in Haskell v. Scala Tags: type-inference, haskell, scala Problem: Type Inference in Haskell v. Scala Given the following code: Prelude> let f x = if (x) then 55 else "foo" Why does the compiler look for a Num [Char] ? <interactive>:2:23: No instanc...	Type Inference in Haskell v. Scala Type Inference in Haskell v. Scala type-inference haskell scala the scala.reflect.runtime.universe._ Type Inference Haskell Scala Prelude Num Char Any Boolean List res4 reflect.runtime.universe.Type Type Inference in Haskell v. Scala Given the following code: Why does the compiler loo...	[ 0.00885009765625, -0.002410888671875, 0.01043701171875, -0.0022430419921875, -0.00286865234375, 0.00518798828125, 0.01483154296875, 0.00072479248046875, 0.0037841796875, 0.01190185546875, 0.00592041015625, -0.0458984375, -0.003662109375, 0.00384521484375, 0.0174560546875, 0.00708007812...	[ 60457, 360, 69988, 20625, 142508, 81, 152653, 11, 13, 23, 10644, 73, 1556, 146232, 29087, 8996, 18, 16428, 6032, 49545, 1914, 822, 52782, 21656, 28541, 73783, 34677, 32036, 3332, 617, 44961, 196707, 44084, 9969, 34759, 6713, 100, 10, 84068,...	[ 0.264404296875, 0.1092529296875, 0.2418212890625, 0.1424560546875, 0.25439453125, 0.1383056640625, 0.2283935546875, 0.17724609375, 0.020477294921875, 0.022705078125, 0.208984375, 0.056365966796875, 0.1319580078125, 0.224853515625, 0.094482421875, 0.140625, 0.003936767578125, 0.0164...	embed
54428941_c0	54428941	haskell	0	Title: Haskell: applying flip twice (type of flip flip) Problem title: Haskell: applying flip twice (type of flip flip) Tags: function, haskell, functional-programming Problem: Haskell: applying flip twice (type of flip flip) I am learning Haskell along some basic functions. I was doing some exercises with Flip, which ...	Haskell: applying flip twice (type of flip flip) Haskell: applying flip twice (type of flip flip) function haskell functional-programming Haskell Haskell: applying flip twice (type of flip flip) I am learning Haskell along some basic functions. I was doing some exercises with Flip, which takes a function of two argumen...	[ 0.0255126953125, 0.01409912109375, 0.0169677734375, 0.01422119140625, 0.00927734375, 0.0302734375, -0.022705078125, -0.017822265625, 0.00127410888671875, 0.006805419921875, 0.01025390625, -0.01458740234375, -0.0084228515625, 0.00274658203125, 0.002685546875, 0.005767822265625, 0.0228...	[ 20625, 142508, 59911, 214, 147505, 186351, 50986, 12, 111, 32354, 1556, 123309, 28966, 52080, 33233, 62822, 81979, 160808, 51776, 6626, 10750, 151575, 16750, 33977, 26783, 12989, 2806, 765, 17569, 80934, 48398, 7311, 678, 171859, 12765, 237259, ...	[ 0.1002197265625, 0.226806640625, 0.129150390625, 0.03387451171875, 0.236572265625, 0.228759765625, 0.1680908203125, 0.0165863037109375, 0.036041259765625, 0.151611328125, 0.07843017578125, 0.1116943359375, 0.061431884765625, 0.042633056640625, 0.0237274169921875, 0.033447265625, 0.04...	embed
11358979_c0	11358979	haskell	0	Title: list permutations in haskell Problem title: list permutations in haskell Tags: haskell, list, permutation Problem: list permutations in haskell So I'm new to haskell and I've been playing with it for a while now. I want to get my function that outputs all list permutations to work. I have written 2 implementatio...	list permutations in haskell list permutations in haskell haskell list permutation Occurs Expected Actual list permutations in haskell So I'm new to haskell and I've been playing with it for a while now. I want to get my function that outputs all list permutations to work. I have written 2 implementations, one works we...	[ -0.00897216796875, 0.021484375, 0.0032501220703125, -0.006591796875, -0.011962890625, 0.0001544952392578125, -0.0244140625, -0.01226806640625, 0.010498046875, -0.0255126953125, 0.005157470703125, -0.0169677734375, 0.043212890625, 0.01019287109375, -0.02001953125, 0.00872802734375, 0....	[ 5303, 117, 14311, 21094, 23, 1556, 142508, 561, 22062, 180, 238, 48650, 60075, 13, 100582, 1061, 3525, 47, 75169, 678, 12960, 5036, 3444, 2046, 32354, 140992, 7, 756, 4488, 765, 59121, 116, 208124, 1632, 43240, 5299, 3789, 68772, 163, 184...	[ 0.210693359375, 0.13623046875, 0.2225341796875, 0.11962890625, 0.051971435546875, 0.1612548828125, 0.2418212890625, 0.1754150390625, 0.030181884765625, 0.051116943359375, 0.04449462890625, 0.1373291015625, 0.10693359375, 0.1260986328125, 0.1773681640625, 0.0156402587890625, 0.0519409...	embed
14322566_c0	14322566	haskell	0	Title: Expanding Repa array shapes Problem title: Expanding Repa array shapes Tags: repa, haskell Problem: Expanding Repa array shapes I'm writing a program that generates images, which I would like to bring into a Repa array. I'm currently using the type: data Colour = Colour Double Double Double to represent pixels, ...	Expanding Repa array shapes Expanding Repa array shapes repa haskell Expanding Repa Colour Double DIM1 Array R.fromListUnboxed DIM2 DIM3 Expanding Repa array shapes I'm writing a program that generates images, which I would like to bring into a Repa array. I'm currently using the type: to represent pixels, and I have a...	[ 0.0062255859375, 0.010009765625, -0.0289306640625, 0.0255126953125, -0.00616455078125, 0.01611328125, 0.006591796875, 0.004119873046875, 0.009033203125, -0.006744384765625, -0.00090789794921875, -0.017578125, 0.028076171875, -0.0050048828125, -0.018310546875, -0.01043701171875, -0.00...	[ 60075, 11, 33770, 33742, 10298, 53, 115700, 10958, 1556, 142508, 196431, 107172, 175546, 418, 69253, 627, 161063, 154663, 14256, 11728, 304, 363, 32562, 1528, 139392, 43079, 1884, 19095, 3934, 82424, 17368, 10644, 33636, 98009, 90837, 23, 13, ...	[ 0.1038818359375, 0.2081298828125, 0.1363525390625, 0.2108154296875, 0.1781005859375, 0.117431640625, 0.21875, 0.1790771484375, 0.1015625, 0.2362060546875, 0.1959228515625, 0.1744384765625, 0.15673828125, 0.068603515625, 0.1422119140625, 0.04571533203125, 0.045166015625, 0.068603515...	embed
49467487_c0	49467487	haskell	0	Title: How can I search all packages with hoogle via command line? Problem title: How can I search all packages with hoogle via command line? Tags: haskell, hoogle Problem: How can I search all packages with hoogle via command line? I've installed hoogle locally and have run hoogle generate . If I run hoogle maybeToEit...	How can I search all packages with hoogle via command line? How can I search all packages with hoogle via command line? haskell hoogle MonadError How Data.Either.Utils Maybe Either Monoid Network.Haskoin.Util How can I search all packages with hoogle via command line? I've installed hoogle locally and have run hoogle g...	[ -0.004791259765625, -0.0098876953125, -0.00173187255859375, 0.006622314453125, -0.00762939453125, 0.0308837890625, 0.00543212890625, -0.0286865234375, 0.001190185546875, -0.037353515625, 0.001708984375, -0.046875, 0.0233154296875, -0.0152587890625, -0.01611328125, -0.002532958984375, ...	[ 11249, 831, 87, 33938, 756, 98169, 7, 678, 28994, 133, 1829, 75101, 13315, 1556, 142508, 60331, 71, 18468, 31611, 11809, 9319, 106742, 7870, 83425, 77879, 532, 28997, 6495, 1579, 73, 3675, 20600, 4000, 11675, 139392, 4263, 51139, 7763, 3330...	[ 0.0625, 0.083251953125, 0.03143310546875, 0.26416015625, 0.1563720703125, 0.2283935546875, 0.0294647216796875, 0.1614990234375, 0.2216796875, 0.265625, 0.1103515625, 0.2081298828125, 0.16650390625, 0.1312255859375, 0.2109375, 0.111083984375, 0.0237884521484375, 0.037384033203125, ...	embed
77652471_c0	77652471	haskell	0	Title: The signature of a function that returns any instances of a particular class Problem title: The signature of a function that returns any instances of a particular class Tags: haskell Problem: The signature of a function that returns any instances of a particular class There are a class and an instance of the cla...	The signature of a function that returns any instances of a particular class The signature of a function that returns any instances of a particular class haskell break Vehicle Car Couldn Main.break jdoodle.hs:6:1-27 Relevant jdoodle.hs:7:1 The signature of a function that returns any instances of a particular class The...	[ -0.00183868408203125, -0.0093994140625, -0.00148773193359375, -0.00007867813110351562, -0.003875732421875, 0.009521484375, -0.000396728515625, -0.01422119140625, 0.01416015625, -0.037353515625, -0.029052734375, -0.03125, -0.01348876953125, 0.01190185546875, -0.0126953125, -0.0059509277...	[ 581, 138256, 111, 32354, 450, 30646, 7, 2499, 110527, 17311, 18507, 1556, 142508, 36356, 232362, 3980, 191147, 19, 12321, 70751, 1647, 55742, 133, 127, 910, 19721, 50994, 30624, 10, 136, 142, 1884, 61924, 55300, 5303, 3917, 831, 54, 442 ]	[ 0.05645751953125, 0.27197265625, 0.07080078125, 0.2197265625, 0.0472412109375, 0.192138671875, 0.04840087890625, 0.10693359375, 0.25634765625, 0.1580810546875, 0.2127685546875, 0.142333984375, 0.2467041015625, 0.262451171875, 0.256103515625, 0.2100830078125, 0.11083984375, 0.075927...	embed
9745539_c0	9745539	haskell	0	Title: How do I create Haskell functions that return functions? Problem title: How do I create Haskell functions that return functions? Tags: functional-programming, higher-order-functions, function, function-composition, haskell Problem: How do I create Haskell functions that return functions? I would like to create t...	How do I create Haskell functions that return functions? How do I create Haskell functions that return functions? functional-programming higher-order-functions function function-composition haskell How Haskell How do I create Haskell functions that return functions? I would like to create three Haskell functions: a , b...	[ 0.005828857421875, 0.00016117095947265625, 0.00958251953125, 0.0291748046875, 0.00933837890625, 0.004150390625, 0.006011962890625, -0.00811767578125, 0.00714111328125, -0.00162506103515625, -0.0096435546875, -0.00579833984375, -0.0040283203125, 0.021728515625, 0.01312255859375, -0.0096...	[ 11249, 87, 28282, 20625, 142508, 32354, 7, 450, 30646, 54, 123309, 28966, 77546, 80596, 137175, 277, 40322, 1556, 2806, 1884, 17262, 10, 876, 136, 501, 98423, 47, 765, 1632, 10750, 123166, 2174, 173915, 104851, 3789, 6626, 76556, 75935, 190...	[ 0.1025390625, 0.06585693359375, 0.2249755859375, 0.16552734375, 0.25146484375, 0.2337646484375, 0.10791015625, 0.08135986328125, 0.2393798828125, 0.05621337890625, 0.1497802734375, 0.06158447265625, 0.055419921875, 0.10491943359375, 0.1826171875, 0.04022216796875, 0.052978515625, 0...	embed
33217911_c0	33217911	haskell	0	Title: Stack: How can I use a multi-package dependency in `Setup.hs`? Problem title: Stack: How can I use a multi-package dependency in `Setup.hs`? Tags: haskell, cabal, haskell-stack Problem: Stack: How can I use a multi-package dependency in `Setup.hs`? I have a stack multi-package project where the "multi-package" i...	Stack: How can I use a multi-package dependency in `Setup.hs`? Stack: How can I use a multi-package dependency in `Setup.hs`? haskell cabal haskell-stack Stack How Setup.hs zip-conduit-0.2.2.2 nightly-2015-10-12 Custom Stack: How can I use a multi-package dependency in `Setup.hs`? I have a stack multi-package project w...	[ -0.008056640625, 0.0211181640625, 0.0031585693359375, 0.01544189453125, -0.0294189453125, 0.0234375, -0.0247802734375, 0.0008697509765625, 0.00677490234375, -0.0216064453125, -0.00982666015625, -0.03466796875, 0.0098876953125, 0.018798828125, 0.001495361328125, 0.0302734375, -0.02587...	[ 6512, 2594, 11249, 831, 4527, 6024, 29102, 4588, 42548, 27771, 23, 294, 126, 2037, 5, 127, 7, 1556, 142508, 109524, 590, 19943, 68330, 2271, 112061, 133684, 70147, 17431, 538, 44906, 52486, 1530, 130664, 177261, 13452, 144227, 77488, 11389, ...	[ 0.1458740234375, 0.118408203125, 0.049102783203125, 0.030670166015625, 0.1483154296875, 0.212890625, 0.2261962890625, 0.0986328125, 0.2353515625, 0.126220703125, 0.02337646484375, 0.10302734375, 0.1490478515625, 0.1705322265625, 0.010955810546875, 0.1435546875, 0.07623291015625, 0....	embed
12107124_c0	12107124	haskell	0	Title: Simulating existential quantification in function return types Problem title: Simulating existential quantification in function return types Tags: existential-type, return-type, haskell, gadt Problem: Simulating existential quantification in function return types Sometimes I come upon a need to return values of ...	Simulating existential quantification in function return types Simulating existential quantification in function return types existential-type return-type haskell gadt Simulating Show Vec Simulating existential quantification in function return types Sometimes I come upon a need to return values of an existentially qua...	[ 0.01141357421875, 0.013916015625, 0.0016632080078125, 0.0201416015625, 0.0011749267578125, -0.005615234375, -0.001983642578125, -0.014404296875, 0.006378173828125, -0.0201416015625, -0.006591796875, -0.027099609375, -0.0166015625, 0.0016937255859375, -0.003753662109375, 0.0023498535156...	[ 144814, 1916, 99707, 15403, 55230, 41274, 32354, 30646, 52895, 23, 50986, 1556, 142508, 914, 13384, 17367, 52884, 54799, 3871, 142424, 14, 25958, 47314, 10644, 96276, 2684, 27983, 20697, 68743, 5928, 33636, 168867, 40197, 53201, 151334, 17756, ...	[ 0.260009765625, 0.057098388671875, 0.214111328125, 0.121826171875, 0.2227783203125, 0.12939453125, 0.207275390625, 0.235107421875, 0.2071533203125, 0.0226898193359375, 0.17626953125, 0.1207275390625, 0.2139892578125, 0.06817626953125, 0.1534423828125, 0.1190185546875, 0.1656494140625...	embed
36106261_c1	36106261	haskell	1	x) = Typed <$> x .: "id" <> x .: "name" instance FromJSON Day where parseJSON (Object x) = Day <$> x .: "orderCount" <> x .: "lowPrice" <> x .: "highPrice" <> x .: "avgPrice" <> x .: "volume" <> x .: "date" And this is the current error I get No instance for (FromJSON a) arising from a use of ‘.:’ Possible fix: ...	x) = Typed <$> x .: "id" <> x .: "name" instance FromJSON Day where parseJSON (Object x) = Day <$> x .: "orderCount" <> x .: "lowPrice" <> x .: "highPrice" <> x .: "avgPrice" <> x .: "volume" <> x .: "date" And this is the current error I get No instance for (FromJSON a) arising from a use of ‘.:’ Possible fix: ...	[ 0.00003790855407714844, -0.00653076171875, -0.004180908203125, 0.015625, 0.005828857421875, 0.0159912109375, -0.0283203125, 0.0008697509765625, -0.00244140625, -0.02783203125, -0.005401611328125, 0.0007781982421875, 0.00848388671875, -0.004547119140625, -0.0028076171875, -0.01519775390...	[ 1022, 16, 2203, 60457, 71, 4369, 532, 1639, 11627, 110527, 28090, 1375, 58627, 10013, 366, 184, 46471, 75161, 80596, 108210, 17336, 33163, 329, 84396, 3818, 177, 23232, 282, 17489, 43581, 18499, 87, 2046, 438, 100, 168407, 10, 187, 72219, ...	[ 0.1590576171875, 0.057861328125, 0.0850830078125, 0.224365234375, 0.05426025390625, 0.1279296875, 0.06646728515625, 0.113037109375, 0.080810546875, 0.306884765625, 0.2125244140625, 0.13330078125, 0.219482421875, 0.1695556640625, 0.0755615234375, 0.007659912109375, 0.0455322265625, ...	embed
16090101_c0	16090101	haskell	0	Title: How to define 'special' behavior for composite function in `.hs` file? Problem title: How to define 'special' behavior for composite function in `.hs` file? Tags: haskell Problem: How to define 'special' behavior for composite function in `.hs` file? Composition is very normal in Haskell, but...	How to define 'special' behavior for composite function in `.hs` file? How to define 'special' behavior for composite function in `.hs` file? haskell How Prelude Ambiguous Main me.hs:1:8 me.hs:1:1 GHC.Base How to define 'special' behavior for composite function in `.hs` file? Composition is very nor...	[ -0.0167236328125, -0.01336669921875, 0.00164031982421875, -0.0029449462890625, 0.017578125, 0.0096435546875, 0.00579833984375, -0.0079345703125, 0.0029449462890625, 0.00897216796875, -0.01348876953125, 0.01336669921875, -0.0068359375, -0.006195068359375, 0.0091552734375, 0.007202148437...	[ 61924, 3768, 146981, 123166, 375, 77087, 32354, 5, 127, 7, 11435, 13, 1556, 142508, 11249, 1914, 822, 112, 10250, 12282, 10821, 12321, 163, 19721, 1019, 527, 73265, 63473, 100, 23, 3288, 40322, 4552, 3638, 20625, 3714, 831, 5361, 16750, 2...	[ 0.1788330078125, 0.059356689453125, 0.2181396484375, 0.2091064453125, 0.098876953125, 0.2156982421875, 0.16259765625, 0.0140838623046875, 0.1236572265625, 0.1334228515625, 0.135009765625, 0.009857177734375, 0.0899658203125, 0.2301025390625, 0.017791748046875, 0.0626220703125, 0.14868...	embed
20470323_c0	20470323	haskell	0	Title: Dealing with Maybe Bool values Problem title: Dealing with Maybe Bool values Tags: option-type, haskell, monads Problem: Dealing with Maybe Bool values Let us say, I have two Maybe Bool value and I want to achieve the following functionality: If both are Just values, I want to perform an \|\| between them the valu...	Dealing with Maybe Bool values Dealing with Maybe Bool values option-type haskell monads Dealing Maybe Bool Just Nothing liftM2 Dealing with Maybe Bool values Let us say, I have two Maybe Bool value and I want to achieve the following functionality: If both are Just values, I want to perform an \|\| between them the valu...	[ 0.0098876953125, 0.01239013671875, 0.00775146484375, 0.0019073486328125, 0.0140380859375, 0.01904296875, 0.00970458984375, -0.0279541015625, 0.004119873046875, -0.00250244140625, 0.0033721923828125, 0.00885009765625, 0.002960205078125, 0.002227783203125, -0.0015106201171875, -0.0010528...	[ 90943, 214, 678, 83425, 2460, 929, 142424, 35829, 50986, 1556, 142508, 2667, 712, 9563, 182747, 60520, 594, 304, 6626, 34292, 3444, 69307, 123309, 15044, 51339, 17721, 2856, 4263, 3789, 237, 140992, 22225, 184, 103510, 14858, 7722, 4527, 11, ...	[ 0.1959228515625, 0.035888671875, 0.1019287109375, 0.2318115234375, 0.1287841796875, 0.210693359375, 0.214599609375, 0.15625, 0.054931640625, 0.098876953125, 0.2259521484375, 0.108154296875, 0.10888671875, 0.1480712890625, 0.1829833984375, 0.2158203125, 0.1322021484375, 0.177734375,...	embed
73896303_c0	73896303	haskell	0	Title: Parse error on input ‘->’ in 'case of' statement in Haskell Problem title: Parse error on input ‘->’ in 'case of' statement in Haskell Tags: syntax, haskell, compiler-errors Problem: Parse error on input ‘->’ in 'case of' statement in Haskell module SpaceAge (Planet(..), ageOn) where da...	Parse error on input ‘->’ in 'case of' statement in Haskell Parse error on input ‘->’ in 'case of' statement in Haskell syntax haskell compiler-errors Parse Haskell SpaceAge Planet Mercury Venus Earth Mars Jupiter Saturn Uranus Neptune Float Parse error on input ‘->’ in 'case of' statement in ...	[ 0.0036468505859375, 0.0216064453125, -0.0267333984375, -0.0054931640625, 0.00360107421875, -0.004058837890625, -0.00921630859375, 0.00408935546875, -0.000568389892578125, -0.0223388671875, -0.01214599609375, -0.0064697265625, 0.0194091796875, -0.01141357421875, -0.002166748046875, 0.00...	[ 2392, 184, 18499, 107730, 9, 1230, 5386, 3768, 58437, 111, 63805, 20625, 142508, 86531, 1556, 9969, 34759, 188800, 43045, 429, 40357, 123106, 133484, 64883, 23342, 145255, 118651, 4143, 66, 199204, 38699, 257, 103607, 23, 35378, 1340, 70, 369...	[ 0.1636962890625, 0.10107421875, 0.18115234375, 0.15673828125, 0.117431640625, 0.07476806640625, 0.18505859375, 0.14794921875, 0.228515625, 0.25634765625, 0.1947021484375, 0.15869140625, 0.260498046875, 0.0308685302734375, 0.126220703125, 0.130615234375, 0.0784912109375, 0.154418945...	embed
29729412_c1	29729412	haskell	1	"Issue with package configuration\n" ++ show e Right (pkgDesc, _) -> print (dumpPackageDescription pkgDesc cabalFile) The problem is that the fourth parameter, buildCompilerId changed type from CompilerId to CompilerInfo . What I have implemented---though I would be happy to consider a more self-contained option---is ...	"Issue with package configuration\n" ++ show e Right (pkgDesc, _) -> print (dumpPackageDescription pkgDesc cabalFile) The problem is that the fourth parameter, buildCompilerId changed type from CompilerId to CompilerInfo . What I have implemented---though I would be happy to consider a more self-contained option---is ...	[ -0.0120849609375, -0.007110595703125, -0.00225830078125, -0.001739501953125, -0.01507568359375, 0.0244140625, -0.0128173828125, -0.00168609619140625, -0.000705718994140625, 0.0240478515625, 0.00127410888671875, -0.035888671875, -0.00372314453125, -0.0166015625, -0.0019073486328125, -0....	[ 54607, 13, 678, 98169, 180346, 37223, 7639, 28, 90911, 8517, 397, 6964, 28412, 693, 2676, 205956, 4657, 59478, 109524, 174350, 2967, 22759, 927, 171859, 45367, 108161, 34759, 568, 71, 98816, 10644, 1295, 15612, 47, 93147, 29479, 15970, 98102,...	[ 0.116455078125, 0.01025390625, 0.0855712890625, 0.2117919921875, 0.235595703125, 0.04437255859375, 0.0235748291015625, 0.03997802734375, 0.0767822265625, 0.1610107421875, 0.07391357421875, 0.1309814453125, 0.1163330078125, 0.119873046875, 0.0992431640625, 0.151611328125, 0.0665283203...	embed
10253474_c0	10253474	haskell	0	Title: Inject a function into a Java .class file using Haskell Problem title: Inject a function into a Java .class file using Haskell Tags: haskell, code-injection, bytecode, java Problem: Inject a function into a Java .class file using Haskell I have written a Java bytecode parser using Haskell, and it works just fine...	Inject a function into a Java .class file using Haskell Inject a function into a Java .class file using Haskell haskell code-injection bytecode java Haskell Inject Java System.out.println Inject a function into a Java .class file using Haskell I have written a Java bytecode parser using Haskell, and it works just fine....	[ 0.000518798828125, 0.01300048828125, 0.01043701171875, 0.0322265625, 0.006988525390625, 0.0252685546875, -0.0130615234375, -0.0002498626708984375, -0.015625, -0.03173828125, -0.0042724609375, -0.033935546875, -0.0311279296875, 0.00909423828125, 0.0062255859375, 0.023193359375, 0.0122...	[ 360, 75161, 32354, 3934, 41925, 5, 67413, 11435, 17368, 20625, 142508, 1556, 18151, 73, 236, 390, 67, 40899, 79, 330, 12353, 6056, 35662, 141, 59121, 366, 2189, 43240, 5885, 33306, 11737, 29954, 163, 64557, 48708, 1528, 27117, 2811, 40383, ...	[ 0.09197998046875, 0.255126953125, 0.1923828125, 0.1441650390625, 0.2373046875, 0.08154296875, 0.2401123046875, 0.165771484375, 0.05328369140625, 0.1588134765625, 0.2471923828125, 0.1544189453125, 0.0994873046875, 0.036956787109375, 0.1446533203125, 0.0987548828125, 0.1177978515625, ...	embed
27797157_c0	27797157	haskell	0	Title: Avoiding orphan typeable instances Problem title: Avoiding orphan typeable instances Tags: haskell Problem: Avoiding orphan typeable instances It seems that data types promoted by DataKinds do not automatically get typeable instances. It is quite easy solve this by using StandaloneDeriving but this creates orpha...	Avoiding orphan typeable instances Avoiding orphan typeable instances haskell Data.Typeable Avoiding DataKinds StandaloneDeriving LANGUAGE DeriveDataTypeable PolyKinds Orphan Typeable Compiling orphan.hs orphan.hs:10:1 Warning orphan.hs:11:1 Avoiding orphan typeable instances It seems that data types promoted by DataKi...	[ 0.0057373046875, -0.01483154296875, -0.00634765625, -0.017822265625, -0.006591796875, 0.01153564453125, 0.018798828125, 0.0152587890625, 0.004730224609375, -0.056396484375, -0.028564453125, -0.00970458984375, 0.00970458984375, 0.0034942626953125, -0.0103759765625, -0.00885009765625, ...	[ 84361, 86675, 707, 68743, 10644, 2886, 110527, 1556, 142508, 11809, 196707, 605, 7250, 32487, 11, 51684, 47731, 6496, 98064, 1310, 5844, 137989, 63306, 3347, 60457, 15612, 49725, 127, 15110, 19721, 5550, 19993, 37202, 2053, 52895, 125568, 959, ...	[ 0.1976318359375, 0.026153564453125, 0.1319580078125, 0.2276611328125, 0.209716796875, 0.1898193359375, 0.205810546875, 0.09173583984375, 0.193603515625, 0.107177734375, 0.202880859375, 0.041046142578125, 0.19970703125, 0.10107421875, 0.037384033203125, 0.132568359375, 0.0848388671875...	embed
74433034_c0	74433034	haskell	0	Title: Haskell's do syntax and its pattern matching behaviour Problem title: Haskell's do syntax and its pattern matching behaviour Tags: functional-programming, do-notation, haskell, state, types Problem: Haskell's do syntax and its pattern matching behaviour I am currently trying to understand the do notati...	Haskell's do syntax and its pattern matching behaviour Haskell's do syntax and its pattern matching behaviour functional-programming do-notation haskell state types Haskell Stack a:stack x:xs turnipStack2 Haskell's do syntax and its pattern matching behaviour I am currently trying to understand the do notatio...	[ -0.0107421875, 0.0076904296875, -0.003173828125, 0.0013427734375, -0.0179443359375, 0.015625, -0.01123046875, -0.006500244140625, 0.0267333984375, -0.026123046875, 0.01153564453125, -0.00238037109375, -0.01513671875, -0.0164794921875, 0.009521484375, -0.0024566650390625, -0.008483886...	[ 20625, 142508, 3768, 54, 6002, 86531, 103510, 14858, 224833, 123309, 28966, 157, 22062, 1556, 11341, 52895, 6512, 2594, 10, 590, 1022, 425, 15504, 3442, 42378, 304, 31577, 28219, 110, 189924, 796, 7232, 7, 2242, 87039, 6468, 17678, 190659, ...	[ 0.1181640625, 0.2353515625, 0.059356689453125, 0.2037353515625, 0.1396484375, 0.200439453125, 0.1510009765625, 0.1502685546875, 0.124267578125, 0.1336669921875, 0.0936279296875, 0.1480712890625, 0.0880126953125, 0.103515625, 0.1080322265625, 0.1177978515625, 0.0628662109375, 0.0403...	embed
43302874_c0	43302874	haskell	0	Title: Natural Logarithm using series in Haskell Gives Imprecise Results Problem title: Natural Logarithm using series in Haskell Gives Imprecise Results Tags: haskell, math, libm Problem: Natural Logarithm using series in Haskell Gives Imprecise Results So I wrote two functions to calculate natural logarithm of variab...	Natural Logarithm using series in Haskell Gives Imprecise Results Natural Logarithm using series in Haskell Gives Imprecise Results haskell math libm series Natural Logarithm Haskell Gives Imprecise Results Float x-1 i-1 lnOfx2 Natural Logarithm using series in Haskell Gives Imprecise Results So I wrote two functions t...	[ 0.00994873046875, 0.0299072265625, 0.016845703125, 0.0078125, 0.00823974609375, 0.01483154296875, 0.0145263671875, -0.0029754638671875, 0.0162353515625, -0.00469970703125, 0.0159912109375, 0.0030670166015625, 0.0184326171875, -0.0194091796875, 0.0294189453125, 0.01312255859375, 0.007...	[ 24955, 13146, 87302, 18337, 17368, 36549, 20625, 142508, 77878, 3370, 51606, 184, 146104, 1556, 48909, 25474, 39, 38699, 1022, 5759, 17, 132887, 425, 304, 54397, 6626, 32354, 74481, 6083, 459, 1970, 8962, 111, 77336, 118055, 1407, 99091, 1453...	[ 0.2059326171875, 0.1405029296875, 0.167724609375, 0.0789794921875, 0.058380126953125, 0.2066650390625, 0.1312255859375, 0.248779296875, 0.050079345703125, 0.09033203125, 0.1910400390625, 0.1160888671875, 0.143310546875, 0.109130859375, 0.05816650390625, 0.0994873046875, 0.08776855468...	embed
8903342_c0	8903342	haskell	0	Title: Should Events be externally mutable? Problem title: Should Events be externally mutable? Tags: functional-programming, frp, scala, haskell, programming-languages Problem: Should Events be externally mutable? I am playing around with FRP and was wondering about how the act of an Event 'occurring' should be handle...	Should Events be externally mutable? Should Events be externally mutable? functional-programming frp scala haskell programming-languages Should Events event.occur Should Events be externally mutable? I am playing around with FRP and was wondering about how the act of an Event 'occurring' should be handled publicly. By ...	[ 0.0198974609375, 0.00150299072265625, 0.015869140625, -0.0181884765625, 0.0016937255859375, -0.0120849609375, 0.00179290771484375, 0.0135498046875, -0.00738525390625, -0.042236328125, -0.00848388671875, 0.018798828125, -0.00958251953125, 0.02197265625, 0.0146484375, -0.00830078125, -...	[ 151117, 123560, 186, 173591, 538, 842, 22819, 123309, 28966, 14119, 254, 146232, 1556, 142508, 56037, 196651, 19732, 6652, 16820, 75169, 10932, 563, 38796, 27992, 111, 36943, 64240, 214, 5608, 34831, 3835, 77848, 19048, 25632, 28032, 43701, 830...	[ 0.120361328125, 0.28125, 0.042327880859375, 0.2381591796875, 0.06744384765625, 0.20166015625, 0.211181640625, 0.1240234375, 0.122314453125, 0.056396484375, 0.0816650390625, 0.150390625, 0.10479736328125, 0.1966552734375, 0.107177734375, 0.0814208984375, 0.2318115234375, 0.143676757...	embed
54871937_c0	54871937	haskell	0	Title: Is there any way to force Haskell code ordering to work like F#? Problem title: Is there any way to force Haskell code ordering to work like F#? Tags: f%23, haskell Problem: Is there any way to force Haskell code ordering to work like F#? I am currently learning me a Haskell , so for so good. I am pretty fluent ...	Is there any way to force Haskell code ordering to work like F#? Is there any way to force Haskell code ordering to work like F#? f%23 haskell Haskell Is there any way to force Haskell code ordering to work like F#? I am currently learning me a Haskell , so for so good. I am pretty fluent when it comes to F# and I want...	[ 0.0225830078125, 0.0086669921875, 0.0037994384765625, -0.004058837890625, 0.0002460479736328125, -0.001251220703125, 0.0010833740234375, -0.018798828125, -0.0020751953125, -0.01416015625, -0.018798828125, -0.0146484375, 0.000621795654296875, -0.0126953125, -0.004638671875, 0.0013809204...	[ 2071, 2499, 3917, 37772, 20625, 142508, 18151, 12989, 214, 47, 4488, 1884, 563, 4904, 2685, 1238, 3949, 3742, 1556, 82424, 52080, 100, 4127, 28875, 155283, 3444, 9790, 3535, 34166, 123309, 56037, 66139, 11343, 111, 26866, 831, 11782, 32354, ...	[ 0.013092041015625, 0.05865478515625, 0.093505859375, 0.19921875, 0.115966796875, 0.20751953125, 0.178955078125, 0.2230224609375, 0.078857421875, 0.04888916015625, 0.1202392578125, 0.12060546875, 0.131591796875, 0.1973876953125, 0.0168304443359375, 0.0731201171875, 0.0311279296875, ...	embed
12592464_c0	12592464	haskell	0	Title: Haskell: Why does GHC not infer type in this typeclass with fundeps? Problem title: Haskell: Why does GHC not infer type in this typeclass with fundeps? Tags: typeclass, haskell, functional-dependencies Problem: Haskell: Why does GHC not infer type in this typeclass with fundeps? I'm trying to use typeclasses an...	Haskell: Why does GHC not infer type in this typeclass with fundeps? Haskell: Why does GHC not infer type in this typeclass with fundeps? typeclass haskell functional-dependencies the Haskell Why GHC Cont LANGUAGE KindSignatures FunctionalDependencies FlexibleInstances FlexibleContexts TestData TypeConv Lift Test.hs:13...	[ 0.007568359375, -0.011474609375, 0.00872802734375, 0.009765625, 0.00008440017700195312, 0.007415771484375, -0.006256103515625, -0.00933837890625, -0.005218505859375, 0.01287841796875, -0.002716064453125, -0.0255126953125, -0.00372314453125, 0.0245361328125, 0.0130615234375, -0.01501464...	[ 20625, 142508, 44084, 527, 73265, 959, 53498, 10644, 903, 67413, 678, 9458, 4517, 1556, 123309, 105254, 13, 1657, 18, 98064, 27435, 218723, 26885, 180842, 2661, 116071, 22829, 8647, 60457, 11935, 334, 166562, 28194, 191147, 9312, 22618, 758, ...	[ 0.0946044921875, 0.2088623046875, 0.10064697265625, 0.08233642578125, 0.175537109375, 0.1004638671875, 0.2152099609375, 0.21728515625, 0.051910400390625, 0.1751708984375, 0.06097412109375, 0.0810546875, 0.11962890625, 0.064697265625, 0.086181640625, 0.0672607421875, 0.00579833984375,...	embed
17494206_c0	17494206	haskell	0	Title: Binary tree monad implementation Problem title: Binary tree monad implementation Tags: monads, binary-tree, haskell Problem: Binary tree monad implementation I have difficulties to understand how to correctly implement the (>>=) for the monad of binary tree. I have the following binary tree : data BinTree a = Le...	Binary tree monad implementation Binary tree monad implementation monads binary-tree haskell Binary BinTree Leaf Node Ord Show Read __________ Couldn test.hs:153:5 Binary tree monad implementation I have difficulties to understand how to correctly implement the (>>=) for the monad of binary tree. I have the following b...	[ -0.006195068359375, -0.004486083984375, 0.01287841796875, -0.012939453125, 0.028564453125, 0.00762939453125, -0.01544189453125, -0.0186767578125, -0.00191497802734375, -0.035888671875, -0.005889892578125, -0.025634765625, 0.0017242431640625, 0.0024566650390625, 0.0166015625, -0.0087280...	[ 54092, 1294, 53201, 2667, 712, 208124, 2394, 6635, 62600, 1556, 142508, 16666, 62731, 636, 2407, 438, 112, 35379, 17367, 4764, 191147, 3034, 152830, 758, 34844, 28219, 3642, 26785, 29479, 70, 30813, 1369, 100, 765, 25632, 11853, 39933, 13695,...	[ 0.1939697265625, 0.07257080078125, 0.2091064453125, 0.1358642578125, 0.1973876953125, 0.1761474609375, 0.1690673828125, 0.1412353515625, 0.195556640625, 0.08612060546875, 0.2181396484375, 0.1005859375, 0.1815185546875, 0.0179901123046875, 0.1898193359375, 0.07061767578125, 0.06689453...	embed
52763829_c1	52763829	haskell	1	avantage.co/query?function=GLOBAL_QUOTE&symbol=MSFT&apikey=demo" getRequest_ :: HStream ty => String -> Request ty getRequest_ s = let Just u = parseURI s in defaultGETRequest_ u jsonReq = getRequest_ jsonURL data Quote = Quote {quote :: String, symbol :: String, open :: Float, high :: Float, low :: Float, price :: Flo...	avantage.co/query?function=GLOBAL_QUOTE&symbol=MSFT&apikey=demo" getRequest_ :: HStream ty => String -> Request ty getRequest_ s = let Just u = parseURI s in defaultGETRequest_ u jsonReq = getRequest_ jsonURL data Quote = Quote {quote :: String, symbol :: String, open :: Float, high :: Float, low :: Float, price :: Flo...	[ -0.01031494140625, 0.04736328125, -0.000293731689453125, -0.01275634765625, -0.004913330078125, -0.00396728515625, 0.004486083984375, -0.017822265625, -0.0042724609375, -0.0245361328125, 0.00799560546875, -0.03125, -0.0211181640625, 0.000446319580078125, -0.005157470703125, 0.013122558...	[ 137884, 587, 944, 1294, 137175, 724, 17014, 94943, 232856, 176726, 13439, 25217, 40897, 19770, 80750, 2046, 4332, 75616, 572, 115061, 2281, 23351, 853, 91, 9563, 75, 366, 184, 46492, 114977, 79794, 1647, 1681, 864, 2203, 95538, 2053, 109216, ...	[ 0.335693359375, 0.1619873046875, 0.07177734375, 0.0699462890625, 0.1495361328125, 0.03662109375, 0.1199951171875, 0.113525390625, 0.28466796875, 0.209716796875, 0.059600830078125, 0.2098388671875, 0.03485107421875, 0.124267578125, 0.1671142578125, 0.0867919921875, 0.0933837890625, ...	embed
68807042_c0	68807042	haskell	0	Title: Grading partial orders (starting from topological sort) Problem title: Grading partial orders (starting from topological sort) Tags: partial-ordering, topological-sort, haskell Problem: Grading partial orders (starting from topological sort) This blog post discusses an interesting variation on topological sort: ...	Grading partial orders (starting from topological sort) Grading partial orders (starting from topological sort) partial-ordering topological-sort haskell topological Grading Grading partial orders (starting from topological sort) This blog post discusses an interesting variation on topological sort: http://jdh.hamkins....	[ 0.005950927734375, 0.029052734375, -0.006805419921875, -0.01141357421875, -0.005584716796875, 0.0026702880859375, -0.01361083984375, -0.023193359375, 0.006988525390625, -0.021240234375, -0.014404296875, -0.01385498046875, 0.0283203125, 0.00921630859375, -0.0250244140625, 0.003692626953...	[ 22453, 214, 2878, 289, 12989, 17137, 1295, 2663, 109622, 12096, 80596, 62351, 1556, 142508, 1415, 49041, 143834, 5471, 3915, 875, 2256, 8961, 5180, 4390, 15866, 192617, 6671, 1660, 1884, 40494, 39220, 95378, 5170, 831, 12008, 67919, 140992, 1...	[ 0.2239990234375, 0.1197509765625, 0.2059326171875, 0.1114501953125, 0.212158203125, 0.058746337890625, 0.0318603515625, 0.1544189453125, 0.1409912109375, 0.228271484375, 0.20263671875, 0.18701171875, 0.0816650390625, 0.237548828125, 0.0291900634765625, 0.060882568359375, 0.1529541015...	embed
30403468_c0	30403468	haskell	0	Title: How should I turn a record of options into a list of strings? Problem title: How should I turn a record of options into a list of strings? Tags: haskell Problem: How should I turn a record of options into a list of strings? I have a record of Options that I need to turn into command line arguments. For example: ...	How should I turn a record of options into a list of strings? How should I turn a record of options into a list of strings? haskell How Options Maybe Bool Just Nothing Output How should I turn a record of options into a list of strings? I have a record of Options that I need to turn into command line arguments. For exa...	[ -0.01177978515625, -0.0194091796875, 0.0009002685546875, -0.0052490234375, -0.00347900390625, 0.0133056640625, -0.01019287109375, -0.007293701171875, -0.0157470703125, 0.0189208984375, -0.0208740234375, -0.024658203125, -0.00101470947265625, 0.005401611328125, -0.01385498046875, 0.0024...	[ 11249, 5608, 15504, 17164, 111, 50717, 3934, 10, 5303, 79315, 7, 1556, 142508, 152448, 83425, 2460, 929, 9563, 182747, 13538, 3871, 75101, 13315, 10750, 86898, 4527, 32036, 60331, 71, 1284, 831, 18, 26366, 4488, 1672, 387, 12921, 8966, 442,...	[ 0.08447265625, 0.08648681640625, 0.125732421875, 0.20849609375, 0.09283447265625, 0.274658203125, 0.0926513671875, 0.052337646484375, 0.178955078125, 0.215576171875, 0.072265625, 0.111083984375, 0.2073974609375, 0.275634765625, 0.1102294921875, 0.0518798828125, 0.1346435546875, 0.0...	embed
17009729_c0	17009729	haskell	0	Title: Haskell component-by-component addition Problem title: Haskell component-by-component addition Tags: lambda, haskell Problem: Haskell component-by-component addition I am trying do to the component-by-component addition of a list of tuples with the use of higher functions. The result should be the (sum of the fi...	Haskell component-by-component addition Haskell component-by-component addition lambda haskell Haskell Num sumPw1 sumPw2 Couldn hs:42:1 Haskell component-by-component addition I am trying do to the component-by-component addition of a list of tuples with the use of higher functions. The result should be the (sum of the...	[ -0.010009765625, 0.0030517578125, 0.007354736328125, 0.01171875, -0.01123046875, 0.0147705078125, -0.005096435546875, 0.006683349609375, 0.018798828125, -0.04638671875, -0.0125732421875, -0.017822265625, 0.001312255859375, 0.020263671875, -0.004852294921875, -0.00946044921875, -0.009...	[ 20625, 142508, 82761, 1272, 277, 54137, 66044, 21, 6492, 85, 1556, 52782, 10554, 683, 434, 418, 304, 191147, 1096, 7, 33529, 19721, 31577, 54, 5303, 370, 99726, 4527, 77546, 32354, 16750, 5608, 11832, 111, 5117, 98, 17932, 25632, 18499, 3...	[ 0.14453125, 0.2529296875, 0.2342529296875, 0.156982421875, 0.0936279296875, 0.207275390625, 0.1998291015625, 0.105712890625, 0.2159423828125, 0.1605224609375, 0.1375732421875, 0.177734375, 0.222900390625, 0.0264892578125, 0.1077880859375, 0.0780029296875, 0.1243896484375, 0.1069335...	embed
23577437_c0	23577437	haskell	0	Title: Higher order Functors in scala Problem title: Higher order Functors in scala Tags: haskell, category-theory, scala Problem: Higher order Functors in scala So I've been trying to push my intuitions of functors to their limits by defining a higher order functor i.e. a, F that takes 1st order types as type argument...	Higher order Functors in scala Higher order Functors in scala haskell category-theory scala Higher Functors Functor1 Functor Higher order Functors in scala So I've been trying to push my intuitions of functors to their limits by defining a higher order functor i.e. a, F that takes 1st order types as type argument, and ...	[ 0.02001953125, -0.0201416015625, -0.0037078857421875, -0.018798828125, 0.00335693359375, -0.0179443359375, -0.0004711151123046875, -0.0238037109375, 0.01055908203125, -0.007659912109375, -0.01336669921875, -0.0179443359375, -0.003814697265625, -0.0091552734375, 0.01129150390625, -0.025...	[ 19694, 56, 12989, 28670, 18770, 23, 146232, 1556, 142508, 95487, 2347, 418, 31577, 25944, 58868, 7477, 17475, 13204, 77546, 10, 563, 51776, 106, 271, 52895, 10644, 10750, 32354, 136, 60520, 43701, 61924, 22288, 30057, 2661, 3638, 33022, 12765...	[ 0.1474609375, 0.067138671875, 0.213623046875, 0.1622314453125, 0.1865234375, 0.050537109375, 0.25732421875, 0.1231689453125, 0.2249755859375, 0.0931396484375, 0.0128173828125, 0.061126708984375, 0.02716064453125, 0.01934814453125, 0.0772705078125, 0.16748046875, 0.05804443359375, 0...	embed
37499658_c0	37499658	haskell	0	Title: Flexibility of the hierarchy of module sources allowed in cabal project Problem title: Flexibility of the hierarchy of module sources allowed in cabal project Tags: cabal, build, haskell, module, hierarchy Problem: Flexibility of the hierarchy of module sources allowed in cabal project I have a project with sour...	Flexibility of the hierarchy of module sources allowed in cabal project Flexibility of the hierarchy of module sources allowed in cabal project cabal build haskell module hierarchy Flexibility A.hs C.hs File B.C Flexibility of the hierarchy of module sources allowed in cabal project I have a project with source tree: T...	[ 0.000152587890625, 0.010986328125, -0.00177001953125, 0.02197265625, -0.004791259765625, -0.00689697265625, 0.000560760498046875, 0.007781982421875, 0.01263427734375, -0.019775390625, 0.00579833984375, -0.0419921875, 0.0177001953125, 0.0311279296875, -0.00089263916015625, -0.0208740234...	[ 180842, 83259, 1791, 147, 7668, 88996, 97264, 107003, 109524, 13452, 45367, 1556, 142508, 62, 127, 313, 5, 42724, 335, 441, 31344, 53201, 6626, 102158, 101637, 18151, 11435, 70541, 831, 72546, 14037, 186992, 1957, 110, 168487, 187136, 15400, ...	[ 0.228759765625, 0.123779296875, 0.1380615234375, 0.09442138671875, 0.0723876953125, 0.2227783203125, 0.1956787109375, 0.15185546875, 0.241455078125, 0.136962890625, 0.09912109375, 0.134521484375, 0.2171630859375, 0.0704345703125, 0.11376953125, 0.07647705078125, 0.033111572265625, ...	embed
51782384_c0	51782384	haskell	0	Title: Instance Eq is not working in Haskell Problem title: Instance Eq is not working in Haskell Tags: instance, haskell Problem: Instance Eq is not working in Haskell So I was given the following data type and I had to write a code that checks if an element is in the list (I think I did this one right). After this I ...	Instance Eq is not working in Haskell Instance Eq is not working in Haskell instance haskell ys Instance Haskell Amount x:xs Couldn Probeklausur1.hs:43:10-22 Relevant Probeklausur1.hs:44:27 Probeklausur1.hs:44:14 Bool Probeklausur1.hs:44:17 Probeklausur1.hs:44:49 Variable Perhaps Instance Eq is not working in Haskell S...	[ -0.0054931640625, 0.0245361328125, -0.00139617919921875, 0.01287841796875, -0.020263671875, 0.00714111328125, 0.00714111328125, 0.0128173828125, 0.0019378662109375, 0.030517578125, 0.00811767578125, 0.01953125, 0.000858306884765625, -0.0093994140625, -0.006195068359375, 0.0040588378906...	[ 360, 116071, 241, 864, 959, 20697, 23, 20625, 142508, 83, 110527, 1556, 113, 121147, 1022, 12, 425, 191147, 19, 1250, 372, 32689, 474, 127, 33210, 15110, 31043, 133, 30624, 32705, 27592, 2460, 929, 22950, 35167, 84572, 2886, 181799, 34475, ...	[ 0.0841064453125, 0.238525390625, 0.095458984375, 0.256103515625, 0.11474609375, 0.16650390625, 0.054351806640625, 0.1510009765625, 0.2340087890625, 0.01336669921875, 0.2413330078125, 0.128662109375, 0.11474609375, 0.1822509765625, 0.031707763671875, 0.0657958984375, 0.07366943359375,...	embed
53049055_c0	53049055	haskell	0	Title: Searching item in a table in haskell Problem title: Searching item in a table in haskell Tags: search, haskell, functional-programming, caesar-cipher Problem: Searching item in a table in haskell I am currently working in an exercise to make a caesar cipher, but for to finish that i need to find items in a table...	Searching item in a table in haskell Searching item in a table in haskell search haskell functional-programming caesar-cipher Searching Char Searching item in a table in haskell I am currently working in an exercise to make a caesar cipher, but for to finish that i need to find items in a table. It's a table which is o...	[ -0.0084228515625, -0.0004482269287109375, 0.012451171875, 0.0181884765625, 0.0101318359375, -0.0184326171875, 0.01409912109375, -0.01312255859375, -0.025634765625, 0.0035247802734375, 0.0216064453125, 0.0002593994140625, -0.01519775390625, 0.03662109375, -0.00958251953125, 0.0233154296...	[ 33086, 214, 35735, 23, 23180, 1556, 142508, 10, 33938, 123309, 28966, 377, 90, 147, 318, 94266, 21656, 82424, 20697, 81979, 1059, 67229, 3871, 7413, 55769, 5773, 3509, 47, 7108, 390, 138, 80854, 229231, 62816, 8337, 4420, 442, 80836, 16750,...	[ 0.173583984375, 0.035888671875, 0.1732177734375, 0.07025146484375, 0.2275390625, 0.1461181640625, 0.2247314453125, 0.0135498046875, 0.153564453125, 0.1258544921875, 0.10791015625, 0.03948974609375, 0.0673828125, 0.10186767578125, 0.02734375, 0.1810302734375, 0.1602783203125, 0.0208...	embed
26621677_c0	26621677	haskell	0	Title: How to extract an element from a tuple in haskell Problem title: How to extract an element from a tuple in haskell Tags: list, tuples, haskell Problem: How to extract an element from a tuple in haskell I have the following tuples: type Id = Int type Name = String type FSK = Int type Movie = (Id, Name, FSK) now I...	How to extract an element from a tuple in haskell How to extract an element from a tuple in haskell list tuples haskell a How Name FSK Movie Maybe Main Matrix Gladiator Nothing Just How to extract an element from a tuple in haskell I have the following tuples: now I want to define a function that extracts a movie from ...	[ 0.0032958984375, -0.002838134765625, 0.0150146484375, 0.00982666015625, 0.007720947265625, 0.0115966796875, -0.00872802734375, 0.00262451171875, 0.00482177734375, 0.007415771484375, 0.00141143798828125, -0.02099609375, -0.0177001953125, 0.0079345703125, -0.0155029296875, 0.007598876953...	[ 11249, 47, 125663, 12830, 1295, 370, 8705, 23, 1556, 142508, 142, 5303, 99726, 15757, 563, 10762, 10348, 83425, 12321, 194234, 90040, 14, 4597, 182747, 61924, 32354, 14277, 34475, 1884, 8337, 3447, 136, 83896, 997, 2174, 14037, 4958, 15490, ...	[ 0.07421875, 0.0148162841796875, 0.240966796875, 0.195068359375, 0.1138916015625, 0.134765625, 0.22705078125, 0.030303955078125, 0.169677734375, 0.2244873046875, 0.0103759765625, 0.1729736328125, 0.1673583984375, 0.048919677734375, 0.10247802734375, 0.179443359375, 0.13818359375, 0....	embed
76446785_c0	76446785	haskell	0	Title: Which kinds of lawfull `Functor`s are possible in Haskell? Problem title: Which kinds of lawfull `Functor`s are possible in Haskell? Tags: typeclass, haskell, functor, fixpoint-combinators, deriving Problem: Which kinds of lawfull `Functor`s are possible in Haskell? I know following types of Functor s: Polynomia...	Which kinds of lawfull `Functor`s are possible in Haskell? Which kinds of lawfull `Functor`s are possible in Haskell? typeclass haskell functor fixpoint-combinators deriving Which Functor Haskell Fix Some Data.Functor.Compose HFunctor Which kinds of lawfull `Functor`s are possible in Haskell? I know following types of ...	[ 0.00836181640625, -0.0047607421875, -0.0036773681640625, 0.00604248046875, -0.0004138946533203125, -0.0042724609375, -0.00933837890625, -0.012451171875, 0.0111083984375, 0.005523681640625, -0.01263427734375, -0.040283203125, 0.0159912109375, 0.00003838539123535156, -0.0146484375, 0.000...	[ 130078, 8562, 27165, 25724, 97249, 18770, 7722, 23, 20625, 142508, 10644, 67413, 1556, 7477, 30022, 38496, 19155, 22230, 16406, 28670, 96746, 11809, 10770, 78381, 572, 111, 9473, 3714, 25632, 52895, 91, 63306, 1687, 15403, 69112, 8781, 959, 8...	[ 0.03472900390625, 0.179443359375, 0.1815185546875, 0.1953125, 0.218994140625, 0.2274169921875, 0.1649169921875, 0.08984375, 0.164794921875, 0.2587890625, 0.118408203125, 0.1417236328125, 0.14599609375, 0.17822265625, 0.1522216796875, 0.1151123046875, 0.1243896484375, 0.072082519531...	embed
48921393_c0	48921393	haskell	0	Title: Fuse two input-files with haskell conduit library Problem title: Fuse two input-files with haskell conduit library Tags: conduit, haskell, streaming Problem: Fuse two input-files with haskell conduit library I'm trying to fuse two input files with conduit . file1.dat: META 1 META 2 META 3 TS 1 1 2 3 TS 2 3 4 5 f...	Fuse two input-files with haskell conduit library Fuse two input-files with haskell conduit library conduit haskell streaming Fuse META FilePath ConduitM Double Fuse two input-files with haskell conduit library I'm trying to fuse two input files with conduit . file1.dat: file2.dat: what I need is a function to source a...	[ 0.00677490234375, 0.01019287109375, -0.0027008056640625, 0.01226806640625, -0.004119873046875, 0.0103759765625, -0.00139617919921875, -0.00592041015625, 0.004058837890625, -0.00921630859375, -0.003326416015625, -0.0024871826171875, 0.0140380859375, 0.0263671875, 0.009033203125, 0.00156...	[ 7680, 184, 6626, 107730, 29822, 678, 1556, 142508, 120565, 35773, 65296, 276, 30967, 42724, 683, 10519, 1657, 112061, 594, 107172, 1294, 31577, 57574, 13, 102158, 11435, 418, 5164, 5442, 3871, 32354, 31344, 136, 17116, 5861, 23550, 10135, 425...	[ 0.255615234375, 0.141845703125, 0.1522216796875, 0.212890625, 0.1763916015625, 0.119140625, 0.147216796875, 0.214599609375, 0.242431640625, 0.1558837890625, 0.1923828125, 0.054046630859375, 0.1695556640625, 0.1220703125, 0.035247802734375, 0.1270751953125, 0.09722900390625, 0.14318...	embed
8717131_c0	8717131	haskell	0	Title: Can't find what's wrong with the types here Problem title: Can't find what's wrong with the types here Tags: haskell Problem: Can't find what's wrong with the types here i am working on an encryption algorithm and i have a type problem i don't understand what's the problem with the types here...	Can't find what's wrong with the types here Can't find what's wrong with the types here haskell Can Integer enchelper2 Couldn Type y:ys Can't find what's wrong with the types here i am working on an encryption algorithm and i have a type problem i don't understand what's the problem with the types h...	[ -0.0118408203125, -0.00885009765625, 0.004180908203125, -0.00015926361083984375, -0.014892578125, -0.006500244140625, -0.013671875, -0.0162353515625, 0.0089111328125, -0.0107421875, 0.0096435546875, 0.00494384765625, 0.025146484375, -0.000286102294921875, -0.0101318359375, -0.006500244...	[ 4171, 3768, 7413, 2367, 44691, 678, 52895, 3688, 1556, 142508, 44401, 22, 47515, 1264, 304, 191147, 60457, 113, 12, 4778, 20697, 136791, 234873, 10644, 2967, 28219, 169, 13415, 1022, 53, 125195, 97, 55300, 115081, 33548, 939, 5423, 151206, ...	[ 0.07879638671875, 0.04583740234375, 0.07550048828125, 0.0382080078125, 0.1422119140625, 0.06854248046875, 0.229736328125, 0.1103515625, 0.1025390625, 0.2105712890625, 0.1605224609375, 0.0771484375, 0.1669921875, 0.18017578125, 0.1571044921875, 0.08038330078125, 0.2017822265625, 0.1...	embed
68397699_c0	68397699	haskell	0	Title: Constraints and fundep resolution Problem title: Constraints and fundep resolution Tags: typeclass, type-constraints, haskell, ghc, functional-dependencies Problem: Constraints and fundep resolution I have a pair of classes, C1 and C2, with a fundep on C1, as follows: class C1 a b \| a -> b class C2 a I declare a...	Constraints and fundep resolution Constraints and fundep resolution typeclass type-constraints haskell ghc functional-dependencies Constraints Constraints and fundep resolution I have a pair of classes, C1 and C2, with a fundep on C1, as follows: I declare an instance: When I declare another instance, I get an error: B...	[ 0.01287841796875, -0.00811767578125, 0.0048828125, -0.015869140625, -0.0028228759765625, 0.004486083984375, -0.01263427734375, -0.00860595703125, -0.00139617919921875, 0.0072021484375, -0.0159912109375, -0.010986328125, 0.00347900390625, 0.0169677734375, 0.007293701171875, -0.010498046...	[ 1657, 2816, 4288, 136, 9458, 4517, 158839, 10644, 67413, 2271, 1556, 142508, 31380, 238, 123309, 105254, 80836, 61112, 313, 418, 304, 98, 159978, 110527, 15700, 18499, 179140, 384, 29459, 100, 5584, 10, 7440, 876, 190358, 3789, 4989, 527, 7...	[ 0.077392578125, 0.1827392578125, 0.14208984375, 0.05218505859375, 0.1209716796875, 0.1680908203125, 0.21533203125, 0.1854248046875, 0.170166015625, 0.0689697265625, 0.0841064453125, 0.208740234375, 0.077880859375, 0.072265625, 0.09613037109375, 0.08392333984375, 0.1119384765625, 0....	embed
26082054_c0	26082054	haskell	0	Title: Haskell 2014.2 on Windows 7 64bit, "cabal update" fails and %APPDATA%\cabal\bin is missing Problem title: Haskell 2014.2 on Windows 7 64bit, "cabal update" fails and %APPDATA%\cabal\bin is missing Tags: cabal-install, haskell Problem: Haskell 2014.2 on Windows 7 64bit, "cabal update" fails an...	Haskell 2014.2 on Windows 7 64bit, "cabal update" fails and %APPDATA%\cabal\bin is missing Haskell 2014.2 on Windows 7 64bit, "cabal update" fails and %APPDATA%\cabal\bin is missing cabal-install haskell Haskell Windows APPDATA Haskell 2014.2 on Windows 7 64bit, "cabal update" fails and %APPDATA%\ca...	[ 0.0166015625, 0.0024261474609375, 0.0220947265625, 0.0128173828125, -0.010009765625, 0.0262451171875, -0.005828857421875, 0.007171630859375, 0.00927734375, 0.0260009765625, -0.01055908203125, -0.0281982421875, -0.011474609375, -0.01361083984375, 0.025146484375, -0.004150390625, 0.022...	[ 20625, 142508, 8432, 304, 3773, 361, 7911, 3137, 408, 3571, 28350, 35782, 1745, 40680, 397, 17758, 7568, 132283, 109524, 80383, 1556, 66440, 107419, 51347, 222495, 212059, 1049, 10756, 19138, 20600, 15644, 54825, 30438, 289, 1257, 56464, 31472,...	[ 0.1842041015625, 0.286376953125, 0.2220458984375, 0.1514892578125, 0.126953125, 0.1488037109375, 0.15771484375, 0.1083984375, 0.1317138671875, 0.2283935546875, 0.1820068359375, 0.171875, 0.008575439453125, 0.17138671875, 0.1533203125, 0.1663818359375, 0.2001953125, 0.157958984375, ...	embed
75504810_c0	75504810	haskell	0	Title: Using function arguments in Haskell for the Newton-Raphson method Problem title: Using function arguments in Haskell for the Newton-Raphson method Tags: newtons-method, haskell, function, functional-programming Problem: Using function arguments in Haskell for the Newton-Raphson method I need to write a Haskell f...	Using function arguments in Haskell for the Newton-Raphson method Using function arguments in Haskell for the Newton-Raphson method newtons-method haskell function functional-programming a Using Haskell Newton-Raphson Show Double Using function arguments in Haskell for the Newton-Raphson method I need to write a Haskel...	[ -0.00543212890625, 0.0201416015625, 0.005126953125, -0.0020599365234375, 0.0244140625, 0.0230712890625, 0.0152587890625, -0.00543212890625, -0.015625, -0.005096435546875, 0.0019378662109375, -0.0089111328125, -0.006256103515625, 0.0057373046875, 0.007293701171875, 0.00628662109375, 0...	[ 345, 6953, 32354, 10750, 7, 23, 20625, 142508, 100, 145076, 9, 12248, 11727, 1681, 55300, 3525, 67772, 1928, 7352, 1556, 123309, 28966, 17367, 107172, 87, 3871, 33022, 103608, 234873, 390, 452, 6863, 30057, 136, 61475, 6275, 425, 77495, 237...	[ 0.132080078125, 0.0250091552734375, 0.2308349609375, 0.277587890625, 0.0880126953125, 0.046417236328125, 0.1571044921875, 0.26025390625, 0.054779052734375, 0.183349609375, 0.04443359375, 0.08502197265625, 0.1424560546875, 0.1678466796875, 0.15771484375, 0.051666259765625, 0.142822265...	embed
48013693_c0	48013693	haskell	0	Title: Strange stack bash error: --: command not found Problem title: Strange stack bash error: --: command not found Tags: bash, haskell-stack, haskell Problem: Strange stack bash error: --: command not found I have very simple haskell project with only executable my-exec . All it does is printing "Hello, world!" to c...	Strange stack bash error: --: command not found Strange stack bash error: --: command not found bash haskell-stack haskell Strange setup.sh Echo Hello Strange stack bash error: --: command not found I have very simple haskell project with only executable my-exec . All it does is printing "Hello, world!" to console. I w...	[ -0.00506591796875, -0.0023345947265625, -0.0004329681396484375, 0.021240234375, 0.00064849853515625, 0.0159912109375, -0.0169677734375, -0.01220703125, -0.00185394287109375, -0.00970458984375, 0.001556396484375, 0.0162353515625, 0.0294189453125, -0.006256103515625, -0.00125885009765625, ...	[ 187791, 177261, 87109, 18499, 4210, 75101, 959, 14037, 1556, 142508, 590, 2594, 169581, 1495, 3089, 35378, 8781, 13452, 4734, 71924, 2886, 759, 46480, 238, 2448, 841, 13817, 4, 8999, 3890, 47, 130250, 3444, 28282, 26499, 11435, 2394, 3509, ...	[ 0.273193359375, 0.25830078125, 0.1751708984375, 0.1640625, 0.0203704833984375, 0.260986328125, 0.158935546875, 0.2293701171875, 0.1129150390625, 0.1837158203125, 0.115478515625, 0.1337890625, 0.2344970703125, 0.134033203125, 0.1964111328125, 0.1883544921875, 0.057861328125, 0.07708...	embed
68331980_c0	68331980	haskell	0	Title: Is there a better way to write this haskell function? Problem title: Is there a better way to write this haskell function? Tags: functor, haskell, monads Problem: Is there a better way to write this haskell function? I just started learning Haskell again (i've already tried a few times) and i wrote a little func...	Is there a better way to write this haskell function? Is there a better way to write this haskell function? functor haskell monads Some Nothing URL FilePath Maybe Just Is there a better way to write this haskell function? I just started learning Haskell again (i've already tried a few times) and i wrote a little functi...	[ -0.03125, -0.010986328125, 0.0289306640625, -0.0040283203125, 0.01080322265625, 0.00469970703125, 0.0021514892578125, -0.02001953125, -0.001129150390625, 0.00836181640625, -0.0098876953125, -0.03173828125, -0.01043701171875, 0.00347900390625, 0.00091552734375, 0.00147247314453125, -0...	[ 2071, 2685, 11522, 3917, 47, 33022, 903, 1556, 142508, 32354, 7477, 18770, 2667, 712, 7, 31384, 182747, 31862, 42724, 683, 10519, 83425, 9563, 52080, 20625, 13438, 37842, 54397, 10176, 134598, 7026, 11435, 34475, 128405, 4263, 83, 5608, 2174,...	[ 0.001495361328125, 0.0212554931640625, 0.142822265625, 0.10546875, 0.0170745849609375, 0.1865234375, 0.110595703125, 0.1708984375, 0.259521484375, 0.2066650390625, 0.1424560546875, 0.19287109375, 0.1185302734375, 0.1484375, 0.075439453125, 0.1903076171875, 0.1939697265625, 0.219238...	embed
51863338_c0	51863338	haskell	0	Title: Evaluation of a function in other functions with same parameters in Haskell Problem title: Evaluation of a function in other functions with same parameters in Haskell Tags: haskell Problem: Evaluation of a function in other functions with same parameters in Haskell Consider the toy example below: someNum :: Int ...	Evaluation of a function in other functions with same parameters in Haskell Evaluation of a function in other functions with same parameters in Haskell haskell Evaluation Haskell func1 func2 Evaluation of a function in other functions with same parameters in Haskell Consider the toy example below: The same arguments fu...	[ 0.000492095947265625, 0.0002803802490234375, 0.01123046875, 0.013916015625, 0.01409912109375, 0.0011444091796875, -0.004241943359375, -0.00787353515625, 0.0087890625, -0.0091552734375, -0.0238037109375, -0.00225830078125, 0.0198974609375, 0.013916015625, 0.002227783203125, -0.011901855...	[ 151228, 1363, 32354, 23, 3789, 678, 5701, 171859, 20625, 142508, 1556, 7477, 418, 238, 304, 72713, 27781, 10750, 10770, 3796, 3060, 839, 316, 190659, 16648, 159978, 84797, 12921, 159029, 5941, 20028, 20653, 151575, 297, 16750, 456, 33740, 473...	[ 0.20849609375, 0.03424072265625, 0.158203125, 0.06317138671875, 0.0936279296875, 0.02764892578125, 0.12353515625, 0.149169921875, 0.12060546875, 0.2342529296875, 0.10302734375, 0.096923828125, 0.052703857421875, 0.0350341796875, 0.14453125, 0.1475830078125, 0.07366943359375, 0.1574...	embed
7086668_c1	7086668	haskell	1	to find the supporting framework for this collection of functions? This leads to an even more general question: How much of Haskell is supported by Haskell itself, through type and function definitions, declarations etc; and how much is supported by the compiler/implementation? (I am aware that GHC was written in Hask...	to find the supporting framework for this collection of functions? This leads to an even more general question: How much of Haskell is supported by Haskell itself, through type and function definitions, declarations etc; and how much is supported by the compiler/implementation? (I am aware that GHC was written in Hask...	[ 0.0113525390625, 0.006805419921875, 0.00787353515625, 0.022705078125, -0.01953125, 0.0113525390625, -0.0128173828125, -0.020751953125, -0.000827789306640625, -0.0040283203125, -0.001190185546875, -0.032958984375, -0.002838134765625, -0.01324462890625, 0.00994873046875, 0.0074462890625,...	[ 7413, 8060, 214, 170846, 903, 42486, 32354, 4537, 11249, 5045, 111, 20625, 142508, 297, 68034, 10644, 80934, 21635, 3642, 9969, 34759, 197648, 527, 73265, 59121, 23, 32997, 5570, 35773, 10484, 479, 822, 112, 54, 26818, 61585, 49649, 7722, 4...	[ 0.08197021484375, 0.19580078125, 0.046234130859375, 0.1551513671875, 0.04541015625, 0.11767578125, 0.174560546875, 0.005126953125, 0.0190277099609375, 0.0936279296875, 0.012115478515625, 0.1778564453125, 0.26611328125, 0.0750732421875, 0.06927490234375, 0.116455078125, 0.069396972656...	embed
7574354_c1	7574354	haskell	1	constructor in Term with basically the same semantics as Predicate . It's just like solution 1 with two predicate constructors for terms. One is recursion-enabled, Struct , and the other one, Predicate is to be able to distinguish between predicates and regular terms. The problem with this try is that Struct and Predi...	constructor in Term with basically the same semantics as Predicate . It's just like solution 1 with two predicate constructors for terms. One is recursion-enabled, Struct , and the other one, Predicate is to be able to distinguish between predicates and regular terms. The problem with this try is that Struct and Predi...	[ -0.004302978515625, 0.0264892578125, -0.0130615234375, 0.0120849609375, 0.000545501708984375, 0.015869140625, 0.0033111572265625, -0.00045013427734375, 0.003265380859375, -0.031494140625, 0.00775146484375, -0.0103759765625, -0.002777099609375, -0.0147705078125, -0.007080078125, 0.02465...	[ 64549, 748, 23, 2994, 39, 198343, 5701, 484, 109109, 7145, 2063, 67, 29806, 6626, 1653, 25251, 69407, 195625, 1830, 33, 2886, 63667, 15390, 136, 19048, 157167, 1495, 17721, 1636, 20324, 2967, 9790, 118990, 183234, 39555, 91084, 33022, 32354, ...	[ 0.208251953125, 0.151123046875, 0.035369873046875, 0.178466796875, 0.10400390625, 0.0308990478515625, 0.08349609375, 0.0633544921875, 0.10040283203125, 0.1951904296875, 0.2236328125, 0.1380615234375, 0.1187744140625, 0.060577392578125, 0.1973876953125, 0.14404296875, 0.2314453125, ...	embed

35023606_c0

35023606

haskell

0

Title: How to implement a simple Subtractable type class Problem title: How to implement a simple Subtractable type class Tags: typeclass, haskell Problem: How to implement a simple Subtractable type class I want to make a type class for subtractable types such that The value type implements Ord . There is a subtract f...

How to implement a simple Subtractable type class How to implement a simple Subtractable type class typeclass haskell How Subtractable Ord UTCTime Double Num Delta NominalDiffTime How to implement a simple Subtractable type class I want to make a type class for subtractable types such that The value type implements Ord...

[ -0.0069580078125, -0.020751953125, 0.015869140625, 0.00946044921875, -0.019775390625, 0.00933837890625, -0.0380859375, 0.002227783203125, 0.004364013671875, 0.0067138671875, -0.0181884765625, -0.043701171875, 0.0013580322265625, 0.0228271484375, -0.0191650390625, -0.00335693359375, -...

[ 11249, 29479, 8781, 8273, 39989, 22819, 10644, 18507, 47, 67413, 1556, 142508, 35379, 99577, 70059, 107172, 52782, 56588, 1249, 32920, 3444, 3249, 1614, 52895, 34292, 18, 32354, 8060, 136, 360, 1543, 129927, 31344, 40703, 438, 289, 5701, 7133...

[ 0.062255859375, 0.2191162109375, 0.1966552734375, 0.123046875, 0.1904296875, 0.1619873046875, 0.2115478515625, 0.2274169921875, 0.017059326171875, 0.2061767578125, 0.1044921875, 0.209716796875, 0.174072265625, 0.1220703125, 0.1844482421875, 0.1119384765625, 0.1890869140625, 0.18884...

embed

36241024_c0

36241024

haskell

0

Title: Where is (or why not exist) one `Indexed` type class more generic than `Data.Array`? Problem title: Where is (or why not exist) one `Indexed` type class more generic than `Data.Array`? Tags: haskell, typeclass, indexing Problem: Where is (or why not exist) one `Indexed` type class more generic than `Data.Array`?...

Where is (or why not exist) one `Indexed` type class more generic than `Data.Array`? Where is (or why not exist) one `Indexed` type class more generic than `Data.Array`? haskell typeclass indexing Where Indexed Data.Array T.Text Char T.length T.index Data.Text Data.ByteString Where is (or why not exist) one `Indexed` t...

[ -0.00872802734375, 0.006866455078125, 0.01507568359375, 0, 0.000946044921875, -0.013671875, -0.002960205078125, -0.0024871826171875, 0.029541015625, -0.01116943359375, -0.0020751953125, -0.0185546875, -0.0016326904296875, -0.009033203125, -0.006439208984375, -0.018310546875, 0.007476...

[ 78662, 15400, 32316, 1632, 4153, 39659, 297, 10644, 18507, 1286, 189534, 3501, 137989, 7614, 7092, 1556, 142508, 67413, 63262, 214, 31471, 11809, 384, 174379, 21656, 23986, 4711, 75358, 67, 71713, 959, 16487, 17368, 87, 425, 2499, 2886, 36716...

[ 0.0670166015625, 0.038360595703125, 0.1123046875, 0.0538330078125, 0.059173583984375, 0.213134765625, 0.124267578125, 0.163818359375, 0.21875, 0.1121826171875, 0.22607421875, 0.044830322265625, 0.0999755859375, 0.0560302734375, 0.15185546875, 0.0870361328125, 0.1973876953125, 0.138...

embed

16201041_c0

16201041

haskell

0

Title: Haskell Return Doesn't Match Expected Problem title: Haskell Return Doesn't Match Expected Tags: return-type, return, haskell Problem: Haskell Return Doesn't Match Expected Could someone tell me why the following code doesn't work? test :: String test = do return ("Hi") I've been struggling to make the...

Haskell Return Doesn't Match Expected Haskell Return Doesn't Match Expected return-type return haskell Haskell Doesn Match Expected Test.hs:5:21 Couldn Char Haskell Return Doesn't Match Expected Could someone tell me why the following code doesn't work? I've been struggling to make the do statement work for a...

[ -0.0091552734375, 0.00408935546875, 0.00933837890625, 0.01904296875, 0.006011962890625, 0.0125732421875, 0.003509521484375, -0.005279541015625, 0.00445556640625, 0.0302734375, 0.00787353515625, -0.038330078125, 0.00323486328125, -0.0002956390380859375, -0.0140380859375, 0.0068054199218...

[ 20625, 142508, 173340, 101790, 19, 3768, 18, 67407, 60075, 13, 89829, 30646, 50986, 1556, 8647, 25619, 191147, 21656, 15400, 25632, 18151, 22027, 4488, 237875, 54, 63805, 12960, 1608, 2967, 46526, 53697, 22021, 10554, 18499, 28641, 1957, 164789...

[ 0.1270751953125, 0.219970703125, 0.226806640625, 0.049530029296875, 0.000213623046875, 0.0577392578125, 0.09765625, 0.1915283203125, 0.1014404296875, 0.108642578125, 0.0255584716796875, 0.204833984375, 0.1619873046875, 0.10107421875, 0.11083984375, 0.0229949951171875, 0.0629272460937...

embed

23851543_c0

23851543

haskell

0

Title: convert double to GLfloat in Haskell Problem title: convert double to GLfloat in Haskell Tags: double, haskell, opengl, floating-point-conversion Problem: convert double to GLfloat in Haskell I want to convert a Double to a GLfloat. I want to use it for comparations. xM <- newIORef 0.0 zM <- newIORef 0.0 mobs <-...

convert double to GLfloat in Haskell convert double to GLfloat in Haskell double haskell opengl floating-point-conversion GHC.Float GLfloat Haskell mapM_ Dead Warning d2f GLdouble convert double to GLfloat in Haskell I want to convert a Double to a GLfloat. I want to use it for comparations. mobs is fulled with a metho...

[ 0.00225830078125, -0.00433349609375, -0.0024871826171875, -0.01153564453125, 0.033447265625, 0.0142822265625, -0.0234375, -0.0189208984375, 0.00131988525390625, -0.0035247802734375, 0.003448486328125, -0.0164794921875, 0.005828857421875, -0.0260009765625, -0.0022735595703125, 0.0103149...

[ 96760, 41929, 47, 90799, 52347, 257, 23, 20625, 142508, 1556, 9803, 11016, 21917, 26518, 38496, 2271, 46354, 527, 73265, 919, 365, 22288, 594, 51952, 5550, 592, 104, 304, 420, 21555, 2661, 3444, 107172, 10, 4527, 31898, 81158, 7, 4393, 67...

[ 0.181396484375, 0.239501953125, 0.1309814453125, 0.185791015625, 0.260986328125, 0.175048828125, 0.07366943359375, 0.15087890625, 0.253173828125, 0.1197509765625, 0.1192626953125, 0.216796875, 0.1927490234375, 0.0977783203125, 0.16259765625, 0.076171875, 0.14453125, 0.0892333984375...

embed

47251628_c0

47251628

haskell

0

Title: How to write this as a recursive Haskell function? Problem title: How to write this as a recursive Haskell function? Tags: haskell, recursion, syntax, sum Problem: How to write this as a recursive Haskell function? I'll illustrate what I want to do using Python (I want to write this in Haskell). I have this func...

How to write this as a recursive Haskell function? How to write this as a recursive Haskell function? haskell recursion syntax sum How Haskell d-1 input_line How to write this as a recursive Haskell function? I'll illustrate what I want to do using Python (I want to write this in Haskell). I have this function: Which i...

[ -0.0322265625, 0.000530242919921875, -0.0029296875, 0.00084686279296875, -0.01202392578125, -0.00008630752563476562, 0.0059814453125, -0.00830078125, -0.0047607421875, -0.01904296875, 0.01287841796875, -0.0302734375, -0.0157470703125, 0.01422119140625, 0.004302978515625, -0.00083160400...

[ 11249, 47, 33022, 903, 237, 195625, 5844, 20625, 142508, 32354, 1556, 1830, 6002, 86531, 10554, 104, 5759, 107730, 2256, 58755, 17368, 145581, 198343, 40956, 214, 1295, 33000, 653, 55128, 166, 58838, 142424, 20028, 74912, 64, 71, 3444, 54, ...

[ 0.09906005859375, 0.136962890625, 0.18408203125, 0.09075927734375, 0.1087646484375, 0.2308349609375, 0.156982421875, 0.145263671875, 0.2381591796875, 0.20263671875, 0.133056640625, 0.09661865234375, 0.029754638671875, 0.059326171875, 0.201416015625, 0.1776123046875, 0.2008056640625, ...

embed

65460456_c0

65460456

haskell

0

Title: Are Haskell guards evaluated sequentially? Problem title: Are Haskell guards evaluated sequentially? Tags: haskell Problem: Are Haskell guards evaluated sequentially? What is the order in which Haskell guards are evaluated? Say that I have a function which returns a Bool: someFunc :: Bool -> Bool -> Bool someFun...

Are Haskell guards evaluated sequentially? Are Haskell guards evaluated sequentially? haskell Haskell Bool val1 action1 val2 action2 action3 Are Haskell guards evaluated sequentially? What is the order in which Haskell guards are evaluated? Say that I have a function which returns a Bool: I think it was with Monads and...

[ -0.00016021728515625, 0.0018310546875, 0.0218505859375, -0.00144195556640625, 0.0130615234375, -0.000858306884765625, -0.01141357421875, -0.0157470703125, -0.0076904296875, 0.028076171875, 0.006744384765625, -0.00537109375, -0.0054931640625, 0.00020313262939453125, -0.004669189453125, ...

[ 20625, 142508, 56050, 7, 151575, 297, 243228, 25958, 1556, 2460, 929, 3502, 22631, 304, 363, 12989, 32354, 30646, 60331, 6468, 984, 157, 61972, 68018, 959, 74481, 8108, 5117, 63805, 22225, 17932, 87599, 103876, 876, 184, 62775, 11343, 16401, ...

[ 0.1278076171875, 0.2342529296875, 0.2493896484375, 0.0841064453125, 0.1734619140625, 0.057373046875, 0.1689453125, 0.06036376953125, 0.101318359375, 0.07135009765625, 0.1719970703125, 0.1141357421875, 0.09326171875, 0.07159423828125, 0.045867919921875, 0.1351318359375, 0.116455078125...

embed

56218986_c1

56218986

haskell

1

10 | main = display window backgroundColor (grid++units) | ^^^^ /home/georg/Desktop/THM/6_semester/funktionale_programmierung/my/app/Main.hs:10:40: error: • Couldn't match expected type ‘Picture’ with actual type ‘[a0]’ • In the third argument of ‘display’, namely ‘(grid ++ units)’ In the expression: display window ba...

[ -0.00628662109375, 0.016845703125, 0.00115203857421875, 0.018310546875, -0.0142822265625, -0.002838134765625, -0.002105712890625, -0.01385498046875, -0.0038299560546875, -0.00286865234375, 0.006072998046875, -0.01123046875, 0.0177001953125, 0.0076904296875, -0.0111083984375, 0.00150299...

[ 209, 58745, 5201, 2203, 44116, 76896, 76615, 10625, 1484, 120067, 37223, 309, 14481, 16377, 15729, 29552, 1478, 4657, 1042, 13784, 23415, 594, 20155, 184, 33787, 64558, 1935, 28966, 13976, 1176, 9007, 168793, 127, 15110, 22932, 18499, 768, 19...

[ 0.1915283203125, 0.014312744140625, 0.23486328125, 0.078125, 0.1849365234375, 0.1788330078125, 0.25, 0.103515625, 0.185546875, 0.2127685546875, 0.2259521484375, 0.1123046875, 0.0738525390625, 0.049591064453125, 0.0367431640625, 0.0926513671875, 0.1512451171875, 0.10302734375, 0.0...

embed

64140299_c1

64140299

haskell

1

it had an Either type), I could simply do something like this: List<Either<String, ?>> list = asList(foo, bar); And it would have worked just fine, type safe and whatnot. Is there a type variable wildcard in Haskell corresponding to ? in Java? If not, how do you deal with such cases where you don't care about a certai...

[ -0.00046539306640625, -0.0062255859375, -0.003387451171875, -0.01904296875, -0.01263427734375, 0.011474609375, -0.0091552734375, -0.018798828125, 0.0169677734375, 0.015869140625, 0.012451171875, -0.03857421875, 0.0157470703125, -0.022216796875, -0.032958984375, -0.01171875, -0.006317...

[ 442, 1902, 4565, 9319, 10644, 5809, 42856, 54, 1884, 903, 32036, 647, 14, 71713, 214, 705, 5303, 237, 154663, 132, 3584, 31, 1909, 765, 79786, 1660, 5885, 46002, 2071, 2685, 77336, 56409, 38931, 20625, 142508, 42518, 23, 41925, 35142, 604...

[ 0.006988525390625, 0.0621337890625, 0.08740234375, 0.2166748046875, 0.2198486328125, 0.033203125, 0.06597900390625, 0.018035888671875, 0.02716064453125, 0.0213623046875, 0.1483154296875, 0.03265380859375, 0.07080078125, 0.1187744140625, 0.0274658203125, 0.14697265625, 0.1829833984375...

embed

1292212_c0

1292212

haskell

0

Title: how to solve "stack space overflow" in haskell Problem title: how to solve "stack space overflow" in haskell Tags: haskell, lazy-evaluation, recursion Problem: how to solve "stack space overflow" in haskell Running the following program will print "space overflow: current size 8388608 bytes."...

how to solve "stack space overflow" in haskell how to solve "stack space overflow" in haskell haskell lazy-evaluation recursion Data.List Main euler27 tuple_list how to solve "stack space overflow" in haskell Running the following program will print "space overflow: current size 8388608 bytes." I ha...

[ -0.01806640625, 0.019775390625, -0.0021514892578125, 0.005706787109375, 0.00160980224609375, 0.0107421875, -0.019775390625, -0.01318359375, 0.0238037109375, -0.039306640625, 0.0186767578125, -0.0006866455078125, -0.002349853515625, -0.00457763671875, 0.0146484375, -0.0198974609375, 0...

[ 3642, 47, 86869, 590, 2594, 32628, 645, 118664, 23, 1556, 142508, 21, 3285, 159258, 195625, 1830, 11809, 154663, 12321, 1175, 603, 3768, 370, 8705, 6562, 44, 28398, 25632, 1528, 1221, 28412, 65421, 43581, 13267, 382, 122545, 170285, 390, 16...

[ 0.076416015625, 0.07421875, 0.2181396484375, 0.16162109375, 0.1588134765625, 0.2283935546875, 0.149169921875, 0.265869140625, 0.0621337890625, 0.1488037109375, 0.2333984375, 0.094970703125, 0.179931640625, 0.1500244140625, 0.1400146484375, 0.0157470703125, 0.083984375, 0.1169433593...

embed

8593710_c0

8593710

haskell

0

Title: Cubesumming in haskell Problem title: Cubesumming in haskell Tags: haskell Problem: Cubesumming in haskell Haskell has the sum function sum :: Num a => [a] -> a Which can be nicely composed to sum a matrix by sum . map sum :: Num a => [[a]] -> a Going deeper, however, such as summing a cube, creates the restrict...

Cubesumming in haskell Cubesumming in haskell haskell Cubesumming Num Cubesumming in haskell Haskell has the sum function Which can be nicely composed to sum a matrix by Going deeper, however, such as summing a cube, creates the restriction Num [a] Which, if you think about it, is natural. So with the former attempt to...

[ 0.01165771484375, -0.00159454345703125, 0.0208740234375, 0.01611328125, 0.01361083984375, 0.000888824462890625, 0.004913330078125, -0.00128173828125, 0.01190185546875, -0.0162353515625, -0.009765625, -0.02880859375, 0.00238037109375, -0.00982666015625, -0.0194091796875, 0.0087890625, ...

[ 3003, 7438, 34, 58838, 1556, 142508, 23, 52782, 20625, 10554, 32354, 831, 26267, 150350, 47, 50944, 425, 390, 53894, 56, 49903, 166, 314, 372, 28282, 185190, 11, 6083, 81887, 61924, 1010, 102310, 2577, 12921, 60875, 29334, 87427, 13893, 729...

[ 0.15966796875, 0.110595703125, 0.164794921875, 0.1519775390625, 0.123046875, 0.2425537109375, 0.036865234375, 0.1722412109375, 0.12158203125, 0.2152099609375, 0.1505126953125, 0.0252227783203125, 0.04425048828125, 0.1005859375, 0.00946044921875, 0.1383056640625, 0.00592041015625, 0...

embed

58074459_c0

58074459

haskell

0

Title: Why does shrinking stop once one of the terms is fully shrunk Problem title: Why does shrinking stop once one of the terms is fully shrunk Tags: haskell, quickcheck Problem: Why does shrinking stop once one of the terms is fully shrunk I'm looking at the comments in shrink : It is tempting to write the last line...

Why does shrinking stop once one of the terms is fully shrunk Why does shrinking stop once one of the terms is fully shrunk haskell quickcheck Why Branch Why does shrinking stop once one of the terms is fully shrunk I'm looking at the comments in shrink : I'm a bit puzzled about this, I thought that the problem with th...

[ -0.006103515625, 0.01397705078125, 0.0081787109375, 0.0103759765625, -0.0038909912109375, 0.0137939453125, -0.0106201171875, -0.0250244140625, 0.018798828125, 0.01495361328125, 0.0126953125, 0.02099609375, 0.0031890869140625, 0.01141357421875, -0.00147247314453125, 0.014404296875, 0....

[ 44084, 90978, 73, 6048, 7279, 24145, 1632, 69407, 89554, 3678, 1556, 142508, 63773, 78292, 21110, 14602, 24626, 7547, 35838, 2967, 35971, 129912, 3378, 12996, 153224, 4432, 13648, 15400, 17262, 80934, 9969, 6743, 162515, 96, 1690, 41206 ]

[ 0.1279296875, 0.1605224609375, 0.1500244140625, 0.1317138671875, 0.1905517578125, 0.072265625, 0.0875244140625, 0.1968994140625, 0.1173095703125, 0.170654296875, 0.10302734375, 0.1845703125, 0.069091796875, 0.1766357421875, 0.0728759765625, 0.003631591796875, 0.00250244140625, 0.09...

embed

61377224_c1

61377224

haskell

1

trying to figure the basics out.) BIPs.hs:161:31: error: * Couldn't match type `Stm' with `(Stm, Env)' Expected type: Map String (Stm, Env) Actual type: Map String Stm * In the `proc' field of a record In the expression: env {proc = (insert p s) (proc env)} In an equation for env'': env'' = env {proc = (insert p s) (p...

[ -0.0296630859375, -0.00003933906555175781, -0.01806640625, 0.00677490234375, -0.004669189453125, 0.0135498046875, -0.034912109375, -0.0220947265625, 0.0032806396484375, -0.0191650390625, -0.00750732421875, 0.0185546875, -0.004180908203125, -0.015869140625, 0.016357421875, 0.02038574218...

[ 31577, 26366, 62822, 1810, 335, 10931, 7, 127, 151525, 27321, 18499, 191147, 18, 14858, 10644, 37455, 39, 678, 357, 334, 60075, 13, 42719, 23351, 214, 100582, 2907, 360, 3454, 238, 44457, 111, 17164, 125195, 22, 33657, 915, 91, 5490, 9076...

[ 0.1246337890625, 0.1123046875, 0.1590576171875, 0.06048583984375, 0.1025390625, 0.190673828125, 0.0860595703125, 0.0867919921875, 0.151123046875, 0.1451416015625, 0.1695556640625, 0.1162109375, 0.088623046875, 0.2147216796875, 0.2265625, 0.1649169921875, 0.180908203125, 0.071777343...

embed

36445088_c1

36445088

haskell

1

mat -> Intersection -> l -> Color And so I define my Objects in the following way. I looked up and I tend to use RankNTypes (I think I made a mistake here) data Object = forall . geo mat (Geometry geo, Material mat) => Object geo mat Then I found I could not go on if I plan to implement the following function. raytrac...

[ -0.00811767578125, -0.01043701171875, -0.007598876953125, 0.0029144287109375, -0.007415771484375, 0.00262451171875, -0.018310546875, 0.00103759765625, 0.003173828125, -0.0263671875, 0.01080322265625, 0.0086669921875, 0.00653076171875, -0.031982421875, 0.00125885009765625, -0.0128784179...

[ 2589, 5337, 7, 58994, 96, 51193, 61924, 759, 134549, 25632, 3917, 17660, 4527, 134405, 839, 196707, 121742, 2053, 100, 5584, 20787, 10429, 87739, 23994, 959, 1774, 29479, 32354, 62656, 39989, 13, 187694, 118244, 51626, 31681, 75161, 44851, 36...

[ 0.254638671875, 0.121337890625, 0.143310546875, 0.1318359375, 0.0816650390625, 0.169677734375, 0.2066650390625, 0.031982421875, 0.241943359375, 0.01727294921875, 0.0194854736328125, 0.038299560546875, 0.010101318359375, 0.208251953125, 0.051483154296875, 0.2239990234375, 0.0546264648...

embed

16111855_c0

16111855

haskell

0

Title: Scanl in Haskell Problem title: Scanl in Haskell Tags: haskell, list Problem: Scanl in Haskell scanl (\exp y -> scanl (\x -> if (isLetter x) then update exp (Literal x) "" else if x=='+' then update exp Epsilon "+" else if x=='*' then update exp Epsilon "*" else update exp Epsilon "|") y) Epsilon q I have a list...

Scanl in Haskell Scanl in Haskell haskell list Scanl Haskell Literal Epsilon Reg Char Then Star Scanl in Haskell I have a list of [Char] and I want to transform them into my data type but I am having some problems with it. I have somenthing like this ["a+b","c*d"] and I want the result of when I apply scanl on "a+b" to...

[ -0.01519775390625, -0.00634765625, 0.0026092529296875, 0.041748046875, -0.0045166015625, 0.02001953125, -0.022705078125, 0.0059814453125, 0.010986328125, -0.01318359375, 0.0174560546875, 0.0035400390625, -0.005157470703125, -0.006805419921875, -0.0115966796875, -0.0024871826171875, 0...

[ 65533, 141, 23, 20625, 142508, 1556, 5303, 135940, 15759, 4759, 11678, 21656, 4612, 84068, 3444, 27198, 3934, 2053, 10644, 19441, 44402, 1884, 903, 11, 1328, 275, 1639, 71, 16750, 59911, 44954, 98, 47, 47143, 4527, 17932, 4358, 31577, 58745...

[ 0.2186279296875, 0.218017578125, 0.076416015625, 0.148193359375, 0.25048828125, 0.13671875, 0.16748046875, 0.08319091796875, 0.10986328125, 0.13037109375, 0.1383056640625, 0.1578369140625, 0.1650390625, 0.16455078125, 0.0670166015625, 0.1717529296875, 0.06488037109375, 0.0994262695...

embed

51944931_c0

51944931

haskell

0

Title: Simulate a path-dependent type in Haskell Problem title: Simulate a path-dependent type in Haskell Tags: haskell, path-dependent-type, type-level-computation, types Problem: Simulate a path-dependent type in Haskell Here is a simplified example of what I want to do. Let's say you have a HList of pairs: let hlist...

Simulate a path-dependent type in Haskell Simulate a path-dependent type in Haskell haskell path-dependent-type type-level-computation types Simulate Haskell HList HCons HNil Simulate a path-dependent type in Haskell Here is a simplified example of what I want to do. Let's say you have a HList of pairs: Now I want to w...

[ -0.0062255859375, 0.000331878662109375, -0.0076904296875, 0.00640869140625, 0.0027008056640625, -0.00927734375, -0.0128173828125, 0.00714111328125, 0.011474609375, -0.0252685546875, -0.00299072265625, -0.00125885009765625, -0.007476806640625, 0.00421142578125, 0.006103515625, -0.005554...

[ 144814, 60875, 181063, 10644, 20625, 142508, 1556, 50986, 67919, 7077, 52895, 572, 154663, 81118, 5245, 79059, 379, 112892, 27781, 80836, 3444, 33022, 32354, 91995, 43512, 756, 19770, 678, 5117, 27494, 5701, 1884, 23351, 214, 22799, 418, 34292,...

[ 0.2237548828125, 0.189453125, 0.20263671875, 0.19775390625, 0.130859375, 0.2218017578125, 0.119384765625, 0.154541015625, 0.07000732421875, 0.019989013671875, 0.21337890625, 0.1143798828125, 0.2047119140625, 0.023162841796875, 0.06390380859375, 0.00115966796875, 0.0548095703125, 0....

embed

53734686_c0

53734686

haskell

0

Title: Getting the first duplicate element of a circular list Problem title: Getting the first duplicate element of a circular list Tags: haskell, lazy-evaluation Problem: Getting the first duplicate element of a circular list I am trying to get the first duplicate element from a circular list. e.g. [1,-2, 3, 2, 3, 4, ...

Getting the first duplicate element of a circular list Getting the first duplicate element of a circular list haskell lazy-evaluation Getting Just Ord Maybe Nothing x:xs Set.empty Set.member Set.insert Getting the first duplicate element of a circular list I am trying to get the first duplicate element from a circular ...

[ -0.0113525390625, -0.00616455078125, -0.0001888275146484375, -0.00421142578125, -0.005462646484375, -0.000606536865234375, 0.0135498046875, 0.0042724609375, 0.00628662109375, -0.0283203125, -0.013916015625, 0.05029296875, 0.0166015625, 0.00445556640625, -0.00128936767578125, 0.01855468...

[ 210732, 5117, 171763, 67, 12830, 115339, 5303, 1556, 142508, 21, 3285, 159258, 9563, 35379, 83425, 182747, 19943, 33548, 27417, 33657, 31577, 2046, 1295, 81, 82825, 304, 41206, 418, 136, 27489, 5701, 16750, 1284, 2301, 18, 1884, 3714, 15400, ...

[ 0.1141357421875, 0.1583251953125, 0.2227783203125, 0.1427001953125, 0.1649169921875, 0.20263671875, 0.1865234375, 0.07659912109375, 0.175537109375, 0.0164031982421875, 0.1279296875, 0.1190185546875, 0.04010009765625, 0.153076171875, 0.104736328125, 0.0904541015625, 0.0833740234375, ...

embed

20222744_c1

20222744

haskell

1

00000 00000000 0000635c 2**2 CONTENTS, ALLOC, LOAD, DATA 3 .rdata 00000080 00000000 00000000 00006380 2**2 CONTENTS, ALLOC, LOAD, READONLY, DATA 4 .rdata$zzz 00000020 00000000 00000000 00006400 2**2 CONTENTS, ALLOC, LOAD, READONLY, DATA 5 .bss 00000000 00000000 00000000 00000000 2**2 ALLOC But of course the compiled ve...

[ 0.01141357421875, 0.0172119140625, -0.0240478515625, 0.01507568359375, -0.017333984375, 0.024169921875, -0.01409912109375, 0.03369140625, 0.0023040771484375, 0.0103759765625, -0.0003566741943359375, -0.0361328125, 0.02294921875, -0.0118408203125, 0.0062255859375, 0.0037384033203125, ...

[ 181155, 2445, 28568, 166000, 238, 116, 25442, 304, 14452, 21170, 12763, 9804, 124448, 22215, 12351, 391, 17758, 138, 42, 10135, 197094, 4836, 9016, 84701, 188300, 15513, 19917, 201, 6, 5, 177033, 1549, 4, 190, 16145, 7, 111, 70, 375, 5974...

[ 0.1802978515625, 0.0771484375, 0.12451171875, 0.1917724609375, 0.09063720703125, 0.00994873046875, 0.0256500244140625, 0.0611572265625, 0.0767822265625, 0.1396484375, 0.0517578125, 0.1107177734375, 0.2125244140625, 0.078857421875, 0.0213623046875, 0.010345458984375, 0.06512451171875,...

embed

20846924_c0

20846924

haskell

0

Title: Is it possible to have a IF condition inside a Haskell Sqlite3 trigger? Problem title: Is it possible to have a IF condition inside a Haskell Sqlite3 trigger? Tags: sqlite, haskell, triggers, if-statement Problem: Is it possible to have a IF condition inside a Haskell Sqlite3 trigger? Is it possible to modify th...

Is it possible to have a IF condition inside a Haskell Sqlite3 trigger? Is it possible to have a IF condition inside a Haskell Sqlite3 trigger? sqlite haskell triggers if-statement Haskell Sqlite3 calculateNoOfStocksTraded::String Database.HDBC.Sqlite3.Connection CREATE TRIGGER AFTER INSERT EACH ROW BEGIN UPDATE SET SE...

[ -0.01422119140625, 0.0233154296875, -0.003387451171875, 0.0086669921875, 0.0252685546875, -0.005859375, 0.01446533203125, 0.00634765625, 0.0179443359375, -0.007659912109375, 0.00457763671875, -0.02880859375, -0.007049560546875, -0.027099609375, 0.005523681640625, 0.00970458984375, -0...

[ 2071, 7722, 765, 10, 55449, 35431, 46132, 20625, 142508, 159, 95255, 67, 363, 185553, 1556, 2174, 61340, 74481, 5021, 132887, 184425, 28542, 187781, 16291, 24318, 235603, 175151, 94536, 724, 56599, 64083, 56263, 19452, 161521, 128565, 144832, 1...

[ 0.0178375244140625, 0.168701171875, 0.044586181640625, 0.017364501953125, 0.2425537109375, 0.2342529296875, 0.1510009765625, 0.115234375, 0.2108154296875, 0.0299835205078125, 0.1878662109375, 0.1668701171875, 0.192626953125, 0.26708984375, 0.0787353515625, 0.2149658203125, 0.08819580...

embed

21185901_c0

21185901

haskell

0

Title: Get smallest Int out of [Int] without using predefined functions or arithmetic operators except <=, ==, Problem title: Get smallest Int out of [Int] without using predefined functions or arithmetic operators except <=, ==, Tags: haskell Problem: Get smallest Int out of [Int] without using predefined functi...

Get smallest Int out of [Int] without using predefined functions or arithmetic operators except <=, ==, Get smallest Int out of [Int] without using predefined functions or arithmetic operators except <=, ==, haskell predefined Get x:xs Get smallest Int out of [Int] without using predefined functions or arithmetic...

[ -0.0322265625, -0.0101318359375, 0.0263671875, -0.00604248046875, -0.0233154296875, 0.0177001953125, 0.025634765625, -0.01806640625, 0.0279541015625, 0.00897216796875, 0.0157470703125, 0.001922607421875, -0.01324462890625, 0.0186767578125, -0.00921630859375, 0.0208740234375, 0.005645...

[ 20779, 19336, 525, 360, 18, 1810, 111, 378, 4153, 15490, 17368, 1653, 13, 5983, 32354, 8962, 39933, 40494, 1369, 69112, 9523, 1556, 142508, 1022, 12, 425, 4426, 66211, 29479, 30646, 70, 4734, 107003, 4527, 268, 152, 225490, 110, 201505, 5...

[ 0.1090087890625, 0.2012939453125, 0.207763671875, 0.146240234375, 0.1285400390625, 0.1475830078125, 0.0694580078125, 0.021026611328125, 0.12255859375, 0.0892333984375, 0.0143280029296875, 0.09326171875, 0.06292724609375, 0.157958984375, 0.1396484375, 0.058624267578125, 0.183959960937...

embed

75408832_c1

75408832

haskell

1

Var operation , which up to the documentation is due to the channel being empty. I guess getContents' actually never terminates. Last but most importantly, the behaviour is different depending on the compilation parameters: ghc -threaded main.hs && ./main +RTS -N2 wont print anything and will hang until ^C is pressed (...

[ -0.0159912109375, 0.0037994384765625, -0.00131988525390625, 0.0004291534423828125, -0.005828857421875, 0.00628662109375, 0.01019287109375, -0.006744384765625, -0.017578125, -0.049560546875, 0.0064697265625, -0.00909423828125, -0.000308990478515625, -0.010498046875, 0.01495361328125, -0...

[ 3323, 41018, 209806, 4743, 86723, 201505, 2046, 11935, 25352, 7, 25, 20653, 8306, 121011, 90, 224833, 12921, 96819, 98352, 171859, 31380, 238, 39116, 5201, 127, 24931, 997, 20503, 294, 839, 304, 28412, 23937, 10756, 24189, 441, 30501, 363, ...

[ 0.31005859375, 0.194580078125, 0.0723876953125, 0.011688232421875, 0.1546630859375, 0.1246337890625, 0.1888427734375, 0.16845703125, 0.275146484375, 0.111328125, 0.032073974609375, 0.022979736328125, 0.0670166015625, 0.1622314453125, 0.03765869140625, 0.151123046875, 0.09417724609375...

embed

41683174_c1

41683174

haskell

1

parable -- -- in order to define a partial order we need a definition of (<=) data PartialOrdering = POLessThan | POGreaterThan | POEqual | POIncomparable deriving (Eq, Show) class PartialOrder a where lessThanEq :: a -> a -> Bool instance PartialOrder PartialOrdering where lessThanEq POIncomparable _ = False lessThanE...

[ 0.0024566650390625, 0.0089111328125, 0.0023040771484375, 0.0159912109375, 0.01116943359375, 0.0101318359375, -0.004150390625, -0.05224609375, 0.0024261474609375, 0.031982421875, -0.007659912109375, -0.0062255859375, 0.0157470703125, 0.001739501953125, -0.01544189453125, -0.008972167968...

[ 121, 2661, 4210, 12989, 47, 61924, 10, 2878, 289, 642, 3871, 80934, 111, 16093, 1369, 2053, 9148, 143045, 4209, 64353, 90, 1121, 58745, 8574, 91127, 46429, 71723, 4153, 277, 2500, 2886, 16406, 864, 17367, 18507, 56, 40715, 33079, 2460, 92...

[ 0.191162109375, 0.2196044921875, 0.04736328125, 0.275390625, 0.035888671875, 0.2198486328125, 0.06439208984375, 0.2352294921875, 0.166748046875, 0.00738525390625, 0.07373046875, 0.177490234375, 0.009246826171875, 0.1102294921875, 0.180419921875, 0.171630859375, 0.218994140625, 0.25...

embed

33057111_c0

33057111

haskell

0

Title: pure code and impure code? I/O data type related Problem title: pure code and impure code? I/O data type related Tags: functional-programming, haskell Problem: pure code and impure code? I/O data type related name <- getLine The following paragraph is about how the line works. Can someone explain to me what this...

pure code and impure code? I/O data type related pure code and impure code? I/O data type related functional-programming haskell pure code and impure code? I/O data type related The following paragraph is about how the line works. Can someone explain to me what this means? Thank you in advance.

[ 0.00238037109375, 0.0142822265625, 0.0191650390625, 0.0311279296875, 0.01611328125, 0.00909423828125, 0.019287109375, 0.003997802734375, 0.01068115234375, -0.0050048828125, 0.0072021484375, -0.02880859375, -0.0128173828125, -0.00157928466796875, -0.00665283203125, 0.000843048095703125,...

[ 34166, 18151, 136, 21980, 3408, 32, 87, 64, 670, 2053, 10644, 62548, 123309, 28966, 1556, 142508, 25632, 151268, 1672, 3642, 70, 13315, 43240, 4171, 22008, 73342, 47, 163, 2367, 903, 26950, 129745, 5 ]

[ 0.212158203125, 0.216064453125, 0.117919921875, 0.1541748046875, 0.1949462890625, 0.007419586181640625, 0.044158935546875, 0.17431640625, 0.1400146484375, 0.08953857421875, 0.1341552734375, 0.09051513671875, 0.09844970703125, 0.058135986328125, 0.1231689453125, 0.217529296875, 0.1105...

embed

61038246_c1

61038246

haskell

1

id However, as soon as I want to do both, it breaks: class (FunctorB b) => DistributiveB (b :: (Type -> Type) -> Type) where bdistribute :: (Distributive f) => f (b g) -> b (Compose f g) bdistribute x = bmap (\f -> Compose $ fmap f . bsequence' <$> x) bshape default bdistribute :: forall f g . CanDeriveDistributiveB b...

[ 0.000946044921875, -0.00176239013671875, -0.00885009765625, -0.008544921875, -0.004852294921875, 0.01287841796875, -0.0101318359375, -0.01165771484375, 0.009033203125, 0.0172119140625, -0.0203857421875, -0.00579833984375, 0.0283203125, 0.0096435546875, -0.01806640625, 0.002716064453125...

[ 3447, 33306, 33662, 3444, 54, 15044, 442, 36356, 7, 18507, 97249, 18770, 571, 876, 44357, 75571, 4935, 275, 196707, 60457, 3827, 191145, 397, 1419, 28177, 1238, 706, 10770, 78381, 1022, 62346, 15612, 944, 2420, 1081, 114977, 5584, 4171, 477...

[ 0.1796875, 0.018310546875, 0.0325927734375, 0.044830322265625, 0.033721923828125, 0.1336669921875, 0.017364501953125, 0.1787109375, 0.037750244140625, 0.1861572265625, 0.1168212890625, 0.1019287109375, 0.1951904296875, 0.166748046875, 0.00604248046875, 0.232421875, 0.1649169921875, ...

embed

21496129_c0

21496129

haskell

0

Title: Avoiding case expression ladder without monad transformers Problem title: Avoiding case expression ladder without monad transformers Tags: monad-transformers, haskell, coding-style Problem: Avoiding case expression ladder without monad transformers In Real World Haskell monads are introduced as a way to avoid th...

Avoiding case expression ladder without monad transformers Avoiding case expression ladder without monad transformers monad-transformers haskell coding-style Avoiding Maybe Either Nothing Just Left Right s3:_ Avoiding case expression ladder without monad transformers In Real World Haskell monads are introduced as a way...

[ -0.035400390625, 0.00238037109375, -0.002777099609375, -0.013916015625, 0.01544189453125, -0.030029296875, 0.0003185272216796875, 0.002105712890625, 0.00537109375, -0.031494140625, 0.026611328125, -0.0157470703125, -0.00799560546875, -0.01397705078125, 0.01953125, -0.005279541015625, ...

[ 84361, 86675, 7225, 125195, 21, 70764, 15490, 2667, 712, 27198, 1314, 215175, 1556, 142508, 552, 6238, 40946, 83425, 4565, 9319, 182747, 9563, 636, 2480, 90911, 363, 5120, 6661, 20625, 7, 65508, 3917, 47, 71864, 18151, 95685, 214, 5773, 710...

[ 0.1448974609375, 0.009307861328125, 0.2109375, 0.2230224609375, 0.09722900390625, 0.2335205078125, 0.0826416015625, 0.130615234375, 0.1923828125, 0.2293701171875, 0.1259765625, 0.1978759765625, 0.0933837890625, 0.24462890625, 0.117919921875, 0.039520263671875, 0.1297607421875, 0.21...

embed

47976107_c0

47976107

haskell

0

Title: Haskell, regex, TDFA: match (and remove) quoted substrings Problem title: Haskell, regex, TDFA: match (and remove) quoted substrings Tags: haskell, regex Problem: Haskell, regex, TDFA: match (and remove) quoted substrings There is a regular expression matching quoted substrings: "/\"(?:[^\"\\]|\\.)*\"/" (origina...

Haskell, regex, TDFA: match (and remove) quoted substrings Haskell, regex, TDFA: match (and remove) quoted substrings haskell regex Haskell TDFA Exception Explict Text.Regex.TDFA.String Haskell, regex, TDFA: match (and remove) quoted substrings There is a regular expression matching quoted substrings: "/\"(?:[^\"\\]|\\...

[ -0.0020294189453125, 0.029296875, 0.005218505859375, 0.0194091796875, -0.010986328125, 0.006134033203125, 0.00141143798828125, 0.0091552734375, 0.005889892578125, -0.00836181640625, -0.005401611328125, 0.013916015625, -0.0054931640625, -0.00872802734375, 0.010986328125, 0.01611328125, ...

[ 20625, 142508, 6835, 3355, 117295, 14676, 14858, 2940, 87388, 66747, 71, 1614, 91693, 1556, 63928, 55992, 24129, 54601, 100045, 71713, 20324, 125195, 214, 64, 41872, 8353, 13273, 1639, 124524, 248, 1957, 11853, 8647, 35046, 43240, 17106, 6002, ...

[ 0.1112060546875, 0.2568359375, 0.1043701171875, 0.2071533203125, 0.09521484375, 0.2137451171875, 0.2410888671875, 0.1129150390625, 0.2288818359375, 0.216064453125, 0.124755859375, 0.19580078125, 0.252197265625, 0.05914306640625, 0.1011962890625, 0.0926513671875, 0.08306884765625, 0...

embed

67118307_c0

67118307

haskell

0

Title: How do you get Haskell to check SQL at compile time? Problem title: How do you get Haskell to check SQL at compile time? Tags: haskell, hasql, postgresql, sql Problem: How do you get Haskell to check SQL at compile time? I know it can be done, but I'm having trouble getting it working. I'm still finding my feet ...

How do you get Haskell to check SQL at compile time? How do you get Haskell to check SQL at compile time? haskell hasql postgresql sql How Haskell SQL How do you get Haskell to check SQL at compile time? I know it can be done, but I'm having trouble getting it working. I'm still finding my feet with Haskell. I tried us...

[ -0.00124359130859375, -0.003173828125, 0.00106048583984375, 0.0198974609375, -0.00933837890625, 0.01190185546875, -0.0272216796875, -0.0103759765625, -0.0157470703125, -0.026123046875, 0.004364013671875, -0.0291748046875, 0.01031494140625, -0.007415771484375, -0.0162353515625, 0.008728...

[ 11249, 2046, 20625, 142508, 47, 12765, 80866, 99, 9969, 1340, 1733, 1556, 99247, 1305, 17562, 91, 54, 3714, 831, 16940, 19441, 63134, 20949, 20697, 7464, 90791, 759, 74261, 678, 37842, 17368, 50986, 68746, 18, 22, 2886, 19559, 172, 31583, ...

[ 0.0721435546875, 0.104736328125, 0.152099609375, 0.2685546875, 0.08563232421875, 0.24072265625, 0.2685546875, 0.120849609375, 0.176513671875, 0.203125, 0.1463623046875, 0.1329345703125, 0.2119140625, 0.039337158203125, 0.1552734375, 0.021942138671875, 0.003082275390625, 0.018325805...

embed

16714627_c0

16714627

haskell

0

Title: Haskell how to use Language.Haskell.Interpreter to read config file? Problem title: Haskell how to use Language.Haskell.Interpreter to read config file? Tags: interpreter, hint, configuration-files, haskell Problem: Haskell how to use Language.Haskell.Interpreter to read config file? How do I use the Language.Ha...

Haskell how to use Language.Haskell.Interpreter to read config file? Haskell how to use Language.Haskell.Interpreter to read config file? interpreter hint configuration-files haskell Haskell Language.Haskell.Interpreter user1 indata.file outdata.file Haskell how to use Language.Haskell.Interpreter to read config file? ...

[ 0.00958251953125, -0.021240234375, 0.0008087158203125, 0.0205078125, -0.00848388671875, 0.0126953125, 0.0101318359375, 0.011474609375, 0.0068359375, -0.03466796875, -0.0233154296875, -0.0162353515625, -0.0174560546875, -0.0361328125, 0.0057373046875, -0.02587890625, -0.0169677734375,...

[ 20625, 142508, 3642, 4527, 83658, 6495, 44851, 56359, 56, 12301, 153837, 11435, 47, 7, 29481, 5122, 18, 180346, 29822, 1556, 38937, 418, 10135, 1810, 11249, 34475, 95486, 142424, 61475, 77336, 1528, 1884, 3444, 42518, 42485, 163846, 55681, 17...

[ 0.1072998046875, 0.2021484375, 0.044189453125, 0.10357666015625, 0.11572265625, 0.058349609375, 0.131591796875, 0.1915283203125, 0.1478271484375, 0.1688232421875, 0.2216796875, 0.1468505859375, 0.0268707275390625, 0.0154571533203125, 0.1658935546875, 0.10302734375, 0.006072998046875,...

embed

20136559_c0

20136559

haskell

0

Title: How to check whether instance exists for a polymorphic type with Template Haskell? Problem title: How to check whether instance exists for a polymorphic type with Template Haskell? Tags: haskell, template-haskell Problem: How to check whether instance exists for a polymorphic type with Template Haskell? Suppose,...

How to check whether instance exists for a polymorphic type with Template Haskell? How to check whether instance exists for a polymorphic type with Template Haskell? haskell template-haskell How Template Haskell Show ListT AppT VarT Not GHC.Show.Show ForallT PlainTV ClassP How to check whether instance exists for a pol...

[ -0.0017852783203125, -0.006622314453125, 0.005340576171875, 0.007415771484375, -0.008544921875, 0.011962890625, 0.0245361328125, -0.01513671875, 0.0181884765625, -0.0269775390625, -0.000507354736328125, -0.0269775390625, 0.0169677734375, 0.0033721923828125, -0.0036163330078125, -0.0179...

[ 11249, 12765, 36766, 110527, 32316, 7, 100, 35874, 178851, 1771, 10644, 678, 196631, 20625, 142508, 47, 1556, 110934, 10557, 17367, 32036, 618, 5659, 3323, 11205, 527, 73265, 168660, 5584, 8950, 5343, 35014, 683, 11, 14602, 25632, 18499, 4263...

[ 0.0289764404296875, 0.1954345703125, 0.1197509765625, 0.2734375, 0.190673828125, 0.07403564453125, 0.06787109375, 0.1861572265625, 0.1844482421875, 0.040679931640625, 0.1845703125, 0.0711669921875, 0.257080078125, 0.1328125, 0.23876953125, 0.01519775390625, 0.09222412109375, 0.2231...

embed

20379112_c1

20379112

haskell

1

of neighborhoods. BFSNode corresponds to a node in the BFS tree which belongs to either a new vertex which is visited for the first time, or to an old vertex which already has been visited and which is therefore referred by its unique number. Note that the parsing process works fine and consumes very few memory. My ai...

[ 0.003936767578125, 0.019287109375, -0.0008544921875, 0.004852294921875, 0.007110595703125, 0.0291748046875, -0.00830078125, -0.0087890625, 0.0035552978515625, -0.00994873046875, -0.007598876953125, -0.019775390625, 0.002899169921875, 0.0026397705078125, -0.005279541015625, -0.010498046...

[ 111, 205277, 7, 335, 36381, 5021, 112, 42518, 110, 53201, 10617, 3525, 493, 24371, 36997, 5117, 1733, 10332, 21771, 1556, 15005, 36998, 14012, 366, 6953, 9433, 43240, 5885, 18588, 4552, 10846, 98323, 2646, 464, 96760, 79858, 7077, 3934, 205...

[ 0.05755615234375, 0.20263671875, 0.0721435546875, 0.130859375, 0.2587890625, 0.250244140625, 0.2060546875, 0.1339111328125, 0.1749267578125, 0.1751708984375, 0.11328125, 0.06231689453125, 0.078125, 0.1412353515625, 0.154052734375, 0.07568359375, 0.05804443359375, 0.0648193359375, ...

embed

22284406_c0

22284406

haskell

0

Title: How to do (role-based) access control in Yesod? Problem title: How to do (role-based) access control in Yesod? Tags: authorization, haskell, yesod, rbac, access-control Problem: How to do (role-based) access control in Yesod? I'm wondering what the best approach for adding roles to users / permissions to Handler...

How to do (role-based) access control in Yesod? How to do (role-based) access control in Yesod? authorization haskell yesod rbac access-control How Yesod Handler How to do (role-based) access control in Yesod? I'm wondering what the best approach for adding roles to users / permissions to Handler s or resources in Yeso...

[ 0.001220703125, 0.025634765625, 0.00469970703125, -0.005126953125, -0.020263671875, 0.00860595703125, -0.00238037109375, -0.0150146484375, 0, -0.0152587890625, 0.0272216796875, -0.00665283203125, -0.026611328125, 0.02099609375, -0.017822265625, 0.001708984375, -0.003021240234375, 0...

[ 11249, 47, 54, 516, 133, 77007, 17203, 6226, 23, 32635, 2199, 42179, 47691, 1556, 142508, 2422, 23722, 49369, 81988, 10639, 603, 149016, 2965, 51515, 154107, 31486, 72095, 248, 168081, 65514, 41928, 4927, 21962, 10644, 16751, 56282, 94708, 74...

[ 0.1097412109375, 0.044830322265625, 0.08935546875, 0.1400146484375, 0.1614990234375, 0.1834716796875, 0.1973876953125, 0.2454833984375, 0.0894775390625, 0.1834716796875, 0.258056640625, 0.116943359375, 0.1326904296875, 0.08349609375, 0.1922607421875, 0.1591796875, 0.2060546875, 0.1...

embed

8155929_c1

8155929

haskell

1

. Actually It's not too bad, because at the moment the Haskell code is only 3 times slower. Using GHC-7.2.1 and compiling as such: ghc -O2 -Odph -fllvm -optlo-O3 -optlo-loop-reduce -optlo-loop-deletion the Haskell code uses 60s. on an input of ~1GB, while the C-version uses 21-22s. But there are some things I find odd:...

[ -0.007537841796875, 0.016357421875, 0.0042724609375, -0.01397705078125, 0.001068115234375, 0.00799560546875, -0.005462646484375, -0.0194091796875, 0.0084228515625, -0.04931640625, 0.001556396484375, 0.01519775390625, 0.02392578125, 0.028564453125, -0.0146484375, -0.006500244140625, 0...

[ 5, 192728, 959, 5792, 6494, 3095, 20625, 142508, 18151, 83, 4734, 138, 20028, 72803, 56, 345, 527, 73265, 16709, 68107, 9969, 31380, 238, 670, 304, 71115, 11727, 20, 3723, 39, 2146, 365, 363, 28354, 107, 106357, 8520, 1363, 4527, 1496, ...

[ 0.0140838623046875, 0.101318359375, 0.03509521484375, 0.0195159912109375, 0.1015625, 0.075439453125, 0.145751953125, 0.273681640625, 0.1884765625, 0.0244140625, 0.03277587890625, 0.053558349609375, 0.1214599609375, 0.1712646484375, 0.1083984375, 0.00933837890625, 0.05438232421875, ...

embed

69998831_c0

69998831

haskell

0

Title: What is the best way to fetch keys in a data type? Problem title: What is the best way to fetch keys in a data type? Tags: haskell Problem: What is the best way to fetch keys in a data type? I need to get all the keys in a given object this is how I managed to do it. {-# LANGUAGE DeriveGeneric #-} import System....

What is the best way to fetch keys in a data type? What is the best way to fetch keys in a data type? haskell System.Environment Data.Aeson Data.Foldable GHC.Generics qualified What LANGUAGE DeriveGeneric Data.HashMap.Strict Hashmap Person age::Int Generic Show ToJSON Maybe Object Just Hashmap.keys What is the best way...

[ 0.004638671875, -0.0026092529296875, 0.0033111572265625, 0.000766754150390625, -0.0030975341796875, -0.005950927734375, -0.0030059814453125, 0.004486083984375, -0.0155029296875, -0.0390625, 0.01275634765625, -0.01055908203125, 0.017822265625, 0.00189208984375, 0.00714111328125, -0.0072...

[ 4865, 83, 2965, 3917, 47, 7647, 206, 22799, 7, 23, 2053, 10644, 70, 1556, 142508, 12353, 1900, 11809, 90, 191, 18345, 2886, 527, 73265, 135932, 12259, 217225, 3358, 98064, 1310, 5844, 6495, 166179, 62233, 162087, 62346, 15270, 32070, 88342,...

[ 0.0164337158203125, 0.013916015625, 0.142333984375, 0.0936279296875, 0.03448486328125, 0.170654296875, 0.1280517578125, 0.240478515625, 0.1180419921875, 0.07501220703125, 0.1207275390625, 0.2152099609375, 0.012451171875, 0.1124267578125, 0.2149658203125, 0.0853271484375, 0.0140380859...

embed

12476999_c0

12476999

haskell

0

Title: Haskell parser to AST Problem title: Haskell parser to AST Tags: parsing, haskell, abstract-syntax-tree Problem: Haskell parser to AST As an exercise to learn Haskell (and torture myself), I am considering writing a configurable Haskell code beautifier. It will support a configuration file written in JSON or YAM...

Haskell parser to AST Haskell parser to AST parsing haskell abstract-syntax-tree Haskell AST Haskell parser to AST As an exercise to learn Haskell (and torture myself), I am considering writing a configurable Haskell code beautifier. It will support a configuration file written in JSON or YAML (or something better?) th...

[ -0.007354736328125, 0.005279541015625, 0.017578125, -0.0031280517578125, 0.002716064453125, 0.01806640625, -0.016845703125, -0.0108642578125, -0.01190185546875, -0.0184326171875, 0.01416015625, -0.0174560546875, -0.00567626953125, 0.0123291015625, -0.00147247314453125, 0.00102233886718...

[ 20625, 142508, 366, 2189, 47, 48963, 6953, 1556, 164789, 12654, 86531, 62600, 81979, 30698, 134357, 13, 35978, 179635, 32562, 56231, 18151, 44551, 18, 85789, 8060, 180346, 11435, 59121, 821, 58627, 707, 3320, 39456, 11522, 58735, 44126, 12096, ...

[ 0.161865234375, 0.236328125, 0.1719970703125, 0.191650390625, 0.1307373046875, 0.22265625, 0.04132080078125, 0.128173828125, 0.2098388671875, 0.07305908203125, 0.164306640625, 0.172607421875, 0.05364990234375, 0.0333251953125, 0.1446533203125, 0.02850341796875, 0.0538330078125, 0.0...

embed

35375051_c0

35375051

haskell

0

Title: Haskell how to get code from Hackage into project? Cabal install project failed Problem title: Haskell how to get code from Hackage into project? Cabal install project failed Tags: debugging, hackage, haskell Problem: Haskell how to get code from Hackage into project? Cabal install project failed I created a pro...

Haskell how to get code from Hackage into project? Cabal install project failed Haskell how to get code from Hackage into project? Cabal install project failed debugging hackage haskell Hackage Haskell Cabal Main.hs There Haskell how to get code from Hackage into project? Cabal install project failed I created a projec...

[ -0.002349853515625, 0.0205078125, 0.01177978515625, 0.031005859375, 0, 0.0026702880859375, 0.00946044921875, 0.00885009765625, -0.010986328125, -0.01483154296875, -0.005889892578125, -0.05322265625, -0.01214599609375, 0.005889892578125, 0.0079345703125, 0.000637054443359375, -0.01623...

[ 20625, 142508, 3642, 2046, 18151, 1295, 52922, 4588, 3934, 13452, 30438, 289, 20600, 165523, 8, 978, 85526, 1556, 12321, 5, 127, 8622, 47, 75935, 24927, 23009, 43658, 3166, 28412, 112, 21407, 99929, 867, 19437, 78303, 109524, 3444, 19048, 4...

[ 0.1280517578125, 0.226318359375, 0.06048583984375, 0.1527099609375, 0.2568359375, 0.15283203125, 0.19775390625, 0.2049560546875, 0.1729736328125, 0.2047119140625, 0.186279296875, 0.144287109375, 0.1231689453125, 0.2086181640625, 0.04608154296875, 0.142333984375, 0.175537109375, 0.0...

embed

20352717_c1

20352717

haskell

1

" QuickCheck, and using it in the wrong way here. EDIT: unfortunately, the sized function does not seem to eliminate the problem here. It ends up with the same result (see comment to J. Abrahamson's answer.) EDIT II: I ended up "fixing" my problem by avoiding the recursive step, and avoiding conjoin . We just make a li...

[ 0.000385284423828125, -0.0079345703125, 0.0027008056640625, -0.0098876953125, -0.000850677490234375, -0.00665283203125, -0.01080322265625, -0.0245361328125, 0.004730224609375, -0.006866455078125, -0.00482177734375, 0.0059814453125, 0.01385498046875, 0.0045166015625, 0.0113525390625, -0...

[ 89038, 202567, 17368, 442, 44691, 3917, 3688, 13267, 71, 32354, 27169, 2967, 58480, 55923, 214, 71864, 195625, 5844, 29954, 158, 513, 73, 5303, 756, 110, 988, 53201, 3034, 11001, 157, 112, 57266, 79786, 5885, 86595, 98, 5021, 247341, 101344...

[ 0.1749267578125, 0.308349609375, 0.07861328125, 0.003265380859375, 0.0875244140625, 0.04620361328125, 0.006134033203125, 0.1695556640625, 0.1268310546875, 0.1304931640625, 0.047821044921875, 0.095947265625, 0.0146942138671875, 0.1121826171875, 0.004486083984375, 0.072509765625, 0.141...

embed

22074680_c0

22074680

haskell

0

Title: What's the most efficient way to represent red-black trees? Problem title: What's the most efficient way to represent red-black trees? Tags: haskell Problem: What's the most efficient way to represent red-black trees? Okasaki uses (essentially) data Color = R | B data RB a = L | T {-# UNPACK #-}!Color ...

What's the most efficient way to represent red-black trees? What's the most efficient way to represent red-black trees? haskell What Color UNPACK What's the most efficient way to represent red-black trees? Okasaki uses (essentially) I know that in C, the color is typically handled in a more fiddly way to save...

[ 0.000736236572265625, 0.0025177001953125, -0.0031890869140625, 0.01409912109375, -0.01177978515625, 0.0172119140625, -0.0247802734375, -0.0030364990234375, 0.0125732421875, 0.0091552734375, 0.003814697265625, -0.0179443359375, 0.01220703125, 0.00811767578125, -0.0140380859375, 0.015991...

[ 3768, 2684, 93766, 3917, 47, 33636, 4842, 9, 151675, 1360, 90, 1556, 142508, 4865, 51193, 8274, 98701, 605, 180, 64036, 301, 4527, 23, 313, 10576, 205794, 34831, 1286, 809, 4028, 30098, 32628, 27226, 4785, 6275, 56, 110, 22, 40899, 7722, ...

[ 0.0615234375, 0.1199951171875, 0.220703125, 0.08984375, 0.01641845703125, 0.2286376953125, 0.1419677734375, 0.046875, 0.197509765625, 0.1778564453125, 0.07635498046875, 0.1268310546875, 0.25146484375, 0.0210723876953125, 0.1802978515625, 0.10736083984375, 0.2064208984375, 0.1231689...

embed

7494950_c1

7494950

haskell

1

String -> Handler RepHtml getEntryR slug = do Blog entries <- getYesod case filter (\e -> entrySlug e == slug) entries of [] -> notFound (entry:_) -> do let nav = reverse $ map toNav entries let tempArgs = TemplateArgs { templateTitle = toHtml $ entryTitle entry , templateContent = toHtml $ entryContent entry , templa...

[ 0.017578125, 0.00080108642578125, 0.005767822265625, -0.00506591796875, -0.02392578125, 0.0211181640625, -0.00958251953125, -0.0225830078125, 0.0274658203125, -0.04052734375, -0.036376953125, -0.00860595703125, -0.01251220703125, -0.001495361328125, 0.0263671875, 0.0189208984375, -0....

[ 23351, 214, 33079, 10639, 603, 33742, 841, 18, 7237, 2046, 7768, 15123, 1052, 13584, 177, 2203, 54, 5061, 112820, 91480, 2199, 7225, 46312, 13, 42805, 35159, 28, 69112, 111, 959, 27591, 7030, 33, 2633, 2430, 39531, 184, 22288, 47, 160349,...

[ 0.1741943359375, 0.07177734375, 0.0433349609375, 0.2178955078125, 0.289306640625, 0.1998291015625, 0.1165771484375, 0.1280517578125, 0.1923828125, 0.09930419921875, 0.0849609375, 0.170166015625, 0.179931640625, 0.1837158203125, 0.141845703125, 0.0150146484375, 0.0303955078125, 0.16...

embed

65671417_c2

65671417

haskell

2

the files known Code signals: JITSymbolError, its, these, nixpkgs, nixpkgsSrc, Trouble, ORC, JIT, github.com, llvm-hs.git, llvm-hs-examples.git, shell.nix, ModuleID, source_filename, i32, Eager, Result, self.llvm_9, Fetch, haskell.nix, default.nix, builtins.fetchTarball, ef6ca0f431fe3830c25cb2d185367245c1cce894.tar.gz...

[ 0.0233154296875, -0.01904296875, -0.00457763671875, 0.0023040771484375, -0.0081787109375, 0.01239013671875, 0.0074462890625, -0.008056640625, -0.00531005859375, 0.017822265625, 0.003082275390625, -0.023681640625, 0.0087890625, 0.0174560546875, 0.00933837890625, 0.0206298828125, -0.01...

[ 70, 102158, 51529, 28864, 26073, 7, 821, 119119, 53, 36846, 18468, 31611, 6863, 6097, 300, 425, 38988, 9405, 19437, 119671, 2661, 180, 25740, 6371, 62270, 32102, 277, 3723, 39, 127, 15769, 3355, 302, 99726, 128019, 93, 63014, 7146, 31344, ...

[ 0.121826171875, 0.262451171875, 0.253173828125, 0.2388916015625, 0.25830078125, 0.0782470703125, 0.1861572265625, 0.1348876953125, 0.11279296875, 0.22607421875, 0.128173828125, 0.1279296875, 0.162109375, 0.1551513671875, 0.0738525390625, 0.0653076171875, 0.112060546875, 0.148803710...

embed

67543282_c0

67543282

haskell

0

Title: Can't refactor code in a do block, IO return type doesn't match Problem title: Can't refactor code in a do block, IO return type doesn't match Tags: haskell Problem: Can't refactor code in a do block, IO return type doesn't match This was the original code putBoard :: Board -> IO () putBoard ...

Can't refactor code in a do block, IO return type doesn't match Can't refactor code in a do block, IO return type doesn't match haskell Can Board Couldn Expected Actual Can't refactor code in a do block, IO return type doesn't match This was the original code I wanted to rewrite it as but I get Why ...

[ 0.0002460479736328125, -0.00787353515625, 0.0159912109375, 0.01068115234375, -0.012451171875, -0.00982666015625, -0.01434326171875, -0.002166748046875, 0.004119873046875, 0.01361083984375, 0.00173187255859375, -0.02294921875, 0.01031494140625, -0.005828857421875, -0.0203857421875, 0.00...

[ 4171, 3768, 18, 456, 144810, 18151, 23, 54, 46389, 17780, 30646, 10644, 22027, 14858, 1556, 142508, 62554, 191147, 60075, 13, 100582, 7311, 36663, 434, 18781, 237, 1284, 44084, 83, 65395, 19, 15, 124962, 71 ]

[ 0.0660400390625, 0.066162109375, 0.045654296875, 0.1373291015625, 0.278076171875, 0.1588134765625, 0.0433349609375, 0.1328125, 0.19921875, 0.17333984375, 0.193115234375, 0.1732177734375, 0.03887939453125, 0.1484375, 0.09503173828125, 0.189208984375, 0.12890625, 0.07366943359375, ...

embed

29870082_c0

29870082

haskell

0

Title: Implementing show for multi-line content in Haskell Problem title: Implementing show for multi-line content in Haskell Tags: debugging, typeclass, haskell, logging, formatting Problem: Implementing show for multi-line content in Haskell I have a small matrix type in Haskell that is that is most appropriately dis...

Implementing show for multi-line content in Haskell Implementing show for multi-line content in Haskell debugging typeclass haskell logging formatting Implementing Haskell Implementing show for multi-line content in Haskell I have a small matrix type in Haskell that is that is most appropriately displayed across multip...

[ -0.0145263671875, 0.00885009765625, 0.0115966796875, 0.021728515625, 0.006500244140625, 0.004669189453125, 0.00927734375, 0.000362396240234375, 0.012939453125, 0.03515625, -0.0098876953125, -0.02490234375, -0.005096435546875, 0.01190185546875, -0.00921630859375, 0.004852294921875, -0...

[ 153941, 7639, 100, 6024, 2256, 10941, 20625, 142508, 8, 978, 10644, 67413, 1556, 459, 36659, 9384, 19336, 50944, 425, 2684, 95307, 44116, 36880, 48716, 124519, 43581, 208124, 5170, 1884, 903, 43240, 5299, 10002, 20441, 86681, 31380, 318, 2176...

[ 0.206787109375, 0.24951171875, 0.07379150390625, 0.1944580078125, 0.2060546875, 0.240234375, 0.156982421875, 0.2320556640625, 0.0927734375, 0.119140625, 0.135498046875, 0.139892578125, 0.1251220703125, 0.0616455078125, 0.011505126953125, 0.188232421875, 0.06243896484375, 0.16101074...

embed

52884045_c0

52884045

haskell

0

Title: Tuple + custom data type Comprehension list Problem title: Tuple + custom data type Comprehension list Tags: haskell Problem: Tuple + custom data type Comprehension list I wonder if I can do comprehension list with Tuple + custom data type. So my simple code is that data T1 = Te {tea::String,tea1::String} derivi...

Tuple + custom data type Comprehension list Tuple + custom data type Comprehension list haskell Tuple Comprehension tea::String tea1::String Show Read Te2 Other tea1 Tuple + custom data type Comprehension list I wonder if I can do comprehension list with Tuple + custom data type. So my simple code is that I have got an...

[ 0.0089111328125, -0.0084228515625, 0.003387451171875, 0.014404296875, 0.00860595703125, -0.012451171875, -0.01153564453125, 0.027099609375, 0.021484375, -0.000644683837890625, -0.007080078125, 0.0037689208984375, 0.0262451171875, 0.00518798828125, -0.02197265625, -0.005157470703125, ...

[ 1371, 8705, 997, 114122, 2053, 10644, 142158, 3220, 6889, 5303, 1556, 142508, 26156, 71713, 82825, 17367, 4764, 1413, 304, 64511, 418, 32195, 831, 54, 46683, 678, 5, 8781, 18151, 18499, 1295, 6, 115992, 84751, 1884, 384, 120, 65423, 1297, ...

[ 0.1593017578125, 0.22998046875, 0.1334228515625, 0.201171875, 0.1409912109375, 0.18359375, 0.1527099609375, 0.19287109375, 0.1077880859375, 0.2022705078125, 0.122802734375, 0.19384765625, 0.18994140625, 0.1129150390625, 0.06646728515625, 0.0831298828125, 0.124755859375, 0.125122070...

embed

30893339_c0

30893339

haskell

0

Title: Idiomatic list construction Problem title: Idiomatic list construction Tags: idioms, list, haskell, functional-programming Problem: Idiomatic list construction I'm very new to Haskell and functional programming in general, so I don't really know how to make this code idiomatic: type Coord = Double data Point = P...

Idiomatic list construction Idiomatic list construction idioms list haskell functional-programming Idiomatic Coord Double Point Show Polyline Add p:line Idiomatic list construction I'm very new to Haskell and functional programming in general, so I don't really know how to make this code idiomatic: My problem is in the...

[ 0.000640869140625, -0.002960205078125, -0.0019683837890625, 0.011474609375, -0.0023956298828125, 0.0177001953125, 0.006500244140625, 0.004302978515625, 0.005828857421875, -0.04638671875, 0.0277099609375, -0.048583984375, 0.0031585693359375, -0.0026397705078125, -0.0240478515625, 0.0128...

[ 87, 5670, 47148, 5303, 50961, 13373, 28016, 1556, 142508, 123309, 28966, 1311, 6651, 107172, 41097, 17367, 63306, 2256, 29117, 915, 12, 4552, 3525, 20625, 56037, 449, 3714, 3642, 3249, 18151, 49666, 9523, 2967, 64549, 93232, 32354, 4263, 3444...

[ 0.01104736328125, 0.16845703125, 0.1558837890625, 0.20556640625, 0.174072265625, 0.162109375, 0.1170654296875, 0.1009521484375, 0.2171630859375, 0.138427734375, 0.0980224609375, 0.0623779296875, 0.1873779296875, 0.105712890625, 0.1636962890625, 0.1123046875, 0.1607666015625, 0.2145...

embed

56779523_c0

56779523

haskell

0

Title: How do I fold nodes of an XML element using lens? Problem title: How do I fold nodes of an XML element using lens? Tags: xml, haskell, haskell-lens Problem: How do I fold nodes of an XML element using lens? I'm using xml-lens package to process XML. Given an Element , I want to perform concatMap -like computatio...

How do I fold nodes of an XML element using lens? How do I fold nodes of an XML element using lens? xml haskell haskell-lens lens How XML Element Node NodeElement How do I fold nodes of an XML element using lens? I'm using xml-lens package to process XML. Given an Element , I want to perform concatMap -like computation...

[ -0.0184326171875, -0.0184326171875, -0.00154876708984375, -0.00732421875, -0.00909423828125, 0.014404296875, -0.02490234375, -0.0181884765625, 0.006988525390625, -0.026123046875, 0.004150390625, -0.0096435546875, -0.01031494140625, -0.006988525390625, 0.004974365234375, -0.029541015625...

[ 11249, 42822, 110, 988, 92537, 12830, 17368, 3098, 7, 54, 111, 131492, 1556, 142508, 1977, 48325, 438, 112, 647, 19929, 87, 98169, 3444, 51339, 158, 4460, 166179, 5062, 181135, 5021, 44457, 40407, 35431, 27489, 1286, 64549, 11001, 1507, 530...

[ 0.057403564453125, 0.253662109375, 0.16015625, 0.171875, 0.2464599609375, 0.1865234375, 0.07159423828125, 0.2025146484375, 0.1201171875, 0.0057373046875, 0.007904052734375, 0.186767578125, 0.045562744140625, 0.1416015625, 0.1641845703125, 0.1722412109375, 0.130615234375, 0.11169433...

embed

61645696_c0

61645696

haskell

0

Title: Backtraking with list Monad in Haskell Problem title: Backtraking with list Monad in Haskell Tags: monads, list, haskell, decomposition Problem: Backtraking with list Monad in Haskell I'm trying to solve a decomposition problem with backtracking and list Monad in Haskell. Here is the problem statement: given a p...

Backtraking with list Monad in Haskell Backtraking with list Monad in Haskell monads list haskell decomposition Control.Monad Backtraking Monad Haskell test1 test2 Backtraking with list Monad in Haskell I'm trying to solve a decomposition problem with backtracking and list Monad in Haskell. Here is the problem statemen...

[ -0.024658203125, 0.01611328125, 0.0125732421875, 0.015625, 0.00077056884765625, 0.01953125, -0.00074005126953125, 0.0113525390625, 0.01287841796875, -0.0341796875, 0.0029144287109375, -0.00238037109375, 0.0126953125, 0.0201416015625, 0.00133514404296875, -0.0003871917724609375, 0.001...

[ 26828, 1517, 6048, 678, 5303, 60331, 71, 23, 20625, 142508, 2667, 712, 1556, 8, 277, 40322, 27131, 46674, 3034, 418, 304, 31577, 86869, 2967, 4420, 125728, 214, 136, 11853, 63805, 34475, 24491, 892, 1505, 653, 7413, 756, 148390, 26255, 37...

[ 0.2052001953125, 0.21826171875, 0.0943603515625, 0.0765380859375, 0.231201171875, 0.20849609375, 0.1602783203125, 0.050506591796875, 0.1533203125, 0.2470703125, 0.1044921875, 0.14111328125, 0.1279296875, 0.1453857421875, 0.1378173828125, 0.1168212890625, 0.18310546875, 0.1280517578...

embed

10243942_c0

10243942

haskell

0

Title: Type annotation in a typeclass' default value causes a "could not deduce" type error Problem title: Type annotation in a typeclass' default value causes a "could not deduce" type error Tags: haskell, type-inference, typeclass Problem: Type annotation in a typeclass' default value ca...

Type annotation in a typeclass' default value causes a "could not deduce" type error Type annotation in a typeclass' default value causes a "could not deduce" type error haskell type-inference typeclass a the Type Could Type annotation in a typeclass' default value causes a "could not dedu...

[ 0.0145263671875, 0.00994873046875, 0.0035858154296875, 0.0224609375, 0.012451171875, -0.0220947265625, -0.032958984375, 0.007049560546875, -0.0009613037109375, -0.00170135498046875, -0.02294921875, -0.0181884765625, 0.0135498046875, 0.0322265625, 0.001373291015625, -0.004791259765625, ...

[ 60457, 8668, 22062, 23, 10644, 67413, 3768, 114977, 34292, 113660, 587, 52366, 959, 8, 106357, 18499, 1556, 142508, 69988, 10, 191147, 125296, 25632, 18151, 35782, 9969, 1340, 527, 73265, 37202, 51, 2082, 756, 70, 25, 80934, 335, 5701, 7334...

[ 0.2418212890625, 0.183349609375, 0.119384765625, 0.03369140625, 0.1856689453125, 0.1998291015625, 0.059783935546875, 0.2095947265625, 0.113037109375, 0.0838623046875, 0.0213623046875, 0.12060546875, 0.1295166015625, 0.1370849609375, 0.1895751953125, 0.1632080078125, 0.07080078125, ...

embed

8688719_c0

8688719

haskell

0

Title: In Haskell, performance and where binding Problem title: In Haskell, performance and where binding Tags: haskell Problem: In Haskell, performance and where binding I am just learning Haskell and wrote two programs from a tutorial site, such that maximumnowhere :: (Ord a) => [a] -> a maximumnowhere [] = error "em...

In Haskell, performance and where binding In Haskell, performance and where binding haskell Haskell Ord x:xs In Haskell, performance and where binding I am just learning Haskell and wrote two programs from a tutorial site, such that and I thought these two programs are fairly equivalent, cause I thought, the where bind...

[ -0.015625, 0.0228271484375, 0.0054931640625, -0.0279541015625, 0.005157470703125, 0.01806640625, -0.002410888671875, -0.002655029296875, 0.0230712890625, -0.0205078125, 0.010009765625, -0.00946044921875, 0.019287109375, -0.0174560546875, 0.0203857421875, 0.0027923583984375, 0.0024108...

[ 360, 20625, 142508, 23718, 136, 7440, 128239, 1556, 35379, 1022, 12, 425, 52080, 54397, 6626, 103391, 57143, 17569, 180663, 183234, 70, 91995, 77336, 678, 10941, 11675, 31380, 318, 509, 3917, 72803, 56, 10298, 140909, 645, 11653, 58696, 60212...

[ 0.0517578125, 0.153564453125, 0.2464599609375, 0.2279052734375, 0.0823974609375, 0.2103271484375, 0.264892578125, 0.14013671875, 0.1748046875, 0.09228515625, 0.0283050537109375, 0.10791015625, 0.032928466796875, 0.010589599609375, 0.05279541015625, 0.13232421875, 0.053619384765625, ...

embed

11144393_c1

11144393

haskell

1

(tail lst) --Pairing letters and creating a map of tuples containing frequency related characters msg = zip (oneChar $ lSort $ grp $ msgSort $ alphaSort $ map toUpper $ codedMsg) mostFreqLtr msg2 = DMap.fromList msg --replace coded list with analyzed list replaceChars lst | null lst = [] | isAlpha (head lst) = DMap.lo...

[ 0.0087890625, -0.0018463134765625, -0.00311279296875, 0.01275634765625, 0.0218505859375, 0.00119781494140625, -0.0103759765625, -0.003173828125, 0, 0.0211181640625, 0.00677490234375, -0.00860595703125, 0.0115966796875, -0.00579833984375, -0.007781982421875, -0.0026397705078125, 0.004...

[ 46741, 96, 271, 4210, 8335, 14, 2852, 120820, 105233, 22288, 370, 99726, 70541, 12478, 944, 27771, 62548, 124850, 68163, 177, 2203, 68330, 3630, 84068, 158240, 4452, 254, 144, 14612, 47, 8079, 18151, 7, 2684, 107, 864, 4448, 304, 391, 166...

[ 0.2349853515625, 0.00823974609375, 0.141845703125, 0.0045166015625, 0.148681640625, 0.1397705078125, 0.061004638671875, 0.1680908203125, 0.0989990234375, 0.2186279296875, 0.0938720703125, 0.2203369140625, 0.045684814453125, 0.192626953125, 0.139892578125, 0.04437255859375, 0.11437988...

embed

12218863_c0

12218863

haskell

0

Title: Slightly complex [String] -> [UTCTime] Problem title: Slightly complex [String] -> [UTCTime] Tags: haskell Problem: Slightly complex [String] -> [UTCTime] I have a list of strings, the strings are either a unixtime or an increment from that unixtime eg. listOfTimes :: [String] listOfTimes = ["u1345469400",...

Slightly complex [String] -> [UTCTime] Slightly complex [String] -> [UTCTime] haskell Slightly UTCTime u1345469400 u1346427334 Char Integer Slightly complex [String] -> [UTCTime] I have a list of strings, the strings are either a unixtime or an increment from that unixtime eg. I have written functions which take ...

[ -0.00445556640625, 0.0035247802734375, 0.00579833984375, -0.00469970703125, -0.00152587890625, 0.00494384765625, 0.01129150390625, -0.0167236328125, -0.000812530517578125, -0.0272216796875, 0.000301361083984375, -0.0185546875, 0.030517578125, 0.0252685546875, -0.0191650390625, -0.00173...

[ 159, 20016, 538, 27140, 71713, 214, 5386, 45962, 70059, 1556, 142508, 99577, 75, 2681, 4633, 169531, 10700, 160775, 3768, 124618, 21656, 44401, 33079, 87, 765, 5303, 111, 79315, 7, 40101, 51, 4084, 6032, 6, 158661, 1295, 30046, 59121, 32354...

[ 0.038665771484375, 0.2529296875, 0.1380615234375, 0.283203125, 0.1375732421875, 0.049224853515625, 0.1318359375, 0.200439453125, 0.25732421875, 0.1446533203125, 0.258544921875, 0.1719970703125, 0.08056640625, 0.0587158203125, 0.1290283203125, 0.127685546875, 0.1522216796875, 0.0844...

embed

38160099_c0

38160099

haskell

0

Title: Haskell sorting Map (via List) won't work Problem title: Haskell sorting Map (via List) won't work Tags: haskell, sorting Problem: Haskell sorting Map (via List) won't work I already read a lot of question and answers to the topic, but I can't find my mistake. Hope someone of you can help me out. My sc...

Haskell sorting Map (via List) won't work Haskell sorting Map (via List) won't work haskell sorting Haskell Map List Integer Map.empty Map.toList Map.fromList Data.List.sortBy Map.insert Ord Ordering Haskell sorting Map (via List) won't work I already read a lot of question and answers to the topic, but I can...

[ 0.00121307373046875, -0.0027008056640625, 0.006256103515625, -0.015380859375, -0.032958984375, -0.00156402587890625, -0.0010223388671875, -0.01025390625, 0.003021240234375, 0.01708984375, 0.0277099609375, 0.01385498046875, -0.00628662109375, 0.00457763671875, 0.00189208984375, -0.01098...

[ 20625, 142508, 12096, 214, 42719, 3459, 32036, 23742, 3768, 18, 4488, 1556, 44401, 33548, 188, 154663, 161063, 62351, 75358, 73, 33657, 35379, 81206, 5915, 121742, 75359, 4358, 106117, 20779, 5303, 3395, 41170, 1810, 40907, 10588, 167375, 19336...

[ 0.1435546875, 0.2445068359375, 0.2052001953125, 0.0867919921875, 0.23681640625, 0.164306640625, 0.224365234375, 0.091552734375, 0.07122802734375, 0.10205078125, 0.143310546875, 0.1368408203125, 0.1253662109375, 0.104248046875, 0.08721923828125, 0.1263427734375, 0.050933837890625, 0...

embed

31488861_c0

31488861

haskell

0

Title: Re-export qualified - how to solve it nowadays, any solution? Problem title: Re-export qualified - how to solve it nowadays, any solution? Tags: module, haskell Problem: Re-export qualified - how to solve it nowadays, any solution? I have exactly the same issue as described in this question Re-export qualified? ...

Re-export qualified - how to solve it nowadays, any solution? Re-export qualified - how to solve it nowadays, any solution? module haskell Foo.A Foo.B Re-export Foo Re-export qualified - how to solve it nowadays, any solution? I have exactly the same issue as described in this question Re-export qualified? It was asked...

[ -0.00396728515625, -0.00787353515625, 0.0086669921875, 0.0252685546875, 0.0042724609375, 0.004241943359375, 0.00171661376953125, -0.000537872314453125, -0.004180908203125, 0.02294921875, -0.005645751953125, 0.0169677734375, 0.0196533203125, 0.013671875, 0.001220703125, -0.01513671875, ...

[ 853, 9, 180758, 217225, 3642, 47, 86869, 442, 134523, 5636, 2499, 29806, 88996, 1556, 142508, 9572, 31, 284, 571, 66161, 31089, 37170, 190, 5369, 6650, 13648, 65572, 16792, 16916, 18226, 7, 166996, 449, 161521, 831, 87794, 32354, 5775, 1263...

[ 0.203125, 0.054901123046875, 0.2939453125, 0.253662109375, 0.075439453125, 0.04022216796875, 0.1796875, 0.112548828125, 0.1072998046875, 0.1124267578125, 0.05975341796875, 0.13330078125, 0.1639404296875, 0.13427734375, 0.22998046875, 0.2042236328125, 0.147705078125, 0.080810546875,...

embed

59944028_c0

59944028

haskell

0

Title: How to define Show for heterogenous lists in Haskell Problem title: How to define Show for heterogenous lists in Haskell Tags: gadt, haskell Problem: How to define Show for heterogenous lists in Haskell I'm researching into what Haskell can offer on it's way to dependent types by reading Thinking with types . He...

How to define Show for heterogenous lists in Haskell How to define Show for heterogenous lists in Haskell gadt haskell ys How Show Haskell Thinking HList Type HNil Ord Occurs ts2 Expected Char Actual ts1 Relevant Lib.hs:43:25 Lib.hs:43:20 How to define Show for heterogenous lists in Haskell I'm researching into what Ha...

[ -0.0140380859375, -0.00811767578125, 0.00445556640625, -0.0076904296875, -0.0074462890625, -0.006011962890625, -0.00170135498046875, -0.01434326171875, 0.01904296875, 0.01251220703125, -0.027099609375, -0.04736328125, 0.0252685546875, 0.01263427734375, -0.00189208984375, 0.002349853515...

[ 61924, 17367, 100, 77099, 61065, 223, 5303, 20625, 142508, 914, 13384, 1556, 113, 87062, 572, 154663, 60457, 379, 35379, 48650, 61636, 304, 60075, 21656, 100582, 133, 127, 33210, 21224, 108750, 52895, 16454, 678, 225, 1357, 23749, 41072, 1849...

[ 0.1829833984375, 0.28076171875, 0.05926513671875, 0.1956787109375, 0.1859130859375, 0.050811767578125, 0.1876220703125, 0.1173095703125, 0.2056884765625, 0.0643310546875, 0.11767578125, 0.0997314453125, 0.0789794921875, 0.113525390625, 0.09942626953125, 0.2066650390625, 0.1328125, ...

embed

11195758_c0

11195758

haskell

0

Title: Haskell code formatting Problem title: Haskell code formatting Tags: haskell, coding-style Problem: Haskell code formatting Haskell have indentation based style for blocks. I know two styles but I can't decide what style is better. (Forgive me a really stupid example function) 1st - pretty: funcA :: Integer -> I...

Haskell code formatting Haskell code formatting haskell coding-style Haskell Integer Haskell code formatting Haskell have indentation based style for blocks. I know two styles but I can't decide what style is better. (Forgive me a really stupid example function) 1st - pretty: This style looks great, but it is very frag...

[ -0.002960205078125, -0.01080322265625, 0.0291748046875, 0.0194091796875, 0.00118255615234375, 0.0038604736328125, 0.015380859375, -0.000614166259765625, -0.003570556640625, 0.00921630859375, 0.00811767578125, -0.01361083984375, -0.01458740234375, -0.005950927734375, 0.0047607421875, -0...

[ 20625, 142508, 18151, 9384, 1916, 1556, 552, 6238, 40946, 44401, 765, 18597, 22062, 35509, 20623, 100, 46389, 7, 3714, 6626, 831, 28288, 2367, 11522, 6183, 110833, 27781, 32354, 271, 28875, 3293, 33342, 6782, 1284, 4552, 119371, 13, 456, 14...

[ 0.1522216796875, 0.2626953125, 0.2008056640625, 0.1915283203125, 0.03936767578125, 0.139892578125, 0.125732421875, 0.06390380859375, 0.2142333984375, 0.2022705078125, 0.046844482421875, 0.197021484375, 0.1834716796875, 0.165771484375, 0.2354736328125, 0.057098388671875, 0.20361328125...

embed

21206008_c0

21206008

haskell

0

Title: Installing vector pkg using cabal fails Problem title: Installing vector pkg using cabal fails Tags: haskell, cabal Problem: Installing vector pkg using cabal fails I try to install vector package using cabal install vector but it fails giving the error here: http://hastebin.com/miwunadefo.vbs My cabal version i...

Installing vector pkg using cabal fails Installing vector pkg using cabal fails haskell cabal cabal version Installing Glorious Glasgow Haskell Compilation System Configured Applications Xcode.app Contents Developer Apple LLVM clang-500.2.79 Target x86_64-apple-darwin12.5.0 Thread Installing vector pkg using cabal fail...

[ 0.008544921875, 0.0255126953125, 0.00347900390625, 0.007476806640625, -0.00119781494140625, -0.01177978515625, -0.0218505859375, -0.0184326171875, -0.0213623046875, -0.0012969970703125, -0.00921630859375, -0.045166015625, -0.006805419921875, -0.0033111572265625, -0.014892578125, 0.0222...

[ 107951, 173, 18770, 915, 8517, 17368, 109524, 35782, 1556, 142508, 11389, 46173, 93905, 181787, 20625, 15612, 14, 12353, 59994, 104921, 1193, 40899, 9007, 70870, 152774, 4129, 99954, 47599, 3066, 121993, 22377, 160017, 15276, 13307, 9494, 1530, ...

[ 0.1646728515625, 0.1920166015625, 0.2022705078125, 0.03094482421875, 0.1966552734375, 0.08447265625, 0.24951171875, 0.1763916015625, 0.089599609375, 0.2142333984375, 0.089111328125, 0.051605224609375, 0.0733642578125, 0.154052734375, 0.0904541015625, 0.075439453125, 0.0380859375, 0...

embed

30472022_c0

30472022

haskell

0

Title: find nth element from the last in a list using recursion Problem title: find nth element from the last in a list using recursion Tags: tail-recursion, recursion, haskell, c Problem: find nth element from the last in a list using recursion we can solve this problem in, say C, using a static variable, like in the ...

find nth element from the last in a list using recursion find nth element from the last in a list using recursion tail-recursion recursion haskell c the recursion NTH ELEM LAST STUFF find nth element from the last in a list using recursion we can solve this problem in, say C, using a static variable, like in the snippe...

[ -0.0155029296875, 0.02001953125, 0.00970458984375, -0.014892578125, 0.0135498046875, 0.0140380859375, 0.000766754150390625, 0.00128173828125, 0.01434326171875, -0.037841796875, 0.01519775390625, -0.0546875, -0.003387451171875, -0.00531005859375, 0.0106201171875, -0.008056640625, 0.01...

[ 7413, 653, 927, 12830, 1295, 70, 4568, 23, 5303, 17368, 195625, 1830, 46741, 107, 48650, 1556, 142508, 501, 541, 23415, 241, 100191, 172905, 94432, 30110, 10, 86869, 2967, 313, 201939, 77336, 32354, 11782, 9520, 156566, 20625, 29479, 123309, ...

[ 0.152587890625, 0.206298828125, 0.2261962890625, 0.237060546875, 0.1873779296875, 0.07958984375, 0.24267578125, 0.093505859375, 0.181396484375, 0.0992431640625, 0.234130859375, 0.1304931640625, 0.1982421875, 0.031524658203125, 0.15966796875, 0.0909423828125, 0.1939697265625, 0.0678...

embed

60999355_c0

60999355

haskell

0

Title: xml-conduit: How to Modify a Document? Problem title: xml-conduit: How to Modify a Document? Tags: xml-conduit, xml, haskell Problem: xml-conduit: How to Modify a Document? The xml-conduit tutorial (the only one in existence, and perhaps the only Haskell XML library with a tutorial) shows how to create or read a...

xml-conduit: How to Modify a Document? xml-conduit: How to Modify a Document? xml-conduit xml haskell How Modify Document Title Paragraph xml-conduit: How to Modify a Document? The xml-conduit tutorial (the only one in existence, and perhaps the only Haskell XML library with a tutorial) shows how to create or read an X...

[ -0.009765625, 0.0257568359375, 0.005218505859375, -0.005859375, 0.01116943359375, -0.0137939453125, -0.0194091796875, -0.01385498046875, 0.0185546875, -0.00750732421875, -0.004608154296875, -0.0208740234375, 0.00072479248046875, -0.003936767578125, 0.035400390625, -0.01220703125, -0....

[ 131492, 9, 2271, 112061, 12, 11249, 47, 16269, 40383, 43101, 10, 1556, 142508, 48962, 1720, 41382, 57143, 4734, 116311, 95134, 20625, 92537, 35773, 678, 45831, 3642, 28282, 707, 12301, 12937, 1284, 959, 2811, 1632, 3917, 16031, 6044, 41018, ...

[ 0.2435302734375, 0.0313720703125, 0.11376953125, 0.21826171875, 0.0161895751953125, 0.123291015625, 0.04595947265625, 0.20361328125, 0.193359375, 0.2286376953125, 0.013702392578125, 0.1201171875, 0.2071533203125, 0.1982421875, 0.1131591796875, 0.107177734375, 0.1873779296875, 0.078...

embed

1361307_c0

1361307

haskell

0

Title: Which Haskell XML library to use? Problem title: Which Haskell XML library to use? Tags: comparison, xml, haskell Problem: Which Haskell XML library to use? I see that there is a few of XML processing libraries in Haskell. HaXml seems to be the most popular (according to dons ) HXT seems to be the most advanced ...

Which Haskell XML library to use? Which Haskell XML library to use? comparison xml haskell Which Haskell XML Which Haskell XML library to use? I see that there is a few of XML processing libraries in Haskell. HaXml seems to be the most popular (according to dons ) HXT seems to be the most advanced (but also the most di...

[ -0.0023193359375, 0.0081787109375, 0.01422119140625, 0.005584716796875, 0.01055908203125, 0.00518798828125, -0.021240234375, -0.0004329681396484375, 0.0002079010009765625, 0.0218505859375, -0.000217437744140625, -0.05224609375, 0.01129150390625, -0.0009918212890625, -0.00677490234375, ...

[ 130078, 20625, 142508, 92537, 35773, 1294, 47, 4527, 225490, 131492, 1556, 10846, 9433, 214, 10484, 1391, 1542, 7237, 37202, 2684, 5700, 572, 70981, 175961, 34844, 30698, 45458, 118201, 62822, 366, 2189, 39456, 32997, 69141, 31, 2037, 7909, 2...

[ 0.092529296875, 0.161865234375, 0.24169921875, 0.28173828125, 0.2457275390625, 0.156005859375, 0.0546875, 0.1448974609375, 0.12255859375, 0.249755859375, 0.1343994140625, 0.02801513671875, 0.0806884765625, 0.0101318359375, 0.0924072265625, 0.14794921875, 0.1160888671875, 0.21752929...

embed

34514511_c0

34514511

haskell

0

Title: Understanding recursive lazy lists Problem title: Understanding recursive lazy lists Tags: haskell Problem: Understanding recursive lazy lists I'm trying to get comfortable with the following snippet from the Haskell wiki : primesPE = 2 : oddprimes where oddprimes = sieve [3,5..] 9 oddprimes sieve (x:xs) q ps@ ~...

Understanding recursive lazy lists Understanding recursive lazy lists haskell Understanding x:xs p:t y:ys Understanding recursive lazy lists I'm trying to get comfortable with the following snippet from the Haskell wiki : I'm getting tripped up on the recursive definition of oddprimes and the usage of minus on infinite...

[ -0.005950927734375, 0.03759765625, 0.022216796875, 0.01141357421875, 0.0128173828125, 0.011962890625, 0.01116943359375, 0.006134033203125, 0.026611328125, 0.005126953125, 0.0203857421875, 0.00106048583984375, 0.019775390625, 0.009033203125, 0.0037841796875, 0.010009765625, 0.02551269...

[ 9626, 144057, 195625, 5844, 21, 3285, 5303, 1556, 142508, 1022, 12, 425, 7, 915, 18, 4778, 104577, 20625, 34356, 80934, 70270, 114654, 127689, 26948, 54241, 32354, 20594, 221, 28219, 3642, 9969, 34759, 71924, 903, 18151, 11249, 14602, 959, ...

[ 0.0823974609375, 0.07635498046875, 0.1959228515625, 0.107421875, 0.1314697265625, 0.2030029296875, 0.1988525390625, 0.10693359375, 0.2281494140625, 0.007965087890625, 0.0139617919921875, 0.0333251953125, 0.0516357421875, 0.0254364013671875, 0.02960205078125, 0.07342529296875, 0.08654...

embed

35813257_c0

35813257

haskell

0

Title: Ambiguity of types in Haskell Problem title: Ambiguity of types in Haskell Tags: haskell Problem: Ambiguity of types in Haskell _foldr :: (a -> b -> b) -> b -> [a] -> b _foldr op z [] = z _foldr op z (x:xs) = x `op` _foldr op z xs Hi, let's consider above code. After: ghci> _foldr + 0 [1] I got error: No instanc...

Ambiguity of types in Haskell Ambiguity of types in Haskell haskell the Ambiguity Haskell _foldr x:xs Num Possible Note Double Defined GHC.Float Float Integral GHC.Real.Ratio GHC.Real Ambiguity of types in Haskell Hi, let's consider above code. After: I got error: Basically I understand what it means and I suppose that...

[ -0.01239013671875, -0.0147705078125, 0.00009298324584960938, -0.00107574462890625, -0.0106201171875, 0.00482177734375, -0.01287841796875, 0.0247802734375, -0.01025390625, 0.000591278076171875, -0.009521484375, -0.04296875, -0.00274658203125, 0.006317138671875, 0.003814697265625, 0.0013...

[ 10250, 12282, 2481, 111, 52895, 20625, 142508, 23, 1556, 42822, 42, 1022, 12, 425, 52782, 115861, 2661, 18622, 107172, 262, 5983, 527, 73265, 365, 38699, 204681, 68996, 1052, 28645, 16916, 36917, 18151, 24372, 18499, 12506, 87, 28219, 2367, ...

[ 0.1798095703125, 0.2142333984375, 0.0753173828125, 0.06243896484375, 0.21435546875, 0.157958984375, 0.2406005859375, 0.04827880859375, 0.146484375, 0.1170654296875, 0.04730224609375, 0.038299560546875, 0.0259552001953125, 0.0648193359375, 0.1085205078125, 0.1298828125, 0.029953002929...

embed

29950573_c0

29950573

haskell

0

Title: Type Inference in Haskell v. Scala Problem title: Type Inference in Haskell v. Scala Tags: type-inference, haskell, scala Problem: Type Inference in Haskell v. Scala Given the following code: Prelude> let f x = if (x) then 55 else "foo" Why does the compiler look for a Num [Char] ? <interactive>:2:23: No instanc...

Type Inference in Haskell v. Scala Type Inference in Haskell v. Scala type-inference haskell scala the scala.reflect.runtime.universe._ Type Inference Haskell Scala Prelude Num Char Any Boolean List res4 reflect.runtime.universe.Type Type Inference in Haskell v. Scala Given the following code: Why does the compiler loo...

[ 0.00885009765625, -0.002410888671875, 0.01043701171875, -0.0022430419921875, -0.00286865234375, 0.00518798828125, 0.01483154296875, 0.00072479248046875, 0.0037841796875, 0.01190185546875, 0.00592041015625, -0.0458984375, -0.003662109375, 0.00384521484375, 0.0174560546875, 0.00708007812...

[ 60457, 360, 69988, 20625, 142508, 81, 152653, 11, 13, 23, 10644, 73, 1556, 146232, 29087, 8996, 18, 16428, 6032, 49545, 1914, 822, 52782, 21656, 28541, 73783, 34677, 32036, 3332, 617, 44961, 196707, 44084, 9969, 34759, 6713, 100, 10, 84068,...

[ 0.264404296875, 0.1092529296875, 0.2418212890625, 0.1424560546875, 0.25439453125, 0.1383056640625, 0.2283935546875, 0.17724609375, 0.020477294921875, 0.022705078125, 0.208984375, 0.056365966796875, 0.1319580078125, 0.224853515625, 0.094482421875, 0.140625, 0.003936767578125, 0.0164...

embed

54428941_c0

54428941

haskell

0

Title: Haskell: applying flip twice (type of flip flip) Problem title: Haskell: applying flip twice (type of flip flip) Tags: function, haskell, functional-programming Problem: Haskell: applying flip twice (type of flip flip) I am learning Haskell along some basic functions. I was doing some exercises with Flip, which ...

Haskell: applying flip twice (type of flip flip) Haskell: applying flip twice (type of flip flip) function haskell functional-programming Haskell Haskell: applying flip twice (type of flip flip) I am learning Haskell along some basic functions. I was doing some exercises with Flip, which takes a function of two argumen...

[ 0.0255126953125, 0.01409912109375, 0.0169677734375, 0.01422119140625, 0.00927734375, 0.0302734375, -0.022705078125, -0.017822265625, 0.00127410888671875, 0.006805419921875, 0.01025390625, -0.01458740234375, -0.0084228515625, 0.00274658203125, 0.002685546875, 0.005767822265625, 0.0228...

[ 20625, 142508, 59911, 214, 147505, 186351, 50986, 12, 111, 32354, 1556, 123309, 28966, 52080, 33233, 62822, 81979, 160808, 51776, 6626, 10750, 151575, 16750, 33977, 26783, 12989, 2806, 765, 17569, 80934, 48398, 7311, 678, 171859, 12765, 237259, ...

[ 0.1002197265625, 0.226806640625, 0.129150390625, 0.03387451171875, 0.236572265625, 0.228759765625, 0.1680908203125, 0.0165863037109375, 0.036041259765625, 0.151611328125, 0.07843017578125, 0.1116943359375, 0.061431884765625, 0.042633056640625, 0.0237274169921875, 0.033447265625, 0.04...

embed

11358979_c0

11358979

haskell

0

Title: list permutations in haskell Problem title: list permutations in haskell Tags: haskell, list, permutation Problem: list permutations in haskell So I'm new to haskell and I've been playing with it for a while now. I want to get my function that outputs all list permutations to work. I have written 2 implementatio...

list permutations in haskell list permutations in haskell haskell list permutation Occurs Expected Actual list permutations in haskell So I'm new to haskell and I've been playing with it for a while now. I want to get my function that outputs all list permutations to work. I have written 2 implementations, one works we...

[ -0.00897216796875, 0.021484375, 0.0032501220703125, -0.006591796875, -0.011962890625, 0.0001544952392578125, -0.0244140625, -0.01226806640625, 0.010498046875, -0.0255126953125, 0.005157470703125, -0.0169677734375, 0.043212890625, 0.01019287109375, -0.02001953125, 0.00872802734375, 0....

[ 5303, 117, 14311, 21094, 23, 1556, 142508, 561, 22062, 180, 238, 48650, 60075, 13, 100582, 1061, 3525, 47, 75169, 678, 12960, 5036, 3444, 2046, 32354, 140992, 7, 756, 4488, 765, 59121, 116, 208124, 1632, 43240, 5299, 3789, 68772, 163, 184...

[ 0.210693359375, 0.13623046875, 0.2225341796875, 0.11962890625, 0.051971435546875, 0.1612548828125, 0.2418212890625, 0.1754150390625, 0.030181884765625, 0.051116943359375, 0.04449462890625, 0.1373291015625, 0.10693359375, 0.1260986328125, 0.1773681640625, 0.0156402587890625, 0.0519409...

embed

14322566_c0

14322566

haskell

0

Title: Expanding Repa array shapes Problem title: Expanding Repa array shapes Tags: repa, haskell Problem: Expanding Repa array shapes I'm writing a program that generates images, which I would like to bring into a Repa array. I'm currently using the type: data Colour = Colour Double Double Double to represent pixels, ...

Expanding Repa array shapes Expanding Repa array shapes repa haskell Expanding Repa Colour Double DIM1 Array R.fromListUnboxed DIM2 DIM3 Expanding Repa array shapes I'm writing a program that generates images, which I would like to bring into a Repa array. I'm currently using the type: to represent pixels, and I have a...

[ 0.0062255859375, 0.010009765625, -0.0289306640625, 0.0255126953125, -0.00616455078125, 0.01611328125, 0.006591796875, 0.004119873046875, 0.009033203125, -0.006744384765625, -0.00090789794921875, -0.017578125, 0.028076171875, -0.0050048828125, -0.018310546875, -0.01043701171875, -0.00...

[ 60075, 11, 33770, 33742, 10298, 53, 115700, 10958, 1556, 142508, 196431, 107172, 175546, 418, 69253, 627, 161063, 154663, 14256, 11728, 304, 363, 32562, 1528, 139392, 43079, 1884, 19095, 3934, 82424, 17368, 10644, 33636, 98009, 90837, 23, 13, ...

[ 0.1038818359375, 0.2081298828125, 0.1363525390625, 0.2108154296875, 0.1781005859375, 0.117431640625, 0.21875, 0.1790771484375, 0.1015625, 0.2362060546875, 0.1959228515625, 0.1744384765625, 0.15673828125, 0.068603515625, 0.1422119140625, 0.04571533203125, 0.045166015625, 0.068603515...

embed

49467487_c0

49467487

haskell

0

Title: How can I search all packages with hoogle via command line? Problem title: How can I search all packages with hoogle via command line? Tags: haskell, hoogle Problem: How can I search all packages with hoogle via command line? I've installed hoogle locally and have run hoogle generate . If I run hoogle maybeToEit...

How can I search all packages with hoogle via command line? How can I search all packages with hoogle via command line? haskell hoogle MonadError How Data.Either.Utils Maybe Either Monoid Network.Haskoin.Util How can I search all packages with hoogle via command line? I've installed hoogle locally and have run hoogle g...

[ -0.004791259765625, -0.0098876953125, -0.00173187255859375, 0.006622314453125, -0.00762939453125, 0.0308837890625, 0.00543212890625, -0.0286865234375, 0.001190185546875, -0.037353515625, 0.001708984375, -0.046875, 0.0233154296875, -0.0152587890625, -0.01611328125, -0.002532958984375, ...

[ 11249, 831, 87, 33938, 756, 98169, 7, 678, 28994, 133, 1829, 75101, 13315, 1556, 142508, 60331, 71, 18468, 31611, 11809, 9319, 106742, 7870, 83425, 77879, 532, 28997, 6495, 1579, 73, 3675, 20600, 4000, 11675, 139392, 4263, 51139, 7763, 3330...

[ 0.0625, 0.083251953125, 0.03143310546875, 0.26416015625, 0.1563720703125, 0.2283935546875, 0.0294647216796875, 0.1614990234375, 0.2216796875, 0.265625, 0.1103515625, 0.2081298828125, 0.16650390625, 0.1312255859375, 0.2109375, 0.111083984375, 0.0237884521484375, 0.037384033203125, ...

embed

77652471_c0

77652471

haskell

0

Title: The signature of a function that returns any instances of a particular class Problem title: The signature of a function that returns any instances of a particular class Tags: haskell Problem: The signature of a function that returns any instances of a particular class There are a class and an instance of the cla...

The signature of a function that returns any instances of a particular class The signature of a function that returns any instances of a particular class haskell break Vehicle Car Couldn Main.break jdoodle.hs:6:1-27 Relevant jdoodle.hs:7:1 The signature of a function that returns any instances of a particular class The...

[ -0.00183868408203125, -0.0093994140625, -0.00148773193359375, -0.00007867813110351562, -0.003875732421875, 0.009521484375, -0.000396728515625, -0.01422119140625, 0.01416015625, -0.037353515625, -0.029052734375, -0.03125, -0.01348876953125, 0.01190185546875, -0.0126953125, -0.0059509277...

[ 581, 138256, 111, 32354, 450, 30646, 7, 2499, 110527, 17311, 18507, 1556, 142508, 36356, 232362, 3980, 191147, 19, 12321, 70751, 1647, 55742, 133, 127, 910, 19721, 50994, 30624, 10, 136, 142, 1884, 61924, 55300, 5303, 3917, 831, 54, 442 ]

[ 0.05645751953125, 0.27197265625, 0.07080078125, 0.2197265625, 0.0472412109375, 0.192138671875, 0.04840087890625, 0.10693359375, 0.25634765625, 0.1580810546875, 0.2127685546875, 0.142333984375, 0.2467041015625, 0.262451171875, 0.256103515625, 0.2100830078125, 0.11083984375, 0.075927...

embed

9745539_c0

9745539

haskell

0

Title: How do I create Haskell functions that return functions? Problem title: How do I create Haskell functions that return functions? Tags: functional-programming, higher-order-functions, function, function-composition, haskell Problem: How do I create Haskell functions that return functions? I would like to create t...

How do I create Haskell functions that return functions? How do I create Haskell functions that return functions? functional-programming higher-order-functions function function-composition haskell How Haskell How do I create Haskell functions that return functions? I would like to create three Haskell functions: a , b...

[ 0.005828857421875, 0.00016117095947265625, 0.00958251953125, 0.0291748046875, 0.00933837890625, 0.004150390625, 0.006011962890625, -0.00811767578125, 0.00714111328125, -0.00162506103515625, -0.0096435546875, -0.00579833984375, -0.0040283203125, 0.021728515625, 0.01312255859375, -0.0096...

[ 11249, 87, 28282, 20625, 142508, 32354, 7, 450, 30646, 54, 123309, 28966, 77546, 80596, 137175, 277, 40322, 1556, 2806, 1884, 17262, 10, 876, 136, 501, 98423, 47, 765, 1632, 10750, 123166, 2174, 173915, 104851, 3789, 6626, 76556, 75935, 190...

[ 0.1025390625, 0.06585693359375, 0.2249755859375, 0.16552734375, 0.25146484375, 0.2337646484375, 0.10791015625, 0.08135986328125, 0.2393798828125, 0.05621337890625, 0.1497802734375, 0.06158447265625, 0.055419921875, 0.10491943359375, 0.1826171875, 0.04022216796875, 0.052978515625, 0...

embed

33217911_c0

33217911

haskell

0

Title: Stack: How can I use a multi-package dependency in `Setup.hs`? Problem title: Stack: How can I use a multi-package dependency in `Setup.hs`? Tags: haskell, cabal, haskell-stack Problem: Stack: How can I use a multi-package dependency in `Setup.hs`? I have a stack multi-package project where the "multi-package" i...

Stack: How can I use a multi-package dependency in `Setup.hs`? Stack: How can I use a multi-package dependency in `Setup.hs`? haskell cabal haskell-stack Stack How Setup.hs zip-conduit-0.2.2.2 nightly-2015-10-12 Custom Stack: How can I use a multi-package dependency in `Setup.hs`? I have a stack multi-package project w...

[ -0.008056640625, 0.0211181640625, 0.0031585693359375, 0.01544189453125, -0.0294189453125, 0.0234375, -0.0247802734375, 0.0008697509765625, 0.00677490234375, -0.0216064453125, -0.00982666015625, -0.03466796875, 0.0098876953125, 0.018798828125, 0.001495361328125, 0.0302734375, -0.02587...

[ 6512, 2594, 11249, 831, 4527, 6024, 29102, 4588, 42548, 27771, 23, 294, 126, 2037, 5, 127, 7, 1556, 142508, 109524, 590, 19943, 68330, 2271, 112061, 133684, 70147, 17431, 538, 44906, 52486, 1530, 130664, 177261, 13452, 144227, 77488, 11389, ...

[ 0.1458740234375, 0.118408203125, 0.049102783203125, 0.030670166015625, 0.1483154296875, 0.212890625, 0.2261962890625, 0.0986328125, 0.2353515625, 0.126220703125, 0.02337646484375, 0.10302734375, 0.1490478515625, 0.1705322265625, 0.010955810546875, 0.1435546875, 0.07623291015625, 0....

embed

12107124_c0

12107124

haskell

0

Title: Simulating existential quantification in function return types Problem title: Simulating existential quantification in function return types Tags: existential-type, return-type, haskell, gadt Problem: Simulating existential quantification in function return types Sometimes I come upon a need to return values of ...

Simulating existential quantification in function return types Simulating existential quantification in function return types existential-type return-type haskell gadt Simulating Show Vec Simulating existential quantification in function return types Sometimes I come upon a need to return values of an existentially qua...

[ 0.01141357421875, 0.013916015625, 0.0016632080078125, 0.0201416015625, 0.0011749267578125, -0.005615234375, -0.001983642578125, -0.014404296875, 0.006378173828125, -0.0201416015625, -0.006591796875, -0.027099609375, -0.0166015625, 0.0016937255859375, -0.003753662109375, 0.0023498535156...

[ 144814, 1916, 99707, 15403, 55230, 41274, 32354, 30646, 52895, 23, 50986, 1556, 142508, 914, 13384, 17367, 52884, 54799, 3871, 142424, 14, 25958, 47314, 10644, 96276, 2684, 27983, 20697, 68743, 5928, 33636, 168867, 40197, 53201, 151334, 17756, ...

[ 0.260009765625, 0.057098388671875, 0.214111328125, 0.121826171875, 0.2227783203125, 0.12939453125, 0.207275390625, 0.235107421875, 0.2071533203125, 0.0226898193359375, 0.17626953125, 0.1207275390625, 0.2139892578125, 0.06817626953125, 0.1534423828125, 0.1190185546875, 0.1656494140625...

embed

36106261_c1

36106261

haskell

1

x) = Typed <$> x .: "id" <*> x .: "name" instance FromJSON Day where parseJSON (Object x) = Day <$> x .: "orderCount" <*> x .: "lowPrice" <*> x .: "highPrice" <*> x .: "avgPrice" <*> x .: "volume" <*> x .: "date" And this is the current error I get No instance for (FromJSON a) arising from a use of ‘.:’ Possible fix: ...

[ 0.00003790855407714844, -0.00653076171875, -0.004180908203125, 0.015625, 0.005828857421875, 0.0159912109375, -0.0283203125, 0.0008697509765625, -0.00244140625, -0.02783203125, -0.005401611328125, 0.0007781982421875, 0.00848388671875, -0.004547119140625, -0.0028076171875, -0.01519775390...

[ 1022, 16, 2203, 60457, 71, 4369, 532, 1639, 11627, 110527, 28090, 1375, 58627, 10013, 366, 184, 46471, 75161, 80596, 108210, 17336, 33163, 329, 84396, 3818, 177, 23232, 282, 17489, 43581, 18499, 87, 2046, 438, 100, 168407, 10, 187, 72219, ...

[ 0.1590576171875, 0.057861328125, 0.0850830078125, 0.224365234375, 0.05426025390625, 0.1279296875, 0.06646728515625, 0.113037109375, 0.080810546875, 0.306884765625, 0.2125244140625, 0.13330078125, 0.219482421875, 0.1695556640625, 0.0755615234375, 0.007659912109375, 0.0455322265625, ...

embed

16090101_c0

16090101

haskell

0

Title: How to define 'special' behavior for composite function in `.hs` file? Problem title: How to define 'special' behavior for composite function in `.hs` file? Tags: haskell Problem: How to define 'special' behavior for composite function in `.hs` file? Composition is very normal in Haskell, but...

How to define 'special' behavior for composite function in `.hs` file? How to define 'special' behavior for composite function in `.hs` file? haskell How Prelude Ambiguous Main me.hs:1:8 me.hs:1:1 GHC.Base How to define 'special' behavior for composite function in `.hs` file? Composition is very nor...

[ -0.0167236328125, -0.01336669921875, 0.00164031982421875, -0.0029449462890625, 0.017578125, 0.0096435546875, 0.00579833984375, -0.0079345703125, 0.0029449462890625, 0.00897216796875, -0.01348876953125, 0.01336669921875, -0.0068359375, -0.006195068359375, 0.0091552734375, 0.007202148437...

[ 61924, 3768, 146981, 123166, 375, 77087, 32354, 5, 127, 7, 11435, 13, 1556, 142508, 11249, 1914, 822, 112, 10250, 12282, 10821, 12321, 163, 19721, 1019, 527, 73265, 63473, 100, 23, 3288, 40322, 4552, 3638, 20625, 3714, 831, 5361, 16750, 2...

[ 0.1788330078125, 0.059356689453125, 0.2181396484375, 0.2091064453125, 0.098876953125, 0.2156982421875, 0.16259765625, 0.0140838623046875, 0.1236572265625, 0.1334228515625, 0.135009765625, 0.009857177734375, 0.0899658203125, 0.2301025390625, 0.017791748046875, 0.0626220703125, 0.14868...

embed

20470323_c0

20470323

haskell

0

Title: Dealing with Maybe Bool values Problem title: Dealing with Maybe Bool values Tags: option-type, haskell, monads Problem: Dealing with Maybe Bool values Let us say, I have two Maybe Bool value and I want to achieve the following functionality: If both are Just values, I want to perform an || between them the valu...

Dealing with Maybe Bool values Dealing with Maybe Bool values option-type haskell monads Dealing Maybe Bool Just Nothing liftM2 Dealing with Maybe Bool values Let us say, I have two Maybe Bool value and I want to achieve the following functionality: If both are Just values, I want to perform an || between them the valu...

[ 0.0098876953125, 0.01239013671875, 0.00775146484375, 0.0019073486328125, 0.0140380859375, 0.01904296875, 0.00970458984375, -0.0279541015625, 0.004119873046875, -0.00250244140625, 0.0033721923828125, 0.00885009765625, 0.002960205078125, 0.002227783203125, -0.0015106201171875, -0.0010528...

[ 90943, 214, 678, 83425, 2460, 929, 142424, 35829, 50986, 1556, 142508, 2667, 712, 9563, 182747, 60520, 594, 304, 6626, 34292, 3444, 69307, 123309, 15044, 51339, 17721, 2856, 4263, 3789, 237, 140992, 22225, 184, 103510, 14858, 7722, 4527, 11, ...

[ 0.1959228515625, 0.035888671875, 0.1019287109375, 0.2318115234375, 0.1287841796875, 0.210693359375, 0.214599609375, 0.15625, 0.054931640625, 0.098876953125, 0.2259521484375, 0.108154296875, 0.10888671875, 0.1480712890625, 0.1829833984375, 0.2158203125, 0.1322021484375, 0.177734375,...

embed

73896303_c0

73896303

haskell

0

Title: Parse error on input ‘->’ in 'case of' statement in Haskell Problem title: Parse error on input ‘->’ in 'case of' statement in Haskell Tags: syntax, haskell, compiler-errors Problem: Parse error on input ‘->’ in 'case of' statement in Haskell module SpaceAge (Planet(..), ageOn) where da...

Parse error on input ‘->’ in 'case of' statement in Haskell Parse error on input ‘->’ in 'case of' statement in Haskell syntax haskell compiler-errors Parse Haskell SpaceAge Planet Mercury Venus Earth Mars Jupiter Saturn Uranus Neptune Float Parse error on input ‘->’ in 'case of' statement in ...

[ 0.0036468505859375, 0.0216064453125, -0.0267333984375, -0.0054931640625, 0.00360107421875, -0.004058837890625, -0.00921630859375, 0.00408935546875, -0.000568389892578125, -0.0223388671875, -0.01214599609375, -0.0064697265625, 0.0194091796875, -0.01141357421875, -0.002166748046875, 0.00...

[ 2392, 184, 18499, 107730, 9, 1230, 5386, 3768, 58437, 111, 63805, 20625, 142508, 86531, 1556, 9969, 34759, 188800, 43045, 429, 40357, 123106, 133484, 64883, 23342, 145255, 118651, 4143, 66, 199204, 38699, 257, 103607, 23, 35378, 1340, 70, 369...

[ 0.1636962890625, 0.10107421875, 0.18115234375, 0.15673828125, 0.117431640625, 0.07476806640625, 0.18505859375, 0.14794921875, 0.228515625, 0.25634765625, 0.1947021484375, 0.15869140625, 0.260498046875, 0.0308685302734375, 0.126220703125, 0.130615234375, 0.0784912109375, 0.154418945...

embed

29729412_c1

29729412

haskell

1

"Issue with package configuration\n" ++ show e Right (pkgDesc, _) -> print (dumpPackageDescription pkgDesc cabalFile) The problem is that the fourth parameter, buildCompilerId changed type from CompilerId to CompilerInfo . What I have implemented---though I would be happy to consider a more self-contained option---is ...

[ -0.0120849609375, -0.007110595703125, -0.00225830078125, -0.001739501953125, -0.01507568359375, 0.0244140625, -0.0128173828125, -0.00168609619140625, -0.000705718994140625, 0.0240478515625, 0.00127410888671875, -0.035888671875, -0.00372314453125, -0.0166015625, -0.0019073486328125, -0....

[ 54607, 13, 678, 98169, 180346, 37223, 7639, 28, 90911, 8517, 397, 6964, 28412, 693, 2676, 205956, 4657, 59478, 109524, 174350, 2967, 22759, 927, 171859, 45367, 108161, 34759, 568, 71, 98816, 10644, 1295, 15612, 47, 93147, 29479, 15970, 98102,...

[ 0.116455078125, 0.01025390625, 0.0855712890625, 0.2117919921875, 0.235595703125, 0.04437255859375, 0.0235748291015625, 0.03997802734375, 0.0767822265625, 0.1610107421875, 0.07391357421875, 0.1309814453125, 0.1163330078125, 0.119873046875, 0.0992431640625, 0.151611328125, 0.0665283203...

embed

10253474_c0

10253474

haskell

0

Title: Inject a function into a Java .class file using Haskell Problem title: Inject a function into a Java .class file using Haskell Tags: haskell, code-injection, bytecode, java Problem: Inject a function into a Java .class file using Haskell I have written a Java bytecode parser using Haskell, and it works just fine...

Inject a function into a Java .class file using Haskell Inject a function into a Java .class file using Haskell haskell code-injection bytecode java Haskell Inject Java System.out.println Inject a function into a Java .class file using Haskell I have written a Java bytecode parser using Haskell, and it works just fine....

[ 0.000518798828125, 0.01300048828125, 0.01043701171875, 0.0322265625, 0.006988525390625, 0.0252685546875, -0.0130615234375, -0.0002498626708984375, -0.015625, -0.03173828125, -0.0042724609375, -0.033935546875, -0.0311279296875, 0.00909423828125, 0.0062255859375, 0.023193359375, 0.0122...

[ 360, 75161, 32354, 3934, 41925, 5, 67413, 11435, 17368, 20625, 142508, 1556, 18151, 73, 236, 390, 67, 40899, 79, 330, 12353, 6056, 35662, 141, 59121, 366, 2189, 43240, 5885, 33306, 11737, 29954, 163, 64557, 48708, 1528, 27117, 2811, 40383, ...

[ 0.09197998046875, 0.255126953125, 0.1923828125, 0.1441650390625, 0.2373046875, 0.08154296875, 0.2401123046875, 0.165771484375, 0.05328369140625, 0.1588134765625, 0.2471923828125, 0.1544189453125, 0.0994873046875, 0.036956787109375, 0.1446533203125, 0.0987548828125, 0.1177978515625, ...

embed

27797157_c0

27797157

haskell

0

Title: Avoiding orphan typeable instances Problem title: Avoiding orphan typeable instances Tags: haskell Problem: Avoiding orphan typeable instances It seems that data types promoted by DataKinds do not automatically get typeable instances. It is quite easy solve this by using StandaloneDeriving but this creates orpha...

Avoiding orphan typeable instances Avoiding orphan typeable instances haskell Data.Typeable Avoiding DataKinds StandaloneDeriving LANGUAGE DeriveDataTypeable PolyKinds Orphan Typeable Compiling orphan.hs orphan.hs:10:1 Warning orphan.hs:11:1 Avoiding orphan typeable instances It seems that data types promoted by DataKi...

[ 0.0057373046875, -0.01483154296875, -0.00634765625, -0.017822265625, -0.006591796875, 0.01153564453125, 0.018798828125, 0.0152587890625, 0.004730224609375, -0.056396484375, -0.028564453125, -0.00970458984375, 0.00970458984375, 0.0034942626953125, -0.0103759765625, -0.00885009765625, ...

[ 84361, 86675, 707, 68743, 10644, 2886, 110527, 1556, 142508, 11809, 196707, 605, 7250, 32487, 11, 51684, 47731, 6496, 98064, 1310, 5844, 137989, 63306, 3347, 60457, 15612, 49725, 127, 15110, 19721, 5550, 19993, 37202, 2053, 52895, 125568, 959, ...

[ 0.1976318359375, 0.026153564453125, 0.1319580078125, 0.2276611328125, 0.209716796875, 0.1898193359375, 0.205810546875, 0.09173583984375, 0.193603515625, 0.107177734375, 0.202880859375, 0.041046142578125, 0.19970703125, 0.10107421875, 0.037384033203125, 0.132568359375, 0.0848388671875...

embed

74433034_c0

74433034

haskell

0

Title: Haskell's do syntax and its pattern matching behaviour Problem title: Haskell's do syntax and its pattern matching behaviour Tags: functional-programming, do-notation, haskell, state, types Problem: Haskell's do syntax and its pattern matching behaviour I am currently trying to understand the do notati...

Haskell's do syntax and its pattern matching behaviour Haskell's do syntax and its pattern matching behaviour functional-programming do-notation haskell state types Haskell Stack a:stack x:xs turnipStack2 Haskell's do syntax and its pattern matching behaviour I am currently trying to understand the do notatio...

[ -0.0107421875, 0.0076904296875, -0.003173828125, 0.0013427734375, -0.0179443359375, 0.015625, -0.01123046875, -0.006500244140625, 0.0267333984375, -0.026123046875, 0.01153564453125, -0.00238037109375, -0.01513671875, -0.0164794921875, 0.009521484375, -0.0024566650390625, -0.008483886...

[ 20625, 142508, 3768, 54, 6002, 86531, 103510, 14858, 224833, 123309, 28966, 157, 22062, 1556, 11341, 52895, 6512, 2594, 10, 590, 1022, 425, 15504, 3442, 42378, 304, 31577, 28219, 110, 189924, 796, 7232, 7, 2242, 87039, 6468, 17678, 190659, ...

[ 0.1181640625, 0.2353515625, 0.059356689453125, 0.2037353515625, 0.1396484375, 0.200439453125, 0.1510009765625, 0.1502685546875, 0.124267578125, 0.1336669921875, 0.0936279296875, 0.1480712890625, 0.0880126953125, 0.103515625, 0.1080322265625, 0.1177978515625, 0.0628662109375, 0.0403...

embed

43302874_c0

43302874

haskell

0

Title: Natural Logarithm using series in Haskell Gives Imprecise Results Problem title: Natural Logarithm using series in Haskell Gives Imprecise Results Tags: haskell, math, libm Problem: Natural Logarithm using series in Haskell Gives Imprecise Results So I wrote two functions to calculate natural logarithm of variab...

Natural Logarithm using series in Haskell Gives Imprecise Results Natural Logarithm using series in Haskell Gives Imprecise Results haskell math libm series Natural Logarithm Haskell Gives Imprecise Results Float x-1 i-1 lnOfx2 Natural Logarithm using series in Haskell Gives Imprecise Results So I wrote two functions t...

[ 0.00994873046875, 0.0299072265625, 0.016845703125, 0.0078125, 0.00823974609375, 0.01483154296875, 0.0145263671875, -0.0029754638671875, 0.0162353515625, -0.00469970703125, 0.0159912109375, 0.0030670166015625, 0.0184326171875, -0.0194091796875, 0.0294189453125, 0.01312255859375, 0.007...

[ 24955, 13146, 87302, 18337, 17368, 36549, 20625, 142508, 77878, 3370, 51606, 184, 146104, 1556, 48909, 25474, 39, 38699, 1022, 5759, 17, 132887, 425, 304, 54397, 6626, 32354, 74481, 6083, 459, 1970, 8962, 111, 77336, 118055, 1407, 99091, 1453...

[ 0.2059326171875, 0.1405029296875, 0.167724609375, 0.0789794921875, 0.058380126953125, 0.2066650390625, 0.1312255859375, 0.248779296875, 0.050079345703125, 0.09033203125, 0.1910400390625, 0.1160888671875, 0.143310546875, 0.109130859375, 0.05816650390625, 0.0994873046875, 0.08776855468...

embed

8903342_c0

8903342

haskell

0

Title: Should Events be externally mutable? Problem title: Should Events be externally mutable? Tags: functional-programming, frp, scala, haskell, programming-languages Problem: Should Events be externally mutable? I am playing around with FRP and was wondering about how the act of an Event 'occurring' should be handle...

Should Events be externally mutable? Should Events be externally mutable? functional-programming frp scala haskell programming-languages Should Events event.occur Should Events be externally mutable? I am playing around with FRP and was wondering about how the act of an Event 'occurring' should be handled publicly. By ...

[ 0.0198974609375, 0.00150299072265625, 0.015869140625, -0.0181884765625, 0.0016937255859375, -0.0120849609375, 0.00179290771484375, 0.0135498046875, -0.00738525390625, -0.042236328125, -0.00848388671875, 0.018798828125, -0.00958251953125, 0.02197265625, 0.0146484375, -0.00830078125, -...

[ 151117, 123560, 186, 173591, 538, 842, 22819, 123309, 28966, 14119, 254, 146232, 1556, 142508, 56037, 196651, 19732, 6652, 16820, 75169, 10932, 563, 38796, 27992, 111, 36943, 64240, 214, 5608, 34831, 3835, 77848, 19048, 25632, 28032, 43701, 830...

[ 0.120361328125, 0.28125, 0.042327880859375, 0.2381591796875, 0.06744384765625, 0.20166015625, 0.211181640625, 0.1240234375, 0.122314453125, 0.056396484375, 0.0816650390625, 0.150390625, 0.10479736328125, 0.1966552734375, 0.107177734375, 0.0814208984375, 0.2318115234375, 0.143676757...

embed

54871937_c0

54871937

haskell

0

Title: Is there any way to force Haskell code ordering to work like F#? Problem title: Is there any way to force Haskell code ordering to work like F#? Tags: f%23, haskell Problem: Is there any way to force Haskell code ordering to work like F#? I am currently learning me a Haskell , so for so good. I am pretty fluent ...

Is there any way to force Haskell code ordering to work like F#? Is there any way to force Haskell code ordering to work like F#? f%23 haskell Haskell Is there any way to force Haskell code ordering to work like F#? I am currently learning me a Haskell , so for so good. I am pretty fluent when it comes to F# and I want...

[ 0.0225830078125, 0.0086669921875, 0.0037994384765625, -0.004058837890625, 0.0002460479736328125, -0.001251220703125, 0.0010833740234375, -0.018798828125, -0.0020751953125, -0.01416015625, -0.018798828125, -0.0146484375, 0.000621795654296875, -0.0126953125, -0.004638671875, 0.0013809204...

[ 2071, 2499, 3917, 37772, 20625, 142508, 18151, 12989, 214, 47, 4488, 1884, 563, 4904, 2685, 1238, 3949, 3742, 1556, 82424, 52080, 100, 4127, 28875, 155283, 3444, 9790, 3535, 34166, 123309, 56037, 66139, 11343, 111, 26866, 831, 11782, 32354, ...

[ 0.013092041015625, 0.05865478515625, 0.093505859375, 0.19921875, 0.115966796875, 0.20751953125, 0.178955078125, 0.2230224609375, 0.078857421875, 0.04888916015625, 0.1202392578125, 0.12060546875, 0.131591796875, 0.1973876953125, 0.0168304443359375, 0.0731201171875, 0.0311279296875, ...

embed

12592464_c0

12592464

haskell

0

Title: Haskell: Why does GHC not infer type in this typeclass with fundeps? Problem title: Haskell: Why does GHC not infer type in this typeclass with fundeps? Tags: typeclass, haskell, functional-dependencies Problem: Haskell: Why does GHC not infer type in this typeclass with fundeps? I'm trying to use typeclasses an...

Haskell: Why does GHC not infer type in this typeclass with fundeps? Haskell: Why does GHC not infer type in this typeclass with fundeps? typeclass haskell functional-dependencies the Haskell Why GHC Cont LANGUAGE KindSignatures FunctionalDependencies FlexibleInstances FlexibleContexts TestData TypeConv Lift Test.hs:13...

[ 0.007568359375, -0.011474609375, 0.00872802734375, 0.009765625, 0.00008440017700195312, 0.007415771484375, -0.006256103515625, -0.00933837890625, -0.005218505859375, 0.01287841796875, -0.002716064453125, -0.0255126953125, -0.00372314453125, 0.0245361328125, 0.0130615234375, -0.01501464...

[ 20625, 142508, 44084, 527, 73265, 959, 53498, 10644, 903, 67413, 678, 9458, 4517, 1556, 123309, 105254, 13, 1657, 18, 98064, 27435, 218723, 26885, 180842, 2661, 116071, 22829, 8647, 60457, 11935, 334, 166562, 28194, 191147, 9312, 22618, 758, ...

[ 0.0946044921875, 0.2088623046875, 0.10064697265625, 0.08233642578125, 0.175537109375, 0.1004638671875, 0.2152099609375, 0.21728515625, 0.051910400390625, 0.1751708984375, 0.06097412109375, 0.0810546875, 0.11962890625, 0.064697265625, 0.086181640625, 0.0672607421875, 0.00579833984375,...

embed

17494206_c0

17494206

haskell

0

Title: Binary tree monad implementation Problem title: Binary tree monad implementation Tags: monads, binary-tree, haskell Problem: Binary tree monad implementation I have difficulties to understand how to correctly implement the (>>=) for the monad of binary tree. I have the following binary tree : data BinTree a = Le...

Binary tree monad implementation Binary tree monad implementation monads binary-tree haskell Binary BinTree Leaf Node Ord Show Read __________ Couldn test.hs:153:5 Binary tree monad implementation I have difficulties to understand how to correctly implement the (>>=) for the monad of binary tree. I have the following b...

[ -0.006195068359375, -0.004486083984375, 0.01287841796875, -0.012939453125, 0.028564453125, 0.00762939453125, -0.01544189453125, -0.0186767578125, -0.00191497802734375, -0.035888671875, -0.005889892578125, -0.025634765625, 0.0017242431640625, 0.0024566650390625, 0.0166015625, -0.0087280...

[ 54092, 1294, 53201, 2667, 712, 208124, 2394, 6635, 62600, 1556, 142508, 16666, 62731, 636, 2407, 438, 112, 35379, 17367, 4764, 191147, 3034, 152830, 758, 34844, 28219, 3642, 26785, 29479, 70, 30813, 1369, 100, 765, 25632, 11853, 39933, 13695,...

[ 0.1939697265625, 0.07257080078125, 0.2091064453125, 0.1358642578125, 0.1973876953125, 0.1761474609375, 0.1690673828125, 0.1412353515625, 0.195556640625, 0.08612060546875, 0.2181396484375, 0.1005859375, 0.1815185546875, 0.0179901123046875, 0.1898193359375, 0.07061767578125, 0.06689453...

embed

52763829_c1

52763829

haskell

1

avantage.co/query?function=GLOBAL_QUOTE&symbol=MSFT&apikey=demo" getRequest_ :: HStream ty => String -> Request ty getRequest_ s = let Just u = parseURI s in defaultGETRequest_ u jsonReq = getRequest_ jsonURL data Quote = Quote {quote :: String, symbol :: String, open :: Float, high :: Float, low :: Float, price :: Flo...

[ -0.01031494140625, 0.04736328125, -0.000293731689453125, -0.01275634765625, -0.004913330078125, -0.00396728515625, 0.004486083984375, -0.017822265625, -0.0042724609375, -0.0245361328125, 0.00799560546875, -0.03125, -0.0211181640625, 0.000446319580078125, -0.005157470703125, 0.013122558...

[ 137884, 587, 944, 1294, 137175, 724, 17014, 94943, 232856, 176726, 13439, 25217, 40897, 19770, 80750, 2046, 4332, 75616, 572, 115061, 2281, 23351, 853, 91, 9563, 75, 366, 184, 46492, 114977, 79794, 1647, 1681, 864, 2203, 95538, 2053, 109216, ...

[ 0.335693359375, 0.1619873046875, 0.07177734375, 0.0699462890625, 0.1495361328125, 0.03662109375, 0.1199951171875, 0.113525390625, 0.28466796875, 0.209716796875, 0.059600830078125, 0.2098388671875, 0.03485107421875, 0.124267578125, 0.1671142578125, 0.0867919921875, 0.0933837890625, ...

embed

68807042_c0

68807042

haskell

0

Title: Grading partial orders (starting from topological sort) Problem title: Grading partial orders (starting from topological sort) Tags: partial-ordering, topological-sort, haskell Problem: Grading partial orders (starting from topological sort) This blog post discusses an interesting variation on topological sort: ...

Grading partial orders (starting from topological sort) Grading partial orders (starting from topological sort) partial-ordering topological-sort haskell topological Grading Grading partial orders (starting from topological sort) This blog post discusses an interesting variation on topological sort: http://jdh.hamkins....

[ 0.005950927734375, 0.029052734375, -0.006805419921875, -0.01141357421875, -0.005584716796875, 0.0026702880859375, -0.01361083984375, -0.023193359375, 0.006988525390625, -0.021240234375, -0.014404296875, -0.01385498046875, 0.0283203125, 0.00921630859375, -0.0250244140625, 0.003692626953...

[ 22453, 214, 2878, 289, 12989, 17137, 1295, 2663, 109622, 12096, 80596, 62351, 1556, 142508, 1415, 49041, 143834, 5471, 3915, 875, 2256, 8961, 5180, 4390, 15866, 192617, 6671, 1660, 1884, 40494, 39220, 95378, 5170, 831, 12008, 67919, 140992, 1...

[ 0.2239990234375, 0.1197509765625, 0.2059326171875, 0.1114501953125, 0.212158203125, 0.058746337890625, 0.0318603515625, 0.1544189453125, 0.1409912109375, 0.228271484375, 0.20263671875, 0.18701171875, 0.0816650390625, 0.237548828125, 0.0291900634765625, 0.060882568359375, 0.1529541015...

embed

30403468_c0

30403468

haskell

0

Title: How should I turn a record of options into a list of strings? Problem title: How should I turn a record of options into a list of strings? Tags: haskell Problem: How should I turn a record of options into a list of strings? I have a record of Options that I need to turn into command line arguments. For example: ...

How should I turn a record of options into a list of strings? How should I turn a record of options into a list of strings? haskell How Options Maybe Bool Just Nothing Output How should I turn a record of options into a list of strings? I have a record of Options that I need to turn into command line arguments. For exa...

[ -0.01177978515625, -0.0194091796875, 0.0009002685546875, -0.0052490234375, -0.00347900390625, 0.0133056640625, -0.01019287109375, -0.007293701171875, -0.0157470703125, 0.0189208984375, -0.0208740234375, -0.024658203125, -0.00101470947265625, 0.005401611328125, -0.01385498046875, 0.0024...

[ 11249, 5608, 15504, 17164, 111, 50717, 3934, 10, 5303, 79315, 7, 1556, 142508, 152448, 83425, 2460, 929, 9563, 182747, 13538, 3871, 75101, 13315, 10750, 86898, 4527, 32036, 60331, 71, 1284, 831, 18, 26366, 4488, 1672, 387, 12921, 8966, 442,...

[ 0.08447265625, 0.08648681640625, 0.125732421875, 0.20849609375, 0.09283447265625, 0.274658203125, 0.0926513671875, 0.052337646484375, 0.178955078125, 0.215576171875, 0.072265625, 0.111083984375, 0.2073974609375, 0.275634765625, 0.1102294921875, 0.0518798828125, 0.1346435546875, 0.0...

embed

17009729_c0

17009729

haskell

0

Title: Haskell component-by-component addition Problem title: Haskell component-by-component addition Tags: lambda, haskell Problem: Haskell component-by-component addition I am trying do to the component-by-component addition of a list of tuples with the use of higher functions. The result should be the (sum of the fi...

Haskell component-by-component addition Haskell component-by-component addition lambda haskell Haskell Num sumPw1 sumPw2 Couldn hs:42:1 Haskell component-by-component addition I am trying do to the component-by-component addition of a list of tuples with the use of higher functions. The result should be the (sum of the...

[ -0.010009765625, 0.0030517578125, 0.007354736328125, 0.01171875, -0.01123046875, 0.0147705078125, -0.005096435546875, 0.006683349609375, 0.018798828125, -0.04638671875, -0.0125732421875, -0.017822265625, 0.001312255859375, 0.020263671875, -0.004852294921875, -0.00946044921875, -0.009...

[ 20625, 142508, 82761, 1272, 277, 54137, 66044, 21, 6492, 85, 1556, 52782, 10554, 683, 434, 418, 304, 191147, 1096, 7, 33529, 19721, 31577, 54, 5303, 370, 99726, 4527, 77546, 32354, 16750, 5608, 11832, 111, 5117, 98, 17932, 25632, 18499, 3...

[ 0.14453125, 0.2529296875, 0.2342529296875, 0.156982421875, 0.0936279296875, 0.207275390625, 0.1998291015625, 0.105712890625, 0.2159423828125, 0.1605224609375, 0.1375732421875, 0.177734375, 0.222900390625, 0.0264892578125, 0.1077880859375, 0.0780029296875, 0.1243896484375, 0.1069335...

embed

23577437_c0

23577437

haskell

0

Title: Higher order Functors in scala Problem title: Higher order Functors in scala Tags: haskell, category-theory, scala Problem: Higher order Functors in scala So I've been trying to push my intuitions of functors to their limits by defining a higher order functor i.e. a, F that takes 1st order types as type argument...

Higher order Functors in scala Higher order Functors in scala haskell category-theory scala Higher Functors Functor1 Functor Higher order Functors in scala So I've been trying to push my intuitions of functors to their limits by defining a higher order functor i.e. a, F that takes 1st order types as type argument, and ...

[ 0.02001953125, -0.0201416015625, -0.0037078857421875, -0.018798828125, 0.00335693359375, -0.0179443359375, -0.0004711151123046875, -0.0238037109375, 0.01055908203125, -0.007659912109375, -0.01336669921875, -0.0179443359375, -0.003814697265625, -0.0091552734375, 0.01129150390625, -0.025...

[ 19694, 56, 12989, 28670, 18770, 23, 146232, 1556, 142508, 95487, 2347, 418, 31577, 25944, 58868, 7477, 17475, 13204, 77546, 10, 563, 51776, 106, 271, 52895, 10644, 10750, 32354, 136, 60520, 43701, 61924, 22288, 30057, 2661, 3638, 33022, 12765...

[ 0.1474609375, 0.067138671875, 0.213623046875, 0.1622314453125, 0.1865234375, 0.050537109375, 0.25732421875, 0.1231689453125, 0.2249755859375, 0.0931396484375, 0.0128173828125, 0.061126708984375, 0.02716064453125, 0.01934814453125, 0.0772705078125, 0.16748046875, 0.05804443359375, 0...

embed

37499658_c0

37499658

haskell

0

Title: Flexibility of the hierarchy of module sources allowed in cabal project Problem title: Flexibility of the hierarchy of module sources allowed in cabal project Tags: cabal, build, haskell, module, hierarchy Problem: Flexibility of the hierarchy of module sources allowed in cabal project I have a project with sour...

Flexibility of the hierarchy of module sources allowed in cabal project Flexibility of the hierarchy of module sources allowed in cabal project cabal build haskell module hierarchy Flexibility A.hs C.hs File B.C Flexibility of the hierarchy of module sources allowed in cabal project I have a project with source tree: T...

[ 0.000152587890625, 0.010986328125, -0.00177001953125, 0.02197265625, -0.004791259765625, -0.00689697265625, 0.000560760498046875, 0.007781982421875, 0.01263427734375, -0.019775390625, 0.00579833984375, -0.0419921875, 0.0177001953125, 0.0311279296875, -0.00089263916015625, -0.0208740234...

[ 180842, 83259, 1791, 147, 7668, 88996, 97264, 107003, 109524, 13452, 45367, 1556, 142508, 62, 127, 313, 5, 42724, 335, 441, 31344, 53201, 6626, 102158, 101637, 18151, 11435, 70541, 831, 72546, 14037, 186992, 1957, 110, 168487, 187136, 15400, ...

[ 0.228759765625, 0.123779296875, 0.1380615234375, 0.09442138671875, 0.0723876953125, 0.2227783203125, 0.1956787109375, 0.15185546875, 0.241455078125, 0.136962890625, 0.09912109375, 0.134521484375, 0.2171630859375, 0.0704345703125, 0.11376953125, 0.07647705078125, 0.033111572265625, ...

embed

51782384_c0

51782384

haskell

0

Title: Instance Eq is not working in Haskell Problem title: Instance Eq is not working in Haskell Tags: instance, haskell Problem: Instance Eq is not working in Haskell So I was given the following data type and I had to write a code that checks if an element is in the list (I think I did this one right). After this I ...

Instance Eq is not working in Haskell Instance Eq is not working in Haskell instance haskell ys Instance Haskell Amount x:xs Couldn Probeklausur1.hs:43:10-22 Relevant Probeklausur1.hs:44:27 Probeklausur1.hs:44:14 Bool Probeklausur1.hs:44:17 Probeklausur1.hs:44:49 Variable Perhaps Instance Eq is not working in Haskell S...

[ -0.0054931640625, 0.0245361328125, -0.00139617919921875, 0.01287841796875, -0.020263671875, 0.00714111328125, 0.00714111328125, 0.0128173828125, 0.0019378662109375, 0.030517578125, 0.00811767578125, 0.01953125, 0.000858306884765625, -0.0093994140625, -0.006195068359375, 0.0040588378906...

[ 360, 116071, 241, 864, 959, 20697, 23, 20625, 142508, 83, 110527, 1556, 113, 121147, 1022, 12, 425, 191147, 19, 1250, 372, 32689, 474, 127, 33210, 15110, 31043, 133, 30624, 32705, 27592, 2460, 929, 22950, 35167, 84572, 2886, 181799, 34475, ...

[ 0.0841064453125, 0.238525390625, 0.095458984375, 0.256103515625, 0.11474609375, 0.16650390625, 0.054351806640625, 0.1510009765625, 0.2340087890625, 0.01336669921875, 0.2413330078125, 0.128662109375, 0.11474609375, 0.1822509765625, 0.031707763671875, 0.0657958984375, 0.07366943359375,...

embed

53049055_c0

53049055

haskell

0

Title: Searching item in a table in haskell Problem title: Searching item in a table in haskell Tags: search, haskell, functional-programming, caesar-cipher Problem: Searching item in a table in haskell I am currently working in an exercise to make a caesar cipher, but for to finish that i need to find items in a table...

Searching item in a table in haskell Searching item in a table in haskell search haskell functional-programming caesar-cipher Searching Char Searching item in a table in haskell I am currently working in an exercise to make a caesar cipher, but for to finish that i need to find items in a table. It's a table which is o...

[ -0.0084228515625, -0.0004482269287109375, 0.012451171875, 0.0181884765625, 0.0101318359375, -0.0184326171875, 0.01409912109375, -0.01312255859375, -0.025634765625, 0.0035247802734375, 0.0216064453125, 0.0002593994140625, -0.01519775390625, 0.03662109375, -0.00958251953125, 0.0233154296...

[ 33086, 214, 35735, 23, 23180, 1556, 142508, 10, 33938, 123309, 28966, 377, 90, 147, 318, 94266, 21656, 82424, 20697, 81979, 1059, 67229, 3871, 7413, 55769, 5773, 3509, 47, 7108, 390, 138, 80854, 229231, 62816, 8337, 4420, 442, 80836, 16750,...

[ 0.173583984375, 0.035888671875, 0.1732177734375, 0.07025146484375, 0.2275390625, 0.1461181640625, 0.2247314453125, 0.0135498046875, 0.153564453125, 0.1258544921875, 0.10791015625, 0.03948974609375, 0.0673828125, 0.10186767578125, 0.02734375, 0.1810302734375, 0.1602783203125, 0.0208...

embed

26621677_c0

26621677

haskell

0

Title: How to extract an element from a tuple in haskell Problem title: How to extract an element from a tuple in haskell Tags: list, tuples, haskell Problem: How to extract an element from a tuple in haskell I have the following tuples: type Id = Int type Name = String type FSK = Int type Movie = (Id, Name, FSK) now I...

How to extract an element from a tuple in haskell How to extract an element from a tuple in haskell list tuples haskell a How Name FSK Movie Maybe Main Matrix Gladiator Nothing Just How to extract an element from a tuple in haskell I have the following tuples: now I want to define a function that extracts a movie from ...

[ 0.0032958984375, -0.002838134765625, 0.0150146484375, 0.00982666015625, 0.007720947265625, 0.0115966796875, -0.00872802734375, 0.00262451171875, 0.00482177734375, 0.007415771484375, 0.00141143798828125, -0.02099609375, -0.0177001953125, 0.0079345703125, -0.0155029296875, 0.007598876953...

[ 11249, 47, 125663, 12830, 1295, 370, 8705, 23, 1556, 142508, 142, 5303, 99726, 15757, 563, 10762, 10348, 83425, 12321, 194234, 90040, 14, 4597, 182747, 61924, 32354, 14277, 34475, 1884, 8337, 3447, 136, 83896, 997, 2174, 14037, 4958, 15490, ...

[ 0.07421875, 0.0148162841796875, 0.240966796875, 0.195068359375, 0.1138916015625, 0.134765625, 0.22705078125, 0.030303955078125, 0.169677734375, 0.2244873046875, 0.0103759765625, 0.1729736328125, 0.1673583984375, 0.048919677734375, 0.10247802734375, 0.179443359375, 0.13818359375, 0....

embed

76446785_c0

76446785

haskell

0

Title: Which kinds of lawfull `Functor`s are possible in Haskell? Problem title: Which kinds of lawfull `Functor`s are possible in Haskell? Tags: typeclass, haskell, functor, fixpoint-combinators, deriving Problem: Which kinds of lawfull `Functor`s are possible in Haskell? I know following types of Functor s: Polynomia...

Which kinds of lawfull `Functor`s are possible in Haskell? Which kinds of lawfull `Functor`s are possible in Haskell? typeclass haskell functor fixpoint-combinators deriving Which Functor Haskell Fix Some Data.Functor.Compose HFunctor Which kinds of lawfull `Functor`s are possible in Haskell? I know following types of ...

[ 0.00836181640625, -0.0047607421875, -0.0036773681640625, 0.00604248046875, -0.0004138946533203125, -0.0042724609375, -0.00933837890625, -0.012451171875, 0.0111083984375, 0.005523681640625, -0.01263427734375, -0.040283203125, 0.0159912109375, 0.00003838539123535156, -0.0146484375, 0.000...

[ 130078, 8562, 27165, 25724, 97249, 18770, 7722, 23, 20625, 142508, 10644, 67413, 1556, 7477, 30022, 38496, 19155, 22230, 16406, 28670, 96746, 11809, 10770, 78381, 572, 111, 9473, 3714, 25632, 52895, 91, 63306, 1687, 15403, 69112, 8781, 959, 8...

[ 0.03472900390625, 0.179443359375, 0.1815185546875, 0.1953125, 0.218994140625, 0.2274169921875, 0.1649169921875, 0.08984375, 0.164794921875, 0.2587890625, 0.118408203125, 0.1417236328125, 0.14599609375, 0.17822265625, 0.1522216796875, 0.1151123046875, 0.1243896484375, 0.072082519531...

embed

48921393_c0

48921393

haskell

0

Title: Fuse two input-files with haskell conduit library Problem title: Fuse two input-files with haskell conduit library Tags: conduit, haskell, streaming Problem: Fuse two input-files with haskell conduit library I'm trying to fuse two input files with conduit . file1.dat: META 1 META 2 META 3 TS 1 1 2 3 TS 2 3 4 5 f...

Fuse two input-files with haskell conduit library Fuse two input-files with haskell conduit library conduit haskell streaming Fuse META FilePath ConduitM Double Fuse two input-files with haskell conduit library I'm trying to fuse two input files with conduit . file1.dat: file2.dat: what I need is a function to source a...

[ 0.00677490234375, 0.01019287109375, -0.0027008056640625, 0.01226806640625, -0.004119873046875, 0.0103759765625, -0.00139617919921875, -0.00592041015625, 0.004058837890625, -0.00921630859375, -0.003326416015625, -0.0024871826171875, 0.0140380859375, 0.0263671875, 0.009033203125, 0.00156...

[ 7680, 184, 6626, 107730, 29822, 678, 1556, 142508, 120565, 35773, 65296, 276, 30967, 42724, 683, 10519, 1657, 112061, 594, 107172, 1294, 31577, 57574, 13, 102158, 11435, 418, 5164, 5442, 3871, 32354, 31344, 136, 17116, 5861, 23550, 10135, 425...

[ 0.255615234375, 0.141845703125, 0.1522216796875, 0.212890625, 0.1763916015625, 0.119140625, 0.147216796875, 0.214599609375, 0.242431640625, 0.1558837890625, 0.1923828125, 0.054046630859375, 0.1695556640625, 0.1220703125, 0.035247802734375, 0.1270751953125, 0.09722900390625, 0.14318...

embed

8717131_c0

8717131

haskell

0

Title: Can't find what's wrong with the types here Problem title: Can't find what's wrong with the types here Tags: haskell Problem: Can't find what's wrong with the types here i am working on an encryption algorithm and i have a type problem i don't understand what's the problem with the types here...

Can't find what's wrong with the types here Can't find what's wrong with the types here haskell Can Integer enchelper2 Couldn Type y:ys Can't find what's wrong with the types here i am working on an encryption algorithm and i have a type problem i don't understand what's the problem with the types h...

[ -0.0118408203125, -0.00885009765625, 0.004180908203125, -0.00015926361083984375, -0.014892578125, -0.006500244140625, -0.013671875, -0.0162353515625, 0.0089111328125, -0.0107421875, 0.0096435546875, 0.00494384765625, 0.025146484375, -0.000286102294921875, -0.0101318359375, -0.006500244...

[ 4171, 3768, 7413, 2367, 44691, 678, 52895, 3688, 1556, 142508, 44401, 22, 47515, 1264, 304, 191147, 60457, 113, 12, 4778, 20697, 136791, 234873, 10644, 2967, 28219, 169, 13415, 1022, 53, 125195, 97, 55300, 115081, 33548, 939, 5423, 151206, ...

[ 0.07879638671875, 0.04583740234375, 0.07550048828125, 0.0382080078125, 0.1422119140625, 0.06854248046875, 0.229736328125, 0.1103515625, 0.1025390625, 0.2105712890625, 0.1605224609375, 0.0771484375, 0.1669921875, 0.18017578125, 0.1571044921875, 0.08038330078125, 0.2017822265625, 0.1...

embed

68397699_c0

68397699

haskell

0

Title: Constraints and fundep resolution Problem title: Constraints and fundep resolution Tags: typeclass, type-constraints, haskell, ghc, functional-dependencies Problem: Constraints and fundep resolution I have a pair of classes, C1 and C2, with a fundep on C1, as follows: class C1 a b | a -> b class C2 a I declare a...

Constraints and fundep resolution Constraints and fundep resolution typeclass type-constraints haskell ghc functional-dependencies Constraints Constraints and fundep resolution I have a pair of classes, C1 and C2, with a fundep on C1, as follows: I declare an instance: When I declare another instance, I get an error: B...

[ 0.01287841796875, -0.00811767578125, 0.0048828125, -0.015869140625, -0.0028228759765625, 0.004486083984375, -0.01263427734375, -0.00860595703125, -0.00139617919921875, 0.0072021484375, -0.0159912109375, -0.010986328125, 0.00347900390625, 0.0169677734375, 0.007293701171875, -0.010498046...

[ 1657, 2816, 4288, 136, 9458, 4517, 158839, 10644, 67413, 2271, 1556, 142508, 31380, 238, 123309, 105254, 80836, 61112, 313, 418, 304, 98, 159978, 110527, 15700, 18499, 179140, 384, 29459, 100, 5584, 10, 7440, 876, 190358, 3789, 4989, 527, 7...

[ 0.077392578125, 0.1827392578125, 0.14208984375, 0.05218505859375, 0.1209716796875, 0.1680908203125, 0.21533203125, 0.1854248046875, 0.170166015625, 0.0689697265625, 0.0841064453125, 0.208740234375, 0.077880859375, 0.072265625, 0.09613037109375, 0.08392333984375, 0.1119384765625, 0....

embed

26082054_c0

26082054

haskell

0

Title: Haskell 2014.2 on Windows 7 64bit, "cabal update" fails and %APPDATA%\cabal\bin is missing Problem title: Haskell 2014.2 on Windows 7 64bit, "cabal update" fails and %APPDATA%\cabal\bin is missing Tags: cabal-install, haskell Problem: Haskell 2014.2 on Windows 7 64bit, "cabal update" fails an...

Haskell 2014.2 on Windows 7 64bit, "cabal update" fails and %APPDATA%\cabal\bin is missing Haskell 2014.2 on Windows 7 64bit, "cabal update" fails and %APPDATA%\cabal\bin is missing cabal-install haskell Haskell Windows APPDATA Haskell 2014.2 on Windows 7 64bit, "cabal update" fails and %APPDATA%\ca...

[ 0.0166015625, 0.0024261474609375, 0.0220947265625, 0.0128173828125, -0.010009765625, 0.0262451171875, -0.005828857421875, 0.007171630859375, 0.00927734375, 0.0260009765625, -0.01055908203125, -0.0281982421875, -0.011474609375, -0.01361083984375, 0.025146484375, -0.004150390625, 0.022...

[ 20625, 142508, 8432, 304, 3773, 361, 7911, 3137, 408, 3571, 28350, 35782, 1745, 40680, 397, 17758, 7568, 132283, 109524, 80383, 1556, 66440, 107419, 51347, 222495, 212059, 1049, 10756, 19138, 20600, 15644, 54825, 30438, 289, 1257, 56464, 31472,...

[ 0.1842041015625, 0.286376953125, 0.2220458984375, 0.1514892578125, 0.126953125, 0.1488037109375, 0.15771484375, 0.1083984375, 0.1317138671875, 0.2283935546875, 0.1820068359375, 0.171875, 0.008575439453125, 0.17138671875, 0.1533203125, 0.1663818359375, 0.2001953125, 0.157958984375, ...

embed

75504810_c0

75504810

haskell

0

Title: Using function arguments in Haskell for the Newton-Raphson method Problem title: Using function arguments in Haskell for the Newton-Raphson method Tags: newtons-method, haskell, function, functional-programming Problem: Using function arguments in Haskell for the Newton-Raphson method I need to write a Haskell f...

Using function arguments in Haskell for the Newton-Raphson method Using function arguments in Haskell for the Newton-Raphson method newtons-method haskell function functional-programming a Using Haskell Newton-Raphson Show Double Using function arguments in Haskell for the Newton-Raphson method I need to write a Haskel...

[ -0.00543212890625, 0.0201416015625, 0.005126953125, -0.0020599365234375, 0.0244140625, 0.0230712890625, 0.0152587890625, -0.00543212890625, -0.015625, -0.005096435546875, 0.0019378662109375, -0.0089111328125, -0.006256103515625, 0.0057373046875, 0.007293701171875, 0.00628662109375, 0...

[ 345, 6953, 32354, 10750, 7, 23, 20625, 142508, 100, 145076, 9, 12248, 11727, 1681, 55300, 3525, 67772, 1928, 7352, 1556, 123309, 28966, 17367, 107172, 87, 3871, 33022, 103608, 234873, 390, 452, 6863, 30057, 136, 61475, 6275, 425, 77495, 237...

[ 0.132080078125, 0.0250091552734375, 0.2308349609375, 0.277587890625, 0.0880126953125, 0.046417236328125, 0.1571044921875, 0.26025390625, 0.054779052734375, 0.183349609375, 0.04443359375, 0.08502197265625, 0.1424560546875, 0.1678466796875, 0.15771484375, 0.051666259765625, 0.142822265...

embed

48013693_c0

48013693

haskell

0

Title: Strange stack bash error: --: command not found Problem title: Strange stack bash error: --: command not found Tags: bash, haskell-stack, haskell Problem: Strange stack bash error: --: command not found I have very simple haskell project with only executable my-exec . All it does is printing "Hello, world!" to c...

Strange stack bash error: --: command not found Strange stack bash error: --: command not found bash haskell-stack haskell Strange setup.sh Echo Hello Strange stack bash error: --: command not found I have very simple haskell project with only executable my-exec . All it does is printing "Hello, world!" to console. I w...

[ -0.00506591796875, -0.0023345947265625, -0.0004329681396484375, 0.021240234375, 0.00064849853515625, 0.0159912109375, -0.0169677734375, -0.01220703125, -0.00185394287109375, -0.00970458984375, 0.001556396484375, 0.0162353515625, 0.0294189453125, -0.006256103515625, -0.00125885009765625, ...

[ 187791, 177261, 87109, 18499, 4210, 75101, 959, 14037, 1556, 142508, 590, 2594, 169581, 1495, 3089, 35378, 8781, 13452, 4734, 71924, 2886, 759, 46480, 238, 2448, 841, 13817, 4, 8999, 3890, 47, 130250, 3444, 28282, 26499, 11435, 2394, 3509, ...

[ 0.273193359375, 0.25830078125, 0.1751708984375, 0.1640625, 0.0203704833984375, 0.260986328125, 0.158935546875, 0.2293701171875, 0.1129150390625, 0.1837158203125, 0.115478515625, 0.1337890625, 0.2344970703125, 0.134033203125, 0.1964111328125, 0.1883544921875, 0.057861328125, 0.07708...

embed

68331980_c0

68331980

haskell

0

Title: Is there a better way to write this haskell function? Problem title: Is there a better way to write this haskell function? Tags: functor, haskell, monads Problem: Is there a better way to write this haskell function? I just started learning Haskell again (i've already tried a few times) and i wrote a little func...

Is there a better way to write this haskell function? Is there a better way to write this haskell function? functor haskell monads Some Nothing URL FilePath Maybe Just Is there a better way to write this haskell function? I just started learning Haskell again (i've already tried a few times) and i wrote a little functi...

[ -0.03125, -0.010986328125, 0.0289306640625, -0.0040283203125, 0.01080322265625, 0.00469970703125, 0.0021514892578125, -0.02001953125, -0.001129150390625, 0.00836181640625, -0.0098876953125, -0.03173828125, -0.01043701171875, 0.00347900390625, 0.00091552734375, 0.00147247314453125, -0...

[ 2071, 2685, 11522, 3917, 47, 33022, 903, 1556, 142508, 32354, 7477, 18770, 2667, 712, 7, 31384, 182747, 31862, 42724, 683, 10519, 83425, 9563, 52080, 20625, 13438, 37842, 54397, 10176, 134598, 7026, 11435, 34475, 128405, 4263, 83, 5608, 2174,...

[ 0.001495361328125, 0.0212554931640625, 0.142822265625, 0.10546875, 0.0170745849609375, 0.1865234375, 0.110595703125, 0.1708984375, 0.259521484375, 0.2066650390625, 0.1424560546875, 0.19287109375, 0.1185302734375, 0.1484375, 0.075439453125, 0.1903076171875, 0.1939697265625, 0.219238...

embed

51863338_c0

51863338

haskell

0

Title: Evaluation of a function in other functions with same parameters in Haskell Problem title: Evaluation of a function in other functions with same parameters in Haskell Tags: haskell Problem: Evaluation of a function in other functions with same parameters in Haskell Consider the toy example below: someNum :: Int ...

Evaluation of a function in other functions with same parameters in Haskell Evaluation of a function in other functions with same parameters in Haskell haskell Evaluation Haskell func1 func2 Evaluation of a function in other functions with same parameters in Haskell Consider the toy example below: The same arguments fu...

[ 0.000492095947265625, 0.0002803802490234375, 0.01123046875, 0.013916015625, 0.01409912109375, 0.0011444091796875, -0.004241943359375, -0.00787353515625, 0.0087890625, -0.0091552734375, -0.0238037109375, -0.00225830078125, 0.0198974609375, 0.013916015625, 0.002227783203125, -0.011901855...

[ 151228, 1363, 32354, 23, 3789, 678, 5701, 171859, 20625, 142508, 1556, 7477, 418, 238, 304, 72713, 27781, 10750, 10770, 3796, 3060, 839, 316, 190659, 16648, 159978, 84797, 12921, 159029, 5941, 20028, 20653, 151575, 297, 16750, 456, 33740, 473...

[ 0.20849609375, 0.03424072265625, 0.158203125, 0.06317138671875, 0.0936279296875, 0.02764892578125, 0.12353515625, 0.149169921875, 0.12060546875, 0.2342529296875, 0.10302734375, 0.096923828125, 0.052703857421875, 0.0350341796875, 0.14453125, 0.1475830078125, 0.07366943359375, 0.1574...

embed

7086668_c1

7086668

haskell

1

to find the supporting framework for this collection of functions? This leads to an even more general question: How much of Haskell is supported by Haskell itself, through type and function definitions, declarations etc; and how much is supported by the compiler/implementation? (I am aware that GHC was written in Hask...

[ 0.0113525390625, 0.006805419921875, 0.00787353515625, 0.022705078125, -0.01953125, 0.0113525390625, -0.0128173828125, -0.020751953125, -0.000827789306640625, -0.0040283203125, -0.001190185546875, -0.032958984375, -0.002838134765625, -0.01324462890625, 0.00994873046875, 0.0074462890625,...

[ 7413, 8060, 214, 170846, 903, 42486, 32354, 4537, 11249, 5045, 111, 20625, 142508, 297, 68034, 10644, 80934, 21635, 3642, 9969, 34759, 197648, 527, 73265, 59121, 23, 32997, 5570, 35773, 10484, 479, 822, 112, 54, 26818, 61585, 49649, 7722, 4...

[ 0.08197021484375, 0.19580078125, 0.046234130859375, 0.1551513671875, 0.04541015625, 0.11767578125, 0.174560546875, 0.005126953125, 0.0190277099609375, 0.0936279296875, 0.012115478515625, 0.1778564453125, 0.26611328125, 0.0750732421875, 0.06927490234375, 0.116455078125, 0.069396972656...

embed

7574354_c1

7574354

haskell

1

constructor in Term with basically the same semantics as Predicate . It's just like solution 1 with two predicate constructors for terms. One is recursion-enabled, Struct , and the other one, Predicate is to be able to distinguish between predicates and regular terms. The problem with this try is that Struct and Predi...

[ -0.004302978515625, 0.0264892578125, -0.0130615234375, 0.0120849609375, 0.000545501708984375, 0.015869140625, 0.0033111572265625, -0.00045013427734375, 0.003265380859375, -0.031494140625, 0.00775146484375, -0.0103759765625, -0.002777099609375, -0.0147705078125, -0.007080078125, 0.02465...

[ 64549, 748, 23, 2994, 39, 198343, 5701, 484, 109109, 7145, 2063, 67, 29806, 6626, 1653, 25251, 69407, 195625, 1830, 33, 2886, 63667, 15390, 136, 19048, 157167, 1495, 17721, 1636, 20324, 2967, 9790, 118990, 183234, 39555, 91084, 33022, 32354, ...

[ 0.208251953125, 0.151123046875, 0.035369873046875, 0.178466796875, 0.10400390625, 0.0308990478515625, 0.08349609375, 0.0633544921875, 0.10040283203125, 0.1951904296875, 0.2236328125, 0.1380615234375, 0.1187744140625, 0.060577392578125, 0.1973876953125, 0.14404296875, 0.2314453125, ...

embed